Sciweavers

74 search results - page 6 / 15
» Compressed sensing with sequential observations
Sort
View
KES
2008
Springer
13 years 7 months ago
Driven by Compression Progress
I argue that data becomes temporarily interesting by itself to some self-improving, but computationally limited, subjective observer once he learns to predict or compress the data...
Jürgen Schmidhuber
AAAI
2010
13 years 9 months ago
Compressing POMDPs Using Locality Preserving Non-Negative Matrix Factorization
Partially Observable Markov Decision Processes (POMDPs) are a well-established and rigorous framework for sequential decision-making under uncertainty. POMDPs are well-known to be...
Georgios Theocharous, Sridhar Mahadevan
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 8 months ago
Performance Analysis of Spectral Clustering on Compressed, Incomplete and Inaccurate Measurements
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
Blake Hunter, Thomas Strohmer
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 3 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
CORR
2011
Springer
214views Education» more  CORR 2011»
12 years 11 months ago
Convex Approaches to Model Wavelet Sparsity Patterns
Statistical dependencies among wavelet coefficients are commonly represented by graphical models such as hidden Markov trees (HMTs). However, in linear inverse problems such as d...
Nikhil S. Rao, Robert D. Nowak, Stephen J. Wright,...