arXiv research

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…

We propose Radial Bayesian Neural Networks (BNNs): a variational approximate posterior for BNNs which scales well to large models while maintaining a distribution over weight-space with full support. Other scalable Bayesian deep learning methods, like MC dropout or deep ensembles, have discrete support-they assign zero…

New exotic 4D spaces with nontrivial mappings.

Gradient descent with large momentum finds flatter minima.

Contextual bandit methods fail with deficient support data.

A simple method for estimating PMF on large supports, preserving structure and suppressing noise.

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…

The principal support vector machines method (Li et al., 2011) is a powerful tool for sufficient dimension reduction that replaces original predictors with their low-dimensional linear combinations without loss of information. However, the computational burden of the principal support vector machines method constrains …

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…

Application of fuzzy support vector machine in stock price forecast. Support vector machine is a new type of machine learning method proposed in 1990s. It can deal with classification and regression problems very successfully. Due to the excellent learning performance of support vector machine, the technology has becom…

This paper presents novel Gaussian process decentralized data fusion algorithms exploiting the notion of agent-centric support sets for distributed cooperative perception of large-scale environmental phenomena. To overcome the limitations of scale in existing works, our proposed algorithms allow every mobile sensing ag…

The paper argues for prioritizing identifying structure over complex models for scientific discovery.

Unified approach to multiclass classification using Gabriel graphs.

Study predicts academic achievement using students' support networks.

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…

The purpose of this paper is to calculate the support of the multiplier ideal sheaves derived from the Kähler-Ricci flow on certain toric Fano manifolds with large symmetry. The early idea of this paper has already been in Appendix of \cite{futaki-sano0711}.

Kernel-based online learning has often shown state-of-the-art performance for many online learning tasks. It, however, suffers from a major shortcoming, that is, the unbounded number of support vectors, making it non-scalable and unsuitable for applications with large-scale datasets. In this work, we study the problem …

New inequalities for unbounded functions improve denoising score matching.

We propose an efficient distributed online learning protocol for low-latency real-time services. It extends a previously presented protocol to kernelized online learners that represent their models by a support vector expansion. While such learners often achieve higher predictive performance than their linear counterpa…

Framework for AI customer support that protects privacy and reduces costs.

We prove that for every natural number k there are simply connected topological four-manifolds which have at leat k distinct smooth structures supporting Einstein metrics, and also have infinitely many distinct smooth structures not supporting Einstein metrics. Moreover, all these smooth structures become diffeomorphic…

We consider the problem of computing a Wasserstein barycenter for a set of discrete probability distributions with finite supports, which finds many applications in areas such as statistics, machine learning and image processing. When the support points of the barycenter are pre-specified, this problem can be modeled a…

Optimizes variance reduction in Heston model using large and moderate deviations.

In this article, a large dimensional performance analysis of kernel least squares support vector machines (LS-SVMs) is provided under the assumption of a two-class Gaussian mixture model for the input data. Building upon recent advances in random matrix theory, we show, when the dimension of data $p$ and their number $…

A new method combines online and offline learning to tackle contextual bandits with missing action support.

We study the problem of recovering the structure underlying large Gaussian graphical models or, more generally, partial correlation graphs. In high-dimensional problems it is often too costly to store the entire sample covariance matrix. We propose a new input model in which one can query single entries of the covarian…

AI system narrows human decision options for better outcomes.

Modern investigation in economics and in other sciences requires the ability to store, share, and replicate results and methods of experiments that are often multidisciplinary and yield a massive amount of data. Given the increasing complexity and growing interaction across diverse bodies of knowledge it is becoming im…

A new line search rule improves support recovery in high-dimensional data.

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…

Federated learning supports exact support recovery with minimal communication.

New models automate support group formation in online health communities.

Study examines large deviations in random walks on hyperbolic spaces.

In this paper, we study randomized reduction methods, which reduce high-dimensional features into low-dimensional space by randomized methods (e.g., random projection, random hashing), for large-scale high-dimensional classification. Previous theoretical results on randomized reduction methods hinge on strong assumptio…

Support vector data description (SVDD) is a machine learning technique that is used for single-class classification and outlier detection. The idea of SVDD is to find a set of support vectors that defines a boundary around data. When dealing with online or large data, existing batch SVDD methods have to be rerun in eac…

An importance sampling and bagging approach to solving the support vector machine (SVM) problem in the context of large databases is presented and evaluated. Our algorithm builds on the nearest neighbors ideas presented in Camelo at al. (2015). As in that reference, the goal of the present proposal is to achieve a fast…

This paper studies binary classification problem associated with a family of loss functions called large-margin unified machines (LUM), which offers a natural bridge between distribution-based likelihood approaches and margin-based approaches. It also can overcome the so-called data piling issue of support vector machi…

Generative model uses random weighted support points for interpretable data sampling.

Current remote sensing image classification problems have to deal with an unprecedented amount of heterogeneous and complex data sources. Upcoming missions will soon provide large data streams that will make land cover/use classification difficult. Machine learning classifiers can help at this, and many methods are cur…

We call attention against what seems to a widely held misconception according to which large crashes are the largest events of distributions of price variations with fat tails. We demonstrate on the Dow Jones Industrial index that with high probability the three largest crashes in this century are outliers. This result…

Dictionary learning is a popular approach for inferring a hidden basis or dictionary in which data has a sparse representation. Data generated from the dictionary A (an n by m matrix, with m > n in the over-complete setting) is given by Y = AX where X is a matrix whose columns have supports chosen from a distribution o…

Constructs a support-preserving homotopy for differential forms with boundary decay estimates.

We propose $\ell_1$ norm regularized quadratic surface support vector machine models for binary classification in supervised learning. We establish their desired theoretical properties, including the existence and uniqueness of the optimal solution, reduction to the standard SVMs over (almost) linearly separable data s…

In this paper we construct compact manifolds with fixed boundary geometry which admit Riemannian metrics of unit volume with arbitrarily large Steklov spectral gap. We also study the effect of localized conformal deformations that fix the boundary geometry. For instance, we prove that it is possible to make the spectra…

This paper speeds up SVC clustering by compressing data while preserving key properties.

We obtain a large deviation function for the stationary measures of twisted Brownian motions associated to the Lagrangians $L_λ(p,v)=\frac{1}{2}g_{p}(v,v)- λω_{p}(v)$, where $g$ is a $C^{\infty}$ Riemannian metric in a compact surface $(M,g)$ with nonpositive curvature, $ω$ is a closed 1-form such that the Aubry-Mather…

AI helps simplify complex ship finance processes.

Considering the classification problem, we summarize the nonparallel support vector machines with the nonparallel hyperplanes to two types of frameworks. The first type constructs the hyperplanes separately. It solves a series of small optimization problems to obtain a series of hyperplanes, but is hard to measure the …