NeuReasoner: Towards Explainable, Controllable, and Unified Reasoning via Mixture-of-Neurons (2026.acl-long)
Copied to clipboard
| Challenge: | Existing Large Reasoning Models (LRMs) lack explainability and controllability . Existing models target isolated levels without unification, while relying on RL . |
| Approach: | They propose an explainable, controllable, and unified reasoning framework driven by MoN. |
| Outcome: | The proposed framework achieves performance gains of 27.0% while reducing token consumption by 19.6% 63.3%. |
Similar Papers
TrigReason: Trigger-Based Collaboration between Small and Large Reasoning Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Large Reasoning Models suffer from high inference latency due to autoregressive reasoning . SpecReason adopts a polling-based design that repeatedly invokes the LRM for verification at every step . |
| Approach: | They propose a trigger-based collaborative reasoning framework that delegates most reasoning to the SRM and activates LRM intervention only when necessary. |
| Outcome: | The proposed framework reduces latency and API cost by 73.3% under edge–cloud conditions. |
From "Aha Moments" to Controllable Thinking: Toward Meta-Cognitive Reasoning in LRMs via Decoupled Reasoning and Control (2026.acl-long)
Copied to clipboard
| Challenge: | Large Reasoning Models exhibit step-by-step reasoning, reflection, and backtracking, but these behaviors are often unregulated, leading to overthinking. |
| Approach: | They propose a meta-cognitive reasoning framework that decouples reasoning from control to enable independent optimization of control strategies. |
| Outcome: | Experiments show that the proposed model improves efficiency and accuracy across reasoning benchmarks. |
Neuro-Symbolic Integration Brings Causal and Reliable Reasoning Proofs (2025.findings-naacl)
Copied to clipboard
| Challenge: | a new framework for complex reasoning with LLMs is developed to improve reasoning proof accuracy and interpretability. |
| Approach: | They propose to use LLMs to generate search logs that can be interpreted into human-readable reasoning proofs. |
| Outcome: | The proposed framework improves reasoning accuracy but lacks interpretability due to black-box nature of the solvers. |
From Token to Action: State Machine Reasoning to Mitigate Overthinking in Information Retrieval (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Chain-of-Thought (CoT) prompting often leads to overthinking in large language models . redundant trajectories that revisit similar states and misguided reasoning that diverges from user intent are two key challenges in information retrieval. |
| Approach: | They propose a transition-based reasoning framework that supports early stopping and fine-grained control. |
| Outcome: | The proposed framework improves retrieval performance by 3.4% while reducing token usage by 74.4%. |
Beyond Token Length: Step Pruner for Efficient and Accurate Reasoning in Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing reinforcement learning methods for large reasoning models suffer from excessive verbosity, known as "overthinking." Existing models penalize generated tokens to promote conciseness, but these methods encounter two challenges: they may develop hacking behavior in later stages of training by discarding reasoning steps. |
| Approach: | They propose a framework that steers large reasoning models toward more efficient reasoning . they prioritize correctness while imposing penalties for redundant steps . |
| Outcome: | The proposed framework reduces token usage by 69.7% on AIME24. |
NeuroSym-Cal: Bridging the Reasoning-Execution Gap in Code Generation via Hierarchical Calibration (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing calibration methods rely on the assumption that consensus implies correctness . Existing methods fail under systematic errors, leading to miscalibrated high-confidence predictions. |
| Approach: | They propose a hierarchical calibration framework that measures confidence at two levels . they propose sensitivity analysis to measure local curvature of deductive process . |
| Outcome: | The proposed framework de-saturates overconfident errors and improves selective generation performance on OOD benchmarks. |
Constructing Interpretable Features from Compositional Neuron Groups (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for analyzing LLMs rely on dictionary learning with sparse autoencoders (SAEs) however, SAEs struggle in causal evaluations and lack intrinsic interpretability, as their learning is not explicitly tied to the computations of the model. |
| Approach: | They propose to decompose MLP activations with semi-nonnegative matrix factorization (SNMF) such that the learned features are mapped to their activating inputs, making them directly interpretable. |
| Outcome: | Experiments on Llama 3.1, Gemma 2 and GPT-2 show that SNMF derived features outperform SAEs and a strong supervised baseline on causal steering while aligning with human-interpretable concepts. |
Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMs (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Sparse Mixture-of-Experts (SMoE) architectures require loading all expert parameters . previous work focused on expert pruning and merging but focused on neuron-level structure . |
| Approach: | They propose a task-agnostic framework for expert pruning and reconstruction . it prunes redundant experts using router statistics, then decomposes them into neuron-level expert segments . |
| Outcome: | The proposed framework reduces the number of experts and memory usage, making it easier to deploy. |
SeLaR: Selective Latent Reasoning in Large Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Recent latent reasoning approaches replace discrete tokens with soft embeddings or hidden states, but they often suffer from two issues: (1) global activation injects perturbations into high-confidence steps, impairing reasoning stability; and (2) soft embeds quickly collapse toward the highest-probability token, limiting exploration of alternative trajectories. |
| Approach: | They propose a lightweight and training-free framework that replaces discrete tokens with soft embeddings or hidden states to address these challenges. |
| Outcome: | Experiments on five reasoning benchmarks show that SeLaR outperforms standard CoT and state-of-the-art training-free methods. |
SLIM: Subtrajectory-Level Elimination for More Effective Reasoning (2025.findings-emnlp)
Copied to clipboard
Xifeng Yao, Chengyuan Ma, Dongyu Lang, Yinhao Ni, Zhiwei Xu, Huarui Xie, Zihao Chen, Guang Shen, Dandan Tu, Yi Bai, Changzheng Zhang
| Challenge: | Notable examples include OpenAI’s o1/o3/o4 series and DeepSeek-R1 . |
| Approach: | They develop a framework to identify suboptimal subtrajectories based on human-established criteria . they also use a sampling algorithm to select data whose reasoning process is free from suboptimally subtravertories to the highest degree . |
| Outcome: | The proposed method reduces the number of suboptimal subtrajectories by 25.9% during the inference process. |