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

Trend · papers per month

1.9%3.8%5.8%7.7% · Jun 202619922001200920172026
48 results for temporal drift

CODA simulates future data to generalize models across different datasets.

problem Concept drift in real-world machine learning models.
method CODA framework using a predicted feature correlation matrix to simulate future data.
result CODA effectively achieves temporal domain generalization across different model architectures.

The paper proposes a method for distribution-free prediction sets that adapt to unknown temporal changes.

problem Distribution-free prediction sets require reliable calibration data, which is often unavailable in real-world settings with temporal changes.
method The method selects an adaptive window to construct prediction sets, optimizing a bias-variance tradeoff.
result The method provides sharp coverage guarantees and is shown to be adaptive to temporal drift through numerical experiments.

Develops a new framework for temporal anchoring in deep embedding spaces.

problem Temporal anchoring in deep embedding spaces, especially drift and convergence issues.
method Operator-theoretic framework with drift maps and event-indexed blocks, proving convergence theorems and equivalence theorems.
result Proves convergence theorems and equivalence theorems for the proposed framework.

KOMET identifies Koopman operators from model parameter trajectories to adapt to evolving data distributions.

problem Adaptation of parametric models to non-stationary environments.
method Data-driven framework using Koopman operator identification and Extended Dynamic Mode Decomposition (EDMD).
result KOMET achieves high autonomous-rollout accuracies of 0.981 to 1.000 over 100 time steps on various drifting datasets.

HawkesLLM models text generation with temporal influence, improving semantic alignment under limited memory.

problem Path-dependent uncertainty in agentic text-simulation systems.
method HawkesLLM framework separates temporal influence modeling from text generation, using a multivariate Hawkes process and a language model.
result HawkesLLM improves late-stage semantic alignment under a compact prompt-memory budget.

Improved TD learning with neural nets reduces sample complexity and overparameterization.

problem Temporal difference learning with neural networks in large state spaces.
method Projection-free and max-norm regularized Neural TD learning, with Lyapunov drift analysis.
result Max-norm regularization significantly improves TD learning's sample complexity and overparameterization.

Unified framework for generating synthetic financial time series that accurately capture both marginal distributions and temporal dynamics.

problem Generating synthetic financial time series that reproduce both marginal distributions and temporal dynamics.
method SBBTS: A unified Schrödinger-Bass framework for synthetic financial time series.
result SBBTS accurately recovers stochastic volatility and correlation parameters that prior methods fail to capture.

Efficiently reconstructs jump-diffusion processes from data using neural networks.

problem Reconstructing jump-diffusion processes from data.
method Temporally decoupled squared Wasserstein distance method using parameterized neural networks.
result Enhanced reconstruction of jump-diffusion processes from data.

The paper develops methods to reduce deployment risk under dynamic covariate shifts.

problem Reduction of deployment risk under dynamic covariate shifts.
method Time-domain Poincare inequality and Jacobian-velocity theorem to identify and control directional tangent energy.
result Drift-aligned tangent regularization (DTR) reduces risk volatility and directional gain in low-rank drift regimes.

Proceed adapts models proactively against concept drift in online time series forecasting.

problem Concept drift causes forecast models to adapt to outdated concepts, reducing performance.
method Proceed estimates and translates concept drift into parameter adjustments, enhancing model resilience.
result Proceed brings more performance improvements than state-of-the-art online learning methods.

MLDemon monitors ML systems post-deployment, improving reliability with real-time performance estimates and expert labels.

problem Ensuring reliability of machine learning systems post-deployment, especially when user inputs differ from training data.
method Integrates unlabeled and on-demand labeled data to monitor ML model performance in real-time, deciding when to acquire expert labels.
result Outperforms existing approaches in temporal datasets with diverse distribution drifts, providing theoretical optimality for distribution drifts.

Drift-Resilient TabPFN learns to adapt to changing data distributions.

problem Real-world data often shifts over time, degrading model performance.
method In-Context Learning with a Prior-Data Fitted Network, using structural causal models.
result Significant performance improvements across various datasets.

The volatility of financial instruments is rarely constant, and usually varies over time. This creates a phenomenon called volatility clustering, where large price movements on one day are followed by similarly large movements on successive days, creating temporal clusters. The GARCH model, which treats volatility as a…

