Sciweavers

3049 search results - page 40 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
13 years 3 months ago
A lower bound for distributed averaging algorithms on the line graph
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...
Alexander Olshevsky, John N. Tsitsiklis
INFOCOM
2005
IEEE
14 years 2 months ago
Power control for OSNR optimization in optical networks: a distributed algorithm via a central cost approach
— This paper addresses the problem of optical signal-to-noise ratio (OSNR) optimization in optical networks. An analytical OSNR network model is developed for a general multi-lin...
L. Pavel
NIPS
2001
13 years 10 months ago
On the Convergence of Leveraging
We give an unified convergence analysis of ensemble learning methods including e.g. AdaBoost, Logistic Regression and the Least-SquareBoost algorithm for regression. These methods...
Gunnar Rätsch, Sebastian Mika, Manfred K. War...
NIPS
2008
13 years 10 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari
TEC
2002
183views more  TEC 2002»
13 years 8 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy