Difference between revisions of "OPT 2008"

From OPENRESEARCH i5 copy Wiki
Jump to navigation Jump to search
(pushed from or by wikipush)
 
(No difference)

Latest revision as of 18:22, 13 January 2021

Event
Name Value
isA Event
Acronym OPT 2008
Title Optimization for Machine Learning (NIPS Workshop 2008)
Start date Dec 12, 2008
End date Dec 13, 2008
Homepage opt2008.kyb.tuebingen.mpg.de/
... ...


We invite high quality submissions for presentation as talks or posters during the workshop. We are especially interested in participants who can contribute in the following areas:

  • Non-Convex Optimization example problems in ML include
    • Problems with sparsity constraints
    • Sparse PCA
    • Non-negative matrix and tensor approximation
    • Non-convex quadratic programming
  • Combinatorial and Discrete 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
  • Stochastic, Parallel and Online Optimization example problems in ML include
    • Massive data sets
    • Distributed learning algorithms
  • 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

The above list is not exhaustive, and we welcome submissions on highly related topics too.

  • Deadline for submission of papers: 17th October 2008
  • Notification of acceptance: 7th November 2008
  • Final version of submission: 20th November 2008
  • Workshop date: 12th or 13th December 2008