BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Sparse Recovery in Linear Spans and Convex Hulls of Infinite Dicti
 onaries -  Vladimir Koltchinskii (Georgia Tech)
DTSTART:20100603T160000Z
DTEND:20100603T170000Z
UID:TALK24461@talks.cam.ac.uk
CONTACT:8047
DESCRIPTION:We will discuss problems of recovery of "sparse" approximation
 s of a\ntarget function in\nlinear spans or convex hulls of given infinite
  (not necessarily\ncountable) dictionaries\nbased on noisy observations of
  this function at random points. The\nmethod is based on\npenalized empiri
 cal risk minimization with $L_1$-penalty in the case\nof linear spans and\
 nwith entropy penalty in the case of convex hulls. A number of problems\ni
 n Statistics and\nin Machine Learning can be studied in this framework and
  many results\nof the theory of\nsparse recovery for finite dictionaries\,
  including sparsity oracle\ninequalities\, can\nbe extended to the case of
  infinite dictionaries.\n\nhttp://www.math.gatech.edu/users/vlad
LOCATION:MR12\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR