{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5U5VRI6OG7LRH2HLIVIMQR6V3E","short_pith_number":"pith:5U5VRI6O","schema_version":"1.0","canonical_sha256":"ed3b58a3ce37d713e8eb4550c847d5d933590d01b181b5d8c2d24c3557f3dd73","source":{"kind":"arxiv","id":"2505.02688","version":2},"attestation_state":"computed","paper":{"title":"Batch Sample-wise Stochastic Optimal Control via Stochastic Maximum Principle","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Feng Bao, Hui Sun","submitted_at":"2025-05-05T14:35:44Z","abstract_excerpt":"In this work, we study the stochastic optimal control problem (SOC) mainly from the probabilistic view point, i.e. via the Stochastic Maximum principle (SMP) \\cite{Peng4}. We adopt the sample-wise backpropagation scheme proposed in \\cite{Hui1} to solve the SOC problem under the strong convexity assumption. Importantly, in the Stochastic Gradient Descent (SGD) procedure, we use batch samples with higher order scheme in the forward SDE to improve the convergence rate in \\cite{Hui1} from $\\sim \\mathcal{O}(\\sqrt{\\frac{N}{K} + \\frac{1}{N}})$ to $\\sim \\mathcal{O}(\\sqrt{\\frac{1}{K} + \\frac{1}{N^2}})$"},"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":"2505.02688","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-05T14:35:44Z","cross_cats_sorted":[],"title_canon_sha256":"b5cd12acfddd8cec45a3375fe8bd8699e49e3e599440ce50b18539d3a4d9b7e1","abstract_canon_sha256":"a0f2c8d881b0783abba806b52eb1407c257842d603ba894177142eaf399ea465"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:46.075057Z","signature_b64":"ebw8cY4XRMEQM9Zofdp4jHYzVIvzY9NZA/kmdulLhMllWWa9/3Bw1lrOg1U01IOQWosbB6zzb5U+4cGRxQtdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed3b58a3ce37d713e8eb4550c847d5d933590d01b181b5d8c2d24c3557f3dd73","last_reissued_at":"2026-07-05T11:21:46.074524Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:46.074524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Batch Sample-wise Stochastic Optimal Control via Stochastic Maximum Principle","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Feng Bao, Hui Sun","submitted_at":"2025-05-05T14:35:44Z","abstract_excerpt":"In this work, we study the stochastic optimal control problem (SOC) mainly from the probabilistic view point, i.e. via the Stochastic Maximum principle (SMP) \\cite{Peng4}. We adopt the sample-wise backpropagation scheme proposed in \\cite{Hui1} to solve the SOC problem under the strong convexity assumption. Importantly, in the Stochastic Gradient Descent (SGD) procedure, we use batch samples with higher order scheme in the forward SDE to improve the convergence rate in \\cite{Hui1} from $\\sim \\mathcal{O}(\\sqrt{\\frac{N}{K} + \\frac{1}{N}})$ to $\\sim \\mathcal{O}(\\sqrt{\\frac{1}{K} + \\frac{1}{N^2}})$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.02688","kind":"arxiv","version":2},"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/2505.02688/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":"2505.02688","created_at":"2026-07-05T11:21:46.074581+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.02688v2","created_at":"2026-07-05T11:21:46.074581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.02688","created_at":"2026-07-05T11:21:46.074581+00:00"},{"alias_kind":"pith_short_12","alias_value":"5U5VRI6OG7LR","created_at":"2026-07-05T11:21:46.074581+00:00"},{"alias_kind":"pith_short_16","alias_value":"5U5VRI6OG7LRH2HL","created_at":"2026-07-05T11:21:46.074581+00:00"},{"alias_kind":"pith_short_8","alias_value":"5U5VRI6O","created_at":"2026-07-05T11:21:46.074581+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.06675","citing_title":"An Effective Particle Gradient Projection Method for Solving Stochastic and Mean Field Control Problem","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5U5VRI6OG7LRH2HLIVIMQR6V3E","json":"https://pith.science/pith/5U5VRI6OG7LRH2HLIVIMQR6V3E.json","graph_json":"https://pith.science/api/pith-number/5U5VRI6OG7LRH2HLIVIMQR6V3E/graph.json","events_json":"https://pith.science/api/pith-number/5U5VRI6OG7LRH2HLIVIMQR6V3E/events.json","paper":"https://pith.science/paper/5U5VRI6O"},"agent_actions":{"view_html":"https://pith.science/pith/5U5VRI6OG7LRH2HLIVIMQR6V3E","download_json":"https://pith.science/pith/5U5VRI6OG7LRH2HLIVIMQR6V3E.json","view_paper":"https://pith.science/paper/5U5VRI6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.02688&json=true","fetch_graph":"https://pith.science/api/pith-number/5U5VRI6OG7LRH2HLIVIMQR6V3E/graph.json","fetch_events":"https://pith.science/api/pith-number/5U5VRI6OG7LRH2HLIVIMQR6V3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5U5VRI6OG7LRH2HLIVIMQR6V3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5U5VRI6OG7LRH2HLIVIMQR6V3E/action/storage_attestation","attest_author":"https://pith.science/pith/5U5VRI6OG7LRH2HLIVIMQR6V3E/action/author_attestation","sign_citation":"https://pith.science/pith/5U5VRI6OG7LRH2HLIVIMQR6V3E/action/citation_signature","submit_replication":"https://pith.science/pith/5U5VRI6OG7LRH2HLIVIMQR6V3E/action/replication_record"}},"created_at":"2026-07-05T11:21:46.074581+00:00","updated_at":"2026-07-05T11:21:46.074581+00:00"}