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

35810 · Jan 202619922001200920172026
48 results for low-density hyperplanes

Random quotients of hyperbolic cubulated groups remain cubulated.

problem Understanding properties of random quotients of hyperbolic cubulated groups.
method Cubical small-cancellation theory, exponential growth of conjugacy classes, and hyperplane stabilizers' growth.
result Low-density random quotients of cubulated hyperbolic groups are cubulated and hyperbolic.

SDG uses optimal control to improve classifier guidance in low-density regions.

problem Inefficient guidance in low-density regions of posterior distributions.
method Integrates stochastic optimal control with Stein variational inference to compute the steepest descent direction.
result SDG improves guidance in low-density regions, outperforming standard methods.

Proposes a framework to balance supervised and unsupervised learning using random matrix theory.

problem Balancing supervised and unsupervised learning in high-dimensional data.
method QLDS model with quadratic margin maximization under low density separation assumption.
result Establishes a smooth bridge between supervised and unsupervised learning methods.

We present a new method of generating mixture models for data with categorical attributes. The keys to this approach are an entropy-based density metric in categorical space and annealing of high-entropy/low-density components from an initial state with many components. Pruning of low-density components using the entro…

2017-08-24abs ↗pdf ↗

GCAO improves clustering of high-dimensional data by grouping low-density boundary points.

problem Stability and accuracy of clustering in high-dimensional, non-uniform data.
method Group-level optimization with gravitational attraction and optimization.
result GCAO outperforms 11 clustering methods on multiple datasets.

Segre varieties' hyperplane sections are unstable under certain conditions.

problem Stability of hyperplane sections of Segre varieties under different conditions.
method Proving instability with respect to any polarization for non-smooth or meqnm eq n cases.
result Normal hyperplane sections of Segre varieties are K-unstable under specified conditions.

We extend the theoretical analysis of a recently proposed single subspace learning algorithm, called Dual Principal Component Pursuit (DPCP), to the case where the data are drawn from of a union of hyperplanes. To gain insight into the properties of the 1\ell_1 non-convex problem associated with DPCP, we develop a geo…

2017-06-06abs ↗pdf ↗

The Lefschetz hyperplane section theorem asserts that an affine variety is homotopy equivalent to a space obtained from its generic hyperplane section by attaching some cells. The purpose of this paper is to describe attaching maps of these cells for the complement of a complex hyperplane arrangement defined over real …

2005-07-15abs ↗pdf ↗

We define several homology theories for central hyperplane arrangements, categorifying well-known polynomial invariants including the characteristic polynomial, Poincare polynomial, and Tutte polynomial. We consider basic algebraic properties of such chain complexes, including long-exact sequences associated to deletio…

2012-05-12abs ↗pdf ↗

We show some characterizations of hyperspheres in the (n+1)(n+1)-dimensional Euclidean space En+1{\Bbb E}^{n+1} with intrinsic and extrinsic properties such as the nn-dimensional area of the sections cut off by hyperplanes, the (n+1)(n+1)-dimensional volume of regions between parallel hyperplanes, and the nn-dimensional surf…

2012-08-27abs ↗pdf ↗

L-Cool improves image and language translation by cooling low-density samples.

problem Improving translation performance on fringe samples in unsupervised domain translation.
method Performing Langevin dynamics to move low-density samples towards high-density areas.
result L-Cool enhances state-of-the-art methods in image and language translation tasks.

In this paper we show that an immersed nontrivial translating soliton for mean curvature flow in Rn+1\mathbb{R}^{n+1}(n=2,3)n=2,3) is a grim hyperplane if and only if it is mean convex and has weighted total extrinsic curvature of at most quadratic growth. For an embedded translating soliton ΣΣ with nonnegative scalar curva…

2016-09-28abs ↗pdf ↗

Study of first homology group of Milnor fiber boundary for generic hyperplane arrangements in C^3.

problem Computing the first homology group of the Milnor fiber boundary for generic hyperplane arrangements.
method Analyzing the Milnor fiber boundary for hyperplane arrangements in C^3.
result Affirmative answer to the conjecture of Suciu and example of arrangements with non-trivial torsion.

Study hyperplanes in abelian groups and their signatures for manifold identification.

problem Identifying manifolds based on their homology groups and coordinate hyperplanes.
method Investigates isomorphisms preserving coordinate hyperplanes in products of cyclic groups.
result Recovering coordinate hyperplanes from their union and applying to manifold identification.

Considering the classification problem, we summarize the nonparallel support vector machines with the nonparallel hyperplanes to two types of frameworks. The first type constructs the hyperplanes separately. It solves a series of small optimization problems to obtain a series of hyperplanes, but is hard to measure the …

