SearcharxivSearch

arXiv subjects

Mariana Prazeres

Publications and source records attributed to Mariana Prazeres.

3 recordsLinked to original sources

Stochastic Gradient Descent with Polyak's Learning Rate

Stochastic gradient descent (SGD) for strongly convex functions converges at the rate $\bO(1/k)$. However, achieving good results in practice requires tuning the parameters (for example the learning rate) of the algorithm. In this paper we propose a generalization of the Polyak step size, used for subgradient methods, to Stochastic gradient descent. We prove a non-asymptotic convergence at the rate $\bO(1/k)$ with a rate constant which can be better than the corresponding rate constant for optimally scheduled SGD. We demonstrate that the method is effective in practice, and on convex optimization problems and on training deep neural networks, and compare to the theoretical rate.

math.OC

One-dimensional stationary mean-field games with local coupling

A standard assumption in mean-field game (MFG) theory is that the coupling between the Hamilton-Jacobi equation and the transport equation is monotonically non-decreasing in the density of the population. In many cases, this assumption implies the existence and uniqueness of solutions. Here, we drop that assumption and construct explicit solutions for one-dimensional MFGs. These solutions exhibit phenomena not present in monotonically increasing MFGs: low-regularity, non-uniqueness, and the formation of regions with no agents.

math.AP

Existence of positive solutions for an approximation of stationary mean-field games

Here, we consider a regularized mean-field game model that features a low-order regularization. We prove the existence of solutions with positive density. To do so, we combine a priori estimates with the continuation method. In contrast with high-order regularizations, the low-order regularizations are easier to implement numerically. Moreover, our methods give a theoretical foundation for this approach.

math.AP