Shangzhi Zeng

Orcid: 0000-0002-6950-7825

According to our database1, Shangzhi Zeng authored at least 21 papers between 2017 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
Moreau Envelope for Nonconvex Bi-Level Optimization: A Single-Loop and Hessian-Free Solution Strategy.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Constrained Bi-Level Optimization: Proximal Lagrangian Value Function Approach and Hessian-free Algorithm.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
Value-Function-Based Sequential Minimization for Bi-Level Optimization.
IEEE Trans. Pattern Anal. Mach. Intell., December, 2023

Hierarchical Optimization-Derived Learning.
IEEE Trans. Pattern Anal. Mach. Intell., December, 2023

Difference of convex algorithms for bilevel programs with applications in hyperparameter selection.
Math. Program., April, 2023

A globally convergent proximal Newton-type method in nonsmooth convex optimization.
Math. Program., March, 2023

A General Descent Aggregation Framework for Gradient-Based Bi-Level Optimization.
IEEE Trans. Pattern Anal. Mach. Intell., 2023

Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs.
CoRR, 2023

Averaged Method of Multipliers for Bi-Level Optimization without Lower-Level Strong Convexity.
Proceedings of the International Conference on Machine Learning, 2023

2022
Task-Oriented Convex Bilevel Optimization With Latent Feasibility.
IEEE Trans. Image Process., 2022

Towards Extremely Fast Bilevel Optimization with Self-governed Convergence Guarantees.
CoRR, 2022

Optimization-Derived Learning with Essential Convergence Analysis of Training and Hyper-training.
Proceedings of the International Conference on Machine Learning, 2022

Value Function based Difference-of-Convex Algorithm for Bilevel Hyperparameter Selection Problems.
Proceedings of the International Conference on Machine Learning, 2022

2021
A Generic Descent Aggregation Framework for Gradient-based Bi-level Optimization.
CoRR, 2021

Towards Gradient-based Bilevel Optimization with Non-convex Followers and Beyond.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

A Value-Function-based Interior-point Method for Non-convex Bi-level Optimization.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Discerning the Linear Convergence of ADMM for Structured Convex Optimization through the Lens of Variational Analysis.
J. Mach. Learn. Res., 2020

A Generic First-Order Algorithmic Framework for Bi-Level Programming Beyond Lower-Level Singleton.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Bilevel Integrative Optimization for Ill-posed Inverse Problems.
CoRR, 2019

2018
Partial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of Multipliers.
SIAM J. Numer. Anal., 2018

2017
Primal-dual hybrid gradient method for distributionally robust optimization problems.
Oper. Res. Lett., 2017


  Loading...