Skip to content

The Landscape of Exact Round Complexity in Secure Multi-Party Computation by Prof. Arpita Patra

Bharti 501 IIT Campus, Hauz Khas, New Delhi

Venue: Bharti501 Abstract: Secure Multi-Party Computation (MPC) is a central problem in cryptography, often regarded as its holy grail. It enables a group of mutually distrusting data owners to jointly compute a function over their private inputs, while revealing nothing beyond what is inherently implied by the output itself. Round complexity is one of the… Read More »The Landscape of Exact Round Complexity in Secure Multi-Party Computation by Prof. Arpita Patra

Quantum Computing: Towards Advantage by Dhinakaran Vinayagamurthy

Bharti 501 IIT Campus, Hauz Khas, New Delhi

Venue: Bharti501 Abstract: This talk will provide a perspective on where we are at IBM Quantum in building useful quantum computers. There are two main pillars: developing a quantum computing platform that scales beyond classical computers, and discovering algorithms that leverage the strengths of this platform to deliver state-of-the-art methods for solving hard problems. The… Read More »Quantum Computing: Towards Advantage by Dhinakaran Vinayagamurthy

Learning assessment-aware brain representations from multimodal neuroimaging data by Dr. Ishaan Batta

SIT 001 Amar Nath and Shashi Khosla School of Information Technology, IIT Delhi, Hauz Khas, New Delhi 110016, India, Delhi, Delhi, India

Venue: SIT001 Online joining: https://teams.microsoft.com/meet/48853006918605?p=788lqF84K1ykLq1rtg Abstract: Standard supervised learning on neuroimaging data optimizes for diagnostic prediction while yielding feature-level importance scores that lack network-level, assessment-specific interpretability required for biomarker discovery; while unsupervised methods reduce data dimensions leading to loss of assessment-specific information. This talk presents frameworks developed towards addressing these gaps via biologically interpretable methodologies for… Read More »Learning assessment-aware brain representations from multimodal neuroimaging data by Dr. Ishaan Batta

Physical reasoning in Minds, Brains, and Machines by Dr. Pramod RT

Online joining: https://teams.microsoft.com/meet/44299089959938?p=5wwN132pf54i4sVnyN Abstract: Successful engagement with the physical world involves perceiving the underlying structure, predicting how things unfold, and planning actions accordingly. This rich understanding and reasoning about our physical environment, or 'intuitive physics', develops early in infancy and is a core component of human cognition. While it seems easy for us to understand and… Read More »Physical reasoning in Minds, Brains, and Machines by Dr. Pramod RT

Learning Hierarchical Control via Feasible Subgoal Prediction by Utsav Singh

SIT 001 Amar Nath and Shashi Khosla School of Information Technology, IIT Delhi, Hauz Khas, New Delhi 110016, India, Delhi, Delhi, India

Venue: SIT001 Abstract: Solving long-horizon tasks remains a central challenge in robotics because agents must explore efficiently, assign credit over long time scales, and act under sparse supervision. To address this, hierarchical reinforcement learning (HRL) offers a promising alternative to flat reinforcement learning (RL) by enabling a high-level policy to propose subgoals and a low-level… Read More »Learning Hierarchical Control via Feasible Subgoal Prediction by Utsav Singh

Algorithmic Behaviours in In-Context Learning by Dr. Aditya Gangrade

Bharti 501 IIT Campus, Hauz Khas, New Delhi

Venue: Bharti-501/ MS Teams Abstract: In-Context Learning (ICL) is a remarkable phenomenon whereby transformer-based LLMs can use data contained within their prompts to adapt their responses, without changing their weights. This suggests that such models encode learning mechanisms. The recent literature has used statistical learning problems as a test-bed to investigate ICL, and established that ICL can… Read More »Algorithmic Behaviours in In-Context Learning by Dr. Aditya Gangrade

Faster Queries, Smarter Execution: Factorization Meets Vectorization in Modern Data Systems

Bharti 501 IIT Campus, Hauz Khas, New Delhi

Abstract: This talk explores a novel approach to speeding up complex database queries by combining two powerful ideas: factorization and vectorized execution. Instead of processing large intermediate results (which can be slow and memory-intensive), the method represents data in a compact, factorized form that avoids redundancy. It also applies vectorized processing techniques to process data… Read More »Faster Queries, Smarter Execution: Factorization Meets Vectorization in Modern Data Systems

The Mathematics (and Ethics) of Fair Resource Allocation by Dr. Siddhartha Banerjee (Cornell University)

Bharti 501 IIT Campus, Hauz Khas, New Delhi

Abstract: In many settings, a finite supply of some public resource is allocated among people over time, without using money: a computing cluster among researchers, food among food-banks, medical supplies between hospitals, funding between non-profit projects, fellowships among admitted students, etc. The underlying aim is often to try and be ‘fair’ in these allocations…but what exactly do… Read More »The Mathematics (and Ethics) of Fair Resource Allocation by Dr. Siddhartha Banerjee (Cornell University)

Finding Equal Subset Sums in the Pigeonhole Regime by Dr. Pranjal Dutta

Bharti 501 IIT Campus, Hauz Khas, New Delhi

Abstract: The Pigeonhole Equal Subset Sum problem (PESS), introduced by Papadimitriou (1994), asks: given n positive integers bounded by M with total sum less than 2^n − 1, find two distinct subsets with the same sum. A solution is guaranteed by the pigeonhole principle, yet finding one efficiently has been a longstanding challenge. In this… Read More »Finding Equal Subset Sums in the Pigeonhole Regime by Dr. Pranjal Dutta

Cryptographic proofs for privacy and integrity by Prof. Chaya Ganesh (IISc)

Bharti 501 IIT Campus, Hauz Khas, New Delhi

Abstract: A common denominator of conventional financial systems, trusted execution environments (like SGX), blockchain technology, and ZK-rollups is the promise of computational integrity -- doing the right computation on potentially secret inputs, even when there is no trust.   In this talk, we will define computational integrity and show how one can verify the correctness of a… Read More »Cryptographic proofs for privacy and integrity by Prof. Chaya Ganesh (IISc)