Arrow Research search

Author name cluster

Garrison Cottrell

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

13 papers
1 author row

Possible papers

13

AAAI Conference 2020 Conference Paper

Adversarial Dynamic Shapelet Networks

  • Qianli Ma
  • Wanqing Zhuang
  • Sen Li
  • Desen Huang
  • Garrison Cottrell

Shapelets are discriminative subsequences for time series classification. Recently, learning time-series shapelets (LTS) was proposed to learn shapelets by gradient descent directly. Although learning-based shapelet methods achieve better results than previous methods, they still have two shortcomings. First, the learned shapelets are fixed after training and cannot adapt to time series with deformations at the testing phase. Second, the shapelets learned by back-propagation may not be similar to any real subsequences, which is contrary to the original intention of shapelets and reduces model interpretability. In this paper, we propose a novel shapelet learning model called Adversarial Dynamic Shapelet Networks (AD- SNs). An adversarial training strategy is employed to prevent the generated shapelets from diverging from the actual subsequences of a time series. During inference, a shapelet generator produces sample-specific shapelets, and a dynamic shapelet transformation uses the generated shapelets to extract discriminative features. Thus, ADSN can dynamically generate shapelets that are similar to the real subsequences rather than having arbitrary shapes. The proposed model has high modeling flexibility while retaining the interpretability of shapelet-based methods. Experiments conducted on extensive time series data sets show that ADSN is state-of-the-art compared to existing shapelet-based methods. The visualization analysis also shows the effectiveness of dynamic shapelet generation and adversarial training.

AAAI Conference 2020 Conference Paper

Temporal Pyramid Recurrent Neural Network

  • Qianli Ma
  • Zhenxi Lin
  • Enhuan Chen
  • Garrison Cottrell

Learning long-term and multi-scale dependencies in sequential data is a challenging task for recurrent neural networks (RNNs). In this paper, a novel RNN structure called temporal pyramid RNN (TP-RNN) is proposed to achieve these two goals. TP-RNN is a pyramid-like structure and generally has multiple layers. In each layer of the network, there are several sub-pyramids connected by a shortcut path to the output, which can efficiently aggregate historical information from hidden states and provide many gradient feedback short-paths. This avoids back-propagating through many hidden states as in usual RNNs. In particular, in the multi-layer structure of TP- RNN, the input sequence of the higher layer is a large-scale aggregated state sequence produced by the sub-pyramids in the previous layer, instead of the usual sequence of hidden states. In this way, TP-RNN can explicitly learn multi-scale dependencies with multi-scale input sequences of different layers, and shorten the input sequence and gradient feedback paths of each layer. This avoids the vanishing gradient problem in deep RNNs and allows the network to efficiently learn longterm dependencies. We evaluate TP-RNN on several sequence modeling tasks, including the masked addition problem, pixelby-pixel image classification, signal recognition and speaker identification. Experimental results demonstrate that TP-RNN consistently outperforms existing RNNs for learning long-term and multi-scale dependencies in sequential data.

NeurIPS Conference 2006 Conference Paper

Recursive ICA

  • Honghao Shan
  • Lingyun Zhang
  • Garrison Cottrell

Independent Component Analysis (ICA) is a popular method for extracting independent features from visual data. However, as a fundamentally linear technique, there is always nonlinear residual redundancy that is not captured by ICA. Hence there have been many attempts to try to create a hierarchical version of ICA, but so far none of the approaches have a natural way to apply them more than once. Here we show that there is a relatively simple technique that transforms the absolute values of the outputs of a previous application of ICA into a normal distribution, to which ICA maybe applied again. This results in a recursive ICA algorithm that may be applied any number of times in order to extract higher order structure from previous layers.

NeurIPS Conference 2000 Conference Paper

The Early Word Catches the Weights

  • Mark Smith
  • Garrison Cottrell
  • Karen Anderson

