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

66132198264 · Jun 202019922001200920172026
48 results for minimal hypersphere

We show that the Morse index of a closed minimal hypersurface in a four-dimensional Riemannian manifold cannot be bound in terms of the volume and the topological invariants of the hypersurface itself by presenting a method for constructing Riemannian metrics on S^4 that admit embedded minimal hyperspheres of uniformly…

2015-04-08abs ↗pdf ↗

Hyperplanes, hyperspheres and hypercylinders in Rn\Bbb R^n with suitable densities are proved to be weighted minimizing by a calibration argument. Also calibration method is used to prove a weighted minimal hypersurface is weighted area-minimizing locally.

2010-04-06abs ↗pdf ↗

We study Ricci flows on RnR^n, n3n\ge 3, that evolve from asymptotically flat initial data. Under mild conditions on the initial data, we show that the flow exists and remains asymptotically flat for an interval of time. The mass is constant in time along the flow. We then specialize to the case of rotationally symmetr…

2006-07-18abs ↗pdf ↗

New method uses hyperspherical geometry to improve community detection.

problem Improving community detection methods in network analysis.
method Mapping networks to points on a hypersphere, then projecting to clustering vectors.
result Modularity maximization is equivalent to minimizing angular distance on the hypersphere.

Let MM be a 5 dimensional Riemannian manifold with SecM[0,1]Sec_M\in[0,1], ΣΣ be a locally conformally flat hypersphere in MM with mean curvature HH. We prove that, there exists ε0>0\varepsilon_0>0, such that Σ(1+H2)28π2/3\int_Σ(1+H^2)^2 \ge 8π^2/3, provided Hε0H \le \varepsilon_0. In particular, if ΣΣ is a locally conformally flat mi…

2016-11-02abs ↗pdf ↗

OPT framework improves neural network generalization by learning an orthogonal transformation.

problem Improving neural network generalization.
method Orthogonal over-parameterized training (OPT) framework that minimizes hyperspherical energy.
result OPT framework provably minimizes hyperspherical energy and improves empirical generalization.

We describe extrinsic hyperspheres and totally geodesic hypersurfaces in manifolds with special holonomy. In particular we prove the nonexistence of extrinsic hyperspheres in quaternion-Kaehler manifolds. We develop a new approach to extrinsic hyperspheres based on the classification of special Killing forms.

2011-07-08abs ↗pdf ↗

In this paper we study J~\widetilde{J}-tangent affine hyperspheres, where J~\widetilde{J} is the canonical para-complex structure on R2n+2\mathbb{R}^{2n+2}. The main purpose of this paper is to give a classification of J~\widetilde{J}-tangent affine hyperspheres of an arbitrary dimension with an involutive distribution $\…

2018-04-04abs ↗pdf ↗

In this note we prove that a constant mean curvature surface is proper-biharmonic in the unit Euclidean sphere S4\mathbb{S}^4 if and only if it is minimal in a hypersphere S3(12)\mathbb{S}^3(\frac{1}{\sqrt{2}}).

2009-02-27abs ↗pdf ↗

Constructs hyperspheres with prescribed mean curvature in Euclidean space.

problem Creating hyperspheres with a specific curvature in Euclidean space.
method Constructs families of smooth functions to fill Euclidean space with hyperspheres of prescribed mean curvature.
result Euclidean space can be filled with hyperspheres of prescribed mean curvature.

In this paper, we explicitly construct the Calabi composition of multiple affine hyperspheres possibly including some points viewing as 0-dimensional hypersheres. Then we compute all the basic affine invariants of the composed affine hyperspheres, proving that the composed affine hypersphere is symmetric one if and onl…

2013-10-18abs ↗pdf ↗

Study on hyperspheres in 4-spaces as special Riemannian manifolds.

problem Characterizing hyperspheres in Euclidean and Minkowski 4-spaces as specific Riemannian manifolds.
method Constructing and studying hyperspheres in 4-dimensional spaces (Euclidean and pseudo-Euclidean) as almost paracontact almost paracomplex Riemannian manifolds.
result Characterization and geometric properties of these manifolds.

In this paper, we study locally strongly convex affine hyperspheres in the unimodular affine space Rn+1\mathbb{R}^{n+1} which, as Riemannian manifolds, are locally isometric to the Riemannian product of two Riemannian manifolds both possessing constant sectional curvatures. As the main result, a complete classification o…

2018-12-19abs ↗pdf ↗

This paper introduces hyperspherical prototype networks, which unify classification and regression with prototypes on hyperspherical output spaces. For classification, a common approach is to define prototypes as the mean output vector over training examples per class. Here, we propose to use hyperspheres as output spa…

2019-01-29abs ↗pdf ↗

The Variational Auto-Encoder (VAE) is one of the most used unsupervised machine learning models. But although the default choice of a Gaussian distribution for both the prior and posterior represents a mathematically convenient distribution often leading to competitive results, we show that this parameterization fails …

2018-04-03abs ↗pdf ↗

Convolution as inner product has been the founding basis of convolutional neural networks (CNNs) and the key to end-to-end visual representation learning. Benefiting from deeper architectures, recent CNNs have demonstrated increasingly strong representation abilities. Despite such improvement, the increased depth and l…

2017-11-08abs ↗pdf ↗

Many contemporary statistical learning methods assume a Euclidean feature space. This paper presents a method for defining similarity based on hyperspherical geometry and shows that it often improves the performance of support vector machine compared to other competing similarity measures. Specifically, the idea of usi…

2017-02-05abs ↗pdf ↗

Paper optimizes hyperspherical prototypes for better class separation.

