Optimal Reconstruction from Linear Queries
Yuval Filmus, Shay Moran, Elizaveta Nesterova

TL;DR
This paper characterizes the optimal reconstruction error for an unknown point in high-dimensional space from approximate linear queries, revealing exponential query complexity and a generalized geometric theorem.
Contribution
It introduces a generalized Jung's theorem and analyzes the asymptotic behavior of reconstruction error in high-dimensional settings.
Findings
Optimal error converges to rac{2d}{d+1}rac{elta}
Excess error decays doubly exponentially with the number of queries for fixed dimension
xp(d) queries are needed for vanishing error in high dimensions
Abstract
We study the problem of reconstructing an unknown point in from approximate linear queries. This setting arises naturally in applications ranging from low-dimensional remote sensing and signal recovery to high-dimensional data analysis and privacy-sensitive inference. Our main goal is to characterize the optimal reconstruction error as a function of the number of queries , the ambient dimension , and the noise parameter . We first analyze the limit and show that the optimal reconstruction error converges to the explicit value , which plays a role analogous to the Bayes optimal error in supervised learning. When the dimension is fixed, we show that the excess error above this limit decays doubly exponentially fast as , a rate that is significantly faster than those typically encountered in learning…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
