{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KTI3DGWVNRECQZGHZFTF6YP5D5","short_pith_number":"pith:KTI3DGWV","schema_version":"1.0","canonical_sha256":"54d1b19ad56c482864c7c9665f61fd1f4ee1a450baefa78650ef9a2fc5355e45","source":{"kind":"arxiv","id":"1504.04406","version":1},"attestation_state":"computed","paper":{"title":"Non-Uniform Stochastic Average Gradient Method for Training Conditional Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.CO"],"primary_cat":"stat.ML","authors_text":"Aaron Defazio, Ann Clifton, Anoop Sarkar, Mark Schmidt, Mohamed Osama Ahmed, Reza Babanezhad","submitted_at":"2015-04-16T23:26:35Z","abstract_excerpt":"We apply stochastic average gradient (SAG) algorithms for training conditional random fields (CRFs). We describe a practical implementation that uses structure in the CRF gradient to reduce the memory requirement of this linearly-convergent stochastic gradient method, propose a non-uniform sampling scheme that substantially improves practical performance, and analyze the rate of convergence of the SAGA variant under non-uniform sampling. Our experimental results reveal that our method often significantly outperforms existing methods in terms of the training objective, and performs as well or b"},"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":"1504.04406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-16T23:26:35Z","cross_cats_sorted":["cs.LG","math.OC","stat.CO"],"title_canon_sha256":"cc3c481654f27690284e71ac15279b169b0a83e709059b26cd5201c67aa041f5","abstract_canon_sha256":"07f1a4d989f851eb4b915548c7e1587b6158fa178cd757acfa41bc5c92637003"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:32.467423Z","signature_b64":"ttWISJG5gaAfd5TQP0bM4rKeA2VXtrbmsr1UpaEIbf37BM5oT9KKVyNzG4HrjWO67E6VrLSD29myHlqriiEIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54d1b19ad56c482864c7c9665f61fd1f4ee1a450baefa78650ef9a2fc5355e45","last_reissued_at":"2026-05-18T02:18:32.466977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:32.466977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Uniform Stochastic Average Gradient Method for Training Conditional Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.CO"],"primary_cat":"stat.ML","authors_text":"Aaron Defazio, Ann Clifton, Anoop Sarkar, Mark Schmidt, Mohamed Osama Ahmed, Reza Babanezhad","submitted_at":"2015-04-16T23:26:35Z","abstract_excerpt":"We apply stochastic average gradient (SAG) algorithms for training conditional random fields (CRFs). We describe a practical implementation that uses structure in the CRF gradient to reduce the memory requirement of this linearly-convergent stochastic gradient method, propose a non-uniform sampling scheme that substantially improves practical performance, and analyze the rate of convergence of the SAGA variant under non-uniform sampling. Our experimental results reveal that our method often significantly outperforms existing methods in terms of the training objective, and performs as well or b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04406","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":"1504.04406","created_at":"2026-05-18T02:18:32.467046+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04406v1","created_at":"2026-05-18T02:18:32.467046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04406","created_at":"2026-05-18T02:18:32.467046+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTI3DGWVNREC","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTI3DGWVNRECQZGH","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTI3DGWV","created_at":"2026-05-18T12:29:29.992203+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/KTI3DGWVNRECQZGHZFTF6YP5D5","json":"https://pith.science/pith/KTI3DGWVNRECQZGHZFTF6YP5D5.json","graph_json":"https://pith.science/api/pith-number/KTI3DGWVNRECQZGHZFTF6YP5D5/graph.json","events_json":"https://pith.science/api/pith-number/KTI3DGWVNRECQZGHZFTF6YP5D5/events.json","paper":"https://pith.science/paper/KTI3DGWV"},"agent_actions":{"view_html":"https://pith.science/pith/KTI3DGWVNRECQZGHZFTF6YP5D5","download_json":"https://pith.science/pith/KTI3DGWVNRECQZGHZFTF6YP5D5.json","view_paper":"https://pith.science/paper/KTI3DGWV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04406&json=true","fetch_graph":"https://pith.science/api/pith-number/KTI3DGWVNRECQZGHZFTF6YP5D5/graph.json","fetch_events":"https://pith.science/api/pith-number/KTI3DGWVNRECQZGHZFTF6YP5D5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTI3DGWVNRECQZGHZFTF6YP5D5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTI3DGWVNRECQZGHZFTF6YP5D5/action/storage_attestation","attest_author":"https://pith.science/pith/KTI3DGWVNRECQZGHZFTF6YP5D5/action/author_attestation","sign_citation":"https://pith.science/pith/KTI3DGWVNRECQZGHZFTF6YP5D5/action/citation_signature","submit_replication":"https://pith.science/pith/KTI3DGWVNRECQZGHZFTF6YP5D5/action/replication_record"}},"created_at":"2026-05-18T02:18:32.467046+00:00","updated_at":"2026-05-18T02:18:32.467046+00:00"}