Search Constraints

Start Over
Filtering by: Creator Greer, Adam T. Remove constraint Creator: Greer, Adam T. Advisor Fern, Alan P. Remove constraint Advisor: Fern, Alan P. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • 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:
    agent. For instance, [17] ex- plains policy outputs by visualizations and t-SNE embeddings, [24

  • Incorporating and Learning Behavior Constraints for Sequential Decision Making

    Creator:
    Pinto, Jervis
    Abstract:
    Writing a program that performs well in a complex environment is a challenging task. In such problems, a method of deterministic programming combined with reinforcement learning (RL) can be helpful. However, current systems either force developers to encode knowledge in very specific forms (e.g., state-action features), or assume advanced RL...
    Resource Type:
    Dissertation
    Full Text:
    Shireen Hyrapiet, Kunal Kate, Rohan Madtha, Megan Knight, the chemistry gang (Adam, Cory, Somnath and

  • New learning modes for sequential decision making

    Creator:
    Judah, Kshitij
    Abstract:
    This thesis considers the problem in which a teacher is interested in teaching action policies to computer agents for sequential decision making. The vast majority of policy learning algorithms o er teachers little flexibility in how policies are taught. In particular, one of two learning modes is typically considered: 1)...
    Resource Type:
    Dissertation
    Full Text:
    Objective U(θ, T ) . . . . . . . . . . . . . . . . . . 11 2.4 Critique Data Objective L(θ, C

  • 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

  • Learning and Improving Policies for Probabilistic Planning Problems

    Creator:
    Issakkimuthu, Murugeswari
    Abstract:
    In this work, we study the problem of learning and improving policies for probabilistic planning problems. In the first part, we train neural network policies for probabilistic planning problems modeled as factored Markov decision problems. The objective is to train problem-specific neural networks via supervised learning to imitate the action...
    Resource Type:
    Dissertation
    Full Text:
    transition function T is compactly described as a DBN which specifies the probability distribution over