Covariance estimation under one-bit quantization
From MaRDI portal
Publication:2112828
DOI10.1214/22-AOS2239MaRDI QIDQ2112828
Holger Rauhut, Sjoerd Dirksen, Johannes Maly
Publication date: 12 January 2023
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.01280
Related Items
Cites Work
- Unnamed Item
- Covariance estimation for distributions with \({2+\varepsilon}\) moments
- Itô isomorphisms for \(L^{p}\)-valued Poisson stochastic integrals
- Concentration inequalities and moment bounds for sample covariance operators
- Sharp bounds on the rate of convergence of the empirical covariance matrix
- User-friendly tail bounds for sums of random matrices
- Partial estimation of covariance matrices
- How close is the sample covariance matrix to the actual covariance matrix?
- Estimation of high-dimensional prior and posterior covariance matrices in Kalman filter vari\-ants
- Optimal rates of convergence for covariance matrix estimation
- Covariance regularization by thresholding
- Operator norm consistent estimation of large-dimensional sparse covariance matrices
- Invertibility of ``large submatrices with applications to the geometry of Banach spaces and harmonic analysis
- Decoupling and Khintchine's inequalities for \(U\)-statistics
- Optimal rates of convergence for estimating Toeplitz covariance matrices
- Non-Gaussian hyperplane tessellations and robust one-bit compressed sensing
- Robust covariance estimation under \(L_4\)-\(L_2\) norm equivalence
- User-friendly covariance estimation for heavy-tailed distributions
- Regularized estimation of large covariance matrices
- Positive definite functions on spheres
- One-Bit Compressed Sensing by Linear Programming
- The masked sample covariance estimator: an analysis using matrix concentration inequalities
- One-Bit Compressive Sensing With Norm Estimation
- 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
- Quantized Compressed Sensing: A Survey
- Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles
- Dithered quantizers
- Estimation of the autocorrelation function of complex Gaussian stationary processes by amplitude clipped signals
- Low-Complexity Massive MIMO Subspace Estimation and Tracking From Low-Dimensional Projections
- Channel Estimation and Performance Analysis of One-Bit Massive MIMO Systems
- High-Dimensional Probability
- Quantization
- Quantized Compressed Sensing by Rectified Linear Units
- Robust 1-bit compressed sensing via hinge loss minimization
