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

Trend · papers per month

164327491654 · Jun 202019922001200920172026
48 results for version space reduction

New method reduces version space for CNNs, improving active learning performance.

problem Sampling bias in active learning hinders optimal hypothesis finding in neural networks.
method Version space reduction through prior mass reduction and diameter reduction, proposing a new Gibbs-vote disagreement method.
result Diameter-based querying method reduces version space more effectively than prior mass reduction and other methods.

The paper proves a new version of dimensional reduction in cohomological Donaldson-Thomas theory.

problem Proving a new version of dimensional reduction in cohomological Donaldson-Thomas theory.
method Using cohomological Donaldson-Thomas theory and loop stacks of 0-shifted symplectic stacks.
result Shows the BPS cohomology of loop stacks admits a description analogous to orbifold cohomology.

Let G be a compact, semi-simple Lie group and H a maximal rank reductive subgroup. The irreducible representations of G can be constructed as spaces of harmonic spinors with respect to a Dirac operator on the homogeneous space G/H twisted by bundles associated to the irreducible, possibly projective, representations of…

2000-05-05abs ↗pdf ↗

Supervised dimensionality reduction has emerged as an important theme in the last decade. Despite the plethora of models and formulations, there is a lack of a simple model which aims to project the set of patterns into a space defined by the classes (or categories). To this end, we set up a model in which each class i…

2016-10-27abs ↗pdf ↗

Given the Euclidean space R2n+2\R^{2n+2} endowed with a constant symplectic structure and the standard flat connection, and given a polynomial of degree 2 on that space, Baguis and Cahen have defined a reduction procedure which yields a symplectic manifold endowed with a Ricci-type connection. We observe that any symplect…

2003-10-23abs ↗pdf ↗

The paper discusses reducing Hamiltonian systems by scaling and standard symmetries, leading to Kirillov Hamiltonian systems.

problem Reduction of symplectic Hamiltonian systems by scaling and standard symmetries.
method Proof of Kirillov Hamiltonian systems and equivalence of reductions.
result Equivalent Kirillov Hamiltonian systems from different reduction orders.

We study the moduli spaces of polygons in R^2 and R^3, identifying them with subquotients of 2-Grassmannians using a symplectic version of the Gel'fand-MacPherson correspondence. We show that the bending flows defined by Kapovich-Millson arise as a reduction of the Gel'fand-Cetlin system on the Grassmannian, and with t…

1996-02-29abs ↗pdf ↗

The version of Marsden-Ratiu reduction theorem for Nambu-Poisson manifolds by a regular distribution has been studied by Ibaˊn~\acute{\text{a}}\tilde{\text{n}}ez et al. In this paper we show that the reduction is always ensured unless the distribution is zero. Next we extend the more general Falceto-Zambon Poisson reduct…

2017-02-06abs ↗pdf ↗

We introduce the notion of a Hamiltonian action of an étale Lie group stack on an étale symplectic stack and establish versions of the Kirwan convexity theorem, the Meyer-Marsden-Weinstein symplectic reduction theorem, and the Duistermaat-Heckman theorem in this context.

2018-08-02abs ↗pdf ↗

The paper simplifies symmetries in complex geometric structures.

problem Redundancy in conditions for symmetry reduction in polysymplectic and polycosymplectic structures.
method Exploring and proving necessary and sufficient conditions for polycosymplectic reduction.
result A one-to-one relationship between polycosymplectic reduction and the reduction of a larger polysymplectic manifold.

This paper extends symplectic reduction to cosymplectic groupoids and explores their properties.

problem Cosymplectic groupoids and their reductions.
method Analogous to symplectic reduction, the authors extend the Marsden-Weinstein-Meyer reduction to cosymplectic groupoids.
result Integration commutes with reduction for algebroids associated with cosymplectic groupoids.

This work improves understanding of dimension reduction algorithms and their probabilistic embeddings.

problem Improving theoretical understanding of non-linear dimension reduction algorithms.
method Analytical investigation of a generalized multidimensional scaling optimization problem.
result Probabilistic formulation of the problem leads to deterministic embeddings, contrary to standard implementations.

We prove that every Kaehler solvmanifold has a finite covering whose holomorphic reduction is a principal bundle. An example is given that illustrates the necessity, in general, of passing to a proper covering. We also answer a stronger version of a question posed by Akhiezer for homogeneous spaces of nonsolvable algeb…

2007-01-31abs ↗pdf ↗

This paper is focused on geometric aspects of two particular types of finite-variable reductions in the dispersionless Toda hierarchy. The reductions are formulated in terms of "Landau-Ginzburg potentials" that play the role of reduced Lax functions. One of them is a generalization of Dubrovin and Zhang's trigonometric…

2012-06-06abs ↗pdf ↗

We consider locally conformal Kaehler geometry as an equivariant (homothetic) Kaehler geometry: a locally conformal Kaehler manifold is, up to equivalence, a pair (K,Γ) where K is a Kaehler manifold and Γa discrete Lie group of biholomorphic homotheties acting freely and properly discontinuously. We define a new invari…

