BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Ming Yuan (Columbia University)
DTSTART:20201229T003000Z
DTEND:20201229T013000Z
DTSTAMP:20260423T024027Z
UID:iccm2020/95
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/iccm2020/95/
 ">Complexity of High Dimensional Sparse Functions</a>\nby Ming Yuan (Colum
 bia University) as part of ICCM 2020\n\n\nAbstract\nWe investigate optimal
  algorithms for estimating a general high dimensional smooth and sparse f
 unction from the perspective of information based complexity. Our algorit
 hms and analyses reveal several interesting characteristics for these tas
 ks. In particular\, our results illustrate the potential value of experime
 nt design for high dimensional problems.\n
LOCATION:https://researchseminars.org/talk/iccm2020/95/
END:VEVENT
END:VCALENDAR