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

24497397 · Jun 202019922001200920172026
48 results for affinity matrices

Researchers develop geodesics for a new metric on correlation matrices.

problem Lack of intrinsic tools for statistical analyses of correlation matrices.
method Developed geodesics for the quotient-affine metric on full-rank correlation matrices.
result Provided fundamental Riemannian operations for the quotient-affine metric.

New metrics defined for full-rank correlation matrices, ensuring unique operations.

problem No suitable problem statement as the abstract does not describe a problem to be solved.
method New Riemannian metrics defined on full-rank correlation matrices, providing unique operations.
result Unique Riemannian logarithm and Fréchet mean defined for full-rank correlation matrices.

This article provides the mathematical foundation for stochastically continuous affine processes on the cone of positive semidefinite symmetric matrices. This analysis has been motivated by a large and growing use of matrix-valued affine processes in finance, including multi-asset option pricing with stochastic volatil…

2009-10-01abs ↗pdf ↗

The paper explores totally geodesic submanifolds in SPD matrices and their properties.

problem Characterizing and understanding totally geodesic submanifolds in SPD matrices.
method Detailed geometric analysis and projection properties of SPD matrices.
result A non-linear projection on totally geodesic submanifolds has the minimizing property.

Affine manifolds are called integral if there is an atlas such that all transition maps are affine transformations with integer matrices of linear parts. In this paper we describe all complete integral affine structures on compact three-dimensional manifolds up to a finite-sheeted covering. Also a complete list of inte…

2018-12-23abs ↗pdf ↗

Estimates box dimension of fractal interpolation surfaces using oscillation vectors.

problem Estimating the complexity of fractal interpolation surfaces.
method Defined vertical scaling matrices and used them to relate oscillation vectors of different levels.
result Obtained the box dimension of generalized affine fractal interpolation surfaces.

We introduce new partial orders on the set Sn+S^+_n of positive-definite matrices of dimension nn derived from the homogeneous geometry of Sn+S^+_n induced by the natural transitive action of the general linear group GL(n)GL(n). The orders are induced by affine-invariant cone fields, which arise naturally from a local anal…

2017-12-07abs ↗pdf ↗

New unsupervised image translation method detects changes without labeled data.

problem Detecting changes in images without labeled data.
method Affinity-based change priors and weighted loss functions trained on convolutional neural networks.
result Proposed method outperforms state-of-the-art algorithms in detecting changes.

Constructs positive energy representations from Toda equations Stokes data.

problem Creating positive energy representations of affine algebras.
method Using Stokes data of tt*-Toda equations to construct representations.
result Illustrates construction with examples in conformal field theory.

Symmetric Positive Definite (SPD) matrices have been used in many fields of medical data analysis. Many Riemannian metrics have been defined on this manifold but the choice of the Riemannian structure lacks a set of principles that could lead one to choose properly the metric. This drives us to introduce the principle …

2019-09-09abs ↗pdf ↗

This research studies affine invariance in continuous-domain convolutional neural networks.

problem Recognizing patterns and features under affine transformations in continuous domains.
method Introduces a new criterion for assessing affine invariance, embeds images into the affine Lie group, and analyzes convolution over this group.
result Extends the scope of geometrical transformations that deep-learning pipelines can handle.

Incorporates matrix exponential into generative flows for improved performance.

problem Improving generative flow models for better density estimation.
method Integrates matrix exponential into generative flows, proposing new layers and modifying network architecture.
result The proposed model achieves great performance on density estimation.

