Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,181 papers · 148 categories

Trend · papers per month

83167250333 · Jun 202019922001200920182026
48 results for Systems biology

Two simulation-based methods improve optimal sampling design in systems biology.

problem Optimal selection of sampling points for accurate parameter estimation in dynamical systems.
method E-optimal-ranking (EOR) and LSTM neural network-based methods.
result Simulation studies show the proposed methods outperform random selection and classical E-optimal design.

A scalable Bayesian inference method for mixed-effects models in systems biology.

problem Scalable Bayesian inference for complex hierarchical mixed-effects models in systems biology.
method Constructing amortized approximations of likelihood and posterior distributions, refined for each individual dataset.
result Our method is both fast and competitive in statistical accuracy compared to exact pseudomarginal Bayesian inference.

hyperSBINN improves drug cardiosafety assessment by efficiently modeling cardiac action potentials.

problem Complexity and limited data in modeling cardiac effects of drugs.
method Combining meta-learning with SBINNs to solve parameterized cardiac action potential models.
result hyperSBINN outperforms traditional solvers in speed and accuracy for predicting APD90 values.

New method learns cell trajectories and network interactions from single-cell data.

problem Network inference in systems biology from steady-state data.
method Min-entropy estimation for stochastic dynamics, leveraging both temporal and perturbational data.
result Jointly learns cellular trajectories and network interactions.

New method integrates sparse parametric and nonparametric techniques for complex system modeling.

problem Lack of accurate modeling for complex biological systems due to nonlinearities.
method Sparse nonparametric estimation framework combining parametric and nonparametric techniques.
result Accurately captures nonlinearities in complex systems without prior information.

Polynomial-time algorithm finds short non-orientable loops intersecting graph edges up to 30 times.

problem Finding short non-orientable loops intersecting graph edges efficiently.
method Combining computational biology techniques with recent graph theory results.
result Existence of short canonical non-orientable systems of loops.

Graphical modelling has a long history in statistics as a tool for the analysis of multivariate data, starting from Wright's path analysis and Gibbs' applications to statistical physics at the beginning of the last century. In its modern form, it was pioneered by Lauritzen and Wermuth and Pearl in the 1980s, and has si…

2012-10-14abs ↗pdf ↗

Machine learning integrates diverse biological data to understand complex phenomena.

problem Combining multiple data types to understand biological and medical phenomena.
method Developing effective models to integrate heterogeneous biological data.
result Machine learning can identify important features and predict outcomes from diverse biological data.

In this paper, we show how simple logistic growth that was studied intensively during the last 200 years in many domains of science could be extended in a rather simple way and with these extensions is capable to produce a collection of behaviors widely observed in an enormous number of real-life systems in Economics, …

2008-02-24abs ↗pdf ↗

Study tackles high-dimensional datasets in molecular biology by reducing intrinsic variability.

problem High-dimensional datasets in molecular biology pose a challenge for thorough analysis.
method Intrinsic dimensionality analysis, including dimension reduction techniques and nonlinear time series analysis.
result Dimension reduction techniques help identify irrelevant variability and understand critical processes.

DECAT framework evaluates multimodal models for shared biology, detecting confounders and false positives.

problem Determining if multimodal models learn shared biology or just confounders.
method DECAT framework classifies multimodal representations into four diagnostic scenarios using null-referenced metrics.
result DECAT detects confounders and false positives in multimodal models, improving with larger cohorts and stronger representations.

