{"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":"/task/bilevel-optimization","name":"Bilevel Optimization","slug":"bilevel-optimization","description_markdown":"**Bilevel Optimization** is a branch of optimization, which contains a nested optimization problem within the constraints of the outer optimization problem. The outer optimization task is usually referred as the upper level task, and the nested inner optimization task is referred as the lower level task. The lower level problem appears as a constraint, such that only an optimal solution to the lower level optimization problem is a possible feasible candidate to the upper level optimization problem.\r\n\r\n\r\n<span class=\"description-source\">Source: [Efficient Evolutionary Algorithm for Single-Objective Bilevel Optimization ](https://arxiv.org/abs/1303.3901)</span>","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":423,"papers_with_code":143,"benchmarks":3,"benchmark_tables_in_archive":3,"benchmark_tables_shown":3,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/bilevel-optimization-on-equilibrium-traffic","slug":"bilevel-optimization-on-equilibrium-traffic","dataset":"Equilibrium-Traffic-Networks/Eastern Massachusetts","dataset_url":null,"rows_in_archive":1,"metrics":["Optimality Gap"],"first_row_in_archive_order":{"model":"GIN-GA","paper_title":"A hybrid deep-learning-metaheuristic framework for bi-level network design problems","paper_url":"/paper/a-hybrid-deep-learning-metaheuristic","paper_date":"2023-03-10","arxiv_id":"2303.06024","code_links":[{"title":"bahmanmdd/HDLMF_GIN-GA","url":"https://github.com/bahmanmdd/HDLMF_GIN-GA"}],"syntology":null}},{"leaderboard":"/sota/bilevel-optimization-on-equilibrium-traffic-1","slug":"bilevel-optimization-on-equilibrium-traffic-1","dataset":"Equilibrium-Traffic-Networks/Anaheim","dataset_url":null,"rows_in_archive":1,"metrics":["Optimality Gap"],"first_row_in_archive_order":{"model":"GIN-GA","paper_title":"A hybrid deep-learning-metaheuristic framework for bi-level network design problems","paper_url":"/paper/a-hybrid-deep-learning-metaheuristic","paper_date":"2023-03-10","arxiv_id":"2303.06024","code_links":[{"title":"bahmanmdd/HDLMF_GIN-GA","url":"https://github.com/bahmanmdd/HDLMF_GIN-GA"}],"syntology":null}},{"leaderboard":"/sota/bilevel-optimization-on-equilibrium-traffic-2","slug":"bilevel-optimization-on-equilibrium-traffic-2","dataset":"Equilibrium-Traffic-Networks/Sioux Falls","dataset_url":null,"rows_in_archive":1,"metrics":["Optimality Gap"],"first_row_in_archive_order":{"model":"GIN-GA","paper_title":"A hybrid deep-learning-metaheuristic framework for bi-level network design problems","paper_url":"/paper/a-hybrid-deep-learning-metaheuristic","paper_date":"2023-03-10","arxiv_id":"2303.06024","code_links":[{"title":"bahmanmdd/HDLMF_GIN-GA","url":"https://github.com/bahmanmdd/HDLMF_GIN-GA"}],"syntology":null}}],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":5,"rows_per_page":100,"shown":100,"of":423,"of_with_code":143,"tagged_in_all":423,"counts":{"archive_papers_tagged":423,"with_a_code_link":143,"where_syntology_ran_a_sample":56,"not_listed_spam_title":0,"listed":423,"listed_where_code_ran":56,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":45,"every_run_a_failure_of_syntologys_instrument":11,"listed_with_a_run_with_no_instrument_failure":45,"listed_every_run_a_failure_of_syntologys_instrument":11,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/adaptive-personalized-federated-learning","slug":"adaptive-personalized-federated-learning","title":"Adaptive Personalized Federated Learning","date":"2020-03-30","arxiv_id":"2003.13461","repositories_listed":11,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/adaptive-personalized-federated-learning#ran","syntology_url":"https://syntology.ai/paper/2003.13461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.13461"}},"official":{"repos":["MLOPTPSU/FedTorch"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/optnet-differentiable-optimization-as-a-layer","slug":"optnet-differentiable-optimization-as-a-layer","title":"OptNet: Differentiable Optimization as a Layer in Neural Networks","date":"2017-03-01","arxiv_id":"1703.00443","repositories_listed":8,"syntology":{"n":16,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/optnet-differentiable-optimization-as-a-layer#ran","syntology_url":"https://syntology.ai/paper/1703.00443","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.00443"}},"official":{"repos":["locuslab/optnet","Kyubyong/sudoku"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/nystrom-method-for-accurate-and-scalable","slug":"nystrom-method-for-accurate-and-scalable","title":"Nystrom Method for Accurate and Scalable Implicit Differentiation","date":"2023-02-20","arxiv_id":"2302.09726","repositories_listed":4,"syntology":null},{"url":"/paper/convex-and-bilevel-optimization-for-neuro","slug":"convex-and-bilevel-optimization-for-neuro","title":"Convex and Bilevel Optimization for Neuro-Symbolic Inference and Learning","date":"2024-01-17","arxiv_id":"2401.09651","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/convex-and-bilevel-optimization-for-neuro#ran","syntology_url":"https://syntology.ai/paper/2401.09651","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.09651"}},"official":{"repos":["convexbilevelnesylearning/experimentscripts","convexbilevelnesylearning/psl","linqs/dickens-icml24"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/second-order-sensitivity-analysis-for-bilevel","slug":"second-order-sensitivity-analysis-for-bilevel","title":"Second-Order Sensitivity Analysis for Bilevel Optimization","date":"2022-05-04","arxiv_id":"2205.02329","repositories_listed":3,"syntology":null},{"url":"/paper/self-tuning-networks-bilevel-optimization-of","slug":"self-tuning-networks-bilevel-optimization-of","title":"Self-Tuning Networks: Bilevel Optimization of Hyperparameters using Structured Best-Response Functions","date":"2019-03-07","arxiv_id":"1903.03088","repositories_listed":3,"syntology":null},{"url":"/paper/scalable-bilevel-loss-balancing-for-multi","slug":"scalable-bilevel-loss-balancing-for-multi","title":"LDC-MTL: Balancing Multi-Task Learning through Scalable Loss Discrepancy Control","date":"2025-02-12","arxiv_id":"2502.08585","repositories_listed":2,"syntology":null},{"url":"/paper/fair-bilevel-neural-network-fairbinn-on","slug":"fair-bilevel-neural-network-fairbinn-on","title":"Fair Bilevel Neural Network (FairBiNN): On Balancing fairness and accuracy via Stackelberg Equilibrium","date":"2024-10-21","arxiv_id":"2410.16432","repositories_listed":2,"syntology":{"n":20,"n_ran":16,"n_constructed":3,"n_ran_checked":11,"n_instrument":5,"n_unverified":4,"n_honours":3,"n_violates":0,"n_no_contract":8,"n_pointer_only":4,"phrase":"16 ran (of which 3 constructed an object rather than computing a result; 11 with no instrument failure: 3 honoured, 0 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/fair-bilevel-neural-network-fairbinn-on#ran","syntology_url":"https://syntology.ai/paper/2410.16432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.16432"}},"official":{"repos":["yazdanimehdi/fairbinn"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":1,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/embarassingly-simple-dataset-distillation","slug":"embarassingly-simple-dataset-distillation","title":"Embarassingly Simple Dataset Distillation","date":"2023-11-13","arxiv_id":"2311.07025","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/embarassingly-simple-dataset-distillation#ran","syntology_url":"https://syntology.ai/paper/2311.07025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.07025"}},"official":{"repos":["fengyzpku/simple_dataset_distillation"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-set-representation-learning","slug":"self-supervised-set-representation-learning","title":"Self-Supervised Dataset Distillation for Transfer Learning","date":"2023-10-10","arxiv_id":"2310.06511","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/self-supervised-set-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2310.06511","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.06511"}},"official":{"repos":["db-lee/selfsup_dd"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/squeeze-recover-and-relabel-dataset","slug":"squeeze-recover-and-relabel-dataset","title":"Squeeze, Recover and Relabel: Dataset Condensation at ImageNet Scale From A New Perspective","date":"2023-06-22","arxiv_id":"2306.13092","repositories_listed":2,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/squeeze-recover-and-relabel-dataset#ran","syntology_url":"https://syntology.ai/paper/2306.13092","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.13092"}},"official":{"repos":["VILA-Lab/SRe2L"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]}}},{"url":"/paper/generative-adversarial-method-based-on-neural","slug":"generative-adversarial-method-based-on-neural","title":"Single-level Adversarial Data Synthesis based on Neural Tangent Kernels","date":"2022-04-08","arxiv_id":"2204.04090","repositories_listed":2,"syntology":null},{"url":"/paper/target-aware-dual-adversarial-learning-and-a","slug":"target-aware-dual-adversarial-learning-and-a","title":"Target-aware Dual Adversarial Learning and a Multi-scenario Multi-Modality Benchmark to Fuse Infrared and Visible for Object Detection","date":"2022-03-30","arxiv_id":"2203.16220","repositories_listed":2,"syntology":null},{"url":"/paper/bilevel-optimization-with-a-lower-level","slug":"bilevel-optimization-with-a-lower-level","title":"Bilevel Optimization with a Lower-level Contraction: Optimal Sample Complexity without Warm-start","date":"2022-02-07","arxiv_id":"2202.03397","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":2,"n_instrument":6,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bilevel-optimization-with-a-lower-level#ran","syntology_url":"https://syntology.ai/paper/2202.03397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03397"}},"official":{"repos":["csml-iit-ucl/bioptexps"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bobcat-bilevel-optimization-based","slug":"bobcat-bilevel-optimization-based","title":"BOBCAT: Bilevel Optimization-Based Computerized Adaptive Testing","date":"2021-08-17","arxiv_id":"2108.07386","repositories_listed":2,"syntology":{"n":10,"n_ran":10,"n_constructed":3,"n_ran_checked":5,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"10 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bobcat-bilevel-optimization-based#ran","syntology_url":"https://syntology.ai/paper/2108.07386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.07386"}},"official":{"repos":["arghosh/bobcat"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/provably-faster-algorithms-for-bilevel-1","slug":"provably-faster-algorithms-for-bilevel-1","title":"Bilevel Optimization: Convergence Analysis and Enhanced Design","date":"2020-10-15","arxiv_id":"2010.07962","repositories_listed":2,"syntology":{"n":18,"n_ran":14,"n_constructed":0,"n_ran_checked":7,"n_instrument":7,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 7 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/provably-faster-algorithms-for-bilevel-1#ran","syntology_url":"https://syntology.ai/paper/2010.07962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07962"}},"official":{"repos":["junjieyang97/stocbio_hp"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/adversarial-immunization-for-improving","slug":"adversarial-immunization-for-improving","title":"Adversarial Immunization for Certifiable Robustness on Graphs","date":"2020-07-19","arxiv_id":"2007.09647","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-immunization-for-improving#ran","syntology_url":"https://syntology.ai/paper/2007.09647","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.09647"}},"official":{"repos":["TaoShuchang/AdvImmune"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-data-augmentation-with-online","slug":"learning-data-augmentation-with-online","title":"Learning Data Augmentation with Online Bilevel Optimization for Image Classification","date":"2020-06-25","arxiv_id":"2006.14699","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-data-augmentation-with-online#ran","syntology_url":"https://syntology.ai/paper/2006.14699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14699"}},"official":{"repos":["ElementAI/bilevel_augment"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/metapoison-practical-general-purpose-clean","slug":"metapoison-practical-general-purpose-clean","title":"MetaPoison: Practical General-purpose Clean-label Data Poisoning","date":"2020-04-01","arxiv_id":"2004.00225","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/metapoison-practical-general-purpose-clean#ran","syntology_url":"https://syntology.ai/paper/2004.00225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.00225"}},"official":{"repos":["wronnyhuang/metapoison"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/penalty-method-for-inversion-free-deep","slug":"penalty-method-for-inversion-free-deep","title":"Penalty Method for Inversion-Free Deep Bilevel Optimization","date":"2019-11-08","arxiv_id":"1911.03432","repositories_listed":2,"syntology":null},{"url":"/paper/truncated-back-propagation-for-bilevel","slug":"truncated-back-propagation-for-bilevel","title":"Truncated Back-propagation for Bilevel Optimization","date":"2018-10-25","arxiv_id":"1810.10667","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/truncated-back-propagation-for-bilevel#ran","syntology_url":"https://syntology.ai/paper/1810.10667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.10667"}},"official":null}},{"url":"/paper/spectral-inference-networks-unifying-spectral","slug":"spectral-inference-networks-unifying-spectral","title":"Spectral Inference Networks: Unifying Deep and Spectral Learning","date":"2018-06-06","arxiv_id":"1806.02215","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/spectral-inference-networks-unifying-spectral#ran","syntology_url":"https://syntology.ai/paper/1806.02215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.02215"}},"official":{"repos":["deepmind/spectral_inference_networks"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/guilomo-allocating-expert-number-and-rank-for","slug":"guilomo-allocating-expert-number-and-rank-for","title":"GuiLoMo: Allocating Expert Number and Rank for LoRA-MoE via Bilevel Optimization with GuidedSelection Vectors","date":"2025-06-17","arxiv_id":"2506.14646","repositories_listed":1,"syntology":null},{"url":"/paper/misleader-defending-against-model-extraction","slug":"misleader-defending-against-model-extraction","title":"MISLEADER: Defending against Model Extraction with Ensembles of Distilled Models","date":"2025-06-03","arxiv_id":"2506.02362","repositories_listed":1,"syntology":null},{"url":"/paper/learning-where-to-learn-training-distribution","slug":"learning-where-to-learn-training-distribution","title":"Learning Where to Learn: Training Distribution Selection for Provable OOD Performance","date":"2025-05-27","arxiv_id":"2505.21626","repositories_listed":1,"syntology":null},{"url":"/paper/gcal-adapting-graph-models-to-evolving-domain","slug":"gcal-adapting-graph-models-to-evolving-domain","title":"GCAL: Adapting Graph Models to Evolving Domain Shifts","date":"2025-05-22","arxiv_id":"2505.16860","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":1,"n_ran_checked":4,"n_instrument":3,"n_unverified":3,"n_honours":3,"n_violates":0,"n_no_contract":1,"n_pointer_only":10,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gcal-adapting-graph-models-to-evolving-domain#ran","syntology_url":"https://syntology.ai/paper/2505.16860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16860"}},"official":{"repos":["joe817/gcal"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/hbo-hierarchical-balancing-optimization-for","slug":"hbo-hierarchical-balancing-optimization-for","title":"HBO: Hierarchical Balancing Optimization for Fine-Tuning Large Language Models","date":"2025-05-18","arxiv_id":"2505.12300","repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-decomposition-for-optimal-claim","slug":"optimizing-decomposition-for-optimal-claim","title":"Optimizing Decomposition for Optimal Claim Verification","date":"2025-03-19","arxiv_id":"2503.15354","repositories_listed":1,"syntology":null},{"url":"/paper/prdp-progressively-refined-differentiable","slug":"prdp-progressively-refined-differentiable","title":"PRDP: Progressively Refined Differentiable Physics","date":"2025-02-26","arxiv_id":"2502.19611","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":3,"n_ran_checked":7,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 ran (of which 3 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/prdp-progressively-refined-differentiable#ran","syntology_url":"https://syntology.ai/paper/2502.19611","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.19611"}},"official":{"repos":["tum-pbs/prdp"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":3,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-training-for-defense-against","slug":"adversarial-training-for-defense-against","title":"Adversarial Training for Defense Against Label Poisoning Attacks","date":"2025-02-24","arxiv_id":"2502.17121","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-training-for-defense-against#ran","syntology_url":"https://syntology.ai/paper/2502.17121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.17121"}},"official":{"repos":["melisilaydabal/floral"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bilbo-bilevel-bayesian-optimization","slug":"bilbo-bilevel-bayesian-optimization","title":"BILBO: BILevel Bayesian Optimization","date":"2025-02-04","arxiv_id":"2502.02121","repositories_listed":1,"syntology":null},{"url":"/paper/safe-gradient-flow-for-bilevel-optimization","slug":"safe-gradient-flow-for-bilevel-optimization","title":"Safe Gradient Flow for Bilevel Optimization","date":"2025-01-27","arxiv_id":"2501.16520","repositories_listed":1,"syntology":null},{"url":"/paper/analyzing-the-role-of-the-dso-in-electricity","slug":"analyzing-the-role-of-the-dso-in-electricity","title":"Analyzing the Role of the DSO in Electricity Trading of VPPs via a Stackelberg Game Model","date":"2025-01-13","arxiv_id":"2501.07715","repositories_listed":1,"syntology":null},{"url":"/paper/a-nearly-optimal-single-loop-algorithm-for","slug":"a-nearly-optimal-single-loop-algorithm-for","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","date":"2024-12-28","arxiv_id":"2412.20017","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-nearly-optimal-single-loop-algorithm-for#ran","syntology_url":"https://syntology.ai/paper/2412.20017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.20017"}},"official":{"repos":["MingruiLiu-ML-Lab/Single-Loop-bilevel-Optimizer-under-Unbounded-Smoothness"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-fine-tuning-and-concept-suppression","slug":"efficient-fine-tuning-and-concept-suppression","title":"Efficient Fine-Tuning and Concept Suppression for Pruned Diffusion Models","date":"2024-12-19","arxiv_id":"2412.15341","repositories_listed":1,"syntology":null},{"url":"/paper/bilevel-learning-with-inexact-stochastic","slug":"bilevel-learning-with-inexact-stochastic","title":"Bilevel Learning with Inexact Stochastic Gradients","date":"2024-12-16","arxiv_id":"2412.12049","repositories_listed":1,"syntology":null},{"url":"/paper/exact-certification-of-graph-neural-networks","slug":"exact-certification-of-graph-neural-networks","title":"Exact Certification of (Graph) Neural Networks Against Label Poisoning","date":"2024-11-30","arxiv_id":"2412.00537","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exact-certification-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2412.00537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.00537"}},"official":{"repos":["saper0/qpcert"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-bilevel-optimization-framework-for","slug":"a-bilevel-optimization-framework-for","title":"A Bilevel Optimization Framework for Imbalanced Data Classification","date":"2024-10-15","arxiv_id":"2410.11171","repositories_listed":1,"syntology":null},{"url":"/paper/unseg-one-universal-unlearnable-example","slug":"unseg-one-universal-unlearnable-example","title":"UnSeg: One Universal Unlearnable Example Generator is Enough against All Image Segmentation","date":"2024-10-13","arxiv_id":"2410.09909","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/unseg-one-universal-unlearnable-example#ran","syntology_url":"https://syntology.ai/paper/2410.09909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.09909"}},"official":null}},{"url":"/paper/seal-safety-enhanced-aligned-llm-fine-tuning","slug":"seal-safety-enhanced-aligned-llm-fine-tuning","title":"SEAL: Safety-enhanced Aligned LLM Fine-tuning via Bilevel Data Selection","date":"2024-10-09","arxiv_id":"2410.07471","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/seal-safety-enhanced-aligned-llm-fine-tuning#ran","syntology_url":"https://syntology.ai/paper/2410.07471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.07471"}},"official":{"repos":["hanshen95/seal"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/tuning-free-bilevel-optimization-new","slug":"tuning-free-bilevel-optimization-new","title":"Tuning-Free Bilevel Optimization: New Algorithms and Convergence Analysis","date":"2024-10-07","arxiv_id":"2410.05140","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/tuning-free-bilevel-optimization-new#ran","syntology_url":"https://syntology.ai/paper/2410.05140","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.05140"}},"official":{"repos":["optmn-lab/tfbo"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/an-accelerated-algorithm-for-stochastic","slug":"an-accelerated-algorithm-for-stochastic","title":"An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","date":"2024-09-28","arxiv_id":"2409.19212","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-accelerated-algorithm-for-stochastic#ran","syntology_url":"https://syntology.ai/paper/2409.19212","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19212"}},"official":{"repos":["mingruiliu-ml-lab/accelerated-bilevel-optimization-unbounded-smoothness"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/loss-distillation-via-gradient-matching-for","slug":"loss-distillation-via-gradient-matching-for","title":"Loss Distillation via Gradient Matching for Point Cloud Completion with Weighted Chamfer Distance","date":"2024-09-10","arxiv_id":"2409.06171","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/loss-distillation-via-gradient-matching-for#ran","syntology_url":"https://syntology.ai/paper/2409.06171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.06171"}},"official":{"repos":["zhang-vislab/iros2024-lossdistillationweightedcd"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/cobo-collaborative-learning-via-bilevel","slug":"cobo-collaborative-learning-via-bilevel","title":"CoBo: Collaborative Learning via Bilevel Optimization","date":"2024-09-09","arxiv_id":"2409.05539","repositories_listed":1,"syntology":null},{"url":"/paper/preference-optimized-pareto-set-learning-for","slug":"preference-optimized-pareto-set-learning-for","title":"Preference-Optimized Pareto Set Learning for Blackbox Optimization","date":"2024-08-19","arxiv_id":"2408.09976","repositories_listed":1,"syntology":null},{"url":"/paper/autoscale-automatic-prediction-of-compute","slug":"autoscale-automatic-prediction-of-compute","title":"AutoScale: Scale-Aware Data Mixing for Pre-Training LLMs","date":"2024-07-29","arxiv_id":"2407.20177","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/autoscale-automatic-prediction-of-compute#ran","syntology_url":"https://syntology.ai/paper/2407.20177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.20177"}},"official":{"repos":["feiyang-k/autoscale"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/improving-sam-requires-rethinking-its","slug":"improving-sam-requires-rethinking-its","title":"Improving SAM Requires Rethinking its Optimization Formulation","date":"2024-07-17","arxiv_id":"2407.12993","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-sam-requires-rethinking-its#ran","syntology_url":"https://syntology.ai/paper/2407.12993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.12993"}},"official":{"repos":["LIONS-EPFL/BiSAM"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/provable-robustness-of-graph-neural-networks","slug":"provable-robustness-of-graph-neural-networks","title":"Provable Robustness of (Graph) Neural Networks Against Data Poisoning and Backdoor Attacks","date":"2024-07-15","arxiv_id":"2407.10867","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/provable-robustness-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2407.10867","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.10867"}},"official":{"repos":["saper0/qpcert"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-and-effective-implicit-dynamic","slug":"efficient-and-effective-implicit-dynamic","title":"Efficient and Effective Implicit Dynamic Graph Neural Network","date":"2024-06-25","arxiv_id":"2406.17894","repositories_listed":1,"syntology":null},{"url":"/paper/learning-diffusion-at-lightspeed","slug":"learning-diffusion-at-lightspeed","title":"Learning diffusion at lightspeed","date":"2024-06-18","arxiv_id":"2406.12616","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/learning-diffusion-at-lightspeed#ran","syntology_url":"https://syntology.ai/paper/2406.12616","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12616"}},"official":null}},{"url":"/paper/a-primal-dual-assisted-penalty-approach-to","slug":"a-primal-dual-assisted-penalty-approach-to","title":"A Primal-Dual-Assisted Penalty Approach to Bilevel Optimization with Coupled Constraints","date":"2024-06-14","arxiv_id":"2406.10148","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-primal-dual-assisted-penalty-approach-to#ran","syntology_url":"https://syntology.ai/paper/2406.10148","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10148"}},"official":{"repos":["Liuyuan999/Penalty_Based_Lagrangian_Bilevel"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/advancing-generalized-transfer-attack-with","slug":"advancing-generalized-transfer-attack-with","title":"Advancing Generalized Transfer Attack with Initialization Derived Bilevel Optimization and Dynamic Sequence Truncation","date":"2024-06-04","arxiv_id":"2406.02064","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-bilevel-optimization-with-lower","slug":"stochastic-bilevel-optimization-with-lower","title":"Contextual Bilevel Reinforcement Learning for Incentive Alignment","date":"2024-06-03","arxiv_id":"2406.01575","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/stochastic-bilevel-optimization-with-lower#ran","syntology_url":"https://syntology.ai/paper/2406.01575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.01575"}},"official":{"repos":["lasgroup/hpgd"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/gs-phong-meta-learned-3d-gaussians-for","slug":"gs-phong-meta-learned-3d-gaussians-for","title":"GS-Phong: Meta-Learned 3D Gaussians for Relightable Novel View Synthesis","date":"2024-05-31","arxiv_id":"2405.20791","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":4,"n_instrument":6,"n_unverified":3,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":13,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gs-phong-meta-learned-3d-gaussians-for#ran","syntology_url":"https://syntology.ai/paper/2405.20791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20791"}},"official":{"repos":["ymhe12/GS-Phong"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/safe-multi-agent-reinforcement-learning-with","slug":"safe-multi-agent-reinforcement-learning-with","title":"Safe Multi-Agent Reinforcement Learning with Bilevel Optimization in Autonomous Driving","date":"2024-05-28","arxiv_id":"2405.18209","repositories_listed":1,"syntology":null},{"url":"/paper/llm-and-simulation-as-bilevel-optimizers-a","slug":"llm-and-simulation-as-bilevel-optimizers-a","title":"LLM and Simulation as Bilevel Optimizers: A New Paradigm to Advance Physical Scientific Discovery","date":"2024-05-16","arxiv_id":"2405.09783","repositories_listed":1,"syntology":null},{"url":"/paper/imtsp-solving-min-max-multiple-traveling","slug":"imtsp-solving-min-max-multiple-traveling","title":"iMTSP: Solving Min-Max Multiple Traveling Salesman Problem with Imperative Learning","date":"2024-05-01","arxiv_id":"2405.00285","repositories_listed":1,"syntology":null},{"url":"/paper/bilo-bilevel-local-operator-learning-for-pde","slug":"bilo-bilevel-local-operator-learning-for-pde","title":"BiLO: Bilevel Local Operator Learning for PDE inverse problems","date":"2024-04-27","arxiv_id":"2404.17789","repositories_listed":1,"syntology":null},{"url":"/paper/lancbio-dynamic-lanczos-aided-bilevel","slug":"lancbio-dynamic-lanczos-aided-bilevel","title":"LancBiO: dynamic Lanczos-aided bilevel optimization via Krylov subspace","date":"2024-04-04","arxiv_id":"2404.03331","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/lancbio-dynamic-lanczos-aided-bilevel#ran","syntology_url":"https://syntology.ai/paper/2404.03331","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.03331"}},"official":{"repos":["ucas-yanyang/lancbio"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/functional-bilevel-optimization-for-machine","slug":"functional-bilevel-optimization-for-machine","title":"Functional Bilevel Optimization for Machine Learning","date":"2024-03-29","arxiv_id":"2403.20233","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":12,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/functional-bilevel-optimization-for-machine#ran","syntology_url":"https://syntology.ai/paper/2403.20233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.20233"}},"official":{"repos":["inria-thoth/funcbo"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/reinforcement-learning-based-receding-horizon","slug":"reinforcement-learning-based-receding-horizon","title":"Reinforcement Learning-based Receding Horizon Control using Adaptive Control Barrier Functions for Safety-Critical Systems","date":"2024-03-26","arxiv_id":"2403.17338","repositories_listed":1,"syntology":null},{"url":"/paper/bloomgml-graph-machine-learning-through-the","slug":"bloomgml-graph-machine-learning-through-the","title":"BloomGML: Graph Machine Learning through the Lens of Bilevel Optimization","date":"2024-03-07","arxiv_id":"2403.04763","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-hypergradients-estimation-a-study","slug":"enhancing-hypergradients-estimation-a-study","title":"Enhancing Hypergradients Estimation: A Study of Preconditioning and Reparameterization","date":"2024-02-26","arxiv_id":"2402.16748","repositories_listed":1,"syntology":null},{"url":"/paper/generalizing-reward-modeling-for-out-of","slug":"generalizing-reward-modeling-for-out-of","title":"Generalizing Reward Modeling for Out-of-Distribution Preference Learning","date":"2024-02-22","arxiv_id":"2402.14760","repositories_listed":1,"syntology":null},{"url":"/paper/a-framework-for-bilevel-optimization-on","slug":"a-framework-for-bilevel-optimization-on","title":"A Framework for Bilevel Optimization on Riemannian Manifolds","date":"2024-02-06","arxiv_id":"2402.03883","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-framework-for-bilevel-optimization-on#ran","syntology_url":"https://syntology.ai/paper/2402.03883","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.03883"}},"official":{"repos":["andyjm3/rhgd"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neur2bilo-neural-bilevel-optimization","slug":"neur2bilo-neural-bilevel-optimization","title":"Neur2BiLO: Neural Bilevel Optimization","date":"2024-02-04","arxiv_id":"2402.02552","repositories_listed":1,"syntology":null},{"url":"/paper/bilevel-optimization-under-unbounded","slug":"bilevel-optimization-under-unbounded","title":"Bilevel Optimization under Unbounded Smoothness: A New Algorithm and Convergence Analysis","date":"2024-01-17","arxiv_id":"2401.09587","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/bilevel-optimization-under-unbounded#ran","syntology_url":"https://syntology.ai/paper/2401.09587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.09587"}},"official":{"repos":["mingruiliu-ml-lab/bilevel-optimization-under-unbounded-smoothness"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/imatching-imperative-correspondence-learning","slug":"imatching-imperative-correspondence-learning","title":"iMatching: Imperative Correspondence Learning","date":"2023-12-04","arxiv_id":"2312.02141","repositories_listed":1,"syntology":null},{"url":"/paper/gradient-based-bilevel-optimization-for-multi","slug":"gradient-based-bilevel-optimization-for-multi","title":"Gradient-based bilevel optimization for multi-penalty Ridge regression through matrix differential calculus","date":"2023-11-23","arxiv_id":"2311.14182","repositories_listed":1,"syntology":null},{"url":"/paper/toward-robust-imperceptible-perturbation","slug":"toward-robust-imperceptible-perturbation","title":"MetaCloak: Preventing Unauthorized Subject-driven Text-to-image Diffusion-based Synthesis via Meta-learning","date":"2023-11-22","arxiv_id":"2311.13127","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/toward-robust-imperceptible-perturbation#ran","syntology_url":"https://syntology.ai/paper/2311.13127","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.13127"}},"official":{"repos":["liuyixin-louis/metacloak"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/bregman-graph-neural-network","slug":"bregman-graph-neural-network","title":"Bregman Graph Neural Network","date":"2023-09-12","arxiv_id":"2309.06645","repositories_listed":1,"syntology":null},{"url":"/paper/removalnet-dnn-fingerprint-removal-attacks","slug":"removalnet-dnn-fingerprint-removal-attacks","title":"RemovalNet: DNN Fingerprint Removal Attacks","date":"2023-08-23","arxiv_id":"2308.12319","repositories_listed":1,"syntology":null},{"url":"/paper/hypbo-expert-guided-chemist-in-the-loop","slug":"hypbo-expert-guided-chemist-in-the-loop","title":"HypBO: Accelerating Black-Box Scientific Experiments Using Experts' Hypotheses","date":"2023-08-22","arxiv_id":"2308.11787","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-bilevel-learning-with-inexact-line","slug":"dynamic-bilevel-learning-with-inexact-line","title":"An adaptively inexact first-order method for bilevel optimization with application to hyperparameter learning","date":"2023-08-19","arxiv_id":"2308.10098","repositories_listed":1,"syntology":null},{"url":"/paper/bilevel-generative-learning-for-low-light","slug":"bilevel-generative-learning-for-low-light","title":"Bilevel Generative Learning for Low-Light Vision","date":"2023-08-07","arxiv_id":"2308.03381","repositories_listed":1,"syntology":null},{"url":"/paper/bierl-a-meta-evolutionary-reinforcement","slug":"bierl-a-meta-evolutionary-reinforcement","title":"BiERL: A Meta Evolutionary Reinforcement Learning Framework via Bilevel Optimization","date":"2023-08-01","arxiv_id":"2308.01207","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-data-augmentation-learning-using","slug":"automatic-data-augmentation-learning-using","title":"Automatic Data Augmentation Learning using Bilevel Optimization for Histopathological Images","date":"2023-07-21","arxiv_id":"2307.11808","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/automatic-data-augmentation-learning-using#ran","syntology_url":"https://syntology.ai/paper/2307.11808","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.11808"}},"official":{"repos":["smounsav/bilevel_augment_histo"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/differentiable-instruction-optimization-for","slug":"differentiable-instruction-optimization-for","title":"Differentiable Instruction Optimization for Cross-Task Generalization","date":"2023-06-16","arxiv_id":"2306.10098","repositories_listed":1,"syntology":null},{"url":"/paper/from-hypergraph-energy-functions-to","slug":"from-hypergraph-energy-functions-to","title":"From Hypergraph Energy Functions to Hypergraph Neural Networks","date":"2023-06-16","arxiv_id":"2306.09623","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/from-hypergraph-energy-functions-to#ran","syntology_url":"https://syntology.ai/paper/2306.09623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.09623"}},"official":{"repos":["yxzwang/phenomnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/islam-imperative-slam","slug":"islam-imperative-slam","title":"iSLAM: Imperative SLAM","date":"2023-06-13","arxiv_id":"2306.07894","repositories_listed":1,"syntology":null},{"url":"/paper/federated-multi-sequence-stochastic","slug":"federated-multi-sequence-stochastic","title":"Federated Multi-Sequence Stochastic Approximation with Local Hypergradient Estimation","date":"2023-06-02","arxiv_id":"2306.01648","repositories_listed":1,"syntology":null},{"url":"/paper/blockwise-stochastic-variance-reduced-methods","slug":"blockwise-stochastic-variance-reduced-methods","title":"Blockwise Stochastic Variance-Reduced Methods with Parallel Speedup for Multi-Block Bilevel Optimization","date":"2023-05-30","arxiv_id":"2305.18730","repositories_listed":1,"syntology":null},{"url":"/paper/balancing-test-accuracy-and-security-in","slug":"balancing-test-accuracy-and-security-in","title":"Balancing Test Accuracy and Security in Computerized Adaptive Testing","date":"2023-05-18","arxiv_id":"2305.18312","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-bilevel-optimization-for-generating","slug":"scalable-bilevel-optimization-for-generating","title":"Scalable Bilevel Optimization for Generating Maximally Representative OPF Datasets","date":"2023-04-21","arxiv_id":"2304.10912","repositories_listed":1,"syntology":null},{"url":"/paper/class-incremental-exemplar-compression-for","slug":"class-incremental-exemplar-compression-for","title":"Class-Incremental Exemplar Compression for Class-Incremental Learning","date":"2023-03-24","arxiv_id":"2303.14042","repositories_listed":1,"syntology":null},{"url":"/paper/gradient-scarcity-with-bilevel-optimization","slug":"gradient-scarcity-with-bilevel-optimization","title":"Gradient scarcity with Bilevel Optimization for Graph Learning","date":"2023-03-24","arxiv_id":"2303.13964","repositories_listed":1,"syntology":null},{"url":"/paper/a-hybrid-deep-learning-metaheuristic","slug":"a-hybrid-deep-learning-metaheuristic","title":"A hybrid deep-learning-metaheuristic framework for bi-level network design problems","date":"2023-03-10","arxiv_id":"2303.06024","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-differentiable-causal-discovery-via","slug":"boosting-differentiable-causal-discovery-via","title":"Boosting Differentiable Causal Discovery via Adaptive Sample Reweighting","date":"2023-03-06","arxiv_id":"2303.03187","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/boosting-differentiable-causal-discovery-via#ran","syntology_url":"https://syntology.ai/paper/2303.03187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.03187"}},"official":{"repos":["anzhang314/rescore"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/on-penalty-based-bilevel-gradient-descent","slug":"on-penalty-based-bilevel-gradient-descent","title":"On Penalty-based Bilevel Gradient Descent Method","date":"2023-02-10","arxiv_id":"2302.05185","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":3,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 3 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-penalty-based-bilevel-gradient-descent#ran","syntology_url":"https://syntology.ai/paper/2302.05185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.05185"}},"official":{"repos":["hanshen95/penalized-bilevel-gradient-descent"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/map-towards-balanced-generalization-of-iid","slug":"map-towards-balanced-generalization-of-iid","title":"MAP: Towards Balanced Generalization of IID and OOD through Model-Agnostic Adapters","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/saliency-augmented-memory-completion-for","slug":"saliency-augmented-memory-completion-for","title":"Saliency-Augmented Memory Completion for Continual Learning","date":"2022-12-26","arxiv_id":"2212.13242","repositories_listed":1,"syntology":null},{"url":"/paper/asynchronous-distributed-bilevel-optimization","slug":"asynchronous-distributed-bilevel-optimization","title":"Asynchronous Distributed Bilevel Optimization","date":"2022-12-20","arxiv_id":"2212.10048","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/asynchronous-distributed-bilevel-optimization#ran","syntology_url":"https://syntology.ai/paper/2212.10048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.10048"}},"official":{"repos":["iclr23submission6251/adbo"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/alternating-implicit-projected-sgd-and-its","slug":"alternating-implicit-projected-sgd-and-its","title":"Alternating Implicit Projected SGD and Its Efficient Variants for Equality-constrained Bilevel Optimization","date":"2022-11-14","arxiv_id":"2211.07096","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-cross-modal-video-retrieval-with","slug":"efficient-cross-modal-video-retrieval-with","title":"Efficient Cross-Modal Video Retrieval with Meta-Optimized Frames","date":"2022-10-16","arxiv_id":"2210.08452","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-backdoor-attacks-via-neural-tangent","slug":"few-shot-backdoor-attacks-via-neural-tangent","title":"Few-shot Backdoor Attacks via Neural Tangent Kernels","date":"2022-10-12","arxiv_id":"2210.05929","repositories_listed":1,"syntology":null},{"url":"/paper/how-to-sift-out-a-clean-data-subset-in-the","slug":"how-to-sift-out-a-clean-data-subset-in-the","title":"How to Sift Out a Clean Data Subset in the Presence of Data Poisoning?","date":"2022-10-12","arxiv_id":"2210.06516","repositories_listed":1,"syntology":null},{"url":"/paper/personalized-decentralized-bilevel","slug":"personalized-decentralized-bilevel","title":"Decentralized Hyper-Gradient Computation over Time-Varying Directed Networks","date":"2022-10-05","arxiv_id":"2210.02129","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/personalized-decentralized-bilevel#ran","syntology_url":"https://syntology.ai/paper/2210.02129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.02129"}},"official":{"repos":["hitachi-rd-cv/pdbo-hgp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/bome-bilevel-optimization-made-easy-a-simple","slug":"bome-bilevel-optimization-made-easy-a-simple","title":"BOME! Bilevel Optimization Made Easy: A Simple First-Order Approach","date":"2022-09-19","arxiv_id":"2209.08709","repositories_listed":1,"syntology":null},{"url":"/paper/adapting-triplet-importance-of-implicit","slug":"adapting-triplet-importance-of-implicit","title":"Adapting Triplet Importance of Implicit Feedback for Personalized Recommendation","date":"2022-08-02","arxiv_id":"2208.01709","repositories_listed":1,"syntology":null},{"url":"/paper/robust-network-architecture-search-via","slug":"robust-network-architecture-search-via","title":"Robust Network Architecture Search via Feature Distortion Restraining","date":"2022-07-13","arxiv_id":null,"repositories_listed":1,"syntology":null}],"syntology_records":43,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_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_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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":56,"papers_where_code_ran_first_page":"/task/bilevel-optimization/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":5,"url":"/task/bilevel-optimization/papers/2","json":"/task/bilevel-optimization/papers/2.json","rows":100},{"order":"archive","page":3,"of":5,"url":"/task/bilevel-optimization/papers/3","json":"/task/bilevel-optimization/papers/3.json","rows":100},{"order":"archive","page":4,"of":5,"url":"/task/bilevel-optimization/papers/4","json":"/task/bilevel-optimization/papers/4.json","rows":100},{"order":"archive","page":5,"of":5,"url":"/task/bilevel-optimization/papers/5","json":"/task/bilevel-optimization/papers/5.json","rows":23},{"order":"ran","page":1,"of":1,"url":"/task/bilevel-optimization/papers/ran/1","json":"/task/bilevel-optimization/papers/ran/1.json","rows":56}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","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)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"66fcf0dba6a7d5af0a8e47623fc78c2fb578867ed1cd8e1c8c97acd5e1e5d3f7","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}