Packages

class Greedy[Obs, A, R, T, S[_]] extends Policy[Obs, A, R, Cat, S]

Base logic for greedy policies.

Self Type
Greedy[Obs, A, R, T, S]
Source
Greedy.scala
Linear Supertypes
Policy[Obs, A, R, Cat, S], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Greedy
  2. Policy
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Greedy(evaluator: ActionValue[Obs, A, R, T, S], epsilon: Double)(implicit arg0: Ordering[T])

Type Members

  1. type This = Policy[Obs, A, R, Cat, S]
    Definition Classes
    Policy

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. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def choose(state: State[Obs, A, R, S]): Cat[A]
    Definition Classes
    Greedy → Policy
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  7. def contramapObservation[P](f: (P) ⇒ Obs)(implicit S: Functor[S]): Policy[P, A, R, Cat, S]
    Definition Classes
    Policy
  8. def contramapReward[T](f: (T) ⇒ R)(implicit S: Functor[S]): Policy[Obs, A, T, Cat, S]
    Definition Classes
    Policy
  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  13. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  14. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  15. def learn(sars: SARS[Obs, A, R, S]): This
    Definition Classes
    Policy
  16. def mapK[N[_]](f: FunctionK[Cat, N]): Policy[Obs, A, R, N, S]

    Just an idea to see if I can make stochastic deciders out of deterministic deciders.

    Just an idea to see if I can make stochastic deciders out of deterministic deciders. We'll see how this develops.

    Definition Classes
    Policy
  17. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  19. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  20. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  21. def toString(): String
    Definition Classes
    AnyRef → Any
  22. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from Policy[Obs, A, R, Cat, S]

Inherited from AnyRef

Inherited from Any

Ungrouped