Haixiang Zhang

Haixiang Zhang

Auto-generated profile, based on publicly available information

Haixiang Zhang

Department of Mathematics, University of California, Berkeley, CA, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2023 in Operations Research
Verified
Journal Article
Closed access
HZHaixiang Zhang
Haixiang Zhang
ZZZeyu Zheng
Zeyu Zheng
JLJavad Lavaei
Javad Lavaei
Solving Convex Discrete Optimization via Simulation via Stochastic Search Algorithms Many decision-making problems in operations research and management science require the optimization of large-scale complex stochastic systems with high-dimensional discrete decision variables. For a number of applications, the objective function exhibits convexity in the discrete decision variables, or the problem can be transformed into a convex one. In “Gradient-Based Algorithms for Convex Discrete Optimization via Simulation,” Zhang, Zheng, and Lavaei propose provably efficient simulation–optimization algorithms for general convex optimization via simulation problems with high-dimensional discrete decision space. By utilizing the convex structure, the developed algorithms demonstrate a polynomial dependence on the dimension and scale of the decision space. In addition, information-theoretic lower bounds are derived to show the limit of algorithm design. In the case when possibly biased gradient estimators are available, they propose simulation–optimization algorithms to achieve optimality guarantees with a reduced dependence on the dimension.

8 January 2025 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
EBEli Brock
Eli Brock
HZHaixiang Zhang
Haixiang Zhang
JLJavad Lavaei
Javad Lavaei
SSSomayeh Sojoudi
Somayeh Sojoudi
Designing robust algorithms for the optimal power flow (OPF) problem is critical for the control of large-scale power systems under uncertainty. The chance-constrained OPF (CCOPF) problem provides a natural formulation of the trade-off between the operating cost and the constraint satisfaction rate. In this work, we propose a new data-driven algorithm for the CCOPF problem, based on distributionally robust optimization (DRO). We show that the proposed reformulation of the distributionally robust chance constraints is exact, whereas other approaches in the CCOPF literature rely on conservative approximations. We establish out-of-sample robustness guarantees for the distributionally robust solution and prove that the solution is the most efficient among all approaches enjoying the same guarantees. We apply the proposed algorithm to the CCOPF problem and compare the performance of our approach with existing methods using simulations on IEEE benchmark power systems.

16 August 2023 in Mathematical Programming
Verified
Journal Article
Closed access
PDF file
HZHaixiang Zhang
Haixiang Zhang
BYBaturalp Yalcin
Baturalp Yalcin
JLJavad Lavaei
Javad Lavaei
SSSomayeh Sojoudi
Somayeh Sojoudi

27 November 2024 in IEEE Open Journal of Control Systems
Verified
Journal Article
Open access
BYBaturalp Yalcin
Baturalp Yalcin
HZHaixiang Zhang
Haixiang Zhang
JLJavad Lavaei
Javad Lavaei
MAMurat Arcak
Murat Arcak
This paper investigates the system identification problem for linear discrete-time systems under adversaries and analyzes two lasso-type estimators. We examine non-asymptotic properties of these estimators in two separate scenarios, corresponding to deterministic and stochastic models for the attack times. We prove that when the system is stable and attacks are injected periodically, the sample complexity for exact recovery of the system dynamics is linear in terms of the dimension of the states. When adversarial attacks occur at each time instance with probability $p$ , the required sample complexity for exact recovery scales polynomially in the dimension of the states and the probability $p$ . This result implies almost sure convergence to the true system dynamics under the asymptotic regime. As a by-product, our estimators still learn the system correctly even when more than half of the data is compromised. We emphasize that the attack vectors are allowed to be correlated with each other in this work. This paper provides the first mathematical guarantee in the literature on learning from correlated data for dynamical systems in the case when there is less clean data than corrupt data.

1 March 2025 in Operations Research
Verified
Journal Article
Closed access
HZHaixiang Zhang
Haixiang Zhang
ZZZeyu Zheng
Zeyu Zheng
JLJavad Lavaei
Javad Lavaei
Solving Convex Discrete Optimization via Simulation via Stochastic Localization Algorithms Many decision-making problems in operations research and management science require the optimization of large-scale complex stochastic systems. For a number of applications, the objective function exhibits convexity in the discrete decision variables or the problem can be transformed into a convex one. In “Stochastic Localization Methods for Convex Discrete Optimization via Simulation,” Zhang, Zheng, and Lavaei propose provably efficient simulation-optimization algorithms for general large-scale convex discrete optimization via simulation problems. By utilizing the convex structure and the idea of localization and cutting-plane methods, the developed stochastic localization algorithms demonstrate a polynomial dependence on the dimension and scale of the decision space. In addition, the simulation cost is upper bounded by a value that is independent of the objective function. The stochastic localization methods also exhibit a superior numerical performance compared with existing algorithms.