{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IBOON75NXU35CHZHNVCJSICENA","short_pith_number":"pith:IBOON75N","schema_version":"1.0","canonical_sha256":"405ce6ffadbd37d11f276d449920446828560d01b951f46c8598b9f01d0b33aa","source":{"kind":"arxiv","id":"2604.28020","version":2},"attestation_state":"computed","paper":{"title":"Cost-Aware Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"By accounting for different sampling costs, cost-aware stochastic gradient descent reaches target accuracy at lower total cost and reduces token usage by up to 30 percent in LLM policy optimization.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amir Globerson, Clara Mohri, Haim Kaplan, Tomer Koren, Yishay Mansour","submitted_at":"2026-04-30T15:39:09Z","abstract_excerpt":"We consider the problem of Cost-Aware Learning, where sampling different components of a finite-sum objective incurs different costs. The objective is to reach a target error while minimizing the total cost. We propose Cost-Aware SGD, which uses a distribution based on gradient norms and costs to sample components. We provide a thorough analysis of this algorithm, including cost-improvement bounds over baselines, a characterization of distribution proxy sub-optimality, and a lower bound. We apply our theoretical insights to reinforcement learning with language models, where the computational c"},"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":"2604.28020","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-30T15:39:09Z","cross_cats_sorted":[],"title_canon_sha256":"ceb970895d645166143f06e611672c4dc852112665822d98373e8c5c76a46a20","abstract_canon_sha256":"e203bea884ca6872e40e862b8e31299cd16b3707afb0f879b35534da2de819c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:03:42.200805Z","signature_b64":"fWix5Lo5oUgZTQHYnEk1YYcNCAWvJ7n2AjBR2CFcxMouwtA2eZTzE+OMz/ySeF3GOA6SE3x5NBNhBM7AQ+1ODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"405ce6ffadbd37d11f276d449920446828560d01b951f46c8598b9f01d0b33aa","last_reissued_at":"2026-06-01T02:03:42.199752Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:03:42.199752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cost-Aware Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"By accounting for different sampling costs, cost-aware stochastic gradient descent reaches target accuracy at lower total cost and reduces token usage by up to 30 percent in LLM policy optimization.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amir Globerson, Clara Mohri, Haim Kaplan, Tomer Koren, Yishay Mansour","submitted_at":"2026-04-30T15:39:09Z","abstract_excerpt":"We consider the problem of Cost-Aware Learning, where sampling different components of a finite-sum objective incurs different costs. The objective is to reach a target error while minimizing the total cost. We propose Cost-Aware SGD, which uses a distribution based on gradient norms and costs to sample components. We provide a thorough analysis of this algorithm, including cost-improvement bounds over baselines, a characterization of distribution proxy sub-optimality, and a lower bound. We apply our theoretical insights to reinforcement learning with language models, where the computational c"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Empirical results on 1.5B and 8B LLMs demonstrate that our approach reduces the tokens used in policy optimization by up to about 30% while matching or exceeding baseline accuracy.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The per-component sampling costs are known in advance and can be used to set sampling probabilities without introducing bias that harms convergence; this is stated implicitly in the cost-aware SGD derivation and the GRPO adaptation.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Cost-aware SGD achieves target error with lower total sampling cost than standard methods, and Cost-Aware GRPO reduces token usage by up to 30% in LLM reinforcement learning while matching baseline performance.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"By accounting for different sampling costs, cost-aware stochastic gradient descent reaches target accuracy at lower total cost and reduces token usage by up to 30 percent in LLM policy optimization.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9490acccddeb05ab3d7e0e2d4accb8b6f60bc06438e4cfa77fbd02f8b118e23b"},"source":{"id":"2604.28020","kind":"arxiv","version":2},"verdict":{"id":"b34bcc42-13f1-456f-8a51-02a3738b6194","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T05:01:06.202809Z","strongest_claim":"Empirical results on 1.5B and 8B LLMs demonstrate that our approach reduces the tokens used in policy optimization by up to about 30% while matching or exceeding baseline accuracy.","one_line_summary":"Cost-aware SGD achieves target error with lower total sampling cost than standard methods, and Cost-Aware GRPO reduces token usage by up to 30% in LLM reinforcement learning while matching baseline performance.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The per-component sampling costs are known in advance and can be used to set sampling probabilities without introducing bias that harms convergence; this is stated implicitly in the cost-aware SGD derivation and the GRPO adaptation.","pith_extraction_headline":"By accounting for different sampling costs, cost-aware stochastic gradient descent reaches target accuracy at lower total cost and reduces token usage by up to 30 percent in LLM policy optimization."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.28020/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T20:42:12.032805Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:41:30.656157Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"2edd81f7537ba101f25a5110eb2e237f033fd9e99a20aa2e221961cb7c58f48f"},"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":"2604.28020","created_at":"2026-06-01T02:03:42.199901+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.28020v2","created_at":"2026-06-01T02:03:42.199901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.28020","created_at":"2026-06-01T02:03:42.199901+00:00"},{"alias_kind":"pith_short_12","alias_value":"IBOON75NXU35","created_at":"2026-06-01T02:03:42.199901+00:00"},{"alias_kind":"pith_short_16","alias_value":"IBOON75NXU35CHZH","created_at":"2026-06-01T02:03:42.199901+00:00"},{"alias_kind":"pith_short_8","alias_value":"IBOON75N","created_at":"2026-06-01T02:03:42.199901+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/IBOON75NXU35CHZHNVCJSICENA","json":"https://pith.science/pith/IBOON75NXU35CHZHNVCJSICENA.json","graph_json":"https://pith.science/api/pith-number/IBOON75NXU35CHZHNVCJSICENA/graph.json","events_json":"https://pith.science/api/pith-number/IBOON75NXU35CHZHNVCJSICENA/events.json","paper":"https://pith.science/paper/IBOON75N"},"agent_actions":{"view_html":"https://pith.science/pith/IBOON75NXU35CHZHNVCJSICENA","download_json":"https://pith.science/pith/IBOON75NXU35CHZHNVCJSICENA.json","view_paper":"https://pith.science/paper/IBOON75N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.28020&json=true","fetch_graph":"https://pith.science/api/pith-number/IBOON75NXU35CHZHNVCJSICENA/graph.json","fetch_events":"https://pith.science/api/pith-number/IBOON75NXU35CHZHNVCJSICENA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IBOON75NXU35CHZHNVCJSICENA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IBOON75NXU35CHZHNVCJSICENA/action/storage_attestation","attest_author":"https://pith.science/pith/IBOON75NXU35CHZHNVCJSICENA/action/author_attestation","sign_citation":"https://pith.science/pith/IBOON75NXU35CHZHNVCJSICENA/action/citation_signature","submit_replication":"https://pith.science/pith/IBOON75NXU35CHZHNVCJSICENA/action/replication_record"}},"created_at":"2026-06-01T02:03:42.199901+00:00","updated_at":"2026-06-01T02:03:42.199901+00:00"}