4.5 Article

Sampling Sparse Representations with Randomized Measurement Langevin Dynamics

Journal

Publisher

ASSOC COMPUTING MACHINERY
DOI: 10.1145/3427585

Keywords

Hamiltonian Monte Carlo; compressive sensing; LASSO

Funding

  1. National Key R&D Program of China [2019YFB2102100, 2018YFB1402600]
  2. Science and Technology Development Fund of Macao S.A.R (FDCT) [0015/2019/AKP]
  3. National Natural Science Foundation of China [61806192]
  4. Shenzhen Discipline Construction Project for Urban Computing and Data Intelligence

Ask authors/readers for more resources

Stochastic Gradient Langevin Dynamics (SGLD) is commonly used for Bayesian sampling by incorporating derivatives of the log-posterior distribution. This study introduces a new SGLD sampler, Randomized Measurement Langevin Dynamics (RMLD), to sample high-dimensional sparse representations from the spectral domain of a given dataset. RMLD derives a likelihood evaluator from the loss function of LASSO to sample from the high-dimensional distribution using stochastic Langevin dynamics and Metropolis-Hastings sampling.
Stochastic Gradient Langevin Dynamics (SGLD) have been widely used for Bayesian sampling from certain probability distributions, incorporating derivatives of the log-posterior. With the derivative evaluation of the log-posterior distribution, SGLD methods generate samples from the distribution through performing as a thermostats dynamics that traverses over gradient flows of the log-posterior with certainly controllable perturbation. Even when the density is not known, existing solutions still can first learn the kernel density models from the given datasets, then produce new samples using the SGLD over the kernel density derivatives. In this work, instead of exploring new samples from kernel spaces, a novel SGLD sampler, namely, Randomized Measurement Langevin Dynamics (RMLD) is proposed to sample the high-dimensional sparse representations from the spectral domain of a given dataset. Specifically, given a random measurement matrix for sparse coding, RMLD first derives a novel likelihood evaluator of the probability distribution from the loss function of LASSO, then samples from the high-dimensional distribution using stochastic Langevin dynamics with derivatives of the logarithm likelihood and Metropolis-Hastings sampling. In addition, new samples in low-dimensional measuring spaces can be regenerated using the sampled high-dimensional vectors and the measurement matrix. The algorithm analysis shows that RMLD indeed projects a given dataset into a high-dimensional Gaussian distribution with Laplacian prior, then draw new sparse representation from the dataset through performing SGLD over the distribution. Extensive experiments have been conducted to evaluate the proposed algorithm using real-world datasets. The performance comparisons on three real-world applications demonstrate the superior performance of RMLD beyond baseline methods.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available