Simulation-based Methods for Optimal Sampling Design in Systems Biology

• URL: http://arxiv.org/abs/2511.07197v1
• Date: Mon, 10 Nov 2025 15:26:51 GMT
• Title: Simulation-based Methods for Optimal Sampling Design in Systems Biology
• Abstract summary: This study proposes two simulation-based methods for optimal sampling design.<n>The first method, E-optimal-ranking (EOR), employs the E-optimal criterion, while the second utilizes a Long Short-Term Memory (LSTM) neural network.<n> Simulation studies based on the Lotka-Volterra and three-compartment models demonstrate that the proposed methods outperform both random selection and classical E-optimal design.
• Score: 0.38233569758620045
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In many areas of systems biology, including virology, pharmacokinetics, and population biology, dynamical systems are commonly used to describe biological processes. These systems can be characterized by estimating their parameters from sampled data. The key problem is how to optimally select sampling points to achieve accurate parameter estimation. Classical approaches often rely on Fisher information matrix-based criteria such as A-, D-, and E-optimality, which require an initial parameter estimate and may yield suboptimal results when the estimate is inaccurate. This study proposes two simulation-based methods for optimal sampling design that do not depend on initial parameter estimates. The first method, E-optimal-ranking (EOR), employs the E-optimal criterion, while the second utilizes a Long Short-Term Memory (LSTM) neural network. Simulation studies based on the Lotka-Volterra and three-compartment models demonstrate that the proposed methods outperform both random selection and classical E-optimal design.

Related papers

• NeuroMem-FHP: A Likelihood-Free Deep Learning Framework for Parameter Estimation of Fractional Hawkes Process [2.376995292379181]
  We propose a framework for estimating the parameters of the fractional Hawkes process (FHP)<n>Two neural architectures, namely a Long Short-Term Memory (LSTM) network and a Transformer, are developed to estimate the model parameters.<n>Experiments show that both neural models significantly outperform the classical Maximum Likelihood Estimation (MLE) method.
  arXiv  Detail & Related papers  (2026-07-13T07:19:01Z)
• Adaptive Gaussian Process Search for Simulation-Based Sample Size Estimation in Clinical Prediction Models: Validation of the pmsims R Package [0.45393070061887714]
  We present and validate pmsims, an R package that uses Gaussian process surrogate modelling to provide a flexible simulation-based framework for sample size determination.<n>We benchmarked the best-performing pmsims engine against existing analytical (pmsampsize) and simulation-based (samplesizedev) methods.
  arXiv  Detail & Related papers  (2026-03-24T19:53:37Z)
• A Statistical Framework for Model Selection in LSTM Networks [0.0]
  We propose a unified statistical framework for systematic model selection in LSTM networks.<n>Our framework extends classical model selection ideas, such as information criteria and shrinkage estimation, to sequential neural networks.<n>Several biomedical data centric examples demonstrate the flexibility and improved performance of the proposed framework.
  arXiv  Detail & Related papers  (2025-06-07T15:44:27Z)
• An incremental preference elicitation-based approach to learning potentially non-monotonic preferences in multi-criteria sorting [53.36437745983783]
  We first construct a max-margin optimization-based model to model potentially non-monotonic preferences. We devise information amount measurement methods and question selection strategies to pinpoint the most informative alternative in each iteration. Two incremental preference elicitation-based algorithms are developed to learn potentially non-monotonic preferences.
  arXiv  Detail & Related papers  (2024-09-04T14:36:20Z)
• Poisson Process for Bayesian Optimization [126.51200593377739]
  We propose a ranking-based surrogate model based on the Poisson process and introduce an efficient BO framework, namely Poisson Process Bayesian Optimization (PoPBO) Compared to the classic GP-BO method, our PoPBO has lower costs and better robustness to noise, which is verified by abundant experiments.
  arXiv  Detail & Related papers  (2024-02-05T02:54:50Z)
• Minimally Supervised Learning using Topological Projections in Self-Organizing Maps [55.31182147885694]
  We introduce a semi-supervised learning approach based on topological projections in self-organizing maps (SOMs) Our proposed method first trains SOMs on unlabeled data and then a minimal number of available labeled data points are assigned to key best matching units (BMU) Our results indicate that the proposed minimally supervised model significantly outperforms traditional regression techniques.
  arXiv  Detail & Related papers  (2024-01-12T22:51:48Z)
• Deep Learning for Fast Inference of Mechanistic Models' Parameters [0.28675177318965045]
  We propose using Deep Neural Networks (NN) for directly predicting parameters of mechanistic models given observations. We consider a training procedure that combines Neural Networks and mechanistic models. We find that, while Neural Network estimates are slightly improved by further fitting, these estimates are measurably better than the fitting procedure alone.
  arXiv  Detail & Related papers  (2023-12-05T22:16:54Z)
• Cost-Sensitive Best Subset Selection for Logistic Regression: A Mixed-Integer Conic Optimization Perspective [3.1468618177952785]
  Key challenge in machine learning is to design interpretable models that can reduce their inputs to the best subset for making transparent predictions. We propose a certifiably optimal feature selection procedure for logistic regression from a mixed-integer conic optimization perspective. This allows us to systematically evaluate different and optimal cardinality- and budget-constrained feature selection procedures.
  arXiv  Detail & Related papers  (2023-10-09T07:13:40Z)
• Simulation-based Inference for Model Parameterization on Analog Neuromorphic Hardware [1.843681725117436]
  This study investigates the suitability of the sequential neural posterior estimation algorithm for parameterizing a multi-compartmental neuron model emulated on the BrainScaleS-2 system. The SNPE algorithm belongs to the class of simulation-based inference methods and estimates the posterior distribution of the model parameters.
  arXiv  Detail & Related papers  (2023-03-28T15:37:30Z)
• Sparse high-dimensional linear regression with a partitioned empirical Bayes ECM algorithm [62.997667081978825]
  We propose a computationally efficient and powerful Bayesian approach for sparse high-dimensional linear regression. Minimal prior assumptions on the parameters are used through the use of plug-in empirical Bayes estimates. The proposed approach is implemented in the R package probe.
  arXiv  Detail & Related papers  (2022-09-16T19:15:50Z)
• SimPO: Simultaneous Prediction and Optimization [3.181417685380586]
  We propose a formulation for the Simultaneous Prediction and Optimization (SimPO) framework. This framework introduces the use of a joint weighted loss of a decision-driven predictive ML model and an optimization objective function.
  arXiv  Detail & Related papers  (2022-03-31T20:01:36Z)
• An AI-Assisted Design Method for Topology Optimization Without Pre-Optimized Training Data [68.8204255655161]
  An AI-assisted design method based on topology optimization is presented, which is able to obtain optimized designs in a direct way. Designs are provided by an artificial neural network, the predictor, on the basis of boundary conditions and degree of filling as input data.
  arXiv  Detail & Related papers  (2020-12-11T14:33:27Z)
• An Asymptotically Optimal Multi-Armed Bandit Algorithm and Hyperparameter Optimization [48.5614138038673]
  We propose an efficient and robust bandit-based algorithm called Sub-Sampling (SS) in the scenario of hyper parameter search evaluation. We also develop a novel hyper parameter optimization algorithm called BOSS. Empirical studies validate our theoretical arguments of SS and demonstrate the superior performance of BOSS on a number of applications.
  arXiv  Detail & Related papers  (2020-07-11T03:15:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.