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

104207311414 · Jun 202019922001200920172026
48 results for vector measures

Investigates set-valued risk measures for processes and vectors, proving equivalence and providing new dual representations.

problem Investigates set-valued risk measures for processes and vectors.
method Utilizes equivalence of risk measures for processes and vectors and their penalty function formulations.
result Provides new dual representation for risk measures for processes in the set-valued framework.

Study on recovering supports of multiple sparse vectors from mixed linear measurements.

problem Recovering supports of multiple sparse vectors from a mixture of linear measurements.
method Developed algorithms to identify the support of all component vectors using polynomial and quasi-polynomial number of measurements.
result Polynomial and quasi-polynomial number of measurements sufficient for recovering the supports of all component vectors.

Paper develops a theory for Patterson-Sullivan measures in higher rank symmetric spaces.

problem Establishing existence and uniqueness of Patterson-Sullivan measures in higher rank symmetric spaces.
method Develops theory for vector-valued horofunction boundaries and shadows.
result Proves existence and uniqueness of Patterson-Sullivan measures for transverse groups.

Study shows simple vector quantization measures correlate with deep learning generalization.

problem Understanding and predicting generalization in deep learning models.
method Applying complexity measures from approximation and information theory to deep learning features.
result Simple vector quantization measures correlate well with generalization performance in deep learning.

Paper proposes a new method to evaluate joint risk under uncertainty.

problem Evaluating joint risk of multiple insurance risks under dependence uncertainty.
method Axiomatic approach to scalar and vector-valued distortion joint risk measures.
result Established a new scalar distortion joint risk measure with positive homogeneity.

We consider learning the principal subspace of a large set of vectors from an extremely small number of compressive measurements of each vector. Our theoretical results show that even a constant number of measurements per column suffices to approximate the principal subspace to arbitrary precision, provided that the nu…

2014-04-03abs ↗pdf ↗

We introduce a new functional measure of tail dependence for weakly dependent (asymptotically independent) random vectors, termed weak tail dependence function. The new measure is defined at the level of copulas and we compute it for several copula families such as the Gaussian copula, copulas of a class of Gaussian mi…

2014-02-19abs ↗pdf ↗

New algorithm recovers sparse binary vectors from generalized linear measurements efficiently.

problem Recovering sparse binary vectors from generalized linear measurements.
method Linear estimation algorithm and information theoretic lower bounds.
result Optimal sample complexity of O((k+σ2)logn)O((k+σ^2)\log{n}) for noisy one bit quantized linear measurements.

Phase retrieval refers to the problem of recovering real- or complex-valued vectors from magnitude measurements. The best-known algorithms for this problem are iterative in nature and rely on so-called spectral initializers that provide accurate initialization vectors. We propose a novel class of estimators suitable fo…

2018-06-09abs ↗pdf ↗

We generalise the average asymptotic linking number of a pair of divergence-free vector fields on homology three-spheres by considering the linking of a divergence-free vector field on a manifold of arbitrary dimension with a codimension two foliation endowed with an invariant transverse measure. We prove that the aver…

2001-11-19abs ↗pdf ↗

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 ↗

Machine learning is increasingly targeting areas where input data cannot be accurately described by a single vector, but can be modeled instead using the more flexible concept of random vectors, namely probability measures or more simply point clouds of varying cardinality. Using deep architectures on measures poses, h…

2018-11-19abs ↗pdf ↗

We prove that higher moment maps on area measures of a euclidean vector space are injective, while the kernel of the centroid map equals the image of the first variation map. Based on this, we introduce the space of smooth dual area measures on a finite-dimensional euclidean vector space and prove that it admits a natu…

2017-03-23abs ↗pdf ↗

The paper extends Laplacian spectra approximations to vector bundles.

problem Approximating the spectrum of the connection Laplacian.
method Extending the graph connection Laplacian to vector bundles and proving spectrum approximation.
result The spectrum of the extended operator approximates the spectrum of the connection Laplacian.

New guarantees for uniquely identifying transport maps and vector fields from finite measure-valued data.

problem Unique recovery of transport maps and vector fields from finite measure-valued data.
method Use of Whitney and Takens embedding theorems to establish conditions for unique identification.
result New metric for comparing diffeomorphisms and analogous results in infinitesimal settings.

A new method for comparing image probability measures using convolution operators.

