Fast online Kernel SVM for big data with limited resources.
problem Efficiently training SVM on large datasets with limited computational resources.
method Split input space using LVQ, train SVM in clusters, limit support vectors.
result Achieves high accuracy with high throughput on large datasets.
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.
Support Vector Machines (SVMs) are powerful learners that have led to state-of-the-art results in various computer vision problems. SVMs suffer from various drawbacks in terms of selecting the right kernel, which depends on the image descriptors, as well as computational and memory efficiency. This paper introduces a n…
Investigates hierarchical Gaussian kernels for deep learning consistency.
problem Deep learning consistency and optimization.
method Iterated Gaussian kernels, SVMs, parameter optimization.
result SVMs using hierarchical Gaussian kernels are universally consistent.
Paper shows SVMs can interpolate data in various settings.
problem Understanding SVM performance and generalization.
method Flexible analysis framework for proving SVM interpolation in diverse settings.
result Support vector machines can interpolate data in many cases not previously covered.
Paper presents exact heat kernel on hypersphere for SVM improvements.
problem Improving SVM performance with non-Euclidean feature spaces.
method Higher order parametrix expansion of hyperspherical heat kernel.
result Exact kernel often shows superior performance in SVM applications.
Paper analyzes learning rates for SVM with Gaussian kernels.
problem Optimizing learning rates for binary classification.
method Refined error analysis for SVM with Gaussian kernel and convex loss.
result SVM with Gaussian kernel can achieve optimal learning rates under certain conditions.
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.
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.
The study analyzes LS-SVM performance using random matrix theory.
problem Performance analysis of LS-SVM in large dimensional settings.
method Random matrix theory applied to LS-SVM performance analysis.
result The LS-SVM decision function is asymptotically normal.
Adaptive caching strategy improves SVM training efficiency.
problem Expensive SVM training for large datasets.
method Proposed EFU and HCST caching strategies for kernel value reuse.
result HCST achieves 20% more reduction in training time.
A quantum-inspired classical algorithm speeds up LS-SVM classification.
problem Big data challenge in SVM classification.
method Improved indirect sampling technique for LS-SVM.
result Algorithm achieves logarithmic runtime for low rank data matrices.
Kernel functions in support vector machines (SVM) are needed to assess the similarity of input samples in order to classify these samples, for instance. Besides standard kernels such as Gaussian (i.e., radial basis function, RBF) or polynomial kernels, there are also specific kernels tailored to consider structure in t…
m-arcsinh improves SVM and MLP reliability and speed in scikit-learn.
problem Improving SVM and MLP reliability and speed in scikit-learn.
method Modified arcsinh function for kernel and activation in SVM and MLP.
result Competitive classification performance and reliability of SVM and MLP with m-arcsinh.
End-to-end graph SVM with graph convolutions and RKHS.
problem Graph classification with complex feature spaces.
method End-to-end training of graph convolutions, kernel function, and SVM parameters.
result Outperforms existing deep learning models on graph classification tasks.
Extends linear classification framework to nonlinear SVM-based ranking problems.
problem Maximizing performance on relevant samples in ranking problems.
method Dualization, kernel addition, componentwise dual ascent method.
result General framework for nonlinear classifiers in ranking problems.
In nonparametric classification and regression problems, regularized kernel methods, in particular support vector machines, attract much attention in theoretical and in applied statistics. In an abstract sense, regularized kernel methods (simply called SVMs here) can be seen as regularized M-estimators for a parameter …
Paper introduces MKL-L0/1-SVM for SVM with (0,1) loss.
problem Optimization of SVM with (0,1) loss function. method MKL framework combined with ADMM algorithm for solving the optimization problem.
result Performance of MKL-L0/1-SVM comparable to SimpleMKL. Kernel handles missing data, improves SVM performance.
problem Handling missing data in machine learning models.
method Constructs genRBF kernel that models missing attribute uncertainty.
result genRBF kernel outperforms other methods in SVM classification.
Quantum LS-SVM simplifies matrix inversion for faster machine learning.
problem Speeding up machine learning algorithms for large datasets.
method Introduces a novel quantum algorithm using continuous variables to simplify matrix inversion in LS-SVM, and proposes a hybrid quantum-classical approach for sparse solutions.
result Quantum LS-SVM achieves exponential speed-up and can solve classically difficult tasks.
The paper improves SVM learning rates for anisotropic Gaussian kernels.
problem Nonparametric regression with anisotropic Gaussian kernels.
method Establishing almost optimal learning rates for functions in anisotropic Besov spaces.
result Optimal learning rates up to logarithmic factors, faster than Sobolev space-based rates.
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.
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.
This paper presents a kernel-based discriminative learning framework on probability measures. Rather than relying on large collections of vectorial training examples, our framework learns using a collection of probability distributions that have been constructed to meaningfully represent training data. By representing …
Proposes a new kernel technique for tensor data in SVM.
problem Handling tensorial data in machine learning.
method Kernelized support tensor train machine for image classification.
result Tensorizes the standard SVM on its input structure and kernel mapping scheme.
The paper improves SVM classification by learning multiple tasks simultaneously.
problem Improving SVM classification accuracy through multi-task learning.
method Developed generalization bounds and showed benefits of learning multiple tasks.
result Learning multiple tasks simultaneously reduces error compared to single task learning.
SFM uses linear models in extended feature spaces to avoid kernel issues.
problem Difficulty in interpreting SVM solutions and limitations of single kernel types.
method Support Feature Machines (SFM) use linear models in extended feature spaces.
result SFM provides at least as good results as kernel-based SVMs without interpretation, scaling, and convergence issues.
A scalable ROC-SVM variant reduces training time for imbalanced binary classification.
problem High computational cost of ROC-SVM for imbalanced binary classification.
method Incomplete U-statistics and low-rank kernel approximation.
result Comparable AUC performance with reduced training time.
LS-SVM performance analyzed for large p and n, showing Gaussian approximation.
problem Performance analysis of LS-SVM in high-dimensional settings.
method Random matrix theory applied to LS-SVM under Gaussian mixture model.
result LS-SVM decision function approximates normally distributed under large p and n.
Boosts SVMs by perturbing kernels to improve classification of imbalanced and small disjuncts.
problem Class imbalance and small disjuncts in datasets.
method Kernel perturbation to diversify SVMs for boosting, identifying disjuncts.
result Proposed method outperforms state-of-the-art methods on various datasets.
A fast multilevel SVM framework tackles large-scale data challenges.
problem High computational complexity and quality vs. performance trade-off in SVMs.
method Generalized fast multilevel framework for regular and weighted SVMs.
result Significant speed up compared to state-of-the-art nonlinear SVM libraries.
It is shown that bootstrap approximations of support vector machines (SVMs) based on a general convex and smooth loss function and on a general kernel are consistent. This result is useful to approximate the unknown finite sample distribution of SVMs by the bootstrap approach.
A method for interpreting SVMs using polynomial kernels, revealing model complexity.
problem Interpreting SVMs built with truncated orthogonal polynomial kernels.
method Orthogonal Representation Contribution Analysis (ORCA) with normalized Orthogonal Kernel Contribution (OKC) indices.
result The method reveals structural aspects of model complexity not captured by predictive accuracy.
Kernel methods linked to feature subspaces and maximal correlation kernels.
problem Understanding kernel methods and their relationship to feature extraction.
method Established a correspondence between feature subspaces and kernels, introduced maximal correlation kernels, and demonstrated their optimality.
result Kernel SVM on maximal correlation kernel achieves minimum prediction error.
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.
New kernel class improves SVM performance.
problem No universal, tractable, scalable kernel set.
method Proposed Tessellated Kernel (TK) class with positive matrices.
result TK kernels outperform other methods in SVM problems.
Distance weighted discrimination (DWD) is a margin-based classifier with an interesting geometric motivation. DWD was originally proposed as a superior alternative to the support vector machine (SVM), however DWD is yet to be popular compared with the SVM. The main reasons are twofold. First, the state-of-the-art algor…
Support vector machines (SVMs) are special kernel based methods and belong to the most successful learning methods since more than a decade. SVMs can informally be described as a kind of regularized M-estimators for functions and have demonstrated their usefulness in many complicated real-life problems. During the last…
Proposes a method for kernel learning using feature maps.
problem Improving SVM margin through iterative refinement.
method Fourier-analytic characterization and iterative feature maps.
result Optimal and generalization guarantees for SVM margin improvement.
Dual SVM training with budget constraint for faster accuracy.
problem Efficient support vector machine training with limited resources.
method Dual subspace ascent algorithm with budget constraint.
result Significant speed-up over primal budget training methods.
Support Vector Machine (SVM) is powerful classification technique based on the idea of structural risk minimization. Use of kernel function enables curse of dimensionality to be addressed. However, proper kernel function for certain problem is dependent on specific dataset and as such there is no good method on choice …
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…
Localized SVMs maintain SVM's consistency properties for large datasets.
problem Inefficient computational requirements of global SVMs for large data sets.
method Localized SVMs apply different hyperparameters to different regions of the input space.
result Localized SVMs inherit Lp- and risk consistency from global SVMs. New q-Hermite kernel improves SVM performance without scaling.
problem Improving SVM performance through novel kernel design.
method Introducing q-Hermite kernel based on q-Hermite I polynomials. result The q-Hermite kernel achieves competitive performance compared to classical kernels.
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.
Discriminative model identifies readers and assesses comprehension from eye movements.
problem Inferring readers' identities and estimating their text comprehension from eye movements.
method Generative model of gaze patterns, Fisher-score representation, Fisher-SVM with Fisher kernel.
result SVM with Fisher kernel excels at identifying readers, but not comprehending text.
Efficiently merges multiple points to speed up BSGD SVM training.
problem Costly merging of points in BSGD SVM training.
method Merges more than two points at once to reduce training time.
result Significant speed-ups achieved without loss of accuracy.
New solver for MKL-SVM with 0/1 loss function.
problem Optimizing MKL-SVM with (0,1)-loss function. method Developed an ADMM solver for nonconvex, nonsmooth optimization.
result Shows promise in simple numerical experiment.