1,469 research outputs found
Projected Stochastic Gradients for Convex Constrained Problems in Hilbert Spaces
Convergence of a projected stochastic gradient algorithm is demonstrated for
convex objective functionals with convex constraint sets in Hilbert spaces. In
the convex case, the sequence of iterates converges weakly to a point
in the set of minimizers with probability one. In the strongly convex case, the
sequence converges strongly to the unique optimum with probability one. An
application to a class of PDE constrained problems with a convex objective,
convex constraint and random elliptic PDE constraints is shown. Theoretical
results are demonstrated numerically.Comment: 28 page
A Stochastic Gradient Method with Mesh Refinement for PDE Constrained Optimization under Uncertainty
Models incorporating uncertain inputs, such as random forces or material
parameters, have been of increasing interest in PDE-constrained optimization.
In this paper, we focus on the efficient numerical minimization of a convex and
smooth tracking-type functional subject to a linear partial differential
equation with random coefficients and box constraints. The approach we take is
based on stochastic approximation where, in place of a true gradient, a
stochastic gradient is chosen using one sample from a known probability
distribution. Feasibility is maintained by performing a projection at each
iteration. In the application of this method to PDE-constrained optimization
under uncertainty, new challenges arise. We observe the discretization error
made by approximating the stochastic gradient using finite elements. Analyzing
the interplay between PDE discretization and stochastic error, we develop a
mesh refinement strategy coupled with decreasing step sizes. Additionally, we
develop a mesh refinement strategy for the modified algorithm using iterate
averaging and larger step sizes. The effectiveness of the approach is
demonstrated numerically for different random field choices
Stochastic Optimization For Multi-Agent Statistical Learning And Control
The goal of this thesis is to develop a mathematical framework for optimal, accurate, and affordable complexity statistical learning among networks of autonomous agents. We begin by noting the connection between statistical inference and stochastic programming, and consider extensions of this setup to settings in which a network of agents each observes a local data stream and would like to make decisions that are good with respect to information aggregated across the entire network. There is an open-ended degree of freedom in this problem formulation, however: the selection of the estimator function class which defines the feasible set of the stochastic program.
Our central contribution is the design of stochastic optimization tools in reproducing kernel Hilbert spaces that yield optimal, accurate, and affordable complexity statistical learning for a multi-agent network. To obtain this result, we first explore the relative merits and drawbacks of different function class selections.
In Part I, we consider multi-agent expected risk minimization this problem setting for the case that each agent seems to learn a common globally optimal generalized linear models (GLMs) by developing a stochastic variant of Arrow-Hurwicz primal-dual method. We establish convergence to the primal-dual optimal pair when either consensus or ``proximity constraints encode the fact that we want all agents\u27 to agree, or nearby agents to make decisions that are close to one another. Empirically, we observe that these convergence results are substantiated but that convergence may not translate into statistical accuracy. More broadly, optimality within a given estimator function class is not the same as one that makes minimal inference errors.
The optimality-accuracy tradeoff of GLMs motivates subsequent efforts to learn more sophisticated estimators based upon learned feature encodings of the data that is fed into the statistical model. The specific tool we turn to in Part II is dictionary learning, where we optimize both over regression weights and an encoding of the data, which yields a non-convex problem.
We investigate the use of stochastic methods for online task-driven dictionary learning, and obtain promising performance for the task of a ground robot learning to anticipate control uncertainty based on its past experience. Heartened by this implementation, we then consider extensions of this framework for a multi-agent network to each learn globally optimal task-driven dictionaries based on stochastic primal-dual methods. However, it is here the non-convexity of the optimization problem causes problems: stringent conditions on stochastic errors and the duality gap limit the applicability of the convergence guarantees, and impractically small learning rates are required for convergence in practice.
Thus, we seek to learn nonlinear statistical models while preserving convexity, which is possible through kernel methods ( Part III). However, the increased descriptive power of nonparametric estimation comes at the cost of infinite complexity. Thus, we develop a stochastic approximation algorithm in reproducing kernel Hilbert spaces (RKHS) that ameliorates this complexity issue while preserving optimality: we combine the functional generalization of stochastic gradient method (FSGD) with greedily constructed low-dimensional subspace projections based on matching pursuit. We establish that the proposed method yields a controllable trade-off between optimality and memory, and yields highly accurate parsimonious statistical models in practice.
%
Then, we develop a multi-agent extension of this method by proposing a new node-separable penalty function and applying FSGD together with low-dimensional subspace projections. This extension allows a network of autonomous agents to learn a memory-efficient approximation to the globally optimal regression function based only on their local data stream and message passing with neighbors. In practice, we observe agents are able to stably learn highly accurate and memory-efficient nonlinear statistical models from streaming data.
From here, we shift focus to a more challenging class of problems, motivated by the fact that true learning is not just revising predictions based upon data but augmenting behavior over time based on temporal incentives. This goal may be described by Markov Decision Processes (MDPs): at each point, an agent is in some state of the world, takes an action and then receives a reward while randomly transitioning to a new state. The goal of the agent is to select the action sequence to maximize its long-term sum of rewards, but determining how to select this action sequence when both the state and action spaces are infinite has eluded researchers for decades. As a precursor to this feat, we consider the problem of policy evaluation in infinite MDPs, in which we seek to determine the long-term sum of rewards when starting in a given state when actions are chosen according to a fixed distribution called a policy. We reformulate this problem as a RKHS-valued compositional stochastic program and we develop a functional extension of stochastic quasi-gradient algorithm operating in tandem with the greedy subspace projections mentioned above. We prove convergence with probability 1 to the Bellman fixed point restricted to this function class, and we observe a state of the art trade off in memory versus Bellman error for the proposed method on the Mountain Car driving task, which bodes well for incorporating policy evaluation into more sophisticated, provably stable reinforcement learning techniques, and in time, developing optimal collaborative multi-agent learning-based control systems
A stochastic gradient method for a class of nonlinear PDE-constrained optimal control problems under uncertainty
The study of optimal control problems under uncertainty plays an important
role in scientific numerical simulations. This class of optimization problems
is strongly utilized in engineering, biology and finance. In this paper, a
stochastic gradient method is proposed for the numerical resolution of a
nonconvex stochastic optimization problem on a Hilbert space. We show that,
under suitable assumptions, strong or weak accumulation points of the iterates
produced by the method converge almost surely to stationary points of the
original optimization problem. Measurability, local convergence, and
convergence rates of a stationarity measure are handled, filling a gap for
applications to nonconvex infinite dimensional stochastic optimization
problems. The method is demonstrated on an optimal control problem constrained
by a class of elliptic semilinear partial differential equations (PDEs) under
uncertainty
- …