High-dimensional Stochastic Problems Research Articles

An improved adaptive variable neighborhood search algorithm for stochastic order allocation problem

In practical supply chain operations, efficient order allocation significantly enhances the overall efficiency of the supply chain. Real production environments are plagued by numerous uncertainties, such as unpredictable customer orders, which greatly amplify the complexity of solving practical allocation problems. This study focuses on the problem of allocating orders to parallel machines with varying efficiencies under uncertain and high-dimensional conditions. To maximize the expected profit of order processing, a mathematical model for a high-dimensional stochastic optimization problem is developed, considering the uncertainty due to potential customer order cancellations in a real-world production. By integrating an intelligent optimization algorithm for the order assignment problem with a scenario generation approach, a novel framework for intelligent stochastic optimization is proposed. This framework employs an intelligent optimization algorithm suitable for the generalized assignment problem to search for improved solutions and utilizes the scenario generation method to produce the necessary scenarios for evaluating solutions in high-dimension. Experimental results demonstrate that the proposed approach effectively addresses the high-dimensional stochastic order allocation problem, outperforming the compared method in terms of efficiency and capability.

Coupled Alternating Neural Networks for Solving Multi-Population High-Dimensional Mean-Field Games

Multi-population mean-field game is a critical subclass of mean-field games (MFGs). It is a theoretically feasible multi-agent model for simulating and analyzing the game between multiple heterogeneous populations of interacting massive agents. Due to the factors of game complexity, dimensionality disaster and disturbances should be taken into account simultaneously to solve the multi-population high-dimensional stochastic MFG problem, which is a great challenge. We present CA-Net, a coupled alternating neural network approach for tractably solving multi-population high-dimensional MFGs. First, we provide a universal modeling framework for large-scale heterogeneous multi-agent game systems, which is strictly expressed as a multi-population MFG problem. Next, we generalize the potential variational primal–dual structure that MFGs exhibit, then phrase the multi-population MFG problem as a convex–concave saddle-point problem. Last but not least, we design a generative adversarial network (GAN) with multiple generators and multiple discriminators—the solving network—which parameterizes the value functions and the density functions of multiple populations by two sets of neural networks, respectively. In multi-group quadcopter trajectory-planning numerical experiments, the convergence results of HJB residuals, control, and average speed show the effectiveness of the CA-Net algorithm, and the comparison with baseline methods—cluster game, HJB-NN, Lax–Friedrichs, ML, and APAC-Net—shows the progressiveness of our solution method.

Fair Incentives for Repeated Engagement

We study a decision-maker’s problem of finding optimal monetary incentive schemes for retention when faced with agents whose participation decisions (stochastically) depend on the incentive they receive. Our focus is on policies constrained to fulfill two fairness properties that preclude outcomes wherein different groups of agents experience different treatment on average. We formulate the problem as a high-dimensional stochastic optimization problem and study it through the use of a closely related deterministic variant. We show that the optimal static solution to this deterministic variant is asymptotically optimal for the dynamic problem under fairness constraints. Though solving for the optimal static solution gives rise to a nonconvex optimization problem, we uncover a structural property that allows us to design a tractable, fast-converging heuristic policy. Traditional schemes for retention ignore fairness constraints; indeed, the goal in these is to use differentiation to incentivize repeated engagement with the system. Our work (i) shows that even in the absence of explicit discrimination, dynamic policies may unintentionally discriminate between agents of different types by varying the type composition of the system, and (ii) presents an asymptotically optimal policy to avoid such discriminatory outcomes.

StocIPNet: A novel probabilistic interpretable network with affine-embedded reparameterization layer for high-dimensional stochastic inverse problems

StocIPNet: A novel probabilistic interpretable network with affine-embedded reparameterization layer for high-dimensional stochastic inverse problems

Consumer service level-oriented resilience optimisation for e-commerce supply chain considering hybrid strategies with blockchain adoption

