Packages

o

com.scalarl.book

Chapter4

object Chapter4

Source
Chapter4.scala
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Chapter4
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

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. val allowedIterations: Long
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  7. val emptyFn: StateValueFn[Position, DecayState[Double]]
  8. val epsilon: Double
  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def figureFourOne(): Unit
  12. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  13. def fourOne(inPlace: Boolean): (StateValueFn[Position, DecayState[Double]], Long)
  14. def fourTwo(inPlace: Boolean): (StateValueFn[InvPair, DecayState[Double]], Config, Long)

    The big differences from the book version are:

    The big differences from the book version are:

    • Currently our Poisson distribution normalizes over the allowed values, rather than just truncating the chance of a value greater than the max to zero.
    • our Greedy policy randomly chooses from the entire greedy set, vs just choosing the "first" thing, like Numpy does.

    The Python version also keeps an actual greedy policy, which means that the policy starts by returning 0 no matter what, by design, instead of by acting as a random policy until it knows any better.

    Without that the generated values match.

    TODO ALSO... currently, the sweepUntil function only supports valueIteration or updating on every single sweep. The book actually wants to do a full round of policy evaluation before doing any policy improvement.

    We need to support that.

  15. val gamma: Double
  16. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  17. val gridConf: Config
  18. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  19. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  20. def main(items: Array[String]): Unit
  21. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  23. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  24. def runCarRental(): Unit

    I'm leaving this in a nightmare state for now.

    I'm leaving this in a nightmare state for now. To finish this out, we really need to:

    • add support for policy evaluation and policy stability checks, alternating.
    • come up with some way of actually turning a particular policy's decisions into a heat map that's not so hardcoded
    • NOT have the graph library explode when I cancel a run, for Heatmap.
  25. def shouldStop[Obs, T](l: StateValueFn[Obs, T], r: StateValueFn[Obs, T], iterations: Long, verbose: Boolean = false)(implicit arg0: ToDouble[T]): Boolean
  26. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  27. def toString(): String
    Definition Classes
    AnyRef → Any
  28. def vfToSeqPoints(vf: StateValueFn[InvPair, DecayState[Double]]): Seq[Seq[Double]]

    This currently is not great because we don't have a way of automatically binning the data and generating that graph.

    This currently is not great because we don't have a way of automatically binning the data and generating that graph. This is custom.

  29. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from AnyRef

Inherited from Any

Ungrouped