5 papers
Solving Convex-Concave Problems with th-Order Oracle Complexity
Lesi Chen, Xinliang Zhang, Chengchang Liu +3
When the objective has Lipschitz continuous th-order derivatives, it is known that convex-concave minimax problems can be solved with th-order ora…
Solving Convex-Concave Problems with Second-Order Oracle Complexity
Lesi Chen, Chengchang Liu, Luo Luo +1
Previous algorithms can solve convex-concave minimax problems with second-order oracle calls usin…
Quantum Algorithm for Online Exp-concave Optimization
Jianhao He, Chengchang Liu, Xutong Liu +2
We explore whether quantum advantages can be found for the zeroth-order feedback online exp-concave optimization problem, which is also known as bandit exp-concave optimization wit…
Quantum Algorithms for Non-smooth Non-convex Optimization
Chengchang Liu, Chaowen Guan, Jianhao He +1
This paper considers the problem for finding the -Goldstein stationary point of Lipschitz continuous objective, which is a rich function class to cover a great number of imp…
Second-Order Min-Max Optimization with Lazy Hessians
Lesi Chen, Chengchang Liu, Jingzhao Zhang
This paper studies second-order methods for convex-concave minimax optimization. Monteiro and Svaiter (2012) proposed a method to solve the problem with an optimal iteration comple…