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

196391587782 · Jun 202019922001200920172026
48 results for simple edge spaces

Let (X,g)(X,g) be a compact Riemannian stratified space with simple edge singularity. Thus a neighbourhood of the singular stratum is a bundle of truncated cones over a lower dimensional compact smooth manifold. We calculate the various polynomially weighted de Rham cohomology spaces of XX, as well as the associated spac…

2005-03-16abs ↗pdf ↗

New graph shows edge deletion/contraction doesn't always result in intrinsically linked graphs.

problem Edge operations in intrinsically knotted graphs don't always produce intrinsically linked graphs.
method Presented a new intrinsically knotted graph.
result Edge operations in intrinsically knotted graphs don't always result in intrinsically linked graphs.

We show that the singularities of spacelike maximal surfaces in Lorentz-Minkowski 3-space generically consist of cuspidal edges, swallowtails and cuspidal cross caps. The same result holds for spacelike mean curvature one surfaces in de Sitter 3-space. To prove these, we shall give a simple criterion for a given singul…

2005-10-18abs ↗pdf ↗

This paper addresses questions of quasi-isometric rigidity and classification for fundamental groups of finite graphs of groups, under the assumption that the Bass-Serre tree of the graph of groups has finite depth. The main example of a finite depth graph of groups is one whose vertex and edge groups are coarse Poinca…

2004-05-13abs ↗pdf ↗

Previous work in network analysis has focused on modeling the mixed-memberships of node roles in the graph, but not the roles of edges. We introduce the edge role discovery problem and present a generalizable framework for learning and extracting edge roles from arbitrary graphs automatically. Furthermore, while existi…

2016-10-04abs ↗pdf ↗

Statistical inference on graphs is a burgeoning field in the applied and theoretical statistics communities, as well as throughout the wider world of science, engineering, business, etc. In many applications, we are faced with the reality of errorfully observed graphs. That is, the existence of an edge between two vert…

2012-11-15abs ↗pdf ↗

POET enables large neural network training on tiny devices with reduced energy.

problem Training large neural networks on memory-limited edge devices.
method Jointly optimizes rematerialization and paging for memory reduction, formulating an MILP for energy-efficient training.
result POET trains ResNet-18 and BERT within Cortex-M memory constraints, outperforming current methods in energy efficiency.

Research finds bounds for knots in hexagonal lattice and classifies 11-stick knots.

problem Determining the stick number and edge length of knots in a hexagonal lattice.
method Introducing a linear transformation between lattices to prove strict inequalities and classifying knots.
result Only trefoil and figure-eight knots are 11-stick knots in the hexagonal lattice.

This paper interprets critical scales in persistent homology for compact metric spaces.

problem Understanding critical scales in persistent homology for general compact metric spaces.
method Analyzing local minima of the distance function and their impact on persistence.
result Each decrease in zero-dimensional persistence and increase in one-dimensional persistence is induced by local minima of the distance function.

This paper optimizes object tracking on edge devices with small matrices.

problem Efficiently tracking objects in video sequences on edge devices with small matrices.
method Parallelized a Simple Online and Real-time Tracking (SORT) application on shared-memory multicores.
result Throughput-based parallelization technique outperforms multi-threading for small matrices.

The study analyzes sharpness dynamics in neural networks, revealing mechanisms and conditions.

problem Understanding sharpness in neural network training.
method Fixed point analysis and edge of stability analysis in a simplified 2-layer linear network.
result Reveals mechanisms behind sharpness trends, conditions for edge of stability, and a period-doubling route to chaos.

A zigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face. A railroad in a plane graph is a circuit of hexagonal faces, such that any hexagon is adjacent to its neighbors on opposite edges. A graph without a railroad is called tight. We consider the zigz…

2002-12-27abs ↗pdf ↗

EDG generates Boltzmann samples from latent variables efficiently.

problem Sampling from complex energy functions in high dimensions.
method Combines variational autoencoders and diffusion models; uses a decoder and diffusion-based encoder.
result EDG outperforms existing methods in various sampling tasks.

