arXiv research

This paper introduces a new method for semi-supervised learning on high dimensional nonlinear manifolds, which includes a phase of unsupervised basis learning and a phase of supervised function learning. The learned bases provide a set of anchor points to form a local coordinate system, such that each data point $x$ on…

Concept Factorization (CF) and its variants may produce inaccurate representation and clustering results due to the sensitivity to noise, hard constraint on the reconstruction error and pre-obtained approximate similarities. To improve the representation ability, a novel unsupervised Robust Flexible Auto-weighted Local…

In this paper, we introduce DICOD, a convolutional sparse coding algorithm which builds shift invariant representations for long signals. This algorithm is designed to run in a distributed setting, with local message passing, making it communication efficient. It is based on coordinate descent and uses locally greedy u…

Improves GANs by sampling meaningful points from latent manifold.

Novel deep learning method predicts reaction coordinates and future MD trajectories.

Derives new orthogonal coordinates for evolving surfaces and curves.

Predicts local AQI using mobile sensor data, improving accuracy by 71.654 MSE.

We consider (locally) energy finite coordinates associated with a strongly local regular Dirichlet form on a metric measure space. We give coordinate formulas for substitutes of tangent spaces, for gradient and divergence operators and for the infinitesimal generator. As examples we discuss Euclidean spaces, Riemannian…

Cyclic coordinate descent identifies models in finite time and converges linearly.

Paper tackles measure estimation in barycentric coding model.

If one could assume that local coordinates in a Riemannian manifold were orthogonal, then local expressions for differential operators, and curvature computations, would be simplified. It is always possible on 2-manifolds, using geometric normal coordinates or isothermal coordinates. In 1984, Dennis DeTurck and Dean Ya…

In supervised binary hashing, one wants to learn a function that maps a high-dimensional feature vector to a vector of binary codes, for application to fast image retrieval. This typically results in a difficult optimization problem, nonconvex and nonsmooth, because of the discrete variables involved. Much work has sim…

Generalizes Riemann's results on flat coordinates for non-symmetric bilinear forms.

We construct a tangent bundle exponential map and locally autoparallel coordinates for geometries based on a general connection on the tangent bundle of a manifold. As concrete application we use these new coordinates for Finslerian geometries and obtain Finslerian geodesic coordinates. They generalise normal coordinat…

Twisted $\operatorname{SL}_2 \mathbb{C}$ local systems on surfaces of finite type appear often in geometry and physics. Most of them arise geometrically as local systems of charts for pleated hyperbolic structures. Bonahon and Thurston's "shear-bend coordinates" parameterize these local systems of charts. On a surface …

There are two important statements regarding the Trautman-Bondi mass at null infinity: one is the positivity, and the other is the Bondi mass loss formula, which are both global in nature. In this note, we compute the limit of the Wang-Yau quasi-local mass on unit spheres at null infinity of an asymptotically flat spac…

Proposes local coordinate frames for improving model performance in complex dynamical systems.

Paper finds local normal forms for wavefronts in flat coordinates.

Local coordinates for non-integrable Lie algebroids constructed.

We introduce the hemicubic codes, a family of quantum codes obtained by associating qubits with the $p$-faces of the $n$-cube (for $n>p$) and stabilizer constraints with faces of dimension $(p\pm1)$. The quantum code obtained by identifying antipodal faces of the resulting complex encodes one logical qubit into $N = 2^…

We introduce the Locally Linear Latent Variable Model (LL-LVM), a probabilistic model for non-linear manifold discovery that describes a joint distribution over observations, their manifold coordinates and locally linear maps conditioned on a set of neighbourhood relationships. The model allows straightforward variatio…

Sparse coding, which represents a data point as a sparse reconstruction code with regard to a dictionary, has been a popular data representation method. Meanwhile, in database retrieval problems, learning the ranking scores from data points plays an important role. Up to now, these two problems have always been conside…

A general class of Newton algorithms on Graßmann and Lagrange-Graßmann manifolds is introduced, that depends on an arbitrary pair of local coordinates. Local quadratic convergence of the algorithm is shown under a suitable condition on the choice of coordinate systems. Our result extends and unifies previous convergenc…

New findings on Kähler manifolds restrict orthogonal coordinates existence.

LOCA learns standardized data coordinates from measurements.

We provide a coordinate-free version of the local classification, due to A. G. Walker [Quart. J. Math. Oxford (2) 1, 69 (1950)], of null parallel distributions on pseudo-Riemannian manifolds. The underlying manifold is realized, locally, as the total space of a fibre bundle, each fibre of which is an affine principal b…

