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,695 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for linear SVM

For their ability to capture non-linearities in the data and to scale to large training sets, local Support Vector Machines (SVMs) have received a special attention during the past decade. In this paper, we introduce a new local SVM method, called L3^3-SVMs, which clusters the input space, carries out dimensionality r…

2017-03-01abs ↗pdf ↗

Support vector machines (SVMs) are invaluable tools for many practical applications in artificial intelligence, e.g., classification and event recognition. However, popular SVM solvers are not sufficiently efficient for applications with a great deal of samples as well as a large number of features. In this paper, thus…

2010-08-24abs ↗pdf ↗

This paper presents a unified framework to tackle estimation problems in Digital Signal Processing (DSP) using Support Vector Machines (SVMs). The use of SVMs in estimation problems has been traditionally limited to its mere use as a black-box model. Noting such limitations in the literature, we take advantage of sever…

2013-11-21abs ↗pdf ↗

The growing size of modern data brings many new challenges to existing statistical inference methodologies and theories, and calls for the development of distributed inferential approaches. This paper studies distributed inference for linear support vector machine (SVM) for the binary classification task. Despite a vas…

2018-11-29abs ↗pdf ↗

Support vector machine (SVM) is a particularly powerful and flexible supervised learning model that analyzes data for both classification and regression, whose usual algorithm complexity scales polynomially with the dimension of data space and the number of data points. To tackle the big data challenge, a quantum SVM a…

2019-06-21abs ↗pdf ↗

Faster algorithms for structured SVMs reduce computation time.

problem Efficiently solving quadratic programming problems with specific structures.
method Designing nearly-linear time algorithms for quadratic programs with low-rank factorizations and few linear constraints.
result First nearly-linear time algorithms for solving quadratic programs with specific structures.

Tropical SVM tackles phylogenomics by classifying multi-locus data.

problem Classifying multi-locus data sets for phylogenetic analysis.
method Proposes tropical support vector machines (SVMs) for phylogenomics, formulated as linear programming problems.
result Developed methods for hard and soft margin tropical SVMs, proving necessary and sufficient conditions for separation.

When applying the support vector machine (SVM) to high-dimensional classification problems, we often impose a sparse structure in the SVM to eliminate the influences of the irrelevant predictors. The lasso and other variable selection techniques have been successfully used in the SVM to perform automatic variable selec…

2007-10-02abs ↗pdf ↗

In the era of big data, an important weapon in a machine learning researcher's arsenal is a scalable Support Vector Machine (SVM) algorithm. SVMs are extensively used for solving classification problems. Traditional algorithms for learning SVMs often scale super linearly with training set size which becomes infeasible …

2018-12-05abs ↗pdf ↗

This paper uses MIO to select features for kernel SVM classification.

problem Feature selection for kernel SVM classification.
method Mixed-integer optimization (MIO) for feature subset selection.
result The MIO approach can often outperform linear-SVM-based methods in prediction performance.

Conventional SVM-based image coding methods are founded on independently restricting the distortion in every image coefficient at some particular image representation. Geometrically, this implies allowing arbitrary signal distortions in an nn-dimensional rectangle defined by the ε\varepsilon-insensitivity zone in eac…

2013-10-18abs ↗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.

Paper proposes a novel SVM method for creating survival trees.

problem Creating non-linear survival trees for right-censored data.
method L2-regularized dipole splitting criteria with kernel methods.
result Non-linear splits using polynomial and Gaussian kernels show similar predictive power but often smaller tree sizes.

This work simplifies SVM parameter selection using S&S ratio.

problem SVM parameter tuning for optimal performance.
method S&S ratio to model SVM performance; automatic RP, kernel, and parameter selection.
result Optimized SVM parameters with reduced computational complexity.

Recently, fully-connected and convolutional neural networks have been trained to achieve state-of-the-art performance on a wide variety of tasks such as speech recognition, image classification, natural language processing, and bioinformatics. For classification tasks, most of these "deep learning" models employ the so…

2013-06-02abs ↗pdf ↗

The paper improves SVM and localized SVM stability under triple perturbations.

problem Stability of SVMs and localized SVMs under triple perturbations.
method Generalizes and improves existing results, considering simultaneous variations in probability measure, regularization parameter, and kernel.
result Improved stability of SVMs and localized SVMs under triple perturbations.

