منابع مشابه
Program Repair without Regret
We present a new and flexible approach to repair reactive programs with respect to a specification. The specification is given in linear-temporal logic. Like in previous approaches, we aim for a repaired program that satisfies the specification and is syntactically close to the faulty program. The novelty of our approach is that it produces a program that is also semantically close to the origi...
متن کاملRouting Without Regret
There has been substantial work developing simple, efficient regret-minimizing algorithms for a wide class of repeated decision-making problems including online routing. These are adaptive strategies an individual can use that give strong guarantees on performance even in adversarially-changing environments. There has also been substantial work on analyzing properties of Nash equilibria in rout...
متن کاملBi-Level Online Control without Regret
This paper considers a bi-level discrete-time control framework with real-time constraints, consisting of several local controllers and a central controller. The objective is to bridge the gap between the online convex optimization and real-time control literature by proposing an online control algorithm with small dynamic regret, which is a natural performance criterion in nonstationary enviro...
متن کاملAbstraction without regret in data management systems
ion without regret in data management systems Christoph Koch, EPFL DATA Lab [email protected] 1. MOTIVATING ABSTRACTION The long-term impact of any research community depends on the timelessness and power of the ideas, concepts, and techniques developed by it. Research that fails to be sufficiently original and that does not create deep insight is likely not to have – and arguably does not...
متن کاملRegret Minimization in MDPs with Options without Prior Knowledge
Motivations I “Flat” RL : difficult to learn complex behaviours (eg, sequence of subgoals) ⇒ Humans abstract from low-level actions I Hierarchical RL : decompose large problems into smaller ones by imposing constraints on value function or policy I Possible implementation: options [Sutton et al., 1999] I Empirical observations: introducing options in an MDP can speed up learning but can also be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2016
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-016-0268-z