Robust decoding from binary measurements with cardinality constraint least squares
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 6982301 (Why is no real title available?)
- scientific article; zbMATH DE number 6982922 (Why is no real title available?)
- A general theory of concave regularization for high-dimensional sparse estimation problems
- A mathematical introduction to compressive sensing
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- An approach to one-bit compressed sensing based on probably approximately correct learning theory
- Compressed sensing
- Estimation in high dimensions: a geometric perspective
- Hard thresholding pursuit: an algorithm for compressive sensing
- High-dimensional estimation with geometric constraints
- Minimax Rates of Estimation for High-Dimensional Linear Regression Over \ell_q-Balls
- Noisy 1-bit compressive sensing: models and algorithms
- One-Bit Compressive Sensing With Norm Estimation
- One-bit compressed sensing by greedy algorithms
- One-bit compressed sensing by linear programming
- One-bit compressed sensing with non-Gaussian measurements
- One-bit compressive sensing of dictionary-sparse signals
- Optimal prediction for sparse linear models? Lower bounds for coordinate-separable M-estimators
- Regime Change: Bit-Depth Versus Measurement-Rate in Compressive Sensing
- Regression analysis under link violation
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
- Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
- Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares
- Robust decoding from binary measurements with cardinality constraint least squares
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Structured Signal Recovery From Non-Linear and Heavy-Tailed Measurements
- The Generalized Lasso With Non-Linear Observations
- Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements
- L₁-regularized least squares for support recovery of high dimensional single index models with Gaussian designs
This page was built for publication: Robust decoding from binary measurements with cardinality constraint least squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909414)
