BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Events - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Events
X-ORIGINAL-URL:https://events.ucsc.edu
X-WR-CALDESC:Events for Events
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20270314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20271107T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260202T160000
DTEND;TZID=America/Los_Angeles:20260202T170000
DTSTAMP:20260520T145455
CREATED:20260128T184233Z
LAST-MODIFIED:20260128T184233Z
UID:10009126-1770048000-1770051600@events.ucsc.edu
SUMMARY:AM Seminar: Are Graph Learning Methods Actually Learning?
DESCRIPTION:Presenter: Seshadhri Comandur\, Professor of Computer Science\, UCSC \nDescription: There has been a lot of literature on graph machine learning over the past few years\, and a bewildering array of new methods. This talk is based on a series of results making a provocative argument. Maybe many graph machine learning methods are not really that effective\, and the progress we are seeing is an artifact of experimental design and measurement. I will talk about some results showing that low-dimensional embeddings with dot product similarity (arguably the most common graph ML technique) cannot capture salient aspects of real-world graphs. Follow-up work demonstrates that simple benchmarks seem to outperform fancier methods\, and that there are significant shortcomings in existing accuracy measurement. \nBio: C. Seshadhri (Sesh) is a professor of Computer Science at the University of California\, Santa Cruz and an Amazon scholar. Prior to joining UCSC\, he was a researcher at Sandia National Labs\, Livermore in the Information Security Sciences department\, during 2010-2014. His primary interest is the theoretical study of algorithms\, especially those with a mix of graphs and randomization. By and large\, Sesh works at the boundary of theoretical computer science (TCS) and data mining. His work spans many areas: sublinear algorithms\, graph algorithms\, graph modeling\, scalable computation\, and data mining. In the theory world\, his work has resolved numerous open problems in monotonicity testing and graph property testing. A number of his papers in the interface of TCS and applied algorithms have received paper awards at KDD\, WWW\, ICDM\, SDM\, and WSDM. He received the 2019 SDM/IBM Early Career Award for Excellence in Data Analytics. Sesh got his Ph.D from Princeton University and spent two years as a postdoc in IBM Almaden Labs. \nHosted by: Ashesh Chattopadhyay\, Applied Mathematics Department
URL:https://events.ucsc.edu/event/am-seminar-are-graph-learning-methods-actually-learning/
CATEGORIES:Lectures & Presentations,Seminars
ATTACH;FMTTYPE=image/jpeg:https://events.ucsc.edu/wp-content/uploads/2026/01/sesh.jpeg
END:VEVENT
END:VCALENDAR