## Organisers:

## Time:

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.

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.

Henry Yuen

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

Below event would be a screening of a past talk by Henry Yuen (available on YouTube) with the same title.

Avinandan Das

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

In this talk, I am going to present the Singly Connected Vertex Deletion Problem (SCVD).

Nidhi Rathi

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

The theory of Fair Division addresses the fundamental problem of allocating goods among agents with equal entitlements but distinct preferences.

Speaker:

Anamay Tengse, TIFR

Friday, 9 April 2021, 17:15 to 18:15

The fact that the polynomial (x1+...+xn)^d can be written as a poly(n,d)-sum of products of univariates is a consequence of what is popularly known as 'the duality trick' in the algebraic complexity circles.

Speaker:

Eeshan Modak, TIFR

Friday, 26 March 2021, 17:15 to 18:15

Abstract: Generalization error is the gap between an algorithm's performance on the true data distribution (unknown to us) and its performance on the given dataset (known to us).

Speaker:

Prerona Chatterjee, TIFR

Friday, 12 March 2021, 17:15 to 18:15

Tensor are higher dimensional analogues of matrices and there is a notion of the rank of a tensor (similar to matrices).

Speaker:

Prabhat Kumar Jha, TIFR

Friday, 26 February 2021, 15:00 to 16:00

Games are used to model many instances arising from interaction of more than one computational agent. In program synthesis, existence of strategy is the key in deciding the existence of a program with a given set of specifications.

Abhishek Khetan

Friday, 19 February 2021, 17:15 to 18:15

In this talk we will give a proof of the fact that the two dimensional sphere can be partitioned into finitely many pieces in such a way that a rearrangement of the pieces produces two disjoint copies of the original sphere.

Zoom link:

Speaker:

Siddharth Bhandari, TIFR

Friday, 12 February 2021, 17:15 to 18:15

We will study the Decision-Tree complexity of element distinctness using arbitrary binary gates (an instance of which is comparison gates). Concretely, let $m$ and $n$ be natural numbers with $m>n$.