3 citations · 5 across the 4 of their papers we have counts for
4 papers
One Step Forward and K Steps Back: Better Reasoning with Denoising Recursion Models
Chris Cameron, Wangzheng Wang, Nikita Ivanov +3
Looped transformers scale computational depth without increasing parameter count by repeatedly applying a shared transformer block and can be used for iterative refinement, where e…
UNSAT Solver Synthesis via Monte Carlo Forest Search
Chris Cameron, Jason Hartford, Taylor Lundy +4
We introduce Monte Carlo Forest Search (MCFS), a class of reinforcement learning (RL) algorithms for learning policies in {tree MDPs}, for which policy execution involves traversin…
Matching Papers and Reviewers at Large Conferences
Kevin Leyton-Brown, Mausam, Yatin Nandwani +4
Peer-reviewed conferences, the main publication venues in CS, rely critically on matching highly qualified reviewers for each paper. Because of the growing scale of these conferenc…
The Perils of Learning Before Optimizing
Chris Cameron, Jason Hartford, Taylor Lundy +1
Formulating real-world optimization problems often begins with making predictions from historical data (e.g., an optimizer that aims to recommend fast routes relies upon travel-tim…