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:20250725T120000
DTEND;TZID=Asia/Kolkata:20250725T130000
DTSTAMP:20261012T030719
CREATED:20250724T051140Z
LAST-MODIFIED:20250724T051140Z
UID:1721-1753444800-1753448400@homecse.iitd.ac.in
SUMMARY:Thinking Geometrically in the World of Data-driven Models by Niloy J. Mitra
DESCRIPTION:Title: Thinking Geometrically in the World of Data-driven Models \nAbstract:\nAs learning models grow in scale and capacity\, a natural question arises: is it still relevant to think geometrically\, or should we seek more data? In this talk\, I will argue that geometry remains essential\, not just for interpretability\, but for enabling control\, structure\, and generalization. I will illustrate this through three examples. First\, how to distil image diffusion features to enrich geometric models by combining projection operation with diffusion features. Second\, in video generation\, 3D awareness proves critical for spatial control\, object permanence\, and task awareness in multimodal LLMs. Finally\, I will present a neural surface representation that exposes direct access to first and second fundamental forms\, enabling a new approach to defining Laplace operators on neural surfaces. Together\, these examples highlight that geometry continues to offer powerful tools\, perhaps more so now than ever. For more details\, please visit https://geometry.cs.ucl.ac.uk/. \nBio:\nNiloy J. Mitra leads the Smart Geometry Processing group in the Department of Computer Science at University College London and the Adobe Research London Lab. He received his PhD from Stanford University under the guidance of Leonidas Guibas. He was an assistant professor at IIT Delhi from 2007-2009. His research focuses on developing machine learning frameworks for generative models for high-quality geometric and appearance content for CG applications. He was awarded the Eurographics Outstanding Technical Contributions Award in 2019\, the British Computer Society Roger Needham Award in 2015\, and the ACM SIGGRAPH Significant New Researcher Award in 2013. He was elected as a fellow of Eurographics in 2021 and served as the Technical Papers Chair for SIGGRAPH in 2022. His work has also earned him a place in the SIGGRAPH Academy in 2023. Besides research\, Niloy is an active DIYer and loves reading\, cricket\, and cooking. For more\, please visit https://geometry.cs.ucl.ac.uk
URL:https://homecse.iitd.ac.in/event/thinking-geometrically-in-the-world-of-data-driven-models-by-niloy-j-mitra/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250728T113000
DTEND;TZID=Asia/Kolkata:20250728T123000
DTSTAMP:20261012T030719
CREATED:20250721T150910Z
LAST-MODIFIED:20250728T034019Z
UID:1709-1753702200-1753705800@homecse.iitd.ac.in
SUMMARY:Dot-Product Proofs by Prahladh Harsha
DESCRIPTION:Title: Dot-Product Proofs\n\nSpeaker: Prahladh Harsha (TIFR Mumbai):  Details: July 28 (Monday) | 11:30 AM | Bharti 404 \n\n\nAbstract: A dot-product proof is a simple probabilistic proof system in which the verifier decides whether to accept an input vector based on a single linear combination of the entries of the input and a proof vector. In this talk\, I will present constructions of linear-size dot-product proofs for circuit satisfiability and discuss two kinds of applications: basing the exponential-time hardness of approximating MAX-LIN (maximal number of linear equations that can be simultaneously satisfied) on the standard exponential-time hypothesis\, and minimizing the verification complexity of cryptographic proof systems.\n\n[Joint work with Nir Bitansky\, Yuval Ishai\, Ron Rothblum\, and David Wu] \nBio: Prahladh Harsha is a Professor at the School of Technology and Computer Science at the Tata Institute of Fundamental Research (TIFR)\, Mumbai\, India. He obtained his BTech degree in Computer Science and Engineering from IIT Madras in 1998 and his PhD in Computer Science from the Massachusetts Institute of Technology (MIT) in 2004. He has worked at Microsoft Research\, TTI Chicago\, and has been at TIFR since 2010. \nPrahladh’s research interests are in the area of theoretical computer science\, with special emphasis on computational complexity theory and algebraic coding theory. He is best known for his work in the area of probabilistically checkable proofs. Prahladh Harsha is a winner of the NASI Young Scientist Award for Mathematics and the Swarnajayanti Fellowship (Govt. of India). \n\n\nProf. Harsha has served on the editorial boards of SIAM Journal on Computing and Algorithmica. He is currently the Editor-in-Chief of the ACM Transactions on Computation Theory and a Fellow of the Indian Academy of Sciences.
URL:https://homecse.iitd.ac.in/event/dot-product-proofs-by-prahladh-harsha/
LOCATION:Bharti 404\, IIT Delhi\, Delhi\, New Delhi\, 110016\, India
END:VEVENT
END:VCALENDAR