spark-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "DB Tsai (JIRA)" <>
Subject [jira] [Commented] (SPARK-1157) L-BFGS Optimizer
Date Wed, 09 Apr 2014 04:56:16 GMT


DB Tsai commented on SPARK-1157:


> L-BFGS Optimizer
> ----------------
>                 Key: SPARK-1157
>                 URL:
>             Project: Spark
>          Issue Type: New Feature
>            Reporter: DB Tsai
> L-BFGS (Limited-memory BFGS) is an optimization algorithm like BFGS which uses an approximation
to the inverse of Hessian matrix to steer its search through the variable space, but where
BFGS stores a dense nxn approximation to the inverse Hessian, L-BFGS only stores a few vectors
to represent the approximation.
> For high dimensional optimization problems, the Newton method or BFGS is not applicable
since the amount of memory needed to store the Hessian will grow exponentially, while L-BFGS
only stores couple vectors. 
> One of the use case can be training large-scale logistic regression with so many features.
> We'll use breeze implementation of L-BFGS.

This message was sent by Atlassian JIRA

View raw message