English

Convergence Rate of a Functional Learning Method for Contextual Stochastic Optimization

Optimization and Control 2026-03-16 v1 Machine Learning

Abstract

We consider a stochastic optimization problem involving two random variables: a context variable XX and a dependent variable YY. The objective is to minimize the expected value of a nonlinear loss functional applied to the conditional expectation E[f(X,Y,β)X]\mathbb{E}[f(X, Y,\beta) \mid X], where ff is a nonlinear function and β\beta represents the decision variables. We focus on the practically important setting in which direct sampling from the conditional distribution of YXY \mid X is infeasible, and only a stream of i.i.d.\ observation pairs {(Xk,Yk)}k=0,1,2,\{(X^k, Y^k)\}_{k=0,1,2,\ldots} is available. In our approach, the conditional expectation is approximated within a prespecified parametric function class. We analyze a simultaneous learning-and-optimization algorithm that jointly estimates the conditional expectation and optimizes the outer objective, and establish that the method achieves a convergence rate of order O(1/N)\mathcal{O}\big(1/\sqrt{N}\big), where NN denotes the number of observed pairs.

Keywords

Cite

@article{arxiv.2603.13048,
  title  = {Convergence Rate of a Functional Learning Method for Contextual Stochastic Optimization},
  author = {Noel Smith and Andrzej Ruszczynski},
  journal= {arXiv preprint arXiv:2603.13048},
  year   = {2026}
}
R2 v1 2026-07-01T11:18:32.127Z