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

Trend · papers per month

72144215287 · Jun 202019922001200920172026
48 results for extrapolation errors

New methods reduce extrapolation errors in feature importance.

problem Flawed feature importance methods using unrestricted permutations lead to extrapolation errors.
method Three new approaches: conditional model reliance, Knockoffs with Gaussian transformation, and restricted ALE plot designs.
result Theoretical and numerical results show our strategies reduce/eliminate extrapolation.

Paper analyzes LSA algorithm bias and error bounds with RR extrapolation.

problem Analyzing bias and high-order error bounds of LSA with Markovian noise.
method Polyak-Ruppert averaging, linearization, Richardson-Romberg extrapolation.
result RR extrapolation effectively cancels the leading bias term.

Paper improves PINNs' extrapolation by TL and adaptive AFs.

problem PINNs' poor extrapolation performance and sensitivity to AFs.
method Transfer learning within an extended domain and adaptive activation functions.
result Average 40% reduction in relative L2 error and 50% in mean absolute error in extrapolation domain.

The paper analyzes SGD with Richardson-Romberg extrapolation for convex optimization problems.

problem Solving strongly convex and smooth minimization problems efficiently.
method Combining SGD with Polyak-Ruppert averaging and Richardson-Romberg extrapolation.
result An expansion of the mean-squared error of the estimator with respect to the number of iterations.

I study the behavior and the performance of the long-term forecasts issued by financial analysts with respect to the Extrapolation Hypothesis. That hypothesis states that investors, extrapolating from the firms' recent performances, are too optimistic about growth and large firms and too pessimistic about value and sma…

2014-06-06abs ↗pdf ↗

Selective state-adaptive regularization improves offline RL performance.

problem Extrapolation errors and value overestimation in static dataset RL.
method State-adaptive regularization coefficients trust Bellman-driven results selectively.
result Significant improvement in performance on D4RL benchmark.

FLUXtrapolation benchmarks machine learning for extrapolating ecosystem fluxes under distribution shifts.

problem Machine learning challenges in extrapolating ecosystem fluxes under distribution shifts.
method Defined temporal, spatial, and temperature-based extrapolation scenarios; evaluated performance across domains, temporal aggregations, and tail errors.
result Baselines perform similarly under median hourly RMSE but differ under tail-focused and multi-scale evaluations.

Study on bias and extrapolation in LSA with Markovian data, showing bias reduction with Richardson-Romberg extrapolation.

problem Bias in LSA with constant stepsizes and Markovian data.
method Viewing LSA as a Markov chain, proving convergence and bias expansion, and applying Richardson-Romberg extrapolation.
result Bias is proportional to the stepsize up to higher order terms, and Richardson-Romberg extrapolation reduces the bias.

In this paper, we treat the problem of evaluating the asymptotic error in a numerical integration scheme as one with inherent uncertainty. Adding to the growing field of probabilistic numerics, we show that Gaussian process regression (GPR) can be embedded into a numerical integration scheme to allow for (i) robust sel…

2019-05-23abs ↗pdf ↗

New estimators for intrinsic dimension and Wasserstein distance improve OT accuracy.

problem Intrinsic dimension estimation and Wasserstein distance estimation in large-scale OT.
method Introduces novel estimators for intrinsic dimension and Wasserstein distance.
result Simple, tuning-free estimator of OT and fast intrinsic dimension estimator.

Matrix completion and extrapolation (MCEX) are dealt with here over reproducing kernel Hilbert spaces (RKHSs) in order to account for prior information present in the available data. Aiming at a faster and low-complexity solver, the task is formulated as a kernel ridge regression. The resultant MCEX algorithm can also …

2018-08-01abs ↗pdf ↗

NLR models often perform worse than LR for outlying input data in environmental sciences.

problem NLR models often give poor predictions for input data outside the training domain.
method Screened input data for outliers, using linear extrapolation for outliers based on NLR within the non-outlier domain.
result NLROR_{\mathrm{OR}} approach reduces poor extrapolation and tends to outperform NLR and LR for outliers.

RTE enables extrapolation to new tasks by learning task transformations.

problem Learning systems struggle to generalize to unseen tasks.
method Relational Task Extrapolator (RTE) learns task transformations to enable extrapolation.
result RTE substantially outperforms existing approaches on extrapolation tasks.

We extend nonparametric models to handle extrapolation, providing bounds for inference.

problem Challenges in nonparametric statistical inference when evaluating outside the conditioning variable's support.
method Introduced a class of extrapolation assumptions and a consistent estimation procedure to handle extrapolation.
result Validated extrapolation-aware conclusions through various applications and real-world data.

Gaussian processes are rich distributions over functions, with generalization properties determined by a kernel function. When used for long-range extrapolation, predictions are particularly sensitive to the choice of kernel parameters. It is therefore critical to account for kernel uncertainty in our predictive distri…

2018-02-02abs ↗pdf ↗

Method controls extrapolation in prediction profiles for statistical and machine learning models.

