AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

High-dimensional Location Estimation via Norm Concentration for Subgamma Vectors

Shivam Gupta, Jasper C.H. Lee, Eric Price

ICML 2023 · Learning theory and algorithms › Sample complexity · approach: Distributed estimation under communication limits · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Extend smoothed MLE analysis to high dimensions using subgamma norm concentrationHigh-dimensional Global MLE · High-dimensional location estimationEuclidean estimation error: (1 + \eta) \sqrt{\Tr(\mathcal{I}_R^{-1})/n} + 5 \sqrt{\norm{\mathcal{I}_R^{-1}} \log(4/\delta)/n}Improved
Generalize directional subgaussian norm concentration to vectors with subgamma marginalsNorm concentration bound · Subgamma random vectorshigh-probability norm bound: \sqrt{\Tr(\Sigma)} + 4\sqrt{\norm{\Sigma}\log(2/\delta)} + 16\norm{C}\log(2/\delta) + \min(4\norm{C}_F\sqrt{\log(2/\deltImproved
Use root-finding for the empirical score rather than a one-step Newton update1D smoothed MLE · 1D location estimationfinite-sample estimation errorHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy