4930 search results - page 87 / 986 » Learning minimal abstractions |
109
click to vote
COLT
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. We propose a convex optimization approach to solving the nonparametric regression estimation problem when the underlying regression function is Lipschitz continuous. This...
112
Voted
ECCV
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Domain adaptation is an important emerging topic in computer vision. In this paper, we present one of the first studies of domain shift in the context of object recogniti...
95
Voted
ML
2007
ACM
15 years 3 days ago
2007
ACM
Abstract Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. A...
122
Voted
NIPS
2007
15 years 2 months ago
2007
Empirical risk minimization offers well-known learning guarantees when training and test data come from the same domain. In the real world, though, we often wish to adapt a classi...
90
Voted
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
Abstract. Finding solutions to minimal problems for estimating epipolar geometry and camera motion leads to solving systems of algebraic equations. Often, these systems are not tri...