Minimax Lower Bounds for H_∞-Norm Estimation

09/28/2018
by   Stephen Tu, et al.
0

The problem of estimating the H_∞-norm of an LTI system from noisy input/output measurements has attracted recent attention as an alternative to parameter identification for bounding unmodeled dynamics in robust control. In this paper, we study lower bounds for H_∞-norm estimation under a query model where at each iteration the algorithm chooses a bounded input signal and receives the response of the chosen signal corrupted by white noise. We prove that when the underlying system is an FIR filter, H_∞-norm estimation is no more efficient than model identification for passive sampling. For active sampling, we show that norm estimation is at most a factor of r more sample efficient than model identification, where r is the length of the filter. We complement our theoretical results with experiments which demonstrate that a simple non-adaptive estimator of the norm is competitive with state-of-the-art adaptive norm estimation algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2018

Adaptive distributed methods under communication constraints

We study distributed estimation methods under communication constraints ...
research
08/25/2020

Minimax estimation of norms of a probability density: I. Lower bounds

The paper deals with the problem of nonparametric estimating the L_p–nor...
research
08/25/2020

Minimax estimation of norms of a probability density: II. Rate-optimal estimation procedures

In this paper we develop rate–optimal estimation procedures in the probl...
research
05/16/2019

Adaptive estimation in the linear random coefficients model when regressors have limited variation

We consider a linear model where the coefficients-intercept and slopes-a...
research
09/30/2022

Optimal Query Complexities for Dynamic Trace Estimation

We consider the problem of minimizing the number of matrix-vector querie...
research
03/30/2019

On the longest common subsequence of Thue-Morse words

The length a(n) of the longest common subsequence of the n'th Thue-Morse...
research
02/17/2021

Robust Mean Estimation in High Dimensions via Global Outlier Pursuit

We study the robust mean estimation problem in high dimensions, where le...

Please sign up or login with your details

Forgot password? Click here to reset