BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://tilos.ai
X-WR-CALDESC:Events for 
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20240310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20241103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250416T110000
DTEND;TZID=America/Los_Angeles:20250416T120000
DTSTAMP:20260403T233900
CREATED:20250828T192233Z
LAST-MODIFIED:20260227T222458Z
UID:7286-1744801200-1744804800@tilos.ai
SUMMARY:TILOS Seminar: Amplifying human performance in combinatorial competitive programming
DESCRIPTION:Petar Veličković\, Google DeepMind \nAbstract: Recent years have seen a significant surge in complex AI systems for competitive programming\, capable of performing at admirable levels against human competitors. While steady progress has been made\, the highest percentiles still remain out of reach for these methods on standard competition platforms such as Codeforces. In this talk\, I will describe and dive into our recent work\, where we focussed on combinatorial competitive programming. In combinatorial challenges\, the target is to find as-good-as-possible solutions to otherwise computationally intractable problems\, over specific given inputs. We hypothesise that this scenario offers a unique testbed for human-AI synergy\, as human programmers can write a backbone of a heuristic solution\, after which AI can be used to optimise the scoring function used by the heuristic. We deploy our approach on previous iterations of Hash Code\, a global team programming competition inspired by NP-hard software engineering problems at Google\, and we leverage FunSearch to evolve our scoring functions. Our evolved solutions significantly improve the attained scores from their baseline\, successfully breaking into the top percentile on all previous Hash Code online qualification rounds\, and outperforming the top human teams on several. To the best of our knowledge\, this is the first known AI-assisted top-tier result in competitive programming.
URL:https://tilos.ai/event/tilos-seminar-amplifying-human-performance-in-combinatorial-competitive-programming/
LOCATION:Virtual
CATEGORIES:TILOS Seminar Series
ATTACH;FMTTYPE=image/jpeg:https://tilos.ai/wp-content/uploads/2025/08/velickovic-petar-e1736275993608-TwwARw.jpg
END:VEVENT
END:VCALENDAR