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.

169,051 papers · 148 categories

Trend · papers per month

6.7%13.3%20.0%26.7% · Feb 199519922001200920182026
48 results for support vector

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.

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 ↗

Support vector machines have attracted much attention in theoretical and in applied statistics. Main topics of recent interest are consistency, learning rates and robustness. In this article, it is shown that support vector machines are qualitatively robust. Since support vector machines can be represented by a functio…

2009-12-04abs ↗pdf ↗

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 ↗

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.

Study on recovering supports of multiple sparse vectors from mixed linear measurements.

problem Recovering supports of multiple sparse vectors from a mixture of linear measurements.
method Developed algorithms to identify the support of all component vectors using polynomial and quasi-polynomial number of measurements.
result Polynomial and quasi-polynomial number of measurements sufficient for recovering the supports of all component vectors.

The paper proposes an algorithm to enumerate K best models with distinct support vectors for SVM.

problem Finding multiple models with distinct support vectors for non-standard machine learning applications.
method A K-best model enumeration algorithm for SVM that efficiently finds models with distinct support vectors in the dual SVM problem.
result The algorithm efficiently finds the next best model with small latency, useful for interactive examination of requirements.

Efficiently handles large support vectors in kernelized online learning.

problem Efficiency in communication for large support vectors in kernelized models.
method Extends a previously proposed protocol to kernelized online learners, introducing a novel communication criterion.
result Communication is bounded by the loss suffered, improving efficiency.

This paper proposes MMD-SVR to improve SVR's margin distribution for better generalization.

problem Improving SVR's generalization performance by maximizing the margin distribution of the whole dataset.
method Introducing MMD-SVR with coupled constraints to convert a non-convex optimization problem into a convex one.
result MMD-SVR significantly improves prediction accuracy and generalization compared to classic SVR.

Rgtsvm provides a fast and flexible support vector machine (SVM) implementation for the R language. The distinguishing feature of Rgtsvm is that support vector classification and support vector regression tasks are implemented on a graphical processing unit (GPU), allowing the libraries to scale to millions of examples…

2017-06-17abs ↗pdf ↗

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.

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.

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 ↗

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 ↗

Support vector classifier constructs confidence sets for binary classification.

problem Learning confidence sets with specific probability guarantees for binary classification.
method Support vector classifier to construct confidence sets.
result The proposed learner controls non-coverage rates and minimizes ambiguity with high probability.

Statistical learning theory explains SVMs for data-driven decision making.

problem Decision making and model construction from data.
method Statistical learning theory, focusing on empirical and structural risk minimization.
result Support Vector Machines (SVMs) are a prominent implementation of structural risk minimization.

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 ↗

The support vector machine (SVM) is an important class of learning machines for function approach, pattern recognition, and time-serious prediction, etc. It maps samples into the feature space by so-called support vectors of selected samples, and then feature vectors are separated by maximum margin hyperplane. The pres…

2016-02-12abs ↗pdf ↗

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 ↗

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.

Distributed SVM algorithm improves performance in real-world applications.

problem Improving SVM performance in distributed computing environments.
method Proposes HPSVM, a distributed SVM algorithm that minimizes inter-machine communications.
result HPSVM achieves similar or better results than state-of-the-art SVM techniques.

A new SVM classifier using L0/1L_{0/1} soft-margin loss for improved performance.

problem Improving SVM performance in binary classification tasks.
method Introducing L0/1L_{0/1} soft-margin loss and using the alternating direction method of multipliers.
result The new L0/1L_{0/1}-SVM model generates better performance with shorter computational time and fewer support vectors.

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.

Paper proposes a new pipeline for few-shot classification using forget-update module and channel vector sequence.

problem Few-shot classification with limited support samples.
method Channel vector sequence construction module and forget-update module.
result Pipeline achieves state-of-the-art results on various datasets.

We provide a formulation for Local Support Vector Machines (LSVMs) that generalizes previous formulations, and brings out the explicit connections to local polynomial learning used in nonparametric estimation literature. We investigate the simplest type of LSVMs called Local Linear Support Vector Machines (LLSVMs). For…

2013-09-14abs ↗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.

Paper proposes SVM-based methods for inferring interaction networks.

problem Modeling interaction between variables in time series and high dimensions.
method Two approaches: neighborhood SVM and restricted Bayesian network for time series.
result Efficiency demonstrated through simulations with linear and nonlinear data.

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 ↗

We present an approximation scheme for support vector machine models that use an RBF kernel. A second-order Maclaurin series approximation is used for exponentials of inner products between support vectors and test instances. The approximation is applicable to all kernel methods featuring sums of kernel evaluations and…

2014-03-04abs ↗pdf ↗

Fuzzy Bounded Twin Support Vector Machine for large datasets and streaming data.

problem Handling large datasets and learning from data streams.
method Combining TWSVM with fuzzy membership function and using dual coordinate descent with Fourier Gaussian approximation.
result Fuzzy Bounded Twin Support Vector Machine (FBTWSVM) provides fast training and robust classification.

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.

This paper simplifies deep learning networks by mapping them to a linear function of a feature map.

problem Understanding how weights in deep networks coordinate across layers and generalize.
method Reparameterizes DNNs as a linear function of a feature map, transforming depth-dependencies into tensor products.
result Develops sample compression representation of neural networks in terms of support vectors, showing sample complexity of O(ns/epsilon).

Tuning SVM and boosting models using optimization algorithms.

problem Tuning parameters for SVM and boosting models across various datasets.
method Used grid search to identify parameter ranges and optimization algorithms to select models.
result Optimization algorithms outperformed grid search in selecting well-performing models.