The strong correlation between the frequency of words and their naming latency has been well documented. However, as early as 1973, the Age of Acquisition (AoA) of a word was alleged to be the actual variable of interest, but these studies seem to have been ignored in most of the lit(cid: 173) erature. Recently, there has been a resurgence of interest in AoA. While some studies have shown that frequency has no effect when AoA is con(cid: 173) trolled for, more recent studies have found independent contributions of frequency and AoA. Connectionist models have repeatedly shown strong effects of frequency, but little attention has been paid to whether they can also show AoA effects. Indeed, several researchers have explicitly claimed that they cannot show AoA effects. In this work, we explore these claims using a simple feed forward neural network. We find a sig(cid: 173) nificant contribution of AoA to naming latency, as well as conditions under which frequency provides an independent contribution.

NeurIPS Conference 1998 Conference Paper

Facial Memory Is Kernel Density Estimation (Almost)

  • Matthew Dailey
  • Garrison Cottrell
  • Thomas Busey

We compare the ability of three exemplar-based memory models, each using three different face stimulus representations, to account for the probability a human subject responded "old" in an old/new facial mem(cid: 173) ory experiment. The models are 1) the Generalized Context Model, 2) SimSample, a probabilistic sampling model, and 3) MMOM, a novel model related to kernel density estimation that explicitly encodes stim(cid: 173) ulus distinctiveness. The representations are 1) positions of stimuli in MDS "face space, " 2) projections of test faces onto the "eigenfaces" of the study set, and 3) a representation based on response to a grid of Gabor filter jets. Of the 9 model/representation combinations, only the distinc(cid: 173) tiveness model in MDS space predicts the observed "morph familiarity inversion" effect, in which the subjects' false alarm rate for morphs be(cid: 173) tween similar faces is higher than their hit rate for many of the studied faces. This evidence is consistent with the hypothesis that human mem(cid: 173) ory for faces is a kernel density estimation task, with the caveat that dis(cid: 173) tinctive faces require larger kernels than do typical faces.

NeurIPS Conference 1997 Conference Paper

Serial Order in Reading Aloud: Connectionist Models and Neighborhood Structure

  • Jeanne Milostan
  • Garrison Cottrell

If globally high dimensional data has locally only low dimensional distribu(cid: 173) tions, it is advantageous to perform a local dimensionality reduction before further processing the data. In this paper we examine several techniques for local dimensionality reduction in the context of locally weighted linear re(cid: 173) gression. As possible candidates, we derive local versions of factor analysis regression, principle component regression, principle component regression on joint distributions, and partial least squares regression. After outlining the statistical bases of these methods, we perform Monte Carlo simulations to evaluate their robustness with respect to violations of their statistical as(cid: 173) sumptions. One surprising outcome is that locally weighted partial least squares regression offers the best average results, thus outperforming even factor analysis, the theoretically most appealing of our candidate techniques.

NeurIPS Conference 1997 Conference Paper

Task and Spatial Frequency Effects on Face Specialization

  • Matthew Dailey
  • Garrison Cottrell

There is strong evidence that face processing is localized in the brain. The double dissociation between prosopagnosia, a face recognition deficit occurring after brain damage, and visual object agnosia, difficulty recognizing otber kinds of complex objects, indicates tbat face and non(cid: 173) face object recognition may be served by partially independent mecha(cid: 173) nisms in the brain. Is neural specialization innate or learned? We sug(cid: 173) gest that this specialization could be tbe result of a competitive learn(cid: 173) ing mechanism that, during development, devotes neural resources to the tasks they are best at performing. Furtber, we suggest that the specializa(cid: 173) tion arises as an interaction between task requirements and developmen(cid: 173) tal constraints. In this paper, we present a feed-forward computational model of visual processing, in which two modules compete to classify input stimuli. When one module receives low spatial frequency infor(cid: 173) mation and the other receives high spatial frequency information, and the task is to identify the faces while simply classifying the objects, the low frequency network shows a strong specialization for faces. No otber combination of tasks and inputs shows this strong specialization. We take these results as support for the idea that an innately-specified face processing module is unnecessary.

NeurIPS Conference 1996 Conference Paper

