{"payload":{"header_redesign_enabled":false,"results":[{"id":"463901943","archived":false,"color":"#3572A5","followers":0,"has_funding_file":false,"hl_name":"yinglunz/Near-Instance-Optimal-Model-Selection-for-Pure-Exploration-Linear-Bandits","hl_trunc_description":"Code for AISTATS 2022 paper - Near Instance Optimal Model Selection for Pure Exploration Linear Bandits","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":463901943,"name":"Near-Instance-Optimal-Model-Selection-for-Pure-Exploration-Linear-Bandits","owner_id":33591538,"owner_login":"yinglunz","updated_at":"2022-02-26T18:17:13.475Z","has_issues":true}},"sponsorable":false,"topics":[],"type":"Public","help_wanted_issues_count":0,"good_first_issue_issues_count":0,"starred_by_current_user":false}],"type":"repositories","page":1,"page_count":1,"elapsed_millis":62,"errors":[],"result_count":1,"facets":[],"protected_org_logins":[],"topics":null,"query_id":"","logged_in":false,"sign_up_path":"/signup?source=code_search_results","sign_in_path":"/login?return_to=https%3A%2F%2Fgithub.com%2Fsearch%3Fq%3Drepo%253Ayinglunz%252FNear-Instance-Optimal-Model-Selection-for-Pure-Exploration-Linear-Bandits%2B%2Blanguage%253APython","metadata":null,"csrf_tokens":{"/yinglunz/Near-Instance-Optimal-Model-Selection-for-Pure-Exploration-Linear-Bandits/star":{"post":"rjZVz1W_ydzb6uTsHxplySVeIAMcP1WufGZR_ovOGVOYOzYP6I4e4wcmFZ_E-AHYFUiFAlEZ3sQPqJ1v14MF-Q"},"/yinglunz/Near-Instance-Optimal-Model-Selection-for-Pure-Exploration-Linear-Bandits/unstar":{"post":"7spZFKeqiJ1Odn7-9KLxrfyaiAzZKSYfEVtoqSPme1yfmEh-TddZc1PMgYnZ6Eodkufo9qEgrceTZDZTUX_puQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"L5i0_HZCy_MXhhMAF0VPVS3bUCM1jUbFJwLllcVoLw6bu9b0YSv75Dd74BHi80lULW2lQMWWMGQveaz7tyNKlw"}}},"title":"Repository search results"}