stat.MLNov 18, 2026

Improved Leverage Score Sampling for Constrained Active Linear Regression

Authors: Aarshvi Gajjar, Syamantak Kumar, Aditya Makkar, Christopher Musco, Joey Zhou

Organizations: New York University · University of Texas at Austin

Abstract

In this paper we study active learning for constrained linear regression. Given a design matrix A∈Rn×dA\in\mathbb{R}^{n\times d}, a constraint set C⊆RdC\subseteq\mathbb{R}^d, and query access to b∈Rnb\in\mathbb{R}^n, we seek an approximate solution to min⁡x∈C∥Ax−b∥22\min_{x\in C}\|Ax-b\|_2^2 using as few queries as possible. This problem arises in many scientific and engineering applications, and randomized leverage score sampling provides a powerful method to solve it. However, existing leverage score methods ignore the constraint or encode it through ridge regularization, suffering unfavorable query complexity for anisotropic constraint sets. We propose ellipsoid-regularized leverage scores, where we approximate the constraint set by an outer ellipsoid and use its shape matrix to bias sampling toward directions that matter under the constraint geometry. We prove that the query complexity is governed by an anisotropic effective dimension deff(C)≤dd_{\text{eff}}(C)\le d. With appropriate parameters, O(deff(C)log⁡d/ε2)O(d_{\text{eff}}(C)\log d/\varepsilon^2) queries suffice to return a point in CC with objective value at most (1+ε)(1+\varepsilon) times the optimum. This bound can substantially improve on the standard leverage-score bound, since anisotropic constraints can make deff(C)d_{\text{eff}}(C) much smaller than dd. For convex constraints, we improve the dependence on ε\varepsilon from 1/ε21/\varepsilon^2 to 1/ε1/\varepsilon. We also prove two lower bounds: first, the d/ε2d/\varepsilon^2 dependence is unavoidable without convexity assumptions on CC, and second, in some regimes, the effective dimension dependence deff(C)/εd_{\mathrm{eff}}(C)/\varepsilon is necessary for ellipsoidal constraints. Experiments on synthetic regression problems and a parametric heat conduction problem show lower regression error than standard baselines for similar query budget.

Explore similar work

CardsList
  1. The Approximation Ratio for the Risk of Myopic Bayesian Active Learning for Linear Regression

    Jul 7, 2026Stephen MussmannActive LearningLinear Regression

  2. Active Regression for Single-Index Models with Unknown Link Functions

    Aug 2, 2026Chansophea Wathanak In, Yi Li, Wai Ming Tai +1Single-Index ModelsActive Learning

  3. Robust Regression of General ReLUs with Queries

    Jun 9, 2026Ilias Diakonikolas, Daniel M. Kane, Mingchen MaReLU Neural NetworksActive Learning