problem Efficiently comparing images using conventional sliced Wasserstein methods.
method Proposed convolution sliced Wasserstein (CSW) methods with stride, dilation, and non-linear activation.
result CSW demonstrates favorable performance over conventional sliced Wasserstein in image comparison and deep generative modeling.

A new method ranks uncertainty vectors from multiple measures for robust prediction.

problem Single scalar measures of model reliability are insufficient for comprehensive uncertainty quantification.
method Optimal transport ranks vectors of uncertainty measures, supporting flexible fusion of aleatoric and epistemic uncertainties.
result The method provides a robust ranking of uncertainty that supports various downstream tasks.

The paper extends consistency results for sequential design strategies to vector-valued Gaussian processes.

problem Estimating excursion sets of vector-valued Gaussian processes.
method Clarifying the connection between continuous Gaussian processes and Gaussian measures in Banach spaces, extending concepts and properties from scalar-valued settings to vector-valued settings.
result Consistency results for sequential design strategies can be applied to vector-valued Gaussian processes.

Gaussian random vectors exhibit the loss of dimension phenomena, which relate to their joint survival tail behaviour. Besides, the fact that the components of such vectors are light-tailed complicates the approximations of various multivariate risk measures significantly. In this contribution we derive precise approxim…

2018-03-14abs ↗pdf ↗

When response variables are nominal and populations are cross-classified with respect to multiple polytomies, questions often arise about the degree of association of the responses with explanatory variables. When populations are known, we introduce a nominal association vector and matrix to evaluate the dependence of …

2011-09-12abs ↗pdf ↗

The paper generalizes product inequalities for random vectors and their applications.

problem Understanding concentration of measure for products of random vectors.
method Develops expressions for the concentration of functionals of random vectors based on product norms.
result Provides generalized Hanson-Wright inequalities and applications to random matrices.

Consider the recovery of an unknown signal x{x} from quantized linear measurements. In the one-bit compressive sensing setting, one typically assumes that x{x} is sparse, and that the measurements are of the form sign(ai,x){±1}\operatorname{sign}(\langle {a}_i, {x} \rangle) \in \{\pm1\}. Since such measurements give no informati…

2014-04-28abs ↗pdf ↗

Holomorphic vector fields and anti-canonical divisors on complex manifolds are studied.

problem Existence of non-trivial holomorphic vector fields on compact complex manifolds.
method Vanishing result for measure preserving holomorphic vector fields, Gibbs stability, and log terminal singularities.
result No non-trivial holomorphic vector fields on compact complex manifolds with big anti-canonical line bundle.

A flag area measure on an nn-dimensional euclidean vector space is a continuous translation-invariant valuation with values in the space of signed measures on the flag manifold consisting of a unit vector vv and a (p+1)(p+1)-dimensional linear subspace containing vv with 0pn10 \leq p \leq n-1. Using local parallel sets, …

2018-07-06abs ↗pdf ↗

Braided vector fields on spatial subdomains homeomorphic to the cylinder play a crucial role in applications such as solar and plasma physics, relativistic astrophysics, fluid and vortex dynamics, elasticity, and bio-elasticity. Often the vector field's topology -- the entanglement of its field lines -- is non-trivial,…

2019-09-17abs ↗pdf ↗

Paper analyzes BIHT for noisy 1-bit CS, improving results with up to τ-fraction of incorrect measurements.

problem Estimating sparse vectors from noisy sign measurements in 1-bit compressed sensing.
method Binary Iterative Hard Thresholding (BIHT) algorithm, using Gaussian matrices and high-dimensional geometry analysis.
result BIHT provides estimates within ε+τ error with τ-fraction of incorrect measurements, maintaining universality of measurements.

We lay the foundations for a theory of divergence-measure fields in noncommutative stratified nilpotent Lie groups. Such vector fields form a new family of function spaces, which generalize in a sense the BVBV fields. They provide the most general setting to establish Gauss-Green formulas for vector fields of low regul…

2018-06-08abs ↗pdf ↗

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 ↗

The goal of compressed sensing is to estimate a vector from an underdetermined system of noisy linear measurements, by making use of prior knowledge on the structure of vectors in the relevant domain. For almost all results in this literature, the structure is represented by sparsity in a well-chosen basis. We show how…

2017-03-09abs ↗pdf ↗

This paper studies the problem of estimating the covariance of a collection of vectors using only highly compressed measurements of each vector. An estimator based on back-projections of these compressive samples is proposed and analyzed. A distribution-free analysis shows that by observing just a single linear measure…

2015-06-02abs ↗pdf ↗