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

16324763 · Jun 202019922001200920172026
48 results for Chern-Moser tensor

We propose two constructions extending the Chern-Moser normal form to non-integrable Levi-nondegenerate (hypersurface type) almost CR structures. One of them translates the Chern-Moser normalization into pure intrinsic setting, whereas the other directly extends the (extrinsic) Chern-Moser normal form by allowing non-C…

2008-12-05abs ↗pdf ↗

Local flatness theorem for paraquaternionic contact structures.

problem Local flatness of paraquaternionic contact manifolds.
method Defined paraquaternionic contact conformal curvature tensor and showed local flatness condition.
result Paraquaternionic contact conformal curvature vanishing implies local flatness.

We derive an explicit formula for the well-known Chern-Moser-Weyl tensor for nondegenerate real hypersurfaces in complex space in terms of their defining functions. The formula is considerably simplified when applying to "pluriharmonic perturbations" of the sphere or to a Fefferman approximate solution to the complex M…

2019-03-29abs ↗pdf ↗

A tensor invariant is defined on a quaternionic contact manifold in terms of the curvature and torsion of the Biquard connection involving derivatives up to third order of the contact form. This tensor, called quaternionic contact conformal curvature, is similar to the Weyl conformal curvature in Riemannian geometry an…

2007-07-09abs ↗pdf ↗

We study conformal Fefferman-Lorentz manifolds introduced by Fefferman. To do so, we introduce Fefferman-Lorentz structure on (2n+2)-dimensional manifolds. By using causal conformal vector fields preserving that structure, we shall establish two theorems on compact Fefferman-Lorentz manifolds: One is the coincidence of…

2009-11-04abs ↗pdf ↗

Researchers found counterexamples to a 2-jet determination theorem in higher codimension.

problem Counterexample construction to the 2-jet determination Chern-Moser Theorem in higher codimension.
method Constructed counterexamples of quadratic submanifolds with specific properties.
result Generated counterexamples to the 2-jet determination Chern-Moser Theorem in higher codimension.

A curvature-type tensor invariant called para contact (pc) conformal curvature is defined on a paracontact manifold. It is shown that a paracontact manifold is locally paracontact conformal to the hyperbolic Heisenberg group or to a hyperquadric of neutral signature if and only if the pc conformal curvature vanishes. I…

2007-07-25abs ↗pdf ↗

In this article, we first describe a normal form of real-analytic, Levi-nondegenerate submanifolds of CNC^N of codimension d \ge 1 under the action of formal biholomorphisms, that is, of perturbations of Levi-nondegenerate hyperquadrics. We give a sufficient condition on the formal normal form that ensures that the n…

2017-05-11abs ↗pdf ↗

In this paper we construct a large class of new normal forms for Levi-nondegenerate real hypersurfaces in complex spaces. We adopt a general approach illustrating why these normal forms are natural and which role is played by the celebrated Chern-Moser normal form. The latter appears in our class as the one with the "m…

2009-02-16abs ↗pdf ↗

All parabolic geometries, i.e. Cartan geometries with homogeneous model a real generalized flag manifold, admit highly interesting classes of distinguished curves. The geodesics of a projective class of connections on a manifold, conformal circles on conformal Riemannian manifolds, and Chern--Moser chains on CR--manifo…

2003-08-06abs ↗pdf ↗

Contact projective structures have been profoundly studied by D.J.F. Fox. He associated to a contact projective structure a canonical projective structure on the same manifold. We interpret Fox' construction in terms of the equivalent parabolic (Cartan) geometries, showing that it is an analog of Fefferman's constructi…

2008-10-15abs ↗pdf ↗

In this paper, we consider real hypersurfaces MM in C3\Bbb C^3 (or more generally, 5-dimensional CR manifolds of hypersurface type) at uniformly Levi degenerate points, i.e. Levi degenerate points such that the rank of the Levi form is constant in a neighborhood. We also require the hypersurface to satisfy a certain s…

1999-05-26abs ↗pdf ↗

The paper defines minimal norm tensors for curvature and divergence tensors, explaining Weyl and Cotten tensors.

problem Understanding curvature tensors and their minimal norm.
method Analyzing minimal norm tensors for third and fourth covariant tensors, including Riemannian curvature and divergence.
result Weyl tensor and Cotten tensor are identified as minimal norm tensors of Riemannian curvature and divergence tensors, respectively.

A new tree method for tensor data improves regression accuracy.

problem Efficiently modeling tensor data for regression problems.
method Scalar-output regression tree models for scalar-on-tensor problems, and tensor-on-tensor problems using additive tree ensemble approaches.
result The tensor-input tree (TT) method outperforms tensor-input GP models in efficiency and accuracy.

Curvature tensors can always be matched to a metric tensor under certain conditions.

problem Sectionally positive curvature tensors and their relationship to metric tensors.
method Existence and uniqueness of a metric tensor gabg_{ab} such that Rabcdgbd=gacλR_{abcd} g^{bd} = g_{ac} λ.
result A metric tensor gabg_{ab} can be found for sectionally positive curvature tensors, and it is unique up to a constant factor.

The tensor-tensor product (t-product) [M. E. Kilmer and C. D. Martin, 2011] is a natural generalization of matrix multiplication. Based on t-product, many operations on matrix can be extended to tensor cases, including tensor SVD, tensor spectral norm, tensor nuclear norm [C. Lu, et al., 2018] and many others. The line…

2018-06-17abs ↗pdf ↗

Paper optimizes tensor deflation for non-orthogonal signals.

problem Recovering low-rank signals from noisy tensors with correlated components.
method Developed an asymptotic analysis and optimized deflation procedure using random tensor theory.
result Proposed an efficient tensor deflation algorithm that optimizes a parameter introduced in the deflation mechanism.

