|
Written by Volodya Vovk
|
|
Saturday, 07 November 2009 11:04 |
|
Some comments on "A parameter-free hedging algorithm" by Chaudhuri, Freund, and Hsu
A parameter-free hedging algorithm by Chaudhuri, Freund, Hsu.
This paper makes an important contribution to Freund and Schapire's decision-theoretic framework for on-line prediction: a new algorithm (Normal-Hedge) and a loss bound for it that works well when the "effective" number of actions is much smaller than the nominal number of actions. Click here for details.
|
|
Last Updated on Friday, 27 November 2009 07:43 |
|
|
Written by Maxim Raginsky
|
|
Thursday, 30 July 2009 17:46 |
|
Information Theory and Machine Learning
There is a fundamental conceptual affinity between information theory and machine learning. Both are concerned with exploiting regularities and patterns in data sources to accomplish certain tasks in the presence of uncertainty and noise. In the case of information theory, the tasks of interest involve reliable representation, transmission and storage of information; in the case of learning, we are interested in making accurate predictions about the future on the basis of previously seen data.
|
|
Last Updated on Saturday, 01 August 2009 19:05 |
|
Read more...
|
|
Written by Sanjoy Dasgupta
|
|
Sunday, 12 July 2009 16:36 |
|
Active Learning
The term active learning applies to a wide range of situations in which a learner is able to exert some control over its source of data. For instance, when fitting a regression function, the learner may itself supply a set of data points at which to measure response values, in the hope of reducing the variance of its estimate. Such problems have been studied for many decades under the rubric of experimental design [C72,F72]. More recently, there has been substantial interest within the machine learning community in the specific task of actively learning binary classifiers. This task presents several fundamental statistical and algorithmic challenges, and an understanding of its mathematical underpinnings is only gradually emerging.
|
|
Last Updated on Tuesday, 14 July 2009 20:51 |
|
Read more...
|
|
|
Written by Yoav Freund
|
|
Wednesday, 01 July 2009 08:14 |
- A video of a talk
- A web page on the subject
|
|
Last Updated on Wednesday, 01 July 2009 14:56 |
|
Written by Kamalika Chaudhuri
|
|
Tuesday, 30 June 2009 18:29 |
Learning mixture models
Learning mixture models is a natural formalization of the clustering problem. A mixture model is a collection of distributions D1, .., Dk and weights w1, .., wk. To sample from a mixture model, we draw i with probability wi, and then draw a random sample from Di. Thus, each cluster in the data corresponds to a different distribution Di in the mixture, and the weights wi correspond to the fraction of points from each cluster in the entire dataset. In the problem of learning mixture models, we are given samples from a mixture model, and our goal is to (a) learn the parameters of the distributions Di and (b) classify each sample, according to its source distribution. The most popular algorithms for learning mixture models in practice are the Expectation-Maximization(EM) and the k-means algorithms.
|
|
Last Updated on Monday, 13 July 2009 07:20 |
|
Read more...
|
|
|
|
|
|
|
Page 1 of 2 |