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
June 2, 2022
May 12, 2022
April 22, 2022
March 8, 2022
March 5, 2022
March 2, 2022
February 8, 2022
December 2, 2021
November 23, 2021
November 12, 2021
July 30, 2020