142
proximate message passing approach to this goal. The
proposed algorithm achieves both asymptotic minimum MSE under an idealized model and
state-of-the-art practical performances on benchmark
multi-modal single-cell datasets. Time permitting, we
shall also discuss probabilistic querying of the resulting cell atlases.
Joint work with Sagnik Nandy.
Eigenvectors Fluctuations and Limit Results for
Graphon Estimation
MInh Tang
North Carolina State University
Abstract: We derive error bounds in two-to-infinity
norm as well as row-wise normal approximations for
the leading eigenvectors U of an inhomogeneous Erdos-Renyi random graphs whose edge probabilities
matrix are generated from a kernel that, when viewed
as an integral operator, can have infinite rank. We
apply these results to the hypothesis testing problem
that two vertices i and j in an inhomogeneous Erdos-Renyi graph A have the same latent positions, and
we propose a test statistic based on the Euclidean
distance between the ith and jth rows of U that converges in distribution to a weighted sum of independent chi-square under the null hypothesis.
Pseudo-Labeling for Kernel Ridge Regression under Covariate Shift
Kaizheng Wang
Columbia University
Abstract: We develop and analyze a principled approach to kernel ridge regression under covariate shift.
The goal is to learn a regression function with small
mean squared error over a target distribution, based on
unlabeled data from there and labeled data that may
have a different feature distribution. We propose to
split the labeled data into two subsets and conduct
kernel ridge regression on them separately to obtain a
collection of candidate models and an imputation
model. We use the latter to fill the missing labels and
then select the best candidate model accordingly. Our
non-asymptotic excess risk bounds show that in quite
general scenarios, our estimator adapts to the structure
of the target distribution as well as the covariate shift.
It achieves the minimax optimal error rate up to a
logarithmic factor. The use of pseudo-labels in model
selection does not have major negative impacts.
Invited Session IS014: Dynamic and Reinforcement Learning
Multi-Objective Tree-Based Reinforcement
Learning for Estimating Tolerant Dynamic Treatment Regimes
Lu Wang
University of Michigan
Abstract: A dynamic treatment regime (DTR) is a
sequence of treatment decision rules that dictate individualized treatments based on evolving treatment and
covariate history. It provides a vehicle for optimizing
a clinical decision support system and fits well into
the broader paradigm of personalized medicine.
However, many real-world problems involve multiple
competing priorities, and decision rules differ when
trade-offs are present. Correspondingly, there may be
more than one feasible decision that leads to empirically sufficient optimization. In this talk, we present a
concept of \"tolerant regime,\" which provides a set of
individualized feasible decision rules under a prespecified tolerance rate. Then we demonstrate a couple of
recently developed methods, including multiobjective
tree-based reinforcement learning (MOT-RL), to directly estimate the tolerant DTR (tDTR) that optimizes multiple objectives in a multistage multitreatment
setting. The algorithms are both implemented in a
backward inductive manner through multiple decision
stages, and it estimates the optimal DTR and tDTR
depending on the decision-maker's preferences. The
proposed methods for multi-objective reinforcement
learning are robust, efficient, easy-to-interpret, and
flexible in various settings.
Joint work with Yao Song and Chang Wang.
Interim Analysis in Sequential Multiple Assignment Randomized Trials for Survival Outcomes
Yu Cheng
University of Pittsburgh
Abstract: Sequential Multiple Assignment Random-