{"total":20,"rows":[{"id":"2510.03199","title":"Best-of-Majority: Minimax-Optimal Strategy for Pass@$k$ Inference Scaling","created":"2025-10-03","cited_by_count":9,"area":null},{"id":"2510.15464","title":"Learning to Answer from Correct Demonstrations","created":"2025-10-17","cited_by_count":7,"area":null},{"id":"2510.00931","title":"Making, not Taking, the Best of N","created":"2025-10-01","cited_by_count":6,"area":null},{"id":"2604.16453","title":"Sampling for Quality: Training-Free Reward-Guided LLM Decoding via Sequential Monte Carlo","created":"2026-04-07","cited_by_count":5,"area":null},{"id":"2509.21091","title":"Best-of-$\\infty$ -- Asymptotic Performance of Test-Time LLM Ensembling","created":"2025-09-25","cited_by_count":3,"area":null},{"id":"2602.21556","title":"Power and Limitations of Aggregation in Compound AI Systems","created":"2026-02-25","cited_by_count":1,"area":null},{"id":"2608.21496","title":"The geometry of AI validation: From structural blindness to reusable audits","created":"2026-08-21","cited_by_count":1,"area":null},{"id":"2505.17288","title":"Learning to Choose or Choosing to Learn: Best-of-N vs. Supervised Fine-Tuning for Bit String Generation","created":"2025-05-22","cited_by_count":0,"area":null},{"id":"2508.16420","title":"Hybrid Sequence Modeling and Reinforced Verification for Controllable Target-Conditioned Decision Making","created":"2025-08-22","cited_by_count":0,"area":null},{"id":"2602.07738","title":"Learnable Chernoff Baselines for Inference-Time Alignment","created":"2026-02-08","cited_by_count":0,"area":null},{"id":"2602.23535","title":"Partition Function Estimation under Bounded f-Divergence","created":"2026-02-26","cited_by_count":0,"area":null},{"id":"2604.04855","title":"The Role of Generator Access in Autoregressive Post-Training","created":"2026-04-06","cited_by_count":0,"area":null},{"id":"2605.30131","title":"CCS: Clinical Consensus Selection for Radiology Report Generation","created":"2026-05-28","cited_by_count":0,"area":null},{"id":"2608.24228","title":"Evaluating Multiple LLM Generations with Validated Task Coverage","created":"2026-08-25","cited_by_count":0,"area":null},{"id":"2609.14500","title":"When does a scaling result justify a different allocation? A critical review of resource-allocation evidence for AI systems","created":"2026-09-13","cited_by_count":0,"area":null},{"id":"2609.34639","title":"Uniform Race: Parameter-Free Approximate Rejection Sampling","created":"2026-09-28","cited_by_count":0,"area":null},{"id":"2610.08138","title":"Test-Time Agent Evolution for Long-Horizon Legal Reasoning","created":"2026-10-06","cited_by_count":0,"area":null},{"id":"2610.08719","title":"Holdout Best-of-N: Unbiased Evaluation and Its Cost","created":"2026-10-06","cited_by_count":0,"area":null},{"id":"2610.12851","title":"Universal Bounds for Self-Normalized Kullback-Leibler Estimation","created":"2026-10-09","cited_by_count":0,"area":null},{"id":"2610.15372","title":"Fewer Bits, More Tries: Recovering Capability Under Memory Constraints","created":"2026-10-11","cited_by_count":0,"area":null}],"next_cursor":null}