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

Trend · papers per month

78157235313 · Jun 202019922001200920172026
48 results for dimensionality

A new BO method tackles high-dimensional optimization without reconstruction.

problem Optimizing high-dimensional black-box functions is challenging, especially when low-dimensional structures are assumed.
method Tackles the problem in the original high-dimensional space using learned low-dimensional structure.
result Our method explores the high-dimensional space more effectively than existing approaches.

Estimates high-dimensional posterior densities by marginal distributions and neural networks.

problem High-dimensional probability density estimation for inference is difficult.
method Direct estimation of lower-dimensional marginal distributions, using Moment Networks for fast computation of moments.
result Demonstrates estimation of gravitational wave time series and applications in cosmology.

New method estimates intrinsic dimensionality using angles, not distances.

problem Estimating local intrinsic dimensionality accurately.
method Introduces a new estimator using the distribution of angles between neighbor points.
result New estimator behaves similarly but complementarily to existing measures of intrinsic dimensionality.

A method constructs a stochastic surrogate from dimensionality reduction results for high-dimensional uncertainty quantification.

problem High-dimensional uncertainty quantification with physics-based models.
method Constructs a stochastic surrogate model from dimensionality reduction results.
result Preserves convenience of sequential dimensionality reduction and Gaussian process regression while overcoming limitations.

High-dimensional ConvNets detect patterns in 32+ dimensions for geometric registration.

problem Detecting geometric patterns in high-dimensional spaces.
method High-dimensional convolutional networks applied to geometric registration problems.
result High-dimensional ConvNets outperform global pooling approaches in 3D registration and image correspondence.

While the existence of low-dimensional embedding manifolds has been shown in patterns of collective motion, the current battery of nonlinear dimensionality reduction methods are not amenable to the analysis of such manifolds. This is mainly due to the necessary spectral decomposition step, which limits control over the…

2015-08-13abs ↗pdf ↗

Study on infinite-dimensional Heisenberg groups using hypoelliptic heat kernels.

problem Properties of hypoelliptic heat kernels on infinite-dimensional reduced Heisenberg groups.
method Construction and study of hypoelliptic heat kernels on infinite-dimensional reduced Heisenberg groups.
result Hypoelliptic logarithmic Sobolev inequalities on the space.

Unified framework for high-dimensional bandit problems with low-dimensional structures.

problem Stochastic high-dimensional bandit problems with low-dimensional structures.
method Proposed a simple unified algorithm and a general analysis framework for the regret upper bound.
result Unified algorithm achieves comparable regret bounds in various high-dimensional bandit problems.

Datasets such as images, text, or movies are embedded in high-dimensional spaces. However, in important cases such as images of objects, the statistical structure in the data constrains samples to a manifold of dramatically lower dimensionality. Learning to identify and extract task-relevant variables from this embedde…

2019-06-02abs ↗pdf ↗

Method identifies low-dimensional structure in high-dimensional probability measures.

problem Identifying low-dimensional structure in high-dimensional probability measures.
method Extends prior work on minimizing majorizations of the Kullback-Leibler divergence to identify optimal approximations within a specific class of measures.
result Connection between dimensional logarithmic Sobolev inequality and approximations with the ansatz.

The paper analyzes how stock market dimensionality changes impact portfolio performance.

problem Impact of dimensional changes on portfolio performance in a changing market.
method Development of self-financing stock portfolios in a stochastic portfolio theory framework with dimensional jumps.
result Quantification of how listing or delisting events and market shocks affect portfolio return.

We provide an alternative method for obtaining of compatible Poisson structures on Lie groups by means of the adjoint representations of Lie algebras. In this way, we calculate some compatible Poisson structures on four dimensional and nilpotent six dimensional symplectic real Lie groups. Then using Magri-Morosi's theo…

2016-10-17abs ↗pdf ↗

Study one-dimensional topological theories with linear generating functions.

problem Understanding one-dimensional topological theories with defects.
method Construct bases of hom spaces for decorated unoriented one-dimensional cobordisms.
result Gram determinant and linear generating functions constructed.

