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.
We extend the Frank-Wolfe (FW) optimization algorithm to solve constrained smooth convex-concave saddle point (SP) problems. Remarkably, the method only requires access to linear minimization oracles. Leveraging recent advances in FW optimization, we provide the first proof of convergence of a FW-type saddle point solver over polytopes, thereby partially answering a 30 year-old conjecture. We also survey other convergence results and highlight gaps in the theoretical underpinnings of FW-style algorithms. Motivating applications without known efficient alternatives are explored through structured prediction with combinatorial penalties as well as games over matching polytopes involving an exponential number of constraints.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1610.07797")
get_code_for_paper("1610.07797")
have("1610.07797")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1610.07797.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1610.07797)
Connect an agent — have() is free.