BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Halıcıoğlu Data Science Institute - UC San Diego - ECPv6.16.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://datascience.ucsd.edu
X-WR-CALDESC:Events for Halıcıoğlu Data Science Institute - UC San Diego
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:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20240310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20241103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20240313T130000
DTEND;TZID=America/Los_Angeles:20240313T140000
DTSTAMP:20260603T120156
CREATED:20240313T195909Z
LAST-MODIFIED:20240313T195909Z
UID:10000460-1710334800-1710338400@datascience.ucsd.edu
SUMMARY:Domain Counterfactuals for Trustworthy ML via Sparse Interventions | David I. Inouye
DESCRIPTION:Talk Abstract: \nAlthough incorporating causal concepts into deep learning shows promise for increasing explainability\, fairness\, and robustness\, existing methods require unrealistic assumptions and aim to recover the full latent causal model. This talk proposes an alternative: domain counterfactuals. Domain counterfactuals ask a more concrete question: “What would a sample look like if it had been generated in a different domain (or environment)?”   This avoids the challenges of full causal recovery while answering an important causal query. I will theoretically analyze the domain counterfactual problem for invertible causal models and prove an estimation bound that depends on the sparsity of intervention\, i.e.\, the number of intervened causal variables.  Leveraging this theory\, I will introduce a practical counterfactual estimation algorithm that outperforms baselines. Additionally\, I will showcase the potential of domain counterfactuals for counterfactual fairness and domain generalization through preliminary results. Finally\, I will connect this work to my broader research focus on distribution matching\, highlighting its potential as a foundational tool for building trustworthy machine learning systems. \nBio: \nProf. David I. Inouye is an assistant professor in the Elmore Family School of Electrical and Computer Engineering at Purdue University. His lab focuses on trustworthy machine learning (ML)\, which aims to make ML systems more robust\, causal and explainable. Currently\, he is interested in advancing distribution matching algorithms and applications such as causality\, domain generalization\, and distribution shift explanations. He is also interested in highly robust distributed learning algorithms on a network of devices\, called Internet Learning. His research is funded by ARL\, ONR\, and NSF. Previously\, he was a postdoc at Carnegie Mellon University working with Prof. Pradeep Ravikumar. He completed his Computer Science PhD at The University of Texas at Austin in 2017 advised by Prof. Inderjit Dhillon and Prof. Pradeep Ravikumar. He was awarded the NSF Graduate Research Fellowship (NSF GRFP).
URL:https://datascience.ucsd.edu/event/domain-counterfactuals-for-trustworthy-ml-via-sparse-interventions-david-i-inouye/
LOCATION:Halıcıoğlu Data Science Institute (HDSI)\, Room 404\, 3234 Matthews Ln\, La Jolla\, CA\, 92093\, United States
CATEGORIES:Seminar
END:VEVENT
END:VCALENDAR