{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/census/td-target","entry":"td_target","source":"Syntology differential census (groundwork/55, run v2_2026-09-22), per sample; not an archive number","census_date":"2026-09-22","battery_sha256":["b986f7e04d794a0d88ad4c5f32cf63ec3590b5deff0192150737bc5f1c0b4677"],"runner_sha256":["5a452d0e7c0da5b80771d1be2afe3572e253568cf5c5d59a0d08ebd663d00808"],"bucket_key":"positional (rank, kind, dtype) of each array argument; the argument name is not part of the key because the harness draws the shared array from (rank, kind) and casts it to the dtype, whatever the name","bucket_fields":["rank","kind","dtype"],"claim":"Implementations sharing this entry name were each run on one shared input fixed by the positional (rank, kind, dtype) of their array arguments (the bucket). A cluster is the set whose recorded output digest (sha256 of the output rounded to 6 decimals) is identical. Identical values to six decimals on the shared input are agreement on those inputs, not a statement about the whole domain and not a substitution claim.","n_implementations_compared":2,"n_papers":6,"n_buckets":2,"n_distinct_outputs":2,"n_class_bearing":0,"not_compared":{"not_run_on_shared_input":{"n":0,"by_error":{}},"no_array_argument_ran_on_own_fixture_arguments_only":{"n":0,"n_papers":0,"recorded_shared_digest_equals_own_fixture_digest":0},"output_not_digested_non_numeric":{"n":0,"by_type":{}}},"withdrawn_excluded":0,"code_page":"/code/td-target","buckets":[{"bucket":[[2,"float","float32"],[0,"float","float32"],[2,"float","float32"],[2,"float","float32"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"c263546b4908ba08","size":1,"n_papers":1,"shape":[4,8],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[1.953844666481018,2.6176490783691406,-0.012213602662086487,0.6920478343963623,1.0644277334213257,1.3248841762542725,0.6482833623886108,0.03170210123062134,0.005272164940834045,0.36294132471084595,0.3002992570400238,2.722001552581787,0.1919204592704773,3.5258378982543945,0.4398254156112671,0.020168572664260864,-0.024452921003103256,2.890653133392334,-0.026967547833919525,0.3101462125778198,0.010002974420785904,1.6665878295898438,0.4686106741428375,0.3924034833908081,0.8666391372680664,-0.02661866694688797,0.346382200717926,0.4347074031829834,1.7762460708618164,0.8179534673690796,2.022637128829956,0.5470173954963684],"values_recorded":32,"members":[{"code_sha256_prefix":"6785bf48d01be235","path":"rambo/algorithms/birl.py","papers":["2309.08571"],"paper_pages":[{"arxiv_id":"2309.08571","page":"/paper/a-bayesian-approach-to-robust-inverse"}],"arg_sig_recorded":[["reward",2,"float","float32"],["discount",0,"float","float32"],["next_value",2,"float","float32"],["terminated",2,"float","float32"]],"scalar_args":{"use_done_flag":"True"},"class_bearing":false}]}]},{"bucket":[[2,"float","float32"],[2,"float","float32"]],"n_implementations_compared":1,"n_papers":5,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"4ee9dc87608e171a","size":1,"n_papers":5,"shape":[4,8],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[3.587231159210205,-3.0522148609161377,0.9473459720611572,-1.3748652935028076,-1.7966704368591309,-2.050637722015381,-1.3188941478729248,1.1400494575500488,1.0325632095336914,1.908699870109558,-0.7904271483421326,-3.1210129261016846,-0.5741848349571228,4.620996475219727,-1.024420142173767,1.0955519676208496,0.13212692737579346,-3.229522228240967,0.8599017262458801,-0.8083099126815796,-0.044962506741285324,-2.349757194519043,-1.0683679580688477,1.9575116634368896,-1.583269476890564,0.8622161149978638,1.8805058002471924,2.0248613357543945,-2.4393136501312256,2.535693645477295,-2.6312215328216553,-1.1822772026062012],"values_recorded":32,"members":[{"code_sha256_prefix":"31deb9c7be58e00c","path":"rambo/algorithms/rambo.py","papers":["2204.12581","2212.00124","1906.08253","1812.05905","2103.13842"],"paper_pages":[{"arxiv_id":"2204.12581","page":"/paper/rambo-rl-robust-adversarial-model-based"},{"arxiv_id":"2212.00124","page":"/paper/one-risk-to-rule-them-all-a-risk-sensitive-1"},{"arxiv_id":"1906.08253","page":"/paper/when-to-trust-your-model-model-based-policy"},{"arxiv_id":"1812.05905","page":"/paper/soft-actor-critic-algorithms-and-applications"},{"arxiv_id":"2103.13842","page":"/paper/model-predictive-actor-critic-accelerating"}],"arg_sig_recorded":[["reward",2,"float","float32"],["next_value",2,"float","float32"]],"scalar_args":{"discount":"0.99"},"class_bearing":false}]}]}]}