2005-02-28abs ↗pdf ↗

We prove several versions of "quantization commutes with reduction" for circle actions on manifolds that are not symplectic. Instead, these manifolds possess a weaker structure, such as a spin^c structure. Our theorems work whenever the quantization data and the reduction data are compatible; this condition always hold…

1997-05-17abs ↗pdf ↗

We formulate a quantization commutes with reduction principle in the setting where the Lie group GG, the symplectic manifold it acts on, and the orbit space of the action may all be noncompact. It is assumed that the action is proper, and the zero set of a deformation vector field, associated to the momentum map and a…

2013-09-26abs ↗pdf ↗

Derivative-free optimization has become an important technique used in machine learning for optimizing black-box models. To conduct updates without explicitly computing gradient, most current approaches iteratively sample a random search direction from Gaussian distribution and compute the estimated gradient along that…

2018-05-30abs ↗pdf ↗

Ensemble learning has had many successes in supervised learning, but it has been rare in unsupervised learning and dimensionality reduction. This study explores dimensionality reduction ensembles, using principal component analysis and manifold learning techniques to capture linear, nonlinear, local, and global feature…

2017-10-11abs ↗pdf ↗

SMAVE optimizes SDR by projecting onto a low-dimensional subspace on a Riemannian manifold.

problem High-dimensional regression challenges due to the curse of dimensionality.
method SMAVE combines nearest-neighbor localization and Riemannian stochastic gradient ascent.
result SMAVE achieves almost-sure convergence and matches RMAVE's synthetic subspace recovery rate.

G. Tian and S.K. Donaldson formulated a conjecture relating GIT stability of a polarized algebraic variety to the existence of a Kahler metric of constant scalar curvature. In [Don02] Donaldson partially confirmed it in the case of projective toric varieties. In this paper we extend Donaldson's results and computations…

2003-11-26abs ↗pdf ↗

Survey of Laplacian-based methods for data dimensionality reduction and embedding.

problem Efficiently reducing high-dimensional data to lower dimensions while preserving important features and structures.
method Laplacian-based methods including spectral clustering, Laplacian eigenmap, locality preserving projection, graph embedding, and diffusion map.
result Comprehensive overview of various optimization variants and applications of Laplacian-based techniques.

Let ε(0,1)\varepsilon\in(0,1) and XRdX\subset\mathbb R^d be arbitrary with X|X| having size n>1n>1. The Johnson-Lindenstrauss lemma states there exists f:XRmf:X\rightarrow\mathbb R^m with m=O(ε2logn)m = O(\varepsilon^{-2}\log n) such that xX yX,xy2f(x)f(y)2(1+ε)xy2. \forall x\in X\ \forall y\in X, \|x-y\|_2 \le \|f(x)-f(y)\|_2 \le (1+\varepsilon)\|x-y\|_2 .

2018-10-22abs ↗pdf ↗

We consider type II string theory in space-time backgrounds which admit eight supercharges and can be characterized by the existence of an SU(3) x SU(3) structure. We show that the couplings of such backgrounds strongly resemble the couplings of four-dimensional N=2 supergravities and precisely coincide with the N=2 co…

2005-05-30abs ↗pdf ↗

Let S=Sg,pS=S_{g,p} be a compact, orientable surface of genus gg with pp punctures and such that d(S):=3g3+p>0d(S):=3g-3+p>0. The mapping class group ModS\textup{Mod}_S acts properly discontinuously on the Teichmüller space T(S)\mathcal T(S) of marked hyperbolic structures on SS. The resulting quotient M(S)\mathcal M(S) is the moduli sp…

2008-01-10abs ↗pdf ↗

Sketching, a dimensionality reduction technique, has received much attention in the statistics community. In this paper, we study sketching in the context of Newton's method for solving finite-sum optimization problems in which the number of variables and data points are both large. We study two forms of sketching that…

2017-05-17abs ↗pdf ↗

We solve the problem of description for nonsingular pairs of compatible flat metrics in the general N-component case. The integrable nonlinear partial differential equations describing all nonsingular pairs of compatible flat metrics (or, in other words, nonsingular flat pencils of metrics) are found and integrated. Th…

2002-01-23abs ↗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.

We study the relevant structure of so(2,n) which makes the BTZ black hole possible in the anti de Sitter space. We pay a particular attention of the reductive Lie algebra structures and Iwasawa decompositions and the way these structures evolves when one increases the dimension. The singularity is defined as the closed…

2009-12-11abs ↗pdf ↗

A new method for classifying naturally reductive spaces is presented. This method relies on the structure theory of naturally reductive spaces developed in \cite{Storm2018a} and the new construction of naturally reductive spaces in \cite{Storm2018}. We obtain the classification of all naturally reductive spaces in dime…

2018-10-08abs ↗pdf ↗