Venue: Bharti501/MS Teams Abstract: Digital markets and platforms have shaped the algorithmic landscape into a complex ecosystem of strategic, self-interested entities. This has motivated the study and development of mechanisms or algorithms that are robust to strategic behaviour, using tools from algorithms, game theory and economics. Standard assumptions in mechanism design are too strong to capture the informational challenges… Read More »Incentives and Information in Algorithmics Economics by Dr. Divyarthi Mohan

Venue: Bharti501 Abstract: Boolean circuits provide a combinatorial representation of computation, where the number of gates (the size) represents running time, and the number of layers (the depth) capture parallel running time. They form a framework for answering fundamental questions such as P vs NP: proving that some NP problem requires circuits of superpolynomial size… Read More »Frontiers in Boolean Circuit Lower Bounds by Dr. Vaibhav Krishan

Abstract: In my talk I will describe in general how to cooperate with people from various fields of research in computer vision research projects and then describe three research projects that I was involved in in the last few years. In the first project which is the field of archaeology we studied scarabs. Scarabs are… Read More »Expanding the Frontiers of Computer Vision: From Robotics to Wildlife and Beyond by Ilan Shimshoni

Venue: Bharti501 Abstract: In many modern applications, including machine learning, robotics, distributed systems, and network design, the input, often represented as points in a finite metric space, can bve massive in size. Efficient proceesing of such data requires compact representations that preserve the essential structural properties of the underlying space. Metric sketching provides a principled… Read More »Sketching and Uncertainity: Through the Geometric Lens by Prof. Sujoy

Venue: Bharti-501/MS Teams Abstract:  As robots become more advanced, they are expected to be increasingly present among humans, engaging frequently in physical and social interactions. Among these interactions, handovers—the transfer of an object from one individual to another—play a vital role in daily life. This talk focuses on my research on enhancing human-robot interaction (HRI)… Read More »Adaptive Human-Robot Interaction: Human Inspired Handovers and Robotic Failure Explanations. (An Intersection of Robotics and Machine Learning) by Dr. Parag Khanna

Venue: Bharti-425 Abstract: The impossibility of information-theoretic or unconditional security under classical communication is already established for many two-party cryptographic primitives, including but not limited to coin flipping, bit commitment, and oblivious transfer. In this talk, we first discuss the known limits of information-theoretic security using quantum communication and propose the novel framework of stochastic… Read More »Two-party cryptography beyond computational assumptions: Some old and new results by Dr. Akshay Bansal

Venue: Bhart501 Abstract: There is a growing interest in developing artificial neural networks through the training of large models. But what lies hidden in an overparameterized neural network with random weights? If the distribution is properly scaled, such a network contains a subnetwork that can perform well without ever modifying its weights. The number of… Read More »Can a Bucket of Water Translate? Exploring the Encoding–Decoding Ability of Randomly Initialized Neuro-Symbolic Transformers by Dr. Arghya Pal

Venue: Bharti501 Abstract: A central question in algebraic complexity theory is understanding the behaviour of polynomial computation models under basic algebraic operations. While closure under addition and multiplication holds for most of the standard models like algebraic circuits, closure under factorisation remains subtle. In this talk, we will discuss a new result which proves that… Read More »Non-Closure properties in algebraic complexity by Dr. Prateek Dwivedi

Venue: Bharti501 Abstract: Polynomial Identity Testing (PIT) is the problem of checking whether a given algebraic circuit computes the zero polynomial. The PIT problem has a myriad of applications, such as algorithms for the perfect matching problem, primality testing, and learning algorithms for sparse polynomials. While there are efficient randomized algorithms for PIT, there is… Read More »Rank bounds and Polynomial Identity Testing by Prof. Akash