We show some characterizations of hyperspheres in the (n+1)(n+1)-dimensional Euclidean space En+1{\Bbb E}^{n+1} with intrinsic and extrinsic properties such as the nn-dimensional area of the sections cut off by hyperplanes, the (n+1)(n+1)-dimensional volume of regions between parallel hyperplanes, and the nn-dimensional surf…

2012-08-27abs ↗pdf ↗

A novel method visualizes higher-dimensional spaces using hyperbolic geometry.

problem Challenges in visualizing higher-dimensional spaces.
method Interactive visualization of higher-dimensional grids based on hyperbolic geometry.
result Our method shows the whole higher-dimensional space at once and avoids disadvantages of previous methods.

This is an introductory article on high dimensional knots for the beginners. High dimensional knot theory is an exciting field. It is a field of knot theory, which is one of topology and is connected with many ones. In this article we use few literal expressions, equations, functions, etc. We barely suppose that the re…

2013-04-22abs ↗pdf ↗

Subspace clustering refers to the problem of clustering unlabeled high-dimensional data points into a union of low-dimensional linear subspaces, assumed unknown. In practice one may have access to dimensionality-reduced observations of the data only, resulting, e.g., from "undersampling" due to complexity and speed con…

2014-04-27abs ↗pdf ↗

Authors construct hypertori with constant negative mean curvature in a sphere.

problem Constructing constant mean curvature hypertori in a sphere.
method Constructing two different constant mean curvature (2n1)(2n-1)-dimensional hypertori in a 2n2n-dimensional sphere.
result Two different constant mean curvature (2n1)(2n-1)-dimensional hypertori with negative mean curvature in a 2n2n-dimensional sphere.

We give an exhaustive description of all simply connected odd dimensional cohomogeneity one manifolds that can possibly support an invariant metric with positive sectional curvature. Among the known examples of odd dimensional manifolds with positive curvature, apart from spheres, there are two infinite families among …

2005-11-18abs ↗pdf ↗

This work refines Cover's theory for binary classification on low-dimensional data.

problem The challenge of analyzing how low-dimensional data structures affect classification models.
method Refines Cover's function-counting theory to account for low-dimensional data structure.
result Derives dichotomy counts and analyzes the impact of data structure on classification models.

PCENet reduces uncertainty in high-dimensional data efficiently.

problem Uncertainty quantification in high-dimensional data is computationally expensive.
method Two-stage learning process: variational autoencoder for low-dimensional representation, polynomial chaos expansion for mapping.
result Model captures system dynamics, learns under uncertainty, estimates high-dimensional data uncertainty, matches output distribution moments.

Finding rare information hidden in a huge amount of data from the Internet is a necessary but complex issue. Many researchers have studied this issue and have found effective methods to detect anomaly data in low dimensional space. However, as the dimension increases, most of these existing methods perform poorly in de…

2014-05-05abs ↗pdf ↗

MsIGN tackles high-dimensional Bayesian inference using multiscale structure.

problem High-dimensional Bayesian inference challenges due to the curse of dimensionality.
method MsIGN generates samples from coarse to fine scale, minimizing Jeffreys divergence.
result MsIGN outperforms previous approaches in posterior approximation and mode capture.

We describe a method for learning word embeddings with data-dependent dimensionality. Our Stochastic Dimensionality Skip-Gram (SD-SG) and Stochastic Dimensionality Continuous Bag-of-Words (SD-CBOW) are nonparametric analogs of Mikolov et al.'s (2013) well-known 'word2vec' models. Vector dimensionality is made dynamic b…

2015-11-17abs ↗pdf ↗

Deep networks can adapt to intrinsic dimensionality beyond domain constraints.

problem Approximating functions on low-dimensional manifolds with high-dimensional data.
method Two-layer compositions with ReLU activation, using dimensionality reducing feature maps.
result Near optimal approximation rates depend on the complexity of the dimensionality reducing map, not the ambient dimension.

The paper calculates transformation operators and proves a theorem on 4D manifolds.

problem Computing transformation operators and proving theorems on 4D manifolds.
method Computed lower-dimensional volumes and applied Kastler-Kalau-Walze type theorems.
result Proved a Kastler-Kalau-Walze type theorem on 4D compact manifolds with boundary.