Sciweavers

701 search results - page 38 / 141
» Self Bounding Learning Algorithms
Sort
View
117
Voted
ICML
2010
IEEE
14 years 10 months ago
Implicit Online Learning
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...
Brian Kulis, Peter L. Bartlett
92
Voted
NIPS
2008
15 years 1 months ago
Convergence and Rate of Convergence of a Manifold-Based Dimension Reduction Algorithm
We study the convergence and the rate of convergence of a local manifold learning algorithm: LTSA [13]. The main technical tool is the perturbation analysis on the linear invarian...
Andrew Smith, Xiaoming Huo, Hongyuan Zha
100
Voted
ICANN
2005
Springer
15 years 6 months ago
Self Organizing Map (SOM) Approach for Classification of Power Quality Events
In this work, Self Organizing Map (SOM) is used in order to classify the types of defections in electrical systems, known as Power Quality (PQ) events. The features for classificat...
Emin Germen, Dogãn Gökhan Ece, Öm...
163
Voted
JMLR
2012
13 years 3 months ago
Algorithms for Learning Kernels Based on Centered Alignment
This paper presents new and effective algorithms for learning kernels. In particular, as shown by our empirical results, these algorithms consistently outperform the so-called uni...
Corinna Cortes, Mehryar Mohri, Afshin Rostamizadeh
82
Voted
COLT
2008
Springer
15 years 2 months ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...