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
July 1, 2023
June 26, 2023
June 12, 2023
May 24, 2023
April 25, 2023
March 28, 2023
March 8, 2023
February 20, 2023
February 13, 2023
January 23, 2023
December 29, 2022
November 23, 2022
October 27, 2022
September 30, 2022
September 27, 2022
September 24, 2022
August 25, 2022
June 19, 2022
June 13, 2022
June 9, 2022