Search Constraints

Start Over
Filtering by: Creator Koenen, Erik J. M. Remove constraint Creator: Koenen, Erik J. M. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • Auxiliary Tasks for Efficient Learning of Point-Goal Navigation

    Creator:
    Desai, Saurabh Satish
    Abstract:
    Top-performing approaches to embodied AI tasks like point-goal navigation often rely on training agents via reinforcement learning over tens of millions (or even billions) of experiential steps – learning neural agents that map directly from visual observations to actions. In this work, we question whether these extreme training durations are...
    Resource Type:
    Masters Thesis
    Full Text:
    for Efficient Learning of Point-Goal Navigation Abstract approved: Stefan M. Lee Top-performing

  • Analytical Methods for Improving Causal Inference

    Creator:
    Sinha, Meghamala
    Abstract:
    Causal inference is an important analytical tool to bridge the gap between prediction and decision-making. However, learning a causal network solely from data is a challenging task. In this work, various techniques have been explored for a better and improved causal network learning from data. Firstly, the problem of learning...
    Resource Type:
    Dissertation
    Full Text:
    distribution of p after intervention is: p(V1, ..., Vn) = ∏ Vi∈Oe pi(Vi | Pa(Vi)) · ∏ Vj∈Ie p′j(Vj | Pa(Vj

  • Semantic embodied navigation : developing agents that navigate from language and vision

    Creator:
    Krantz, Jacob
    Abstract:
    Autonomous robotic agents are on their way to becoming in-home personal assistants, construction assistants, and warehouse workers. The degree of autonomy of such systems is reflected by the manner in which we specify goals to them; the abstraction of low-level commands to high-level goals goes hand-in-hand with increased autonomy. In...
    Resource Type:
    Dissertation

  • Approximation Schemes in Planar Graphs

    Creator:
    Zheng, Baigong
    Abstract:
    There are growing interests in designing polynomial-time approximation schemes (PTAS) for optimization problems in planar graphs. Many NP-hard problems are shown to admit PTAS in planar graphs in the last decade, including Steiner tree, Steiner forest, two- edge-connected subgraphs and so on. We follow this research line and study several...
    Resource Type:
    Dissertation
    Full Text:
    graphs runs in O(mn) time by combining the algorithms of King et al. [85] and Orlin [104], where m and n

  • Learning with Limited Labeled Data in Natural Language Processing

    Creator:
    Obeidat, Rasha
    Abstract:
    The advent of deep learning models leads to a substantial improvement in a wide range of NLP tasks, achieving state-of-art performances without any hand-crafted features. However, training deep models requires a massive amount of labeled data. Labeling new data as a new task or domain emerges consumes time and efforts...
    Resource Type:
    Dissertation
    Full Text:
    transformation {ti(x)}mi=1 of the labeled instance x, and then set P (y|x) to P (y|ti(x)) ∀i ∈ 1, ...,m. These

  • 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

  • Leveraging Structures of the Data in Deep Learning

    Creator:
    Li, Xingyi
    Abstract:
    The performance of deep learning frameworks could be significantly improved through considering the particular underlying structures for each dataset. In this thesis, I summarize our three work about boosting the performance of deep learning models through leveraging structures of the data. In the first work, we theoretically justify that, for...
    Resource Type:
    Dissertation
    Full Text:
    =1 gi m∑ j=1 xij −w′k · N∑ i=1 gi m∑ j=1 xij‖2 (2.14) 11 The first inequality is Cauchy

  • 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:
    each round the starting position 21 T a b le 3. 1: M M re su lt s fo r co n tr ol ta sk s

  • Offensive Direction Inference in Real-World Football Video

    Creator:
    Lu, Qingkai
    Abstract:
    Automatic analysis of American football videos can help teams develop strategies and extract patterns with less human effort. In this work, we focus on the problem of automatically determining which team is on offense/defense, which is an important subproblem for higher-level analysis. While seemingly mundane, this problem is quite challenging...
    Resource Type:
    Masters Thesis
    Full Text:
    features in feature space. Assume the features extracted from one image are clustered into M discrete

  • Representationally Robust and Scalable Learning over Relational Databases

    Creator:
    Picado Leiva, Jose Manuel
    Abstract:
    Learning novel concepts from relational databases is an important problem with applications in several disciplines, such as data management, natural language processing, and bioinformatics. For a learning algorithm to be effective, the input data should be clean and in some desired representation. However, real-world data is usually heterogeneous – the...
    Resource Type:
    Dissertation
    Full Text:
    IMDb data (h=hours, m=minutes, s=seconds). . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87