A novel linear classification method that possesses the merits of both the Support Vector Machine (SVM) and the Distance-weighted Discrimination (DWD) is proposed in this article. The proposed Distance-weighted Support Vector Machine method can be viewed as a hybrid of SVM and DWD that finds the classification directio…

2013-10-11abs ↗pdf ↗

The deep network model, with the majority built on neural networks, has been proved to be a powerful framework to represent complex data for high performance machine learning. In recent years, more and more studies turn to nonneural network approaches to build diverse deep structures, and the Deep Stacking Network (DSN…

2019-02-15abs ↗pdf ↗

In this paper, we propose to (seamlessly) integrate b-bit minwise hashing with linear SVM to substantially improve the training (and testing) efficiency using much smaller memory, with essentially no loss of accuracy. Theoretically, we prove that the resemblance matrix, the minwise hashing matrix, and the b-bit minwise…

2011-05-23abs ↗pdf ↗

One of the limiting factors of using support vector machines (SVMs) in large scale applications are their super-linear computational requirements in terms of the number of training samples. To address this issue, several approaches that train SVMs on many small chunks of large data sets separately have been proposed in…

2015-07-23abs ↗pdf ↗

Improved SRHT for linear SVM classification with higher accuracy.

problem Inefficient random projection methods for high-dimensional data.
method Importance sampling and deterministic top-rr sampling for effective low-dimensional embedding.
result Higher classification accuracy on real-life datasets.

Paper proposes methods to improve SVM classifiers in noisy data scenarios.

problem Improving SVM classifiers when training data contains label noise.
method Mixed Integer Linear and Non Linear models with relabeling and clustering.
result Effective methods improve SVM performance in noisy data scenarios.

Paper tackles efficient SVM classification over decentralized networks.

problem Efficiently classifying high-dimensional data over decentralized networks.
method Convolution-based smoothing technique for nonsmooth hinge loss function, combined with an efficient ADMM algorithm.
result Provable linear convergence of the ADMM algorithm and near-optimal statistical convergence of the sparse estimator.

Support vector machines (SVMs) rely on the inherent geometry of a data set to classify training data. Because of this, we believe SVMs are an excellent candidate to guide the development of an analytic feature selection algorithm, as opposed to the more commonly used heuristic methods. We propose a filter-based feature…

2013-04-20abs ↗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.

Analyzes SVM classifier behavior with different parameters and data types.

problem Tuning SVM parameters for balanced and imbalanced data.
method Behavioral analysis of SVM with different parameters and data types, proposing a novel search algorithm.
result Proposed search algorithm reduces computational time and provides expected kernel function range.

Mammography is often used as the most common laboratory method for the detection of breast cancer, yet associated with the high cost and many side effects. Machine learning prediction as an alternative method has shown promising results. This paper presents a method based on a multilayer fuzzy expert system for the det…

2019-10-29abs ↗pdf ↗

We apply information-based complexity analysis to support vector machine (SVM) algorithms, with the goal of a comprehensive continuous algorithmic analysis of such algorithms. This involves complexity measures in which some higher order operations (e.g., certain optimizations) are considered primitive for the purposes …

2012-12-19abs ↗pdf ↗

Support Vector Machines (SVMs) with various kernels have played dominant role in machine learning for many years, finding numerous applications. Although they have many attractive features interpretation of their solutions is quite difficult, the use of a single kernel type may not be appropriate in all areas of the in…

2019-01-28abs ↗pdf ↗

A new method for high-dimensional classification using Bernstein polynomials.

problem Computational difficulties in high-dimensional SVM hinge loss.
method Proposes Bernstein support vector machine (BernSVM) and two efficient algorithms.
result Achieves a prediction accuracy rate of slog(p)/n\sqrt{s\log(p)/n} with high probability.

We investigate a family of poisoning attacks against Support Vector Machines (SVM). Such attacks inject specially crafted training data that increases the SVM's test error. Central to the motivation for these attacks is the fact that most learning algorithms assume that their training data comes from a natural or well-…

2012-06-27abs ↗pdf ↗

We analyze the computational complexity of Quantum Sparse Support Vector Machine, a linear classifier that minimizes the hinge loss and the L1L_1 norm of the feature weights vector and relies on a quantum linear programming solver instead of a classical solver. Sparse SVM leads to sparse models that use only a small fr…

2019-02-05abs ↗pdf ↗