701 search results - page 126 / 141 » Self Bounding Learning Algorithms |
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
EWRL
2008
13 years 9 months ago
2008
If one possesses a model of a controlled deterministic system, then from any state, one may consider the set of all possible reachable states starting from that state and using any...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
ICANN
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Tuning hyper-parameters is a necessary step to improve learning algorithm performances. For Support Vector Machine classifiers, adjusting kernel parameters increases dra...