Class

com.twitter.algebird

SGDMonoid

Related Doc: package algebird

Permalink

class SGDMonoid[Pos] extends Monoid[SGD[Pos]]

Basically a specific implementation of the RightFoldedMonoid gradient is the gradient of the function to be minimized To use this, you need to insert an initial weight SGDWeights before you start adding SGDPos objects. Otherwise you will just be doing list concatenation.

Linear Supertypes
Monoid[SGD[Pos]], Semigroup[SGD[Pos]], Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. SGDMonoid
  2. Monoid
  3. Semigroup
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SGDMonoid(stepfn: (Long, IndexedSeq[Double]) ⇒ Double, gradient: (IndexedSeq[Double], Pos) ⇒ IndexedSeq[Double])

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def assertNotZero(v: SGD[Pos]): Unit

    Permalink
    Definition Classes
    Monoid

  6. def clone(): AnyRef

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

  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  9. def finalize(): Unit

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

  10. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  11. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  13. def isNonZero(v: SGD[Pos]): Boolean

    Permalink
    Definition Classes
    Monoid

  14. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  15. def newWeights(sgdW: SGDWeights, p: Pos): SGDWeights

    Permalink

  16. def nonZeroOption(v: SGD[Pos]): Option[SGD[Pos]]

    Permalink
    Definition Classes
    Monoid

  17. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  18. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  19. def plus(left: SGD[Pos], right: SGD[Pos]): SGD[Pos]

    Permalink
    Definition Classes
    SGDMonoid → Semigroup

  20. def sum(vs: TraversableOnce[SGD[Pos]]): SGD[Pos]

    Permalink
    Definition Classes
    Monoid

  21. def sumOption(iter: TraversableOnce[SGD[Pos]]): Option[SGD[Pos]]

    Permalink

    override this if there is a faster way to do this sum than reduceLeftOption on plus

    override this if there is a faster way to do this sum than reduceLeftOption on plus

    Definition Classes
    Semigroup

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

    Permalink
    Definition Classes
    AnyRef

  23. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  24. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  27. val zero: SGDZero.type

    Permalink
    Definition Classes
    SGDMonoid → Monoid

Inherited from Monoid[SGD[Pos]]

Inherited from Semigroup[SGD[Pos]]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped