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

22456789 · Jun 202019922001200920172026
48 results for rotation matrices

A new algorithm computes elastic shape distances between curves efficiently.

problem Computing elastic shape distances between curves in high dimensions.
method Dynamic Programming for optimal diffeomorphisms and Kabsch-Umeyama algorithm for optimal rotation matrices.
result Efficient computation of elastic shape distances with improved efficiency for closed curves.

The paper learns pose variations within shape populations using constrained mixtures of factor analyzers.

problem Learning pose variations within a shape population with articulated parts and relative rotations.
method Formulated as mixtures of factor analyzers, segmentation by component posterior probabilities, and constraints on factor loading matrices for rotation matrices.
result Automatic learning of pose variations from shape populations, resulting in smooth and realistic animations.

Generating point clouds, e.g., molecular structures, in arbitrary rotations, translations, and enumerations remains a challenging task. Meanwhile, neural networks utilizing symmetry invariant layers have been shown to be able to optimize their training objective in a data-efficient way. In this spirit, we present an ar…

2019-10-07abs ↗pdf ↗

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 provide the construction of a set of square matrices whose translates and rotates provide a Parseval frame that is optimal for approximating a given dataset of images. Our approach is based on abstract harmonic analysis techniques. Optimality is considered with respect to the quadratic error of approximation of the …

2019-09-04abs ↗pdf ↗

Derives a sharp inequality for trace-free matrices with applications to hypersurfaces.

problem Classifying conformally flat hypersurfaces and characterizing rotational hypersurfaces.
method Derives a sharp inequality relating eigenvalues of trace-free matrices and applies it to hypersurfaces.
result New proof of the classification of conformally flat hypersurfaces and construction of a functional for rotational hypersurfaces.

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}$.

We study the problem of approximating orthogonal matrices so that their application is numerically fast and yet accurate. We find an approximation by solving an optimization problem over a set of structured matrices, that we call extended orthogonal Givens transformations, including Givens rotations as a special case. …

2019-07-18abs ↗pdf ↗

We investigate the problem of estimating a given real symmetric signal matrix C\textbf{C} from a noisy observation matrix M\textbf{M} in the limit of large dimension. We consider the case where the noisy measurement M\textbf{M} comes either from an arbitrary additive or multiplicative rotational invariant perturbati…

2015-02-24abs ↗pdf ↗

Study connects covariance cleaning theory to information theory for heavy-tailed distributions.

problem Optimizing covariance matrices for heavy-tailed distributions using information theory.
method Minimizing Frobenius norm and information loss between true and estimated covariance matrices.
result Asymptotic regime of large matrices minimizes information loss for Student's t distributions.

BOOOM optimizes orthonormal matrices without needing gradients.

problem Optimizing over the Stiefel manifold in non-convex, non-smooth settings.
method Global Givens rotation-based parametrization and Recursive Modified Pattern Search.
result BOOOM achieves strong performance across various optimization problems.

DFRot improves LLMs by reducing outlier and massive activation effects.

problem Reducing outlier and massive activation effects in rotated LLMs.
method Weighted loss function and orthogonal Procrustes transforms for rotation matrix refinement.
result DFRot achieves dual free (Outlier-Free and Massive Activation-Free) with significant improvements in perplexity.

We propose a novel approach to addressing the vanishing (or exploding) gradient problem in deep neural networks. We construct a new architecture for deep neural networks where all layers (except the output layer) of the network are a combination of rotation, permutation, diagonal, and activation sublayers which are all…

2019-11-21abs ↗pdf ↗

The concepts of unitary evolution matrices and associative memory have boosted the field of Recurrent Neural Networks (RNN) to state-of-the-art performance in a variety of sequential tasks. However, RNN still have a limited capacity to manipulate long-term memory. To bypass this weakness the most successful application…

2017-10-26abs ↗pdf ↗

This paper considers a new family of variational distributions motivated by Sklar's theorem. This family is based on new copula-like densities on the hypercube with non-uniform marginals which can be sampled efficiently, i.e. with a complexity linear in the dimension of state space. Then, the proposed variational densi…

2019-04-15abs ↗pdf ↗

LOCUS separates brain network connectivity matrices efficiently.

problem High dimensionality, latent sources, and spurious findings in analyzing brain connectivity matrices.
method LOCUS: low-rank structure with uniform sparsity, iterative Node-Rotation algorithm.
result LOCUS achieves more efficient and accurate source separation for connectivity matrices.

Predict missing movie ratings or graph embeddings with low rank matrices.

