Title: Multiturn Evals (and RL) for LLMs Details: 8th August, 12 pm, SIT001 Abstract: LLMs often fail at multi-step tasks requiring memory and strategic planning, a gap not captured by traditional single-turn evals. To address this, we've developed a suite of human and automated evals that stress test Gemini on these capabilities. This talk will cover… Read More »Multiturn Evals (and RL) for LLMs by Kartikeya Badola

Title: Explainable AI for Malware Analysis   Abstract: In recent years, explainable artificial intelligence (XAI) has become a critical component of ensuring transparency and trust in machine learning systems, particularly in high-stakes domains like cybersecurity. This talk will begin with a basic introduction to XAI, highlighting its importance in understanding model decisions, especially in the context of… Read More »Explainable AI for Malware Analysis by Mohd Saqib

Speaker: Akash Kumar (Ruhr University Bochum) Details: Tue, 12 Aug, 3:30 PM, SIT 001 Abstract: The widespread adoption of Artificial intelligence and Machine Learning (AI/ML) models across various fields, such as healthcare, autonomous vehicles, smart agriculture, and industrial automation, has led to a growing demand for efficient and scalable AI/ML solutions. However, as AI/ML algorithms… Read More »Enabling Energy-efficient AI Computing: Leveraging Application-specific Approximations by Akash Kumar

Title: A brief survey of quantum numerical algorithms Speaker: Prof. Pranav Singh Details: August 14 (Thursday) | 12(noon)-1 PM | Bharti 501 Abstract: Quantum Numerical Algorithms (QNA) encompass a broad class of techniques including quantum numerical linear algebra (QNLA), quantum optimization, quantum variational algorithms (QVA), quantum machine learning (QML), and Hamiltonian simulation (HS). These areas… Read More »A brief survey of quantum numerical algorithms by Pranav Singh

Abstract: An extension of the Erdős-Renyi random graph model Gn,p is the model of perturbed graphs introduced by Bohman, Frieze and Martin (Bohman, Frieze, Martin 2003). This is a special case of the randomly augmented graphs studied in this paper. An augmented graph is the union of a deterministic host graph and a random graph.… Read More »Chromatic number of randomly augmented graphs by Prof. Anand Srivastav, Kiel University

Venue: Bharti501 Abstract: In the field of distributed algorithm design, it is often standard to abstract the network as an undirected graph with the nodes as vertices and connections as edges. About the simplest process one can imagine on a network/graph is flooding: A node is in possession of a message M which has to be… Read More »Amnesiac Flooding and the curious case of a Unique Algorithm by Amitabh Trehan

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