3250 search results - page 277 / 650 » Parameterized Learning Complexity |
172
click to vote
NIPS
2007
15 years 7 months ago
2007
We investigate the problem of learning a widely-used latent-variable model – the Latent Dirichlet Allocation (LDA) or “topic” model – using distributed computation, where ...
161
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
161
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
Backpropagation, similar to most learning algorithms that can form complex decision surfaces, is prone to overfitting. This work presents classification-based objective functions, ...
179
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
132
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
Inhomogeneous Gibbs model (IGM) [4] is an effective maximum entropy model in characterizing complex highdimensional distributions. However, its training process is so slow that th...