Skip to content

Category

machine learning

3,595 papers

Zipping the Thought: When and How Compressed Reasoning Data Works in LLM Post-Training

A taxonomy of CoT is proposed consisting of Explicit CoT, which outputs all operations without aggregation, Composed CoT, which combines multiple operations into a single step, and Implicit CoT, which omits intermediate operations.

Kohsei Matsutani, Gouki Minegishi, Takeshi Kojima et al. · 1 citation
#machine learning Preprint Open access Sep 2026

Universal Activation Verbalizer: A Unified Framework for Cross-Model Activation Explanation

Activation verbalization explains hidden representations in natural language, but existing methods are mostly limited to self-explanation, where each model explains only its own activations. We introduce Universal Activation Verbalizer (UAV), a framework that uses a shared decoder to explain activations from heterogeneous donor models. UAV learns a lightweight adapter that converts donor activations into soft tokens in decoder's embedding space, and further supports adapter-only transfer by reusing a frozen decoder-side LoRA while training only a new adapter for another donor. Across classification, fact retrieval, and gist summarization, UAV remains competitive with strong self-explanation baselines while enabling cross-model verbalization across model families and scales. Ablations show that decoder-side tuning mainly improves task behavior, whereas the adapter provides the activation-grounded factual and semantic information needed for faithful explanations. Code and data are available at https://github.com/hy-zhao23/ActExp.

Haiyan Zhao, Zirui He, Guanchu Wang et al. · 0 citations
#machine learning Preprint Open access Sep 2026

Correcting test set contamination by spiking the training data

The literature on test set contamination largely focuses on detection, but the correction of contaminated test scores is underexplored. Our core proposal is to spike the training data by intentionally contaminating some test examples at known rates. The spiked examples can then be used to calibrate predictors of model memorization which enable principled statistical correction of inflated test scores. To evaluate different correction estimators, we first present a simulation framework based on the Hubble models. Hubble models come in minimal pairs, where the perturbed model was deliberately contaminated with several test sets, while the standard model was not, serving as the counterfactual and correction target. We consider estimators that use information from a memorization predictor, correctness predictor, or both. In simulation, we establish basic statistical intuitions and show that estimators leveraging memorization and correctness information are better than naive estimation which makes no correction at all. We then instantiate several memorization and correctness predictors, and find that simple predictors such as Platt-scaled membership inference metrics provide good signal for correction. Finally, we examine the practical considerations of spiking. Simple memorization predictors need no more than 10 examples for calibration and often transfer from one dataset to another. Taken together, spiking is a promising solution for test set contamination.

Johnny Tian-Zheng Wei, Jerry Li, Ameya Godbole et al. · 0 citations

Measuring the Depth of LLM Unlearning via Activation Patching

The Unlearning Depth Score (UDS), a metric that quantifies the mechanistic depth of unlearning via activation patching, is introduced, confirming the causal approach as the most reliable for unlearning evaluation.

Jaeung Lee, Dohyun Kim, Jaemin Jo · 1 citation

Summoning the Oracle to Slay It: Mitigating Look-Ahead Bias in Financial Backtesting with Large Language Models

FinCAD is proposed, an inference-time adaptation of Context-Aware Decoding that attenuates contributions from memorised historical outcomes without retraining and raises the subset-averaged in-sample/out-of-sample Spearman correlation on an eleven-model leaderboard.

Weixian Waylon Li, Mengyu Wang, Tiejun Ma · 2 citations
#machine learning Preprint Open access Sep 2026

Physics-Guided Concentration Inference from Resistance Transients in a Mixed-Phase SnO-SnO$_2$ Carbon Monoxide Sensor with p-n Switching

This work presents a physics-guided machine-learning framework for carbon monoxide concentration inference from experimentally measured resistance transients of a mixed-phase SnO-SnO$_2$ material gas sensor exhibiting temperature-dependent p-n switching behavior. Cycle-level transient responses are represented through physically interpretable descriptors and complemented by compact fast Fourier transform (FFT) and discrete wavelet transform (DWT)-based summaries. Using leakage-aware grouped cross-validation, we study both multi-class concentration classification and continuous concentration regression for the p-type and n-type sensing regimes separately. Across both regimes, fused features provide the strongest overall performance, while the physics-guided descriptor block remains highly competitive, indicating that the dominant concentration information is already encoded in physically meaningful transient dynamics. The p-type branch shows the best concentration-class discrimination, with the fused Random Forest classifier reaching approximately $96.5\%$ accuracy, whereas the n-type branch yields the best quantitative concentration estimation, with the fused Random Forest regressor achieving an MAE$\approx 1.48$ ppm and an R$^2$ $\approx 0.992$. These results reveal a clear dual-regime behavior: p-type sensing is particularly favorable for classification, whereas n-type sensing is more favorable for high-fidelity regression. More broadly, the study demonstrates that leakage-aware, cycle-level, physics-guided machine learning can extend conventional gas-sensing analysis beyond single-response metrics while preserving physical interpretability

