Planning in entropy-regularized Markov decision processes and games Paper • 2604.19695 • Published 2 days ago
On two ways to use determinantal point processes for Monte Carlo integration Paper • 2604.19698 • Published 2 days ago
Scale-free adaptive planning for deterministic dynamics & discounted rewards Paper • 2604.18312 • Published 3 days ago
Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier Paper • 2604.15242 • Published 7 days ago
Best of both worlds: Stochastic & adversarial best-arm identification Paper • 2604.14860 • Published 7 days ago
Blazing the trails before beating the path: Sample-efficient Monte-Carlo planning Paper • 2604.14974 • Published 7 days ago
The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Paper • 2604.16087 • Published 6 days ago
Adaptive multi-fidelity optimization with fast learning rates Paper • 2604.16239 • Published 6 days ago
Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model Paper • 2604.16111 • Published 6 days ago
Covariance-adapting algorithm for semi-bandits with application to sparse rewards Paper • 2604.13738 • Published 8 days ago
A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption Paper • 1810.00997 • Published Feb 23, 2019
Gaussian Process Optimization with Adaptive Sketching: Scalable and No Regret Paper • 1903.05594 • Published Aug 27, 2019
Compressing the Input for CNNs with the First-Order Scattering Transform Paper • 1809.10200 • Published Sep 27, 2018