BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1730
DTSTAMP:20260602T084801Z
SUMMARY:Binary Hypothesis Testing with Deterministic Finite Memory
DESCRIPTION:Speaker: Malhar Ajit  Managoli (TIFR)\n\nAbstract: \nBinary hyp
 othesis testing is a classic problem in statistics. Classically\, the goal
  of the problem is to minimize the probability of error as a function of t
 he number of samples. In the finite memory version of the problem\, sample
 s are plentiful\, but we have only a small amount of memory to work with. 
 This is modeled as the tester being a finite automaton. In a previous talk
 \, we have seen the result for the case when the automaton is randomised. 
 In this talk\, we will consider the deterministic case. Although tight res
 ults are not known in this case\, we can show that deterministic automaton
 s are weaker than their randomised counterparts.\n
URL:https://www.tcs.tifr.res.in/web/events/1730
DTSTART;TZID=Asia/Kolkata:20260605T160000
DTEND;TZID=Asia/Kolkata:20260605T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR