Regret Minimization with Noisy Observations
Abstract
Index Terms
- Regret Minimization with Noisy Observations
Recommendations
Risk minimization, regret minimization and progressive hedging algorithms
AbstractThis paper begins with a study on the dual representations of risk and regret measures and their impact on modeling multistage decision making under uncertainty. A relationship between risk envelopes and regret envelopes is established by using ...
Interactive regret minimization
SIGMOD '12: Proceedings of the 2012 ACM SIGMOD International Conference on Management of DataWe study the notion of regret ratio proposed in [19] Nanongkai et al. [VLDB10] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] Nanongkai et al. was shown to have features of both skyline ...
Regret to the best vs. regret to the average
We study online regret minimization algorithms in an experts setting. In this setting, the algorithm chooses a distribution over experts at each time step and receives a gain that is a weighted average of the experts' instantaneous gains. We consider a ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/9a22127e-eb2f-4989-89d9-e5ce9bdce6b1/3580507.cover.jpg)
- Chair:
- Kevin Leyton-Brown,
- Program Chair:
- Jason D Hartline,
- Program Co-chair:
- Larry Samuelson
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Extended-abstract
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 19Total Downloads
- Downloads (Last 12 months)19
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in