{"total":28,"rows":[{"id":"2406.16838","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","created":"2024-06-24","cited_by_count":137,"area":null},{"id":"2310.12963","title":"AutoMix: Automatically Mixing Language Models","created":"2023-10-19","cited_by_count":125,"area":null},{"id":"2308.09138","title":"Semantic Consistency for Assuring Reliability of Large Language Models","created":"2023-08-17","cited_by_count":15,"area":null},{"id":"2602.03845","title":"Parallel-Probe: Towards Efficient Parallel Thinking via 2D Probing","created":"2026-02-03","cited_by_count":14,"area":null},{"id":"2502.15924","title":"Improving Consistency in Large Language Models through Chain of Guidance","created":"2025-02-21","cited_by_count":13,"area":null},{"id":"2510.13855","title":"Harnessing Consistency for Robust Test-Time LLM Ensemble","created":"2025-10-12","cited_by_count":10,"area":null},{"id":"2602.05395","title":"Optimal Bayesian Stopping for Efficient Inference of Consistent LLM Answers","created":"2026-02-05","cited_by_count":8,"area":null},{"id":"2507.15025","title":"Survey of GenAI for Automotive Software Development: From Requirements to Executable Code","created":"2025-07-20","cited_by_count":5,"area":null},{"id":"2606.00920","title":"How Much Can Repeated Running Buy? A Measured Variance Ceiling for LLM Code Evaluation","created":"2026-05-30","cited_by_count":5,"area":null},{"id":"2409.07131","title":"Reranking Laws for Language Generation: A Communication-Theoretic Perspective","created":"2024-09-11","cited_by_count":4,"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":"2507.03038","title":"Cautious Next Token Prediction","created":"2025-07-03","cited_by_count":2,"area":null},{"id":"2602.18292","title":"Decoding as Optimisation on the Probability Simplex: From Top-K to Top-P (Nucleus) to Best-of-K Samplers","created":"2026-02-20","cited_by_count":2,"area":null},{"id":"2606.08098","title":"When Does Delegation Beat Majority? A Delegation-Based Aggregator for Multi-Sample LLM Inference","created":"2026-06-06","cited_by_count":1,"area":null},{"id":"2606.19636","title":"Hard or Just Unreached? Diagnosing the Sampling Blind Spot in Math-Reasoning Difficulty Estimation","created":"2026-06-17","cited_by_count":1,"area":null},{"id":"2607.03991","title":"Knowing When to Stop: Predicting Execution-Consistency Convergence in Text-to-SQL","created":"2026-07-04","cited_by_count":1,"area":null},{"id":"2607.08665","title":"Resample or Reroute? Recoverable Stopping Debt Without Identified Action Selection","created":"2026-07-09","cited_by_count":1,"area":null},{"id":"2507.16727","title":"Deliberative Searcher: Improving LLM Reliability via Reinforcement Learning with constraints","created":"2025-07-22","cited_by_count":0,"area":null},{"id":"2602.19385","title":"Adaptive Data Augmentation with Multi-armed Bandit: Sample-Efficient Embedding Calibration for Implicit Pattern Recognition","created":"2026-02-22","cited_by_count":0,"area":null},{"id":"2605.30465","title":"Knowledge Graph-Enhanced Zero-Shot Topic Classification: A Multi-Strategy Comparative Study","created":"2026-05-28","cited_by_count":0,"area":null},{"id":"2606.08245","title":"ZAS-SQL: Distilling Rules from Failures for Zero-Shot Text-to-SQL","created":"2026-06-06","cited_by_count":0,"area":null},{"id":"2608.15565","title":"Admission Without Answers: Label-Free Certification and Experience Learning for LLM-Based Optimization Modeling","created":"2026-08-16","cited_by_count":0,"area":null},{"id":"2609.09989","title":"Stable Answers, Unfinished Reasoning: Why Self-Consensus Is Not a Safe Early-Exit Signal","created":"2026-09-09","cited_by_count":0,"area":null},{"id":"2609.21813","title":"How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing","created":"2026-09-18","cited_by_count":0,"area":null},{"id":"2609.34590","title":"The Model Knows When to Stop: Training-Free Early Stopping for Long-Context Reading","created":"2026-09-28","cited_by_count":0,"area":null},{"id":"2609.37493","title":"Risk-Controlled Selective LLM Answering by Pricing Label-Free Checks","created":"2026-09-27","cited_by_count":0,"area":null},{"id":"2610.01110","title":"How Much Can Language Models Gain from Test-Time Computation?","created":"2026-10-01","cited_by_count":0,"area":null},{"id":"2610.01140","title":"ReSolve: Reusing Candidate Reasoning through Selective Generative Moderation","created":"2026-10-01","cited_by_count":0,"area":null}],"next_cursor":null}