Towards Convexity in Anomaly Detection: A New Formulation of SSLM with Unique Optimal Solutions

Дата публикации: 17-08-2026 20:26:00

An unsolved issue in widely used methods such as Support Vector Data Description (SVDD) and Small Sphere and Large Margin SVM (SSLM) for anomaly detection is their nonconvexity, which hampers the analysis of optimal solutions in a manner similar to SVMs and limits their applicability in large-scale scenarios. In this paper, we introduce a novel convex SSLM formulation which has been demonstrated to revert to a convex quadratic programming problem for hyperparameter values of interest. Leveraging the convexity of our method, we derive numerous results that are unattainable with traditional nonconvex approaches. We conduct a thorough analysis of how hyperparameters influence the optimal solution, pointing out scenarios where optimal solutions can be trivially found and identifying instances of illposedness. Most notably, we establish connections between our method and traditional approaches, providing a clear determination of when the optimal solution is unique-a task unachievable with traditional nonconvex methods. We also derive the $\nu$-property to elucidate the interactions between hyperparameters and the fractions of support vectors and margin errors in both positive and negative classes.

Схожие новости

#	Наименование новости	Тональность	Информативность	Дата публикации
1	Optimizing Attention with Mirror Descent: Generalized Max-Margin Token Selection	0	6.96	17-08-2026
2	Unsupervised Feature Selection via Nonnegative Orthogonal Constrained Regularized Minimization	0	5.33	17-08-2026
3	The Sample Complexity of Parameter-Free Stochastic Convex Optimization	0	5.7	17-08-2026
4	A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems	0	13.11	17-08-2026
5	A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization	0	8	17-08-2026
6	Near-optimal Delta-convex Estimation of Lipschitz Functions	0	9.71	17-08-2026
7	Graph-based Clustering Revisited: A Relaxation of Kernel k-Means Perspective	0	10.94	17-08-2026
8	Statistical Learning Theory for Neural Operators	0	10.21	17-08-2026
9	Semi-supervised learning for linear extremile regression	0	6.83	17-08-2026
10	Gradient Span Algorithms Make Predictable Progress in High Dimension	0	6.38	17-08-2026

Классификация: Пресс-релизы. Схожих патентов: 0. Схожих новостей: 10. Тональность: 0. Информативность: 5.9. Источник: jmlr.org.