Feb. 13, 2024, 5:43 a.m. | Jeongyeol Kwon Dohyun Kwon Hanbaek Lyu

cs.LG updates on arXiv.org arxiv.org

We consider the problem of finding stationary points in Bilevel optimization when the lower-level problem is unconstrained and strongly convex. The problem has been extensively studied in recent years; the main technical challenge is to keep track of lower-level solutions $y^*(x)$ in response to the changes in the upper-level variables $x$. Subsequently, all existing approaches tie their analyses to a genie algorithm that knows lower-level solutions and, therefore, need not query any points far from them. We consider a dual …

challenge complexity cs.lg math.oc optimization solutions stochastic technical variables

Research Scholar (Technical Research)

@ Centre for the Governance of AI | Hybrid; Oxford, UK

HPC Engineer (x/f/m) - DACH

@ Meshcapade GmbH | Remote, Germany

Encounter Data Management Professional

@ Humana | Work at Home - Kentucky

Pre-sales Manager (Data, Analytics & AI)

@ Databricks | Stockholm, Sweden

Lecturer / Senior Lecturer - Medical Imaging

@ Central Queensland University | Mackay, QLD, AU

Intern - Research Engineer

@ Plus | Santa Clara, CA