Along cuspidal edge singularities on a given surface in Euclidean 3-space, which can be parametrized by a regular space curve, a unit normal vector field νν is well-defined as a smooth vector field of the surface. A cuspidal edge singular point is called generic if the osculating plane of the cuspidal edge (as a regul…

2014-08-19abs ↗pdf ↗

In L^3, cuspidal edges can have bounded mean curvature under specific conditions.

problem Understanding cuspidal edges with bounded mean curvature in Lorentz-Minkowski 3-space.
method Investigated cuspidal edges and generalized cuspidal edges, analyzing their singular points and principal curvatures.
result Cuspidal edges with bounded mean curvature in L^3 occur only when the singular set is a light-like curve.

Method solves optimisation problems on non-Riemannian surfaces with bilateral curvature bounds.

problem Optimisation problems on non-Riemannian surfaces with sharp edges.
method Forward-backward splitting in Alexandrov spaces with bilateral curvature bounds.
result Convergence of the forward-backward method in Alexandrov spaces with bilateral curvature bounds.

Researchers develop a method to interpret GNNs by identifying unnecessary edges in NLP models.

problem Understanding which parts of graphs contribute to NLP model predictions.
method A post-hoc method using differentiable edge masking to identify and drop unnecessary edges.
result Large proportions of edges can be dropped without affecting model performance, providing insights into model predictions.

We study the spectral geometric properties of the scalar Laplace-Beltrami operator associated to the Weil-Petersson metric gWPg_{\mathrm{WP}} on Mγ\mathcal M_γ, the Riemann moduli space of surfaces of genus γ>1γ> 1. This space has a singular compactification with respect to gWPg_{\mathrm{WP}}, and this metric has crossing…

2012-06-18abs ↗pdf ↗

A new ODE model explains gradient descent dynamics near edge of stability.

problem Understanding gradient-based training over non-convex landscapes.
method Rod Flow, a new ODE approximation of GD dynamics.
result Rod Flow accurately predicts critical sharpness threshold and self-stabilization in quartic potentials.

The Regge symmetry is a set of remarkable relations between two tetrahedra whose edge lengths are related in a simple fashion. It was first discovered as a consequence of an asymptotic formula in mathematical physics. Here we give a simple geometric proof of Regge symmetries in Euclidean, spherical, and hyperbolic geom…

2019-03-12abs ↗pdf ↗

Learning low-dimensional embeddings of knowledge graphs is a powerful approach used to predict unobserved or missing edges between entities. However, an open challenge in this area is developing techniques that can go beyond simple edge prediction and handle more complex logical queries, which might involve multiple un…

2018-06-05abs ↗pdf ↗

This paper proposes a discrimination technique for vertices in a weighted network. We assume that the edge weights and adjacencies in the network are conditionally independent and that both sources of information encode class membership information. In particular, we introduce a edge weight distribution matrix to the s…

2019-06-07abs ↗pdf ↗

We address the problem of computing a single linkage dendrogram. A possible approach is to: (i) Form an edge weighted graph GG over the data, with edge weights reflecting dissimilarities. (ii) Calculate the MST TT of GG. (iii) Break the longest edge of TT thereby splitting it into subtrees TLT_L, TRT_R. (iv) Apply …

2019-11-01abs ↗pdf ↗

We establish existence of the eta-invariant as well as of the Atiyah-Patodi-Singer and the Cheeger-Gromov rho-invariants for a class of Dirac operators on an incomplete edge space. Our analysis applies in particular to the signature, the Gauss-Bonnet and the spin Dirac operator. We derive an analogue of the Atiyah-Pato…

2016-04-25abs ↗pdf ↗

Research explores hyperbolic space groups and their fundamental domains.

problem Investigating fundamental domains of space groups in hyperbolic spaces.
method Analyzing symmetries of fundamental polyhedra and considering edge conditions.
result Identifies edge conditions for simplicial fundamental domains of Family F12.

Orpheus simplifies deep learning deployment on edge devices.

problem Optimizing deep learning inference on edge devices for efficiency.
method Orpheus is a new framework with a small codebase, minimal dependencies, and easy integration.
result Preliminary results show the effectiveness of Orpheus for inference optimisations.

Paper determines Assouad-Nagata dimension for all minor-closed metrics.

problem Understanding the Assouad-Nagata dimension of minor-closed metrics.
method Using edge-weighted graphs and edge-deletion/contraction to model minor-closed metrics, determining their Assouad-Nagata dimension.
result Determined the Assouad-Nagata dimension for every minor-closed metric.

Discrete knot theory models use lattice-filtered graphs to detect merging knot components.

problem Detecting merging knot components in discrete models.
method Lattice-filtered move graphs to model knot types, identifying connected components and merge scales.
result Merge scale defined by connected components of lattice-filtered move graphs, with specific examples for the figure-eight knot.

We derive a formula for the index of a Dirac operator on a compact, even-dimensional incomplete edge space satisfying a "geometric Witt condition". We accomplish this by cutting off to a smooth manifold with boundary, applying the Atiyah-Patodi-Singer index theorem, and taking a limit. We deduce corollaries related to …

2013-12-16abs ↗pdf ↗

Given a simple algebraic group GG, a web is a directed trivalent graph with edges labelled by dominant minuscule weights. There is a natural surjection of webs onto the invariant space of tensor products of minuscule representations. Following the work of Westbury, we produce a set of webs for $\SL_n$ which form a bas…

2011-08-23abs ↗pdf ↗