We present a comprehensive framework for structured sparse coding and modeling extending the recent ideas of using learnable fast regressors to approximate exact sparse codes. For this purpose, we develop a novel block-coordinate proximal splitting method for the iterative solution of hierarchical sparse coding problem…

It is shown that, in four dimensions, it is possible to introduce coordinates so that an analytic metric locally takes block diagonal form. i.e. one can find coordinates such that $g_{αβ} = 0$ for $(α, β) \in S$ where $S = {(1, 3), (1, 4), (2, 3), (2, 4)}$. We call a coordinate system in which the metric takes this for…

We study transformations of coordinates on a Lorentzian Einstein manifold with a parallel distribution of null lines and show that the general Walker coordinates can be simplified. In these coordinates, the full Lorentzian Einstein equation is reduced to equations on a family of Einstein Riemannian metrics.

Quantum codes with optimal distance and dimension for n-dimensional space.

Let G be a split semi-simple algebraic group over Q. Let S be a decorated surface, that is a topological oriented surface with a finite set of marked points on the boundary, considered modulo isotopy. We introduce a moduli space D(G,S) and define a collection of special rational coordinate systems on it. The moduli spa…

Smooth surfaces can always be locally described by Hessians.

This paper derives sufficient conditions for local recovery of coordinate dictionaries comprising a Kronecker-structured dictionary that is used for representing $K$th-order tensor data. Tensor observations are assumed to be generated from a Kronecker-structured dictionary multiplied by sparse coefficient tensors that …

Simplified optimization for structured matrices in deep learning.

We consider inverse curvature flows in warped product manifolds, which are constrained subject to local terms of lower order, namely the radial coordinate and the generalized support function. Under various assumptions we prove longtime existence and smooth convergence to a coordinate slice. We apply this result to ded…

Locally symplectic structure found on Kerr space-time.

Machine learning often needs to model density from a multidimensional data sample, including correlations between coordinates. Additionally, we often have missing data case: that data points can miss values for some of coordinates. This article adapts rapid parametric density estimation approach for this purpose: model…

The abstract introduces golden Finsler structures and explores their local and global properties.

While we would like agents that can coordinate with humans, current algorithms such as self-play and population-based training create agents that can coordinate with themselves. Agents that assume their partner to be optimal or similar to them can converge to coordination protocols that fail to understand and be unders…

We study conformal harmonic coordinates on Riemannian manifolds. These are coordinates constructed as quotients of solutions to the conformal Laplace equation. We show their existence under general conditions. We find that conformal harmonic coordinates are a close conformal analogue of harmonic coordinates. We prove u…

Frequency-specific patterns of neural activity are traditionally interpreted as sustained rhythmic oscillations, and related to cognitive mechanisms such as attention, high level visual processing or motor control. While alpha waves (8-12 Hz) are known to closely resemble short sinusoids, and thus are revealed by Fouri…

This study considers that the collective route choices of travelers en route represent a resolution of their competition on network routes. Well understanding this competition and coordinating their route choices help mitigate urban traffic congestion. Even though existing studies have developed such mechanisms (e.g., …

Given a finite volume hyperbolic 3-manifold, we compose a lift of the holonomy in SL(2,C) with the n-dimensional irreducible representation of SL(2,C) in SL(n,C). In this paper we give local coordinates of the SL(n,C)-character variety around this representation. As a corollary, this representation is isolated among al…

Given a finite collection of $C^1$ vector fields on a $C^2$ manifold which span the tangent space at every point, we consider the question of when there is locally a coordinate system in which these vector fields are real analytic. We give necessary and sufficient, coordinate-free conditions for the existence of such a…

Likelihood-based generative models are the backbones of lossless compression due to the guaranteed existence of codes with lengths close to negative log likelihood. However, there is no guaranteed existence of computationally efficient codes that achieve these lengths, and coding algorithms must be hand-tailored to spe…

In this paper we obtain the general solution to the minimal surface equation, namely its local Weierstrass-Enneper representation, by using a system of hodographic coordinates. This is done by using the method of solving the Born-Infeld equations by Whitham. We directly compute conformal coordinates on the minimal surf…

Study finds holonomy algebras for Lorentzian Weyl spin manifolds with specific spinors.

Coordinate-independent convolutions on manifolds avoid reference frame ambiguity.