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,742 papers · 148 categories

Trend · papers per month

9.7%19.5%29.2%39.0% · Jun 202019922001200920172026
48 results for fitting performance

Optimistic estimate predicts best fitting performance of nonlinear models.

problem Evaluating the potential of nonlinear models in fitting.
method Proposes an optimistic estimate to quantify the smallest sample size for fitting nonlinear models.
result Predicts specific subsets of targets that can be fitted at overparameterization.

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 ↗

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 ↗

In quantitative finance, we often fit a parametric semimartingale model to asset prices. To ensure our model is correct, we must then perform goodness-of-fit tests. In this paper, we give a new goodness-of-fit test for volatility-like processes, which is easily applied to a variety of semimartingale models. In each cas…

2015-05-30abs ↗pdf ↗

This work improves AutoML systems by dynamically evaluating fitness to reduce overfitting.

problem Overfitting in AutoML systems, especially during internal cross-validation iterations.
method Introducing dynamic fitness evaluations that approximate repeated k-fold cross-validation.
result Significant improvement in generalization/testing performance over baseline methods.

We study a resource utilization scenario characterized by intrinsic fitness. To describe the growth and organization of different cities, we consider a model for resource utilization where many restaurants compete, as in a game, to attract customers using an iterative learning process. Results for the case of restauran…

2014-03-07abs ↗pdf ↗

Improved SSD for faster and more accurate goodness-of-fit tests and model learning.

problem Optimal slicing directions for SSD are computationally expensive and sub-optimal.
method Relaxed optimal slicing requirement, active sub-space construction, spectral decomposition.
result 14-80x speed-up in goodness-of-fit tests compared to gradient-based alternatives.

To find efficient screening methods for high dimensional linear regression models, this paper studies the relationship between model fitting and screening performance. Under a sparsity assumption, we show that a subset that includes the true submodel always yields smaller residual sum of squares (i.e., has better model…

2012-12-04abs ↗pdf ↗

HAR model outperforms ML in stock forecasting with correct fitting schemes.

problem Realized volatility forecasting using machine learning techniques.
method Investigated the role of fitting schemes in HAR model performance, focusing on training window and re-estimation frequency.
result HAR model consistently outperforms ML models when using a correctly specified fitting approach.

Study uses copulas and DCC-GARCH for multivariate risk analysis of VaR and CVaR.

problem Multivariate risk analysis for Value at Risk (VaR) and Conditional Value at Risk (CoVaR).
method Copulas and Dynamic Conditional Correlation (DCC)-GARCH models applied to historical financial data.
result Comparison of different copula families for goodness-of-fit and effectiveness.

New method extends fitted Q-evaluation for distributional off-policy reinforcement learning.

problem Estimating return distribution in reinforcement learning using offline data.
method Developed a set of guiding principles and new FDE methods with theoretical justification.
result FDE methods outperform existing approaches in simulations and real-world games.

GRASP tests goodness-of-fit for binary classifiers without parametric assumptions.

problem Assessing the fit of a binary classifier to the underlying conditional law of labels given features.
method Formulates a tolerance hypothesis testing problem and proposes a novel test called GRASP.
result Proposes GRASP and Model-X GRASP tests for assessing goodness-of-fit in finite sample settings.

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.

Paper explores how text generation quality and diversity metrics relate to distribution fitting.

problem Unclear relation between text generation quality and diversity metrics and distribution fitting.
method Theoretical approach to prove a linear combination of quality and diversity metrics can be a divergence metric.
result CR/NRR proposed as a better substitute for BLEU/Self-BLEU metrics.

The paper addresses over-fitting in deep learning models trained on imbalanced data.

problem Over-fitting to minor classes in deep learning models trained on imbalanced data.
method Investigated feature deviation and proposed class-dependent temperatures (CDT) to compensate for it.
result CDT helps in overcoming feature deviation, improving model performance on test data of minor classes.

New method uses neural networks to estimate parameters without needing detector simulations.

problem Estimating parameters in high-energy physics with detector effects.
method Two-level fitting approach: SRGN (Simulation-level fit based on Reweighting Generator-level events with Neural networks).
result Demonstrated using simulated datasets, SRGN can estimate parameters without detector effects.

Theoretical study explains why federated optimization fails to achieve perfect fitting.

problem Performance degradation in federated optimization under data heterogeneity.
method Assumption of distinct local optima due to client data heterogeneity.
result The global objective has a lower bound that prevents perfect fitting of all client data.

QLBS and RLOP methods improve option pricing and hedging performance.

problem Improving option pricing and hedging performance under market frictions.
method Incorporates risk aversion and trading costs into QLBS, proposes RLOP approach.
result RLOP outperforms in dynamic hedging by reducing shortfall probability.

The paper introduces a method for fitting complex models using simulation and optimization.

problem Fitting models with intractable likelihood or moments.
method Sequential sampling and local smoothing, combining global and local search phases.
result The proposed method outperforms alternative approaches in fitting complex models.

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.

A new framework improves kernel Stein discrepancy tests for validating distributions.

problem Improving goodness-of-fit testing for non-normal distributions.
method Introducing Sf-KSD, a unifying framework for studying Stein operators in KSD-based tests.
result Sf-KSD guides the development of new tests and outperforms existing methods.

New model allocates features sublinearly, improving model fit and performance.

problem Linear growth of shared features limits model flexibility and performance.
method Developed non-exchangeable feature allocation models with sublinear feature sharing.
result Sublinear feature sharing leads to better model fit and predictive performance.

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 propose a novel method that makes use of deep neural networks and gradient decent to perform automated design on complex real world engineering tasks. Our approach works by training a neural network to mimic the fitness function of a design optimization task and then, using the differential nature of the neural netw…

2017-10-27abs ↗pdf ↗

WeakNAS uses a set of weaker predictors to find top architectures with fewer samples.

problem Finding the best neural architecture with heavy computation costs.
method Proposes a paradigm shift from fitting the whole architecture space to progressively fitting a search path through a set of weaker predictors.
result WeakNAS produces coarse-to-fine iteration to gradually refine the ranking of sampling space, requiring fewer samples to find top-performance architectures.

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…

2016-12-17abs ↗pdf ↗

Develops a goodness-of-fit test for self-exciting processes.

problem Quantifying how well generative models capture self-exciting point processes.
method Connects to Quasi-maximum-likelihood estimator (QMLE) theory and develops a non-parametric self-normalizing statistic, the Generalized Score (GS) statistics.
result Validates the proposed GS test's good performance through numerical simulation and real-data experiments.

Automates fitting semiconductor device models using approximate Bayesian computation.

problem Manual tuning of parameters for fitting TFT models to experimental data is inefficient and prone to errors.
method Approximate Bayesian Computation (aBc) for generating posterior distributions of estimated parameters.
result The proposed method accurately predicts model parameters from mobility curves using gradient boosted trees.

We propose a novel adaptive test of goodness-of-fit, with computational cost linear in the number of samples. We learn the test features that best indicate the differences between observed samples and a reference model, by minimizing the false negative rate. These features are constructed via Stein's method, meaning th…

2017-05-22abs ↗pdf ↗