class OWLQN[K, T] extends LBFGS[T] with SerializableLogging

Implements the Orthant-wise Limited Memory QuasiNewton method, which is a variant of LBFGS that handles L1 regularization.

Paper is Andrew and Gao (2007) Scalable Training of L1-Regularized Log-Linear Models

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. OWLQN
  2. LBFGS
  3. FirstOrderMinimizer
  4. SerializableLogging
  5. Serializable
  6. Serializable
  7. Minimizer
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new OWLQN(maxIter: Int, m: Int)(implicit space: MutableEnumeratedCoordinateField[T, K, Double])
  2. new OWLQN(maxIter: Int, m: Int, l1reg: Double)(implicit space: MutableEnumeratedCoordinateField[T, K, Double])
  3. new OWLQN(maxIter: Int, m: Int, l1reg: Double, tolerance: Double = 1E-8)(implicit space: MutableEnumeratedCoordinateField[T, K, Double])
  4. new OWLQN(maxIter: Int, m: Int, l1reg: (K) ⇒ Double)(implicit space: MutableEnumeratedCoordinateField[T, K, Double])
  5. new OWLQN(maxIter: Int, m: Int, l1reg: (K) ⇒ Double, tolerance: Double)(implicit space: MutableEnumeratedCoordinateField[T, K, Double])

Type Members

  1. type History = ApproximateInverseHessian[T]

    Any history the derived minimization function needs to do its updates.

    Any history the derived minimization function needs to do its updates. typically an approximation to the second derivative/hessian matrix.

    Definition Classes
    LBFGSFirstOrderMinimizer
  2. type State = FirstOrderMinimizer.State[T, Info, History]
    Definition Classes
    FirstOrderMinimizer

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def adjust(newX: T, newGrad: T, newVal: Double): (Double, T)
    Attributes
    protected
    Definition Classes
    OWLQNFirstOrderMinimizer
  5. def adjustFunction(f: DiffFunction[T]): DiffFunction[T]
    Attributes
    protected
    Definition Classes
    LBFGSFirstOrderMinimizer
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def calculateObjective(f: DiffFunction[T], x: T, history: History): (Double, T)
    Attributes
    protected
    Definition Classes
    FirstOrderMinimizer
  8. def chooseDescentDirection(state: State, fn: DiffFunction[T]): T
    Attributes
    protected
    Definition Classes
    OWLQNLBFGSFirstOrderMinimizer
  9. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. val convergenceCheck: ConvergenceCheck[T]
    Definition Classes
    FirstOrderMinimizer
  11. def determineStepSize(state: State, f: DiffFunction[T], dir: T): Double

    Given a direction, perform a line search to find a direction to descend.

    Given a direction, perform a line search to find a direction to descend. At the moment, this just executes backtracking, so it does not fulfill the wolfe conditions.

    state

    the current state

    f

    The objective

    dir

    The step direction

    returns

    stepSize

    Attributes
    protected
    Definition Classes
    OWLQNLBFGSFirstOrderMinimizer
  12. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  14. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  15. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  16. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  17. def infiniteIterations(f: DiffFunction[T], state: State): Iterator[State]
    Definition Classes
    FirstOrderMinimizer
  18. def initialHistory(f: DiffFunction[T], x: T): History
    Attributes
    protected
    Definition Classes
    LBFGSFirstOrderMinimizer
  19. def initialState(f: DiffFunction[T], init: T): State
    Attributes
    protected
    Definition Classes
    FirstOrderMinimizer
  20. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  21. def iterations(f: DiffFunction[T], init: T): Iterator[State]
    Definition Classes
    FirstOrderMinimizer
  22. def logger: LazyLogger
    Attributes
    protected
    Definition Classes
    SerializableLogging
  23. def minimize(f: DiffFunction[T], init: T): T
    Definition Classes
    FirstOrderMinimizerMinimizer
  24. def minimizeAndReturnState(f: DiffFunction[T], init: T): State
    Definition Classes
    FirstOrderMinimizer
  25. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  26. final def notify(): Unit
    Definition Classes
    AnyRef
  27. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  28. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  29. def takeStep(state: State, dir: T, stepSize: Double): T
    Attributes
    protected
    Definition Classes
    OWLQNLBFGSFirstOrderMinimizer
  30. def toString(): String
    Definition Classes
    AnyRef → Any
  31. def updateHistory(newX: T, newGrad: T, newVal: Double, f: DiffFunction[T], oldState: State): History
    Attributes
    protected
    Definition Classes
    LBFGSFirstOrderMinimizer
  32. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from LBFGS[T]

Inherited from FirstOrderMinimizer[T, DiffFunction[T]]

Inherited from SerializableLogging

Inherited from Serializable

Inherited from Serializable

Inherited from Minimizer[T, DiffFunction[T]]

Inherited from AnyRef

Inherited from Any

Ungrouped