research
∙
08/05/2023
Adversarial Erasing with Pruned Elements: Towards Better Graph Lottery Ticket
Graph Lottery Ticket (GLT), a combination of core subgraph and sparse su...
share
research
∙
05/20/2023
Non-stationary Online Convex Optimization with Arbitrary Delays
Online convex optimization (OCO) with arbitrary delays, in which gradien...
research
∙
05/19/2023
Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret Guarantees
Projection-free online learning has drawn increasing interest due to its...
research
∙
02/11/2023
Improved Dynamic Regret for Online Frank-Wolfe
To deal with non-stationary online problems with complex constraints, we...
research
∙
04/11/2022
Online Frank-Wolfe with Unknown Delays
The online Frank-Wolfe (OFW) method has gained much popularity for onlin...
research
∙
02/12/2022
Coupling Online-Offline Learning for Multi-distributional Data Streams
The distributions of real-life data streams are usually nonstationary, w...
research
∙
03/21/2021
Online Convex Optimization with Continuous Switching Constraint
In many sequential decision making applications, the change of decision ...
research
∙
03/21/2021
Online Strongly Convex Optimization with Unknown Delays
We investigate the problem of online convex optimization with unknown de...
research
∙
03/20/2021
Projection-free Distributed Online Learning with Strongly Convex Losses
To efficiently solve distributed online learning problems with complicat...
research
∙
10/16/2020
Projection-free Online Learning over Strongly Convex Sets
To efficiently solve online problems with complicated constraints, proje...
research
∙
09/08/2020
Approximate Multiplication of Sparse Matrices with Limited Space
Approximate matrix multiplication with limited space has received ever-i...
research
∙
06/27/2018