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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for reduced dimension

Geometric conditions are given so that the leafwise reduced cohomology is of infinite dimension, specially for foliations with dense leaves on closed manifolds. The main new definition involved is the intersection number of subfoliations with "appropriate coefficients". The leafwise reduced cohomology is also described…

2013-11-14abs ↗pdf ↗

A new method reduces both input and output dimensions for better goal-oriented analysis.

problem Simultaneous reduction of input and output dimensions for more accurate analysis.
method Coupled input-output dimension reduction, optimizing gradient-based bounds.
result Determine most informative sensors and influential parameters efficiently.

We analyze Lorentzian spacetimes subject to curvature-dimension bounds using the Bakry-Émery-Ricci tensor. We extend the Hawking-Penrose type singularity theorem and the Lorentzian timelike splitting theorem to synthetic dimensions N1N\le 1, including all negative synthetic dimensions. The rigidity of the timelike spli…

2017-07-27abs ↗pdf ↗

The dynamics defined by a force field which is positively homogeneous of degree 3-3 can always be reduced, by simply constraining it. The dimension of the phase space is reduced by two dimensions, while it may only be reduced by one dimension if the degree of homogeneity is different from 3-3. This remark is an elega…

2014-12-12abs ↗pdf ↗

A new method reduces dimensionality for better likelihood-free parameter estimation.

problem Estimating parameters from data with no closed-form likelihood.
method Combines reconstruction map estimation with dimension-reduction techniques.
result The proposed method outperforms existing techniques in accuracy and efficiency.

Paper reduces turbomachinery CFD simulations by identifying key dimensions.

problem Reducing computational cost in turbomachinery 3D CFD simulations.
method Statistical sufficient dimension reduction methods and polynomial variable projection.
result Polynomial variable projection accurately identifies dimension reducing subspaces at lower cost.

This research shows that steady solitons in higher dimensions always reduce at infinity.

problem Characterizing steady solitons with nonnegative sectional curvature in higher dimensions.
method Dimension reduction analysis and tangent flow classification.
result Steady solitons in higher dimensions always reduce at infinity.

We discuss Poincaré duality complexes X and the question whether or not their Spivak normal fibration admits a reduction to a vector bundle in the case where the dimension of X is at most 4. We show that in dimensions less than 4 such a reduction always exists, and in dimension 4 such a reduction exists provided X is o…

2017-11-22abs ↗pdf ↗

Paper reduces dimensionality for robust option pricing in 2-asset markets.

problem Robust option pricing in multi-asset markets with sub- or supermodular payoffs.
method Investigates the geometry of VMOT solutions, proving dimension reduction for 2 assets and developing a Sinkhorn algorithm.
result Dimension reduction to single-factor structure for 2-asset markets, significantly reducing computational time and improving accuracy.

The main result of this article states that the (K;N)-cone over some metric measure space satisfies the reduced Riemannian curvature-dimension condition RCD^*(KN;N+1) if and only if the underlying space satisfies RCD^*(N-1;N). The proof uses a characterization of reduced Riemannian curvature-dimension bounds by Bochner…

2013-11-06abs ↗pdf ↗

A new tensor-based layer reduces neural network dimensions without losing important features.

problem Reducing dimensionality in tensor-structured feature data for deep neural networks.
method TensorProjection layer that projects input tensors into output tensors with reduced dimensions through mode-wise projections.
result The TensorProjection layer outperforms traditional downsampling methods in tasks like medical image classification and segmentation.

The current study proposes a dimension reduction method, stepwise support vector machine (SVM), to reduce the dimensions of large p small n datasets. The proposed method is compared with other dimension reduction methods, namely, the Pearson product difference correlation coefficient (PCCs), recursive feature eliminati…

2017-11-09abs ↗pdf ↗

Mixed dimension embeddings reduce memory usage in recommendation systems.

problem Space-intensive embedding representations in recommendation systems.
method Mixed dimension embeddings where vector dimension scales with query frequency.
result Significant reduction in memory usage with minimal performance loss.

New method for decomposing high-dimensional parametric domains using PCA and inverse projection.

problem Decomposing high-dimensional parametric domains efficiently.
method Iterative Principal Component Analysis (PCA) and inverse projection methods.
result The proposed method effectively reconstructs the original domain from lower-dimensional data.

Two methods preserve tensor structure for reduced dimensionality in tensor regression.

problem Reducing dimensionality of tensor predictors for improved interpretation and accuracy.
method Developed two tensor dimension reduction methods using Tucker and CP decompositions.
result Substantial improvement in accuracy over existing methods in simulations and applications.

Normal and almost normal surfaces are essential tools for algorithmic 3-manifold topology, but to use them requires exponentially slow enumeration algorithms in a high-dimensional vector space. The quadrilateral coordinates of Tollefson alleviate this problem considerably for normal surfaces, by reducing the dimension …

2009-04-20abs ↗pdf ↗

