题目：Sparse Grid Meets Random Hashing: Learning High Dimensional Functions of Few Variables
报告人：Professor Ming YUAN（美国哥伦比亚大学）
We investigate the optimal sample complexity of recovering a general high dimensional smooth and sparse function based on point queries. Our result provides a precise characterization of the potential loss in information when restricting to point queries as opposed to the more general linear queries., as well as the benefit of adaption. In addition, we also developed a general framework for function approximation to mitigate the curse of dimensionality that can also be easily adapted to incorporate further structure such as lower order interactions, leading to sample complexities better than those obtained earlier in the literature.
Copyright © 2018 同济大学数学科学学院 版权所有.