Sciweavers

44 search results - page 4 / 9
» On numerical optimization theory of infinite kernel learning
Sort
View
ICML
2009
IEEE
15 years 12 months ago
Learning kernels from indefinite similarities
Similarity measures in many real applications generate indefinite similarity matrices. In this paper, we consider the problem of classification based on such indefinite similariti...
Yihua Chen, Maya R. Gupta, Benjamin Recht
ICAART
2010
INSTICC
15 years 8 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 2 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
14 years 9 months ago
Laplacian Spectrum Learning
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
Pannagadatta K. Shivaswamy, Tony Jebara
CDC
2008
IEEE
171views Control Systems» more  CDC 2008»
15 years 5 months ago
Constrained optimal control theory for differential linear repetitive processes
Abstract. Differential repetitive processes are a distinct class of continuous-discrete twodimensional linear systems of both systems theoretic and applications interest. These pr...
Michael Dymkov, Eric Rogers, Siarhei Dymkou, Krzys...