The aim of this chapter is twofold. In the first part we will provide a brief overview of the mathematical and statistical foundations of graphical models, along with their fundamental properties, estimation and basic inference procedures. In particular we will develop Markov networks (also known as Markov random field…

2010-05-06abs ↗pdf ↗

COMRECGC finds common recourse for global counterfactual explanations in GNNs.

problem Finding common recourse for global counterfactual explanations in GNNs.
method Formalized the common recourse explanation problem and designed COMRECGC algorithm.
result COMRECGC outperforms strong baselines on four real-world graph datasets.

Purely data driven approaches for machine learning present difficulties when data is scarce relative to the complexity of the model or when the model is forced to extrapolate. On the other hand, purely mechanistic approaches need to identify and specify all the interactions in the problem at hand (which may not be feas…

2011-07-13abs ↗pdf ↗

High dimensional time series are endemic in applications of machine learning such as robotics (sensor data), computational biology (gene expression data), vision (video sequences) and graphics (motion capture data). Practical nonlinear probabilistic approaches to this data are required. In this paper we introduce the v…

2011-07-25abs ↗pdf ↗

By analyzing the relationships between a socioeconomical system modeled through evolutionary game theory and a physical system modeled through quantum mechanics we show how although both systems are described through two theories apparently different both are analogous and thus exactly equivalents. The extensions of qu…

2007-04-30abs ↗pdf ↗

A new method uses bandits to select summary statistics for Bayesian inference.

problem Dynamic selection of summary statistics for likelihood-free inference.
method Treats summary statistic selection as a multi-armed bandit problem.
result Improves efficiency and scalability of approximate Bayesian computation.

Mathematical advances needed for Digital Twins, differing from traditional models.

problem Foundational mathematical advances required for Digital Twins.
method Multi-scale, multi-physics modeling and coupling, different reliability criteria and uncertainty assessments.
result AI/ML methods can perform well in biomedical problems but fail in simple engineering systems.

Bayesian framework for robust model discovery from noisy data.

problem Robust model discovery from noisy, sparse and irregular observations of nonlinear systems.
method Bayesian differential programming using Hamiltonian Monte Carlo and sparsity-promoting priors.
result Efficient inference of posterior distributions over plausible models with quantified uncertainty.

In Biology, all motor enzymes operate on the same principle: they trap favourable brownian fluctuations in order to generate directed forces and to move. Whether it is possible or not to copy one such strategy to play the market was the starting point of our investigations. We found the answer is yes. In this paper we …

2007-05-15abs ↗pdf ↗
Quantum Econophysicsphysics.soc-ph

The relationships between game theory and quantum mechanics let us propose certain quantization relationships through which we could describe and understand not only quantum but also classical, evolutionary and the biological systems that were described before through the replicator dynamics. Quantum mechanics could be…

2006-09-28abs ↗pdf ↗

New algorithm for continuous-time switching systems using variational inference.

problem Inference in time-series data with continuous-time switching systems.
method Developed a variational inference algorithm combining Gaussian process approximation and posterior inference for Markov jump processes.
result Bayesian latent state estimates and point estimates of unknown parameters for arbitrary points on the real axis.

Critical learning periods found in deep linear networks too.

problem Understanding why critical learning periods emerge in both biological and artificial networks.
method Focused on deep linear network models, analyzed depth and data distribution, and examined multi-task learning.
result Critical periods depend on model depth and data distribution structure, and pre-training can affect transfer performance.

This work develops a learning theory for inferring interaction kernels in complex agent systems.

problem Modeling complex interactions in systems of particles or agents.
method Nonparametric regression and approximation theory.
result Strong consistency and optimal convergence rates for estimators of interaction kernels.

DyMoN models complex systems from short snapshots using deep neural networks.

problem Modeling high-dimensional stochastic systems from limited snapshot data.
method Dynamics Modeling Network (DyMoN) as a deep generative Markov model trained on current and next-state pairs.
result DyMoN outperforms shallow and deep models in capturing system dynamics and generating longitudinal trajectories.

GP-NODE combines Gaussian processes and NeuralODEs for Bayesian system identification.

problem Bayesian systems identification from partial, noisy and irregular observations.
method Differentiable programming, Hamiltonian Monte Carlo, Gaussian Process priors, sparsity-promoting priors.
result Efficient inference of posterior distributions over plausible models with quantified uncertainty.