388 search results - page 11 / 78 » Convergence Properties of the K-Means Algorithms |
NIPS
2008
15 years 1 months ago
2008
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
89
Voted
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. The dense wavelength division multiplexing (DWDM) technique has been developed to provide a tremendous number of wavelengths/channels in an optical fiber. In the multi-c...
78
Voted
COLT
2004
Springer
15 years 5 months ago
2004
Springer
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
ICML
2010
IEEE
15 years 22 days ago
2010
IEEE
We consider approximate policy evaluation for finite state and action Markov decision processes (MDP) in the off-policy learning context and with the simulation-based least square...
114
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...