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

58116174232 · May 202619922001200920172026
48 results for compatibility levels

We semiclassicalise the theory of quantum group principal bundles to the level of Poisson geometry. The total space XX is a Poisson manifold with Poisson-compatible contravariant connection, the fibre is a Poisson-Lie group in the sense of Drinfeld with bicovariant Poisson-compatible contravariant connection, and the …

2019-03-28abs ↗pdf ↗

This is an exposition of results on the existence problem of π1π_1-injective immersed and embedded surfaces in graph-manifolds, and also of nonpositively curved metrics on graph-manifolds, obtained by different authors. The results are represented from a unified point of view based on the notion of compatible cohomolog…

2003-09-11abs ↗pdf ↗

We define spin-c prequantization of a symplectic manifold to be a spin-c structure and a connection which are compatible with the symplectic form. We describe the cutting of an S^1-equivariant spin-c prequantization. The cutting process involves a choice of a spin-c prequantization for the complex plane. We prove that …

2007-10-23abs ↗pdf ↗

The problem of causal inference is to determine if a given probability distribution on observed variables is compatible with some causal structure. The difficult case is when the causal structure includes latent variables. We here introduce the inflation technique\textit{inflation technique} for tackling this problem. An inflation of a…

2016-09-02abs ↗pdf ↗

We devise an algorithm which allows one to count the number of Killing vectors for a Lorentzian manifold of dimension 3. Our algorithm relies on the principal traces of powers of the Ricci tensor and branches intricately according to the values of differential invariants arising from the compatibility conditions of the…

2019-02-21abs ↗pdf ↗

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.

We show in this paper that the correspondence between 22-term representations up to homotopy and VB\mathcal{VB}-algebroids, established by Gracia-Saz and Mehta, holds also at the level of morphisms. This correspondence is hence an equivalence of categories. As an application, we study foliations and distributions on a…

2013-02-16abs ↗pdf ↗

Study rigidity of Hamiltonians near a minimum in symplectic and magnetic settings.

problem Rigidity of Hamiltonians near a minimum in symplectic and magnetic settings.
method Analyzing Hamiltonian systems near a compact symplectic Morse-Bott minimum, focusing on Zoll flows and magnetic forms.
result A constant curvature quantity characterizes complex space forms among Kähler manifolds.

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.

Cross-modal hashing has been receiving increasing interests for its low storage cost and fast query speed in multi-modal data retrievals. However, most existing hashing methods are based on hand-crafted or raw level features of objects, which may not be optimally compatible with the coding process. Besides, these hashi…

2019-05-11abs ↗pdf ↗

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.

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.

Geometric deformations preserve post-Lie algebra structure in regularity structures.

problem Deriving geometric deformations of post-Lie algebras.
method Extending geometrical notions of torsion and curvature, deriving compatibility conditions.
result Derives a pre-Lie structure for regularity structures, isomorphic to a post-Lie algebra.

New algorithm for learning preferences in decentralized matching markets reduces regret to logarithmic levels.

problem Learning preferences in decentralized matching markets without direct communication.
method Introduces a new algorithm for two-sided matching markets with competition.
result The algorithm achieves logarithmic stable regret in shared preferences and quadratic regret in general preferences.

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 ↗

Overparameterized deep networks have the capacity to memorize training data with zero \emph{training error}. Even after memorization, the \emph{training loss} continues to approach zero, making the model overconfident and the test performance degraded. Since existing regularizers do not directly aim to avoid zero train…

2020-02-20abs ↗pdf ↗

Study extends null distance concept to Lorentzian length spaces for spacetime analysis.

problem Understanding spacetime convergence and topology in Lorentzian geometry.
method Extend null distance concept to Lorentzian length spaces, study Gromov-Hausdorff convergence.
result First results on compatibility of null distance with synthetic curvature bounds in warped product Lorentzian length spaces.

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 ↗

A linear connection on a Finsler manifold is called compatible to the metric if its parallel transports preserve the Finslerian length of tangent vectors. Generalized Berwald manifolds are Finsler manifolds equipped with a compatible linear connection. Since the compatibility to the Finslerian metric does not imply the…

2020-01-13abs ↗pdf ↗

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.

A local Riemann-Hilbert correspondence for tame meromorphic connections on a curve compatible with a parahoric level structure will be established. Special cases include logarithmic connections on G-bundles and on parabolic G-bundles, where G is a complex reductive group. The corresponding Betti data involves pairs (M,…

2010-03-16abs ↗pdf ↗

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.

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 ↗

A new hypergraph expansion method treats vertices and hyperedges equally, improving node classification.

problem Information loss in hypergraph expansions on either vertex or hyperedge level.
method Proposes a new hypergraph formulation named line expansion (LE) that treats vertices and hyperedges symmetrically.
result The proposed line expansion method outperforms state-of-the-art baselines on five hypergraph datasets.

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 ↗