Search Constraints

Start Over
Filtering by: Creator Meyers, S. Mark Remove constraint Creator: Meyers, S. Mark Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad Decade 2020-2029 Remove constraint Decade: 2020-2029

Search Results

  • A General Purpose Agent-Based Blackboard Optimization Method Applied to Sodium Fast Reactor Design and Analysis

    Creator:
    Stewart, Ryan H.
    Abstract:
    We present a novel multi-objective optimization methodology built upon a multi-agent blackboard framework. This multi-agent blackboard system (MABS) synthesizes blackboard architectures, multi-agent environments, and optimization theory. The blackboard architecture creates the framework for initializing, storing, and solving a multi-objective optimization problem. Multiple agents allow for an optimization problem to be...
    Resource Type:
    Dissertation
    Full Text:
    Abstract approved: Todd S. Palmer We present a novel multi-objective optimization methodology built upon

  • 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:
    , Prof. N. S. Narayanaswamy and Prof. Deepak Khemani at IIT Madras, and Prof. Anselm Blumer at Tufts

  • 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

  • Improving and Understanding Deep Models for Natural Language Comprehension

    Creator:
    Ghaeini, Reza
    Abstract:
    Natural Language Comprehension is a challenging domain of Natural Language Processing. To improve a model’s language comprehension/understanding, one approach would be to enrich the structure of the model to enhance its capability in learning the latent rules of the language. In this dissertation, we will first introduce several deep models...
    Resource Type:
    Dissertation
    Full Text:
    Categorical performance analyses (accuracy) of ESIM [11], DR-BiLSTM (DR(S)) and Ensemble DR-BiLSTM (DR(E)) on

  • Variational Satisfiability Solving

    Creator:
    Young, Jeffrey M.
    Abstract:
    Over the last two decades, satisfiability and satisfiability-modulo theory (SAT/SMT) solvers have grown powerful enough to be general purpose reasoning engines throughout software engineering and computer science. However, most practical use cases of SAT/SMT solvers require not just solving a single SAT/SMT problem, but solving sets of related SAT/SMT problems....
    Resource Type:
    Dissertation
    Full Text:
    shared elements and one to sum the rest. With this procedure the summation of ns is ∑ n∈ns n = ∑ s∈ss

  • A Benchmarking Study of Unsupervised Anomaly Detection Algorithms

    Creator:
    Emmott, Andrew F.
    Abstract:
    It is common practice in the unsupervised anomaly detection literature to create experimental benchmarks by sampling from existing supervised learning datasets. We seek to improve this practice by identifying four dimensions important to real-world anomaly detection applications --- point difficulty, clusteredness of anomalies, relevance of features, and relative frequency of...
    Resource Type:
    Masters Thesis
    Full Text:
    simulate and control these factors when sampling points during bench- mark creation. We apply this

  • Action Segmentation in Videos: Deep Models, Prediction Diffusion, and Deep-Temporal Augmentations

    Creator:
    Aziere, Nicolas
    Abstract:
    This paper addresses the high model complexity and overconfident frame labeling of state-of-the-art (SOTA) action segmenters. Their complexity is typically justified by the need to sequentially refine action segmentation through multiple stages of a deep architecture. However, this multistage refinement does not take into account uncertainty of frame labeling predicted...
    Resource Type:
    Dissertation
    Full Text:
    3.2 The T at stage s enhances features of a query video segment X (s) i based on compressed

  • Knowledge Base Completion Leveraging Natural Language Data

    Creator:
    Shahbazi, Hamed
    Abstract:
    Information about named entities (real-world objects) is usually harvested from different sources and organized as a multiple relational directed graph in Knowledge Bases (KBs). KBs play essential roles in many NLP modules including question answering, fact-checking, search engines, etc. KBs are big but still incomplete: relational information among entities is...
    Resource Type:
    Dissertation
    Full Text:
    , ...yn] of referent entities to maximize the following score: s(Y) = n∑ i=1 ψ(xi, yi) + n∑ i=1 n∑ j=1

  • Scheduling and Online Planning in Stochastic Diffusion Networks

    Creator:
    Xue, Shan
    Abstract:
    Diffusion processes in networks are common models for many domains, including species colonization, information/idea cascade, disease propagation and fire spreading. In diffusion networks, a diffusion event occurs when a behavior spreads from one node to the other following a probabilistic model, where the behavior could be species, an idea, a...
    Resource Type:
    Dissertation
    Full Text:
    vertex r, a set of terminal vertices T , and a set of edges sets E = {Es : s = 1, . . . ,M}, where each

  • 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:
    ) HalfCheetah and b) Maze2d-Open. For each PCQ (s, π, ŝ, π̂, h), we plot V π(s, h) vs. V π̂(ŝ, h