- Linear and conic programming relaxations: Graph structure and message-passing
- IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 54, NO. 6, JUNE 2006 2099 Log-Determinant Relaxation for Approximate
- Graphical models and variational methods: Message-passing, convex relaxations, and all that
- Vision Research 39 (1999) 39603974 Visual adaptation as optimal information transmission
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 8, AUGUST 2008 3565 Probabilistic Analysis of Linear
- Graphicalmodelsandvariationalmethods: Message-passing,convexrelaxations,andallthat
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 6, JUNE 2010 2967 Information-Theoretic Limits on Sparse
- 1120 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 5, MAY 2003 Tree-Based Reparameterization Framework for
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 1, JANUARY 2010 181 Analysis of Absorbing Sets and Fully Absorbing Sets
- Journal of Machine Learning Research 11 (2010) 2241-2259 Submitted 3/10; Revised 8/10; Published 8/10 Restricted Eigenvalue Properties for Correlated Gaussian Designs
- Loop Series and Bethe Variational Bounds in Attractive Graphical Models
- QUESTION BOOKLET EECS 227A Fall 2009
- Tree-reweighted belief propagation algorithms and approximate ML estimation by pseudo-moment matching
- 3136 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 52, NO. 11, NOVEMBER 2004 Embedded Trees: Estimation of Gaussian Processes
- 82 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 1, JANUARY 2007 LP Decoding Corrects a Constant Fraction of Errors
- MultitargetMultisensor Data Association Using the TreeReweighted MaxProduct Algorithm
- IEEE JOURNAL OF SOLID-STATE CIRCUITS, VOL. 45, NO. 4, APRIL 2010 843 An Efficient 10GBASE-T Ethernet LDPC Decoder
- Submitted to the Annals of Statistics SUPPLEMENTARY MATERIAL FOR: ESTIMATION OF
- UC Berkeley Department of Electrical Engineering and Computer Science
- EECS 281B / STAT 241B: Advanced Topics in Statistical LearningSpring 2009 Lecture 14 --March 9
- EECS 281B / STAT 241B: Advanced Topics in Statistical LearningSpring 2009 Lecture 11 --February 25
- EECS 281B / STAT 241B: Advanced Topics in Statistical Learning Spring 2009 Lecture 17 --March 16
- Submitted to the Annals of Statistics ESTIMATION OF (NEAR) LOW-RANK MATRICES WITH
- Linear Programming-Based Decoding of Turbo-Like Codes and its Relation to Iterative Approaches
- Tree-reweighted belief propagation algorithms and approximate ML estimation by pseudo-moment matching
- EECS 281B / STAT 241B: Advanced Topics in Statistical LearningSpring 2009 Lecture 20 --April 6th
- IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 12, NO. 2, MARCH 2001 181 An Introduction to Kernel-Based Learning
- EECS 281B / STAT 241B Advanced Topics in Statistical Learning Theory
- IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 56, NO. 3, MARCH 2008 1205 Geographic Gossip: Efficient Averaging for
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 11, NOVEMBER 2005 3697 MAP Estimation Via Agreement on Trees
- Foundations and Trends R Machine Learning
- Journal of Machine Learning Research 11 (2010) 1043-1080 Submitted 10/08; Revised 12/09; Published 3/10 Message-passing for Graph-structured Linear Programs: Proximal
- IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 56, NO. 9, SEPTEMBER 2008 4293 Convergence Analysis of Reweighted
- Journal of Machine Learning Research 7 (2006) 1829-1859 Submitted 5/06; Revised 8/06; Published 9/06 Estimating the "Wrong" Graphical Model: Benefits in the
- The Annals of Statistics 2011, Vol. 39, No. 1, 147
- Journal of Machine Learning Research 11 (2010) 2361-2386 Submitted 8/08; Revised 8/09; Published 8/10 High-dimensional Variable Selection with Sparse Random Projections
- 5728 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 12, DECEMBER 2009 Information-Theoretic Limits on Sparsity Recovery
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 5, MAY 2009 2183 Sharp Thresholds for High-Dimensional and Noisy
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 7, JULY 2008 3285 requiring the storage of O(d) cells. Since each cell has j6j+1 entries,
- arXiv:cs.IT/0602071v120Feb2006 Geographic Gossip: Efficient Aggregation for Sensor
- Universal Quantile Estimation with Feedback in the Communication-Constrained Setting
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 9, SEPTEMBER 2010 4539 Network Coding for Distributed Storage Systems
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 3, MARCH 2010 1351 Lossy Source Compression Using Low-Density
- 3258 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO. 11, NOVEMBER 2009 Transactions Papers
- 908 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 27, NO. 6, AUGUST 2009 Predicting Error Floors of Structured LDPC Codes
- Error Floors in LDPC Codes: Fast Simulation, Bounds and Hardware Emulation
- arXiv:cs.IT/0605091v121May2006 Low-density constructions can achieve the
- Lower bounds on the rate-distortion function of LDGM codes A. G. Dimakis1, M. J. Wainwright1,2 and K. Ramchandran1,
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- 1338 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 12, NO. 11, NOVEMBER 2003 Image Denoising Using Scale Mixtures of
- Sharp thresholds for high-dimensional and noisy sparsity recovery using 1-constrained quadratic
- The Annals of Statistics 2009, Vol. 37, No. 5B, 28772921
- On the optimality of treereweighted maxproduct messagepassing Vladimir Kolmogorov
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 3, MARCH 2009 1061 Low-Density Graph Codes That Are Optimal for
- 954 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 3, MARCH 2005 Using Linear Programming to Decode
- A near-optimal algorithm for network-constrained averaging with noisy links
- arXiv:cs.IT/0602046v113Feb2006 Analysis of LDGM and compound codes for lossy
- The Annals of Statistics 2011, Vol. 39, No. 2, 10691097
- [Sparse graph codes and message-passing
- Submitted to the Annals of Statistics SUPPORT UNION RECOVERY IN HIGH-DIMENSIONAL
- STAT 241B / EECS 281B: Advanced Statistical Learning Spring 2009 Lecture 7 --February 11
- On the optimality of tree-reweighted max-product message-passing Vladimir Kolmogorov
- Convexity, Classification, and Risk Bounds Peter L. BARTLETT, Michael I. JORDAN, and Jon D. MCAULIFFE
- EECS 281B / STAT 241B: Advanced Topics in Statistical Learning Spring 2009 Lecture 4 --February 2
- EE 227A: Convex Optimization and Applications October 14, 2008 Lecture 13: SDP Duality
- Simultaneous support recovery in high dimensions: Benefits and perils of block 1/-regularization
- Kernel Principal Component Analysis Bernhard Scholkopf1, Alexander Smola2, Klaus Robert Muller2
- Multitarget-Multisensor Data Association Using the Tree-Reweighted Max-Product Algorithm
- arXiv:cs.IT/0601123v130Jan2006 Low density codes achieve the rate-distortion bound
- Lossy source encoding via message-passing and decimation over generalized codewords of LDGM codes
- A New Look at Survey Propagation and Its Generalizations ELITZA MANEVA, ELCHANAN MOSSEL, AND MARTIN J. WAINWRIGHT
- UC Berkeley Department of Electrical Engineering and Computer Science
- The Annals of Statistics 2010, Vol. 38, No. 3, 12871319
- Electronic Journal of Statistics Vol. 5 (2011) 935980
- Minimax rates of estimation for high-dimensional linear regression over q-balls
- IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, VOL. 5, NO. 4, AUGUST 2011 833 Non-Asymptotic Analysis of an Optimal Algorithm
- Information-theoretic bounds on model selection for Gaussian Markov random fields
- IEEE TRANSACTIONS ON AUTOMATIC CONTROL 1 Dual Averaging for Distributed Optimization
- 6976 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 10, OCTOBER 2011 Minimax Rates of Estimation for High-Dimensional
- Available online at www.sciencedirect.com Journal of Approximation Theory ( )
- Information-theoretic limits of selecting binary graphical models in high dimensions
- Journal of Machine Learning Research 13 (2012) 389-427 Submitted 8/10; Revised 12/11; Published 2/12 Minimax-Optimal Rates For Sparse Additive Models Over Kernel
- Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization
- 592 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 57, NO. 3, MARCH 2012 Dual Averaging for Distributed Optimization
