English
Related papers

Related papers: Distilled Sensing: Adaptive Sampling for Sparse De…

200 papers

Compressive sensing (CS) has recently emerged as a framework for efficiently capturing signals that are sparse or compressible in an appropriate basis. While often motivated as an alternative to Nyquist-rate sampling, there remains a gap…

Information Theory · Computer Science 2012-03-23 Mark A. Davenport , Michael B. Wakin

For uncertainty propagation of highly complex and/or nonlinear problems, one must resort to sample-based non-intrusive approaches [1]. In such cases, minimizing the number of function evaluations required to evaluate the response surface is…

Numerical Analysis · Mathematics 2017-12-04 Anindya Bhaduri , Lori Graham-Brady

We propose Amortized Posterior Sampling (APS), a novel variational inference approach for efficient posterior sampling in inverse problems. Our method trains a conditional flow model to minimize the divergence between the variational…

Computer Vision and Pattern Recognition · Computer Science 2025-07-14 Abbas Mammadov , Hyungjin Chung , Jong Chul Ye

Score Distillation Sampling (SDS) has been pivotal for leveraging pre-trained diffusion models in downstream tasks such as inverse problems, but it faces two major challenges: $(i)$ mode collapse and $(ii)$ latent space inversion, which…

Machine Learning · Computer Science 2024-10-15 Nicolas Zilberstein , Morteza Mardani , Santiago Segarra

In compressed sensing (CS), sparse signals can be reconstructed from significantly fewer samples than required by the Nyquist-Shannon sampling theorem. While non-sparse signals can be sparsely represented in appropriate transformation…

Information Theory · Computer Science 2026-03-13 Qi Qi , Abdelhamid Tayebi , Daizhan Cheng , Jun-e Feng

Diffusion models have achieved remarkable success in generating high-resolution, realistic images across diverse natural distributions. However, their performance heavily relies on high-quality training data, making it challenging to learn…

Machine Learning · Computer Science 2025-05-22 Tianyu Chen , Yasi Zhang , Zhendong Wang , Ying Nian Wu , Oscar Leong , Mingyuan Zhou

Diffusion models have emerged as powerful tools for generative tasks, producing high-quality outputs across diverse domains. However, how the generated data responds to the initial noise perturbation in diffusion models remains…

Machine Learning · Computer Science 2025-02-10 Bowen Song , Zecheng Zhang , Zhaoxu Luo , Jason Hu , Wei Yuan , Jing Jia , Zhengxu Tang , Guanyang Wang , Liyue Shen

Compressive sensing (CS) exploits sparsity to recover sparse or compressible signals from dimensionality reducing, non-adaptive sensing mechanisms. Sparsity is also used to enhance interpretability in machine learning and statistics…

Information Theory · Computer Science 2015-07-21 Anastasios Kyrillidis , Luca Baldassarre , Marwa El-Halabi , Quoc Tran-Dinh , Volkan Cevher

Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sensing literature have focused on characterizing the achievable…

Information Theory · Computer Science 2015-05-18 Dmitry Malioutov , Sujay Sanghavi , Alan Willsky

This paper proposes a verification-based decoding approach for reconstruction of a sparse signal with incremental sparse measurements. In its first step, the verification-based decoding algorithm is employed to reconstruct the signal with a…

Information Theory · Computer Science 2013-02-12 Xiaofu Wu , Zhen Yang , Lu Gan

Denoising diffusion models have become ubiquitous for generative modeling. The core idea is to transport the data distribution to a Gaussian by using a diffusion. Approximate samples from the data distribution are then obtained by…

In oversampled adaptive sensing (OAS), noisy measurements are collected in multiple subframes. The sensing basis in each subframe is adapted according to some posterior information exploited from previous measurements. The framework is…

Information Theory · Computer Science 2019-12-11 Ali Bereyhi , Ralf R. Müller

This paper focuses on detection tasks in information extraction, where positive instances are sparsely distributed and models are usually evaluated using F-measure on positive classes. These characteristics often result in deficient…

Computation and Language · Computer Science 2018-05-29 Hongyu Lin , Yaojie Lu , Xianpei Han , Le Sun

Reducing acquisition time is a crucial challenge for many imaging techniques. Compressed Sensing (CS) theory offers an appealing framework to address this issue since it provides theoretical guarantees on the reconstruction of sparse…

Applications · Statistics 2014-07-17 Nicolas Chauffert , Philippe Ciuciu , Jonas Kahn , Pierre Weiss

We develop a Bayesian framework for sensing which adapts the sensing time and/or basis functions to the instantaneous sensing quality measured in terms of the expected posterior mean-squared error. For sparse Gaussian sources a significant…

Information Theory · Computer Science 2018-02-12 Ralf R. Müller , Ali Bereyhi , Christoph F. Mecklenbräuker

Advances of information-theoretic understanding of sparse sampling of continuous uncoded signals at sampling rates exceeding the Landau rate were reported in recent works. This work examines sparse sampling of coded signals at sub-Landau…

Information Theory · Computer Science 2013-03-04 Michael Peleg , Shlomo Shamai

Anomaly detection (AD) under data contamination is critical for deploying unsupervised defect detection in industrial environments, where curating perfectly clean training sets is impractical. However, existing methods are sensitive to…

Computer Vision and Pattern Recognition · Computer Science 2026-05-27 Sirojbek Safarov , Jaewoo Park , Yoon Gyo Jung , Kuan-Chuan Peng , Wonchul Kim , Seongdeok Bang , Octavia Camps

Subsampling from a large data set is useful in many supervised learning contexts to provide a global view of the data based on only a fraction of the observations. Diverse (or space-filling) subsampling is an appealing subsampling approach…

Methodology · Statistics 2023-11-27 Boyang Shang , Daniel W. Apley , Sanjay Mehrotra

Guided diffusion sampling relies on approximating often intractable likelihood scores, which introduces significant noise into the sampling dynamics. We propose using adaptive moment estimation to stabilize these noisy likelihood scores…

Machine Learning · Computer Science 2026-04-24 Christian Belardi , Justin Lovelace , Kilian Q. Weinberger , Carla P. Gomes

In this paper, we propose a sparse recovery algorithm called detection-directed (DD) sparse estimation using Bayesian hypothesis test (BHT) and belief propagation (BP). In this framework, we consider the use of sparse-binary sensing…

Information Theory · Computer Science 2012-11-07 Jaewook Kang , Heung-No Lee , Kiseon Kim