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

221443664885 · Jun 202019922001200920172026
48 results for algorithmic extrapolation

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.

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.

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.

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.

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.

Iteratively reweighted 1\ell_1 algorithm is a popular algorithm for solving a large class of optimization problems whose objective is the sum of a Lipschitz differentiable loss function and a possibly nonconvex sparsity inducing regularizer. In this paper, motivated by the success of extrapolation techniques in accele…

2017-10-22abs ↗pdf ↗

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.

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.

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.

Shape-constrained symbolic regression improves model extrapolation with prior knowledge.

problem Improving model extrapolation with prior knowledge in symbolic regression.
method Shape-constrained symbolic regression using evolutionary algorithms with interval arithmetic.
result Models with shape constraints have improved extrapolation but lower accuracy on test sets.

Study Q-learning with constant stepsize, proving convergence and bias, and applying extrapolation.

problem Understanding and optimizing Q-learning with constant stepsize.
method Connecting Q-learning to a Markov chain, proving distributional convergence and bias, applying Richardson-Romberg extrapolation.
result Explicit expression for the linear coefficient of the asymptotic bias and improvement of RR extrapolation method.

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.

Nesterov's extrapolation improves convergence in nonsmooth optimization.

problem Improving convergence rate in nonsmooth convex optimization.
method Nesterov's extrapolation applied to projected subgradient methods.
result Nesterov's extrapolation optimizes individual convergence for nonsmooth problems.

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.

Paper examines constant stepsize in LSA for Markovian data inference.

problem Improving statistical inference with constant stepsize in LSA for Markovian data.
method Established CLT, used averaged LSA iterates, applied Richardson-Romberg extrapolation.
result Constant stepsize leads to better CI coverage, especially with limited data.

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.

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.

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

Paper analyzes \FedAvg's convergence and introduces a new algorithm to reduce bias.

problem Analyzing convergence and bias in Federated Averaging.
method Markov property, first-order bias expansion, Richardson-Romberg extrapolation.
result Bias in \FedAvg can be decomposed into noise and client heterogeneity components.

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.

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.

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.

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.

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.

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.

We present a framework on how to hedge the interest rate sensitivity of liabilities discounted by an extrapolated yield curve. The framework is based on functional analysis in that we consider the extrapolated yield curve as a functional of an observed yield curve and use its Gâteaux variation to understand the sensiti…

2014-06-24abs ↗pdf ↗

The paper tackles extrapolation in generative models by enforcing independence of mechanisms.

problem How to make generative models extrapolate to new, unseen environments?
method Developed a theoretical framework for independence of mechanisms, demonstrated on toy examples and real-world data.
result Extrapolation capabilities of generative models can be improved by enforcing independence of mechanisms explicitly during training.

Methodology extrapolates wind fields from sparse data with uncertainty quantification.

problem Extrapolating wind fields from limited measurements with uncertainty.
method Nonparametric Bayesian dictionary learning for sparse/incomplete data.
result Enhanced extrapolation accuracy, even in high-dimensional data.