Understanding Uncertainty Sampling via Equivalent Loss
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The Flow has not summarised this story yet — read it at arXiv Machine Learning.
arXiv:2610.23477v1 Announce Type: cross Abstract: We consider the problem of online linear classification, where a stream of unlabeled samples is available, and annotation is costly. We investigate t...
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.
arXiv:2610. 10499v1 Announce Type: new Abstract: Online learning is an attractive framework in many domains because it permits well-defined learning even when data are dependent or chosen adversarially.
arXiv:2603. 05774v2 Announce Type: replace Abstract: This paper addresses the distributed stochastic minimax optimization problem subject to stochastic constraints.
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...
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.