The objective of this comment is to correct two sets of statements in Litwin et al. (2022,
We study nonlinear optimization problems with a stochastic objective and deterministic equality and inequality constraints, which emerge in numerous applications including finance, manufacturing, power systems and, recently, deep neural networks. We propose an active-set stochastic sequential quadratic programming (StoSQP) algorithm that utilizes a differentiable exact augmented Lagrangian as the merit function. The algorithm adaptively selects the penalty parameters of the augmented Lagrangian, and performs a stochastic line search to decide the stepsize. The global convergence is established: for any initialization, the KKT residuals converge to zero
- PAR ID:
- 10399905
- Publisher / Repository:
- Springer Science + Business Media
- Date Published:
- Journal Name:
- Mathematical Programming
- Volume:
- 202
- Issue:
- 1-2
- ISSN:
- 0025-5610
- Format(s):
- Medium: X Size: p. 279-353
- Size(s):
- p. 279-353
- Sponsoring Org:
- National Science Foundation
More Like this
-
Abstract https://doi.org/10.1029/2021JF006239 ), which consider our research work (Bonetti et al., 2018,https://doi.org/10.1098/rspa.2017.0693 ; Bonetti et al., 2020,https://doi.org/10.1073/pnas.1911817117 ). We clarify here that (a) the specific contributing area is defined in the limit of an infinitesimal contour length instead of the product of a reference contour width (Bonetti et al., 2018,https://doi.org/10.1098/rspa.2017.0693 ), and (b) not all solutions obtained from the minimalist landscape evolution model of Bonetti et al. (2020,https://doi.org/10.1073/pnas.1911817117 ) are rescaled copies of each other. We take this opportunity to demonstrate that the boundary conditions impact the obtained solutions, which has not been considered in the dimensional analysis of Litwin et al. (2022,https://doi.org/10.1029/2021JF006239 ). We clarify this point by using dimensional analysis and numerical simulations for a square domain, where only one horizontal length scale (the side lengthl ) enters the physical law. -
Abstract Bohnenblust–Hille inequalities for Boolean cubes have been proven with dimension-free constants that grow subexponentially in the degree (Defant et al. in Math Ann 374(1):653–680, 2019). Such inequalities have found great applications in learning low-degree Boolean functions (Eskenazis and Ivanisvili in Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, pp 203–207, 2022). Motivated by learning quantum observables, a qubit analogue of Bohnenblust–Hille inequality for Boolean cubes was recently conjectured in Rouzé et al. (Quantum Talagrand, KKL and Friedgut’s theorems and the learnability of quantum Boolean functions, 2022. arXiv preprint
arXiv:2209.07279 ). The conjecture was resolved in Huang et al. (Learning to predict arbitrary quantum processes, 2022. arXiv preprintarXiv:2210.14894 ). In this paper, we give a new proof of these Bohnenblust–Hille inequalities for qubit system with constants that are dimension-free and of exponential growth in the degree. As a consequence, we obtain a junta theorem for low-degree polynomials. Using similar ideas, we also study learning problems of low degree quantum observables and Bohr’s radius phenomenon on quantum Boolean cubes. -
Abstract “Classical shadows” are estimators of an unknown quantum state, constructed from suitably distributed random measurements on copies of that state (Huang et al. in Nat Phys 16:1050, 2020,
https://doi.org/10.1038/s41567-020-0932-7 ). In this paper, we analyze classical shadows obtained using random matchgate circuits, which correspond to fermionic Gaussian unitaries. We prove that the first three moments of the Haar distribution over thecontinuous group of matchgate circuits are equal to those of thediscrete uniform distribution over only the matchgate circuits that are also Clifford unitaries; thus, the latter forms a “matchgate 3-design.” This implies that the classical shadows resulting from the two ensembles are functionally equivalent. We show how one can use these matchgate shadows to efficiently estimate inner products between an arbitrary quantum state and fermionic Gaussian states, as well as the expectation values of local fermionic operators and various other quantities, thus surpassing the capabilities of prior work. As a concrete application, this enables us to apply wavefunction constraints that control the fermion sign problem in the quantum-classical auxiliary-field quantum Monte Carlo algorithm (QC-AFQMC) (Huggins et al. in Nature 603:416, 2022,https://doi.org/10.1038/s41586-021-04351-z ), without the exponential post-processing cost incurred by the original approach. -
We consider a class of nonsmooth convex composite optimization problems, where the objective function is given by the sum of a continuously differentiable convex term and a potentially non-differentiable convex regularizer. In [1], the authors introduced the proximal augmented Lagrangian method and derived the resulting continuous-time primal-dual dynamics that converge to the optimal solution. In this paper, we extend these dynamics from continuous to discrete time via the forward Euler discretization. We prove explicit bounds on the exponential convergence rates of our proposed algorithm with a sufficiently small step size. Since a larger step size can improve the convergence speed, we further develop a linear matrix inequality (LMI) condition which can be numerically solved to provide rate certificates with general step size choices. In addition, we prove that a large range of step size values can guarantee exponential convergence. We close the paper by demonstrating the performance of the proposed algorithm via computational experiments.more » « less