Lijun Zhang

9 catalog papers. Identity-linked publications and additional name matches are distinguished below.

ORCID: 0000-0002-9222-3433

Publications

• Optimal and Efficient Algorithms for Decentralized Online Convex Optimization — Journal of Machine Learning Research 2025 (name-matched, not ORCID-linked)
• Universal Online Convex Optimization Meets Second-order Bounds — Journal of Machine Learning Research 2025 (name-matched, not ORCID-linked)
• Efficient Methods for Non-stationary Online Learning — Journal of Machine Learning Research 2025 (name-matched, not ORCID-linked)
• Lexicographic Lipschitz Bandits: New Algorithms and a Lower Bound — Journal of Machine Learning Research 2025 (name-matched, not ORCID-linked)
• Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization — Journal of Machine Learning Research 2024 (name-matched, not ORCID-linked)
• Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization — Journal of Machine Learning Research 2024 (name-matched, not ORCID-linked)
• Projection-free Distributed Online Learning with Sublinear Communication Complexity — Journal of Machine Learning Research 2022 (name-matched, not ORCID-linked)
• Bandit Convex Optimization in Non-stationary Environments — Journal of Machine Learning Research 2021 (name-matched, not ORCID-linked)
• Relative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion — Journal of Machine Learning Research 2019 (name-matched, not ORCID-linked)