Researchers enhance hyperspherical latent representations for higher-dimensional data.
problem Limited expressivity of hyperspherical vMF distribution in high dimensions.
method Use a product-space to extend hyperspherical parameterizations to higher dimensions.
result Improved results on image datasets compared to traditional methods.
A new distribution addresses scalability and numerical stability issues of the vMF.
problem Scalability and numerical stability issues in sampling from the von Mises-Fisher (vMF) distribution.
method Proposes the Power Spherical distribution, retaining vMF's properties but addressing its drawbacks.
result Demonstrates the stability of Power Spherical distributions and applies it to a variational auto-encoder.
A new distance metric for vMF distributions simplifies spherical data analysis.
problem Intractability of normalization constants and lack of suitable geometric metrics for comparing vMF distributions.
method Proposes a Wasserstein-like distance that decomposes vMF distribution discrepancies into angular and concentration components.
result The proposed distance metric induces a latent geometric structure on the space of non-degenerate vMF distributions.
Proposes vMF distribution for skewed elliptical distributions.
problem Skewed distributions not adequately modeled by symmetric distributions.
method Introduces von-Mises-Fisher (vMF) distribution to represent skewed elliptical distributions.
result vMF distribution provides an explicit and simple probability representation of skewed elliptical distributions.
Generative models on spheres improve discrete sequence sampling.
problem Learning generative models for discrete sequences in continuous space.
method Work on sphere Sd−1, using von Mises-Fisher distribution and radial symmetry. result Improved results on Sudoku and language modeling with vMF path.
Generative models improve angular variable simulation in high dimensions.
problem Lack of flexibility and scalability in simulating multivariate angular variables.
method Introducing generative adversarial networks, normalizing flows, and flow matching.
result Deep learning methods outperform classical parametric models in complex data structures.
SHMM models human mobility from GPS and text data, overcoming text sparsity.
problem Modeling human mobility from semantic trace data, especially addressing text sparsity.
method SHMM is a multi-modal spherical hidden Markov model that jointly models location, time, and text embeddings on a unit sphere using vMF distribution.
result SHMM outperforms state-of-the-art models in next location prediction and has lower training cost.
This paper considers statistical estimation problems where the probability distribution of the observed random variable is invariant with respect to actions of a finite topological group. It is shown that any such distribution must satisfy a restricted finite mixture representation. When specialized to the case of dist…
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.
We present a derivation of the Kullback Leibler (KL)-Divergence (also known as Relative Entropy) for the von Mises Fisher (VMF) Distribution in d-dimensions.
We treat the problem of estimation of orientation parameters whose values are invariant to transformations from a spherical symmetry group. Previous work has shown that any such group-invariant distribution must satisfy a restricted finite mixture representation, which allows the orientation parameter to be estimated u…
Improves point-cloud reconstruction by optimizing projections with self-attention.
problem Inefficient and non-metric projection methods for sliced Wasserstein distances.
method Proposes distributional sliced Wasserstein distance with self-attention for permutation-invariant and metric optimization.
result Self-attention amortized distributional projection optimization achieves better performance in point-cloud reconstruction.
Mixture modelling involves explaining some observed evidence using a combination of probability distributions. The crux of the problem is the inference of an optimal number of mixture components and their corresponding parameters. This paper discusses unsupervised learning of mixture models using the Bayesian Minimum M…
New autoencoder improves latent space learning by optimizing sliced Gromov-Wasserstein discrepancies.
problem Improving inner discrepancy between prior and posterior distributions in autoencoders.
method Proposed spherical sliced fused Gromov Wasserstein (SSFG) and variants (MSSFG, PSSFG) to find important directions.
result New autoencoders achieve favorable performance in latent manifold learning, image generation, and reconstruction.
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 …
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.
Although stochastic gradient descent (SGD) is a driving force behind the recent success of deep learning, our understanding of its dynamics in a high-dimensional parameter space is limited. In recent years, some researchers have used the stochasticity of minibatch gradients, or the signal-to-noise ratio, to better char…
Logsy detects anomalies in logs using a novel classification-based approach.
problem Anomaly detection in unstructured logs is challenging due to limited model generalization.
method Logsy learns log representations by distinguishing normal and anomaly logs using a classification-based approach with an attention-based encoder and hyperspherical loss function.
result Logsy improves anomaly detection performance by 0.25 in F1 score compared to previous methods.
A new probabilistic approach improves deep metric learning by considering image uncertainties and class-specific variances.
problem Proxy-based deep metric learning struggles with image uncertainties and class-specific structures.
method Introduces non-isotropic probabilistic proxy-based deep metric learning using directional von Mises-Fisher distributions.
result Improves generalization performance and competitive on standard benchmarks.