نتایج جستجو برای: regret analysis

تعداد نتایج: 2828405  

Journal: :Journal of Machine Learning Research 2005
Avrim Blum Yishay Mansour

External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares the loss of an online algorithm to the loss of a modified online algorithm, which consistently replaces one action by another. In this paper we give a simple generic reduction that, given an algorithm for the external ...

Journal: :Preventive medicine 2009
Karen L Ziarnowski Noel T Brewer Bethany Weber

OBJECTIVE The study examined the role of anticipated regret in human papillomavirus (HPV) vaccination decisions as well as potential antecedents of anticipated regret. METHOD In 2007, we interviewed 889 caregivers for girls aged 10-18 in areas of North Carolina with high rates of cervical cancer. The survey assessed vaccination regret (anticipated regret if daughter became more sexually activ...

Journal: :Proceedings of the ... AAAI Conference on Artificial Intelligence 2021

The connection between games and no-regret algorithms has been widely studied in the literature. A fundamental result is that when all players play strategies, this produces a sequence of actions whose time-average coarse-correlated equilibrium game. However, much less known about selection case multiple equilibria exist. In work, we study convergence bidding auctions. Besides being theoretical...

Journal: :CoRR 2017
Lijun Zhang Tianbao Yang Rong Jin Zhi-Hua Zhou

To cope with changing environments, recent developments in online learning have introduced the concepts of adaptive regret and dynamic regret independently. In this paper, we illustrate an intrinsic connection between these two concepts by showing that the dynamic regret can be expressed in terms of the adaptive regret and the functional variation. This observation implies that strongly adaptiv...

2015
Andrew Mastin Patrick Jaillet Sang Chin

The minmax regret problem for combinatorial optimization under uncertainty can be viewed as a zero-sum game played between an optimizing player and an adversary, where the optimizing player selects a solution and the adversary selects costs with the intention of maximizing the regret of the player. Existing minmax regret models consider only deterministic solutions/strategies, and minmax regret...

2017
Zhanrui Liao Yongqiang Wang

Human-robot collaboration (HRC) systems integrate the strengths of both humans and robots to improve the joint system performance. In this thesis, we focus on social human-robot interaction (sHRI) factors and in particular regret and trust. Humans experience regret during decision-making under uncertainty when they feel that a better result could be obtained if chosen differently. A framework t...

Journal: :Journal of environmental management 2011
L Cui L R Chen Y P Li G H Huang W Li Y L Xie

In this study, an interval-based regret-analysis (IBRA) model is developed for supporting long-term planning of municipal solid waste (MSW) management activities in the City of Changchun, the capital of Jilin Province, China. The developed IBRA model incorporates approaches of interval-parameter programming (IPP) and minimax-regret (MMR) analysis within an integer programming framework, such th...

Journal: :The New England journal of medicine 2017
Ameet Sarpatwari Niteesh K Choudhry

n engl j med 377;16 nejm.org October 19, 2017 treatment and overestimate its likelihood for success, paving the way for later regret if the outcome is poor. Patients who choose elective procedures while in a hot state and end up with a bad outcome may be at particular risk for regret due to commission bias. Some researchers believe that the relationship of regret to either action or inertia mus...

2015
Xu Li Zhi-Jin Hou Yin Jia

Article history: Received 18 September 2014 Available online 22 October 2014 This study investigated the influence of social comparison on career choice certainty and its potential mechanisms: regret as a mediator and vocational identity as a moderator. Before the formal experiment, 30 pairs of vocational values representing typical conflicts in career decisionmaking for Chinese university stud...

2007
Jean-Yves Audibert Rémi Munos Csaba Szepesvári

Algorithms based on upper-confidence bounds for balancing exploration and exploitation are gaining popularity since they are easy to implement, efficient and effective. This paper considers a variant of the basic algorithm for the stochastic, multi-armed bandit problem that takes into account the empirical variance of the different arms. In earlier experimental works, such algorithms were found...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید