2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DS2019
Majorisation-minimisation algorithms for minimising the difference between lattice submodular functions
Conor McMeel, Panos Parpas
We consider the problem of minimising functions represented as a difference of lattice submodular functions. We propose analogues to the SupSub, SubSup and ModMod routines for latt…
stat.ML2019★ 2 cited
The sharp, the flat and the shallow: Can weakly interacting agents learn to escape bad minima?
Nikolas Kantas, Panos Parpas, Grigorios A. Pavliotis
An open problem in machine learning is whether flat minima generalize better and how to compute such minima efficiently. This is a very challenging problem. As a first step towards…
math.OC2017
Arbitrarily Tight Bounds on a Singularly Perturbed Linear-Quadratic Optimal Control Problem
Sei Howe, Panos Parpas
We calculate arbitrarily tight upper and lower bounds on an unconstrained control, linear-quadratic, singularly perturbed optimal control problem whose exact solution is computatio…