mlsanityData to 14 Oct 2026

Active Regression for Single-Index Models with Unknown Link Functions

arXiv 2608.01287 ↗First posted 2 Aug 2026cs.DS cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

This paper studies active regression for single-index models under general ℓp-loss with an unknown 1-Lipschitz link function f, formulated as minf,x |f(Ax)-b|pp with full access to A but coordinate-query access to b. Prior work established upper bounds for known link functions for all p≥ 1 and for unknown link functions only in the p=2 case, together with lower bounds for p≤ 2. This work addresses the more challenging setting of unknown link functions and general p ≥ 1. A non-adaptive sampling algorithm is presented that achieves a (1+ε)-approximation using O(dp/2vee 1/εpvee 2operatornamepolylog(n/ε)) queries. Nearly tight lower bounds are also established for p>2. These results close much of the remaining gap in active ℓp-regression for single-index models.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 13 references that are in the map. First posted on arXiv 2 Aug 2026.

Builds on

7 of 13 references.

References · 7

  1. 2014Sketching as a Tool for Numerical Linear Algebracited by 288
  2. 2021L1 Regression with Lewis Weights Subsamplingcited by 14
  3. 2022Active Learning for Single Neuron Models with Lipschitz Non-Linearitiescited by 12
  4. 2024Agnostic Active Learning of Single Index Models with Linear Sample Complexitycited by 11
  5. 2024On computing approximate Lewis weightscited by 2
  6. 2024One-shot Active Learning Based on Lewis Weight Sampling for Multiple Deep Modelscited by 2
  7. 2025Near-optimal Active Regression of Single-Index Modelscited by 2

Built on by

Not cited yet.