{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UVZ32IURSJ7NOGUEM4WM5FEJWA","short_pith_number":"pith:UVZ32IUR","canonical_record":{"source":{"id":"1711.01761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-06T07:52:34Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"2c41aaea28117557a765b4eed1b7dbeaf168b03a3b617c6ffd296ba1eb4b8792","abstract_canon_sha256":"06ffd02a67e7fa3be8294d5805af83a7468a11bca066d710ea9da3848f116c79"},"schema_version":"1.0"},"canonical_sha256":"a573bd2291927ed71a84672cce9489b00a9d590734d71cdfc6214bb0a0775429","source":{"kind":"arxiv","id":"1711.01761","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01761","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01761v1","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01761","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"pith_short_12","alias_value":"UVZ32IURSJ7N","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UVZ32IURSJ7NOGUE","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UVZ32IUR","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UVZ32IURSJ7NOGUEM4WM5FEJWA","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-06T07:52:34Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"2c41aaea28117557a765b4eed1b7dbeaf168b03a3b617c6ffd296ba1eb4b8792","abstract_canon_sha256":"06ffd02a67e7fa3be8294d5805af83a7468a11bca066d710ea9da3848f116c79"},"schema_version":"1.0"},"canonical_sha256":"a573bd2291927ed71a84672cce9489b00a9d590734d71cdfc6214bb0a0775429","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:16.919241Z","signature_b64":"5SKAktoPfg4o6vPh+Iicmb7JMyjJQd6Gj2utQ5pESfLlBw944YLzh5F5J7aCrVqAvpbStNdDe9YwgLUppLUNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a573bd2291927ed71a84672cce9489b00a9d590734d71cdfc6214bb0a0775429","last_reissued_at":"2026-05-18T00:31:16.918851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:16.918851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01761","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:31:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3pkpUNHL6uhh/ZLgcd6RJl7cVNsKGPtEe5szCz0eTMNiDTSR3Xsy9VSmbRbZLIIe3aDQjF4oe8yXYrLrLC2ADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:46:14.008586Z"},"content_sha256":"eb7f224c4630d4dfe20fe59662ebfabe445d668d7fb8f54654137e4fcc1fccdb","schema_version":"1.0","event_id":"sha256:eb7f224c4630d4dfe20fe59662ebfabe445d668d7fb8f54654137e4fcc1fccdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UVZ32IURSJ7NOGUEM4WM5FEJWA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"AdaBatch: Efficient Gradient Aggregation Rules for Sequential and Parallel Stochastic Gradient Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandre D\\'efossez (FAIR), Francis Bach (SIERRA)","submitted_at":"2017-11-06T07:52:34Z","abstract_excerpt":"We study a new aggregation operator for gradients coming from a mini-batch for stochastic gradient (SG) methods that allows a significant speed-up in the case of sparse optimization problems. We call this method AdaBatch and it only requires a few lines of code change compared to regular mini-batch SGD algorithms. We provide a theoretical insight to understand how this new class of algorithms is performing and show that it is equivalent to an implicit per-coordinate rescaling of the gradients, similarly to what Adagrad methods can do. In theory and in practice, this new aggregation allows to k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01761","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:31:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K8fVkak22J7+tayocBSz5/U7UnyGUS1srUH2CCOBCvoShHH3pm18fPbgB4PPD/AOjpijtuiRQzwUBUjrLeEJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:46:14.009224Z"},"content_sha256":"f4cd7615c5b8c5dd4e9d85818d0e770da6f9ccaa128dba388e0e52245929efb1","schema_version":"1.0","event_id":"sha256:f4cd7615c5b8c5dd4e9d85818d0e770da6f9ccaa128dba388e0e52245929efb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVZ32IURSJ7NOGUEM4WM5FEJWA/bundle.json","state_url":"https://pith.science/pith/UVZ32IURSJ7NOGUEM4WM5FEJWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVZ32IURSJ7NOGUEM4WM5FEJWA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T02:46:14Z","links":{"resolver":"https://pith.science/pith/UVZ32IURSJ7NOGUEM4WM5FEJWA","bundle":"https://pith.science/pith/UVZ32IURSJ7NOGUEM4WM5FEJWA/bundle.json","state":"https://pith.science/pith/UVZ32IURSJ7NOGUEM4WM5FEJWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVZ32IURSJ7NOGUEM4WM5FEJWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UVZ32IURSJ7NOGUEM4WM5FEJWA","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":"06ffd02a67e7fa3be8294d5805af83a7468a11bca066d710ea9da3848f116c79","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-06T07:52:34Z","title_canon_sha256":"2c41aaea28117557a765b4eed1b7dbeaf168b03a3b617c6ffd296ba1eb4b8792"},"schema_version":"1.0","source":{"id":"1711.01761","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01761","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01761v1","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01761","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"pith_short_12","alias_value":"UVZ32IURSJ7N","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UVZ32IURSJ7NOGUE","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UVZ32IUR","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:f4cd7615c5b8c5dd4e9d85818d0e770da6f9ccaa128dba388e0e52245929efb1","target":"graph","created_at":"2026-05-18T00:31:16Z","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"},"paper":{"abstract_excerpt":"We study a new aggregation operator for gradients coming from a mini-batch for stochastic gradient (SG) methods that allows a significant speed-up in the case of sparse optimization problems. We call this method AdaBatch and it only requires a few lines of code change compared to regular mini-batch SGD algorithms. We provide a theoretical insight to understand how this new class of algorithms is performing and show that it is equivalent to an implicit per-coordinate rescaling of the gradients, similarly to what Adagrad methods can do. In theory and in practice, this new aggregation allows to k","authors_text":"Alexandre D\\'efossez (FAIR), Francis Bach (SIERRA)","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-06T07:52:34Z","title":"AdaBatch: Efficient Gradient Aggregation Rules for Sequential and Parallel Stochastic Gradient Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01761","kind":"arxiv","version":1},"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:eb7f224c4630d4dfe20fe59662ebfabe445d668d7fb8f54654137e4fcc1fccdb","target":"record","created_at":"2026-05-18T00:31:16Z","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":"06ffd02a67e7fa3be8294d5805af83a7468a11bca066d710ea9da3848f116c79","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-06T07:52:34Z","title_canon_sha256":"2c41aaea28117557a765b4eed1b7dbeaf168b03a3b617c6ffd296ba1eb4b8792"},"schema_version":"1.0","source":{"id":"1711.01761","kind":"arxiv","version":1}},"canonical_sha256":"a573bd2291927ed71a84672cce9489b00a9d590734d71cdfc6214bb0a0775429","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a573bd2291927ed71a84672cce9489b00a9d590734d71cdfc6214bb0a0775429","first_computed_at":"2026-05-18T00:31:16.918851Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:16.918851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5SKAktoPfg4o6vPh+Iicmb7JMyjJQd6Gj2utQ5pESfLlBw944YLzh5F5J7aCrVqAvpbStNdDe9YwgLUppLUNCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:16.919241Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01761","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb7f224c4630d4dfe20fe59662ebfabe445d668d7fb8f54654137e4fcc1fccdb","sha256:f4cd7615c5b8c5dd4e9d85818d0e770da6f9ccaa128dba388e0e52245929efb1"],"state_sha256":"f8249174119fc0163ba8c263b77e6c8913145742a4b271f013f33b13808bbd05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TgKm73mrRBIc4NIiEVUVYCU+3ChWgbmjpNmVRNbZZlyK9WMPEI//OqUMcoUNAi/jpnjQrDC7toz6j3uOOfTFCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:46:14.013553Z","bundle_sha256":"68869930a71ebb9ceed3c29dc3eace6d7d4dedc68c92fe75773122cd27225a90"}}