We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
This paper introduces \textit{online bilevel optimization} in which a sequence of time-varying bilevel problems is revealed one after the other. We extend the known regret bounds for online single-level algorithms to the bilevel setting. Specifically, we provide new notions of \textit{bilevel regret}, develop an online alternating time-averaged gradient method that is capable of leveraging smoothness, and give regret bounds in terms of the path-length of the inner and outer minimizer sequences.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2207.02829")
get_code_for_paper("2207.02829")
have("2207.02829")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2207.02829.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2207.02829)
Connect an agent — have() is free.