Yuanyu Wan

CoRR, August, 2025

Dataset Ownership Verification for Pre-trained Masked Models.

[BibT_eX]

[DOI]

CoRR, July, 2025

Continuous Subspace Optimization for Continual Learning.

[BibT_eX]

[DOI]

CoRR, May, 2025

Quantizing Diffusion Models from a Sampling-Aware Perspective.

[BibT_eX]

[DOI]

CoRR, May, 2025

Revisiting Multi-Agent Asynchronous Online Optimization with Delays: the Strongly Convex Case.

[BibT_eX]

[DOI]

Lingchan Bao

Tong Wei

CoRR, March, 2025

Mirror Descent Under Generalized Smoothness.

[BibT_eX]

[DOI]

CoRR, February, 2025

Black-Box Reductions for Decentralized Online Convex Optimization in Changing Environments.

[BibT_eX]

[DOI]

Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

Safe Online Convex Optimization with Heavy-Tailed Observation Noises.

[BibT_eX]

[DOI]

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting.

[BibT_eX]

[DOI]

Sifan Yang

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

Revisiting Projection-Free Online Learning with Time-Varying Constraints.

[BibT_eX]

[DOI]

Yibo Wang

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024

Regularized online exponentially concave optimization.

[BibT_eX]

[DOI]

Neurocomputing, 2024

Projection-Free Bandit Convex Optimization over Strongly Convex Sets.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2024

Continuous Contrastive Learning for Long-Tailed Semi-Supervised Recognition.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Improved Regret for Bandit Convex Optimization with Delayed Feedback.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Online Composite Optimization Between Stochastic and Adversarial Environments.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Non-stationary Online Convex Optimization with Arbitrary Delays.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimization.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Learning Label Shift Correction for Test-Agnostic Long-Tailed Recognition.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Nearly Optimal Regret for Decentralized Online Convex Optimization.

[BibT_eX]

[DOI]

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

Non-stationary Projection-Free Online Learning with Dynamic and Adaptive Regret Guarantees.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Adversarial Erasing with Pruned Elements: Towards Better Graph Lottery Ticket.

[BibT_eX]

[DOI]

CoRR, 2023

Improved Projection-free Online Continuous Submodular Maximization.

[BibT_eX]

[DOI]

CoRR, 2023

Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Disentangling Node Metric Factors for Temporal Link Prediction.

[BibT_eX]

[DOI]

Proceedings of the Neural Information Processing - 30th International Conference, 2023

Adversarial Erasing with Pruned Elements: Towards Better Graph Lottery Tickets.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Improved Dynamic Regret for Online Frank-Wolfe.

[BibT_eX]

[DOI]

Mingli Song

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Distributed Projection-Free Online Learning for Smooth and Convex Losses.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Efficient Adaptive Online Learning via Frequent Directions.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 2022

Online strongly convex optimization with unknown delays.

[BibT_eX]

[DOI]

Mach. Learn., 2022

Projection-free Distributed Online Learning with Sublinear Communication Complexity.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2022

Online Frank-Wolfe with Unknown Delays.

[BibT_eX]

[DOI]

CoRR, 2022

Strongly adaptive online learning over partial intervals.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2022

Online Frank-Wolfe with Arbitrary Delays.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Projection-free Distributed Online Learning with Strongly Convex Losses.

[BibT_eX]

[DOI]

Guanghui Wang

CoRR, 2021

Online Convex Optimization with Continuous Switching Constraint.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Projection-free Online Learning over Strongly Convex Sets.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Approximate Multiplication of Sparse Matrices with Limited Space.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Projection-free Online Learning in Dynamic Environments.

[BibT_eX]

[DOI]

Bo Xue

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Accelerating adaptive online learning by matrix approximation.

[BibT_eX]

[DOI]

Int. J. Data Sci. Anal., 2020

Projection-free Distributed Online Convex Optimization with $O(\sqrt{T})$ Communication Complexity.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

2018

Matrix Completion from Non-Uniformly Sampled Entries.

[BibT_eX]

[DOI]

Jinfeng Yi

CoRR, 2018

Efficient Adaptive Online Learning via Frequent Directions.

[BibT_eX]

[DOI]

Nan Wei