package fehu
Reinforcement learning framework for OCaml
Install
dune-project
Dependency
Authors
Maintainers
Sources
raven-1.0.0.alpha1.tbz
sha256=8e277ed56615d388bc69c4333e43d1acd112b5f2d5d352e2453aef223ff59867
sha512=369eda6df6b84b08f92c8957954d107058fb8d3d8374082e074b56f3a139351b3ae6e3a99f2d4a4a2930dd950fd609593467e502368a13ad6217b571382da28c
doc/src/fehu/space.ml.html
Source file space.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529
open Format module Value = struct type t = | Int of int | Float of float | Bool of bool | Int_array of int array | Float_array of float array | Bool_array of bool array | List of t list | Tuple of t list | Dict of (string * t) list | String of string let rec pp fmt = function | Int i -> fprintf fmt "%d" i | Float f -> fprintf fmt "%g" f | Bool b -> fprintf fmt "%B" b | Int_array arr -> pp_array fmt (fun fmt x -> fprintf fmt "%d" x) arr | Float_array arr -> pp_array fmt (fun fmt x -> fprintf fmt "%g" x) arr | Bool_array arr -> pp_array fmt (fun fmt x -> fprintf fmt "%B" x) arr | List values -> fprintf fmt "[%a]" pp_list values | Tuple values -> fprintf fmt "(%a)" pp_list values | Dict entries -> fprintf fmt "{%a}" pp_dict entries | String s -> fprintf fmt "%S" s and pp_array : type a. formatter -> (formatter -> a -> unit) -> a array -> unit = fun fmt pp_elem arr -> fprintf fmt "[|"; for idx = 0 to Array.length arr - 1 do if idx > 0 then fprintf fmt "; "; pp_elem fmt arr.(idx) done; fprintf fmt "|]" and pp_list fmt = function | [] -> () | x :: xs -> pp fmt x; List.iter (fun value -> fprintf fmt ", %a" pp value) xs and pp_dict fmt entries = let rec loop first = function | [] -> () | (key, value) :: rest -> if not first then fprintf fmt "; "; fprintf fmt "%s=%a" key pp value; loop false rest in loop true entries let to_string value = asprintf "%a" pp value end open Value let default_rng rng = Option.value rng ~default:(Rune.Rng.key 42) type 'a t = { shape : int array option; contains : 'a -> bool; sample : ?rng:Rune.Rng.key -> unit -> 'a; pack : 'a -> Value.t; unpack : Value.t -> ('a, string) result; } type packed = Pack : 'a t -> packed let shape space = space.shape let contains space value = space.contains value let sample ?rng space = space.sample ?rng () let pack space value = space.pack value let unpack space value = space.unpack value let errorf fmt = Format.kasprintf (fun msg -> Error msg) fmt module Discrete = struct type element = (int32, Rune.int32_elt) Rune.t let create ?(start = 0) n = if n <= 0 then invalid_arg "Space.Discrete.create: n must be strictly positive"; let contains tensor = let reshaped = Rune.reshape [| 1 |] tensor in let values : Int32.t array = Rune.to_array reshaped in Array.length values = 1 && let v = Int32.to_int values.(0) in v >= start && v < start + n in { shape = None; contains; sample = (fun ?rng () -> let rng = default_rng rng in let tensor = Rune.Rng.randint rng ~min:start ~max:(start + n) [| 1 |] in let values : Int32.t array = Rune.to_array tensor in Rune.scalar Rune.int32 values.(0)); pack = (fun tensor -> let values : Int32.t array = Rune.to_array (Rune.reshape [| 1 |] tensor) in Int (Int32.to_int values.(0))); unpack = (function | Int value when value >= start && value < start + n -> Ok (Rune.scalar Rune.int32 (Int32.of_int value)) | Int value -> errorf "Discrete value %d outside of [%d, %d)" value start (start + n) | other -> errorf "Discrete expects Int value, received %s" (Value.to_string other)); } end module Box = struct type element = (float, Rune.float32_elt) Rune.t let guard_bounds low high = Array.iteri (fun idx low_i -> let high_i = high.(idx) in if low_i > high_i then invalid_arg (Printf.sprintf "Space.Box.create: low[%d]=%f greater than high[%d]=%f" idx low_i idx high_i)) low let create ~low ~high = if Array.length low = 0 then invalid_arg "Space.Box.create: low cannot be empty"; if Array.length low <> Array.length high then invalid_arg "Space.Box.create: low and high must have identical shapes"; guard_bounds low high; let arity = Array.length low in let contains tensor = let shape = Rune.shape tensor in Array.length shape = 1 && shape.(0) = arity && let values = Rune.to_array tensor in let rec loop idx = if idx = arity then true else let v = values.(idx) in let l = low.(idx) in let h = high.(idx) in if v < l || v > h then false else loop (idx + 1) in loop 0 in { shape = Some [| arity |]; contains; sample = (fun ?rng () -> let rng = default_rng rng in let values = Array.mapi (fun idx low_i -> let high_i = high.(idx) in if Float.equal low_i high_i then low_i else let uniform_tensor = Rune.Rng.uniform rng Rune.float32 [| 1 |] in let range = high_i -. low_i in let arr = Rune.to_array uniform_tensor in low_i +. (arr.(0) *. range)) low in Rune.create Rune.float32 [| arity |] values); pack = (fun tensor -> let values = Rune.to_array tensor in Float_array (Array.copy values)); unpack = (function | Float_array arr when Array.length arr = arity -> let tensor = Rune.create Rune.float32 [| arity |] arr in if contains tensor then Ok tensor else errorf "Box value outside of bounds: %s" (Value.to_string (Float_array arr)) | Float_array arr -> errorf "Box expects vector of size %d, received size %d" arity (Array.length arr) | other -> errorf "Box expects Float_array, received %s" (Value.to_string other)); } end module Multi_binary = struct type element = (int32, Rune.int32_elt) Rune.t let create n = if n <= 0 then invalid_arg "Space.Multi_binary.create: n must be positive"; { shape = Some [| n |]; contains = (fun tensor -> let shape = Rune.shape tensor in Array.length shape = 1 && shape.(0) = n && let arr : Int32.t array = Rune.to_array tensor in Array.for_all (fun v -> v = Int32.zero || v = Int32.one) arr); sample = (fun ?rng () -> let rng = default_rng rng in let tensor = Rune.Rng.randint rng ~min:0 ~max:2 [| n |] in tensor); pack = (fun tensor -> let arr : Int32.t array = Rune.to_array tensor in Bool_array (Array.init n (fun idx -> not (Int32.equal arr.(idx) Int32.zero)))); unpack = (function | Bool_array arr when Array.length arr = n -> let data = Array.map (fun b -> if b then Int32.one else Int32.zero) arr in Ok (Rune.create Rune.int32 [| n |] data) | Bool_array arr -> errorf "MultiBinary expects vector of size %d, received size %d" n (Array.length arr) | other -> errorf "MultiBinary expects Bool_array, received %s" (Value.to_string other)); } end module Multi_discrete = struct type element = (int32, Rune.int32_elt) Rune.t let create bounds = if Array.length bounds = 0 then invalid_arg "Space.Multi_discrete.create: empty bounds"; Array.iteri (fun idx bound -> if bound <= 0 then invalid_arg (Format.sprintf "Space.Multi_discrete.create: bounds[%d] must be > 0" idx)) bounds; let arity = Array.length bounds in let contains tensor = let shape = Rune.shape tensor in Array.length shape = 1 && shape.(0) = arity && let arr : Int32.t array = Rune.to_array tensor in let rec loop idx = if idx = arity then true else let max_value = bounds.(idx) in let v = Int32.to_int arr.(idx) in if v < 0 || v >= max_value then false else loop (idx + 1) in loop 0 in { shape = Some [| arity |]; contains; sample = (fun ?rng () -> let rng = default_rng rng in let data = Array.mapi (fun idx _ -> let tensor = Rune.Rng.randint rng ~min:0 ~max:bounds.(idx) [| 1 |] in let arr = Rune.to_array tensor in arr.(0)) bounds in Rune.create Rune.int32 [| arity |] data); pack = (fun tensor -> let arr : Int32.t array = Rune.to_array tensor in Int_array (Array.map Int32.to_int arr)); unpack = (function | Int_array arr when Array.length arr = arity -> let data = Array.map Int32.of_int arr in let tensor = Rune.create Rune.int32 [| arity |] data in if contains tensor then Ok tensor else errorf "MultiDiscrete value outside of bounds: %s" (Value.to_string (Int_array arr)) | Int_array arr -> errorf "MultiDiscrete expects vector of size %d, received size %d" arity (Array.length arr) | other -> errorf "MultiDiscrete expects Int_array, received %s" (Value.to_string other)); } end module Tuple = struct type element = Value.t list let create spaces = let spaces = Array.of_list spaces in let expected_length = Array.length spaces in let contains values = let rec loop idx = function | [] -> idx = expected_length | value :: tail -> ( if idx >= expected_length then false else let (Pack space) = spaces.(idx) in match space.unpack value with | Ok _ -> loop (idx + 1) tail | Error _ -> false) in loop 0 values in { shape = None; contains; sample = (fun ?rng () -> let rng = default_rng rng in let rec build idx acc = if idx < 0 then acc else let (Pack space) = spaces.(idx) in let sample_value = space.sample ~rng () in let packed = space.pack sample_value in build (idx - 1) (packed :: acc) in build (expected_length - 1) []); pack = (fun values -> Tuple values); unpack = (function | Tuple values -> if List.length values <> expected_length then errorf "Tuple expects %d elements, received %d" expected_length (List.length values) else Ok values | other -> errorf "Tuple expects tuple value, received %s" (Value.to_string other)); } end module Dict = struct type element = (string * Value.t) list module String_map = Map.Make (String) let create entries = let map = entries |> List.to_seq |> Seq.fold_left (fun acc (key, Pack space) -> if String_map.mem key acc then invalid_arg (Printf.sprintf "Space.Dict.create: duplicate key '%s'" key); String_map.add key (Pack space) acc) String_map.empty in let contains values = let rec loop remaining map = match remaining with | [] -> String_map.is_empty map | (key, value) :: rest -> ( match String_map.find_opt key map with | None -> false | Some (Pack space) -> ( match space.unpack value with | Ok _ -> loop rest (String_map.remove key map) | Error _ -> false)) in loop values map in { shape = None; contains; sample = (fun ?rng () -> let rng = default_rng rng in String_map.fold (fun key (Pack space) acc -> let sample_value = space.sample ~rng () in let packed = space.pack sample_value in (key, packed) :: acc) map []); pack = (fun values -> Dict values); unpack = (function | Dict values -> if contains values then Ok values else errorf "Dict contains unexpected keys or values" | other -> errorf "Dict expects object value, received %s" (Value.to_string other)); } end module Sequence = struct type 'a element = 'a list let create ?(min_length = 0) ?max_length base = if min_length < 0 then invalid_arg "Space.Sequence.create: min_length must be non-negative"; let max_length = match max_length with | None -> min_length | Some max_length when max_length < min_length -> invalid_arg "Space.Sequence.create: max_length must be >= min_length" | Some max_length -> max_length in let contains values = let len = List.length values in len >= min_length && len <= max_length && List.for_all (fun value -> base.contains value) values in { shape = None; contains; sample = (fun ?rng () -> let rng = default_rng rng in let length = if max_length = min_length then min_length else let tensor = Rune.Rng.randint rng ~min:min_length ~max:(max_length + 1) [| 1 |] in let arr = Rune.to_array tensor in Int32.to_int arr.(0) in let rec build n acc = if n = 0 then List.rev acc else let sample_value = base.sample ~rng () in build (n - 1) (sample_value :: acc) in build length []); pack = (fun values -> Value.List (List.map (fun value -> base.pack value) values)); unpack = (function | Value.List values -> let len = List.length values in if len < min_length || len > max_length then errorf "Sequence length %d outside of [%d, %d]" len min_length max_length else let rec loop acc = function | [] -> Ok (List.rev acc) | value :: rest -> ( match base.unpack value with | Ok v -> loop (v :: acc) rest | Error _ as err -> err) in loop [] values | other -> errorf "Sequence expects list value, received %s" (Value.to_string other)); } end module Text = struct type element = string let default_charset = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789 " let create ?charset ?(max_length = 64) () = if max_length <= 0 then invalid_arg "Space.Text.create: max_length must be positive"; let charset = Option.value charset ~default:default_charset in let charset_length = String.length charset in if charset_length = 0 then invalid_arg "Space.Text.create: charset must not be empty"; let contains value = let len = String.length value in len <= max_length && let rec loop idx = if idx = len then true else let ch = value.[idx] in if String.contains charset ch then loop (idx + 1) else false in loop 0 in { shape = None; contains; sample = (fun ?rng () -> let rng = default_rng rng in let length = if max_length = 1 then 1 else let tensor = Rune.Rng.randint rng ~min:1 ~max:(max_length + 1) [| 1 |] in let arr = Rune.to_array tensor in Int32.to_int arr.(0) in Bytes.init length (fun idx -> charset.[idx mod charset_length]) |> Bytes.to_string); pack = (fun value -> Value.String value); unpack = (function | Value.String s when contains s -> Ok s | Value.String s -> errorf "Text value '%s' violates constraints" s | other -> errorf "Text expects string value, received %s" (Value.to_string other)); } end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>