Search Constraints

Start Over
Filtering by: Creator Volker, K. C. Remove constraint Creator: Volker, K. C. 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
    Full Text:
    communication using a CNN trained with (a) 4 robots, (b) 8 robots, and (c) 12 robots. MCTS (Random) CNN

  • Customizable Visual Traces for Program Explanations

    Creator:
    Bajaj, Divya
    Abstract:
    Correctness and efficiency are important properties of programs. However, to support maintenance and debugging, the programs should also be understandable. Program explanations also play a vital role in educational settings, enhancing the understanding of programs among students. Proof trees provide a sound basis for generating dynamic explanations of programs. But...
    Resource Type:
    Masters Thesis
    Full Text:
    Removing intermediate node c from trace in Figure 5.1 . . . . . . . . . . 29 5.3 Hiding node c from trace

  • 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:
    based on MEI. Input: Batch size (k), the believer constant (c), current observation O = (xO,yO). x

  • 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:
    are at least k points with upper bounds lower than this value plus �c(n) log2(1 � ⇢). If so, we can

  • Object detection in biological images using a search-based framework

    Creator:
    Lam, Michael
    Abstract:
    This thesis addresses a basic problem in computer vision, that of semantic labeling of images. Our work is aimed at object detection in biological images for evolutionary biology research. In particular, our goal is to detect nematocysts in Scanning Electron Microscope (SEM) images. This biological domain presents challenges for existing...
    Resource Type:
    Masters Thesis
    Full Text:
    candidate labelings, and then applies a cost function (C) to select the best- scoring prediction among the

  • Anomaly Detection and Probabilistic Diagnosis for Automated Data Quality Control

    Creator:
    Zemicheal, Tadesse H.
    Abstract:
    Advances in sensor technology are greatly expanding the range of quantities that can be measured while simultaneously reducing the cost. However, deployed sensors drift out of calibration and fail, so every sensor network requires quality control procedures to promptly detect these failures. To address these problems, we propose a two-level...
    Resource Type:
    Dissertation
    Full Text:
    mixture model gives the most effective anomaly detections for this task. c©Copyright by Tadesse H

  • Uncertainty in Deep Learning with Implicit Neural Networks

    Creator:
    Ratzlaff, Neale
    Abstract:
    The ability to extract uncertainties from predictions is crucial for the adoption of deep learning systems to safety-critical applications. Uncertainty estimates can be used as a failure signal, which is necessary for automating complex tasks where safety is a concern. Furthermore, current deep learning systems do not provide uncertainty estimates,...
    Resource Type:
    Dissertation
    Full Text:
    comparably to HMC; (c) Our proposed GPVI performs similarly to SVGD, with the additional capability of

  • Deep Learning for Human and Biological Languages

    Creator:
    Hong, Junki
    Abstract:
    We explore the application of deep learning to the disparate fields of natural language processing and computational biology. Both the sentences uttered by humans as well as the RNA and protein sequences found within the cells of their bodies can be considered formal languages in computer science, as sets of...
    Resource Type:
    Dissertation
    Full Text:
    : ⟨j, j + 1⟩ : (c+ ξ, ξ) j < n reduce ℓ′ : ⟨k, i⟩ : (c′, v′) ℓ : ⟨i, j⟩ : ( , v) ℓ+ 1 : ⟨k, j⟩ : (c

  • 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:
    /c')�h3 "-2/�H_�9/K<>Di8!&2/NMO�jHJ-)*��!7��!*N&EDkAC&2 \g2-`'l$.�!89�+D"��-0/ W \-�89�!D"D\�!D

  • Incorporating labeled features into image classification using generalized expectation

    Creator:
    Moore, Travis
    Abstract:
    Image classification is a difficult problem, often requiring large training sets to get satisfactory results. However this is a task that humans perform very well, and incorporating user feedback into these learning algorithms could help reduce the dependency on large amounts of labeled training data. This process has already been...
    Resource Type:
    Masters Thesis
    Full Text:
    formulation. 7 P (~Y | ~X) = 1 Z( ~X) ∏ c∈C ∏ Ψc∈c exp( K(c)∑ k=1 λckfck(~yΨc , ~xΨc)) (3.2) Here C