Sani Biswas, Preetam Singh, Amit Kumar Gangwar · 0 citations
#artificial intelligence Preprint May 2026

SciAtlas: A Computable Atlas of Science for Knowledge-Grounded AI Research

SciAtlas is presented, a shared, machine-actionable cross-disciplinary scholarly knowledge infrastructure that integrates evidential, conceptual, disciplinary, expertise, and normative layers under a shared schema and achieves a unified neuro-symbolic retrieval mechanism that grounds heterogeneous research objects, propagates relevance across the scholarly topology, and projects the resulting relevance field into the context required by each scientific workflow.

Shuofei Qiao, Yun-Xiang Wei, Bu-Sheng Zhang et al. · 1 citation

Making the Discrete Continuous: Synthetic RAW Augmentations for Fine-Grained Evaluation of Person Detection Performance in Low Light

Focusing on the autonomous driving safety-critical case of pedestrian detection in the dark, it is shown how synthetic low-light samples can be used to better characterize the performance of a state-of-the-art object detection model as a function of the scene illumination.

V. Pais, Malena Mendilaharzu, Daniele Faccio et al. · 0 citations
#machine learning Preprint Open access Sep 2026

Operator-Guided Model Reduction for Generative Sampling in Lattice Field Theory

Neural generative samplers for lattice field theory can be costly to train and evaluate. When they miss modes or assign them incorrect relative weights, biased observables do not reveal which collective variables are responsible. We project a trained flow-matching velocity onto vector fields built from lattice operators and Fourier modes. In two-dimensional lattice $\phi^4$ theory, the projection separates changes in the overall magnetization from the lowest nonzero-momentum fluctuations and guides an explicit invertible proposal that treats them separately. Allowing the amplitude of the lowest nonzero-momentum fluctuations to depend on the magnetization improves the overlap between the proposal and target distributions, while the same two-parameter modification at higher momenta gives smaller improvements. The Metropolis--Hastings correction defines a Markov chain with the target Boltzmann distribution as its stationary law, and the normalized proposal density yields finite-volume partition-function estimates consistent with an independent HMC calculation. At the larger tested volume, the overlap between the proposal and target distributions deteriorates substantially, limiting the range over which the same parameterization remains effective.

Moxian Qian · 0 citations

Robust Multi-Agent LLMs under Byzantine Faults

Self-Anchored Consensus (SAC), a fully decentralized filter-and-refine protocol in which agents iteratively exchange responses, locally evaluate and filter unreliable messages, and refine their own outputs, is proposed.

Haejoon Lee, Vincent Yun, Hyeonho Oh et al. · 3 citations
#machine learning Preprint Open access Sep 2026

Learning the Channel Gain from Anywhere to Anywhere via Cross-environment Transformer Estimators

Channel-gain maps provide the channel gain between any two locations in a geographical region. They find numerous applications, from resource allocation and interference control to path planning for autonomous vehicles. Channel-gain map estimation (CGME) is considerably more challenging than conventional radio map estimation (RME) because channel-gain maps are functions over a 6-dimensional input space. This calls for specialized methods, which currently rely on the (inaccurate) radio tomographic model or require a prohibitively large number of measurements since they do not exploit any spatial structure. This paper overcomes this issue by leveraging spatial patterns that channel-gain maps exhibit across environments, as dictated by the laws of physics and typical environmental characteristics (e.g. building materials and layouts). Adopting a metalearning perspective, a transformer-based estimator is proposed to implicitly learn this common structure from measurements collected in multiple environments. This enables CGME in new environments from significantly fewer measurements (five times less in our experiments). To maximize learning efficiency, the transformer is composed with a feature map that enforces the invariances of CGME, such as those following from reciprocity. Numerical experiments corroborate the merits of the proposed estimator relative to existing methods.

Prasenjit Dhara, Daniel Romero · 0 citations

When Chain-of-Thought Fails, the Solution Hides in the Hidden States

It is demonstrated that CoT encodes recoverable, token-level problem-solving information, offering new insight into how reasoning is represented and where it breaks down, suggesting complete reasoning chains are not always necessary.

Houman Mehrafarin, Amit Parekh, Ioannis Konstas · 2 citations

From tech blogs

See all →
MIT News · Artificial Intelligence Aug 27, 2026

Looking beyond natural sequences

A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.

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