Past Events

An algebraic algorithm for minimizing linearly representable submodular functions

Speaker: 

Rohit Gurjar

Organisers: 

Arkadev Chattopadhyay

Time: 

Tuesday, 15 September 2020, 14:45 to 15:45

Venue: 

A set function f on the subsets of a set E is called submodular if it satisfies a natural diminishing returns property: for any two subsets S \subseteq T \subseteq E and an element x outside T, we have f(T + x) - f(T) \leq f(S+x) - f(S).

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.

An Asymptotic Study of Financial Systems - Algorithms and Analysis

Speaker: 
Anand Deo, TIFR

Time: 

Thursday, 27 August 2020, 10:30 to 11:30

Venue: 

Over the past few decades, asymptotic study of financial systems has become an integral part of practical decision making and analytics. Realistic financial systems are complex, and undesirable events in them are often rare.

Communication Complexity and Quantum Machine Learning via Query Complexity

Speaker: 
Suhail Sherif, TIFR

Time: 

Monday, 24 August 2020, 10:30 to 11:30

Venue: 

Query algorithms are everywhere. Gradient Descent is a well-known algorithm that queries the gradient of a hidden function and moves towards the minimum of the function.

Coordination Over Networks: Shared Randomness, Security, and Interaction

Speaker: 

Gowtham Kuri

Time: 

Monday, 10 August 2020, 10:30 to 11:30

Venue: 

Abstract-In a coordination problem, users in a network observing correlated inputs collaborate to evaluate possibly randomized functions of the inputs. Problems of this kind have been widely studied in the information theory literature.

Pages