{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:X3TQMC3GPUE3IZABYWX2TN64XG","short_pith_number":"pith:X3TQMC3G","canonical_record":{"source":{"id":"1711.06424","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-17T06:21:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f7ae76dfc531d20dd7c8501d526faea24bbb909765d565751e099e227cc27902","abstract_canon_sha256":"ef3238c9b434435f6a849d050bed205dfa85f4b4802ecbd1e7fb807b0e48f881"},"schema_version":"1.0"},"canonical_sha256":"bee7060b667d09b46401c5afa9b7dcb9bcda80efee6234a3e77f559e1e0f0a4f","source":{"kind":"arxiv","id":"1711.06424","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06424","created_at":"2026-05-18T00:22:27Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06424v3","created_at":"2026-05-18T00:22:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06424","created_at":"2026-05-18T00:22:27Z"},{"alias_kind":"pith_short_12","alias_value":"X3TQMC3GPUE3","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X3TQMC3GPUE3IZAB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X3TQMC3G","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:X3TQMC3GPUE3IZABYWX2TN64XG","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06424","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-17T06:21:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f7ae76dfc531d20dd7c8501d526faea24bbb909765d565751e099e227cc27902","abstract_canon_sha256":"ef3238c9b434435f6a849d050bed205dfa85f4b4802ecbd1e7fb807b0e48f881"},"schema_version":"1.0"},"canonical_sha256":"bee7060b667d09b46401c5afa9b7dcb9bcda80efee6234a3e77f559e1e0f0a4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:27.316990Z","signature_b64":"fuu59viXlrY1UPZzCI4FyK3RSUBH9nEqtwzIbuW0vQmv3SWjLnin4Q9G7jpJNV/WREk9yx7yVS1tDE7i5w2vBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bee7060b667d09b46401c5afa9b7dcb9bcda80efee6234a3e77f559e1e0f0a4f","last_reissued_at":"2026-05-18T00:22:27.316272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:27.316272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06424","source_version":3,"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:22:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5a8wNfQlDKEFHvbT4N1Nck6eJnlocL7dEXXl9Lm8hRA0YzuRDM16EqQLcdTYbMhm35Y4qp3CwFKUjPXJjFn6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:04:03.612553Z"},"content_sha256":"a0fdbc27f74498d8f991ebb789c4597a9e30103fec2a654b881492f6cdc0d822","schema_version":"1.0","event_id":"sha256:a0fdbc27f74498d8f991ebb789c4597a9e30103fec2a654b881492f6cdc0d822"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:X3TQMC3GPUE3IZABYWX2TN64XG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Resizable Mini-batch Gradient Descent based on a Multi-Armed Bandit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Chang D. Yoo, Seong Jin Cho, Sunghun Kang","submitted_at":"2017-11-17T06:21:47Z","abstract_excerpt":"Determining the appropriate batch size for mini-batch gradient descent is always time consuming as it often relies on grid search. This paper considers a resizable mini-batch gradient descent (RMGD) algorithm based on a multi-armed bandit for achieving best performance in grid search by selecting an appropriate batch size at each epoch with a probability defined as a function of its previous success/failure. This probability encourages exploration of different batch size and then later exploitation of batch size with history of success. At each epoch, the RMGD samples a batch size from its pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06424","kind":"arxiv","version":3},"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:22:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5htV4BxN5l67hF4Lbp/gw8y8VEetinHjCW2QnLrlPG3+kA6RDcwhk4kWSt6KkJq4oYYxob9ZBsryF1vyxAVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:04:03.613241Z"},"content_sha256":"4768a3a61d4641cb057984bc0d90cabeb2918811ecbe9b894d6664a432ed8501","schema_version":"1.0","event_id":"sha256:4768a3a61d4641cb057984bc0d90cabeb2918811ecbe9b894d6664a432ed8501"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X3TQMC3GPUE3IZABYWX2TN64XG/bundle.json","state_url":"https://pith.science/pith/X3TQMC3GPUE3IZABYWX2TN64XG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X3TQMC3GPUE3IZABYWX2TN64XG/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-08T19:04:03Z","links":{"resolver":"https://pith.science/pith/X3TQMC3GPUE3IZABYWX2TN64XG","bundle":"https://pith.science/pith/X3TQMC3GPUE3IZABYWX2TN64XG/bundle.json","state":"https://pith.science/pith/X3TQMC3GPUE3IZABYWX2TN64XG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X3TQMC3GPUE3IZABYWX2TN64XG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:X3TQMC3GPUE3IZABYWX2TN64XG","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":"ef3238c9b434435f6a849d050bed205dfa85f4b4802ecbd1e7fb807b0e48f881","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-17T06:21:47Z","title_canon_sha256":"f7ae76dfc531d20dd7c8501d526faea24bbb909765d565751e099e227cc27902"},"schema_version":"1.0","source":{"id":"1711.06424","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06424","created_at":"2026-05-18T00:22:27Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06424v3","created_at":"2026-05-18T00:22:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06424","created_at":"2026-05-18T00:22:27Z"},{"alias_kind":"pith_short_12","alias_value":"X3TQMC3GPUE3","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X3TQMC3GPUE3IZAB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X3TQMC3G","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:4768a3a61d4641cb057984bc0d90cabeb2918811ecbe9b894d6664a432ed8501","target":"graph","created_at":"2026-05-18T00:22:27Z","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":"Determining the appropriate batch size for mini-batch gradient descent is always time consuming as it often relies on grid search. This paper considers a resizable mini-batch gradient descent (RMGD) algorithm based on a multi-armed bandit for achieving best performance in grid search by selecting an appropriate batch size at each epoch with a probability defined as a function of its previous success/failure. This probability encourages exploration of different batch size and then later exploitation of batch size with history of success. At each epoch, the RMGD samples a batch size from its pro","authors_text":"Chang D. Yoo, Seong Jin Cho, Sunghun Kang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-17T06:21:47Z","title":"A Resizable Mini-batch Gradient Descent based on a Multi-Armed Bandit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06424","kind":"arxiv","version":3},"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:a0fdbc27f74498d8f991ebb789c4597a9e30103fec2a654b881492f6cdc0d822","target":"record","created_at":"2026-05-18T00:22:27Z","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":"ef3238c9b434435f6a849d050bed205dfa85f4b4802ecbd1e7fb807b0e48f881","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-17T06:21:47Z","title_canon_sha256":"f7ae76dfc531d20dd7c8501d526faea24bbb909765d565751e099e227cc27902"},"schema_version":"1.0","source":{"id":"1711.06424","kind":"arxiv","version":3}},"canonical_sha256":"bee7060b667d09b46401c5afa9b7dcb9bcda80efee6234a3e77f559e1e0f0a4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bee7060b667d09b46401c5afa9b7dcb9bcda80efee6234a3e77f559e1e0f0a4f","first_computed_at":"2026-05-18T00:22:27.316272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:27.316272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fuu59viXlrY1UPZzCI4FyK3RSUBH9nEqtwzIbuW0vQmv3SWjLnin4Q9G7jpJNV/WREk9yx7yVS1tDE7i5w2vBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:27.316990Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06424","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0fdbc27f74498d8f991ebb789c4597a9e30103fec2a654b881492f6cdc0d822","sha256:4768a3a61d4641cb057984bc0d90cabeb2918811ecbe9b894d6664a432ed8501"],"state_sha256":"d9835ba48a49218f576d5265dfda3a3f76a933fa6952d66f32922f83683646c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ISWludIYYITwjteR7BFcUZKiafbVakqXj7EVp2cO/G7tXbUPm38OhqGjQ5Ys2Ke0xuMrnJojopMjn6di5GjyDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:04:03.617068Z","bundle_sha256":"1900694ddb5d6841142f5911d2c3afed44ed3519f8cde09121295fc6a18345f1"}}