Skip to content

Category

data science

3,048 papers

#machine learning Preprint Sep 2026

When Metropolis and Hastings Meet Bradley and Terry: Exact MCMC From Preference Voting

This work introduces Pref-MH, a general exact MH sampler for judge-induced conditional distributions using only stochastic binary pairwise comparisons, and develops a valid accept/reject rule whose resulting Markov chain provably converges to the target distribution.

Ariel Smogorghevski, Nir Rosenfeld, Yaniv Romano · 0 citations
#machine learning Preprint Sep 2026

Verdict Instability of OOD Scores under Reference Resampling

A rule is given that predicts that abstention driven by a wrong-signed score turns out worse than abstention at random on every dataset the authors test, and abstention driven by a wrong-signed score turns out worse than abstention at random on every dataset they test.

Donghoon Lee, Shinjin Kang · 0 citations
#machine learning Preprint Jul 2026

Neural means and kernel corrections for operator learning

Supporting results include a second-moment identity that predicts stacking outcomes from measured correlations, an optimal-recovery certificate, and a distribution-free coverage band, the only uncertainty signal that survives the authors' tests.

Yitzchak Shmalo · 0 citations
#machine learning Preprint Aug 2026

Stochastic complexity of vectors containing cluster structure

This paper shows that the problem of computing the stochastic probability (shortest code length) of the encoded vectors containing cluster structure using Normalized Maximum Likelihood (NML) model is a tractable problem by introducing a recursion formula for the efficient computation of normalizing constant from the NM...

D. Nicorici, Olli Yli-Harja, J. Astola · 0 citations
#artificial intelligence Preprint Feb 2026

Persistent Entropy as a Detector of Phase Transitions

Persistent entropy is a scalar summary of persistence barcodes widely used to detect regime changes, yet there is no account of when a structural change in a barcode must produce a detectable change in entropy. We establish a model-agnostic theorem supplying such conditions. Treating persistence diagrams as random obje...

Marcos Gutierrez-del-Pozo, Eduardo Paluzo-Hidalgo, M. Rucco · 0 citations
#artificial intelligence Review Sep 2026

Measuring consistency via ensemble margin and local prediction variability: Auditing decision systems in the presence of predictive multiplicity

This work studies multiplicity from the perspective of auditing incorrect ensemble predictions, where the decision to divert an instance for human review is based on a consistency criterion that combines the ensemble margin with a measure of local prediction variability for each constituent model.

Sinjini Banerjee, Tim Marrinan, Anand D. Sarwate · 0 citations
#artificial intelligence Preprint Sep 2026

From Truncation to Commitment: Persistent Context in Uniform Discrete Diffusion

Uniform-state discrete diffusion models update all tokens in parallel while keeping every position revisable. Even when the commonly used top-$p$ rule leaves only one candidate at a position, that choice affects only the current reverse step and can be revised at the next sampling step. We ask what changes when selecte...

Satoshi Hayakawa · 0 citations
#artificial intelligence Preprint Sep 2026

Embedded Conditional Independence Tests for Large Language Model Generated Text with an Application to German Parliament Speeches

Embedded CITs (eCITs), which embed X and Z and apply an existing CIT to the resulting representations and to the resulting representations, are proposed and it is shown that sufficiency weakens to mean sufficiency when the embedded test targets conditional mean independence.

Marco Simnacher, Georg Keilbar, B. König et al. · 1 citation
#artificial intelligence Preprint Aug 2026

Provably Efficient Federated Reinforcement Learning with Linear Function Approximation and Logarithmic Communication Cost

Fed-LSVI is proposed, the first provably efficient federated algorithm for online reinforcement learning with linear function approximation in episodic Markov decision processes and achieves a regret bound of $\widetilde{\mathcal O}(\sqrt{Md^3H^4T})$, matching the best-known regret for multi-agent online reinforcement...

Zi-Han Liang, Haochen Zhang, Ling-Zhou Xue · 0 citations
#artificial intelligence Review Open access Oct 2026

Artificial Intelligence’s Transformative Impact on Management, Strategy, and Workplace Dynamics: A Systematic Literature Review

This systematic literature review synthesizes interdisciplinary evidence on how AI transforms leadership and management functions, drives business model innovation, and alters workplace dynamics, with particular attention to Southeast Asian and Philippine contexts.

Teodulfo Mahilum, Michelle Go, Rosemarie Magno et al. · 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.