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

96191287382 · May 202619922001200920172026
48 results for exact dimensionality

Study shows exact dimensionality and regularity of manifolds for specific groups.

problem Exact dimensionality and regularity of manifolds for relatively Anosov groups.
method Dynamical methods, including finite and mixing of Bowen–Margulis–Sullivan measures.
result Manifolds are C1C^1-regular and growth indicator is strictly concave.

No exact G₂-structures on compact Lie group quotients.

problem Existence of exact G₂-structures on compact quotients of Lie groups.
method Analyzing compact quotients of seven-dimensional Lie groups by co-compact discrete subgroups.
result Compact quotients of seven-dimensional Lie groups by co-compact discrete subgroups do not admit exact G₂-structures induced by left-invariant ones.

Researchers solve a 25-year-old conjecture about vector fields.

problem Proving a 25-year-old conjecture about divergence-free vector fields.
method Analysis of a Leibniz algebra underlying these vector fields.
result Construction of the universal central extension for divergence-free vector fields and diffeomorphisms.

New method for valid and exact statistical inference of multi-dimensional change-points.

problem Statistical inference of change-points in multi-dimensional sequences.
method Proposes a method to guarantee the statistical reliability of both location and components of detected changes.
result Demonstrates the effectiveness of the method in genomic abnormality identification and human behavior analysis.

A new framework using kernel packets overcomes limitations of state space models for multi-dimensional data.

problem Computational limitations of Gaussian process regression in large-scale applications.
method Kernel packet approach, identifying KPs via forward and backward state space representations.
result Exact, memory-efficient inference with linear-time training and logarithmic/predictive time.

New algorithms improve GP inference without approximations, achieving better results.

problem Inexact stochastic optimization methods in Gaussian Processes leading to biased results.
method Exact stochastic inference for GPs with finite dimensional RKHS, extending to infinite dimensions.
result Achieves better experimental results than existing methods in constrained resource settings.

We present a Bayesian model selection approach to estimate the intrinsic dimensionality of a high-dimensional dataset. To this end, we introduce a novel formulation of the probabilisitic principal component analysis model based on a normal-gamma prior distribution. In this context, we exhibit a closed-form expression o…

2017-03-08abs ↗pdf ↗

Develops a fast algorithm for high-dimensional LASSO penalized quantile regression.

problem Computational challenges in high-dimensional 1\ell_1 penalized quantile regression.
method Pathwise coordinate descent algorithm to solve exact coordinatewise minimum of the nonsmooth loss function.
result Algorithm runs faster than existing alternatives and maintains estimation accuracy.

We study pseudo-Riemanniasn manifolds (M,g)(M,g) with transitive group of conformal transformation which is essential, i.e. does not preserves any metric conformal to gg. All such manifolds of Lorentz signature with non exact isotropy representation of the stability subalgebra are described. A construction of essential c…

2016-11-10abs ↗pdf ↗

