Imagen de Portada

Efficient Methods for Non-stationary Online Learning

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zhao, Peng, Xie, Yan-Feng, Zhang, Lijun, Zhou, Zhi-Hua
Formato:	Preprint
Publicado:	2023
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Gradient-Variation Online Learning under Generalized Smoothness
por: Xie, Yan-Feng, et al.
Publicado: (2024)

Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization
por: Zhao, Peng, et al.
Publicado: (2021)

Revisiting Weighted Strategy for Non-stationary Parametric Bandits and MDPs
por: Wang, Jing, et al.
Publicado: (2026)

Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach
por: Yan, Yu-Hu, et al.
Publicado: (2023)

Non-stationary Online Learning for Curved Losses: Improved Dynamic Regret via Mixability
por: Zhang, Yu-Jie, et al.
Publicado: (2025)

Non-stationary Delayed Online Convex Optimization: From Full-information to Bandit Setting
por: Wan, Yuanyu, et al.
Publicado: (2023)

A Simple, Optimal and Efficient Algorithm for Online Exp-Concave Optimization
por: Wang, Yi-Han, et al.
Publicado: (2025)

Optimistic Online-to-Batch Conversions for Accelerated Convergence and Universality
por: Yan, Yu-Hu, et al.
Publicado: (2025)

Provably Efficient Online RLHF with One-Pass Reward Modeling
por: Li, Long-Fei, et al.
Publicado: (2025)

Dynamic Regret via Discounted-to-Dynamic Reduction with Applications to Curved Losses and Adam Optimizer
por: Xie, Yan-Feng, et al.
Publicado: (2026)

Mixture of Online and Offline Experts for Non-stationary Time Series
por: Zhao, Zhilin, et al.
Publicado: (2022)

Stochastic Approximation Approaches to Group Distributionally Robust Optimization and Beyond
por: Zhang, Lijun, et al.
Publicado: (2023)

Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation
por: Li, Long-Fei, et al.
Publicado: (2024)

Adaptivity and Universality: Problem-dependent Universal Regret for Online Convex Optimization
por: Zhao, Peng, et al.
Publicado: (2025)

Debiased Offline Representation Learning for Fast Online Adaptation in Non-stationary Dynamics
por: Zhang, Xinyu, et al.
Publicado: (2024)

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
por: Chen, Sijia, et al.
Publicado: (2023)

Relative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion
por: Zhang, Lijun, et al.
Publicado: (2015)

Universal Online Convex Optimization with $1$ Projection per Round
por: Yang, Wenhao, et al.
Publicado: (2024)

TreeLoRA: Efficient Continual Learning via Layer-Wise LoRAs Guided by a Hierarchical Gradient-Similarity Tree
por: Qian, Yu-Yang, et al.
Publicado: (2025)

Evolving Graph Learning for Out-of-Distribution Generalization in Non-stationary Environments
por: Sun, Qingyun, et al.
Publicado: (2025)

Pausing Policy Learning in Non-stationary Reinforcement Learning
por: Lee, Hyunin, et al.
Publicado: (2024)

Revisiting Projection-Free Online Learning with Time-Varying Constraints
por: Wang, Yibo, et al.
Publicado: (2025)

Projection-free Online Learning over Strongly Convex Sets
por: Wan, Yuanyu, et al.
Publicado: (2020)

Optimistic Policy Optimization is Provably Efficient in Non-stationary MDPs
por: Zhong, Han, et al.
Publicado: (2021)

Variance-Dependent Regret Bounds for Non-stationary Linear Bandits
por: Wang, Zhiyong, et al.
Publicado: (2024)

Optimal and Efficient Algorithms for Decentralized Online Convex Optimization
por: Wan, Yuanyu, et al.
Publicado: (2024)

Sample Efficient Experience Replay in Non-stationary Environments
por: Duan, Tianyang, et al.
Publicado: (2025)

PVBF: A Framework for Mitigating Parameter Variation Imbalance in Online Continual Learning
por: Tao, Zelin, et al.
Publicado: (2025)

Distributed Online Convex Optimization with Efficient Communication: Improved Algorithm and Lower bounds
por: Yang, Sifan, et al.
Publicado: (2026)

Non-stationary Domain Generalization: Theory and Algorithm
por: Pham, Thai-Hoang, et al.
Publicado: (2024)

Dual Adaptivity: Universal Algorithms for Minimizing the Adaptive Regret of Convex Functions
por: Zhang, Lijun, et al.
Publicado: (2025)

Exploratory Machine Learning with Unknown Unknowns
por: Zhao, Peng, et al.
Publicado: (2020)

Safe Continual Reinforcement Learning in Non-stationary Environments
por: Coursey, Austin, et al.
Publicado: (2026)

IN-Flow: Instance Normalization Flow for Non-stationary Time Series Forecasting
por: Fan, Wei, et al.
Publicado: (2024)

Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs
por: Li, Long-Fei, et al.
Publicado: (2024)

Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition
por: Li, Long-Fei, et al.
Publicado: (2024)

Active Learning for Multiple Change Point Detection in Non-stationary Time Series with Deep Gaussian Processes
por: Zhao, Hao, et al.
Publicado: (2025)

Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update
por: Wang, Jing, et al.
Publicado: (2025)

IRCNN$^{+}$: An Enhanced Iterative Residual Convolutional Neural Network for Non-stationary Signal Decomposition
por: Zhou, Feng, et al.
Publicado: (2023)

Wavelet-based Disentangled Adaptive Normalization for Non-stationary Times Series Forecasting
por: Lin, Junpeng, et al.
Publicado: (2025)