On Mean Estimation for General Norms with Statistical Queries

02/07/2019
by   Jerry Li, et al.
0

We study the problem of mean estimation for high-dimensional distributions, assuming access to a statistical query oracle for the distribution. For a normed space X = (R^d, ·_X) and a distribution supported on vectors x ∈R^d with x_X≤ 1, the task is to output an estimate μ̂∈R^d which is ϵ-close in the distance induced by ·_X to the true mean of the distribution. We obtain sharp upper and lower bounds for the statistical query complexity of this problem when the the underlying norm is symmetric as well as for Schatten-p norms, answering two questions raised by Feldman, Guzmán, and Vempala (SODA 2017).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/30/2022

Fast Distance Oracles for Any Symmetric Norm

In the Distance Oracle problem, the goal is to preprocess n vectors x_1,...
research
04/10/2019

New Computational and Statistical Aspects of Regularized Regression with Application to Rare Feature Selection and Aggregation

Prior knowledge on properties of a target model often come as discrete o...
research
11/19/2019

Sequential Mode Estimation with Oracle Queries

We consider the problem of adaptively PAC-learning a probability distrib...
research
11/20/2016

Dealing with Range Anxiety in Mean Estimation via Statistical Queries

We give algorithms for estimating the expectation of a given real-valued...
research
05/29/2020

Query complexity of heavy hitter estimation

We consider the problem of identifying the subset 𝒮^γ_𝒫 of elements in t...
research
11/09/2020

Statistical Query Complexity of Manifold Estimation

This paper studies the statistical query (SQ) complexity of estimating d...
research
08/03/2023

Tight Bounds for Local Glivenko-Cantelli

This paper addresses the statistical problem of estimating the infinite-...

Please sign up or login with your details

Forgot password? Click here to reset