{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:B7PZQRGYX3MEBFNMCW43RR2P7L","short_pith_number":"pith:B7PZQRGY","schema_version":"1.0","canonical_sha256":"0fdf9844d8bed84095ac15b9b8c74ffacf960bd8f236b6d3696abf35d5b4d518","source":{"kind":"arxiv","id":"2405.08631","version":1},"attestation_state":"computed","paper":{"title":"A Fast and Scalable Pathwise-Solver for Group Lasso and Elastic Net Penalized Regression via Block-Coordinate Descent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.MS","cs.SE"],"primary_cat":"stat.CO","authors_text":"James Yang, Trevor Hastie","submitted_at":"2024-05-14T14:10:48Z","abstract_excerpt":"We develop fast and scalable algorithms based on block-coordinate descent to solve the group lasso and the group elastic net for generalized linear models along a regularization path. Special attention is given when the loss is the usual least squares loss (Gaussian loss). We show that each block-coordinate update can be solved efficiently using Newton's method and further improved using an adaptive bisection method, solving these updates with a quadratic convergence rate. Our benchmarks show that our package adelie performs 3 to 10 times faster than the next fastest package on a wide array of"},"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":"2405.08631","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2024-05-14T14:10:48Z","cross_cats_sorted":["cs.LG","cs.MS","cs.SE"],"title_canon_sha256":"75ffebd4f00a40511982d889cdf8a05e5975bf4142812e6996231868dc9f0761","abstract_canon_sha256":"a38e4e57d62c31ccfba4a69915a1b31511cd947694226f554eb41a64d1b87ac7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:19:03.199544Z","signature_b64":"o3hNGtfN+Ppz4LlmvJ3Fm1cVgLvjApS8IwlflCRg3mhj0/iNqZIkrh6S5zu2qzarWwCoNz1reJWbMe6xV3okBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fdf9844d8bed84095ac15b9b8c74ffacf960bd8f236b6d3696abf35d5b4d518","last_reissued_at":"2026-07-05T08:19:03.199041Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:19:03.199041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast and Scalable Pathwise-Solver for Group Lasso and Elastic Net Penalized Regression via Block-Coordinate Descent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.MS","cs.SE"],"primary_cat":"stat.CO","authors_text":"James Yang, Trevor Hastie","submitted_at":"2024-05-14T14:10:48Z","abstract_excerpt":"We develop fast and scalable algorithms based on block-coordinate descent to solve the group lasso and the group elastic net for generalized linear models along a regularization path. Special attention is given when the loss is the usual least squares loss (Gaussian loss). We show that each block-coordinate update can be solved efficiently using Newton's method and further improved using an adaptive bisection method, solving these updates with a quadratic convergence rate. Our benchmarks show that our package adelie performs 3 to 10 times faster than the next fastest package on a wide array of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.08631","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.08631/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.08631","created_at":"2026-07-05T08:19:03.199099+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.08631v1","created_at":"2026-07-05T08:19:03.199099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.08631","created_at":"2026-07-05T08:19:03.199099+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7PZQRGYX3ME","created_at":"2026-07-05T08:19:03.199099+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7PZQRGYX3MEBFNM","created_at":"2026-07-05T08:19:03.199099+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7PZQRGY","created_at":"2026-07-05T08:19:03.199099+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.10196","citing_title":"Non-smooth optimization meets automated material model discovery","ref_index":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B7PZQRGYX3MEBFNMCW43RR2P7L","json":"https://pith.science/pith/B7PZQRGYX3MEBFNMCW43RR2P7L.json","graph_json":"https://pith.science/api/pith-number/B7PZQRGYX3MEBFNMCW43RR2P7L/graph.json","events_json":"https://pith.science/api/pith-number/B7PZQRGYX3MEBFNMCW43RR2P7L/events.json","paper":"https://pith.science/paper/B7PZQRGY"},"agent_actions":{"view_html":"https://pith.science/pith/B7PZQRGYX3MEBFNMCW43RR2P7L","download_json":"https://pith.science/pith/B7PZQRGYX3MEBFNMCW43RR2P7L.json","view_paper":"https://pith.science/paper/B7PZQRGY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.08631&json=true","fetch_graph":"https://pith.science/api/pith-number/B7PZQRGYX3MEBFNMCW43RR2P7L/graph.json","fetch_events":"https://pith.science/api/pith-number/B7PZQRGYX3MEBFNMCW43RR2P7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7PZQRGYX3MEBFNMCW43RR2P7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7PZQRGYX3MEBFNMCW43RR2P7L/action/storage_attestation","attest_author":"https://pith.science/pith/B7PZQRGYX3MEBFNMCW43RR2P7L/action/author_attestation","sign_citation":"https://pith.science/pith/B7PZQRGYX3MEBFNMCW43RR2P7L/action/citation_signature","submit_replication":"https://pith.science/pith/B7PZQRGYX3MEBFNMCW43RR2P7L/action/replication_record"}},"created_at":"2026-07-05T08:19:03.199099+00:00","updated_at":"2026-07-05T08:19:03.199099+00:00"}