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.
Automates fitting semiconductor device models using approximate Bayesian computation.
FiT combines transfer and meta-learning for efficient few-shot image classification.
Neural networks fit fewer samples than their parameters suggest in practice.
MPF method improves parameter estimation in probabilistic models.
New MRI method maps tissue parameters more accurately by ignoring voxel independence.
Complex phenomena in engineering and the sciences are often modeled with computationally intensive feed-forward simulations for which a tractable analytic likelihood does not exist. In these cases, it is sometimes necessary to estimate an approximate likelihood or fit a fast emulator model for efficient statistical inf…
The paper fits a seven-parameter GTS distribution to financial data.
New rules reduce SLOPE model fitting time by screening out irrelevant variables.
New GMM models fit high-dimensional data with fewer parameters.
We provide an analytically treatable model that describes in a unified manner income distribution for all income categories. The approach is based on a master equation with growth and reset terms. The model assumptions on the growth and reset rates are tested on an exhaustive database with incomes on individual level s…
Deep nonlinear models pose a challenge for fitting parameters due to lack of knowledge of the hidden layer and the potentially non-affine relation of the initial and observed layers. In the present work we investigate the use of information theoretic measures such as mutual information and Kullback-Leibler (KL) diverge…
This paper studies identifiability and convergence behaviors for parameters of multiple types in finite mixtures, and the effects of model fitting with extra mixing components. First, we present a general theory for strong identifiability, which extends from the previous work of Nguyen [2013] and Chen [1995] to address…
Stratified models are models that depend in an arbitrary way on a set of selected categorical features, and depend linearly on the other features. In a basic and traditional formulation a separate model is fit for each value of the categorical feature, using only the data that has the specific categorical value. To thi…
In this paper, we revisit the parameter learning problem, namely the estimation of model parameters for Dynamic Bayesian Networks (DBNs). DBNs are directed graphical models of stochastic processes that encompasses and generalize Hidden Markov models (HMMs) and Linear Dynamical Systems (LDSs). Whenever we apply these mo…
New method uses neural networks to estimate parameters without needing detector simulations.
In Divide & Recombine (D&R), big data are divided into subsets, each analytic method is applied to subsets, and the outputs are recombined. This enables deep analysis and practical computational performance. An innovate D\&R procedure is proposed to compute likelihood functions of data-model (DM) parameters for big dat…
Improved nuclear cross section fitting with weighted Levenberg-Marquardt method.
The coefficient of determination, known as , is commonly used as a goodness-of-fit criterion for fitting linear models. is somewhat controversial when fitting nonlinear models, although it may be generalised on a case-by-case basis to deal with specific models such as the logistic model. Assume we are fittin…
We show how any dataset of any modality (time-series, images, sound...) can be approximated by a well-behaved (continuous, differentiable...) scalar function with a single real-valued parameter. Building upon elementary concepts from chaos theory, we adopt a pedagogical approach demonstrating how to adjust this paramet…
We explore the energy landscape of a simple neural network. In particular, we expand upon previous work demonstrating that the empirical complexity of fitted neural networks is vastly less than a naive parameter count would suggest and that this implicit regularization is actually beneficial for generalization from fit…
We consider stochastic volatility models using piecewise constant parameters. We suggest a hybrid optimization algorithm for fitting the models to a volatility surface and provide some numerical results. Finally, we provide an outlook on how to further improve the calibration procedure.
We describe an end-to-end real-time S&P futures trading system. Inner-shell stochastic nonlinear dynamic models are developed, and Canonical Momenta Indicators (CMI) are derived from a fitted Lagrangian used by outer-shell trading models dependent on these indicators. Recursive and adaptive optimization using Adaptive …
In the context of the Dragulescu-Yakovenko (2000) model, we show that empirical income distribution with truncated datasets, cannot be properly modeled by the one-parameter exponential distribution. However, a truncated version characterized by an exponential distribution with two parameters gives an accurate fit.
Penalized regression models are popularly used in high-dimensional data analysis to conduct variable selection and model fitting simultaneously. Whereas success has been widely reported in literature, their performances largely depend on the tuning parameters that balance the trade-off between model fitting and model s…
New method fits sparse Markov models to categorical time series using convex clustering.
Improved classifier for PU data using logistic regression.
Paper combines machine learning and model averaging for robust parameter estimation.
New algorithm speeds up fitting GLLVMs to large datasets.
New deep learning methods improve estimation and GOF assessment for large-scale IFA.
The paper introduces a method for fitting complex models using simulation and optimization.
We show that univariate and symmetric multivariate Hawkes processes are only weakly causal: the true log-likelihoods of real and reversed event time vectors are almost equal, thus parameter estimation via maximum likelihood only weakly depends on the direction of the arrow of time. In ideal (synthetic) conditions, test…
The paper explores strong identifiability and parameter learning in regression models with heterogeneous responses.
New robustness test for kernel goodness-of-fit tests.
We present a new variable selection method based on model-based gradient boosting and randomly permuted variables. Model-based boosting is a tool to fit a statistical model while performing variable selection at the same time. A drawback of the fitting lies in the need of multiple model fits on slightly altered data (e…
Computational models in fields such as computational neuroscience are often evaluated via stochastic simulation or numerical approximation. Fitting these models implies a difficult optimization problem over complex, possibly noisy parameter landscapes. Bayesian optimization (BO) has been successfully applied to solving…
The Bezier simplex fitting is a novel data modeling technique which exploits geometric structures of data to approximate the Pareto front of multi-objective optimization problems. There are two fitting methods based on different sampling strategies. The inductive skeleton fitting employs a stratified subsampling from e…
Regularization helps protect machine learning models from poisoning attacks.
New model allocates features sublinearly, improving model fit and performance.
When the in-sample Sharpe ratio is obtained by optimizing over a k-dimensional parameter space, it is a biased estimator for what can be expected on unseen data (out-of-sample). We derive (1) an unbiased estimator adjusting for both sources of bias: noise fit and estimation error. We then show (2) how to use the adjust…
Psychiatric neuroscience is increasingly aware of the need to define psychopathology in terms of abnormal neural computation. The central tool in this endeavour is the fitting of computational models to behavioural data. The most prominent example of this procedure is fitting reinforcement learning (RL) models to decis…
Proposes a method to learn graph structure and model parameters jointly in LRSM.
We address a non-unique parameter fitting problem in the context of material science. In particular, we propose to resolve ambiguities in parameter space by augmenting a black-box artificial neural network (ANN) model with two different levels of expert knowledge and benchmark them against a pure black-box model.
Iterative methods for fitting a Gaussian Random Field (GRF) model via maximum likelihood (ML) estimation requires solving a nonconvex optimization problem. The problem is aggravated for anisotropic GRFs where the number of covariance function parameters increases with the dimension. Even evaluation of the likelihood fu…
The study bounds the stability of Gaussian mixtures under small perturbations.
Bayesian optimization speeds up parameter reconstruction in optical nano-metrology.
This paper illustrates a procedure for fitting financial data with -stable distributions. After using all the available methods to evaluate the distribution parameters, one can qualitatively select the best estimate and run some goodness-of-fit tests on this estimate, in order to quantitatively assess its quality. I…
New spectral tests assess network model fits efficiently.
A homogeneously saturated equation for the time development of the price of a financial asset is presented and investigated for the pricing of European call options using noise that is distributed as a Student's t-distribution. In the limit that the saturation parameter of the equation equals zero, the standard model o…