New method tracks significant shifts in nonparametric bandits.
problem Tracking significant changes in nonparametric contextual bandits.
method Proposed a notion of 'experienced significant shifts' to adapt to minimax rate without knowledge of change parameters.
result Experienced significant shifts count fewer changes than traditional metrics, leading to an adaptive algorithm.
Study on tracking preference shifts in dueling bandits problems.
problem Tracking significant preference shifts in dueling bandits problems.
method Analysis of dueling bandits with distribution shifts, focusing on significant shifts (Suk and Kpotufe, 2022).
result Design of adaptive algorithms with O ( K i l d e L T ) O(\sqrt{K ilde{L}T}) O ( K i l d e L T ) dynamic regret for certain preference distribution classes. New algorithm tracks changes in infinite action space rewards.
problem Non-stationary Lipschitz bandits with infinite actions.
method Adaptive tracking of significant shifts using hierarchical discretization.
result Achieves minimax-optimal dynamic regret bound of O ~ ( i l d e L 1 / 3 T 2 / 3 ) \mathcal{\widetilde{O}}( ilde{L}^{1/3}T^{2/3}) O ( i l d e L 1/3 T 2/3 ) . New method tracks shifts in infinite-armed bandits without prior knowledge.
problem Tracking shifts in non-stationary infinite-armed bandits.
method Blackbox conversion of finite-armed MAB to infinite-armed non-stationary, randomized elimination.
result First parameter-free optimal regret bounds for all reservoir regularity regimes.
Shifts dataset evaluates uncertainty in real-world tasks across modalities.
problem Lack of standard datasets for evaluating uncertainty estimation and robustness to distributional shift.
method Proposes Shifts Dataset for evaluation of uncertainty estimates and robustness to distributional shift across tabular, audio, text, and sensor data.
result Baseline results for tabular weather prediction, machine translation, and SDC vehicle motion prediction.
Paper introduces a novel measure to analyze excess error in classification under covariate shift.
problem Analyzing excess error in classification under covariate shift.
method Utilizes vicinity information to characterize excess error.
result Faster or competitive convergence rates compared to previous techniques.
Graphs models are vulnerable to distribution shifts, which this work explains and mitigates.
problem Graph Neural Networks (GNNs) are susceptible to distribution shift, leading to performance degradation.
method Theoretical analysis quantifying conditional shift, proposing an approach to estimate and minimize it.
result The proposed approach demonstrates up to 10% absolute ROC AUC improvement under various distribution shifts.
Study quantifies distribution shifts and uncertainties to improve machine learning model robustness.
problem Distribution shifts between training and test datasets impact model generalization and robustness.
method Synthetic data generation and quantitative measures (KL divergence, JS distance, Mahalanobis distance) to assess data similarity and model uncertainty.
result Utilizing statistical measures like Mahalanobis distance helps assess distribution shift and model uncertainty.
Detects harmful distribution shifts in deployed models without false alarms.
problem Detecting harmful distribution shifts in deployed models without false alarms.
method Sequential tools for testing if the difference between source and target distributions leads to a significant increase in a risk function.
result Demonstrated the efficacy of the proposed framework through extensive empirical studies.
Study addresses RTB model performance drops due to distribution shifts.
problem Distribution shifts between training and target environments in RTB markets.
method Applies Exponential Tilt Reweighting Alignment (ExTRA) algorithm to estimate and correct model weights.
result Demonstrates improved RTB model performance using ExTRA algorithm.
Paper proposes SJS model to estimate model performance under covariate and label shifts.
problem Estimating model performance when both covariates and labels shift.
method Sparse Joint Shift (SJS) model and SEES algorithm.
result SEES achieves significant shift estimation error improvements over existing approaches.
New method tracks significant arm switches to improve bandit algorithms.
problem Adaptive procedures for bandits with unknown changes in reward distribution.
method Proposes a new notion of significant shift to count severe changes.
result Achieves faster rates than previous methods, especially when few changes are severe.
This paper improves computational efficiency in kernel ridge regression under covariate shift.
problem Covariate shift in nonparametric regression.
method Random projections in RKHS to reduce computational demands.
result Significant computational savings can be achieved without compromising learning performance under covariate shift.
New insights into how high-dimensional models handle covariate shifts.
problem Covariate shift in high-dimensional random feature regression.
method Exact high-dimensional asymptotics of random feature regression under covariate shift.
result Overparameterized models exhibit enhanced robustness to covariate shift.
Study guarantees convergence of mean shift mode estimation.
problem Ensuring reliable mode estimation in KDE using mean shift.
method Utilizes Łojasiewicz inequality to prove convergence rate.
result Extends convergence guarantees to biweight kernel.
We introduce the functional mean-shift algorithm, an iterative algorithm for estimating the local modes of a surrogate density from functional data. We show that the algorithm can be used for cluster analysis of functional data. We propose a test based on the bootstrap for the significance of the estimated local modes …
We present a novel methodology able to distinguish meaningful level shifts from typical signal fluctuations. A two-stage regularization filtering can accurately identify the location of the significant level-shifts with an efficient parameter-free algorithm. The developed methodology demands low computational effort an…
Chunking is a significant CL problem, accounting for half of performance drop, and current methods don't address it.
problem Chunking of data in continual learning.
method Analyzing and addressing the chunking sub-problem in continual learning.
result Current CL algorithms perform poorly on chunking, only as well as plain SGD training when there is no distribution shift.
IUPM monitors machine learning models under gradual shifts using optimal transport and active labeling.
problem Gradual distribution shifts lead to unnoticed accuracy declines in machine learning models.
method Incremental Uncertainty-aware Performance Monitoring (IUPM) using optimal transport and active labeling.
result IUPM outperforms existing baselines in gradual shift scenarios and guides label acquisition more effectively.
This paper improves conformal prediction for robust interval estimation under distribution shifts.
problem Robustness of conformal prediction under distribution shifts.
method Modeling distribution shifts using Levy-Prokhorov (LP) ambiguity sets, which capture both local and global perturbations.
result Constructs robust conformal prediction intervals that remain valid under distribution shifts.
CtrlNS learns latent factors and distribution shifts from sparse transitions without prior knowledge.
problem Lack of prior knowledge of domain variables limits causal temporal representation learning.
method Sparse transition assumption and identifiability results from theoretical perspective.
result Effective in identifying distribution shifts and latent factors without prior knowledge.
New dataset for industrial machine malfunction detection with domain shifts.
problem Challenges in detecting anomalies due to domain shifts in industrial sounds.
method Created a dataset with domain shifts for five types of industrial machines.
result Significant performance differences between source and target domains.
New insights into SGD and generalization via shift-curvature and bias-curvature mechanisms.
problem Understanding the role of curvature in generalization and how SGD affects it.
method Derivation of new SGD steady-state distribution and analysis of shift-curvature and bias-curvature mechanisms.
result Shift-curvature is a significant factor in test performance, especially for small SGD noise.
Q-SAVI model improves drug discovery accuracy with prior knowledge of chemical space.
problem Challenges in drug discovery due to covariate shift and limited labeled data.
method Probabilistic model with domain-informed prior distributions over functions.
result Q-SAVI outperforms state-of-the-art techniques in predictive accuracy and calibration.
Estimates model performance under distribution shift using domain-invariant predictors.
problem Poor performance of models on test distributions different from training distributions.
method Uses domain-invariant predictors as a proxy for unknown target labels.
result Shows that the complexity of latent representations influences target risk.
MAGDiff detects data shifts in neural networks without retraining.
problem Neural networks' sensitivity to data distribution shifts.
method Extracts MAGDiff representations from neural networks to detect shifts.
result MAGDiff representations improve data set shift detection.
Combining self-training and contrastive learning improves performance under distribution shift.
problem Improving performance under distribution shift using unlabeled data.
method Combining self-training and contrastive learning techniques.
result Combined method achieves 3-8% higher accuracy than either approach independently.
Current methods for covariate-shift adaptation use unlabelled data to compute importance weights or domain-invariant features, while the final model is trained on labelled data only. Here, we consider a particular case of covariate shift which allows us also to learn from unlabelled data, that is, combining adaptation …
CoDAG combines domain adaptation and generalization for unsupervised continual domain shift learning.
problem Acquiring knowledge in unsupervised continual domain shift learning.
method Complementary Domain Adaptation and Generalization (CoDAG) framework.
result CoDAG outperforms state-of-the-art models in all datasets and evaluation metrics.
This paper investigates how machine learning APIs change over time and proposes an efficient method to monitor these changes.
problem Understanding and assessing changes in machine learning APIs over time.
method Systematic investigation of ML API shifts, proposing a principled adaptive sampling algorithm (MASA) for efficient estimation of confusion matrix shifts.
result MASA can accurately estimate confusion matrix shifts using up to 90% fewer samples compared to random sampling.
ReTaSA tackles continuous target shift in regression problems.
problem Continuous target shift in regression settings.
method Nonparametric regularized approach to estimate importance weight function.
result The method provides theoretical justification for the estimated importance weight function.
Improves model calibration and selection in unsupervised domain adaptation.
problem Distribution shifts in unsupervised domain adaptation.
method Developed a novel importance weighted group accuracy estimator.
result Improves state-of-the-art performances by 22% in model calibration and 14% in model selection.
This paper introduces LR-FFS for robust feature screening in federated learning under label shift.
problem Label shift challenges in federated learning for high-dimensional classification.
method Unified feature screening framework, label-shift robust federated feature screening (LR-FFS), federated estimation procedure.
result LR-FFS outperforms existing methods in diverse client environments with varying class distributions, sample sizes, and missing data.
Framework detects shape shifts in functional profiles using Fréchet mean and shape invariant model.
problem Detecting shape shifts in functional profiles.
method Combining Fréchet mean and shape invariant model for interpretable parameterization of profile deviations.
result Potential shifts in shape deformation process distinguished by significant shifts in amplitude and/or phase.
Proposes a new method to adapt to covariate shifts in supervised learning.
problem Covariate shift in training and testing samples with different marginal distributions.
method Minimax risk classification (MRC) approach that weights both training and testing samples.
result Significantly enhanced classification performance in synthetic and empirical experiments.
New method improves accuracy of quantized neural networks.
problem Accuracy drop in quantized neural networks, especially MobileNet family.
method Weight equalizing shift scaler, binary shifting to recover output range.
result Top-1 accuracy improved from 0.1% to 69.78% ~ 70.96% in MobileNets.
FADE adapts machine learning models to evolving data efficiently.
problem Sequential covariate shift in dynamic environments.
method FADE uses Fisher information geometry for robust learning under SCS.
result FADE achieves up to 19% higher accuracy under severe shifts.
Paper addresses uncertainty in model generalization under regime shifts.
problem Uncertainty in model generalization under regime changes.
method Proposes a framework to quantify and separate regime mismatch and sensitivity.
result Obtains exact decomposition and minimax lower bound for regime-aware models.
Bayesian framework estimates label shift for improved classifier performance.
problem Label shift in supervised learning leading to degraded classifier performance.
method Bayesian framework with dynamic Dirichlet priors and online EM algorithms.
result Significant improvements in classifier accuracy over state-of-the-art methods.
Adaptive method for prediction sets under changing data distributions.
problem Forming prediction sets in an online setting with varying data distributions.
method Adaptive conformal inference that re-estimates the distribution shift parameter over time.
result Adaptive method achieves desired coverage frequency over long-time intervals.
PRoFILE accurately estimates feature importance under distribution shifts.
problem Challenges in estimating feature importance under distribution shifts.
method PRoFILE uses a loss estimator trained with a causal objective to estimate feature importance.
result PRoFILE accurately estimates feature importance under complex distribution shifts.
Paper tackles robust federated learning for affine distribution shifts.
problem Statistical heterogeneity and distribution shifts degrade model performance in federated learning.
method Develops a robust federated learning algorithm (FLRA) for affine distribution shifts.
result FLRA achieves significant performance gains against affine distribution shifts.
Extends Shifts dataset for MS lesion segmentation and marine vessel power estimation.
problem Distributional shift in training and deployment data for ML models.
method Develops new datasets for high-risk industrial applications.
result Demonstrates robustness and uncertainty estimation in new industrial tasks.
We created financial benchmarks for distribution shifts in crude oil prices and volatility.
problem Scarcity of task-labeled time-series benchmarks in finance.
method Transformed asset price data into volatility proxies, generated task labels based on distribution shifts, and made datasets publicly available.
result Inclusion of task labels improves continual learning algorithms' performance on real-world data.
We study the time dependent cross correlations of stock returns, i.e. we measure the correlation as the function of the time shift between pairs of stock return time series using tick-by-tick data. We find a weak but significant effect showing that in many cases the maximum correlation is at nonzero time shift indicati…
Paper analyzes why deeper layers of ViTs perform worse on out-of-distribution tasks.
problem Performance degradation of intermediate layers in ViTs under distribution shift.
method Extensive linear probing experiments across various benchmarks and fine-grained analysis of transformer modules.
result Probing feedforward network activations yields best performance under significant distribution shift.
MADOD meta-learns invariant features for OOD detection across unseen domains.
problem Simultaneous covariate and semantic shifts in real-world machine learning applications.
method Meta-learning and G-invariance to learn robust, domain-invariant features.
result Superior performance in semantic OOD detection across unseen domains.
MLE works best for covariate shift without modifications.
problem OOD generalization under covariate shift.
method Maximum Likelihood Estimation (MLE) without modifications.
result MLE achieves minimax optimality for covariate shift under well-specified setting.