arXiv: cs.AI preprintsInternational19 November 2026
Learning Stratified Policies for Inference-Time Objectives
This is an official announcement record
Firsthand records what arXiv: cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2611.23154v1 Announce Type: cross Abstract: Inference-time scaling improves the performance of large language models by sampling multiple responses and evaluating their collective utility. However, many existing approaches obtain these samples by repeatedly sampling from a single policy. In this work, we study if the sample budget at inference time can instead be allocated across a population of policies. We introduce stratified policies, where each of $k$ learned policies contributes one response to a $k$-sample inference-time objective. We realize this policy population using separate
Read the official announcement
Opens arxiv.org
More from arXiv: cs.AI preprints
- Human-AI Mutualism Is Unstable under Capability Asymmetry20 November 2026
- Training Language Models for Introspective Oversight20 November 2026
- Where the Tokens Go: Heat, Entropy and Error in Agentic Coding20 November 2026
- HardwareDx: A Foundational Graph Model System for Datacenter Machine Repairs20 November 2026
- RFBench: A Simulator-Grounded Multimodal Benchmark for Passive RF Layout Design and Understanding20 November 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.