Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0704.1362

Fast recursive filters for simulating nonlinear dynamic systems

J. H. van Hateren
View original source ↗Read source document ↗Export metadata ↓

Abstract

A fast and accurate computational scheme for simulating nonlinear dynamic systems is presented. The scheme assumes that the system can be represented by a combination of components of only two different types: first-order low-pass filters and static nonlinearities. The parameters of these filters and nonlinearities may depend on system variables, and the topology of the system may be complex, including feedback. Several examples taken from neuroscience are given: phototransduction, photopigment bleaching, and spike generation according to the Hodgkin-Huxley equations. The scheme uses two slightly different forms of autoregressive filters, with an implicit delay of zero for feedforward control and an implicit delay of half a sample distance for feedback control. On a fairly complex model of the macaque retinal horizontal cell it computes, for a given level of accuracy, 1-2 orders of magnitude faster than 4th-order Runge-Kutta. The computational scheme has minimal memory requirements, and is also suited for computation on a stream processor, such as a GPU (Graphical Processing Unit).

Explore related subjects

q-bio.QMq-bio.NC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

J. H. van Hateren. 2007-08-30. Fast recursive filters for simulating nonlinear dynamic systems. https://arxiv.org/abs/0704.1362

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bayesian Uncertainty Quantification of Breast-Cancer Pathology AI Agreement under Reader- and Annotation-Condition-Dependent Reference Labels

Human reference labels used to evaluate medical AI can vary across readers and annotation workflows. We quantified agreement of a fixed pathology AI system with a future qualified reader without treating inferred consensus as error-free biological truth. Linked Evaluation and Unbiased NuCLS multirater data were analyzed using a fixed external HoVer-Net decision vector. The selected frame contained 1,144 anchors, 52 fields of view, five slides/patients, and five primary readers. The target was fixed-AI agreement with a future reader, with descriptive contrast $Δ=θ_E-θ_U$. Analyses included raw agreement and iMRMC benchmarks, reader-only and shared-detectability Bayesian models, structural sensitivities, adversarial simulations, and predictive assessment. Among 5,188 reader-anchor pairs observed in both conditions, 19.62% changed AI-agreement state, while raw agreement was 0.5466 in Unbiased and 0.5473 in Evaluation. The reader-only model gave $Δ=-0.0008$ (95% CrI, $-0.0033$ to $0.0008$), and the shared-detectability model gave $Δ\approx0$ ($-0.0140$ to $0.0127$). Across structural perturbations, absolute agreement ranged from 0.420 to 0.646 in Unbiased and 0.409 to 0.640 in Evaluation. Frozen adversarial simulations met the comparative-stability criterion (median $R=0.295$; 14/16 model-scenario cells had $R<1$). Held-out-AI prediction supported shared predictive information, but varied by slide composition. The Evaluation-minus-Unbiased contrast was comparatively stable, whereas absolute agreement was structurally sensitive. These findings do not establish equivalence, causal assistance effects, biological accuracy, or new-patient transportability. Evaluations using variable human references should report reader population, selected frame, observation mechanism, and structural sensitivity.

q-bio.QM↗
arXiv2026

RetroTAC: Learning Route-Derived Synthetic Accessibility for PROTACs

Proteolysis-targeting chimeras (PROTACs) enable targeted protein degradation, expanding therapeutic opportunities beyond conventional inhibition. However, assembling their large, multifunctional structures creates synthetic challenges that hinder their discovery. Traditional synthetic-accessibility scores can overestimate this difficulty by penalizing PROTACs' molecular complexity while overlooking modular assembly from accessible building blocks. In contrast, retrosynthesis planning tools provide explicit routes but are computationally expensive, particularly for large molecules. Here, we introduce a human-interpretable, PROTAC-oriented route-derived score that rewards short synthetic depth and balanced joining of molecular fragments, and RetroTAC, a machine-learning surrogate that predicts this score directly from molecular structures. RetroTAC combines complementary models in an ensemble, achieving a root mean squared error of 0.13 and an $R^2$ of 0.65 on held-out molecules. We further evaluate its utility on PROTACs enumerated by recombining warheads, linkers, and E3-ligase ligands, followed by retrosynthetic planning and route analysis. Candidates selected for high predicted scores achieve a mean route-derived synthesizability of 0.73, compared with 0.31 for low-score candidates; 98.75% versus 51.00% are fully resolved under the tested search settings. These results support RetroTAC as a fast prioritization tool for virtual PROTAC libraries, connecting molecular screening with interpretable route characteristics while reserving explicit planning for selected candidates.

q-bio.QM↗
arXiv2026

Parameter Identifiability beyond the Fisher Information Approximation in Data-Driven Modeling

Data-driven mechanistic modeling of high-dimensional biological data requires rigorous parameter identifiability. Profile likelihood entails costly repeated optimization, while Fisher-information criteria discard the model's Hessian and may misjudge weakly constrained directions. From a well-posedness definition of identifiability we characterize the stability of the estimated parameters under data perturbations while retaining the full Hessian. It yields Hölder-$\tfrac12$ stability for a zero residual when the Fisher information is degenerate and corrects the Fisher matrix otherwise; residual and perturbation sizes decide the order of stability, Lipschitz below a crossover scale proportional to the residual norm and Hölder-$\tfrac12$ above. In a local quadratic approximation we derive coordinate identifiability metrics allowing singular Jacobians and nuisance Hessian blocks, and spectral bounds link the corrections to parameter and prediction uncertainty. Applications to JAK--STAT signaling, HIV dynamics, and amyloid-$β$ accumulation support the theory. Requiring only local derivatives, the framework offers a tractable basis for identifiability analysis of large-scale models.

q-bio.QM↗