{"total":22,"rows":[{"id":"2410.20290","title":"Fast Best-of-N Decoding via Speculative Rejection","created":"2024-10-26","cited_by_count":112,"area":null},{"id":"2506.22716","title":"BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute","created":"2025-06-28","cited_by_count":67,"area":null},{"id":"2504.13139","title":"Syntactic and Semantic Control of Large Language Models via Sequential Monte Carlo","created":"2025-04-17","cited_by_count":46,"area":null},{"id":"2505.20674","title":"PonderLM: Pretraining Language Models to Ponder in Continuous Space","created":"2025-05-27","cited_by_count":44,"area":null},{"id":"2410.05495","title":"Self-rationalization improves LLM as a fine-grained judge","created":"2024-10-07","cited_by_count":27,"area":null},{"id":"2510.23393","title":"The Best of N Worlds: Aligning Reinforcement Learning with Best-of-N Sampling via max@k Optimisation","created":"2025-10-27","cited_by_count":16,"area":null},{"id":"2605.22817","title":"Vector Policy Optimization: Training for Diversity Improves Test-Time Search","created":"2026-05-21","cited_by_count":8,"area":null},{"id":"2505.00147","title":"AdaptMI: Adaptive Skill-based In-context Math Instruction for Small Language Models","created":"2025-04-30","cited_by_count":5,"area":null},{"id":"2508.01174","title":"RSPO: Risk-Seeking Policy Optimization for Pass@k and Max@k Metrics in Large Language Models","created":"2025-08-02","cited_by_count":5,"area":null},{"id":"2510.03777","title":"GuidedSampling: Steering LLMs Towards Diverse Candidate Solutions at Inference-Time","created":"2025-10-04","cited_by_count":5,"area":null},{"id":"2501.15631","title":"BoKDiff: Best-of-K Diffusion Alignment for Target-Specific 3D Molecule Generation","created":"2025-01-26","cited_by_count":3,"area":null},{"id":"2502.10505","title":"Preference learning made easy: Everything should be understood through win rate","created":"2025-02-14","cited_by_count":3,"area":null},{"id":"2510.27206","title":"Fints: Efficient Inference-Time Personalization for LLMs with Fine-Grained Instance-Tailored Steering","created":"2025-10-31","cited_by_count":2,"area":null},{"id":"2604.12196","title":"Beyond Majority Voting: Efficient Best-Of-N with Radial Consensus Score","created":"2026-04-14","cited_by_count":2,"area":null},{"id":"2604.20623","title":"RSRCC: A Remote Sensing Regional Change Comprehension Benchmark Constructed via Retrieval-Augmented Best-of-N Ranking","created":"2026-04-22","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":"2507.14200","title":"A Scalable Multi-LLM Collaboration System with Retrieval-based Selection and Exploration-Exploitation-Driven Enhancement","created":"2025-07-14","cited_by_count":0,"area":null},{"id":"2508.10030","title":"Inference-Aware Prompt Optimization for Aligning Black-Box Large Language Models","created":"2025-08-08","cited_by_count":0,"area":null},{"id":"2509.07909","title":"Uncovering Scaling Laws for Large Language Models via Inverse Problems","created":"2025-09-09","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":"2609.39055","title":"The Missing Coefficients: Bayesian Pairwise Merging for Model Personalization","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.14970","title":"FleetPilot: Fine-Grained Steering Empowers Real-World LLM Personalization","created":"2026-10-10","cited_by_count":0,"area":null}],"next_cursor":null}