Function Approximation
Function approximation aims to represent complex, potentially high-dimensional functions using simpler, computationally tractable models. Current research emphasizes developing novel architectures, such as Kolmogorov-Arnold networks and those incorporating Chebyshev polynomials or path signatures, alongside improved algorithms like those based on optimism principles or two-timescale methods. These advancements are crucial for addressing challenges in diverse fields, including reinforcement learning, contextual bandits, and scientific machine learning, where accurate and efficient function representation is essential for effective modeling and prediction.
Papers
March 14, 2024
February 20, 2024
February 17, 2024
February 2, 2024
January 10, 2024
December 16, 2023
December 8, 2023
November 28, 2023
November 21, 2023
November 7, 2023
October 30, 2023
October 11, 2023
August 13, 2023
July 25, 2023
July 24, 2023
July 17, 2023