Skip to content

Category

natural language processing

7,776 papers

#machine learning Preprint Sep 2026

SMAT: Simple and Efficient Merge-Aware Training

SMAT (Simple MAT) is introduced, which jointly optimizes expert loss and expected loss at simulated merged parameters generated by sampling scaling coefficients, masks, and additive noise, and improves the mean score across five merging methods.

Yang-Gan Gu, Yuan-Yi Wang, Zhen Li et al. · 0 citations
#machine learning Preprint Sep 2026

When to Evict, Not What to Keep: Draft-Guided Eviction for Training-Free KV-Cache Compression

Training-free KV-cache compression methods such as SnapKV, H2O, and PyramidKV evict tokens at the end of prefill, aiming to preserve the attention mass that future queries are expected to use -optimizing what to keep. We show that this objective fails in two distinct ways. (1) Compensation: restoring the evicted attent...

Haeyong Kang, C. D. Yoo · 0 citations
#machine learning Preprint Sep 2026

Teach Yourself Where to Look: On-Policy Attention Self-Distillation for Reasoning

On-Policy Attention Self-Distillation (OPASD), which complements token-level supervision with solution-conditioned attention distillation, shows that solution-conditioned attention provides a complementary supervision signal that makes on-policy self-distillation more accurate, stable, and compute-efficient.

Safaeid Hossain Arib, Rabeya Akter, I. N. Swapnil et al. · 0 citations
#machine learning Preprint Sep 2026

Save Your Saturated Data: Learning Beyond Reward Saturation in Group-Based RL

Group-relative reinforcement learning (RL) relies on reward variation among sampled responses to estimate informative relative advantages. As language models become increasingly capable, existing training data can become reward-saturated: all sampled responses to the same problem might receive equally high rewards, whe...

Zi-Yuan Yang, Yike Wang, Shang-Bin Feng et al. · 0 citations
#machine learning Preprint Sep 2026

Theory of Scene: Breaking the Symmetry Trap in Multi-Agent LLM Coordination

Tory of Scene (ToS), a training-free reasoning schema in which each agent reads its public role, the only difference between the agents, and the task context they all observe, is proposed, which outperforms all six baselines on every benchmark, and each baseline falls far behind it in at least one setting.

Liang-Qi Yuan, Wen-Zhi Fang, Shi-Qiang Wang et al. · 0 citations
#machine learning Preprint Sep 2026

Understanding and Exploiting Anisotropy in Post-Training

LLM post-training combines supervised fine-tuning (SFT), a mode-covering forward-KL objective, with reinforcement learning (RL), a mode-seeking reverse-KL objective, with reinforcement learning (RL), a mode-seeking reverse-KL objective to exploit anisotropy, a division of labor that post-training can exploit.

Samyak Jha, Harshvardhan Saini, Yi-Zhen Liao et al. · 0 citations
#machine learning Preprint Sep 2026

Distance-KV: Exploiting Relative Distance for Efficient Long-Context Inference

The memory usage and decoding latency of LLM inference grow rapidly with context length. To reduce these costs, key-value (KV) cache compression methods selectively retain cached states based on token importance or differences in attention patterns across heads. However, we discover that retrieval capability varies sub...

Xian-Peng Shang, Can-Bin Huang, Jiang Li et al. · 0 citations
#machine learning Review Sep 2026

Shared Autoregressive Context Can Distort Relationships in Synthetic Data

Large language models can generate several records within one autoregressive completion, making earlier answers available as context for later records. This paper shows that such shared-completion batching can distort relationships among variables in the resulting synthetic data, using controlled tests on synthetic sur...

Thomas S. Robinson · 0 citations
#machine learning Preprint Sep 2026

HM-ROUTER: Joint Model and Harness Routing for Agentic Systems

HM-Router is introduced, a routing method that jointly selects a model and harness for each query, with an interaction term inspired by canonical polyadic tensor decomposition to capture how their compatibility varies with the query.

H. Chen, Royson Lee, Yasuyuki Okoshi et al. · 0 citations

From tech blogs

See all →
MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.