2FFS Accepted at NeurIPS 2026: Multi-Fidelity Bandits Rework Monte-Carlo Tree Search
burny_tech · x · 2026-10-01
A new tree search algorithm, 2FFS, has been accepted at NeurIPS 2026. It combines multi-fidelity bandits to resolve the fundamental MCTS trade-off: cheaper approximated evaluations versus expensive but accurate sampling.
More from Research
- Factorizing attention matrices rewires gradient flow, destroying an information-exponent bottleneck — burny_tech · 2026-10-01
- Tsinghua and Stanford locate a reward subsystem in LLMs with value and dopamine neurons — jiqizhixin · 2026-10-01
- Researcher teases 'interp exponential': wave of interpretability papers coming in weeks — burny_tech · 2026-10-01
- DerivAudit: 17-21% of long-term agent memories unsupported by interaction history — newyorkuniversity · 2026-10-01
- VoxParity benchmark: only 11 of 23 voice agents act on what they hear, not just read — Bhavik Mangla · 2026-10-01
- CASCADE filters genetic variants through four questions; the 3% that pass are twice as GWAS-enriched — anshulkundaje · 2026-10-01