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

Trend · papers per month

5111621 · Jun 202019922001200920172026
48 results for SVM/SVR

Improved genetic algorithm optimizes SVR for robust long-term stock index forecasting.

problem Inaccurate long-term stock price predictions.
method Adaptive Weighted Genetic Algorithm-Optimized SVR (IGA-SVR).
result Reduction in MAPE by 19.87% compared to LSTM and 50.03% compared to OGA-SVR.

Computational simulations with different fidelity have been widely used in engineering design. A high-fidelity (HF) model is generally more accurate but also more time-consuming than an low-fidelity (LF) model. To take advantages of both HF and LF models, multi-fidelity surrogate models that aim to integrate informatio…

2019-06-22abs ↗pdf ↗

We show theoretical similarities between the Least Squares Support Vector Regression (LS-SVR) model with a Radial Basis Functions (RBF) kernel and maximum a posteriori (MAP) inference on Bayesian RBF networks with a specific Gaussian prior on the regression weights. Although previous works have pointed out similar expr…

2019-05-01abs ↗pdf ↗

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.

Paper proposes a hybrid model for VaR forecasting using SVR, GARCH, and KDE.

problem Inaccurate VaR estimates due to time-varying volatility and distributional characteristics.
method SVR-GARCH-KDE hybrid model combining nonlinear and nonparametric approaches.
result The SVR-GARCH-KDE hybrid outperforms benchmark models in VaR forecasting, especially for longer horizons.

DCA algorithm applied to SVR with RBF kernel for nonconvex optimization.

problem Nonconvex optimization of SVR with Gaussian RBF kernel.
method DC algorithm with analytical DC decomposition of SVR objective.
result Convergence properties of DCA on RBF-SVR can be assessed through CαρC_αρ.

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.

New model improves volatility forecasting by reducing overestimation and underestimation.

problem SVR-GARCH model overestimates or underestimates volatility, hindering peak or trough behaviors.
method Proposes blending ARCH and augmented blending-ARCH models to improve volatility forecasting.
result Empirical results show improved volatility forecasting ability.

Paper tackles multi-label learning by improving SVR for positive semidefinite metrics.

problem Learning positive semidefinite metrics for multi-label and label distribution learning.
method Proposes two methods to overcome SVR's limitation in learning positive semidefinite metrics.
result Demonstrates new methods achieve favorable performance in multi-label and label distribution learning.

Algorithm optimizes ε-SVR with MAPE loss and sample-dependent constraints.

problem Optimizing ε-SVR with MAPE loss and sample-dependent constraints.
method Sequential Minimal Optimization (SMO) for ε-SVR with MAPE loss and sample-dependent box constraints.
result Algorithm achieves lowest median runtime on every tested configuration.

The paper improves SVR with linear constraints for better model properties.

problem Improving Support Vector Regression with linear constraints.
method Generalized SMO algorithm for solving optimization with linear constraints.
result The proposed method shows better practical performance on various datasets.

The task of predicting future stock values has always been one that is heavily desired albeit very difficult. This difficulty arises from stocks with non-stationary behavior, and without any explicit form. Hence, predictions are best made through analysis of financial stock data. To handle big data sets, current conven…

2019-04-17abs ↗pdf ↗

New algorithms improve distributed optimization under specific conditions.

problem Distributed optimization problems with high communication costs.
method SVRS and AccSVRS algorithms combining gradient sliding and variance reduction.
result Achieved better communication complexity in distributed optimization.

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 ↗

In this paper we propose a fusion approach to continuous emotion recognition that combines visual and auditory modalities in their representation spaces to predict the arousal and valence levels. The proposed approach employs a pre-trained convolution neural network and transfer learning to extract features from video …

2019-06-25abs ↗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 ↗

Voice activity detection (VAD), used as the front end of speech enhancement, speech and speaker recognition algorithms, determines the overall accuracy and efficiency of the algorithms. Therefore, a VAD with low complexity and high accuracy is highly desirable for speech processing applications. In this paper, we propo…

2019-02-05abs ↗pdf ↗

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 ↗

Support vector machine (SVM) is a particularly powerful and flexible supervised learning model that analyzes data for both classification and regression, whose usual algorithm complexity scales polynomially with the dimension of data space and the number of data points. To tackle the big data challenge, a quantum SVM a…

2019-06-21abs ↗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.

Training of one-vs.-rest SVMs can be parallelized over the number of classes in a straight forward way. Given enough computational resources, one-vs.-rest SVMs can thus be trained on data involving a large number of classes. The same cannot be stated, however, for the so-called all-in-one SVMs, which require solving a …

2016-11-25abs ↗pdf ↗

We describe a novel binary classification technique called Banded SVM (B-SVM). In the standard C-SVM formulation of Cortes et al. (1995), the decision rule is encouraged to lie in the interval [1, \infty]. The new B-SVM objective function contains a penalty term that encourages the decision rule to lie in a user specif…

2011-07-12abs ↗pdf ↗