171 search results - page 2 / 35 » Fast Rates for Regularized Objectives |
ICML
2009
IEEE
14 years 5 months ago
2009
IEEE
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
TIP
2010
12 years 11 months ago
2010
We propose a new fast algorithm for solving one of the standard formulations of image restoration and reconstruction which consists of an unconstrained optimization problem where t...
VCIP
2003
13 years 6 months ago
2003
This paper introduces a new class of bases, called bandelet bases, which decompose the image along multiscale vectors that are elongated in the direction of a geometric flow. Thi...
WSC
2008
13 years 7 months ago
2008
We study a stochastic optimization problem that has its roots in financial portfolio design. The problem has a specified deterministic objective function and constraints on the co...
NAACL
2001
13 years 6 months ago
2001
In this paper we investigate polysemous adjectives whose meaning varies depending on the nouns they modify (e.g., fast). We acquire the meanings of these adjectives from a large c...