Bandit algorithms generate data for downstream inference, but adaptive sampling biases post-bandit sample means. We analyze this bias for stable index algorithms, including UCB1 and its generalizations, and derive sharp leading-order expressions for the sample-mean bias and expected $Z$-statistic. Our characterization...
Learning operators from sequentially collected data arises in adaptive experimental design, Bayesian optimization, and dynamical-system modelling, where observations may be dependent, and future inputs or sensing operators may depend on preceding data. We derive time-uniform self-normalized concentration bounds for sto...
An additive deep-learning framework that keeps physicochemical descriptors and molecular graph information separate throughout training attains competitive predictive performance while making the distinct roles of chemical and structural information more transparent.
S. Bhattacharya, Arkaprava Roy· arXiv.org· 0 citations
This work proves that the representation cost is a power of a quasi-seminorm and that the native space is a quasi-Banach space with nonconvex unit ball when $L>2$.
Greg Ongie, Rahul Parhi· arXiv.org· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
We study the contradiction graphs associated with a binary concept class. For a class $H\subseteq\{0,1\}^X$, the order-$m$ contradiction graph $G_m(H)$ has as vertices the $H$-realizable labeled sequences of length $m$, with two vertices adjacent when the two sequences assign opposite labels to some common domain point...
Jesse Campbell, Daniel Ibaibarriaga, Lev Reyzin· 0 citations
Learning dynamical systems through operator-theoretic representations provides a powerful framework for analyzing complex dynamics, as spectral quantities such as eigenvalues and invariant structures encode characteristic time scales and long-term behavior. However, dynamical operators are typically estimated independe...
Thibaut Germain, Sami Chemlal, R\'emi Flamary et al.· 0 citations
This work proposes coupling CP with the SL through a natural construction that mirrors the original SL framework, using individual learner weights and combining learner-specific conformity scores via a weighted majority vote, and characterize the properties of the resulting SL-based prediction intervals for continuous...
Zhan Wu, Fabrizio Leisen, M. Luque-fernandez et al.· arXiv.org· 1 citation
A key capability of modern neural networks is their capacity to simultaneously learn underlying rules and memorize specific facts or exceptions. Yet, theoretical understanding of this dual capability remains limited. We introduce the Rules-and-Facts (RAF) model, a minimal solvable setting that enables precise character...
Generating samples from limited information is a fundamental problem across scientific domains. Classical maximum entropy methods provide principled uncertainty quantification from moment constraints but require sampling via MCMC or Langevin dynamics, which typically exhibit exponential slowdown in high dimensions. In...
A residual-augmented probabilistic operator learning framework that casts flow-matching-based generative modeling in infinite-dimensional function spaces while leveraging inexpensive low-fidelity solution operators as an inductive bias and enables accurate characterization of uncertainty in low-data regimes.
This work extends the recently introduced Alpha-Procrustes family of Riemannian metrics for symmetric positive definite (SPD) matrices by incorporating generalized versions of the Bures-Wasserstein (GBW), Log-Euclidean, and Wasserstein distances. While the Alpha-Procrustes framework has unified many classical metrics i...
Salvish Goomanee, Andi Han, P. Jawanpuria et al.· arXiv.org· 0 citations
This work introduces and studies hyper-kernel ridge regression (HKRR), an approach blending neural networks and kernel methods, and exploits the kernel nature of the estimator to develop ad hoc optimization approaches.
Shuo Huang, Hippolyte Labarrière, E. De Vito et al.· arXiv.org· 2 citations
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 8, 2026