arXiv Statistics ML By Aoran Chen, Yang Feng

Reweighting for Transfer Classification: Exact Risk Conversion and Minimax Adaptation

Read the original on arXiv Statistics ML →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Statistics ML.

arXiv Machine Learning
Oct 2

How Accurate Is Accurate Enough?

The paper investigates how the magnitude of numerical errors in a learning system should be evaluated, arguing that error impact depends on the current learning state, the class affected, and the class weight. By analyzing softmax cross‑entropy, the authors derive exact bounds on loss changes for fixed error sets and use these to provide finite‑error guarantees for losses, probabilities, predictions, and gradients. They then invert these guarantees to certify the maximum allowable primitive error for a given learning‑level requirement, demonstrating through von Mises‑Fisher learning that identical errors can have vastly different effects across states.

By Ningkang Peng, Qianfeng Yu, Jingyang Mao, Xiaoqian Peng, Yanhui Gu
arXiv Statistics ML
Oct 1

Constrained Classification and Policy Learning

The paper investigates the consistency of surrogate loss methods for classification and policy learning when the set of admissible classifiers is constrained, such as by interpretability or fairness requirements. It shows that hinge loss is the only surrogate that preserves consistency when constraints limit only the prediction set, but consistency can fail if constraints also restrict the functional form. The authors derive conditions guaranteeing consistency for hinge-risk-minimizing classifiers and use these results to design efficient hinge-loss-based procedures for monotone classification problems.

By Toru Kitagawa, Shosei Sakaguchi, Aleksey Tetenov