Venue. Bharti 501 Abstract. We present TESSERA, a pixel-wise foundation model for multi-modal (Sentinel-1/2) earth observation time series that learns robust, label-efficient embeddings.  Our goal with TESSERA is to make manipulating global satellite intelligence as easy as LLMs did for natural language! Towards this we release global, annual, 10m, pixel-wise embeddings together with open weights and… Read More »TESSERA: Programming Petabytes of Earth Observations using Foundation Models by Prof. Anil Madhavapeddy

Teams Link: MS Teams Abstract: The talk will focus on enabling autonomous actors, such as digital agents or robots, to take deliberative actions towards achieving their long horizon goals, in the face of uncertainty and dynamic events. Today, dynamic events or failures often require human intervention, system restarts, retraining, or redesign, for example, when robots… Read More »Integration of Structured Reasoning and Data-driven Learning for Acting and Planning by Dr. Sunandita Patra

Venue: SIT001 Abstract : Developing intelligent negotiation dialogue systems that promote fair and sustainable outcomes is crucial for advancing automated negotiation for social good. Since effective negotiation requires balancing cooperation and competition while maintaining respect, we propose GENTEEL-NEGOTIATOR, a polite negotiation dialogue system for tourism and e-commerce domains. We introduce NEGOCHAT, a tourism negotiation dataset, and enrich it… Read More »Genteel-Negotiator: LLM-enhanced mixture-of-expert-based reinforcement learning approach for polite negotiation dialogue by Dr. Mauajama Firdaus

Venue: Bharti 501 Abstract: Logics and proof theories play a large role in the formal study and analysis of systems, especially for formal verification. The exact shape of the syntax and proof rules involved depend heavily on the systems being modelled and verified. In this talk, we will introduce a logical syntax for communicated messages… Read More »Logical explorations for security theory by Prof. Vaishnavi Sundararajan

Venue: SIT001 Abstract: This talk overviews recent results in the theoretical foundations of adversarially robust machine learning. Modern ML classifiers can fail spectacularly when subject to specially crafted input-perturbations, called adversarial examples. On the other hand, humans are quite robust for several tasks involving vision. Motivated by this contrast, in the first part of this… Read More »Machine Learning under Adversaries: How Structure in Data Helps by Ambar Pal

Venue: Bharti-501/ MS Teams Abstract: Building artificial intelligence with meaningful real-world impact requires models that can understand and interact in both the virtual and physical world. This talk outlines four key capabilities necessary to achieve this: foundational world knowledge, alignment with human values and expectations, reasoning ability, and the capacity to self-improve. The talk begins with… Read More »Advancing Safe Multimodal Intelligence by Dr. Pritam Sarkar

Venue: Bharti501 Abstract: Over the last decade, confidential computing has emerged as an advanced security and privacy primitive that can fundamentally change the nature of trust that we place in digital services. In this talk, we will take a journey through the evolution of confidential computing and understand its current state and open problems that… Read More »State of Confidential Computing by Dr. Kapil Vaswani

Venue: Bharti501 Abstract: Memory bandwidth scaling has emerged as a critical bottleneck as compute capabilities continue to grow faster than DRAM performance. This talk examines why higher memory frequencies do not directly translate to higher delivered bandwidth, focusing on bandwidth efficiency rather than peak bandwidth. It discusses key constraints arising from DRAM organization, timing parameters,… Read More »Challenges in scaling memory bandwidth in modern SoCs by Nithya Bashyam

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