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

217433650866 · Jun 202019922001200920172026
48 results for Support Feature Machines

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.

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 ↗

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

Proposes an L1-regularized functional SVM for binary classification with functional covariates.

problem Binary classification with multivariate functional covariates.
method L1-regularized functional support vector machine (SVM) with an accompanying algorithm.
result The proposed classifier performs well in prediction and feature selection.

Paper analyzes SVM behavior in high dimensions with exact formulas.

problem Characterizing SVM behavior in high-dimensional data with fixed ratio of features to samples.
method Exact asymptotic formulas derived through heuristic leave-one-out calculations.
result Exact formulas for variability of optimal coefficients, support vectors, objective function value, and misclassification error.

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 …

2013-10-30abs ↗pdf ↗

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 ↗

We propose a fast inference method for Bayesian nonlinear support vector machines that leverages stochastic variational inference and inducing points. Our experiments show that the proposed method is faster than competing Bayesian approaches and scales easily to millions of data points. It provides additional features …

2017-07-18abs ↗pdf ↗

This study compares feature importance and explainability in quantum vs classical ML models.

problem Lack of transparency in ML models, especially in sensitive fields.
method Comparison of classical ML (SVM, Random Forest) and hybrid quantum ML (VQC, QSVC) models using feature importance and explainability methods.
result Quantum ML models provide insights similar to classical models but with unique quantum features.

A novel feature selection method for SVM improves model accuracy and interpretability.

problem Feature selection in nonlinear SVM classification problems.
method Embedded min-max optimization problem, leveraging duality theory.
result Improves model accuracy and interpretability on benchmark data sets.

Study improves mortality prediction in hospital patients using comprehensive feature engineering.

problem Accurate prediction of all-cause in-hospital mortality in healthcare.
method Comprehensive feature engineering approach using vital signs, laboratory results, and demographic data.
result Random Forest model achieved highest performance with AUC of 0.94, significantly outperforming other models.

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 ↗

Paper optimizes sparse feature selection for cancer detection using GSVP and SVM.

problem Sparse feature selection for cancer detection.
method Regularized GSVP with proximal gradient descent, feature selection via SVM.
result Near-perfect balanced accuracy with few selected features.

SVM with local features improves human action recognition.

problem Improving human action recognition in videos.
method Local appearance and motion features extracted using CNNs, concatenated, and used with SVM for classification.
result SVM with local features outperforms previous methods on benchmark datasets.

Study uses machine learning to detect early COVID-19 from CT images.

problem Early detection of COVID-19 from CT images.
method Machine learning methods applied to patches of CT images, feature extraction (GLCM, LDP, GLRLM, GLSZM, DWT), SVM classification.
result Best classification accuracy of 99.68% with 10-fold cross-validation and GLSZM feature extraction.

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.

Neural networks in many varieties are touted as very powerful machine learning tools because of their ability to distill large amounts of information from different forms of data, extracting complex features and enabling powerful classification abilities. In this study, we use neural networks to extract features from b…

2018-05-06abs ↗pdf ↗

A two-layer classifier improves smartphone transportation mode recognition.

problem Improving accuracy of transportation mode classification.
method Two-layer hierarchical classifier combining time and frequency domain features.
result Maximum classification accuracy of 97.02%.

Efficient learning of minimax risk classifiers in high dimensions.

problem Efficient learning of classifiers in high-dimensional data.
method Iterative algorithm leveraging constraint generation methods for minimax risk classifiers.
result The algorithm provides efficient learning and feature selection in high-dimensional scenarios.

New method uses topological features for chatter detection in turning processes.

problem Chatter detection in turning processes using complex dynamical systems.
method Embedding time series as point clouds, using persistence diagrams, and applying machine learning classifiers.
result TDA-based features yield high accuracy (97%) for two out of four cutting configurations.

A new algorithm FS-PeSOA extracts features from large datasets.

problem Extracting useful knowledge from large datasets.
method Adaptive Penguin Search Optimization Algorithm (FS-PeSOA) based on penguin hunting strategy.
result FS-PeSOA finds global optimum solution for feature subset selection.

New method reduces variance and bias in approximating indefinite kernels.

problem Approximating non-stationary indefinite kernels with low variance and bias.
method Generalized orthogonal random features (GORF)
result GORF achieves lower variance and approximation error compared to existing methods.

CAST package aids in spatial prediction models using machine learning.

problem Challenges in applying machine learning for spatial data.
method Developed cross-validation strategies, spatial feature selection, and area of applicability assessment methods.
result Supports more reliable spatial predictions through CAST package.

Let X be a data matrix of rank ρ, whose rows represent n points in d-dimensional space. The linear support vector machine constructs a hyperplane separator that maximizes the 1-norm soft margin. We develop a new oblivious dimension reduction technique which is precomputed and can be applied to any input matrix X. We pr…

2012-11-26abs ↗pdf ↗

The paper improves SVM for predicting hospital readmissions by clustering patients and personalizing recommendations.

problem Predicting and preventing hospital readmissions.
method Cluster-dependent SVM with personalized prescriptions.
result Personalized recommendations reduce hospital readmissions.

RoSHAP stabilizes feature attribution in machine learning models.

problem Stochastic variation in feature attribution measures.
method Modeling feature attribution score distribution and estimating it through bootstrap resampling and kernel density estimation.
result RoSHAP provides stable feature rankings and improves model performance.

This paper automates mining of COVID-19 scholarly articles using machine learning.

problem Time-consuming and impractical manual extraction of relevant COVID-19 research articles.
method Used machine learning approaches, specifically clustering and parallel one-class support vector machines (OCSVMs), on the CORD-19 dataset.
result Parallel OCSVMs outperform other methods for both original and reduced feature space.

Generative AI improves stock selection by synthesizing features from diverse data sources.

problem Automating feature discovery in stock market data.
method Used large language models with retrieval-augmented generation and structured prompting to synthesize features from various data sources.
result AI-generated features consistently outperform baselines, with Sharpe improvements ranging from 14% to 91%.