Fuse linear chains of tasks in a dask graph
Fuse linear chains of tasks in a dask graph: a task in MiMo-V2.6-RL-harbor-code: MiMo-V2.6-RL Code (Harbor) (Harbor dataset). A dask graph is a plain dictionary that maps keys to tasks . A task is a tuple whose first element is a callable and whose remaining elements are arguments; an argument may…
The task
A dask graph is a plain dictionary that maps keys to *tasks*. A task is a tuple whose first element is a callable and whose remaining elements are arguments; an argument may itself be a key (referring to another entry in the graph), a literal value, a nested task, or a (possibly nested) list of any of these. For…
Part of FineEnvs/MiMo-V2.6-RL-harbor-code.