arXiv Statistics ML By Kaito Ito, Alexandre Proutiere

Optimal Centered Active Excitation in Linear System Identification

Read the original on arXiv Statistics ML →

The paper introduces an active learning algorithm for linear system identification that uses optimal centered noise excitation. It employs ordinary least squares and semidefinite programming to achieve minimal sample complexity while enabling efficient computation of the system matrix estimate. The authors provide both lower and upper bounds on sample complexity that match up to universal factors and explicitly depend on system parameters such as state dimension.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Statistics ML.

Hugging Face Trending Papers
Aug 2

Active Regression for Single-Index Models with Unknown Link Functions

This paper studies active regression for single-index models under general $\ell_p$-loss with an unknown $1$-Lipschitz link function $f$, formulated as $\min_{f,x} \|f(Ax)-b\|_p^p$ with full access to $A$ but coordinate-query access to $b$. Prior work established upper bounds for known link functions for all $p\geq 1$ and for unknown link functions only in the $p=2$ case, together with lower bounds for $p\leq 2$.

arXiv Machine Learning
Aug 17

Active Regression via Linear-Sample Sparsification

arXiv:1711. 10051v4 Announce Type: replace Abstract: We present an approach that improves the sample complexity for a variety of curve fitting problems, including active learning for linear regression, polynomial regression, and continuous sparse Fourier transforms.

By Xue Chen, Eric Price