Y
Yishay Mansour
Researcher at Tel Aviv University
Publications - 546
Citations - 30407
Yishay Mansour is an academic researcher from Tel Aviv University. The author has contributed to research in topics: Regret & Upper and lower bounds. The author has an hindex of 80, co-authored 511 publications receiving 26984 citations. Previous affiliations of Yishay Mansour include Technion – Israel Institute of Technology & IBM.
Papers
More filters
Proceedings Article
Online Stochastic Shortest Path with Bandit Feedback and Unknown Transition Function
Aviv Rosenberg,Yishay Mansour +1 more
TL;DR: This work develops no-regret algorithms that perform asymptotically as well as the best stationary policy in hindsight in episodic loop-free Markov decision processes (MDPs), where the loss function can change arbitrarily between episodes.
Proceedings Article
Action elimination and stopping conditions for reinforcement learning
TL;DR: A model-based and a model-free variants of the elimination method that derive stopping conditions that guarantee that the learned policy is approximately optimal with high probability and demonstrates a considerable speedup and added robustness.
Posted Content
Converting online algorithms to local computation algorithms
TL;DR: A general method for converting online algorithms to local computation algorithms, by selecting a random permutation of the input, and simulating running the online algorithm is proposed, which gives a local computation algorithm for maximal matching in graphs of bounded degree, which runs in time and space O(log3n).
Book ChapterDOI
From external to internal regret
Avrim Blum,Yishay Mansour +1 more
TL;DR: In this paper, the authors give a simple generic reduction that, given an algorithm for the external regret problem, converts it to an efficient online algorithm for internal regret, and derive a quantitative regret bound for a very general setting of regret, which includes an arbitrary set of modification rules (that possibly modify the online algorithm).
Journal ArticleDOI
Bandwidth Allocation with Preemption
TL;DR: It is shown that the ability to preempt (i.e., abort) connections while in service in order to schedule "more valuable" connections substantially improves the throughput of some networks.