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

Trend · papers per month

77153230306 · Jun 202019922001200920172026
48 results for closed reductions

This paper classifies instantons with closed reductions and provides examples of non-closed reductions.

problem Understanding the geometry of toric Kähler instantons with and without closed reductions.
method Sharp geometric criteria and examples of instantons with different reduction types.
result Established geometric criteria for closed reductions and classified asymptotic geometries.

In this article, we introduce symplectic reduction in the framework of nonrational toric geometry. When we specialize to the rational case, we get symplectic reduction for the action of a general, not necessarily closed, Lie subgroup of the torus.

2018-06-27abs ↗pdf ↗

In this work we introduce a category of discrete Lagrange--Poincare systems LP_d and study some of its properties. In particular, we show that the discrete mechanical systems and the discrete mechanical systems obtained by the Lagrangian reduction of symmetric discrete mechanical systems are objects in LP_d. We introdu…

2015-11-20abs ↗pdf ↗

We prove that a polar orthogonal representation of a real reductive algebraic group has the same closed orbits as the isotropy representation of a pseudo-Riemannian symmetric space. We also develop a partial structural theory of polar orthogonal representations of real reductive algebraic groups which slightly generali…

2008-01-03abs ↗pdf ↗

New method linearizes Darboux transformations of discrete curves.

problem Linearizing Darboux transformations of discrete curves.
method Expressing Darboux transformations as parallel sections of discrete connections in quaternionic formalism.
result Closed-form discrete parametrisations of all Darboux transforms and bicycle correspondences.

Introduces generalized moment maps for almost Hermitian settings.

problem Extending classical moment map theory to almost Hermitian settings.
method Introduces momentumly closed forms and proves a variant of the Darboux-Weinstein theorem.
result Establishes convexity property and constructs reduction space for generalized moment maps.

Paper shows spectra can't distinguish naturally reductive manifolds.

problem Cannot distinguish naturally reductive manifolds using Laplace-Beltrami spectrum.
method Characterized naturally reductive 2-step nilpotent Lie groups via Ambrose-Singer's structures; constructed isospectral pairs of 9-dimensional nilmanifolds.
result Spectra of Laplace-Beltrami operator can't distinguish naturally reductive manifolds from non-naturally reductive ones.

The paper proves rigidity theorems for forms on reductive symmetric spaces.

problem Local rigidity of forms on reductive symmetric spaces under representations of discrete groups.
method General local rigidity theorem for pull-backs of homogeneous forms, reinterpretation of old results.
result Volume of closed manifolds is constant under deformation of G/HG/H-structure.

Develops a finite construction for self-duality and related moduli spaces over Riemann surfaces.

problem Constructing moduli spaces over Riemann surfaces.
method Finite-dimensional construction using holomorphic symplectic reduction.
result Moduli spaces over Riemann surfaces as stratified holomorphic symplectic spaces.

We prove a generalization of a theorem of Borel-Harish-Chandra on closed orbits of linear actions of reductive groups. Consider a real reductive algebraic group GG acting linearly and rationally on a real vector space VV. GG can be viewed as the real points of a complex reductive group GCG^\mathbb C which acts on $V…

2008-06-23abs ↗pdf ↗

In this article, we give a theorem of reduction of the structure group of a principal bundle P with regular structure group G. Then, when G is in the classes of Lie groups defined by T.Robart [13], we define the closed holonomy group of a connection as the minimal closed Lie subgroup of G for which the previous theorem…

2002-12-11abs ↗pdf ↗

We prove the first nontrivial worst-case lower bounds for two closely related problems. First, Ω(n3/2)Ω(n^{3/2}) degree-1 reductions, series-parallel reductions, and ΔΔY transformations are required in the worst case to reduce an nn-vertex plane graph to a single vertex or edge. The lower bound is achieved by any planar g…

2015-10-02abs ↗pdf ↗

In order to use the technique of dimensional reduction, it is usually necessary for there to be a symmetry coming from a group action. In this paper we consider a situation in which there is no such symmetry, but in which a type of dimensional reduction is nevertheless possible. We obtain a relation between the Coupled…

1997-03-14abs ↗pdf ↗

This work extends reduction processes for nonholonomic discrete mechanical systems.

problem Nonholonomic discrete mechanical systems and their reductions.
method Introduces a category LDPdLDP_d of discrete-time dynamical systems and a two-stage reduction process.
result Two-stage reduction process produces systems isomorphic to one-stage reduction.

Study surjectivity of Kirwan map for generalized hyperkähler reduction.

problem Establishing surjectivity of Kirwan map for a specific class of Hamiltonian manifolds.
method Defined a close analogue of hyperkähler reduction for manifolds with equivariant functions under semi-linear GG-actions.
result Surjectivity of Kirwan map proved for the defined class of manifolds.

