Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of BonnDE1.5k papers
- University of OxfordGB1.5k papers
- Lawrence Berkeley National LaboratoryUS1.5k papers
- Michigan State UniversityUS1.5k papers
- Stony Brook UniversityUS1.5k papers
- University of WuppertalDE1.5k papers
- The Ohio State UniversityUS1.5k papers
- Centre National de la Recherche ScientifiqueFR1.5k papers
- Stockholm UniversitySE1.4k papers
- Johannes Gutenberg University MainzDE1.4k papers
- Uppsala UniversitySE1.4k papers
- University of ManchesterGB1.4k papers
4 papers · 2 filters
Learning Representations by Stochastic Meta-Gradient Descent in Neural Networks
Vivek Veeriah, Shangtong Zhang, Richard S. Sutton
Representations are fundamental to artificial intelligence. The performance of a learning system depends on the type of representation used for representing the data. Typically, th…
(Bandit) Convex Optimization with Biased Noisy Gradient Oracles
Xiaowei Hu, Prashanth L. A., András György +1
Algorithms for bandit convex optimization and online learning often rely on constructing noisy gradient estimates, which are then used in appropriately adjusted first-order algorit…
Thompson Sampling is Asymptotically Optimal in General Environments
Jan Leike, Tor Lattimore, Laurent Orseau +1
We discuss a variant of Thompson sampling for nonparametric reinforcement learning in a countable classes of general stochastic environments. These environments can be non-Markov,…
On the Reducibility of Submodular Functions
Jincheng Mei, Hao Zhang, Bao-Liang Lu
The scalability of submodular optimization methods is critical for their usability in practice. In this paper, we study the reducibility of submodular functions, a property that en…