{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VF4GRIQIZMBDNWESOWIGR5XOGI","short_pith_number":"pith:VF4GRIQI","schema_version":"1.0","canonical_sha256":"a97868a208cb0236d892759068f6ee3202a12e1937027ad8071aee08fbfb01f3","source":{"kind":"arxiv","id":"1306.4080","version":4},"attestation_state":"computed","paper":{"title":"Parallel Coordinate Descent Newton Method for Efficient $\\ell_1$-Regularized Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.LG","authors_text":"An Bian, Ming-Hsuan Yang, Xiong Li, Yuncai Liu","submitted_at":"2013-06-18T07:03:16Z","abstract_excerpt":"The recent years have witnessed advances in parallel algorithms for large scale optimization problems. Notwithstanding demonstrated success, existing algorithms that parallelize over features are usually limited by divergence issues under high parallelism or require data preprocessing to alleviate these problems. In this work, we propose a Parallel Coordinate Descent Newton algorithm using multidimensional approximate Newton steps (PCDN), where the off-diagonal elements of the Hessian are set to zero to enable parallelization. It randomly partitions the feature set into $b$ bundles/subsets wit"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1306.4080","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-06-18T07:03:16Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"96dfb6ea95ed7f78baa599d619466b58358a0e38ba68f96646b2db8b55745f15","abstract_canon_sha256":"571421d1e1753c44a394547ab04babd5c657b37063c28c3e3b03ca2787786cda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:38.393935Z","signature_b64":"XWq0z6nLdRxzG+6LsAiFRoThatl1Fk9yRPmXYy/oPe99yjHwaeiN1DzclwmnRcLSPsaEZqSkFJuecR3qNSojBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a97868a208cb0236d892759068f6ee3202a12e1937027ad8071aee08fbfb01f3","last_reissued_at":"2026-05-18T00:28:38.393332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:38.393332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Coordinate Descent Newton Method for Efficient $\\ell_1$-Regularized Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.LG","authors_text":"An Bian, Ming-Hsuan Yang, Xiong Li, Yuncai Liu","submitted_at":"2013-06-18T07:03:16Z","abstract_excerpt":"The recent years have witnessed advances in parallel algorithms for large scale optimization problems. Notwithstanding demonstrated success, existing algorithms that parallelize over features are usually limited by divergence issues under high parallelism or require data preprocessing to alleviate these problems. In this work, we propose a Parallel Coordinate Descent Newton algorithm using multidimensional approximate Newton steps (PCDN), where the off-diagonal elements of the Hessian are set to zero to enable parallelization. It randomly partitions the feature set into $b$ bundles/subsets wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4080","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.4080","created_at":"2026-05-18T00:28:38.393415+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4080v4","created_at":"2026-05-18T00:28:38.393415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4080","created_at":"2026-05-18T00:28:38.393415+00:00"},{"alias_kind":"pith_short_12","alias_value":"VF4GRIQIZMBD","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VF4GRIQIZMBDNWES","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VF4GRIQI","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VF4GRIQIZMBDNWESOWIGR5XOGI","json":"https://pith.science/pith/VF4GRIQIZMBDNWESOWIGR5XOGI.json","graph_json":"https://pith.science/api/pith-number/VF4GRIQIZMBDNWESOWIGR5XOGI/graph.json","events_json":"https://pith.science/api/pith-number/VF4GRIQIZMBDNWESOWIGR5XOGI/events.json","paper":"https://pith.science/paper/VF4GRIQI"},"agent_actions":{"view_html":"https://pith.science/pith/VF4GRIQIZMBDNWESOWIGR5XOGI","download_json":"https://pith.science/pith/VF4GRIQIZMBDNWESOWIGR5XOGI.json","view_paper":"https://pith.science/paper/VF4GRIQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4080&json=true","fetch_graph":"https://pith.science/api/pith-number/VF4GRIQIZMBDNWESOWIGR5XOGI/graph.json","fetch_events":"https://pith.science/api/pith-number/VF4GRIQIZMBDNWESOWIGR5XOGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VF4GRIQIZMBDNWESOWIGR5XOGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VF4GRIQIZMBDNWESOWIGR5XOGI/action/storage_attestation","attest_author":"https://pith.science/pith/VF4GRIQIZMBDNWESOWIGR5XOGI/action/author_attestation","sign_citation":"https://pith.science/pith/VF4GRIQIZMBDNWESOWIGR5XOGI/action/citation_signature","submit_replication":"https://pith.science/pith/VF4GRIQIZMBDNWESOWIGR5XOGI/action/replication_record"}},"created_at":"2026-05-18T00:28:38.393415+00:00","updated_at":"2026-05-18T00:28:38.393415+00:00"}