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

8.4%16.8%25.3%33.7% · Jun 202019922001200920172026
48 results for Weighted Support Vector Machines

MPWTSVM improves multi-view learning by reducing redundancy and enhancing accuracy.

problem Improving multi-view learning models for better accuracy and efficiency.
method Proposes MPWTSVM, which combines WLTSVM's strengths with multi-view learning principles.
result Demonstrates better accuracy and efficiency compared to existing multi-view classification models.

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 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 ↗

OKSVM optimizes RBF kernel hyperparameter for SVMs, improving classification performance.

problem Intrinsic dependence of RBF kernel hyperparameter on SVM performance.
method Gradient descent method for automatic hyperparameter learning and SVM weights adjustment.
result OKSVM outperforms classical SVM regardless of initial RBF hyperparameter values.

Unified SVM framework tackles multiclass and multilabel classification.

problem Extending SVM to handle multiclass and multilabel problems.
method Unified framework with class-specific weight vectors and penalizing patterns close to an origin.
result Unified framework achieves competitive performance for multiclass and multilabel classification.

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 ↗

Selecting important features in non-linear or kernel spaces is a difficult challenge in both classification and regression problems. When many of the features are irrelevant, kernel methods such as the support vector machine and kernel ridge regression can sometimes perform poorly. We propose weighting the features wit…

2009-06-24abs ↗pdf ↗

Gradient flow on softmax attention minimizes nuclear norm of weight matrices.

problem Classification with separate key and query weight matrices.
method Gradient flow on exponential loss, separability assumption, reparameterization, approximate KKT conditions.
result Gradient flow implicitly minimizes nuclear norm of weight matrices, contrasting with Frobenius norm minimization.

Maximizes stock portfolio predictability using machine learning.

problem Improving stock portfolio performance through predictive modeling.
method Optimal constrained weights in the MPP constructed using Elastic Net, Random Forest, and Support Vector Regression models.
result MPP portfolios can outperform or underperform the index based on the time period.

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 ↗

New SVM model balances sparsity and robustness in noisy data.

problem Noise sensitivity and lack of sparsity in traditional SVM models.
method Combines elastic net loss with robust loss framework, integrates with SVM, uses half-quadratic algorithm.
result Proves sparsity and robustness, outperforms traditional SVMs in noisy environments.

Proposes novel wSVMs for sparse learning and accurate probability estimation.

problem Sparse features with redundant noise limit the performance of existing wSVMs.
method Develops 1\ell^1-norm and elastic net regularized wSVMs for automatic variable selection and probability estimation.
result Elastic net regularized wSVMs achieve superior performance in variable selection and probability estimation.

T-SVM improves learning in spiking neurons by maximizing dynamical margin.

problem Finding robust solutions in spiking neuronal networks with temporal correlations.
method Introduces Temporal Support Vector Machine (T-SVM) to maximize dynamical margin.
result T-SVM enables learning of tasks requiring nonlinear spatial integration.

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 ↗

SVM used for estimating treatment effects without confounding.

problem Estimating average treatment effects in the presence of confounding variables.
method Adapts SVM classifier as a kernel-based weighting procedure to balance covariates and estimate causal effects.
result SVM provides a continuous relaxation of the quadratic integer program for balancing covariates and maximizing effective sample size.

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 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 ↗

Paper proposes fully Bayesian approach for RVM classification, improving accuracy especially in imbalanced data.

problem Difficulty in conducting RVM classification due to lack of closed-form solution for weight parameter posterior.
method Proposes Generic Bayesian and Fully Bayesian approaches with hierarchical hyperprior structure.
result Improves classification performance, especially in imbalanced data.

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.

This work proposes a model averaging method for SVM that avoids redundant covariates and achieves asymptotic optimality.

problem Redundant covariates impair SVM performance in high-dimensional settings.
method Frequentist model averaging procedure for SVM using cross-validation to select optimal weights.
result The proposed method achieves asymptotic optimality in SVM model averaging.

The computational complexity of solving nonlinear support vector machine (SVM) is prohibitive on large-scale data. In particular, this issue becomes very sensitive when the data represents additional difficulties such as highly imbalanced class sizes. Typically, nonlinear kernels produce significantly higher classifica…

2017-07-24abs ↗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 ↗

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 ↗

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 ↗

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.

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 support vector machines (SVM) algorithm is a popular classification technique in data mining and machine learning. In this paper, we propose a distributed SVM algorithm and demonstrate its use in a number of applications. The algorithm is named high-performance support vector machines (HPSVM). The major contributio…

2019-05-01abs ↗pdf ↗

There has been growing interest in extending traditional vector-based machine learning techniques to their tensor forms. An example is the support tensor machine (STM) that utilizes a rank-one tensor to capture the data structure, thereby alleviating the overfitting and curse of dimensionality problems in the conventio…

2018-04-17abs ↗pdf ↗

Novel defense algorithm improves SVMs against data poisoning attacks.

problem Vulnerability of SVMs to targeted training data manipulations like poisoning attacks.
method Developed a weighted SVM using K-LID to de-emphasize suspicious data samples.
result Significant reduction in classification error rates (10% on average) with the proposed defense.

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.