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.

169,051 papers · 148 categories

Trend · papers per month

70139209278 · Jun 202019922001200920172026
48 results for residual tests

Computer vision model automates residual plot assessment for diagnosing model assumptions.

problem Automating residual plot assessment for model diagnostics.
method Trains a computer vision model to predict disparity between residual distributions and reference distributions using Kullback-Leibler divergence.
result Computer vision model is less sensitive to non-linearity but more sensitive than human judgment and conventional tests.

Paper introduces a new risk measure for multivariate residual estimation.

problem Quantifying residual estimation risk in complex financial models.
method Developed a multivariate framework for residual estimation risk, defined using various risk measures, and proposed a back-testing criterion.
result Demonstrated the effectiveness of the new measure through back-testing on retail credit portfolios.

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.

Study excess logarithmic residues for foliations to bound invariant hypersurfaces and test log canonicity.

problem Bounding invariant hypersurfaces and testing log canonicity of singularities.
method Introduce excess logarithmic residues, prove residue formula, derive Poincaré-type bound, and use them to recover log discrepancies.
result Componentwise logarithmic residues of a lifted foliation along the exceptional divisor recover log discrepancies of singularities.

The paper extends SARMA models by relaxing independence assumptions on error terms.

problem Testing adequacy of SARMA models with non-independent errors.
method Study of asymptotic distributions of residual and normalized residual empirical autocovariances and autocorrelations under weak noise assumptions.
result Established asymptotic behavior of portmanteau tests for SARMA models.

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.

GaussDetect-LiNGAM eliminates Gaussianity tests for causal discovery.

problem Causal direction identification without Gaussianity assumptions.
method Leverages the equivalence between noise Gaussianity and residual independence in reverse regression.
result Gaussianity tests replaced with robust kernel-based independence tests.

Deep residual networks trained with gradient descent have small generalization gap.

problem Limited theoretical understanding of why residual networks generalize well.
method Analyzing overparameterized deep residual networks trained by gradient descent.
result Demonstrates that residual networks have a small generalization gap between training and test error.

Deviance Voronoi residuals improve earthquake insurance risk assessment.

problem Assessing earthquake insurance risk using spatio-temporal point process models.
method Extended Voronoi residuals and created simulation-based approach.
result Proposed formula for country-wide minimum capital test.

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.

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.

PRISMA uses PDE residuals for fast, robust, and accurate inference.

problem Slow gradient-based optimization and instability in PDE residual-based methods.
method Integrates PDE residuals directly into the model's architecture via attention mechanisms in the spectral domain.
result Competitive accuracy with significantly lower inference costs and faster speeds.

Alternative to likelihood-based LSNM model selection, residual independence testing is more robust to noise misspecification.

problem Cause-effect inference in location-scale noise models with misspecified noise distributions.
method Residual independence testing as an alternative to likelihood-based model selection.
result Residual independence testing is more robust to noise misspecification.

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.

New method detects strong calibration in ML models, even for small poorly calibrated subgroups.

problem Auditing machine learning models for strong calibration is difficult, especially for small poorly calibrated subgroups.
method Reorder observations by expected residuals and use changepoint detection for score-based cumulative sum (CUSUM) test.
result The proposed adaptive CUSUM test consistently achieved higher power and more than doubled power in auditing mortality risk prediction models.

Study provides selective inference method for latent block models.

problem Challenges in constructing a test on a block structure selected by clustering algorithms.
method Developed a selective inference method for latent block models using squared residue minimization and simulated annealing.
result Proposed tests effectively handle selective bias in block structures compared to naive tests.

Novel LSTM network predicts pulsar timing residuals with few-shot data.

problem Predicting pulsar timing residuals with limited data.
method Long Short-Term Memory (LSTM) network optimized with model-agnostic meta-learning and particle swarm optimization.
result Robust generalization and accurate predictions across high-frequency test domains with minimal data.

We present in this paper a model for forecasting short-term power loads based on deep residual networks. The proposed model is able to integrate domain knowledge and researchers' understanding of the task by virtue of different neural network building blocks. Specifically, a modified deep residual network is formulated…

2018-05-30abs ↗pdf ↗

A new method improves maximum inner product search by locally decomposing residual vectors.

problem Maximum inner product search efficiency and accuracy.
method Local Orthogonal Decomposition (LOD) combined with multiscale quantization.
result LOD consistently achieves higher recall than previous methods under the same bitrates.

Transformers improve Alzheimer's disease progression prediction by accounting for irregular biomarker histories.

problem Difficult prediction of medium-horizon Alzheimer's disease progression due to tied clinical scores and irregular biomarker observations.
method Developed a residual gap-aware transformer that combines statistical reference with transformer-based residual learning.
result The proposed model reduces mean error and improves prediction-observation correlation compared to baseline models.

Deep learning outperforms Black-Scholes in Brazilian Petrobras option pricing.

problem Improving option pricing accuracy for Petrobras stocks.
method Trained deep residual networks using a custom loss function with historical data.
result Deep learning achieved a 64.3% reduction in mean absolute error compared to Black-Scholes.

Proposes a modified Morgan-Pitman test for evaluating variances in machine learning models.

problem Limited ability to account for sampling variability in model selection.
method Enhances the classic Morgan-Pitman test for robustness in non-linear models with heavy-tailed distributions or outliers.
result Demonstrates the test's effectiveness and practical utility in model evaluation and selection.

Develops a semi-parametric model for dynamic pricing in e-commerce.

problem Maximizing revenue in real-time pricing with contextual information and binary outcomes.
method Semi-parametric model with non-parametric residual distribution, learning both regression parameters and residual distribution.
result First algorithm with ildeO(n) ilde O(\sqrt{n}) regret for dynamic pricing.

We speed up Gaussian process cross-validation calculations and improve model diagnostics.

problem Efficiently calculating cross-validation residuals and their covariances in Gaussian processes.
method Generalized fast Gaussian process leave-one-out formulae to multiple-fold cross-validation, highlighting covariance structures.
result Correcting for residual covariances in cross-validation improves back to Maximum Likelihood Estimation.

MLP residual networks implement a selective coarse-graining procedure governed by the spectral structure of the input distribution.

problem Understanding the coarse-graining procedure in MLP residual networks
method Analyzing a pure MLP residual stack on synthetic Markov chain sequences
result MLP residual networks implement a selective coarse-graining procedure governed by the spectral structure of the input distribution

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 ↗

Paper proposes graph-based separable transforms for video coding.

problem Improving video coding efficiency by better capturing residual block statistics.
method Derives graph-based separable transforms (GBSTs) from line graphs with weights determined by parameters.
result GBSTs achieve about 0.4% average coding gain over existing transforms in VVC.