TMTravis Monk

Travis Monk

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Travis Monk has a total of 23 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    The Leaky Integrate-and-Fire Neuron Is a Change-Point Detector for Compound Poisson Processes

    by Shivaram Mani, Paul Hurley, André van Schaik, Travis Monk

    Animal nervous systems can detect changes in their environments within hundredths of a second. They do so by discerning abrupt shifts in sensory neural activity. Many neuroscience studies have employed change-point detection (CPD) algorithms to estimate such abrupt shifts in neural activity. But very few studies have suggested that spiking neurons themselves are online change-point detectors. We show that a leaky integrate-and-fire (LIF) neuron implements an online CPD algorithm for a compound Poisson process. We quantify the CPD performance of an LIF neuron under various regions of its parameter space. We show that CPD can be a recursive algorithm where the output of one algorithm can be input to another. Then we show that a simple feedforward network of LIF neurons can quickly and reliably detect very small changes in input spiking rates. For example, our network detects a 5% change in input rates within 20 ms on average, and false-positive detections are extremely rare. In a rigorous statistical context, we interpret the salient features of the LIF neuron: its membrane potential, synaptic weight, time constant, resting potential, action potentials, and threshold. Our results potentially generalize beyond the LIF neuron model and its associated CPD problem. If spiking neurons perform change-point detection on their inputs, then the electrophysiological properties of their membranes must be related to the spiking statistics of their inputs. We demonstrate one example of this relationship for the LIF neuron and compound Poisson processes and suggest how to test this hypothesis more broadly. Maybe neurons are not noisy devices whose action potentials must be averaged over time or populations. Instead, neurons might implement sophisticated, optimal, and online statistical algorithms on their inputs.


  • Open Access

    Electrical Signaling Beyond Neurons

    by Travis Monk, Nik Dennler, Nicholas Ralph, Shavika Rastogi, Saeed Afshar, Pablo Urbizagastegui, Russell Jarvis, André van Schaik, Andrew Adamatzky

    Neural action potentials (APs) are difficult to interpret as signal encoders and/or computational primitives. Their relationships with stimuli and behaviors are obscured by the staggering complexity of nervous systems themselves. We can reduce this complexity by observing that “simpler” neuron-less organisms also transduce stimuli into transient electrical pulses that affect their behaviors. Without a complicated nervous system, APs are often easier to understand as signal/response mechanisms. We review examples of nonneural stimulus transductions in domains of life largely neglected by theoretical neuroscience: bacteria, protozoans, plants, fungi, and neuron-less animals. We report properties of those electrical signals—for example, amplitudes, durations, ionic bases, refractory periods, and particularly their ecological purposes. We compare those properties with those of neurons to infer the tasks and selection pressures that neurons satisfy. Throughout the tree of life, nonneural stimulus transductions time behavioral responses to environmental changes. Nonneural organisms represent the presence or absence of a stimulus with the presence or absence of an electrical signal. Their transductions usually exhibit high sensitivity and specificity to a stimulus, but are often slow compared to neurons. Neurons appear to be sacrificing the specificity of their stimulus transductions for sensitivity and speed. We interpret cellular stimulus transductions as a cell’s assertion that it detected something important at that moment in time. In particular, we consider neural APs as fast but noisy detection assertions. We infer that a principal goal of nervous systems is to detect extremely weak signals from noisy sensory spikes under enormous time pressure. We discuss neural computation proposals that address this goal by casting neurons as devices that implement online, analog, probabilistic computations with their membrane potentials. Those proposals imply a measurable relationship between afferent neural spiking statistics and efferent neural membrane electrophysiology.


  • Open Access

    Martingales and the fixation time of evolutionary graphs with arbitrary dimensionality

    by Travis Monk, André van Schaik

    Evolutionary graph theory (EGT) investigates the Moran birth–death process constrained by graphs. Its two principal goals are to find the fixation probability and time for some initial population of mutants on the graph. The fixation probability of graphs has received considerable attention. Less is known about the distribution of fixation time. We derive clean, exact expressions for the full conditional characteristic functions (CCFs) of a close proxy to fixation and extinction times. That proxy is the number of times that the mutant population size changes before fixation or extinction. We derive these CCFs from a product martingale that we identify for an evolutionary graph with any number of partitions. The existence of that martingale only requires that the connections between those partitions are of a certain type. Our results are the first expressions for the CCFs of any proxy to fixation time on a graph with any number of partitions. The parameter dependence of our CCFs is explicit, so we can explore how they depend on graph structure. Martingales are a powerful approach to study principal problems of EGT. Their applicability is invariant to the number of partitions in a graph, so we can study entire families of graphs simultaneously.


  • Open Access

    Martingales and the characteristic functions of absorption time on bipartite graphs

    by Travis Monk, André van Schaik

    Evolutionary graph theory investigates how spatial constraints affect processes that model evolutionary selection, e.g. the Moran process. Its principal goals are to find the fixation probability and the conditional distributions of fixation time, and show how they are affected by different graphs that impose spatial constraints. Fixation probabilities have generated significant attention, but much less is known about the conditional time distributions, even for simple graphs. Those conditional time distributions are difficult to calculate, so we consider a close proxy to it: the number of times the mutant population size changes before absorption. We employ martingales to obtain the conditional characteristic functions (CCFs) of that proxy for the Moran process on the complete bipartite graph. We consider the Moran process on the complete bipartite graph as an absorbing random walk in two dimensions. We then extend Wald’s martingale approach to sequential analysis from one dimension to two. Our expressions for the CCFs are novel, compact, exact, and their parameter dependence is explicit. We show that our CCFs closely approximate those of absorption time. Martingales provide an elegant framework to solve principal problems of evolutionary graph theory. It should be possible to extend our analysis to more complex graphs than we show here.


  • Investigation of Auditory Nerve Model and Conventional Approaches in Noise-Robust Speaker Identification

    by Atiqul Islam, Ying Xu, Saeed Afshar, Travis Monk, Andre Van Schaik

    Automatic Speaker Identification (SID) is growing for the current demands of human-machine interaction in different fields, such as selfless driving vehicles, access to smartphones and laptops, and online security. These services become challenging while background noise is present. To achieve a noise-robust performance in adverse conditions, we propose two front-end feature extraction algorithms using the Auditory Nerve (AN) model. One algorithm uses energies of the Inner Hair Cell (IHC) response from the AN model. Another uses the energies of the linear chirp filter from the AN model followed by the cubic root and Discrete Cosine Transform (DCT). We investigate which algorithm is better in the SID task. We also use a modified Gammatone Filter Cepstral Coefficient (GFCC) as a reference. We tested these algorithms using text-dependent and text-independent speeches under clean and noisy conditions. This work shows that the performance of the proposed algorithms is way better than the previously proposed algorithm using the AN model. The algorithms with conventional nonlinearities significantly outperform the IHC algorithm in the noise-robust SID task. However, the application of conventional nonlinearities on the IHC algorithm provides a significantly improved SID performance.

  • Wald’s martingale and the conditional distributions of absorption time in the Moran process

    by Travis Monk, André van Schaik

    Many models of evolution are stochastic processes, where some quantity of interest fluctuates randomly in time. One classic example is the Moranbirth–death process, where that quantity is the number of mutants in a population. In such processes, we are often interested in their absorption (i.e. fixation) probabilities and the conditional distributions of absorption time. Those conditional time distributions can be very difficult to calculate, even for relatively simple processes like the Moran birth–death model. Instead of considering the time to absorption, we consider a closely related quantity: the number of mutant population size changes before absorption. We use Wald’s martingale to obtain the conditional characteristic functions of that quantity in the Moran process. Our expressions are novel, analytical and exact, and their parameter dependence is explicit. We use our results to approximate the conditional characteristic functions of absorption time. We state the conditions under which that approximation is particularly accurate. Martingales are an elegant framework to solve principal problems of evolutionary stochastic processes. They do not require us to evaluate recursion relations, so when they are applicable, we can quickly and tractably obtain absorption probabilities and times of evolutionary models.


  • Open Access

    Wald’s martingale and the Moran process

    by Travis Monk, André van Schaik

    Many models of evolution are stochastic processes, where some quantity of interest fluctuates randomly in time. One classic example is the Moran birth-death process, where that quantity is the number of mutants in a population. In such processes we are often interested in their absorption (i.e. fixation) probabilities, and the conditional distributions of absorption time. Those conditional time distributions can be very difficult to calculate, even for relatively simple processes like the Moran birth-death model. Instead of considering the time to absorption, we consider a closely-related quantity: the number of mutant population size changes before absorption. We use Wald’s martingale to obtain the conditional characteristic functions of that quantity in the Moran process. Our expressions are novel, analytical, and exact. The parameter dependence of the characteristic functions is explicit, so it is easy to explore their properties in parameter space. We also use them to approximate the conditional characteristic functions of absorption time. We state the conditions under which that approximation is particularly accurate. Martingales are an elegant framework to solve principal problems of evolutionary stochastic processes. They do not require us to evaluate recursion relations, so we can quickly and tractably obtain absorption probabilities and times of evolutionary stochastic processes. Author summary The Moran process is a probabilistic birth-death model of evolution. A mutant is introduced to an indigenous population, and we randomly choose organisms to live or die on subsequent time steps. Our goals are to calculate the probabilities that the mutant eventually dominates the population or goes extinct, and the distribution of time it requires to do so. The conditional distributions of time are difficult to obtain for the Moran process, so we consider a slightly different but related problem. We instead calculate the conditional distributions of the number of times that the mutant population size changes before it dominates the population or goes extinct. We use a martingale identified by Abraham Wald to obtain elegant and exact expressions for those distributions. We then use them to approximate conditional time distributions, and we show when that approximation is accurate. Our analysis outlines the basic concepts martingales and demonstrates why they are a formidable tool for studying probabilistic evolutionary models such as the Moran process.

  • Open Access

    Optimal neural inference of stimulus intensities

    by Travis Monk, Cristina Savin, Jörg Lücke

    In natural data, the class and intensity of stimuli are correlated. Current machine learning algorithms ignore this ubiquitous statistical property of stimuli, usually by requiring normalized inputs. From a biological perspective, it remains unclear how neural circuits may account for these dependencies in inference and learning. Here, we use a probabilistic framework to model class-specific intensity variations, and we derive approximate inference and online learning rules which reflect common hallmarks of neural computation. Concretely, we show that a neural circuit equipped with specific forms of synaptic and intrinsic plasticity (IP) can learn the class-specific features and intensities of stimuli simultaneously. Our model provides a normative interpretation of IP as a critical part of sensory learning and predicts that neurons can represent nontrivial input statistics in their excitabilities. Computationally, our approach yields improved statistical representations for realistic datasets in the visual and auditory domains. In particular, we demonstrate the utility of the model in estimating the contrastive stress of speech.