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 studies the stochastic nonconvex-strongly-concave minimax optimization over a multi-agent network. We propose an efficient algorithm, called Decentralized Recursive gradient descEnt Ascent Method (DREAM), which achieves the best-known theoretical guarantee for finding the $ε$-stationary points. Concretely, it requires $\mathcal{O}(\min (κ^3ε^{-3},κ^2 \sqrt{N} ε^{-2} ))$ stochastic first-order oracle (SFO) calls and $\tilde{\mathcal{O}}(κ^2 ε^{-2})$ communication rounds, where $κ$ is the condition number and $N$ is the total number of individual functions. Our numerical experiments also validate the superiority of DREAM over previous methods.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2212.02387")
get_code_for_paper("2212.02387")
have("2212.02387")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2212.02387.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2212.02387)
Connect an agent — have() is free.