ORIE Colloquium, 2014-03-26 - Stefanie Jegelka (UC Berkeley): Efficient Learning with Combinatorial Structure
From E. Cornelius on May 14th, 2018
Wednesday, March 26, 2014 at 3:00pm Frank H. T. Rhodes Hall, 253 ORIE Colloquium: Stefanie Jegelka (UC Berkeley) - Efficient learning with combinatorial structure Learning from complex data such as images, text or biological measurements invariably relies on capturing long-range, latent structure. But the combinatorial structure inherent in real-world data can pose significant computational challenges for modeling, learning and inference. In this talk, I will view these challenges through the lens of submodular set functions. Considered a "discrete analog of convexity", the combinatorial concept of submodularity captures intuitive yet nontrivial dependencies between variables and underlies many widely used concepts in machine learning. Practical use of submodularity, however, requires care. My first example illustrates how to efficiently handle the important class of submodular composite models. The second example combines submodularity and graphs for a new family of combinatorial models that express long-range interactions while still admitting very efficient inference procedures. As a concrete application, our results enable effective realization of combinatorial sparsity priors on real data, significantly improving image segmentation results in settings where state-of-the-art methods fail. Motivated by good empirical results, we provide a detailed theoretical analysis and identify practically relevant properties that affect complexity and approximation quality of submodular optimization and learning problems.