Robust Algorithms for recovering planted structures in Semi-random instances

STCS Student Seminar

Speaker:

Yash Khanna

Organisers:

Kumar Saurav

Time:

Friday, 13 November 2020, 17:15 to 18:15

In this work, we design algorithms for two fundamentally important and classical graph problems in the planted setting.

Unravelling Dataset Biases

STCS Student Seminar

Speaker:

Mohit Lamba

Organisers:

Kumar Saurav

Time:

Friday, 6 November 2020, 17:15 to 18:15

As scientists and engineers, we have long aimed at solving real-time problems such as detecting and localizing objects seen by our video recorder or at least something like Pokemon's Animedex.

A Provably Convergent and Practical Algorithm for Min-max Optimization with Applications to GANs

STCS Student Seminar

Speaker:

Sushant Vijayan, TIFR

Time:

Friday, 23 October 2020, 17:15 to 18:15

Algorithms for finding min-max equilibrium points in a zero sum game often exhibit cyclic behavior and non-convergence.

Diophantine Sets and Computability

STCS Student Seminar

Speaker:

Prabhat Kumar Jha, TIFR

Organisers:

Anirban Bhattacharjee

Time:

Friday, 9 October 2020, 17:15 to 18:15

Diophantine sets are defined using Diophantine equations. These sets are important and ubiquitous in number theory.

The Kullback-Leibler Upper Confidence Bound (KLUCB) Algorithm for regret minimization in K-armed bandits

STCS Student Seminar

Speaker:

Anirban Bhattacharjee, TIFR

Organisers:

Sushant Vijayan

Time:

Friday, 25 September 2020, 17:15 to 18:15

Venue:

Zoom link: https://zoom.us/j/98132227553?pwd=K2cyQllKVjExdUhlRm0vc0ZHcEt0Zz09

The K-armed bandit problem is a sequential decision making problem wherein one has to sequentially sample from a given set of K probability distributions (belonging to a known family) informally called 'arms of the bandit'.

Parity Games are solvable in quasipolynomial time

STCS Student Seminar

Speaker:

Aparna Shankar, TIFR

Organisers:

Sushant Vijayan

Time:

Friday, 18 September 2020, 17:15 to 18:15

Venue:

https://zoom.us/j/98132227553?pwd=K2cyQllKVjExdUhlRm0vc0ZHcEt0Zz09

A longstanding open problem in computer science has been to show that parity games can be solved in polynomial time.

Minimizing the Sum of Age of Information and Transmission Cost under Stochastic Arrival Model

STCS Student Seminar

Speaker:

Kumar Saurav, TIFR

Organisers:

Vidya Sagar Sharma

Time:

Friday, 4 September 2020, 17:15 to 18:15

Venue:

Zoom link: https://zoom.us/j/92834710011?pwd=WURSa3JsRVpJYWhONEExYTdDcENDQT09

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

STCS Student Seminar

Speaker:

Eeshan Modak, TIFR

Organisers:

Shubhada Agrawal

Time:

Friday, 28 August 2020, 17:15 to 18:15

Venue:

Zoom link: https://zoom.us/j/92834710011?pwd=WURSa3JsRVpJYWhONEExYTdDcENDQT09

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.

Guarding Polygons via CSPs

STCS Student Seminar

Speaker:

Akanksha Agrawal

Organisers:

Shubhada Agrawal

Time:

Friday, 21 August 2020, 17:15 to 18:15

Venue:

Zoom link: https://zoom.us/j/92834710011?pwd=WURSa3JsRVpJYWhONEExYTdDcENDQT09

Abstract: Introduced by Klee in 1973, the Art Gallery problem asks the following question.

Identifying some necessary conditions for a function to be Boolean

STCS Student Seminar

Speaker:

Nikhil Mande

Organisers:

Neha Sangwan

Time:

Saturday, 15 August 2020, 11:00 to 12:00

The seminar will happen via Google meet.

Search form

Speaker:

Organisers:

Time:

Speaker:

Organisers:

Time:

Time:

Organisers:

Time:

Organisers:

Time:

Venue:

Organisers:

Time:

Venue:

Organisers:

Time:

Venue:

Organisers:

Time:

Venue:

Speaker:

Organisers:

Time:

Venue:

Speaker:

Organisers:

Time:

Pages