constrained estimation problems are prevalent in statistics, machine learning, and engineering. these problems encompass constrained generalized linear models, constrained deep neural networks, physics-inspired machine learning, algorithmic fairness, and optimal control. however, existing estimation methods under hard constraints rely on either projection or regularization, which may theoretically exhibit optimal efficiency but are impractical or unreasonably fail in reality. this talk aims to bridge the significant gap between practice and theory for constrained estimation problems.

i will begin by introducing the critical methodology used to bridge the gap, called stochastic sequential quadratic programming. we will see that sqp methods serve as the workhorse for modern scientific machine learning problems and can resolve the failure modes of prevalent regularization-based methods. i will demonstrate how to make sqp adaptive and scalable using various modern techniques, such as stochastic line search, trust region, and dimensionality reduction. additionally, i will show how to further enhance sqp to handle inequality constraints online.

following the methodology, i will present some selective theories, emphasizing the consistency and efficiency of the sqp methods. specifically, i will show that online sqp iterates asymptotically exhibit normal behavior with a mean of zero and optimal covariance in the hajek and le cam sense. significantly, the covariance does not deteriorate even when we apply modern techniques driven by practical concerns. the talk concludes with experiments on both synthetic and real datasets.