OpenAlex
PricingAboutJobs
Log inGet started
Work

Optimal Stragies and Minimax Lower Bounds for Online Convex Games.

HTML

Year: 2008
Type: conference-paper
Source: Conference on Learning Theory
Authors: Jacob Abernethy, Peter L. Bartlett, Alexander Rakhlin, Ambuj Tewari
Institutions: University of California, Berkeley, Toyota Technological Institute at Chicago
Language: English

Topic: Advanced Bandit Algorithms Research
Subfield: Management Science and Operations Research
Field: Decision Sciences
Domain: Social Sciences
Keywords: minimax lower bounds, optimal strategies, online learning, regret minimization, zero-sum games

Open Access status: closed
OpenAlex ID: W3022520632
FWCI: 6.797
Cites:
Cited by: 58
Related to: 10
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
Supporters
Legal
Privacy
Accessibility
Terms