#### About

Solving optimization problems with ultimately discrete solutions is becoming increasingly important in machine learning: At the core of statistical machine learning is to infer conclusions from data, and when the variables underlying the data are discrete, both the tasks of inferring the model from data, as well as performing predictions using the estimated model are discrete optimization problems. Many of the resulting optimization problems are NPhard, and typically, as the problem size increases, standard off-the-shelf optimization procedures become intractable. Fortunately, most discrete optimization problems that arise in machine learning have specific structure, which can be leveraged in order to develop tractable exact or approximate optimization procedures. For example, consider the case of a discrete graphical model over a set of random variables. For the task of prediction, a key structural object is the "marginal polytope",a convex bounded set characterized by the underlying graph of the graphical model. Properties of this polytope, as well as its approximations, have been successfully used to develop efficient algorithms for inference. For the task of model selection, a key structural object is the discrete graph itself.

Another problem structure is sparsity: While estimating a highdimensional model for regression from a limited amount of data is typically an ill-posed problem, it becomes solvable if it is known that many of the coefficients are zero. Another problem structure, submodularity, a discrete analog of convexity, has been shown to arise in many machine learning problems, including structure learning of probabilistic models, variable selection and clustering. One of the primary goals of this workshop is to investigate how to leverage such structures. There are two major classes of approaches towards solving such discrete optimization problems machine learning: Combinatorial algorithms and continuous relaxations.

Workshop homepage: http://www.discml.cc/

#### Related categories

## Uploaded videos:

### Mixing sum-product and max-product type updates to tighten tree-reweighted upper...

Jan 13, 2011

·

3952 Views

### Submodular Function Minimization

Jan 13, 2011

·

9655 Views

### Multilinear relaxation: a tool for maximization of submodular functions

Jan 13, 2011

·

4790 Views

### Online submodular minimization with combinatorial constraints

Jan 13, 2011

·

6584 Views

### Energy Minimization with Label costs and Applications in Multi-Model Fitting

Jan 13, 2011

·

8026 Views

### Dual decomposition for inference in natural language processing

Jan 13, 2011

·

5662 Views

### Information Theoretic Model Validation by Approximate Optimization

Jan 05, 2011

·

4785 Views

### Taming Information Overload

Jan 13, 2011

·

3814 Views

### Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimiz...

Jan 13, 2011

·

7675 Views