Improved fuzzy support vector machine for stock price trend forecasting.
problem Weak performance of traditional support vector machines in handling fuzzy and noisy data.
method Proposed a novel advanced fuzzy support vector machine (NA-FSVM) to improve precision.
result Improved model precision in predicting stock price trends.
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.
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…
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.
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.
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.
An incremental SVDD algorithm for online data using Gaussian kernel.
problem Efficiently handling online or large data for SVDD.
method Incremental learning algorithm using Gaussian kernel, focusing on existing support vectors and new data points.
result Significant gains in efficiency with almost no loss in outlier detection accuracy or objective function value.
EnsembleSVM is a free software package containing efficient routines to perform ensemble learning with support vector machine (SVM) base models. It currently offers ensemble methods based on binary SVM models. Our implementation avoids duplicate storage and evaluation of support vectors which are shared between constit…
Minimal SVM reduces support vectors for better classification.
problem Finding optimal hyperplane for classification with fewer support vectors.
method Proposes a Minimal SVM using L0.5 norm on slack variables.
result Increases classification performance by reducing support vectors.
Proposes MLPSVM for multi-label learning, improving on binary relevance.
problem Handles multi-label learning tasks more efficiently than binary relevance.
method Uses standard support vector machines with parallel decision hyper-planes.
result Outperforms other multi-label learning algorithms on various data sets.
GVM replaces SVM with general project vectors and a Monte Carlo algorithm for improved feature extraction.
problem Improving feature extraction and reducing overlearning in SVM.
method Replaces support vectors with general project vectors and uses a Monte Carlo algorithm to find them.
result The GVM can achieve better performance, especially for small-set training problems.
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.
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.
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.
Introduces STTM to improve STM's performance.
problem Overfitting and curse of dimensionality in SVM.
method Replaces rank-one tensor in STM with tensor train.
result STTM outperforms SVM and STM.
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).
New online adaptive SVR model for IVS with hardware acceleration.
problem Modeling implied volatility surface (IVS) in real-time.
method Online adaptive primal support vector regression (SVR) with hardware acceleration.
result Gaussian kernel outperforms linear kernel in support vector size regulation.
Quantum SVM clustering speeds up big data analysis.
problem Performance degradation of classical SVM clustering on big data.
method Developed a quantum version of SVM clustering using quantum support vector machine and kernels.
result Significant speed-up gain on run-time complexity.
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.
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.
A new method for fast incremental/decremental analysis without recursion.
problem Efficiently updating support-vector models with new data.
method Ridge Support Vector Models with Weight-Error Curves (WECs) for recursion-free computation.
result All new Lagrangian multipliers can be computed simultaneously, relaxing previous constraints.
Support spinor machine extends SVM to handle spinor fields in time series data.
problem Handling nonstationary and nonlinear time series data for classification.
method Using wedge product to extend vector fields to spinor fields, extending SVM to support spinor machine.
result Support spinor machine outperforms SVM in one class classification of physiological time series data.
Statistical mechanics reveals phase transitions in ε-SVR error.
problem Understanding task precision in neural representations with variability.
method Statistical mechanics applied to ε-SVR. result Double-descent phenomenon in generalization error due to ε. 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.
Kernel-based online learning has often shown state-of-the-art performance for many online learning tasks. It, however, suffers from a major shortcoming, that is, the unbounded number of support vectors, making it non-scalable and unsuitable for applications with large-scale datasets. In this work, we study the problem …
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.
Proposes a new SVM model for binary classification with theoretical and practical advantages.
problem Binary classification in supervised learning.
method Quadratic surface support vector machine with L1 norm regularization.
result The model can detect true sparsity patterns and is efficient for both synthetic and real data.
Study evaluates SVM active learning for imbalanced datasets.
problem Imbalanced datasets in text classification and relation extraction.
method Combines SVM with closest-to-hyperplane and query-by-committee selection methods for imbalance.
result ClosestPA algorithm consistently outperforms other methods.
Paper analyzes localized SVMs for robustness and consistency.
problem Handling large datasets efficiently and robustly.
method Localized support vector machines (SVMs) for non-parametric learning.
result Locally learnt kernel methods are universal consistent and robust.
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…
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.
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.
Screening is an effective technique for speeding up the training process of a sparse learning model by removing the features that are guaranteed to be inactive the process. In this paper, we present a efficient screening technique for sparse support vector machine based on variational inequality. The technique is both …
Paper solves support vector regression in Banach spaces using tensor-kernels.
problem Support vector regression in Banach function spaces.
method Fenchel-Rockafellar duality theory and tensor-kernel representation.
result Explicit formulation of dual problem and optimality conditions.
The paper explores various SVM regularization methods for better classification in biomedical data.
problem Improving SVM classification in biomedical datasets for better sparsity and interpretability.
method Different types of SVM regularization approaches are considered and tested on synthetic and real biomedical datasets.
result The study finds that certain regularization methods improve the interpretability and sparsity of SVM classifiers in biomedical applications.
Single ReLU neuron's gradient dynamics reveal support vectors as key to generalization.
problem Understanding the generalization capability of ReLU networks.
method Examined gradient flow dynamics and support vectors in single ReLU neuron training.
result Support vectors play a crucial role in the generalization of ReLU networks.
Rgtsvm speeds up SVMs on GPUs for big data.
problem Scaling SVMs to large datasets.
method GPU acceleration for SVM classification and regression.
result Up to 100x performance improvement for millions of examples.
Enhanced KNN-TSVM reduces noise and overfitting with stable learning rules.
problem High computational cost and overfitting in KNN-based TSVM classifiers.
method Weighted KNN with stabilizer term and LDMDBA for efficient computation.
result Effective in both classification accuracy and computational time, with up to 14x speedup.
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.
Proposes algorithm to explore entire regularization path for asymmetric-cost SVMs.
problem Predictive power of SVMs depends on regularization parameters.
method Develops algorithm to explore entire regularization path for asymmetric-cost linear SVMs.
result Demonstrates two-dimensional regularization paths for linear SVMs.
New ensemble SVM model reduces prediction error without choosing best kernel.
problem Reducing prediction error in regression problems.
method Bagged-weighted support vector regression model with random machines.
result Regression Random Machines achieve lower generalization error.
SupportNet tackles catastrophic forgetting in incremental learning with support data.
problem Catastrophic forgetting in deep learning models when learning new data.
method SupportNet combines deep learning and SVM to identify support data, which are used to reinforce old data knowledge.
result SupportNet outperforms state-of-the-art methods and matches deep learning models trained from scratch on both old and new data.
Automates optimization of support vector machine classification steps.
problem Optimal preprocessing and classification selection for complex data.
method Theoretical view on classical classifiers, preprocessing interpretation, integrated framework.
result Semiautomatic optimization of processing chain with numerous algorithms integration.
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.
A new method speeds up SVDD training for big data.
problem High computation time for SVDD on large datasets.
method Iterative sampling-based approach to incrementally learn SVDD.
result The method significantly reduces training time without sacrificing accuracy.
New machine learning algorithms inspired by ecological principles.
problem Improving machine learning performance.
method Inspired by ecological dynamics, developed new online SVM algorithms.
result New algorithms outperform traditional methods on the MNIST dataset.
Quantum Support Vector Classifier outperforms other QML models in finance fraud detection.
problem Detecting financial fraud using Quantum Machine Learning.
method Comparative study of four QML models: Quantum Support Vector Classifier, Variational Quantum Classifier, Estimator QNN, and Sampler QNN.
result Quantum Support Vector Classifier achieved the highest F1 scores (0.98) for fraud and non-fraud classes.