{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:N2DPRVAZLX67QNEGZKCXCWPTV5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fff29424c30f43a0970d7ce96e0cdf0d06dffbba76a5e38f8030c9a6c41c22a5","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-21T21:58:07Z","title_canon_sha256":"52eb4edbc0a4e0a6d60cb41a89e71ca279cef4d190a9e01e2e94ed1f0535dfae"},"schema_version":"1.0","source":{"id":"1910.09670","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.09670","created_at":"2026-07-05T01:22:14Z"},{"alias_kind":"arxiv_version","alias_value":"1910.09670v4","created_at":"2026-07-05T01:22:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.09670","created_at":"2026-07-05T01:22:14Z"},{"alias_kind":"pith_short_12","alias_value":"N2DPRVAZLX67","created_at":"2026-07-05T01:22:14Z"},{"alias_kind":"pith_short_16","alias_value":"N2DPRVAZLX67QNEG","created_at":"2026-07-05T01:22:14Z"},{"alias_kind":"pith_short_8","alias_value":"N2DPRVAZ","created_at":"2026-07-05T01:22:14Z"}],"graph_snapshots":[{"event_id":"sha256:6c7924e7567b55918f8d998a57f5b17cfc244694f9ce3f3cc9fc9cab3bf78b12","target":"graph","created_at":"2026-07-05T01:22:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1910.09670/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Variance-reduced algorithms, although achieve great theoretical performance, can run slowly in practice due to the periodic gradient estimation with a large batch of data. Batch-size adaptation thus arises as a promising approach to accelerate such algorithms. However, existing schemes either apply prescribed batch-size adaption rule or exploit the information along optimization path via additional backtracking and condition verification steps. In this paper, we propose a novel scheme, which eliminates backtracking line search but still exploits the information along optimization path by adapt","authors_text":"Bowen Weng, Kaiyi Ji, Wei Zhang, Yingbin Liang, Yi Zhou, Zhe Wang","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-21T21:58:07Z","title":"History-Gradient Aided Batch Size Adaptation for Variance Reduced Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.09670","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c49a405bc1452098275ac56a8029ddd14ba9eace9200d23bad0536895ae8b238","target":"record","created_at":"2026-07-05T01:22:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fff29424c30f43a0970d7ce96e0cdf0d06dffbba76a5e38f8030c9a6c41c22a5","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-21T21:58:07Z","title_canon_sha256":"52eb4edbc0a4e0a6d60cb41a89e71ca279cef4d190a9e01e2e94ed1f0535dfae"},"schema_version":"1.0","source":{"id":"1910.09670","kind":"arxiv","version":4}},"canonical_sha256":"6e86f8d4195dfdf83486ca857159f3af5b82eaf770f480171bc4c6b7f6051a7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e86f8d4195dfdf83486ca857159f3af5b82eaf770f480171bc4c6b7f6051a7d","first_computed_at":"2026-07-05T01:22:14.818294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:22:14.818294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2IzGrOu4duJFZnYj4DTbTxFqEXsJBx/acell2O1IlfTM+h3dM9R8I/L1Sn97LTMeD6QGyZRHgWEVHbR3GbB5CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:22:14.818806Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.09670","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c49a405bc1452098275ac56a8029ddd14ba9eace9200d23bad0536895ae8b238","sha256:6c7924e7567b55918f8d998a57f5b17cfc244694f9ce3f3cc9fc9cab3bf78b12"],"state_sha256":"43331b89df7a7a6874b5d6adae45e126f1a5a7783434917be2524aa32bfe8fb5"}