649 citations
- Carnegie Mellon UniversityUS23 papers
- Stanford UniversityUS20 papers
- Google (United States)US14 papers
- Georgia Institute of TechnologyUS13 papers
- Tel Aviv UniversityIL12 papers
- Cornell UniversityUS11 papers
- University of California, BerkeleyUS11 papers
- University College LondonGB10 papers
- Harvard University PressUS9 papers
- Johns Hopkins UniversityUS9 papers
- Massachusetts Institute of TechnologyUS9 papers
- The University of Texas at AustinUS9 papers
Showing 2026Show all
3 papers · 1 filter
stat.ML2026★ 6 cited
A single algorithm for both restless and rested rotting bandits
Julien Seznec, Pierre Ménard, Alessandro Lazaric +1
In many application domains (e.g., recommender systems, intelligent tutoring systems), the rewards associated to the actions tend to decrease over time. This decay is either caused…
cs.LG2026★ 9 cited
Improved large-scale graph learning through ridge spectral sparsification
Daniele Calandriello, Ioannis Koutis, Alessandro Lazaric +1
Graph-based techniques and spectral graph theory have enriched the field of machine learning with a variety of critical advances. A central object in the analysis is the graph Lapl…
cs.LG2026★ 8 cited
Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model
Jean Tarbouriech, Matteo Pirotta, Michal Valko +1
We study the sample complexity of learning an -optimal policy in the Stochastic Shortest Path (SSP) problem. We first derive sample complexity bounds when the learner has access…