Searcharxiv⌕ Search

arXiv subjects

Andrzej Ruszczynski

Publications and source records attributed to Andrzej Ruszczynski.

At least 19 recordsLinked to original sources

Convergence Rate of a Functional Learning Method for Contextual Stochastic Optimization

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 $\mathbb{E}[f(X, Y,β) \mid 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 \mid X$ is infeasible, and only a stream of i.i.d. observation pairs $\{(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. 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 $\mathcal{O}\big(1/\sqrt{N}\big)$, where $N$ denotes the number of observed pairs.

math.OC↗

Reinforcement Learning with Markov Risk Measures and Multipattern Risk Approximation

For a risk-averse finite-horizon Markov Decision Problem, we introduce a special class of Markov coherent risk measures, called mini-batch measures. We also define the class of multipattern risk-averse problems that generalizes the class of linear systems. We use both concepts in a feature-based $Q$-learning method with multipattern $Q$-factor approximation and we prove a high-probability regret bound of $\mathcal{O}\big(H^2 N^H \sqrt{ K}\big)$, where $H$ is the horizon, $N$ is the mini-batch size, and $K$ is the number of episodes. We also propose an economical version of the $Q$-learning method that streamlines the policy evaluation (backward) step. The theoretical results are illustrated on a stochastic assignment problem and a short-horizon multi-armed bandit problem.

cs.LG↗

Subdifferentials of Convex Operators Valued in the Space of Integrable Functions with Application to Risk-Averse Optimization

We study differentiability properties of convex operators defined on a Banach space with values in an $\Lc_p$ space and of their compositions with monotonic convex functionals on this space. We develop new tools for operators enjoying an additional feature known as the local property. The new approach and results go beyond the classical theory of normal integrands and lattice-valued operators. We further describe the subdifferentials of compositions of such operators with convex monotonic functionals. The new results are applied to obtain novel optimality conditions in the subdifferential form for a broad class of risk-averse stochastic optimization problems with risk functionals as objectives, with partial information, and with stochastic dominance constraints. While our analysis is motivated by the theory and methods of risk-averse optimization, it addresses problems of a more general structure and has potential for further applications.

math.OC↗

Fast Dual Subgradient Optimization of the Integrated Transportation Distance Between Stochastic Kernels

A generalization of the Wasserstein metric, the integrated transportation distance, establishes a novel distance between probability kernels of Markov systems. This metric serves as the foundation for an efficient approximation technique, enabling the replacement of the original system's kernel with a kernel with a discrete support of limited cardinality. To facilitate practical implementation, we present a specialized dual algorithm capable of constructing these approximate kernels quickly and efficiently, without requiring computationally expensive matrix operations. Finally, we demonstrate the efficacy of our method through several illustrative examples, showcasing its utility in practical scenarios. This advancement offers new possibilities for the streamlined analysis and manipulation of stochastic systems represented by kernels.

cs.LG↗

Risk-Averse Control of Markov Systems with Value Function Learning

We consider a control problem for a finite-state Markov system whose performance is evaluated by a coherent Markov risk measure. For each policy, the risk of a state is approximated by a function of its features, thus leading to a lower-dimensional policy evaluation problem, which involves non-differentiable stochastic operators. We introduce mini-batch transition risk mappings, which are particularly suited to our approach, and we use them to derive a robust learning algorithm for Markov policy evaluation. Finally, we discuss structured policy improvement in the feature-based risk-averse setting. The considerations are illustrated with an underwater robot navigation problem in which several waypoints must be visited and the observation results must be reported from selected transmission locations. We identify the relevant features, we test the simulation-based learning method, and we optimize a structured policy in a hyperspace containing all problems with the same number of relevant points.

math.OC↗

An Integrated Transportation Distance Between Kernels and Approximate Dynamic Risk Evaluation in Markov Systems

We introduce a distance between kernels based on the Wasserstein distances between their values, study its properties, and prove that it is a metric on an appropriately defined space of kernels. We also relate it to various modes of convergence in the space of kernels. Then we consider the problem of approximating solutions to forward--backward systems, where the forward part is a Markov system described by a sequence of kernels, and the backward part calculates the values of a risk measure by operators that may be nonlinear with respect to the system's kernels. We propose to recursively approximate the forward system with the use of the integrated transportation distance between kernels and we estimate the error of the risk evaluation by the errors of individual kernel approximations. We illustrate the results on stopping problems and several well-known risk measures. Then we develop a particle-based numerical procedure, in which the approximate kernels have finite support sets. Finally, we illustrate the efficacy of the approach on the financial problem of pricing an American basket option.

math.OC↗

A Stochastic Subgradient Method for Nonsmooth Nonconvex Multi-Level Composition Optimization

We propose a single time-scale stochastic subgradient method for constrained optimization of a composition of several nonsmooth and nonconvex functions. The functions are assumed to be locally Lipschitz and differentiable in a generalized sense. Only stochastic estimates of the values and generalized derivatives of the functions are used. The method is parameter-free. We prove convergence with probability one of the method, by associating with it a system of differential inclusions and devising a nondifferentiable Lyapunov function for this system. For problems with functions having Lipschitz continuous derivatives, the method finds a point satisfying an optimality measure with error of order $1/\sqrt{N}$, after executing $N$ iterations with constant stepsize.

math.OC↗

A Dual Method For Backward Stochastic Differential Equations with Application to Risk Valuation

We propose a numerical recipe for risk evaluation defined by a backward stochastic differential equation. Using dual representation of the risk measure, we convert the risk valuation to a stochastic control problem where the control is a certain Radon-Nikodym derivative process. By exploring the maximum principle, we show that a piecewise-constant dual control provides a good approximation on a short interval. A dynamic programming algorithm extends the approximation to a finite time horizon. Finally, we illustrate the application of the procedure to financial risk management in conjunction with nested simulation and on an multidimensional portfolio valuation problem.

math.OC↗

Risk-Averse Learning by Temporal Difference Methods

We consider reinforcement learning with performance evaluated by a dynamic risk measure. We construct a projected risk-averse dynamic programming equation and study its properties. Then we propose risk-averse counterparts of the methods of temporal differences and we prove their convergence with probability one. We also perform an empirical study on a complex transportation problem.

math.OC↗

Subregular Recourse in Nonlinear Multistage Stochastic Optimization

We consider nonlinear multistage stochastic optimization problems in the spaces of integrable functions. We allow for nonlinear dynamics and general objective functionals, including dynamic risk measures. We study causal operators describing the dynamics of the system and derive the Clarke subdifferential for a penalty function involving such operators. Then we introduce the concept of subregular recourse in nonlinear multistage stochastic optimization and establish subregularity of the resulting systems in two formulations: with built-in nonanticipativity and with explicit nonanticipativity constraints. Finally, we derive optimality conditions for both formulations and study their relations.

math.OC↗

Risk Forms: Representation, Disintegration, and Application to Partially Observable Two-Stage Systems

We introduce the concept of a risk form, which is a real functional of two arguments: a measurable function on a Polish space and a measure on that space. We generalize the duality theory and the Kusuoka representation to this setting. For a risk form acting on a product of Polish spaces, we define marginal and conditional forms and we prove a disintegration formula, which represents a risk form as a composition of its marginal and conditional forms. We apply the proposed approach to two-stage stochastic programming problems with partial information and decision-dependent observation distribution.

math.OC↗

Time-Consistent Risk Measures for Continuous-Time Markov Chains

We develop an approach to time-consistent risk evaluation of continuous-time processes in Markov systems. Our analysis is based on dual representation of coherent risk measures, differentiability concepts for multivalued mappings, and a refined concept of time consistency. We prove that the risk measures are defined by a family of risk evaluation functionals (transition risk mappings), which depend on state, time, and the transition function. Their dual representations are risk multikernels of the Markov system. We introduce the concept of a semi-derivative of a risk multikernel and use it to generalize the concept of a generator of a Markov process. Using these semi-derivatives, we derive a system of ordinary differential equations that the risk evaluation must satisfy, which generalize the classical backward Kolmogorov equations for Markov processes. Additionally, we construct convergent discrete-time approximations to the continuous-time risk measures.

math.OC↗

Process-Based Risk Measures and Risk-Averse Control of Discrete-Time Systems

For controlled discrete-time stochastic processes we introduce a new class of dynamic risk measures, which we call process-based. Their main features are that they measure risk of processes that are functions of the history of a base process. We introduce a new concept of conditional stochastic time consistency and we derive the structure of process-based risk measures enjoying this property. We show that they can be equivalently represented by a collection of static law-invariant risk measures on the space of functions of the state of the base process. We apply this result to controlled Markov processes and we derive dynamic programming equations.

math.OC↗

Rate of Convergence of the Bundle Method

We prove that the bundle method for nonsmooth optimization achieves solution accuracy $\varepsilon$ in at most $\mathcal{O}\big(\ln(1/\varepsilon)/\varepsilon\big)$ iterations, if the function is strongly convex. The result is true for the versions of the method with multiple cuts and with cut aggregation.

math.OC↗

Discrete-Time Approximation of Risk-Averse Control Problems for Diffusion Processes

We consider optimal control problems for diffusion processes, where the objective functional is defined by a time-consistent dynamic risk measure. We focus on coherent risk measures defined by $g$-evaluations. For such problems, we construct a family of time and space perturbed systems with piecewise-constant control functions. We obtain a regularized optimal value function by a special mollification procedure. This allows us to establish a bound on the difference between the optimal value functions of the original problem and of the problem with piecewise-constant controls.

math.OC↗

Selective Linearization For Multi-Block Convex Optimization

We consider the problem of minimizing a sum of several convex non-smooth functions. We introduce a new algorithm called the selective linearization method, which iteratively linearizes all but one of the functions and employs simple proximal steps. The algorithm is a form of multiple operator splitting in which the order of processing partial functions is not fixed, but rather determined in the course of calculations. Global convergence is proved and estimates of the convergence rate are derived. Specifically, the number of iterations needed to achieve solution accuracy $\varepsilon$ is of order $\mathcal{O}\big(\ln(1/\varepsilon)/\varepsilon\big)$. We also illustrate the operation of the algorithm on structured regularization problems.

math.OC↗

Statistical Estimation of Composite Risk Functionals and Risk Optimization Problems

We address the statistical estimation of composite functionals which may be nonlinear in the probability measure. Our study is motivated by the need to estimate coherent measures of risk, which become increasingly popular in finance, insurance, and other areas associated with optimization under uncertainty and risk. We establish central limit formulae for composite risk functionals. Furthermore, we discuss the asymptotic behavior of optimization problems whose objectives are composite risk functionals and we establish a central limit formula of their optimal values when an estimator of the risk functional is used. While the mathematical structures accommodate commonly used coherent measures of risk, they have more general character, which may be of independent interest.

math.ST↗