Search Constraints

Start Over
Filtering by: Creator Palo, Daniel R. Remove constraint Creator: Palo, Daniel R. Academic Affiliation Electrical Engineering and Computer Science Remove constraint Academic Affiliation: Electrical Engineering and Computer Science Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • Visual object discovery and understanding

    Creator:
    Yuan, Jialin
    Abstract:
    Learning to recognize objects is a fundamental and essential step in human perception and understanding of the world. Accordingly, research of object discovery across diverse modalities plays a pivotal role in the context of computer vision. This field not only contributes significantly to enhancing our understanding of visual information but...
    Resource Type:
    Dissertation
    Full Text:
    almost as good as mask R-CNN without depending on a two-stage framework. Note that the training of the

  • 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:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 2.4 FC-DRP vs S-DRP vs R-DRP Results . . . . . . . . . . . . . . . . . . . . 19 3.1 Game-of-Life

  • Learning greedy policies for the easy-first framework

    Creator:
    Xie, Jun
    Abstract:
    Easy-first, a search-based structured prediction approach, has been applied to many NLP tasks including dependency parsing and coreference resolution. This approach employs a learned greedy policy (action scoring function) to make easy decisions first, which constrains the remaining decisions and makes them easier. This thesis studies the problem of learning...
    Resource Type:
    Masters Thesis
    Full Text:
    function L(x, y′, y) : X ×Y ×Y 7→ R+ associates a loss with labeling an input xwith y′ when its true output

  • Explanations and Processes to Enable Humans to Assess AI with Respect to Manipulable Properties

    Creator:
    Dodge, Jonathan E.
    Abstract:
    Assessing AI systems is difficult. Humans rely on AI systems in increasing ways, both visible and invisible, meaning a variety of stakeholders need a variety of assessment tools (e.g., a professional auditor, a developer, and an end user all have different needs). We posit that it is possible to provide...
    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:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . 26 2.2.3 Properties of Minimal (Q, r)-vertex-connected Graphs . . . . . . . 27 2.2.4 Cycles Must

  • A Study of Temporal Convolutional Neural Networks for Music Language Modeling as Applied to Automatic Music Transcription

    Creator:
    Meyn, Matthew
    Abstract:
    Automatic music transcription (AMT) is the task, given an acoustic representation of music, to recover a symbolic notation of the written notes expressed by the sound. Transcribing music with multiple notes sounding simultaneously is difficult for both humans and machines. Much existing work on AMT has focused on suitable acoustic...
    Resource Type:
    Capstone Project
    Full Text:
    TPnt TPnt + FPnt R = ΣTt=1Σ N n=1 TPnt FNnt + TPnt 19 where time t ranges from the initial frame

  • Image features and learning algorithms for biological, generic and social object recognition

    Creator:
    Zhang, Wei
    Abstract:
    Automated recognition of object categories in images is a critical step for many real-world computer vision applications. Interest region detectors and region descriptors have been widely employed to tackle the variability of objects in pose, scale, lighting, texture, color, and so on. Different types of object recognition problems usually require...
    Resource Type:
    Dissertation
    Full Text:
    . James Begole, Dr. Juan Liu and Dr. Maurice Chu in the Palo Alto Research Center. It was such a

  • Activity recognition in desktop environments

    Creator:
    Shen, Jianqiang
    Abstract:
    Knowledge workers are struggling in the information flood. There is a growing interest in intelligent desktop environments that help knowledge workers organize their daily life. Intelligent desktop environments allow the desktop user to define a set of “activities” that characterize the user’s desktop work. These environments then attempt to identify...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93 4.3 Four occurrences of a frequent pattern. S: SaveAs, C: Copy&Paste, F: File Copy, R: File

  • Machine learning methods for public policy : simulation, optimization, and visualization

    Creator:
    McGregor, Sean
    Abstract:
    Society faces many complex management problems, particularly in the area of shared public resources such as ecosystems. Existing decision making processes are often guided by personal experience and political ideology rather than state-of-the-art scientific understanding. This dissertation envisions a future in which multiple stakeholders are provided with computational tools for...
    Resource Type:
    Dissertation
    Full Text:
    designated start state distribution [7, 48] M = 〈S,A, P,R, γ, P0〉. S is a finite set of states of the world

  • Learning ranking functions for efficient search

    Creator:
    Xu, Yuehua
    Abstract:
    This dissertation explores algorithms for learning ranking functions to efficiently solve search problems, with application to automated planning. Specifically, we consider the frameworks of beam search, greedy search, and randomized search, which all aim to maintain tractability at the cost of not guaranteeing completeness nor optimality. Our learning objective for...
    Resource Type:
    Dissertation
    Full Text:
    total rank ordering as r(v′, v|w,<), or just r(v′, v) when w and < are clear from context, indicating