8 citations · 8 across the 3 of their papers we have counts for
5 papers
Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian
Paria Rashidinejad, Hanlin Zhu, Kunhe Yang +2
Offline reinforcement learning (RL), which refers to decision-making from a previously-collected dataset of interactions, has received significant attention over the past years. Mu…
Average-Case Communication Complexity of Statistical Problems
Cyrus Rashtchian, David P. Woodruff, Peng Ye +1
We study statistical problems, such as planted clique, its variants, and sparse principal component analysis in the context of average-case communication complexity. Our motivation…
Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems
Cyrus Rashtchian, David P. Woodruff, Hanlin Zhu
We consider the general problem of learning about a matrix through vector-matrix-vector queries. These queries provide the value of $\boldsymbol{u}^{\mathrm{T}}\boldsymbol{M}\bolds…
Clustering with Fast, Automated and Reproducible assessment applied to longitudinal neural tracking
Hanlin Zhu, Xue Li, Liuyang Sun +5
Across many areas, from neural tracking to database entity resolution, manual assessment of clusters by human experts presents a bottleneck in rapid development of scalable and spe…
Guided Dialog Policy Learning: Reward Estimation for Multi-Domain Task-Oriented Dialog
Ryuichi Takanobu, Hanlin Zhu, Minlie Huang
Dialog policy decides what and how a task-oriented dialog system will respond, and plays a vital role in delivering effective conversations. Many studies apply Reinforcement Learni…