Search Constraints

Start Over
Filtering by: Creator Schneider, Ashley R. Remove constraint Creator: Schneider, Ashley R. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • Model-based approximation methods for reinforcement learning

    Creator:
    Wang, Xin
    Abstract:
    The thesis focuses on model-based approximation methods for reinforcement learning with large scale applications such as combinatorial optimization problems. First, the thesis proposes two new model-based methods to stablize the value–function approximation for reinforcement learning. The first one is the BFBP algorithm, a batch-like reinforcement learning process which iterates between...
    Resource Type:
    Dissertation
    Full Text:
    learn- ing algorithm. In our approach, we learn the models P (s′|s, a) and R(s′|s, a), and then use

  • Machine learning methods for public policy : simulation, optimization, and visualization

    Creator:
    McGregor, Sean
    Abstract:
    Society faces many complex management problems, particularly in the area of shared public resources such as ecosystems. Existing decision making processes are often guided by personal experience and political ideology rather than state-of-the-art scientific understanding. This dissertation envisions a future in which multiple stakeholders are provided with computational tools for...
    Resource Type:
    Dissertation
    Full Text:
    challenges. In particular, I would like to thank both my parents, the Buchanans, and Ashley Bromley for

  • Protein secondary structure prediction using conditional random fields and profiles

    Creator:
    Shen, Rongkun
    Abstract:
    Protein secondary structure prediction plays a pivotal role in predicting protein folding in three-dimensions. Its task is to assign each residue one of the three secondary structure classes helix, strand, or random coil. This is an instance of the problem of sequential supervised learning in machine learning. This thesis describes...
    Resource Type:
    Masters Thesis
    Full Text:
    of “rib” to pass through labels 1 and 2. After “r”, both labels 1 and 2 have same probability

  • Coordination for Scalable Multiple Robot Planning Under Temporal Uncertainty

    Creator:
    Marcon dos Santos, Gilberto
    Abstract:
    This dissertation incorporates coalition formation and probabilistic planning towards a domain-independent automated planning solution scalable to multiple heterogeneous robots in complex domains. The first research direction investigates the effectiveness of Task Fusion and introduces heuristics that improve task allocation and result in better quality plans, while requiring lower computational cost...
    Resource Type:
    Dissertation

  • 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

  • Toward computer vision for understanding American football in video

    Creator:
    Hess, Robin W.
    Abstract:
    In this work, I examine the problem of understanding American football in video. In particular, I present several mid-level computer vision algorithms that each accomplish a different sub-task within a larger system for annotating, interpreting, and analyzing collections of American football video. The analysis of football video is useful in...
    Resource Type:
    Dissertation
    Full Text:
    , Angela McClendon, Ashley Bromley, Barry Walker, Dennis Dugan, Jack Day, Joe Tyburczy, John Osborne

  • Computing Resource Usage as a Factor of Student Success

    Creator:
    Moissinac, Béatrice
    Abstract:
    Learning Analytics and other branches of Educational Research such as Computing Education Research (CER) implicitly assume that students, especially college students, have no barriers to access learning platforms or software packages. This assumption may be attributed to such pervasive beliefs such as "everyone has a device", or "everyone can access...
    Resource Type:
    Dissertation
    Full Text:
    ): Nicolas Aziere, Ashley Bromley, Phylicia Cicilio, Dr. Austin Henley, Dr. Michael Hilton, Dr. Cline

  • Monte Carlo Tree Search with Fixed and Adaptive Abstractions

    Creator:
    Hostetler, Jesse A.
    Abstract:
    Monte Carlo tree search (MCTS) is a class of online planning algorithms for Markov decision processes (MDPs) and related models that has found success in challenging applications. In the online planning approach, the agent makes a decision in the current state by performing a limited forward search over possible futures...
    Resource Type:
    Dissertation
    Full Text:
    - tical performance at the p = 0.05 level. This plot was produced by the R package scmamp [Calvo and

  • Evaluation functions in aerial image segmentation

    Creator:
    Langford, William T.
    Abstract:
    Remote sensing is the most practical way to acquire large amounts of land cover data for monitoring and understanding environmental change, so it is important to be able to map land cover from imagery. Maps defining land cover patches as polygons rather than pixels greatly improve processing efficiency in models...
    Resource Type:
    Dissertation

  • 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