Sciweavers

3837 search results - page 233 / 768
» Learning Approximate Consistencies
Sort
View
ICML
2005
IEEE
16 years 8 months ago
Tempering for Bayesian C&RT
This paper concerns the experimental assessment of tempering as a technique for improving Bayesian inference for C&RT models. Full Bayesian inference requires the computation ...
Nicos Angelopoulos, James Cussens
ICML
2005
IEEE
16 years 8 months ago
Closed-form dual perturb and combine for tree-based models
This paper studies the aggregation of predictions made by tree-based models for several perturbed versions of the attribute vector of a test case. A closed-form approximation of t...
Pierre Geurts, Louis Wehenkel
ALT
2008
Springer
16 years 4 months ago
Smooth Boosting for Margin-Based Ranking
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
Jun-ichi Moribe, Kohei Hatano, Eiji Takimoto, Masa...
ALT
2006
Springer
16 years 4 months ago
Teaching Memoryless Randomized Learners Without Feedback
The present paper mainly studies the expected teaching time of memoryless randomized learners without feedback. First, a characterization of optimal randomized learners is provided...
Frank J. Balbach, Thomas Zeugmann
COLT
2004
Springer
15 years 11 months ago
The Budgeted Multi-armed Bandit Problem
straction of the following scenarios: choosing from among a set of alternative treatments after a fixed number of clinical trials, determining the best parameter settings for a pro...
Omid Madani, Daniel J. Lizotte, Russell Greiner