OpenAlex
PricingAboutJobs
Log inGet started
Work

Improved Regret Bounds of Bilinear Bandits using Action Space Analysis

HTML

Year: 2021
Type: conference-paper
Source: KAIST Institutional Repository (KAIST)
Authors: Kyoungseok Jang, Kwang-Sung Jun, Se-Young Yun, Wanmo Kang
Institutions: University of Arizona, Korea Advanced Institute of Science and Technology
Language: English

Topic: Advanced Bandit Algorithms Research
Subfield: Management Science and Operations Research
Field: Decision Sciences
Domain: Social Sciences
Keywords: regret bounds, upper and lower bounds, multi-armed bandits, low-rank matrix estimation, regret minimization

Open Access status: closed
OpenAlex ID: W3167579742
FWCI: 2.382
Cites: 28
Cited by: 18
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security