{"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/3","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":3,"pages_in_order":5,"rows_per_page":100,"rows":[201,300],"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/2","next":"/task/bilevel-optimization/papers/4","papers":[{"url":null,"slug":"rooftop-and-community-solar-adoption-with","title":"Rooftop and Community Solar Adoption with Income Heterogeneity","date":"2024-08-21","arxiv_id":"2408.11970","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-sharpness-aware-minimization-by","title":"Enhancing Sharpness-Aware Minimization by Learning Perturbation Radius","date":"2024-08-15","arxiv_id":"2408.08222","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-hessian-jacobian-free-nonconvex-pl","title":"Optimal Hessian/Jacobian-Free Nonconvex-PL Bilevel Optimization","date":"2024-07-25","arxiv_id":"2407.17823","repositories_listed":0,"syntology":null},{"url":null,"slug":"ssp-gnn-learning-to-track-via-bilevel","title":"SSP-GNN: Learning to Track via Bilevel Optimization","date":"2024-07-05","arxiv_id":"2407.04308","repositories_listed":0,"syntology":null},{"url":null,"slug":"empl-a-novel-efficient-meta-prompt-learning","title":"EMPL: A novel Efficient Meta Prompt Learning Framework for Few-shot Unsupervised Domain Adaptation","date":"2024-07-04","arxiv_id":"2407.04066","repositories_listed":0,"syntology":null},{"url":null,"slug":"decomposition-of-difficulties-in-complex","title":"Decomposition of Difficulties in Complex Optimization Problems Using a Bilevel Approach","date":"2024-07-03","arxiv_id":"2407.03454","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-design-of-conventional-public-transport","title":"Joint Design of Conventional Public Transport Network and Mobility on Demand","date":"2024-07-01","arxiv_id":"2407.01700","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalebio-scalable-bilevel-optimization-for","title":"ScaleBiO: Scalable Bilevel Optimization for LLM Data Reweighting","date":"2024-06-28","arxiv_id":"2406.19976","repositories_listed":0,"syntology":null},{"url":null,"slug":"double-momentum-method-for-lower-level","title":"Double Momentum Method for Lower-Level Constrained Bilevel Optimization","date":"2024-06-25","arxiv_id":"2406.17386","repositories_listed":0,"syntology":null},{"url":null,"slug":"imperative-learning-a-self-supervised-neural","title":"Imperative Learning: A Self-supervised Neuro-Symbolic Learning Framework for Robot Autonomy","date":"2024-06-23","arxiv_id":"2406.16087","repositories_listed":0,"syntology":null},{"url":null,"slug":"sail-self-improving-efficient-online","title":"SAIL: Self-Improving Efficient Online Alignment of Large Language Models","date":"2024-06-21","arxiv_id":"2406.15567","repositories_listed":0,"syntology":null},{"url":null,"slug":"first-order-methods-for-linearly-constrained","title":"First-Order Methods for Linearly Constrained Bilevel Optimization","date":"2024-06-18","arxiv_id":"2406.12771","repositories_listed":0,"syntology":null},{"url":null,"slug":"amosl-adaptive-modality-wise-structure","title":"AMOSL: Adaptive Modality-wise Structure Learning in Multi-view Graph Neural Networks For Enhanced Unified Representation","date":"2024-06-04","arxiv_id":"2406.02348","repositories_listed":0,"syntology":null},{"url":null,"slug":"bilevel-reinforcement-learning-via-the","title":"Bilevel reinforcement learning via the development of hyper-gradient without lower-level convexity","date":"2024-05-30","arxiv_id":"2405.19697","repositories_listed":0,"syntology":null},{"url":null,"slug":"unraveling-the-impact-of-heterophilic","title":"Unraveling the Impact of Heterophilic Structures on Graph Positive-Unlabeled Learning","date":"2024-05-30","arxiv_id":"2405.19919","repositories_listed":0,"syntology":null},{"url":null,"slug":"spaba-a-single-loop-and-probabilistic","title":"SPABA: A Single-Loop and Probabilistic Stochastic Bilevel Algorithm Achieving Optimal Sample Complexity","date":"2024-05-29","arxiv_id":"2405.18777","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-risk-safe-reinforcement-learning","title":"Spectral-Risk Safe Reinforcement Learning with Convergence Guarantees","date":"2024-05-29","arxiv_id":"2405.18698","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-prior-calibration-from-indirect","title":"Efficient Prior Calibration From Indirect Data","date":"2024-05-28","arxiv_id":"2405.17955","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-bilevel-optimization-1","title":"Riemannian Bilevel Optimization","date":"2024-05-22","arxiv_id":"2405.15816","repositories_listed":0,"syntology":null},{"url":null,"slug":"game-theoretic-energy-management-strategies","title":"Game-theoretic Energy Management Strategies With Interacting Agents in Formula 1","date":"2024-05-17","arxiv_id":"2405.11032","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerated-fully-first-order-methods-for","title":"Accelerated Fully First-Order Methods for Bilevel and Minimax Optimization","date":"2024-05-01","arxiv_id":"2405.00914","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-augmentation-policy-search-for-long-term","title":"Data Augmentation Policy Search for Long-Term Forecasting","date":"2024-05-01","arxiv_id":"2405.00319","repositories_listed":0,"syntology":null},{"url":null,"slug":"fully-zeroth-order-bilevel-programming-via","title":"Fully Zeroth-Order Bilevel Programming via Gaussian Smoothing","date":"2024-03-29","arxiv_id":"2404.00158","repositories_listed":0,"syntology":null},{"url":null,"slug":"whiteness-based-bilevel-learning-of","title":"Whiteness-based bilevel learning of regularization parameters in imaging","date":"2024-03-10","arxiv_id":"2403.07026","repositories_listed":0,"syntology":null},{"url":null,"slug":"concurrent-learning-of-policy-and-unknown","title":"Concurrent Learning of Policy and Unknown Safety Constraints in Reinforcement Learning","date":"2024-02-24","arxiv_id":"2402.15893","repositories_listed":0,"syntology":null},{"url":null,"slug":"pi-cof-a-bilevel-optimization-framework-for","title":"PI-CoF: A Bilevel Optimization Framework for Solving Active Learning Problems using Physics-Information","date":"2024-02-21","arxiv_id":"2402.13588","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-accelerated-gradient-method-for-simple","title":"An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization","date":"2024-02-12","arxiv_id":"2402.08097","repositories_listed":0,"syntology":null},{"url":null,"slug":"conformal-predictive-programming-for-chance","title":"Conformal Predictive Programming for Chance Constrained Optimization","date":"2024-02-12","arxiv_id":"2402.07407","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-complexity-of-first-order-methods-in","title":"On the Complexity of First-Order Methods in Stochastic Bilevel Optimization","date":"2024-02-11","arxiv_id":"2402.07101","repositories_listed":0,"syntology":null},{"url":null,"slug":"principled-penalty-based-methods-for-bilevel","title":"Principled Penalty-based Methods for Bilevel Reinforcement Learning and RLHF","date":"2024-02-10","arxiv_id":"2402.06886","repositories_listed":0,"syntology":null},{"url":null,"slug":"implicit-diffusion-efficient-optimization","title":"Implicit Diffusion: Efficient Optimization through Stochastic Sampling","date":"2024-02-08","arxiv_id":"2402.05468","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-bilevel-optimization-over","title":"Decentralized Bilevel Optimization: A Perspective from Transient Iteration Complexity","date":"2024-02-05","arxiv_id":"2402.03167","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-unsupervised-and-supervised-training-1","title":"Joint Unsupervised and Supervised Training for Automatic Speech Recognition via Bilevel Optimization","date":"2024-01-13","arxiv_id":"2401.06980","repositories_listed":0,"syntology":null},{"url":null,"slug":"moml-online-meta-adaptation-for-3d-human","title":"MoML: Online Meta Adaptation for 3D Human Motion Prediction","date":"2024-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"from-text-to-pixels-a-context-aware-semantic","title":"From Text to Pixels: A Context-Aware Semantic Synergy Solution for Infrared and Visible Image Fusion","date":"2023-12-31","arxiv_id":"2401.00421","repositories_listed":0,"syntology":null},{"url":null,"slug":"decision-focused-predictions-via-pessimistic","title":"Decision-focused predictions via pessimistic bilevel optimization: a computational study","date":"2023-12-29","arxiv_id":"2312.17640","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusion-driven-generative-framework-for","title":"Diffusion-Driven Generative Framework for Molecular Conformation Prediction","date":"2023-12-22","arxiv_id":"2401.09451","repositories_listed":0,"syntology":null},{"url":null,"slug":"less-or-more-from-teacher-exploiting","title":"Less or More From Teacher: Exploiting Trilateral Geometry For Knowledge Distillation","date":"2023-12-22","arxiv_id":"2312.15112","repositories_listed":0,"syntology":null},{"url":null,"slug":"rebel-a-regularization-based-solution-for","title":"REBEL: Reward Regularization-Based Approach for Robotic Reinforcement Learning from Human Feedback","date":"2023-12-22","arxiv_id":"2312.14436","repositories_listed":0,"syntology":null},{"url":null,"slug":"achieving-o-e-1-5-complexity-in-hessian","title":"Achieving ${O}(ε^{-1.5})$ Complexity in Hessian/Jacobian-free Stochastic Bilevel Optimization","date":"2023-12-06","arxiv_id":"2312.03807","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-informed-renewable-energy-1","title":"Uncertainty-Informed Renewable Energy Scheduling: A Scalable Bilevel Framework","date":"2023-12-06","arxiv_id":"2312.03868","repositories_listed":0,"syntology":null},{"url":null,"slug":"convexifying-regulation-market-clearing-of","title":"Convexifying Regulation Market Clearing of State-of-Charge Dependent Bid","date":"2023-11-21","arxiv_id":"2311.12690","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-training-distributions-with-scalable","title":"Adaptive Training Distributions with Scalable Online Bilevel Optimization","date":"2023-11-20","arxiv_id":"2311.11973","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-communication-complexity-of","title":"On the Communication Complexity of Decentralized Bilevel Optimization","date":"2023-11-19","arxiv_id":"2311.11342","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-single-loop-algorithm-for-decentralized","title":"A Single-Loop Algorithm for Decentralized Bilevel Optimization","date":"2023-11-15","arxiv_id":"2311.08945","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-mirror-descent-bilevel-optimization","title":"Adaptive Mirror Descent Bilevel Optimization","date":"2023-11-08","arxiv_id":"2311.04520","repositories_listed":0,"syntology":null},{"url":null,"slug":"contextual-stochastic-bilevel-optimization","title":"Contextual Stochastic Bilevel Optimization","date":"2023-10-27","arxiv_id":"2310.18535","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-challenge-in-reweighting-data-with-bilevel","title":"A Challenge in Reweighting Data with Bilevel Optimization","date":"2023-10-26","arxiv_id":"2310.17386","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-for-active-learning-via","title":"Learning to Rank for Active Learning via Multi-Task Bilevel Optimization","date":"2023-10-25","arxiv_id":"2310.17044","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-shared-data-manipulation-in","title":"Detecting Shared Data Manipulation in Distributed Optimization Algorithms","date":"2023-10-20","arxiv_id":"2310.13252","repositories_listed":0,"syntology":null},{"url":null,"slug":"fewer-is-more-trojan-attacks-on-parameter","title":"PETA: Parameter-Efficient Trojan Attacks","date":"2023-10-01","arxiv_id":"2310.00648","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-poisoning-fair-representations","title":"Towards Poisoning Fair Representations","date":"2023-09-28","arxiv_id":"2309.16487","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-penalty-methods-for-nonconvex-bilevel","title":"On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation","date":"2023-09-04","arxiv_id":"2309.01753","repositories_listed":0,"syntology":null},{"url":null,"slug":"fedlogic-interpretable-federated-multi-domain","title":"Federated Neuro-Symbolic Learning","date":"2023-08-29","arxiv_id":"2308.15324","repositories_listed":0,"syntology":null},{"url":null,"slug":"projection-free-methods-for-stochastic-simple","title":"Projection-Free Methods for Stochastic Simple Bilevel Optimization with Convex Lower-level Problem","date":"2023-08-15","arxiv_id":"2308.07536","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterative-reweighted-least-squares-networks","title":"Iterative Reweighted Least Squares Networks With Convergence Guarantees for Solving Inverse Imaging Problems","date":"2023-08-10","arxiv_id":"2308.05745","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-convex-bilevel-optimization-with-time","title":"Non-Convex Bilevel Optimization with Time-Varying Objective Functions","date":"2023-08-07","arxiv_id":"2308.03811","repositories_listed":0,"syntology":null},{"url":null,"slug":"aligning-agent-policy-with-externalities","title":"PARL: A Unified Framework for Policy Alignment in Reinforcement Learning from Human Feedback","date":"2023-08-03","arxiv_id":"2308.02585","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-perceptual-learning-for-enhancement-and","title":"Joint Perceptual Learning for Enhancement and Object Detection in Underwater Scenarios","date":"2023-07-07","arxiv_id":"2307.03536","repositories_listed":0,"syntology":null},{"url":null,"slug":"implicit-differentiation-for-hyperparameter","title":"Implicit Differentiation for Hyperparameter Tuning the Weighted Graphical Lasso","date":"2023-07-05","arxiv_id":"2307.02130","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-inexact-hypergradient-descent","title":"Accelerating Inexact HyperGradient Descent for Bilevel Optimization","date":"2023-06-30","arxiv_id":"2307.00126","repositories_listed":0,"syntology":null},{"url":null,"slug":"near-optimal-fully-first-order-algorithms-for","title":"Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles","date":"2023-06-26","arxiv_id":"2306.14853","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-algorithms-for-stochastic-bilevel","title":"Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions","date":"2023-06-21","arxiv_id":"2306.12067","repositories_listed":0,"syntology":null},{"url":null,"slug":"slack-stable-learning-of-augmentations-with-1","title":"SLACK: Stable Learning of Augmentations with Cold-start and KL regularization","date":"2023-06-16","arxiv_id":"2306.09998","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generalized-alternating-method-for-bilevel","title":"A Generalized Alternating Method for Bilevel Learning under the Polyak-Łojasiewicz Condition","date":"2023-06-04","arxiv_id":"2306.02422","repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperparameter-learning-under-data-poisoning","title":"Hyperparameter Learning under Data Poisoning: Analysis of the Influence of Regularization via Multiobjective Bilevel Optimization","date":"2023-06-02","arxiv_id":"2306.01613","repositories_listed":0,"syntology":null},{"url":null,"slug":"simfbo-towards-simple-flexible-and","title":"SimFBO: Towards Simple, Flexible and Communication-efficient Federated Bilevel Learning","date":"2023-05-30","arxiv_id":"2305.19442","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-ante-hoc-graph-explainer-using-bilevel","title":"Robust Ante-hoc Graph Explainer using Bilevel Optimization","date":"2023-05-25","arxiv_id":"2305.15745","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-step-differentiation-of-iterative","title":"One-step differentiation of iterative algorithms","date":"2023-05-23","arxiv_id":"2305.13768","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-bilevel-optimization-via-minimax","title":"Effective Bilevel Optimization via Minimax Reformulation","date":"2023-05-22","arxiv_id":"2305.13153","repositories_listed":0,"syntology":null},{"url":null,"slug":"cooperative-lane-changing-in-mixed-traffic","title":"Cooperative Lane Changing in Mixed Traffic can be Robust to Human Driver Behavior","date":"2023-03-29","arxiv_id":"2303.16948","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-reliable-neural-machine-translation","title":"Towards Reliable Neural Machine Translation with Consistency-Aware Meta-Learning","date":"2023-03-20","arxiv_id":"2303.10966","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-pivoting-manipulation-using-contact","title":"Robust Pivoting Manipulation using Contact Implicit Bilevel Optimization","date":"2023-03-15","arxiv_id":"2303.08965","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-momentum-based-gradient-methods-for","title":"On Momentum-Based Gradient Methods for Bilevel Optimization with Nonconvex Lower-Level","date":"2023-03-07","arxiv_id":"2303.03944","repositories_listed":0,"syntology":null},{"url":null,"slug":"implicit-bilevel-optimization-differentiating","title":"Implicit Bilevel Optimization: Differentiating through Bilevel Optimization Programming","date":"2023-02-28","arxiv_id":"2302.14473","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-near-optimal-algorithm-for-bilevel","title":"A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization","date":"2023-02-17","arxiv_id":"2302.08766","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-federated-bilevel","title":"Communication-Efficient Federated Bilevel Optimization with Local and Global Lower Level Problems","date":"2023-02-13","arxiv_id":"2302.06701","repositories_listed":0,"syntology":null},{"url":null,"slug":"achieving-linear-speedup-in-non-iid-federated","title":"Achieving Linear Speedup in Non-IID Federated Bilevel Learning","date":"2023-02-10","arxiv_id":"2302.05412","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-federated-2","title":"Communication-Efficient Federated Hypergradient Computation via Aggregated Iterative Differentiation","date":"2023-02-09","arxiv_id":"2302.04969","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-gradient-approximation-method-for","title":"Efficient Gradient Approximation Method for Constrained Bilevel Optimization","date":"2023-02-03","arxiv_id":"2302.01970","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-fully-first-order-method-for-stochastic","title":"A Fully First-Order Method for Stochastic Bilevel Optimization","date":"2023-01-26","arxiv_id":"2301.10945","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-bilevel-coreset-selection","title":"Probabilistic Bilevel Coreset Selection","date":"2023-01-24","arxiv_id":"2301.09880","repositories_listed":0,"syntology":null},{"url":null,"slug":"valuing-distributed-energy-resources-for-non","title":"Valuing Distributed Energy Resources for Non-Wires Alternatives","date":"2023-01-16","arxiv_id":"2301.06636","repositories_listed":0,"syntology":null},{"url":null,"slug":"analyzing-inexact-hypergradients-for-bilevel","title":"Analyzing Inexact Hypergradients for Bilevel Learning","date":"2023-01-11","arxiv_id":"2301.04764","repositories_listed":0,"syntology":null},{"url":null,"slug":"first-order-penalty-methods-for-bilevel","title":"First-order penalty methods for bilevel optimization","date":"2023-01-04","arxiv_id":"2301.01716","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-utility-maximization-with-unknown","title":"Network Utility Maximization with Unknown Utility Functions: A Distributed, Data-Driven Bilevel Optimization Approach","date":"2023-01-04","arxiv_id":"2301.01801","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-bilevel-optimization-without-lower-level","title":"On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis","date":"2023-01-02","arxiv_id":"2301.00712","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-implicit-bias-in-overparameterized-bilevel","title":"On Implicit Bias in Overparameterized Bilevel Optimization","date":"2022-12-28","arxiv_id":"2212.14032","repositories_listed":0,"syntology":null},{"url":null,"slug":"selective-classification-using-a-robust-meta","title":"Selective classification using a robust meta-learning approach","date":"2022-12-12","arxiv_id":"2212.05987","repositories_listed":0,"syntology":null},{"url":null,"slug":"cpmlho-hyperparameter-tuning-via-cutting","title":"CPMLHO:Hyperparameter Tuning via Cutting Plane and Mixed-Level Optimization","date":"2022-12-11","arxiv_id":"2212.06150","repositories_listed":0,"syntology":null},{"url":null,"slug":"diamond-taming-sample-and-communication","title":"DIAMOND: Taming Sample and Communication Complexities in Decentralized Bilevel Optimization","date":"2022-12-05","arxiv_id":"2212.02376","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-bilevel-knapsack-problem-using-graph","title":"Solving Bilevel Knapsack Problem using Graph Neural Networks","date":"2022-11-24","arxiv_id":"2211.13436","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-penalty-based-method-for-communication","title":"A Penalty-Based Method for Communication-Efficient Decentralized Bilevel Programming","date":"2022-11-08","arxiv_id":"2211.04088","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-adaptive-federated-bilevel-optimization","title":"Fast Adaptive Federated Bilevel Optimization","date":"2022-11-02","arxiv_id":"2211.01122","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-stochastic-bilevel-optimization","title":"Decentralized Stochastic Bilevel Optimization with Improved per-Iteration Complexity","date":"2022-10-23","arxiv_id":"2210.12839","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-sample-reweighting-for-accuracy-and","title":"Learning Sample Reweighting for Accuracy and Adversarial Robustness","date":"2022-10-20","arxiv_id":"2210.11513","repositories_listed":0,"syntology":null},{"url":null,"slug":"explainable-bilevel-optimization-an","title":"Explainable bilevel optimization: an application to the Helsinki deblur challenge","date":"2022-10-18","arxiv_id":"2210.10050","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-data-driven-method-for-locating-sensors-and","title":"A Data-Driven Sensor Placement Approach for Detecting Voltage Violations in Distribution Systems","date":"2022-10-17","arxiv_id":"2210.09414","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-with-limited-samples-meta-learning","title":"Learning with Limited Samples -- Meta-Learning and Applications to Communication Systems","date":"2022-10-03","arxiv_id":"2210.02515","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-stability-and-generalization-of-bilevel","title":"On Stability and Generalization of Bilevel Optimization Problem","date":"2022-10-03","arxiv_id":"2210.01063","repositories_listed":0,"syntology":null}],"record_sha256":"d4dfb40fd756f943dc8bac5f21b208a9c6507bd6d742c1b6ee2178dc5e8e3e81","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}