Mon, January 16, 2017
Public Access Category: All |
|||||||||||||||||||||
|
- Time:
- 3:30pm-5:00pm
- Location:
- Room 114
- Description:
- Title: Jannsen's theorem on semi-simplicity - 1
Abstract: In these lectures we shall introduce motives and present results
in Jannsen's paper, which say that the "conjectural" category of motives
is semisimple abelian iff the adequate equivalence relation taken is
numerical equivalence. We shall also explain what is still "conjectural"
about this.
- Time:
- 4:00pm-5:00pm
- Location:
- Ramanujan Hall
- Description:
- Speaker: Prof. Hrushikesh N. Mhaskar, California Institute of Technology, Pasadena, and Claremont Graduate University, Claremont.
Title: Introduction to machine learning and approximation theory
Abstract: We will point out the relevance of approximation theory to
machine learning problems and review classical concepts of
approximation theory using trigonometric polynomial approximation of
periodic functions as a case study.