SearcharxivSearch

arXiv subjects

Zachary P. Kilpatrick

Publications and source records attributed to Zachary P. Kilpatrick.

At least 19 recordsLinked to original sources

Resource depletion accelerates rate learning but not composition learning in patch foraging

Foraging is a universal animal behavior that has increasingly attracted the interest of both experimentalists and theorists. Most prior models assume an animal knows the distribution of resources in its environment, but this structure must be learned as the animal explores its environment. Foraging can thus be regarded as a hierarchical inference problem. We develop a normative Bayesian account of an agent learning a patchy environment while exploiting it, and show that resource depletion shapes the levels of that hierarchy differently. Within a patch, depletion accelerates rate learning, since successive encounters occur at falling rates whose spacing pins down the initial rate. Across patches, composition learning, inferring the fraction of patches that are high yield, is slow, set by the number of patches sampled rather than the time spent in each, and unaffected by depletion once the rates are known. Reward-maximizing and information-seeking strategies therefore diverge, a forager resolving the composition underharvesting rich patches because learning it requires departures, most sharply early in exposure. When a fixed set of patches replenishes between visits, the reward-maximizing policy collapses onto a stable orbit over the high-yield patches, and the replenishment rate sets whether the forager maps the whole environment or locks onto a rich subset. Which departure rule maximizes intake is itself set by how variable the patches are, switching from counting prey to timing the gaps between them once richness varies by more than about a quarter. Learning the environment thus buys significant intake over learning a rule from reward alone, as long as its assumptions about depletion leave room for the truth.

q-bio.NC

Astrocytic resource diffusion stabilizes persistent activity in neural fields

Persistent neural activity underlying working memory requires sustained synaptic transmission, yet the metabolic and neurotransmitter support provided by astrocyte networks is largely absent from spatially extended neural circuit models. We introduce a coupled astrocyte-neural field model in which synaptic efficacy is regulated by depletion and recovery of a conserved resource pool recycled and spatially redistributed through diffusively coupled astrocytes. We obtain explicit stationary bump profiles and self-consistency conditions for bump width and amplitude on a canonical ring architecture. Linearizing about these solutions while carefully accounting for perturbations at bump boundaries, we analyze the resulting spectral problem governing stability. Our analysis, supported by numerical simulations and low-dimensional Fourier truncations, reveals a two-stage stabilization mechanism: astrocytic diffusion smooths resource asymmetries created by small bump displacements, and synaptic replenishment transfers this smoothing back to the synaptic pool. Together, sufficiently strong diffusion and replenishment suppress drift instabilities and enlarge the parameter regime in which stationary bumps persist.

q-bio.NC

Modeling Social Systems: Transparency, Reproducibility, and Responsibility

Mathematical models of complex social systems can enrich social scientific theory, inform interventions, and shape policy. From voting behavior to economic inequality and urban development, such models influence decisions that affect millions of lives. Thus, it is especially important to formulate and present them with transparency, reproducibility, and humility. Modeling in social domains, however, is often uniquely challenging. Unlike in physics or engineering, researchers often lack controlled experiments or abundant, clean data. Observational data is sparse, noisy, partial, and missing in systematic ways. In such an environment, how can we build models that can inform science and decision-making in transparent and responsible ways?

math.HO

Information-Seeking Decision Strategies Mitigate Risk in Dynamic, Uncertain Environments

To survive in dynamic and uncertain environments, individuals must develop effective decision strategies that balance information gathering and decision commitment. Models of such strategies often prioritize either optimizing tangible payoffs, like reward rate, or gathering information to support a diversity of (possibly unknown) objectives. However, our understanding of the relative merits of these two approaches remains incomplete, in part because direct comparisons have been limited to idealized, static environments that lack the dynamic complexity of the real world. Here we compared the performance of normative reward- and information-seeking strategies in a dynamic foraging task. Both strategies show similar transitions between exploratory and exploitative behaviors as environmental uncertainty changes. However, we find subtle disparities in the actions they take, resulting in meaningful performance differences: whereas reward-seeking strategies generate slightly more reward on average, information-seeking strategies provide more consistent and predictable outcomes. Our findings support the adaptive value of information-seeking behaviors that can mitigate risk with minimal reward loss.

cs.AI

Fast decisions reflect biases, slow decisions do not

