arXiv research

Study uncovers tactical line-breaking passes in football using clustering.

This work proposes a geometric approach to equivariant message passing on Riemannian manifolds.

ReD improves LLM inference efficiency at fixed budget, reducing attempts and cost.

Optimizes reinforcement learning by prioritizing sets of samples over individual ones.

Study finds critical points in perimeter functional for fixed volume sets.

We present a survey on generic singularities of geodesic flows in smooth signature changing metrics (often called pseudo-Riemannian) in dimension 2. Generically, a pseudo-Riemannian metric on a 2-manifold $S$ changes its signature (degenerates) along a curve $S_0$, which locally separates $S$ into a Riemannian ($R$) an…

Study Kähler metrics on complex tori with almost non-negative scalar curvature.

Consider a sequence of closed, orientable surfaces of fixed genus $g$ in a Riemannian manifold $M$ with uniform upper bounds on mean curvature and area. We show that on passing to a subsequence and choosing appropriate parametrisations, the inclusion maps converge in $C^0$ to a map from a surface of genus $g$ to $M$. W…

It is difficult to quantify structure-property relationships and to identify structural features of complex materials. The characterization of amorphous materials is especially challenging because their lack of long-range order makes it difficult to define structural metrics. In this work, we apply deep learning algori…

Polar manifolds are Riemannian G-manifolds admitting a "section", i.e., a complete submanifold passing through every orbit and doing so orthogonally. We consider compact simply-connected polar manifolds and achieve an equivariantly diffeomorphic classification in dimensions 5 or less. As an application, we determine wh…

Proves infinitesimal rigidity of Hermitian gravitational instantons.

The paper is a study of geodesic in two-dimensional pseudo-Riemannian metrics. Firstly, the local properties of geodesics in a neighborhood of generic parabolic points are investigated. The equation of the geodesic flow has singularities at such points that leads to a curious phenomenon: geodesics cannot pass through s…

We analyze oversquashing in topological message-passing using relational structures.

Message passing is the key to graph neural networks, but new terms are needed to avoid confusion.

The paper investigates heavy-tailed behavior in offline SGD, showing it approximates power-law tails.

Graph Network-based Simulators learn complex physics simulations.

FinReflectKG builds a comprehensive financial knowledge graph from SEC filings, improving extraction quality.

The study predicts pass completion probability in NFL games.

Study uses complex networks and machine learning to predict soccer match outcomes.

If (M,g) is a Riemannian manifold and x,y are points in M, then a subset P of M\{x,y} is said to be a blocking set for (x,y) if every geodesic from x to y passes through a point of P. If no pair (x,y) in M X M has a finite blocking set, then (M,g) is said to be totally insecure. We prove that there exist real analytic …

A simple model explains inference scaling in neural models.

This article is motivated by soccer positional passing networks collected across multiple games. We refer to these data as replicated spatial passing networks---to accurately model such data it is necessary to take into account the spatial positions of the passer and receiver for each passing event. This spatial regist…

ADMP-GNN dynamically adjusts message-passing layers for better graph learning performance.

A new knot move preserves pass-move equivalence and differs in count.

Every classical knot is band-pass equivalent to the unknot or the trefoil. The band-pass class of a knot is a concordance invariant. Every ribbon knot, for example, is band-pass equivalent to the unknot. Here we introduce the long virtual knot concordance group $\mathscr{VC}$. It is shown that for every concordance cla…

New MCMC algorithm reduces subset selection passes to 2 for optimal $k$-dimensional subspace approximation.

Researchers prove rigidity for log-Sobolev inequality on specific metric spaces.

Factor graphs have recently gained increasing attention as a unified framework for representing and constructing algorithms for signal processing, estimation, and control. One capability that does not seem to be well explored within the factor graph tool kit is the ability to handle deterministic nonlinear transformati…

The equivariant Gromov--Hausdorff convergence of metric spaces is studied. Where all isometry groups under consideration are compact Lie, it is shown that an upper bound on the dimension of the group guarantees that the convergence is by Lie homomorphisms. Additional lower bounds on curvature and volume strengthen this…

We use the $η$-invariant of Atiyah-Patodi-Singer to compute the Eells-Kuiper invariant for the Eells-Kuiper quaternionic projective plane. By combining with a known result of Bérard-Bergery, it shows that every Eells-Kuiper quaternionic projective plane carries a Riemannian metric such that all geodesics passing throug…

Estimates metric tensor on neuromanifolds using Fisher information and random methods.

LayerNorm transformers have dead directions that can be read from their parameters alone.

Complete classification of links up to specific moves.

Proves existence of a single-valued minimal hypersurface in compact manifolds.

We consider stochastic gradient descent (SGD) for least-squares regression with potentially several passes over the data. While several passes have been widely reported to perform practically better in terms of predictive performance on unseen data, the existing theoretical analysis of SGD suggests that a single pass i…

New graph coarsening method preserves GNN message-passing signals.

Study on convergence of graph neural networks on random graphs.

Quantitative analysis of soccer players' passing ability focuses on descriptive statistics without considering the players' real contribution to the passing and ball possession strategy of their team. Which player is able to help the build-up of an attack, or to maintain the possession of the ball? We introduce a novel…

DG improves policy gradient efficiency by selectively backpropagating only valuable samples.

Stochastic Gradient Descent can overfit after just a few passes, contrary to initial expectations.

Chebyshev technique reduces FRTB-IMA equity autocallables computation costs by 90%.

A pair of points (x,y) in a Riemannian manifold (M,g) is said to have the finite blocking property if there is a finite set P contained in M\{x,y} such that every geodesic segment from x to y passes through a point of P. We show that for every closed C-infinity manifold M of dimension at least two and every pair (x,y) …

One-pass algorithm finds small subset for $\ell_p$ subspace approximation with additive error.

Reciprocal processes are acausal generalizations of Markov processes introduced by Bernstein in 1932. In the literature, a significant amount of attention has been focused on developing dynamical models for reciprocal processes. In this paper, we provide a probabilistic graphical model for reciprocal processes. This le…

In this paper we prescribe a fourth order conformal invariant on the standard $n-$sphere, with $n\geq5$, and study the related fourth order elliptic equation. We first find some existence results in the perturbative case. After some blow up analysis we build a homotopy to pass from the perturbative case to the non-pert…

The (ordinary) unknotting-number of 1-dimensional knots, which is defined by using the crossing-change, is a very basic and important invariant. It is very natural to consider the `unknotting-number' associated with other local-moves on n-dimensional knots, where n is a natural number. In this paper we prove the follow…

Study virtualized Delta, Sharp, and Pass moves for oriented virtual knots and links.

The simplest non-trivial solutions of WDVV equations are A_n and B_n-potentials, which describe metrics of K.Saito on spaces of versal deformation of A_n and B_n-singularities. These are some polynomials, which were known for $n\leqslant$ 4. We find some recurrence relations, which give a possibility to find all A_n an…