None of the 5 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (5 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/1901.01585.json · badge: /api/ran/1901.01585.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| wanghaoyue123/Column-and-constraint-generation-for-L1-SVM-and-cousins | canonical (classifier label) classifier basis: classifier_2025 |
0 ran · 5 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| L1_SVM_CG | Not yet run unverified (harvested, no recorded run) |
wanghaoyue123/Column-and-constraint-generation-for-L1-SVM-and-cousins/Main/L1SVM_CG/L1_SVM_CG.py pointer only (licence: NONE) · get_code("b95611e5b8d1b84a") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, wanghaoyue123/Column-and-constraint-generation-for-L1-SVM-and-cousins when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
| init_correlation | Not yet run unverified (harvested, no recorded run) |
wanghaoyue123/Column-and-constraint-generation-for-L1-SVM-and-cousins/Main/L1SVM_CG/L1_SVM_CG.py pointer only (licence: NONE) · get_code("4a2692ceb6c63174") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, wanghaoyue123/Column-and-constraint-generation-for-L1-SVM-and-cousins when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
| use_FO1_CG | Not yet run unverified (harvested, no recorded run) |
wanghaoyue123/Column-and-constraint-generation-for-L1-SVM-and-cousins/Main/Group_SVM/Our_methods.py pointer only (licence: NONE) · get_code("d77b6568b9ff7848") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, wanghaoyue123/Column-and-constraint-generation-for-L1-SVM-and-cousins when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
| use_FO2_CG | Not yet run unverified (harvested, no recorded run) |
wanghaoyue123/Column-and-constraint-generation-for-L1-SVM-and-cousins/Main/Group_SVM/Our_methods.py pointer only (licence: NONE) · get_code("dcf125947364d913") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, wanghaoyue123/Column-and-constraint-generation-for-L1-SVM-and-cousins when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
| use_RP_CG | Not yet run unverified (harvested, no recorded run) |
wanghaoyue123/Column-and-constraint-generation-for-L1-SVM-and-cousins/Main/Group_SVM/Our_methods.py pointer only (licence: NONE) · get_code("5a5951868b3402f7") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, wanghaoyue123/Column-and-constraint-generation-for-L1-SVM-and-cousins when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 5 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The linear Support Vector Machine (SVM) is a classic classification technique in machine learning. Motivated by applications in modern high dimensional statistics, we consider penalized SVM problems involving the minimization of a hinge-loss function with a convex sparsity-inducing regularizer such as: the L1-norm on the coefficients, its grouped generalization and the sorted L1-penalty (aka Slope). Each problem can be expressed as a Linear Program (LP) and is computationally challenging when the number of features and/or samples is large -- the current state of algorithms for these problems is rather nascent when compared to the usual L2-regularized linear SVM. To this end, we propose new computational algorithms for these LPs by bringing together techniques from (a) classical column (and constraint) generation methods and (b) first order methods for non-smooth convex optimization -- techniques that are rarely used together for solving large scale LPs. These components have their respective strengths; and while they are found to be useful as separate entities, they have not been used together in the context of solving large scale LPs such as the ones studied herein. Our approach complements the strengths of (a) and (b) -- leading to a scheme that seems to significantly outperform commercial solvers as well as specialized implementations for these problems. We present numerical results on a series of real and synthetic datasets demonstrating the surprising effectiveness of classic column/constraint generation methods in the context of challenging LP-based machine learning tasks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1901.01585")
get_code_for_paper("1901.01585")
have("1901.01585")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1901.01585.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1901.01585)
Connect an agent — have() is free.