Skip to content

Category

data science

3,017 papers

#machine learning Preprint Sep 2026

Pooling and Drift in Delayed Bandits

This work proves that on generated data, the state channel cuts regret by up to 79 percent against action-level weighting and, on the funnel family, by 32 to 68 percent against a tuned minimax-optimal method.

Melika Baghi · 0 citations
#machine learning Preprint Sep 2026

Bayes-Optimal BER and AUC: Estimation and Evaluation of Estimators

The FeeBee framework is extended, originally proposed for evaluating Bayes-error estimators, to the optimal BER and AUC, and the resulting procedure provides practical evaluation scores without requiring knowledge of the optimum.

Ryota Ushio, Takashi Ishida, Masashi Sugiyama · 0 citations

What Drives Success in Physical Planning with Joint-Embedding Predictive World Models?

This work characterize models from this family of methods as JEPA-WMs and investigates the technical choices that make algorithms from this class work, and proposes a model that outperforms two established baselines, DINO-WM and V-JEPA-2-AC, in both navigation and manipulation tasks.

Basile Terver, Tsung-Yen Yang, Jean Ponce et al. · 49 citations · ⚡7
#artificial intelligence Preprint Sep 2026

Schr\"odinger Bridges on Lie Group Manifolds for Probabilistic Intrinsic Generation

Generative modeling directly on geometric manifolds can avoid errors introduced by flattening non-Euclidean data, repeated ambient projection, and coordinate inconsistency in Euclidean representations. Schrodinger bridges provide a probabilistic generative framework for entropy-regularized transport between prescribed...

Shizeng Zhang, Mingyang Zhao, Lei Ma · 0 citations
#artificial intelligence Preprint Sep 2026

Online Non-Monotone DR-Submodular Maximization Matching the Offline $0.401$ Factor

This work studies online maximization of nonnegative, non-monotone DR-submodular functions over compact convex down-closed subsets of the $d$-dimensional unit cube and shows that the best known constructive offline approximation factor is also achievable online.

Vaneet Aggarwal, Yi-Yang Lu · 0 citations
#data science Open access Oct 2026

Zero Trust for SQL Server: A Three-Layer Security Architecture

This study designed and empirically validated a three-layer Zero Trust architecture for Microsoft SQL Server that natively integrates instance-level authentication governance, enhanced Role-Based Access Control with Row-Level Security and Just-in-Time privilege elevation, and metadata-driven Attribute-Based Access Cont...

Maynard Capil, D. Dasig · 0 citations
#data science Preprint Jul 2026

The Zero Pattern of a Design Matrix Drives Multiple Descent in Over-parameterized Regression

Over-parameterized linear regression has been widely studied over the last decade. However, most existing works assume that the covariates are independent and that their covariance matrices are non-degenerate. In this paper, we relax both assumptions and derive deterministic equivalents for the prediction risk in a van...

Kevin Han Huang, Haoyu Ye, Somak Laha et al. · 0 citations

Subjective Risk Decomposition: A New View for Uncertainty Quantification

It is shown how epistemic and aleatoric uncertainty measures can be derived via decomposition of a subjective risk, based on a strictly proper loss, and considered a first step towards a full learning-theoretic framework for uncertainty quantification.

R. Alamri, Michele Caprio, Gavin Brown · 1 citation · ⚡1

FedSPDnet: Geometry-Aware Federated Deep Learning with SPDnet

Simulations on EEG motor imagery benchmarks show that FedSPDnet outperforms federated EEGnet in F1 score and robustness to federation and partial participation, while using fewer parameters per communication round.

Thibault Pautrel, Florent Bouchard, Ammar Mian et al. · 2 citations

Modeling Information Blackouts in Missing Not-At-Random Time Series Data

An MNAR-aware latent state-space model that combines linear traffic dynamics with a Bernoulli missingness channel whose probability depends on the latent state is studied, achieving lower P95 error, lower long-blackout RMSE, and orders of magnitude fewer stored scalar entries.

Aman Sunesh, Alan Ma, Siddarth Nilol · 1 citation

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.