Distributed Decoding From Heterogeneous 1-Bit Compressive Measurements

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
Nearly unbiased variable selection under minimax concave penalty
Fixed-point algorithms for inverse problems in science and engineering. Based on the presentations at the interdisciplinary workshop, BIRS, Banff, Canada, November 1--6, 2009.
Matrix-free interior point method for compressed sensing problems
Noisy 1-bit compressive sensing: models and algorithms
Asymptotics of graphical projection pursuit
Communication-efficient algorithms for decentralized and stochastic optimization
On the ``degrees of freedom of the lasso
High-dimensional graphs and variable selection with the Lasso
L1-Regularized Least Squares for Support Recovery of High Dimensional Single Index Models with Gaussian Designs
Inverse Problems
Optimization with Sparsity-Inducing Penalties
Shrinkage Tuning Parameter Selection with a Diverging number of Parameters
On Distribution-Weighted Partial Least Squares with Diverging Number of Highly Correlated Predictors
One-Bit Compressive Sensing With Norm Estimation
Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares
A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
Sliced Inverse Regression for Dimension Reduction
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements
Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
A Primal Dual Active Set Algorithm With Continuation for Compressed Sensing
High-Dimensional Probability
A Semiparametric Approach to Dimension Reduction
Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
Analysis of hard-thresholding for distributed compressed sensing with one-bit measurements
Recovering Structured Data From Superimposed Non-Linear Measurements
Communication-Efficient Distributed Statistical Inference
One-Bit Compressed Sensing by Greedy Algorithms
Communication lower bounds for statistical estimation problems via a distributed data processing inequality
Stable signal recovery from incomplete and inaccurate measurements
Compressed sensing
A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers
Communication-Efficient Accurate Statistical Estimation

This page was built for publication: Distributed Decoding From Heterogeneous 1-Bit Compressive Measurements