A One-Class Support Vector Machine (SVM) is an unsupervised learning algorithm that constructs a hyperplane or hypersphere to tightly encapsulate the distribution of a single, known class of data. Unlike binary classifiers, it is trained exclusively on positive examples and learns to define the concept of 'normality' by finding the maximal margin boundary that separates the training data from the origin in a high-dimensional feature space induced by a kernel function.
Glossary
One-Class SVM

What is One-Class SVM?
A classical machine learning algorithm that learns a decision boundary enclosing the known training data in a high-dimensional kernel space, classifying points outside the boundary as novel.
In the context of open set signal recognition, a One-Class SVM is trained on the feature embeddings of known modulation types to create a compact decision frontier. Any incoming signal whose feature vector falls outside this learned boundary is flagged as a novel or unknown modulation scheme, enabling robust rejection of emitter types not seen during training without requiring prior examples of the unknown classes.
Key Features of One-Class SVM
One-Class SVM learns a tight decision boundary around known modulation data in a high-dimensional kernel space, treating anything outside as novel. Here are its defining characteristics for open set signal recognition.
Kernelized Boundary Learning
Projects input features into a high-dimensional kernel space (typically using a Radial Basis Function (RBF) kernel) where the algorithm finds a hyperplane that maximally separates the training data from the origin. The nu parameter controls the fraction of training samples allowed to fall outside the boundary, directly setting the model's tolerance to outliers in the known modulation set. This creates a tight, non-linear envelope around the target class.
Decision Function Scoring
For each new IQ sample or feature vector, the model computes a decision function score. A positive score indicates the point lies within the learned boundary (known modulation), while a negative score flags it as novel or anomalous. The magnitude of the score reflects the distance from the boundary, providing a continuous measure of novelty confidence rather than a binary label. This is critical for setting adjustable detection thresholds in spectrum monitoring.
Training on a Single Class
Unlike multi-class classifiers that require labeled examples of all possible modulations, One-Class SVM trains exclusively on positive examples of the known signal type. This makes it ideal for open set recognition where unknown modulation schemes are, by definition, unavailable during training. The model builds a model of normality from only the target class, avoiding the closed-set assumption entirely.
Support Vector Sparsity
The final decision boundary is defined only by a subset of training points called support vectors—samples that lie on or within the margin. This sparsity makes inference computationally efficient, as only the kernel evaluation against support vectors is needed for each new prediction. For edge-deployed spectrum sensors, this reduces memory footprint and latency compared to dense neural alternatives.
Hyperparameter Sensitivity
Performance hinges on two critical hyperparameters: nu (upper bound on outlier fraction, lower bound on support vectors) and gamma (RBF kernel width). A small gamma produces a smooth, generalized boundary that may miss subtle anomalies. A large gamma creates a tight, wiggly boundary that overfits to noise. Cross-validation on held-out known samples is essential for tuning these values to the specific signal-to-noise regime.
Limitations in High-Dimensional Data
While effective on engineered features like higher-order cumulants or cyclostationary signatures, One-Class SVM struggles with raw, high-dimensional IQ samples. The curse of dimensionality degrades kernel distance metrics, and the model lacks the hierarchical feature extraction capability of deep learning. For raw waveform novelty detection, it is often outperformed by autoencoder-based anomaly detection or Deep SVDD.
Frequently Asked Questions
Explore the mechanics and application of the One-Class Support Vector Machine, a foundational algorithm for novelty detection in open-set signal recognition, enabling systems to identify unknown modulation schemes by learning the boundary of known data.
A One-Class Support Vector Machine (SVM) is an unsupervised learning algorithm that learns a decision boundary to enclose the known training data in a high-dimensional kernel space, classifying any point outside this boundary as a novelty or anomaly. Unlike standard binary SVMs that separate two classes, a One-Class SVM is trained solely on a single 'normal' class. It operates by mapping input features into a kernel space and finding a maximal-margin hyperplane that separates the mapped data from the origin. The algorithm's objective is to maximize the distance between this hyperplane and the origin, effectively creating a tight, spherical boundary around the data distribution. A critical hyperparameter, ν (nu), controls the upper bound on the fraction of training errors and the lower bound on the fraction of support vectors, allowing you to tune the model's sensitivity to outliers. In the context of open-set signal recognition, the known modulation types (e.g., QPSK, 16QAM) form the 'normal' class, and any signal with an unknown or novel modulation scheme will fall outside the learned boundary and be flagged for rejection.
Enabling Efficiency, Speed & Accuracy
Intelligent Analysis, Decision & Execution
We build AI systems for teams that need search across company data, workflow automation across tools, or AI features inside products and internal software.
Talk to Us
Search across company data
Give teams answers from docs, tickets, runbooks, and product data with sources and permissions.
Useful when people spend too long searching or get different answers from different systems.

Automate internal workflows
Use AI to route work, draft outputs, trigger actions, and keep approvals and logs in place.
Useful when repetitive work moves across multiple tools and teams.

Add AI to products and internal tools
Build assistants, guided actions, or decision support into the software your team or customers already use.
Useful when AI needs to be part of the product, not a separate tool.
Related Terms
Explore the core algorithms and concepts that work alongside One-Class SVM to build robust open-set signal classifiers.
Autoencoder Anomaly Detection
A neural network trained to reconstruct normal training data. During inference, the reconstruction error serves as a novelty score; unknown modulation schemes produce high error as they fall outside the learned manifold.
- Learns a compressed latent representation of known signals
- Flags inputs exceeding a statistically derived error threshold
- Sensitive to architectural choices like bottleneck size
Extreme Value Theory (EVT)
A statistical framework for modeling the tail behavior of distributions. In open set recognition, EVT fits a Weibull distribution to the distance of correct classifications from their class mean, enabling calibrated rejection of unknown modulations.
- Forms the mathematical basis for the OpenMax layer
- Models the probability of extreme events beyond observed data
- Avoids assumptions about the overall distribution shape
Mahalanobis Distance
A distance metric that accounts for the covariance structure of a class distribution. It measures how many standard deviations a point is from the mean of a distribution, providing a statistically informed score for out-of-distribution detection.
- Reduces to Euclidean distance when features are uncorrelated
- Requires estimating the class-conditional covariance matrix
- More robust to feature scaling than Euclidean distance
Outlier Exposure
A regularization technique that improves novelty detection by training the model with an auxiliary dataset of diverse outlier examples. This forces the network to learn a tighter decision boundary around known classes.
- Requires curating a representative set of non-target signals
- Teaches the model to produce uniform, high-entropy outputs for outliers
- Significantly boosts AUROC for out-of-distribution detection
Energy-Based Models
A class of models that learn an energy function assigning low energy to in-distribution data and high energy to out-of-distribution data. The Helmholtz free energy serves as a discriminative score for novelty.
- Aligns with the physical concept of lowest energy states
- Can be derived from any pre-trained classifier's logits
- Avoids the overconfidence problem of SoftMax probabilities

About the author
Prasad Kumkar
CEO & MD, Inference Systems
Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.
His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us