Convergence Rate of a Functional Learning Method for Contextual Stochastic Optimization

Abstract

We consider a stochastic optimization problem involving two random variables: a context variable X and a dependent variable Y. The objective is to minimize the expected value of a nonlinear loss functional applied to the conditional expectation E[f(X, Y,β) X], where f is a nonlinear function and β represents the decision variables. We focus on the practically important setting in which direct sampling from the conditional distribution of Y X is infeasible, and only a stream of i.i.d. observation pairs \(Xk, Yk)\k=0,1,2,… 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. Using a specially designed measure of non-optimality, combining the squared norm of the objective function's gradient and the mean square error of the auxiliary parametric model, we establish that the method achieves a convergence rate of order O(1/N), where N denotes the number of observed pairs.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…