数学推理论文趋势 2023–2026

定理与解题

统计范围:NeurIPS、ICLR、ICML、CVPR 四个会议,2023–2026 年,共 1,085 篇被归入该主题的论文。

主要结论

每年论文数

各会议论文数

按年份和会议统计

数学推理论文数,按年份和会议
年份NeurIPSICLRICMLCVPR合计
20231917111057
202452343912137
2025190614518314
202620817511381577

代表论文

按年份和会议均匀挑选,方便快速看到每一届的样貌

全部数学推理论文

共 175 篇,第 3 / 4 页

  1. ICLR 2026Parallel-R1: Towards Parallel Thinking via Reinforcement Learning
  2. ICLR 2026Patching Gaps In LLM Reasoning With Interventional Training
  3. ICLR 2026PEAR: Phase Entropy Aware Reward for Efficient Reasoning
  4. ICLR 2026Plan and Budget: Effective and Efficient Test-Time Scaling on Reasoning Large Language Models
  5. ICLR 2026Premise Selection for a Lean Hammer
  6. ICLR 2026PRISM-Physics: Causal DAG-Based Process Evaluation for Physics Reasoning
  7. ICLR 2026ProofBridge: Auto-Formalization of Natural Language Proofs in Lean via Joint Embeddings
  8. ICLR 2026ProofOptimizer: Training Language Models to Simplify Proofs without Human Demonstrations
  9. ICLR 2026PROS: Towards Compute-Efficient RLVR via Rollout Prefix Reuse
  10. ICLR 2026Pruning Long Chain-of-Thought of Large Reasoning Models via Small-Scale Preference Optimization
  11. ICLR 2026Pushing on Multilingual Reasoning Models with Language-Mixed Chain-of-Thought
  12. ICLR 2026QuestA: Expanding Reasoning Capacity in LLMs via Question Augmentation
  13. ICLR 2026R-Horizon: How Far Can Your Large Reasoning Model Really Go in Breadth and Depth?
  14. ICLR 2026R-Zero: Self-Evolving Reasoning LLM from Zero Data
  15. ICLR 2026RADAR: Reasoning–Ability and Difficulty-Aware Routing in Language Models
  16. ICLR 2026RAIN-Merging: A Gradient-Free Method to Enhance Instruction Following in Large Reasoning Models with Preserved Thinking Format
  17. ICLR 2026Random Policy Valuation is Enough for LLM Reasoning with Verifiable Rewards
  18. ICLR 2026Real-Time Reasoning Agents in Evolving Environments
  19. ICLR 2026Reasoning in Space via Grounding in the World
  20. ICLR 2026Reasoning Language Model Inference Serving Unveiled: An Empirical Study
  21. ICLR 2026Reasoning Models Can be Accurately Pruned Via Chain-of-Thought Reconstruction
  22. ICLR 2026Reasoning Scaffolding: Distilling the Flow of Thought from LLMs
  23. ICLR 2026ReForm: Reflective Autoformalization with Prospective Bounded Sequence Optimization
  24. ICLR 2026Reinforced Latent Reasoning for LLM-based Recommendation
  25. ICLR 2026Reinforcement Mid-Training
  26. ICLR 2026Reliable Fine-Grained Evaluation of Natural Language Math Proofs
  27. ICLR 2026Rethinking LLM Reasoning: From Explicit Trajectories to Latent Representations
  28. ICLR 2026Rewriting Pre-Training Data Boosts LLM Performance in Math and Code
  29. ICLR 2026RFEval: Benchmarking Reasoning Faithfulness under Counterfactual Reasoning Intervention in Large Reasoning Models
  30. ICLR 2026RLAD: Training LLMs to Discover Abstractions for Solving Reasoning Problems
  31. ICLR 2026RLP: Reinforcement as a Pretraining Objective
  32. ICLR 2026RLVMR: Reinforcement Learning with Verifiable Meta-Reasoning Rewards for Robust Long-Horizon Agents
  33. ICLR 2026RM-R1: Reward Modeling as Reasoning
  34. ICLR 2026Sample Smart, Not Hard: Correctness-First Decoding for Better Reasoning in LLMs
  35. ICLR 2026Scaf-GRPO: Scaffolded Group Relative Policy Optimization for Enhancing LLM Reasoning
  36. ICLR 2026Scalable Chain of Thoughts via Elastic Reasoning
  37. ICLR 2026Scheduling Your LLM Reinforcement Learning with Reasoning Trees
  38. ICLR 2026Segment-Level Attribution for Selective Learning of Long Reasoning Traces
  39. ICLR 2026Selection, Reflection and Self-Refinement: Revisit Reasoning Tasks via a Causal Lens
  40. ICLR 2026Self-Jailbreaking: Language Models Can Reason Themselves Out of Safety Alignment After Benign Reasoning Training
  41. ICLR 2026Self-Refining Vision Language Model for Robotic Failure Detection and Reasoning
  42. ICLR 2026SIM-CoT: Supervised Implicit Chain-of-Thought
  43. ICLR 2026SLM-MUX: Orchestrating Small Language Models for Reasoning
  44. ICLR 2026Slow-Fast Policy Optimization: Reposition-Before-Update for LLM Reasoning
  45. ICLR 2026Smarter Not Harder: Generative Process Evaluation with Intrinsic-Signal Driving and Ability‑Adaptive Reward Shaping
  46. ICLR 2026Soft Tokens, Hard Truths
  47. ICLR 2026Solving the 2-norm k-hyperplane clustering problem via multi-norm formulations
  48. ICLR 2026Stabilizing Policy Gradients for Sample-Efficient Reinforcement Learning in LLM Reasoning
  49. ICLR 2026STITCH: Simultaneous Thinking and Talking with Chunked Reasoning for Spoken Language Models
  50. ICLR 2026Strategic Obfuscation of Deceptive Reasoning in Language Models

在 Claude、Cursor 里直接问这个趋势

接上 Paperlist MCP 后,写综述、挑方向或准备投稿时,不用离开对话框就能拿到这页的数字:每年各会议的论文数、增长倍数、涨得最快的子方向和代表论文,AI 会按你的问题整理。

可以直接复制这句话问 AI

用 paperlist 查数学推理在 NeurIPS 2023–2026 的论文趋势,哪一年涨得最快?

AI 会调用的工具:get_topic_stats {"topic": "math-reasoning"}

两分钟接入 Paperlist MCP(Claude Code、Cursor、Codex、ChatGPT)

常见问题

2023–2026 年四大会议一共有多少篇数学推理论文?
共 1,085 篇,按年份分别是 2023 年 57 篇、2024 年 137 篇、2025 年 314 篇、2026 年 577 篇。
NeurIPS 2026 有多少篇数学推理论文?
NeurIPS 2026 有 208 篇数学推理论文,上一届是 190 篇。
ICLR 2026 有多少篇数学推理论文?
ICLR 2026 有 175 篇数学推理论文,上一届是 61 篇。
ICML 2026 有多少篇数学推理论文?
ICML 2026 有 113 篇数学推理论文,上一届是 45 篇。
CVPR 2026 有多少篇数学推理论文?
CVPR 2026 有 81 篇数学推理论文,上一届是 18 篇。
哪个会议的数学推理论文最多?
NeurIPS,2023–2026 年共 469 篇。

「神经符号」下的其他主题