BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computer Science and Engineering - ECPv6.13.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Computer Science and Engineering
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:20260101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20260814T120000
DTEND;TZID=Asia/Kolkata:20260814T130000
DTSTAMP:20260922T093741
CREATED:20260813T064455Z
LAST-MODIFIED:20260813T064455Z
UID:2626-1786708800-1786712400@homecse.iitd.ac.in
SUMMARY:Two New Frontiers in Science: Autonomous AI Scientists and Lotteries for Acceptance Decisions by Prof Nihar Shah
DESCRIPTION:Abstract:\nWe will discuss two new frontiers in science. \n1) Autonomous AI Scientists: Research conducted by autonomous AI scientist systems is rapidly increasing in prevalence. These systems execute the entire research process autonomously\, with little or no human intervention. While papers generated may appear appealing\, we investigate whether these systems follow rigorous research methodologies. Using novel experiments designed to mitigate confounding factors\, we uncover significant and concerning methodological flaws in their workflows. We also propose a method to detect these problems and provide policy recommendations for journals and conferences: Such methodological problems are not detectable from the produced paper alone but can be identified through analysis of the trace logs of the workflow executed by the AI scientists. \n2) Lotteries for Acceptance Decisions: Traditional decisions for accepting/rejecting papers or grant proposals involve expert reviews followed by discussions and human-specified decisions. More recently though\, citing drawbacks of such traditional approaches\, a number of funding agencies worldwide have moved towards a different decision model to make acceptance decisions. These agencies have incorporated “partial lotteries” into their decision-making\, where final decisions are randomized in a manner that still respects reviewers’ evaluations. We will first identify several problems in current implementations of such partial lotteries. We will then present a principled approach to designing improved partial lotteries with strong mathematical guarantees and empirical performance. \nThe talk will also contain a generous dose of minions. \n  \nBio: Nihar B. Shah is an Associate Professor in the Machine Learning and Computer Science departments at Carnegie Mellon University (CMU). His research focuses on the Evaluation of Science and the Science of Evaluation. His group develops computational tools with strong theoretical guarantees\, and designs and conducts controlled experiments for evidence-based policy design. His work has been used in the review of well over a hundred thousand papers and thousands of proposals\, across over 200 venues. He is a recipient of The Allen Newell Award for Research Excellence\, a Young Alumnus Medal from the Indian Institute of Science\, a JP Morgan faculty research award\, Google Research Scholar Award\, an NSF CAREER Award\, and the David J. Sakrison memorial prize from EECS Berkeley for a “truly outstanding and innovative PhD thesis.” Papers authored by him have won several Best Paper Awards.
URL:https://homecse.iitd.ac.in/event/two-new-frontiers-in-science-autonomous-ai-scientists-and-lotteries-for-acceptance-decisions-by-prof-nihar-shah/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20260814T140000
DTEND;TZID=Asia/Kolkata:20260814T150000
DTSTAMP:20260922T093741
CREATED:20260813T064616Z
LAST-MODIFIED:20260813T064616Z
UID:2628-1786716000-1786719600@homecse.iitd.ac.in
SUMMARY:Weight Enumerators and Magic State Distillation by Dr. Amolak Kalra
DESCRIPTION:In this talk I will start by describing a protocol called magic state distillation\, which was first introduced by Bravyi and Kitaev in 2005. This protocol uses quantum error-correcting codes and noisy magic states to perform universal fault-tolerant quantum computation.\nI will then explain how the performance of a certain class of magic state distillation protocols can be determined by the weight enumerator of the quantum error-correcting code used for distillation. Using this connection\, I will show how one can derive new constraints on certain families of classical and quantum weight enumerators that are stronger than those previously known.\nThese stronger constraints lead to tighter distance bounds for quantum codes and\, rather surprisingly\, to a proof of the non-existence of certain families of classical codes.\nThis talk is based on joint work with Shiroman Prakash: https://arxiv.org/abs/2501.10163
URL:https://homecse.iitd.ac.in/event/weight-enumerators-and-magic-state-distillation-by-dr-amolak-kalra/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
CATEGORIES:Seminars
END:VEVENT
END:VCALENDAR