Search Constraints

Start Over
Filtering by: Creator Brooks, J. R. Remove constraint Creator: Brooks, J. R. Advisor Fern, Alan Remove constraint Advisor: Fern, Alan Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • Learning ranking functions for efficient search

    Creator:
    Xu, Yuehua
    Abstract:
    This dissertation explores algorithms for learning ranking functions to efficiently solve search problems, with application to automated planning. Specifically, we consider the frameworks of beam search, greedy search, and randomized search, which all aim to maintain tractability at the cost of not guaranteeing completeness nor optimality. Our learning objective for...
    Resource Type:
    Dissertation
    Full Text:
    the total ordering r. Note that for any j, |Cj| ≤ cb and |Bj| ≤ b, where c is the maximum number of

  • Anomaly Detection: Theory, Explanation and User Feedback

    Creator:
    Siddiqui, Md Amran
    Abstract:
    Anomaly detection has been used in variety of applications in practice, including cyber-security, fraud detection and detecting faults in safety critical systems, etc. Anomaly detectors produce a ranked list of statistical anomalies, which are typically examined by human analysts in order to extract the actual anomalies of interest. Unfortunately, most...
    Resource Type:
    Dissertation
    Full Text:
    ), R(h)] for f(h) that is narrow enough that it does not simultaneously contain both τ and τ + �. The

  • Object Tracking-by-Segmentation in Videos

    Creator:
    Chen, Sheng
    Abstract:
    This thesis focuses on the problem of object tracking. Given a video, the general objective of tracking is to track the location over time of one or more targets in the image sequence. This is a very challenging task as algorithms need to deal with problems such as appearance variations,...
    Resource Type:
    Dissertation

  • An Empirical Evaluation of Policy Rollout for Clue

    Creator:
    Marshall, Eric
    Abstract:
    We model the popular board game of Clue as an MDP and evaluate Monte-Carlo policy rollout in a simulated environment pitting different agents and policies against each other. We describe the choices we made in the representation, along with some of the problems we encountered along the way. We find...
    Resource Type:
    Capstone Project
    Full Text:
    ) defined by the set of states, actions, rewards, and transitions S, A, R, T. Before we describe the MDP

  • Stake-Free Evaluations of Black-Box Optimization and Spatio-Temporal Graph Network Algorithms

    Creator:
    Merrill, Erich, III
    Abstract:
    Papers proposing novel machine learning algorithms tend to present the algorithm or technique in question in the best possible light. The standard practice is generally for authors to emphasize their proposed algorithms' performance in the precise setting where it is maximally impressive, often by only fully evaluating their best known...
    Resource Type:
    Dissertation
    Full Text:
    Background We consider optimizing an unknown function f : X → R where X is a compact d- dimensional subset

  • Investigating Latent State and Uncertainty Representations in Reinforcement Learning

    Creator:
    Koul, Anurag
    Abstract:
    Learning latent space representations of high-dimensional world states has been at the core of recent rapid growth in reinforcement learning(RL). At the same time, RL algo- rithms have suffered from ignored uncertainties in the predicted estimates of model-free or model-based methods. In our work, we investigate both of these aspects...
    Resource Type:
    Dissertation
    Full Text:
    QBN’s to quantize memory and observations. (3.) Insertion and Fine Tuning. The modules labeled O, R are

  • UCT for tactical assault battles in real-time strategy games

    Creator:
    Balla, Radha-Krishna
    Abstract:
    We consider the problem of tactical assault planning in real-time strategy games where a team of friendly agents must launch an assault on an enemy. This problem offers many challenges including a highly dynamic and uncertain environment, multiple agents, durative actions, numeric attributes, and different optimization objectives. While the dynamics...
    Resource Type:
    Masters Thesis
    Full Text:
    the best action a from state s. Finally, after the trajectory reaches a terminal state the reward R

  • Ensemble Monte-Carlo planning : an empirical study

    Creator:
    Lewis, Paul
    Abstract:
    Monte-Carlo planning algorithms such as UCT make decisions at each step by intelligently expanding a single search tree given the available time and then selecting the best root action. Recent work has provided evidence that it can be advantageous to instead construct an ensemble of search trees and make a...
    Resource Type:
    Masters Thesis
    Full Text:
    arrays of rewards and visits to each action node} 3: (r, v)← SparseUCT (s0, t, c, ss) 4: for j = 1 to

  • Offensive Direction Inference in Real-World Football Video

    Creator:
    Lu, Qingkai
    Abstract:
    Automatic analysis of American football videos can help teams develop strategies and extract patterns with less human effort. In this work, we focus on the problem of automatically determining which team is on offense/defense, which is an important subproblem for higher-level analysis. While seemingly mundane, this problem is quite challenging...
    Resource Type:
    Masters Thesis