{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5NLATAN5TCF5DURNNDDM3R3RLX","short_pith_number":"pith:5NLATAN5","schema_version":"1.0","canonical_sha256":"eb560981bd988bd1d22d68c6cdc7715dfc1858198e413c7da2b63ed63c57f1c1","source":{"kind":"arxiv","id":"1804.00335","version":1},"attestation_state":"computed","paper":{"title":"Online learning with graph-structured feedback against adaptive adversaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Po-Ling Loh, Zhili Feng","submitted_at":"2018-04-01T19:56:10Z","abstract_excerpt":"We derive upper and lower bounds for the policy regret of $T$-round online learning problems with graph-structured feedback, where the adversary is nonoblivious but assumed to have a bounded memory. We obtain upper bounds of $\\widetilde O(T^{2/3})$ and $\\widetilde O(T^{3/4})$ for strongly-observable and weakly-observable graphs, respectively, based on analyzing a variant of the Exp3 algorithm. When the adversary is allowed a bounded memory of size 1, we show that a matching lower bound of $\\widetilde\\Omega(T^{2/3})$ is achieved in the case of full-information feedback. We also study the partic"},"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":"1804.00335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-01T19:56:10Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"5c5f5f5b52b4815bc0a5b188ac29604c783293a6025d9dc9400009e7cf7f1d19","abstract_canon_sha256":"8ce60dc7fdc4e634debe2c8487d0ffba2202f6e5c94ba5e786e93f3ac11add7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:37.590749Z","signature_b64":"0x34z8dXtra3Vzh2phFlzsmqeR1tnd3xKVxcZyjoTcFyhO9UyT8Lmt+VfTPWbGYLgvZlwzXSEHturdtm1vMADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb560981bd988bd1d22d68c6cdc7715dfc1858198e413c7da2b63ed63c57f1c1","last_reissued_at":"2026-05-18T00:19:37.590039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:37.590039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online learning with graph-structured feedback against adaptive adversaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Po-Ling Loh, Zhili Feng","submitted_at":"2018-04-01T19:56:10Z","abstract_excerpt":"We derive upper and lower bounds for the policy regret of $T$-round online learning problems with graph-structured feedback, where the adversary is nonoblivious but assumed to have a bounded memory. We obtain upper bounds of $\\widetilde O(T^{2/3})$ and $\\widetilde O(T^{3/4})$ for strongly-observable and weakly-observable graphs, respectively, based on analyzing a variant of the Exp3 algorithm. When the adversary is allowed a bounded memory of size 1, we show that a matching lower bound of $\\widetilde\\Omega(T^{2/3})$ is achieved in the case of full-information feedback. We also study the partic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00335","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":"1804.00335","created_at":"2026-05-18T00:19:37.590145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00335v1","created_at":"2026-05-18T00:19:37.590145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00335","created_at":"2026-05-18T00:19:37.590145+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NLATAN5TCF5","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NLATAN5TCF5DURN","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NLATAN5","created_at":"2026-05-18T12:32:08.215937+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/5NLATAN5TCF5DURNNDDM3R3RLX","json":"https://pith.science/pith/5NLATAN5TCF5DURNNDDM3R3RLX.json","graph_json":"https://pith.science/api/pith-number/5NLATAN5TCF5DURNNDDM3R3RLX/graph.json","events_json":"https://pith.science/api/pith-number/5NLATAN5TCF5DURNNDDM3R3RLX/events.json","paper":"https://pith.science/paper/5NLATAN5"},"agent_actions":{"view_html":"https://pith.science/pith/5NLATAN5TCF5DURNNDDM3R3RLX","download_json":"https://pith.science/pith/5NLATAN5TCF5DURNNDDM3R3RLX.json","view_paper":"https://pith.science/paper/5NLATAN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00335&json=true","fetch_graph":"https://pith.science/api/pith-number/5NLATAN5TCF5DURNNDDM3R3RLX/graph.json","fetch_events":"https://pith.science/api/pith-number/5NLATAN5TCF5DURNNDDM3R3RLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NLATAN5TCF5DURNNDDM3R3RLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NLATAN5TCF5DURNNDDM3R3RLX/action/storage_attestation","attest_author":"https://pith.science/pith/5NLATAN5TCF5DURNNDDM3R3RLX/action/author_attestation","sign_citation":"https://pith.science/pith/5NLATAN5TCF5DURNNDDM3R3RLX/action/citation_signature","submit_replication":"https://pith.science/pith/5NLATAN5TCF5DURNNDDM3R3RLX/action/replication_record"}},"created_at":"2026-05-18T00:19:37.590145+00:00","updated_at":"2026-05-18T00:19:37.590145+00:00"}