Class

com.iheart.thomas.bandit.single

EpsilonGreedyAlgorithm

Related Doc: package single

Permalink

class EpsilonGreedyAlgorithm[RewardStateT] extends SingleChoiceAlgorithmAlgebra[Id, RewardStateT]

Linear Supertypes
SingleChoiceAlgorithmAlgebra[Id, RewardStateT], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EpsilonGreedyAlgorithm
  2. SingleChoiceAlgorithmAlgebra
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new EpsilonGreedyAlgorithm(initEpsilon: Double)(implicit RewardStateT: RewardState[RewardStateT])

    Permalink

Type Members

  1. type State = SingleChoiceBanditState[RewardStateT]

    Permalink
    Definition Classes
    SingleChoiceAlgorithmAlgebra

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 chooseArm(state: State): State

    Permalink
    Definition Classes
    EpsilonGreedyAlgorithm → SingleChoiceAlgorithmAlgebra

  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. def initialState(spec: BanditSpec): State

    Permalink
    Definition Classes
    EpsilonGreedyAlgorithm → SingleChoiceAlgorithmAlgebra

  13. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  15. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  16. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  18. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  19. final def wait(): Unit

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

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

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

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

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

Inherited from SingleChoiceAlgorithmAlgebra[Id, RewardStateT]

Inherited from AnyRef

Inherited from Any

Ungrouped