Search
Skip to Search Results
Filter
Subject / Keyword
- 2Learning theory
- 2Machine learning
- 1Independent component analysis
- 1Online learning
- 1Online linear optimization
- 1Optimization
Supervisors
Author / Creator / Contributor
Year
Collections
Languages
Item type
Departments
-
Spring 2017
Optimizing an objective function over convex sets is a key problem in many different machine learning models. One of the various kinds of well studied objective functions is the convex function, where any local minimum must be the global mini- mum over the domain. To find the optimal point that...
-
Fall 2017
On the one hand, theoretical analyses of machine learning algorithms are typically performed based on various probabilistic assumptions about the data. While these probabilistic assumptions are important in the analyses, it is debatable whether such assumptions actually hold in practice. Another...
1 - 2 of 2