Kernel Bandwidth Selection for SVDD: Peak Criterion Approach for Large Data
Sergiy Peredriy, Deovrat Kakde, Arin Chaudhuri

TL;DR
This paper introduces an extended Peak criterion method for selecting the Gaussian kernel bandwidth in SVDD, improving efficiency and accuracy for large datasets in outlier detection and one-class classification.
Contribution
The paper proposes a scalable extension of the Peak criterion for kernel bandwidth selection in SVDD, enabling effective large-scale data description.
Findings
The proposed method outperforms existing techniques in convergence speed.
It provides better boundary fitting for large datasets.
Empirical results demonstrate improved accuracy and efficiency.
Abstract
Support Vector Data Description (SVDD) provides a useful approach to construct a description of multivariate data for single-class classification and outlier detection with various practical applications. Gaussian kernel used in SVDD formulation allows flexible data description defined by observations designated as support vectors. The data boundary of such description is non-spherical and conforms to the geometric features of the data. By varying the Gaussian kernel bandwidth parameter, the SVDD-generated boundary can be made either smoother (more spherical) or tighter/jagged. The former case may lead to under-fitting, whereas the latter may result in overfitting. Peak criterion has been proposed to select an optimal value of the kernel bandwidth to strike the balance between the data boundary smoothness and its ability to capture the general geometric shape of the data. Peak criterion…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
