{"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/high-dimensional-classification-by-sparse","title":"High-dimensional classification by sparse logistic regression","arxiv_id":"1706.08344","date":"2017-06-26","proceeding":null,"authors":["Felix Abramovich","Vadim Grinshtein"],"abstract":"We consider high-dimensional binary classification by sparse logistic\nregression. We propose a model/feature selection procedure based on penalized\nmaximum likelihood with a complexity penalty on the model size and derive the\nnon-asymptotic bounds for the resulting misclassification excess risk. The\nbounds can be reduced under the additional low-noise condition. The proposed\ncomplexity penalty is remarkably related to the VC-dimension of a set of sparse\nlinear classifiers. Implementation of any complexity penalty-based criterion,\nhowever, requires a combinatorial search over all possible models. To find a\nmodel selection procedure computationally feasible for high-dimensional data,\nwe extend the Slope estimator for logistic regression and show that under an\nadditional weighted restricted eigenvalue condition it is rate-optimal in the\nminimax sense.","url_abs":"http://arxiv.org/abs/1706.08344v3","url_pdf":"http://arxiv.org/pdf/1706.08344v3.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":"high-dimensional-classification-by-sparse","repo_url":"https://github.com/stat-lu/PhDpos","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"binary-classification","task_name":"Binary Classification"},{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"model-selection","task_name":"Model Selection"},{"task_slug":"high","task_name":"Vocal Bursts Intensity Prediction"},{"task_slug":"feature-selection","task_name":"feature selection"},{"task_slug":"regression-1","task_name":"regression"}],"methods":[{"method_slug":"logistic-regression","method_name":"Logistic Regression"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"stat-lu/PhDpos","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"6897ee141ec1973d11e0f1d1e5668bf062735a506bb6c351c72e85aea8642f20","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}