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,742 papers · 148 categories

Trend · papers per month

4284126168 · May 202619922001200920172026
48 results for non-isotropic geometries

In this paper we construct the differential equations of the stream lines that characterize plasma regarded as a non-isotropic medium geometrized by a jet rheonomic time-invariant Berwald-Moor metric. Section 1 contains historical notes regarding the Plasma Physics and its geometrical description. Section 2 analyzes th…

2010-05-09abs ↗pdf ↗

It is established that the existence of non-isotropic vector field which Jacobi operator of maximal rank is an obstacle for the existence of non-trivial second-order symmetric parallel tensor field. In turns out that presence of such obstacle follows that manifold as pseudo-Riemannian manifold is locally non-reducible.…

2018-06-14abs ↗pdf ↗

Study on stability of geodesic maps in non-isotropic manifolds.

problem Stability of totally geodesic wave maps in non-isotropic manifolds.
method Factorization property, PDE system in geodesic normal coordinates, global existence result via hyperboloidal foliation.
result Established global existence for small initial data, leading to geometric stability.

Paper improves learning efficiency by focusing on effective dimensionality.

problem Dimensionality bottleneck in modern learning tasks.
method Developed tools to reduce dimensional costs using effective dimensionality.
result Uniform concentration bounds involving effective dimensionality, improving over existing results.

New method improves representation learning from non-i.i.d. and non-isotropic data.

problem Improving representation learning from non-i.i.d. and non-isotropic data.
method Introducing a new adaptation of alternating minimization-descent scheme to reduce noise scaling.
result Established linear convergence to optimal representation with noise scaling down with total source data size.

A Dirac structure is a Lagrangian subbundle of a Courant algebroid, LEL\subset\mathbb{E}, which is involutive with respect to the Courant bracket. In particular, LL inherits the structure of a Lie algebroid. In this paper, we introduce the more general notion of a pseudo-Dirac structure: an arbitrary subbundle, $W\sub…

2014-08-22abs ↗pdf ↗

We introduce a wrapped Gaussian for SPD matrices, enhancing data analysis.

problem Handling circular and non-flat data distributions on SPD manifolds.
method Introduced a non-isotropic wrapped Gaussian using the exponential map, derived theoretical properties, and proposed a maximum likelihood framework.
result Demonstrated the robustness and flexibility of the wrapped Gaussian model on synthetic and real-world datasets.

We proposed a novel graph convolutional neural network that could construct a coarse, sparse latent point cloud from a dense, raw point cloud. With a novel non-isotropic convolution operation defined on irregular geometries, the model then can reconstruct the original point cloud from this latent cloud with fine detail…

2019-10-07abs ↗pdf ↗

A new probabilistic approach improves deep metric learning by considering image uncertainties and class-specific variances.

problem Proxy-based deep metric learning struggles with image uncertainties and class-specific structures.
method Introduces non-isotropic probabilistic proxy-based deep metric learning using directional von Mises-Fisher distributions.
result Improves generalization performance and competitive on standard benchmarks.

