{"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":"/code/choose-optimizer","entry":"choose_optimizer","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":2,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":5,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"unverified":3},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2405.17817","paper":"/paper/benchmarking-skeleton-based-motion-encoder","title":"Benchmarking Skeleton-based Motion Encoder Models for Clinical Applications: Estimating Parkinson's Disease Severity in Walking Sequences","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taatiteam/motionencoders_parkinsonism_benchmark","path":"learning/optimizer.py","file_url":"https://github.com/taatiteam/motionencoders_parkinsonism_benchmark/blob/HEAD/learning/optimizer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d60d14fff1c49043","mcp_get_code":{"code_sha256":"d60d14fff1c49043"}},{"arxiv_id":"2308.05077","paper":"/paper/fast-and-converged-classical-simulations-of","title":"Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance","date":null,"month_inferred_from_arxiv_id":"2023-08","title_source":"archive","repo":"jcmgray/mixpic-bp-quantum-dynamics","path":"combo_dynamics.py","file_url":"https://github.com/jcmgray/mixpic-bp-quantum-dynamics/blob/HEAD/combo_dynamics.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"code_sha256_prefix":"e110f828f752b4f6","mcp_get_code":{"code_sha256":"e110f828f752b4f6"}},{"arxiv_id":"2006.14331","paper":"/paper/a-theoretical-framework-for-target","title":"A Theoretical Framework for Target Propagation","date":"2020-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlexanderMeulemans/TheoreticalFrameworkForTargetPropagation","path":"lib/utils.py","file_url":"https://github.com/AlexanderMeulemans/TheoreticalFrameworkForTargetPropagation/blob/HEAD/lib/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"da6c0d07f0a5cfc2","mcp_get_code":{"code_sha256":"da6c0d07f0a5cfc2"}},{"arxiv_id":"1712.06041","paper":"/paper/matching-matched-filtering-with-deep-networks","title":"Matching matched filtering with deep networks in gravitational-wave astronomy","date":null,"month_inferred_from_arxiv_id":"2017-12","title_source":"archive","repo":"hagabbar/cnn_matchfiltering","path":"CNN-keras.py","file_url":"https://github.com/hagabbar/cnn_matchfiltering/blob/HEAD/CNN-keras.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f535ca2285ac3d4e","mcp_get_code":{"code_sha256":"f535ca2285ac3d4e"}},{"arxiv_id":"1503.00075","paper":"/paper/improved-semantic-representations-from-tree","title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks","date":"2015-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tomekkorbak/treehopper","path":"treehopper/model/training.py","file_url":"https://github.com/tomekkorbak/treehopper/blob/HEAD/treehopper/model/training.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"0f1a6ead94a1ebe2","mcp_get_code":{"code_sha256":"0f1a6ead94a1ebe2"}}]}