{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/optimizer","entry":"Optimizer","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":18,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":13,"n_papers_ran_instrument_only":0,"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":19,"n_samples_ran":14,"n_samples_constructed":11,"n_samples_ran_checked":14,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":1,"n_places":19,"n_places_pointer_only":9,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":14,"unverified":5},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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":"2605.23473","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-23473","title":"Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Evolutionary-Intelligence/pypop","path":"pypop7/optimizers/bo/lamcts.py","file_url":"https://github.com/Evolutionary-Intelligence/pypop/blob/HEAD/pypop7/optimizers/bo/lamcts.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, Evolutionary-Intelligence/pypop, is not in the permissive set Syntology serves inline","code_sha256":"f8702fe36ffd2e73","code_sha256_prefix":"f8702fe36ffd2e73","mcp_get_code":{"code_sha256":"f8702fe36ffd2e73"}},{"arxiv_id":"2502.19980","arxiv_id_is_arxiv":true,"paper":"/paper/can-textual-gradient-work-in-federated","title":"Can Textual Gradient Work in Federated Learning?","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ubc-tea/FedTextGrad","path":"textgrad/optimizer/optimizer.py","file_url":"https://github.com/ubc-tea/FedTextGrad/blob/HEAD/textgrad/optimizer/optimizer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ubc-tea/FedTextGrad when it was checked","code_sha256":"564ea28ae44d788f","code_sha256_prefix":"564ea28ae44d788f","mcp_get_code":{"code_sha256":"564ea28ae44d788f"}},{"arxiv_id":"2502.01704","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-observation-cost-control-for","title":"Adaptive Observation Cost Control for Variational Quantum Eigensolvers","date":"2025-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"angler-vqe/subscore","path":"src/subscore/bayesopt/bo.py","file_url":"https://github.com/angler-vqe/subscore/blob/HEAD/src/subscore/bayesopt/bo.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, angler-vqe/subscore when it was checked","code_sha256":"67357eab38c03c79","code_sha256_prefix":"67357eab38c03c79","mcp_get_code":{"code_sha256":"67357eab38c03c79"}},{"arxiv_id":"2502.01704","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-observation-cost-control-for","title":"Adaptive Observation Cost Control for Variational Quantum Eigensolvers","date":"2025-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emicore/emicore","path":"src/emicore/bo.py","file_url":"https://github.com/emicore/emicore/blob/HEAD/src/emicore/bo.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, emicore/emicore when it was checked","code_sha256":"2b7d6039ba3f5223","code_sha256_prefix":"2b7d6039ba3f5223","mcp_get_code":{"code_sha256":"2b7d6039ba3f5223"}},{"arxiv_id":"2407.18505","arxiv_id_is_arxiv":true,"paper":"/paper/voxsim-a-perceptual-voice-similarity-dataset","title":"VoxSim: A perceptual voice similarity dataset","date":"2024-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaistmm/voxsim_trainer","path":"optimizer/adam.py","file_url":"https://github.com/kaistmm/voxsim_trainer/blob/HEAD/optimizer/adam.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kaistmm/voxsim_trainer when it was checked","code_sha256":"8857cf22d4733067","code_sha256_prefix":"8857cf22d4733067","mcp_get_code":{"code_sha256":"8857cf22d4733067"}},{"arxiv_id":"2305.15260","arxiv_id_is_arxiv":true,"paper":"/paper/collaborative-world-models-an-online-offline","title":"Making Offline RL Online: Collaborative World Models for Offline Visual Reinforcement Learning","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiwang067/CoWorld","path":"models.py","file_url":"https://github.com/qiwang067/CoWorld/blob/HEAD/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, qiwang067/CoWorld when it was checked","code_sha256":"47e0a0e2a2c2db4b","code_sha256_prefix":"47e0a0e2a2c2db4b","mcp_get_code":{"code_sha256":"47e0a0e2a2c2db4b"}},{"arxiv_id":"2304.00789","arxiv_id_is_arxiv":true,"paper":"/paper/combinatorial-optimization-enriched-machine","title":"Combinatorial Optimization enriched Machine Learning to solve the Dynamic Vehicle Routing Problem with Time Windows","date":"2023-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tumbais/euro-meets-neurips-2022","path":"training/optimization.py","file_url":"https://github.com/tumbais/euro-meets-neurips-2022/blob/HEAD/training/optimization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f71c69c65ce31fe1","code_sha256_prefix":"f71c69c65ce31fe1","mcp_get_code":{"code_sha256":"f71c69c65ce31fe1"}},{"arxiv_id":"2301.06015","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-based-generation-optimization-and","title":"Diffusion-based Generation, Optimization, and Planning in 3D Scenes","date":"2023-01-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scenediffuser/Scene-Diffuser","path":"models/dm/ddpm.py","file_url":"https://github.com/scenediffuser/Scene-Diffuser/blob/HEAD/models/dm/ddpm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a6222e5f451c662a","code_sha256_prefix":"a6222e5f451c662a","mcp_get_code":{"code_sha256":"a6222e5f451c662a"}},{"arxiv_id":"2301.04104","arxiv_id_is_arxiv":true,"paper":"/paper/mastering-diverse-domains-through-world","title":"Mastering Diverse Domains through World Models","date":"2023-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nm512/dreamerv3-torch","path":"dreamer.py","file_url":"https://github.com/nm512/dreamerv3-torch/blob/HEAD/dreamer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ad4473538a000c98","code_sha256_prefix":"ad4473538a000c98","mcp_get_code":{"code_sha256":"ad4473538a000c98"}},{"arxiv_id":"2212.08235","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-decentralized-cross-entropy-method","title":"A Simple Decentralized Cross-Entropy Method","date":"2022-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vincentzhang/decentcem","path":"dmbrl/misc/optimizers/decent_cem.py","file_url":"https://github.com/vincentzhang/decentcem/blob/HEAD/dmbrl/misc/optimizers/decent_cem.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b2643bc67ba7017b","code_sha256_prefix":"b2643bc67ba7017b","mcp_get_code":{"code_sha256":"b2643bc67ba7017b"}},{"arxiv_id":"2210.03664","arxiv_id_is_arxiv":true,"paper":"/paper/bi-directional-weakly-supervised-knowledge","title":"Bi-directional Weakly Supervised Knowledge Distillation for Whole Slide Image Classification","date":"2022-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miccaiif/weno","path":"train_CAMELYONFeat_BagDistillationDSMIL_SharedEnc_Similarity_StuFilterSmoothed_DropPos.py","file_url":"https://github.com/miccaiif/weno/blob/HEAD/train_CAMELYONFeat_BagDistillationDSMIL_SharedEnc_Similarity_StuFilterSmoothed_DropPos.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, miccaiif/weno when it was checked","code_sha256":"5ffdba2dcbe80a03","code_sha256_prefix":"5ffdba2dcbe80a03","mcp_get_code":{"code_sha256":"5ffdba2dcbe80a03"}},{"arxiv_id":"2209.12016","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-model-based-pre-training-for","title":"Mastering the Unsupervised Reinforcement Learning Benchmark from Pixels","date":"2022-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mazpie/mastering-urlb","path":"agent/dreamer.py","file_url":"https://github.com/mazpie/mastering-urlb/blob/HEAD/agent/dreamer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"374c4448ac4f78c9","code_sha256_prefix":"374c4448ac4f78c9","mcp_get_code":{"code_sha256":"374c4448ac4f78c9"}},{"arxiv_id":"2207.08645","arxiv_id_is_arxiv":true,"paper":"/paper/active-exploration-for-inverse-reinforcement","title":"Active Exploration for Inverse Reinforcement Learning","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lasgroup/aceirl","path":"src/active_irl/aceirl/algorithm.py","file_url":"https://github.com/lasgroup/aceirl/blob/HEAD/src/active_irl/aceirl/algorithm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f86e4d591b2e9ab0","code_sha256_prefix":"f86e4d591b2e9ab0","mcp_get_code":{"code_sha256":"f86e4d591b2e9ab0"}},{"arxiv_id":"2112.07380","arxiv_id_is_arxiv":true,"paper":"/paper/tracer-extreme-attention-guided-salient","title":"TRACER: Extreme Attention Guided Salient Object Tracing Network","date":"2021-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Karel911/TRACER","path":"util/losses.py","file_url":"https://github.com/Karel911/TRACER/blob/HEAD/util/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e1efea555907f415","code_sha256_prefix":"e1efea555907f415","mcp_get_code":{"code_sha256":"e1efea555907f415"}},{"arxiv_id":"2103.06624","arxiv_id_is_arxiv":true,"paper":"/paper/beta-crown-efficient-bound-propagation-with","title":"Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Robustness Verification","date":"2021-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-sri/eran","path":"tf_verify/optimizer.py","file_url":"https://github.com/eth-sri/eran/blob/HEAD/tf_verify/optimizer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ed7f6744c1db4625","code_sha256_prefix":"ed7f6744c1db4625","mcp_get_code":{"code_sha256":"ed7f6744c1db4625"}},{"arxiv_id":"2002.08030","arxiv_id_is_arxiv":true,"paper":"/paper/transfer-among-agents-an-efficient-multiagent-1","title":"An Efficient Transfer Learning Framework for Multiagent Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2020-02","title_source":"archive","repo":"tianpeiyang/maptf_code","path":"alg/option/option_ma_sro.py","file_url":"https://github.com/tianpeiyang/maptf_code/blob/HEAD/alg/option/option_ma_sro.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tianpeiyang/maptf_code when it was checked","code_sha256":"7c8f3673bee00fb7","code_sha256_prefix":"7c8f3673bee00fb7","mcp_get_code":{"code_sha256":"7c8f3673bee00fb7"}},{"arxiv_id":"1805.12114","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-in-a-handful-of","title":"Deep Reinforcement Learning in a Handful of Trials using Probabilistic Dynamics Models","date":"2018-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"quanvuong/handful-of-trials-pytorch","path":"MPC.py","file_url":"https://github.com/quanvuong/handful-of-trials-pytorch/blob/HEAD/MPC.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, quanvuong/handful-of-trials-pytorch when it was checked","code_sha256":"5938fc919ec8c9ab","code_sha256_prefix":"5938fc919ec8c9ab","mcp_get_code":{"code_sha256":"5938fc919ec8c9ab"}},{"arxiv_id":"1711.05101","arxiv_id_is_arxiv":true,"paper":"/paper/decoupled-weight-decay-regularization","title":"Decoupled Weight Decay Regularization","date":"2017-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JakobHavtorn/nn","path":"optim/adam.py","file_url":"https://github.com/JakobHavtorn/nn/blob/HEAD/optim/adam.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"921eeee14c254068","code_sha256_prefix":"921eeee14c254068","mcp_get_code":{"code_sha256":"921eeee14c254068"}},{"arxiv_id":"1412.6980","arxiv_id_is_arxiv":true,"paper":"/paper/adam-a-method-for-stochastic-optimization","title":"Adam: A Method for Stochastic Optimization","date":"2014-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nnaisense/pgpelib","path":"pgpelib/optimizers.py","file_url":"https://github.com/nnaisense/pgpelib/blob/HEAD/pgpelib/optimizers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2601595a91035c3b","code_sha256_prefix":"2601595a91035c3b","mcp_get_code":{"code_sha256":"2601595a91035c3b"}}],"record_sha256":"e71efb8524205f67398ee2826b25a20e8b44b90c692119b26aaea7b0e459fc43","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}