Yibo Wang

Orcid: 0009-0006-7410-6854

Affiliations:
  • Nanjing University, National Key Laboratory for Novel Software Technology, Nanjing, China
  • Alibaba Group, Hangzhou, China


According to our database1, Yibo Wang authored at least 16 papers between 2022 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Revisiting Stochastic Multi-Level Compositional Optimization.
IEEE Trans. Pattern Anal. Mach. Intell., July, 2025

Revisiting Projection-Free Online Learning with Time-Varying Constraints.
Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

Towards Unbiased Information Extraction and Adaptation in Cross-Domain Recommendation.
Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024
Not All Embeddings are Created Equal: Towards Robust Cross-domain Recommendation via Contrastive Learning.
Proceedings of the ACM on Web Conference 2024, 2024

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

Universal Online Convex Optimization with 1 Projection per Round.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Adaptive Variance Reduction for Stochastic Optimization under Weaker Assumptions.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Advancing Tool-Augmented Large Language Models: Integrating Insights from Errors in Inference Trees.
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.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Small-loss Adaptive Regret for Online Convex Optimization.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

High-Probability Bound for Non-Smooth Non-Convex Stochastic Optimization with Heavy Tails.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimization.
Proceedings of the Forty-first International Conference on Machine Learning, 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
Distributed Projection-Free Online Learning for Smooth and Convex Losses.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Multi-block-Single-probe Variance Reduced Estimator for Coupled Compositional Optimization.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Optimal Algorithms for Stochastic Multi-Level Compositional Optimization.
Proceedings of the International Conference on Machine Learning, 2022


  Loading...