Search Constraints

Start Over
Filtering by: Creator Blaustein, Andrew R. Remove constraint Creator: Blaustein, Andrew R. Committee Member Wong, Weng-Keen Remove constraint Committee Member: Wong, Weng-Keen

Search Results

  • Modeling protein structure at atomic resolution

    Creator:
    Berkholz, Donald S.
    Abstract:
    This thesis includes three studies involving different aspects of modeling protein structure. The first study illustrates the levels of insight available from atomic-resolution protein structures. The second study derives general trends of protein geometry from atomic-resolution structures and shows their implications for modeling. The third study creates a model of...
    Resource Type:
    Dissertation
    Full Text:
    : P. Andrew Karplus This thesis includes three studies involving different aspects of modeling

  • Effects of spatial scale and heterogeneity on avian occupancy dynamics and population trends in forested mountain landscapes

    Creator:
    Frey, Sarah J. K.
    Abstract:
    Population trends and patterns in species distributions are the major currencies used to examine responses by biodiversity to changing environments. Effective conservation recommendations require that models of both distribution dynamics and population trends accurately reflect reality. However, identification of the appropriate temporal and spatial scales of animal response, and then...
    Resource Type:
    Dissertation
    Full Text:
    were correlated with regional and local trends, but generally these correlations were weak (r = 0.12

  • New Directions in Search-based Structured Prediction: Multi-Task Learning and Integration of Deep Models

    Creator:
    Ma, Chao
    Abstract:
    This thesis studies the problem of structured prediction (SP), where the agent needs to predict a structured output for a given structured input (e.g., Part-of-Speech tagging sequence for an input sentence). Many important applications including machine translation in natural language processing (NLP) and image interpretation in computer vision can be...
    Resource Type:
    Dissertation
    Full Text:
    structured outputs Y , and a non-negative output loss function l : X × Y × Y → R+. Each structured input x

  • Revisiting output coding for sequential supervised learning

    Creator:
    Hao, Guohua
    Abstract:
    Markov models are commonly used for joint inference of label sequences. Unfortunately, inference scales quadratically in the number of labels, which is problematic for training methods where inference is repeatedly preformed and is the primary computational bottleneck for large label sets. Recent work has used output coding to address this...
    Resource Type:
    Masters Thesis
    Full Text:
    xit and the predictions of the previous h binary CRFs at sequence positions from t − l to t + r (l

  • A study of methods for fine-grained object classification of arthropod specimens

    Creator:
    Lin, Junyuan
    Abstract:
    Object categorization is one of the fundamental topics in computer vision research. Most current work in object categorization aims to discriminate among generic object classes with gross differences. However, many applications require much finer distinctions. This thesis focuses on the design, evaluation and analysis of learning algorithms for fine- grained...
    Resource Type:
    Masters Thesis
    Full Text:
    estimator [32]. All descriptor vectors that are within a fixed radius r of the cluster center are assigned

  • Open Set Learning with Counterfactual Images

    Creator:
    Neal, Lawrence W.
    Abstract:
    In open set recognition, a classifier must label instances of known classes while detecting instances of unknown classes not encountered during training. To detect unknown classes while still generalizing to new instances of existing classes, this thesis introduces a dataset augmentation technique called counterfactual image generation. This approach, based on...
    Resource Type:
    Masters Thesis
    Full Text:
    We treat Cp : R n → {0, 1} as an indicator function with the value 1 if p is true. Given the optimal

  • Efficient training and feature induction in sequential supervised learning

    Creator:
    Hao, Guohua
    Abstract:
    Sequential supervised learning problems arise in many real applications. This dissertation focuses on two important research directions in sequential supervised learning: efficient training and feature induction. In the direction of efficient training, we study the training of conditional random fields (CRFs), which provide a flexible and powerful model for sequential...
    Resource Type:
    Dissertation
    Full Text:
    recommended by Andrew McCallum (personal communication). We did not optimize the window size, but instead

  • Integrating learning and search for structured prediction

    Creator:
    Doppa, Janardhan Rao
    Abstract:
    We are witnessing the rise of the data-driven science paradigm, in which massive amounts of data - much of it collected as a side-effect of ordinary human activity - can be analyzed to make sense of the data and to make useful predictions. To fully realize the promise of this...
    Resource Type:
    Dissertation
    Full Text:
    , Drew Bagnell, Roni Khardon, Andrew McCallum, Lise Getoor, Jason Eisner, Hal Daumé III, John Langford

  • UCT for tactical assault battles in real-time strategy games

    Creator:
    Balla, Radha-Krishna
    Abstract:
    We consider the problem of tactical assault planning in real-time strategy games where a team of friendly agents must launch an assault on an enemy. This problem offers many challenges including a highly dynamic and uncertain environment, multiple agents, durative actions, numeric attributes, and different optimization objectives. While the dynamics...
    Resource Type:
    Masters Thesis
    Full Text:
    the best action a from state s. Finally, after the trajectory reaches a terminal state the reward R

  • 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