Sparse linear regression and lattice problems
From MaRDI portal
Cites work
- A hierarchy of polynomial time lattice basis reduction algorithms
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- Adaptive estimation of a quadratic functional by model selection.
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- Atomic Decomposition by Basis Pursuit
- Classical hardness of learning with errors
- Continuous LWE
- Continuous LWE is as hard as LWE \& applications to learning Gaussian mixtures
- Factoring polynomials with rational coefficients
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Inference in High-Dimensional Linear Regression via Lattice Basis Reduction and Integer Relation Detection
- Non-asymptotic theory of random matrices: extreme singular values
- On Bounded Distance Decoding for General Lattices
- On lattices, learning with errors, random linear codes, and cryptography
- On Lovász' lattice reduction and the nearest lattice point problem
- On the hardness of learning with errors with binary secrets
- Public-key cryptosystems from the worst-case shortest vector problem
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Trapdoors for lattices: simpler, tighter, faster, smaller
This page was built for publication: Sparse linear regression and lattice problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6952846)
