Paper studies identifiability and stability of drifting fields in generative modeling.
problem Identify and stabilize drifting fields in generative modeling.
method Introduces companion-elliptic kernel families to address limitations of Laplace kernel.
result Establishes field identifiability and demonstrates scalar observables for weak convergence.
The paper explores identifiability and stability in drifting fields using companion-elliptic kernels.
problem Identifying and stabilizing drifting fields in generative modeling.
method Introduces companion-elliptic kernel families and analyzes their properties to address identifiability and stability issues.
result Established field identifiability for arbitrary Borel probability measures and demonstrated that field convergence alone does not guarantee weak convergence.
Geometric stability predicts steerability and detects drift in language models.
problem Predicting steerability and detecting drift in language models.
method Supervised and unsupervised geometric stability measures.
result Supervised geometric stability predicts steerability with high accuracy and detects drift earlier.
Unified techniques improve stability and replicability in changing data.
problem Concept drift in data generating distribution.
method Removing hidden confounding and causal regularization.
result Improves stability, replicability, and robustness in heterogeneous data.
LoRA- improves EFCL by stabilizing feature drifts.
problem Catastrophic forgetting in exemplar-free continual learning.
method LoRA-subtraction to adaptively subtract old task weights.
result LoRA- achieves state-of-the-art performance in EFCL.
Designing deterministic denominators for SGLD stabilizes large drifts.
problem Stabilizing large drifts in SGLD
method Using state-dependent envelopes and empirical quantiles for activation thresholds
result Proxy-quantile denominators are close to oracle-score behavior and improve deterministic taming choices
Paper analyzes stability and forgetting in score-based generative models.
problem Understanding the stability and long-time behavior of generative models.
method Quantitative bounds on sampling error using stability and forgetting properties of the Markov chain.
result Provides practical consequences of stability and contraction mechanism in sampling.
Gradient-based methods for games suffer from discrete update steps that cause drift, affecting performance.
problem Gradient-based methods for two-player games suffer from drift due to discrete update steps.
method Derived modified continuous dynamical systems to closely follow the discrete dynamics of games.
result Identified distinct components of discretization drift that can alter or destabilize game performance.
Study online conformal prediction for non-stationary data with optimal training-conditional regret.
problem Online prediction for non-stationary data streams with unknown distribution drift.
method Proposes split-conformal and full-conformal algorithms that adapt to drift detection and incorporate stability for online learning.
result Proves minimax-optimal regret for online full conformal algorithm under appropriate restrictions.
PDD detects concept drift using explainable AI, improving model performance in dynamic environments.
problem Detecting and adapting to concept drift in predictive models.
method Profile Drift Detection (PDD) using Partial Dependence Profiles (PDPs).
result PDD outperforms existing methods in detecting concept drift and maintaining high predictive performance.
In this paper, we study the Lagrangian F-stability and Hamiltonian F-stability of Lagrangian self-shrinkers. We prove a characterization theorem for the Hamiltonian F-stability of n-dimensional complete Lagrangian self-shrinkers without boundary, with polynomial volume growth and with the second fundamental form sati…
Geometric formalism views optimization algorithms as discrete connections, revealing their algebraic curvature and flatness properties.
problem Understanding and optimizing the behavior of iterative optimization algorithms.
method Introducing a geometric and operator-theoretic formalism where optimization algorithms are encoded by coupled channels (drift and diffusion) whose algebraic curvature measures the deviation from ideal reversibility.
result Flat connections correspond to methods whose updates commute up to higher order, achieving minimal numerical dissipation and preserving stability.
The paper analyzes stability of random matrix products with Markovian noise.
problem Analyzing stability of random matrix products with Markovian noise.
method Using a super-Lyapunov drift condition and controlled growth of matrix-valued functions, the paper provides an exponential stability result for the p-th moment of random matrix product.
result Finite-time p-th moment bounds for linear stochastic approximation and TD learning algorithms.
Stability of the utility maximization problem with random endowment and indifference prices is studied for a sequence of financial markets in an incomplete Brownian setting. Our novelty lies in the nonequivalence of markets, in which the volatility of asset prices (as well as the drift) varies. Degeneracies arise from …
Recurrent neural networks' hidden state can be reconstructed from its past, providing a theoretical framework for stability and tracking.
problem Hidden-state stability in RNNs
method Backward coherence analysis
result Almost-sure convergence, rates under mixing, interpretable limiting representation, finite pathwise stopping times, and theoretical framework for time-uniform confidence sequences.
In this paper, we study self-expanders for mean curvature flows. First we show the discreteness of the spectrum of the drifted Laplacian on them. Next we give a universal lower bound of the bottom of the spectrum of the drifted Laplacian and prove that this lower bound is achieved if and only if the self-expander is th…
Framework quantifies financial NLP robustness under regime shifts.
problem Semantic and causal drift in financial news narratives.
method Four metrics: FCAS, PCS, TSV, NLICS.
result Transformer models are more affected by semantic drift.
DriftLite improves inference quality of diffusion models without retraining.
problem Adapting pre-trained diffusion models to new target distributions without retraining.
method Lightweight, training-free particle-based approach that steers inference dynamics with optimal stability control.
result Consistently reduces variance and improves sample quality over existing methods.
A new geometric metric identifies true data changes from parametrization artifacts in high-dimensional representations.
problem Quantifying representation drift in high-dimensional data using Euclidean or cosine distances can misattribute changes due to arbitrary parametrizations.
method Introducing the Fubini Study metric to identify representations that differ only by gauge transformations.
result The Fubini Study metric isolates intrinsic evolution by remaining invariant under gauge-induced fluctuations, providing a diagnostic for meaningful structural changes.
The paper analyzes Adam and SGD in nonstationary optimization, revealing tradeoffs between noise and drift.
problem Analyzing Adam and SGD in nonstationary optimization problems.
method Theoretical analysis of Adam and SGD under non-stationary stochastic objectives, separating two regimes.
result Characterizes the tradeoff between noise and drift in Adam and SGD, revealing when adaptive step-sizing is beneficial or harmful.
In statistical modelling the biggest threat is concept drift which makes the model gradually showing deteriorating performance over time. There are state of the art methodologies to detect the impact of concept drift, however general strategy considered to overcome the issue in performance is to rebuild or re-calibrate…
First, we consider the problem of hedging in complete binomial models. Using the discrete-time Föllmer-Schweizer decomposition, we demonstrate the equivalence of the backward induction and sequential regression approaches. Second, in incomplete trinomial models, we examine the extension of the sequential regression app…
Generative model for hypergraphs captures complex interactions without pairwise reductions.
problem Challenges in generating realistic hypergraphs with pairwise reductions.
method Structured stochastic diffusion on relaxed incidence matrices.
result Generative model preserves structure-aware noising and yields explicit Gaussian law.
RELTA-SGLD stabilizes nonconvex SGLD updates with a lighter taming scheme.
problem Stabilizing superlinear stochastic-gradient updates in nonconvex optimization.
method Threshold-based taming with relative-growth principle for stability.
result Polynomial moment stability and first-order stationary accuracy in nonconvex SGLD.
In this paper the stability theorem of Borkar and Meyn is extended to include the case when the mean field is a differential inclusion. Two different sets of sufficient conditions are presented that guarantee the stability and convergence of stochastic recursive inclusions. Our work builds on the works of Benaim, Hofba…
Proves convergence of PSGLA for sampling non-convex potentials.
problem Sampling from non-convex potentials with stability.
method Combines ULA and proximal optimization with stability analysis.
result First proof of convergence for PSGLA on non-convex potentials.
LLMs cause inconsistent financial outputs, smaller models are more reliable.
problem Inconsistent outputs from LLMs undermine auditability and trust in financial workflows.
method Finance-calibrated deterministic test harness, task-specific invariant checking, model classification, and cross-provider validation.
result Smaller models (Granite-3-8B, Qwen2.5-7B) achieve 100% output consistency, while larger models like GPT-OSS-120B have high drift.
This paper improves risk control for financial markets by calibrating VaR forecasts using conformal methods.
problem Nonstationary and regime-dependent losses in financial markets.
method Regime-weighted conformal risk control (RWC) for VaR forecasting.
result RWC improves regime-conditional stability in some settings with modest conservativeness changes.
Paper proposes a new method to stabilize noisy gradient algorithms.
problem Stochastic-gradient Langevin algorithms can introduce bias when taming denominators depend on stochastic-gradient realizations.
method Proposes a structure-preserving framework for designing tamed denominators that avoid unnecessary taming and maintain the stabilizing effect of taming.
result The method avoids stationary bias and explains the stationary error split into bias and remaining error.
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.
The paper examines properties and rigidity of self-expanders in Euclidean space.
problem Characterizing and estimating properties of self-expanders in Euclidean space.
method Analyzing mean curvature flow, volume growths, and stability of self-expanders.
result Proves the uniqueness of certain self-expanders in 3D space.
Identifies features most relevant to concept drift in data.
problem Identifying features most relevant to concept drift.
method Distinguishing between drift inducing and faithfully drifting features; deriving minimal subsets of features to characterize drift.
result Derives a detection algorithm for concept drift.
Optimism stabilizes Thompson Sampling for adaptive inference in multi-armed bandits.
problem Subtle inferential properties of Thompson Sampling under adaptive data collection.
method Introduced optimism as a key mechanism to restore stability and validity of inference.
result Suitably implemented optimism stabilizes Thompson Sampling and enables asymptotically valid Wald inference.
SAM optimizer benefits from normalization, stabilizing and guiding optimization.
problem Improving deep neural network performance with SAM optimizer.
method Theoretical and empirical study of normalization in SAM for convex and non-convex functions.
result Normalization helps SAM in stabilizing and guiding optimization along a continuum of minima.
New method detects when models influence their own drift in real-time data streams.
problem Models can induce concept drift in real-time data streams.
method CheckerBoard Performative Drift Detection (CB-PDD)
result CB-PDD effectively detects performative drift in real-time data streams.
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.
The notion of drift refers to the phenomenon that the distribution, which is underlying the observed data, changes over time. Albeit many attempts were made to deal with drift, formal notions of drift are application-dependent and formulated in various degrees of abstraction and mathematical coherence. In this contribu…
A new drift detection method based on autoregressive models.
problem Concept drift in real-world data leads to decreased model performance.
method Autoregressive based drift detection method (ADDM).
result ADDM outperforms state-of-the-art drift detection methods.
Adaptive sampling detects local concept drift with limited labels.
problem Detecting local concept drift in dynamic environments with scarce labels.
method Combines residual-based exploration and exploitation with EWMA monitoring.
result Superior performance in label efficiency and drift detection accuracy.
Algorithm detects concept drift and adapts models in streaming data.
problem Concept drift in streaming data renders models inaccurate.
method Adaptive learning algorithm that detects drifts and reacts to them.
result Risk competitive to an algorithm with perfect drift knowledge.
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…
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.
This paper investigates a financial market where stock returns depend on a hidden Gaussian mean reverting drift process. Information on the drift is obtained from returns and expert opinions in the form of noisy signals about the current state of the drift arriving at the jump times of a homogeneous Poisson process. Dr…
New method detects drift in high-dimensional data.
problem Understanding and localizing concept drift in learning systems.
method Conformal predictions for drift localization.
result Our approach outperforms existing methods on image datasets.
Detects drifts in data for classification tasks using constrained embeddings.
problem Drifts in data affect model performance; unsupervised methods ignore label information.
method Task-sensitive semi-supervised drift detection with constrained low-dimensional embedding.
result Successfully detects real drifts affecting classification performance.
A federated model learns shared archetypes from heterogeneous clients in continual learning.
problem Federated learning struggles with client heterogeneity and streaming distribution shifts.
method Clients encode their data as low-rank Hebbian operators, which are sent to a central server for aggregation and factorization into global archetypes.
result Improved global archetype reconstruction and associative retrieval in heterogeneous clients, drift, and novelty settings.
Concept drift is formally defined as the change in joint distribution of a set of input variables X and a target variable y. The two types of drift that are extensively studied are real drift and virtual drift where the former is the change in posterior probabilities p(y|X) while the latter is the change in distributio…
This paper studies concept drift detectors for financial time series.
problem Improving accuracy on financial time series with concept drifts.
method Three simple concept drift detectors tailored to financial time series.
result Two of the detectors are as effective as state-of-the-art detectors.