Paper tackles online adaptation to changing label distributions.
problem Adapting machine learning models to changing label distributions in real-world settings.
method Leverages novel analysis to show estimation of expected test loss is possible without true labels. Proposes adaptation algorithms inspired by classical online learning techniques.
result Empirically verified that OGD is particularly effective and robust to various label shift scenarios.
POLA adapts learning rates for online time series prediction.
problem Adapting to changing data distributions in dynamic environments.
method Adaptive learning rate regulation for recurrent neural networks.
result POLA outperforms other online prediction methods in real-world datasets.
Robots learn quickly from few interactions using mental replay and intrinsic motivation.
problem Continuous online adaptation for robots in changing environments.
method Bio-inspired stochastic recurrent neural network with learning signals and mental replay.
result Robots can adapt to novel environments in seconds from few interactions.
Paper tackles online multi-source domain adaptation using Gaussian mixtures and dictionary learning.
problem Adapting multiple, heterogeneous source domains to a target domain in a streaming fashion.
method Introduces a novel approach for online fitting of Gaussian Mixture Models based on Wasserstein geometry, combined with dataset dictionary learning.
result Demonstrates ability to adapt 'on the fly' to target domain data streams.
Adaptive PCA algorithms for changing environments.
problem Static adversarial regret is not suitable for changing environments.
method Online adaptive algorithms for PCA and variance minimization with sub-linear adaptive regret guarantees.
result The proposed algorithms adapt to changing environments.
New algorithm reduces TV-denoising to adaptive online learning.
problem Estimating TV-bounded functions from noisy samples.
method Deep connection to Strongly Adaptive online learning; O ( n log n ) O(n \log n) O ( n log n ) time algorithm. result Near minimax optimal rate of O ( n 1 / 3 C n 2 / 3 ) O(n^{1/3}C_n^{2/3}) O ( n 1/3 C n 2/3 ) under squared error loss. OSAMD adapts online to changing distributions with limited labels.
problem Models struggle with continual distribution shifts and expensive labeling in changing environments.
method Online Active Continual Adaptation with OSAMD, an online teacher-student structure and margin-based criterion.
result OSAMD achieves favorable dynamic regret bounds under changing environments with limited labels.
Unified approach to adaptive regularization in online and stochastic optimization.
problem Improving convergence in stochastic optimization by adjusting gradient geometry.
method Develops a framework to analyze and derive adaptive online optimization algorithms.
result Simpler convergence proofs for existing methods like AdaGrad and Online Newton Step.
A probabilistic framework for online test-time adaptation
problem Adapting models to new data under distributional shift
method State-space modelling architecture
result Characterizing parameter learning, time evolution, prior tuning, and prediction
This work tackles online adaptation for reinforcement learning in dynamic real-world environments.
problem Expensive sample generation and failure of specialized policies in the real world.
method Meta-learning to train a dynamics model prior that can be rapidly adapted to new contexts.
result Demonstrated online adaptation for continuous control tasks in both simulated and real-world agents.
Adaptive online learning algorithm improves history forgetting in nonstationary environments.
problem Adversarial nonstationary environments where future data can be very different from past data.
method Discounted regret in online convex optimization, FTRL-based algorithm, adaptive learning rate.
result Improves classical gradient descent with constant learning rate in online convex optimization.
The paper improves smoothed analysis for online problems with adaptive adversaries.
problem Online prediction, discrepancy minimization, and online optimization with adaptive adversaries.
method General technique to prove smoothed guarantees against adaptive adversaries, reducing to simpler oblivious adversaries.
result Strong smoothed guarantees for three online problems, matching or improving previous results.
New online conformal prediction methods minimize strongly adaptive regret and achieve near-optimal coverage.
problem Uncertainty quantification in online settings with changing data distributions.
method Developed new online conformal prediction methods that minimize strongly adaptive regret.
result Achieve near-optimal strongly adaptive regret and approximately valid coverage.
HireVAE adapts to market regimes for online stock prediction.
problem Building an online and adaptive factor model for stock prediction.
method HireVAE uses a hierarchical latent space to estimate latent factors from historical market information.
result HireVAE outperforms previous methods in active returns across benchmarks.
Adversarial online nonparametric regression achieves optimal rates with locally adaptive learning.
problem Adversarial online nonparametric regression with general convex losses.
method Parameter-free learning algorithm leveraging chaining trees to compete against H{ö}lder functions, dynamically tracking and adapting to local smoothness variations.
result First computationally efficient algorithm with locally adaptive optimal rates for online regression in an adversarial setting.
Extends boosting to online multiclass problems with optimal algorithms.
problem Online multiclass classification challenges.
method Defines and justifies a weak learning condition for online multiclass boosting. Proposes an adaptive algorithm.
result Optimal boosting algorithm for online multiclass problems.
Paper develops a method for rapid online learning of deep models.
problem Rapid adaptation of deep models to changing tasks.
method Uses meta-learning to train a model that can adapt to new tasks and recall old ones.
result Meta-learning enables effective continuous adaptation in non-stationary task distributions.
Wavelet-based online learning adapts to noisy Besov spaces with high probability.
problem Minimizing integrated squared error in Besov spaces with noisy observations.
method Adaptive wavelet-based online learning algorithm that dynamically adjusts to gradient noise.
result Achieves minimax-optimal integrated squared error with high probability.
Adaptive algorithm minimizes online prediction errors for irregular data.
problem Online adversarial regression with highly irregular prediction rules.
method Adaptive wavelet-based algorithm for Besov space regression.
result Minimax-optimal regret bounds in adversarial settings.
New method converts online to offline optimization with adaptive minibatch sizes.
problem Optimizing online to offline conversions with adaptive minibatch sizes.
method A novel scheme that converts online adaptive algorithms into offline methods, with adaptive guarantees and implicit structure adaptation.
result Favourable adaptive guarantees and implicit structure adaptation in the offline optimization setting.
Paper proposes an online adaptation algorithm for improving model performance.
problem Improving model fidelity in real-time for domain shift and time variance.
method Extended Kalman Filter with Exponential Moving Average and Dynamic Multi-Epoch strategy.
result Proposed algorithm outperforms existing methods in experiments.
An online learning framework for survival analysis with real-time adaptation.
problem Real-time adaptation to dynamic environments and censored data in survival analysis.
method Online Newton Step (ONS) for optimal second order online convex optimization.
result Logarithmic stochastic regret for ONS with adaptive aggregation method.
Adaptive feature extraction boosts contextual bandit performance.
problem Improving performance in online decision making with contextual bandit.
method Adaptive feature extraction based on online clustering and online selection of encoders.
result Clear advantages over standard contextual bandit in various environments.
New algorithm improves online learning with expert advice and metric learning.
problem Improving online learning performance in changing environments.
method Parameter-free online learning algorithm using coin betting.
result Strongly adaptive regret bound improvement of at least sqrt(log(T)).
Paper tackles online learning with interval regret, achieving adaptive bounds.
problem Non-stationary online learning over time intervals.
method Two-layer online ensemble structure with gradient variation.
result Achieves strong theoretical guarantees with adaptive bounds.
New algorithm reduces control error in systems with changing dynamics.
problem Online control of systems with time-varying linear dynamics.
method Introduces adaptive regret metric and a novel meta-algorithm.
result First adaptive regret bound for online convex optimization with memory.
New adaptive first-order methods improve on quasi-Newton variants.
problem Designing efficient gradient methods for practical applications.
method Online scaled gradient methods (OSGM) with new adaptive methods OSGM-Best.
result OSGM-Best matches quasi-Newton variants but requires less memory and cheaper iterations.
New algorithms adapt to both gradient norms and comparator norms in online learning.
problem Adapting to both gradient norms and comparator norms in online learning.
method Developed parameter-free and scale-free algorithms for unbounded online convex optimization.
result Improved regret bounds for scale-invariant online prediction with linear models.
Algorithm adapts to shifting domains with minimal label queries.
problem Adaptive learning in online machine learning systems with domain shifts.
method Adaptive algorithm balancing regret and label queries for hidden domains.
result Achieves lower regret compared to uniform and greedy queries.
Adaptive algorithms improve cost-sensitive online classification with second-order information.
problem Improving cost-sensitive online classification with second-order information.
method Proposes adaptive regularization algorithms with sketching technique for better trade-off between performance and efficiency.
result Empirically validated algorithms' effectiveness and properties in real-world anomaly detection tasks.
Bayesian method adapts to unknown distribution shifts in online learning.
problem Online learning with unknown and irregular distribution shifts.
method Bayesian inference with change-point detection and beam search.
result Improves adaptation to new data distributions over state-of-the-art methods.
Adapts to new environments in robotics using latent variable models.
problem Learning dynamics in robotic environments with subtle variations.
method Variational inference for latent representation, online Bayesian inference, neural network ensemble.
result Positive transfer during training and online adaptation on HalfCheetah task.
ELF improves FM forecasts by efficiently using online feedback.
problem Fixed FMs fail to adapt to current data characteristics.
method ELF-Forecaster learns current data distribution, ELF-Weighter combines forecasts.
result ELF improves FM forecasts across various datasets.
Online learning algorithms are designed to learn even when their input is generated by an adversary. The widely-accepted formal definition of an online algorithm's ability to learn is the game-theoretic notion of regret. We argue that the standard definition of regret becomes inadequate if the adversary is allowed to a…
New adaptive methods improve online learning performance across various convex functions.
problem Designing methods that perform well across a wide range of convex functions and cost functions.
method Adaptive learning of parameters and specific parametric families, generalizing existing methods.
result Proposed framework outperforms existing methods in learning the best regularizer for Online Mirror Descent.
New algorithm improves online learning with reduced discretization.
problem Improving adaptive online learning with refined discretization.
method Continuous time approach to online learning, followed by a new discretization argument.
result Optimal regret bound with O ( V T ) O(\sqrt{V_T}) O ( V T ) dependence on gradient variance. Study online learning of quantum processes, showing feasibility for certain types.
problem Learning quantum processes adaptively, especially for bounded gate complexity and Pauli channels.
method Online learning, mistake-bounded model, multiplicative weights update algorithm, Bell sampling.
result Online learning feasible for quantum channels of bounded gate complexity and Pauli channels.
Neurogenesis-inspired online learning adapts model architecture in changing environments.
problem Continuous adaptation of model architecture in non-stationary environments.
method Online dictionary-learning framework with adaptive addition and deletion of units, inspired by neurogenesis.
result Significant improvement in performance on nonstationary data compared to fixed-size online sparse coding.
GALA adapts learning rates online by aligning gradients, improving deep learning model performance.
problem Fine-tuning learning rates for deep learning models requires extensive grid search.
method GALA dynamically adjusts learning rates by tracking gradient alignment and local curvature.
result GALA produces a flexible, adaptive learning rate schedule that increases when gradients align.
LMNs enhance neural networks with memory to adapt online.
problem Online adaptation of neural networks for domain-relevant data.
method LMNs use label-based memory replacement and write to memory only for instances with non-zero loss.
result Significant accuracy gains on various tasks including word-modelling and few-shot learning.
A new approach for test-time adaptation detects and reacts to distribution shifts.
problem Improving test-time accuracy under distribution shifts.
method Online self-training with a detection tool based on entropy values and betting martingales.
result The classifier's entropy values match those of the source domain, building invariance to distribution shifts.
Paper tackles dynamic label shift in online learning, achieving optimal performance.
problem Adapting to changing class marginals in online supervised and unsupervised learning.
method Develops novel algorithms reducing adaptation to online regression, achieving optimal dynamic regret.
result Achieves superior performance in various online label shift scenarios.
We propose a general framework for studying adaptive regret bounds in the online learning framework, including model selection bounds and data-dependent bounds. Given a data- or model-dependent bound we ask, "Does there exist some algorithm achieving this bound?" We show that modifications to recently introduced sequen…
New method controls false discoveries in real-time data streams.
problem Online testing of hypotheses with strict error constraints and no future data.
method Structure-adaptive sequential testing (SAST) with alpha-investment algorithm.
result Substantial power gain over existing online testing rules.
New algorithm reduces adaptation lag in online model selection.
problem Adaptation lag in online model selection for non-stationary environments.
method Optimistic online mirror descent with safeguarded large learning rates.
result Reduces adaptation lag from hundreds of rounds to a few rounds.
New online feature selection method handles streaming data with concept drift.
problem Handling streaming data with concept drift and sparsity.
method Online feature screening method with model adaptation.
result Online screening methods with model adaptation outperform without model adaptation on data streams with concept drift.
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.
FSNet improves online time series forecasting by balancing fast adaptation and old knowledge.
problem Online time series forecasting challenges in handling abrupt and recurring patterns.
method Inspired by CLS theory, FSNet uses a dynamic balance between fast adaptation and old knowledge retrieval.
result FSNet achieves robustness to both new and recurring patterns through dynamic balancing and associative memory.