problem Avoiding invalid predictions due to extrapolation in prediction profiles.
method Genetic algorithm optimization over constrained factor regions.
result Optimal factor settings without constraint are often invalid and extrapolated.

Neural networks struggle with extrapolation, but a new framework allows them to learn counterfactual invariances.

problem Neural networks' inability to extrapolate beyond training data distribution.
method Introduces a learning framework that allows neural networks to extrapolate over group transformations based on counterfactual invariances.
result Neural networks can learn counterfactual invariances from a single environment, overcoming their limitations in extrapolation.

Machine learning model predicts DFT total energy to complete basis set limit.

problem Finding a model to extrapolate DFT calculations to complete basis set limit.
method Quantile-random-forest model trained on binary solids data.
result Random-forest model achieves <25% symmetric MAPE for both DFT codes.

Study shows LLMs can extrapolate rules from out-of-distribution prompts.

problem Understanding LLMs' ability to generalize from unexpected inputs.
method Formal languages and rule-based scenarios to evaluate LLMs' OOD behavior.
result LLMs can extrapolate rules from out-of-distribution prompts, even in complex scenarios.

Ridgeless ReLU networks interpolate datasets and extrapolate based on curvature signs.

problem Interpolating and extrapolating 1D datasets with ReLU networks.
method Minimizes 2\ell_2-norm of weights, extrapolates based on curvature signs.
result Ridgeless ReLU interpolants extrapolate as nearest neighbor curvature extrapolation.

Neural networks extrapolate poorly in simple tasks but succeed in complex ones.

problem Understanding neural networks' extrapolation capabilities and conditions for success.
method Analyzing ReLU MLPs and GNNs, connecting to neural tangent kernel.
result ReLU MLPs learn linear functions but not most nonlinear ones, while GNNs succeed in complex tasks due to task-specific non-linearities.

We extend return extrapolation to incorporate asymmetry and saturation, finding that asymmetric nonlinear extrapolation leads to lower welfare loss.

problem Optimal portfolio choice under stochastic volatility
method Smooth, nonlinear extrapolation function with sentiment and variance hedging
result Lower welfare loss with asymmetric nonlinear extrapolation

Logical neural networks solve mazes by filling dead ends, but not all methods generalize well.

problem Understanding how logical neural networks extrapolate solutions to mazes.
method Examined recurrent and implicit neural networks trained on maze-solving tasks.
result Models fail to generalize well to diverse maze sizes, suggesting limitations in learning scalable algorithms.

Concept modulation models unify identifiability and extrapolation in conditional latent variable models.

problem Reliable generalization in conditional latent variable models
method Concept modulation models (CMMs) with structure AoΛoCoXA o Λ o C o X
result Lifts identifiability to conditional settings and controls extrapolation through attribute potentials.

New framework shows ERM is optimal for both interpolation and extrapolation in domain generalization.

problem Formalizing and solving the challenges of domain generalization.
method Reformulated domain generalization as an online game between a risk-minimizing player and an adversary.
result ERM is minimax-optimal for both interpolation and extrapolation in domain generalization.

Extends return extrapolation to nonlinear, asymmetric functions under stochastic volatility.

problem Behavioral anomalies in portfolio choice under stochastic volatility.
method Smooth, nonlinear, asymmetric extrapolation function; CRRA investor; Heston stochastic volatility; Hamilton-Jacobi-Bellman equation; Numerical solutions (finite-difference ADI, deep learning-driven iterative).
result Saturation acts as an endogenous correction mechanism, reducing welfare loss.

This paper explores conditions for neural networks to extrapolate to new domains.

problem Understanding when neural networks can extrapolate to unseen domains.
method Analyzes conditions for nonlinear models to extrapolate under specific distribution shifts.
result Neural networks of the form f(x)=fi(xi)f(x)=\sum f_i(x_i) can extrapolate if feature covariance is well-conditioned.

The paper explores how to extrapolate from limited data points using causal mechanisms.

problem Handling distribution shifts with limited target samples.
method Formulates the extrapolation problem with a latent-variable model embodying the minimal change principle in causal mechanisms, and identifies conditions for identification.
result Theoretical understanding and practical methods for extrapolation without requiring an on-support target distribution.

Diverging Flows detects extrapolations in flow models, ensuring reliable predictions.

problem Flow models extrapolate into invalid data, leading to silent failures.
method Structurally enforce inefficient transport for off-manifold inputs.
result Effective detection of extrapolations without compromising predictive fidelity or inference latency.

Proposes a new method to avoid model extrapolation in Shapley values.

problem Model extrapolation in marginal Shapley values leads to unreliable explanations.
method Proposes a new approach that avoids model extrapolation using marginal averaging and causal information.
result Demonstrates the impacts of model extrapolation on Shapley values and proposes a new method to avoid it.

Paper tackles intervention extrapolation using identifiable representations.

problem Predicting effects of unseen interventions on outcomes.
method Combines identifiable representation learning with autoencoders to enforce linear invariance.
result Identifiable representations enable non-linear extrapolation of interventions.