Overview

Parameter estimation uses observed data to infer the unknown settings that govern a model, enabling prediction, scientific explanation, and control. Approaches range from maximum likelihood and Bayesian methods to simulation-based inference, gradient or evolutionary optimization, and physics-informed neural networks that embed known equations. Researchers apply these tools to noisy, incomplete observations in settings such as dynamical systems, medical models, imaging, and scientific simulations, often estimating uncertainty as well as a best-fit value. A central challenge is that good predictions do not guarantee that parameters are uniquely or accurately identified, especially with sparse data, model mismatch, or costly simulations.

Latest papers

156 papers11 papers in the last four weeks, down 50% on the four weeks before. 0.1% of all new papers.

May 23, 2025

Data-driven multi-agent modelling of calcium interactions in cell culture: PINN vs Regularized Least-squares

Data-driven discovery of dynamics in biological systems allows for better observation and characterization of processes, such as calcium signaling in cell culture. Recent advancements in techniques allow the exploration of previously unattainable insights of dynamical systems, such as the Sparse Identification of Non-Linear Dynamics (SINDy), overcoming the limitations of more classic methodologies. The latter requires some prior knowledge of an effective library of candidate terms, which is not realistic for a real case study. Using inspiration from fields like traffic density estimation and control theory, we propose a methodology for characterization and performance analysis of calcium delivery in a family of cells. In this work, we compare the performance of the Constrained Regularized Least-Squares Method (CRLSM) and Physics-Informed Neural Networks (PINN) for system identification and parameter discovery for governing ordinary differential equations (ODEs). The CRLSM achieves a fairly good parameter estimate and a good data fit when using the learned parameters in the Consensus problem. On the other hand, despite the initial hypothesis, PINNs fail to match the CRLSM performance and, under the current configuration, do not provide fair parameter estimation. However, we have only studied a limited number of PINN architectures, and it is expected that additional hyperparameter tuning, as well as uncertainty quantification, could significantly improve the performance in future works.
Jan 17, 2025

Mean and Variance Estimation Complexity in Arbitrary Distributions via Wasserstein Minimization

Parameter estimation is a fundamental challenge in machine learning, crucial for tasks such as neural network weight fitting and Bayesian inference. This paper focuses on the complexity of estimating translation μ∈Rl\boldsymbolμ \in \mathbb{R}^l and shrinkage σ∈R++σ\in \mathbb{R}_{++} parameters for a distribution of the form 1σlf0(x−μσ)\frac{1}{σ^l} f_0 \left( \frac{\boldsymbol{x} - \boldsymbolμ}σ \right), where f0f_0 is a known density in Rl\mathbb{R}^l given nn samples. We highlight that while the problem is NP-hard for Maximum Likelihood Estimation (MLE), it is possible to obtain ε\varepsilon-approximations for arbitrary ε>0\varepsilon > 0 within poly(1ε)\text{poly} \left( \frac{1}{\varepsilon} \right) time using the Wasserstein distance.
Oct 21, 2024

Statistical Inference for Policy Evaluation with Temporal Difference Learning

We investigate the statistical properties of Temporal Difference (TD) learning with Polyak-Ruppert averaging, arguably one of the most widely used algorithms in reinforcement learning, for the task of estimating the parameters of the optimal linear approximation to the value function. Assuming independent samples, we make three theoretical contributions that improve upon the current state-of-the-art results: (i) we establish refined high-dimensional Berry-Esseen bounds over the class of convex sets, achieving faster rates than the best known results, and (ii) we propose and analyze a novel, computationally efficient online plug-in estimator of the asymptotic covariance matrix; (iii) we derive sharper high probability convergence guarantees that depend explicitly on the asymptotic variance and hold under weaker conditions than those adopted in the literature. These results enable the construction of confidence regions and simultaneous confidence intervals for the linear parameters of the value function approximation, with guaranteed finite-sample coverage. We demonstrate the applicability of our theoretical findings through numerical experiments.
Oct 1, 2024

FastManly: An EM-Gradient Algorithm for Manly Mixture Models

A faster implementation of mixtures of Manly transformations is proposed. This method, called FastManly, uses Newton's method for optimization in an EM gradient algorithm instead of Nelder-Mead in a traditional EM. A gradient and full Hessian are derived. Simulations show improved performance with noticeable speedups.
Sep 6, 2024

A Deep Learning Framework for TTV Characterization: A Case Study of the Kepler-88 System

Transit timing variation (TTV) provides rich information about the mass and orbital properties of exoplanets, which are often obtained by solving an inverse problem via Markov Chain Monte Carlo (MCMC). In this paper, we design a new data-driven approach, which potentially can be applied to problems that are hard to traditional MCMC methods, such as the case with only one planet transiting. Specifically, we use a deep learning approach to predict the parameters of non-transit companion for the single transit system with transit information (i.e., TTV, and Transit Duration Variation (TDV)) as input. This approach is constructed using the Transformer-based architecture that can extract long-range interactions from TTV sequential data. We focus on two-planet systems based on Kepler-88 as a starting point, with the inner planet fixed to the properties of Kepler-88 and the mass and orbital elements of the outer planet varied. Applying to Kepler-88, we obtained an overall fractional error of ≲\lesssim10% on semi-major axis and eccentricity, and ∼10−30%\sim 10-30\% on planet mass (assuming that the stellar and transiting planet parameters are known), based on a training set of a million simulations. When applied to the test set, our model achieves low fractional errors of less than a few percent for systems with TTV semi-amplitudes ranging from ∼0.3\sim 0.3 s to ∼5\sim 5 min. Extending our approach to a broader range of planetary architectures, including systems with substantially weaker or stronger TTV signals and those containing additional planets or stellar companions, remains an important direction for future work.
Apr 2, 2022

Deep Algebraic Fitting for Multiple Circle Primitives Extraction from Raw Point Clouds

The shape of circle is one of fundamental geometric primitives of man-made engineering objects. Thus, extraction of circles from scanned point clouds is a quite important task in 3D geometry data processing. However, existing circle extraction methods either are sensitive to the quality of raw point clouds when classifying circle-boundary points, or require well-designed fitting functions when regressing circle parameters. To relieve the challenges, we propose an end-to-end Point Cloud Circle Algebraic Fitting Network (Circle-Net) based on a synergy of deep circle-boundary point feature learning and weighted algebraic fitting. First, we design a circle-boundary learning module, which considers local and global neighboring contexts of each point, to detect all potential circle-boundary points. Second, we develop a deep feature based circle parameter learning module for weighted algebraic fitting, without designing any weight metric, to avoid the influence of outliers during fitting. Unlike most of the cutting-edge circle extraction wisdoms, the proposed classification-and-fitting modules are originally co-trained with a comprehensive loss to enhance the quality of extracted circles.Comparisons on the established dataset and real-scanned point clouds exhibit clear improvements of Circle-Net over SOTAs in terms of both noise-robustness and extraction accuracy. We will release our code, model, and data for both training and evaluation on GitHub upon publication.