Sciweavers

945 search results - page 97 / 189
» Dialog Convergence and Learning
Sort
View
COLT
2004
Springer
15 years 3 months ago
Boosting Based on a Smooth Margin
Abstract. We study two boosting algorithms, Coordinate Ascent Boosting and Approximate Coordinate Ascent Boosting, which are explicitly designed to produce maximum margins. To deri...
Cynthia Rudin, Robert E. Schapire, Ingrid Daubechi...
COLT
2004
Springer
15 years 3 months ago
Statistical Properties of Kernel Principal Component Analysis
The main goal of this paper is to prove inequalities on the reconstruction error for Kernel Principal Component Analysis. With respect to previous work on this topic, our contribu...
Laurent Zwald, Olivier Bousquet, Gilles Blanchard
GECCO
2010
Springer
151views Optimization» more  GECCO 2010»
15 years 2 months ago
Sustaining behavioral diversity in NEAT
Niching schemes, which sustain population diversity and let an evolutionary population avoid premature convergence, have been extensively studied in the research field of evoluti...
Hirotaka Moriguchi, Shinichi Honiden
GLOBECOM
2009
IEEE
15 years 1 months ago
Exploring Simulated Annealing and Graphical Models for Optimization in Cognitive Wireless Networks
In this paper we discuss the design of optimization algorithms for cognitive wireless networks (CWNs). Maximizing the perceived network performance towards applications by selectin...
Elena Meshkova, Janne Riihijärvi, Andreas Ach...
CORR
2010
Springer
119views Education» more  CORR 2010»
14 years 10 months ago
Dynamic Policy Programming
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...
Mohammad Gheshlaghi Azar, Hilbert J. Kappen