English

Active Regression for Single-Index Models with Unknown Link Functions

Data Structures and Algorithms 2026-08-02 v1 Machine Learning

Abstract

This paper studies active regression for single-index models under general p\ell_p-loss with an unknown 11-Lipschitz link function ff, formulated as minf,xf(Ax)bpp\min_{f,x} \|f(Ax)-b\|_p^p with full access to AA but coordinate-query access to bb. Prior work established upper bounds for known link functions for all p1p\geq 1 and for unknown link functions only in the p=2p=2 case, together with lower bounds for p2p\leq 2. This work addresses the more challenging setting of unknown link functions and general p1p \geq 1. A non-adaptive sampling algorithm is presented that achieves a (1+ϵ)(1+\epsilon)-approximation using O(dp/21/ϵp2polylog(n/ϵ))O(d^{p/2\vee 1}/\epsilon^{p\vee 2}\operatorname{poly}\log(n/\epsilon)) queries. Nearly tight lower bounds are also established for p>2p>2. These results close much of the remaining gap in active p\ell_p-regression for single-index models.

Cite

@article{arxiv.2608.01287,
  title  = {Active Regression for Single-Index Models with Unknown Link Functions},
  author = {Chansophea Wathanak In and Yi Li and Wai Ming Tai and Xuan Wu},
  journal= {arXiv preprint arXiv:2608.01287},
  year   = {2026}
}

Comments

Earlier version accepted to ICML 2026; the lower bound has been extended to adaptive queries