arXiv Machine Learning By Mingyuan Zhang

Exact Rank and Convex Calibration Dimension Lower Bounds for the Multi-Label F1 Loss

Read the original on arXiv Machine Learning →

arXiv:2608. 08399v1 Announce Type: new Abstract: The instance-wise $F_1$ measure is a central performance measure for multi-label classification.

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 Machine Learning.

arXiv Machine Learning
Sep 11

Thompson Sampling for Non-Monotone Convex Ridge Bandits: Monotonicity Is Not Needed for Polynomial Regret

arXiv:2609. 10981v1 Announce Type: new Abstract: Bakhtiari, Lattimore and Szepesv\'ari (COLT 2025) proved that Thompson sampling (TS) has Bayesian regret $\tilde O(d^{5/2}\sqrt n)$ for bandit convex optimisation with convex \emph{monotone} ridge losses $f(x)=\ell(\ip{x}{\theta})$, and asked whether monotonicity of the link is necessary.

By Xuan Li