{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/fast-convex-optimization-for-two-layer-relu","title":"Fast Convex Optimization for Two-Layer ReLU Networks: Equivalent Model Classes and Cone Decompositions","arxiv_id":"2202.01331","date":"2022-02-02","proceeding":null,"authors":["Aaron Mishkin","Arda Sahiner","Mert Pilanci"],"abstract":"We develop fast algorithms and robust software for convex optimization of two-layer neural networks with ReLU activation functions. Our work leverages a convex reformulation of the standard weight-decay penalized training problem as a set of group-$\\ell_1$-regularized data-local models, where locality is enforced by polyhedral cone constraints. In the special case of zero-regularization, we show that this problem is exactly equivalent to unconstrained optimization of a convex \"gated ReLU\" network. For problems with non-zero regularization, we show that convex gated ReLU models obtain data-dependent approximation bounds for the ReLU training problem. To optimize the convex reformulations, we develop an accelerated proximal gradient method and a practical augmented Lagrangian solver. We show that these approaches are faster than standard training heuristics for the non-convex problem, such as SGD, and outperform commercial interior-point solvers. Experimentally, we verify our theoretical results, explore the group-$\\ell_1$ regularization path, and scale convex optimization for neural networks to image classification on MNIST and CIFAR-10.","url_abs":"https://arxiv.org/abs/2202.01331v3","url_pdf":"https://arxiv.org/pdf/2202.01331v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"fast-convex-optimization-for-two-layer-relu","repo_url":"https://github.com/pilancilab/scnn","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"fast-convex-optimization-for-two-layer-relu","repo_url":"https://github.com/MindCode-4/code-13/tree/main/Two-Layer-ReLU-Network-Analytically","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"image-classification","task_name":"image-classification"}],"methods":[{"method_slug":"sgd","method_name":"SGD"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2202.01331","atlas_url":"https://app.syntology.ai/?focus=2202.01331","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.01331"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2202.01331"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2202.01331"},"call":"get_harvested_code_for_paper(arxiv_id=\"2202.01331\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2202.01331"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2202.01331\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2202.01331"},"call":"get_concepts_for_paper(arxiv_id=\"2202.01331\")"}],"by_repo":[{"repo":"pilancilab/scnn","kind":"official","samples":7,"ran":6,"instrument":0,"unverified":1},{"repo":"MindCode-4/code-13","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2212.08663"],"harvested_for_calls":[{"arxiv_id":"2212.08663","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2212.08663"},"call":"get_harvested_code_for_paper(arxiv_id=\"2212.08663\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2202.01331.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2202.01331.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/pilancilab/scnn","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/MindCode-4/code-13/tree/main/Two-Layer-ReLU-Network-Analytically","reach":null}],"summary":{"ran":6,"unverified":1},"n_samples":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":7,"ran":6,"n_ran_checked":6,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":6,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-24","last":"2026-09-24","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"samples":[{"code_sha256":"fbb92bd2ce42c951","code_sha256_prefix":"fbb92bd2ce42c951","entry":"as_list","repo":"pilancilab/scnn","repo_kind":"official","path":"src/scnn/private/metrics.py","file_url":"https://github.com/pilancilab/scnn/blob/HEAD/src/scnn/private/metrics.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"x:str/0/str","fixture_out_type":"list","level_recorded_at":"2026-09-24T21:23:57.672461+00:00","retrieve_with":{"tool":"get_code","code_sha256":"fbb92bd2ce42c951"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"fbb92bd2ce42c951"}},{"code_sha256":"67f2c4b39f8a84c3","code_sha256_prefix":"67f2c4b39f8a84c3","entry":"input_into_normalized_space","repo":"pilancilab/scnn","repo_kind":"official","path":"src/scnn/private/interface/data.py","file_url":"https://github.com/pilancilab/scnn/blob/HEAD/src/scnn/private/interface/data.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"model_weights:Tensor/2/float, column_norms:Tensor/1/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-24T21:23:57.672461+00:00","retrieve_with":{"tool":"get_code","code_sha256":"67f2c4b39f8a84c3"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"67f2c4b39f8a84c3"}},{"code_sha256":"9696ab727fb33da9","code_sha256_prefix":"9696ab727fb33da9","entry":"merge_metric_lists","repo":"pilancilab/scnn","repo_kind":"official","path":"src/scnn/private/metrics.py","file_url":"https://github.com/pilancilab/scnn/blob/HEAD/src/scnn/private/metrics.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"lm:tuple/1/list, rm:tuple/1/list","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T21:23:57.672461+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"9696ab727fb33da9"}},{"code_sha256":"b09a9155dbd71322","code_sha256_prefix":"b09a9155dbd71322","entry":"sample_dense_gates","repo":"pilancilab/scnn","repo_kind":"official","path":"src/scnn/activations.py","file_url":"https://github.com/pilancilab/scnn/blob/HEAD/src/scnn/activations.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"rng:Generator/0/?, d:int/0/int, n_samples:int/0/int","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T21:23:57.672461+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b09a9155dbd71322"}},{"code_sha256":"1e897d214dde5930","code_sha256_prefix":"1e897d214dde5930","entry":"sample_gate_vectors","repo":"pilancilab/scnn","repo_kind":"official","path":"src/scnn/activations.py","file_url":"https://github.com/pilancilab/scnn/blob/HEAD/src/scnn/activations.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"seed:int/0/int, d:int/0/int, n_samples:int/0/int, gate_type:str/0/str, order:NoneType/0/?","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T21:54:21.362907+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"1e897d214dde5930"}},{"code_sha256":"389f85fd284a2aba","code_sha256_prefix":"389f85fd284a2aba","entry":"sample_sparse_gates","repo":"pilancilab/scnn","repo_kind":"official","path":"src/scnn/activations.py","file_url":"https://github.com/pilancilab/scnn/blob/HEAD/src/scnn/activations.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"rng:Generator/0/?, d:int/0/int, n_samples:int/0/int, sparsity_indices:list/1/list","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T21:23:57.672461+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"389f85fd284a2aba"}},{"code_sha256":"47f4fb6c7ed4492b","code_sha256_prefix":"47f4fb6c7ed4492b","entry":"format_recent_metrics","repo":"pilancilab/scnn","repo_kind":"official","path":"src/scnn/private/metrics.py","file_url":"https://github.com/pilancilab/scnn/blob/HEAD/src/scnn/private/metrics.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"47f4fb6c7ed4492b"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"b05ec8a1a240fcdf4e21cb0e76bb32a902501f1c3df45e79844829cd57f08b67","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}