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,695 papers · 148 categories

Trend · papers per month

23477093 · Jun 202019922001200920172026
48 results for Cartesian products

The Cartesian subgroup in graph products of groups is studied with bounds and algorithms.

problem Understanding the structure of Cartesian subgroups in graph products of groups.
method Theory of polyhedral products, lower and upper bounds, algorithm for small presentations.
result Bounds on the number of relations and deficiency in presentations of Cartesian groups.

Study on balanced Hermitian structures on Lie algebras twisted by representations.

problem Conditions for balanced and locally conformally balanced Hermitian structures on Lie algebras.
method Analysis of Hermitian structures on twisted cartesian products of Lie algebras.
result Classification of six-dimensional balanced Hermitian twisted cartesian products Lie algebras.

The decomposability of a Cartesian product of two nondecomposable manifolds into products of lower dimensional manifolds is studied. For 3-manifolds we obtain an analog of a result due to Borsuk for surfaces, and in higher dimensions we show that similar analogs do not exist unless one imposes further restrictions such…

2017-11-30abs ↗pdf ↗

We show that the Cartesian product of three hereditarily infinite dimensional compact metric spaces is never hereditarily infinite dimensional. It is quite surprising that the proof of this fact (and this is the only proof known to the author) essentially relies on algebraic topology.

2012-12-12abs ↗pdf ↗

We prove that if a compact nilmanifold Γ\GΓ\backslash G is endowed with a Vaisman structure, then GG is isomorphic to the Cartesian product of the Heisenberg group with R\mathbb{R}.

2016-05-09abs ↗pdf ↗

This paper focuses on Bayesian Optimization (BO) for objectives on combinatorial search spaces, including ordinal and categorical variables. Despite the abundance of potential applications of Combinatorial BO, including chipset configuration search and neural architecture search, only a handful of methods have been pro…

2019-02-01abs ↗pdf ↗

Many signals on Cartesian product graphs appear in the real world, such as digital images, sensor observation time series, and movie ratings on Netflix. These signals are "multi-dimensional" and have directional characteristics along each factor graph. However, the existing graph Fourier transform does not distinguish …

2017-12-21abs ↗pdf ↗

The study bounds the effective diameter of graphs with positive Ollivier curvature.

problem Bounding the effective diameter of graphs with positive Ollivier curvature.
method Introducing reflective graphs and proving discrete Bonnet Myers theorem.
result The effective diameter bound is attained only for specific graphs.

We make an estimation of the value of the Gromov norm of the Cartesian product of two surfaces. Our method uses a connection between these norms and the minimal size of triangulations of the products of two polygons. This allows us to prove that the Gromov norm of this product is between 32 and 52 when both factors hav…

2004-07-12abs ↗pdf ↗

A free action of the direct product of two copies of the symmetric group on 3 elements on the cartesian product of two copies of the 3-sphere is constructed. This nonlinear action is constructed using surgery. The action provides a counterexample to a conjecture of Lewis made in 1968.

1998-06-06abs ↗pdf ↗

Scalable Gaussian processes with latent Kronecker structure for large datasets.

problem Limited scalability of Gaussian processes for large datasets.
method Leveraging latent Kronecker structure, projecting kernel matrix onto latent Kronecker product, using iterative linear system solvers and pathwise conditioning.
result Outperforms state-of-the-art sparse and variational GPs on real-world datasets with up to five million examples.

We study homogenous Weyl connections with non-positive sectional curvatures. The Cartesian product S1×M\mathbb S^1 \times M carries canonical families of Weyl connections with such a property, for any Riemmanian manifold MM. We prove that if a homogenous Weyl connection on a manifold, modeled on a unimodular Lie group, …

2015-06-26abs ↗pdf ↗

CAN approximates explicit feature interactions for CTR prediction.

problem Learning explicit feature interactions from sparse features.
method Co-Action Network approximates explicit pairwise feature interactions without introducing too many additional parameters.
result CAN outperforms state-of-the-art CTR models and the cartesian product method.

In this paper, we compare Ollivier Ricci curvature and Bakry-Émery curvature notions on combinatorial graphs and discuss connections to various types of Ricci flatness. We show that non-negativity of Ollivier Ricci curvature implies non-negativity of Bakry-Émery curvature under triangle-freeness and an additional in-de…

2019-09-25abs ↗pdf ↗

Generalized are the investigated in other works of the author transports along paths in fibre bundles to transports along arbitrary maps in them. Their structure and some properties are studied. Special attention is paid to the linear case and the case when the map's domain is a Cartesian product of two sets. Also cons…

1997-09-20abs ↗pdf ↗

