Postdoctoral Research Associate - Liverpool, United Kingdom - University of Liverpool

Tom O´Connor

Posted by:

Tom O´Connor

beBee Recruiter


Description
The project will explore new techniques for showing hardness in TFNP, following on from the STOC 2021 best paper ¿The complexity of gradient descent: CLS = PPAD

  • PLS¿.
The project will particularly focus on the complexity class CLS, which contains problems from a wide variety of disciplines, including:

¿ Algorithmic Game Theory (e.g. Network congestion games, Network coordination games, Shapley stochastic games)

  • Formal Verification (e.g. Tarski fixed points, Contraction map fixed points, Unique sink orientations, Simplestochastic games)
¿ Optimization and Machine Learning (e.g. finding KKT points of polynomials, gradient descent in a neural network)
You will have a strong research background in at least one of the three areas listed above. You will also have, or be close to completing, a PhD in Computer Science or a related area.
This post is available from 1 January 2024 until 31 December 2025.


Any applicants who are still awaiting their PhD to be awarded should be aware that if successful, they will be appointed at grade 6, spine point 30.

Upon written confirmation that they have been successful in being awarded their PhD, they will be moved onto grade 7, spine point 31 from the date of their award.


More jobs from University of Liverpool