BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Ashoka University - ECPv6.18.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.ashoka.edu.in
X-WR-CALDESC:Events for Ashoka University
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:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250923T130000
DTEND;TZID=Asia/Kolkata:20250923T150000
DTSTAMP:20250921T232050Z
CREATED:20250919T072347Z
LAST-MODIFIED:20250921T232050Z
UID:82790-1758632400-1758639600@www.ashoka.edu.in
SUMMARY:SCDLDS talk
DESCRIPTION:  \n\n \nColloquium announcement\n"Old dog\, Old tricks\, New show: Gradient methods for training Kernel Machines are Very Fast."\nby Parthe Pandit \n \nThakur Family Chair Assistant Professor Center for Machine Intelligence and Data Science (C-MInDS) Indian Institute of Technology\, Bombay \nParthe Pandit is a Thakur Family Chair Assistant Professor at the Center for Machine Intelligence and Data Science (C-MInDS) at IIT Bombay. He was a Simons postdoctoral fellow at UC San Diego. He obtained his PhD from UCLA\, and his undergraduate education from IIT Bombay. He has received the AI2050 Early Career Fellowship from Schmidt Sciences in 2024\, and the Jack K Wolf Student Paper Award at ISIT 2019. \nAbstract: Kernel Machines are a classical family of models in Machine Learning that overcome several limitations of Neural Networks. These models have regained popularity following some landmark results showing their equivalence to Neural Networks. Folklore suggests that training procedures for Kernel Machines may not scale well for problems with large datasets\, and hence Kernel Machines can only be applied when working with problems with small datasets. We dispel this belief.\nAfter taking a fresh look at the problem of designing training algorithms for Kernel Machines\, we propose a suite of algorithms based on gradient descent in the Reproducing Kernel Hilbert Space (RKHS) associated with the kernel function. These algorithms\, called EigenPro\, are much faster than the SOTA\, and enable training of Kernel Machines with large model sizes over large datasets. This development unlocks the potential of Kernel Machines for modern applications of AI.\nBased on work with Amirhesam Abedsoltan\, Siyuan Ma\, Yiming Zhang\, and Mikhail Belkin.\n\nDate: Tuesday\, Sept 23\, 2025 Time: 1:30 PM – 2:30 PM Venue: Ramachandra Hall For details: ashoka-cdlds@ashoka.edu.in or call: +91-9136857558 Registration and Zoom Link: https://www.ashoka.edu.in/event/scdlds-coll04/ Website: https://cdlds.ashoka.edu.in/\n\n 
URL:https://www.ashoka.edu.in/event/scdlds-talk/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250923T132000
DTEND;TZID=Asia/Kolkata:20250923T145500
DTSTAMP:20250918T005904Z
CREATED:20250912T055402Z
LAST-MODIFIED:20250918T005904Z
UID:82172-1758633600-1758639300@www.ashoka.edu.in
SUMMARY:Abhivyakti
DESCRIPTION:Abhivyakti : A Book Discussion Forum  \nNavtej Sarna in Conversation with Kanika Singh on her book "The Story of a Sikh Museum: Heritage\, Politics\, Popular Culture \nNavtej Sarna is a former Indian diplomat\, author\, and columnist. He served as India’s Ambassador to the United States (2016–18)\, High Commissioner to the United Kingdom\, and Ambassador to Israel (2008–12)\, with earlier postings in the Soviet Union\, Poland\, Bhutan\, Geneva\, Iran\, and Washington DC. An accomplished writer\, his works include The Exile\, We Weren’t Lovers Like That\, The Book of Nanak\, and Indians at Herod’s Gate. \n  \nKanika Singh is a historian working on public history\, museums and heritage. She is\nDirector\, Centre for Writing &amp; Communication\, Ashoka University. \n  \n  \n  \n 
URL:https://www.ashoka.edu.in/event/abhivyakti/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250923T133000
DTEND;TZID=Asia/Kolkata:20250923T143000
DTSTAMP:20250922T072804Z
CREATED:20250919T041618Z
LAST-MODIFIED:20250922T072804Z
UID:82277-1758634200-1758637800@www.ashoka.edu.in
SUMMARY:Old dog\, Old tricks\, New show: Gradient methods for training Kernel Machines are Very Fast - Parthe Pandit
DESCRIPTION:  \n\n\n\n\nColloquium announcement\n“Old dog\, Old tricks\, New show: Gradient methods for training Kernel Machines are Very Fast.”\nby Parthe Pandit \n \nThakur Family Chair Assistant Professor\nCenter for Machine Intelligence and Data Science (C-MInDS)\nIndian Institute of Technology\, Bombay \n\nParthe Pandit is a Thakur Family Chair Assistant Professor at the Center for Machine Intelligence and Data Science (C-MInDS) at IIT Bombay. He was a Simons postdoctoral fellow at UC San Diego. He obtained his PhD from UCLA\, and his undergraduate education from IIT Bombay. He has received the AI2050 Early Career Fellowship from Schmidt Sciences in 2024\, and the Jack K Wolf Student Paper Award at ISIT 2019. \nAbstract: Kernel Machines are a classical family of models in Machine Learning that overcome several limitations of Neural Networks. These models have regained popularity following some landmark results showing their equivalence to Neural Networks. Folklore suggests that training procedures for Kernel Machines may not scale well for problems with large datasets\, and hence Kernel Machines can only be applied when working with problems with small datasets. We dispel this belief.\nAfter taking a fresh look at the problem of designing training algorithms for Kernel Machines\, we propose a suite of algorithms based on gradient descent in the Reproducing Kernel Hilbert Space (RKHS) associated with the kernel function. These algorithms\, called EigenPro\, are much faster than the SOTA\, and enable training of Kernel Machines with large model sizes over large datasets. This development unlocks the potential of Kernel Machines for modern applications of AI.\nBased on work with Amirhesam Abedsoltan\, Siyuan Ma\, Yiming Zhang\, and Mikhail Belkin.\n\nDate: Tuesday\, Sept 23\, 2025\nTime: 1:30 PM – 2:30 PM\nVenue: Ramachandra Hall\, AC-05 Lab-004\nFor details: ashoka-cdlds@ashoka.edu.in\nor call: +91-9136857558\nRegistration and Zoom Link: https://www.ashoka.edu.in/event/scdlds-coll04/\nWebsite: https://cdlds.ashoka.edu.in/\nZoom Link: https://zoom.us/j/96645811296?pwd=Q4M3qrSlVfnqjJl3flqaZa5Vvxy4Sa.1\n\n 
URL:https://www.ashoka.edu.in/event/scdlds-coll04/
LOCATION:AC-05 Ramachandran Hall
ATTACH;FMTTYPE=image/jpeg:https://www.ashoka.edu.in/wp-content/uploads/2025/09/WhatsApp-Image-2025-09-19-at-15.48.27.jpeg
ORGANIZER;CN="SCDLDS":MAILTO:ashoka-cdlds@ashoka.edu.in
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250923T133000
DTEND;TZID=Asia/Kolkata:20250923T150000
DTSTAMP:20250918T045630Z
CREATED:20250918T030453Z
LAST-MODIFIED:20250918T045630Z
UID:82658-1758634200-1758639600@www.ashoka.edu.in
SUMMARY:Oxane Partners - PPT (CDO)
DESCRIPTION:
URL:https://www.ashoka.edu.in/event/oxane-partners-ppt-cdo/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250923T133000
DTEND;TZID=Asia/Kolkata:20250923T150000
DTSTAMP:20250919T015752Z
CREATED:20250919T015752Z
LAST-MODIFIED:20250919T015752Z
UID:82716-1758634200-1758639600@www.ashoka.edu.in
SUMMARY:The Art Side of Ambedkarism: Visual Resistance\, Memory\, and Imagination
DESCRIPTION:Dear All\, \nThe Department of Visual Arts is delighted to invite you to the second colloquium in the Visual Arts Colloquium Series\, Monsoon 2025. \nTitle: The Art Side of Ambedkarism: Visual Resistance\, Memory\, and Imagination \nSpeaker: Siddhesh Gautam (@bakeryprasad) \nDate: September 23rd\, @1.30 pm \nVenue: Visual Arts Studio (near sports block) \nAbstract: This talk reflects on how Dr. B.R. Ambedkar’s thought and vision inspire an ongoing visual vocabulary of resistance. I will explore how Ambedkarism has shaped not only the politics of social justice but also an aesthetic language of equality\, dignity\, and collective imagination. Through my practice of illustration\, graphic storytelling\, and public art\, I will discuss how images can work as archives of people’s struggles\, as acts of pedagogy\, and as tools to dismantle caste hierarchies in everyday life. The session will also highlight how the anti-caste movement's legacy continues to guide creative practices that are not limited to elitist spaces\, but rooted in the communities that live and sustain his vision. \nBio: Siddhesh Gautam (he/them) is a Delhi-based mixed-media artist\, storyteller\, and writer. His work explores caste\, history\, identity\, and resistance\, drawing on visual archives and personal memory to challenge dominant narratives. Through illustrations\, poetry\, and storytelling\, he documents the struggles and dreams of marginalized communities. His practice seeks to return art to the people\, grounding it in everyday lives rather than elitist spaces. \nJoin us for an engaging conversation over tea to discover how Ambedkar’s vision lives on in art\, imagination\, and everyday struggles. \n  \nWarm regards\, \nVisual Arts Department
URL:https://www.ashoka.edu.in/event/the-art-side-of-ambedkarism-visual-resistance-memory-and-imagination/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250923T140000
DTEND;TZID=Asia/Kolkata:20250923T150000
DTSTAMP:20250915T213126Z
CREATED:20250915T213126Z
LAST-MODIFIED:20250915T213126Z
UID:82345-1758636000-1758639600@www.ashoka.edu.in
SUMMARY:Mathematics Colloquium
DESCRIPTION:Dear All\, \nThe Department of Mathematics invites you to a colloquium on September 23\, 2025 (Tuesday). \nTitle: Improved upper bounds for trifferen codes \nAbstract: A ternary code of block length n is a subset of {0\, 1\, 2\,}^n. Such a code is said to be trifferent if whenever three distinct codewords x\, y and z are chosen\, there is a coordinate j such that x_j\, y_j and z_j are pairwise distinct. A classical upper bound on the largest possible size of  such code is 2(3/2)^n. A longstanding open problem has been to improve this bound. Improvements in the constant '2' were obtained only in recent years with the proof relying on some computer search. In this talk\, we will discuss a polynomial factor improvement in this bound. This is joint work with Siddharth Bhandari. \nWe look forward to your participation.
URL:https://www.ashoka.edu.in/event/mathematics-colloquium/
END:VEVENT
END:VCALENDAR