BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computer Science and Engineering - ECPv6.13.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://homecse.iitd.ac.in
X-WR-CALDESC:Events for Computer Science and Engineering
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Kolkata
BEGIN:STANDARD
TZOFFSETFROM:+0530
TZOFFSETTO:+0530
TZNAME:IST
DTSTART:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250609T120000
DTEND;TZID=Asia/Kolkata:20250609T130000
DTSTAMP:20260921T162549
CREATED:20250604T065636Z
LAST-MODIFIED:20250604T065657Z
UID:1639-1749470400-1749474000@homecse.iitd.ac.in
SUMMARY:Designing advanced cryptographic primitives in distributed settings
DESCRIPTION:Speaker: Dr. Anshu Yadav\, Postdoctoral Researcher\, Institute of Science and Technology\, Austria \nAbstract: In today’s world\, the rapid advancement of technology has led to the generation of vast amounts of sensitive data\, which must be accessed in a secure and controlled manner to facilitate research across various domains. Often this data\, associated with a single logical entity\, is generated in a distributed manner\, yet must be protected with the same level of security as if it were produced by a single source. Furthermore\, distributing authority among multiple entities is essential to avoid a single point of security failure. These are natural\, yet complex challenges in modern cryptography. My research focuses on exploring how advanced cryptographic primitives can provide effective solutions to such problems. In this talk\, I will begin with a brief overview of my research interests and profile. I will then focus on the themes discussed above. In particular\, I will briefly talk about a result on multi-input attribute based encryption which is a generalization of attribute-based encryption (ABE) – a novel encryption paradigm enabling expressive access control on encrypted data. In ABE\, a message m is encrypted under an attribute x\, and decryption keys are associated with a policy 𝑓. Decryption is possible if and only if 𝑓(x)=1\, unlike traditional public key encryption scheme where a single key can decrypt all ciphertexts. In the multi-input setting\, data is generated by k non-interacting parties\, with each party contributing an input (x_i\, m_i)\, so that x=(x_1\,…\,x_k) and m=(m_1\,…\,m_k). The function 𝑓 is now a k-ary predicate. The goal is for each party to independently encrypt their data as ct_1\,…\,ct_k\, and for a decryption algorithm with key sk_f to recover (m_1\,…\,m_k) if and only if 𝑓(x_1\,…\,x_k)=1. We formally defined the notion of multi-input ABE (k-ABE) and presented constructions for different k under different cryptographic hardness assumptions. I will describe the key challenges in designing cryptographic schemes in the multi-input setting and how our work addresses these challenges. If time permits\, I will also briefly talk about my work in threshold cryptography – a very useful and active field of cryptography with advanced practical applications in distributed environments (e.g.\, block chains\, distributed key generation\, etc.). In threshold cryptography\, a privileged operations—such as ‘signing’ in digital signature scheme or ‘decryption’ in an encryption scheme—is distributed among n parties\, ensuring that at least a threshold t of them are required to perform the operation. In this area\, my research has mostly focussed on threshold signatures\, where we improve the security of post-quantum threshold signature scheme. Finally\, I will conclude the talk with a discussion of my future research directions\, including open problems in the areas discussed above.
URL:https://homecse.iitd.ac.in/event/designing-advanced-cryptographic-primitives-in-distributed-settings/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250605T100000
DTEND;TZID=Asia/Kolkata:20250605T110000
DTSTAMP:20260921T162549
CREATED:20250602T072215Z
LAST-MODIFIED:20250602T094001Z
UID:1633-1749117600-1749121200@homecse.iitd.ac.in
SUMMARY:Multimodal Learning in 3D environments: Perception\, and Simulation
DESCRIPTION:Speaker: Dr. Arun Balajee Vasudevan is currently a Research Scientist at Amazon \nAbstract: \nAutonomous robots have several potential applications such as virtual assistants\, VR/AR\, gaming\, self-driving technologies\, city planning and others. To achieve autonomy\, a robot needs to see and hear the environment\, before it can converse or navigate favorably to perform a human-desired task. Precisely\, scene understanding begins with building 3D geometry\, decoding semantics\, understanding surround objects/humans\, and planning and actions. My research talk addresses these fundamental challenges independently under two broad themes: understanding geometry and multimodal perception & data-driven simulation and navigation. \nUnder geometry and perception\, I introduce the usage of several multimodalities such as the user’s gaze\, visual sensors such as cameras or range sensors (e.g. Kinect)\, and speech/language instructions from human referrals for robot perception tasks. Further\, I delve deep into the investigation of the audio sensing modality for the task using binaural sound microphones. Secondly\, regarding the geometry\, my talk addresses one of my ongoing works about the construction of digital twins of the real world with 4D reconstruction of dynamic scenes from ground visuals of a robot. \nUnder the theme of Data-driven simulation and robot navigation. Following perception\, robots must navigate and take meaningful actions in the world. This involves broadly two aspects: wayfinding and motion planning. Earlier works address wayfinding based on directional instructions\, overlooking human aspects. I briefly talk about a new paradigm that integrates principles from cognitive science with learning-based methods to tackle the challenge of language-based wayfinding for robots in real-world outdoor environments. The second aspect is motion planning for which I propose the learning of driver behavior models for MPC-based planners to build data-driven simulators. \nLong term\, I envision to bridge the above two themes to build multimodal digital twins simulators of the real-world. This potentially helps in training and testing of planners\, VR/AR setups\, gaming\, and others. Lastly\, I also cover my future research plan in the talk. \nShort Bio: \nArun Balajee Vasudevan is currently a Research Scientist at Amazon. Previously\, he was a postdoctoral researcher at Carnegie Mellon University under Prof. Deva Ramanan till March 2025. His core research interest is in Computer Vision and Multimodal Learning. He has works in multimodal (vision\, language and sounds) perception and navigation\, 3D/4D reconstruction\, Motion Planning and improving Foundational models. He published papers predominantly in vision and machine learning conferences/journals such as CVPR\, ECCV\, ICML\, IJCV\, TPAMI\, and others. He defended his PhD under Prof. Luc Van Gool at ETH Zurich. He received his MSc in Computer Science from EPFL in 2016 and an undergraduate degree in Electrical Engineering from the Indian Institute of Technology Jodhpur in the year 2014.
URL:https://homecse.iitd.ac.in/event/multimodal-learning-in-3d-environments-perception-and-simulation/
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250529T120000
DTEND;TZID=Asia/Kolkata:20250529T130000
DTSTAMP:20260921T162549
CREATED:20250526T171008Z
LAST-MODIFIED:20250526T171008Z
UID:1628-1748520000-1748523600@homecse.iitd.ac.in
SUMMARY:Giving Some Space Can Be Hard: Two New Models to Match Agents with Locations by Shivika Narang
DESCRIPTION:Title: Giving Some Space Can Be Hard: Two New Models to Match Agents with Locations \nSpeaker: Shivika Narang (UNSW Sydney)\n\nAbstract: There can be a multitude of reasons to match agents to specific locations in a given space. In this talk\, we cover two: distributing delivery orders and assigning office spaces. For both settings\, we shall try to find solutions that satisfy desirable properties and characterize instances for which they exist.\n\nWe first initiate the study of fair distribution of delivery tasks among a set of agents\, wherein delivery jobs are placed along the vertices of a graph. Our goal is to fairly distribute delivery costs (modeled as a submodular function) among a fixed set of agents while satisfying some desirable notions of economic efficiency. We characterize instances that admit fair and efficient solutions by exploiting underlying graph structures. Unfortunately\, finding these solutions proves to be NP-hard. We complement this by designing an XP algorithm (parameterized by the number of agents) that can find all fair and efficient solutions when they exist. We conclude this discussion by theoretically and experimentally analyzing the price of fairness.\n\nWe shall then introduce and analyze distance preservation games (DPGs). In DPGs\, agents express ideal distances to other agents and need to choose locations in the unit interval while preserving their ideal distances as closely as possible. We analyze the existence and computation of location profiles that are jump stable (i.e.\, no agent can benefit by moving to another location) or welfare optimal for DPGs\, respectively.\n\nJoint Work with Hadi Hosseini and Tomasz Wąs (Fair Delivery) and Haris Aziz\, Hau Chan\, Patrick Lederer\, and Toby Walsh (DPGs).\n\nSpeaker Bio: Shivika Narang is a postdoctoral fellow at UNSW Sydney. Previously\, she was a postdoc at Simons Laufer Mathematical Sciences Institute\, Berkeley (SLMath)\, and completed her PhD from IISc Bengaluru. Her work is currently focused on fairness and efficiency in computational social choice\, especially matching and allocation problems.
URL:https://homecse.iitd.ac.in/event/giving-some-space-can-be-hard-two-new-models-to-match-agents-with-locations-by-shivika-narang/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250528T120000
DTEND;TZID=Asia/Kolkata:20250528T130000
DTSTAMP:20260921T162549
CREATED:20250518T062803Z
LAST-MODIFIED:20250526T171039Z
UID:1592-1748433600-1748437200@homecse.iitd.ac.in
SUMMARY:Enhancing Safety and Ethical Alignment in Large Language Models by Rima Hazra
DESCRIPTION:Speaker:  Dr. Rima Hazra \n\n\nAbstract: In this talk\, we explore cutting-edge strategies for enhancing the safety and ethical alignment of large language models (LLMs). The research spans various approaches\, including red teaming and jailbreaking techniques\, which assess and improve model robustness and ethical integrity. We delve into how instruction-centric responses\, when generated by LLMs\, can increase the likelihood of unethical output\, thereby highlighting the vulnerabilities of these AI systems. Through the introduction of frameworks like ‘Safety Arithmetic’ and ‘SafeInfer\,’ we demonstrate methods to mitigate risks by manipulating model parameters and decoding-time behaviors to foster safer interactions. The discussions also emphasize the importance of safety alignment strategies and the challenges posed by integrating new knowledge through model edits\, which can paradoxically destabilize ethical guidelines. This comprehensive examination not only sheds light on the current vulnerabilities of LLMs but also presents a pathway toward more reliable and ethically aligned AI implementations. \n\nBio: Dr. Rima Hazra is a senior postdoc at Eindhoven University of Technology (TU\e)\, Netherlands. Earlier she was a Postdoctoral Researcher at the Singapore University of Technology and Design\, working in the area of AI safety alignment\, natural language processing\, and LLM reasoning. She earned her Ph.D. from the Indian Institute of Technology\, Kharagpur\, where she explored the area of Information retrieval\, NLP and graph learning. With experience in information retrieval\, NLP and graph learning\, Dr. Hazra has published several papers in prestigious CORE A* and A conferences such as AAAI\, ACL\, EMNLP\, NAACL\, ECIR\, ECMLP PKDD and JCDL. She has also received the prestigious Microsoft Academic Partnership Grant (MAPG) and the PaliGemma Academic Program award from Google for her work in AI safety alignment.
URL:https://homecse.iitd.ac.in/event/enhancing-safety-and-ethical-alignment-in-large-language-models-by-dr-rima-hazra/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250523T120000
DTEND;TZID=Asia/Kolkata:20250523T130000
DTSTAMP:20260921T162549
CREATED:20250519T054519Z
LAST-MODIFIED:20250520T083950Z
UID:1599-1748001600-1748005200@homecse.iitd.ac.in
SUMMARY:Next-Generation AI-Enhanced Stream Processing
DESCRIPTION:Speaker: Dr. Manisha Luthra Agnihotri is the Deputy Head of the German Research Center for Artificial Intelligence (DFKI) in Darmstadt. \nIt is an online talk. Please write to the CSE office to get the Teams link. \nAbstract: In this talk\, I will outline my vision for next-generation\, AI-enhanced data management systems through the lens of learned stream processing. Today’s stream processing platforms demand extensive manual tuning to optimize critical decisions such as query plan selection\, operator placement\, and parallelism. My vision eliminates these labor-intensive processes by leveraging zero-shot learning to automatically derive optimal configurations\, thereby radically enhancing performance and generalisability. A key contribution of my work is a novel learned operator placement optimization provided by a novel cost model that forecasts the execution costs of streaming queries on heterogeneous hardware. Particularly in IoT environments—where diverse hardware and network conditions are the norm—our approach employs graph neural networks to predict query costs accurately\, even for unseen placements and query patterns. This approach not only overcomes the generalizability limitations of existing methods but also paves the way for more robust and adaptive cost-based optimizations for stream processing systems. I will also discuss my future research directions\, focusing on extending these AI-driven techniques to multi-modal stream processing. This work aims to redefine data management by creating systems that adapt to evolving computational needs for multiple modalities\, ultimately setting new standards for understanding data inputs and autonomy in stream processing. \nBio: Manisha Luthra Agnihotri is the Deputy Head of the German Research Center for Artificial Intelligence (DFKI) in Darmstadt and a Research Group Leader at TU Darmstadt. She co-leads the Systems AI for Decision Support group with focus of research on learned system optimizations and multimodal data management. Her work sits at the dynamic intersection of machine learning\, data systems\, and hardware\, with major contributions in learned cost-based optimization and the acceleration of query workloads via GPU and RDMA technologies. \nThroughout her academic journey\, Manisha has received several prestigious awards\, including the German national Best Ph.D. Thesis award from the GI/ITG special interest group on Communication and Distributed Systems (KuVS)\, the Athena Young Investigator Award\, the Anita Borg Faculty Scholarship\, the Zeiss Top Dissertation Scholarship\, and mentoring and networking accolades from the German Research Foundation (DFG). Her expertise has led her to speak at top-tier institutions such as the University of Toronto\, and she has presented her innovative research at premier conferences like SIGMOD\, VLDB\, ICDE\, and EDBT. Manisha also actively contributes to the academic community as a program committee member for major data management conferences\, including VLDB\, SIGMOD\, and EuroSys.
URL:https://homecse.iitd.ac.in/event/next-generation-ai-enhanced-stream-processing/
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250514T100000
DTEND;TZID=Asia/Kolkata:20250514T110000
DTSTAMP:20260921T162549
CREATED:20250512T144512Z
LAST-MODIFIED:20250512T144600Z
UID:1589-1747216800-1747220400@homecse.iitd.ac.in
SUMMARY:Synthesis and Arithmetic of Quantum Circuits
DESCRIPTION:Speaker: Amolak Kalra (https://sites.google.com/view/amolakratankalra/home) \nAbstract: Efficient decomposition of a unitary operator U using words from a universal gate set G is a fundamental problem in quantum computing. The process by which this is achieved is called circuit synthesis. This problem arises naturally in the context of quantum circuit\ncompilation. In this talk\, I will introduce this problem and explain how one can use tools from number theory to solve it. I will then explain some recent results that build on this connection.
URL:https://homecse.iitd.ac.in/event/synthesis-and-arithmetic-of-quantum-circuits/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250508T140000
DTEND;TZID=Asia/Kolkata:20250508T150000
DTSTAMP:20260921T162549
CREATED:20250507T062717Z
LAST-MODIFIED:20250507T063432Z
UID:1581-1746712800-1746716400@homecse.iitd.ac.in
SUMMARY:Trading Prophets: How to trade multiple stocks optimally
DESCRIPTION:Speaker: Surbhi Rajput\, MSR Student\, CSE Dept.\, IIT Delhi \nAbstract:\n\nIn the (single stock) \emph{trading prophet} problem formulated by Correa et\nal.\ [2023]\, an online algorithm observes a sequence of prices of a stock.\nAt each step\, the algorithm can either buy the stock by paying the current\nprice if it doesn't already hold the stock\, or it can sell the currently\nheld stock and collect the current price as a reward. The goal of the\nalgorithm is to maximize its overall profit. Correa et al.\ showed that the\noptimal competitive ratio for this problem is $\nicefrac{1}{2}$ when the\nstock prices are identically and independently distributed.\nIn this talk\, I will discuss the simplifications and generalizations of\nCorrea et al.'s analysis\, which led us to generalize the model by allowing\nthe algorithm to trade multiple stocks. First\, we generalize the model to\n$(k\,\ell\, \ell')$-\textsc{Trading Prophet Problem}\, wherein there are $k$\nstocks in the market\, and the online algorithm can hold up to $\ell$ stocks\nat any time\, where $\ell \leq k$. The online algorithm competes against an\noffline algorithm that can hold at most $\ell' \leq \ell$ stocks at any\ntime. Under the assumption that prices of different stocks are independent\,\nwe show that\, for any $\ell$\, $\ell'$\, and $k$\, the optimal competitive\nratio of $(k\,\ell\, \ell')$-\textsc{Trading Prophet Problem} is\n$\min\left\{\frac{1}{2}\,\frac{\ell}{k}\right\}$.\nWe further generalize it to $\mathcal{M}$-\textsc{Trading Prophet Problem}\nover a matroid $\mathcal{M}$ on the set of $k$ stocks\, wherein the stock\nprices at any given time are possibly correlated (but are independent across\ntime). The algorithm is allowed to hold only a feasible subset of stocks at\nany time. We prove a tight bound of $\frac{1}{1+d}$ on the competitive ratio\nof the $\mathcal{M}$-\textsc{Trading Prophet Problem}\, where $d$ is the\n\textit{density} of the matroid.\nWe then consider the non-i.i.d.\ random order setting over a matroid\,\nwherein stock prices drawn independently from $n$ potentially different\ndistributions are presented in a uniformly random order. In this setting\, we\nachieve a competitive ratio of at least $\frac{1}{1+d} - \mathcal{O}\n\left(\frac{1}{n} \right)$\, where $d$ is the density of the matroid\,\nmatching the hardness result for i.i.d.\ instances as $n$ approaches\n$\infty$.\nOur analysis of the above problems is based on the following key insights.\nFirst\, any algorithm can be simulated by one that\, on each time step\, sells\n\emph{all} its currently held stocks before buying a suitable subset of\nstocks. Second\, we prove that the general problem reduces to a restriction\nwhere the expected price of every stock is zero.\nThird\, we reduce the problem in the random order non-i.i.d.\ setting to the\ni.i.d. setting by leveraging the fact that the outcome of sampling two\nobjects without replacement from a large set is almost identically\ndistributed as the outcome of sampling with replacement.
URL:https://homecse.iitd.ac.in/event/trading-prophets-how-to-trade-multiple-stocks-optimally/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250506T120000
DTEND;TZID=Asia/Kolkata:20250506T130000
DTSTAMP:20260921T162549
CREATED:20250503T125437Z
LAST-MODIFIED:20250503T125437Z
UID:1572-1746532800-1746536400@homecse.iitd.ac.in
SUMMARY:Power and limitations of quantum computation and quantum cryptography by Dr. Srijita Kundu
DESCRIPTION:Title: Power and limitations of quantum computation and quantum cryptography \nSpeaker: Dr. Srijita Kundu \nAbstract: Quantum computers are approaching practical viability\, and quantum cryptography is already being deployed for secure communication. Understanding the capabilities and limitations of these technologies is crucial for their effective use. \nMy research lies at the intersection of quantum complexity theory and cryptography. I focus on proving what quantum computation can and cannot do in concrete models such as query and communication complexity. In this talk\, I will share results in both directions:\n1. I will talk about direct product theorems for quantum communication complexity\, which are a useful lower bound technique for quantum communication protocols.\n2. I will talk about quantum proofs being more powerful than classical proofs in query complexity.\nAdditionally\, I will talk about quantum protocols for novel cryptographic tasks such as certified deletion and uncloneable encryption\, whose security can be proved using the communication direct product theorems. \nShort Bio: Srijita Kundu completed her PhD at the Centre for Quantum Technologies in the National University of Singapore in 2021\, under the supervision of Prof. Rahul Jain. Since 2022\, she has been a postdoctoral researcher at the Institute for Quantum Computing in the University of Waterloo. She is interested in quantum complexity theory and cryptography.
URL:https://homecse.iitd.ac.in/event/power-and-limitations-of-quantum-computation-and-quantum-cryptography-by-dr-srijita-kundu/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250501T110000
DTEND;TZID=Asia/Kolkata:20250501T120000
DTSTAMP:20260921T162549
CREATED:20250425T023119Z
LAST-MODIFIED:20250427T060150Z
UID:1521-1746097200-1746100800@homecse.iitd.ac.in
SUMMARY:Certifying Large Language Models with LLMCert
DESCRIPTION:Speaker: Isha Chaudhary \nAbstract: Large Language Models (LLMs) are increasingly deployed in critical systems\, e.g.\, healthcare and finance and can produce incorrect and biased responses. These can cause huge social and economic losses to the deploying agencies and their clients. Conventional studies are\, however\, insufficient to thoroughly evaluate LLMs\, as they cannot scale to a large number of possible inputs and provide no formal guarantees. Therefore\, we develop and present the first family of LLM certification frameworks\, LLMCert\, consisting of certifiers providing formal probabilistic guarantees for desirable properties such as correct LLM reasoning and fairness on prohibitively large distributions of prompts. Our certificates are quantitative — they consist of provably high-confidence\, tight bounds on the probability of desirable LLM responses for random prompts sampled from a distribution. We design and certify novel specifications for bias and knowledge comprehension in individual certifiers – LLMCert-B (https://certifyllm.com/) and LLMCert-C (https://arxiv.org/abs/2402.15929)\, respectively. We illustrate bias certification for distributions of prompts created by applying varying prefixes drawn from a prefix distribution to a given set of prompts. We consider prefix distributions for random token sequences\, mixtures of manual jailbreaks\, and jailbreaks in the LLM’s embedding space to certify bias. We obtain non-trivial certified bounds on the probability of unbiased responses of SOTA LLMs\, exposing their vulnerabilities over distributions of prompts generated from computationally inexpensive prefix distributions. \nFor knowledge comprehension certification\, we design and use novel distributions of knowledge comprehension prompts with natural noise\, using knowledge graphs. We certify SOTA LLMs over specifications arising in precision medicine and general question-answering. We show previously undiscovered vulnerabilities of SOTA LLMs owing to natural noise in prompts. We also establish the first performance hierarchies with formal guarantees among SOTA LLMs\, pertaining to question-answering in precision medicine. \n  \nBio: Isha Chaudhary is a third-year Ph.D. candidate at the Siebel School of Computing and Data Science\, University of Illinois Urbana-Champaign\, advised by Prof. Gagandeep Singh. Her research interest is broadly in trustworthy foundation models and neural networks for computer systems. She graduated from a B.Tech. in Electrical Engineering from IIT Delhi in 2022. For details about her work\, please check out: https://ishachaudhary.web.illinois.edu/.
URL:https://homecse.iitd.ac.in/event/certifying-large-language-models-with-llmcert/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250429T150000
DTEND;TZID=Asia/Kolkata:20250429T160000
DTSTAMP:20260921T162549
CREATED:20250425T023346Z
LAST-MODIFIED:20250427T060123Z
UID:1523-1745938800-1745942400@homecse.iitd.ac.in
SUMMARY:Computation-In-Memory based Edge-AI for Healthcare: A Cross-Layer Approach
DESCRIPTION:Speaker: Sumit Diware \nAbstract: Recent advancements in artificial intelligence (AI) have driven the emergence of real-world cognitive products and services\, which rely on neural networks to perform complex tasks. Edge computing for AI (edge-AI) combines data sources with local hardware that executes neural network computations\, to improve the response latency\, data privacy/security\, and service reliability. Computation-in-memory (CIM) offers an energy-efficient and compact alternative to conventional neural network hardware for edge-AI\, by enabling in-situ data processing with emerging memory technologies called memristors. Healthcare stands out as a key domain for CIM\, due to its critical impact on society and the need for energy-efficient\, compact hardware in healthcare edge applications. However\, developing AI models for healthcare that are effective\, accurate\, and can fully reap CIM benefits remains a significant challenge. Moreover\, memristors exhibit non-idealities that lead to errors during hardware execution. In this talk\, I will describe our cross-layer research approach and contributions towards addressing these challenges. We first create effective\, accurate\, and CIM-oriented AI models for two healthcare applications: electrocardiogram (ECG) classification and diabetic retinopathy screening. We then devise mitigation strategies against memristor non-idealities and develop a system-on-chip tapeout as a holistic solution that covers the entire abstraction layer stack from application to fabrication. \nShort Bio: Sumit Diware obtained Ph.D. from the Computer Engineering Group at Delft University of Technology (TU Delft)\, Netherlands\, and M.Tech. in VLSI Design Tools and Technology (VDTT) from IIT Delhi. His research focuses on artificial intelligence (AI) processing architectures\, with expertise in computation-in-memory\, neuromorphic computing\, emerging memory technologies\, hardware-algorithm co-design\, and system-on-chip (SoC) design/tapeout. He has authored/co-authored several publications in leading conferences such as DATE\, DAC\, and ICCAD\, as well as IEEE journals including TBioCAS and TETCI. For his doctoral work\, he recently received the European Design & Automation Association (EDAA) Outstanding Dissertation Award at DATE 2025 conference. Before his Ph.D.\, Sumit was a research assistant at the Karlsruhe Institute of Technology (KIT)\, Germany\, where he worked on multicore SoC architectures. Prior to that\, he worked at Qualcomm India as a part of IIT Delhi’s VDTT program\, focusing on SoC power management architecture.
URL:https://homecse.iitd.ac.in/event/computation-in-memory-based-edge-ai-for-healthcare-a-cross-layer-approach/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250428T120000
DTEND;TZID=Asia/Kolkata:20250428T130000
DTSTAMP:20260921T162549
CREATED:20250425T023615Z
LAST-MODIFIED:20250427T060100Z
UID:1526-1745841600-1745845200@homecse.iitd.ac.in
SUMMARY:Algebra and co-  ..in the theory of programming
DESCRIPTION:Speaker: Prof. Sanjiva Prasad \nThe talk explores a few elementary concepts from abstract algebra that (should) inform our data-centric development of common programs and data types\, but are often elided in most textbook treatments.  Included are sets\, monoids\, boolean algebras\, semirings and Kleene algebras\, structure-preserving maps and homomorphisms\, and notions of co-induction.  The talk is intended to be accessible to a general audience. \nThe talk will begin at 12:00 PM\, with refreshments served at 11:50 AM
URL:https://homecse.iitd.ac.in/event/algebra-and-co-in-the-theory-of-programming/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250425T120000
DTEND;TZID=Asia/Kolkata:20250425T170000
DTSTAMP:20260921T162549
CREATED:20250421T081314Z
LAST-MODIFIED:20250425T112605Z
UID:1492-1745582400-1745600400@homecse.iitd.ac.in
SUMMARY:How many matches does it take to find a champion?
DESCRIPTION:Speaker: Neeldhara Misra\n\nAbstract: Suppose there are n horses and we have a track with k lanes. If we pick k horses to run a race\, a linear ordering is established among the chosen horses\, based only on the finishing order (race time is not considered). How many races do we need to organize to determine the best two horses? How many races are necessary to reveal the full ranking?\n \nTo address this question\, we might assume that there is an overall linear ordering among all horses and that the outcomes of the races are always consistent with this global linear order. However\, this may not be true in real-world tournaments: actual outcomes may deviate from our estimate of the global order. In this talk\, we will discuss some developments around questions of determining the “top k” elements in the general setting of tournaments and the special situation when we are promised that comparisons are consistent with an underlying linear order.\n \nThe results presented are drawn from the following papers:\n \nVariations on the Tournament Problem\nFabrizio Luccio\, Linda Pagli\, Nicola Santoro\nFUN 2024\n \nQuery Complexity of Tournament Solutions\nArnab Maiti\, Palash Dey\nTCS 2024\n \nShort bio: Neeldhara Misra is a Smt. Amba and Sri. V S Sastry Chair Associate Professor of Computer Science and Engineering at the Indian Institute of Technology\, Gandhinagar. She completed her PhD from the Institute for Mathematical Sciences in 2012 in Theoretical Computer Science. Her research interests include the design and analysis of algorithms and computational social choice. She is also interested in visualizations and other methods to communicate computational thinking at an elementary level. She also enjoys learning about new card tricks\, especially self-working ones — even though she can’t remember any!\nhttps://www.neeldhara.com/
URL:https://homecse.iitd.ac.in/event/how-many-matches-does-it-take-to-find-a-champion/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250424T120000
DTEND;TZID=Asia/Kolkata:20250424T170000
DTSTAMP:20260921T162549
CREATED:20250421T130049Z
LAST-MODIFIED:20250421T130049Z
UID:1494-1745496000-1745514000@homecse.iitd.ac.in
SUMMARY:Computing Lindahl Equilibrium for Public Goods with and without Funding Caps
DESCRIPTION:Speaker: Dominik Peters \n\nAbstract: Lindahl equilibrium is a solution concept for allocating a fixed budget across several divisible public goods. It always lies in the core\, meaning that the equilibrium allocation satisfies desirable stability and proportional fairness properties. We consider a model where agents have separable linear utility functions over the public goods\, and the output assigns to each good an amount of spending\, summing to at most the available budget.\n\nIn the uncapped setting\, each of the public goods can absorb any amount of funding. In this case\, it is known that Lindahl equilibrium is equivalent to maximizing Nash social welfare. We introduce a new convex programming formulation for computing this solution and show that it is related to Nash welfare maximization through duality and reformulation. We then show that running mirror descent on our new formulation gives rise to a proportional response dynamics\, which converges rapidly to an equilibrium. Our new formulation has similarities to Shmyrev’s convex program for Fisher market equilibrium.\n \nIn the capped setting\, each public good has an upper bound on the amount of funding it can receive. In this setting\, existence of Lindahl equilibrium was only known via fixed-point arguments. The existence of an efficient algorithm computing one has been a long-standing open question. We prove that our new convex program continues to work when the cap constraints are added\, and its optimal solutions are Lindahl equilibria. Thus\, we establish that Lindahl equilibrium can be efficiently computed in the capped setting.\n \nShort bio: Dominik Peters is a CNRS researcher at Université Paris Dauphine – PSL\, working on computational social choice. After postdocs with Ariel Procaccia (Harvard) and Nisarg Shah (Toronto)\, he is studying topics in voting theory with a focus on proportional representation and participatory budgeting\, as well as fair division problems. With his collaborators\, he has proposed the Method of Equal Shares\, a voting method that is now used by several cities across Europe to allow their citizens to influence how the city government spends its budget.\nhttps://dominik-peters.de/
URL:https://homecse.iitd.ac.in/event/computing-lindahl-equilibrium-for-public-goods-with-and-without-funding-caps/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250422T120000
DTEND;TZID=Asia/Kolkata:20250422T130000
DTSTAMP:20260921T162549
CREATED:20250416T065439Z
LAST-MODIFIED:20250422T032206Z
UID:1490-1745323200-1745326800@homecse.iitd.ac.in
SUMMARY:Mathematics and Programming: The Past\, Present and Future A Personal Perspective
DESCRIPTION:Speaker: Dr. Pritam Choudhury \nAbstract: In his article „Constructive Mathematics and Computer Programming‟\, the renowned logician and type-theorist\, Per Martin-Löf notes\, “If programming is understood not as the writing of instructions for this or that computing machine but as the design of methods of computation that it is the computer‟s duty to execute (a difference that Dijkstra has referred to as the difference between computer science and computing science)\, then it no longer seems possible to distinguish the discipline of programming from constructive mathematics.”\nIndeed\, mathematics (constructive) and programming can be viewed as two sides of the same coin via the celebrated Curry-Howard or Propositions-as-Types Correspondence. This correspondence has been of great value to both mathematics and programming. On one side\, it enabled mechanization of mathematics and consequently\, production of machine-certified proofs of mathematical theorems. On the other side\, it provided a solid mathematical foundation for programming languages and guided their development.\nIn this talk\, I shall first introduce the Curry-Howard Correspondence through examples and then present some of its technical details. We shall start with a key result\, which states that the Simply-Typed λ-calculus\, a foundational functional programming language\, is nothing but intuitionistic/constructive propositional logic. Thereafter\, I shall touch upon multiple other similar correspondences\, all manifestations of the overarching Curry-Howard Correspondence\, and discuss how these correspondences guided the development of programming languages. Then\, I shall present some of my research work on extending the Curry-Howard Correspondence in the area of dependency analysis over the Simply-Typed λ- calculus (https://dl.acm.org/doi/10.1145/3563335). Note that dependency analysis is vital to several applications\, such as\, language-based security\, multi-stage compilation\, code optimization\, etc. Finally\, I shall wind up the talk discussing some of my ongoing and future research projects that leverage the close connection between mathematics and programming for their mutual benefit. \nBio: Pritam Choudhury is a researcher in type systems and programming language design. His research focuses on graded type systems and their applications. In his doctoral dissertation\, he used graded type systems to analyze linearity and dependency in programming languages. Linearity and dependency analyses are particularly useful in memory management\, language-based security\, multi-stage compilation and code optimization. Pritam completed his PhD at University of Pennsylvania in August 2023. After graduating from UPenn\, he taught as a Visiting Assistant Professor of Computer Science at Haverford College for a year. Before joining UPenn\, he worked on formal verification at University of Cambridge. Pritam received his M.Phil. in Advanced Computer Science from University of Cambridge in 2015 and his B.Tech. in Electrical Engineering from IIT Roorkee in 2014.
URL:https://homecse.iitd.ac.in/event/mathematics-and-programming-the-past-present-and-future-a-personal-perspective/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250422T110000
DTEND;TZID=Asia/Kolkata:20250422T120000
DTSTAMP:20260921T162549
CREATED:20250416T031907Z
LAST-MODIFIED:20250416T031907Z
UID:1487-1745319600-1745323200@homecse.iitd.ac.in
SUMMARY:Impact Assessment of Natural Resource Management (NRM) Interventions in India
DESCRIPTION:Speaker: Ramneek Kaur\, post-doctoral fellow\, CSE\, IIT Delhi \nAbstract: With over 70% of India’s rural population dependent on agriculture\, and 82% of farmers being small and marginal\, the availability of water for irrigation is critical to ensuring sustainable rural livelihoods. Government welfare schemes such as the Mahatma Gandhi National Rural Employment Guarantee Act (MGNREGA) play a pivotal role in this context by funding the creation of Natural Resource Management (NRM) assets in rural areas for the conservation and sustainable use of water. In this talk\, I will present methods and insights from our ongoing research on evaluating the impact of NRM structures built under MGNREGA – one of the world’s largest demand-driven employment and asset creation programs. The scheme supports the creation of assets under different NRM categories such as bunds\, check dams and trenches for groundwater recharge\, and farm ponds and wells for protective irrigation. We assess the effectiveness of these interventions at both the site-level and the broader landscape-level\, using satellite imagery and other secondary data sources. In our work on impact assessment of farm ponds\, we evaluate the impact of farm ponds in their surrounding cropping areas\, on the seasonal agricultural productivity and drought resilience across the Agro-ecological Zones (AEZs) of India\, by employing the Difference-in-Differences (DiD) method and the Double ML method. Our findings show that the average impact of farm ponds is shaped by contextual AEZ-level factors such as agricultural suitability\, private borewell investments\, and canal infrastructure. Building on this\, we are currently evaluating the impact of check dams using similar techniques. At the landscape scale\, we are developing a system dynamics based framework to capture the cumulative effects of multiple MGNREGA interventions and water bodies. This approach helps model causal pathways and interdependencies between various subsystems using data-driven models\, allowing for a deeper understanding of how NRM activities influence water security and agricultural sustainability. Our methods hold potential for broader applications\, including assessing the impact of NRM efforts on forest conservation\, carbon and water credits\, and other ecosystem services. \n  \nSpeaker bio: Dr. Ramneek Kaur is a postdoctoral fellow with the ACT4D research group at IIT Delhi\, where she has been working for the past two years on using technology to strengthen resilient rural livelihoods. Her research focuses on the impact evaluation of Natural Resource Management (NRM) interventions\, particularly the construction and maintenance of water structures in rural areas. Her work leverages satellite imagery and computational methods to evaluate the effectiveness of these interventions in enhancing agricultural productivity and drought resilience\, for the broader aim of informing strategies for sustainable agricultural practices. Prior to this\, she completed her Ph.D. from IIIT-Delhi in 2022\, where her research focused on developing navigation and task allocation algorithms to promote sustainability in urban transportation systems. Her broader research interests lie in the use of ICT for social development\, with a focus on leveraging computational methods to drive sustainability and equity in both rural and urban contexts.
URL:https://homecse.iitd.ac.in/event/impact-assessment-of-natural-resource-management-nrm-interventions-in-india/
LOCATION:SIT 113\, Amar Nath and Shashi Khosla School of Information Technology\, Indian Institute of Technology\, Delhi\, Hauz Khas\, New Delhi\, Delhi\, 110016\, India
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250408T160000
DTEND;TZID=Asia/Kolkata:20250408T170000
DTSTAMP:20260921T162549
CREATED:20250402T225401Z
LAST-MODIFIED:20250402T225401Z
UID:1483-1744128000-1744131600@homecse.iitd.ac.in
SUMMARY:How Do We Build Responsible AI? Towards Fair and Participatory AI Designs
DESCRIPTION:Speaker: Vijay Keswani (Duke University)\nhttps://vijaykeswani.github.io/ \nDetails: Apr 8th (Tue) | 4 PM | Online [Teams Link] \nAbstract: As the capabilities of AI have expanded\, reports of societal and personal harms related to its use have surged. Examples range from systemic biases in AI tools used in healthcare and social media to stereotype propagation in AI-based search and summarization models. In this talk\, I will discuss some of my work on methods to audit and mitigate these biases in AI systems. Building unbiased AI tools presents technical challenges (e.g.\, constrained sampling and optimization) and practical challenges (e.g.\, limited group information in real-world settings). Through the use case of search and summarization\, I will highlight the challenges of addressing representational biases in search results and our socio-technical approaches to mitigate them. In addition to fairness\, this talk will emphasize building participatory mechanisms. I will demonstrate how user and stakeholder participation can serve as an effective mechanism to discover and address social harms due to AI and demonstrate its effectiveness in auditing and mitigating biases in image search results. \nBio: Vijay Keswani is a Postdoctoral Associate at Duke University. His research interests center around community-focused AI development and the ethics of data and technology. His work leverages tools from various disciplines to build robust AI models\, combining computational and statistical learning mechanisms with methods from law\, philosophy\, psychology\, and economics. He received his PhD from Yale University in 2023. While at Yale\, he was also a Resident Fellow at the Information Society Project during 2022-2023 and a 2022 Policy Fellow at the Yale Institute for Social and Policy Studies
URL:https://homecse.iitd.ac.in/event/how-do-we-build-responsible-ai-towards-fair-and-participatory-ai-designs/
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250403T110000
DTEND;TZID=Asia/Kolkata:20250403T170000
DTSTAMP:20260921T162549
CREATED:20250320T051935Z
LAST-MODIFIED:20250320T051935Z
UID:1465-1743678000-1743699600@homecse.iitd.ac.in
SUMMARY:Regulations\, International Standardizations and Technologies to Realize "Trusted AI"
DESCRIPTION:Abstract: With the recent rise of AI businesses in all industries around the world\, AI can also be used to make important decisions for society. However\, it is also true that using AI incorrectly or without understanding the characteristics of AI can have a negative impact on society due to concerns about its impact on human rights and social values. There is a need for wisdom and knowledge to properly utilize these new technologies\, and many countries have now developed principles and guidelines for the use of AI.\n\nThis presentation summarizes the current activities of regulations\, ISO International\nStandardization and technologies related to the realization of trusted AI. It will focus on trends and outlines of International Standards related to AI regulations and introduce some technologies for realizing trusted AI. In addition\, this presentation also provides an overview of the activities in international standards organization – ISO/IEC JTC1/SC42\, as well as introducing other important topics of AI standardization activities.\n\nBio: Yuchang Cheng is a senior research manager of AI laboratory at Fujitsu Limited. His Fujitsu responsibilities are leading the standardization activities of AI\, as well as leading the research of AI governance. In addition\, he is a delegate of Japan national body in ISO/IEC JTC 1/SC 42\, as well as the expert of SC 42’s working groups. He is leading the development of the following international standard projects as the project editor:\n\n\nISO/IEC TR 24030 (Artificial Intelligence (AI) – Use cases);\nISO/IEC 5338 (AI system life cycle processes;\nISO/IEC 25589 (Framework for human-machine teaming)
URL:https://homecse.iitd.ac.in/event/regulations-international-standardizations-and-technologies-to-realize-trusted-ai/
LOCATION:SIT 001\, Amar Nath and Shashi Khosla School of Information Technology\, IIT Delhi\, Hauz Khas\, New Delhi 110016\, India\, Delhi\, Delhi\, 110016\, India
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250328T120000
DTEND;TZID=Asia/Kolkata:20250328T170000
DTSTAMP:20260921T162549
CREATED:20250327T132705Z
LAST-MODIFIED:20250327T132705Z
UID:1468-1743163200-1743181200@homecse.iitd.ac.in
SUMMARY:An amazing structure for representing all Steiner mincuts of a graph
DESCRIPTION:Speaker: Surender Baswana\, IIT Kanpur \n  \nAbstract: \nMincuts are one of the most well-researched topics in algorithms. In recent years\, there has been phenomenal research on algorithms for computing (s\, t)-mincuts and global mincuts. On the other hand\, the data structural and graph theoretical aspects of mincuts have also been well-researched in the last 50 years\, though they are not as widely known despite being very fundamental and seminal. \n\nWe shall begin with a light discussion of the following 2 classical results. (1) There is a directed acyclic graph that stores all (s\,t)-mincuts of a graph. (2) There is a tree-like graph that stores all global mincuts of a graph.  We shall then discuss a structure that stores Steiner mincuts – generalization of (s\,t)-mincuts and global mincuts. This structure\, designed by Dinitz and Vainshtein is amazingly elegant and beautiful. We shall discuss this structure along with new and much simpler proofs of its properties. \n\nNote: Anyone with basic knowledge of algorithms and elementary graph theory should be able to follow most of the talk. \n\nBiography of the Speaker: \nSurender Baswana is the Tapas Misra Memorial Chair Professor at the Department of Computer Science and Engineering at IIT Kanpur. He did BTech\, MTech\, and PhD from IIT Delhi\, and was a postdoctoral researcher at the Max Planck Institute for Computer Science. He has been a faculty member at IIT Kanpur since 2006. His research area is the design and analysis of algorithms.
URL:https://homecse.iitd.ac.in/event/an-amazing-structure-for-representing-all-steiner-mincuts-of-a-graph/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250326T120000
DTEND;TZID=Asia/Kolkata:20250326T130000
DTSTAMP:20260921T162549
CREATED:20250312T025840Z
LAST-MODIFIED:20250312T025840Z
UID:1454-1742990400-1742994000@homecse.iitd.ac.in
SUMMARY:Visual Discovery for Science
DESCRIPTION:Abstract: From social media all the way to satellite images\, we are capturing visual data at an unprecedented scale. These images tell a story about our planet. With advances in automatic recognition\, we can build a collective understanding of world-scale events as recorded through visual media. In this talk\, we will first explore the idea of automatic discovery from visual data in a relatively simpler domain of fashion data from social media images\, where powerful recognition models already exist. I will then discuss my work on an annotation-efficient method for building a multimodal vision-language model in the scientific domain of remote sensing where language annotations are sparse. Finally\, I will present my recent research on building interpretable models for scientific discovery using such black-box vision language models. \n\nBio: Utkarsh Mall is a postdoctoral research scientist in Computer Science at Columbia University. His research also focuses on building interpretable\, reliable\, and data-efficient methods to make novel scientific discoveries from visual data. He has also applied this research in various areas such as agriculture\, anthropology\, archaeology\, urban planning\, public health\, climate science\, etc. Before joining Columbia\, he earned his PhD from Cornell University\, where he worked on building label-efficient foundation models for scientific domains and leveraging them for unsupervised discoveries. He also co-organizes the CVPR workshop: Computer Vision for Science (CV4Science). His doctoral research was selected for the WACV 2022 and CVPR 2023 Doctoral Consortium. \n  \nonline: https://teams.microsoft.com/l/meetup-join/19%3a178c8aaec5e040879a9a053743b825cd%40thread.tacv2/1741628666733?context=%7b%22Tid%22%3a%22624d5c4b-45c5-4122-8cd0-44f0f84e945d%22%2c%22Oid%22%3a%222ac13d43-5ced-4b3c-a68a-5b66063407a9%22%7d
URL:https://homecse.iitd.ac.in/event/visual-discovery-for-science/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250325T120000
DTEND;TZID=Asia/Kolkata:20250325T170000
DTSTAMP:20260921T162549
CREATED:20250317T044524Z
LAST-MODIFIED:20250317T044524Z
UID:1461-1742904000-1742922000@homecse.iitd.ac.in
SUMMARY:The Case for Decentralised Scheduling in Modern Data Centres
DESCRIPTION:Abstract: Modern data centres serve as a backbone for executing diverse workloads. The growing demand for resources has led to high traffic volumes\, requiring clusters to operate at high utilisation. In this talk\, I will examine how current data centre schedulers\, responsible for mapping workload tasks to resources\, perform under such challenging conditions. I will discuss how centralised schedulers struggle to scale under high load\, as they generate significant network traffic by continuously transferring up-to-date node data. Conversely\, distributed schedulers scale well but lack a global cluster view\, leading to suboptimal task allocations. As a result\, existing schedulers impose up to three times longer wait times on tail tasks\, that is\, tasks that finish last among tasks of a job\, leading to increased task and job completion times. \nI will then introduce our work on decentralised scheduling\, focusing on performance\, scalability\, and load balancing. These schedulers have been under-explored due to their design complexity. However\, we demonstrate that Murmuration\, our job-aware decentralised scheduler\, achieves high performance despite its simple approach using approximate load information. It does so by reducing scheduler-node communication overhead while still achieving balanced load distribution across nodes. Prototype evaluations show that Murmuration reduces task wait times under both normal and high cluster loads\, improving median job completion times by 25% as compared to default Kubernetes’ centralised scheduler. Simulations further show that it outperforms various distributed and hybrid schedulers by two orders of magnitude. By the end of this talk\, I hope to convince you that decentralised schedulers strike the right balance between performance and scalability\, and are indeed a practical solution for today’s high utilisation data centres. \nBio: Smita Vijayakumar recently completed her PhD from the Department of Computer Science and Technology at the University of Cambridge\, under the supervision of Evangelia Kalyvianaki. As a part of her thesis\, she developed a novel decentralised scheduling framework to reduce tail task latencies in highly utilised data centres. She has over twelve years of industry experience at companies like Cisco and Juniper\, working on networking\, cloud computing\, and distributed systems. She also has an MS from The Ohio State University\, where her work investigated cloud resource allocation to bottleneck stages for processing streaming applications. Her research has been published in top-tier conferences\, and also as a book. She has also been actively involved in mentoring\, teaching\, and community leadership\, including founding Women Who Go\, India. Smita’s expertise spans resource management\, scheduling\, and scalable distributed systems.
URL:https://homecse.iitd.ac.in/event/the-case-for-decentralised-scheduling-in-modern-data-centres/
LOCATION:SIT 001\, Amar Nath and Shashi Khosla School of Information Technology\, IIT Delhi\, Hauz Khas\, New Delhi 110016\, India\, Delhi\, Delhi\, 110016\, India
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250319T120000
DTEND;TZID=Asia/Kolkata:20250319T170000
DTSTAMP:20260921T162549
CREATED:20250317T044243Z
LAST-MODIFIED:20250317T044243Z
UID:1458-1742385600-1742403600@homecse.iitd.ac.in
SUMMARY:Delegation and Verification of Quantum Computation
DESCRIPTION:Prof. Venkata Koppula will be giving a talk on Wednesday\, March 19th\, in Bharti 501. Please note that this is not our usual Monday slot. The talk will begin at 12:00 PM\, with refreshments served at 11:50 AM\, prior to the talk. Below are the details:\n\n\nAbstract: Consider a resource-bounded client that wants to outsource some computation C to a powerful server. The client might want the following desirable features:\n(a) verifiability – some proof that the server has indeed performed the computation C\n(b) blind delegation – the server performs the computation without learning anything about C\n\nI will briefly discuss how these properties can achieved in the classical setting (where both client and server are classical\, but the server is more powerful than the client). Next\, I will discuss some recent progress for these questions in the quantum setting\, where the server is quantum\, and the client is classical. Both these problems can be solved using a single cryptographic tool.\n\nThis will be a (mostly non-technical) survey talk outlining the main results in this domain\, and I will conclude with some (minor/major) open questions. No crypto/quantum background will be assumed for this talk.
URL:https://homecse.iitd.ac.in/event/delegation-and-verification-of-quantum-computation/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250304T160000
DTEND;TZID=Asia/Kolkata:20250304T170000
DTSTAMP:20260921T162549
CREATED:20250225T150648Z
LAST-MODIFIED:20250225T150648Z
UID:1409-1741104000-1741107600@homecse.iitd.ac.in
SUMMARY:Distribution Testing: The New Frontier for Formal Methods
DESCRIPTION:Speaker: Kuldeep S. Meel (Georgia Institute of Technology) \n  \nAbstract:  The dominant guiding philosophy in the first sixty years of Computer Science was for designers to design systems that were always correct\, and to accept nothing less as users. But times have changed: Users and designers are accustomed to systems with statistical components and behaviors. What does it mean for the formal methods community? In this talk\, we argue that such a dramatic change in the acceptance and design of systems presents exciting opportunities to make fundamental contributions: we need to rethink the notions and techniques for the design of specifications and verification methodologies. In particular\, we will focus on the systems whose behaviors are not naturally captured by symbolic relations but rather require reliance on probability distributions. We will discuss our recent efforts in designing formal methodologies for testing whether a sampling subroutine generates a desired distribution. We will showcase the challenges\, opportunities\, and rewards in our journey.\n\nSpeaker Bio:  Kuldeep Meel holds Stephen Fleming Early-Career Associate Professorship in the School of Computer Science\, and an Associate Professor at the University of Toronto (on leave). His research interests lie at the intersection of Formal Methods and Artificial Intelligence. He is a recipient of the 2022 ACP Early Career Researcher Award\, the 2019 NRF Fellowship for AI\, and was named AI’s 10 to Watch by IEEE Intelligent Systems in 2020. His research program’s recent recognitions include the Distinguished Paper Award at CAV-23 and CAV-24\, ICLP-24 Best Paper Award\,2023  CACM Research Highlight Award\, 2022 ACM SIGMOD Research Highlight\, IJCAI-22 Early Career Spotlight\,  Best Paper Award nominations at ICCAD-21 and DATE-23\, 1st Place in Model Counting Competition (2020 and 2022).  He is passionate about teaching\, and most proud of being recipient of university-level Annual Teaching Excellence Awards in 2022 and 2023.
URL:https://homecse.iitd.ac.in/event/distribution-testing-the-new-frontier-for-formal-methods/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250304T150000
DTEND;TZID=Asia/Kolkata:20250304T170000
DTSTAMP:20260921T162549
CREATED:20250304T073434Z
LAST-MODIFIED:20250304T073434Z
UID:1448-1741100400-1741107600@homecse.iitd.ac.in
SUMMARY:Distribution Testing: The New Frontier for Formal Methods
DESCRIPTION:Speaker: Kuldeep S. Meel (Georgia Institute of Technology)\n\n\nAbstract:  The dominant guiding philosophy in the first sixty years of Computer Science was for designers to design systems that were always correct\, and to accept nothing less as users. But times have changed: Users and designers are accustomed to systems with statistical components and behaviors. What does it mean for the formal methods community? In this talk\, we argue that such a dramatic change in the acceptance and design of systems presents exciting opportunities to make fundamental contributions: we need to rethink the notions and techniques for the design of specifications and verification methodologies. In particular\, we will focus on the systems whose behaviors are not naturally captured by symbolic relations but rather require reliance on probability distributions. We will discuss our recent efforts in designing formal methodologies for testing whether a sampling subroutine generates a desired distribution. We will showcase the challenges\, opportunities\, and rewards in our journey.\n\nSpeaker Bio:  Kuldeep Meel holds Stephen Fleming Early-Career Associate Professorship in the School of Computer Science\, and an Associate Professor at the University of Toronto (on leave). His research interests lie at the intersection of Formal Methods and Artificial Intelligence. He is a recipient of the 2022 ACP Early Career Researcher Award\, the 2019 NRF Fellowship for AI\, and was named AI’s 10 to Watch by IEEE Intelligent Systems in 2020. His research program’s recent recognitions include the Distinguished Paper Award at CAV-23 and CAV-24\, ICLP-24 Best Paper Award\,2023  CACM Research Highlight Award\, 2022 ACM SIGMOD Research Highlight\, IJCAI-22 Early Career Spotlight\,  Best Paper Award nominations at ICCAD-21 and DATE-23\, 1st Place in Model Counting Competition (2020 and 2022).  He is passionate about teaching\, and most proud of being recipient of university-level Annual Teaching Excellence Awards in 2022 and 2023.
URL:https://homecse.iitd.ac.in/event/distribution-testing-the-new-frontier-for-formal-methods-2/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250220T160000
DTEND;TZID=Asia/Kolkata:20250220T170000
DTSTAMP:20260921T162549
CREATED:20250220T051853Z
LAST-MODIFIED:20250220T051853Z
UID:1347-1740067200-1740070800@homecse.iitd.ac.in
SUMMARY:Cyber-Physical Security of Microfluidic Biochips: Safeguarding Healthcare in the Era of Global Pandemics and Point-of-Care Testing
DESCRIPTION:Speaker: Navajit Singh Baban (Division of Engineering\, Center for Cybersecurity\, NYU Abu Dhabi) \n  \nAbstract: \nMicrofluidic biochips (MBs)\, a transformative class of lab-on-a-chip devices\, are reshaping clinical diagnostics\, point-of-care testing\, and biomedical research. However\, their rapid commercialization and complex global supply chain have made them increasingly vulnerable to three major security threats: structural attacks\, material attacks\, and intellectual property (IP) theft-based attacks\, posing significant risks to healthcare and biomedical integrity. Structural attacks involve malicious modifications to micro-reaction chamber heights\, potentially leading to faulty diagnostics. To address this\, we developed a deep-learning-based anomaly detection framework that effectively identifies microstructural inconsistencies. Material attacks target the integrity of biochips through stealthy chemical alterations during fabrication\, degrading device performance while evading conventional quality control checks. A prime example is BioTrojans—chemically altered microvalves designed to fail prematurely when triggered. To counteract this\, we introduced a mechanoresponsive dye-based watermarking system\, which shifts spectral peaks in response to material deformation. By leveraging a calibrated spectral-intensity curve\, this approach enables real-time spectrometric detection of compromised materials\, ensuring biochip reliability. IP theft-based attacks\, such as reverse engineering\, counterfeiting\, and piracy\, further threaten biochip security by enabling unauthorized replication and overproduction. To mitigate these risks\, we developed advanced authentication strategies\, including device-level watermarking\, melt-electrospun biochip fingerprinting\, and physically unclonable functions (PUFs)\, providing robust image-based and spectral-based authentication. By integrating multi-layered security countermeasures\, this work fortifies MBs against emerging cyber-physical threats\, ensuring their reliability\, trustworthiness\, and security in an era of global pandemics\, rapid point-of-care diagnostics\, and the growing demand for secure biomedical technologies. \nBiography: \nDr. Navajit Singh Baban is a postdoctoral associate at NYU Abu Dhabi’s Division of Engineering\, Center for Cybersecurity\, specializing in the cyber-physical security of biochips. He holds a B.Tech. in Mechanical Engineering from VIT University\, an M.Tech. in Materials Science from IIT Kanpur\, and a Ph.D. in Mechanical Engineering from NYU\, where he was a Global Ph.D. Fellow\, completing his doctorate in 2021. \nHis research lies at the intersection of cybersecurity\, mechanical engineering\, bioengineering\, and materials science\, focusing on developing security frameworks to protect biochips from malicious attacks\, which occur at the micro- and nano-structural level and the material level. He also works on authentication techniques\, such as watermarking\, fingerprinting\, and physically unclonable functions (PUFs)\, to combat intellectual property theft-based attacks\, such as counterfeiting\, overbuilding\, reverse engineering\, and piracy. \nBeyond biochip security\, Dr. Baban has a strong interest in biomechanics\, particularly bioinspired fracture and adhesion mechanics\, where he integrates nature-driven innovations into bioengineering solutions. Dedicated to translating research into real-world applications\, his work focuses on advancing cyber-physically secure and resilient biotechnology and healthcare.
URL:https://homecse.iitd.ac.in/event/cyber-physical-security-of-microfluidic-biochips-safeguarding-healthcare-in-the-era-of-global-pandemics-and-point-of-care-testing/
LOCATION:SIT006\, Amar Nath and Shashi Khosla School of Information Technology\, IIT Delhi\, Hauz Khas\, New Delhi 110016\, India\, New Delhi\, Delhi\, 110016\, India
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250219T150000
DTEND;TZID=Asia/Kolkata:20250219T170000
DTSTAMP:20260921T162549
CREATED:20250217T083026Z
LAST-MODIFIED:20250217T083327Z
UID:1335-1739977200-1739984400@homecse.iitd.ac.in
SUMMARY:Tech for Good in the Age of Quantum and AI : Sameer Chauhan
DESCRIPTION:Sameer Chauhan\, Director-General of the United Nations International Computing Centre (UNICC) is visiting India from 15 February- 21 February and will  deliver a talk and interact with faculty and students at IIT Delhi on the 19th of February at 3PM Venue SIT-001 [Khosla building]. \nTech for Good in the Age of Quantum and AI\n\nThe convergence of Artificial Intelligence and Quantum Computing presents unprecedented opportunities and challenges for global governance\, security\, and equitable development. In this talk Sameer Chauhan examines the implications of these technologies for international cooperation\, ethical governance\, and sustainable development. With AI driving automation and decision-making at scale\, and quantum breakthroughs redefining cryptography\, optimisation\, and material science\, the talk will focus on regulatory imperatives\, transnational partnerships\, and the role of academic institutions in shaping a resilient\, inclusive technological future.`\n\nAbout Sameer:\n\nSameer Chauhan\, Director-General of the United Nations International Computing Centre (UNICC)\, is a seasoned leader with over 25 years of experience in technology and international development. Under his leadership\, UNICC has become a trusted provider of innovative digital solutions\, supporting over 80 UN entities and global organizations. With expertise in cybersecurity\, data analytics\, and ethical technology\, Chauhan aligns UNICC’s initiatives with the UN Sustainable Development Goals\, fostering collaboration and resilience across the global development community. \nhttps://www.linkedin.com/in/sameerchauhan1/ \nhttps://www.unicc.org/\nhttps://www.unicc.org/news/2024/10/29/celebrating-6-years-of-collaboration-in-cybersecurity-2024-common-secure-conference/
URL:https://homecse.iitd.ac.in/event/tech-for-good-in-the-age-of-quantum-and-ai-sameer-chauhan/
LOCATION:SIT 001\, Amar Nath and Shashi Khosla School of Information Technology\, IIT Delhi\, Hauz Khas\, New Delhi 110016\, India\, Delhi\, Delhi\, 110016\, India
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250217T120000
DTEND;TZID=Asia/Kolkata:20250217T133000
DTSTAMP:20260921T162549
CREATED:20250212T122558Z
LAST-MODIFIED:20250219T003504Z
UID:1331-1739793600-1739799000@homecse.iitd.ac.in
SUMMARY:Polynomial Size\, Short-Circuit Resilient Circuits for NC
DESCRIPTION:Speaker: Raghuvansh Saxena (Tata Institute of Fundamental Research)\n \nWe show how to convert any circuit of poly-logarithmic depth and polynomial size into a functionally equivalent circuit of polynomial size (and polynomial depth) that is resilient to adversarial short-circuit errors. Specifically\, the resulting circuit computes the same function even if up to $epsilon d$ gates on every root-to-leaf path are short-circuited\, i.e.\, their output is replaced with the value of one of its inputs\, where $d$ is the depth of the circuit and $epsilon > 0$ is a fixed constant. \nPreviously\, such a result was known for formulas (Kalai-Lewko-Rao\, FOCS 2012). It was also known how to convert general circuits to error resilient ones whose size is quasi-polynomial in the size of the original circuit (Efremenko et al.~STOC 2022). The reason both these works do not extend to our setting is that there may be many paths from the root to a given gate\, and the resilient circuit needs to “remember” a lot of information about these paths\, which causes it to be large. Our main idea is to reduce the amount of this information at the cost of increasing the depth of the resilient circuit.
URL:https://homecse.iitd.ac.in/event/polynomial-size-short-circuit-resilient-circuits-for-nc/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250127T120000
DTEND;TZID=Asia/Kolkata:20250127T133000
DTSTAMP:20260921T162549
CREATED:20250121T160348Z
LAST-MODIFIED:20250219T003504Z
UID:1141-1737979200-1737984600@homecse.iitd.ac.in
SUMMARY:Distinct Elements in Streams and the Klee's Measure Problem
DESCRIPTION:Sourav Chakraborty  (Indian Statistical Institute)\n\nWe will present a very simple streaming algorithm on F0 estimation that also caught the eye of Donald E. Knuth.  In a recent article\, Donald E. Knuth started with the following two paragraphs:\n \n“Sourav Chakraborty\, N. V. Vinodchandran\, and Kuldeep S. Meel have recently proposed an interesting algorithm for the following problem: A stream of elements (a1\, a2\,…\,am) is input\, one at a time\, and we want to know how many of them are distinct. In other words\, if A = {a1\, a2\,…\,am} is the set of elements in the stream\, with multiplicities ignored\, we want to know |A|\, the size of that set. But we don’t have much memory; in fact\, |A| is probably a lot larger than the number of elements that we can hold in memory at any one time. What is a good strategy for computing an unbiased estimate of |A|?\n \nTheir algorithm is not only interesting\, it is extremely simple. Furthermore\, it’s wonderfully suited to teaching students who are learning the basics of computer science. (Indeed\, ever since I saw it\, a few days ago\, I’ve been unable to resist trying to explain the ideas to just about everybody I meet.) Therefore I’m pretty sure that something like this will eventually become a standard textbook topic. This note is an initial approximation to what I might write about it\, if I were preparing a textbook about data streams.”\n\nThis simple algorithm comes out of the first ever “efficient” streaming algorithm (from PODS 21) for the Klee’s Measure problem\, which was a big open problem in the world of streaming for many years.\n\nThis work is based on joint works with N. V. Vinodchandran\, and Kuldeep S. Meel across multiple articles\, notable the following: Estimating the Size of Union of Sets in Streaming Models. PODS 2021 [Paper 1]\nDistinct Elements in Streams: An Algorithm for the (Text) Book. ESA 2022 [Paper 2].
URL:https://homecse.iitd.ac.in/event/distinct-elements-in-streams-and-the-klees-measure-problem/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250124T120000
DTEND;TZID=Asia/Kolkata:20250124T130000
DTSTAMP:20260921T162549
CREATED:20250109T100500Z
LAST-MODIFIED:20250219T003504Z
UID:962-1737720000-1737723600@homecse.iitd.ac.in
SUMMARY:Online\, greedy\, and conceptually simple algorithms
DESCRIPTION:Allan Borodin\, University of Toronto \nWhat can and cannot be computed by “conceptually simple algorithms”? In this regard\, my primary interest is in approximation algorithms for combinatorial optimization problems and the relation of such problems to areas such as scheduling\, algorithmic game theory and computational social choice. \nWhy do we care about conceptual simplicity\, and can we formalize such a concept? For some problems\, simple algorithmic ideas provide the best-known solution or are reasonably competitive with the best-known algorithms\, especially in the context of real data. Moreover\, “in \npractice”\, it is often the case that users will opt for a quick understandable algorithm. While it is arguably impossible to precisely define a useful general definition of “simplicity”\, we can study well-used (albeit rarely precisely defined) combinatorial algorithmic paradigms such as various forms and extensions of online and greedy algorithms\, primal-dual algorithms\, local search\, and “simple” dynamic programming. Can we then provide definitions for such paradigms that are sufficiently expressive to capture many or most existing algorithms\, but still allow us to prove impossibility results that do not rely on computational complexity assumptions? To what extent is our theoretical analysis consistent with performance in practice? We will consider the specific problem of online interval selection in different online settings. In particular\, we will consider the problem in the random order arrival model when the online algorithm can permanently reject previously accepted intervals.
URL:https://homecse.iitd.ac.in/event/allan-borodin-speaks/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250121T120000
DTEND;TZID=Asia/Kolkata:20250121T130000
DTSTAMP:20260921T162549
CREATED:20241212T063048Z
LAST-MODIFIED:20241212T122213Z
UID:210-1737460800-1737464400@homecse.iitd.ac.in
SUMMARY:Cybersecurity: Why its hard\, solutions\, and careers
DESCRIPTION:Rajeev Barua\, University of Maryland. \nThe battle between cyber attackers and attack detection teams is an arms race that is not letting up. Attackers constantly devise new ways of exploiting system vulnerabilities\, and new methods to hide from detection. In response\, detection teams have responded with new technologies to detect attacks. \nThis talk will overview why cybersecurity is hard\, the solutions available\, and the latest industry trends\, and it will discuss careers in cybersecurity in India and worldwide. \nDr. Rajeev Barua is a Professor of Electrical and Computer Engineering at the University of Maryland. He is also the Founder and CEO of SecondWrite Inc\, which commercializes binary rewriting technology his research group developed at the university. He received his B.Tech in Computer Science from IIT Delhi\, and his Ph.D in Computer Science and Electrical Engineering from the Massachusetts Institute of Technology in 2000. Dr. Barua’s research interests are in the areas of program analysis\, cybersecurity\, and Applied AI. \nDr. Barua is a recipient of the NSF CAREER award in 2002\, the UMD George Corcoran Award for teaching excellence in 2003\, and the UMD Jimmy Lin Award for innovation in 2014. He has published over 70 academic papers and five issued patents. His company\, SecondWrite\, has raised over $2.4M in funding\, including $1.3M in US governments SBIR grants\, and the rest from professional private investors.
URL:https://homecse.iitd.ac.in/event/cybersecurity-why-its-hard-solutions-and-careers/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250120T143000
DTEND;TZID=Asia/Kolkata:20250120T163000
DTSTAMP:20260921T162549
CREATED:20241212T090010Z
LAST-MODIFIED:20241212T122237Z
UID:425-1737383400-1737390600@homecse.iitd.ac.in
SUMMARY:A Theory of Alternating Paths and Blossoms\, from the Perspective of Minimum Length
DESCRIPTION:Vijay V. Vazirani \, University of California\, Irvine. \nIt is well known that the proof of some prominent results in mathematics took a very long time — decades and even centuries. The first proof of the Micali-Vazirani (MV) algorithm\, for finding a maximum cardinality matching in general graphs\, was recently completed — over four decades after the publication of the algorithm (1980). MV is still the most efficient known algorithm for the problem. In contrast\, spectacular progress in the field of combinatorial optimization has led to improved running times for most other fundamental problems in the last three decades\, including bipartite matching and max-flow. \nThe new ideas contained in the MV algorithm\, and its proof remain largely unknown\, and hence unexplored. We hope to rectify this shortcoming and use ideas from the proof to give a simpler exposition of the algorithm. \nBased on this paper. \nBio: Vijay Vazirani is a distinguished professor at the University of California\, Irvine. A description of his research appears in the citation of his 2022 INFORMS John von Neumann Theory Prize. In 2001\, he published Approximation Algorithms\, which was followed by two co-edited books\, Algorithmic Game Theory in 2007 and Online and Matching-Based Market Design in 2023.
URL:https://homecse.iitd.ac.in/event/a-theory-of-alternating-paths-and-blossoms-from-the-perspective-of-minimum-length/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
END:VCALENDAR