{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/variance-aware-regret-bounds-for-stochastic","title":"Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits","arxiv_id":"2310.00968","date":"2023-10-02","proceeding":null,"authors":["Qiwei Di","Tao Jin","Yue Wu","Heyang Zhao","Farzad Farnoud","Quanquan Gu"],"abstract":"Dueling bandits is a prominent framework for decision-making involving preferential feedback, a valuable feature that fits various applications involving human interaction, such as ranking, information retrieval, and recommendation systems. While substantial efforts have been made to minimize the cumulative regret in dueling bandits, a notable gap in the current research is the absence of regret bounds that account for the inherent uncertainty in pairwise comparisons between the dueling arms. Intuitively, greater uncertainty suggests a higher level of difficulty in the problem. To bridge this gap, this paper studies the problem of contextual dueling bandits, where the binary comparison of dueling arms is generated from a generalized linear model (GLM). We propose a new SupLinUCB-type algorithm that enjoys computational efficiency and a variance-aware regret bound $\\tilde O\\big(d\\sqrt{\\sum_{t=1}^T\\sigma_t^2} + d\\big)$, where $\\sigma_t$ is the variance of the pairwise comparison in round $t$, $d$ is the dimension of the context vectors, and $T$ is the time horizon. Our regret bound naturally aligns with the intuitive expectation in scenarios where the comparison is deterministic, the algorithm only suffers from an $\\tilde O(d)$ regret. We perform empirical experiments on synthetic data to confirm the advantage of our method over previous variance-agnostic algorithms.","url_abs":"https://arxiv.org/abs/2310.00968v2","url_pdf":"https://arxiv.org/pdf/2310.00968v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"variance-aware-regret-bounds-for-stochastic","repo_url":"https://github.com/uclaml/vacdb","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"},{"task_slug":"decision-making","task_name":"Decision Making"},{"task_slug":"information-retrieval","task_name":"Information Retrieval"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2310.00968","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00968"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/uclaml/vacdb","reach":null}],"summary":{"unverified":5},"by_repo_kind":{"official":{"samples":5,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":5,"samples":[{"code_sha256_prefix":"8776a8468ab70423","entry":"AdaCDB","repo":"uclaml/vacdb","repo_kind":"official","path":"suplin.py","file_url":"https://github.com/uclaml/vacdb/blob/HEAD/suplin.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"8776a8468ab70423"}},{"code_sha256_prefix":"ce6e22d8b92a4164","entry":"GLMDB","repo":"uclaml/vacdb","repo_kind":"official","path":"suplin.py","file_url":"https://github.com/uclaml/vacdb/blob/HEAD/suplin.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"ce6e22d8b92a4164"}},{"code_sha256_prefix":"f49bc75dd7329285","entry":"LCDB","repo":"uclaml/vacdb","repo_kind":"official","path":"suplin.py","file_url":"https://github.com/uclaml/vacdb/blob/HEAD/suplin.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"f49bc75dd7329285"}},{"code_sha256_prefix":"5108a33a1af84671","entry":"Model","repo":"uclaml/vacdb","repo_kind":"official","path":"suplin.py","file_url":"https://github.com/uclaml/vacdb/blob/HEAD/suplin.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"5108a33a1af84671"}},{"code_sha256_prefix":"d2853ce0280fcd7c","entry":"VACDB","repo":"uclaml/vacdb","repo_kind":"official","path":"suplin.py","file_url":"https://github.com/uclaml/vacdb/blob/HEAD/suplin.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"d2853ce0280fcd7c"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}