view doc/v2_planning/optimization.txt @ 1027:a1b6ccd5b6dc

few comments added
author Yoshua Bengio <bengioy@iro.umontreal.ca>
date Fri, 03 Sep 2010 21:57:22 -0400
parents 618b9fdbfda5
children 89e76e6e074f
line wrap: on
line source

Discussion of Optimization-Related Issues
=========================================

Members: JB, PL, OD

Representative: JB


Previous work - scikits, openopt, scipy  provide function optimization
algorithms.  These are not currently GPU-enabled but may be in the future.


IS PREVIOUS WORK SUFFICIENT?
--------------------------------

In many cases it is (I used it for sparse coding, and it was ok).

These packages provide batch optimization, whereas we typically need online
optimization.

It can be faster (to run) and more convenient (to implement) to have
optimization algorithms as Theano update expressions.


What optimization algorithms do we want/need?
---------------------------------------------

 - sgd 
 - sgd + momentum
 - sgd with annealing schedule
 - TONGA
 - James Marten's Hessian-free
 - Conjugate gradients, batch and (large) mini-batch [that is also what Marten's thing does]

Do we need anything to make batch algos work better with Pylearn things?
 - conjugate methods? yes
 - L-BFGS? maybe, when needed