2012-12-25abs ↗pdf ↗

Geometric method captures rare topics and temporal alignment in co-author networks.

problem Missing rare topics and smooth temporal alignment in topic modeling.
method Integrates multimodal text and co-author network data using Hellinger distances and Ward's linkage.
result Effective identification of rare topics and visualization of topic drift over time.

MRIF models dynamic user interests at multiple temporal-ranges.

problem Capturing dynamic and multi-resolution user interests in recommendation.
method Multi-resolution Interest Fusion (MRIF) model that considers both temporal-ranges and drifts in user interests.
result MRIF outperforms state-of-the-art recommendation methods consistently.

The paper analyzes convergence rates for stochastic approximation and reinforcement learning.

problem Establishing almost sure convergence rates for stochastic approximation and reinforcement learning under Markovian noise.
method A novel Lyapunov drift construction that applies a Poisson-equation based correction for Markovian noise to the Moreau-envelope smoothing for contractive mappings.
result Almost sure convergence rates for specific learning rates are derived, with rates arbitrarily close to o(n12η)o(n^{1 - 2η}) and o(n1)o(n^{-1}).

Online distributional prediction with latent cluster geometry

problem Predicting the full data-generating distribution in non-stationary streams
method Representing candidate laws as latent cluster geometry and using Gibbs quasi-posterior
result Achieving sublinear cumulative Wasserstein regret under bounded support and stable latent geometry

Language evolves over time in many ways relevant to natural language processing tasks. For example, recent occurrences of tokens 'BERT' and 'ELMO' in publications refer to neural network architectures rather than persons. This type of temporal signal is typically overlooked, but is important if one aims to deploy a mac…

2019-09-08abs ↗pdf ↗

A new framework models uncertainty in structured temporal data using SDEs and neural networks.

problem Uncertainty quantification in machine learning applications involving structured and temporal data.
method Integrates stochastic differential equations (SDEs) with deep generative models in a variational autoencoder framework.
result Improves uncertainty quantification in machine learning applications involving structured and temporal data.

Study uses echo-sounder buoys to analyze tuna schools' association with dFADs globally.

problem Understanding temporal trends of tuna schools' association to drifting objects.
method Applied Machine Learning to examine binary and regression outputs of tuna schools' colonization and disaggregation times.
result Median colonization and disaggregation times varied by ocean, with Pacific having longest soak and colonization times.

Paper identifies reductive MDPs, solving them in polynomial time.

problem Computational hardness of general MDPs and tractability of finite-horizon MDPs.
method Defines reductivity, a new class of SSPs, and develops a polynomial-time solution.
result Optimal policies can be found in polynomial time for reductive SSPs and MDPs.

This review covers learning under concept drift, including detection, understanding, and adaptation.

problem Unforeseeable changes in data distribution over time impact machine learning performance.
method Reviews and analyzes methodologies and techniques for concept drift detection, understanding, and adaptation.
result Establishes a framework for learning under concept drift with three main components.

This research identifies flaws in drift detection methods and creates adversarial data streams to exploit them.

problem The challenge of detecting data distribution changes (drift) in real-time systems.
method Developed adversarial data streams to show weaknesses in existing drift detection schemes.
result Demonstrated that common drift detection methods can be fooled by adversarial data streams.

Classifiers operating in a dynamic, real world environment, are vulnerable to adversarial activity, which causes the data distribution to change over time. These changes are traditionally referred to as concept drift, and several approaches have been developed in literature to deal with the problem of drift handling an…

2018-03-24abs ↗pdf ↗

Making inferences from data streams is a pervasive problem in many modern data analysis applications. But it requires to address the problem of continuous model updating and adapt to changes or drifts in the underlying data generating distribution. In this paper, we approach these problems from a Bayesian perspective c…

2017-07-07abs ↗pdf ↗

Classifies polynomial growth solutions to drift-harmonic equations on asymptotically paraboloidal manifolds.

problem Classifying polynomial growth solutions to drift-harmonic equations on specific types of manifolds.
method Inductive argument that alternates between constructing and asymptotically controlling drift-harmonic functions.
result All drift-harmonic functions with polynomial growth asymptotically separate variables and dimensions of spaces are computed.