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

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for Euclidean patterns

The paper extends circle pattern flows to hyperbolic and Euclidean geometry.

problem Extending circle pattern flows to hyperbolic and Euclidean geometry.
method Proving the existence and exponential convergence of combinatorial Calabi flows for ideal circle patterns.
result The solution to combinatorial Calabi flows converges exponentially fast to a flat cone metric.

In this paper we give two different proofs of Bobenko and Springborn's theorem of circle pattern: there exists a hyperbolic (or Euclidean) circle pattern with proscribed intersection angles and cone angles on a cellular decomposed surface up to isometry (or similarity).

2007-03-07abs ↗pdf ↗

We consider ``hyperideal'' circle patterns, i.e. patterns of disks appearing in the definition of the Delaunay decomposition associated to a set of disjoint disks, possibly with cone singularities at the center of those disks. Hyperideal circle patterns are associated to hyperideal hyperbolic polyhedra. We describe the…

2006-01-22abs ↗pdf ↗

This work proposes hyperbolic deep convolutional neural networks for better pattern recognition.

problem The limitations of Euclidean deep convolutional neural networks in capturing intricate patterns.
method Developed Hyperbolic DCNN based on Poincaré Disc, analyzing expansive convolution in non-Euclidean space.
result Hyperbolic convolutional architecture outperforms Euclidean ones in pattern recognition tasks.

