Alert button
Picture for Sergio Gomez

Sergio Gomez

Alert button

Learning to learn by gradient descent by gradient descent

Add code
Bookmark button
Alert button
Nov 30, 2016
Marcin Andrychowicz, Misha Denil, Sergio Gomez, Matthew W. Hoffman, David Pfau, Tom Schaul, Brendan Shillingford, Nando de Freitas

Figure 1 for Learning to learn by gradient descent by gradient descent
Figure 2 for Learning to learn by gradient descent by gradient descent
Figure 3 for Learning to learn by gradient descent by gradient descent
Figure 4 for Learning to learn by gradient descent by gradient descent

The move from hand-designed features to learned features in machine learning has been wildly successful. In spite of this, optimization algorithms are still designed by hand. In this paper we show how the design of an optimization algorithm can be cast as a learning problem, allowing the algorithm to learn to exploit structure in the problems of interest in an automatic way. Our learned algorithms, implemented by LSTMs, outperform generic, hand-designed competitors on the tasks for which they are trained, and also generalize well to new tasks with similar structure. We demonstrate this on a number of tasks, including simple convex problems, training neural networks, and styling images with neural art.

Viaarxiv icon
Github IconAccess Paper or Ask Questions
Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon

Portfolio selection using neural networks

Add code
Bookmark button
Alert button
Jan 03, 2005
Alberto Fernandez, Sergio Gomez

Figure 1 for Portfolio selection using neural networks
Figure 2 for Portfolio selection using neural networks
Figure 3 for Portfolio selection using neural networks
Figure 4 for Portfolio selection using neural networks

In this paper we apply a heuristic method based on artificial neural networks in order to trace out the efficient frontier associated to the portfolio selection problem. We consider a generalization of the standard Markowitz mean-variance model which includes cardinality and bounding constraints. These constraints ensure the investment in a given number of different assets and limit the amount of capital to be invested in each asset. We present some experimental results obtained with the neural network heuristic and we compare them to those obtained with three previous heuristic methods.

* Computers & Operations Research 34 (2007) 1177-1191  
* 12 pages; submitted to "Computers & Operations Research" 
Viaarxiv icon
Github IconAccess Paper or Ask Questions
Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon