Search
Skip to Search Results- 21Bowling, Michael (Computing Science)
- 14Schuurmans, Dale (Computing Science)
- 5Szepesvari, Csaba (Computing Science)
- 2Greiner, Russell (Computing Science)
- 1Bellemare, Marc (Google Brain)
- 1Bowling, Mike (Computing Science)
- 9Reinforcement Learning
- 6Artificial Intelligence
- 6Machine Learning
- 6Machine learning
- 3Game Theory
- 2Abstractions
-
Spring 2015
Rayner, David Christopher Ferguson
Heuristic search is a central problem in artificial intelligence. Among its defining properties is the use of a heuristic, a scalar function mapping pairs of states to an estimate of the actual distance between them. Accurate heuristics are generally correlated with faster query resolution and...
-
Spring 2015
This dissertation explores regularized factor models as a simple unification of machine learn- ing problems, with a focus on algorithmic development within this known formalism. The main contributions are (1) the development of generic, efficient algorithms for a subclass of regularized...
-
Spring 2016
Games have been used as a testbed for artificial intelligence research since the earliest conceptions of computing itself. The twin goals of defeating human professional players at games, and of solving games outright by creating an optimal computer agent, have helped to drive practical ...
-
Spring 2017
Co-embedding is the process of mapping elements from multiple sets into a common latent space, which can be exploited to infer element-wise associations by considering the geometric proximity of their embeddings. Such an approach underlies the state of the art for link prediction, relation...
-
Spring 2023
AlphaZero is a self-play reinforcement learning algorithm that achieves superhuman play in the games of chess, shogi, and Go via policy iteration. To be an effective policy improvement operator, AlphaZero’s search needs to have accurate value estimates for the states that appear in its search...
-
Fall 2013
Given nothing but the generative model of the environment, Monte Carlo Tree Search techniques have recently shown spectacular results on domains previously thought to be intractable. In this thesis we try to develop generic techniques for temporal abstraction inside MCTS that would allow the...
-
Spring 2014
Efficient, unbiased estimation of agent performance is essential for drawing statistically significant conclusions in multi-agent domains with high outcome variance. Naive Monte Carlo estimation is often insufficient, as it can require a prohibitive number of samples, especially when evaluating...
-
Spring 2018
Decision-making problems with two agents can be modeled as two player games, and a Nash equilibrium is the basic solution concept describing good play in adversarial games. Computing this equilibrium solution for imperfect information games, where players have private, hidden information, is...
-
Spring 2020
Reinforcement learning (RL) is a powerful learning paradigm in which agents can learn to maximize sparse and delayed reward signals. Although RL has had many impressive successes in complex domains, learning can take hours, days, or even years of training data. A major challenge of contemporary...
-
Spring 2021
This dissertation demonstrates how to utilize data collected previously from different sources to facilitate learning and inference for a target task. Learning from scratch for a target task or environment can be expensive and time-consuming. To address this problem, we make three contributions...