Huan Xu

Huan Xu

Auto-generated profile, based on publicly available information

Huan Xu

School of Industrial and Systems Engineering Georgia Institute of Technology 30332 Atlanta GA

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
1 September 2019 in Operations Research
Verified
Journal Article
Closed access
ZCZhi Chen
Zhi Chen
MSMelvyn Sim
Melvyn Sim
HXHuan Xu
Huan Xu
Distributionally robust optimization has grown into one of the most popular approaches in addressing optimization under uncertainty. As its key ingredient, the ambiguity set specifies several types of distributional information about the ambiguous true distribution. In “Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets,” Z. Chen, M. Sim, and H. Xu contribute to the existing ambiguity sets in the literature, by proposing a new class of ambiguity sets that encompasses a potentially infinite number of expectation constraints. This class has the benefits of, among other things, a tighter approximation of stochastic independence that is ubiquitous in characterizing uncertainty. The authors propose an algorithm involving a greedy improvement procedure to solve the corresponding distributionally robust optimization problem. In their computational study, the authors are able to obtain significantly improved solutions using this algorithm.

7 February 2018 in Entropy
Verified
Journal Article
Open access
PDF file
YCYang Cao
Yang Cao
LXLiyan Xie
Liyan Xie
YXYao Xie
Yao Xie
HXHuan Xu
Huan Xu
Sequential change-point detection when the distribution parameters are unknown is a fundamental problem in statistics and machine learning. When the post-change parameters are unknown, we consider a set of detection procedures based on sequential likelihood ratios with non-anticipating estimators constructed using online convex optimization algorithms such as online mirror descent, which provides a more versatile approach to tackling complex situations where recursive maximum likelihood estimators cannot be found. When the underlying distributions belong to a exponential family and the estimators satisfy the logarithm regret property, we show that this approach is nearly second-order asymptotically optimal. This means that the upper bound for the false alarm rate of the algorithm (measured by the average-run-length) meets the lower bound asymptotically up to a log-log factor when the threshold tends to infinity. Our proof is achieved by making a connection between sequential change-point and online convex optimization and leveraging the logarithmic regret bound property of online mirror descent algorithm. Numerical and real data examples validate our theory.

5 January 2018 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
PYPengqian Yu
Pengqian Yu
WHWilliam B. Haskell
William B. Haskell
HXHuan Xu
Huan Xu
We consider large-scale Markov decision processes (MDPs) with a time-consistent risk measure of variability in cost under the risk-aware MDP paradigm. Previous studies showed that risk-aware MDPs, based on a minimax approach to handling risk, can be solved using dynamic programming for small- to medium-sized problems. However, due to the “curse of dimensionality,” MDPs that model real-life problems are typically prohibitively large for such approaches. In this technical note, we employ an approximate dynamic programming approach and develop a family of simulation-based algorithms to approximately solve large-scale risk-aware MDPs with time-consistent risk measures. In parallel, we develop a unified convergence analysis technique to derive sample complexity bounds for this new family of algorithms.

1 February 2025 in Mathematics of Operations Research
Verified
Journal Article
Closed access
ACAdrian Rivera Cardoso
Adrian Rivera Cardoso
HWHe Wang
He Wang
HXHuan Xu
Huan Xu
We study the online saddle point problem, an online learning problem where at each iteration, a pair of actions needs to be chosen without knowledge of the current and future (convex-concave) payoff functions. The objective is to minimize the gap between the cumulative payoffs and the saddle point value of the aggregate payoff function, which we measure using a metric called saddle point regret (SP-Regret). The problem generalizes the online convex optimization framework, but here, we must ensure that both players incur cumulative payoffs close to that of the Nash equilibrium of the sum of the games. We propose an algorithm that achieves SP-Regret proportional to [ ] in the general case, and [ ] SP-Regret for the strongly convex-concave case. We also consider the special case where the payoff functions are bilinear and the decision sets are the probability simplex. In this setting, we are able to design algorithms that reduce the bounds on SP-Regret from a linear dependence in the dimension of the problem to a logarithmic one. We also study the problem under bandit feedback and provide an algorithm that achieves sublinear SP-Regret. We then consider an online convex optimization with knapsacks problem motivated by a wide variety of applications, such as dynamic pricing, auctions, and crowdsourcing. We relate this problem to the online saddle point problem and establish [ ] regret using a primal-dual algorithm.

7 February 2017 in Machine Learning
Verified
Journal Article
Closed access
PDF file
JSJie Shen
Jie Shen
HXHuan Xu
Huan Xu
PLPing Li
Ping Li

16 January 2019 in Journal of Optimization Theory and Applications
Verified
Journal Article
Closed access
PDF file
LHLe Thi Khanh Hien
Le Thi Khanh Hien
CNCuong V. Nguyen
Cuong V. Nguyen
HXHuan Xu
Huan Xu
CLCanyi Lu
Canyi Lu
JFJiashi Feng
Jiashi Feng