{"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/5","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":5,"pages_in_order":5,"rows_per_page":100,"rows":[401,423],"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/papers/4","next":null,"papers":[{"url":null,"slug":"reward-design-for-driver-repositioning-using","title":"Reward Design for Driver Repositioning Using Multi-Agent Reinforcement Learning","date":"2020-02-17","arxiv_id":"2002.06723","repositories_listed":0,"syntology":null},{"url":null,"slug":"bilevel-optimization-for-differentially","title":"Bilevel Optimization for Differentially Private Optimization in Energy Systems","date":"2020-01-26","arxiv_id":"2001.09508","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-nonnegative-matrix-factorization","title":"Adversarial Nonnegative Matrix Factorization","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-iteration-complexity-of-hypergradient-1","title":"On the Iteration Complexity of Hypergradient Computations","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"provably-global-convergence-of-actor-critic-a","title":"Provably Global Convergence of Actor-Critic: A Case for Linear Quadratic Regulator with Ergodic Cost","date":"2019-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-weight-sharing-and-bilevel-optimization-in","title":"On Weight-Sharing and Bilevel Optimization in Architecture Search","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-generalize-to-unseen-tasks-with","title":"Learning to Generalize to Unseen Tasks with Bilevel Optimization","date":"2019-08-05","arxiv_id":"1908.01457","repositories_listed":0,"syntology":null},{"url":null,"slug":"bilevel-optimization-deep-learning-and","title":"Bilevel Optimization, Deep Learning and Fractional Laplacian Regularization with Applications in Tomography","date":"2019-07-22","arxiv_id":"1907.09605","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-global-convergence-of-actor-critic-a","title":"On the Global Convergence of Actor-Critic: A Case for Linear Quadratic Regulator with Ergodic Cost","date":"2019-07-14","arxiv_id":"1907.06246","repositories_listed":0,"syntology":null},{"url":null,"slug":"bilevel-integrative-optimization-for-ill","title":"Task-Oriented Convex Bilevel Optimization with Latent Feasibility","date":"2019-07-06","arxiv_id":"1907.03083","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-surrogate-losses","title":"Learning Surrogate Losses","date":"2019-05-24","arxiv_id":"1905.10108","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-experiment-design-in-nonlinear","title":"Optimal Experiment Design in Nonlinear Parameter Estimation with Exact Confidence Regions","date":"2019-02-03","arxiv_id":"1902.00931","repositories_listed":0,"syntology":null},{"url":null,"slug":"metastyle-three-way-trade-off-among-speed","title":"MetaStyle: Three-Way Trade-Off Among Speed, Flexibility, and Quality in Neural Style Transfer","date":"2018-12-13","arxiv_id":"1812.05233","repositories_listed":0,"syntology":null},{"url":null,"slug":"bilevel-learning-of-the-group-lasso-structure","title":"Bilevel learning of the Group Lasso structure","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-defense-by-learning-to-attack","title":"Learning to Defend by Learning to Attack","date":"2018-11-03","arxiv_id":"1811.01213","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergent-reinforcement-learning-with","title":"Convergent Reinforcement Learning with Function Approximation: A Bilevel Optimization Perspective","date":"2018-09-27","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-implicit-generative-models-by","title":"Learning Implicit Generative Models by Teaching Explicit Ones","date":"2018-07-10","arxiv_id":"1807.03870","repositories_listed":0,"syntology":null},{"url":null,"slug":"training-set-debugging-using-trusted-items","title":"Training Set Debugging Using Trusted Items","date":"2018-01-24","arxiv_id":"1801.08019","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-review-on-bilevel-optimization-from","title":"A Review on Bilevel Optimization: From Classical to Evolutionary Approaches and Applications","date":"2017-05-17","arxiv_id":"1705.06270","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-machine-teaching-to-identify-optimal","title":"Using Machine Teaching to Identify Optimal Training-Set Attacks on Machine Learners","date":"2015-01-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-game-theoretic-machine-learning-approach","title":"A Game-theoretic Machine Learning Approach for Revenue Maximization in Sponsored Search","date":"2014-06-03","arxiv_id":"1406.0728","repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-sparse-analysis-and-synthesis","title":"Supervised Sparse Analysis and Synthesis Operators","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-evolutionary-algorithm-for-single","title":"Efficient Evolutionary Algorithm for Single-Objective Bilevel Optimization","date":"2013-03-15","arxiv_id":"1303.3901","repositories_listed":0,"syntology":null}],"record_sha256":"aa5005a2604599a8717d85840137ecbe60c5d8c56327fa3020869a8d366332b0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}