Yuanyu Wan

Orcid: 0000-0002-3577-5186

According to our database1, Yuanyu Wan authored at least 28 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Nearly Optimal Regret for Decentralized Online Convex Optimization.
CoRR, 2024

Improved Regret for Bandit Convex Optimization with Delayed Feedback.
CoRR, 2024

Projection-Free Bandit Convex Optimization over Strongly Convex Sets.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2024

Non-stationary Projection-Free Online Learning with Dynamic and Adaptive Regret Guarantees.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

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

Improved Projection-free Online Continuous Submodular Maximization.
CoRR, 2023

Non-stationary Online Convex Optimization with Arbitrary Delays.
CoRR, 2023

Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret Guarantees.
CoRR, 2023

Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards.
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.
Proceedings of the Neural Information Processing - 30th International Conference, 2023

Adversarial Erasing with Pruned Elements: Towards Better Graph Lottery Tickets.
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.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Distributed Projection-Free Online Learning for Smooth and Convex Losses.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Efficient Adaptive Online Learning via Frequent Directions.
IEEE Trans. Pattern Anal. Mach. Intell., 2022

Online strongly convex optimization with unknown delays.
Mach. Learn., 2022

Projection-free Distributed Online Learning with Sublinear Communication Complexity.
J. Mach. Learn. Res., 2022

Online Frank-Wolfe with Unknown Delays.
CoRR, 2022

Strongly adaptive online learning over partial intervals.
Sci. China Inf. Sci., 2022

Online Frank-Wolfe with Arbitrary Delays.
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.
CoRR, 2021

Online Convex Optimization with Continuous Switching Constraint.
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.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Approximate Multiplication of Sparse Matrices with Limited Space.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Projection-free Online Learning in Dynamic Environments.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Accelerating adaptive online learning by matrix approximation.
Int. J. Data Sci. Anal., 2020

Projection-free Distributed Online Convex Optimization with $O(\sqrt{T})$ Communication Complexity.
Proceedings of the 37th International Conference on Machine Learning, 2020

2018
Matrix Completion from Non-Uniformly Sampled Entries.
CoRR, 2018

Efficient Adaptive Online Learning via Frequent Directions.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018


  Loading...