{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BQ4SFMVO7BYG7CM4UWQREFXG7Q","short_pith_number":"pith:BQ4SFMVO","schema_version":"1.0","canonical_sha256":"0c3922b2aef8706f899ca5a11216e6fc35872e14d233355b940e856733b54eb0","source":{"kind":"arxiv","id":"2506.23303","version":1},"attestation_state":"computed","paper":{"title":"On the boundedness of the sequence generated by minibatch stochastic gradient descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.OC","authors_text":"Heinz H. Bauschke, Tran Thanh Tung","submitted_at":"2025-06-29T15:47:10Z","abstract_excerpt":"Stochastic Gradient Descent (SGD) with Polyak's stepsize has recently gained renewed attention in stochastic optimization. Recently, Orvieto, Lacoste-Julien, and Loizou introduced a decreasing variant of Polyak's stepsize, where convergence relies on a boundedness assumption of the iterates. They established that this assumption holds under strong convexity. In this paper, we extend their result by proving that boundedness also holds for a broader class of objective functions, including coercive functions. We also present a case in which boundedness may or may not hold."},"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":"2506.23303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-29T15:47:10Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"a710b9a3a8ddeea865ab0b31b1cc2303b4ab48a32dd77a67e45a0d73c4b9770c","abstract_canon_sha256":"368bed5ddc6e5e18156eae341778e92cabe3e755212292635203f220a1198281"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:19.459903Z","signature_b64":"/mqqpMFOZ7UtHO5crPe2ysrHNj9+Z0sxwzlZYDBVits2J4bk55MnIjDV5DWiAdY8NgdZVWTbQfPkuic20bbKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c3922b2aef8706f899ca5a11216e6fc35872e14d233355b940e856733b54eb0","last_reissued_at":"2026-07-05T11:29:19.459436Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:19.459436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the boundedness of the sequence generated by minibatch stochastic gradient descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.OC","authors_text":"Heinz H. Bauschke, Tran Thanh Tung","submitted_at":"2025-06-29T15:47:10Z","abstract_excerpt":"Stochastic Gradient Descent (SGD) with Polyak's stepsize has recently gained renewed attention in stochastic optimization. Recently, Orvieto, Lacoste-Julien, and Loizou introduced a decreasing variant of Polyak's stepsize, where convergence relies on a boundedness assumption of the iterates. They established that this assumption holds under strong convexity. In this paper, we extend their result by proving that boundedness also holds for a broader class of objective functions, including coercive functions. We also present a case in which boundedness may or may not hold."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23303","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.23303/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.23303","created_at":"2026-07-05T11:29:19.459494+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.23303v1","created_at":"2026-07-05T11:29:19.459494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23303","created_at":"2026-07-05T11:29:19.459494+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQ4SFMVO7BYG","created_at":"2026-07-05T11:29:19.459494+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQ4SFMVO7BYG7CM4","created_at":"2026-07-05T11:29:19.459494+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQ4SFMVO","created_at":"2026-07-05T11:29:19.459494+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/BQ4SFMVO7BYG7CM4UWQREFXG7Q","json":"https://pith.science/pith/BQ4SFMVO7BYG7CM4UWQREFXG7Q.json","graph_json":"https://pith.science/api/pith-number/BQ4SFMVO7BYG7CM4UWQREFXG7Q/graph.json","events_json":"https://pith.science/api/pith-number/BQ4SFMVO7BYG7CM4UWQREFXG7Q/events.json","paper":"https://pith.science/paper/BQ4SFMVO"},"agent_actions":{"view_html":"https://pith.science/pith/BQ4SFMVO7BYG7CM4UWQREFXG7Q","download_json":"https://pith.science/pith/BQ4SFMVO7BYG7CM4UWQREFXG7Q.json","view_paper":"https://pith.science/paper/BQ4SFMVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.23303&json=true","fetch_graph":"https://pith.science/api/pith-number/BQ4SFMVO7BYG7CM4UWQREFXG7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/BQ4SFMVO7BYG7CM4UWQREFXG7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQ4SFMVO7BYG7CM4UWQREFXG7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQ4SFMVO7BYG7CM4UWQREFXG7Q/action/storage_attestation","attest_author":"https://pith.science/pith/BQ4SFMVO7BYG7CM4UWQREFXG7Q/action/author_attestation","sign_citation":"https://pith.science/pith/BQ4SFMVO7BYG7CM4UWQREFXG7Q/action/citation_signature","submit_replication":"https://pith.science/pith/BQ4SFMVO7BYG7CM4UWQREFXG7Q/action/replication_record"}},"created_at":"2026-07-05T11:29:19.459494+00:00","updated_at":"2026-07-05T11:29:19.459494+00:00"}