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

2468 · Jun 202019922001200920172026
48 results for Lower-Dimensional

New model estimates higher-order interactions in stochastic processes using lower-dimensional projections.

problem Estimating higher-order interaction effects in stochastic processes with limited data.
method Additive Poisson Process (APP) combines information geometry and generalized additive models to model intensity functions in lower dimensions.
result The model can estimate higher-order intensity functions with sparse data.

In this paper, we define lower dimensional volumes associated to sub-Dirac operators for foliations. In some cases, we compute these lower dimensional volumes. We also prove the Kastler-Kalau-Walze type theorems for foliations with or without boundary. As a corollary, we give an explanation of the gravitational action …

2012-09-27abs ↗pdf ↗

A novel GP architecture, Thin and Deep GP, learns lower-dimensional representations without losing interpretability.

problem Challenges in selecting appropriate kernel for Gaussian processes.
method Proposes a novel synthesis of deep and shallow GP approaches, parameterizing lengthscale in a way that maintains interpretability and learns lower-dimensional embeddings.
result TDGP discovers lower-dimensional manifolds in input data, performs well in benchmark datasets, and behaves well with increasing layers.

RS-HDMR-GPR simplifies complex functions with machine-learned lower-dimensional terms.

problem Representing and understanding complex multidimensional functions with sparse data.
method Random Sampling High Dimensional Model Representation Gaussian Process Regression (RS-HDMR-GPR).
result Facilitates recovery of functional dependence and adds insight into input variable importance.

We explore algebraic characterizations of 2-knots whose associated knot manifolds fibre over lower-dimensional orbifolds, and consider also some issues related to the groups of higher-dimensional fibred knots.

2010-04-22abs ↗pdf ↗

Two methods monitor high-dimensional processes via manifold fitting or learning.

problem Monitoring high-dimensional, dynamic industrial processes.
method Manifold fitting and learning approaches for online SPC.
result Manifold-fitting approach achieves performance competitive with classical methods.

In order to avoid the curse of dimensionality, frequently encountered in Big Data analysis, there was a vast development in the field of linear and nonlinear dimension reduction techniques in recent years. These techniques (sometimes referred to as manifold learning) assume that the scattered input data is lying on a l…

2016-06-22abs ↗pdf ↗

Suppose that two large, multi-dimensional data sets are each noisy measurements of the same underlying random process, and principle components analysis is performed separately on the data sets to reduce their dimensionality. In some circumstances it may happen that the two lower-dimensional data sets have an inordinat…

2013-01-09abs ↗pdf ↗

New algorithm balances spatial data approximation and prediction accuracy.

problem Lack of methods considering spatial correlation and downstream modeling in dimension reduction.
method Formalizes approximation and modeling utility as metrics, proposes a balanced algorithm.
result Optimal trade-off between approximation accuracy and downstream modeling utility.

Optimal persuasion involves projecting state vectors onto lower-dimensional 'optimal information manifolds'.

problem Optimal persuasion of another agent observing multi-dimensional data.
method Performing non-linear dimension reduction by projecting state vectors onto the 'optimal information manifold'.
result Optimal information design splits information into 'good' and 'bad' components, revealing only the direction of good information.

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.

LDAdam optimizes large models with low memory by adapting to lower-dimensional subspaces.

problem Training large models efficiently and accurately.
method Adaptive optimization in lower-dimensional subspaces with a new projection-aware update rule and error feedback mechanism.
result LDAdam achieves accurate and efficient training of language models.

Study on symmetries in wide neural networks' dynamics without bias.

problem Understanding symmetries in the dynamics of wide two-layer neural networks.
method Analyzing symmetries in gradient flow on population risk for infinitely wide networks.
result Symmetries can simplify the dynamics of predictors and reduce the dimensionality of the problem.

The decomposability of a Cartesian product of two nondecomposable manifolds into products of lower dimensional manifolds is studied. For 3-manifolds we obtain an analog of a result due to Borsuk for surfaces, and in higher dimensions we show that similar analogs do not exist unless one imposes further restrictions such…

2017-11-30abs ↗pdf ↗

With the increasing adoption of AI, inherent security and privacy vulnerabilities formachine learning systems are being discovered. One such vulnerability makes itpossible for an adversary to obtain private information about the types of instancesused to train the targeted machine learning model. This so-called model i…

2019-10-09abs ↗pdf ↗

Study geometric properties of loss functions to understand neural network performance.

problem Understanding the geometric properties of high-dimensional loss functions to improve neural network performance.
method Combine concepts from high-dimensional probability and differential geometry to study curvature properties in lower-dimensional loss representations.
result Mean curvature in the original loss space determines if saddle points appear as minima, maxima, or flat regions.

In statistical dimensionality reduction, it is common to rely on the assumption that high dimensional data tend to concentrate near a lower dimensional manifold. There is a rich literature on approximating the unknown manifold, and on exploiting such approximations in clustering, data compression, and prediction. Most …

2017-06-26abs ↗pdf ↗

We consider Riemannian 4-manifolds that Gromov-Hausdorff converge to a lower dimensional limit space, with the Ricci tensor going to zero. Among other things, we show that if the limit space is two dimensional then under some mild assumptions, the limiting four dimensional geometry away from the curvature blowup region…

2017-08-22abs ↗pdf ↗

A new method improves generative models by learning lower-dimensional representations.

problem Normalizing flows cannot learn lower-dimensional representations of data.
method Noisy injective flows (NIF) that map latent space to a learnable manifold in high-dimensional data space using injective transformations and an additive noise model.
result Simple application of NIF to existing flow architectures significantly improves sample quality and yields separable data embeddings.

A new matrix factorization method for high-dimensional data.

problem Exploiting sparse structures in complex data for better interpretability.
method Bayesian shrinkage priors and flexible sparse patterns modeled through row and column dependencies.
result Demonstrated practical advantages through simulation and soccer heatmap analysis.

This paper is the first of a 3-part series that classifies the 5-dimensional Thurston geometries. The present paper (part 1 of 3) summarizes the general classification, giving the full list, an outline of the method, and some illustrative examples. This includes phenomena that have not appeared in lower dimensional geo…

2016-05-24abs ↗pdf ↗

New examples of Calabi-Yau 3-folds with unique properties.

problem Finding new Calabi-Yau 3-folds with specific properties.
method Constructing complete Calabi-Yau metrics on smoothings of 3-dimensional Calabi-Yau cones with orbifold singularities.
result Examples of Calabi-Yau 3-folds with maximal volume growth and orbifold singularities.

The linking integral is an invariant of the link-type of two manifolds immersed in a Euclidean space. It is shown that the ordinary Gauss integral in three dimensions may be simplified to a winding number integral in two dimensions. This result is then generalized to show that in certain circumstances the linking integ…

2009-07-20abs ↗pdf ↗

We study iteration maps of recurrence relations arising from mutation periodic quivers of arbitrary period. Combining tools from cluster algebra theory and (pre)symplectic geometry, we show that these cluster iteration maps can be reduced to symplectic maps on a lower dimensional submanifold, provided the matrix repres…

2013-07-01abs ↗pdf ↗

KPCA-BO improves BO for high-dimensional optimization problems by learning a non-linear sub-manifold.

problem High-dimensional optimization problems where Gaussian Process regression requires too much data and computation.
method KPCA-BO embeds a non-linear sub-manifold in the search space, learning a GPR model on this sub-manifold.
result KPCA-BO outperforms vanilla BO in convergence speed, especially as dimensionality increases.

GenSDR tackles SDR by leveraging generative models to fully recover lower-dimensional structures.

problem Challenges in identifying low-dimensional sufficient structures in nonlinear SDR.
method Proposes GenSDR, a method that uses modern generative models to fully recover information in the central σ-field.
result Establishes consistency of GenSDR estimator for sample-level data and extends its applicability to non-Euclidean responses.

Bayesian neural networks improve uncertainty quantification in non-linear dimensionality reduction.

problem Current neural network models lack adequate uncertainty quantification.
method Deploy Markov chain Monte Carlo sampling algorithms for Bayesian inference in ANN models with latent variables.
result New research directions are needed due to fundamental challenges in neural networks with latent variables.

This work reduces the dimensionality of text data using SVD, improving performance and computational efficiency.

problem High-dimensional input spaces in text classification lead to excessive parameter count and computational infeasibility.
method Singular Value Decomposition (SVD) is applied to transform the input space into a lower-dimensional latent space.
result Neural networks trained on the lower-dimensional latent space achieve comparable or better performance with reduced computational complexity.

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.

In this paper, we study the collapsing behaviour of negative Kähler-Einstein metrics along degenerations of canonical polarized manifolds. We prove that for a toroidal degeneration of canonical polarized manifolds with the total space Q\mathbb{Q}-factorial, the Kähler-Einstein metrics on fibers collapse to a lower dim…

2015-05-18abs ↗pdf ↗