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

92184275367 · May 202619922001200920172026
48 results for Residual dependence

Develops a new multivariate regression model for complex outcomes.

problem Flexible, heterogeneous, and residual-dependent multivariate regression problems.
method MultiVCBART framework with Graphical Horseshoe priors.
result Empirically outperforms existing models on sparse, high-dimensional datasets.

Develops efficient inference for noise heterogeneity in machine learning models.

problem Downstream procedures based on residuals can be biased in additive noise models.
method Semiparametrically efficient inference using a novel Hilbert-valued one-step estimator.
result Constructs tests and confidence intervals for residual independence and goodness of fit.

Alpha-based performance evaluation may fail to capture correlated residuals due to model errors. This paper proposes using the Generalized Information Ratio (GIR) to measure performance under misspecified benchmarks. Motivated by the theoretical link between abnormal returns and residual covariance matrix, GIR is deriv…

2018-03-04abs ↗pdf ↗

DIET tests conditional independence using marginal dependence measures of residual information.

problem Computational intractability of conditional randomization tests (CRTs).
method DIET avoids fitting large models by leveraging marginal independence statistics of information residuals.
result DIET achieves higher power than other tractable CRTs on synthetic and real benchmarks.

Proposes a neural network method to correct residual distortions in coordinate transformations.

problem Nonlinear and spatially dependent distortions in coordinate transformation models.
method Residual-based neural network approach focusing on systematic distortions.
result The method improves accuracy and stability in challenging conditions.

Generalization bounds derived for neural ODEs and deep residual networks.

problem Understanding the generalization capability of neural ODEs and deep residual networks.
method Lipschitz-based argument and analogy with deep residual networks.
result A generalization bound involving the magnitude of weight matrix differences.

KBB algorithm reduces sample complexity for policy evaluation in general state spaces.

problem Policy evaluation in large state spaces with high sample complexity.
method Alternates between fitting Bellman residual and estimating value function via adaptive feature set growth.
result Super-linear convergence rates demonstrated, with reductions in sample complexity.

Deep learning for HJB PDEs using synthetic data and residual minimization.

problem Solving Hamilton-Jacobi-Bellman PDEs for optimal control problems.
method Gradient-augmented synthetic dataset for supervised learning, residual minimization.
result Improves accuracy and efficiency of deep learning for HJB PDEs.

Study tests how U.S. equity prices align with global asset frequencies using financial variables.

problem Testing whether U.S. equity prices align with global asset frequencies using financial variables.
method Examines SPX and RUT gaps, uses OIS-based funding, volatility, trading-friction, financial-condition variables, and residual information.
result Gains in fit survive broad-dollar neutralization, alternative blocks, PCA, residualization, and nested horizon selection, supporting reduced-form P-Q alignment.

A new method uses deep learning to efficiently solve complex physics equations in high dimensions.

problem Efficiently solving high-dimensional time-dependent PDEs with dynamic solutions.
method Deep adaptive sampling framework for PINNs extended to spacetime domains using normalizing flows.
result The method effectively identifies and tracks high-residual regions in both space and time.

Temporal aggregation reveals latent default correlation from monthly data.

problem Understanding effective default correlation from monthly default data.
method Temporal coarse-graining of latent default-probability paths.
result Temporal coarse-graining improves identifiability and reduces over-allocation of long-horizon fluctuations.

Temporal coarse-graining of latent default paths explains effective correlation in corporate defaults.

problem Understanding effective default correlation in corporate defaults.
method Temporal coarse-graining of latent default-probability paths, applied to corporate default-count data.
result Temporal coarse-graining provides a scale-consistent baseline that improves identifiability and reduces over-allocation of long-horizon fluctuations.

Field theory explains optimal scaling in ResNets for signal propagation.

problem Understanding optimal scaling parameter for ResNet performance.
method Finite-size field theory for ResNets to study signal propagation and scaling.
result Analytical expressions for optimal scaling parameter, independent of other hyperparameters.

Residual networks' depth is mathematically equivalent to expanding an implicit ensemble size.

problem Understanding why deep residual networks are effective.
method Formal analysis of residual networks as ensembles of shallow models.
result Increasing network depth is equivalent to expanding the size of an implicit ensemble, revealing a hierarchical structure.

The aim of our work is to propose a natural framework to account for all the empirically known properties of the multivariate distribution of stock returns. We define and study a "nested factor model", where the linear factors part is standard, but where the log-volatility of the linear factors and of the residuals are…

2013-09-12abs ↗pdf ↗

RR-GNN improves GNN prediction intervals by accounting for graph heteroscedasticity and structural biases.

problem Uncertainty quantification in GNNs for high-stakes domains.
method Graph-Structured Mondrian CP, Residual-Adaptive Nonconformity Scores, Cross-Training Protocol.
result Improved efficiency and no loss of coverage compared to CP baselines.

In this paper a new method for heat load prediction in district energy systems is proposed. The method uses a nominal model for the prediction of the outdoor temperature dependent space heating load, and a data driven latent variable model to predict the time dependent residual heat load. The residual heat load arises …

