arXiv Statistics ML
Nov 9

Reweighting for Transfer Classification: Exact Risk Conversion and Minimax Adaptation

The paper investigates how reweighting a source training mixture affects target classification risk. It derives exact excess hinge‑risk bounds for binary classification, provides a two‑sample oracle inequality for weighted SVMs, and establishes minimax rates that separate source sampling uncertainty from relation uncertainty. The results show that the usefulness of a source depends on the training problem it creates, the relevance of its accuracy to the target, and the ability to apply corrective weighting.

By Aoran Chen, Yang Feng
arXiv Machine Learning
Sep 10

Large Classification-Risk-Optional Label Acquisition

arXiv:2609.06873v1 Announce Type: cross Abstract: We study how a limited labeling budget should be allocated to minimize multiclass zero-one classification risk. We consider parametric classification...

By F. Setoudehtanzangi, Geoffrey J. McLachlan
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.

By Vinit Ranjan, Jisun Park, Bartolomeo Stellato