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.

168,657 papers · 148 categories

Trend · papers per month

2875738601,146 · Jun 202019922001200920172026
48 results for data fit

We propose a data aggregation-based algorithm with monotonic convergence to a global optimum for a generalized version of the L1-norm error fitting model with an assumption of the fitting function. The proposed algorithm generalizes the recent algorithm in the literature, aggregate and iterative disaggregate (AID), whi…

2017-03-15abs ↗pdf ↗

New findings show a balance between data fit and complexity in kernel hyperparameters.

problem Overcorrelation due to reparametrization of kernel hyperparameters.
method Reparametrization of kernel hyperparameters and analysis of marginal likelihood.
result Data fit term influences all other kernel hyperparameters, not just the complexity penalty.

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…

2019-06-17abs ↗pdf ↗

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…

2006-08-23abs ↗pdf ↗

A new kernel Stein test assesses fit for variable-length sequential data.

problem Evaluating goodness of fit for varying-dimensional data like text documents of different lengths.
method Extends kernel Stein discrepancy (KSD) to variable-dimension settings by identifying appropriate Stein operators and proposing a novel KSD goodness-of-fit test.
result The proposed test performs well on discrete sequential data benchmarks.

We present techniques for effective Gaussian process (GP) modelling of multiple short time series. These problems are common when applying GP models independently to each gene in a gene expression time series data set. Such sets typically contain very few time points. Naive application of common GP modelling techniques…

2012-10-09abs ↗pdf ↗

In regression modelling approach, the main step is to fit the regression line as close as possible to the target variable. In this process most algorithms try to fit all of the data in a single line and hence fitting all parts of target variable in one go. It was observed that the error between predicted and target var…

2018-05-04abs ↗pdf ↗

The paper fits a seven-parameter GTS distribution to financial data.

problem Nonexistence of GTS probability density function makes MLE inadequate.
method Used fractional Fourier transform to circumvent MLE and provide good parameter estimation.
result The GTS distribution fits financial data significantly better than other models.

Fitting models for non-Poisson point processes is complicated by the lack of tractable models for much of the data. By using large samples of independent and identically distributed realizations and statistical learning, it is possible to identify absence of fit through finding a classification rule that can efficientl…

2007-12-02abs ↗pdf ↗

Neural networks fit fewer samples than their parameters suggest in practice.

problem Understanding the practical limitations of neural network flexibility.
method Examination of neural network optimization, parameter efficiency, and loss surfaces.
result Neural networks can only fit training sets with significantly fewer samples than their parameters suggest.

This paper is a step-by-step tutorial for fitting a mixture distribution to data. It merely assumes the reader has the background of calculus and linear algebra. Other required background is briefly reviewed before explaining the main algorithm. In explaining the main algorithm, first, fitting a mixture of two distribu…

2019-01-20abs ↗pdf ↗

Kernel Multigrid accelerates Back-fitting for additive Gaussian Processes.

problem Slow convergence of Back-fitting in training additive Gaussian Processes.
method Kernel Packets (KP) and Sparse Gaussian Process Regression (GPR) to enhance Back-fitting.
result Kernel Multigrid reduces the required iterations to O(logn)\mathcal{O}(\log n).

A new method treats all variables equally in fitting data.

problem Fitting relationships to data with multiple variables, especially when dependent and independent variables are not clearly defined.
method A general method treating all variables impartially, using geometric mean functional relationships and correlation.
result The method provides coefficients that are easily calculated from covariances or correlations, making it scale-invariant and applicable to various units.

LLMs are vulnerable to task-irrelevant data changes, limiting their use for data fitting.

problem LLMs' sensitivity to task-irrelevant variations in data representation.
method Analysis of LLMs' performance and attention patterns under various data manipulations.
result LLMs are sensitive to task-irrelevant variations, leading to significant prediction errors.

Two methods monitor high-dimensional processes via manifold fitting or learning.

problem Monitoring high-dimensional, dynamic industrial processes.
method Manifold fitting and learning approaches for online SPC.
result Manifold-fitting approach achieves performance competitive with classical methods.

We present the use of the fitted Q iteration in algorithmic trading. We show that the fitted Q iteration helps alleviate the dimension problem that the basic Q-learning algorithm faces in application to trading. Furthermore, we introduce a procedure including model fitting and data simulation to enrich training data as…

2018-05-18abs ↗pdf ↗

Graphical lasso may fail to fit models when data points are insufficient.

problem When does graphical lasso fail to select and fit a graphical model?
method Computational experiments with graphical lasso.
result Graphical lasso may fail when the number of data points is less than the maximum likelihood threshold.

Spectrahedral regression fits convex functions via a non-convex optimization problem.

problem Fitting convex functions to data sets.
method Fitting a spectrahedral function (maximum eigenvalue of an affine matrix expression) to the data via an alternating minimization algorithm.
result The alternating minimization algorithm converges geometrically to a small ball around the optimal parameter.

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…

2017-09-25abs ↗pdf ↗

Study evaluates different mathematical models for three case studies using statistical fitting.

problem Estimating outcomes in population dynamics, temperature variations, and market equilibrium.
method Applied various statistical equations (e.g., fractional exponential, sinusoidal) to three case studies.
result Optimal models differ by case study (fractional exponential for population dynamics, sinusoidal for temperature and market equilibrium).

Typically, operational risk losses are reported above a threshold. Fitting data reported above a constant threshold is a well known and studied problem. However, in practice, the losses are scaled for business and other factors before the fitting and thus the threshold is varying across the scaled data sample. A report…

2009-04-27abs ↗pdf ↗

New deep learning methods improve estimation and GOF assessment for large-scale IFA.

problem Estimating and assessing goodness-of-fit for large-scale confirmatory IFA models.
method Extended deep learning algorithm for parameter estimation and simulation-based tests for GOF assessment.
result Proposed methods provide comparable estimates and detect latent dimensionality misspecification.

Software package assesses spherical data distributions and clusters.

problem Assessing and clustering spherical data distributions.
method Innovative goodness-of-fit tests and clustering algorithms using kernel-based quadratic distances.
result Efficient and mathematically sound goodness-of-fit tests for spherical data.

NNEinFact fits any nonnegative tensor factorization quickly and accurately.

problem Limited user-friendly tools for fitting tailored nonnegative tensor factorizations.
method NNEinFact is an einsum-based multiplicative update algorithm that fits any nonnegative tensor factorization.
result NNEinFact converges to a stationary point of the loss, supports missing data, and fits tensors with hundreds of millions of entries in seconds.

The aim of the present article is to treat the Greek public debt issue strictly as a curve fitting problem. Thus, based on Eurostat data and using the Mathematica technical computing software, an exponential function that best fits the data is determined modelling how the Greek public debt expands with time. Exploring …

2012-12-07abs ↗pdf ↗

Improved modeling of persistence diagrams for data analysis.

problem Determining significant outliers in persistence diagrams.
method Modification of the RST (Replicating Statistical Topology) model using MCMC Metropolis-Hastings algorithm.
result The modified RST model improves the goodness of fit in persistence diagram analysis.

Improved nuclear cross section fitting with weighted Levenberg-Marquardt method.

problem Challenging optimization in multichannel nuclear cross section data.
method Weighted Levenberg-Marquardt algorithm with Fisher Information Metric.
result More physically consistent fits for raw and smoothed datasets.