2020-02-13abs ↗pdf ↗

In this paper, we propose a novel perturbation-based exploration method in bandit algorithms with bounded or unbounded rewards, called residual bootstrap exploration (\texttt{ReBoot}). The \texttt{ReBoot} enforces exploration by injecting data-driven randomness through a residual-based perturbation mechanism. This nove…

2020-02-19abs ↗pdf ↗

The paper introduces a diagnostic method to detect grokking transitions in models before test accuracy improves.

problem Detecting the transition from training to generalization in machine learning models.
method Summarize task-dependent observables as empirical distributions, map them to Wasserstein/quantile coordinates, and analyze using Hankel dynamic mode decomposition.
result The diagnostic method achieves AUROC \(\approx\) 0.93 for grokking-vs-non-grokking discrimination at the run level.

Study minimizers in large volume isoperimetric problems with a new flatness criterion.

problem Minimizers in isoperimetric problems with a compact obstacle.
method Study Plateau-type problem with free boundary, develop mesoscale flatness criterion.
result Identify isoperimetric residue in energy expansion for large volume.

Belief propagation and its variants are popular methods for approximate inference, but their running time and even their convergence depend greatly on the schedule used to send the messages. Recently, dynamic update schedules have been shown to converge much faster on hard networks than static schedules, namely the res…

2012-06-20abs ↗pdf ↗

Optimal a priori estimates are derived for the population risk, also known as the generalization error, of a regularized residual network model. An important part of the regularized model is the usage of a new path norm, called the weighted path norm, as the regularization term. The weighted path norm treats the skip c…

2019-03-06abs ↗pdf ↗

D2SRM solves complex PDEs using deep learning.

problem High-dimensional, Hessian-dependent fully nonlinear parabolic PDEs.
method Single scalar space-time network generating derivative-consistent approximations trained through residuals and penalties.
result Well-posedness and convergence theory established for globally Lipschitz equations.

New method learns PDE solutions from low-fidelity data.

problem Challenges in learning PDE surrogates with scarce data.
method Flow matching in infinite-dimensional space with conditional neural operators.
result Accurately learns PDE solutions across different resolutions and fidelities.

Researchers expand on best subset selection theory, identifying key complexities.

problem Understanding model selection performance in high-dimensional sparse linear regression.
method Analyzing residualized signals, orthogonality, and spurious projections to establish margin conditions.
result Established necessary and sufficient margin conditions for BSS model consistency.

We prove that the "generic condition" used in singularity theorems of general relativity is generic in the space of Lorentzian metrics on a given manifold, in the sense that it is satisfied for all metrics in a residual set in the Whitney CkC^k-topology, for kk depending on the dimension of the manifold.

2017-01-25abs ↗pdf ↗

Improved stochastic approximation method reduces residual error.

problem Reducing residual error in stochastic approximation algorithms.
method Fixed-schedule one-quarter barrier and bias-corrected acceleration.
result Achieves T1/2+o(1)T^{-1/2+o(1)} residual reduction with O(1)O(1) primitive samples.

Due to the success of residual networks (resnets) and related architectures, shortcut connections have quickly become standard tools for building convolutional neural networks. The explanations in the literature for the apparent effectiveness of shortcuts are varied and often contradictory. We hypothesize that shortcut…

2018-06-01abs ↗pdf ↗

Residual finiteness is known to be an important property of groups appearing in combinatorial group theory and low dimensional topology. In a recent work [2] residual finiteness of quandles was introduced, and it was proved that free quandles and knot quandles are residually finite. In this paper, we extend these resul…

2019-02-08abs ↗pdf ↗

In this note, residual finiteness of quandles is defined and investigated. It is proved that free quandles and knot quandles of tame knots are residually finite and Hopfian. Residual finiteness of quandles arising from residually finite groups (conjugation, core and Alexander quandles) is established. Further, residual…

2018-05-19abs ↗pdf ↗

Deep heteroskedastic models overfit, showing a phase transition with regularization strength.

problem Overfitting in deep heteroskedastic regression models.
method Theoretical framework based on statistical field theory, empirical verification, and hyperparameter simplification.
result A phase transition in model behavior with varying regularization strength.

DeRegiME forecasts with regime structure, improving probabilistic predictions across various time series.

problem Probabilistic forecasting discards residual uncertainty, and distribution shifts are hard to capture.
method DeRegiME uses a sparse variational Gaussian process with a nonstationary regime-mixing kernel to separate latent uncertainty regimes.
result DeRegiME improves NLPD by 20.3% on average across benchmarks, with gains on CRPS and MSE.

New framework assesses deep learning models for spatio-temporal data with missing data.

problem Challenges in assessing deep learning models for spatio-temporal data with missing and heterogeneous data.
method Residual correlation analysis framework using spatio-temporal graphs and asymptotically distribution-free summary statistics.
result Identification and localization of regions where predictive performance can be improved.