ABSTRACT The booming development of customised e-commerce makes e-commerce supply chains experience a severe test of consumer service level (CSL). An efficient e-commerce supply chain resilience optimisation method addressing economic performance and service performance is proposed to improve customised services under disruption risks. The proposed method includes a hybrid strategy considering both a resistance strategy with blockchain (BCT) adoption and time-dependent recovery strategies simultaneously. A two-stage multi-period multi-product stochastic programming with BCT adoption is then proposed, which (1) implements BCT as the resistance strategy in the pre-disruption stage; (2) collaborates four recovery strategies in the post-disruption stage; (3) supports the e-tailer in making decisions and optimises his profit and order fulfillment time while taking product priorities into account. Using the actual data of Chinese e-commerce during the public health emergency in 2020, it is demonstrated that (1) the applicability of the model with BCT adoption in both supply chain resilience and CSL improvement; (2) the performance of the hybrid strategy in long-term disruption management; (3) the efficiency and robustness of the proposed solution approach for multi-objective high-dimensional stochastic programming problems. E-tailers can optimise decision-making under long-term disruptions by the proposed methodology in practices.

Optimal scheduling of active distribution network based on RBF-stochastic response surface method

Optimal scheduling of active distribution network based on RBF-stochastic response surface method

A decentralized algorithm for a mean field control problem of piecewise deterministic Markov processes

This paper provides a decentralized approach for the control of a population of N agents to minimize an aggregate cost. Each agent evolves independently according to a Piecewise Deterministic Markov dynamics controlled via unbounded jumps intensities. The N-agent high dimensional stochastic control problem is approximated by the limiting mean field control problem. A Lagrangian approach is proposed. Although the mean field control problem is not convex, it is proved to achieve zero duality gap. A stochastic version of the Uzawa algorithm is shown to converge to the primal solution. At each dual iteration of the algorithm, each agent solves its own small dimensional sub problem by means of the Dynamic Programming Principal, while the dual multiplier is updated according to the aggregate response of the agents. Finally, this algorithm is used in a numerical simulation to coordinate the charging of a large fleet of electric vehicles in order to track a target consumption profile.

Mean Field Approximations via Log-Concavity

Abstract We propose a new approach to deriving quantitative mean field approximations for any probability measure $P$ on $\mathbb {R}^{n}$ with density proportional to $e^{f(x)}$, for $f$ strongly concave. We bound the mean field approximation for the log partition function $\log \int e^{f(x)}dx$ in terms of $\sum _{i \neq j}\mathbb {E}_{Q^{*}}|\partial _{ij}f|^{2}$, for a semi-explicit probability measure $Q^{*}$ characterized as the unique mean field optimizer, or equivalently as the minimizer of the relative entropy $H(\cdot \,|\,P)$ over product measures. This notably does not involve metric-entropy or gradient-complexity concepts which are common in prior work on nonlinear large deviations. Three implications are discussed, in the contexts of continuous Gibbs measures on large graphs, high-dimensional Bayesian linear regression, and the construction of decentralized near-optimizers in high-dimensional stochastic control problems. Our arguments are based primarily on functional inequalities and the notion of displacement convexity from optimal transport.

Empirical Assessment of Non-Intrusive Polynomial Chaos Expansions for High-Dimensional Stochastic CFD Problems

Empirical Assessment of Non-Intrusive Polynomial Chaos Expansions for High-Dimensional Stochastic CFD Problems

A stochastic LATIN method for stochastic and parameterized elastoplastic analysis

A stochastic LATIN method for stochastic and parameterized elastoplastic analysis

Inverse reliability analysis and design for tunnel face stability considering soil spatial variability

Inverse reliability analysis and design for tunnel face stability considering soil spatial variability

Stochastic virtual element methods for uncertainty propagation of stochastic linear elasticity

