{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TOU5UPXBLPP7YEH45XBBS76AE7","short_pith_number":"pith:TOU5UPXB","schema_version":"1.0","canonical_sha256":"9ba9da3ee15bdffc10fcedc2197fc027d5ba0691646f4e1f8816c3c45659c1fc","source":{"kind":"arxiv","id":"1608.01264","version":1},"attestation_state":"computed","paper":{"title":"Fast and Simple Optimization for Poisson Likelihood Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Le Song, Niao He, Yichen Wang, Zaid Harchaoui","submitted_at":"2016-08-03T17:33:16Z","abstract_excerpt":"Poisson likelihood models have been prevalently used in imaging, social networks, and time series analysis. We propose fast, simple, theoretically-grounded, and versatile, optimization algorithms for Poisson likelihood modeling. The Poisson log-likelihood is concave but not Lipschitz-continuous. Since almost all gradient-based optimization algorithms rely on Lipschitz-continuity, optimizing Poisson likelihood models with a guarantee of convergence can be challenging, especially for large-scale problems.\n  We present a new perspective allowing to efficiently optimize a wide range of penalized P"},"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":"1608.01264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-03T17:33:16Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"e895912210f3ea2d9d0e1d6d51467fb771ddb2b4ee4e7912e27989836ebc8950","abstract_canon_sha256":"306df5cf09e5d3acbcf0aaffa0a3ecc68960892aef1242721596352a4ca61431"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:56.036858Z","signature_b64":"/2vJUMbYbUo5MltukZd0mJEZQ7owp+0gZhEzYJVL/BzO4MsL2LhU7glPMGLC8f9bmJa4yitTrCZvXSiP7Y8MCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ba9da3ee15bdffc10fcedc2197fc027d5ba0691646f4e1f8816c3c45659c1fc","last_reissued_at":"2026-05-18T01:09:56.036102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:56.036102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Simple Optimization for Poisson Likelihood Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Le Song, Niao He, Yichen Wang, Zaid Harchaoui","submitted_at":"2016-08-03T17:33:16Z","abstract_excerpt":"Poisson likelihood models have been prevalently used in imaging, social networks, and time series analysis. We propose fast, simple, theoretically-grounded, and versatile, optimization algorithms for Poisson likelihood modeling. The Poisson log-likelihood is concave but not Lipschitz-continuous. Since almost all gradient-based optimization algorithms rely on Lipschitz-continuity, optimizing Poisson likelihood models with a guarantee of convergence can be challenging, especially for large-scale problems.\n  We present a new perspective allowing to efficiently optimize a wide range of penalized P"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01264","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":""},"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":"1608.01264","created_at":"2026-05-18T01:09:56.036227+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.01264v1","created_at":"2026-05-18T01:09:56.036227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01264","created_at":"2026-05-18T01:09:56.036227+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOU5UPXBLPP7","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOU5UPXBLPP7YEH4","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOU5UPXB","created_at":"2026-05-18T12:30:46.583412+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/TOU5UPXBLPP7YEH45XBBS76AE7","json":"https://pith.science/pith/TOU5UPXBLPP7YEH45XBBS76AE7.json","graph_json":"https://pith.science/api/pith-number/TOU5UPXBLPP7YEH45XBBS76AE7/graph.json","events_json":"https://pith.science/api/pith-number/TOU5UPXBLPP7YEH45XBBS76AE7/events.json","paper":"https://pith.science/paper/TOU5UPXB"},"agent_actions":{"view_html":"https://pith.science/pith/TOU5UPXBLPP7YEH45XBBS76AE7","download_json":"https://pith.science/pith/TOU5UPXBLPP7YEH45XBBS76AE7.json","view_paper":"https://pith.science/paper/TOU5UPXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.01264&json=true","fetch_graph":"https://pith.science/api/pith-number/TOU5UPXBLPP7YEH45XBBS76AE7/graph.json","fetch_events":"https://pith.science/api/pith-number/TOU5UPXBLPP7YEH45XBBS76AE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOU5UPXBLPP7YEH45XBBS76AE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOU5UPXBLPP7YEH45XBBS76AE7/action/storage_attestation","attest_author":"https://pith.science/pith/TOU5UPXBLPP7YEH45XBBS76AE7/action/author_attestation","sign_citation":"https://pith.science/pith/TOU5UPXBLPP7YEH45XBBS76AE7/action/citation_signature","submit_replication":"https://pith.science/pith/TOU5UPXBLPP7YEH45XBBS76AE7/action/replication_record"}},"created_at":"2026-05-18T01:09:56.036227+00:00","updated_at":"2026-05-18T01:09:56.036227+00:00"}