The classical Weyl Law says that if NM(λ)N_M(λ) denotes the number of eigenvalues of the Laplace operator on a dd-dimensional compact manifold MM without a boundary that are less than or equal to λλ, then NM(λ)=cλd+O(λd1). N_M(λ)=cλ^d+O(λ^{d-1}). In this paper, we show Duistermaat and Guillemin's result allows us to replace the $O(…

2019-09-26abs ↗pdf ↗

Differential chains are a proper subspace of de Rham currents given as an inductive limit of Banach spaces endowed with a geometrically defined strong topology. Boundary is a continuous operator, as are operators that dualize to Hodge star, Lie derivative, pullback and interior product. Partitions of unity exist in thi…

2012-10-16abs ↗pdf ↗

We study the Ollivier-Ricci curvature of graphs as a function of the chosen idleness. We show that this idleness function is concave and piecewise linear with at most 33 linear parts, with at most 22 linear parts in the case of a regular graph. We then apply our result to show that the idleness function of the Cartes…

2017-04-14abs ↗pdf ↗

Additive decoders tackle latent variables and image generation.

problem Latent variables identification and out-of-support image generation in representation learning.
method Additive decoders that can identify latent variables up to permutation and block-wise invertible transformations, and generate novel images by recombining observed factors.
result Additive decoders provide a new setting for nonlinear independent component analysis and can generate novel images by recombining observed factors.

Study benchmarks methods for learning non-Cartesian k-space trajectories and reconstruction.

problem Benchmarking methods for learning non-Cartesian k-space trajectories and reconstruction.
method Comparing PILOT, BJORK, and HybLearn schemes to learn non-Cartesian k-space trajectories and reconstruction.
result HybLearn scheme outperforms other methods in learning and comparing non-Cartesian k-space trajectories and reconstruction.

The paper studies HKKN stratifications for non-compact spaces and proves convexity properties.

problem Proving convexity properties of moment maps for non-compact subsets.
method Algebraic and analytical study of HKKN stratifications for a vector space and compact Kähler manifold, then applying to non-compact subsets.
result Convexity properties of moment maps for invariant subsets are proven.

We introduce the group-compact coarse structure on a Hausdorff topological group in the context of coarse structures on an abstract group which are compatible with the group operations. We develop asymptotic dimension theory for the group-compact coarse structure generalizing several familiar results for discrete group…

2012-01-23abs ↗pdf ↗

DIAL learns embeddings to maximize recall and accuracy for entity resolution.

problem Low resource settings for entity resolution with large Cartesian product search space.
method DIAL uses an Index-By-Committee framework with pre-trained transformer language models to jointly learn embeddings for recall and accuracy.
result DIAL achieves high precision, recall, and efficiency on benchmark datasets.

In this paper we show that the cohomology of a connected CW complex is periodic if and only if it is the base space of an orientable spherical fibration with total space that is homotopically finite dimensional. As applications we characterize those discrete groups that act freely and properly on a cartesian product of…

2000-10-10abs ↗pdf ↗

TACE unifies scalar and tensorial modeling in Cartesian space for accurate, stable, and efficient atomistic predictions.

problem Complexity and challenges in equivariant atomistic machine learning models.
method Tensor Atomic Cluster Expansion (TACE) in Cartesian space, decomposing local environments into irreducible Cartesian tensors (ICT).
result Universal invariant and equivariant embeddings, enabling explicit control at inference.

Efficiently infers sparse networks from count data with reduced memory usage.

problem Sparse network inference for count data with high dimensions and dependencies.
method Improved Bigraphical Lasso using eigenvalue decomposition of Cartesian product graph.
result Reduced computational complexity from O(n2p2)O(n^2p^2) to O(n2+p2)O(n^2 + p^2).

We consider three different approaches to define natural Riemannian metrics on polytopes of stochastic matrices. First, we define a natural class of stochastic maps between these polytopes and give a metric characterization of Chentsov type in terms of invariance with respect to these maps. Second, we consider the Fish…

2014-04-01abs ↗pdf ↗

Improved exploration in factored average-reward MDPs reduces regret.

problem Minimizing regret in unknown Factored Markov Decision Processes (FMDPs).
method DBN-UCRL strategy, inspired by UCRL2, uses Bernstein-type confidence sets for individual elements of the transition function.
result Achieves a regret bound with a leading term strictly improving over existing bounds.

Given a complete and (locally) cartesian closed category U, it is shown that the category of functors from the category of Weil algebras to the category U is (locally, resp.) cartesian closed. The corresponding axiomatization for differential geometry based upon Weil functors is then given.

2012-09-27abs ↗pdf ↗