skip to content

Department of Computer Science and Technology

Tuesday, 4 February, 2020 - 13:00 to 14:00
Edoardo Calvello (Imperial College)
LT2, Computer Laboratory, William Gates Building

We consider the idea of solving a non-convex optimisation problem by adding a large enough strongly-convex function to make the objective function convex. This allows the use of simpler convex optimisers, yet, given the large strong-convexity constant required, yields a value closer to the minimum of the function added than that of the objective one. We try to fix this with the novel idea of instead adding a function that makes the objective satisfy the Polyak-Łojasiewicz (PL) inequality, a much weaker condition than strong-convexity. Building on previous work, we construct an optimisation algorithm relying on this method. We find that a much smaller multiplicative constant is needed for convergence to a minimum. We attempt to find and prove convergence rates and computational complexity and test which algorithm yields a more accurate minimum.

Artificial Intelligence Research Group Talks (Computer Laboratory)

Upcoming seminars