arXiv subjects

Lilianne R. Mujica-Parodi

Publications and source records attributed to Lilianne R. Mujica-Parodi.

7 recordsLinked to original sources

arXiv2026

Bayesian Uncertainty Quantification for fMRI Functional Connectivity via Simulation-Based Inference

Optimizing fMRI scan duration and spatial resolution is critical for experimental design, yet traditional correlation-based approaches cannot quantify uncertainty or disentangle scanner measurement noise from true neural variability across subjects. Without principled uncertainty bounds, researchers cannot know whether a protocol is long enough to reliably estimate connectivity, or whether between-subject differences reflect biological variation or noise. We present a Bayesian framework modeling BOLD dynamics as coupled Ornstein-Uhlenbeck processes, using Sequential Neural Posterior Estimation to obtain connectivity posteriors while accounting for frequency-independent measurement noise across the BOLD spectrum. Applied to N = 28 healthy controls (55 scans) at 7T using a functional network atlas (65 DMN regions), the framework quantifies uncertainty across its sources: scanner noise, subject variability, and acquisition length. Spatial analysis identifies a mean of 46 voxels per ROI, roughly half of typical region sizes, as sufficient to achieve 90% of asymptotic precision. At the single-subject level, 7T reaches its within-session precision plateau in approximately 7 minutes versus 10 minutes for 3T, a 40% reduction in required scan time, providing the first direct, model-based quantification of the scan-time advantage conferred by higher field strength. At the population level, 3T requires roughly 37 times more per-subject scan time than 7T for the pooled curves to converge, confirming a consistent advantage of higher field strength at every timescale. Together these findings provide concrete, scanner-specific guidance for protocol optimization, with direct implications for reducing acquisition costs and improving the reliability of connectivity-based clinical biomarkers. We provide code enabling researchers to derive these bounds from their own data.

stat.ML↗

arXiv2026

Scientific Machine Learning of Chaotic Systems Learns Reduced-Order Equations for Neural Populations

Extracting interpretable mathematical models from complex dynamical systems is difficult, especially for chaotic dynamics observed with noisy experimental data. We present PEM-UDE, a method that combines prediction-error methodology with universal differential equations to discover governing equations from limited, noise-corrupted observations. Prediction-error feedback smooths the chaotic optimization problem; for noise-free data generated within the model class, it preserves the data-consistent zero-loss set, whereas noise and model misspecification introduce a gain-dependent stability-bias trade-off. Preservation of the zero-loss set is not a guarantee of unique structural identifiability. We test the method on two benchmark chaotic systems, the Rossler attractor and a real electrical circuit, and recover the correct functional forms even when one observed dimension contains noise of five times the signal magnitude. The method also accepts prior knowledge of the system as an initial functional form, which we use to learn neural circuit equations that account for sparse connectivity, a feature missing from conventional neural mass models. Applied to a population of Izhikevich neurons, PEM-UDE yields a multi-scale neural mass model that ties single-neuron parameters to macroscopic network dynamics and predicts a relationship between connection density, dominant oscillation frequency, and synchrony. We test these predictions against three intracranial recording datasets from rat and human cortices. For the neuroscience application, the learned equations are a reduced-order closure for a specified simulated Izhikevich network family; the experimental recordings provide an indirect consistency check of predicted frequency and synchrony trends, not a direct fit of the equations to recordings.

cs.LG↗

arXiv2020

Fast Spatial Autocorrelation