2019-10-22abs ↗pdf ↗

We consider a twisted version of the Hurewicz map on the complement of a hyperplane arrangement. The purpose of this paper is to prove surjectivity of the twisted Hurewicz map under some genericity conditions. As a corollary, we also prove that a generic section of the complement of a hyperplane arrangement has non-tri…

2006-05-24abs ↗pdf ↗

The Sample Compression Conjecture of Littlestone & Warmuth has remained unsolved for over two decades. This paper presents a systematic geometric investigation of the compression of finite maximum concept classes. Simple arrangements of hyperplanes in Hyperbolic space, and Piecewise-Linear hyperplane arrangements, are …

2009-11-18abs ↗pdf ↗

In hyperbolic space, the angle of intersection and distance classify pairs of totally geodesic hyperplanes. A similar algebraic invariant classifies pairs of hyperplanes in the Einstein universe. In dimension 3, symplectic splittings of a 4-dimensional real symplectic vector space model Einstein hyperplanes and the inv…

2017-02-27abs ↗pdf ↗

The paper proves a margin inequality for separating hyperplanes, useful for analyzing algorithmic bias.

problem Analyzing the implicit bias of algorithms in machine learning.
method Proves a nonsmooth Kurdyka-Lojasiewicz inequality for margin function.
result The bias of algorithm iterates converges at least as fast as the square-root of the margin convergence rate.

Associating distinct groups of objects (clusters) with contiguous regions of high probability density (high-density clusters), is central to many statistical and machine learning approaches to the classification of unlabelled data. We propose a novel hyperplane classifier for clustering and semi-supervised classificati…

2015-07-15abs ↗pdf ↗

Hyperplane hashing aims at rapidly searching nearest points to a hyperplane, and has shown practical impact in scaling up active learning with SVMs. Unfortunately, the existing randomized methods need long hash codes to achieve reasonable search accuracy and thus suffer from reduced search speed and large memory overhe…

2012-06-18abs ↗pdf ↗

We use Morse theory to prove that the Lefschetz Hyperplane Theorem holds for compact smooth Deligne-Mumford stacks over the site of complex manifolds. For ZXZ \subset X a hyperplane section, XX can be obtained from ZZ by a sequence of deformation retracts and attachments of high-dimensional finite disc quotients. We …

2010-08-04abs ↗pdf ↗

Locality-sensitive hashing converts high-dimensional feature vectors, such as image and speech, into bit arrays and allows high-speed similarity calculation with the Hamming distance. There is a hashing scheme that maps feature vectors to bit arrays depending on the signs of the inner products between feature vectors a…

2012-12-26abs ↗pdf ↗

Paper proves a Cohen-Dimca-Orlik type theorem for Z-local systems of hyperplane arrangements.

problem Proving a Cohen-Dimca-Orlik type theorem for Z\mathbb{Z}-local systems.
method Analyzing local system cohomology groups of hyperplane arrangements complements.
result Proves a Cohen-Dimca-Orlik type theorem for Z\mathbb{Z}-local systems.

Neural samplers such as variational autoencoders (VAEs) or generative adversarial networks (GANs) approximate distributions by transforming samples from a simple random source---the latent space---to samples from a more complex distribution represented by a dataset. While the manifold hypothesis implies that the densit…

2017-11-03abs ↗pdf ↗

We study torsion properties of the twisted Alexander modules of the affine complement MM of a complex essential hyperplane arrangement, as well as those of punctured stratified tubular neighborhoods of complex essential hyperplane arrangements. We investigate divisibility properties between the twisted Alexander polyn…

2017-10-18abs ↗pdf ↗

Bordifications of hyperplane arrangements yield complexes with homotopy type of wedges of spheres.

problem Understanding the structure of hyperplane arrangements and their complements.
method Bordification of hyperplane arrangements and analysis of their universal covers.
result The complex C\mathcal{C} has the homotopy type of a wedge of spheres.

The complement of an arrangement A of a finite number of affine hyperplanes in complex n-space has the structure of a poset of spaces indexed by the intersection poset, L(A). The space corresponding to G in L(A) is homotopy equivalent to the complement of the hyperplanes in the central arrangement A_G normal to G. This…

2015-02-12abs ↗pdf ↗

New method constructs asymptotic convex hypersurfaces via equidistant hyperplanes.

problem Constructing asymptotic convex hypersurfaces in hyperbolic space.
method Approximating hypersurface by geodesic graphs over equidistant hyperplanes.
result Existence of complete, strictly locally convex hypersurfaces with prescribed asymptotic boundary.