Sciweavers

127 search results - page 23 / 26
» Computational Complexity of Some Problems Involving Congruen...
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Regression with the optimised combination technique
We consider the sparse grid combination technique for regression, which we regard as a problem of function reconstruction in some given function space. We use a regularised least ...
Jochen Garcke
COLT
2000
Springer
13 years 12 months ago
Model Selection and Error Estimation
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...
Peter L. Bartlett, Stéphane Boucheron, G&aa...
NIPS
2000
13 years 8 months ago
Learning Continuous Distributions: Simulations With Field Theoretic Priors
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
Ilya Nemenman, William Bialek
ATAL
2011
Springer
12 years 7 months ago
Towards a unifying characterization for quantifying weak coupling in dec-POMDPs
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
Stefan J. Witwicki, Edmund H. Durfee
GECCO
2003
Springer
189views Optimization» more  GECCO 2003»
14 years 21 days ago
A Forest Representation for Evolutionary Algorithms Applied to Network Design
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
Alexandre C. B. Delbem, André Carlos Ponce ...