{"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/papers/2","list_of":"/task/bilevel-optimization","task":"Bilevel Optimization","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":5,"rows_per_page":100,"rows":[101,200],"of":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"},"first_page":"/task/bilevel-optimization","prev":"/task/bilevel-optimization","next":"/task/bilevel-optimization/papers/3","papers":[{"url":"/paper/online-bilevel-optimization-regret-analysis","slug":"online-bilevel-optimization-regret-analysis","title":"Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods","date":"2022-07-06","arxiv_id":"2207.02829","repositories_listed":1,"syntology":null},{"url":"/paper/descent-steps-of-a-relation-aware-energy","slug":"descent-steps-of-a-relation-aware-energy","title":"Descent Steps of a Relation-Aware Energy Produce Heterogeneous Graph Neural Networks","date":"2022-06-22","arxiv_id":"2206.11081","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-frank-wolfe-algorithm-for-bilevel","slug":"generalized-frank-wolfe-algorithm-for-bilevel","title":"A Conditional Gradient-based Method for Simple Bilevel Optimization with Convex Lower-level Problem","date":"2022-06-17","arxiv_id":"2206.08868","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-feature-representations-for","slug":"meta-learning-feature-representations-for","title":"Meta-learning Adaptive Deep Kernel Gaussian Processes for Molecular Property Prediction","date":"2022-05-05","arxiv_id":"2205.02708","repositories_listed":1,"syntology":null},{"url":"/paper/robust-structured-declarative-classifiers-for","slug":"robust-structured-declarative-classifiers-for","title":"Robust Structured Declarative Classifiers for 3D Point Clouds: Defending Adversarial Attacks with Implicit Gradients","date":"2022-03-29","arxiv_id":"2203.15245","repositories_listed":1,"syntology":null},{"url":"/paper/min-max-bilevel-multi-objective-optimization","slug":"min-max-bilevel-multi-objective-optimization","title":"Min-Max Bilevel Multi-objective Optimization with Applications in Machine Learning","date":"2022-03-03","arxiv_id":"2203.01924","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/min-max-bilevel-multi-objective-optimization#ran","syntology_url":"https://syntology.ai/paper/2203.01924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.01924"}},"official":{"repos":["minimario/morbit"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/deep-invariant-networks-with-differentiable","slug":"deep-invariant-networks-with-differentiable","title":"Deep invariant networks with differentiable augmentation layers","date":"2022-02-04","arxiv_id":"2202.02142","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/deep-invariant-networks-with-differentiable#ran","syntology_url":"https://syntology.ai/paper/2202.02142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.02142"}},"official":{"repos":["cedricrommel/augnet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-framework-for-bilevel-optimization-that","slug":"a-framework-for-bilevel-optimization-that","title":"A framework for bilevel optimization that enables stochastic and global variance reduction algorithms","date":"2022-01-31","arxiv_id":"2201.13409","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/a-framework-for-bilevel-optimization-that#ran","syntology_url":"https://syntology.ai/paper/2201.13409","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.13409"}},"official":{"repos":["benchopt/benchmark_bilevel"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/calibrated-hyperspectral-image-reconstruction","slug":"calibrated-hyperspectral-image-reconstruction","title":"Modeling Mask Uncertainty in Hyperspectral Image Reconstruction","date":"2021-12-31","arxiv_id":"2112.15362","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/calibrated-hyperspectral-image-reconstruction#ran","syntology_url":"https://syntology.ai/paper/2112.15362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.15362"}},"official":{"repos":["jiamian-wang/mask_uncertainty_spectral_sci"],"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","unlocated"]}}},{"url":"/paper/on-automatic-data-augmentation-for-3d-point","slug":"on-automatic-data-augmentation-for-3d-point","title":"On Automatic Data Augmentation for 3D Point Cloud Classification","date":"2021-12-11","arxiv_id":"2112.06029","repositories_listed":1,"syntology":null},{"url":"/paper/amortized-implicit-differentiation-for-1","slug":"amortized-implicit-differentiation-for-1","title":"Amortized Implicit Differentiation for Stochastic Bilevel Optimization","date":"2021-11-29","arxiv_id":"2111.14580","repositories_listed":1,"syntology":null},{"url":"/paper/out-of-domain-human-mesh-reconstruction-via","slug":"out-of-domain-human-mesh-reconstruction-via","title":"Out-of-Domain Human Mesh Reconstruction via Dynamic Bilevel Online Adaptation","date":"2021-11-07","arxiv_id":"2111.04017","repositories_listed":1,"syntology":null},{"url":"/paper/towards-evaluating-the-robustness-of-neural-2","slug":"towards-evaluating-the-robustness-of-neural-2","title":"Towards Evaluating the Robustness of Neural Networks Learned by Transduction","date":"2021-10-27","arxiv_id":"2110.14735","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":0,"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/towards-evaluating-the-robustness-of-neural-2#ran","syntology_url":"https://syntology.ai/paper/2110.14735","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14735"}},"official":{"repos":["jfc43/eval-transductive-robustness"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/es-based-jacobian-enables-faster-bilevel-1","slug":"es-based-jacobian-enables-faster-bilevel-1","title":"On the Convergence Theory for Hessian-Free Bilevel Algorithms","date":"2021-10-13","arxiv_id":"2110.07004","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/es-based-jacobian-enables-faster-bilevel-1#ran","syntology_url":"https://syntology.ai/paper/2110.07004","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.07004"}},"official":{"repos":["sowmaster/esjacobians"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bilevel-stochastic-methods-for-optimization","slug":"bilevel-stochastic-methods-for-optimization","title":"Inexact bilevel stochastic gradient methods for constrained and unconstrained lower-level problems","date":"2021-10-01","arxiv_id":"2110.00604","repositories_listed":1,"syntology":null},{"url":"/paper/towards-gradient-based-bilevel-optimization","slug":"towards-gradient-based-bilevel-optimization","title":"Towards Gradient-based Bilevel Optimization with Non-convex Followers and Beyond","date":"2021-10-01","arxiv_id":"2110.00455","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-gradient-based-bilevel-optimization#ran","syntology_url":"https://syntology.ai/paper/2110.00455","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.00455"}},"official":{"repos":["vis-opt-group/iaptt-gm"],"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":["official"]}}},{"url":"/paper/sign-maml-efficient-model-agnostic-meta","slug":"sign-maml-efficient-model-agnostic-meta","title":"Sign-MAML: Efficient Model-Agnostic Meta-Learning by SignSGD","date":"2021-09-15","arxiv_id":"2109.07497","repositories_listed":1,"syntology":null},{"url":"/paper/provably-faster-algorithms-for-bilevel","slug":"provably-faster-algorithms-for-bilevel","title":"Provably Faster Algorithms for Bilevel Optimization","date":"2021-06-08","arxiv_id":"2106.04692","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":2,"n_instrument":6,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"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) · 2 unverified","sample_list":"/paper/provably-faster-algorithms-for-bilevel#ran","syntology_url":"https://syntology.ai/paper/2106.04692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04692"}},"official":{"repos":["JunjieYang97/MRVRBO"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/bifair-training-fair-models-with-bilevel","slug":"bifair-training-fair-models-with-bilevel","title":"Fair Machine Learning under Limited Demographically Labeled Data","date":"2021-06-03","arxiv_id":"2106.04757","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bifair-training-fair-models-with-bilevel#ran","syntology_url":"https://syntology.ai/paper/2106.04757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04757"}},"official":{"repos":["TinfoilHat0/BiFair"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/an-end-to-end-framework-for-molecular","slug":"an-end-to-end-framework-for-molecular","title":"An End-to-End Framework for Molecular Conformation Generation via Bilevel Programming","date":"2021-05-15","arxiv_id":"2105.07246","repositories_listed":1,"syntology":null},{"url":"/paper/implicit-differentiation-for-fast","slug":"implicit-differentiation-for-fast","title":"Implicit differentiation for fast hyperparameter selection in non-smooth convex learning","date":"2021-05-04","arxiv_id":"2105.01637","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/implicit-differentiation-for-fast#ran","syntology_url":"https://syntology.ai/paper/2105.01637","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.01637"}},"official":{"repos":["QB3/sparse-ho"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-continuously-optimize-wireless-1","slug":"learning-to-continuously-optimize-wireless-1","title":"Learning to Continuously Optimize Wireless Resource in a Dynamic Environment: A Bilevel Optimization Perspective","date":"2021-05-03","arxiv_id":"2105.01696","repositories_listed":1,"syntology":null},{"url":"/paper/the-hammer-and-the-nut-is-bilevel","slug":"the-hammer-and-the-nut-is-bilevel","title":"The Hammer and the Nut: Is Bilevel Optimization Really Needed to Poison Linear Classifiers?","date":"2021-03-23","arxiv_id":"2103.12399","repositories_listed":1,"syntology":null},{"url":"/paper/fairbatch-batch-selection-for-model-fairness-1","slug":"fairbatch-batch-selection-for-model-fairness-1","title":"FairBatch: Batch Selection for Model Fairness","date":"2020-12-03","arxiv_id":"2012.01696","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/fairbatch-batch-selection-for-model-fairness-1#ran","syntology_url":"https://syntology.ai/paper/2012.01696","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.01696"}},"official":{"repos":["yuji-roh/fairbatch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/how-robust-are-randomized-smoothing-based","slug":"how-robust-are-randomized-smoothing-based","title":"How Robust are Randomized Smoothing based Defenses to Data Poisoning?","date":"2020-12-02","arxiv_id":"2012.01274","repositories_listed":1,"syntology":null},{"url":"/paper/differentiable-neural-architecture-search-in","slug":"differentiable-neural-architecture-search-in","title":"Differentiable Neural Architecture Search in Equivalent Space with Exploration Enhancement","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/delta-stn-efficient-bilevel-optimization-for","slug":"delta-stn-efficient-bilevel-optimization-for","title":"Delta-STN: Efficient Bilevel Optimization for Neural Networks using Structured Response Jacobians","date":"2020-10-26","arxiv_id":"2010.13514","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":0,"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/delta-stn-efficient-bilevel-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2010.13514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13514"}},"official":{"repos":["pomonam/Self-Tuning-Networks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/modeling-and-optimization-trade-off-in-meta","slug":"modeling-and-optimization-trade-off-in-meta","title":"Modeling and Optimization Trade-off in Meta-learning","date":"2020-10-24","arxiv_id":"2010.12916","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-batch-active-learning-via","slug":"semi-supervised-batch-active-learning-via","title":"Semi-supervised Batch Active Learning via Bilevel Optimization","date":"2020-10-19","arxiv_id":"2010.09654","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/semi-supervised-batch-active-learning-via#ran","syntology_url":"https://syntology.ai/paper/2010.09654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09654"}},"official":{"repos":["zalanborsos/bilevel_coresets"],"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/boml-a-modularized-bilevel-optimization","slug":"boml-a-modularized-bilevel-optimization","title":"BOML: A Modularized Bilevel Optimization Library in Python for Meta Learning","date":"2020-09-28","arxiv_id":"2009.13357","repositories_listed":1,"syntology":null},{"url":"/paper/optimistic-variants-of-single-objective","slug":"optimistic-variants-of-single-objective","title":"Optimistic variants of single-objective bilevel optimization for evolutionary algorithms","date":"2020-08-22","arxiv_id":"2008.09926","repositories_listed":1,"syntology":null},{"url":"/paper/targeted-data-driven-regularization-for-out","slug":"targeted-data-driven-regularization-for-out","title":"Targeted Data-driven Regularization for Out-of-Distribution Generalization","date":"2020-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/bilevel-continual-learning","slug":"bilevel-continual-learning","title":"Bilevel Continual Learning","date":"2020-07-30","arxiv_id":"2007.15553","repositories_listed":1,"syntology":null},{"url":"/paper/metal-active-semi-supervised-learning-on","slug":"metal-active-semi-supervised-learning-on","title":"MetAL: Active Semi-Supervised Learning on Graphs via Meta Learning","date":"2020-07-22","arxiv_id":"2007.11230","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-play-sequential-games-versus","slug":"learning-to-play-sequential-games-versus","title":"Learning to Play Sequential Games versus Unknown Opponents","date":"2020-07-10","arxiv_id":"2007.05271","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/learning-to-play-sequential-games-versus#ran","syntology_url":"https://syntology.ai/paper/2007.05271","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05271"}},"official":null}},{"url":"/paper/inexact-derivative-free-optimization-for","slug":"inexact-derivative-free-optimization-for","title":"Inexact Derivative-Free Optimization for Bilevel Learning","date":"2020-06-23","arxiv_id":"2006.12674","repositories_listed":1,"syntology":null},{"url":"/paper/coresets-via-bilevel-optimization-for","slug":"coresets-via-bilevel-optimization-for","title":"Coresets via Bilevel Optimization for Continual Learning and Streaming","date":"2020-06-06","arxiv_id":"2006.03875","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":0,"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/coresets-via-bilevel-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2006.03875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03875"}},"official":{"repos":["zalanborsos/bilevel_coresets"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/milenas-efficient-neural-architecture-search","slug":"milenas-efficient-neural-architecture-search","title":"MiLeNAS: Efficient Neural Architecture Search via Mixed-Level Reformulation","date":"2020-03-27","arxiv_id":"2003.12238","repositories_listed":1,"syntology":null},{"url":"/paper/using-hindsight-to-anchor-past-knowledge-in-1","slug":"using-hindsight-to-anchor-past-knowledge-in-1","title":"Using Hindsight to Anchor Past Knowledge in Continual Learning","date":"2020-02-19","arxiv_id":"2002.08165","repositories_listed":1,"syntology":null},{"url":"/paper/deep-bilevel-learning","slug":"deep-bilevel-learning","title":"Deep Bilevel Learning","date":"2018-09-05","arxiv_id":"1809.01465","repositories_listed":1,"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/deep-bilevel-learning#ran","syntology_url":"https://syntology.ai/paper/1809.01465","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.01465"}},"official":null}},{"url":"/paper/soseleto-a-unified-approach-to-transfer","slug":"soseleto-a-unified-approach-to-transfer","title":"SOSELETO: A Unified Approach to Transfer Learning and Training with Noisy Labels","date":"2018-05-24","arxiv_id":"1805.09622","repositories_listed":1,"syntology":null},{"url":"/paper/discriminatively-learned-hierarchical-rank","slug":"discriminatively-learned-hierarchical-rank","title":"Discriminatively Learned Hierarchical Rank Pooling Networks","date":"2017-05-30","arxiv_id":"1705.10420","repositories_listed":1,"syntology":null},{"url":"/paper/multi-rendezvous-spacecraft-trajectory","slug":"multi-rendezvous-spacecraft-trajectory","title":"Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO","date":"2017-04-03","arxiv_id":"1704.00702","repositories_listed":1,"syntology":null},{"url":null,"slug":"restarted-contractive-operators-to-learn-at","title":"Restarted contractive operators to learn at equilibrium","date":"2025-06-16","arxiv_id":"2506.13239","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-bilevel-optimization-1","title":"Differentially Private Bilevel Optimization: Efficient Algorithms with Near-Optimal Rates","date":"2025-06-15","arxiv_id":"2506.12994","repositories_listed":0,"syntology":null},{"url":null,"slug":"policy-optimization-for-continuous-time","title":"Policy Optimization for Continuous-time Linear-Quadratic Graphon Mean Field Games","date":"2025-06-06","arxiv_id":"2506.05894","repositories_listed":0,"syntology":null},{"url":null,"slug":"unit-commitment-with-cost-oriented-temporal","title":"Unit Commitment with Cost-Oriented Temporal Resolution","date":"2025-06-03","arxiv_id":"2506.02707","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-period-mean-buffered-probability-of","title":"Multi-period Mean-Buffered Probability of Exceedance in Defined Contribution Portfolio Optimization","date":"2025-05-28","arxiv_id":"2505.22121","repositories_listed":0,"syntology":null},{"url":null,"slug":"targeted-unlearning-using-perturbed-sign","title":"Targeted Unlearning Using Perturbed Sign Gradient Methods With Applications On Medical Images","date":"2025-05-28","arxiv_id":"2505.21872","repositories_listed":0,"syntology":null},{"url":null,"slug":"persistently-exciting-online-feedback","title":"Persistently Exciting Online Feedback Optimization Controller with Minimal Perturbations","date":"2025-05-26","arxiv_id":"2505.19910","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequential-qcqp-for-bilevel-optimization-with","title":"Sequential QCQP for Bilevel Optimization with Line Search","date":"2025-05-20","arxiv_id":"2505.14647","repositories_listed":0,"syntology":null},{"url":null,"slug":"bi-level-policy-optimization-with-nystrom","title":"Bi-Level Policy Optimization with Nyström Hypergradients","date":"2025-05-16","arxiv_id":"2505.11714","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-stochastic-gradient-method-for-trilevel","title":"A stochastic gradient method for trilevel optimization","date":"2025-05-11","arxiv_id":"2505.06805","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-curvature-aware-hypergradient","title":"Efficient Curvature-Aware Hypergradient Approximation for Bilevel Optimization","date":"2025-05-04","arxiv_id":"2505.02101","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-provably-convergent-plug-and-play-framework","title":"A Provably Convergent Plug-and-Play Framework for Stochastic Bilevel Optimization","date":"2025-05-02","arxiv_id":"2505.01258","repositories_listed":0,"syntology":null},{"url":null,"slug":"pr-attack-coordinated-prompt-rag-attacks-on","title":"PR-Attack: Coordinated Prompt-RAG Attacks on Retrieval-Augmented Generation in Large Language Models via Bilevel Optimization","date":"2025-04-10","arxiv_id":"2504.07717","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-first-order-optimization-on-the","title":"Efficient First-Order Optimization on the Pareto Set for Multi-Objective Learning under Preference Guidance","date":"2025-03-26","arxiv_id":"2504.02854","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-sample-complexity-bounds-in-bilevel","title":"On The Sample Complexity Bounds In Bilevel Reinforcement Learning","date":"2025-03-22","arxiv_id":"2503.17644","repositories_listed":0,"syntology":null},{"url":null,"slug":"learn-to-bid-as-a-price-maker-wind-power","title":"Learn to Bid as a Price-Maker Wind Power Producer","date":"2025-03-20","arxiv_id":"2503.16107","repositories_listed":0,"syntology":null},{"url":null,"slug":"exergy-battery-modeling-and-p2p-trading-based","title":"Exergy Battery Modeling and P2P Trading Based Optimal Operation of Virtual Energy Station","date":"2025-03-15","arxiv_id":"2503.11966","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-convergence-of-adam-type-algorithm-for","title":"On the Convergence of Adam-Type Algorithm for Bilevel Optimization under Unbounded Smoothness","date":"2025-03-05","arxiv_id":"2503.03908","repositories_listed":0,"syntology":null},{"url":null,"slug":"path-adaptive-matting-for-efficient-inference","title":"Path-Adaptive Matting for Efficient Inference Under Various Computational Cost Constraints","date":"2025-03-05","arxiv_id":"2503.03228","repositories_listed":0,"syntology":null},{"url":"/paper/projecting-assumptions-the-duality-between","slug":"projecting-assumptions-the-duality-between","title":"Projecting Assumptions: The Duality Between Sparse Autoencoders and Concept Geometry","date":"2025-03-03","arxiv_id":"2503.01822","repositories_listed":0,"syntology":{"n":37,"n_ran":26,"n_constructed":3,"n_ran_checked":13,"n_instrument":13,"n_unverified":11,"n_honours":1,"n_violates":0,"n_no_contract":12,"n_pointer_only":4,"phrase":"26 ran (of which 3 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 13 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/projecting-assumptions-the-duality-between#ran","syntology_url":"https://syntology.ai/paper/2503.01822","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.01822"}},"official":null}},{"url":null,"slug":"bilevel-optimized-implicit-neural","title":"Bilevel Optimized Implicit Neural Representation for Scan-Specific Accelerated MRI Reconstruction","date":"2025-02-28","arxiv_id":"2502.21292","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-first-order-generative-bilevel-optimization","title":"A First-order Generative Bilevel Optimization Framework for Diffusion Models","date":"2025-02-12","arxiv_id":"2502.08808","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-theory-for-kernel-bilevel","title":"Learning Theory for Kernel Bilevel Optimization","date":"2025-02-12","arxiv_id":"2502.08457","repositories_listed":0,"syntology":null},{"url":null,"slug":"bilevel-zofo-bridging-parameter-efficient-and","title":"Bilevel ZOFO: Bridging Parameter-Efficient and Zeroth-Order Techniques for Efficient LLM Fine-Tuning and Meta-Training","date":"2025-02-05","arxiv_id":"2502.03604","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-generalization-via-sharpness-aware","title":"Enhancing Generalization via Sharpness-Aware Trajectory Matching for Dataset Condensation","date":"2025-02-03","arxiv_id":"2502.01865","repositories_listed":0,"syntology":null},{"url":null,"slug":"qnbo-quasi-newton-meets-bilevel-optimization","title":"qNBO: quasi-Newton Meets Bilevel Optimization","date":"2025-02-03","arxiv_id":"2502.01076","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-bidding-curves-for-renewable","title":"Optimizing Bidding Curves for Renewable Energy in Two-Settlement Electricity Markets","date":"2025-01-30","arxiv_id":"2501.18732","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-data-influence-in-meta-learning","title":"Evaluating Data Influence in Meta Learning","date":"2025-01-27","arxiv_id":"2501.15963","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-poisoning-attacks-against-ridge","title":"Generating Poisoning Attacks against Ridge Regression Models with Categorical Features","date":"2025-01-13","arxiv_id":"2501.07275","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-optimization-of-bilevel-problems","title":"Bayesian Optimization of Bilevel Problems","date":"2024-12-24","arxiv_id":"2412.18518","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-sparsity-promoting-regularizers-for","title":"Learning sparsity-promoting regularizers for linear inverse problems","date":"2024-12-20","arxiv_id":"2412.16031","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-interested-agents-in-collaborative","title":"Self-Interested Agents in Collaborative Learning: An Incentivized Adaptive Data-Centric Framework","date":"2024-12-09","arxiv_id":"2412.06597","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusion-augmented-coreset-expansion-for","title":"Diffusion-Augmented Coreset Expansion for Scalable Dataset Distillation","date":"2024-12-05","arxiv_id":"2412.04668","repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperparameter-tuning-through-pessimistic","title":"Hyperparameter Tuning Through Pessimistic Bilevel Optimization","date":"2024-12-04","arxiv_id":"2412.03666","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparkle-a-unified-single-loop-primal-dual","title":"SPARKLE: A Unified Single-Loop Primal-Dual Framework for Decentralized Bilevel Optimization","date":"2024-11-21","arxiv_id":"2411.14166","repositories_listed":0,"syntology":null},{"url":null,"slug":"mbl-cpdp-a-multi-objective-bilevel-method-for","title":"MBL-CPDP: A Multi-objective Bilevel Method for Cross-Project Defect Prediction via Automated Machine Learning","date":"2024-11-10","arxiv_id":"2411.06491","repositories_listed":0,"syntology":null},{"url":null,"slug":"provably-faster-algorithms-for-bilevel-3","title":"Provably Faster Algorithms for Bilevel Optimization via Without-Replacement Sampling","date":"2024-11-07","arxiv_id":"2411.05868","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-dynamic-resource-allocation","title":"An Efficient Dynamic Resource Allocation Framework for Evolutionary Bilevel Optimization","date":"2024-10-31","arxiv_id":"2410.24081","repositories_listed":0,"syntology":null},{"url":null,"slug":"llms-are-highly-constrained-biophysical","title":"Generalists vs. Specialists: Evaluating LLMs on Highly-Constrained Biophysical Sequence Optimization Tasks","date":"2024-10-29","arxiv_id":"2410.22296","repositories_listed":0,"syntology":null},{"url":null,"slug":"bilevel-model-for-electricity-market","title":"Bilevel Model for Electricity Market Mechanism Optimisation via Quantum Computing Enhanced Reinforcement Learning","date":"2024-10-28","arxiv_id":"2410.20968","repositories_listed":0,"syntology":null},{"url":null,"slug":"fully-first-order-methods-for-decentralized","title":"Fully First-Order Methods for Decentralized Bilevel Optimization","date":"2024-10-25","arxiv_id":"2410.19319","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-communication-and-computation-efficient","title":"A Communication and Computation Efficient Fully First-order Method for Decentralized Bilevel Optimization","date":"2024-10-18","arxiv_id":"2410.14115","repositories_listed":0,"syntology":null},{"url":null,"slug":"single-timescale-multi-sequence-stochastic","title":"Single-Timescale Multi-Sequence Stochastic Approximation Without Fixed Point Smoothness: Theories and Applications","date":"2024-10-17","arxiv_id":"2410.13743","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-reinforcement-learning-with-universal","title":"Meta-Reinforcement Learning with Universal Policy Adaptation: Provable Near-Optimality under All-task Optimum Comparator","date":"2024-10-13","arxiv_id":"2410.09728","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-sparse-additive-model-with","title":"Generalized Sparse Additive Model with Unknown Link Function","date":"2024-10-08","arxiv_id":"2410.06012","repositories_listed":0,"syntology":null},{"url":null,"slug":"bissl-bilevel-optimization-for-self","title":"BiSSL: Enhancing the Alignment Between Self-Supervised Pretraining and Downstream Fine-Tuning via Bilevel Optimization","date":"2024-10-03","arxiv_id":"2410.02387","repositories_listed":0,"syntology":null},{"url":null,"slug":"saflex-self-adaptive-augmentation-via-feature","title":"SAFLEX: Self-Adaptive Augmentation via Feature Label Extrapolation","date":"2024-10-03","arxiv_id":"2410.02512","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-bilevel-optimization","title":"Differentially Private Bilevel Optimization","date":"2024-09-29","arxiv_id":"2409.19800","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-the-impact-of-haps-ris-on-uav-based","title":"Exploring the Impact of HAPS-RIS on UAV-Based Networks: a Novel Network Architecture","date":"2024-09-26","arxiv_id":"2409.17817","repositories_listed":0,"syntology":null},{"url":null,"slug":"convolutional-dictionary-learning-based","title":"Convolutional Dictionary Learning Based Hybrid-Field Channel Estimation for XL-RIS-Aided Massive MIMO Systems","date":"2024-09-25","arxiv_id":"2409.16664","repositories_listed":0,"syntology":null},{"url":null,"slug":"bilevel-optimization-for-real-time-control","title":"Bilevel Optimization for Real-Time Control with Application to Locomotion Gait Generation","date":"2024-09-18","arxiv_id":"2409.12366","repositories_listed":0,"syntology":null},{"url":null,"slug":"system-level-efficient-performance-of-emla","title":"System-Level Efficient Performance of EMLA-Driven Heavy-Duty Manipulators via Bilevel Optimization Framework with a Leader--Follower Scenario","date":"2024-09-18","arxiv_id":"2409.11849","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-nonconvex-bilevel-optimization-with","title":"Online Nonconvex Bilevel Optimization with Bregman Divergences","date":"2024-09-16","arxiv_id":"2409.10470","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-synthetic-data-to-mitigate-unfairness","title":"Using Synthetic Data to Mitigate Unfairness and Preserve Privacy in Collaborative Machine Learning","date":"2024-09-14","arxiv_id":"2409.09532","repositories_listed":0,"syntology":null},{"url":null,"slug":"pareto-set-prediction-assisted-bilevel-multi","title":"Pareto Set Prediction Assisted Bilevel Multi-objective Optimization","date":"2024-09-05","arxiv_id":"2409.03328","repositories_listed":0,"syntology":null},{"url":null,"slug":"unlocking-global-optimality-in-bilevel","title":"Unlocking Global Optimality in Bilevel Optimization: A Pilot Study","date":"2024-08-28","arxiv_id":"2408.16087","repositories_listed":0,"syntology":null},{"url":null,"slug":"stable-formulations-in-optimistic-bilevel","title":"On Stability in Optimistic Bilevel Optimization","date":"2024-08-23","arxiv_id":"2408.13323","repositories_listed":0,"syntology":null}],"record_sha256":"46b952ea08823c1d0d910369c86affc7cc2958b077802ab269827f0a6c7fb3eb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}