{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CKJ2FD2KQ5ULYSX6RKIHHYSFQF","short_pith_number":"pith:CKJ2FD2K","schema_version":"1.0","canonical_sha256":"1293a28f4a8768bc4afe8a9073e2458140dc29df7178a9c8e3a6886f1470926a","source":{"kind":"arxiv","id":"1309.5605","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Bound Majorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anna Choromanska, Tony Jebara","submitted_at":"2013-09-22T14:46:15Z","abstract_excerpt":"Recently a majorization method for optimizing partition functions of log-linear models was proposed alongside a novel quadratic variational upper-bound. In the batch setting, it outperformed state-of-the-art first- and second-order optimization methods on various learning tasks. We propose a stochastic version of this bound majorization method as well as a low-rank modification for high-dimensional data-sets. The resulting stochastic second-order method outperforms stochastic gradient descent (across variations and various tunings) both in terms of the number of iterations and computation time"},"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":"1309.5605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-22T14:46:15Z","cross_cats_sorted":[],"title_canon_sha256":"d39468860b88d324f86c94b0c56c0b1b892824aab1d5aa216b9814f615533a5b","abstract_canon_sha256":"fb6056120238088aa332afdfceed54a04c1eaa68282e523b29a3d5dd5be7bf2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:35.810291Z","signature_b64":"+1uypHxsDRWNGAUW6gQAylRGK+ArdzJHFvsWR7KQzGQsgoDFm/2XA0LLieQR4By3E92q/KbbjZJssnJbPUVJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1293a28f4a8768bc4afe8a9073e2458140dc29df7178a9c8e3a6886f1470926a","last_reissued_at":"2026-05-18T03:12:35.809597Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:35.809597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Bound Majorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anna Choromanska, Tony Jebara","submitted_at":"2013-09-22T14:46:15Z","abstract_excerpt":"Recently a majorization method for optimizing partition functions of log-linear models was proposed alongside a novel quadratic variational upper-bound. In the batch setting, it outperformed state-of-the-art first- and second-order optimization methods on various learning tasks. We propose a stochastic version of this bound majorization method as well as a low-rank modification for high-dimensional data-sets. The resulting stochastic second-order method outperforms stochastic gradient descent (across variations and various tunings) both in terms of the number of iterations and computation time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5605","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":"1309.5605","created_at":"2026-05-18T03:12:35.809695+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.5605v1","created_at":"2026-05-18T03:12:35.809695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5605","created_at":"2026-05-18T03:12:35.809695+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKJ2FD2KQ5UL","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKJ2FD2KQ5ULYSX6","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKJ2FD2K","created_at":"2026-05-18T12:27:40.988391+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/CKJ2FD2KQ5ULYSX6RKIHHYSFQF","json":"https://pith.science/pith/CKJ2FD2KQ5ULYSX6RKIHHYSFQF.json","graph_json":"https://pith.science/api/pith-number/CKJ2FD2KQ5ULYSX6RKIHHYSFQF/graph.json","events_json":"https://pith.science/api/pith-number/CKJ2FD2KQ5ULYSX6RKIHHYSFQF/events.json","paper":"https://pith.science/paper/CKJ2FD2K"},"agent_actions":{"view_html":"https://pith.science/pith/CKJ2FD2KQ5ULYSX6RKIHHYSFQF","download_json":"https://pith.science/pith/CKJ2FD2KQ5ULYSX6RKIHHYSFQF.json","view_paper":"https://pith.science/paper/CKJ2FD2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.5605&json=true","fetch_graph":"https://pith.science/api/pith-number/CKJ2FD2KQ5ULYSX6RKIHHYSFQF/graph.json","fetch_events":"https://pith.science/api/pith-number/CKJ2FD2KQ5ULYSX6RKIHHYSFQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKJ2FD2KQ5ULYSX6RKIHHYSFQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKJ2FD2KQ5ULYSX6RKIHHYSFQF/action/storage_attestation","attest_author":"https://pith.science/pith/CKJ2FD2KQ5ULYSX6RKIHHYSFQF/action/author_attestation","sign_citation":"https://pith.science/pith/CKJ2FD2KQ5ULYSX6RKIHHYSFQF/action/citation_signature","submit_replication":"https://pith.science/pith/CKJ2FD2KQ5ULYSX6RKIHHYSFQF/action/replication_record"}},"created_at":"2026-05-18T03:12:35.809695+00:00","updated_at":"2026-05-18T03:12:35.809695+00:00"}