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

111222332443 · Jun 202019922001200920172026
48 results for support points

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

problem Creating diverse and interpretable sample sets from large datasets efficiently.
method Random weighted support points from Dirichlet process and Bayesian bootstrap.
result High-quality and diverse outputs at lower computational cost.

Consider a connected manifold of dimension at least two and the group of compactly supported diffeomorphisms that are compactly supported isotopic to the identity. This group acts nn-transitive: Any tuple of nn points can be moved to any other tuple of nn points by a compactly supported diffeomorphism that is compac…

2019-11-15abs ↗pdf ↗

In this paper we prove a universal inequality describing the asymptotic behavior of support points for planar continuous curves. As corollaries we get an analogous result for tangent points of differentiable planar curves and some (partially known) assertions on the asymptotic of the mean value points for various class…

2010-07-01abs ↗pdf ↗

We propose a fast inference method for Bayesian nonlinear support vector machines that leverages stochastic variational inference and inducing points. Our experiments show that the proposed method is faster than competing Bayesian approaches and scales easily to millions of data points. It provides additional features …

2017-07-18abs ↗pdf ↗

Given a convex set and an interior point close to the boundary, we prove the existence of a supporting hyperplane whose distance to the point is controlled, in a dimensionally quantified way, by the thickness of the convex set in the orthogonal direction. This result has important applications in the regularity theory …

2011-07-06abs ↗pdf ↗

We study nn-dimensional area-minimizing currents TT in Rn+1,\mathbb{R}^{n+1}, with boundary T\partial T satisfying two properties: T\partial T is locally a finite sum of (n1)(n-1)-dimensional C1,αC^{1,α} orientable submanifolds which only meet tangentially and with same orientation, for some α(0,1]α\in (0,1]; T\partial T has…

2018-05-02abs ↗pdf ↗

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 ↗

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 ↗

An algorithm simplifies optimization with nonnegative and orthogonal constraints.

problem Optimization problems with nonnegative and orthogonal constraints.
method Support-set algorithm exploiting structural sparsity.
result Global convergence to first-order stationary point with iteration complexity O(ε2)O(ε^{-2}).

A method to select validation data from a dataset using statistical criteria.

problem Selecting a validation basis from a full dataset for machine learning model validation.
method Adopting a 'design of experiments' point of view and using statistical criteria, particularly Maximum Mean Discrepancy criteria.
result The 'support points' concept is particularly relevant for selecting validation data.

Kernel methods on discrete domains have shown great promise for many challenging data types, for instance, biological sequence data and molecular structure data. Scalable kernel methods like Support Vector Machines may offer good predictive performances but do not intrinsically provide uncertainty estimates. In contras…

2018-10-24abs ↗pdf ↗

The Support Vector Machine (SVM) is one of the most widely used classification methods. In this paper, we consider the soft-margin SVM used on data points with independent features, where the sample size nn and the feature dimension pp grows to \infty in a fixed ratio p/nδp/n\rightarrow δ. We propose a set of equatio…

2019-05-13abs ↗pdf ↗

Develops a support-aware framework for reserve-policy selection in advertising markets.

problem Log-based reserve-price evaluation risks weak support and subgroup harm.
method Support-aware offline decision framework converting logged evidence into certified policies.
result Preserves the best gate-passing policy while eliminating only policies with certified regret.

A new method for causal inference in high-dimensional data using machine learning.

problem Causal inference in high-dimensional observational data.
method Support Points Sample Splitting (SPSS) for efficient double machine learning (DML) in causal inference.
result Deep learning with SPSS and hybrid methods outperform SVM with SPSS in computational efficiency and estimation quality.

SPlit optimizes dataset splitting for better model performance.

problem Improving model performance through optimal dataset splitting.
method Adapting Support Points (SP) algorithm for subsampling and categorical variables in a sequential nearest neighbor approach.
result SPlit significantly improves worst-case testing performance compared to random splitting.

In this short note we observe that the sample complexity of PAC machine learning of various concepts, including learning the maximum (EMX), can be exactly determined when the support of the probability measures considered as models satisfies an a-priori bound. This result contrasts with the recently discovered undecida…

