1023 search results - page 8 / 205 » Graph model selection using maximum likelihood |
NIPS
2001
13 years 8 months ago
2001
We derive an equivalence between AdaBoost and the dual of a convex optimization problem, showing that the only difference between minimizing the exponential loss used by AdaBoost ...
SAC
2008
ACM
13 years 7 months ago
2008
ACM
Standard methods for maximum likelihood parameter estimation in latent variable models rely on the Expectation-Maximization algorithm and its Monte Carlo variants. Our approach is ...
AUTOMATICA
2005
13 years 7 months ago
2005
This paper treats a new approach to the problem of periodic signal estimation. The idea is to model the periodic signal as a function of the state of a second-order nonlinear ordi...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
NIPS
2003
13 years 8 months ago
2003
Recent work has examined the estimation of models of stimulus-driven neural activity in which some linear filtering process is followed by a nonlinear, probabilistic spiking stag...