Haixiang Zhang

Orcid: 0000-0001-5386-1208

Affiliations:
  • University of California Berkeley, CA, USA


According to our database1, Haixiang Zhang authored at least 14 papers between 2020 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
Distributionally Robust Joint Chance-Constrained Optimal Power Flow using Relative Entropy.
CoRR, January, 2025

Exact Recovery Guarantees for Parameterized Nonlinear System Identification Problem under Sparse Disturbances or Semi-Oblivious Attacks.
Trans. Mach. Learn. Res., 2025

Stochastic Localization Methods for Convex Discrete Optimization via Simulation.
Oper. Res., 2025

2024
A new complexity metric for nonconvex rank-one generalized matrix completion.
Math. Program., September, 2024

Exact Recovery Guarantees for Parameterized Non-linear System Identification Problem under Adversarial Attacks.
CoRR, 2024

2023
Gradient-Based Algorithms for Convex Discrete Optimization via Simulation.
Oper. Res., 2023

Geometric Analysis of Matrix Sensing over Graphs.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Distributionally Robust Optimization for Nonconvex QCQPs with Stochastic Constraints.
Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

2022
Uniqueness of Power Flow Solutions Using Graph-Theoretic Notions.
IEEE Trans. Control. Netw. Syst., 2022

Factorization Approach for Low-complexity Matrix Completion Problems: Exponential Number of Spurious Solutions and Failure of Gradient Methods.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Local and Global Linear Convergence of General Low-Rank Matrix Recovery Problems.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Stochastic $L^\natural$-convex Function Minimization.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

General Low-rank Matrix Optimization: Geometric Analysis and Sharper Bounds.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
A Dynamical System Perspective for Escaping Sharp Local Minima in Equality Constrained Optimization Problems.
Proceedings of the 59th IEEE Conference on Decision and Control, 2020


  Loading...