Search arXiv⌕ Search

arXiv subjects

Chentao Yue

Publications and source records attributed to Chentao Yue.

At least 19 recordsLinked to original sources

Learning More by Training Less: Uncertainty-Guided Progressive Contraction for Efficient Reasoning Post-Training

Large language models have achieved remarkable advances in complex reasoning. However, scaling reasoning post-training with ever-larger corpora can substantially increase training cost without proportional performance gains. In this study, we therefore ask: how far can reasoning supervision be compressed without sacrificing capability? To this end, we propose an uncertainty-guided progressive contraction framework that concentrates supervision and optimization on the reasoning trajectories most valuable for learning. Specifically, rather than treating a teacher-generated chain-of-thought (CoT) as a single realized path, we construct uncertainty-profiled reasoning supervision by building Monte Carlo reasoning trees around intermediate reasoning states to expose process-level uncertainty. This uncertainty first contracts the original corpus into a compact teacher-informed pool. A second, learner-aware contraction then performs online routing during SFT, concentrating optimization according to the student's evolving learning state. Together, the two stages progressively contract both supervision and optimization, substantially reducing the student training budget. Experiments across diverse reasoning benchmarks and LLM families show that our method uses as little as 0.22% of the optimization budget of full-data SFT, over 450x less training exposure, while maintaining or improving reasoning performance. Notably, our framework generalizes well across heterogeneous student families, black-box teachers, and weak-to-strong transfer. This indicates that it is not only a way to accelerate training but can also enhance reasoning capability.

cs.AI↗

Iterative Semantic Decoding for Short Block Codes

This paper proposes an iteratively enhanced semantic receiver for natural-language text transmission over noisy wireless channels using multiple short block codes. At the transmitter, each sentence is permuted by a character-level interleaver, partitioned into segments, and independently encoded by short block codes. At the receiver, we develop an iterative decoder consisting of a channel decoder and a language model, where a de-interleaver between them disperses the burst decoding errors within each segment across the sentence. In each iteration, the language model denoises the channel decoding output, and the denoised characters verified to be consistent with the channel observations are fed back to the channel decoder as semantic information for the next iteration. Simulation results on the Stanford Natural Language Inference (SNLI) corpus over the additive white Gaussian noise (AWGN) channel show that the proposed receiver achieves approximately 1.5 dB block error rate (BLER) gain over conventional short-block coding, while maintaining BLEU and ROUGE scores above 99% at SNRs beyond 1.0 dB.

cs.IT↗

Semantic Error Control Coding with Foundation Models for Future Communications

Classical channel decoding typically treats all information sequences as equally likely and relies primarily on the channel observations and code structure, without exploiting statistical or semantic structure in the source data. Although source compression is designed to remove redundancy, practical source coding can leave substantial residual structure that conventional channel decoders do not exploit. Modern multimodal data sources, including text, speech, and images, exhibit rich statistical and semantic dependencies that foundation models can learn and exploit to improve channel decoding. This article introduces semantic error control coding (SECC), which seamlessly integrates the semantic structure of the source into encoding and decoding through a foundation model. The semantic source prior, represented by the model's a priori probability of the source content, directs code redundancy toward semantically important content at the encoder, and improves reliability estimation, candidate search, and error detection/correction at the decoder. The channel code keeps its algebraic structure, and its constraints ensure that the semantic suggestions from the foundation model comply with this structure. We describe the SECC framework, classify its design methods into three approaches, and demonstrate representative schemes on text sources. The demonstrated schemes show several decibels of coding gain over conventional decoding on AWGN channels, and reach error rates below the normal approximation bound. Finally, we identify several open challenges.

cs.IT↗

Semantic-Aided Iterative Decoding for Uplink Non-Orthogonal Transmission

