arXiv Machine Learning
Unification and Optimization of Robust Supervised Learning
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
Jul 1
A Unified and Stable Risk Minimization Framework for Weakly Supervised Learning with Theoretical Guarantees
arXiv:2511. 22823v2 Announce Type: replace-cross Abstract: Weakly supervised learning has emerged as a practical alternative to fully supervised learning when complete and accurate labels are costly or infeasible to acquire.
arXiv Machine Learning
Jul 7
Robustness Meets Uncertainty: Evidential Adversarial Training for Robust Selective Classification
arXiv:2607. 03075v1 Announce Type: new Abstract: Safety-critical applications require classifiers that are both robust and reliable.
arXiv Machine Learning
Sep 15
Machine Learning under Imperfect Data: Challenges and Methods
arXiv:2609.13914v1 Announce Type: new Abstract: Machine-learning models are commonly developed under an assumption that training and test data are sufficiently complete, balanced, labelled, and drawn...
arXiv Machine Learning
Sep 30
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.
arXiv Machine Learning
Jul 8
Higher-Order Certified Robustness for Regression
arXiv:2607. 05536v1 Announce Type: cross Abstract: Randomized smoothing has emerged as a scalable technique for certifying the adversarial robustness of classifiers.
arXiv AI
Jul 29
Generative Distributionally Robust Optimization
arXiv:2607. 24983v1 Announce Type: cross Abstract: Generative models are increasingly adopted in distributionally robust optimization (DRO), but existing approaches trade off model compatibility and adversarial structure: methods that accept arbitrary samplers do not restrict worst-case laws to a generator family, while generator-parameterized adversaries rely on model-specific access such as likelihoods, scores, or training data.