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

Trend · papers per month

5111621 · Jun 202019922001200920182026
48 results for multi-kernel SVM

Improved deep learning for action recognition using multi-kernel SVM and deep neural networks.

problem Challenges in video understanding, especially action recognition, despite deep neural networks' success in image understanding.
method Combining multi-kernel SVM with a multi-stream deep convolutional neural network, including hand-crafted features.
result Achieved close to state-of-the-art performance on the HMDB-51 dataset.

Paper improves generalization bounds for multi-kernel learning with mixed datasets.

problem Improving generalization for multi-kernel learning with mixed Markov chain datasets.
method Developed novel generalization bounds with O(logm)O(\sqrt{\log m}) and O(1/n)O(1/\sqrt{n}) dependencies.
result Added terms compensate for dependency among samples in mixed datasets.

Study uses multi-kernel Hawkes models to analyze high-frequency price dynamics.

problem Understanding responsive speeds of market participants in high-frequency trading.
method Multi-kernel Hawkes models with conditional Hessian analysis for optimization.
result Existence of multi-kernels (UHF, VHF, HF) in high-frequency price dynamics.

Paper introduces a new multi-kernel algorithm for better gradient approximation.

problem Improving gradient approximation in high-dimensional problems.
method Develops a multi-kernel passive stochastic gradient algorithm with variance reduction.
result The multi-kernel algorithm performs better in high-dimensional problems.

Novel adaptive multi-kernel learning scheme for dynamic environments.

problem Learning nonlinear functions in environments with unknown dynamics.
method Random feature approximation and adaptive multi-kernel learning.
result Unique capability to track nonlinear functions in dynamic environments with performance guarantees.

The paper develops a multi-kernel method with sparsity constraint for regression.

problem Developing a robust regression method with sparsity constraints.
method Banach-space formulation, generalized total-variation regularization, multi-kernel expansion, adaptive kernel positions, 1\ell_1 penalty on coefficients.
result The method achieves sparsity in the kernel coefficients, reducing the number of active kernels to the number of data points.

Combining distributed Gaussian Processes with deep CNNs improves performance on action recognition.

problem Improving performance on action recognition datasets.
method Combining distributed Gaussian Processes with multi-stream deep CNNs, treating each CNN as an expert and combining predictions using a Product of Experts (PoE) framework.
result Improves performance on HMDB-51 dataset by 0.4\% compared to hand-crafted feature frameworks.

MKCapsnet improves schizophrenia identification using multi-kernels and dropout.

problem Identifying schizophrenia using existing methods requires two steps and large amounts of data.
method Developed a multi-kernel capsule network (MKCapsnet) inspired by brain anatomy.
result Outperformed state-of-the-art methods in schizophrenia identification.

Enhanced LSTM with multiple kernels and attention improves video action recognition.

problem Improving motion understanding in video analysis.
method Proposed a Network-in-LSTM approach with multiple convolutional kernels and layers, and an attention-based mechanism.
result Improves accuracy in supervised classification on UCF-101 and Sports-1M datasets.

Paper develops a graph-based method for reconstructing spatio-temporal signals.

problem Reconstructing space-time varying signals on graphs given limited data.
method Multi-kernel Kriged Kalman Filter combining graph-aware kernels and online selection.
result Superior reconstruction performance compared to existing methods.

Localized Multiple Kernel Learning improves anomaly detection performance.

problem Anomaly detection in one-class classification tasks.
method Localized Multiple Kernel Learning (LMKAD) for One-class Classification (OCC).
result LMKAD achieves significantly better Gmean scores with fewer support vectors.

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 ↗

This work extends SVM error bounds to weighted SVM and introduces hyperparameter selection methods.

problem Improving SVM performance through effective hyperparameter selection.
method Extending span error bound theory to weighted SVM and introducing hyperparameter selection methods.
result The span rule is the most effective method for weighted SVM hyperparameter selection and provides the best predictor of test error.

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 ↗

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 ↗

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 ↗

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.

SaR-SVM-STV improves hyperspectral image classification with shape-adaptive reconstruction and denoising.

problem Classifying hyperspectral images with limited labeled data.
method Shape-adaptive Reconstruction (SaR) for pixel preprocessing, SVM for probability estimation, and Smoothed Total Variation (STV) for denoising.
result SaR-SVM-STV outperforms SVM-STV with fewer labeled data.

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 ↗

One of the limiting factors of using support vector machines (SVMs) in large scale applications are their super-linear computational requirements in terms of the number of training samples. To address this issue, several approaches that train SVMs on many small chunks of large data sets separately have been proposed in…

2015-07-23abs ↗pdf ↗

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.

Paper examines M-SVM for multi-task learning, showing reliability and pre-convergence-rate factor improvements.

problem Whether MTL always provides reliable results and how MTL outperforms independent learning.
method Regularized multi-task learning (MTL) based on SVM models (M-SVM).
result M-SVM is Bayes risk consistent in large sample size, improving pre-convergence-rate factor (PCR) for small data.

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.