Skip to content

Category

data science

3,017 papers

On the existence of consistent adversarial attacks in high-dimensional linear classification

A new error metric is introduced that precisely captures model vulnerability to consistent adversarial attacks -- perturbations that preserve the ground-truth labels, offering theoretical insight into the mechanisms underlying model sensitivity to adversarial attacks.

Matteo Vilucchio, Lenka Zdeborová, Bruno Loureiro · 1 citation
#machine learning Preprint May 2025

Online simultaneous inference for quantiles via smoothed stochastic gradient descent

This paper considers the estimation of quantiles via a smoothed version of the stochastic gradient descent (SGD) algorithm. By smoothing the score function with a bandwidth tied to the learning rate, we obtain estimates that are monotone in the quantile level at every iteration, while retaining the memory and computati...

Li-Kai Chen, Georg Keilbar, Wei-Biao Wu · 2 citations
#machine learning Preprint Feb 2025

Generalization Bounds for Markov Algorithms through Entropy Flow Computations

This work builds on a principled continuous-time approximation of Markov algorithms and introduces a new, exact entropy flow formula for such processes, and establishes novel connections to a well-studied family of modified logarithmic Sobolev inequalities.

Benjamin Dupuis, Maxime Haddouche, George Deligiannidis et al. · 2 citations

Deep learning based numerical approximation algorithms for stochastic partial differential equations and high-dimensional nonlinear filtering problems

A deep learning based approximation algorithm for solutions of stochastic partial differential equations (SPDEs) using a deep neural network for every realization of the driving noise process of a SPDE to approximate the solution process of the SPDE under consideration.

C. Beck, S. Becker, Patrick Cheridito et al. · 16 citations · ⚡2
#machine learning Preprint Oct 2025

Performance-Efficiency Tradeoffs in Transformers: An Approximation Theory Perspective

This work investigates how the model parameters -- mainly attention heads and head dimensions -- should be allocated across layers to balance expressivity and efficiency, and proposes principled strategies for allocating attention heads and dimensions across Transformers' layers.

Ruoxi Yu, Hao-Tian Jiang, Jingpu Cheng et al. · 1 citation
#machine learning Preprint Feb 2025

Multi-View Causal Discovery without Non-Gaussianity: Identifiability and Algorithms

A multi-view linear Structural Equation Model (SEM) is proposed that extends the well-known framework of non-Gaussian disturbances by alternatively leveraging correlation over views and proves the identifiability of the model for acyclic SEMs.

Ambroise Heurtebise, Omar Chehab, Pierre Ablin et al. · 0 citations
#machine learning Preprint Sep 2026

Variable Selection for Feature-Based Newsvendor

This paper forms the resulting $\ell_0$-constrained empirical newsvendor problem with $\ell_2$-regularization, establishes its computational hardness, and develops a mixed-integer second-order cone programming reformulation that strengthens the standard Big-$M$ formulation.

Zhao Yuan, Jie Wang · 0 citations
#machine learning Preprint Sep 2026

Matched Queries for Curvature and Density at Branching Junctions

This work addresses the inverse problem of matched score queries at noise scales $\sigma$ and $\lambda\sigma$ using matched subtraction to establish a perturbation bound and a conditional kernel-density-estimation rate.

Zi-Qi Zhao, Qing-Jian Ni · 0 citations
#machine learning Preprint Sep 2026

Artificial Rosetta Stone: Constrained Maximum A Posteriori (MAP) Reconstruction of Symbolic Raga Sequences via Order-k Markov Models

This paper formalizes a mathematical framework for the Artificial Rosetta Stone, proposing the Artificial Rosetta Stone (ARS), and separates three claims often conflated: a symbolic sequence can be reconstructed probabilistically; a sequence can be consistent with an explicit grammar; and a historical performance can b...

Saanvi Raghavendran, Abhishek Bhattacharjee · 0 citations

From tech blogs

See all →
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.