This paper proposes semantic-aided iterative decoding (Sem-IR) for uplink non-orthogonal transmission of a shared natural-language source. K users each hold one segment of a common sentence and superimpose low-density parity-check (LDPC) coded transmissions over an additive white Gaussian noise (AWGN) channel. At the base station, an iterative elementary signal estimator (ESE) and K parallel LDPC decoders progressively cancel inter-user interference. As high-power users pass both parity and language-plausibility checks earlier, their decoded bytes form a reliable linguistic prefix for the remaining users; a fine-tuned ByT5 byte-level language model exploits this prefix to predict byte posteriors for the unconverged user. The byte posteriors are marginalized to bit-level log-likelihood ratios and convex-combined with the LDPC posteriors inside the iterative loop. The resulting feedback closes the loop between the language model and the physical-layer iteration. Simulations show that Sem-IR outperforms orthogonal time-division access (TDMA) and the same NOMA receiver without semantic feedback in block error rate (BLER), yielding an order-of-magnitude reduction over NOMA at 8 dB.

cs.IT↗

Semantic Ordered Statistics Decoding

We propose a Semantic Ordered Statistics Decoder (sem-OSD), a soft decoder for short linear block codes carrying byte-streamed sources such as natural-language text. Sem-OSD injects a byte-level language-model (LM) prior into ordered statistics decoding (OSD) through a fused bit-level score that combines channel reliability with the LM prior, and uses it for the most-reliable basis (MRB) selection and the codeword candidate scoring. Sem-OSD enumerates two complementary test-error-pattern (TEP) families: a bit-flip family that flips up to $m$ bits, and an LM-driven family of up to $ω$ byte substitutions that reaches error patterns the bit-flip family cannot. The LM prior is computed by a byte-level Transformer fine-tuned for byte-level denoising. Simulation results show that, on AWGN, sem-OSD achieves block error rates (BLERs) below the finite-blocklength normal-approximation bound for uniform sources on both binary BCH$(127,64)$ and shortened RS$(16,8)$ over GF(256), exceeding Fossorier OSD by a $1.5$ dB coding gain. On a Gilbert--Elliott burst-error channel, sem-OSD provides $4$ dB and $1$ dB of more coding gain than Berlekamp--Massey and OSD, respectively.

cs.IT↗

Semantic Error Correction and Decoding for Short Block Codes

This paper presents a semantic-enhanced receiver framework for transmitting natural language sentences over noisy wireless channels using multiple short block codes. After ASCII encoding, the sentence is divided into segments, each independently encoded with a short block code and transmitted over an AWGN channel. At the receiver, segments are decoded in parallel, followed by a semantic error correction (SEC) model, which reconstructs corrupted segments using language model context. We further propose the semantic list decoding (SLD), which generates multiple candidate reconstructions and selects the best one via weighted Hamming distance, and a semantic confidence-guided HARQ (SHARQ) mechanism that replaces CRC-based error detection with a confidence score, enabling selective segment retransmission without CRC overhead. All modules are designed and trained using bidirectional and auto-regressive transformers (BART). Simulation results demonstrate that the proposed scheme significantly outperforms conventional capacity-approaching short codes and long codes at the same rate. Specifically, SEC provides approximately 0.4 dB BLER gain over plain short-code transmission, while SLD extends this to 0.8 dB. Compared to transmitting the entire sentence as a single long 5G LDPC codeword, our approach significantly improves semantic fidelity and reduces decoding latency by up to 90\%. SHARQ further provides an additional 1.5 dB gain over conventional HARQ.

cs.IT↗

LLM-Viterbi: Semantic-Aware Decoding for Convolutional Codes

Traditional wireless communications rely solely on bit-level channel coding for error correction, without exploiting the inherent linguistic structure of the data source. This paper proposes a large language model (LLM) Viterbi decoder that integrates LLM priors into the Viterbi decoding for text transmission over AWGN channels. The proposed decoder maintains multiple candidate paths during the Viterbi decoding and periodically evaluates path reliabilities using a fine-tuned Byte-level T5 (ByT5) language model. By combining channel reliability metrics with semantic probability from the LLM, it outputs the path that maximizes the joint likelihood of channel observations and linguistic coherence. Simulations show that our decoder achieves significant performance gains over conventional Viterbi decoding in terms of both block error rate (BLER) and semantic similarity. For convolutional codes with constraint length 3, it achieves approximately 1.5 dB more coding gain in BLER, with over 50% improvements in semantic similarity. The framework can extend to other structured data sources beyond text.

