Sciweavers

4324 search results - page 249 / 865
» A Generalized Representer Theorem
Sort
View
NIPS
2008
15 years 8 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
JELIA
2010
Springer
15 years 5 months ago
Parametrized Logic Programming
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order form...
Ricardo Gonçalves, José Júlio...
193
Voted
CORR
2011
Springer
191views Education» more  CORR 2011»
15 years 1 months ago
Picturing classical and quantum Bayesian inference
We introduce a graphical framework for Bayesian inference that is sufficiently general to accommodate not just the standard case but also recent proposals for a theory of quantum...
Bob Coecke, Robert W. Spekkens
EUROGP
2010
Springer
172views Optimization» more  EUROGP 2010»
15 years 10 months ago
Geometric Differential Evolution on the Space of Genetic Programs
Abstract. Geometric Differential Evolution (GDE) is a very recently introduced formal generalization of traditional Differential Evolution (DE) that can be used to derive specific ...
Alberto Moraglio, Sara Silva
AGI
2008
15 years 8 months ago
Extending the Soar Cognitive Architecture
One approach in pursuit of general intelligent agents has been to concentrate on the underlying cognitive architecture, of which Soar is a prime example. In the past, Soar has reli...
John E. Laird