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

1.7%3.3%5.0%6.7% · Feb 199519922001200920172026
48 results for Cartesian grids

Poisson CNN solves Poisson equations on Cartesian grids efficiently.

problem Solving Poisson equations on 2D Cartesian grids with various boundary conditions.
method Fully convolutional neural network (CNN) architecture to solve Poisson equation.
result Encouraging performance in predicting Poisson solutions with mean errors below 10%.

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.

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.

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.

In compressed sensing MRI (CS-MRI), k-space measurements are under-sampled to achieve accelerated scan times. CS-MRI presents two fundamental problems: (1) where to sample and (2) how to reconstruct an under-sampled scan. In this paper, we tackle both problems simultaneously for the specific case of 2D Cartesian sampli…

2019-07-26abs ↗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.

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 ↗

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 ↗

Frolicher spaces and smooth mappings form a cartesian closed category. It was shown in our previous paper [Far East Journal of Mathematical Sciences, 35 (2009), 211-233] that its full subcategory of Weil exponentiable Frolicher spaces is cartesian closed. By emancipating microlinearity from within a well-adapted model …

2009-12-04abs ↗pdf ↗

Simplifies neural network models by explicitly enforcing constraints in Cartesian coordinates.

problem Learning dynamics of complex systems efficiently and accurately.
method Embedding systems into Cartesian coordinates and using Lagrange multipliers to enforce constraints.
result Explicitly enforcing constraints leads to a 100x improvement in accuracy and data efficiency.

Improved computational efficiency for estimating Wasserstein distance.

problem Inefficient computation of Wasserstein distance for large samples.
method Developed Sample-Sketch-Solve paradigm using grid sketches.
result Approximates Wasserstein distance within ε error in ε^(-max(2, (d+1+o(1))/(1+α))) time.

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 ↗

Generative model learns shape drift for quantifying domain uncertainty in hemodynamics.

problem Quantifying domain uncertainty in medical image segmentation for biomarker estimation.
method Conditional stochastic interpolant framework based on LDDMM registration.
result Generative model can create random perturbations of shapes for biomarker estimation.

Let B be a fiber bundle with compact fiber F over a compact Riemannian n-manifold M. There is a natural Riemannian metric on the total space B consistent with the metric on M. With respect to that metric, the volume of a rectifiable section s:M--> B is the mass of the image s(M) as a rectifiable n-current in B. Theorem…

2004-03-28abs ↗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 ↗

We present a grid diagram analogue of Carter, Rieger and Saito's smooth movie theorem. Specifically, we give definitions for grid movies, grid movie isotopies and present a definition of grid planar isotopy as a particular subset of the grid diagram moves: stabilization, destabilization and commutation. We show that gr…

2013-03-07abs ↗pdf ↗

New limits of minimal surface systems have surprising large interior parts.

problem Minimal surface system limits with large interior vertical and non-minimal portions.
method Construction of limits with smallest possible dimension and codimension.
result Limits of minimal surface systems can have surprising large interior parts.

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 ↗

Using standard analysis only, we present an extension R{^\bullet\R} of the real field containing nilpotent infinitesimals. On the one hand we want to present a very simple setting to formalize infinitesimal methods in Differential Geometry, Analysis and Physics. On the other hand we want to show that these infinitesim…

2003-08-13abs ↗pdf ↗

WeLa-VAE learns interpretable disentangled representations with weak supervision.

problem Learning disentangled representations without strong supervision.
method Variational inference framework with shared latent variables and modified variational lower bound.
result WeLa-VAE learns alternative disentangled representations (polar) from weak labels (distance and angle) without refined supervision.

The paper introduces triple grid diagrams to construct Lagrangian surfaces in complex projective space.

problem Constructing Lagrangian surfaces in complex projective space.
method Defining and analyzing triple grid diagrams to determine Lagrangian caps and surfaces.
result Triple grid diagrams can determine closed Lagrangian surfaces in CP2\mathbb{CP}^2 under certain conditions.

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.

Half grid diagrams prove every link can be represented by a special type of grid diagram.

problem Representing links using grid diagrams and related invariants.
method Defining half grid diagrams and constructing canonical pairs, proving equivalence to Jones' construction, relating to classical link invariants.
result Established a new method to relate the oriented Thompson index to classical link invariants and provided bounds for knot invariants.