cs.IT↗

BCH Coding Assisted Imaging

In modern correlation imaging systems, also known as ghost imaging (GI), particularly under low-light or noisy conditions, preserving high image fidelity presents a significant challenge. This paper introduces an innovative approach by integrating Bose-Chaudhuri-Hocquenghem (BCH) error control coding (ECC) into CGI systems to assist imaging. By encoding target image with BCH codes and using order-statistic decoding (OSD) for error correction during reconstruction, this approach significantly improves image quality across various signal-to-noise ratio (SNR) conditions. Simulation and experiment results validate that BCH coding assisted imaging achieves significantly enhanced robustness against additive white Gaussian noise (AWGN) and improved image reconstruction quality. In addition, the imaging performance of different BCH codes varies, with each code exhibiting distinct advantages based on factors such as code length and coding efficiency.

physics.optics↗

Toward Wireless Human-Machine Collaboration in the 6G Era

The next industrial revolution, Industry 5.0, will be driven by advanced technologies that foster human-machine collaboration (HMC). It will leverage human creativity, judgment, and dexterity with the machine's strength, precision, and speed to improve productivity, quality of life, and sustainability. Wireless communications, empowered by the emerging capabilities of sixth-generation (6G) wireless networks, will play a central role in enabling flexible, scalable, and low-cost deployment of geographically distributed HMC systems. In this article, we first introduce the generic architecture and key components of wireless HMC (WHMC). We then present the network topologies of WHMC and highlight impactful applications across various industry sectors. Driven by the prospective applications, we elaborate on new performance metrics that researchers and practitioners may consider during the exploration and implementation of WHMC and discuss new design methodologies. We then summarize the communication requirements and review promising state-of-the-art technologies that can support WHMC. Finally, we present a proof-of-concept case study and identify several open challenges.

eess.SY↗

Medical Referring Image Segmentation via Next-Token Mask Prediction

Medical Referring Image Segmentation (MRIS) involves segmenting target regions in medical images based on natural language descriptions. While achieving promising results, recent approaches usually involve complex design of multimodal fusion or multi-stage decoders. In this work, we propose NTP-MRISeg, a novel framework that reformulates MRIS as an autoregressive next-token prediction task over a unified multimodal sequence of tokenized image, text, and mask representations. This formulation streamlines model design by eliminating the need for modality-specific fusion and external segmentation models, supports a unified architecture for end-to-end training. It also enables the use of pretrained tokenizers from emerging large-scale multimodal models, enhancing generalization and adaptability. More importantly, to address challenges under this formulation-such as exposure bias, long-tail token distributions, and fine-grained lesion edges-we propose three novel strategies: (1) a Next-k Token Prediction (NkTP) scheme to reduce cumulative prediction errors, (2) Token-level Contrastive Learning (TCL) to enhance boundary sensitivity and mitigate long-tail distribution effects, and (3) a memory-based Hard Error Token (HET) optimization strategy that emphasizes difficult tokens during training. Extensive experiments on the QaTa-COV19 and MosMedData+ datasets demonstrate that NTP-MRISeg achieves new state-of-the-art performance, offering a streamlined and effective alternative to traditional MRIS pipelines.

cs.CV↗

Short Wins Long: Short Codes with Language Model Semantic Correction Outperform Long Codes

This paper presents a novel semantic-enhanced decoding scheme for transmitting natural language sentences with multiple short block codes over noisy wireless channels. After ASCII source coding, the natural language sentence message is divided into segments, where each is encoded with short block channel codes independently before transmission. At the receiver, each short block of codewords is decoded in parallel, followed by a semantic error correction (SEC) model to reconstruct corrupted segments semantically. We design and train the SEC model based on Bidirectional and Auto-Regressive Transformers (BART). Simulations demonstrate that the proposed scheme can significantly outperform encoding the sentence with one conventional long LDPC code, in terms of block error rate (BLER), semantic metrics, and decoding latency. Finally, we proposed a semantic hybrid automatic repeat request (HARQ) scheme to further enhance the error performance, which selectively requests retransmission depends on semantic uncertainty.

