157 citations · 713 across the 56 of their papers we have counts for
6 papers · 1 filter
On the Hardness of Inventory Management with Censored Demand Data
Gábor Lugosi, Mihalis G. Markakis, Gergely Neu
We consider a repeated newsvendor problem where the inventory manager has no prior information about the demand, and can access only censored/sales data. In analogy to multi-armed…
Collaborative Spatial Reuse in Wireless Networks via Selfish Multi-Armed Bandits
Francesc Wilhelmi, Cristina Cano, Gergely Neu +3
Next-generation wireless deployments are characterized by being dense and uncoordinated, which often leads to inefficient use of resources and poor performance. To solve this, we e…
A unified view of entropy-regularized Markov decision processes
Gergely Neu, Anders Jonsson, Vicenç Gómez
We propose a general framework for entropy-regularized average-reward reinforcement learning in Markov decision processes (MDPs). Our approach is based on extending the linear-prog…
Boltzmann Exploration Done Right
Nicolò Cesa-Bianchi, Claudio Gentile, Gábor Lugosi +1
Boltzmann exploration is a classic strategy for sequential decision-making under uncertainty, and is one of the most standard tools in Reinforcement Learning (RL). Despite its wide…
Algorithmic stability and hypothesis complexity
Tongliang Liu, Gábor Lugosi, Gergely Neu +1
We introduce a notion of algorithmic stability of learning algorithms---that we term \emph{argument stability}---that captures stability of the hypothesis output by the learning al…
Fast rates for online learning in Linearly Solvable Markov Decision Processes
Gergely Neu, Vicenç Gómez
We study the problem of online learning in a class of Markov decision processes known as linearly solvable MDPs. In the stationary version of this problem, a learner interacts with…