Yutong Wang, Clayton Scott
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.
Recent empirical evidence suggests that the Weston-Watkins support vector machine is among the best performing multiclass extensions of the binary SVM. Current state-of-the-art solvers repeatedly solve a particular subproblem approximately using an iterative strategy. In this work, we propose an algorithm that solves the subproblem exactly using a novel reparametrization of the Weston-Watkins dual problem. For linear WW-SVMs, our solver shows significant speed-up over the state-of-the-art solver when the number of classes is large. Our exact subproblem solver also allows us to prove linear convergence of the overall solver. 1 WW-subproblem analytic log-linear runtime solver
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2102.05640")
get_code_for_paper("2102.05640")
have("2102.05640")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2102.05640.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2102.05640)
Connect an agent — have() is free.