Convergence of adaptive algorithms for constrained weakly convex optimization
Related publications (33)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We showthat any k-th closed sphere-of-influence graph in a d-dimensional normed space has a vertex of degree less than 5dk, thus obtaining a common generalization of results of Furedi and Loeb (Proc AmMath Soc 121(4): 1063-1073, 1994 [1]) and Guibas et al. ...
Restricted Boltzmann Machines (RBMs) are widely used as building blocks for deep learning models. Learning typically proceeds by using stochastic gradient descent, and the gradients are estimated with sampling methods. However, the gradient estimation is a ...
2015
The interest for distributed stochastic optimization has raised to train complex Machine Learning models with more data on distributed systems. Increasing the computation power speeds up the training but it faces a communication bottleneck between workers ...
2018
Finding convergence rates for numerical optimization algorithms is an important task, because it gives a justification to their use in solving practical problems, while also providing a way to compare their efficiency. This is especially useful in an async ...
2017
,
A new method for the design of fixed-structure dynamic output-feedback Linear Parameter Varying (LPV) controllers for discrete-time LPV systems with bounded scheduling parameter variations is presented. Sufficient conditions for the stability, $\mathscr{H} ...
2015
, ,
This paper applies a novel two-layer optimizing control scheme to a kite-control benchmark problem. The upper layer is a recent real-time optimization algorithm, called Directional Modifier Adaptation, which represents a variation of the popular Modifier A ...
IEEE2015
, , ,
We discuss optimal load sharing of parallel gas compressors in the presence of plant-model mismatch. We formulate this problem as a static real-time optimization task and propose to tackle it by means of modifier adaptation. Under mild assumptions, the cho ...
Ieee2016
, ,
The Ranger robot was designed to interact with children in order to motivate them to tidy up their room. Its mechanical configuration, together with the limited field of view of its depth camera, make the learning of obstacle avoidance behaviors a hard pro ...
Ieee2016
, ,
We introduce a novel family of invariant, convex, and non-quadratic functionals that we employ to derive regularized solutions of ill-posed linear inverse imaging problems. The proposed regularizers involve the Schatten norms of the Hessian matrix, which a ...
Image recovery in optical interferometry is an ill-posed nonlinear inverse problem arising from incomplete power spectrum and bi-spectrum measurements. We formulate a linear version of the problem for the order-3 tensor formed by the tensor product of the ...
