Online hyperparameter optimization for class-incremental learning

Y Liu, Y Li, B Schiele, Q Sun - Proceedings of the AAAI Conference on …, 2023 - ojs.aaai.org
Class-incremental learning (CIL) aims to train a classification model while the number of
classes increases phase-by-phase. An inherent challenge of CIL is the stability-plasticity …

Introduction to online nonstochastic control

E Hazan, K Singh - arxiv preprint arxiv:2211.09619, 2022 - arxiv.org
This text presents an introduction to an emerging paradigm in control of dynamical systems
and differentiable reinforcement learning called online nonstochastic control. The new …

Safe control with minimal regret

A Martin, L Furieri, F Dörfler, J Lygeros… - … for Dynamics and …, 2022 - proceedings.mlr.press
As we move towards safety-critical cyber-physical systems that operate in non-stationary
and uncertain environments, it becomes crucial to close the gap between classical optimal …

Wakening Past Concepts without Past Data: Class-Incremental Learning from Online Placebos

Y Liu, Y Li, B Schiele, Q Sun - Proceedings of the IEEE/CVF …, 2024 - openaccess.thecvf.com
Not forgetting old class knowledge is a key challenge for class-incremental learning (CIL)
when the model continuously adapts to new classes. A common technique to address this is …

Online switching control with stability and regret guarantees

Y Li, JA Preiss, N Li, Y Lin… - … for Dynamics and …, 2023 - proceedings.mlr.press
This paper considers online switching control with a finite candidate controller pool, an
unknown dynamical system, and unknown cost functions. The candidate controllers can be …

Safe adaptive learning-based control for constrained linear quadratic regulators with regret guarantees

Y Li, S Das, J Shamma, N Li - arxiv preprint arxiv:2111.00411, 2021 - arxiv.org
We study the adaptive control of an unknown linear system with a quadratic cost function
subject to safety constraints on both the states and actions. The challenges of this problem …

Online adaptive policy selection in time-varying systems: No-regret via contractive perturbations

Y Lin, JA Preiss, E Anand, Y Li… - Advances in Neural …, 2024 - proceedings.neurips.cc
We study online adaptive policy selection in systems with time-varying costs and dynamics.
We develop the Gradient-based Adaptive Policy Selection (GAPS) algorithm together with a …

Online convex optimization for data-driven control of dynamical systems

M Nonhoff, MA Müller - IEEE Open Journal of Control Systems, 2022 - ieeexplore.ieee.org
We propose an algorithm based on online convex optimization for controlling discrete-time
linear dynamical systems. The algorithm is data-driven, ie, does not require a model of the …

Efficient online learning with memory via frank-wolfe optimization: Algorithms with bounded dynamic regret and applications to control

H Zhou, Z Xu, V Tzoumas - 2023 62nd IEEE Conference on …, 2023 - ieeexplore.ieee.org
Projection operations are a typical computation bottleneck in online learning. In this paper,
we enable projection-free online learning within the framework of Online Convex …

Leveraging predictions in smoothed online convex optimization via gradient-based algorithms

Y Li, N Li - Advances in Neural Information Processing …, 2020 - proceedings.neurips.cc
We consider online convex optimization with time-varying stage costs and additional
switching costs. Since the switching costs introduce coupling across all stages, multi-step …