{"id":"W7133405170","doi":"","title":"Lexicographic Lipschitz Bandits:New Algorithms and a Lower Bound","year":2025,"lang":"en","type":"article","venue":"CityU Scholars","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China; City University of Hong Kong","keywords":"Lexicographical order; Regret; Upper and lower bounds; Lipschitz continuity; Dimension (graph theory); Matching (statistics)","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003663404,0.00174752,0.002239871,0.001210331,0.001137239,0.003304762,0.002625341,0.003622513,0.007462793],"category_scores_gemma":[0.01786356,0.001003609,0.001239524,0.002049498,0.002571231,0.005499525,0.003041601,0.006122175,0.001769019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002572191,"about_ca_system_score_gemma":0.002545004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002678812,"about_ca_topic_score_gemma":0.003950532,"domain_scores_codex":[0.9978696,0.0009177286,0.00009203365,0.0003167541,0.0005292334,0.0002745862],"domain_scores_gemma":[0.9907575,0.007498605,0.0004249508,0.0006523247,0.0004000734,0.0002665973],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005604285,0.0003116851,0.001327651,0.0004413931,0.00009913192,0.0001891922,0.00024929,0.5829117,0.002053131,0.2609564,0.01393254,0.1369675],"study_design_scores_gemma":[0.00005327704,0.00005421936,0.00007913999,0.00005803833,0.00001767277,0.00005298812,0.00002730978,0.9230223,0.0006936686,0.07365016,0.002278759,0.0000126339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01361173,0.002053377,0.9660071,0.001966345,0.0001924005,0.0001492006,0.0001852613,0.0008254523,0.01500918],"genre_scores_gemma":[0.2572672,0.002122777,0.7184041,0.001375742,0.000563055,0.0006796398,0.000559233,0.000683683,0.01834462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007462793,"threshold_uncertainty_score":0.02496552,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07882936778791948,"score_gpt":0.4231396116865803,"score_spread":0.3443102438986608,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}