New algorithm tracks changing data subspaces with sparse outliers.
problem Tracking changing data subspaces in the presence of sparse outliers.
method Simple-ReProCS algorithm based on ReProCS framework.
result First guarantee for dynamic RPCA under weakened assumptions.
Deep learning produces efficient ternary projections for image compression.
problem Efficiently compress and reconstruct sparse signals from incomplete measurements.
method End-to-end deep learning architecture for learning projection matrices and reconstruction operators.
result Deep learning approach yields more efficient ternary projections compared to state-of-the-art methods.
We introduce a recursive algorithm for performing compressed sensing on streaming data. The approach consists of a) recursive encoding, where we sample the input stream via overlapping windowing and make use of the previous measurement in obtaining the next one, and b) recursive decoding, where the signal estimate from…
Autoencoders learn compressed representations via mutual information maximization.
problem Learning efficient compressed representations of high-dimensional data.
method Proposes Uncertainty Autoencoders that treat latent representations as noisy projections and optimize mutual information.
result 32% improvement in statistical compressed sensing of high-dimensional datasets.
Three new efficient algorithms project vectors onto weighted l1 ball.
problem Sparse system identification and feature selection.
method Projected gradient descent algorithms with linear or highly competitive quadratic worst case complexities.
result Efficient tools for machine learning methods like compress sensing and feature selection.
The paper proposes a control strategy for systems with sparse parameters using compressed sensing.
problem Control of linear systems with unknown sparse parameters under disturbances.
method Sparse estimation using Recursive Least Squares, improved with Basis Pursuit Denoising, and reformulated probabilistic constraints.
result The proposed algorithm outperforms existing methods in control design for systems with sparse impulse response parameters.
Cover trees speed up MRI fingerprint recovery by reducing computation.
problem Efficiently reconstructing MRI fingerprint signals from compressed sensing data.
method Use cover trees for fast approximate nearest neighbor searches in IPG algorithm.
result Achieves 2-3 orders of magnitude reduction in computations.
This work tackles fast and accurate low-rank factorization of compressed data.
problem Accurately and efficiently computing low-rank matrix or tensor factorizations from compressed data.
method Factorization in the compressed domain followed by reconstruction of original factors.
result Provable recovery of original factors under certain conditions.
Convolutional factor analysis improves compressive sensing with fewer measurements.
problem Efficiently reconstructing images from limited compressed measurements.
method Learn convolutional dictionaries from compressed measurements using ADMM.
result Achieves comparable classification accuracy with 30% fewer measurements.
Improved image reconstruction from sparse measurements using generative models.
problem Signal recovery from limited compressed measurements.
method Generative model with constrained latent variables for stable signal reconstruction.
result Improved reconstruction accuracy and preservation of realistic features.
New algorithm uses untrained neural networks for image recovery, offering better compression.
problem Using untrained neural networks for image recovery and theoretical guarantees.
method Projected gradient descent scheme for solving linear and non-linear inverse problems.
result The method achieves better compression rates for the same image quality compared to hand-crafted priors.
We present an information-theoretic framework for sequential adaptive compressed sensing, Info-Greedy Sensing, where measurements are chosen to maximize the extracted information conditioned on the previous measurements. We show that the widely used bisection approach is Info-Greedy for a family of k-sparse signals b…
New algorithm improves polynomial chaos approximations using compressive sensing.
problem Improving the efficiency and accuracy of polynomial chaos expansions.
method Develops a two-step optimization procedure combining compressive sensing with basis adaptation.
result Optimal sparsity in polynomial chaos approximations with reduced dimensionality.
Faster reconstruction of compressed signals using conditional GAN and NPGD.
problem Recovering compressed signals from measurements.
method Network-based projected gradient descent (NPGD) combined with measurement-conditional generative adversarial networks (GANs/BEGANs).
result Significant speed-up in reconstruction (up to 140-175 times faster).
We develop a new compressive sensing (CS) inversion algorithm by utilizing the Gaussian mixture model (GMM). While the compressive sensing is performed globally on the entire image as implemented in our lensless camera, a low-rank GMM is imposed on the local image patches. This low-rank GMM is derived via eigenvalue th…
A hybrid framework reduces ML complexity on edge devices.
problem Limited memory and energy on edge devices.
method Compressed data collection and tailored deep learning network.
result Significant reduction in computational complexity and memory.
We give a new, very general, formulation of the compressed sensing problem in terms of coordinate projections of an analytic variety, and derive sufficient sampling rates for signal reconstruction. Our bounds are linear in the coherence of the signal space, a geometric parameter independent of the specific signal and m…
Signal recovery from unlabeled samples using a novel duality with Compressed Sensing.
problem Recovering a signal from unlabeled linear projections.
method Developed a duality between unlabeled sensing and Compressed Sensing, introduced a Restricted Isometry Property (RIP), and designed an Alternating Minimization algorithm.
result Signal recovery is possible with more samples than the signal dimension, similar to Compressed Sensing.
Optimizing the acquisition matrix is useful for compressed sensing of signals that are sparse in overcomplete dictionaries, because the acquisition matrix can be adapted to the particular correlations of the dictionary atoms. In this paper a novel formulation of the optimization problem is proposed, in the form of a ra…
LASER compresses recursive model activations by exploiting their low-dimensional structure.
problem Understanding and optimizing the geometric structure of recursive reasoning trajectories.
method Dynamic low-rank basis tracking via matrix-free subspace tracking with a fidelity-triggered reset mechanism.
result Recursive activations occupy a linear, low-dimensional subspace that can be compressed efficiently.
Recent breakthrough results in compressed sensing (CS) have established that many high dimensional objects can be accurately recovered from a relatively small number of non- adaptive linear projection observations, provided that the objects possess a sparse representation in some basis. Subsequent efforts have shown th…
Binary Iterative Hard Thresholding converges with optimal number of 1-bit measurements.
problem Recovering sparse signals from 1-bit compressed measurements.
method Binary Iterative Hard Thresholding (BIHT) algorithm.
result BIHT converges with only O(k/ε) measurements, optimal for recovery.
New algorithm uses GANs to solve linear inverse problems with theoretical guarantees.
problem Solving linear inverse problems with natural signals and images.
method Proposes a PGD algorithm using GAN priors for linear inverse problems.
result Demonstrates superior performance over existing GAN-based methods for compressive sensing.
Compressed sensing improves MRI scans with data-driven learning.
problem Challenges in applying compressed sensing from research to clinical practice.
method Data-driven learning to address challenges of hand-crafted priors, tuning parameters, and long reconstruction times.
result Compressed sensing can have greater clinical impact with data-driven learning.
A fast method for Lasso and Logistic Lasso problems.
problem Solving Lasso and Logistic Lasso regression problems efficiently.
method Iterative active set approach using solver updates.
result 31.41 times faster on average for compressed sensing.
Develops a new algorithm for robustly tracking data vectors in a subspace, even with outliers.
problem Tracking data vectors in a slowly changing low-dimensional subspace robustly against outliers.
method ReProCS-NORST, a recursive projected compressive sensing algorithm.
result Achieves a near optimal tracking delay of O(rlognlog(1/ε)). We study the value of information in sequential compressed sensing by characterizing the performance of sequential information guided sensing in practical scenarios when information is inaccurate. In particular, we assume the signal distribution is parameterized through Gaussian or Gaussian mixtures with estimated mean…
HSRL learns network embeddings capturing both local and global topology.
problem Capturing both local and global topological information in network analysis.
method HSRL recursively compresses networks into smaller ones, then learns embeddings using existing methods.
result HSRL outperforms state-of-the-art methods in link prediction.
Review of image compressive sensing algorithms for beginners.
problem Efficiently processing images with limited data.
method Comprehensive review of Total variation methods and other algorithms.
result Standardized comparison of algorithms for compressive sensing applications.
This paper proposes a simple adaptive sensing and group testing algorithm for sparse signal recovery. The algorithm, termed Compressive Adaptive Sense and Search (CASS), is shown to be near-optimal in that it succeeds at the lowest possible signal-to-noise-ratio (SNR) levels, improving on previous work in adaptive comp…
New method learns compressed sensing matrix exploiting data structure.
problem Missing structure beyond sparsity in data.
method Gradient unrolling to learn a compressed sensing measurement matrix.
result Significantly fewer measurements for excellent reconstructions.
New method identifies latent treatment effects from proxy models.
problem Identifying heterogeneous treatment effects under unobserved confounding.
method Compressed observable operator and spectral analysis of treatment effects.
result Eigenvalues of the operator represent latent treatment effects.
Rocket algorithm classifies time-series data efficiently using random projections and natural sparsity.
problem Time-series classification challenges in diverse fields.
method Random convolutional kernels, non-linear transformation, compressed sensing framework.
result Rocket algorithm preserves discriminative patterns in time-series data and expresses inherent sparsity.
GANCS uses GANs to speed up MRI reconstruction while maintaining diagnostic quality.
problem Time and resource intensive MRI reconstruction and loss of diagnostic quality in compressed sensing.
method Generative adversarial networks (GAN) trained on historical patient data to learn diagnostic-quality MR images.
result GANCS reconstructs MRI images in a few milliseconds with high contrast and texture details.
Study on recovering supports of multiple sparse vectors from mixed linear measurements.
problem Recovering supports of multiple sparse vectors from a mixture of linear measurements.
method Developed algorithms to identify the support of all component vectors using polynomial and quasi-polynomial number of measurements.
result Polynomial and quasi-polynomial number of measurements sufficient for recovering the supports of all component vectors.
Proposes online compressive robust PCA with prior info.
problem Online video foreground-background separation from sparse and low-rank components.
method Combines prior info and compressive sensing for recursive separation.
result Improves separation using multiple prior info and theoretical bounds.
Two new methods reduce OCO problem complexity without projections.
problem Efficiently solving smooth Online Convex Optimization problems without projections.
method ORGFW and MORGFW methods using recursive gradient estimation.
result Achieve optimal regret bounds with low computational costs.
Bayesian compressive sensing speeds up object detection in video sequences.
problem Efficiently detecting objects in large video datasets.
method Bayesian compressive sensing methods for object detection.
result Bayesian methods achieve similar or better accuracy than greedy algorithms but faster.
Study 1-bit compressive sensing with generative models, improving recovery accuracy.
problem Accurately recover sparse vectors from binary measurements with generative models.
method Analyzes noiseless and noisy 1-bit measurements with i.i.d.~Gaussian and Lipschitz continuous generative priors, proving sample complexity bounds and stability properties.
result Proves sample complexity bounds and stability properties for 1-bit compressive sensing with generative models.
KMBBO uses K-means clustering to optimize complex problems efficiently.
problem Optimizing complex problems with high-dimensional data.
method Uses unsupervised learning to estimate peaks of the acquisition function, combined with compressed sensing for dimensionality reduction.
result KMBBO outperforms state-of-the-art batch allocation algorithms in various test problems.
A new algorithm DC2 for large-scale kernel learning and clustering.
problem Efficiently handle large-scale kernel learning and clustering problems.
method Divide-and-conquer approach using recursive random projections for data partition and compression.
result Achieves clustering accuracy comparable to fast approximate spectral clustering algorithms with lower running time.
As a lossy compression framework, compressed sensing has drawn much attention in wireless telemonitoring of biosignals due to its ability to reduce energy consumption and make possible the design of low-power devices. However, the non-sparseness of biosignals presents a major challenge to compressed sensing. This study…
Sparse-Gen uses generative models to improve compressed sensing with full signal recovery.
problem Recovering signals with fewer measurements than traditional methods allow.
method Sparse-Gen framework that allows for sparse deviations from the support set.
result Achieves full signal recovery over the full space of signals, not just the support.
Proposes a link between randomness and compression in deep learning.
problem Improving efficiency in deep learning training.
method Introduces a novel tomographic compression framework called Dual Tomographic Compression (DTC).
result Demonstrates high correlation between learning performance and Gibbs entropy over compression ratios.
New method uses Boltzmann machines for compressed sensing of sparse signals without known correlation model.
problem Reconstructing sparse signals from limited measurements without prior correlation knowledge.
method Train a generative Boltzmann machine to infer signal structure, then use message-passing inference for reconstruction.
result Effective reconstruction even with fewer measurements than signal sparsity, as demonstrated on MNIST.
Paper offers robust recovery for 1-bit sensing with partial Gaussian circulant matrices.
problem Accurately recovering vectors from 1-bit measurements using structured matrices.
method Correlation-based optimization with randomly signed partial Gaussian circulant matrices and generative models.
result Recovery guarantees match those for i.i.d. Gaussian matrices but with faster computation.
We describe a method for recursively calculating Gromov-Witten invariants of all blowups of the projective plane. This recursive formula is different from the recursive formulas due to Göttsche and Pandharipande in the zero genus case, and Caporaso and Harris in the case of no blowups. We use tropical curves and a recu…
Sharp asymptotics derived for phase retrieval and compressed sensing with random generative priors.
problem Phase retrieval and compressed sensing with random measurement matrices.
method Sharp asymptotics derived for optimal performance and polynomial algorithm for random generative priors.
result Compressed phase retrieval becomes tractable with random generative priors, unlike sparse priors.