mlsanityData to 7 Oct 2026

Quantized Low-Rank Multivariate Regression with Random Dithering

arXiv 2302.11197 ↗First posted 22 Feb 2023stat.ML cs.LG eess.SPcited by 2

Not on the map. Why?

Abstract (arXiv)

Low-rank multivariate regression (LRMR) is an important statistical learning model that combines highly correlated tasks as a multiresponse regression problem with low-rank priori on the coefficient matrix. In this paper, we study quantized LRMR, a practical setting where the responses and/or the covariates are discretized to finite precision. We focus on the estimation of the underlying coefficient matrix. To make consistent estimator that could achieve arbitrarily small error possible, we employ uniform quantization with random dithering, i.e., we add appropriate random noise to the data before quantization. Specifically, uniform dither and triangular dither are used for responses and covariates, respectively. Based on the quantized data, we propose the constrained Lasso and regularized Lasso estimators, and derive the non-asymptotic error bounds. With the aid of dithering, the estimators achieve minimax optimal rate, while quantization only slightly worsens the multiplicative factor in the error rate. Moreover, we extend our results to a low-rank regression model with matrix responses. We corroborate and demonstrate our theoretical results via simulations on synthetic data or image restoration.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 20 of its 81 references that are in the map. First posted on arXiv 22 Feb 2023.

Builds on

20 of 81 references.

References · 20

  1. 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,548
  2. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
  3. 2016DoReFa-Net: Training Low Bitwidth Convolutional Neural Networks with Low Bitwidth Gradientscited by 557
  4. 2016Quantized Neural Networks: Training Neural Networks with Low Precision Weights and Activationscited by 413
  5. 2019FedPAQ: A Communication-Efficient Federated Learning Method with Periodic Averaging and Quantizationcited by 349
  6. 2019Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communicationcited by 218
  7. 2020UVeQFed: Universal Vector Quantization for Federated Learningcited by 103
  8. 2013Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optimacited by 66
  9. 2013A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completioncited by 23
  10. 2016A Shrinkage Principle for Heavy-Tailed Data: High-Dimensional Robust Low-Rank Matrix Recoverycited by 23
  11. 2022High Dimensional Statistical Estimation under Uniformly Dithered One-bit Quantizationcited by 11
  12. 2014Adaptive Multinomial Matrix Completioncited by 9
8 more
  1. 2019On Low-rank Trace Regression under General Sampling Distributioncited by 9
  2. 2015Robust Reduced Rank Regressioncited by 8
  3. 2018The Generalized Lasso for Sub-gaussian Measurements with Dithered Quantizationcited by 8
  4. 2022Color Image Inpainting via Robust Pure Quaternion Matrix Completion: Error Bound and Weighted Losscited by 8
  5. 2020Quantizing data for distributed learningcited by 7
  6. 2022Quantizing Heavy-tailed Data in Statistical Estimation: (Near) Minimax Rates, Covariate Quantization, and Uniform Recoverycited by 7
  7. 2020Covariance Estimation for Matrix-valued Datacited by 3
  8. 2020Non-Convex Structured Phase Retrievalcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 1.

2 papers.