{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AAMLUYXYBIZULIVGBEK3K76EWD","short_pith_number":"pith:AAMLUYXY","schema_version":"1.0","canonical_sha256":"0018ba62f80a3345a2a60915b57fc4b0dd21aa97787a6e03b6d0b04e4d53cba4","source":{"kind":"arxiv","id":"1312.0232","version":4},"attestation_state":"computed","paper":{"title":"Stochastic continuum armed bandit problem of few linear parameters in high dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Bernd G\\\"artner, Hemant Tyagi, Sebastian Stich","submitted_at":"2013-12-01T15:16:25Z","abstract_excerpt":"We consider a stochastic continuum armed bandit problem where the arms are indexed by the $\\ell_2$ ball $B_{d}(1+\\nu)$ of radius $1+\\nu$ in $\\mathbb{R}^d$. The reward functions $r :B_{d}(1+\\nu) \\rightarrow \\mathbb{R}$ are considered to intrinsically depend on $k \\ll d$ unknown linear parameters so that $r(\\mathbf{x}) = g(\\mathbf{A} \\mathbf{x})$ where $\\mathbf{A}$ is a full rank $k \\times d$ matrix. Assuming the mean reward function to be smooth we make use of results from low-rank matrix recovery literature and derive an efficient randomized algorithm which achieves a regret bound of $O(C(k,d)"},"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":"1312.0232","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-01T15:16:25Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"9ee9c94e26c602d3e00f33a9d84cdcb6bd3c2b46a6c6d23c6bb9df2e11109822","abstract_canon_sha256":"3eb43d1a91dae971cb5a81c62ce2f6b7215adf2944c0205f839f5cca51c3c558"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:31.015543Z","signature_b64":"5jxRcKthjgmYgcEKdFfz5mwrkD0CkfXY7dMPdLazOLaaBHmMSOg+OyzJ3G1PDGH2C+o52QlY3dJHkyoz+cSUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0018ba62f80a3345a2a60915b57fc4b0dd21aa97787a6e03b6d0b04e4d53cba4","last_reissued_at":"2026-05-18T00:43:31.014981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:31.014981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic continuum armed bandit problem of few linear parameters in high dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Bernd G\\\"artner, Hemant Tyagi, Sebastian Stich","submitted_at":"2013-12-01T15:16:25Z","abstract_excerpt":"We consider a stochastic continuum armed bandit problem where the arms are indexed by the $\\ell_2$ ball $B_{d}(1+\\nu)$ of radius $1+\\nu$ in $\\mathbb{R}^d$. The reward functions $r :B_{d}(1+\\nu) \\rightarrow \\mathbb{R}$ are considered to intrinsically depend on $k \\ll d$ unknown linear parameters so that $r(\\mathbf{x}) = g(\\mathbf{A} \\mathbf{x})$ where $\\mathbf{A}$ is a full rank $k \\times d$ matrix. Assuming the mean reward function to be smooth we make use of results from low-rank matrix recovery literature and derive an efficient randomized algorithm which achieves a regret bound of $O(C(k,d)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0232","kind":"arxiv","version":4},"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":"1312.0232","created_at":"2026-05-18T00:43:31.015051+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0232v4","created_at":"2026-05-18T00:43:31.015051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0232","created_at":"2026-05-18T00:43:31.015051+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAMLUYXYBIZU","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAMLUYXYBIZULIVG","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAMLUYXY","created_at":"2026-05-18T12:27:38.830355+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/AAMLUYXYBIZULIVGBEK3K76EWD","json":"https://pith.science/pith/AAMLUYXYBIZULIVGBEK3K76EWD.json","graph_json":"https://pith.science/api/pith-number/AAMLUYXYBIZULIVGBEK3K76EWD/graph.json","events_json":"https://pith.science/api/pith-number/AAMLUYXYBIZULIVGBEK3K76EWD/events.json","paper":"https://pith.science/paper/AAMLUYXY"},"agent_actions":{"view_html":"https://pith.science/pith/AAMLUYXYBIZULIVGBEK3K76EWD","download_json":"https://pith.science/pith/AAMLUYXYBIZULIVGBEK3K76EWD.json","view_paper":"https://pith.science/paper/AAMLUYXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0232&json=true","fetch_graph":"https://pith.science/api/pith-number/AAMLUYXYBIZULIVGBEK3K76EWD/graph.json","fetch_events":"https://pith.science/api/pith-number/AAMLUYXYBIZULIVGBEK3K76EWD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAMLUYXYBIZULIVGBEK3K76EWD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAMLUYXYBIZULIVGBEK3K76EWD/action/storage_attestation","attest_author":"https://pith.science/pith/AAMLUYXYBIZULIVGBEK3K76EWD/action/author_attestation","sign_citation":"https://pith.science/pith/AAMLUYXYBIZULIVGBEK3K76EWD/action/citation_signature","submit_replication":"https://pith.science/pith/AAMLUYXYBIZULIVGBEK3K76EWD/action/replication_record"}},"created_at":"2026-05-18T00:43:31.015051+00:00","updated_at":"2026-05-18T00:43:31.015051+00:00"}