eess.SP↗

Half a Century of Distributed Byzantine Fault-Tolerant Consensus: Design Principles and Evolutionary Pathways

The concept of distributed consensus originated in the 1970s and gained widespread attention following Leslie Lamport's influential publication on the Byzantine Generals Problem in the 1980s. Over the past five decades, distributed consensus has become an extensively researched field. Practical Byzantine Fault Tolerance (PBFT) has emerged as a prominent and widely adopted solution due to its conceptual clarity, effectiveness, and resilience to arbitrary failures. However, PBFT does not universally address all scenarios, highlighting the necessity of developing a comprehensive understanding of the history, evolution, and foundational principles of distributed consensus. This article systematically reviews the historical evolution and foundational principles of distributed consensus, examining pivotal advancements including fault-tolerant state machine replication (SMR), consensus protocols in partially synchronous and asynchronous networks, and recent innovations in Directed Acyclic Graph (DAG)-based consensus mechanisms. We further analyse the core design rationales, essential components, and underlying primitives across various distributed fault-tolerant protocols. The relationship between BFT consensus mechanisms and their applications in environments requiring robust resilience against adversarial faults is also explored. Finally, we discuss emerging research areas and challenges, such as consensus for wireless and blockchain scenarios, highlighting potential future developments. This comprehensive overview offers valuable insights to inform the design, optimisation, and implementation of distributed consensus systems across multiple application scenarios.

cs.DC↗

Optimal Linear MAP Decoding of Convolutional Codes

In this paper, we propose a linear representation of BCJR maximum a posteriori probability (MAP) decoding of a rate 1/2 convolutional code (CC), referred to as the linear MAP decoding (LMAP). We discover that the MAP forward and backward decoding can be implemented by the corresponding dual soft input and soft output (SISO) encoders using shift registers. The bidrectional MAP decoding output can be obtained by combining the contents of respective forward and backward dual encoders. Represented using simple shift-registers, LMAP decoder maps naturally to hardware registers and thus can be easily implemented. Simulation results demonstrate that the LMAP decoding achieves the same performance as the BCJR MAP decoding, but has a significantly reduced decoding delay. For the block length 64, the CC of the memory length 14 with LMAP decoding surpasses the random coding union (RCU) bound by approximately 0.5 dB at a BLER of $10^{-3}$, and closely approaches both the normal approximation (NA) and meta-converse (MC) bounds.

cs.IT↗

The Guesswork of Ordered Statistics Decoding: Guesswork Complexity and Decoder Design

This paper investigates guesswork over ordered statistics and formulates the achievable guesswork complexity of ordered statistics decoding (OSD) in binary additive white Gaussian noise (AWGN) channels. The achievable guesswork complexity is defined as the number of test error patterns (TEPs) processed by OSD immediately upon finding the correct codeword estimate. The paper first develops a new upper bound for guesswork over independent sequences by partitioning them into Hamming shells and applying Hölder's inequality. This upper bound is then extended to ordered statistics, by constructing the conditionally independent sequences within the ordered statistics sequences. Next, we apply these bounds to characterize the statistical moments of the OSD guesswork complexity. We show that the achievable guesswork complexity of OSD at maximum decoding order can be accurately approximated by the modified Bessel function, which increases exponentially with code dimension. We also identify a guesswork complexity saturation threshold, where increasing the OSD decoding order beyond this threshold improves error performance without further raising the achievable guesswork complexity. Finally, the paper presents insights on applying these findings to enhance the design of OSD decoders.

cs.IT↗

GNN-based Auto-Encoder for Short Linear Block Codes: A DRL Approach

