Skip to content

Category

data science

2,518 papers

#machine learning Preprint Open access Sep 2026

Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp

We revisit the Sinkhorn-Knopp (SK) algorithm for the matrix scaling problem. Despite extensive literature on the global convergence of SK and its variants, its local linear convergence behavior remains less understood. We address this gap by providing the first nonasymptotic local analysis of SK that matches the rate o...

Wenzhi Gao, Zhaonan Qu, Yinyu Ye et al. · 0 citations
#machine learning Preprint Open access Sep 2026

Theoretical Guarantees for SMC-Guided Diffusion Sampling

Post-hoc conditioning of pretrained diffusion models can be addressed using Sequential Monte Carlo (SMC) methods. By evolving an interacting particle system, SMC-guided diffusion samplers combine unconditional reverse-diffusion dynamics with sequential reweighting to approximate conditional distributions. Nevertheless,...

Stanislas Strasman (SU, LPSM), Gabriel Victorino Cardoso (STIM) et al. · 0 citations
#machine learning Preprint Open access Sep 2026

Certified Adaptive Refresh: Anytime-Valid Monitoring for Federated Conformal RAG

Question-answering services built on retrieval-augmented generation (RAG), in which a language model answers from retrieved documents, are inspected continuously and upgraded repeatedly, so their reliability guarantee must survive both. We study federated conformal RAG: nodes holding private corpora score candidate ans...

Prasanjit Dubey, Xiaoming Huo · 0 citations
#machine learning Preprint Open access Sep 2026

Empirical Bayes 1-bit matrix completion

The problem of predicting unobserved entries in a binary matrix, known as 1-bit matrix completion, has found diverse applications in fields such as recommendation systems. In this study, we develop an empirical Bayes method for 1-bit matrix completion motivated by the Efron--Morris estimator, a matrix generalization of...

Takeru Matsuda · 0 citations
#machine learning Preprint Open access Sep 2026

High-Dimensional Partial Least Squares: Spectral Analysis and Fundamental Limitations

Partial Least Squares (PLS) is a widely used method for data integration, designed to extract latent components shared across paired high-dimensional datasets. Despite decades of practical success, a precise theoretical understanding of its behavior in high-dimensional regimes remains limited. In this paper, we study a...

Victor L\'eger, Florent Chatelain · 0 citations
#machine learning Preprint Open access Sep 2026

Cryo-EM as a Stochastic Inverse Problem

Cryo-electron microscopy (Cryo-EM) enables high-resolution imaging of biomolecules, but structural heterogeneity remains a major challenge in 3D reconstruction. Traditional methods assume a discrete set of conformations, limiting their ability to recover continuous structural variability. In this work, we formulate cry...

Diego Sanchez Espinosa, Erik H Thiede, Yunan Yang · 0 citations
#machine learning Preprint Open access Sep 2026

Estimating the Causal Effects of T Cell Receptors

A central question in human immunology is how a patient's T cell receptors impacts disease. Here, we introduce a method to infer the causal effects of T cell receptor (TCR) sequences on patient outcomes using observational TCR sequencing data and clinical outcomes data. Our approach corrects for unobserved confounders,...

Eli N. Weinstein, Elizabeth B. Wood, David M. Blei · 0 citations
#machine learning Preprint Open access Sep 2026

Dropout Universality: Scaling Laws and Optimal Scheduling at the Edge-of-Chaos

We ask whether the standard treatment of dropout as a static hyperparameter is optimal, or whether its utility can be improved by letting it vary over depth. We answer this by developing a mean-field theory of dropout near the edge of chaos, identifying distinct universality classes for smooth and kinked activations, t...

Lucas Fernandez Sarmiento · 0 citations
#machine learning Preprint Open access Sep 2026

Optimization Risk Bounds for Kolmogorov-Arnold Networks Trained by DP-SGD with Correlated Noise

The theoretical understanding of differentially private stochastic gradient descent (DP-SGD) with temporally correlated noise remains limited, particularly for non-convex neural network training. As a first step, we study two-layer Kolmogorov-Arnold Networks (KANs), a recently introduced architecture with learnable spl...

Puyu Wang, Jan Schuchardt, Nikita Kalinin et al. · 0 citations
#machine learning Preprint Open access Sep 2026

Non-Myopic Active Feature Acquisition via Pathwise Policy Gradients

Active feature acquisition (AFA) considers prediction problems in which features are costly to obtain and the learner adaptively decides which feature values to acquire for each instance and when to stop and predict. In this paper, we introduce a continuous relaxation of the acquisition process that enables non-myopic...

Linus Aronsson, Morteza Haghir Chehreghani · 0 citations
#machine learning Preprint Open access Sep 2026

From Seeds to Semantics: Measuring Semantic Accessibility in Deterministic Diffusion Models

Diffusion models generate samples through a sequence of learned denoising steps, and recent work has studied how semantic structure appears along this sampling process. We study this question in deterministic samplers by measuring semantic accessibility: how much information about a final semantic property, such as an...

Kuntian Chen, Wei Wei, Yizhou Zeng et al. · 0 citations
#machine learning Preprint Open access Sep 2026

Persistent Tri-State Message Passing

In stochastic message passing, an edge's sampled role changes the node states used to compute adaptive weights at later layers. Weight averaging therefore depends on whether edge roles persist across layers or are resampled at each layer. We study this dependence in Persistent Tri-State Message Passing (P3MP), which co...

Yoonhyuk Choi, Jiho Choi, Chong-Kwon Kim · 0 citations

From tech blogs

See all →
Microsoft Research Blog Oct 6, 2026

What AI gets wrong and what failure teaches us

Jennifer Neville did not want to go into computer science—but that’s exactly where she landed. Neville discusses the starts and stops that led to her professional sweet spot and her work identifying “surprising failures” making it hard for AI to handle complexity.  The post What AI gets wrong and what failure teaches us 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.