A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
KAUST DepartmentComputer Science Program
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Preprint Posting Date2018-01-17
Permanent link to this recordhttp://hdl.handle.net/10754/626844
MetadataShow full item record
AbstractWe propose a class of subspace ascent methods for computing optimal approximate designs that covers existing algorithms as well as new and more efficient ones. Within this class of methods, we construct a simple, randomized exchange algorithm (REX). Numerical comparisons suggest that the performance of REX is comparable or superior to that of state-of-the-art methods across a broad range of problem structures and sizes. We focus on the most commonly used criterion of D-optimality, which also has applications beyond experimental design, such as the construction of the minimum-volume ellipsoid containing a given set of data points. For D-optimality, we prove that the proposed algorithm converges to the optimum. We also provide formulas for the optimal exchange of weights in the case of the criterion of A-optimality, which enable one to use REX and some other algorithms for computing A-optimal and I-optimal designs.
CitationHarman R, Filová L, Richtárik P (2018) A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments. Journal of the American Statistical Association: 1–43. Available: http://dx.doi.org/10.1080/01621459.2018.1546588.
SponsorsThe work of the first two authors was supported by Grant Number 1/0521/16 from the Slovak Scientific Grant Agency (VEGA). The last author acknowledges support through the KAUST baseline research funding scheme. We are also grateful to Valerii Fedorov, Anatoly Zhigljavsky, Luc Pronzato, Bernhard Spangl, Samuel Rosa and two anonymous referees for insightful comments on the first version of this paper.
PublisherInforma UK Limited
RelationsIs Supplemented By:
Showing items related by title, author, creator and subject.
On Truly Block Eigensolvers via Riemannian OptimizationXu, Zhiqiang; Gao, Xin (Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics, 2018-04) [Conference Paper]We study theoretical properties of block solvers for the eigenvalue problem. Despite a recent surge of interest in such eigensolver analysis, truly block solvers have received relatively less attention, in contrast to the majority of studies concentrating on vector versions and non-truly block versions that rely on the deflation strategy. In fact, truly block solvers are more widely deployed in practice by virtue of its simplicity without compromise on accuracy. However, the corresponding theoretical analysis remains inadequate for first-order solvers, as only local and k-th gap-dependent rates of convergence have been established thus far. This paper is devoted to revealing significantly better or as-yet-unknown theoretical properties of such solvers. We present a novel convergence analysis in a unified framework for three types of first-order Riemannian solvers, i.e., deterministic, vanilla stochastic, and stochastic with variance reduction, that are to find top-k eigenvectors of a real symmetric matrix, in full generality. In particular, the issue of zero gaps between eigenvalues, to the best of our knowledge for the first time, is explicitly considered for these solvers, which brings new understandings, e.g., the dependence of convergence on gaps other than the k-th one. We thus propose the concept of generalized k-th gap. Three types of solvers are proved to converge to a globally optimal solution at a global, generalized k-th gap-dependent, and linear or sub-linear rate.
Optimal policies for battery operation and design via stochastic optimal control of jump diffusionsRezvanova, Eliza (2021-04-26) [Thesis]
Advisor: Tempone, Raul
Committee members: Boffi, Daniele; Bolin, DavidTo operate a production plant, one requires considerable amounts of power. With a wide range of energy sources, the price of electricity changes rapidly throughout the year, and so does the cost of satisfying the electricity demand. Battery technology allows storing energy while the electric power is lower, saving us from purchasing at higher prices. Thus, adding batteries to run plants can significantly reduce production costs. This thesis proposes a method to determine the optimal battery regime and its maximum capacity, minimizing the production plant's energy expenditures. We use stochastic differential equations to model the dynamics of the system. In this way, our spot price mimics the Uruguayan energy system's historical data: a diffusion process represents the electricity demand and a jump-diffusion process - the spot price. We formulate a corresponding stochastic optimal control problem to determine the battery's optimal operation policy and its optimal storage capacity. To solve our stochastic optimal control problem, we obtain the value function by solving the Hamilton-Jacobi-Bellman partial differential equation associated with the system. We discretize the Hamilton-Jacobi-Bellman partial differential equation using finite differences and a time splitting operator technique, providing a stability analysis. Finally, we solve a one-dimensional minimization problem to determine the battery's optimal capacity.
Optimal explicit strong stability preserving Runge–Kutta methods with high linear order and optimal nonlinear orderGottlieb, Sigal; Grant, Zachary; Higgs, Daniel (Mathematics of Computation, American Mathematical Society (AMS), 2015-04-10) [Article]High order spatial discretizations with monotonicity properties are often desirable for the solution of hyperbolic PDEs. These methods can advantageously be coupled with high order strong stability preserving time discretizations. The search for high order strong stability time-stepping methods with large allowable strong stability coefficient has been an active area of research over the last two decades. This research has shown that explicit SSP Runge-Kutta methods exist only up to fourth order. However, if we restrict ourselves to solving only linear autonomous problems, the order conditions simplify and this order barrier is lifted: explicit SSP Runge-Kutta methods of any linear order exist. These methods reduce to second order when applied to nonlinear problems. In the current work we aim to find explicit SSP Runge-Kutta methods with large allowable time-step, that feature high linear order and simultaneously have the optimal fourth order nonlinear order. These methods have strong stability coefficients that approach those of the linear methods as the number of stages and the linear order is increased. This work shows that when a high linear order method is desired, it may still be worthwhile to use methods with higher nonlinear order.