Decisions are often made by heterogeneous groups of individuals, each with distinct initial biases and access to information of different quality. We show that in large groups of independent agents who accumulate evidence the first to decide are those with the strongest initial biases. Their decisions align with their initial bias, regardless of the underlying truth. In contrast, agents who decide last make decisions as if they were initially unbiased, and hence make better choices. We obtain asymptotic expressions in the large population limit that quantify how agents' initial inclinations shape early decisions. Our analysis shows how bias, information quality, and decision order interact in non-trivial ways to determine the reliability of decisions in a group.

physics.soc-ph

Correlated Information Reduces Accuracy of Pioneering Decision-Makers

Normative models are often used to describe how humans and animals make decisions. These models treat deliberation as the accumulation of uncertain evidence that terminates with a commitment to a choice. When extended to social groups, such models often assume that individuals make independent observations. However, individuals typically gather evidence from common sources, and their observations are rarely independent. Here we ask: For a group of ideal observers who do not exchange information, what is the impact of correlated evidence on decision accuracy? We show that even when agents are identical, correlated evidence causes decision accuracy to depend on temporal decision order. Surprisingly, the first decider is less accurate than a lone observer. Early deciders are less accurate than late deciders. These phenomena occur despite the fact that the rational observers use the same decision criterion, so they are equally confident in their decisions. We analyze discrete and continuum evidence-gathering models to explain why the first decider is less accurate than a lone observer when evidence is correlated. Pooling the decisions of early deciders using a majority rule does not rescue accuracy in the sense that such pooling results in only modest accuracy gain. Although we analyze an idealized model, we believe that our analysis offers insights that do not depend on exactly how groups integrate evidence and form decisions.

physics.soc-ph

Adaptive Bayesian Inference of Markov Transition Rates

Optimal designs minimize the number of experimental runs (samples) needed to accurately estimate model parameters, resulting in algorithms that, for instance, efficiently minimize parameter estimate variance. Governed by knowledge of past observations, adaptive approaches adjust sampling constraints online as model parameter estimates are refined, continually maximizing expected information gained or variance reduced. We apply adaptive Bayesian inference to estimate transition rates of Markov chains, a common class of models for stochastic processes in nature. Unlike most previous studies, our sequential Bayesian optimal design is updated with each observation, and can be simply extended beyond two-state models to birth-death processes and multistate models. By iteratively finding the best time to obtain each sample, our adaptive algorithm maximally reduces variance, resulting in lower overall error in ground truth parameter estimates across a wide range of Markov chain parameterizations and conformations.

stat.ME

Performance of normative and approximate evidence accumulation on the dynamic clicks task

The aim of a number of psychophysics tasks is to uncover how mammals make decisions in a world that is in flux. Here we examine the characteristics of ideal and near-ideal observers in a task of this type. We ask when and how performance depends on task parameters and design, and, in turn, what observer performance tells us about their decision-making process. In the dynamic clicks task subjects hear two streams (left and right) of Poisson clicks with different rates. Subjects are rewarded when they correctly identify the side with the higher rate, as this side switches unpredictably. We show that a reduced set of task parameters defines regions in parameter space in which optimal, but not near-optimal observers, maintain constant response accuracy. We also show that for a range of task parameters an approximate normative model must be finely tuned to reach near-optimal performance, illustrating a potential way to distinguish between normative models and their approximations. In addition, we show that using the negative log-likelihood and the 0/1-loss functions to fit these types of models is not equivalent: the 0/1-loss leads to a bias in parameter recovery that increases with sensory noise. These findings suggest ways to tease apart models that are hard to distinguish when tuned exactly, and point to general pitfalls in experimental design, model fitting, and interpretation of the resulting data.

q-bio.NC

Analyzing dynamic decision-making models using Chapman-Kolmogorov equations

Decision-making in dynamic environments typically requires adaptive evidence accumulation that weights new evidence more heavily than old observations. Recent experimental studies of dynamic decision tasks require subjects to make decisions for which the correct choice switches stochastically throughout a single trial. In such cases, an ideal observer's belief is described by an evolution equation that is doubly stochastic, reflecting stochasticity in the both observations and environmental changes. In these contexts, we show that the probability density of the belief can be represented using differential Chapman-Kolmogorov equations, allowing efficient computation of ensemble statistics. This allows us to reliably compare normative models to near-normative approximations using, as model performance metrics, decision response accuracy and Kullback-Leibler divergence of the belief distributions. Such belief distributions could be obtained empirically from subjects by asking them to report their decision confidence. We also study how response accuracy is affected by additional internal noise, showing optimality requires longer integration timescales as more noise is added. Lastly, we demonstrate that our method can be applied to tasks in which evidence arrives in a discrete, pulsatile fashion, rather than continuously.

