7 citations · 8 across the 5 of their papers we have counts for
6 papers
Anchor-and-Harvest Curriculum: A Fully Unmasked Non-LLM Curriculum for Craftax
Jiayu Zhu, Luyuan Li, Yuyuan Shi +1
We introduce Anchor-and-Harvest Curriculum (AHC), a domain-informed, rule-based training system for Craftax-Full. AHC combines achievement-oriented tasks, harvested initial-state p…
MDS Array Codes With Small Sub-packetization Levels and Small Repair Degrees
Jie Li, Yi Liu, Xiaohu Tang +3
High-rate minimum storage regenerating (MSR) codes are known to require a large sub-packetization level, which can make meta-data management difficult and hinder implementation in…
MDS Array Codes With (Near) Optimal Repair Bandwidth for All Admissible Repair Degrees
Jie Li, Yi Liu, Xiaohu Tang +3
Abundant high-rate (n, k) minimum storage regenerating (MSR) codes have been reported in the literature. However, most of them require contacting all the surviving nodes during a n…
Joint Hybrid Beamforming and User Scheduling for Multi-Satellite Cooperative Networks
Xuan Zhang, Shu Sun, Meixia Tao +2
In this paper, we consider a cooperative communication network where multiple satellites provide services for ground users (GUs) (at the same time and on the same frequency). The c…
Robust, Secure and Private Cache-aided Scalar Linear Function Retrieval from Distributed System with Blind and Adversarial Servers
Qifa Yan, Xiaohu Tang, Zhengchun Zhou
In this work, a distributed server system composed of multiple servers that holds some coded files and multiple users that are interested in retrieving the linear functions of the…
Mutual Information-Maximizing Quantized Belief Propagation Decoding of Regular LDPC Codes
Xuan He, Kui Cai, Zhen Mei +2
In this paper, we propose a class of finite alphabet iterative decoder (FAID), called mutual information-maximizing quantized belief propagation (MIM-QBP) decoder, for decoding reg…