AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Sample Complexity of Learning Mixture of Sparse Linear Regressions

Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor, Soumyabrata Pal

NeurIPS 2019 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of learning distributions · 7 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
Recover Gaussian-mixture means using the epsilon-grid constraintNoisy Recovery · Noisy Gaussian, two vectorssample complexity dependence on sigma/epsilon: \exp(\sigma/\epsilon) -> \exp( (\sigma/\epsilon)^{2/3} )Improved
Use redundant sum and difference queries for alignmentNoisy Recovery · Noisy Gaussian, two vectorsalignment correctnessImproved
Allow dense signals and recover their best k-sparse approximationsNoisy Recovery · Noisy Gaussian, L=O(1)reconstruction guaranteeImproved
Remove the restrictive overlap assumption on signal supportsNoiseless Recovery and Noisy Recovery · Noiseless and noisy sparse regression mixturesapplicability to signal collectionsImproved

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