AI News, Nuit Blanche

Nuit Blanche

Optimization for Machine Learning NIPS*2008 Workshop December 12-13, 2008, Whistler, Canada URL: http://opt2008.kyb.tuebingen.mpg.de/

* Combinatorial Optimization, example problems in ML include - Estimating MAP solutions to discrete random fields - Clustering and graph-partitioning - Semi-supervised and multiple-instance learning - Feature and subspace selection

* Algorithms and Techniques, especially with a focus on an underlying application - Polyhedral combinatorics, polytopes and strong valid inequalities - Linear and higher-order relaxations - Semidefinite programming relaxations - Decomposition for large-scale, message-passing and online learning - Global and Lipschitz optimization - Algorithms for non-smooth optimization - Approximation Algorithms

Braunschweig Integrated Centre of Systems Biology (BRICS) Technische Universität Braunschweig Rebenring 56 38106 Braunschweig Germany can be found here.

- 11:00 Andreas Potschka, 'A sequential homotopy method for unconstrained optimization problems' 11:00

- 16:50 Nidhi Kaihnsa, 'Attainable Regions of Bio-Chemical Reactions' 16:50 - 17:00 Farewell Download schedule as pdf.

To advance research and collaboration between these fields the workshop aims to bring together scientists working at the intersection of the fields and scientists interested in contributing to the collaboration of the fields.

Besides the keynote talks we encourage young researchers to present their work in a 20 minute talk at the workshop.

We either seek work from the intersection of the fields, or presentations on new, pivotal questions of one field for the other.

Submissions will be chosen for presentation based on an internal review of the submitted extended abstracts.

NIPS 2015 Workshop (LeCun) 15599 Non-convex Optimization for Machine Learning: Theory and Practice

Non-convex optimization is ubiquitous in machine learning. In general, reaching the global optima of these problems is NP-hard and in practice, local search ...

NIPS 2015 Workshop (Anandkumar) 15598 Non-convex Optimization for Machine Learning: Theory and ...

Non-convex optimization is ubiquitous in machine learning. In general, reaching the global optima of these problems is NP-hard and in practice, local search ...

Workshop: Solving optimization problems with JuliaOpt

Madeliene Udell, Miles Lubin, Iain Dunning, Joey Huchette. Visit to download Julia

NIPS 2014 Workshop - (Nowozin) Discrete Optimization in Machine Learning

This workshop addresses questions at the intersection of discrete and combinatorial optimization and machine learning. Solving optimization problems with ...

Optimization for Machine Learning I

Elad Hazan, Princeton University Foundations of Machine Learning Boot Camp

NIPS 2015 Workshop (Chen) 15604 Non-convex Optimization for Machine Learning: Theory and Practice

Non-convex optimization is ubiquitous in machine learning. In general, reaching the global optima of these problems is NP-hard and in practice, local search ...

Machine Learning Algorithms Workshop

Machine Learning Algorithms Workshop: Logarithmic Time Online Multiclass Prediction & Log-Concave Sampling with SGD Logarithmic Time Online Multiclass ...

NIPS 2014 Workshop - (Lasserre) OPT2014 Optimization for Machine Learning

Optimization lies at the heart of many machine learning algorithms and enjoys great interest in our community. Indeed, this intimate relation of optimization with ...

NIPS 2016 Workshop on Nonconvex Optimization: Nando de Freitas (Learning to Optimize)

NIPS 2016 Workshop on Nonconvex Optimization: Nando de Freitas (Learning to Optimize) The move from hand-designed features to learned features in ...

NIPS 2015 Workshop (Re) 15603 Non-convex Optimization for Machine Learning: Theory and Practice

Non-convex optimization is ubiquitous in machine learning. In general, reaching the global optima of these problems is NP-hard and in practice, local search ...