arXiv Machine Learning

Learning Credal Ensembles via Distributionally Robust Optimization

arXiv:2602. 08470v3 Announce Type: replace Abstract: Credal predictors are models that are aware of epistemic uncertainty and produce a convex set of probabilistic predictions.

arXiv Machine Learning
Aug 31

Explainable Uncertainty Estimation for Reliable Medical AI

The paper introduces egRUE, an explainable uncertainty estimation method that merges uncertainty quantification with feature‑level explanations for medical AI predictions. egRUE incorporates prediction explanations into its uncertainty calculation and decomposes uncertainty into contributions from individual features. Experiments and a user study with medical experts show that egRUE improves reliability, interpretability, and calibrated trust compared to existing methods.

By Li Rong Wang, Jamie Duell, Xinran Xu, Thomas C. Henderson, Yu Yue Hew, Pik Wan Erica Chiang, Xiao Wei Alstar Ang, Bingwen Eugene Fan, Xiuyi Fan
arXiv Machine Learning
Jun 26

Learning from a Biased Sample

arXiv:2209. 01754v5 Announce Type: replace-cross Abstract: The empirical risk minimization approach to data-driven decision making requires access to training data drawn under the same conditions as those that will be faced when the decision rule is deployed.

By Roshni Sahoo, Lihua Lei, Stefan Wager
arXiv Machine Learning
Jul 27

Smart predict-then-robustly-optimize

arXiv:2607. 21773v1 Announce Type: new Abstract: In this paper, we propose and study a robust variant of the smart predict-then-optimize approach that accounts for prediction shifts due to disturbance in the covariate feature space.

By Aakil Caunhye, Xuefei Lu, Belen Martin-Barragan
arXiv Machine Learning
4d ago

Learning Distributionally Robust First-Order Methods for Convex Optimization

The paper introduces a distributionally robust method for learning hyperparameters of first‑order convex optimization algorithms. By minimizing a Wasserstein‑robust performance estimation problem over a dataset of problem instances, the approach interpolates between classical learning‑to‑optimize (L2O) and worst‑case PEP design. The authors solve the resulting problem with stochastic gradient descent, provide high‑probability risk bounds, and demonstrate that the learned algorithms outperform both worst‑case optimal and vanilla L2O baselines on logistic regression, LASSO, and linear programming tasks.

By Vinit Ranjan, Jisun Park, Bartolomeo Stellato