| Publication | Date of Publication | Type |
|---|
Reinforcement Learning, Bit by Bit
Foundations and Trends® in Machine Learning | 2023-12-19 | Paper |
Satisficing in Time-Sensitive Bandit Learning
Mathematics of Operations Research | 2023-01-09 | Paper |
Learning to optimize via information-directed sampling
Operations Research | 2020-10-05 | Paper |
| Deep exploration via randomized value functions | 2020-02-07 | Paper |
Deep exploration via randomized value functions
(available as arXiv preprint) | 2020-02-07 | Paper |
A Tutorial on Thompson Sampling
Foundations and Trends® in Machine Learning | 2018-11-23 | Paper |
Efficient reinforcement learning in deterministic systems with value function generalization
Mathematics of Operations Research | 2017-09-22 | Paper |
Convergence of Min-Sum Message Passing for Quadratic Optimization
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Convergence of Min-Sum Message-Passing for Convex Optimization
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Universal Reinforcement Learning
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
| Gaussian-Dirichlet Posterior Dominance in Sequential Learning | 2017-02-14 | Paper |
An information-theoretic analysis of Thompson sampling
Journal of Machine Learning Research (JMLR) | 2016-06-06 | Paper |
An information-theoretic analysis of Thompson sampling
Journal of Machine Learning Research (JMLR) | 2016-06-06 | Paper |
Adaptive execution: exploration and learning of price impact
Operations Research | 2016-03-22 | Paper |
Learning to optimize via posterior sampling
Mathematics of Operations Research | 2015-04-24 | Paper |
Directed principal component analysis
Operations Research | 2014-11-26 | Paper |
Learning a factor model via regularized PCA
Machine Learning | 2014-08-20 | Paper |
Resource allocation via message passing
INFORMS Journal on Computing | 2012-07-28 | Paper |
Manipulation Robustness of Collaborative Filtering
Management Science | 2012-02-27 | Paper |
Manipulation Robustness of Collaborative Filtering
Management Science | 2012-02-27 | Paper |
Dynamic pricing with a prior on market response
Operations Research | 2011-11-24 | Paper |
Investment and market structure in industries with congestion
Operations Research | 2011-11-24 | Paper |
Computational methods for oblivious equilibrium
Operations Research | 2011-11-17 | Paper |
Industry dynamics: foundations for models with an infinite number of firms
Journal of Economic Theory | 2011-10-28 | Paper |
Control of diffusions via linear programming
International Series in Operations Research & Management Science | 2011-05-31 | Paper |
On regression-based stopping times
Discrete Event Dynamic Systems | 2010-10-15 | Paper |
A short proof of optimality for the MIN cache replacement algorithm
Information Processing Letters | 2010-01-29 | Paper |
A Nonparametric Approach to Multiproduct Pricing
Operations Research | 2009-08-13 | Paper |
The Linear Programming Approach to Approximate Dynamic Programming
Operations Research | 2009-07-09 | Paper |
Capacity of the Trapdoor Channel With Feedback
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Consensus Propagation
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Markov Perfect Industry Dynamics With Many Firms
Econometrica | 2008-12-15 | Paper |
Performance Loss Bounds for Approximate Value Iteration with State Aggregation
Mathematics of Operations Research | 2008-05-27 | Paper |
A Cost-Shaping Linear Program for Average-Cost Approximate Dynamic Programming with Performance Guarantees
Mathematics of Operations Research | 2008-05-27 | Paper |
| Strategic Execution in the Presence of an Uninformed Arbitrageur | 2008-01-18 | Paper |
| An approximate dynamic programming approach to decentralized control of stochastic systems | 2007-09-03 | Paper |
| Convergence of the Min-Sum Algorithm for Convex Optimization | 2007-05-29 | Paper |
A generalized Kalman filter for fixed point approximation and efficient temporal-difference learning
Discrete Event Dynamic Systems | 2007-01-18 | Paper |
Feature-based methods for large scale dynamic programming
Machine Learning | 2006-06-29 | Paper |
| Tetris: A study of randomized constraint sampling | 2006-04-18 | Paper |
On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
Mathematics of Operations Research | 2005-11-11 | Paper |
Algorithms and Models for the Web-Graph
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Decentralized decision-making in a large team with local information.
Games and Economic Behavior | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1786126 (Why is no real title available?) | 2002-08-21 | Paper |
An analysis of belief propagation on the turbo decoding graph with Gaussian densities
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
On average versus discounted reward temporal-difference learning
Machine Learning | 2002-07-08 | Paper |
On the existence of fixed points for approximate value iteration and temporal-difference learning
Journal of Optimization Theory and Applications | 2001-02-19 | Paper |
Optimal stopping of Markov processes: Hilbert space theory, approximation algorithms, and an application to pricing high-dimensional financial derivatives
IEEE Transactions on Automatic Control | 2000-10-17 | Paper |
Average cost temporal-difference learning
Automatica | 2000-02-28 | Paper |
An analysis of temporal-difference learning with function approximation
IEEE Transactions on Automatic Control | 1999-05-06 | Paper |
Feature-based methods for large scale dynamic programming
Machine Learning | 1996-04-21 | Paper |
