On the Finite-Time Complexity and Practical Computation of Approximate Stationarity Concepts of Lipschitz Functions.
Lai TianKaiwen ZhouAnthony Man-Cho SoPublished in: ICML (2022)
Keyphrases
- computational complexity
- exact computation
- efficient computation
- non stationary
- hilbert space
- numerical integration
- linear combination of basis
- computational cost
- practical application
- databases
- pre computed
- continuous functions
- function classes
- real valued functions
- efficiently computing
- space complexity
- semantic network
- reinforcement learning