arXiv:2605.10681v2 Announce Type: replace-cross
Abstract: Forward error correction is essential for reliable communication over noisy channels. Attention-based model-free neural decoders have shown s...
By Rostislav Gusev, Nikita Aleksandrov, Artem Solomkin, Dmitry Artemasov
The paper demonstrates that incorporating code automorphisms into syndrome-based neural decoding (SBND) improves the models’ learning and generalization through data augmentation during training and inference. By applying this technique to short, high-rate codes, the authors achieve performance close to maximum likelihood decoding (MLD) using small datasets and appropriate training. The study also indicates that previous SBND results may have underestimated their true error‑correction capability due to insufficient training.
By Rapha\"el Le Bidan, Ahmad Ismail, Elsa Dupraz, Charbel Abdel Nour
Scalable Neural Video Representation Compression (S-NVRC) introduces a scalable implicit neural representation (INR) video codec that supports fine-grained bitrate and decoding‑complexity scalability from a single embedded bitstream. It uses a coarse‑to‑fine prefix for feature grids and a nested prefix for network layers, enabling a wide range of operating points while maintaining a single encoding. On the UVG dataset, S‑NVRC outperforms SHM 12.4 and multi‑layer VTM‑20.0 by 43.7 % and 5.6 % in BD‑rate, respectively, and offers flexible complexity scalability.
By Tianhao Peng, Ho Man Kwan, Fan Zhang, Shan Liu, David Bull
arXiv:2607. 28418v1 Announce Type: cross Abstract: Pruning is a promising approach for improving the efficiency of LLMs.
By Haozhe Hu, Hao Wu, Peiran Yin, Chao Han, Yunpu Ma, Xiaoyu Shen
arXiv:2607. 07953v1 Announce Type: cross Abstract: Self-attention lets each token retrieve information from the full context, but its quadratic cost in sequence length limits training and inference at long context.
By Tommaso Cerruti, Tim Rieder, George Rowlands, Lingfeng Jin, Imanol Schlag
StableVQ introduces practical guidelines to improve training stability for vector‑quantized tokenizers used in image generation models. It addresses instability caused by the entanglement of encoder–decoder and codebook training by proposing three techniques: Dynamic STE for the encoder, Region VQ Loss for the codebook, and a Decoupled Schedule for independent learning rates. Experiments on ImageNet show consistent gains in stability, codebook utilization, and reconstruction quality across various settings.
By Bao Tang, Jiahao Guo, Haoxiang Cao, Wenyu Liu, Changqian Yu, Kun Gai, Xinggang Wang
arXiv:2609.16656v1 Announce Type: new
Abstract: State space models (SSMs), particularly Mamba, have emerged as efficient alternatives to attention-based architectures and have been extended to vision...
By Jonghyeon Lim, Changhoon Yim
The paper introduces LoopCD, a training‑free contrastive decoding framework that improves token selection in Loop‑Transformer models by comparing the final prediction with earlier recurrent passes. LoopCD operates either in logit space (LoopCD‑Logits) with a single extra output pass or in hidden‑state space (LoopCD‑Hidden) with no output overhead. Across multiple looped Transformer families, LoopCD yields significant performance gains—raising pass@1 scores on tasks such as AIME 2024 and HumanEval—while enabling a reduction in the number of recurrent loops and a corresponding decrease in inference FLOPs.
By Weihao Liu, Huangjie Zheng, Tianrong Chen, Rohit Dilip, Richard He Bai, Yizhu Jiao, Yuyang Wang, Ruixiang Zhang
arXiv:2609.31620v1 Announce Type: new
Abstract: Representation autoencoders (RAEs) reuse features from a pretrained visual encoder as reconstruction and diffusion latents, integrating strong visual r...
By Hongyang Du, Yunfei Xie, Junjie Ye, Jiawei Yang, Xiaoyan Cong, Haodong Zhang, Yongchao Huang, Haiyu Wu, Zongxia Li, Shihang Gui, Dawei Liu, Runhao Li, Jingcheng Ni, Chen Wei, Randall Balestriero, Yue Wang
arXiv:2608. 15412v1 Announce Type: cross Abstract: Encoder-based code representation models remain widely deployed for discriminative tasks such as clone detection and code classification, where their small size and low inference cost are decisive.
By Yifeng He, Yundi Xu, Christopher Castro Gaw Gonzalo, Zili Wang, Hao Chen
The paper investigates how the sequence of hidden-state optimization affects feature learning in local-learning models, specifically predictive coding networks (PCNs). It introduces a boundary-first inference schedule that first aligns hidden states at chunk boundaries before refining representations within each chunk. Experiments on CIFAR-10 show that this approach improves accuracy by 9.77% over standard PCNs and 5.51% under a different parametrization, with diagnostics indicating stronger feature learning.
By Xueyuan Li, Danilo Vasconcellos Vargas
State space models (SSMs), particularly Mamba, have emerged as efficient alternatives to attention-based architectures and have been extended to vision through ViM, VMamba, and Visual State Space Dual...