BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Department of Statistics - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Department of Statistics
X-ORIGINAL-URL:https://stat.wisc.edu
X-WR-CALDESC:Events for Department of Statistics
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20210314T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20211107T070000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210224T160000
DTEND;TZID=America/Chicago:20210224T170000
DTSTAMP:20210624T020113
CREATED:20210125T152436Z
LAST-MODIFIED:20210217T180822Z
UID:4430-1614182400-1614186000@stat.wisc.edu
SUMMARY:Statistics Seminar
DESCRIPTION:Title: Graph-based approximation of Matérn Gaussian fields. \nPresenter: Ruiyi Yang (University of Chicago) \nAbstract: Matérn Gaussian fields (MGF) have been popular modeling choices as priors in many aspects of Bayesian statistics. In this talk we will discuss a generalization of MGF to manifolds and graphs. In the first part\, we formalize the definition of MGF on manifolds by exploiting the stochastic partial differential equation representation of the usual MGF on Euclidean domains. Sparse approximation based on a graph discretization is introduced\, which further motivates the construction of MGF on graphs. We will demonstrate their applications in regression and classification problems. Building on the theory of spectral convergence of graph Laplacians\, we establish a convergence analysis of graph MGF towards their continuum counterparts. \nIn the second part\, we study in detail the Bayesian regression and classification problems in a semi-supervised framework\, where a large number of unlabeled data are provided apart from the labeled ones. We adopt a graph-based approach as above and study quantitatively the benefit of unlabeled data through an analysis of the corresponding posterior contraction rates. Building on the convergence analysis in the first part\, we show that the graph posterior contracts around the underlying truth at the minimax optimal rate (up to logarithmic factors) provided that sufficiently many unlabeled data are given. \nLink: https://uwmadison.zoom.us/j/94724709216
URL:https://stat.wisc.edu/event/statistics-seminar-16-2021-02-24/
END:VEVENT
END:VCALENDAR