Compress and Control
暂无分享,去创建一个
[1] Ronald A. Howard,et al. Dynamic Programming and Markov Processes , 1960 .
[2] Yoram Singer,et al. Adaptive Subgradient Methods for Online Learning and Stochastic Optimization , 2011, J. Mach. Learn. Res..
[3] M. Botvinick,et al. Planning as inference , 2012, Trends in Cognitive Sciences.
[4] Christos Dimitrakakis,et al. Cover tree Bayesian reinforcement learning , 2013, J. Mach. Learn. Res..
[5] Hagai Attias,et al. Planning by Probabilistic Inference , 2003, AISTATS.
[6] Marc G. Bellemare,et al. Skip Context Tree Switching , 2014, ICML.
[7] Frans M. J. Willems,et al. The context-tree weighting method: basic properties , 1995, IEEE Trans. Inf. Theory.
[8] Thomas J. Walsh,et al. Integrating Sample-Based Planning and Model-Based Reinforcement Learning , 2010, AAAI.
[9] Joel Veness,et al. A Monte-Carlo AIXI Approximation , 2009, J. Artif. Intell. Res..
[10] Marc G. Bellemare,et al. The Arcade Learning Environment: An Evaluation Platform for General Agents (Extended Abstract) , 2012, IJCAI.
[11] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[12] Richard S. Sutton,et al. Introduction to Reinforcement Learning , 1998 .
[13] Tao Wang,et al. Stable Dual Dynamic Programming , 2007, NIPS.
[14] Joel Veness,et al. Reinforcement Learning via AIXI Approximation , 2010, AAAI.
[15] Csaba Szepesvári,et al. Algorithms for Reinforcement Learning , 2010, Synthesis Lectures on Artificial Intelligence and Machine Learning.
[16] Richard S. Sutton,et al. Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.
[17] Alec Solway,et al. Goal-directed decision making as probabilistic inference: a computational framework and potential neural correlates. , 2012, Psychological review.
[18] Ian H. Witten,et al. Arithmetic coding for data compression , 1987, CACM.
[19] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.
[20] Blaz Zupan,et al. Spam Filtering Using Statistical Data Compression Models , 2006, J. Mach. Learn. Res..
[21] John N. Tsitsiklis,et al. Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.
[22] Marc Toussaint,et al. Escaping local optima in POMDP planning as inference , 2011, AAMAS.
[23] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.
[24] Ian H. Witten,et al. Managing Gigabytes: Compressing and Indexing Documents and Images , 1999 .
[25] Peter Dayan,et al. Efficient Bayes-Adaptive Reinforcement Learning using Sample-Based Search , 2012, NIPS.
[26] John Odentrantz,et al. Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.
[27] Finale Doshi-Velez,et al. The Infinite Partially Observable Markov Decision Process , 2009, NIPS.
[28] Ian H. Witten,et al. Managing gigabytes (2nd ed.): compressing and indexing documents and images , 1999 .
[29] Marcus Hutter,et al. Universal Artificial Intellegence - Sequential Decisions Based on Algorithmic Probability , 2005, Texts in Theoretical Computer Science. An EATCS Series.
[30] Yoshua Bengio,et al. Random Search for Hyper-Parameter Optimization , 2012, J. Mach. Learn. Res..
[31] Christopher M. Bishop,et al. Pattern Recognition and Machine Learning (Information Science and Statistics) , 2006 .
[32] Marcus Hutter,et al. Sparse Adaptive Dirichlet-Multinomial-like Processes , 2013, COLT.
[33] Tamás Linder,et al. Efficient Tracking of Large Classes of Experts , 2011, IEEE Transactions on Information Theory.
[34] Paul M. B. Vitányi,et al. Clustering by compression , 2003, IEEE Transactions on Information Theory.
[35] Marcus Hutter,et al. Fast Non-Parametric Bayesian Inference on Infinite Trees , 2004, AISTATS.
[36] Tao Wang,et al. Dual Representations for Dynamic Programming and Reinforcement Learning , 2007, 2007 IEEE International Symposium on Approximate Dynamic Programming and Reinforcement Learning.
[37] Martha White,et al. Partition Tree Weighting , 2012, 2013 Data Compression Conference.
[38] Ian H. Witten,et al. Text categorization using compression models , 2000, Proceedings DCC 2000. Data Compression Conference.
[39] Panos M. Pardalos,et al. Approximate dynamic programming: solving the curses of dimensionality , 2009, Optim. Methods Softw..
[40] Joelle Pineau,et al. Modelling Sparse Dynamical Systems with Compressed Predictive State Representations , 2013, ICML.
[41] Nataliya Sokolovska,et al. Continuous Upper Confidence Trees , 2011, LION.
[42] Frans M. J. Willems,et al. Context Tree Weighting : A Sequential Universal Source Coding Procedure for Fsmx Sources , 1993, Proceedings. IEEE International Symposium on Information Theory.
[43] Erik Talvitie,et al. Model Regularization for Stable Sample Rollouts , 2014, UAI.
[44] Michael L. Littman,et al. Learning is planning: near Bayes-optimal reinforcement learning via Monte-Carlo tree search , 2011, UAI.
[45] Alex Graves,et al. Playing Atari with Deep Reinforcement Learning , 2013, ArXiv.