We consider seven-dimensional unimodular Lie algebras g\mathfrak{g} admitting exact G2G_2-structures, focusing our attention on those with vanishing third Betti number b3(g)b_3(\mathfrak{g}). We discuss some examples, both in the case when b2(g)0b_2(\mathfrak{g})\neq0, and in the case when the Lie algebra g\mathfrak{g} is (…

2019-04-24abs ↗pdf ↗

We show that for n2n\geq 2 there exists an exact Lagrangian submanifold LL in the cotangent bundle TTnT^*\mathbb{T}^n of the nn-dimensional torus Tn\mathbb{T}^n such that LL is symplectically but not Hamiltonian isotopic to the zero section of TTnT^*\mathbb{T}^n.

2016-03-31abs ↗pdf ↗

Exact risk and learning rate curves derived for adaptive SGD on high-dimensional problems.

problem Analyzing risk and learning rate dynamics in high-dimensional optimization problems.
method Developed a framework to give exact expressions for risk and learning rate curves using ODEs.
result Exact expressions for risk and learning rate curves, with detailed analysis of two adaptive learning rates.

TERA method speeds up derivative Gaussian processes in high dimensions.

problem High-dimensional function evaluations and gradient computations are computationally expensive.
method TERA uses exact gradient reduction to decouple nn and dd from the computational cost.
result TERA achieves state-of-the-art predictive accuracy with orders of magnitude faster computation.

Let (Xn,Xˇn)(X^n, \check{X}^n) be a mirror pair of an nn-dimensional complex torus XnX^n and its mirror partner Xˇn\check{X}^n. Then, a simple projectively flat bundle E(L,L)XnE(L,\mathcal{L})\rightarrow X^n is constructed from each affine Lagrangian submanifold LL in Xˇn\check{X}^n with a unitary local system $\mathcal{L} \righta…

2017-05-11abs ↗pdf ↗

New MIP framework solves high-dimensional 02\ell_0\ell_2-regularized regression problems.

problem Exact computation of 02\ell_0\ell_2-regularized regression estimators is challenging for large pp.
method Specialized nonlinear branch-and-bound (BnB) framework with first-order optimization.
result Achieves speedups of at least 5000x compared to state-of-the-art exact methods.

Neural score matching improves high-dimensional causal inference by using neural networks for balancing scores.

problem Impracticality of traditional matching methods in high-dimensional datasets due to the curse of dimensionality.
method Develops neural networks to create non-trivial, multivariate balancing scores for high-dimensional causal inference.
result Neural score matching outperforms other methods in treatment effect estimation and reducing imbalance on high-dimensional datasets.

We construct an infinite-dimensional symplectic 2-groupoid as the integration of an exact Courant algebroid. We show that every integrable Dirac structure integrates to a "Lagrangian" sub-2-groupoid of this symplectic 2-groupoid. As a corollary, we recover a result of Bursztyn-Crainic-Weinstein-Zhu that every integrabl…

2013-10-24abs ↗pdf ↗

The Milnor fibre of any isolated hypersurface singularity contains many exact Lagrangian spheres: the vanishing cycles associated to a Morsification of the singularity. Moreover, for simple singularities, it is known that the only possible exact Lagrangians are spheres. We construct exact Lagrangian tori in the Milnor …

2014-05-04abs ↗pdf ↗

Develops a diagrammatic method for symplectic filling classifications.

problem Classifying exact/weak symplectic fillings of 3D contact manifolds.
method Symplectic JSJ decomposition applied to contact surgery diagrams.
result Recover symplectic fillings for certain lens spaces and torus bundles, and classify fillings for a large class of plumbed 3-manifolds.

Analyzes SGD dynamics on multi-class problems with exact expressions.

problem Analyzing SGD dynamics on multi-class problems.
method Developed a framework for analyzing training and learning rate dynamics using exact expressions.
result Exact expressions for risk and overlap with true signal in terms of ODEs.

Develops methods for constructing exact, non-stationary solutions to Euler equations.

problem Constructing exact, non-stationary solutions to the incompressible Euler equations.
method Arnold's geometric framework with a generalized Coriolis force.
result Explicit, smooth, global-in-time solutions on curved surfaces and three-dimensional manifolds.

Unified model for reducing dimensions and clustering high-dimensional data.

problem High-dimensional data clustering and dimensionality reduction.
method Hierarchical mixtures of Gaussians (HMoGs) with closed-form likelihood and inference.
result Efficiently models hundreds of latent dimensions, improving clustering performance.

Exact inference method for Wasserstein distance with finite-sample coverage.

problem Asymptotic approximation methods for Wasserstein distance lack finite-sample validity.
method Selective Inference inspired approach for exact inference.
result Valid confidence interval for Wasserstein distance with finite-sample coverage.

We find exact solutions describing Ricci flows of four dimensional pp-waves nonlinearly deformed by two/three dimensional solitons. Such solutions are parametrized by five dimensional metrics with generic off-diagonal terms and connections with nontrivial torsion which can be related, for instance, to antisymmetric ten…

2006-02-07abs ↗pdf ↗

Paper proves robust estimators' generalization guarantees without dimensionality issues.

problem Generalization guarantees for Wasserstein distributionally robust models.
method Analyzes and extends existing guarantees to broader classes of models and regularized versions.
result Generalization guarantees hold without dimensionality issues and cover distribution shifts.

The Bryant-Ferry-Mio-Weinberger surgery exact sequence for high-dimensional compact ANR homology manifolds is used to obtain transversality, splitting and bordism results for homology manifolds, generalizing previous work of Johnston.

1999-09-22abs ↗pdf ↗

In this paper, we prove that a normal subgroup N of an n-dimensional crystallographic group G determines a geometric fibered orbifold structure on the flat orbifold E^n/G, and conversely every geometric fibered orbifold structure on E^n/G is determined by a normal subgroup N of G, which is maximal in its commensurabili…

2008-04-02abs ↗pdf ↗

The celebrated Monte Carlo method estimates an expensive-to-compute quantity by random sampling. Bandit-based Monte Carlo optimization is a general technique for computing the minimum of many such expensive-to-compute quantities by adaptive random sampling. The technique converts an optimization problem into a statisti…

2018-05-21abs ↗pdf ↗

Surgery exact triangles in various 3-manifold Floer homology theories provide an important tool in studying and computing the relevant Floer homology groups. These exact triangles relate the invariants of 3-manifolds, obtained by three different Dehn surgeries on a fixed knot. In this paper, the behavior of SU(N)SU(N)-ins…

2017-12-28abs ↗pdf ↗

A method for making machine learning units-equivariant using dimensional analysis.

problem Ensuring machine learning models respect dimensional consistency.
method Constructing dimensionless inputs and applying equivariant machine learning methods.
result Improved accuracy in tasks requiring dimensional consistency.

The SO(3) instanton homology recently introduced by the authors associates a finite-dimensional vector space over the field of two elements to every embedded trivalent graph (or "web"). The present paper establishes a skein exact triangle for this instanton homology, as well as a realization of the octahedral axiom. Fr…

2015-08-28abs ↗pdf ↗

The paper finds exact solutions to a complex Einstein-Dirac-Maxwell system on 4D Sasakian spacetimes.

problem Finding exact solutions to an Einstein-Dirac-Maxwell system with Sasakian quasi-Killing spinors.
method Constructing a family of exact solutions on four-dimensional static Sasakian spacetimes using the Sasakian frame.
result Closed and open universe models are found with specific energy conditions.

We study a class of 2-variable polynomials called exact polynomials which contains AA-polynomials of knot complements. The Mahler measure of these polynomials can be computed in terms of a volume function defined on the vanishing set of the polynomial. We prove that the local extrema of the volume function are on the …

2018-04-04abs ↗pdf ↗

Online detection of abrupt changes in high-dimensional data streams.

problem Detecting abrupt changes in high-dimensional, streaming data with multiple subspaces.
method Dynamic sparse subspace learning approach with multiple structural change-point model, Bayesian information criterion for penalty coefficients selection, and Pruned Exact Linear Time algorithm.
result Effectiveness demonstrated through simulation and real gesture data studies.