نتایج جستجو برای: optimistic
تعداد نتایج: 8057 فیلتر نتایج به سال:
Abstract This paper proposes a new family of algorithms for the online optimisation composite objectives. The can be interpreted as combination exponentiated gradient and p -norm algorithm. Combined with algorithmic ideas adaptivity optimism, proposed achieve sequence-dependent regret upper bound, matching best-known bounds sparse target decision variables. Furthermore, have efficient implement...
Recounts the career and contributions of Jim Meindl.
Temporal difference (TD) learning and its variants, such as multistage TD (MS-TD) temporal coherence (TC) learning, have been successfully applied to 2048. These methods rely on the stochasticity of environment 2048 for exploration. In this paper, we propose employ optimistic initialization (OI) encourage exploration 2048, empirically show that quality is significantly improved. This approach o...
We consider the extension of non-monotonic preference logic with the distinction between controllable (or endogenous) and uncontrollable (or exogenous) variables, which can be used for example in agent decision making and deliberation. We assume that the agent is optimistic about its own controllables and pessimistic about its uncontrollables, and we study ways to merge these two distinct dimen...
Backgroung and Objectives: The relationship between optimistic view in life and health variables has been confirmed in many studies. In the majority of researches, the relationship was studied in non-clinical populations. Given the few researches in clinical groups, this study was carried out aiming at evaluating the correlation between the optimistic views and general health in a group of card...
| A formula for the optimistic capacity of arbitrary channels is established. It is shown to equal the supremum, over all input processes, of the inputoutput zero-sup-information rate. A general expression for optimistic "-capacity is also provided. I. Overview The conventional de nition of channel capacity C [1] requires the existence of reliable block codes for all su ciently large blocklengt...
Subgroup discovery is the task of finding subgroups of a population which exhibit both distributional unusualness and high generality. Due to the non monotonicity of the corresponding evaluation functions, standard pruning techniques cannot be used for subgroup discovery, requiring the use of optimistic estimate techniques instead. So far, however, optimistic estimate pruning has only been cons...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید