Shiyin Lu

According to our database1, Shiyin Lu authored at least 17 papers between 2018 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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
Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret Guarantees.
CoRR, 2023

2022
Non-stationary Continuum-armed Bandits for Online Hyperparameter Optimization.
Proceedings of the WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining, Virtual Event / Tempe, AZ, USA, February 21, 2022

Non-stationary Dueling Bandits for Online Learning to Rank.
Proceedings of the Web and Big Data - 6th International Joint Conference, 2022

2021
Revisiting Smoothed Online Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Stochastic Graphical Bandits with Adversarial Corruptions.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Stochastic Bandits with Graph Feedback in Non-Stationary Environments.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Searching Privately by Imperceptible Lying: A Novel Private Hashing Method with Differential Privacy.
Proceedings of the MM '20: The 28th ACM International Conference on Multimedia, 2020

SAdam: A Variant of Adam for Strongly Convex Functions.
Proceedings of the 8th International Conference on Learning Representations, 2020

Minimizing Dynamic Regret and Adaptive Regret Simultaneously.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Adapting to Smoothness: A More Universal Algorithm for Online Convex Optimization.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
More Adaptive Algorithms for Tracking the Best Expert.
CoRR, 2019

SAdam: A Variant of Adam for Strongly Convex Functions.
CoRR, 2019

Adaptivity and Optimality: A Universal Algorithm for Online Convex Optimization.
Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019

Multi-Objective Generalized Linear Bandits.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Optimal Algorithms for Lipschitz Bandits with Heavy-tailed Rewards.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Adaptive Online Learning in Dynamic Environments.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018


  Loading...