2020-02-26abs ↗pdf ↗

The present paper develops two concepts of pointwise differentiability of higher order for arbitrary subsets of Euclidean space defined by comparing their distance functions to those of smooth submanifolds. Results include that differentials are Borel functions, higher order rectifiability of the set of differentiabili…

2016-03-28abs ↗pdf ↗

The problem of super-resolution in general terms is to recuperate a finitely supported measure μμ given finitely many of its coefficients μ^(k)\hatμ(k) with respect to some orthonormal system. The interesting case concerns situations, where the number of coefficients required is substantially smaller than a power of the …

2019-07-10abs ↗pdf ↗

Graph convolutional neural networks (Graph-CNNs) extend traditional CNNs to handle data that is supported on a graph. Major challenges when working with data on graphs are that the support set (the vertices of the graph) do not typically have a natural ordering, and in general, the topology of the graph is not regular …

2018-11-28abs ↗pdf ↗

We propose a probabilistic enhancement of standard kernel Support Vector Machines for binary classification, in order to address the case when, along with given data sets, a description of uncertainty (e.g., error bounds) may be available on each datum. In the present paper, we specifically consider Gaussian distributi…

2019-04-14abs ↗pdf ↗

Study stability and bifurcation of liquid interfaces in cylindrical supports.

problem Stability and bifurcation of liquid interfaces in cylindrical support surfaces.
method Analysis of eigenvalues of the Jacobi operator, Plateau-Rayleigh instability, bifurcation theory.
result Conditions for the emergence of new morphologies and bifurcations from circular cylinders.

Two new undersampling methods improve classification accuracy for imbalanced datasets.

problem Class imbalance and distributional differences in large datasets lead to biased models and poor predictive performance.
method Mutual information-based stratified simple random sampling and support points optimization.
result Empirical results show higher balanced classification accuracy compared to traditional techniques.

For a variety of regularized optimization problems in machine learning, algorithms computing the entire solution path have been developed recently. Most of these methods are quadratic programs that are parameterized by a single parameter, as for example the Support Vector Machine (SVM). Solution path algorithms do not …

2009-03-27abs ↗pdf ↗

We consider high dimensional sparse regression, and develop strategies able to deal with arbitrary -- possibly, severe or coordinated -- errors in the covariance matrix XX. These may come from corrupted data, persistent experimental errors, or malicious respondents in surveys/recommender systems, etc. Such non-stochas…

2013-01-12abs ↗pdf ↗

For a convex domain DD that is enclosed by the hypersurface D\partial D of bounded normal curvature, we prove an angle comparison theorem for angles between D\partial D and geodesic rays starting from some fixed point in DD, and the corresponding angles for hypersurfaces of constant normal curvature. Also, we obtai…

2014-02-11abs ↗pdf ↗

A submanifold MRNM \subset R^N is rr-neighborly if for any rr points in MM there is a hyperplane, supporting MM and touching it at exactly these rr points. We prove that the minimal dimension Δ(k,r)Δ(k,r) of the Euclidean space, containing a stably rr-neighborly submanifold, is asymptotically not smaller than 2krk2kr-k.

2014-07-27abs ↗pdf ↗

The paper uses Black-Scholes model to analyze political support and coalition agreements.

problem Determining the minimum support level for a minor party in a pre-electoral coalition.
method Modeling political support as a stochastic process with a deterministic growth rate and applying Black-Scholes option pricing theory.
result The minimum support level for a minor party to gain a representative in a pre-electoral coalition.

Support selection and eventwise decoupling for simultaneous bets proven.

problem Optimizing expected utility for simultaneous independent events with multiple outcomes.
method Proved a support theorem for a broad class of strictly increasing strictly concave utilities, identifying the exact active support and proving independence from utility function.
result The exact active support is the eventwise union of single-event supports, independent of the utility function.

We investigate a variational problem in the Lorentz-Minkowski space ł3ł^3 whose critical points are spacelike surfaces with constant mean curvature and making constant contact angle with a given support surface along its common boundary. We show that if the support surface is a pseudosphere, then the surface is a plana…

2011-12-16abs ↗pdf ↗