14 citations · 15 across the 14 of their papers we have counts for
Showing cs.LGShow all
3 papers · 1 filter
cs.LG2026
Policy Iteration Is Not Strongly Polynomial for Deterministic Markov Decision Processes: The Price of Algorithmic Anarchy
Han Zhong, Yinyu Ye
We establish exponential iteration lower bounds in the number of states for Howard's policy iteration on deterministic discounted and average-reward Markov decision processes (MDPs…
cs.LG2024
Online Linear Programming with Batching
Haoran Xu, Peter W. Glynn, Yinyu Ye
We study Online Linear Programming (OLP) with batching. The planning horizon is cut into batches, and decisions on orders can be delayed to the end of their associated batch. T…
cs.LG2024★ 1 cited
Adam-mini: Use Fewer Learning Rates To Gain More
Yushun Zhang, Congliang Chen, Ziniu Li +6
We propose Adam-mini, an optimizer that achieves on par or better performance than AdamW with 50% less memory footprint. Adam-mini reduces memory by cutting down the learning rate…