3050 search results - page 425 / 610 » On-line Algorithms in Machine Learning |
145
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
The conditional distribution of a discrete variable y, given another discrete variable x, is often specified by assigning one multinomial distribution to each state of x. The cost...
150
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
In this paper, we present a new interpretation of AdaBoost.ECC and AdaBoost.OC. We show that AdaBoost.ECC performs stage-wise functional gradient descent on a cost function, defin...
141
click to vote
ICML
2004
IEEE
16 years 5 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...
124
click to vote
ICML
2003
IEEE
16 years 5 months ago
2003
IEEE
As text corpora become larger, tradeoffs between speed and accuracy become critical: slow but accurate methods may not complete in a practical amount of time. In order to make the...
156
click to vote
ICML
2003
IEEE
16 years 5 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...