Seminars

Abstract: Aggregating multiple input rankings over a set of candidates to generate a consensus ranking is one of the fundamental ranking problems, having many applications in social choice theory, hiring, college admission, web search, and databases. However, the optimal consensus ranking might be biased against any individual candidate or candidates belonging to certain marginalized communities… Read More »Rank Aggregation and Fairness by Diptarka Chakraborty

Abstract: In this talk, we consider the Hospitals/Residents (HR) problem in the presence of ties in preference lists of hospitals. Among the three notions of stability, viz. weak, strong, and super stability, we focus on strong stability. Strong stability is appealing both theoretically and practically; however, its existence is not guaranteed. Our objective is to optimally… Read More »Optimal Capacity Modification for Stable Matchings with Ties by Dr. Keshav Ranjan

Abstract: There can be a multitude of reasons to match agents to specific locations in a given space. In this talk we cover two: distributing delivery orders and assigning shared hostel rooms. For both settings we shall try to find solutions that satisfy desirable properties and characterize instances for which they exist.   We first… Read More »Giving Some Space Can Be Hard: Two New Models to Match Agents with Locations by Shivika Narang

Abstract: Large language models (LLMs) are increasingly deployed as reasoning engines, yet their practical use remains constrained by three persistent challenges: achieving high-quality reasoning at low cost, measuring performance reliably, and ensuring efficient, reproducible deployment. In this talk, I will present a research agenda addressing these challenges through new methods, benchmarks, and systems for practical LLM reasoning. I… Read More »Towards Reliable LLM Reasoning: Coordinated Agents, Variance-Aware Evaluation, and Lean Inference by Prof. Akhil Arora

Speaker:Sukriti Gupta (PhD student), CSE Dept., IIT Delhi Abstract - We consider the problem of file sharing among peers who are connected to a common core network through links of differing upload and download capacities, as is the case in networks provisioned according to the hose model. The file is assumed to be divided into… Read More »Approximating Optimal Broadcast of Files in a Hose-Model Network

Venue: Bharti501 / Teams link will also be shared Abstract: Multiparty session types (MPST) are a type discipline for enforcing the structured, deadlock-free communication of concurrent and message-passing programs. Traditional MPST have a limited form of choice in which alternative communication possibilities are offered by a single participant and selected by another. Mixed choice multiparty… Read More »Multiparty Session Types: Separation and Encodability Results by Prof. Nobuko Yoshida

Abstract: We show that if the ground set of a matroid can be partitioned into k≥2 bases, then for any given subset S of the ground set, there is a partition into k bases such that the sizes of the intersections of the bases with S may differ by at most one. This settles the… Read More »Matroids are Equitable by Hannaneh Akrami

Venue: Bharti501 Abstract: Authenticated data structures (ADSs) allow untrusted third parties to carry out operations which produce proofs that can be used to verify an operation’s output. Such data structures are challenging to develop and implement correctly. In this talk, I will talk about a library, Authentikit, that is implemented in OCaml, that generates authenticated… Read More »Logical Relations for Formally Verified Authenticated Data Structures by Chaitanya Agarwal

Speaker: Ms. Ajita Shree is a PhD student in the Department of Computer Science and Engineering at IIT Kanpur and will be joining EMBL-EBI, UK, as a postdoctoral researcher. Abstract: Recent advances in large-scale genomic assays, including single-cell and spatial transcriptomics (ST), have provided unprecedented insights into the biological mechanisms underlying development, disease, and therapeutic response.… Read More »Deep generative models for single-cell and spatial genomics by Ajita Shree

Abstract: Neuroscience and AI share a bottleneck: while one can build (artificial) or record (biological) complex networks, we struggle to explain their functional circuitry; i.e., how they compute. In this talk I use whole-brain recordings from C. elegans, a canonical neurobiological system, as a concrete testbed for “circuit interpretability.” I then introduce two complementary inference approaches… Read More »Neural Circuit Discovery via Representation and Dynamics by Savik Kinger