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… 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… 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… 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… Read More »Adaptive Human-Robot Interaction: Human Inspired Handovers and Robotic Failure Explanations. (An Intersection of Robotics and Machine Learning) by Dr. Parag Khanna
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… Read More »Towards Reliable LLM Reasoning: Coordinated Agents, Variance-Aware Evaluation, and Lean Inference by Prof. Akhil Arora
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,… 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… 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… 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… Read More »Rank bounds and Polynomial Identity Testing by Prof. Akash
Venue: Bharti501 Abstract: In the graph stream model of computation, an algorithm processes the edges of an n-vertex input graph in one or more sequential passes while using a memory… Read More »Constructing Long Paths in Graphs Streams by Chhaya Trehan
