Approximate Dynamic Programming
Approximate Dynamic Programming (ADP) tackles complex sequential decision-making problems by approximating optimal solutions to dynamic programming formulations. Current research emphasizes developing efficient algorithms, such as those incorporating neural networks (e.g., NeurADP) or leveraging problem structure (e.g., "freezing" slow states), to handle high-dimensional state and action spaces. These advancements are improving the applicability of ADP across diverse fields, including resource allocation, control systems, and even game playing and bug triage, by enabling more accurate and computationally tractable solutions to previously intractable problems.
Papers
September 10, 2024
July 31, 2024
June 2, 2024
May 24, 2024
May 23, 2024
November 21, 2023
October 5, 2023
May 19, 2023
April 27, 2023
March 22, 2023
February 27, 2023
January 3, 2023
December 15, 2022
December 2, 2022
November 2, 2022
October 27, 2022
April 27, 2022
March 11, 2022