{"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/parallel-coordinate-descent-newton-method-for","title":"Parallel Coordinate Descent Newton Method for Efficient $\\ell_1$-Regularized Minimization","arxiv_id":"1306.4080","date":"2013-06-18","proceeding":null,"authors":["An Bian","Xiong Li","Yuncai Liu","Ming-Hsuan Yang"],"abstract":"The recent years have witnessed advances in parallel algorithms for large\nscale optimization problems. Notwithstanding demonstrated success, existing\nalgorithms that parallelize over features are usually limited by divergence\nissues under high parallelism or require data preprocessing to alleviate these\nproblems. In this work, we propose a Parallel Coordinate Descent Newton\nalgorithm using multidimensional approximate Newton steps (PCDN), where the\noff-diagonal elements of the Hessian are set to zero to enable parallelization.\nIt randomly partitions the feature set into $b$ bundles/subsets with size of\n$P$, and sequentially processes each bundle by first computing the descent\ndirections for each feature in parallel and then conducting $P$-dimensional\nline search to obtain the step size. We show that: (1) PCDN is guaranteed to\nconverge globally despite increasing parallelism; (2) PCDN converges to the\nspecified accuracy $\\epsilon$ within the limited iteration number of\n$T_\\epsilon$, and $T_\\epsilon$ decreases with increasing parallelism (bundle\nsize $P$). Using the implementation technique of maintaining intermediate\nquantities, we minimize the data transfer and synchronization cost of the\n$P$-dimensional line search. For concreteness, the proposed PCDN algorithm is\napplied to $\\ell_1$-regularized logistic regression and $\\ell_2$-loss SVM.\nExperimental evaluations on six benchmark datasets show that the proposed PCDN\nalgorithm exploits parallelism well and outperforms the state-of-the-art\nmethods in speed without losing accuracy.","url_abs":"http://arxiv.org/abs/1306.4080v4","url_pdf":"http://arxiv.org/pdf/1306.4080v4.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":"parallel-coordinate-descent-newton-method-for","repo_url":"https://github.com/bianan/ParallelCDN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[{"method_slug":"logistic-regression","method_name":"Logistic Regression"},{"method_slug":"speed","method_name":"SPEED"},{"method_slug":"svm","method_name":"SVM"}],"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":"bianan/ParallelCDN","kind":"official","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":"4ecf654bb729ee4feda884970162c42ee0263aeb403202613bf8ea713067e511","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}