## Speaker:

## Organisers:

## Time:

## Venue:

**Abstract:** The probabilistic degree of a Boolean function f is defined to be the smallest d such that there is a random polynomial P of degree at most d that agrees with f at each point with high probability.

S. Venkitesh

Friday, 6 December 2019, 14:30 to 15:30

**Abstract:** The probabilistic degree of a Boolean function f is defined to be the smallest d such that there is a random polynomial P of degree at most d that agrees with f at each point with high probability.

Speaker:

Prabhat Kumar Jha, TIFR

Thursday, 5 December 2019, 15:30 to 16:30

**Abstract: ** Discrete-time linear systems are a ubiquitous modeling tool across the sciences. We study a reachability problem related to discrete-time linear systems which we call ``Affine Subspace Reachability Problem''.

Speaker:

Anamay Tengse, TIFR

Friday, 29 November 2019, 17:15 to 18:15

**Abstract: **Say we are "given" a set of matrices S, such that for any two matrices A and B from S, we have AB=BA. What kind of "structure" can we assume for the matrices in S?

Pranav Gokhale

Friday, 29 November 2019, 11:00 to 12:30

Abstract:Variational quantum eigensolver (VQE) is a promising algorithm suitable for near-term quantum machines. VQE aims to approximate the lowest eigenvalue of an exponentially sized matrix in polynomial time.

Rohit Vaish

Tuesday, 3 December 2019, 14:00 to 15:00

**Abstract:** Fair allocation of resources is a central problem at the interface of economics and computer science.

Speaker:

Kumar Saurav, TIFR

Friday, 22 November 2019, 17:15 to 18:15

**Abstract: **In distributed IoT paradigm, we often have cases where multiple nodes need to keep a common server updated with their status information.

Sreekar Vadlamani

Friday, 22 November 2019, 16:00 to 17:00

Abstract: In this talk, I shall begin with explaining a model of random graph which is an instance of non-rank-1, inhomogeneous random graph.

Speaker:

Prabhat Kumar Jha, TIFR

Friday, 15 November 2019, 17:15 to 18:15

**Abstract: **Given an $n \times n$ rational matrix A, a vector $u \in \mathbb{Q}^n$ and an affine subspace $W \subset \mathbb{Q}^n$ , the affine subspace reachability problem asks whether there exists $t \in \mathbb{N}$ such that $A

Manoj Gopalkrishnan

Tuesday, 26 November 2019, 16:00 to 17:00

Abstract:Bayesian networks are foundational objects in machine learning, playing a central role as theoretical tools to understand and organize what we know about machine learning, including hierarchical Bayesian inference, belief propagation, var

Speaker:

Gowtham Raghunath Kurri, TIFR

Friday, 15 November 2019, 11:00 to 12:00

**Abstract:** In a coordination problem, users in a network observing correlated inputs collaborate to evaluate possibly randomized functions of the inputs.