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 develop efficient algorithms to train $\ell_1$-regularized linear classifiers with large dimensionality $d$ of the feature space, number of classes $k$, and sample size $n$. Our focus is on a special class of losses that includes, in particular, the multiclass hinge and logistic losses. Our approach combines several ideas: (i) passing to the equivalent saddle-point problem with a quasi-bilinear objective; (ii) applying stochastic mirror descent with a proper choice of geometry which guarantees a favorable accuracy bound; (iii) devising non-uniform sampling schemes to approximate the matrix products. In particular, for the multiclass hinge loss we propose a \textit{sublinear} algorithm with iterations performed in $O(d+n+k)$ arithmetic operations.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1902.03755")
get_code_for_paper("1902.03755")
have("1902.03755")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1902.03755.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1902.03755)
Connect an agent — have() is free.