New framework tackles DG under posterior drift, where optimal classifier varies by domain.
problem Generalizing from multiple domains with varying optimal classifiers.
method Decision-theoretic framework for DG under posterior drift.
result Optimal classifier can vary significantly across domains, challenging existing DG approaches.
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…
We study a problem of finding an optimal stopping strategy to liquidate an asset with unknown drift. Taking a Bayesian approach, we model the initial beliefs of an individual about the drift parameter by allowing an arbitrary probability distribution to characterise the uncertainty about the drift parameter. Filtering …
The study examines how posterior drift affects forecasting accuracy in overparametrized models, particularly in financial markets.
problem Impact of posterior drift on out-of-sample forecasting accuracy in overparametrized models.
method Investigation of posterior drift and its effect on model performance in financial markets.
result Overparametrized models can be sensitive to sub-periods and bandwidth parameters, leading to inconsistent returns.
Proposes a new method for conformal prediction under covariate shift with posterior drift.
problem Improving classification performance in target domains with limited training data.
method Weighted conformal classifier that leverages source and target samples.
result Demonstrates favorable asymptotic properties and practical utility.
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
Neural Diffusion Intensity Models simplify Cox processes inference.
problem Intractable nonparametric estimation and posterior inference of latent stochastic intensity in Cox processes.
method Variational framework using neural SDEs, with theoretical guarantee of ELBO maximization coinciding with maximum likelihood estimation.
result Accurate recovery of latent intensity dynamics and posterior paths with significant speedup.
New approach to portfolio optimization shows entropy regularization is ineffective.
problem Entropy regularization in mean-variance portfolio optimization under drift uncertainty.
method Combining Bayesian filtering and stochastic policy optimization.
result Entropy regularization does not accelerate learning about unknown drift.
A new method for non-rigid point set registration reduces computational complexity.
problem Efficiently registering non-rigid point sets with large numbers of points.
method Structured Analytic Coherent Point Drift (Analytic-CPD) reformulates CPD for structured analytic mappings.
result Analytic-CPD reduces computational complexity by controlling the deformation model's dimensionality.
SING improves state inference in latent SDE models for better drift function estimation.
problem Intractable posterior inference in latent SDE models.
method Natural gradient variational inference.
result SING provides faster and more reliable inference in latent SDE models.
We introduce a nonparametric approach for estimating drift and diffusion functions in systems of stochastic differential equations from observations of the state vector. Gaussian processes are used as flexible models for these functions and estimates are calculated directly from dense data sets using Gaussian process r…
We study the Markowitz portfolio selection problem with unknown drift vector in the multidimensional framework. The prior belief on the uncertain expected rate of return is modeled by an arbitrary probability law, and a Bayesian approach from filtering theory is used to learn the posterior distribution about the drift …
Bayesian Markowitz portfolio problem shows entropy regularization is ineffective.
problem Entropy regularization in Bayesian Markowitz portfolio optimization.
method Combines continuous-time Bayesian filtering with stochastic policy optimization.
result Entropy regularization does not accelerate learning of unknown drift.
Proposes a method to adapt DNNs to drift in data distribution.
problem Adapting to out-of-distribution data and shifting objectives.
method Bayesian Inference, Variational Density Propagation, Evidence Lower Bound (ELBO), Minimum Description Length (MDL) Principle.
result Minimizes catastrophic forgetting by approximating MDL principle.
Paper extends transfer learning for decision rules, improving treatment rule estimation.
problem Estimating optimal individualized treatment rules under changing conditions.
method Bayes decision rules and low-dimensional empirical risk minimization.
result Consistent estimators and risk bounds established under mild conditions.
A scalable framework uses Langevin sampling to approximate neural network models of evolving processes.
problem Uncertainty quantification in neural network models of dynamic systems.
method Flexible data model based on NODE, joint learning of data model and posterior parameters, Langevin sampling.
result Demonstrated performance on chemical reaction and material physics data, compared favorably to variational inference.
Simulation-free VI closes the approximation gap in latent SDEs
problem Recovering dynamical systems from noisy observations
method Helmholtz-SDE
result Recovers dynamics more faithfully than prior methods
Paper improves Bayesian inference in federated learning with new algorithm VR-FALD*.
problem Bayesian inference in federated learning with communication bottlenecks and statistical heterogeneity.
method Federated Averaging Langevin Dynamics (FALD) and VR-FALD*.
result VR-FALD* corrects client drift due to statistical heterogeneity, improving convergence.
New algorithms improve sampling from Bayesian deep learning models.
problem Sampling from the posterior of deep neural networks is inefficient.
method Adaptive SGMCMC algorithms with biased drift.
result Proposed algorithms significantly outperform existing methods.
New algorithm samples neural network posteriors efficiently.
problem Challenges of sampling multimodal Bayesian posteriors for neural networks.
method Greedy Bayes method using log-concave coupling of posterior and auxiliary random variable.
result Log-concave coupling facilitates efficient sampling of neuron weights.
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.
Noise-ignorant empirical risk minimization achieves state-of-the-art performance on noisy data.
problem Learning with noisy labels in multi-class classification problems.
method Introducing relative signal strength (RSS) to quantify transferability and applying Noise Ignorant Empirical Risk Minimization (NI-ERM).
result NI-ERM achieves state-of-the-art performance on CIFAR-N data challenge.
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.
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.
Paper introduces STSL, a second-order Tweedie sampler for efficient posterior sampling in inverse problems.
problem Computational challenges in sampling from posterior distributions using latent diffusion models.
method Introduces STSL, a novel second-order Tweedie sampler with tractable reverse process.
result STSL achieves 4X and 8X reduction in neural function evaluations compared to state-of-the-art solvers.
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.
We solve a complex Bayesian control problem with novel methods.
problem Optimizing control of a hidden signal's influence on noisy observations.
method Measure-valued HJB perspective, viscosity theory, approximation arguments.
result Equivalence to HJB equation and continuous viscosity solution.
Novel method for SDE calibration from sparse data using neural flows.
problem Calibrating SDEs from sparse, noisy observations.
method Characterization of posterior SDE using neural networks trained to solve a PDE with multiplicative updates.
result Significant improvement in scalability and accuracy compared to classical methods.
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.
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.
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.
Paper proposes a framework to detect adversarial concept drifts under poisoning attacks.
problem Adversarial concept drift in data streams.
method Augmented Restricted Boltzmann Machine with improved gradient computation and energy function.
result High robustness and efficacy of the proposed drift detection framework in adversarial scenarios.
Kernel-Gradient Drifting improves generative modeling for non-Euclidean data.
problem Challenges in generative modeling for non-Euclidean data.
method Replaces Euclidean displacement with kernel-induced directions, exposing score-based structure.
result Kernel-gradient drifting enables state-of-the-art one-step generation for non-Euclidean data.
A framework for evaluating and benchmarking concept drift detection methods
problem Data stream mining challenged by concept drift
method A novel benchmarking framework
result Fair comparisons of drift detection methods
A new method detects concept drift in streaming data using k-means space partitioning.
problem Detecting distribution changes in streaming data.
method Equal intensity k-means space partitioning (EI-kMeans) and heuristic sensitivity improvement.
result EI-kMeans improves drift detection accuracy and sensitivity.
Visual analytics tool detects and corrects concept drift in data streams.
problem Concept drift causes inaccurate predictions in evolving data.
method DriftVis combines drift detection and visualization.
result Visual analytics supports detection, examination, and correction of concept drift.
CURIE uses cellular automata to detect concept drift in data streams.
problem Detecting changes in data distribution (concept drift) in data streams.
method CURIE represents data stream distribution in a cellular automata grid and uses its neighborhood rule to detect changes.
result CURIE, when hybridized with base learners, performs competitively in detection metrics and classification accuracy.
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.
Paper introduces a method to explain concept drift using counterfactual explanations.
problem Understanding the features where concept drift occurs for better model adjustment.
method Formal definition and algorithm based on counterfactual explanations.
result Demonstrates usefulness of the method in various examples.
The paper analyzes recalibration methods for binary classifiers under distribution shift.
problem Recalibrating binary classifiers to match a target prior probability.
method Analysis of distribution shift assumptions and proposal of new recalibration methods.
result QMM methods provide conservative results for risk weights functions.