LAND: Learning an Adaptive Number of Draws for Bayesian Best-of-N Selection
Inference-side entry: per-input sample counts instead of a fixed N.
3 items · 2 sources · 3 days
Operational story trace
Follow in this browser to see new updates on your Live feed.
Latest change
A Nov 9 theory paper shows adaptive quantization keeps TD learning's fast convergence rate even when an agent's updates cross a rate-limited channel.
This is not one developing event: three unrelated arXiv papers share the word "adaptive" and one idea, spending scarce resources where they help most. LAND (Nov 2) varies Best-of-N draws per input, and ASP (Nov 6) schedules RL rollouts to cut idle GPU time.
Arc
Inference-side entry: per-input sample counts instead of a fixed N.
Training-side entry: rollout scheduling for asynchronous RL of LLMs.
Theory entry: convergence guarantee under a communication budget.
Inference-side entry: per-input sample counts instead of a fixed N.
Training-side entry: rollout scheduling for asynchronous RL of LLMs.
Theory entry: convergence guarantee under a communication budget.
What to watch — open questions
Storylines are threaded mechanically from the feed: stories that share a distinctive anchor across multiple days and sources. Each item links to its original source. The evidence trace, current state, and open questions are written by the editor routine and refreshed whenever a new beat lands.