This paper presents stochastic virtual element methods for propagating uncertainty in linear elastic stochastic problems. We first derive stochastic virtual element equations for 2D and 3D linear elastic problems that may involve uncertainties in material properties, external forces, boundary conditions, etc. A stochastic virtual element space that couples the deterministic virtual element space and the stochastic space is constructed for this purpose and used to approximate the unknown stochastic solution. Two numerical frameworks are then developed to solve the derived stochastic virtual element equations, including a Polynomial Chaos approximation based approach and a weakly intrusive approximation based approach. In the Polynomial Chaos based framework, the stochastic solution is approximated using the Polynomial Chaos basis and solved via an augmented deterministic virtual element equation that is generated by applying the stochastic Galerkin procedure to the original stochastic virtual element equation. In the weakly intrusive approximation based framework, the stochastic solution is approximated by a summation of a set of products of random variables and deterministic vectors, where the deterministic vectors are solved via converting the original stochastic problem to deterministic virtual element equations by the stochastic Galerkin approach, and the random variables are solved via converting the original stochastic problem to one-dimensional stochastic algebraic equations by the classical Galerkin procedure. This method avoids the curse of dimensionality in high-dimensional stochastic problems successfully since all random inputs are embedded into one-dimensional stochastic algebraic equations whose computational effort weakly depends on the stochastic dimension. Numerical results on 2D and 3D problems with low- and high-dimensional random inputs demonstrate the good performance of the proposed methods.

Reliability analysis of pile-reinforced slopes in width-limited failure mode considering three-dimensional spatial variation of soil strength

Stabilization pile is a common measurement for landslide mitigation. In previous literatures, the deterministic safety factor Fs method has been well established for pile-reinforced slope stability analysis, for example by limit analysis. However, the Fs method by itself cannot reflect the inherent uncertainty and spatial variability of mechanical properties of soil. This paper presents a probabilistic analysis procedure for width-constrained pile-reinforced slope where the failure pattern and soil spatial variability are both accounted for under three-dimensional (3D) condition. A modified discretization kinematic analysis-based mechanism is employed as the deterministic model. The spatial variability of cohesion c and friction angle φ is modeled as lognormal random fields by using the Karhunen–Loève expansion. The sparse polynomial chaos expansion (SPCE) is used to construct the meta-model to reduce the computational cost in high dimensional stochastic problems. The failure probability, probability density function (PDF), and other useful reliability results can be provided by performing Monte Carlo simulations of the proposed SPCE meta-model. Finally, the influences of soil spatial variability, slope geometry, and pile parameters on the slope reliability are analyzed. The combination of the modified discretization mechanism and SPCE provides a useful tool for the probabilistic analysis of pile-reinforced earth slopes under 3D condition. The probabilistic simulation results are also helpful for reliability design of pile-reinforced slope in practice.

Decomposition of Convex High Dimensional Aggregative Stochastic Control Problems

We consider the framework of convex high dimensional stochastic control problems, in which the controls are aggregated in the cost function. As first contribution, we introduce a modified problem, whose optimal control is under some reasonable assumptions an $\varepsilon$-optimal solution of the original problem. As second contribution, we present a decentralized algorithm whose convergence to the solution of the modified problem is established. Finally, we study the application of the developed tools in an engineering context, studying a coordination problem for large populations of domestic thermostatically controlled loads (TCLs)

Deep treasury management for banks.

Retail banks use Asset Liability Management (ALM) to hedge interest rate risk associated with differences in maturity and predictability of their loan and deposit portfolios. The opposing goals of profiting from maturity transformation and hedging interest rate risk while adhering to numerous regulatory constraints make ALM a challenging problem. We formulate ALM as a high-dimensional stochastic control problem in which monthly investment and financing decisions drive the evolution of the bank's balance sheet. To find strategies that maximize long-term utility in the presence of constraints and stochastic interest rates, we train neural networks that parametrize the decision process. Our experiments provide practical insights and demonstrate that the approach of Deep ALM deduces dynamic strategies that outperform static benchmarks.

On the Feasibility Guarantees of Deep Reinforcement Learning Solutions for Distribution System Operation

Deep reinforcement learning (DRL) has scored unprecedented success in finding near-optimal solutions in high-dimensional stochastic problems, leading to its extensive use in operational research, including the operation of power systems. However, in practice, it has been adopted with extreme caution because the standard DRL does not guarantee the satisfaction of operational constraints. In this paper, the feasibility of solutions given by a DRL agent trained to operate a distribution system is guaranteed by modifying the exploration process and optimality criterion of standard DRL. To that end, first, a convex feasibility set in the form of a multi-dimensional polyhedron, called feasibility diamond, is formed inside the region defined by the power flow constraints, using which the feasibility of solutions given by DRL is checked in real-time. Solutions outside the feasibility diamond are projected on the diamond’s surface, and the new modified action is used for DRL training. Further, the distance of infeasible solutions to their feasible projection is penalized in the DRL reward function. The impact of the proposed method on the feasibility and optimality of DRL solutions are tested on three test distribution systems, indicating that modifying the exploration process and a soft penalization of infeasibilities works best in achieving near-optimal and reliable DRL-trained operators.