q-bio.NC

Optimal models of decision-making in dynamic environments

Nature is in constant flux, so animals must account for changes in their environment when making decisions. How animals learn the timescale of such changes and adapt their decision strategies accordingly is not well understood. Recent psychophysical experiments have shown humans and other animals can achieve near-optimal performance at two alternative forced choice (2AFC) tasks in dynamically changing environments. Characterization of performance requires the derivation and analysis of computational models of optimal decision-making policies on such tasks. We review recent theoretical work in this area, and discuss how models compare with subjects' behavior in tasks where the correct choice or evidence quality changes in dynamic, but predictable, ways.

q-bio.NC

Optimizing a jump-diffusion model of a starving forager

We analyze the movement of a starving forager on a one-dimensional periodic lattice, where each location contains one unit of food. As the forager lands on sites with food, it consumes the food, leaving the sites empty. If the forager lands consecutively on $s$ empty sites, then it will starve. The forager has two modes of movement: it can either diffuse, by moving with equal probability to adjacent sites on the lattice, or it can jump to a uniformly randomly chosen site on the lattice. We show that the lifetime $T$ of the forager in either paradigm can be approximated by the sum of the cover time $τ_{\rm cover}$ and the starvation time $s$, when $s$ far exceeds the number $n$ of lattice sites. Our main findings focus on the hybrid model, where the forager has a probability of either jumping or diffusing. The lifetime of the forager varies non-monotonically according to $p_j$, the probability of jumping. By examining a small system, analyzing a heuristic model, and using direct numerical simulation, we explore the tradeoff between jumps and diffusion, and show that the strategy that maximizes the forager lifetime is a mixture of both modes of movement.

q-bio.PE

Velocity integration in a multilayer neural field model of spatial working memory

We analyze a multilayer neural field model of spatial working memory, focusing on the impact of interlaminar connectivity, spatial heterogeneity, and velocity inputs. Models of spatial working memory typically employ networks that generate persistent activity via a combination of local excitation and lateral inhibition. Our model is comprised of a multilayer set of equations that describes connectivity between neurons in the same and different layers using an integral term. The kernel of this integral term then captures the impact of different interlaminar connection strengths, spatial heterogeneity, and velocity input. We begin our analysis by focusing on how interlaminar connectivity shapes the form and stability of (persistent) bump attractor solutions to the model. Subsequently, we derive a low-dimensional approximation that describes how spatial heterogeneity, velocity input, and noise combine to determine the position of bump solutions. The main impact of spatial heterogeneity is to break the translation symmetry of the network, so bumps prefer to reside at one of a finite number of local attractors in the domain. With the reduced model in hand, we can then approximate the dynamics of the bump position using a continuous time Markov chain model that describes bump motion between local attractors. While heterogeneity reduces the effective diffusion of the bumps, it also disrupts the processing of velocity inputs by slowing the velocity-induced propagation of bumps. However, we demonstrate that noise can play a constructive role by promoting bump motion transitions, restoring a mean bump velocity that is close to the input velocity.

q-bio.NC

Persistent search in confined domains: a velocity-jump process model

We analyze velocity-jump process models of persistent search for a single target on a bounded domain. The searcher proceeds along ballistic trajectories and is absorbed upon collision with the target boundary. When reaching the domain boundary, the searcher chooses a random direction for its new trajectory. For circular domains and targets, we can approximate the mean first passage time (MFPT) using a Markov chain approximation of the search process. Our analysis and numerical simulations reveal that the time to find the target decreases for targets closer to the domain boundary. When there is a small probability of direction-switching within the domain, we find the time to find the target decreases slightly with the turning probability. We also extend our exit time analysis to the case of partitioned domains, where there is a single target within one of multiple disjoint subdomains. Given an average time of transition between domains $\langle T \rangle$, we find that the optimal rate of transition that minimizes the time to find the target obeys $β_{\rm min} \propto 1/ \sqrt{\langle T \rangle}$.

cond-mat.stat-mech

Stochastic models of evidence accumulation in changing environments

Organisms and ecological groups accumulate evidence to make decisions. Classic experiments and theoretical studies have explored this process when the correct choice is fixed during each trial. However, we live in a constantly changing world. What effect does such impermanence have on classical results about decision making? To address this question we use sequential analysis to derive a tractable model of evidence accumulation when the correct option changes in time. Our analysis shows that ideal observers discount prior evidence at a rate determined by the volatility of the environment, and the dynamics of evidence accumulation is governed by the information gained over an average environmental epoch. A plausible neural implementation of an optimal observer in a changing environment shows that, in contrast to previous models, neural populations representing alternate choices are coupled through excitation. Our work builds a bridge between statistical decision making in volatile environments and stochastic nonlinear dynamics.

