{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RC3XJGELY5ELN4Y5UBCE72EJ2I","short_pith_number":"pith:RC3XJGEL","schema_version":"1.0","canonical_sha256":"88b774988bc748b6f31da0444fe889d20a143c4d269cb99c7abaf8a2ddee446e","source":{"kind":"arxiv","id":"1708.02544","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Optimization with Bandit Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Farnood Salehi, L. Elisa Celis, Patrick Thiran","submitted_at":"2017-08-08T16:15:26Z","abstract_excerpt":"Many stochastic optimization algorithms work by estimating the gradient of the cost function on the fly by sampling datapoints uniformly at random from a training set. However, the estimator might have a large variance, which inadvertently slows down the convergence rate of the algorithms. One way to reduce this variance is to sample the datapoints from a carefully selected non-uniform distribution. In this work, we propose a novel non-uniform sampling approach that uses the multi-armed bandit framework. Theoretically, we show that our algorithm asymptotically approximates the optimal variance"},"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":"1708.02544","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-08T16:15:26Z","cross_cats_sorted":["cs.AI","math.OC","stat.ML"],"title_canon_sha256":"826afbcf66cfef06a93fdba98a06239d1ff51da1105ab7f6e42dd2a82de8afce","abstract_canon_sha256":"3eb545f2d194b671a8817dbe9eacc6cc2110a109a911421e348ff853789baee8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:20.274865Z","signature_b64":"uidoQ4BMWOM4MVBEaJAc09/912vMTJrqj5uxWqPDk4J4tINQ0563WFf+Sy5b4AwZcv9Ay2NzV0u6PUMK3p+CDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88b774988bc748b6f31da0444fe889d20a143c4d269cb99c7abaf8a2ddee446e","last_reissued_at":"2026-05-18T00:38:20.274213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:20.274213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Optimization with Bandit Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Farnood Salehi, L. Elisa Celis, Patrick Thiran","submitted_at":"2017-08-08T16:15:26Z","abstract_excerpt":"Many stochastic optimization algorithms work by estimating the gradient of the cost function on the fly by sampling datapoints uniformly at random from a training set. However, the estimator might have a large variance, which inadvertently slows down the convergence rate of the algorithms. One way to reduce this variance is to sample the datapoints from a carefully selected non-uniform distribution. In this work, we propose a novel non-uniform sampling approach that uses the multi-armed bandit framework. Theoretically, we show that our algorithm asymptotically approximates the optimal variance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02544","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":""},"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":"1708.02544","created_at":"2026-05-18T00:38:20.274325+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.02544v2","created_at":"2026-05-18T00:38:20.274325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02544","created_at":"2026-05-18T00:38:20.274325+00:00"},{"alias_kind":"pith_short_12","alias_value":"RC3XJGELY5EL","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RC3XJGELY5ELN4Y5","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RC3XJGEL","created_at":"2026-05-18T12:31:39.905425+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/RC3XJGELY5ELN4Y5UBCE72EJ2I","json":"https://pith.science/pith/RC3XJGELY5ELN4Y5UBCE72EJ2I.json","graph_json":"https://pith.science/api/pith-number/RC3XJGELY5ELN4Y5UBCE72EJ2I/graph.json","events_json":"https://pith.science/api/pith-number/RC3XJGELY5ELN4Y5UBCE72EJ2I/events.json","paper":"https://pith.science/paper/RC3XJGEL"},"agent_actions":{"view_html":"https://pith.science/pith/RC3XJGELY5ELN4Y5UBCE72EJ2I","download_json":"https://pith.science/pith/RC3XJGELY5ELN4Y5UBCE72EJ2I.json","view_paper":"https://pith.science/paper/RC3XJGEL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.02544&json=true","fetch_graph":"https://pith.science/api/pith-number/RC3XJGELY5ELN4Y5UBCE72EJ2I/graph.json","fetch_events":"https://pith.science/api/pith-number/RC3XJGELY5ELN4Y5UBCE72EJ2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RC3XJGELY5ELN4Y5UBCE72EJ2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RC3XJGELY5ELN4Y5UBCE72EJ2I/action/storage_attestation","attest_author":"https://pith.science/pith/RC3XJGELY5ELN4Y5UBCE72EJ2I/action/author_attestation","sign_citation":"https://pith.science/pith/RC3XJGELY5ELN4Y5UBCE72EJ2I/action/citation_signature","submit_replication":"https://pith.science/pith/RC3XJGELY5ELN4Y5UBCE72EJ2I/action/replication_record"}},"created_at":"2026-05-18T00:38:20.274325+00:00","updated_at":"2026-05-18T00:38:20.274325+00:00"}