Search Constraints

Start Over
Filtering by: Creator Meyers, S. Mark Remove constraint Creator: Meyers, S. Mark Advisor Fern, Alan Remove constraint Advisor: Fern, Alan Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • 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:
    , most notably the game of Go (see [5] and [4]). UCT‟s ability to deal with the large state-space of Go

  • 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:
    ) HalfCheetah and b) Maze2d-Open. For each PCQ (s, π, ŝ, π̂, h), we plot V π(s, h) vs. V π̂(ŝ, h

  • 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:
    curve is averaged over 120-300 bench- mark datasets

  • Evaluation of Parallel Monte Carlo Tree Search Algorithms in Python

    Creator:
    Jothi, Shankar
    Abstract:
    Monte-Carlo Tree Search (MCTS) is an online-planning algorithm for decision-theoretic planning in domains with stochastic and combinatorial structure. The general applicability of MCTS makes it an ideal first choice to investigate when developing planners for complex applications requiring automated control and planning. The first contribution of this thesis is to...
    Resource Type:
    Masters Thesis
    Full Text:
    the tree stores its visit count and Q(s, a) for each of the action values from that node’s state and

  • 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:
    contains the set of leaves at depth h 2: τ0 = {x0,0} ▷ x0,0 is the center of the objective function f ’s