GENO - Optimization for classical machine learning made fast and easy

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Most problems from classical machine learning can be cast as an optimization problem. We introduce GENO (GENeric Optimization), a framework that lets the user specify a constrained or unconstrained optimization problem in an easyto- read modeling language. GENO then generates a solver, i.e., Python code, that can solve this class of optimization problems. The generated solver is usually as fast as handwritten, 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. An online interface to our framework can be found at http://www.geno-project.org.

Cite

CITATION STYLE

APA

Laue, S., Mitterreiter, M., & Giesen, J. (2020). GENO - Optimization for classical machine learning made fast and easy. In AAAI 2020 - 34th AAAI Conference on Artificial Intelligence (pp. 13620–13621). AAAI press. https://doi.org/10.1609/aaai.v34i09.7097

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free