problem Previous HPL approaches either lack principled optimisation or are limited to one latent dimension.
method Develops a principled optimisation procedure and uses linear block codes to create well-separated prototypes in various dimensions.
result Optimal prototype placement is characterized with achievable and converse bounds, showing near-optimality.

This work optimizes alignment and uniformity of features on a hypersphere for better downstream performance.

problem Improving the performance of contrastive representation learning.
method Identifying and optimizing alignment and uniformity of features on a hypersphere.
result Directly optimizing alignment and uniformity leads to comparable or better performance than contrastive learning.

Researchers prove constant mean curvature graphs in hyperbolic 3-space for specific domains.

problem Existence of hyperbolic Killing graphs with constant mean curvature in exterior domains.
method Existence proof using CMC graphs and Killing vector fields.
result Existence of hyperbolic Killing graphs of constant mean curvature H in exterior domains.

An affine hypersurface M is said to admit a pointwise symmetry, if there exists a subgroup G of Aut(T_p M) for all p in M, which preserves (pointwise) the affine metric h, the difference tensor K and the affine shape operator S. Here, we consider 3-dimensional indefinite affine hyperspheres, i.e. S= H Id (and thus S is…

2005-10-25abs ↗pdf ↗

Learning suitable latent representations for observed, high-dimensional data is an important research topic underlying many recent advances in machine learning. While traditionally the Gaussian normal distribution has been the go-to latent parameterization, recently a variety of works have successfully proposed the use…

2019-10-07abs ↗pdf ↗

The study characterizes quadrics among affine hyperspheres based on centroid collinearity of sections.

problem Characterizing quadrics among affine hyperspheres based on section centroid collinearity.
method Extending Meyer and Reisner's theorem to unbounded convex sets and identifying additional assumptions.
result Ellipsoids, paraboloids, and one sheet of a two-sheeted hyperboloid are the only quadrics satisfying the centroid collinearity condition.

We introduce and study the equiaffine symmetric {\bf hyperspheres}. For the first step we consider the locally strongly convex ones. In fact, by the idea used by Naitoh, we provide in this paper a direct proof of the complete classification for those affine symmetric hyperspheres. Then, via an earlier result of the fir…

2014-08-19abs ↗pdf ↗

This work studies the chord length distribution, in the case where both ends lie on a NN-dimensional hypersphere (N2N \geq 2). Actually, after connecting this distribution to the recently estimated surface of a hyperspherical cap \cite{SLi11}, closed-form expressions of both the probability density function and the cu…

2014-11-20abs ↗pdf ↗

The purpose of this paper is twofold: firstly, to establish sufficient conditions under which the mean curvature flow supported on a hypersphere with exterior Dirichlet boundary exists globally in time and converges to a minimal surface, and secondly, to illustrate the application of Killing vector fields in the preser…

2014-05-30abs ↗pdf ↗

Proposes a new latent variable model for hyperspherical latent spaces.

problem Efficiently modeling heavy-tailed distributions in hyperspherical latent spaces.
method Introduces spherical Cauchy (spCauchy) latent variables and applies Möbius transformations.
result Shows spCauchy recovers vMF geometry in high-concentration limits and avoids complex evaluations.

Method detects anomalies on attributed graphs with few labeled instances.

problem Detecting anomalies on connected instances (attributed graphs) with limited labeled data.
method Embed nodes in latent space using GCNs, training to distinguish normal and anomalous nodes.
result Method outperforms existing methods on real-world attributed graph datasets.

In this paper, we give a necessarly and sufficient condition for orbits of linear isotropy representations of Riemannian symmetric spaces are biharmonic submanifolds in hyperspheres in Euclidean spaces. In particular, we obtain examples of biharmonic submanifolds in hyperspheres whose co-dimension is greater than one.

2017-04-25abs ↗pdf ↗

An affine hypersurface MM is said to admit a pointwise symmetry, if there exists a subgroup GG of Aut(TpM){\rm Aut}(T_p M) for all pMp\in M, which preserves (pointwise) the affine metric hh, the difference tensor KK and the affine shape operator SS. Here, we consider 3-dimensional indefinite affine hyperspheres, i.e. $S…

2009-10-19abs ↗pdf ↗

The paper proves a biharmonic hypersurface in a hemisphere must be a small sphere.

problem Proving a biharmonic hypersurface in a hemisphere must be a small sphere.
method Analyzing Balmuş-Montaldo-Oniciuc's conjecture in the context of hemispheres.
result A compact non-minimal biharmonic hypersurface in a hemisphere must be the small hypersphere $S^{n}\left(1/\sqrt{2} ight)$.

The two main topics of this text are as follows: Firstly, three modifications of the theorem of Beltrami will be presented for diffeomorphisms between Riemannian manifolds and a space form which preserve the geodesic circles, the geodesic hyperspheres, or the minimal surfaces, respectively. Secondly, it is defined what…

2009-12-21abs ↗pdf ↗

This paper proves the manifold hypothesis for lower embedding dimensions using osculating hyperspheres.

problem The dataset lies on a low-dimensional submanifold in high-dimensional space.
method Constructing osculating hyperspheres and applying surgery theory to embed the hypersurface.
result The manifold hypothesis holds for embedding dimensionalities up to d1d-1.

A new method uses hyperspherical latent spaces to disentangle data with periodic structures.

problem Disentangling data with periodic or cyclic underlying factors in Euclidean space.
method Diffusion Variational Autoencoder with a modified Evidence Lower Bound.
result The method can recover periodic true factors effectively.

Active Learning (AL) is a learning task that requires learners interactively query the labels of the sampled unlabeled instances to minimize the training outputs with human supervisions. In theoretical study, learners approximate the version space which covers all possible classification hypothesis into a bounded conve…

2018-07-24abs ↗pdf ↗