Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

3196379561,274 · Jun 202019922001200920172026
48 results for support vector data description

Support Vector Data Description (SVDD) is a popular outlier detection technique which constructs a flexible description of the input data. SVDD computation time is high for large training datasets which limits its use in big-data process-monitoring applications. We propose a new iterative sampling-based method for SVDD…

2016-06-16abs ↗pdf ↗

In this paper, we propose a novel method for projecting data from multiple modalities to a new subspace optimized for one-class classification. The proposed method iteratively transforms the data from the original feature space of each modality to a new common feature space along with finding a joint compact descriptio…

2019-04-16abs ↗pdf ↗

We propose a probabilistic enhancement of standard kernel Support Vector Machines for binary classification, in order to address the case when, along with given data sets, a description of uncertainty (e.g., error bounds) may be available on each datum. In the present paper, we specifically consider Gaussian distributi…

2019-04-14abs ↗pdf ↗

Support vector data description (SVDD) is a machine learning technique that is used for single-class classification and outlier detection. The idea of SVDD is to find a set of support vectors that defines a boundary around data. When dealing with online or large data, existing batch SVDD methods have to be rerun in eac…

2017-09-01abs ↗pdf ↗

New results on risk estimation for SVM and related methods.

problem Estimating risk in support vector machine applications.
method Expanding relaxation theory to support vector methods and analyzing their generalization ability.
result Risk approaches ratio of complexity to data sample size as sample size increases.

Maximum entropy distributions with discrete support in mm dimensions arise in machine learning, statistics, information theory, and theoretical computer science. While structural and computational properties of max-entropy distributions have been extensively studied, basic questions such as: Do max-entropy distributio…

2017-11-06abs ↗pdf ↗

Proposes LAMA for principled SVDD hyperparameter estimation.

problem Estimating SVDD hyperparameters is difficult and heuristic methods are unreliable.
method LAMA (Local Active Min-Max Alignment) using active learning and kernel alignment.
result LAMA provides evidence-based estimates for SVDD hyperparameters with quality scores.

Improves anomaly detection with contaminated unlabeled data.

problem Weakness in existing semi-supervised anomaly detection methods when unlabeled data contain anomalies.
method Integrates positive-unlabeled learning with deep anomaly detection models.
result Achieves better detection performance on various datasets.

Morse neural networks improve uncertainty quantification and detection.

problem Uncertainty quantification and out-of-distribution detection.
method Generalizes unnormalized Gaussian densities to high-dimensional submanifolds using KL-divergence loss.
result Unified approach for OOD detection, anomaly detection, and continuous learning.

We discuss a general technique that can be used to form a differentiable bound on the optima of non-differentiable or discrete objective functions. We form a unified description of these methods and consider under which circumstances the bound is concave. In particular we consider two concrete applications of the metho…

2012-12-18abs ↗pdf ↗

We generalize a support vector machine to a support spinor machine by using the mathematical structure of wedge product over vector machine in order to extend field from vector field to spinor field. The separated hyperplane is extended to Kolmogorov space in time series data which allow us to extend a structure of sup…

2017-09-11abs ↗pdf ↗

A new method for support vector regression using a data-driven insensitive parameter.

problem Determining an optimal insensitive parameter in support vector regression.
method A data-driven approach to approximate the insensitive parameter by minimizing a generalized loss function based on the likelihood principle.
result The proposed method outperforms traditional support vector regression methods and has lower computational costs.

Support Vector Machine (SVM) is an efficient classification approach, which finds a hyperplane to separate data from different classes. This hyperplane is determined by support vectors. In existing SVM formulations, the objective function uses L2 norm or L1 norm on slack variables. The number of support vectors is a me…

2018-04-06abs ↗pdf ↗

New algorithms reduce computational burden for principal support vector machines.

problem High computational cost of principal support vector machines for large datasets.
method Two distributed estimation algorithms for principal support vector machines.
result Statistical efficiency is maintained with distributed algorithms.

Solving different types of optimization models (including parameters fitting) for support vector machines on large-scale training data is often an expensive computational task. This paper proposes a multilevel algorithmic framework that scales efficiently to very large data sets. Instead of solving the whole training s…

2014-10-13abs ↗pdf ↗

A new SVM method for predicting time series labels.

problem Learning to predict labels from high-dimensional time series data.
method Extended SVM concept to continuous time series data, formulated as a convex optimization problem.
result Empirical results show the algorithm's effectiveness for analyzing long-term multivariate data.

This paper speeds up SVC clustering by compressing data while preserving key properties.

problem Efficiently clustering large-scale real-world data sets.
method Spectrum-preserving data compression for fast support vector clustering.
result Achieved 100X and 115X speedups on real-world data sets while maintaining clustering quality.

Paper proposes DMGD for integrating outlier and community detection in graph embedding.

problem Outlier nodes affect graph embedding of regular nodes, especially in networks with multiple communities.
method DMGD integrates outlier and community detection with node embedding using multiclass graph description.
result DMGD detects outliers relative to their communities and achieves better node embedding compared to state-of-the-arts.

This paper proposes the adaptation of Support Vector Data Description (SVDD) to the multiple kernel case (MK-SVDD), based on SimpleMKL. It also introduces a variant called Slim-MK-SVDD that is able to produce a tighter frontier around the data. For the sake of comparison, the equivalent methods are also developed for O…

2017-12-07abs ↗pdf ↗

Deep-learning model detects ASD from MRI data with high accuracy.

problem Challenges in diagnosing ASD due to subjective behavioral assessments and informant biases.
method Integrates deep-learning and SVM techniques to classify ASD brain scans.
result Highly accurate classification of ASD brain scans from neurotypical scans.

The support vector machine (SVM) is a widely used method for classification. Although many efforts have been devoted to develop efficient solvers, it remains challenging to apply SVM to large-scale problems. A nice property of SVM is that the non-support vectors have no effect on the resulting classifier. Motivated by …

2013-10-25abs ↗pdf ↗

SVM generalizes well even with many support vectors in high dimensions.

problem Generalization of SVM in high-dimensional spaces with many support vectors.
method Identified new deterministic equivalences and proved conditions for support vector proliferation.
result Broadened conditions for SVM generalization in high-dimensional settings and proved converse result.

SVM and linear regression models coincide in high dimensions.

problem Understanding the connection between SVM and linear regression in high-dimensional data.
method Analyzing feature models and proving lower bounds on dimensionality.
result A sharp phase transition in Gaussian feature models, with support vector proliferation occurring only in very high dimensions.

The least-squares support vector machine is a frequently used kernel method for non-linear regression and classification tasks. Here we discuss several approximation algorithms for the least-squares support vector machine classifier. The proposed methods are based on randomized block kernel matrices, and we show that t…

2017-03-22abs ↗pdf ↗

The support vector machine is a flexible optimization-based technique widely used for classification problems. In practice, its training part becomes computationally expensive on large-scale data sets because of such reasons as the complexity and number of iterations in parameter fitting methods, underlying optimizatio…

2016-11-16abs ↗pdf ↗

The paper improves SVR with linear constraints for better model properties.

problem Improving Support Vector Regression with linear constraints.
method Generalized SMO algorithm for solving optimization with linear constraints.
result The proposed method shows better practical performance on various datasets.

GBOC detects anomalies in time series data using granular-ball vectors.

problem Challenges in modeling normal behavior in dynamic, nonlinear time series data.
method Granular-ball Vector Data Description (GVDD) and Granular-ball One-Class Network (GBOC).
result GBOC improves anomaly detection in time series data.