Skip to content

Category

natural language processing

9,049 papers

#natural language process... Preprint Jul 2026

Training a Language Model End-to-End in Rust: An Experience Report

A measured failure taxonomy of the two leading Rust ML frameworks, Candle and Burn, as training (not inference) backends in 2026 is considered: the more useful contribution is a measured failure taxonomy of the two leading Rust ML frameworks, Candle and Burn, as training (not inference) backends in 2026.

Arif Ahmed Adito · 0 citations

VeriSoftBench: Repository-Scale Formal Verification Benchmarks for Lean

VeriSoftBench is introduced, a benchmark of 500 Lean 4 proof obligations drawn from open-source formal-methods developments and packaged to preserve realistic repository context and cross-file dependencies and results show that success is strongly correlated with transitive repository dependence.

Yu-Tong Xin, Qiaochu Chen, Greg Durrett et al. · 6 citations
#machine learning Preprint Open access Sep 2026

Text-only adaptation in LLM-based ASR through text denoising

Adapting large language model (LLM)-based automatic speech recognition (ASR) systems to new domains using text-only data is a significant yet underexplored challenge. Standard fine-tuning of the LLM on the target domain text often disrupts the critical alignment between the speech and text modality learned by the proje...

Andr\'es Carofilis, Sergio Burdisso, Esa\'u Villatoro-Tello et al. · 0 citations
#machine learning Preprint Open access Sep 2026

Low-Rank Attention Residuals

Attention Residuals (AttnRes) replace the fixed residual sum with depth-wise attention over previous sub-layer outputs in Large Language Models (LLMs), but use each output as both a full-dimensional key and value. This couples routing with representation and makes the cost of computing depth-routing scores scale with h...

Jonathan Su · 0 citations
#machine learning Preprint Open access Sep 2026

Refit the Probe: Single-Direction Ablation Is Not a Necessity Test

Probes are routinely paired with an intervention: ablate the direction the probe found, run the model, and read the change in task accuracy, taking a large drop as evidence that the computation depends on what the probe read and a near-zero drop as evidence that it does not. Either inference requires that the ablation...

Yuhang Jiang · 0 citations
#machine learning Preprint Open access Sep 2026

MONA: Muon Optimizer with Nesterov Acceleration for Scalable Language Model Training

The Muon optimizer has recently offered a promising alternative to AdamW for large language model training, leveraging matrix orthogonalization to produce geometry-aware updates. However, like all first-order methods, Muon can become trapped in sharp local minima. In this work, we present MONA, an optimizer that bridge...

Jiacheng Li, Jianchao Tan, Hongtao Xu et al. · 0 citations
#machine learning Preprint Sep 2026

Discovery-Driven Integration of Disjoint Tables via Text

Comprehensive evaluations on real-world benchmarks demonstrate that LOKI consistently outperforms state-of-the-art multi-modal data discovery approaches, and materializes typed integrated tables with 0.982 macro typed-pair precision while being up to 40 times cheaper in LLM API cost than direct prompting.

Md Ataur Rahman, Dimitris Sacharidis, Óscar Romero et al. · 0 citations
#machine learning Preprint Sep 2026

On the Lexical Superstition of Large Language Models for Code Comprehension: Re-evaluation on Code of Low Lexical Quality

Face/Off is introduced, a semantics-preserving identifier-renaming framework, and progressive naming conditions across multiple models and code-comprehension tasks are evaluated, revealing a systematic vulnerability in how current LLMs balance lexical cues against program structure.

Xin-Peng Shen, San-Zhuo Xi, Ya-Li Du et al. · 0 citations
#machine learning Preprint Open access Sep 2026

Damage Predicts Recovery: When Calibration Data Matters in Compressing Financial LLMs

Post-training quantization and pruning rely on a small calibration corpus. Whether specialized domains such as finance require domain-matched calibration data remains unsettled. We argue that the answer depends on the task-level damage caused by compression rather than on domain mismatch. If compression preserves the t...

Junyi Ye, Mengjia Yu, Debapriya Hazra et al. · 0 citations
#machine learning Preprint Open access Sep 2026

One Domain, Many Tongues: Composing Domain and Language LoRAs for Cross-Lingual Remote-Sensing MLLMs without Paired Data

Remote-sensing (RS) multimodal large language models (MLLMs) are trained and evaluated only in English, while text-only instruction data covers over 100 languages. We propose MODL (Mutually Orthogonal Domain-Language composition), a recipe that adds new languages to an English RS MLLM without a single multilingual RS e...

Xuechen Li · 0 citations
#machine learning Preprint Open access Sep 2026

Optimizing Denoising Trajectories in dLLMs: A Lightweight Evolutionary Heuristic Approach

Diffusion Large Language Models (dLLMs) have recently emerged as a promising alternative to conventional Auto-Regressive (AR) Large Language Models (LLMs). By leveraging bidirectional attention and parallel decoding, dLLMs enable more efficient generation. However, they require a carefully designed denoising scheduler...

Zijian Zhao, Dian Jin, Xialiang Tong 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.