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
October 21, 2024
October 17, 2024
October 8, 2024
October 4, 2024
October 2, 2024
September 27, 2024
September 24, 2024
August 21, 2024
August 14, 2024
August 13, 2024
July 23, 2024
July 17, 2024
July 8, 2024
July 2, 2024
June 25, 2024
May 31, 2024
May 19, 2024
May 12, 2024
April 17, 2024