In my previous post I definitely missed some talks in this ITA.
Tomorrow (Thursday) there will be many interesting talks on compressed sensing:
8:50: On L0 search for low-rank matrix completion, by Wei Dai, Imperial College London, Ely Kerman, UIUC, Olgica Milenkovic, UIUC
9:10 Orthogonal matching pursuit with replacement, by Inderjit Dhillon, University Of Texas, Prateek Jain, Microsoft, Ambuj Tewari, University Of Texas
3:00 Sparse sampling: bounds and applications, by Martin Vetterli, EPFL
4:15: Bilinear generalized approximate message passing (BiG-AMP) for matrix recovery problems Phil Schniter, Ohio State, Volkan Cevher, EPFL
There is another talk at the same time:
Construction of low-coherence frames using group theory, by Babak Hassibi, Caltech, Matthew Thill, Caltech
4:35: Sparse recovery with graph constraints, by Meng Wang, Cornell, Weiyu Xu, Cornell, Enrique Mallada, Cornell, Kevin Tang, Cornell
4:55: Asymptotic analysis of complex LASSO via complex approximate message passing, by Arian Maleki, Rice, Laura Anitori, TNO, Netherlands, Zai Yang, Nanyang Technological University, Richard Baraniuk, Rice
In addition to the compressed sensing talks, there are many interesting talks on Music Information Retrieval, Clustering, Learning Theory, Graphical Models and Inference, and Statistical Machine learning & Applications.
Thursday will be a wonderful day.