Search Constraints

Start Over
Filtering by: Creator Kilcher%2C L. K. Remove constraint Creator: Kilcher%2C L. K. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • Decentralized Multi-Robot Exploration with Sparse Communication through Deep Imitation Learning

    Creator:
    Senewiratne, Yomal K.
    Abstract:
    We present a method for decentralized, multi-robot exploration in adverse environments where communication is minimal. A key conceptual feature of our method is enabling implicit coordination between robots by training a Convolutional Neural Network (CNN) as a heuristic for planning using Monte Carlo Tree Search (MCTS). Our method consists of...
    Resource Type:
    Masters Thesis

  • Characterizing and Addressing Dataset Shift with Deep Learning

    Creator:
    Olson, Matthew L.
    Abstract:
    This dissertation delves into understanding, characterizing, and addressing dataset shift in deep learning, a pervasive issue for deployed machine learning systems. Integral aspects of the problem are examined: We start with the use of counterfactual explanations in order to characterize the behavior of deep reinforcement learning agents in visual input...
    Resource Type:
    Dissertation
    Full Text:
    AN ABSTRACT OF THE DISSERTATION OF Matthew L

  • Counterfactual States for Atari Agents via Generative Deep Learning

    Creator:
    Olson, Matthew L.
    Abstract:
    Although deep reinforcement learning agents have produced impressive results in many domains, their decision making is difficult to explain to humans. To address this problem, past work has mainly focused on explaining why an action was chosen in a given state. A different type of explanation that is useful is...
    Resource Type:
    Masters Thesis
    Full Text:
    ) = || ∫ Z k(z, ·)dDZ(z)− ∫ Z k(z, ·)dEZ(z)||Hk (3.5) and Hk is a reproducing kernel Hilbert space, and an

  • Agile Bipedal Locomotion via Hierarchical Control by Incorporating Physical Principles, Learning, and Optimization

    Creator:
    Green, Kevin
    Abstract:
    Robotic Bipedal locomotion holds the potential for efficient, robust traversal of difficult terrain. The difficulty lies in the dynamics of locomotion which complicate control and motion planning. Bipedal locomotion dynamics are dimensionally large problems, extremely nonlinear, and operate on the limits of actuator capabilities, which limit the performance of generic...
    Resource Type:
    Dissertation
    Full Text:
    Optimization Abstract approved: Jonathan Hurst Ross L. Hatton Robotic Bipedal locomotion holds the potential

  • Agile Bipedal Maneuvers Optimized then Learned from Single Rigid-Body Model Dynamics

    Creator:
    Batke, Ryan
    Abstract:
    As bipedal robots move ever closer to being integrated into all manner of real world envi-ronments there is a necessity to push their dynamic capabilities to meet or exceed those of humans and animals. Advancements must be made to address ordinary challenges that arise everyday in the same environments that...
    Resource Type:
    Masters Thesis
    Full Text:
    from being a suitable candidate 7 CoM F F L Figure 2.3: Sketch of a Centroidal Momentum Model

  • Probabilities of voting paradoxes with three candidates

    Creator:
    McDonald, Leslie M.
    Abstract:
    Pardoxes in voting has been an interest of voting theorists since the 1800's when Condorcet demonstrated the key example of a voting paradox: voters with individually transitive rankings produce an election outcome which is not transitive. With Arrow's Impossibility Theorem, the hope of finding a fair voting method which accurately...
    Resource Type:
    Masters Thesis
    Full Text:
    simulation when pk = 1 6 for all k . . . . . . . . . . . . 23 2.2 Probability of A being the pairwise winner

  • 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:
    function which is known as Squared Exponential: k(xi, xj) = σf exp ( − 1 l |xi − xj |2 ) , (2.2) where

  • Statistical Properties and Guarantees for Certain Anomaly Detection Relevant Problems

    Creator:
    Liu, Si
    Abstract:
    Anomaly detection aims at detecting the points that appear different than the majority of the data, such that they are suspected to be generated from a different distribution. Anomaly detectors have been applied in many different fields, such as detecting fraudulent behaviors in bank transaction, finding broken sensors in a...
    Resource Type:
    Dissertation
    Full Text:
    detector iForest, for the purpose of outputting the top k most anomalous points as early as possible. The

  • Weakly Supervised Learning for Activity Recognition from Time Series Data

    Creator:
    Guan, Xinze
    Abstract:
    The thesis focuses on activity recognition from sensor data, which has spurred a great deal of interest due to its impact on health care and security. Previous work on activity recognition from multivariate time series data has mainly applied supervised learning techniques which require a high degree of annotation effort...
    Resource Type:
    Dissertation
    Full Text:
    variable L introduced . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76 6.3 Average bag and

  • Planning in multi-agent partially observable domains using sparse sampling

    Creator:
    Donneau-Golencer, Thierry D.
    Abstract:
    A large number of sequential decision-making problems in uncertain environments can be modeled as Markov Decision Processes (MDPs). In such settings, an agent can observe at each time step the state of the environment and then executes an action, causing a stochastic transition to a new state of the environment...
    Resource Type:
    Masters Thesis
    Full Text:
    �1G<"�! ���8!���!/�89� I� "�9D"�!/K<"�!*L-0/����9IG<>�9HNMO�! �P0P�QRP2S2SKT U ����<"7+�EV W 7X&2/G