Weighted split conformal prediction reweights calibration scores by the likelihood ratio between the test and training covariate distributions and guarantees marginal coverage under covariate shift. We study its coverage conditional on the calibration data. An elementary argument, based on a single concentration inequa...
It is found that multiple responses provide a qualitatively stronger benefit in this setting of generative systems, and is shown that a greedy multiplicative-weights learner achieving the upper bounds without any assumption on demonstrator quality is possible.
Finite-sample bounds are derived that separate the effects of critic estimation, neural drift regression, finite-sample SNIS, diffusion discretization, and inherited actor error on expected average policy suboptimality.
Yu-Ling Jiao, Li-Can Kang, Jerry Zhijian Yang et al.· 0 citations
A convex combination of one-step and two-step residuals with a fixed mixing weight is considered to provide a natural bias--variance trade-off between approximation error under a restricted value-function class and the increased variance arising from multi-step importance weighting.
TabCon is developed, an amortized inference system built on a tabular foundation model that produces confidence intervals for new datasets through a simple forward pass, and offers considerably greater computational efficiency than the classical bootstrap procedure.
Kai Ye, Shi-Jin Gong, Hong-Yi Zhou et al.· 0 citations
Retrieval-augmented generation (RAG) lets language models answer questions more accurately by consulting relevant documents. Many valuable collections, such as medical records, cannot be pooled because of privacy rules. Federated RAG leaves each collection with its owner, or node, which scores candidate answers from it...
We propose sliced Orlicz-Wasserstein (SOW) distance which is a generalization of sliced Wasserstein (SW) distance. SOW replaces the $L^p$ norm in SW with a Luxemburg norm cost induced by an Orlicz function $\phi$. First, we prove that SOW distance is a metric on the space of measures with finite Orlicz norm, and show t...
A doubly-anchored DRO framework whose ambiguity set is the intersection of $\phi$-divergence balls centered at the source law and a source-completed target reference law, the latter pairing the target covariate law with the source conditional law is introduced.
A visibility estimate shows that the expected number of switches that do not produce scalar kinks is negligible, yielding an explicit leading formula for the expected number of scalar kinks and hence affine regions.
This work presents a new approach that leverages a multitask GP model to jointly learn all objectives and constraints, and proposes a total correlation metric that enables identifying an ${optimal}$ subset of objectives and constraints to be evaluated at every round, even under uniform evaluation costs.
A matching lower bound for the class of linear predictors is established and a challenging sequential covariate distribution supported on mutually orthogonal hyperplanes is constructed in explicitly constructing a challenging sequential covariate distribution.
A training-free adaptive ensemble conditional score filter is proposed, which recasts noisy posterior score estimation as estimating the conditional mean of the system state given a noisy reverse particle and the observation, and establishes a bound relating conditional-mean estimation errors to reverse-sampling endpoi...
Yang-Wen Zhang, Shi-Wei Ni, Xiao-Ping Zhang et al.· 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.