Minimax rates for memory-bounded sparse linear regression

48 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Memory, Communication, and Statistical Queries (2016, methodology): “We can further strengthen Corollary 4 by adapting a result from Blum et al. (2003) concerning “k-ary” statistical queries, which are statistical queries that can depend on k independent examples rather than only a single example.”
On the Randomized Complexity of Minimizing a Convex Quadratic Function (2018, background): “Other works have considered lower bounds which hold when the optimization algorithm is subject to memory constraints [28, 27, 25].”
Dealing with Range Anxiety in Mean Estimation via Statistical Queries (2016, background): “Identical and closely related models are often studied in the context of distributed statistical estimation with communication constraints (e.g. Luo, 2005; Rajagopal et al., 2006; Ribeiro and Giannakis, 2006; Zhang et al., 2013; Steinhardt and Duchi, 2015; Steinhardt et al., 2016; Suresh et al., 201”
A General Characterization of the Statistical Query Complexity (2016, background): “Learning with this oracle and related models have been studied in a number of recent works (Feldman et al., 2012; Zhang et al., 2013; Feldman et al., 2013; Steinhardt and Duchi, 2015; Steinhardt et al., 2016).”