problem Predicting missing entries in a ratings matrix or graph embeddings with known linear relations.
method Low rank matrix completion approach applied to graph embeddings.
result Effective methods for predicting missing entries in matrices and graph embeddings.

Recent machine learning methods make it possible to model potential energy of atomic configurations with chemical-level accuracy (as calculated from ab-initio calculations) and at speeds suitable for molecular dynam- ics simulation. Best performance is achieved when the known physical constraints are encoded in the mac…

2016-12-01abs ↗pdf ↗

We introduce SARR for symmetric object pose estimation, improving CNN performance.

problem Ambiguities in symmetric object orientations hinder deep learning pose estimation.
method Numeric rotation representation using symmetry-derived trigonometric identities.
result SARR enables standard CNNs to achieve state-of-the-art performance.

OMD monitors stock market dynamics through matrix trajectories, revealing crisis patterns and sector rotations.

problem Understanding and predicting stock market dynamics during crises.
method Applying OMD to S&P 500 returns over three crises, analyzing distance matrices and their spectra.
result Market dynamics show coherent changes during crises, with sector-specific patterns and volatility clustering.

The paper defines and analyzes homotopic rotation sets for surfaces of higher genus.

problem Defining and analyzing homotopic rotation sets for surfaces of higher genus.
method Developed a definition and proved several results using the theory of Le Calvez and Tal.
result Found that the homotopic rotation set can imply the existence of infinitely many periodic orbits under certain conditions.

Study of timelike surfaces in Minkowski space with specific geometric properties.

problem Characterizing geometric properties of timelike surfaces in Minkowski space.
method Analytical study of two types of timelike general rotational surfaces.
result Explicit descriptions of minimal and surfaces with specific curvature properties.

The paper deals with the Weyl equation which is the massless Dirac equation. We study the Weyl equation in the stationary setting, i.e. when the spinor field oscillates harmonically in time. We suggest a new geometric interpretation of the stationary Weyl equation, one which does not require the use of spinors, Pauli m…

2010-01-26abs ↗pdf ↗

The study characterizes loxodromes on specific rotational surfaces in 3D space.

problem Characterizing loxodromes on rotational surfaces with special geometric properties.
method Parametrizations and curvature/torsion calculations for loxodromes on various rotational surfaces.
result The loxodrome on a flat rotational surface is a general helix.

General rotational surfaces as a source of examples of surfaces in the four-dimensional Euclidean space have been introduced by C. Moore. In this paper we consider the analogue of these surfaces in the Minkowski 4-space. On the base of our invariant theory of spacelike surfaces we study general rotational surfaces with…

2013-12-05abs ↗pdf ↗

The paper deals with the Weyl equation which is the massless Dirac equation. We study the Weyl equation in the stationary setting, i.e. when the the spinor field oscillates harmonically in time. We suggest a new geometric interpretation of the stationary Weyl equation, one which does not require the use of spinors, Pau…

2010-03-02abs ↗pdf ↗

This paper proposes a set of rules to revise various neural networks for 3D point cloud processing to rotation-equivariant quaternion neural networks (REQNNs). We find that when a neural network uses quaternion features under certain conditions, the network feature naturally has the rotation-equivariance property. Rota…

2019-11-20abs ↗pdf ↗

RotEqNet preserves rotation symmetry in fluid systems using high-order tensors.

problem Lack of rotational symmetry in machine learning models for fluid systems.
method Introduces RotEqNet, a network that guarantees rotation-equivariance for high-order tensors.
result RotEqNet reduces errors and maintains rotation-equivariance in fluid systems.

The rotation prediction (Rotation) is a simple pretext-task for self-supervised learning (SSL), where models learn useful representations for target vision tasks by solving pretext-tasks. Although Rotation captures information of object shapes, it hardly captures information of textures. To tackle this problem, we intr…

2019-12-25abs ↗pdf ↗

The paper applies Clairaut's theorem to rotational surfaces in pseudo-Euclidean 4-space.

problem Exploring geodesic curves on rotational surfaces in pseudo-Euclidean 4-space.
method Expressing Clairaut's theorem and deriving equations for geodesic curves.
result Characterization of geodesic curves on hyperbolic and elliptic surfaces of rotation.

Convolutional networks are successful due to their equivariance/invariance under translations. However, rotatable data such as images, volumes, shapes, or point clouds require processing with equivariance/invariance under rotations in cases where the rotational orientation of the coordinate system does not affect the m…

2019-10-31abs ↗pdf ↗