We prove existence and uniqueness results for patterns of circles with prescribed intersection angles in constant curvature surfaces. Our method is based on two new functionals--one for the Euclidean and one for the hyperbolic case. We show how Colin de Verdi`ere's, Br"agger's and Rivin's functionals can be derived fro…

2002-03-25abs ↗pdf ↗

Study infinite circle patterns in the Weil-Petersson class using discrete harmonic functions.

problem Characterize infinite circle patterns in the Weil-Petersson class.
method Investigate circle patterns parameterized by discrete harmonic functions of finite Dirichlet energy, equipped with a Riemannian metric.
result Induced quasiconformal homeomorphisms from the unit disk to itself belong to the Weil-Petersson class.

We consider the empirical risk minimization problem for linear supervised learning, with regularization by structured sparsity-inducing norms. These are defined as sums of Euclidean norms on certain subsets of variables, extending the usual 1\ell_1-norm and the group 1\ell_1-norm by allowing the subsets to overlap. T…

2009-04-22abs ↗pdf ↗

Consider a curve ΓΓ in a domain DD in the plane R2\boldsymbol R^2. Thinking of DD as a piece of paper, one can make a curved folding PP in the Euclidean space R3\boldsymbol R^3. The singular set CC of PP as a space curve is called the crease of PP and the initially given plane curve ΓΓ is called the crease patt…

2019-10-15abs ↗pdf ↗

New discrete cmc surfaces defined from sphere packings and combinatorics.

problem Creating constant mean curvature surfaces from discrete data.
method Discrete cmc surfaces defined via sphere packings and combinatorial patterns.
result Construction of discrete cmc surfaces from orthogonal ring patterns.

Novel defects in hyperbolic sheets explain complex wrinkling patterns in nature.

problem Understanding complex wrinkling patterns in thin elastic hyperbolic surfaces.
method Non-Euclidean plate theory and investigation of branch points.
result Branch points are natural defects in hyperbolic sheets, influencing their morphology robustly.

A new associative memory uses Sinkhorn divergence for efficient pattern retrieval.

problem Efficiently retrieving patterns from large datasets of weighted point clouds.
method Derived retrieval dynamics as a SHK gradient flow, discretized for a deterministic algorithm.
result Proved basin invariance, geometric convergence, and robust recovery from perturbations.

This work improves KG embeddings by integrating hyperbolic and attention mechanisms.

problem Preserving hierarchical and logical patterns in KGs with low-dimensional embeddings.
method Combines hyperbolic reflections/rotations with attention mechanisms to capture complex relational patterns.
result Improves MRR by up to 6.1% on standard benchmarks and new state-of-the-art results in high dimensions.

Deep neural networks show some layers better align with data than others.

problem Understanding why some layers in deep neural networks better align with data.
method Introducing the Equilibrium Hypothesis to connect alignment pattern to signal propagation.
result The Equilibrium Hypothesis explains the ascent-descent pattern of alignment in deep neural networks.

A Delaunay cell decomposition of a surface with constant curvature gives rise to a circle pattern, consisting of the circles which are circumscribed to the facets. We treat the problem whether there exists a Delaunay cell decomposition for a given (topological) cell decomposition and given intersection angles of the ci…

2003-12-18abs ↗pdf ↗

HypeGBMS clusters data in hyperbolic space, overcoming Euclidean limitations.

problem Clustering in hierarchical or tree-like datasets in curved spaces.
method Hyperbolic Gaussian Blurring Mean Shift with Möbius-weighted means.
result HypeGBMS effectively captures latent hierarchies in non-Euclidean data.

The one-class classification problem is a well-known research endeavor in pattern recognition. The problem is also known under different names, such as outlier and novelty/anomaly detection. The core of the problem consists in modeling and recognizing patterns belonging only to a so-called target class. All other patte…

2014-07-28abs ↗pdf ↗

Discrete conformal maps on surfaces with vertex decorations are studied.

problem Discrete conformal equivalence for decorated piecewise Euclidean surfaces.
method Intimate relationship between decorated PE-surfaces, canonical tessellations of hyperbolic surfaces, and convex hyperbolic polyhedra; concave variational principle.
result Proof of discrete uniformization theorem for decorated PE-surfaces.

It is often hypothesized that a crucial role for recurrent connections in the brain is to constrain the set of possible response patterns, thereby shaping the neural code. This implies the existence of neural codes that cannot arise solely from feedforward processing. We set out to find such codes in the context of one…

2013-10-14abs ↗pdf ↗

In this paper, we propose a novel adaptive kernel for the radial basis function (RBF) neural networks. The proposed kernel adaptively fuses the Euclidean and cosine distance measures to exploit the reciprocating properties of the two. The proposed framework dynamically adapts the weights of the participating kernels us…

2019-05-09abs ↗pdf ↗

The problem of joint feature selection across a group of related tasks has applications in many areas including biomedical informatics and computer vision. We consider the l2,1-norm regularized regression model for joint feature selection from multiple tasks, which can be derived in the probabilistic framework by assum…

2012-05-09abs ↗pdf ↗

The paper explores how different patterns of heterophily affect Graph Neural Networks.

problem Understanding the impact of heterophily on Graph Neural Networks.
method Theoretical analysis and experiments with Heterophilous Stochastic Block Models (HSBM).
result The impact of heterophily on classification depends on the Euclidean distance of neighborhood distributions and the averaged node degree.

Research shows that certain metric spaces cannot contain rigid structures and provides evidence for loose embeddings into Euclidean spaces.

problem The inability of certain metric spaces to contain rigid structures like regular simplices or equidistant sequences.
method Proof of non-embeddability of certain metric spaces into finite-dimensional Euclidean spaces and a local-to-global principle for loose embeddability.
result Compact Riemannian manifolds cannot contain arbitrarily large regular simplices or long equidistant sequences, suggesting loose embeddings into Euclidean spaces.

Traditional anatomical analyses captured only a fraction of real phenomic information. Here, we apply deep learning to quantify total phenotypic similarity across 2468 butterfly photographs, covering 38 subspecies from the polymorphic mimicry complex of Heliconius erato\textit{Heliconius erato} and Heliconius melpomene\textit{Heliconius melpomene}. E…

2019-08-15abs ↗pdf ↗

Unified framework recovers exact input from SOM activation patterns.

problem Generating high-dimensional data from Self-Organizing Maps (SOMs).
method Inverting SOM activation patterns to recover input, using linear system and Tikhonov regularization.
result MUSIC framework produces coherent semantic transitions and maintains high classifier confidence.

We found a class of triangulated surfaces in Euclidean space which have similar properties as isothermic surfaces in Differential Geometry. We call a surface isothermic if it admits an infinitesimal isometric deformation preserving the mean curvature integrand locally. We show that this class is Möbius invariant. Isoth…

2015-01-12abs ↗pdf ↗

Curvature regularization prevents distortion in graph embeddings.

problem Graph topology patterns distort in Euclidean space, making detection difficult.
method Proposes curvature regularization to enforce flatness in embedding manifolds.
result Significant improvements in five embedding methods on open graph datasets.