Login / Signup
Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching.
Arturs Backurs
Piotr Indyk
Eric Price
Ilya P. Razenshteyn
David P. Woodruff
Published in:
CoRR (2015)
Keyphrases
</>
worst case
tight bounds
sparse representation
upper bound
dynamic programming
lower bound
optimal solution
high dimensional
closed form
optimal control
asymptotically optimal
domain specific
generative model
neural network
approximation algorithms
optimal strategy
optimal design
upper and lower bounds