Sciweavers

1206 search results - page 125 / 242
» Convergence analysis of online algorithms
Sort
View
EOR
2008
103views more  EOR 2008»
14 years 10 months ago
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
Maziar Salahi, M. Reza Peyghami, Tamás Terl...
JMLR
2006
389views more  JMLR 2006»
14 years 10 months ago
A Very Fast Learning Method for Neural Networks Based on Sensitivity Analysis
This paper introduces a learning method for two-layer feedforward neural networks based on sensitivity analysis, which uses a linear training algorithm for each of the two layers....
Enrique Castillo, Bertha Guijarro-Berdiñas,...
ALT
2005
Springer
15 years 6 months ago
Defensive Universal Learning with Experts
This paper shows how universal learning can be achieved with expert advice. To this aim, we specify an experts algorithm with the following characteristics: (a) it uses only feedba...
Jan Poland, Marcus Hutter
ICDAR
2009
IEEE
14 years 7 months ago
Stochastic Model of Stroke Order Variation
A stochastic model of stroke order variation is proposed and applied to the stroke-order free on-line Kanji character recognition. The proposed model is a hidden Markov model (HMM...
Yoshinori Katayama, Seiichi Uchida, Hiroaki Sakoe
AUTOMATICA
2008
86views more  AUTOMATICA 2008»
14 years 10 months ago
Notes on averaging over acyclic digraphs and discrete coverage control
In this paper we study averaging algorithms and coverage control laws in a unified light. First, we characterize the convergence properties of averaging algorithms over acyclic di...
Chunkai Gao, Jorge Cortés, Francesco Bullo