Physical or geographic location proves to be an important feature in many data science models, because many diverse natural and social phenomenon have a spatial component. Spatial autocorrelation measures the extent to which locally adjacent observations of the same phenomenon are correlated. Although statistics like Moran's $I$ and Geary's $C$ are widely used to measure spatial autocorrelation, they are slow: all popular methods run in $Ω(n^2)$ time, rendering them unusable for large data sets, or long time-courses with moderate numbers of points. We propose a new $S_A$ statistic based on the notion that the variance observed when merging pairs of nearby clusters should increase slowly for spatially autocorrelated variables. We give a linear-time algorithm to calculate $S_A$ for a variable with an input agglomeration order (available at https://github.com/aamgalan/spatial_autocorrelation). For a typical dataset of $n \approx 63,000$ points, our $S_A$ autocorrelation measure can be computed in 1 second, versus 2 hours or more for Moran's $I$ and Geary's $C$. Through simulation studies, we demonstrate that $S_A$ identifies spatial correlations in variables generated with spatially-dependent model half an order of magnitude earlier than either Moran's $I$ or Geary's $C$. Finally, we prove several theoretical properties of $S_A$: namely that it behaves as a true correlation statistic, and is invariant under addition or multiplication by a constant.

stat.ME↗

arXiv2020

Ground-truth resting-state signal provides data-driven estimation and correction for scanner distortion of fMRI time-series dynamics

The fMRI community has made great strides in decoupling neuronal activity from other physiologically induced T2* changes, using sensors that provide a ground-truth with respect to cardiac, respiratory, and head movement dynamics. However, blood oxygenation level-dependent (BOLD) time-series dynamics are confounded by scanner artifacts, in complex ways that can vary not only between scanners but even, for the same scanner, between sessions. The lack of equivalent ground truth has thus far stymied the development of reliable methods for identification and removal of scanner-induced noise. To address this problem, we first designed and built a phantom capable of providing dynamic signals equivalent to that of the resting-state brain. Using the dynamic phantom, we quantified voxel-wise noise by comparing the ground-truth time-series with its measured fMRI data. We derived the following data-quality metrics: Standardized Signal-to-Noise Ratio (ST-SNR) and Dynamic Fidelity that can be directly compared across scanners. Dynamic phantom data acquired from four scanners showed scanner-instability multiplicative noise contributions of about 6-18% of the total noise. We further measured strong non-linearity in the fMRI response for all scanners, ranging between 8-19% of total voxels. To correct scanner distortion of fMRI time-series dynamics at a single-subject level, we trained a convolutional neural network (CNN) on paired sets of measured vs. ground-truth data. Tests on dynamic phantom time-series showed a 4- to 7-fold increase in ST-SNR and about 40-70% increase in Dynamic Fidelity after denoising. Critically, we observed that the CNN temporal denoising pushes ST-SNR > 1. Denoising human-data with ground-truth-trained CNN showed markedly increased detection sensitivity of resting-state networks.

physics.med-ph↗

arXiv2020

The refractory period matters: unifying mechanisms of macroscopic brain waves

The relationship between complex, brain oscillations and the dynamics of individual neurons is poorly understood. Here we utilize Maximum Caliber, a dynamical inference principle, to build a minimal, yet general model of the collective (mean-field) dynamics of large populations of neurons. In agreement with previous experimental observations, we describe a simple, testable mechanism, involving only a single type of neuron, by which many of these complex oscillatory patterns may emerge. Our model predicts that the refractory period of neurons, which has been previously neglected, is essential for these behaviors.

q-bio.NC↗

arXiv2020

Inferring a network from dynamical signals at its nodes

We give an approximate solution to the difficult inverse problem of inferring the topology of an unknown network from given time-dependent signals at the nodes. For example, we measure signals from individual neurons in the brain, and infer how they are inter-connected. We use Maximum Caliber as an inference principle. The combinatorial challenge of high-dimensional data is handled using two different approximations to the pairwise couplings. We show two proofs of principle: in a nonlinear genetic toggle switch circuit, and in a toy neural network.

physics.bio-ph↗

arXiv2020

Unique Scales Preserve Self-Similar Integrate-and-Fire Functionality of Neuronal Clusters

Identifying the brain's neuronal cluster size to be presented as nodes in a network computation is critical to both neuroscience and artificial intelligence, as these define the cognitive blocks required for building intelligent computation. Experiments support many forms and sizes of neural clustering, while neural mass models (NMM) assume scale-invariant functionality. Here, we use computational simulations with brain-derived fMRI network to show that not only brain network stays structurally self-similar continuously across scales, but also neuron-like signal integration functionality is preserved at particular scales. As such, we propose a coarse-graining of network of neurons to ensemble-nodes, with multiple spikes making up its ensemble-spike, and time re-scaling factor defining its ensemble-time step. The fractal-like spatiotemporal structure and function that emerge permit strategic choice in bridging across experimental scales for computational modeling, while also suggesting regulatory constraints on developmental and/or evolutionary "growth spurts" in brain size, as per punctuated equilibrium theories in evolutionary biology.

q-bio.NC↗