Paper proposes a new method for exact recovery in robust tensor principal component analysis.

problem Exact recovery of low-rank and sparse components in tensors.
method Proposes a new method based on tensor-tensor product and t-SVD to solve a convex optimization problem.
result Exact recovery achieved in a deterministic fashion without randomness assumptions.

We introduce Bayesian multi-tensor factorization, a model that is the first Bayesian formulation for joint factorization of multiple matrices and tensors. The research problem generalizes the joint matrix-tensor factorization problem to arbitrary sets of tensors of any depth, including matrices, can be interpreted as u…

2014-12-15abs ↗pdf ↗

The paper tackles tensor factorization and completion from noisy data.

problem Sparse nonnegative tensor factorization and completion from partial and noisy observations.
method Minimizes the sum of maximum likelihood estimation and tensor 0\ell_0 norm with nonnegativity constraints.
result Error bounds and minimax lower bounds are established for the proposed model.

The chains studied in this paper generalize Chern-Moser chains for CR structures. They form a distinguished family of one dimensional submanifolds in manifolds endowed with a parabolic contact structure. Both the parabolic contact structure and the system of chains can be equivalently encoded as Cartan geometries (of d…

2005-04-22abs ↗pdf ↗

Tensorized Rademacher projections outperform Gaussian projections in reducing tensor dimensions.

problem Reducing the dimension of high-dimensional tensors for machine learning.
method Tensorized Rademacher random projections using Tensor Train decomposition.
result Tensorized Rademacher projections can replace Gaussian projections in tensor compression.

The paper shows how gradient flow on over-parametrized tensor decomposition behaves like deflation.

problem Understanding the training dynamics of gradient flow on tensor decomposition.
method Empirical observation and mathematical proof of gradient flow dynamics for orthogonally decomposable tensors.
result Gradient flow dynamics for orthogonally decomposable tensors follows a tensor deflation process, recovering all tensor components.

New method tackles non-smooth tensor data for better recovery.

problem Non-smooth changes in tensor data degrade traditional t-SVD methods.
method Learnable tensor nuclear norm, Alternating Proximal Multiplier Method (APMM), multi-objective tensor recovery framework.
result The proposed method effectively recovers tensor data with non-smooth changes.

Proposes FATTNN for tensor-on-tensor regression with improved prediction and reduced computation.

problem Tensor-on-tensor regression with complex tensor structures and nonlinear relationships.
method Integrates tensor factor models into deep neural networks to handle nonlinearity and reduce data dimensionality.
result Significant improvements in prediction accuracy and computational efficiency over traditional methods.

We present a novel nonnegative tensor decomposition method, called Legendre decomposition, which factorizes an input tensor into a multiplicative combination of parameters. Thanks to the well-developed theory of information geometry, the reconstructed tensor is unique and always minimizes the KL divergence from an inpu…

2018-02-13abs ↗pdf ↗

In this paper, we study robust tensor completion by using transformed tensor singular value decomposition (SVD), which employs unitary transform matrices instead of discrete Fourier transform matrix that is used in the traditional tensor SVD. The main motivation is that a lower tubal rank tensor can be obtained by usin…

2019-07-02abs ↗pdf ↗

ScaledGD algorithm estimates low-rank tensors efficiently from corrupted data.

problem Estimating meaningful information from corrupted tensor data.
method Scaled gradient descent (ScaledGD) algorithm with tailored spectral initializations.
result ScaledGD achieves linear convergence at a constant rate independent of condition number.

TRNN combines tensor geometry with neural network nonlinearity for HD data.

problem Modeling high-dimensional data with preserved tensor geometry and nonlinear interactions.
method Introduces TRNN that integrates tensor geometry and neural network nonlinearity.
result TRNN preserves tensor geometry while offering nonlinearity.

Tensor decomposition is a well-known tool for multiway data analysis. This work proposes using stochastic gradients for efficient generalized canonical polyadic (GCP) tensor decomposition of large-scale tensors. GCP tensor decomposition is a recently proposed version of tensor decomposition that allows for a variety of…

2019-06-04abs ↗pdf ↗

The paper characterizes integrability of tensors on manifolds.

problem Analyzing integrability conditions for various tensor types on manifolds.
method Analytical and geometric characterizations of integrability for different tensor types, using Nijenhuis tensors.
result Integrability of tensors is equivalent to algebraic constancy coupled with vanishing of Nijenhuis-type tensors.

New methods solve tensor-on-tensor regression with unknown rank, revealing benefits of over-parameterization.

problem Connecting tensor responses to tensor covariates with unknown intrinsic rank.
method Riemannian gradient descent and Riemannian Gauss-Newton methods for tensor-on-tensor regression.
result Riemannian optimization methods converge linearly and quadratically to a statistically optimal estimate in rank over-parameterized settings.

Introduces tensor bandits for multi-dimensional online decision making.

problem Optimal decision making in multi-dimensional online scenarios.
method Stochastic low-rank tensor bandits, tensor elimination, tensor epoch-greedy, tensor ensemble sampling.
result Tensor elimination and tensor epoch-greedy algorithms outperform existing methods.

Derdzinski and Shen's theorem on the restrictions posed by a Codazzi tensor on the Riemann tensor holds more generally when a Riemann-compatible tensor exists. Several properties are shown to remain valid in this broader setting. Riemann compatibility is equivalent to the Bianchi identity of the new "Codazzi deviation …

2012-04-05abs ↗pdf ↗

This paper aims to study the WW-curvature tensor on relativistic space-times. The energy-momentum tensor T of a space-time is semi-symmetric given that the WW-curvature tensor is semi-symmetric whereas energy-momentum tensor T of a space-time having a divergence free WW-curvature tensor is of Codazzi type. A space-t…

2019-12-01abs ↗pdf ↗