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

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for dimension computation

Computes dimensions of representation and character varieties for 2 and 3-dimensional orbifolds.

problem Computing dimensions of representation and character varieties for orbifolds.
method Analyzes varieties of representations and characters of hyperbolic and non-hyperbolic orbifolds, provides tools for computation.
result Shows that the dimension of a specific component of characters equals half the dimension of the variety of characters of the boundary.

Computational techniques calculate dimensions of complex structures.

problem Calculating dimensions of complex structures on manifolds.
method Developed computational techniques to calculate Kodaira dimension and Dolbeault harmonic forms.
result Computed dimensions of left-invariant almost complex structures.

This work improves scalability of Wasserstein distances in high dimensions.

problem Scalability issues in computing Wasserstein distances in high dimensions.
method Empirical convergence rates, robustness to data contamination, and computational methods.
result Established fast rates and robust estimation risks for sliced Wasserstein distances.

A reservoir computer is a complex dynamical system, often created by coupling nonlinear nodes in a network. The nodes are all driven by a common driving signal. In this work, three dimension estimation methods, false nearest neighbor, covariance and Kaplan-Yorke dimensions, are used to estimate the dimension of the res…

2019-12-10abs ↗pdf ↗

The virtual dimensions of both framed and unframed SU(2) magnetic monopoles on asymptotically conic 3-manifolds are obtained by computing the index of a Fredholm extension of the associated deformation complex. The unframed dimension coincides with the one obtained by Braam for conformally compact 3-manifolds. The comp…

2013-10-10abs ↗pdf ↗

Model complexity is an important factor to consider when selecting among graphical models. When all variables are observed, the complexity of a model can be measured by its standard dimension, i.e. the number of independent parameters. When hidden variables are present, however, standard dimension might no longer be ap…

2012-12-12abs ↗pdf ↗

For a compact connected manifold M of dimension n greater than 3 and with no metric of positive scalar curvature, we prove that the Yamabe invariant is unchanged under surgery on spheres of dimension different from 1, n-2 and n-1. We use this result to give new computations of the invariant in dimension four and displa…

1998-08-11abs ↗pdf ↗

Let G be the fundamental group of a connected, closed, orientable 3-manifold. We explicitly compute its virtually cyclic geometric dimension. Among the tools we use are the prime and JSJ decompositions of M, several push-out type constructions, as well as some Bredon cohomology computations.

2019-04-09abs ↗pdf ↗

The action dimension of a group G is the minimal dimension of a contractible manifold that G acts on properly discontinuously. We show that if G acts properly and cocompactly on a thick Euclidean building, then the action dimension is bounded below by twice the dimension of the building. We also compute the action dime…

2017-03-02abs ↗pdf ↗

The L^2-torsion is an invariant defined for compact L^2-acyclic manifolds of determinant class, for example odd dimensional hyperbolic manifolds. It was introduced by John Lott and Varghese Mathai and computed for hyperbolic manifolds in low dimensions. In this paper we show that the L^2-torsion of hyperbolic manifolds…

1998-05-14abs ↗pdf ↗

Scalability of statistical estimators is of increasing importance in modern applications and dimension reduction is often used to extract relevant information from data. A variety of popular dimension reduction approaches can be framed as symmetric generalized eigendecomposition problems. In this paper we outline how t…

2012-11-07abs ↗pdf ↗

We present a computational toolkit for (local) Poisson-Nijenhuis calculus on manifolds. Our python module PoissonGeometry\textsf{PoissonGeometry} implements our algorithms, and accompanies this paper. We include two examples of how our methods can be used, one for gauge transformations of Poisson bivectors in dimension 3, and a sec…

2019-12-04abs ↗pdf ↗

WeSpeR speeds up non-linear shrinkage for high-dimensional weighted covariance.

problem Computing non-linear shrinkage formulas for high-dimensional weighted sample covariance.
method Derive extit{WeSpeR} algorithm using asymptotic sample spectrum properties.
result Significantly speeds up non-linear shrinkage in dimensions higher than 1000.

Study on Kodaira dimension of specific solvmanifolds without complex structures.

problem Analyzing Kodaira dimension for almost complex 4D solvmanifolds without integrable structures.
method Classification of solvmanifolds and computation of Kodaira dimension for specific structures.
result Showed that Kodaira dimension is not a deformation invariant for some solvmanifolds.

Hypersurface type CR-structures with non-degenerate Levi form on a manifold of dimension (2n+1)(2n+1) have maximal symmetry dimension n2+4n+3n^2+4n+3. We prove that the next (submaximal) possible dimension for a (local) symmetry algebra is n2+4n^2+4 for Levi-indefinite structures and n2+3n^2+3 for Levi-definite structures when $n>1…

2015-09-21abs ↗pdf ↗

New method solves high-dimensional PDEs fast using physics-informed neural networks.