Efficiently reduces rank of non-negative matrices with quadratic time complexity.

problem Efficiently reducing the rank of non-negative matrices.
method Formulated rank reduction as a mean-field approximation using a log-linear model.
result Optimal solution for minimizing KL divergence can be computed in closed form.

A close relationship between the classical Hamilton-Jacobi theory and the kinematic reduction of control systems by decoupling vector fields is shown in this paper. The geometric interpretation of this relationship relies on new mathematical techniques for mechanics defined on a skew-symmetric algebroid. This geometric…

2011-10-27abs ↗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.

We introduce a data-driven order reduction method for nonlinear control systems, drawing on recent progress in machine learning and statistical dimensionality reduction. The method rests on the assumption that the nonlinear system behaves linearly when lifted into a high (or infinite) dimensional feature space where ba…

2011-08-14abs ↗pdf ↗

We find three characterizations for a multidimensional (n+1)-web W possessing a reduct reducible subweb: its closed form equations, the integrability of an invariant distribution associated with W, and the relations between the components of its torsion tensor. In the case of codimension one, the latter criterion estab…

2000-10-17abs ↗pdf ↗

For a stratified symplectic space, a suitable concept of stratified Kaehler polarization, defined in terms of an appropriate Lie-Rinehart algebra, encapsulates Kaehler polarizations on the strata and the behaviour of the polarizations across the strata and leads to the notion of stratified Kaehler space. This notion es…

2001-04-23abs ↗pdf ↗

We consider active maximum a posteriori (MAP) inference problem for Hidden Markov Models (HMM), where, given an initial MAP estimate of the hidden sequence, we select to label certain states in the sequence to improve the estimation accuracy of the remaining states. We develop an analytical approach to this problem for…

2014-11-03abs ↗pdf ↗

In this paper, we study randomized reduction methods, which reduce high-dimensional features into low-dimensional space by randomized methods (e.g., random projection, random hashing), for large-scale high-dimensional classification. Previous theoretical results on randomized reduction methods hinge on strong assumptio…

2015-04-15abs ↗pdf ↗

We derive a closed formula for a star-product on complex projective space and on the domain SU(n+1)/S(U(1)×U(n))SU(n+1)/S(U(1)\times U(n)) using a completely elementary construction: Starting from the standard star-product of Wick type on Cn+1{0}C^{n+1} \setminus \{ 0 \} and performing a quantum analogue of Marsden-Weinstein reduction, we ca…

1995-03-09abs ↗pdf ↗

This work examines consistency issues in Gaussian Mixture Model reduction algorithms.

problem Consistency issues in Gaussian Mixture Model reduction algorithms.
method Discussion of the importance of dissimilarity measure choice and consistency of GMR algorithms.
result Most existing GMR algorithms are not consistent with a unique measure, leading to suboptimal reduced GMs.

The paper introduces controllable principal connections and estimates distances between bundles and spaces.

problem Estimating distances between bundles and spaces using controllable connections.
method Combining orbit theorem, Ambrose-Singer theorem, and controllable principal connections.
result Proves convergence of metrics to normal reductive homogeneous spaces.

We investigate the Kaluza-Klein reductions to ten dimensions of the purely gravitational half-BPS M-theory backgrounds: the M-wave and the Kaluza-Klein monopole. We determine the moduli space of smooth (supersymmetric) Kaluza-Klein reductions by classifying the freely-acting spacelike Killing vectors which preserve som…

2002-08-15abs ↗pdf ↗

Drago optimizes DRO problems with faster convergence.

problem Distributionally robust optimization with closed, convex uncertainty sets.
method Primal-dual coupled variance reduction algorithm with cyclic and randomized updates.
result Achieves state-of-the-art linear convergence rate on strongly convex-strongly concave problems.

American put options are among the most frequently traded single stock options, and their calibration is computationally challenging since no closed-form expression is available. Due to the higher flexibility in comparison to European options, the mathematical model involves additional constraints, and a variational in…

2016-11-19abs ↗pdf ↗

Develops a new method for nonlinear dimension reduction using random features.

problem Statistical challenges in generalizing Gaussian process-based latent variable models to non-Gaussian data.
method Random feature latent variable models (RFLVMs) that approximate nonlinear relationships with linear functions of random features.
result RFLVMs produce comparable results to state-of-the-art methods on various data types.

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.

We present sktime -- a new scikit-learn compatible Python library with a unified interface for machine learning with time series. Time series data gives rise to various distinct but closely related learning tasks, such as forecasting and time series classification, many of which can be solved by reducing them to relate…

2019-09-17abs ↗pdf ↗