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

126251377502 · Jun 202019922001200920172026
48 results for Dynamic Testing

Proposes a new test for validating multivariate dynamic regression models.

problem Inadequate exogeneity conditions for conventional model specification tests in dynamic systems.
method Develops a generalized Durbin estimator for multiple-equation systems with dynamic dependencies, and constructs Wald tests.
result Bootstrap-based Wald tests improve finite-sample size control and validate the null hypothesis in multifactor models.

Study on test risk dynamics in learning theory with stochastic gradient flow.

problem Understanding test risk in stochastic gradient flow dynamics.
method Path integral formulation for small learning rates, explicit computation for weak features.
result Explicit corrections due to stochastic term in dynamics, good agreement with simulations.

The paper analyzes a neural network two-sample test using kernel analysis.

problem Determining if two datasets come from the same distribution.
method Time-analysis on a neural tangent kernel (NTK) two-sample test, extending to realistic neural network dynamics.
result Training times needed to detect deviations are well-separated in null and alternative hypothesis scenarios.

Adaptive RL optimizes testing resource allocation for dynamic software environments.

problem Optimizing resource allocation for evolving software testing environments.
method Integrates Q-learning with hybrid reward design for sequential decision-making.
result Consistently outperforms static and optimization-based baselines in simulation studies.

Proposes dynamic borrowing method for historical data in clinical trials.

problem Insufficient statistical power in rare and pediatric disease clinical trials.
method Dynamic borrowing method based on frequentist approach using similarity measures.
result Demonstrates usefulness of dynamic borrowing in reanalyzing clinical trial data.

A new test evaluates risk estimation accuracy using probability integral transform.

problem Measuring the accuracy of financial market risk estimations.
method Probability Integral Transform (PIT) of ex post realized returns against ex ante probability distributions.
result The new test shows the importance of capturing the dynamic of financial markets.

New algorithms control FDX while achieving more power in online multiple testing.

problem Problems with previous online multiple testing methods, including high FDX and low power.
method Developed new dynamic algorithms that adjust testing levels based on accumulated wealth.
result SupLORD algorithm achieves higher power and FDR control in synthetic experiments.

New deep learning method improves financial stress testing accuracy.

problem Traditional stress testing methods are criticized for unrealistic assumptions and estimation errors.
method Proposes a novel Deep Learning approach for Dynamic Balance Sheet Stress Testing.
result Empirical results show significant improvement in accuracy over traditional methods.

STAD adapts models to evolving time-based data shifts.

problem Gradual distribution shifts over time challenge existing test-time adaptation methods.
method Bayesian filtering method that learns time-varying dynamics in hidden features.
result STAD excels in handling small batch sizes and label shift on real-world data.

Unified framework for robust A/B testing under model misspecification.

problem Improving sample efficiency in A/B testing with model misspecification.
method Unified framework for contextual bandit and dynamic settings, proving worst-case mean squared error bounds.
result Empirically validated approach using synthetic and real-world datasets.

Transfer and adaptation to new unknown environmental dynamics is a key challenge for reinforcement learning (RL). An even greater challenge is performing near-optimally in a single attempt at test time, possibly without access to dense rewards, which is not addressed by current methods that require multiple experience …

2019-10-17abs ↗pdf ↗

MOSAIC detects change points in dynamic networks with low-rank and sparse changes.

problem Detecting change points in dynamic networks with specific structural properties.
method Eigen-decomposition-based test with screened signals and residual-based adjustment.
result MOSAIC achieves minimax-optimal detection and testing rates.

Analog forecasting uses local dynamics to predict chaotic systems.

problem Theoretical connections between analog forecasting and dynamical systems are overlooked.
method Local approximations of the system's dynamics, linear regression, and estimation of analog forecasting errors.
result Analog forecasting performances are highly linked to the local Jacobian matrix of the flow map.

A new model explains relative spreads between economies using dynamic Nelson-Siegel and functional regression.

problem Analyzing and predicting relative spreads between economies in fixed income markets.
method State-space functional regression model incorporating dynamic Nelson-Siegel model and kernel PCA.
result The new model outperforms the dynamic Nelson-Siegel model in explaining relative spreads.

Spiking neuronal networks are usually simulated with three main simulation schemes: the classical time-driven and event-driven schemes, and the more recent hybrid scheme. All three schemes evolve the state of a neuron through a series of checkpoints: equally spaced in the first scheme and determined neuron-wise by spik…

2017-06-18abs ↗pdf ↗

Dynamic regressor selection (DRS) systems work by selecting the most competent regressors from an ensemble to estimate the target value of a given test pattern. This competence is usually quantified using the performance of the regressors in local regions of the feature space around the test pattern. However, choosing …

2019-04-09abs ↗pdf ↗

LLMs detect market patterns through causal reasoning, not just temporal association.

problem Detecting structural market patterns in financial data.
method Obfuscation testing using the WHO-WHOM-WHAT framework.
result LLMs achieve 71.5% detection rate of market patterns without temporal context.

New sampling and identity-testing methods for mixtures of distributions that don't satisfy approximate tensorization of entropy.

problem Sampling and identity-testing for mixtures of distributions that don't satisfy approximate tensorization of entropy.
method Fast mixing of Glauber dynamics and efficient identity-testers in the coordinate-conditional sampling access model.
result Efficient identity-testers for mixtures of ATE distributions in the coordinate-conditional sampling access model.

Improved Granger causality method for dynamic time series data.

problem Traditional Granger causality method assumes constant causalities, failing to model dynamic causalities.
method Dynamic window-level Granger causality (DWGC) method with causality indexing.
result Improved DWGC method better detects window-level causalities.

The paper addresses uncertainty in demand prediction for dynamic pricing.

problem Uncertainty quantification in the demand function for dynamic pricing.
method Developed a debiased approach to construct accurate confidence intervals for the demand function.
result Asymptotic normality guarantee of the debiased estimator for the demand function.

This study evaluates a dynamic pairs trading strategy in cryptocurrencies using cointegration tests.

problem Improving profitability and risk management in cryptocurrency trading.
method Engle-Granger, KSS, Johansen tests; optimal look-back window; mean-reversion speed calibration; microstructure limitations consideration.
result The strategy outperforms naive buy-and-hold in Bitmex exchange with low maximum drawdown.

Numerous networks in the real world change over time, in the sense that nodes and edges enter and leave the networks. Various dynamic random graph models have been proposed to explain the macroscopic properties of these systems and to provide a foundation for statistical inferences and predictions. It is of interest to…

2019-04-06abs ↗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.