## Organisers:

## Time:

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:

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).

Anupam Gupta

Tuesday, 23 March 2021, 16:00 to 17:00

The problem of chasing convex functions is easy to state: faced with a sequence of convex functions {f_t}, the goal of the algorithm is to output a point x_t at each time, so that the sum of the function costs f_t(x_t), plus the movement costs ||

Friday, 19 March 2021, 09:00 to Saturday, 20 March 2021, 18:00

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$.

Dr.Himanshu Asnani joins the School of Technology and Computer Science as a Reader. Himanshu's research interests include Information and Coding Theory, Statistical Estimation and Inference, Machine Learning.

Siddharth Bhandari, graduate student in STCS, wins the 2019 Google PhD Fellowship in Algorithms, Optimizations and Markets.

Neha Sangwan, graduate student in the School of Technology and Computer Science, wins the runner-up award for her poster at the Croucher Summer Course in Information Theory (CSCIT 2019) based on joint work w

- ‹ previous
- 6 of 18
- next ›