{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YB5ZTOCVWS4YCZMNBNUJUR63QI","short_pith_number":"pith:YB5ZTOCV","schema_version":"1.0","canonical_sha256":"c07b99b855b4b981658d0b689a47db8202802b15b51fb175493b3b5c1f67ff7f","source":{"kind":"arxiv","id":"1512.07074","version":1},"attestation_state":"computed","paper":{"title":"Move from Perturbed scheme to exponential weighting average","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chunyang Xiao","submitted_at":"2015-12-22T13:18:17Z","abstract_excerpt":"In an online decision problem, one makes decisions often with a pool of decision sequence called experts but without knowledge of the future. After each step, one pays a cost based on the decision and observed rate. One reasonal goal would be to perform as well as the best expert in the pool. The modern and well-known way to attain this goal is the algorithm of exponential weighting. However, recently, another algorithm called follow the perturbed leader is developed and achieved about the same performance. In our work, we first show the properties shared in common by the two algorithms which "},"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":"1512.07074","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-22T13:18:17Z","cross_cats_sorted":[],"title_canon_sha256":"7b5afb160595f5c6de17e9eb9d8cf2410e40aaa22b589c074bc2422e850c2c4e","abstract_canon_sha256":"d89f3ea6b2318ae282f3c2d388f928b4847f3da5e1652e6473912a014abc39e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:52.962251Z","signature_b64":"dxoh7RetOQQf83yzVVkNNICE3MLkWjU3Pd4sMMu+SHI0oy+qYZIJofG+JDBsL4kIxD4mqwVwePBsqlI8Il1UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c07b99b855b4b981658d0b689a47db8202802b15b51fb175493b3b5c1f67ff7f","last_reissued_at":"2026-05-18T01:23:52.961487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:52.961487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Move from Perturbed scheme to exponential weighting average","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chunyang Xiao","submitted_at":"2015-12-22T13:18:17Z","abstract_excerpt":"In an online decision problem, one makes decisions often with a pool of decision sequence called experts but without knowledge of the future. After each step, one pays a cost based on the decision and observed rate. One reasonal goal would be to perform as well as the best expert in the pool. The modern and well-known way to attain this goal is the algorithm of exponential weighting. However, recently, another algorithm called follow the perturbed leader is developed and achieved about the same performance. In our work, we first show the properties shared in common by the two algorithms which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07074","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":""},"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":"1512.07074","created_at":"2026-05-18T01:23:52.961622+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.07074v1","created_at":"2026-05-18T01:23:52.961622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07074","created_at":"2026-05-18T01:23:52.961622+00:00"},{"alias_kind":"pith_short_12","alias_value":"YB5ZTOCVWS4Y","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YB5ZTOCVWS4YCZMN","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YB5ZTOCV","created_at":"2026-05-18T12:29:50.041715+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/YB5ZTOCVWS4YCZMNBNUJUR63QI","json":"https://pith.science/pith/YB5ZTOCVWS4YCZMNBNUJUR63QI.json","graph_json":"https://pith.science/api/pith-number/YB5ZTOCVWS4YCZMNBNUJUR63QI/graph.json","events_json":"https://pith.science/api/pith-number/YB5ZTOCVWS4YCZMNBNUJUR63QI/events.json","paper":"https://pith.science/paper/YB5ZTOCV"},"agent_actions":{"view_html":"https://pith.science/pith/YB5ZTOCVWS4YCZMNBNUJUR63QI","download_json":"https://pith.science/pith/YB5ZTOCVWS4YCZMNBNUJUR63QI.json","view_paper":"https://pith.science/paper/YB5ZTOCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.07074&json=true","fetch_graph":"https://pith.science/api/pith-number/YB5ZTOCVWS4YCZMNBNUJUR63QI/graph.json","fetch_events":"https://pith.science/api/pith-number/YB5ZTOCVWS4YCZMNBNUJUR63QI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YB5ZTOCVWS4YCZMNBNUJUR63QI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YB5ZTOCVWS4YCZMNBNUJUR63QI/action/storage_attestation","attest_author":"https://pith.science/pith/YB5ZTOCVWS4YCZMNBNUJUR63QI/action/author_attestation","sign_citation":"https://pith.science/pith/YB5ZTOCVWS4YCZMNBNUJUR63QI/action/citation_signature","submit_replication":"https://pith.science/pith/YB5ZTOCVWS4YCZMNBNUJUR63QI/action/replication_record"}},"created_at":"2026-05-18T01:23:52.961622+00:00","updated_at":"2026-05-18T01:23:52.961622+00:00"}