This paper presents a novel auto-encoder based end-to-end channel encoding and decoding. It integrates deep reinforcement learning (DRL) and graph neural networks (GNN) in code design by modeling the generation of code parity-check matrices as a Markov Decision Process (MDP), to optimize key coding performance metrics such as error-rates and code algebraic properties. An edge-weighted GNN (EW-GNN) decoder is proposed, which operates on the Tanner graph with an iterative message-passing structure. Once trained on a single linear block code, the EW-GNN decoder can be directly used to decode other linear block codes of different code lengths and code rates. An iterative joint training of the DRL-based code designer and the EW-GNN decoder is performed to optimize the end-end encoding and decoding process. Simulation results show the proposed auto-encoder significantly surpasses several traditional coding schemes at short block lengths, including low-density parity-check (LDPC) codes with the belief propagation (BP) decoding and the maximum-likelihood decoding (MLD), and BCH with BP decoding, offering superior error-correction capabilities while maintaining low decoding complexity.

cs.LG↗

When Distributed Consensus Meets Wireless Connected Autonomous Systems: A Review and A DAG-based Approach

The connected and autonomous systems (CAS) and auto-driving era is coming into our life. To support CAS applications such as AI-driven decision-making and blockchain-based smart data management platform, data and message exchange/dissemination is a fundamental element. The distributed message broadcast and forward protocols in CAS, such as vehicular ad hoc networks (VANET), can suffer from significant message loss and uncertain transmission delay, and faulty nodes might disseminate fake messages to confuse the network. Therefore, the consensus mechanism is essential in CAS with distributed structure to guaranteed correct nodes agree on the same parameter and reach consistency. However, due to the wireless nature of CAS, traditional consensus cannot be directly deployed. This article reviews several existing consensus mechanisms, including average/maximum/minimum estimation consensus mechanisms that apply on quantity, Byzantine fault tolerance consensus for request, state machine replication (SMR) and blockchain, as well as their implementations in CAS. To deploy wireless-adapted consensus, we propose a Directed Acyclic Graph (DAG)-based message structure to build a non-equivocation data dissemination protocol for CAS, which has resilience against message loss and unpredictable forwarding latency. Finally, we enhance this protocol by developing a two-dimension DAG-based strategy to achieve partial order for blockchain and total order for the distributed service model SMR.

cs.NI↗

Efficient Near Maximum-Likelihood Reliability-Based Decoding for Short LDPC Codes

In this paper, we propose an efficient decoding algorithm for short low-density parity check (LDPC) codes by carefully combining the belief propagation (BP) decoding and order statistic decoding (OSD) algorithms. Specifically, a modified BP (mBP) algorithm is applied for a certain number of iterations prior to OSD to enhance the reliability of the received message, where an offset parameter is utilized in mBP to control the weight of the extrinsic information in message passing. By carefully selecting the offset parameter and the number of mBP iterations, the number of errors in the most reliable positions (MRPs) in OSD can be reduced by mBP, thereby significantly improving the overall decoding performance of error rate and complexity. Simulation results show that the proposed algorithm can approach the maximum-likelihood decoding (MLD) for short LDPC codes with only a slight increase in complexity compared to BP and a significant decrease compared to OSD. Specifically, the order-(m-1) decoding of the proposed algorithm can achieve the performance of the order-m OSD.

cs.IT↗

Efficient Decoders for Short Block Length Codes in 6G URLLC

This paper reviews the potential channel decoding techniques for ultra-reliable low-latency communications (URLLC). URLLC is renowned for its stringent requirements including ultra-reliability, low end-to-end transmission latency, and packet-size flexibility. These requirements exacerbate the difficulty of the physical-layer design, particularly for the channel coding and decoding schemes. To satisfy the requirements of URLLC, decoders must exhibit superior error-rate performance \black{and} low decoding complexity. \black{Also, it is desired that decoders be universal} to accommodate various coding schemes. This paper provides a comprehensive review and comparison of different candidate decoding techniques for URLLC in terms of their error-rate performance and computational complexity for structured and random short codes. We further make recommendations of the decoder selections and suggest several potential research directions.

cs.IT↗