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

54107161214 · Jun 202019922001200920172026
48 results for Rotation group synchronization

Study optimizes estimation of orthogonal and rotation matrices from noisy data.

problem Estimating orthogonal and rotation matrices from noisy data.
method Iterative polar decomposition algorithm initialized by spectral methods.
result Algorithm achieves optimal error rate of $(1+o(1)) rac{σ^2 d(d-1)}{2np}$.

Novel higher-order group synchronization for noisy local measurements on hypergraphs.

problem Synchronizing higher-order local measurements on hyperedges to global estimates on nodes.
method Message passing algorithm for global synchronization of higher-order measurements.
result Higher-order method outperforms standard pairwise synchronization methods in certain applications.

Solves complex clustering and rotation synchronization problem.

problem Challenges in classifying and synchronizing rotated objects into multiple categories.
method Semidefinite programming relaxations to solve the joint problem of community detection and synchronization.
result Exact recovery of community detection and synchronization when extending stochastic block model.

New method synchronizes graphs with probability measures on rotations.

problem Synchronizing graphs with measure-valued edges over rotations.
method Formulated as maximization of cycle-consistency in probability measures over rotations, using Sinkhorn divergences.
result Proposes a nonparametric Riemannian particle optimization approach converging to global optimum under certain conditions.

Spectral methods achieve near-optimal performance in orthogonal and permutation group synchronization.

problem Recovering group elements from pairwise measurements in computer vision.
method Spectral methods applied with the leave-one-out technique.
result Near-optimal performance bounds for orthogonal and permutation group synchronization established.

New method uses neural networks for accurate angle estimation in noisy conditions.

problem Accurately estimate angles from noisy measurements in various applications.
method Directed Graph Neural Networks (GNNSync) for end-to-end trainable framework.
result GNNSync achieves competitive performance, even at high noise levels.

Spectral method for joint community detection and group synchronization.

problem Jointly detecting communities and synchronizing orthogonal groups in graphs.
method Spectral decomposition followed by CPQR factorization.
result Near-optimal guarantees for exact and stable recovery of cluster memberships and orthogonal transforms.

Paper addresses group synchronization with incomplete measurements and proves linear convergence of GPM.

problem Orthogonal group synchronization with incomplete measurements and additive noise.
method Generalized power method (GPM) with local error bound analysis.
result Linear convergence of GPM to a global maximizer under general additive noise model.

We propose a general framework for solving the group synchronization problem, where we focus on the setting of adversarial or uniform corruption and sufficiently small noise. Specifically, we apply a novel message passing procedure that uses cycle consistency information in order to estimate the corruption levels of gr…

2019-12-24abs ↗pdf ↗

Paper proposes GPM for simultaneous community detection and group synchronization.

problem Simultaneous community detection and group synchronization in networks.
method Generalized Power Method (GPM) for non-convex optimization.
result GPM achieves exact recovery in O(nlog2n)O(n\log^2n) time, outperforming SDP.

Extends angular synchronization to heterogeneous groups, improving accuracy in multiple applications.

problem Recovering angles from noisy pairwise measurements in a heterogeneous setting.
method Probabilistic generative model and spectral algorithm with robustness analysis.
result Spectral algorithm provides improved recovery accuracy in various parameter regimes.

