| 2013 | ||
|---|---|---|
| i5 | Martin Jaggi: An Equivalence between the Lasso and Support Vector Machines. CoRR abs/1303.1152 (2013) | |
| 2012 | ||
| j3 | Joachim Giesen, Martin Jaggi, Sören Laue: Regularization Paths with Guarantees for Convex Semidefinite Optimization. Journal of Machine Learning Research - Proceedings Track 22: 432-439 (2012) | |
| j2 | Bernd Gärtner, Martin Jaggi, Clément Maria: An Exponential Lower Bound on the Complexity of Regularization Paths. JoCG 3(1): 168-195 (2012) | |
| j1 | Joachim Giesen, Martin Jaggi, Sören Laue: Approximating parameterized convex optimization problems. ACM Transactions on Algorithms 9(1): 10 (2012) | |
| c4 | Joachim Giesen, Martin Jaggi, Sören Laue: Optimizing over the Growing Spectrahedron. ESA 2012: 503-514 | |
| i4 | Simon Lacoste-Julien, Martin Jaggi, Mark W. Schmidt, Patrick Pletscher: Stochastic Block-Coordinate Frank-Wolfe Optimization for Structural SVMs. CoRR abs/1207.4747 (2012) | |
| 2011 | ||
| i3 | ||
| 2010 | ||
| c3 | Joachim Giesen, Martin Jaggi, Sören Laue: Approximating Parameterized Convex Optimization Problems. ESA (1) 2010: 524-535 | |
| c2 | Martin Jaggi, Marek Sulovský: A Simple Algorithm for Nuclear Norm Regularized Problems. ICML 2010: 471-478 | |
| 2009 | ||
| c1 | Bernd Gärtner, Martin Jaggi: Coresets for polytope distance. Symposium on Computational Geometry 2009: 33-42 | |
| i2 | Bernd Gärtner, Joachim Giesen, Martin Jaggi: An Exponential Lower Bound on the Complexity of Regularization Paths. CoRR abs/0903.4817 (2009) | |
| i1 | Bernd Gärtner, Joachim Giesen, Martin Jaggi, Torsten Welsch: A Combinatorial Algorithm to Compute Regularization Paths. CoRR abs/0903.4856 (2009) | |
| 1 | Joachim Giesen | |
| 2 | Bernd Gärtner | |
| 3 | Simon Lacoste-Julien | |
| 4 | Sören Laue | |
| 5 | Clément Maria | |
| 6 | Patrick Pletscher | |
| 7 | Mark W. Schmidt | |
| 8 | Marek Sulovský | |
| 9 | Torsten Welsch |
Colors in the list of coauthors
Last update Wed May 22 04:55:22 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page