Skip to content

Category

data science

2,570 papers

Action-Driven Processes for Continuous-Time Control

This paper shows that minimizing the Kullback-Leibler divergence between a policy-driven true distribution and a reward-driven model distribution for a suitably defined action-driven process is equivalent to maximum entropy reinforcement learning.

Rui-Min He, Shao-Wei Lin · 0 citations
#machine learning Preprint Open access Sep 2026

A Kernel-based Stochastic Approximation Framework for Nonlinear Operator Learning

We develop a stochastic approximation framework for learning nonlinear operators between infinite-dimensional spaces utilizing general Mercer operator-valued kernels. Our framework encompasses two key classes: (i) operator-valued kernels whose associated integral operators are compact and hence admit discrete spectral...

Jia-Qi Yang, Lei Shi · 0 citations

Design of Experiment for Discovering Directed Mixed Graph

We study the design of interventions for causal discovery in simple structural causal models whose causal graphs are directed mixed graphs (DMGs) that may contain directed cycles and bidirected edges representing latent confounding. In such case, observational conditional-independence (CI) information may not identify...

Hai-Jie Xu, Chen Zhang · 0 citations
#machine learning Preprint Open access Sep 2026

Adaptively Truncated Signature-based Logistic Regression for Semi-parametric Functional Classification

Modern sensing technologies routinely generate multi-dimensional functional data, often accompanied by scalar covariates, motivating statistical methods that can jointly accommodate nonlinear functional effects, complex cross-component dependencies, and irregular sampling patterns. Existing functional logistic regressi...

Pengcheng Zeng, Siyuan Jiang · 0 citations
#machine learning Preprint Open access Sep 2026

Identifiable Convex-Concave Regression via Sub-gradient Regularised Least Squares

We propose a novel nonparametric regression method that models complex input-output relationships as the sum of convex and concave components. The method-Identifiable Convex-Concave Nonparametric Least Squares (ICCNLS)-decomposes the target function into additive shape-constrained components, each represented via sub-g...

William Chung · 0 citations
#machine learning Preprint Open access Sep 2026

When do Random Forests work?

We study the effectiveness of randomizing split-directions in random forests. Prior literature has shown that, randomization can reduce variance through decorrelation, and, randomization regularizes and works in low signal-to-noise ratio (SNR) environments. First, we revisit decorrelation and regularization by presenti...

C. Revelas, O. Boldea, B. J. M. Werker · 0 citations
#machine learning Preprint Open access Sep 2026

FEAT: Free energy Estimators with Adaptive Transport

We present Free energy Estimators with Adaptive Transport (FEAT), a novel framework for free energy estimation -- a critical challenge across scientific domains. FEAT leverages learned transports implemented via stochastic interpolants and provides consistent, minimum-variance estimators based on escorted Jarzynski equ...

Jiajun He, Yuanqi Du, Francisco Vargas et al. · 0 citations
#machine learning Preprint Open access Sep 2026

Towards Weaker Variance Assumptions for Stochastic Optimization

We revisit a classical assumption for analyzing stochastic gradient algorithms where the squared norm of the stochastic subgradient (or the variance for smooth problems) is allowed to grow as fast as the squared norm of the optimization variable. We contextualize this assumption in view of its inception in the 1960s, i...

Ahmet Alacaoglu, Yura Malitsky, Stephen J. Wright · 0 citations
#machine learning Preprint Open access Sep 2026

Generalization Analysis of Online Stochastic Gradient Descent for Overparameterized Two-Layer Neural Networks

We investigate the generalization performance of online stochastic gradient descent (SGD) for overparameterized two-layer neural networks under the Neural Tangent Kernel (NTK) regime. Leveraging the NTK approximation together with the convergence theory of stochastic approximation in reproducing kernel Hilbert spaces (...

Dinghao Cao, Zheng-Chu Guo, Lei Shi · 0 citations
#machine learning Conference Feb 2024

Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity

This work provides a refined analysis for inexact Halpern iteration that relaxes the required inexactness level to improve some state-of-the-art complexity results even for constrained stochastic convex-concave min-max problems.

Ahmet Alacaoglu, Donghwan Kim, Stephen J. Wright · 12 citations · ⚡2
#machine learning Preprint Aug 2026

Memory--Batch Tradeoffs in Lipschitz Bandits

The analysis separates fine-scale comparisons from the regional information needed to allocate their samples at low regret, which separates fine-scale comparisons from the regional information needed to allocate their samples at low regret.

Zicheng Lyu, Zengfeng Huang · 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.