Sciweavers

1206 search results - page 40 / 242
» Convergence analysis of online algorithms
Sort
View
MOC
2000
104views more  MOC 2000»
13 years 8 months ago
Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems
In this paper we analyze the bi-conjugate gradient algorithm in finite precision arithmetic, and suggest reasons for its often observed robustness. By using a tridiagonal structure...
Charles H. Tong, Qiang Ye
SIAMSC
2010
151views more  SIAMSC 2010»
13 years 6 months ago
An Inner-Outer Iteration for Computing PageRank
We present a new iterative scheme for PageRank computation. The algorithm is applied to the linear system formulation of the problem, using inner-outer stationary iterations. It is...
David F. Gleich, Andrew P. Gray, Chen Greif, Tracy...
TSP
2010
13 years 3 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
NIPS
2007
13 years 10 months ago
The Price of Bandit Information for Online Optimization
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
Varsha Dani, Thomas P. Hayes, Sham Kakade
ETVC
2008
13 years 10 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