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

Trend · papers per month

175349524698 · Jun 202019922001200920172026
48 results for twin support vector machines

A new algorithm for faster model selection in twin multi-class SVM.

problem Challenges in effective solution of multi-classification and fast model selection in twin multi-class SVM.
method Sample data set partition strategy, Lagrangian multipliers, piecewise linear update, initialization algorithm, and event-based iteration.
result Comparable classification performance achieved without solving quadratic programming problems.

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.

This paper presents LIBTwinSVM, a free, efficient, and open source library for Twin Support Vector Machines (TSVMs). Our library provides a set of useful functionalities such as fast TSVMs estimators, model selection, visualization, a graphical user interface (GUI) application, and a Python application programming inte…

2020-01-27abs ↗pdf ↗

In this paper we present an incremental variant of the Twin Support Vector Machine (TWSVM) called Fuzzy Bounded Twin Support Vector Machine (FBTWSVM) to deal with large datasets and learning from data streams. We combine the TWSVM with a fuzzy membership function, so that each input has a different contribution to each…

2019-07-22abs ↗pdf ↗

Proposes MvTPMSVM to improve multiview learning with reduced computational complexity.

problem Challenges in multiview learning, especially with heteroscedastic noise.
method Introduces MvTPMSVM, a parametric margin SVM model that avoids matrix inversions.
result Demonstrates superior generalization compared to baseline models.

Traditional plane-based clustering methods measure the cost of within-cluster and between-cluster by quadratic, linear or some other unbounded functions, which may amplify the impact of cost. This letter introduces a ramp cost function into the plane-based clustering to propose a new clustering method, called ramp-base…

2018-12-10abs ↗pdf ↗

New NHCAs improve multi-category classification efficiency.

problem Efficient multi-category classification for real-world problems.
method Twin SVM (TWSVM), Generalized eigenvalue proximal SVM (GEPSVM), Regularized GEPSVM (RegGEPSVM), and Improved GEPSVM (IGEPSVM) with OAA, BT, and TDS approaches.
result TDS-TWSVM outperforms other methods in classification accuracy.

Develops a machine learning model to predict ALS progression and assistive device use.

problem Challenges in predicting clinically meaningful milestones in ALS.
method Integrates longitudinal ALSFRS-R trajectories with survival modeling.
result Generates individualized survival curves and predicts wheelchair-free survival.

CRBM generates digital twins for MS patients, aiding in disease progression analysis.

problem Characterizing and analyzing disease progression in MS patients.
method Unsupervised machine learning with Conditional Restricted Boltzmann Machines (CRBMs).
result Generated digital twins are statistically indistinguishable from actual subjects.

Novel digital twin for complex systems improves performance.

problem Lack of practical implementation details for stochastic nonlinear MDOF systems.
method Decouples time-scales, uses physics-based model, Bayesian filtering, and machine learning.
result Excellent performance of proposed digital twin framework validated by examples.

We generalize a support vector machine to a support spinor machine by using the mathematical structure of wedge product over vector machine in order to extend field from vector field to spinor field. The separated hyperplane is extended to Kolmogorov space in time series data which allow us to extend a structure of sup…

2017-09-11abs ↗pdf ↗

A digital twin for multi-scale systems uses physics-based and machine learning models.

problem Lack of application-specific details in digital twin technology.
method Strategically separates into physics-based and data-driven models; uses mixture of experts with Gaussian Process.
result Robust and accurate predictions at future time-steps for multi-scale systems.

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…

2009-12-04abs ↗pdf ↗

Deep RL optimizes sensor placement in digital twins for dynamic data acquisition.

problem Limited applicability of traditional sensor placement techniques for online applications.
method Formulates sensor placement as a Markov decision process and uses deep reinforcement learning.
result Improves predictive accuracy and reliability of digital twins through adaptive sensor repositioning.

Proposes a probabilistic digital twin for dynamical systems using sparse Bayesian learning.

problem Creating and updating accurate digital twins for complex dynamical systems.
method Sparse Bayesian machine learning, two approaches: input-output and output-only.
result Identifies correct perturbation terms and associated parameters in dynamical systems.

Support Vector Machine (SVM) is an efficient classification approach, which finds a hyperplane to separate data from different classes. This hyperplane is determined by support vectors. In existing SVM formulations, the objective function uses L2 norm or L1 norm on slack variables. The number of support vectors is a me…

2018-04-06abs ↗pdf ↗

Generators of the 4-sphere's smooth mapping class group via diffeomorphisms of Montesinos twins.

problem Understanding the smooth mapping class group of the 4-sphere.
method Homomorphism from loops of 2-spheres to smooth mapping class group, generators as twists along Montesinos twins.
result Generators of the image of the homomorphism as diffeomorphisms of Montesinos twins.

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.

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 ↗

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 ↗

Digital twins improve single-arm trials by providing robust treatment effect estimates.

problem Lack of control arms in single-arm trials limits their gold-standard evidence.
method Outcome-model-based synthetic controls using machine learning models trained on historical data.
result Digital twins offer more robust treatment effect estimates and principled corrections.

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 ↗

Generative model calibrates 3D battery cathode morphologies from 2D images.

problem Calibrate 3D morphologies of all-solid-state battery cathodes from 2D microscopy images.
method Combining GANs with excursion sets of Gaussian random fields.
result Calibrated digital twins enable systematic exploration of morphological scenarios.

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.

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.

The support vector machines (SVM) algorithm is a popular classification technique in data mining and machine learning. In this paper, we propose a distributed SVM algorithm and demonstrate its use in a number of applications. The algorithm is named high-performance support vector machines (HPSVM). The major contributio…

2019-05-01abs ↗pdf ↗

There has been growing interest in extending traditional vector-based machine learning techniques to their tensor forms. An example is the support tensor machine (STM) that utilizes a rank-one tensor to capture the data structure, thereby alleviating the overfitting and curse of dimensionality problems in the conventio…

2018-04-17abs ↗pdf ↗

Automated digital twin discovery from biological data improves drug discovery and personalized medicine.

problem Developing reliable digital twins from noisy, incomplete biological data.
method Symbolic and sparse regression, Bayesian frameworks, deep learning, and large language models.
result Sparse regression generally outperforms symbolic regression, especially with Bayesian frameworks.

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.

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…

2013-09-14abs ↗pdf ↗

Solving different types of optimization models (including parameters fitting) for support vector machines on large-scale training data is often an expensive computational task. This paper proposes a multilevel algorithmic framework that scales efficiently to very large data sets. Instead of solving the whole training s…

2014-10-13abs ↗pdf ↗

Paper introduces probabilistic digital twins for optimal decision making under uncertainty.

problem Optimal sequential decision making under incomplete and uncertain information.
method Formal definition of epistemic uncertainty using measure theory, and solution via deep reinforcement learning.
result Proposes a generic approximate solution for optimal sequential decision making.

The support vector machine is a flexible optimization-based technique widely used for classification problems. In practice, its training part becomes computationally expensive on large-scale data sets because of such reasons as the complexity and number of iterations in parameter fitting methods, underlying optimizatio…

2016-11-16abs ↗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.