The paper explores how to reduce classification tasks to optimization problems in Euclidean space.

problem Understanding the minimum dimension needed for reducing classification tasks to optimization problems.
method Developed a generalization of the Borsuk-Ulam Theorem to analyze the expressivity of reductions.
result The minimum Euclidean dimension required can be exponentially larger than the VC dimension, even for slightly non-trivial reductions.

Robust STAP with coprime arrays reduces clutter using sparse modeling.

problem Limited performance due to training samples support in practical applications.
method Two-stage approach: 1) RD virtual snapshot, 2) RD sparse measurement modeling with OMP-like recovery.
result Robust to prior knowledge errors, good clutter suppression performance.

We introduce a dimension reduction method for visualizing the clustering structure obtained from a finite mixture of Gaussian densities. Information on the dimension reduction subspace is obtained from the variation on group means and, depending on the estimated mixture model, on the variation on group covariances. The…

2015-08-07abs ↗pdf ↗

Optimizes expensive shape models using Gaussian processes in reduced eigenbases.

problem Optimizing expensive numerical simulators with many parameters.
method High-dimensional shape mapping, eigenshape coordinate system, regularized likelihood maximization, critical dimensions focus, random embedding, manifold replication.
result More accurate and faster optimization with reduced parameter space.

Unsupervised dimension selection is an important problem that seeks to reduce dimensionality of data, while preserving the most useful characteristics. While dimensionality reduction is commonly utilized to construct low-dimensional embeddings, they produce feature spaces that are hard to interpret. Further, in applica…

2018-10-31abs ↗pdf ↗

Study on LpL^p cohomology and Hodge decomposition for ALE manifolds.

problem Understanding LpL^p cohomology dimensions and harmonic forms in ALE manifolds.
method Relating dimensions of LpL^p cohomology spaces to decaying harmonic forms, proving independence and jumps in dimensions, and providing Hodge decompositions.
result Dimension of LpL^p reduced cohomology spaces in degree k is independent of p for k not equal to 1 or n-1, and jumps by a factor N-1 for k equal to 1 or n-1.

Sliced Inverse Regression reduces parameter space for estimating complex financial models.

problem High-dimensional parameter space in stochastic differential equations.
method Sliced Inverse Regression for dimension reduction.
result Reduced computational costs in estimating parameters.

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.

The Whitney embedding theorem gives an upper bound on the smallest embedding dimension of a manifold. If a data set lies on a manifold, a random projection into this reduced dimension will retain the manifold structure. Here we present an algorithm to find a projection that distorts the data as little as possible.

2017-09-06abs ↗pdf ↗

The work discusses equivariant asymptotic dimension (also known as "wide equivariant covers", "NN-F\mathcal F-amenability" or "amenability dimension", and "dd-BLR condition") and its generalisation, transfer reducibility, which are versions of asymptotic dimension invented for the proofs of the Farrell--Jones and Bo…

2015-04-17abs ↗pdf ↗

Investigates maps and properties in spaces with negative dimensions and curvature.

problem Existence of transport maps and local-to-global property in spaces with negative dimensions and bounded Ricci curvature.
method Examines metric measure spaces with negative curvature dimensions and applies reduced curvature-dimension conditions.
result Establishes the existence of transport maps and proves the local-to-global property.

Supervised linear feature extraction can be achieved by fitting a reduced rank multivariate model. This paper studies rank penalized and rank constrained vector generalized linear models. From the perspective of thresholding rules, we build a framework for fitting singular value penalized models and use it for feature …

2010-07-19abs ↗pdf ↗

Reduces function approximation dimensions from high to low with sparse data.

problem Function approximation from sparse data.
method Nonlinear Level Set Learning (NLL) with geometric information.
result Reduces input dimension to theoretical lower bound with minor accuracy loss.

A new method maps high-dimensional Bayesian inverse problems to lower dimensions.

problem High-dimensional Bayesian inverse problems with complex prior information.
method Data-driven VAE prior and KRnet map for posterior approximation in latent space.
result Efficiently reduces computational cost and approximates posterior distributions.

We show how a polar representation of a compact connected Lie group can be linearly determined from its dimension and isotropy subgroup data in the general reducible case.

2017-04-11abs ↗pdf ↗

We prove that any mapping torus of a closed 3-manifold has zero simplicial volume. When the fiber is a prime 3-manifold, classification results can be applied to show vanishing of the simplicial volume, however the case of reducible fibers is by far more subtle. We thus analyse the possible self-homeomorphisms of reduc…

2018-12-27abs ↗pdf ↗

Perturbs area-minimizing hypersurfaces to reduce singular set's dimension.

problem Reduces the dimension of the singular set of area-minimizing hypersurfaces.
method Perturbs a smooth hypersurface to minimize the Minkowski dimension of the singular set.
result The singular set of the perturbed minimizing current has Minkowski dimension less than n-9.