Semi-supervised multiscale dual-encoding method for faulty traffic data
detection
- URL: http://arxiv.org/abs/2212.13596v1
- Date: Tue, 27 Dec 2022 20:07:52 GMT
- Title: Semi-supervised multiscale dual-encoding method for faulty traffic data
detection
- Abstract summary: We introduce a variational autoencoder (VAE) based semi-supervised method for detection of faulty traffic data.
Our experiments show that the proposed architecture with the dual encoding scheme, coupled with attention module, outperforms other encoding schemes.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Inspired by the recent success of deep learning in multiscale information
encoding, we introduce a variational autoencoder (VAE) based semi-supervised
method for detection of faulty traffic data, which is cast as a classification
problem. Continuous wavelet transform (CWT) is applied to the time series of
traffic volume data to obtain rich features embodied in time-frequency
representation, followed by a twin of VAE models to separately encode normal
data and faulty data. The resulting multiscale dual encodings are concatenated
and fed to an attention-based classifier, consisting of a self-attention module
and a multilayer perceptron. For comparison, the proposed architecture is
evaluated against five different encoding schemes, including (1) VAE with only
normal data encoding, (2) VAE with only faulty data encoding, (3) VAE with both
normal and faulty data encodings, but without attention module in the
classifier, (4) siamese encoding, and (5) cross-vision transformer (CViT)
encoding. The first four encoding schemes adopted the same convolutional neural
network (CNN) architecture while the fifth encoding scheme follows the
transformer architecture of CViT. Our experiments show that the proposed
architecture with the dual encoding scheme, coupled with attention module,
outperforms other encoding schemes and results in classification accuracy of
96.4%, precision of 95.5%, and recall of 97.7%.
Related papers
- Learning to Decode in Parallel: Self-Coordinating Neural Network for Real-Time Quantum Error Correction [16.310410074065743]
We present the first scalable, neural-network-based parallel decoding framework that simultaneously achieves SOTA accuracy and the stringent throughput required for real-time quantum error correction.<n>We demonstrate that, using our approach, a single TPU v6e is capable of decoding surface codes with distances up to 25 within 1us per decoding round.
arXiv Detail & Related papers (2026-01-14T23:04:25Z) - Decoding Correlated Errors in Quantum LDPC Codes [41.04211723135311]
We introduce a decoding framework for correlated errors in quantum LDPC codes under circuit-level noise.<n>The core of our approach is a graph augmentation and rewiring for interference (GARI) method, which modifies the correlated detector error model.<n>Preliminary FPGA implementation results show that such high accuracy can be achieved in real time, with a per-round average decoding latency of 273 ns and sub-microsecond latency in 99.99% of the decoding instances.
arXiv Detail & Related papers (2025-10-15T19:59:05Z) - Triplet Loss Based Quantum Encoding for Class Separability [2.7641963278515114]
The encoding circuit is trained using a triplet loss function inspired by classical facial recognition algorithms.<n> Benchmark tests performed on various binary classification tasks on MNIST and MedMNIST datasets demonstrate considerable improvement over amplitude encoding with the same VQC structure.
arXiv Detail & Related papers (2025-09-19T07:28:19Z) - Cross-Attention Message-Passing Transformers for Code-Agnostic Decoding in 6G Networks [14.631435001491514]
Channel coding for 6G networks is expected to support a wide range of requirements arising from heterogeneous communication scenarios.<n>Traditional code-specific decoders lack the flexibility and scalability required for next-generation systems.<n>We propose an AI-native foundation model for unified and code-agnostic decoding based on the transformer architecture.
arXiv Detail & Related papers (2025-06-22T16:08:42Z) - Data Encoding for VQC in Qiskit, A Comparison With Novel Hybrid Encoding [0.0]
Amplitude encoding reduces the required qubits, Angle encoding makes state freedom better and is used for expressive encoding and Phase-based distinction.
This paper demonstrates that efficient qubit usage is ensured as Amplitude encoding reduces the required qubits, Angle encoding makes state freedom better and is used for expressive encoding and Phase-based distinction.
arXiv Detail & Related papers (2025-03-18T09:36:09Z) - Threshold Selection for Iterative Decoding of $(v,w)$-regular Binary Codes [84.0257274213152]
Iterative bit flipping decoders are an efficient choice for sparse $(v,w)$-regular codes.
We propose concrete criteria for threshold determination, backed by a closed form model.
arXiv Detail & Related papers (2025-01-23T17:38:22Z) - On the Design and Performance of Machine Learning Based Error Correcting Decoders [3.8289109929360245]
We first consider the so-called single-label neural network (SLNN) and the multi-label neural network (MLNN) decoders which have been reported to achieve near maximum likelihood (ML) performance.
We then turn our attention to two transformer-based decoders: the error correction code transformer (ECCT) and the cross-attention message passing transformer (CrossMPT)
arXiv Detail & Related papers (2024-10-21T11:23:23Z) - Error Correction Code Transformer: From Non-Unified to Unified [20.902351179839282]
Traditional decoders were typically designed as fixed hardware circuits tailored to specific decoding algorithms.
This paper proposes a unified, code-agnostic Transformer-based decoding architecture capable of handling multiple linear block codes.
arXiv Detail & Related papers (2024-10-04T12:30:42Z) - 4D ASR: Joint Beam Search Integrating CTC, Attention, Transducer, and Mask Predict Decoders [53.297697898510194]
We propose a joint modeling scheme where four decoders share the same encoder -- we refer to this as 4D modeling.
To efficiently train the 4D model, we introduce a two-stage training strategy that stabilizes multitask learning.
In addition, we propose three novel one-pass beam search algorithms by combining three decoders.
arXiv Detail & Related papers (2024-06-05T05:18:20Z) - CrossMPT: Cross-attention Message-Passing Transformer for Error Correcting Codes [14.631435001491514]
We propose a novel Cross-attention Message-Passing Transformer (CrossMPT)
We show that CrossMPT significantly outperforms existing neural network-based decoders for various code classes.
Notably, CrossMPT achieves this decoding performance improvement, while significantly reducing the memory usage, complexity, inference time, and training time.
arXiv Detail & Related papers (2024-05-02T06:30:52Z) - Efficient Encoder-Decoder Transformer Decoding for Decomposable Tasks [53.550782959908524]
We introduce a new configuration for encoder-decoder models that improves efficiency on structured output and decomposable tasks.
Our method, prompt-in-decoder (PiD), encodes the input once and decodes the output in parallel, boosting both training and inference efficiency.
arXiv Detail & Related papers (2024-03-19T19:27:23Z) - Transformer-QEC: Quantum Error Correction Code Decoding with
Transferable Transformers [18.116657629047253]
We introduce a transformer-based Quantum Error Correction (QEC) decoder.
It employs self-attention to achieve a global receptive field across all input syndromes.
It incorporates a mixed loss training approach, combining both local physical error and global parity label losses.
arXiv Detail & Related papers (2023-11-27T18:52:25Z) - Testing the Accuracy of Surface Code Decoders [55.616364225463066]
Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC)
This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
arXiv Detail & Related papers (2023-11-21T10:22:08Z) - Denoising Diffusion Error Correction Codes [92.10654749898927]
Recently, neural decoders have demonstrated their advantage over classical decoding techniques.
Recent state-of-the-art neural decoders suffer from high complexity and lack the important iterative scheme characteristic of many legacy decoders.
We propose to employ denoising diffusion models for the soft decoding of linear codes at arbitrary block lengths.
arXiv Detail & Related papers (2022-09-16T11:00:50Z) - Graph Neural Networks for Channel Decoding [71.15576353630667]
We showcase competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes.
The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph.
We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results.
arXiv Detail & Related papers (2022-07-29T15:29:18Z) - Error Correction Code Transformer [92.10654749898927]
We propose to extend for the first time the Transformer architecture to the soft decoding of linear codes at arbitrary block lengths.
We encode each channel's output dimension to high dimension for better representation of the bits information to be processed separately.
The proposed approach demonstrates the extreme power and flexibility of Transformers and outperforms existing state-of-the-art neural decoders by large margins at a fraction of their time complexity.
arXiv Detail & Related papers (2022-03-27T15:25:58Z) - Encoding Syntactic Knowledge in Transformer Encoder for Intent Detection
and Slot Filling [6.234581622120001]
We propose a novel Transformer encoder-based architecture with syntactical knowledge encoded for intent detection and slot filling.
We encode syntactic knowledge into the Transformer encoder by jointly training it to predict syntactic parse ancestors and part-of-speech of each token via multi-task learning.
arXiv Detail & Related papers (2020-12-21T21:25:11Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.