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

73146218291 · Jun 202019922001200920172026
48 results for random rotations

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.

New method certifies images against transformations like rotations and translations.

problem Certifying robustness of images against transformations like rotations and translations.
method Randomized smoothing with three different kinds of defenses.
result Individual certificates can be obtained via statistical error bounds or efficient online inverse computation.

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

Exact optimality achieved in distributed mean estimation with shared randomness.

problem Achieving optimal communication, privacy, and utility tradeoffs in distributed mean estimation.
method Utilization of a rotationally symmetric shared random codebook and a kk-closest encoding mechanism.
result Proposed mechanism achieves exact optimality for randomly rotated simplex codebook.

FibQuant improves KV-cache compression for long-context inference.

problem Memory traffic bottleneck in long-context inference due to KV cache growth.
method Introduces FibQuant, a universal vector quantizer that combines Beta-quantile radii, Fibonacci/Roberts-Kronecker directions, and Lloyd-Max refinement.
result FibQuant achieves high compression rates with minimal loss in attention cosine similarity.

The paper analyzes why Gaussianization slows down with higher dimensions and proposes a solution.

problem The convergence rate of Gaussianization slows down as the dimension increases.
method Analytical and empirical analysis of Gaussianization with random rotations.
result The number of required layers scales linearly with the dimension for Gaussian input.

Subsampled Randomized Hadamard Transform (SRHT), a popular random projection method that can efficiently project a dd-dimensional data into rr-dimensional space (rdr \ll d) in O(dlog(d))O(dlog(d)) time, has been widely used to address the challenge of high-dimensionality in machine learning. SRHT works by rotating the input …

2020-02-05abs ↗pdf ↗

We consider probabilistic PCA and related factor models from a Bayesian perspective. These models are in general not identifiable as the likelihood has a rotational symmetry. This gives rise to complicated posterior distributions with continuous subspaces of equal density and thus hinders efficiency of inference as wel…

2019-05-12abs ↗pdf ↗

We propose a principled method for kernel learning, which relies on a Fourier-analytic characterization of translation-invariant or rotation-invariant kernels. Our method produces a sequence of feature maps, iteratively refining the SVM margin. We provide rigorous guarantees for optimality and generalization, interpret…

2017-10-27abs ↗pdf ↗

Most signal processing problems involve the challenging task of multidimensional probability density function (PDF) estimation. In this work, we propose a solution to this problem by using a family of Rotation-based Iterative Gaussianization (RBIG) transforms. The general framework consists of the sequential applicatio…

2016-01-31abs ↗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.

Expanding self-supervised learning to diverse domains reveals Rotation's semantic superiority.

problem Limited self-supervised learning experiments on diverse domains.
method Experimented on various domains (satellite, textural, biological) using popular self-supervised methods.
result Rotation task is semantically most meaningful, with other tasks relying on distribution rather than semantic understanding.

New TSER algorithms outperform existing methods in time series extrinsic regression.

problem Improving time series extrinsic regression models.
method Extended TSER archive, introduced two new algorithms (FreshPRINCE and DrCIF), compared with rotation forest.
result DrCIF and FreshPRINCE models significantly outperform existing methods.

The paper develops a new algorithm for RBMs using dynamical mean-field theory.

problem Learning in Restricted Boltzmann Machines (RBMs) with complex dependencies.
method Dynamical mean-field theory applied to RBMs with rectangular coupling matrices drawn from a bi-rotation invariant ensemble.
result The algorithm converges globally under a stability criterion, with rates matching numerical simulations.

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.

Whitening, or sphering, is a common preprocessing step in statistical analysis to transform random variables to orthogonality. However, due to rotational freedom there are infinitely many possible whitening procedures. Consequently, there is a diverse range of sphering methods in use, for example based on principal com…

2015-12-02abs ↗pdf ↗

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 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 ↗

This paper explores the trade-off between spatial and adversarial robustness in neural networks.

problem Understanding the trade-off between spatial and adversarial robustness in neural networks.
method Quantitative analysis and empirical testing with curriculum learning.
result Spatial robustness and adversarial robustness are quantitatively related and can be improved simultaneously.

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 ↗

Invariance to nuisance transformations is one of the desirable properties of effective representations. We consider transformations that form a \emph{group} and propose an approach based on kernel methods to derive local group invariant representations. Locality is achieved by defining a suitable probability distributi…

2016-12-06abs ↗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 ↗

We consider nn-dimensional discrete motions such that any two neighbouring positions correspond in a pure rotation ("rotating motions"). In the Study quadric model of Euclidean displacements these motions correspond to quadrilateral nets with edges contained in the Study quadric ("rotation nets"). The main focus of ou…

2010-04-08abs ↗pdf ↗

The study examines lower and upper bounds of Wasserstein distances for affine transformations of random vectors.

problem Understanding Wasserstein distances for affine transformations of random vectors.
method Lower and upper bounds for affine transformations of random vectors in Rn\mathbb{R}^n are derived using Bures metric and compositions of affine maps.
result Concrete lower bounds and upper bounds for affine transformations are derived and applied to various distributions.

Study on rotational hypersurfaces with constant Gauss-Kronecker curvature.

problem Exploring hypersurfaces with constant Gauss-Kronecker curvature.
method Solving ODE for generating curves and analyzing geometric properties.
result Discovery of non-compact rotational hypersurfaces with negative Gauss-Kronecker curvature and finite volume.