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

4488132176 · Jun 202019922001200920172026
48 results for Compatibility Matrix

We propose a statistical model for natural language that begins by considering language as a monoid, then representing it in complex matrices with a compatible translation invariant probability measure. We interpret the probability measure as arising via the Born rule from a translation invariant matrix product state.

2017-11-04abs ↗pdf ↗

The Random Parameters model was proposed to explain the structure of the covariance matrix in problems where most, but not all, of the eigenvalues of the covariance matrix can be explained by Random Matrix Theory. In this article, we explore other properties of the model, like the scaling of its PDF as one take larger …

2007-10-29abs ↗pdf ↗

In this paper we consider the Poisson algebraic structure associated with a classical rr-matrix, i.e. with a solution of the modified classical Yang--Baxter equation. In Section 1 we recall the concept and basic facts of the rr-matrix type Poisson orbits. Then we describe the rr-matrix Poisson pencil (i.e the pair o…

1998-12-25abs ↗pdf ↗

As the necessary background to construct from the aspect of Grothendieck's Algebraic Geometry dynamical fermionic D3-branes along the line of Ramond-Neveu-Schwarz superstrings in string theory, three pieces of the building blocks are given in the current notes: (1) basic CC^\infty-algebrogeometric foundations of d=4d=4

2018-08-15abs ↗pdf ↗

Derives a Hamiltonian model for 3D axially symmetric magnetohydrodynamics.

problem Modeling of 3D axially symmetric magnetohydrodynamics.
method Hamiltonian formulation and matrix discretization.
result First discrete model for 3D magnetohydrodynamics compatible with underlying Lie-Poisson structure.

Paper presents a deep learning method for estimating asset return precision matrices in noisy financial markets.

problem Estimating precision matrices of asset returns in low signal-to-noise ratio environments.
method Non-linear factor model within deep learning framework, consistent estimator with error covariance estimator.
result Superior accuracy in simulations and empirical data.

Improved covariance matrix estimation for portfolio optimization with guaranteed PSD and controlled conditioning.

problem Guaranteeing positive semidefinite ness and controlling spectral conditioning in IQ estimators.
method Introducing squeezing identity and atomic-IQ parameterization to construct structured channel matrices with PSD guarantees and analytic eigen floor for conditioning control.
result Atomic-IQ improves Sharpe ratios and delivers a more stable risk profile compared to standard estimators.

Framework controls uncertainty in LLMs without labels or probabilities.

problem Managing uncertainty in black-box LLMs without token-level probability or true labels.
method Integrates generative models, UCP, and conformal alignment to control uncertainty.
result Achieves close-to-nominal coverage and tighter thresholds than split UCP.

Defines compatibility between Jacobi structures and pseudo-Riemannian metrics on Jacobi algebroids.

problem Generalizing compatibility between Poisson and pseudo-Riemannian metrics to Jacobi structures.
method Introduces and studies compatibility conditions for Jacobi structures and pseudo-Riemannian metrics on Jacobi algebroids.
result Compatibility conditions are preserved under Poissonization and equivalent to Sasakian structures for contact pseudo-metrics.

The paper characterizes compatible linear connections on 3D Finsler manifolds.

problem Characterizing compatible linear connections on Finsler manifolds of dimension three.
method Intrinsic method to characterize compatible linear connections, focusing on indicatrices and Euclidean symmetries.
result If a compatible linear connection is not unique, indicatrices must be Euclidean surfaces of revolution.

The paper proposes reusable network components by making them compatible across tasks.

problem Training networks for different tasks independently leads to incompatible components.
method The paper splits a network into a features extractor and a target task head, and proposes various approaches to make them compatible.
result The proposed methods produce components that are directly compatible without compromising accuracy on original tasks.

Proves compatibility of light cones and projective structures.

problem Clarifying different concepts of compatibility between conformal and projective structures.
method Analyzes compatibility criteria introduced by Ehlers-Pirani-Schild and Trautman-Scholz.
result Proves that the compatibility criterion introduced by Ehlers-Pirani-Schild is correct.

The paper investigates compatible linear connections on Randers spaces and finds a unique extremal connection.

problem Investigating compatible linear connections on Randers spaces.
method Transformed compatibility equations by taking torsion components as variables and determined when these equations have solutions.
result Characterized Randers spaces as non-Riemannian generalized Berwald spaces with a positive constant norm of perturbing term.

Paper speeds up Gaussian process inference using Matérn kernels.

problem Efficiently performing Gaussian process inference for large datasets.
method Exact Matérn kernel decomposition into empirical cumulative distribution functions, combined with divide-and-conquer approach.
result The proposed algorithm significantly speeds up Gaussian process inference for low-dimensional problems with hundreds of thousands of data points.

The paper studies properties of group relations induced by compatible coarse structures.

problem Properties of asymptotic resemblance relations on groups.
method Generalization of asymptotic dimension and introduction of set theoretic coupling.
result Groups with compatible coarse structures that admit a set theoretic coupling are asymptotic equivalent.

Derdzinski and Shen's theorem on the restrictions posed by a Codazzi tensor on the Riemann tensor holds more generally when a Riemann-compatible tensor exists. Several properties are shown to remain valid in this broader setting. Riemann compatibility is equivalent to the Bianchi identity of the new "Codazzi deviation …

2012-04-05abs ↗pdf ↗

We disprove the generalized Chern-Hamilton conjecture on the existence of critical compatible metrics on contact 33-manifolds. More precisely, we show that a contact 33-manifold (M,α)(M,α) admits a critical compatible metric for the Chern-Hamilton energy functional if and only if it is Sasakian or its associated Reeb fl…

2023-11-27abs ↗pdf ↗

Study of spheres and circles on a manifold with a specific metric structure.

problem Understanding geometric objects on a manifold with a skew-circulant structure.
method Analyzing hyper-spheres, spheres, and circles in a tangent space of a 4D manifold with a skew-circulant tensor structure.
result Characterization of geometric objects under an indefinite metric.

Some general properties of compatible Poisson brackets of hydrodynamic type are discussed, in particular: (1) an invariant differential-geometric criterion of the compatibility based on the Nijenhuis tensor; (2) the Lax pair with a spectral parameter governing compatible Poisson brackets in the diagonalizable case; (3)…

2000-05-23abs ↗pdf ↗

The construction of gauge theories beyond the realm of Lie groups and algebras leads one to consider Lie groupoids and algebroids equipped with additional geometrical structures which, for gauge invariance of the construction, need to satisfy particular compatibility conditions. This paper analyzes these compatibilitie…

2016-03-14abs ↗pdf ↗

New proof for unique semi-symmetric compatible linear connection on Finsler manifolds.

problem Existence and uniqueness of semi-symmetric compatible linear connections on Finsler manifolds.
method New linear algebra proof without integration, using convex body properties and intrinsic equations.
result Uniqueness of semi-symmetric compatible linear connection proved.

New method improves compatibility of risk stratification models without sacrificing accuracy.

problem Compatibility issues arise when updating clinical machine learning models.
method Proposes rank-based compatibility measure and new loss function.
result Increased compatibility of models by 0.019 with no loss in discriminative performance.

Oracle inequalities and variable selection properties for the Lasso in linear models have been established under a variety of different assumptions on the design matrix. We show in this paper how the different conditions and concepts relate to each other. The restricted eigenvalue condition (Bickel et al., 2009) or the…

2009-10-05abs ↗pdf ↗

Given the Riemann, or the Weyl, or a generalized curvature tensor K, a symmetric tensor bijb_{ij} is named `compatible' with the curvature tensor if bimKjklm+bjmKkilm+bkmKijlm=0b_i{}^m K_{jklm} + b_j{}^m K_{kilm} + b_k{}^m K_{ijlm} = 0. Amongst showing known and new properties, we prove that they form a special Jordan algebra, i.e. the symmetriz…

2019-10-08abs ↗pdf ↗

The study examines backward compatibility issues in ML systems, especially with noisy data.

problem Backward compatibility challenges in ML systems, especially with noisy data.
method Empirical analysis of ML systems across different architectures and datasets, focusing on data shifts and noise.
result Backward compatibility issues arise even without data shift due to optimization stochasticity and training on large-scale noisy datasets can significantly decrease compatibility.

Generalized Lagrange-Weyl structures and compatible connections are introduced as a natural generalization of similar notions from Riemannian geometry. Exactly as in Riemannian case, the compatible connection is unique if certain symmetry conditions with respect to vertical and horizontal Christoffel symbols are impose…

2006-05-24abs ↗pdf ↗

AI systems are being deployed to support human decision making in high-stakes domains. In many cases, the human and AI form a team, in which the human makes decisions after reviewing the AI's inferences. A successful partnership requires that the human develops insights into the performance of the AI system, including …

2019-06-04abs ↗pdf ↗