Neural story generation gains common sense through targeted training.
problem Lack of common sense reasoning in neural-generated stories.
method Multi-task learning with auxiliary datasets for common sense grounding.
result Improved common sense reasoning and state-of-the-art perplexity.
Model learns multi-sense word embeddings using bilingual and monolingual data.
problem Learning multi-sense word embeddings with crosslingual information.
method Discrete autoencoder with encoder and decoder components.
result Bilingual word representations outperform monolingual ones across tasks.
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.
Touch sensing improves grasp prediction accuracy.
problem Predicting grasp outcomes from indirect measurements like vision is challenging.
method Investigated touch sensing's value in multimodal grasping using visuo-tactile deep neural networks.
result Tactile readings significantly improve grasp prediction accuracy.
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.
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.
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.
We describe our language-independent unsupervised word sense induction system. This system only uses topic features to cluster different word senses in their global context topic space. Using unlabeled data, this system trains a latent Dirichlet allocation (LDA) topic model then uses it to infer the topics distribution…
Study uses remotely sensed data to infer economic outcomes in experiments and quasi-experiments.
problem Imperfect measurement of economic outcomes by remotely sensed variables.
method Combines experimental and observational data to identify causal parameters, using satellite imagery and mobile phone activity.
result Developed a robust method for n^{-1/2} inference that does not restrict remotely sensed variable processing algorithms.
Probabilistic FastText captures multiple word senses and sub-word structures.
problem Capturing multiple word senses and sub-word structures in word embeddings.
method Probabilistic FastText uses Gaussian mixture densities to represent words, sharing statistical strength across sub-word structures and capturing different word senses.
result Probabilistic FastText outperforms existing models on word-similarity benchmarks and discerning different meanings.
This research tackles ocean remote sensing data enhancement using locally-adapted convolutional models.
problem Super-resolution of irregularly-sampled ocean remote sensing images.
method Optimal interpolation as low-resolution reconstruction, locally-adapted multimodal convolutional models, and dictionary-based decompositions (PCA, sparse priors, non-negativity constraints).
result Locally-adapted parametrizations with non-negativity constraints outperform optimally-interpolated reconstructions.
CNN model for efficient wireless spectrum sensing and signal identification.
problem Efficient utilization of scarce wireless spectrum.
method Convolutional Neural Network (CNN) based on spectral correlation function.
result Significant performance gains over existing methods.
New algorithm speeds up cluster-based compressive sensing tasks.
problem Efficiently solving multiple compressive sensing tasks with shared information.
method Combines Monte Carlo sampling with iterative linear solvers to avoid explicit covariance matrix computation.
result Up to thousands of times faster and orders of magnitude more memory-efficient compared to existing methods.
CSDM integrates compressed sensing into diffusion models for faster data generation.
problem Efficiently generating synthetic data in high-dimensional spaces.
method Integrating compressed sensing into diffusion models (CSDM) to reduce dimensionality and accelerate inference.
result Achieves provably faster convergence and better latent space dimension selection.
Proposes using equivariant generative models for compressed sensing with unknown orientations.
problem Recovering signals with unknown orientations from underdetermined systems of linear measurements.
method Equivariant variational autoencoder as a generative prior for compressed sensing.
result Signals with unknown orientations can be recovered using iterative gradient descent on the latent space of equivariant models.
Proposes methods to model polysemous words using vector representations and geometric analysis.
problem Modeling words with multiple meanings in NLP.
method Three-fold approach: context representations, sense induction, lexeme representations.
result Disambiguation of word senses using low-rank subspaces and Grassmannian geometry.
The paper improves conditions for unique recovery in homomorphic sensing of subspaces.
problem Unique recovery of points in a linear subspace from their images under linear maps.
method Tighter and simpler conditions for unique recovery in single and subspace arrangement cases, extending to noise stability.
result Conditions for unique recovery in homomorphic sensing are improved and unified.
Deep model learns from labeled and unlabeled data for industrial soft sensing.
problem Lack of data limits soft sensor development in industrial processes.
method Hierarchical, generative deep latent variable model for semi-supervised multi-unit soft sensing.
result Model outperforms current methods for soft sensing in industrial processes.
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.
We characterize the performance of sequential information guided sensing, Info-Greedy Sensing, when there is a mismatch between the true signal model and the assumed model, which may be a sample estimate. In particular, we consider a setup where the signal is low-rank Gaussian and the measurements are taken in the dire…
Paper proposes robust compressed sensing using generative models.
problem Estimating high-dimensional vectors from noisy linear equations with heavy-tailed or outlier data.
method Inspired by Median-of-Means (MOM), proposes an algorithm for robust recovery.
result Guarantees recovery for heavy-tailed data, even in the presence of outliers.
Enhances mobile context prediction using weakly supervised learning.
problem Power consumption and limited training data for always-on context prediction.
method Weakly supervised learning framework for multi-modal sensing.
result Personalized context prediction model with improved accuracy.
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.
Goal: This paper deals with the problems that some EEG signals have no good sparse representation and single channel processing is not computationally efficient in compressed sensing of multi-channel EEG signals. Methods: An optimization model with L0 norm and Schatten-0 norm is proposed to enforce cosparsity and low r…
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…
Paper uses SGLD to recover signals from generative models, proving convergence under mild conditions.
problem Signal recovery from generative priors in compressed sensing.
method Stochastic Gradient Langevin Dynamics (SGLD) for signal recovery.
result SGLD converges to the true signal under mild assumptions on the generative model.
Paper proposes MMD-Sense-Analysis for detecting word sense shifts.
problem Detecting and interpreting shifts in word meanings over time.
method Leverages Maximum Mean Discrepancy (MMD) to identify and explain word sense changes.
result Demonstrates effectiveness of MMD-Sense-Analysis through empirical results.
New method uses generative priors for compressive sensing with sparse solutions.
problem Fundamental linear inverse problem in compressive sensing.
method Sparse Bayesian learning with conditional Gaussianity.
result Ability to learn from few compressed and noisy samples without optimization.
Mobile sensing is an emerging technology that utilizes agent-participatory data for decision making or state estimation, including multimedia applications. This article investigates the structure of mobile sensing schemes and introduces crowdsourcing methods for mobile sensing. Inspired by social network, one can estab…
Study adaptive sensing of Cox processes using posterior sampling and positive bases.
problem Adaptive sensing of Cox point processes with intensity function modeling.
method Model intensity function as truncated Gaussian process in positive basis, use Langevin dynamics and posterior sampling.
result Demonstrated improved sensing compared to classical Bayesian experimental design.
Word embeddings are ubiquitous in NLP and information retrieval, but it is unclear what they represent when the word is polysemous. Here it is shown that multiple word senses reside in linear superposition within the word embedding and simple sparse coding can recover vectors that approximately capture the senses. The …
New method estimates vectors near generative models without sparsity.
problem Estimating vectors from noisy measurements without sparsity.
method Using generative models for vector estimation with Gaussian measurements.
result Achieves similar recovery guarantees to standard compressed sensing with fewer measurements.
AdaBoost improves binary classification in robust one-bit compressed sensing with adversarial errors.
problem Binary classification in robust one-bit compressed sensing with adversarial errors.
method AdaBoost and max-ℓ1-margin-classifier approach, with convergence rates improved under certain feature conditions. result Improved convergence rates and explanation for harmless interpolating adversarial noise.
We improve existing results in the field of compressed sensing and matrix completion when sampled data may be grossly corrupted. We introduce three new theorems. 1) In compressed sensing, we show that if the m \times n sensing matrix has independent Gaussian entries, then one can recover a sparse signal x exactly by tr…
EarthMapper offers a tool for semantic segmentation of remote sensing imagery.
problem Lack of annotated data for remote sensing sensors like hyperspectral imagery.
method Self-taught spatial-spectral feature extraction, various classifiers, and post-processing models.
result Evaluated on Indian Pines and Pavia University datasets, demonstrating state-of-the-art performance.
In this paper we present two new approaches to efficiently solve large-scale compressed sensing problems. These two ideas are independent of each other and can therefore be used either separately or together. We consider all possibilities. For the first approach, we note that the zero vector can be taken as the initial…
A-DLISTA and VLISTA learn dictionaries and sparse representations under varying sensing matrices.
problem Learning dictionaries and sparse representations under varying sensing matrices.
method Augmented Dictionary Learning ISTA (A-DLISTA) and Variational Learning ISTA (VLISTA).
result VLISTA provides a probabilistic way to jointly learn the dictionary distribution and the reconstruction algorithm.
Generative Adversarial Networks improve compressed sensing for task-specific reconstruction.
problem Improving compressed sensing for specific tasks using neural networks.
method Task-aware training of Generative Adversarial Networks (GANs) to impose structure in compressed sensing problems.
result GANs can generate input features for general inference tasks and improve reconstruction and classification performance.
A new method uses deep learning for compressed sensing recovery.
problem Compressed sensing recovery with improved accuracy and efficiency.
method Uses untrained deep generative models (DIP) and learned regularization.
result Improves reconstruction accuracy, especially for noisy measurements.
New method for sensing non-planar surfaces using ERT.
problem Limited computational techniques for planar surfaces in ERT-based sensing skins.
method Generalized ERT to non-planar surfaces using Riemannian geometry.
result Feasibility and applicability of ERT-based sensing skins for non-planar geometries demonstrated.
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.
Paper improves calcium signal deconvolution using efficient state-space models.
problem Deconvolving calcium signals from imaging data.
method Dynamic compressed sensing framework with two nested EM algorithms.
result Proves recovery guarantees and derives confidence bounds for state estimates.
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…
Paper tackles online task allocation in multi-attribute social sensing.
problem Optimized task allocation in dynamic, multi-attribute social sensing.
method Quality-Cost-Aware Online Task Allocation (QCO-TA) scheme using online reinforcement learning.
result Significantly outperforms state-of-the-art baselines in sensing accuracy and cost.
Method creates synthetic remote sensing images for robust change detection.
problem Lack of annotated data for change detection in remote sensing.
method Procedural synthesis using game engines for generating realistic synthetic datasets.
result Improves deep learning model performance and convergence with limited real-world data.
This paper develops an active sensing method to estimate the relative weight (or trust) agents place on their neighbors' information in a social network. The model used for the regression is based on the steady state equation in the linear DeGroot model under the influence of stubborn agents, i.e., agents whose opinion…
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.
MDLdroid improves mobile deep learning for personal sensing with faster training.
problem Continuous local changes and resource constraints in personal mobile sensing affect global model performance.
method ChainSGD-reduce approach to reduce overhead and balance resources.
result 2x to 3.5x faster training on off-the-shelf mobile devices compared to single-device training.