Maxim Raginsky: Research Themes and Selected Publications
Click here for the complete list of my publications, with full citation data and links to electronic versions.
Compressed representations for statistical learning and inference
I am interested in developing theory and algorithms for efficient data representations for transmission and storage that reduce bandwidth and memory requirements as much as possible, yet preserve most relevant features needed for inference. Applications include field estimation using wireless sensor networks, smooth binary codes for fast similarity search and retrieval, and design of informative dictionaries for scene classification in computer vision.
Connections between information theory, estimation, and optimization
I am interested in new angles and perspectives at the interface between information theory, estimation, and optimization. Applications include improving the complexity of convex optimization using information-theoretic coding, efficient methods for sequential decision making and anomaly detection, and universal schemes for information processing that perform nearly optimally even with incompletely or inaccurately specified system models.
- M. Raginsky and T. Coleman. Mutual information and posterior estimates in channels of exponential family type. ITW 2009, to appear
- M. Raginsky and A. Rakhlin. Information complexity of black-box convex optimization: a new look via feedback information theory. Allerton 2009, to appear (invited)
- M. Raginsky, R. Marcia, J. Silva, and R. Willett. Sequential probability assignment via online convex programming using exponential families. ISIT 2009
- M. Raginsky. On the information capacity of Gaussian channels under small peak power constraints. Allerton 2008
- M. Raginsky. Joint universal lossy coding and identification of stationary mixing sources with general alphabets. IEEE Transactions on Information Theory, 2009
- M. Raginsky. Joint fixed-rate universal lossy coding and identification of continuous-alphabet memoryless sources. IEEE Transactions on Information Theory, 2008
Nonparametric methods for discrete data
Many current applications involve decision-making and inference from discrete event data. The main challenge is when the number of possible event types is much larger than the number of observed events. I am interested in developing "nonparametric" inference methods for such settings. Applications include compressed sensing based on photon counts, sparse density estimation on the binary cube, and discrete denoising for region classification in computer vision.
- S. Jafarpour, R. Willett, M. Raginsky, and R. Calderbank. Performance bounds for expander-based compressed sensing with Poisson noise. Asilomar 2009, to appear (invited)
- R. Willett and M. Raginsky. Performance bounds on compressed sensing with Poisson noise. ISIT 2009
- K. Krishnamurthy, M. Raginsky, and R. Willett. Multiscale photon-limited hyperspectral image reconstruction. SIAM Journal on Imaging Sciences, 2009, submitted
- S. Lazebnik and M. Raginsky. An empirical Bayes approach to contextual region classification. CVPR 2009
- M. Raginsky, S. Lazebnik, R. Willett and J. Silva. Near-minimax recursive density estimation on the binary hypercube. NIPS 2008