q-bio.NC

Ghosts of bump attractors in stochastic neural fields: Bottlenecks and extinction

We study the effects of additive noise on stationary bump solutions to spatially extended neural fields near a saddle-node bifurcation. The integral terms of these evolution equations have a weight kernel describing synaptic interactions between neurons at different locations of the network. Excited regions of the neural field correspond to parts of the domain whose fraction of active neurons exceeds a sharp threshold of a firing rate nonlinearity. For sufficiently low firing threshold, a stable bump coexists with an unstable bump and a homogeneous quiescent state. As the threshold is increased, the stable and unstable branch of bump solutions annihilate in a saddle node bifurcation. Near this criticality, we derive a quadratic amplitude equation that describes the slow evolution of the even mode (bump contractions) as it depends on the distance from the bifurcation. Beyond the bifurcation, bumps eventually become extinct, and the time it takes for this to occur increases for systems nearer the bifurcation. When noise is incorporated, a stochastic amplitude equation for the even mode can be derived, which can be analyzed to reveal bump extinction time both below and above the saddle-node.

nlin.PS

Networks that learn the precise timing of event sequences

Neuronal circuits can learn and replay firing patterns evoked by sequences of sensory stimuli. After training, a brief cue can trigger a spatiotemporal pattern of neural activity similar to that evoked by a learned stimulus sequence. Network models show that such sequence learning can occur through the shaping of feedforward excitatory connectivity via long term plasticity. Previous models describe how event order can be learned, but they typically do not explain how precise timing can be recalled. We propose a mechanism for learning both the order and precise timing of event sequences. In our recurrent network model, long term plasticity leads to the learning of the sequence, while short term facilitation enables temporally precise replay of events. Learned synaptic weights between populations determine the time necessary for one population to activate another. Long term plasticity adjusts these weights so that the trained event times are matched during playback. While we chose short term facilitation as a time-tracking process, we also demonstrate that other mechanisms, such as spike rate adaptation, can fulfill this role. We also analyze the impact of trial-to-trial variability, showing how observational errors as well as neuronal noise result in variability in learned event times. The dynamics of the playback process determine how stochasticity is inherited in learned sequence timings. Future experiments that characterize such variability can therefore shed light on the neural mechanisms of sequence learning.

q-bio.NC

Entrainment in up and down states of neural populations: non-smooth and stochastic models

We study the impact of noise on a neural population rate model of up and down states. Up and down states are typically observed in neuronal networks as a slow oscillation, where the population switches between high and low firing rates (Sanchez-Vivez and McCormick, 2000). A neural population model with spike rate adaptation is used to model such slow oscillations, and the timescale of adaptation determines the oscillation period. Furthermore, the period depends non-monotonically on the background tonic input driving the population, having long periods for very weak and very strong stimuli. Using both linearization and fast-slow timescale separation methods, we can compute the phase sensitivity function of the slow oscillation. We find that the phase response is most strongly impacted by perturbations to the adaptation variable. Phase sensitivity functions can then be utilized to quantify the impact of noise on oscillating populations. Noise alters the period of oscillations by speeding up the rate of transition between the up and down states. When common noise is presented to two distinct populations, their transitions will eventually become entrained to one another through stochastic synchrony.

q-bio.NC

Stochastic motion of bumps in planar neural fields

We analyze the effects of spatiotemporal noise on stationary pulse solutions (bumps) in neural field equations on planar domains. Neural fields are integrodifferential equations whose integral kernel describes the strength and polarity of synaptic interactions between neurons at different spatial locations of the network. Fluctuations in neural activity are incorporated by modeling the system as a Langevin equation evolving on a planar domain. Noise causes bumps to wander about the domain in a purely diffusive way. Utilizing a small noise expansion along with a solvability condition, we can derive an effective stochastic equation describing the bump dynamics as two-dimensional Brownian motion. The diffusion coefficient can then be computed explicitly. We also show that weak external inputs can pin the bump so it no longer wanders diffusively. Inputs reshape the effective potential that guides the dynamics of the bump position, so it tends to lie near attractors which can be single points or contours in the plane. Perturbative analysis shows the bump position evolves as a multivariate Ornstein-Uhlenbeck process whose relaxation constants are determined by the shape of the input. Our analytical approximations all compare well to statistics of bump motion in numerical simulations.

nlin.PS