breeze.optimize

OWLQN

class OWLQN[T] extends LBFGS[T] with Logging

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
LBFGS[T], FirstOrderMinimizer[T, DiffFunction[T]], Logging, Minimizer[T, DiffFunction[T]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. OWLQN
  2. LBFGS
  3. FirstOrderMinimizer
  4. Logging
  5. Minimizer
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new OWLQN(maxIter: Int, m: Int, l1reg: Double = 1.0, tolerance: Double = 1.0E-8)(implicit vspace: MutableCoordinateSpace[T, Double])

Type Members

  1. type History = ApproximateInverseHessian[T]

    Definition Classes
    LBFGS → FirstOrderMinimizer

  2. case class State(x: T, value: Double, grad: T, adjustedValue: Double, adjustedGradient: T, iter: Int, initialAdjVal: Double, history: History, fVals: IndexedSeq[Double] = ..., numImprovementFailures: Int = 0, searchFailed: Boolean = false) extends Product with Serializable

    Definition Classes
    FirstOrderMinimizer

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. def adjust(newX: T, newGrad: T, newVal: Double): (Double, T)

    Attributes
    protected
    Definition Classes
    OWLQN → FirstOrderMinimizer

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  8. def calculateObjective(f: DiffFunction[T], x: T, history: History): (Double, T)

    Attributes
    protected
    Definition Classes
    FirstOrderMinimizer

  9. def chooseDescentDirection(state: State, fn: DiffFunction[T]): T

    Attributes
    protected
    Definition Classes
    OWLQN → LBFGS → FirstOrderMinimizer

  10. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  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
    OWLQN → LBFGS → FirstOrderMinimizer

  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 initialHistory(f: DiffFunction[T], x: T): History

    Attributes
    protected
    Definition Classes
    LBFGS → FirstOrderMinimizer

  18. def initialState(f: DiffFunction[T], init: T): State

    Attributes
    protected
    Definition Classes
    FirstOrderMinimizer

  19. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  20. def iteratingShouldStop(state: State): Boolean

    Definition Classes
    FirstOrderMinimizer

  21. def iterations(f: DiffFunction[T], init: T): Iterator[State]

    Definition Classes
    FirstOrderMinimizer

  22. lazy val logger: Logger

    Attributes
    protected
    Definition Classes
    Logging

  23. val minImprovementWindow: Int

    Definition Classes
    FirstOrderMinimizer

  24. def minimize(f: DiffFunction[T], init: T): T

    Definition Classes
    FirstOrderMinimizer → Minimizer

  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. val numberOfImprovementFailures: Int

    Definition Classes
    FirstOrderMinimizer

  29. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  30. def takeStep(state: State, dir: T, stepSize: Double): T

    Attributes
    protected
    Definition Classes
    OWLQN → LBFGS → FirstOrderMinimizer

  31. def toString(): String

    Definition Classes
    AnyRef → Any

  32. def updateFValWindow(oldState: State, newAdjVal: Double): IndexedSeq[Double]

    Attributes
    protected
    Definition Classes
    FirstOrderMinimizer

  33. def updateHistory(newX: T, newGrad: T, newVal: Double, f: DiffFunction[T], oldState: State): History

    Attributes
    protected
    Definition Classes
    LBFGS → FirstOrderMinimizer

  34. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  35. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  36. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from LBFGS[T]

Inherited from FirstOrderMinimizer[T, DiffFunction[T]]

Inherited from Logging

Inherited from Minimizer[T, DiffFunction[T]]

Inherited from AnyRef

Inherited from Any

Ungrouped