← Search

zheng Yu

16 accepted papers

2025

Deep Reinforcement Learning for Efficient and Fair Allocation of Healthcare Resources

IJCAI 2025

The scarcity of health care resources, such as ventilators, often leads to the unavoidable consequence of rationing, particularly during public health emergencies or in resource-constrained settings like pandemics. The absence of a universally accepted standard for resource allocation protocols resu

Cited by 0SourcePDFScholar
2024

FuseAnyPart: Diffusion-Driven Facial Parts Swapping via Multiple Reference Images

NeurIPS 2024spotlight

Facial parts swapping aims to selectively transfer regions of interest from the source image onto the target image while maintaining the rest of the target image unchanged. Most studies on face swapping designed specifically for full-face swapping, are either unable or significantly limited when it…

2023

Deep Reinforcement Learning for Cost-Effective Medical Diagnosis

ICLR 2023poster

Dynamic diagnosis is desirable when medical tests are costly or time-consuming. In this work, we use reinforcement learning (RL) to find a dynamic policy that selects lab test panels sequentially based on previous observations, ensuring accurate testing at a low cost. Clinical diagnostic data are of…

2023

March in Chat: Interactive Prompting for Remote Embodied Referring Expression

ICCV 2023poster

Many Vision-and-Language Navigation (VLN) tasks have been proposed in recent years, from room-based to object-based and indoor to outdoor. The REVERIE (Remote Embodied Referring Expression) is interesting since it only provides high-level instructions to the agent, which are closer to human commands…

Cited by 39PDFcodeScholar
2023

Sketching for First Order Method: Efficient Algorithm for Low-Bandwidth Channel and Vulnerability

ICML 2023poster

Sketching is one of the most fundamental tools in large-scale machine learning. It enables runtime and memory saving via randomly compressing the original large problem into lower dimensions. In this paper, we propose a novel sketching scheme for the first order method in large-scale distributed lea…

Cited by 33SourcePDFScholar
2022

Fast Graph Neural Tangent Kernel via Kronecker Sketching

AAAI 2022technical

Many deep learning tasks need to deal with graph data (e.g., social networks, protein structures, code ASTs). Due to the importance of these tasks, people turned to Graph Neural Networks (GNNs) as the de facto method for machine learning on graph data. GNNs have become widely applied due to their co…

Cited by 8SourcePDFScholar
2022

HOP: History-and-Order Aware Pre-Training for Vision-and-Language Navigation

CVPR 2022poster

Pre-training has been adopted in a few of recent works for Vision-and-Language Navigation (VLN). However, previous pre-training methods for VLN either lack the ability to predict future actions or ignore the trajectory contexts, which are essential for a greedy navigation process. In this work, to p…

Cited by 94PDFcodeScholar
2021

On the Convergence and Sample Efficiency of Variance-Reduced Policy Gradient Method

NeurIPS 2021spotlight

Policy gradient (PG) gives rise to a rich class of reinforcement learning (RL) methods. Recently, there has been an emerging trend to augment the existing PG methods such as REINFORCE by the \emph{variance reduction} techniques. However, all existing variance-reduced PG methods heavily rely on an u…

Cited by 85SourcePDFScholar
2020

Generalized Leverage Score Sampling for Neural Networks

NeurIPS 2020poster

Leverage score sampling is a powerful technique that originates from theoretical computer science, which can be used to speed up a large number of fundamental questions, e.g. linear regression, linear programming, semi-definite programming, cutting plane method, graph sparsification, maximum matchin…

Cited by 50SourcePDFScholar
2020

Recurrent Dirichlet Belief Networks for interpretable Dynamic Relational Data Modelling

IJCAI 2020poster

The Dirichlet Belief Network~(DirBN) has been recently proposed as a promising approach in learning interpretable deep latent representations for objects. In this work, we leverage its interpretable modelling architecture and propose a deep dynamic probabilistic framework -- the Recurrent Dirichle…

Cited by 0SourcePDFScholar
2019

Multi-step Self-attention Network for Cross-modal Retrieval Based on a Limited Text Space

ICASSP 2019accepted

Cross-modal retrieval has been recently proposed to find an appropriate subspace where the similarity among different modalities, such as image and text, can be directly measured. In this paper, we propose Multi-step Self-Attention Network (MSAN) to perform cross-modal retrieval in a limited text sp…

Cited by 0SourceScholar
2019

Online Factorization and Partition of Complex Networks by Random Walk

UAI 2019poster

Finding the reduced-dimensional structure is critical to understanding complex networks. Existing approaches such as spectral clustering are applicable only when the full network is explicitly observed. In this paper, we focus on the online factorization and partition of implicit large lumpable netw…

Cited by 5SourcePDFScholar
2017

Distributed recursive least-squares with data-adaptive censoring

ICASSP 2017accepted

The deluge of networked big data motivates the development of computation- and communication-efficient network information processing algorithms. In this paper, we propose two data-adaptive censoring strategies that significantly reduce the computation and communication costs of the distributed recu…

Cited by 0SourceScholar