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

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

Journal: :Systems Engineering 2005
Edouard Kujawski

This communication focuses on a fundamental problem related to the recently introduced Reference-Dependent Regret Model (RDRM) [Kujawski, 2005] for deterministic multicriteria decision making. In [Kujawski, 2005] it was asserted that the RDRM model satisfies three properties. The first of these properties, referred to as the “independence of dominated alternatives”, seems to be an intuitive one...

Journal: :DEStech Transactions on Social Science, Education and Human Science 2017

1998
Wojtek Michalowski Ignacy Kaliszewski

The paper describes how the MCDM modelling framework can be extended to account for a notion of regret. The non-regrettable decisions are generated in accordance with a DM's regret attitude which is established through an analysis of the trade-o s. Decisional validity of a proposed modeling framework is illustrated with a simple example.

Journal: :journal of reproduction and infertility 0

introduction: regret after sterilization, not only requires an expensive surgical procedure for recanalization, but also can affect the couples’ inter and intra-relationships. whence, undergoing sterilization in sistan and baluchestan has the lowest rate compared to other provinces, the habitants’ regret after sterilization may further discourage other volunteers of the procedures. therefore, t...

2014
PENGCHENG YUAN

The assumption about travellers’ route choice behaviour has major influence on the traffic flow equilibrium analysis. Previous studies about the travellers’ route choice were mainly based on the expected utility maximization theory. However, with the gradually increasing knowledge about the uncertainty of the transportation system, the researchers have realized that there is much constraint in ...

2015
Richard Combes Mohammad Sadegh Talebi Alexandre Proutière Marc Lelarge

This paper investigates stochastic and adversarial combinatorial multi-armed bandit problems. In the stochastic setting under semi-bandit feedback, we derive a problem-specific regret lower bound, and discuss its scaling with the dimension of the decision space. We propose ESCB, an algorithm that efficiently exploits the structure of the problem and provide a finite-time analysis of its regret....

2017
Scott Yang Mehryar Mohri

We study online learning with the general notion of transductive regret, that is regret with modification rules applying to expert sequences (as opposed to single experts) that are representable by weighted finite-state transducers. We show how transductive regret generalizes existing notions of regret, including: (1) external regret; (2) internal regret; (3) swap regret; and (4) conditional sw...

2012
Susan Frelich Appleton Elizabeth Dillon Alexis Farris Elizabeth McDonald Caitlin McGarr

What is the legal significance of regret following a reproductive decision or outcome? In Gonzales v. Carhart, a Supreme Court majority offered one answer to this question, famously invoking the regret of some women for their past abortions as a reason to uphold a federal law criminalizing a particular abortion procedure. But Gonzales is not the first case to confront what I call “reproduction ...

2015
Jacob D. Abernethy Chansoo Lee Ambuj Tewari

We provide a new analysis framework for the adversarial multi-armed bandit problem. Using the notion of convex smoothing, we define a novel family of algorithms with minimax optimal regret guarantees. First, we show that regularization via the Tsallis entropy, which includes EXP3 as a special case, matches the O( √ NT ) minimax regret with a smaller constant factor. Second, we show that a wide ...

2017
Nicolò Cesa-Bianchi Pierre Gaillard Claudio Gentile Sébastien Gerchinovitz

We investigate contextual online learning with nonparametric (Lipschitz) comparison classes under different assumptions on losses and feedback information. For full information feedback and Lipschitz losses, we design the first explicit algorithm achieving the minimax regret rate (up to log factors). In a partial feedback model motivated by second-price auctions, we obtain algorithms for Lipsch...

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

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