activity
20242026
collaborators

6 papers

cs.LG2026

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…

cs.IR2025

RALLRec: Improving Retrieval Augmented Large Language Model Recommendation with Representation Learning

Jian Xu, Sichun Luo, Xiangyu Chen +3

Large Language Models (LLMs) have been integrated into recommendation systems to enhance user behavior comprehension. The Retrieval Augmented Generation (RAG) technique is further…

cs.IT2025

Accelerating Data Access for Single Node in Distributed Storage Systems via MDS Codes

Hao Shi, Zhengyi Jiang, Zhongyi Huang +2

Maximum distance separable (MDS) array codes are widely employed in modern distributed storage systems to provide high data reliability with small storage overhead. Compared with t…

cs.IT2024

Error Correction Decoding Algorithms of RS Codes Based on An Earlier Termination Algorithm to Find The Error Locator Polynomial

Zhengyi Jiang, Hao Shi, Zhongyi Huang +4

Reed-Solomon (RS) codes are widely used to correct errors in storage systems. Finding the error locator polynomial is one of the key steps in the error correction procedure of RS c…

cs.IT2024

Reed-Solomon Codes over Cyclic Polynomial Ring with Lower Encoding/Decoding Complexity

Wenhao Liu, Zhengyi Jiang, Zhongyi Huang +2

Reed-Solomon (RS) codes are constructed over a finite field that have been widely employed in storage and communication systems. Many fast encoding/decoding algorithms such as fast…

cs.IT2024

New EVENODD+ Codes with More Flexible Parameters and Lower Complexity

Panyu Zhu

EVENODD+ codes are binary maximum distance separable (MDS) array codes for correcting double disk failures in RAID-6 with asymptotically optimal encoding/decoding/update complexiti…