Online Inference of Constrained Optimization: Primal-Dual Optimality and Sequential Quadratic Programming

TL;DR

This paper introduces an online stochastic optimization method, SSQP, that efficiently solves constrained problems and provides valid statistical inference without intractable projections, demonstrating superior performance in various applications.

Contribution

The paper develops the first fully online primal-dual method with asymptotic minimax optimality for constrained stochastic optimization, avoiding intractable projections.

Findings

Achieves global almost-sure convergence.

Exhibits local asymptotic normality with optimal covariance.

Demonstrates superior empirical performance on benchmark and real data.

Abstract

We study online statistical inference for the solutions of stochastic optimization problems with equality and inequality constraints. Such problems are prevalent in statistics and machine learning, encompassing constrained $M$-estimation, physics-informed models, safe reinforcement learning, and algorithmic fairness. We develop a stochastic sequential quadratic programming (SSQP) method to solve these problems, where the step direction is computed by sequentially performing a quadratic approximation of the objective and a linear approximation of the constraints. Despite having access to unbiased estimates of population gradients, a key challenge in constrained stochastic problems lies in dealing with the bias in the step direction. As such, we apply a momentum-style gradient moving-average technique within SSQP to debias the step. We show that our method achieves global almost-sure convergence and exhibits local asymptotic normality with an optimal primal-dual limiting covariance matrix in the sense of H\'ajek and Le Cam. In addition, we provide a plug-in covariance matrix estimator for practical inference. To our knowledge, the proposed SSQP method is the first fully online method that attains primal-dual asymptotic minimax optimality without relying on projection operators onto the constraint set, which are generally intractable for nonlinear problems. Through extensive experiments on benchmark nonlinear problems, as well as on constrained generalized linear models and portfolio allocation problems using both synthetic and real data, we demonstrate superior performance of our method, showing that the method and its asymptotic behavior not only solve constrained stochastic problems efficiently but also provide valid and practical online inference in real-world applications.