BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UC Irvine Donald Bren School of Information &amp; Computer Sciences - ECPv6.3.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:UC Irvine Donald Bren School of Information &amp; Computer Sciences
X-ORIGINAL-URL:https://ics.uci.edu
X-WR-CALDESC:Events for UC Irvine Donald Bren School of Information &amp; Computer Sciences
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:20220313T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20221106T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220224T160000
DTEND;TZID=America/Los_Angeles:20220224T170000
DTSTAMP:20260517T073851
CREATED:20220224T221306Z
LAST-MODIFIED:20220224T221306Z
UID:11172-1645718400-1645722000@ics.uci.edu
SUMMARY:Nonparametric Tensor Completion via Sign Series
DESCRIPTION:The UCI Department of Statistics is proud to present Miaoyan Wang Assistant Professor\, Statistics\, University of Wisconsin\, Madison. \n\n\n\nTitle: Nonparametric Tensor Completion via Sign Series \nAbstract: \nHigher-order tensors arise frequently in applications such as neuroimaging\, recommendation system\, social network analysis\, and psychological studies. We consider the problem of tensor estimation from noisy observations with possibly missing entries. A nonparametric approach to tensor completion is developed based on a new model which we coin as sign representable tensors. The model represents the signal tensor of interest using a series of structured sign tensors. Unlike earlier methods\, the sign series representation effectively addresses both low- and high-rank signals\, while encompassing many existing tensor models – including CP models\, Tucker models\, single index models\, several hypergraphon models – as special cases. We show that the sign tensor series is theoretically characterized\, and computationally estimable\, via classification tasks with carefully-specified weights. Excess risk bounds\, estimation error rates\, and sample complexities are established. We demonstrate the outperformance of our approach over previous methods on two datasets\, one on human brain connectivity networks and the other on NeurIPS topic data mining.
URL:https://ics.uci.edu/event/nonparametric-tensor-completion-via-sign-series/
LOCATION:Zoom
CATEGORIES:Department Seminars
ATTACH;FMTTYPE=image/jpeg:https://ics.uci.edu/wp-content/uploads/2022/02/Miaoyan-Wang-2_336x504.jpg
END:VEVENT
END:VCALENDAR