Seminar Announcement
Date: Tuesday, 6 February 2024
Time: 3: 30 PM
Venue: Seminar Hall
Sparsification and Uncertainty: Through Geometric Lens
Sujoy Bhore
IIT Bombay.
06-02-24

---

Abstract

In numerous applications, e.g., machine learning, social choice theory, transportation systems, robotics, internet, etc, networks (mathematically, modeled as graphs) are often massive in size. Coping with such massive network systems is a pressing challenge of the current time. A principled approach for dealing with massive graphs is to compress big input graphs into compact subgraphs, called Spanners, which preserves the fundamental properties, such as distances up to some amount of multiplicative or additive distortion. In the first part of my talk, I will discuss some of the recently developed geometric sparsification mechanisms.

We live in a dynamic world, where our everyday life involves several decision-making processes that are based on data changing constantly over time. Algorithms are at the core of computer science. They define the underlying computational processes of every complex system running in today's digital world. These systems continuously ingest vast amounts of data, posing a natural challenge for algorithms—not only to perform efficient computations at a given moment but also to maintain high-quality solutions consistently. In the second part of the talk, I will explore the dynamic aspects of geometric optimization problems.