{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DUKSUCWHCG3253XWU5HESBKAJD","short_pith_number":"pith:DUKSUCWH","schema_version":"1.0","canonical_sha256":"1d152a0ac711b7aeeef6a74e49054048ff36cbf58bc64eb9ae7e5d809d5c9866","source":{"kind":"arxiv","id":"1901.02470","version":2},"attestation_state":"computed","paper":{"title":"Bilinear Bandits with Low-rank Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Kwang-Sung Jun, Rebecca Willett, Robert Nowak, Stephen Wright","submitted_at":"2019-01-08T19:03:48Z","abstract_excerpt":"We introduce the bilinear bandit problem with low-rank structure in which an action takes the form of a pair of arms from two different entity types, and the reward is a bilinear function of the known feature vectors of the arms. The unknown in the problem is a $d_1$ by $d_2$ matrix $\\mathbf{\\Theta}^*$ that defines the reward, and has low rank $r \\ll \\min\\{d_1,d_2\\}$. Determination of $\\mathbf{\\Theta}^*$ with this low-rank structure poses a significant challenge in finding the right exploration-exploitation tradeoff. In this work, we propose a new two-stage algorithm called \"Explore-Subspace-T"},"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":"1901.02470","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-08T19:03:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"34f6a25223713737e1a23a23a4735cb86c98fba8c69b4ea90de3887cd1ab194d","abstract_canon_sha256":"b0a4f572e06134b9a1d46160d05da185ecad1db7b1b412733d3033e4527c34f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:50.140554Z","signature_b64":"Q7c49uRddvMzs3vN5/9LvWCos9dPMrcmoxsqpp9Dsl31hq8dWgNNiJ8lJSBaG93Hxv0nCyBrxWcFbu8l3huADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d152a0ac711b7aeeef6a74e49054048ff36cbf58bc64eb9ae7e5d809d5c9866","last_reissued_at":"2026-05-17T23:43:50.139889Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:50.139889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bilinear Bandits with Low-rank Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Kwang-Sung Jun, Rebecca Willett, Robert Nowak, Stephen Wright","submitted_at":"2019-01-08T19:03:48Z","abstract_excerpt":"We introduce the bilinear bandit problem with low-rank structure in which an action takes the form of a pair of arms from two different entity types, and the reward is a bilinear function of the known feature vectors of the arms. The unknown in the problem is a $d_1$ by $d_2$ matrix $\\mathbf{\\Theta}^*$ that defines the reward, and has low rank $r \\ll \\min\\{d_1,d_2\\}$. Determination of $\\mathbf{\\Theta}^*$ with this low-rank structure poses a significant challenge in finding the right exploration-exploitation tradeoff. In this work, we propose a new two-stage algorithm called \"Explore-Subspace-T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02470","kind":"arxiv","version":2},"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":"1901.02470","created_at":"2026-05-17T23:43:50.139987+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.02470v2","created_at":"2026-05-17T23:43:50.139987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02470","created_at":"2026-05-17T23:43:50.139987+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUKSUCWHCG32","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUKSUCWHCG3253XW","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUKSUCWH","created_at":"2026-05-18T12:33:15.570797+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/DUKSUCWHCG3253XWU5HESBKAJD","json":"https://pith.science/pith/DUKSUCWHCG3253XWU5HESBKAJD.json","graph_json":"https://pith.science/api/pith-number/DUKSUCWHCG3253XWU5HESBKAJD/graph.json","events_json":"https://pith.science/api/pith-number/DUKSUCWHCG3253XWU5HESBKAJD/events.json","paper":"https://pith.science/paper/DUKSUCWH"},"agent_actions":{"view_html":"https://pith.science/pith/DUKSUCWHCG3253XWU5HESBKAJD","download_json":"https://pith.science/pith/DUKSUCWHCG3253XWU5HESBKAJD.json","view_paper":"https://pith.science/paper/DUKSUCWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.02470&json=true","fetch_graph":"https://pith.science/api/pith-number/DUKSUCWHCG3253XWU5HESBKAJD/graph.json","fetch_events":"https://pith.science/api/pith-number/DUKSUCWHCG3253XWU5HESBKAJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUKSUCWHCG3253XWU5HESBKAJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUKSUCWHCG3253XWU5HESBKAJD/action/storage_attestation","attest_author":"https://pith.science/pith/DUKSUCWHCG3253XWU5HESBKAJD/action/author_attestation","sign_citation":"https://pith.science/pith/DUKSUCWHCG3253XWU5HESBKAJD/action/citation_signature","submit_replication":"https://pith.science/pith/DUKSUCWHCG3253XWU5HESBKAJD/action/replication_record"}},"created_at":"2026-05-17T23:43:50.139987+00:00","updated_at":"2026-05-17T23:43:50.139987+00:00"}