We study Wick-rotations of left-invariant metrics on Lie groups, using results from real GIT (\cite{1}, \cite{2}, \cite{3}). An invariant for Wick-rotation of Lie groups is given, and we describe when a pseudo-Riemannian Lie group can be Wick-rotated to a Riemannian Lie group. We also prove a general version (for gener…

2018-10-29abs ↗pdf ↗

DS-Sync improves distributed DNN training efficiency by 94% with minimal accuracy loss.

problem Network bottlenecks in distributed DNN training.
method Divide workers into non-overlapping groups for independent synchronization, then shuffle workers among groups iteratively.
result DS-Sync achieves up to 94% improvement in training time with minimal accuracy loss.

Innovates rotation index for matrix pairs, solving group action problems.

problem Solving group actions problems, especially Nielsen realization and higher-rank Anosov actions.
method Rotation index and Milnor--Munkres--Novikov pairing applied to Z2\mathbb{Z}^2 group actions.
result Solved specific group action problems using new matrix pair invariant.

We define Wick-rotations by considering pseudo-Riemannian manifolds as real slices of a holomorphic Riemannian manifold. From a frame bundle viewpoint Wick-rotations between different pseudo-Riemannian spaces can then be studied through their structure groups which are real forms of the corresponding complexified Lie g…

2017-03-12abs ↗pdf ↗

In neural networks, it is often desirable to work with various representations of the same space. For example, 3D rotations can be represented with quaternions or Euler angles. In this paper, we advance a definition of a continuous representation, which can be helpful for training deep neural networks. We relate this t…

2018-12-17abs ↗pdf ↗

Recent work (Cohen & Welling, 2016) has shown that generalizations of convolutions, based on group theory, provide powerful inductive biases for learning. In these generalizations, filters are not only translated but can also be rotated, flipped, etc. However, coming up with exact models of how to rotate a 3 x 3 filter…

2019-05-12abs ↗pdf ↗

The paper is devoted to vector fields on the spaces R^2 and R^3, their flow and invariants. Attention is plaid on the tensor representations of the group GL(2,R) and on fundamental vector fields. The rotation group on R^3 is generalized to rotation groups with arbitrary quadrics as orbits.

2006-04-01abs ↗pdf ↗

We borrow a classical construction from the study of rational billiards in dynamical systems known as the "unfolding construction" and show that it can be used to study the automorphism group of a Platonic surface. More precisely, the monodromy group, or deck group in this case, associated to the cover of a regular pol…

2018-11-16abs ↗pdf ↗

In this paper we study general rotational surfaces in the 4- dimensional Euclidean space E4 and give a characterization of flat general rotation surface with pointwise 1-type Gauss map. Also, we show that a non-planar flat general rotation surface with pointwise 1-type Gauss map is a Lie group if and only if it is a Cl…

2013-02-12abs ↗pdf ↗

In this work, we give a survey on non characteristic domains of Heisenberg groups. We prove that bounded domains which are diffeomorphic to the solid torus having the center of the group as rotation axis, are non characteristic. Then, we state the following conjecture : The bounded non characteristic domains of the Hei…

2019-08-27abs ↗pdf ↗

Study the Hessian geometry of an ideal gas in a centrifuge.

problem Understanding the Hessian geometry of an ideal gas in a centrifuge.
method Investigate the Hessian geometry associated with an ideal gas in a spherical centrifuge, using the action of the Euclidean rotation group.
result The Hessian geometry of a spherical rigid body is isometric to a hyperbolic space in the high angular velocity limit.

We investigate the duality between minimal surfaces in Euclidean space and maximal surfaces in Lorentz-Minkowski space in the family of rotational surfaces. We study if the dual surfaces of two congruent rotational minimal (or maximal) surfaces are congruent. We show that in the duality process by means of a one-parame…

2017-03-11abs ↗pdf ↗

The goal of this article is to show that five explicitly given transformations, a rotation, two screw Heisenberg rotations, a vertical translation and an involution generate the Euclidean Picard modular groups with coefficient in the Euclidean ring of integers of a quadratic imaginary number field. We also obtain the r…

2010-06-16abs ↗pdf ↗

We analyze how an observer synchronizes to the internal state of a finite-state information source, using the epsilon-machine causal representation. Here, we treat the case of exact synchronization, when it is possible for the observer to synchronize completely after a finite number of observations. The more difficult …

2010-08-25abs ↗pdf ↗

New algorithm improves PPS for multi-object matching.

problem Efficiently synchronize partial permutations for multi-object matching.
method Proposed CEMP-Partial algorithm for partial permutation synchronization (PPS). Uses sparse matrix operations and nonconvex weighted projected power method.
result Proves CEMP-Partial can exactly classify corrupted and clean partial permutations under adversarial corruption.

Geometric approach improves motion alignment accuracy and efficiency.

problem Temporal alignment of human motion data for various applications.
method Geometric point of view, principal fiber bundle, reparameterization invariant projection, dynamic programming, keyframe correspondences.
result Temporal alignment procedures are more accurate and computationally efficient.