Geometrically, spherical 3-manifolds emerge from flat SU(2)-bundles over hyperbolic surfaces.
problem Realizing spherical 3-manifolds from flat SU(2)-bundles over hyperbolic surfaces.
method Using Gromov-Hausdorff convergence and systole maximization over moduli spaces.
result Homogeneous spherical 3-manifolds can be realized as limits of metric spaces of flat SU(2)-bundles.
In this paper we present a geometric control law for position and line-of-sight stabilization of the nonholonomic spherical robot actuated by three independent actuators. A simple configuration error function with an appropriately defined transport map is proposed to extract feedforward and proportional-derivative cont…
It has been known for a long time that the classical spherical perceptrons can be used as storage memories. Seminal work of Gardner, \cite{Gar88}, started an analytical study of perceptrons storage abilities. Many of the Gardner's predictions obtained through statistical mechanics tools have been rigorously justified. …
A new method using spherical harmonics approximates the Sliced-Wasserstein distance.
problem Approximating the Sliced-Wasserstein distance between probability measures.
method Spherical Harmonics Control Variates (SHCV) method for Monte Carlo approximation of the SW distance.
result SHCV method provides an improved rate of convergence compared to Monte Carlo for general measures.
Paper proposes SMFN for high-res spherical video super-resolution.
problem Super-resolution of 360-degree panoramic videos is expensive and challenging.
method Deformable convolutions, mixed attention mechanism, dual learning strategy, weighted mean square error loss function.
result The proposed SMFN method improves super-resolution of equatorial regions in 360-degree videos.
For spherically symmetric distributions, efficient quantisation can be achieved with moderate sample sizes.
problem Optimal quantisation in high dimensions requires large sample sizes, making it impractical.
method Uniformly distributed random quantisers on a sphere of suitable radius achieve exceptional performance.
result For moderate sample sizes, quantisation error can be efficiently computed and approximated.
Estimates shared linear subspace from noisy data with multiple users.
problem Recovering shared linear subspace from noisy data with non-isotropic noise.
method Estimates shared subspace using at least two data points per user, avoiding restrictive assumptions.
result Upper and lower bounds for estimation error match, showing no additional error due to noise irregularity.
New Fourier features improve high-precision approximation in large-scale problems.
problem Designing scalable, high-precision Fourier features for large-scale kernel methods.
method Introducing a new family of quadrature rules that accurately approximate the Gaussian measure in higher dimensions.
result Improved approximation bounds with new Fourier features.
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.
The paper examines curvature and stability in quasi-geostrophic motions using spherical harmonics.
problem Analyzing the curvature and stability of quasi-geostrophic motions.
method Utilizing spherical harmonics and structure constants, the curvature of the L2 metric on the central extension is computed. result A lower bound for weather prediction error in a simplified model is suggested.
Non-asymptotic tail bounds for Kostlan-Shub-Smale field on sphere
problem Estimating rank-R symmetric signal tensor from Gaussian observation
method Profile maximum likelihood estimator
result Finite-(k,d) error bound recovers asymptotically optimal rate
Uniform bounds for neural networks' generalization error in overparameterized settings.
problem Generalization error in overparameterized neural networks.
method Neural Tangent kernel theory and Mercer decomposition of the NT kernel in spherical harmonics.
result Uniform generalization bounds for overparameterized neural networks in RKHS.
New tests for identifying the number of latent factors in short panels with small time dimensions.
problem Determining the number of latent factors in short panels with small time dimensions.
method Eigenvalue tests based on variance-covariance matrices of asset returns, with assumptions on spherical errors or instrumental variables for factor betas.
result Established asymptotic distributional results and proposed a novel statistical test for weak factors.
Gradient descent fails to learn simple neural networks efficiently.
problem Learning one-layer neural networks efficiently using gradient descent.
method Gradient descent and statistical query algorithms.
result Superpolynomial lower bounds for learning one-layer neural networks.
Develops efficient algorithms for learning latent-variable models using implicit moment tensor computation.
problem Learning latent-variable models with moment tensors of super-constant degree.
method Implicit moment tensor computation for general models, extending previous work on clustering mixtures of spherical Gaussians.
result First poly(d, k) time learning algorithms for various models including mixtures of linear regressions, spherical Gaussians, and positive linear combinations of non-linear activations.
The paper projects unknown manifolds onto hyperspheres for efficient function approximation.
problem Function approximation from data on unknown manifolds with added errors.
method Projects unknown manifold onto hypersphere and uses localized spherical polynomial kernels.
result Optimal rates of approximation for rough functions are given.
Proposes a new sparse recovery method using generalized error function.
problem Sparse recovery in signal processing and imaging.
method Introduces a penalty function with shape and scale parameters for sparse recovery.
result The method improves MRI reconstruction and is theoretically sound.
Paper introduces spherical knot mosaics for knot and link invariants.
problem Representing knots on a sphere with tiles.
method Tiling a 2-sphere with 11 knot mosaic tiles to define new invariants.
result New knot invariants derived from spherical mosaic tiling.
New method solves PDEs on spheres using physics-informed convolutional neural networks.
problem Solving PDEs on surfaces, especially spheres, with high accuracy and efficiency.
method Physics-informed convolutional neural networks (PICNN) with theoretical analysis and approximation results.
result Established fast convergence rates for PICNN solving PDEs on spheres.
Study geodesics on spherical polyhedra, estimating their number.
problem Counting simple closed geodesics on spherical polyhedra.
method Examined regular spherical octahedra, cubes, and tetrahedra.
result Estimated the number of simple closed geodesics on spherical polyhedra.
We describe convolutional networks using harmonic functions.
problem Understanding the function space and smoothness of convolutional networks.
method Using reproducing kernel Hilbert spaces and functional ANOVA decomposition.
result Convolutional networks can be decomposed into a sum of elementary functions.
The abstract proves spherical surface decompositions with conical singularities.
problem Decomposing surfaces with spherical metrics and conical singularities.
method Geometric triangulations and irreducible components of standard shapes.
result Spherical polygons, including half-spherical concave polygons, can be arbitrarily complicated.
For the n-dimensional spherical pedal curve pedγ,P with respect to an n-dimensional spherical unit speed curve γ and a given point P∈Sn, we define the spherical orthotomic curve of γ relative to the point P, and classify singularities of spherical orthotomic curves.
Paper relaxes symmetry conditions for universal feature selection in noisy data.
problem Feature selection in noisy data with weak symmetry.
method Developed a universal feature selection framework using singular value decomposition of canonical dependence matrix.
result Selected features achieve asymptotically optimal error exponents up to a residual term.
Study shows how neural networks learn eigenfunctions of the NTK in underparameterized settings.
problem Understanding the dynamics of MSE optimization in underparameterized neural networks.
method Analysis of gradient flow dynamics, focusing on eigenfunctions of the NTK.
result Eigenfunctions of the NTK determine the learning dynamics in underparameterized networks.
Study spherical curves with curvature dependent on distance to a great circle.
problem Understanding spherical curves with curvature dependent on distance to a great circle.
method Introducing spherical angular momentum, characterizing known curves, finding new families, and obtaining arc length parametrizations.
result New families of spherical curves with intrinsic equations in elementary or Jacobi elliptic functions.
Study calculates eigenvalues and eigenfunctions for spherical triangles and finds fundamental gap behavior.
problem Understanding eigenvalues and gaps in spherical triangles.
method Explicit computation of Dirichlet eigenvalues and eigenfunctions for spherical lunes and triangles.
result Fundamental gap of spherical triangles increases as the angle of the lune decreases.
New findings show fundamental group is not audible in spherical space forms.
problem Isospectral spherical space forms with non-cyclic fundamental groups.
method Revisited and found new examples of spherical space forms.
result Fundamental group is not audible among spherical space forms.
Analysis of non-asymptotic estimation error and structured statistical recovery based on norm regularized regression, such as Lasso, needs to consider four aspects: the norm, the loss function, the design matrix, and the noise model. This paper presents generalizations of such estimation error analysis on all four aspe…
Existence and uniqueness of spherical helicoidal surfaces in 3-sphere via spherical curves.
problem Existence and uniqueness of spherical helicoidal surfaces in 3-sphere.
method Continuous function of distance to axis, spherical angular momentum of spherical curves.
result Existence and uniqueness theorem for spherical helicoidal surfaces in 3-sphere.
The reductivity of a spherical curve represents how reduced the spherical curve is. It is unknown if there exists a spherical curve whose reductivity is four. In this paper we give an unavoidable set for spherical curves with reductivity four by considering 4-gons.
The paper improves inequalities for nearly spherical sets using quermassintegrals.
problem Improving inequalities for nearly spherical sets.
method Establishing quantitative Alexandrov-Fenchel inequalities for quermassintegrals.
result Lower bounds on the (k,m)-isoperimetric deficit found using spherical deviation and asymmetry. The reductivity of a spherical curve is the minimal number of a local transformation called an inverse-half-twisted splice required to obtain a reducible spherical curve from the spherical curve. It is unknown if there exists a spherical curve whose reductivity is four. In this paper, an unavoidable set of configuratio…
We show that we can obtain a reducible spherical curve from any non-trivial spherical curve by four or less inverse-half-twisted splices, i.e., the reductivity, which represents how reduced a spherical curve is, is four or less. We also discuss unavoidable sets of tangles for spherical curves.
The paper classifies Landsberg spherically symmetric Finsler metrics in various dimensions.
problem Investigating compatibility conditions on spherically symmetric Finsler metrics.
method Using the inverse problem of calculus of variations, the paper focuses on Landsberg and Berwald types.
result All Landsberg spherically symmetric manifolds in higher dimensions are either Riemannian or have specific geodesic spray formulas.
For a convex body on the Euclidean unit sphere the spherical convex floating body is introduced. The asymptotic behavior of the volume difference of a spherical convex body and its spherical floating body is investigated. This gives rise to a new spherical area measure, the floating area. Remarkably, this floating area…
Study on spherical CR manifolds with non-trivial Chern classes.
problem Understanding Chern classes in spherical CR manifolds.
method Construction and proof of constraints on Chern classes.
result Topological obstruction to spherical CR structures on contact manifolds.
PGF kernels analyze spherical data using generalized RBF kernels.
problem Analysis of spherical data.
method Introduced PGF kernels and a semi-parametric learning algorithm.
result PGF kernels generalize RBF kernels for spherical data.
The paper examines properties of spherical Finsler metrics, proving their semi-C-reducibility and conditions for vanishing mean stretch curvature.
problem Analyzing curvature properties of spherical Finsler metrics.
method Proving semi-C-reducibility and finding conditions for vanishing mean stretch curvature.
result Conditions for a general spherically symmetric Finsler metric to have vanishing mean stretch curvature.
Classifies involutions on spherical 3-manifolds.
problem Classifying involutions on spherical 3-manifolds.
method Geometric approach to conjugacy classification.
result Insights into topological properties of involutions.
The paper classifies spherically symmetric Finsler metrics as Berwaldian or Riemannian.
problem Classifying spherically symmetric Finsler metrics.
method Proving all spherically symmetric Landsberg surfaces are Berwaldian and modifying the classification of spherically symmetric Finsler metrics.
result All Berwald spherically symmetric metrics of dimension n≥3 are Riemannian or given by a specific formula. Paper develops invariants for spherical curves using chord diagrams.
problem Developing invariants for spherical curves under local moves.
method Using based chord diagrams and local moves from Reidemeister moves.
result Invariants include both classical and new spherical curve invariants.
In this paper we consider the spherical slant helices in R3. More- over, we show how could be obtained to a spherical slant helix and we give some spherical slant helix examples in Euclidean 3-space.
The paper characterizes spherically symmetric metrics with scalar curvature.
problem Characterizing spherically symmetric metrics with scalar curvature.
method Established a curvature compatibility condition on spherically symmetric Finsler metrics and constructed a Berwald frame.
result Characterized spherically symmetric metrics with scalar curvature.
The study proves spherical polygon analogs of curve theorems, finding bounds on intersections and inflections.
problem Finding bounds on intersections and inflections for spherical polygons.
method Adapting smooth curve theorems to spherical polygons using discrete tools.
result Proves discrete analogs of four-vertex theorems for spherical polygons.
New formula for spherical polygon area via prequantization.
problem Traditional area formula for spherical polygons requires measuring angles.
method Uses prequantization to create a new formula that doesn't require angle measurement.
result New formula applicable to a wider range of degenerate curves and polygons.
Euler explored spherical geometry using trigonometric formulae and solid geometry methods.
problem Developing trigonometric formulae for spherical geometry.
method Used calculus of variations and classical solid geometry methods.
result Established trigonometric formulae and computed spherical triangle areas.
A spherical polyhedron surface is a triangulated surface obtained by isometric gluing of spherical triangles. For instance, the boundary of a generic convex polytope in the 3-sphere is a spherical polyhedron surface. This paper investigates these surfaces from the point of view of inner angles. A rigidity result is obt…