Timezone: »
Many problems in classical machine learning can be cast as a constrained or unconstrained optimization problem. There is a vast variety of optimization problems from classical machine learning and hence, hundreds and thousands of solvers have been implemented.
Here, we introduce GENO (GENeric Optimization), a framework that lets the user specify a constrained or unconstrained optimization problem from classical machine learning in an easy-to-read modeling language. Then, a solver is generated automatically, i.e., Python code, that can solve this class of optimization problems. The generated solver is usually as fast as hand-written, problem-specific, and well-engineered solvers. Often the solvers generated by GENO are faster by a large margin compared to recently developed solvers that are tailored to a specific problem class.
GENO is the first framework for classical machine learning problems that is flexible and at the same time efficient.
An online interface to our framework can be found at http://www.geno-project.org.
Author Information
Sören Laue (Friedrich Schiller University Jena / Data Assessment Solutions)
Matthias Mitterreiter (Friedrich Schiller University Jena)
Joachim Giesen (Friedrich-Schiller-Universitat Jena)
More from the Same Authors
-
2022 Poster: Convexity Certificates from Hessians »
Julien Klaus · Niklas Merk · Konstantin Wiedom · Sören Laue · Joachim Giesen -
2019 : Posters and Coffee »
Sameer Kumar · Tomasz Kornuta · Oleg Bakhteev · Hui Guan · Xiaomeng Dong · Minsik Cho · Sören Laue · Theodoros Vasiloudis · Andreea Anghel · Erik Wijmans · Zeyuan Shang · Oleksii Kuchaiev · Ji Lin · Susan Zhang · Ligeng Zhu · Beidi Chen · Vinu Joseph · Jialin Ding · Jonathan Raiman · Ahnjae Shin · Vithursan Thangarasa · Anush Sankaran · Akhil Mathur · Martino Dazzi · Markus Löning · Darryl Ho · Emanuel Zgraggen · Supun Nakandala · Tomasz Kornuta · Rita Kuznetsova -
2019 Poster: GENO -- GENeric Optimization for Classical Machine Learning »
Sören Laue · Matthias Mitterreiter · Joachim Giesen -
2018 Poster: Computing Higher Order Derivatives of Matrix and Tensor Expressions »
Sören Laue · Matthias Mitterreiter · Joachim Giesen -
2017 Demonstration: Matrix Calculus -- The Power of Symbolic Differentiation »
Sören Laue · Matthias Mitterreiter · Joachim Giesen -
2012 Poster: Approximating Concavely Parameterized Optimization Problems »
Joachim Giesen · Jens K Mueller · Sören Laue · Sascha Swiercy -
2012 Oral: Approximating Concavely Parameterized Optimization Problems »
Joachim Giesen · Jens K Mueller · Sören Laue · Sascha Swiercy