{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YUCRX5Z5JMHDJLO4RM4UQEOS32","short_pith_number":"pith:YUCRX5Z5","schema_version":"1.0","canonical_sha256":"c5051bf73d4b0e34addc8b394811d2de86363cb3292788675b999493d09c4d43","source":{"kind":"arxiv","id":"2410.16052","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Algorithm for Non-Stationary Kernelized Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Shion Takeno, Shogo Iwazaki","submitted_at":"2024-10-21T14:28:26Z","abstract_excerpt":"This paper studies a non-stationary kernelized bandit (KB) problem, also called time-varying Bayesian optimization, where one seeks to minimize the regret under an unknown reward function that varies over time. In particular, we focus on a near-optimal algorithm whose regret upper bound matches the regret lower bound. For this goal, we show the first algorithm-independent regret lower bound for non-stationary KB with squared exponential and Mat\\'ern kernels, which reveals that an existing optimization-based KB algorithm with slight modification is near-optimal. However, this existing algorithm"},"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":"2410.16052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-21T14:28:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c15a56f41ee14f4c7950fb623c0e3d52637cd5b2998504b1abfc7e3570dc0f99","abstract_canon_sha256":"541d4b2731e94d60ecc5893a3e493b211f242cc149528bcd453a94857052b38a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:28.580536Z","signature_b64":"pXZlWVw3izWI7jlDl7thRIv4D3Tw5734LmgF4f9tVyQpIA2Z3+/Z/2iVlNubtLYHdj8ohfVjT9HMGTFkQfQnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5051bf73d4b0e34addc8b394811d2de86363cb3292788675b999493d09c4d43","last_reissued_at":"2026-07-05T09:23:28.580069Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:28.580069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Algorithm for Non-Stationary Kernelized Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Shion Takeno, Shogo Iwazaki","submitted_at":"2024-10-21T14:28:26Z","abstract_excerpt":"This paper studies a non-stationary kernelized bandit (KB) problem, also called time-varying Bayesian optimization, where one seeks to minimize the regret under an unknown reward function that varies over time. In particular, we focus on a near-optimal algorithm whose regret upper bound matches the regret lower bound. For this goal, we show the first algorithm-independent regret lower bound for non-stationary KB with squared exponential and Mat\\'ern kernels, which reveals that an existing optimization-based KB algorithm with slight modification is near-optimal. However, this existing algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.16052","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.16052/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":"2410.16052","created_at":"2026-07-05T09:23:28.580125+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.16052v1","created_at":"2026-07-05T09:23:28.580125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.16052","created_at":"2026-07-05T09:23:28.580125+00:00"},{"alias_kind":"pith_short_12","alias_value":"YUCRX5Z5JMHD","created_at":"2026-07-05T09:23:28.580125+00:00"},{"alias_kind":"pith_short_16","alias_value":"YUCRX5Z5JMHDJLO4","created_at":"2026-07-05T09:23:28.580125+00:00"},{"alias_kind":"pith_short_8","alias_value":"YUCRX5Z5","created_at":"2026-07-05T09:23:28.580125+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.00108","citing_title":"Tracking Most Significant Shifts in Infinite-Armed Bandits","ref_index":2024,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YUCRX5Z5JMHDJLO4RM4UQEOS32","json":"https://pith.science/pith/YUCRX5Z5JMHDJLO4RM4UQEOS32.json","graph_json":"https://pith.science/api/pith-number/YUCRX5Z5JMHDJLO4RM4UQEOS32/graph.json","events_json":"https://pith.science/api/pith-number/YUCRX5Z5JMHDJLO4RM4UQEOS32/events.json","paper":"https://pith.science/paper/YUCRX5Z5"},"agent_actions":{"view_html":"https://pith.science/pith/YUCRX5Z5JMHDJLO4RM4UQEOS32","download_json":"https://pith.science/pith/YUCRX5Z5JMHDJLO4RM4UQEOS32.json","view_paper":"https://pith.science/paper/YUCRX5Z5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.16052&json=true","fetch_graph":"https://pith.science/api/pith-number/YUCRX5Z5JMHDJLO4RM4UQEOS32/graph.json","fetch_events":"https://pith.science/api/pith-number/YUCRX5Z5JMHDJLO4RM4UQEOS32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YUCRX5Z5JMHDJLO4RM4UQEOS32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YUCRX5Z5JMHDJLO4RM4UQEOS32/action/storage_attestation","attest_author":"https://pith.science/pith/YUCRX5Z5JMHDJLO4RM4UQEOS32/action/author_attestation","sign_citation":"https://pith.science/pith/YUCRX5Z5JMHDJLO4RM4UQEOS32/action/citation_signature","submit_replication":"https://pith.science/pith/YUCRX5Z5JMHDJLO4RM4UQEOS32/action/replication_record"}},"created_at":"2026-07-05T09:23:28.580125+00:00","updated_at":"2026-07-05T09:23:28.580125+00:00"}