We certify federated learning model performance under meta-distribution shifts.
problem Certifying model performance on unseen networks with heterogeneous distributions.
method Derive worst-case uniform guarantees for federated learning model's average loss and risk CDF.
result Asymptotically minimax optimal and privacy-preserving certification.
In learning-to-learn the goal is to infer a learning algorithm that works well on a class of tasks sampled from an unknown meta distribution. In contrast to previous work on batch learning-to-learn, we consider a scenario where tasks are presented sequentially and the algorithm needs to adapt incrementally to improve i…
Domain generalization is the problem of machine learning when the training data and the test data come from different data domains. We present a simple theoretical model of learning to generalize across domains in which there is a meta-distribution over data distributions, and those data distributions may even have dif…
Paper shows how meta-learning can reduce prior learning cost.
problem Learning the prior in meta-learning with fast rates.
method Examined Gibbs algorithm in meta-learning context.
result Bernstein's condition holds at meta level, reducing prior learning cost.
We present the expected values from p-value hacking as a choice of the minimum p-value among m independents tests, which can be considerably lower than the "true" p-value, even with a single trial, owing to the extreme skewness of the meta-distribution. We first present an exact probability distribution (meta-distrib…
A method for fast estimation of Wasserstein distances using sliced Wasserstein distances.
problem Efficiently computing Wasserstein distances for multiple pairs of distributions.
method Regression on sliced Wasserstein distances to predict true Wasserstein distances.
result The proposed method provides a better approximation of Wasserstein distance than state-of-the-art models, especially in low-data regimes.
Paper explores how uncertainty quantification improves Transformer's in-context learning ability.
problem Understanding and quantifying in-context learning ability of Transformers.
method Revisit linear regression tasks with bi-objective prediction (conditional expectation and variance).
result Trained Transformers achieve near Bayes-optimum performance, suggesting use of training distribution.
Federated learning studies separate client data and distribution gaps.
problem Understanding performance differences in federated learning across different datasets.
method Proposed a framework to disentangle out-of-sample and participation gaps.
result Dataset synthesis strategy is crucial for realistic simulations of federated learning generalization.
We study few-shot supervised domain adaptation (DA) for regression problems, where only a few labeled target domain data and many labeled source domain data are available. Many of the current DA methods base their transfer assumptions on either parametrized distribution shift or apparent distribution similarities, e.g.…
Meta-learning improves with explicit modeling of task covariate distributions.
problem Ignoring the relationship between task covariates and conditional distributions limits meta-learning performance.
method Introducing a hierarchical Bayesian model that leverages samples from the marginal task covariates to better infer optimal parameters.
result Our method outperforms initialization-based meta-learning on popular classification benchmarks.
Study questions the reliability of uncertainty quantification in evidential deep learning.
problem Reliability of uncertainty quantification in evidential deep learning.
method Analysis of evidential deep learning methods, revealing their limitations and interpreting them as out-of-distribution detection algorithms.
result EDL methods are unreliable in quantifying uncertainty, even when effective on downstream tasks.
Proposes a framework for semi-supervised continual learning from sequentially arriving data.
problem Learning from data with changing task distribution over time, especially in domains with a mix of labeled and unlabeled data.
method Meta-Consolidation for Continual Semi-Supervised Learning (MCSSL) framework with a hypernetwork and semi-supervised auxiliary classifier.
result Significant improvements in continual semi-supervised learning setting.
Proposes a new probabilistic framework for domain generalization.
problem Learning predictors robust to unseen domain shifts.
method Quantile Risk Minimization (QRM) and Empirical QRM (EQRM) algorithms.
result Empirical QRM outperforms state-of-the-art baselines on various datasets.
Paper introduces a novel framework for set input tasks in meta-learning.
problem Meta-learning problems with set inputs often require efficient summary networks.
method Prototype-oriented optimal transport (POT) framework to improve summary networks.
result Significantly improves summary statistics from sets in meta-learning.