{"total":45,"rows":[{"id":"2410.01679","title":"VinePPO: Refining Credit Assignment in RL Training of LLMs","created":"2024-10-02","cited_by_count":183,"area":null},{"id":"2412.00154","title":"o1-Coder: an o1 Replication for Coding","created":"2024-11-29","cited_by_count":78,"area":null},{"id":"2411.01679","title":"Autoformulation of Mathematical Optimization Models Using LLMs","created":"2024-11-03","cited_by_count":48,"area":null},{"id":"2310.09044","title":"KCTS: Knowledge-Constrained Tree Search Decoding with Token-Level Hallucination Detection","created":"2023-10-13","cited_by_count":45,"area":null},{"id":"2401.02500","title":"On the Prospects of Incorporating Large Language Models (LLMs) in Automated Planning and Scheduling (APS)","created":"2024-01-04","cited_by_count":40,"area":null},{"id":"2407.00320","title":"LiteSearch: Efficacious Tree Search for LLM","created":"2024-06-29","cited_by_count":31,"area":null},{"id":"2410.07927","title":"Efficient Reinforcement Learning with Large Language Model Priors","created":"2024-10-10","cited_by_count":30,"area":null},{"id":"2510.02263","title":"RLAD: Training LLMs to Discover Abstractions for Solving Reasoning Problems","created":"2025-10-02","cited_by_count":21,"area":null},{"id":"2604.19341","title":"Structured Scaling of AI Discovery Across Diverse Scientific Domains","created":"2026-04-21","cited_by_count":21,"area":null},{"id":"2602.01601","title":"Adaptive Rollout Allocation for Online Reinforcement Learning with Verifiable Rewards","created":"2026-02-02","cited_by_count":17,"area":null},{"id":"2406.01124","title":"Latent Logic Tree Extraction for Event Sequence Explanation from LLMs","created":"2024-06-03","cited_by_count":9,"area":null},{"id":"2502.16706","title":"DISC: Dynamic Decomposition Improves LLM Inference Scaling","created":"2025-02-23","cited_by_count":9,"area":null},{"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":"2602.12966","title":"ProbeLLM: Automating Principled Diagnosis of LLM Failures","created":"2026-02-13","cited_by_count":9,"area":null},{"id":"2504.02327","title":"LearNAT: Learning NL2SQL with AST-guided Task Decomposition for Large Language Models","created":"2025-04-03","cited_by_count":8,"area":null},{"id":"2405.01453","title":"Creative Problem Solving in Large Language and Vision Models -- What Would it Take?","created":"2024-05-02","cited_by_count":7,"area":null},{"id":"2410.06392","title":"Counterfactual Causal Inference in Natural Language with Large Language Models","created":"2024-10-08","cited_by_count":7,"area":null},{"id":"2503.17195","title":"TreeSynth: Synthesizing Diverse Data from Scratch via Tree-Guided Subspace Partitioning","created":"2025-03-21","cited_by_count":7,"area":null},{"id":"2410.20215","title":"DAWN-ICL: Strategic Planning of Problem-solving Trajectories for Zero-Shot In-Context Learning","created":"2024-10-26","cited_by_count":6,"area":null},{"id":"2410.21236","title":"Flaming-hot Initiation with Regular Execution Sampling for Large Language Models","created":"2024-10-28","cited_by_count":6,"area":null},{"id":"2511.16077","title":"VideoSeg-R1:Reasoning Video Object Segmentation via Reinforcement Learning","created":"2025-11-20","cited_by_count":6,"area":null},{"id":"2605.02427","title":"The Model Knows, the Decoder Finds: Future Value Guided Particle Power Sampling","created":"2026-05-04","cited_by_count":6,"area":null},{"id":"2503.07545","title":"Queueing, Predictions, and LLMs: Challenges and Open Problems","created":"2025-03-10","cited_by_count":5,"area":null},{"id":"2601.04611","title":"Character-R1: Enhancing Role-Aware Reasoning in Role-Playing Agents via RLVR","created":"2026-01-08","cited_by_count":5,"area":null},{"id":"2502.18387","title":"How Far are LLMs from Real Search? A Comprehensive Study on Efficiency, Completeness, and Inherent Capabilities","created":"2025-02-25","cited_by_count":4,"area":null},{"id":"2412.06229","title":"LLMs as Debate Partners: Utilizing Genetic Algorithms and Adversarial Search for Adaptive Arguments","created":"2024-12-09","cited_by_count":3,"area":null},{"id":"2504.16760","title":"Lightweight Latent Verifiers for Efficient Meta-Generation Strategies","created":"2025-04-23","cited_by_count":3,"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":"2512.00672","title":"ML-Tool-Bench: Tool-Augmented Planning for ML Tasks","created":"2025-11-29","cited_by_count":3,"area":null},{"id":"2602.02416","title":"Structure Enables Effective Self-Localization of Errors in LLMs","created":"2026-02-02","cited_by_count":3,"area":null},{"id":"2505.20120","title":"Agents Require Metacognitive and Strategic Reasoning to Succeed in the Coming Labor Markets","created":"2025-05-26","cited_by_count":2,"area":null},{"id":"2509.17192","title":"Shall We Play a Game? Language Models for Open-ended Wargames","created":"2025-09-21","cited_by_count":2,"area":null},{"id":"2509.26435","title":"Adaptive Planning for Multi-Attribute Controllable Summarization with Monte Carlo Tree Search","created":"2025-09-30","cited_by_count":2,"area":null},{"id":"2602.14083","title":"Plan-MCTS: Plan Exploration for Action Exploitation in Web Navigation","created":"2026-02-15","cited_by_count":2,"area":null},{"id":"2505.01449","title":"COSMOS: Predictable and Cost-Effective Adaptation of LLMs","created":"2025-04-30","cited_by_count":1,"area":null},{"id":"2608.28639","title":"Reward-Oracle MCTS for Formal Theorem Proving: Sample-Efficient Search and the Need for Kernel-Level Proof Auditing","created":"2026-08-11","cited_by_count":1,"area":null},{"id":"2409.15867","title":"In-Context Ensemble Learning from Pseudo Labels Improves Video-Language Models for Low-Level Workflow Understanding","created":"2024-09-24","cited_by_count":0,"area":null},{"id":"2503.01804","title":"$\\texttt{SEM-CTRL}$: Semantically Controlled Decoding","created":"2025-03-03","cited_by_count":0,"area":null},{"id":"2601.22600","title":"An Efficient Algorithm for Thresholding Monte Carlo Tree Search","created":"2026-01-30","cited_by_count":0,"area":null},{"id":"2604.14345","title":"PAC-CF: Calibrating Irreversible Frontier Pruning in LLM-Guided Search","created":"2026-04-15","cited_by_count":0,"area":null},{"id":"2604.23989","title":"Understanding Scattered Forest Search: A Version-Space Perspective on Multi-Turn Program Correction","created":"2026-04-27","cited_by_count":0,"area":null},{"id":"2605.08982","title":"Particle Monte Carlo Tree Search","created":"2026-05-09","cited_by_count":0,"area":null},{"id":"2607.02390","title":"DecompRL: Solving Harder Problems by Learning Modular Code Generation","created":"2026-07-02","cited_by_count":0,"area":null},{"id":"2609.40035","title":"OPTS-TTPO: Enhancing Finite-Sample Policy-Gradient Learning with Tree Search","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.13925","title":"Can machines reason non-verbally?","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}