Search Results for author:
Found 4 papers, 1 papers with code
Invalid Logic, Equivalent Gains: The Bizarreness of Reasoning in Language Model Prompting
We find that the logically \textit{invalid} reasoning prompts do indeed achieve similar performance gains on BBH tasks as logically valid reasoning prompts.
Lower Bounds for Policy Iteration on Multi-action MDPs
An important theoretical question is how many iterations a specified PI variant will take to terminate as a function of the number of states $n$ and the number of actions $k$ in the input MDP.
A Compressed Sensing Approach to Pooled RT-PCR Testing for COVID-19 Detection
Tapestry combines ideas from compressed sensing and combinatorial group testing with a novel noise model for RT-PCR used for generation of synthetic data.
Analysis of Lower Bounds for Simple Policy Iteration
We generalize the previous result and prove a novel exponential lower bound on the number of iterations taken by policy iteration for $N-$state, $k-$action MDPs.
