{"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/soft-threshold","entry":"soft_threshold","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":4,"n_papers":5,"n_buckets":2,"n_distinct_outputs":3,"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/soft-threshold","buckets":[{"bucket":[[2,"float","float32"]],"n_implementations_compared":3,"n_papers":5,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"8172f30836ae5276","size":2,"n_papers":2,"shape":[4,8],"dtype":"float32","type":"Tensor","finite":true,"max_difference_among_recorded_values":0.0,"members_with_recorded_values":2,"torch_reference_conventions_with_this_digest":[],"values":[1.3026286363601685,-1.0337762832641602,0.0,-0.19088703393936157,-0.4028494954109192,-0.5304712057113647,-0.1627609133720398,0.07288920879364014,0.018875956535339355,0.4591456651687622,-0.0,-1.0683481693267822,-0.0,1.8221087455749512,-0.014783978462219238,0.05052858591079712,0.0,-1.1228755712509155,0.0,-0.0,-0.0,-0.6807824373245239,-0.036868274211883545,0.48367416858673096,-0.29561281204223633,0.0,0.4449777603149414,0.5175182819366455,-0.7257857322692871,0.774217963218689,-0.8222218751907349,-0.09410911798477173],"values_recorded":32,"members":[{"code_sha256_prefix":"3f9208771cec0b61","path":"lassonet/model.py","papers":["2211.06302"],"paper_pages":[{"arxiv_id":"2211.06302","page":"/paper/graph-conditioned-mlp-for-high-dimensional"}],"arg_sig_recorded":[["x",2,"float","float32"]],"scalar_args":{"l":"0.5"},"class_bearing":false},{"code_sha256_prefix":"63e0ab2c6652828b","path":"src/model/manifold/vi_encoder.py","papers":["2205.03665"],"paper_pages":[{"arxiv_id":"2205.03665","page":"/paper/variational-sparse-coding-with-learned"}],"arg_sig_recorded":[["c",2,"float","float32"]],"scalar_args":{"zeta":"0.5"},"class_bearing":false}]},{"output_sha":"904b50c60e3a781c","size":1,"n_papers":3,"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.3026286363601685,-1.0337762832641602,0.0,-0.19088703393936157,-0.4028494954109192,-0.5304712057113647,-0.1627609133720398,0.07288920879364014,0.018875956535339355,0.4591456651687622,0.0,-1.0683481693267822,0.0,1.8221087455749512,-0.014783978462219238,0.05052858591079712,0.0,-1.1228755712509155,0.0,0.0,0.0,-0.6807824373245239,-0.036868274211883545,0.48367416858673096,-0.29561281204223633,0.0,0.4449777603149414,0.5175182819366455,-0.7257857322692871,0.774217963218689,-0.8222218751907349,-0.09410911798477173],"values_recorded":32,"members":[{"code_sha256_prefix":"bfe4b187a1c5aeaf","path":"linear_explanation.py","papers":["2405.06855","2408.01432","2604.14519"],"paper_pages":[{"arxiv_id":"2405.06855","page":"/paper/linear-explanations-for-individual-neurons"},{"arxiv_id":"2408.01432","page":"/paper/vlg-cbm-training-concept-bottleneck-models"},{"arxiv_id":"2604.14519","page":"/paper/arxiv-2604-14519"}],"arg_sig_recorded":[["beta",2,"float","float32"]],"scalar_args":{"lam":"0.5"},"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":"97656392209bc2c3","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":[0.0,-0.0,0.0,-0.0,-0.0,-0.0,-0.0,0.0,0.0,0.0,-0.0,-0.0,-0.0,0.0,-0.0,0.0,0.0,-0.0,0.0,-0.0,-0.0,-0.0,-0.0,0.0,-0.0,0.0,0.0,0.0,-0.0,0.0,-0.0,-0.0],"values_recorded":32,"members":[{"code_sha256_prefix":"b082bfb3081bcf63","path":"model/lista.py","papers":["2205.03665"],"paper_pages":[{"arxiv_id":"2205.03665","page":"/paper/variational-sparse-coding-with-learned"}],"arg_sig_recorded":[["c",2,"float","float32"],["zeta",2,"float","float32"]],"scalar_args":{},"class_bearing":false}]}]}]}