Feature Encoding with AutoEncoders for Weakly-supervised Anomaly Detection
Authors: Yingjie Zhou, Xucheng Song, Yanru Zhang, Fanxing Liu, Ce Zhu, Lingqiao Liu
AI-generated Key Points
- Paper title: "Feature Encoding with AutoEncoders for Weakly-supervised Anomaly Detection"
- Addresses the problem of weakly-supervised anomaly detection
- Previous approaches used deep neural networks to map normal and abnormal samples to different regions in the feature space or fit different distributions
- Directly training these networks with discriminative loss may not be sufficient due to limited annotated anomaly samples
- Authors propose a novel strategy using an autoencoder to encode the input data
- Three factors utilized: hidden representation, reconstruction residual vector, and reconstruction error
- New representation encodes a test sample by considering its projection on the training data manifold, its direction to its projection, and its distance to its projection
- Introduce a novel network architecture that incorporates these three factors seamlessly
- Extensive experiments demonstrate superior performance compared to competitive methods
- Innovative approach for weakly-supervised anomaly detection leveraging autoencoders and incorporating multiple factors in the encoding process
Abstract: Weakly-supervised anomaly detection aims at learning an anomaly detector from a limited amount of labeled data and abundant unlabeled data. Recent works build deep neural networks for anomaly detection by discriminatively mapping the normal samples and abnormal samples to different regions in the feature space or fitting different distributions. However, due to the limited number of annotated anomaly samples, directly training networks with the discriminative loss may not be sufficient. To overcome this issue, this paper proposes a novel strategy to transform the input data into a more meaningful representation that could be used for anomaly detection. Specifically, we leverage an autoencoder to encode the input data and utilize three factors, hidden representation, reconstruction residual vector, and reconstruction error, as the new representation for the input data. This representation amounts to encode a test sample with its projection on the training data manifold, its direction to its projection and its distance to its projection. In addition to this encoding, we also propose a novel network architecture to seamlessly incorporate those three factors. From our extensive experiments, the benefits of the proposed strategy are clearly demonstrated by its superior performance over the competitive methods.
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.
The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.
⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.
Similar papers summarized with our AI tools
Navigate through even more similar papers through a
tree representationLook for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.