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

64128191255 · Jun 202019922001200920182026
48 results for weighted SVM

This work extends SVM error bounds to weighted SVM and introduces hyperparameter selection methods.

problem Improving SVM performance through effective hyperparameter selection.
method Extending span error bound theory to weighted SVM and introducing hyperparameter selection methods.
result The span rule is the most effective method for weighted SVM hyperparameter selection and provides the best predictor of test error.

Prior knowledge can be used to improve predictive performance of learning algorithms or reduce the amount of data required for training. The same goal is pursued within the learning using privileged information paradigm which was recently introduced by Vapnik et al. and is aimed at utilizing additional information avai…

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

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.

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.

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.

New method uses weighting vectors for efficient boundary and outlier detection.

problem Boundary and outlier detection in machine learning.
method Recast metric space magnitude as weighting vector, solve kernelized SVM, apply nearest neighbor methods.
result Weighting vector can be efficiently approximated in linear time, outperforming state-of-the-art techniques.

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.

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.

The paper predicts edge weights in weighted directed networks using metric geometry.

problem Predicting edge weights in weighted directed networks.
method Introducing new types of weighted directed networks (AWDNs), constructing metrics, and proposing modified kNN and SVM methods.
result The proposed methods outperform traditional approaches in predicting edge weights.

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.

We present a streaming model for large-scale classification (in the context of 2\ell_2-SVM) by leveraging connections between learning and computational geometry. The streaming model imposes the constraint that only a single pass over the data is allowed. The 2\ell_2-SVM is known to have an equivalent formulation in …

2009-08-05abs ↗pdf ↗

We investigate iterated compositions of weighted sums of Gaussian kernels and provide an interpretation of the construction that shows some similarities with the architectures of deep neural networks. On the theoretical side, we show that these kernels are universal and that SVMs using these kernels are universally con…

2016-12-02abs ↗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.

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.

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.

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 ↗

People belong to multiple communities, words belong to multiple topics, and books cover multiple genres; overlapping clusters are commonplace. Many existing overlapping clustering methods model each person (or word, or book) as a non-negative weighted combination of "exemplars" who belong solely to one community, with …

2018-06-18abs ↗pdf ↗

Federated learning optimizes task and resource allocation in balloon networks.

problem Minimizing energy and time consumption in task computation and transmission.
method SVM-based federated learning algorithm to dynamically adjust user associations, service sequences, and task allocations.
result Reduces the weighted sum of energy and time consumption by up to 16.1%.

Optimal posterior distributions improve SVM classifiers and parameter selection.

problem Improving SVM classifiers and selecting optimal regularization parameters.
method PAC-Bayesian approach with optimal posterior identification for stochastic classifiers.
result Optimal posteriors yield tight risk bounds and improved SVM performance.

Support Vector Machines, SVMs, and the Large Margin Nearest Neighbor algorithm, LMNN, are two very popular learning algorithms with quite different learning biases. In this paper we bring them into a unified view and show that they have a much stronger relation than what is commonly thought. We analyze SVMs from a metr…

2012-01-23abs ↗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 ↗

Paper introduces MKL-L0/1L_{0/1}-SVM for SVM with (0,1)(0, 1) loss.

problem Optimization of SVM with (0,1)(0, 1) loss function.
method MKL framework combined with ADMM algorithm for solving the optimization problem.
result Performance of MKL-L0/1L_{0/1}-SVM comparable to SimpleMKL.