## Organisers:

## Time:

In this talk, we will revisit the classical regret-minimization problem in the multi-armed bandit setting.

Speaker:

Shubhada Agrawal, TIFR

Friday, 6 August 2021, 17:15 to 18:15

In this talk, we will revisit the classical regret-minimization problem in the multi-armed bandit setting.

Anand Deo

Friday, 30 July 2021, 17:15 to 18:15

Mitigating the effect of tail risk has gained prominence in a variety of applications where safety is of paramount importance.

Thejaswini Raghavan

Friday, 23 July 2021, 17:15 to 18:15

The Strahler number of a rooted tree is the largest height of a perfect binary tree that is its minor.

Speaker:

Aparna Shankar, TIFR

Friday, 16 July 2021, 17:15 to 18:15

Expander graphs are sparse but highly connected graphs, which find a variety of uses in CS. If the vertices of an expander are labelled by 0 or 1, a $t$-step walk gives a $t$-bit string.

Speaker:

Pranshu Gaba, TIFR

Friday, 9 July 2021, 15:00 to 16:00

A directed graph is said to be k-vertex-connected if after deleting any k-1 vertices, therer is a directed path from every vertex to every other vertex along the directed edges.

Nitin Saurabh

Friday, 18 June 2021, 17:15 to 18:15

A Boolean function f on n variables is called a polymorphism of another Boolean function g on m variables if their operations commute.

Gorav Jindal

Friday, 11 June 2021, 17:15 to 18:15

Given n-variate polynomials f,g,h such that f=g/h, where both g and h are computable by arithmetic circuits of size s, we show that f can be computed by a circuit of size poly(s, deg(h)).

Speaker:

Neha Sangwan, TIFR

Friday, 4 June 2021, 17:15 to 18:15

In this talk, I will introduce the problem of determining the identity of a byzantine user (internal adversary) in a communication system.

Vishwas Bhargava

Friday, 28 May 2021, 17:15 to 18:15

The \emph{orbit} of an n-variate polynomial f(\var x) over a field \F, denoted by \orbit{f}, is the set of polynomials obtained by applying invertible affine transformations on the variables of f(\var x), and the orbit of a polynomial class is the

Speaker:

Sushant Vijayan, TIFR

Friday, 7 May 2021, 17:15 to 18:15

I will present the 2013 NIPS paper by Dan Russo and Van Roy where they introduce the notion of Eluder dimension and use it to analyse the UCB and Thompson Sampling algorithms.