Sciweavers

2131 search results - page 112 / 427
» A computational approximation to the AIXI model
Sort
View
SPLC
2008
15 years 7 months ago
Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
Jules White, B. Doughtery, Douglas C. Schmidt
NIPS
2004
15 years 7 months ago
Message Errors in Belief Propagation
Belief propagation (BP) is an increasingly popular method of performing approximate inference on arbitrary graphical models. At times, even further approximations are required, wh...
Alexander T. Ihler, John W. Fisher III, Alan S. Wi...
DCC
2010
IEEE
16 years 1 months ago
Lossless Compression Based on the Sequence Memoizer
In this work we describe a sequence compression method based on combining a Bayesian nonparametric sequence model with entropy encoding. The model, a hierarchy of Pitman-Yor proce...
Jan Gasthaus, Frank Wood, Yee Whye Teh
ICPR
2008
IEEE
16 years 25 days ago
Fast multiple instance learning via L1, 2 logistic regression
In this paper, we develop an efficient logistic regression model for multiple instance learning that combines L1 and L2 regularisation techniques. An L1 regularised logistic regr...
Zhouyu Fu, Antonio Robles-Kelly
UAI
2008
15 years 7 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...