Online Active Linear Regression via Thresholding
We consider the problem of online active learning to collect data for regression modeling. Specifically, we consider a decision maker with a limited experimentation budget who must efficiently learn an underlying linear population model. Our main contribution is a novel threshold-based algorithm for selection of most informative observations; we characterize its performance and fundamental lower bounds. We extend the algorithm and its guarantees to sparse linear regression in high-dimensional settings. Simulations suggest the algorithm is remarkably robust: it provides significant benefits over passive random sampling in real-world datasets that exhibit high nonlinearity and high dimensionality --- significantly reducing both the mean and variance of the squared error.
Code (0)
등록된 구현이 없습니다.
Tasks
Active LearningregressionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Sparse Methods for Automatic Relevance Determination
This work considers methods for imposing sparsity in Bayesian regression with applications in nonlinear system identification. We first review automatic relevance determination (ARD) and analytically demonstrate the need…
regressionLearning Fast Approximations of Sparse Nonlinear Regression
The idea of unfolding iterative algorithms as deep neural networks has been widely applied in solving sparse coding problems, providing both solid theoretical analysis in convergence rate and superior empirical performan…
regressionAdaptive Iterative Hard Thresholding for Online High-dimensional Quantile Regression
Online high-dimensional regression requires algorithms that can update sequentially while preserving structural sparsity. We propose \textit{Adaptive Iterative Hard Thresholding (AIHT)}, an online sparse-regression frame…
Convergence of uncertainty estimates in Ensemble and Bayesian sparse model discovery
Sparse model identification enables nonlinear dynamical system discovery from data. However, the control of false discoveries for sparse model identification is challenging, especially in the low-data and high-noise limi…
Model DiscoveryregressionUncertainty Quantificationvalid+1Nonlinear Granger Causality using Kernel Ridge Regression
I introduce a novel algorithm and accompanying Python library, named mlcausality, designed for the identification of nonlinear Granger causal relationships. This novel algorithm uses a flexible plug-in architecture that …
regression