problem High computational cost in solving high-dimensional PDEs.
method Stochastic Dimension Gradient Descent (SDGD) for physics-informed neural networks (PINNs).
result Solves many high-dimensional PDEs including HJB and Schrödinger equations in 100,000 dimensions in 12 hours.

The action dimension of a discrete group GG is the minimum dimension of contractible manifold that admits a proper GG-action. We compute the action dimension of the direct limit of a simple complex of groups for several classes of examples including: 1) Artin groups, 2) graph products of groups, and 3) fundamental gr…

2018-03-12abs ↗pdf ↗

Optimizes ICA performance in high dimensions with computational constraints.

problem Statistical optimality and computational tractability in ICA.
method Characterization of optimal sample complexity, development of computationally tractable estimates.
result Optimal sample complexity is linear in dimensionality, quadratic with low-degree polynomial algorithms.

Develops trace class operators and inverse Laplacian theory for infinite dimensions.

problem Understanding trace class operators and inverse Laplacian on infinite dimensional spaces.
method Presentation of trace class operators and construction of inverse Laplacian on closed manifolds.
result Original trace computations involving the inverse Laplacian on the torus.

Study uses neural nets to learn multi-index models in high dimensions, reducing complexity.

problem Learning multi-index models in high-dimensional data.
method Mean-field Langevin dynamics with neural networks.
result Effective dimension controls sample and computational complexity, potentially reducing it.

Corrects a 1-off error in Harer's spine dimension calculation for decorated Teichmüller spaces.

problem Incorrect dimension calculation in Harer's spine for decorated Teichmüller spaces.
method Identifies and corrects the dimension discrepancy in Harer's spine construction.
result Corrects the dimension of Harer's spine by 1 for decorated Teichmüller spaces.

This paper deals with certain results on the number of smooth structures on quaternionic projective spaces, obtained through the computation of inertia group and its analogues, which in turn are computed using techniques from stable homotopy theory. We show that the concordance inertia group is trivial in dimension 20,…

2017-08-22abs ↗pdf ↗

Projection pursuit model improves Gaussian process regression for high-dimensional data.

problem Scalability issues with traditional Gaussian process models in high dimensions.
method Additive Gaussian process regression with dimension expansion and gradient descent.
result The proposed method approximates more complex functions and outperforms traditional models.

We compute the formal Poisson cohomology of a broken Lefschetz fibration by calculating it at fold and Lefschetz singularities. Near a fold singularity the computation reduces to that for a point singularity in 3 dimensions. For the Poisson cohomology around singular points we adapt techniques developed for the Sklyani…

2018-05-11abs ↗pdf ↗

The action dimension of a discrete group ΓΓ is the smallest dimension of a contractible manifold which admits a proper action of ΓΓ. Associated to any flag complex LL there is a right-angled Artin group, ALA_L. We compute the action dimension of ALA_L for many LL. Our calculations come close to confirming the conje…

2014-09-22abs ↗pdf ↗

For a complex projective space the inertia group, the homotopy inertia group and the concordance inertia group are isomorphic. In complex dimension 4n+1, these groups are related to computations in stable cohomotopy. Using stable homotopy theory, we make explicit computations to show that the inertia group is non-trivi…

2015-10-09abs ↗pdf ↗

I\mathcal{I}-non-degenerate spaces are spacetimes that can be characterized uniquely by their scalar curvature invariants. The ultimate goal of the current work is to construct a basis for the scalar polynomial curvature invariants in three dimensional Lorentzian spacetimes. In particular, we seek a minimal set of alg…

2014-09-03abs ↗pdf ↗

Gradients of neural networks can be computed efficiently for any architecture, but some applications require differential operators with higher time complexity. We describe a family of restricted neural network architectures that allow efficient computation of a family of differential operators involving dimension-wise…

2019-12-08abs ↗pdf ↗

We obtain an Einstein metric of constant negative curvature given an arbitrary boundary metric in three dimensions, and a conformally flat one given an arbitrary conformally flat boundary metric in other dimensions. In order to compute the on-shell value of the gravitational action for these solutions, we propose to in…

1999-10-04abs ↗pdf ↗

Study shows limits of certain normalizing flows in higher dimensions.

problem Understanding the representation power of normalizing flows in different dimensions.
method Rigorously established bounds on expressive power of basic normalizing flows.
result Limited representation power in higher dimensions, especially with moderate depth.

New method estimates deep neural network's intrinsic dimension for better generalization.

problem Estimating intrinsic dimension of deep neural networks for generalization.
method Topological data analysis (TDA) and persistent homology (PHD).
result Efficient algorithm to estimate PHD in deep neural networks.

CobBO optimizes expensive functions in high dimensions by using a two-stage kernel approach.

problem Bayesian optimization struggles in high dimensions due to computational inefficiency.
method Coordinate backoff Bayesian Optimization with two-stage kernels.
result CobBO finds solutions comparable to or better than other methods in high dimensions.