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,657 papers · 148 categories

Trend · papers per month

113227340453 · Jun 202019922001200920172026
48 results for support vector regression

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.

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.

This paper studies the addition of linear constraints to the Support Vector Regression (SVR) when the kernel is linear. Adding those constraints into the problem allows to add prior knowledge on the estimator obtained, such as finding probability vector or monotone data. We propose a generalization of the Sequential Mi…

2019-11-06abs ↗pdf ↗

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.

Classification and regression tasks in overparameterized models show different generalization properties.

problem Comparing classification and regression in overparameterized models.
method Comparison of least-squares minimum-norm interpolation and hard-margin SVM using different loss functions.
result Interpolating solutions generalize well with 0-1 loss but not with square loss.

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 ↗

GraphSVR forecasts urban air pollution robustly across stations and seasons.

problem Nonlinear, nonstationary, spatiotemporally dependent urban air pollution forecasting challenges.
method Combines graph convolutional learning and support vector regression.
result GraphSVR improves predictive accuracy and maintains stable performance across seasons and outlier-prone episodes.

A novel SVR parameter optimization method using GSA outperforms other meta-heuristics in stock market forecasting.

problem Optimizing SVR parameters for reliable regression performance on small sample sizes.
method Golden Sine Algorithm (GSA) for parameter tuning of SVR.
result The GSA-based SVR outperforms eleven other meta-heuristics in terms of accuracy and computing time.

We develop a unified approach for classification and regression support vector machines for data subject to right censoring. We provide finite sample bounds on the generalization error of the algorithm, prove risk consistency for a wide class of probability measures, and study the associated learning rates. We apply th…

2012-02-23abs ↗pdf ↗

We consider the most common variants of linear regression, including Ridge, Lasso and Support-vector regression, in a setting where the learner is allowed to observe only a fixed number of attributes of each example at training time. We present simple and efficient algorithms for these problems: for Lasso and Ridge reg…

2012-06-18abs ↗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 ↗

Distributed-OMP recovers sparse vectors with low communication costs.

problem High-dimensional sparse linear regression with limited computation and communication.
method Distributed orthogonal matching pursuit (OMP) scheme.
result Support of the regression vector can be recovered with linear communication per machine and logarithmic in dimension.

The paper analyzes how adversarial attacks affect sparse regression models.

problem Effects of adversarial attacks on sparse regression models.
method Primal-dual witness paradigm to analyze support of estimated regression parameter vector.
result Adversaries can influence sample complexity by corrupting irrelevant features.

Paper solves NP-hard sparse mixed linear regression problem with provable guarantees.

problem Sparse mixed linear regression on unlabeled data.
method Invex relaxation for intractable problem with theoretical guarantees.
result Exact recovery of data labels and close approximation of regression parameters.

Study compares non-parametric models for predicting medical insurance reimbursement delays.

problem Estimating the time-lapse between medical insurance reimbursement.
method Comparative study of four non-parametric regression models (KNNs, SVMs, Decision Trees, Random Forests) using R-squared metric.
result Each model's performance varies with training data size, feature space, and hyperparameters.

This work establishes the equivalence between neural networks and support vector machines.

problem Establishing the equivalence between neural networks and support vector machines.
method Proposed a method to establish the equivalence between infinitely wide neural networks trained by soft margin loss and standard soft margin SVMs with NTK trained by subgradient descent.
result The equivalence between NN and SVM is established, enabling practical applications such as non-vacuous generalization bounds and robustness certificates.

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 ↗

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.

Novel SVM approach for extreme quantile regression with heavy tailed inputs.

problem Learning from extreme values in quantile regression.
method Support Vector Machine framework for handling high-dimensional and nonlinear settings.
result Established finite-sample learning guarantees under mild regularity assumptions.

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.

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.

The support vector machine (SVM) is a widely used method for classification. Although many efforts have been devoted to develop efficient solvers, it remains challenging to apply SVM to large-scale problems. A nice property of SVM is that the non-support vectors have no effect on the resulting classifier. Motivated by …

2013-10-25abs ↗pdf ↗

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 ↗

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.