Sciweavers

12 search results - page 2 / 3
» Topmoumoute Online Natural Gradient Algorithm
Sort
View
COLT
2006
Springer
13 years 8 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
ICML
2008
IEEE
14 years 5 months ago
Large scale manifold transduction
We show how the regularizer of Transductive Support Vector Machines (TSVM) can be trained by stochastic gradient descent for linear models and multi-layer architectures. The resul...
Michael Karlen, Jason Weston, Ayse Erkan, Ronan Co...
ETVC
2008
13 years 6 months ago
Intrinsic Geometries in Learning
In a seminal paper, Amari (1998) proved that learning can be made more efficient when one uses the intrinsic Riemannian structure of the algorithms' spaces of parameters to po...
Richard Nock, Frank Nielsen
EMMCVPR
2005
Springer
13 years 10 months ago
Deformable-Model Based Textured Object Segmentation
Abstract. In this paper, we present a deformable-model based solution for segmenting objects with complex texture patterns of all scales. The external image forces in traditional d...
Xiaolei Huang, Zhen Qian, Rui Huang, Dimitris N. M...
AAAI
2011
12 years 4 months ago
Fast Newton-CG Method for Batch Learning of Conditional Random Fields
We propose a fast batch learning method for linearchain Conditional Random Fields (CRFs) based on Newton-CG methods. Newton-CG methods are a variant of Newton method for high-dime...
Yuta Tsuboi, Yuya Unno, Hisashi Kashima, Naoaki Ok...