Efficient structural reliability analysis via a weak-intrusive stochastic finite element method

Efficient structural reliability analysis via a weak-intrusive stochastic finite element method

A stochastic finite element scheme for solving partial differential equations defined on random domains

This paper proposes a novel stochastic finite element scheme to solve partial differential equations defined on random domains. A geometric mapping algorithm first transforms the random domain into a reference domain. By combining the mesh topology (i.e. the node numbering and the element numbering) of the reference domain and random nodal coordinates of the random domain, random meshes of the original problem are obtained by only one mesh of the reference domain. In this way, the original problem is still discretized and solved on the random domain instead of the reference domain. A random isoparametric mapping of random meshes is then proposed to generate the stochastic finite element equation of the original problem. We adopt a weak-intrusive method to solve the obtained stochastic finite element equation. In this method, the unknown stochastic solution is decoupled into a sum of the products of random variables and deterministic vectors. Deterministic vectors are computed by solving deterministic finite element equations, and corresponding random variables are solved by a proposed sampling method. The computational effort of the proposed method does not increase dramatically as the stochastic dimension increases and it can solve high-dimensional stochastic problems with low computational effort, thus the proposed method avoids the curse of dimensionality successfully. Four numerical examples are given to demonstrate the good performance of the proposed method.

Solving Stochastic Optimal Control Problem via Stochastic Maximum Principle with Deep Learning Method

In this paper, we aim to solve the high dimensional stochastic optimal control problem from the view of the stochastic maximum principle via deep learning. By introducing the extended Hamiltonian system which is essentially a Forward Backward Stochastic Differential Equation (FBSDE) with a maximum condition, we reformulate the original control problem as a new one. According to whether the optimal control has an explicit representation, three algorithms are proposed to solve the new control problem. Numerical results for different examples demonstrate the effectiveness of our proposed algorithms, especially in high dimensional cases. And even if the optimal control \(\tilde{u}\) in the maximum condition may not be solved explicitly, our algorithms can still deal with the stochastic optimal control problem. An important application of our proposed method is to calculate the sub-linear expectations, which correspond to a kind of fully nonlinear Partial Differential Equations (PDEs).

A weak-intrusive stochastic finite element method for stochastic structural dynamics analysis

This paper presents a weak-intrusive stochastic finite element method for solving stochastic structural dynamics equations. In this method, the stochastic solution is decomposed into the summation of a series of products of random variables , spatial vectors and temporal functions. An iterative algorithm is proposed to compute each triplet of the random variable, spatial vector and temporal function one by one. The original stochastic dynamics problem is firstly transformed into spatial–temporal coupled problems (i.e. deterministic structural dynamics equations), which can be solved efficiently by existing FEM solvers. Based on the solution of the spatial–temporal coupled problem, the original problem is then transformed into stochastic-temporal coupled problems (i.e. one-dimensional second-order stochastic ordinary differential equations), which are solved by a proposed sampling method. All random sources are embedded into the stochastic-temporal coupled problems. The proposed sampling method can solve the stochastic-temporal problems of hundreds of dimensions with low computational costs. Thus the curse of dimensionality in high-dimensional stochastic spaces is avoided with great success. Three numerical examples, including low- and high-dimensional stochastic problems , are used to demonstrate the good accuracy and the high efficiency of the proposed method. • A universal decomposition is proposed to approximate the stochastic solutions of stochastic dynamics equations. • An iterative algorithm is developed to solve stochastic dynamics equations. • The proposed method combines the advantages of intrusive and nonintrusive methods. • The curse of dimensionality of high-dimensional stochastic problems is avoided with great success.