{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XUP6OOHX7LSVZTXOFLGP5UHDKN","short_pith_number":"pith:XUP6OOHX","schema_version":"1.0","canonical_sha256":"bd1fe738f7fae55cceee2accfed0e3535d2758687a06949cf146c56822d27d4f","source":{"kind":"arxiv","id":"1801.08436","version":1},"attestation_state":"computed","paper":{"title":"Dual Free Adaptive Minibatch SDCA for Empirical Risk Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Martin Takac, Rachael Tappenden, Xi He","submitted_at":"2018-01-25T15:00:29Z","abstract_excerpt":"In this paper we develop an adaptive dual free Stochastic Dual Coordinate Ascent (adfSDCA) algorithm for regularized empirical risk minimization problems. This is motivated by the recent work on dual free SDCA of Shalev-Shwartz (2016). The novelty of our approach is that the coordinates to update at each iteration are selected non-uniformly from an adaptive probability distribution, and this extends the previously mentioned work which only allowed for a uniform selection of \"dual\" coordinates from a fixed probability distribution.\n  We describe an efficient iterative procedure for generating t"},"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":"1801.08436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-25T15:00:29Z","cross_cats_sorted":[],"title_canon_sha256":"652282e5bb0efc2d93c4e48fc481a318e53b3be4ea849779aa97c28d5f479fd1","abstract_canon_sha256":"fbaf6ff7cc042d9f2f0fde033e2d64604a5288a2ad545d359090953b8f2e670d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:06.329016Z","signature_b64":"tSnB21TasVXi1QWrScPCnAJzEWsZag2v+xavp0XeTj8UkeHbFmpvBf36FHyBiTxXeWxI/FgsvvLrs9F7xIC6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd1fe738f7fae55cceee2accfed0e3535d2758687a06949cf146c56822d27d4f","last_reissued_at":"2026-05-18T00:25:06.328594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:06.328594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dual Free Adaptive Minibatch SDCA for Empirical Risk Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Martin Takac, Rachael Tappenden, Xi He","submitted_at":"2018-01-25T15:00:29Z","abstract_excerpt":"In this paper we develop an adaptive dual free Stochastic Dual Coordinate Ascent (adfSDCA) algorithm for regularized empirical risk minimization problems. This is motivated by the recent work on dual free SDCA of Shalev-Shwartz (2016). The novelty of our approach is that the coordinates to update at each iteration are selected non-uniformly from an adaptive probability distribution, and this extends the previously mentioned work which only allowed for a uniform selection of \"dual\" coordinates from a fixed probability distribution.\n  We describe an efficient iterative procedure for generating t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08436","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":"1801.08436","created_at":"2026-05-18T00:25:06.328675+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.08436v1","created_at":"2026-05-18T00:25:06.328675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08436","created_at":"2026-05-18T00:25:06.328675+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUP6OOHX7LSV","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUP6OOHX7LSVZTXO","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUP6OOHX","created_at":"2026-05-18T12:33:01.666342+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/XUP6OOHX7LSVZTXOFLGP5UHDKN","json":"https://pith.science/pith/XUP6OOHX7LSVZTXOFLGP5UHDKN.json","graph_json":"https://pith.science/api/pith-number/XUP6OOHX7LSVZTXOFLGP5UHDKN/graph.json","events_json":"https://pith.science/api/pith-number/XUP6OOHX7LSVZTXOFLGP5UHDKN/events.json","paper":"https://pith.science/paper/XUP6OOHX"},"agent_actions":{"view_html":"https://pith.science/pith/XUP6OOHX7LSVZTXOFLGP5UHDKN","download_json":"https://pith.science/pith/XUP6OOHX7LSVZTXOFLGP5UHDKN.json","view_paper":"https://pith.science/paper/XUP6OOHX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.08436&json=true","fetch_graph":"https://pith.science/api/pith-number/XUP6OOHX7LSVZTXOFLGP5UHDKN/graph.json","fetch_events":"https://pith.science/api/pith-number/XUP6OOHX7LSVZTXOFLGP5UHDKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUP6OOHX7LSVZTXOFLGP5UHDKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUP6OOHX7LSVZTXOFLGP5UHDKN/action/storage_attestation","attest_author":"https://pith.science/pith/XUP6OOHX7LSVZTXOFLGP5UHDKN/action/author_attestation","sign_citation":"https://pith.science/pith/XUP6OOHX7LSVZTXOFLGP5UHDKN/action/citation_signature","submit_replication":"https://pith.science/pith/XUP6OOHX7LSVZTXOFLGP5UHDKN/action/replication_record"}},"created_at":"2026-05-18T00:25:06.328675+00:00","updated_at":"2026-05-18T00:25:06.328675+00:00"}