Representation and Induction of Finite State Machines using Time-Delay Neural Networks

  • Daniel Clouse
  • C. Giles
  • Bill Horne
  • Garrison Cottrell

This work investigates the representational and inductive capabili(cid: 173) ties of time-delay neural networks (TDNNs) in general, and of two subclasses of TDNN, those with delays only on the inputs (IDNN), and those which include delays on hidden units (HDNN). Both ar(cid: 173) chitectures are capable of representing the same class of languages, the definite memory machine (DMM) languages, but the delays on the hidden units in the HDNN helps it outperform the IDNN on problems composed of repeated features over short time windows.

NeurIPS Conference 1996 Conference Paper

Representing Face Images for Emotion Classification

  • Curtis Padgett
  • Garrison Cottrell

We compare the generalization performance of three distinct rep(cid: 173) resentation schemes for facial emotions using a single classification strategy (neural network). The face images presented to the clas(cid: 173) sifiers are represented as: full face projections of the dataset onto their eigenvectors (eigenfaces); a similar projection constrained to eye and mouth areas (eigenfeatures); and finally a projection of the eye and mouth areas onto the eigenvectors obtained from 32x32 random image patches from the dataset. The latter system achieves 86% generalization on novel face images (individuals the networks were not trained on) drawn from a database in which human sub(cid: 173) jects consistently identify a single emotion for the face.

NeurIPS Conference 1994 Conference Paper

Phase-Space Learning

  • Fu-Sheng Tsung
  • Garrison Cottrell

Existing recurrent net learning algorithms are inadequate. We in(cid: 173) troduce the conceptual framework of viewing recurrent training as matching vector fields of dynamical systems in phase space. Phase(cid: 173) space reconstruction techniques make the hidden states explicit, reducing temporal learning to a feed-forward problem. In short, we propose viewing iterated prediction [LF88] as the best way of training recurrent networks on deterministic signals. Using this framework, we can train multiple trajectories, insure their stabil(cid: 173) ity, and design arbitrary dynamical systems.

NeurIPS Conference 1993 Conference Paper

Learning Mackey-Glass from 25 examples, Plus or Minus 2

  • Mark Plutowski
  • Garrison Cottrell
  • Halbert White

We apply active exemplar selection (Plutowski &. White, 1991; 1993) to predicting a chaotic time series. Given a fixed set of ex(cid: 173) amples, the method chooses a concise subset for training. Fitting these exemplars results in the entire set being fit as well as de(cid: 173) sired. The algorithm incorporates a method for regulating network complexity, automatically adding exempla. rs and hidden units as needed. Fitting examples generated from the Mackey-Glass equa(cid: 173) tion with fractal dimension 2. 1 to an rmse of 0. 01 required about 25 exemplars and 3 to 6 hidden units. The method requires an order of magnitude fewer floating point operations than training on the entire set of examples, is significantly cheaper than two contend(cid: 173) ing exemplar selection techniques, and suggests a simpler active selection technique that performs comparably.

NeurIPS Conference 1992 Conference Paper

Non-Linear Dimensionality Reduction

  • David DeMers
  • Garrison Cottrell

A method for creating a non-linear encoder-decoder for multidimensional data with compact representations is presented. The commonly used technique of autoassociation is extended to allow non-linear representations, and an objec(cid: 173) tive function which penalizes activations of individual hidden units is shown to result in minimum dimensional encodings with respect to allowable error in reconstruction.

NeurIPS Conference 1990 Conference Paper

EMPATH: Face, Emotion, and Gender Recognition Using Holons

  • Garrison Cottrell
  • Janet Metcalfe

The dimens~onali~y of a set Off 160 1: ~: a: ~s ~~·. 10. female subjects IS reduced. .. .. .. .. network The extracted features do not correspond to in previ~us face recognition systems (KaR· na~e, 19~; )y'. .. .. .••. •. . f~tures we call holons. The hol. ons are fV~~ t~! .. .. .. .. .. .. .. \ d' tances between facial elements.