We study singularities of geodesics flows in two-dimensional generalized Finsler spaces (pseudo-Finsler spaces). Geodesics are defined as extremals of a certain auxiliary functional whose non-isotropic extremals coincide with extremals of the action functional. This allows to consider isotropic lines as (unparametrized…

2015-07-23abs ↗pdf ↗

Study closed G2-structures with T3-symmetry, classifying them into types and deriving hypersymplectic structures.

problem Classify closed G2-structures with T3-symmetry and derive associated hypersymplectic structures.
method Decompose G2-structures into canonical forms, classify structures based on orbit isotropy, and derive hypersymplectic structures.
result Closed G2-structures with T3-symmetry are classified into two types, leading to specific hypersymplectic structures.

The paper proposes using non-isotropic distances for more accurate trace link recommendation.

problem Time-consuming and error-prone creation and maintenance of trace links.
method Geometric viewpoint on semantic similarity using non-linear similarity measures.
result Non-isotropic distances improve trace link recommendation accuracy.

To each non-isotropic almost-complex immersion of a 2-torus into S6 S ^ 6 we associate an algebraic curve, called the spectral curve, and a linear flow in the intersection of two Prym varieties on this spectral curve. We show that generically the spectral curve is smooth and compute the dimension of the moduli space o…

2008-05-24abs ↗pdf ↗

Developed a diffusion model on spherical data, addressing geometric and stochastic challenges.

problem Diffusion models on spherical data face unique geometric and stochastic issues.
method Extended spectral diffusion to spherical harmonics, introducing modified stochastic differential equations.
result Introduced a geometry-dependent inductive bias in spectral diffusion models.

We consider instanton solutions of Euclidean Horava-Lifshitz gravity in four dimensions satisfying the detailed balance condition. They are described by geometric flows in three dimensions driven by certain combinations of the Cotton and Ricci tensors as well as the cosmological-constant term. The deformation curvature…

2010-01-30abs ↗pdf ↗

New chaos formula simplifies variance calculation for Gaussian nodal volumes.

problem Analyzing the variance of Gaussian nodal volumes on Riemannian manifolds.
method Explicit Wiener-Itô chaos decomposition, reducing complexity from 2+2n2+2n to 4 Hermite polynomials.
result New exact formula for variance and bounds, valid for arbitrary manifolds.

New quasi space forms solve Thurston's geometrical space form problem.

problem Solving Thurston's geometrical space form problem.
method Introducing quasi space forms as non-real space forms with specific geometric properties.
result Quasi space forms offer a metrical, local geometrical solution to Thurston's problem.

This article shows that every non-isotropic harmonic 2-torus in complex projective space factors through a generalised Jacobi variety related to the spectral curve. Each map is composed of a homomorphism into the variety and a rational map off it. The same ideas allow one to construct (pluri)-harmonic maps of finite ty…

1999-06-11abs ↗pdf ↗

We describe the local structure of self-dual gradient Ricci solitons in neutral signature. If the Ricci soliton is non-isotropic then it is locally conformally flat and locally isometric to a warped product of the form I×φN(c)I\times_\varphi N(c), where N(c)N(c) is a space of constant curvature. If the Ricci soliton is isotro…

2014-10-31abs ↗pdf ↗

Estimates shared linear subspace from noisy data with multiple users.

problem Recovering shared linear subspace from noisy data with non-isotropic noise.
method Estimates shared subspace using at least two data points per user, avoiding restrictive assumptions.
result Upper and lower bounds for estimation error match, showing no additional error due to noise irregularity.

New findings show cosmological constant as initial condition for non-isotropic spacetimes.

problem Cosmological constant as initial condition in non-isotropic spacetimes.
method Generalized previous results to non-isotropic spacetimes.
result Quasi de Sitter expansion for early universe, potential for inflationary scenarios.

We develop a flexible framework for low-rank matrix estimation that allows us to transform noise models into regularization schemes via a simple bootstrap algorithm. Effectively, our procedure seeks an autoencoding basis for the observed matrix that is stable with respect to the specified noise model; we call the resul…

2014-10-30abs ↗pdf ↗

Study on spin random fields using chaos decomposition for cosmic microwave background modeling.

problem Modeling polarization of Cosmic Microwave Background using spin random fields.
method Explicit Wiener-Itô chaos decomposition of area measures of level sets.
result Reveals a clear difference between high frequency regime and zero spin case.

Polynomial networks converge to Gaussian processes at a rate of O(n^(-1/2)).

problem Understanding the convergence rate of polynomial networks to Gaussian processes.
method Examined one-hidden-layer neural networks with random weights, focusing on polynomial activations and their convergence rate in the 2-Wasserstein metric.
result The rate of convergence for polynomial networks to Gaussian processes is $O(n^{- rac{1}{2}})$.

Study of cosmic microwave background polarization using spin random fields.

problem Detecting deviations from Gaussianity and anisotropies in cosmic fields.
method Explicit formula for Lipschitz-Killing curvatures of spin spherical random fields.
result Coherent with asymptotic results, providing new metric expressions.

The geometric approach to diffeomorphic image registration known as "large deformation by diffeomorphic metric mapping" (LDDMM) is based on a left action of diffeomorphisms on images, and a right-invariant metric on a diffeomorphism group, usually defined using a reproducing kernel. We explore the use of left-invariant…

2014-01-15abs ↗pdf ↗

Least symmetry breaking principle explains SGD's local minima in shallow ReLU networks.

problem Understanding the structure of local minima in two-layer ReLU networks.
method Analyzing the squared loss optimization problem for ReLU networks with Gaussian inputs and applying the principle of least symmetry breaking.
result The principle of least symmetry breaking explains the structure of spurious local minima detected by SGD.

In a neighborhood of a (positive definite) Riemannian space in which special, semigeodesic, coordinates are given, the metric tensor can be calculated from its values on a suitable hypersurface and some of components of the curvature tensor of type (1,3)(1,3) in the coordinate domain. Semigeodesic coordinates are a genera…

2010-06-16abs ↗pdf ↗

Enhances traffic forecasting with dynamic regression incorporating error modeling.

problem Improving accuracy of traffic forecasts using deep spatiotemporal models.
method Integrates matrix-variate autoregressive (AR) model into loss function for error series of base model.
result Improved traffic forecasting performance on SOTA models with interpretable AR coefficients.

New CLT for SGD in high-dimensional regression provides online inference.

problem Quantifying uncertainty in SGD for high-dimensional regression.
method Established a high-dimensional CLT for online SGD iterates.
result Developed an online approach for estimating variance in CLT.

The paper addresses online prediction in marginally stable systems with bounded perturbations.

problem Online prediction in marginally stable linear dynamical systems with adversarial or stochastic perturbations.
method The online least-squares algorithm is used to achieve sublinear regret, with a refined regret analysis and a structural lemma.
result The online least-squares algorithm achieves sublinear regret, with polynomial dependence on the system's parameters.

The paper analyzes optimal implicit bias in linear regression for over-parameterized models.

problem Finding the best generalization performance in over-parameterized linear regression.
method Asymptotic analysis of generalization performance for convex functions/potentials.
result Optimal implicit bias that achieves the best generalization error under certain conditions.

Develops non-Markovian couplings for sub-Riemannian Brownian motions.

problem Constructing couplings for sub-Riemannian Brownian motions starting from points on the same vertical fiber.
method Uses global isometries to construct maximal couplings, satisfying a reflection principle.
result Estimates coupling time and applies to inequalities for the heat semigroup.

We consider the problem of estimating how well a model class is capable of fitting a distribution of labeled data. We show that it is often possible to accurately estimate this "learnability" even when given an amount of data that is too small to reliably learn any accurate model. Our first result applies to the settin…

2018-05-04abs ↗pdf ↗