Skip to content
Sagan

Paper

Optimal Dimension-Free Sampling for Regularized Classification

Unreadunread

AI summary

arXiv:2605. 23726v1 Announce Type: cross Abstract: We prove optimal sampling bounds achieving $(1\pm\varepsilon)$-relative error for a broad class of Lipschitz continuous classification loss functions under various regularization terms.