Searcharxiv⌕ Search

arXiv subjects

Zhiyun Guo

Publications and source records attributed to Zhiyun Guo.

2 recordsLinked to original sources

An Accelerated Dynamic Stochastic Primal-Dual Method for Multi-stage Stochastic Optimization

We consider multi-stage stochastic optimization problems with smooth convex stage costs and linear linking constraints. Dynamic stochastic approximation (DSA), a stochastic first-order method, uses a recursive structure whose memory requirement grows only linearly with the number of stages. Its implementation, however, requires an exact solution of the proximal subproblem associated with the stage cost, and this subproblem often admits no closed-form solution. To resolve this issue, we develop an accelerated dynamic stochastic primal-dual (A-DSPD) framework that retains the recursive value-function structure and only requires the gradient of the stage cost. Within this framework, each stagewise saddle-point subproblem is solved by an inexact accelerated stochastic primal-dual method (iASPD), which applies Nesterov acceleration to the smooth stage cost and uses recursively generated stochastic $ε$-subgradients for the nonsmooth downstream value function. For the stochastic composite saddle-point problem, after $N$ primal-dual updates, iASPD yields optimality and feasibility bounds in which the contribution of the smooth stage cost decays at a faster rate $O(1/N^2)$, while the terms associated with stochastic $ε$-subgradients of the nonsmooth value function decay as $O(1/\sqrt{N})$, up to the prescribed oracle inexactness. We also develop bounds for the stochastic $ε$-subgradient estimators and the dual iterates, which yield complexity guarantees for A-DSPD. Specifically, A-DSPD computes an $ε$-solution using $O(1/ε^4)$ sampled scenarios and $O(1/ε^5)$ primal-dual updates for three-stage problems. We further extend the method and its convergence analysis to problems with an arbitrary finite number of stages. Numerical experiments on three-stage stochastic portfolio models illustrate the empirical advantage of the proposed method.

math.OC↗

Rationalizing collective revealed preferences with an application in fair resource allocation

This paper presents a revealed preference approach for rationalizing collective consumption behavior. We introduce the Constructive Rationalization Method (CRM), which approximates the real market via a surrogate market of artificial consumers, called androids, with easy-to-compute demand functions. CRM uses observed aggregate demand and adds artificial consumers on the fly, while redistributing wealth under an empirical risk minimization principle. Unlike classical revealed preference approaches, CRM provides guarantees on the generalization risk for learning the aggregate demand function, while respecting the privacy of the underlying consumers in the real market. As an application, CRM can be used to provide reliable predictions for collective consumption behavior. Specifically, we show how to apply CRM to approximate allocations that are proportionally fair without requiring the knowledge of individual utilities.

cs.GT↗