About
One area of high impact both in theory and applications is kernel methods and support vector machines. Optimization problems, learning and representations of models are key ingredients in these methods. On the other hand considerable progress has also been made on regularization of parametric models, including methods for compressed sensing and sparsity, where convex optimization plays a prominent role. The aim of ROKS-2013 is to provide a multi-disciplinary forum where researchers of different communities can meet, to find new synergies along these areas, both at the level of theory and applications.
The scope includes but is not limited to: *Regularization: L2, L1, Lp, lasso, group lasso, elastic net, spectral regularization, nuclear norm, others *Support vector machines, least squares support vector machines, kernel methods, gaussian processes and graphical models *Lagrange duality, Fenchel duality, estimation in Hilbert spaces, reproducing kernel Hilbert spaces, Banach spaces, operator splitting *Optimization formulations, optimization algorithms *Supervised, unsupervised, semi-supervised learning, inductive and transductive learning *Multi-task learning, multiple kernel learning, choice of kernel functions, manifold learning *Prior knowledge incorporation *Approximation theory, learning theory, statistics *Matrix and tensor completion, learning with tensors *Feature selection, structure detection, regularization paths, model selection *Sparsity and interpretability *On-line learning and optimization *Applications in machine learning, computational intelligence, pattern analysis, system identification, signal processing, networks, datamining, others *Software
For more information visit the Workshop´s website.
Related categories
Uploaded videos:
Opening
Welcome to ROKS 2013
Aug 26, 2013
·
3827 Views
Invited Talks
Deep-er Kernels
Aug 26, 2013
·
11998 Views
Connections between the Lasso and Support Vector Machines
Aug 26, 2013
·
6607 Views
From Kernels to Causality
Aug 26, 2013
·
5855 Views
Beyond Stochastic Gradient Descent
Aug 26, 2013
·
7146 Views
Domain Specific Languages for Convex Optimization
Aug 26, 2013
·
5666 Views
Dynamic ℓ1 Reconstruction
Aug 26, 2013
·
4508 Views
Multi-task Learning
Aug 26, 2013
·
8038 Views
Primal-Dual Subgradient Methods for Huge-Scale Problems
Aug 26, 2013
·
5891 Views
Living on the Edge - Phase Transitions in Random Convex Programs
Aug 26, 2013
·
5381 Views
Minimum Error Entropy Principle for Learning
Aug 26, 2013
·
4410 Views
Learning from Weakly Labeled Data
Aug 26, 2013
·
5366 Views
Oral session 1: Feature selection and sparsity
The Graph-guided Group Lasso
Aug 26, 2013
·
4044 Views
Feature Selection via Detecting Ineffective Features
Aug 26, 2013
·
3758 Views
Oral session 2: Optimization algorithms
The First-Order View of Boosting Methods: Computational Complexity and Connectio...
Aug 26, 2013
·
3242 Views
Fixed-Size Pegasos for Large Scale Pinball Loss SVM
Aug 26, 2013
·
3266 Views
Oral session 3: Kernel methods and support vector machines
Output Kernel Learning Methods
Aug 26, 2013
·
4421 Views
Deep Support Vector Machines
Aug 26, 2013
·
21383 Views
Subspace Learning
Aug 26, 2013
·
5486 Views
Kernel Based Identification of Systems with Multiple Outputs Using Nuclear Norm ...
Aug 26, 2013
·
3190 Views
Oral session 4: Structured low-rank approximation
Fast Algorithms for Informed Source Separation
Aug 26, 2013
·
3114 Views
Structured Low-Rank Approximation as Optimization on a Grassmann Manifold
Aug 26, 2013
·
4481 Views
Scalable Structured Low Rank Matrix Optimization Problems
Aug 26, 2013
·
3493 Views
Oral session 5: Robustness
Learning with Marginalized Corrupted Features
Aug 26, 2013
·
4724 Views
Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization
Aug 26, 2013
·
5595 Views
Closing
Closing
Aug 26, 2013
·
2637 Views