Class-balanced replay controls class frequency but does not determine the interval between successive replay appearances of a class. We study this interval, the rehearsal gap, separately from the class marginal and class co-occurrence, and introduce randomised-pass replay (RPR), which visits each resident class once pe...
Semi-supervised federated learning (SSFL) trains models on clients' unlabeled data using a teacher to generate pseudo-labels, with a small labeled seed dataset on the server. Automatic Speech Recognition (ASR) is particularly fragile here: pseudo-label errors compound across the output sequence and across training roun...
Wonho Bae, Zakaria Aldeneh, Martin Pelikan et al.· 0 citations
A classical question in statistics is which observable quantities to condition on when drawing inferences about unobservable targets. For conformal prediction in nonparametric uncertainty quantification, standard marginal validity offers limited resolution at the prediction values on which decisions are based, and full...
Xue-Lin Yang, Bai-He Huang, Yi-Long Hou et al.· 0 citations
This paper presents a probabilistic perspective on large language models (LLMs), developed with the aim of bringing together, in a single self-contained account, tools that are usually treated separately across the literature. LLMs are described through probability measures on the set of sequences of tokens, specified...
Adnan Aboulalaâ· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
We study the multiplayer multi-armed bandit problem with information asymmetry under Bernoulli rewards, for three information structures: asymmetry in actions, in rewards, and in both. Replacing the Hoeffding-style confidence intervals of prior work with Kullback--Leibler (KL) divergence-based bounds gives strictly tig...
K. Nguyen, Ricardo Parada, William Chang· 0 citations
This work extends Compute-Aligned Training to this setting through an abstraction of policy-guided search, deriving tractable, trace-supported losses and introduces a search-agnostic uniform-allocation (UA) loss that accounts for the budget without specifying the specific search.
Human prostatic tissue demonstrated a mean density greater than the reported density of the irrigation fluid under the measurement conditions, and was found to be significantly higher in patients with CaP compared to those with BPH.
Vijaykumar Yadav, Samiran D. Adhikary, Shilpi Yadav et al.· Journal of Clinical and Diag...· 0 citations
A framework for quantifying model-form uncertainty in NIROMs is introduced by combining a perturbative stochastic representation of reduced bases with distribution-free conformal-type methods and an interpretable, scalar diagnostic of the quality of the uncertainty estimate.
Edgar Jaber, Rémy Vallot, T. Dairay et al.· 0 citations
Quantifying the influence of hybrid aleatory and epistemic uncertainties on high-dimensional system responses remains a major challenge in global sensitivity analysis (GSA). Existing Hilbert--Schmidt Independence Criterion (HSIC)-based approaches are primarily restricted to single-output settings and lack a rigorous de...
We study the subclass of potential mean-field games in which the running interaction cost and the terminal target cost are both expressed through reproducing-kernel maximum mean discrepancy (MMD) penalties, and develop a computational framework that exploits this kernel structure. Both costs are estimated from finite-s...
We analyze finite-particle drifting models for one-step generative modeling. For a conservative velocity given by the difference of the kernel-smoothed data and model scores, a joint-entropy identity yields continuous-time bounds for the smoothed Fisher discrepancy and the squared particle velocity. The finite-particle...
The findings reveal that in kernel methods, as long as the kernel is of high rank, the near-zero reconstruction error can be trivially obtained, implying that the reconstruction error will have limited predictive power for generalization.
Yang Liu, Ernest Fokoué, Richard D. Lange et al.· Machine-mediated learning· 0 citations
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.