STCS Student Seminar

The Kullback-Leibler Upper Confidence Bound (KLUCB) Algorithm for regret minimization in K-armed bandits

Speaker: 
Anirban Bhattacharjee, TIFR

Organisers: 

Sushant Vijayan

Time: 

Friday, 25 September 2020, 17:15 to 18:15

Venue: 

The K-armed bandit problem is a sequential decision making problem wherein one has to sequentially sample from a given set of K probability distributions (belonging to a known family) informally called 'arms of the bandit'.

Minimizing the Sum of Age of Information and Transmission Cost under Stochastic Arrival Model

Speaker: 
Kumar Saurav, TIFR

Organisers: 

Vidya Sagar Sharma

Time: 

Friday, 4 September 2020, 17:15 to 18:15

Venue: 

We consider a node-monitor pair, where updates are generated stochastically (according to a known distribution) at the node that it wishes to send to the monitor.

Directed Information and Pearl's Causal Calculus

Speaker: 
Eeshan Modak, TIFR

Organisers: 

Shubhada Agrawal

Time: 

Friday, 28 August 2020, 17:15 to 18:15

Venue: 

This will be a tweaked version of my Qualifier talk. I will mostly focus on:
1. The notion of interventional distributions (as defined by Judea Pearl) and how they can be used to identify causal linkages.

Pages

Subscribe to RSS - STCS Student Seminar