Skip to content

Category

natural language processing

9,261 papers

#machine learning Preprint Open access Oct 2026

Where Prefill Expert Reduction Hurts MoE Models: A Few Prompt Tokens Carry Most of the Short-Answer F1 Loss

Running prompt tokens through fewer routed experts during prefill is a simple way to make mixture-of-experts (MoE) serving cheaper, yet it is unclear what this damages. We locate the damage with token-, layer- and attention-path interventions on short-answer question answering in four MoE families. At half the experts...

Zhiyuan Wang · 0 citations
#machine learning Preprint Oct 2026

Sample, Mix, or Verify? Allocating Test-Time Compute under Imperfect Verifiers

A common way to make language models and agents more accurate is to spend more compute at inference time: generate many candidate solutions and submit the one a verifier prefers. Success then requires that some candidate is correct and that the verifier picks it. The first grows predictably with the number of samples;...

Srinivasan Iyengar · 2 citations
#artificial intelligence Preprint Oct 2026

Tree-Aware Posterior Distillation for Long-Horizon Agentic Reinforcement Learning

Reinforcement learning with verifiable rewards has become a scalable post-training paradigm for large language models. However, training agents over long-horizon interactions presents two challenges: using only terminal rewards makes turn-level credit assignment sparse and high-variance, while sequential mini-batch upd...

Heming Zou, Qi Wang, Yi-Xiu Mao et al. · 1 citation
#machine learning Preprint Oct 2026

LED: Improving Masked Diffusion Language Models by Lookahead Editing

This design introduces a rewritable proposal that uses additional compute to improve expressivity while keeping the simple mask-based transition schedule of MDMs, and fine-tune Qwen2.5-7B and Qwen3-8B to obtain LED-\texttt{7B} and LED-\texttt{8B}, respectively.

Yu-Yan Zhou, Ze-Yuan Yang, Yuxuan Song et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Can LLMs predict the outcomes of machine learning experiments?

This work evaluates how accurately large Language Models predict the impact of self-generated ML experiment ideas before these are put into training runs to show that current LLMs have useful but limited intuition about which ML ideas will work.

Ayush Bansal, Aldo Pareja, S. Klein et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Progressive Misalignment Can Emerge from Benign Recursive Self-Distillation

This paper observes that when a safe model is recursively self-distilled on its own (safe) generations while receiving an additional non-harmful cue, it becomes increasingly misaligned across a diverse set of harmful queries; it is called Progressive Misalignment.

Karim Abdel Sadek, F. Di Gennaro, Fanny Yang · 0 citations
#machine learning Preprint Oct 2026

Binding-Specific Relearning Savings for Test-Time Continual Learning

This work tests whether learning a specific factual binding produces a later relearning advantage beyond familiarity with its entity, answer vocabulary, format, or query slot, and whether that advantage remains positive after adjustment for measured pre-relearning behavior.

Zhe Zhou · 0 citations
#artificial intelligence Review Open access Jan 2026

Scalable Real-Time Data Pipelines for AI and Machine Learning–Driven Enterprise Systems

It is concluded that horizontally scalable, log-based messaging, combined with fault-tolerant, in-memory and micro-batch computation and durable, replicated storage constituted the technical foundation that made real-time, ML-driven enterprise analytics feasible within this period and that this layered architecture con...

Harsh Verma · 0 citations
#natural language process... Preprint Open access Oct 2026

ORACLE-SWE: Quantifying the Contribution of Critical Information Signals on SWE Agents

Recent advances in Language Model (LM) agents have increasingly focused on repository-level software engineering (SWE) tasks, leading to various agentic workflows, training methods and failure analysis. Interestingly, rather than directly generating or evaluating edit patches, these approaches first examine and improve...

Kenan Li, Qirui Jin, Liao Zhu et al. · 0 citations
#natural language process... Preprint Open access Oct 2026

Cost-Efficient RAG for Entity Matching with LLMs: A Blocking-based Batch Processing Framework

Large language models (LLMs) offer a compelling approach to entity matching (EM) in label-scarce settings, yet their matching quality is sensitive to records with ambiguous or sparse attributes due to the absence of external factual grounding. Retrieval-augmented generation (RAG) directly addresses this grounding gap b...

Chuangtao Ma, Zeyu Zhang, Arijit Khan et al. · 0 citations
#computer vision Preprint Open access Oct 2026

Can MLLMs Read the Room? A Multimodal Benchmark for Assessing Deception in Multi-Party Social Interactions

Despite their advanced reasoning capabilities, state-of-the-art Multimodal Large Language Models (MLLMs) still lack a core component of human intelligence: the ability to "read the room" and assess deception in complex social interactions. To rigorously evaluate this limitation, we introduce Multimodal Interactive Dece...

Caixin Kang, Yifei Huang, Liangyang Ouyang et al. · 0 citations

From tech blogs

See all →
Microsoft Research Blog Oct 22, 2026

Flint-interactive: A language for creating interactive data visualizations

Flint-interactive gives AI agents a language for creating interactive visualizations. Click a chart, filter data, highlight related content, and explore beyond the view the author originally chose. The post Flint-interactive: A language for creating interactive data visualizations appeared first on Microsoft Research.

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.

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