Wei Jiang

Orcid: 0009-0007-4595-1060

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


According to our database1, Wei Jiang authored at least 19 papers between 2015 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Dual Adaptivity: Universal Algorithms for Minimizing the Adaptive Regret of Convex Functions.
CoRR, August, 2025

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

Improved Analysis for Sign-based Methods with Momentum Updates.
CoRR, July, 2025

Mirror Descent Under Generalized Smoothness.
CoRR, February, 2025

2024
Efficient Algorithms for Empirical Group Distributional Robust Optimization and Beyond.
CoRR, 2024

Efficient Sign-Based Optimization: Accelerating Convergence via Variance Reduction.
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

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

Efficient Algorithms for Empirical Group Distributionally Robust Optimization and Beyond.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Small-loss Adaptive Regret for Online Convex Optimization.
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
Learning Unnormalized Statistical Models via Compositional Optimization.
Proceedings of the International Conference on Machine Learning, 2023

2022
Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 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

2021
Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

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

2015
Design and implementation of precise measuring method for the access time of embedded memory.
Proceedings of the 2015 IEEE 11th International Conference on ASIC, 2015


  Loading...