We describe a probabilistic (generative) view of affinity matrices along with inference algorithms for a subclass of problems associated with data clustering. This probabilistic view is helpful in understanding different models and algorithms that are based on affinity functions OF the data. IN particular, we show how(…

2012-10-19abs ↗pdf ↗

We consider stochastic partial differential equations appearing as Markovian lifts of matrix valued (affine) Volterra type processes from the point of view of the generalized Feller property (see e.g., \cite{doetei:10}). We introduce in particular Volterra Wishart processes with fractional kernels and values in the con…

2019-07-02abs ↗pdf ↗

Change detection in heterogeneous multitemporal satellite images is an emerging and challenging topic in remote sensing. In particular, one of the main challenges is to tackle the problem in an unsupervised manner. In this paper we propose an unsupervised framework for bitemporal heterogeneous change detection based on…

2019-09-07abs ↗pdf ↗

New geometric structures defined on SPD matrices for better understanding.

problem Understanding SPD matrices and their geometric properties.
method Introducing Finslerian and dual information-geometric structures on James' bicone domain.
result Geodesics correspond to straight lines in coordinate systems, and new dissimilarities generalize existing ones.

The study examines lower and upper bounds of Wasserstein distances for affine transformations of random vectors.

problem Understanding Wasserstein distances for affine transformations of random vectors.
method Lower and upper bounds for affine transformations of random vectors in Rn\mathbb{R}^n are derived using Bures metric and compositions of affine maps.
result Concrete lower bounds and upper bounds for affine transformations are derived and applied to various distributions.

Simplified optimization for structured matrices in deep learning.

problem Computational challenges in Riemannian submanifold optimization for structured symmetric positive-definite matrices.
method Proposed a generalized Riemannian normal coordinates that dynamically orthonormalizes the metric and converts the problem into an unconstrained Euclidean space problem.
result Simplified existing approaches for structured covariances and developed matrix-inverse-free 2nd-order optimizers for deep learning with low precision.

The paper calculates bounds on the local Lipschitz constants of neural network layers.

problem Understanding the Lipschitz constants of neural network layers for robustness analysis.
method Analytical approach to determine upper bounds on local Lipschitz constants of affine-ReLU functions.
result The method produces tighter bounds than the standard conservative bound, especially for small perturbations.

New method classifies manifold-valued data using Riemannian geometry.

problem Classifying data on curved Riemannian manifolds.
method Probabilistic Learning Vector Quantization on Symmetric Positive Definite Matrices.
result The method outperforms traditional Euclidean methods on manifold-valued data.

We propose an affine extension of the Linear Gaussian term structure Model (LGM) such that the instantaneous covariation of the factors is given by an affine process on semidefinite positive matrices. First, we set up the model and present some important properties concerning the Laplace transform of the factors and th…

2014-12-23abs ↗pdf ↗

Frank-Wolfe methods (FW) have gained significant interest in the machine learning community due to its ability to efficiently solve large problems that admit a sparse structure (e.g. sparse vectors and low-rank matrices). However the performance of the existing FW method hinges on the quality of the linear approximatio…

2017-10-16abs ↗pdf ↗

New PSDMF algorithms derived from PR and ARM methods.

problem Positive semidefinite matrix factorization (PSDMF) challenges.
method Design PSDMF algorithms based on phase retrieval (PR) and affine rank minimization (ARM) methods.
result New PSDMF algorithms inherit numerical properties from PR and ARM methods.

On the manifold of positive definite matrices, we investigate the existence of pairs of flat affine connections, dual with respect to a given monotone metric. The connections are defined either using the αα-embeddings and finding the duals with respect to the metric, or by means of contrast functionals. We show that i…

2003-07-28abs ↗pdf ↗

SPTN uses invertible transformations to improve sum-product networks.

problem Improving inference efficiency and tractability in sum-product networks.
method Integrates invertible transformations into sum-product networks (SPNs).
result SPTNs with Gaussian leaves and affine transformations are as tractable as SPNs.

Spectral clustering improves accuracy and efficiency for clustering discrete distributions.

problem Inaccurate clustering of discrete distributions using traditional methods.
method Spectral clustering combined with distribution affinity measures (MMD, Wasserstein distance) and linear optimal transport.
result Spectral clustering outperforms traditional methods in accuracy and efficiency.

We present an alternate formulation of the partial assignment problem as matching random clique complexes, that are higher-order analogues of random graphs, designed to provide a set of invariants that better detect higher-order structure. The proposed method creates random clique adjacency matrices for each k-skeleton…

2019-07-03abs ↗pdf ↗

Aganagic and Shakirov propose a refinement of the SU(N) Chern-Simons theory for links in three manifolds with S^1-symmetry, such as torus knots in S^3, based on deformation of the S and T matrices, originally found by Kirillov and Cherednik. We relate the large N limit of the S matrix to the Hilbert schemes of points o…

2012-11-25abs ↗pdf ↗

This work tackles regression on non-Euclidean spaces, specifically positive-definite matrices with the Bures-Wasserstein metric.

problem Regression on non-Euclidean spaces, specifically positive-definite matrices with the Bures-Wasserstein metric.
method Developed a sufficient condition for the existence of a minimizer of the conditional barycenter problem, characterized the optimization landscape, and developed a projection-free algorithm for approximate computation of first-order stationary points.
result The objective is free of local maxima under the sufficient condition, and the algorithm enables the use of stochastic Riemannian optimization methods for large-scale setups.

New method optimizes on curved manifolds without curvature dependence.

problem Curvature-dependent regret in online optimization on Hadamard manifolds.
method Riemannian online gradient descent for h-convex functions.
result Established O(T)O(\sqrt{T}) and O(log(T))O(\log(T)) regret guarantees, curvature-independent.

Researchers study heavy-tail properties of SGD using stochastic recurrence equations.

problem Analyzing heavy-tail properties of Stochastic Gradient Descent (SGD).
method Modeling SGD iterations as multivariate affine stochastic recursions and applying the theory of irreducible-proximal (i-p) matrices.
result Extended results of Gürbüzbalaban et al. (2020) by using the theory of i-p matrices.

The paper extends ternary algebra concepts using cube roots of unity.

problem Extending algebraic structures from binary to ternary multiplication.
method Introducing ternary associator, commutator, and Lie algebra at cube roots of unity.
result Derived an identity for ternary commutator based on GA(1,5)GA(1,5).