Feature disentanglement and tendency retainment with domain adaptation for lithium-ion battery capacity estimation
Online capacity estimation of lithium-ion batteries plays an important role in battery
management systems. Accurate estimation of the current capacity of the battery is helpful for …
management systems. Accurate estimation of the current capacity of the battery is helpful for …
Distributionally robust optimization and robust statistics
We review distributionally robust optimization (DRO), a principled approach for constructing
statistical estimators that hedge against the impact of deviations in the expected loss …
statistical estimators that hedge against the impact of deviations in the expected loss …
Robust bayesian recourse
Algorithmic recourse aims to recommend an informative feedback to overturn an
unfavorable machine learning decision. We introduce in this paper the Bayesian recourse, a …
unfavorable machine learning decision. We introduce in this paper the Bayesian recourse, a …
Counterfactual plans under distributional ambiguity
Counterfactual explanations are attracting significant attention due to the flourishing
applications of machine learning models in consequential domains. A counterfactual plan …
applications of machine learning models in consequential domains. A counterfactual plan …
Meta two-sample testing: Learning kernels for testing with limited data
Modern kernel-based two-sample tests have shown great success in distinguishing
complex, high-dimensional distributions by learning appropriate kernels (or, as a special …
complex, high-dimensional distributions by learning appropriate kernels (or, as a special …
A class of geometric structures in transfer learning: Minimax bounds and optimality
We study the problem of transfer learning, observing that previous efforts to understand its
information-theoretic limits do not fully exploit the geometric structure of the source and …
information-theoretic limits do not fully exploit the geometric structure of the source and …
Coverage-validity-aware algorithmic recourse
Algorithmic recourse emerges as a prominent technique to promote the explainability,
transparency and hence ethics of machine learning models. Existing algorithmic recourse …
transparency and hence ethics of machine learning models. Existing algorithmic recourse …
Robust SGLD algorithm for solving non-convex distributionally robust optimisation problems
In this paper we develop a Stochastic Gradient Langevin Dynamics (SGLD) algorithm
tailored for solving a certain class of non-convex distributionally robust optimisation …
tailored for solving a certain class of non-convex distributionally robust optimisation …
Universal generalization guarantees for Wasserstein distributionally robust models
Distributionally robust optimization has emerged as an attractive way to train robust machine
learning models, capturing data uncertainty and distribution shifts. Recent statistical …
learning models, capturing data uncertainty and distribution shifts. Recent statistical …
Distributionally and adversarially robust logistic regression via intersecting Wasserstein balls
Empirical risk minimization often fails to provide robustness against adversarial attacks in
test data, causing poor out-of-sample performance. Adversarially robust optimization (ARO) …
test data, causing poor out-of-sample performance. Adversarially robust optimization (ARO) …