Search Constraints

Start Over
Filtering by: Creator Rossignol, P. A. Remove constraint Creator: Rossignol, P. A. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad Committee Member Wong, Weng-Keen Remove constraint Committee Member: Wong, Weng-Keen

Search Results

  • Adversarial planning by strategy switching in a real-time strategy game

    Creator:
    King, Brian D.
    Abstract:
    We consider the problem of strategic adversarial planning in a Real-Time Strategy (RTS) game. Strategic adversarial planning is the generation of a network of high-level tasks to satisfy goals while anticipating an adversary's actions. In this thesis we describe an abstract state and action space used for planning in an...
    Resource Type:
    Masters Thesis
    Full Text:
    : Adversarial Planning by Strategy Switching in a Real-Time Strategy Game Abstract approved: Alan P. Fern We

  • Re-understanding Finite-State Representations of Recurrent Policy Networks

    Creator:
    Danesh, Mohamad H.
    Abstract:
    We propose an approach for understanding control policies represented as recurrent neural networks. Recent work has approached this problem by transforming such recurrent policy networks into finite-state machines (FSM) and then analyzing the equivalent minimized FSM. While this led to interesting insights, the minimization process can obscure a deeper understanding...
    Resource Type:
    Masters Thesis
    Full Text:
    an d A ta ri en v ir on m en ts . G am e Q B N S iz es O ri gi n al M M A ft er P ru

  • Interpretable Machine Learning: Applications in Biology and Genomics

    Creator:
    Danaee, Padideh
    Abstract:
    Machine learning (ML) and deep learning (DL) models impact our daily lives with applications in natural language modeling, image analysis, healthcare, genomics, and bioinformatics. The exponential growth of biological sequence data necessitates accompanying advances in computational methods. Although deep learning is highly effective for detecting and classifying biological sequences, challenges...
    Resource Type:
    Dissertation
    Full Text:
    tables (created by SQLEditor). The primary keys of each tables are bold and has a “P” mark. If a field

  • A SAT-based planning framework for optimizing resource production

    Creator:
    Ventura, Christopher
    Abstract:
    Domain-independent automated planning is concerned with computing a sequence of actions that can transform an initial state into a desired goal state. Resource production domains form an interesting class of such problems, in that they typically require reasoning about concurrent durative-actions with continuous effects while minimizing some cost function. Although...
    Resource Type:
    Masters Thesis
    Full Text:
    Science presented on June 15, 2007. Title: A SAT-based Planning Framework for Optimizing Resource

  • Bayesian optimization with empirical constraints

    Creator:
    Azimi, Javad
    Abstract:
    Bayesian Optimization (BO) methods are often used to optimize an unknown function f(•) that is costly to evaluate. They typically work in an iterative manner. In each iteration, given a set of observation points, BO algorithms select k ≥ 1 points to be evaluated. The results of those points are...
    Resource Type:
    Dissertation
    Full Text:
    for computing a p-safe uniform schedule with maximum number of stages given the scheduling

  • ThreshKnot: Thresholded ProbKnot for Improved RNA Secondary Structure Prediction

    Creator:
    Zhang, Liang
    Abstract:
    RNA structure prediction is a challenging problem, especially with pseudoknots. Recently, there has been a shift from the classical minimum free energy-based methods (MFE) to partition function-based ones that assemble structures based on base-pairing probabilities. Two typical examples of the latter group are the popular maximum expected accuracy (MEA) method...
    Resource Type:
    Masters Thesis
    Full Text:
    P(i, j) = Pmax(i) = Pmax(j) then yield (i, j) We show a predicted structure sample in Fig. 2.1

  • 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:
    machine δ̂ is constructed from the data by producing a p× q transaction table that captures the

  • Active learning of constraints for semi-supervised clustering

    Creator:
    Xiong, Sicheng
    Abstract:
    Semi-supervised clustering aims to improve clustering performance by considering user supervision in the form of pairwise constraints. In this paper, we study the active learning problem of selecting pairwise must-link and cannot-link constraints for semisupervised clustering. We consider active learning in an iterative manner where in each iteration queries are...
    Resource Type:
    Masters Thesis
    Full Text:
    constraint set. We apply a general framework that builds on the concept of neighbor- hood, where