BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//program.berlinbuzzwords.de//bbuzz26//speaker//ADKESR
BEGIN:VTIMEZONE
TZID:CET
BEGIN:STANDARD
DTSTART:20001029T040000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20000326T030000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:pretalx-bbuzz26-HWPQ7L@program.berlinbuzzwords.de
DTSTART;TZID=CET:20260609T093000
DTEND;TZID=CET:20260609T095000
DESCRIPTION:For a golden set\, you need queries. Even if you have them\, yo
 u can’t judge all docs for each query. Only the top N. How do we rank th
 e top N? See the circular dependency? We’ll talk about ways to untangle 
 it: lexical search\, significant terms\, training an embedder from scratch
 \, etc. By iteratively refining data and queries\, we'll get there.
DTSTAMP:20260525T115051Z
LOCATION:Maschinenhaus
SUMMARY:Circular Dependency Fixes when Bootstrapping a Golden Set - Radu Gh
 eorghe\, Rafał Kuć
URL:https://program.berlinbuzzwords.de/bbuzz26/talk/HWPQ7L/
END:VEVENT
END:VCALENDAR