{"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/accuracy","entry":"accuracy","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":8,"n_papers":7,"n_buckets":6,"n_distinct_outputs":7,"n_class_bearing":0,"not_compared":{"not_run_on_shared_input":{"n":30,"by_error":{"RuntimeError":25,"ValueError":4,"AssertionError":1}},"no_array_argument_ran_on_own_fixture_arguments_only":{"n":6,"n_papers":6,"recorded_shared_digest_equals_own_fixture_digest":6},"output_not_digested_non_numeric":{"n":0,"by_type":{}}},"withdrawn_excluded":0,"code_page":"/code/accuracy","buckets":[{"bucket":[[2,"int","int64"],[2,"int","int64"]],"n_implementations_compared":3,"n_papers":2,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"af5570f5a1810b7a","size":2,"n_papers":1,"shape":[],"dtype":"float64","type":"float","finite":true,"max_difference_among_recorded_values":0.0,"members_with_recorded_values":2,"torch_reference_conventions_with_this_digest":[],"values":[0.0],"values_recorded":1,"members":[{"code_sha256_prefix":"18922b51c8f0b0f2","path":"scripts/meta_ren.py","papers":["2106.15292"],"paper_pages":[{"arxiv_id":"2106.15292","page":"/paper/adaptive-sample-selection-for-robust-learning"}],"arg_sig_recorded":[["true_label",2,"int","int64"],["pred_label",2,"int","int64"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"f5c0c242e772858d","path":"scripts/batch_rewgt.py","papers":["2106.15292"],"paper_pages":[{"arxiv_id":"2106.15292","page":"/paper/adaptive-sample-selection-for-robust-learning"}],"arg_sig_recorded":[["true_label",2,"int","int64"],["pred_label",2,"int","int64"]],"scalar_args":{},"class_bearing":false}]},{"output_sha":"6c3c396ed6b5c36d","size":1,"n_papers":1,"shape":[],"dtype":"float64","type":"float","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[1.0],"values_recorded":1,"members":[{"code_sha256_prefix":"9f4da55ba3d8c0ea","path":"eval_segmentation.py","papers":["2502.08769"],"paper_pages":[{"arxiv_id":"2502.08769","page":"/paper/cluster-and-predict-latents-patches-for"}],"arg_sig_recorded":[["y_true",2,"int","int64"],["y_pred",2,"int","int64"]],"scalar_args":{"ignore_labels":"[2]"},"class_bearing":false}]}]},{"bucket":[[1,"float","float32"],[1,"float","float32"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"af5570f5a1810b7a","size":1,"n_papers":1,"shape":[],"dtype":"float64","type":"float","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[0.0],"values_recorded":1,"members":[{"code_sha256_prefix":"ec01197331434071","path":"main_rfr.py","papers":["2303.03300"],"paper_pages":[{"arxiv_id":"2303.03300","page":"/paper/chasing-fairness-under-distribution-shift-a"}],"arg_sig_recorded":[["output",1,"float","float32"],["labels",1,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[1,"float","float64"],[1,"float","float32"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"7f2e387636cd7136","size":1,"n_papers":1,"shape":[],"dtype":"float64","type":"float64","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[0.16666666666666666],"values_recorded":1,"members":[{"code_sha256_prefix":"60df39eb36936e8d","path":"bert/run_classifier.py","papers":["2004.08056"],"paper_pages":[{"arxiv_id":"2004.08056","page":"/paper/dialogue-based-relation-extraction"}],"arg_sig_recorded":[["out",1,"float","float64"],["labels",1,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[1,"int","int64"],[1,"int","int64"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"6c3c396ed6b5c36d","size":1,"n_papers":1,"shape":[],"dtype":"float64","type":"float","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[1.0],"values_recorded":1,"members":[{"code_sha256_prefix":"6169b24cbef2d3af","path":"algorithms/maml.py","papers":["1703.03400"],"paper_pages":[{"arxiv_id":"1703.03400","page":"/paper/model-agnostic-meta-learning-for-fast"}],"arg_sig_recorded":[["y_pred",1,"int","int64"],["y",1,"int","int64"]],"scalar_args":{},"class_bearing":false}]}]},{"bucket":[[2,"float","float32"],[2,"float","float32"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"c914e8188e43fff1","size":1,"n_papers":1,"shape":[4],"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.0,1.0,1.0,1.0],"values_recorded":4,"members":[{"code_sha256_prefix":"f5c1fa1ca0e10bfd","path":"interpretability/robustness.py","papers":["2304.06715"],"paper_pages":[{"arxiv_id":"2304.06715","page":"/paper/evaluating-the-robustness-of-interpretability"}],"arg_sig_recorded":[["x1",2,"float","float32"],["x2",2,"float","float32"]],"scalar_args":{"reduce":"False"},"class_bearing":false}]}]},{"bucket":[[2,"float","float32"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"109eca6c8335c2eb","size":1,"n_papers":1,"shape":[],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[0.3125],"values_recorded":1,"members":[{"code_sha256_prefix":"201573db10d8d783","path":"code/epe/EPEExperiment.py","papers":["2105.04619"],"paper_pages":[{"arxiv_id":"2105.04619","page":"/paper/enhancing-photorealism-enhancement"}],"arg_sig_recorded":[["pred",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]}]}