5 citations · 7 across the 8 of their papers we have counts for
8 papers
Bias-Corrected Subspace Intersection: Minimax-Optimal Shared Subspace Estimation in Multi-View Data
Xianwen Song, Yuepeng Yang, Cong Ma
Estimating a low-dimensional subspace shared across noisy data matrices is a fundamental problem in multi-view matrix estimation. We study this problem under the two-view JIVE mode…
Robust Average-Reward Markov Decision Processes: Minimax-Optimal Learning via Plug-in Reductions
Yuepeng Yang, Yuxin Chen, Yuejie Chi
Distributionally robust Markov decision processes provide a principled framework for sequential decision making under model uncertainty. We study how many samples are necessary and…
Sample-efficient inductive matrix completion with noise and inexact side-information
Yuepeng Yang, Cong Ma
Inductive matrix completion (IMC) is a variant of low-rank matrix completion that incorporates row and column side-information. In principle, it can reduce the effective dimension…
Estimating shared subspace with AJIVE: the power and limitation of multiple data matrices
Yuepeng Yang, Cong Ma
Integrative data analysis often requires disentangling joint and individual variations across multiple datasets, a challenge commonly addressed by the Joint and Individual Variatio…
Random pairing MLE for estimation of item parameters in Rasch model
Yuepeng Yang, Cong Ma
The Rasch model, a classical model in the item response theory, is widely used in psychometrics to model the relationship between individuals' latent traits and their binary respon…
Top- ranking with a monotone adversary
Yuepeng Yang, Antares Chen, Lorenzo Orecchia +1
In this paper, we address the top- ranking problem with a monotone adversary. We consider the scenario where a comparison graph is randomly generated and the adversary is allowe…
Convergence of Optimistic-Follow-the-Regularized-Leader in Two-Player Zero-Sum Markov Games
Yuepeng Yang, Cong Ma
We prove that optimistic-follow-the-regularized-leader (OFTRL), together with smooth value updates, finds an -approximate Nash equilibrium in iterations for two-play…
Optimal tuning-free convex relaxation for noisy matrix completion
Yuepeng Yang, Cong Ma
This paper is concerned with noisy matrix completion--the problem of recovering a low-rank matrix from partial and noisy entries. Under uniform sampling and incoherence assumptions…