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.
Projection-free optimization via different variants of the Frank-Wolfe (FW), a.k.a. Conditional Gradient method has become one of the cornerstones in optimization for machine learning since in many cases the linear minimization oracle is much cheaper to implement than projections and some sparsity needs to be preserved. In a number of applications, e.g. Poisson inverse problems or quantum state tomography, the loss is given by a self-concordant (SC) function having unbounded curvature, implying absence of theoretical guarantees for the existing FW methods. We use the theory of SC functions to provide a new adaptive step size for FW methods and prove global convergence rate O(1/k) after k iterations. If the problem admits a stronger local linear minimization oracle, we construct a novel FW method with linear convergence rate for SC functions.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2002.04320")
get_code_for_paper("2002.04320")
have("2002.04320")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2002.04320.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2002.04320)
Connect an agent — have() is free.