Unified deep framework for personalized recommendations with uncertainty.
problem Uncertainty in user preferences in recommendation systems.
method Gaussian embeddings, Monte-Carlo sampling, convolutional neural networks.
result Superior performance in recommendation accuracy compared to state-of-the-art models.
Kernel embeddings separate distinct probability distributions, simplifying testing.
problem Testing equality of non-atomic probability distributions.
method Kernel covariance embeddings and Gaussian measures in reproducing kernel Hilbert spaces.
result Testing for singularity between Gaussian measures is equivalent to testing for equality of non-atomic probability distributions.
Explains SNE, t-SNE, and their variants for manifold learning.
problem Dimensionality reduction and manifold learning.
method Probabilistic approach using Gaussian and Student-t distributions.
result Out-of-sample extension and acceleration methods for t-SNE.
A new method embeds data using Gaussian processes based on the heat kernel.
problem Embedding high-dimensional data in a low-dimensional space.
method Computing embeddings based on the Karhunen-Loève expansion of the heat kernel.
result The embedding approximates diffusion distances and is robust to outliers.
Gaussian kernel fails on circle and related spaces.
problem Gaussian kernel's positive definiteness on non-Euclidean spaces.
method Analyzing the Gaussian kernel on the circle and related metric spaces.
result Gaussian kernel is not positive definite on the circle or spaces admitting circle embeddings.
This paper studies clustering and embedding in high-dimensional Gaussian mixture block models.
problem Clustering and embedding in high-dimensional Gaussian mixture block models.
method Spectral clustering and embedding algorithms for graphs sampled from Gaussian mixture block models.
result Performance analysis of spectral clustering and embedding algorithms for 2-component spherical Gaussian mixtures.
FedGTEA learns new tasks in federated learning with task embeddings and alignment.
problem Federated class-incremental learning with task-specific knowledge and model uncertainty.
method Cardinality-Agnostic Task Encoder (CATE) for Gaussian task embeddings, 2-Wasserstein distance for inter-task alignment.
result FedGTEA achieves superior classification performance and mitigates forgetting.
We study the problem of isometrically embedding a two-dimensional Riemannian manifold into Euclidean three-space. It is shown that if Gaussian curvature vanishes to finite order and its zero set consists of two smooth curves tangent at a point, then local sufficiently smooth isometric embedding exists.
We study the old problem of isometrically embedding a 2-dimensional Riemannian manifold into Euclidean 3-space. It is shown that if the Gaussian curvature vanishes to finite order and its zero set consists of two Lipschitz curves intersecting transversely at a point, then local sufficiently smooth isometric embeddings …
GLACE embeds large-scale attributed graphs effectively, preserving structure and attributes.
problem Uncertainty and complexity in large-scale attributed graphs.
method Gaussian embeddings for scalable and efficient graph embedding.
result GLACE outperforms state-of-the-art methods on multiple graph analysis tasks.
Textual network embedding aims to learn low-dimensional representations of text-annotated nodes in a graph. Prior work in this area has typically focused on fixed graph structures; however, real-world networks are often dynamic. We address this challenge with a novel end-to-end node-embedding model, called Dynamic Embe…
Embeddings in machine learning are low-dimensional representations of complex input patterns, with the property that simple geometric operations like Euclidean distances and dot products can be used for classification and comparison tasks. The proposed meta-embeddings are special embeddings that live in more general in…
A novel kernel-based test detects equality versus singularity of two probability measures.
problem Detecting equality versus singularity of two probability distributions.
method Combines kernel mean and kernel covariance embeddings to construct a likelihood ratio test statistic.
result The test statistic satisfies a '0/\infty' law, vanishing under the null and diverging under the alternative.
Derives a Matern Gaussian process on hypergraphs for regression and embedding.
problem Regression and embedding of vertices in hypergraphs with uncertainty.
method Derives a Matern Gaussian process on hypergraphs, embeds vertices into latent space, identifies inducing vertices for scalable inference.
result Enables estimation of regression models with hypergraph structure informed correlation and uncertainty.
Kernel discriminant analysis uses nonlinear embeddings to improve classification.
problem Limited effectiveness of linear discriminant analysis in capturing nonlinear features.
method Study of nonlinear embeddings in kernel discriminant analysis using polynomial and Gaussian kernels, solving generalized eigenvalue problems.
result Polynomial and Gaussian discriminants capture class differences through population moments and randomized projections.
Small neural networks embed arbitrary metric spaces into Gaussian mixtures.
problem Embedding arbitrary metric spaces into a fixed space with low distortion.
method Probabilistic transformers of small depth and width.
result Embeddings with low metric distortion for various metric spaces.
Proposes VCLANC for attributed network clustering using node and attribute embeddings.
problem Lack of mutual affinity exploitation between nodes and attributes in graph convolution.
method Dual variational auto-encoders for node and attribute embeddings, Gaussian mixture model priors, mutual distance and clustering assignment hardening losses.
result Demonstrates effectiveness on real-world attributed network datasets.
Paper introduces a new distance measure for Gaussian Mixture Models.
problem Developing a new distance measure for Gaussian Mixture Models.
method Embedding K-component Gaussian Mixture Models into the manifold of symmetric positive definite matrices and calculating a lower bound for the Fisher-Rao metric.
result Demonstrated effectiveness through experiments on standard datasets.
Proposes using entity embedding vectors to improve Gaussian Process models for knowledge transfer across cell lines.
problem Lack of reuse of experimental data for predicting novel processes.
method Hybrid Gaussian Process models with entity embedding vectors to represent product identity.
result Improved performance in predicting novel processes compared to traditional methods.
SA-REMBO adapts to nonstationary high-dimensional optimization.
problem Bayesian Optimization in high-dimensional spaces is limited by the curse of dimensionality and rigidity of global assumptions.
method SA-REMBO uses multiple random Gaussian embeddings and an index variable to adaptively select the best embedding for the optimization problem.
result SA-REMBO outperforms traditional REMBO and other low-rank BO methods across synthetic and real-world benchmarks.
This paper provides an algorithm for simulating improper (or noncircular) complex-valued stationary Gaussian processes. The technique utilizes recently developed methods for multivariate Gaussian processes from the circulant embedding literature. The method can be performed in O(nlog2n) operations, where…
An explicit global and unique isometric embedding into hyperbolic 3-space, H^3, of an axi-symmetric 2-surface with Gaussian curvature bounded below is given. In particular, this allows the embedding into H^3 of surfaces of revolution having negative, but finite, Gaussian curvature at smooth fixed points of the U(1) iso…
We introduce Gaussian Process Topic Models (GPTMs), a new family of topic models which can leverage a kernel among documents while extracting correlated topics. GPTMs can be considered a systematic generalization of the Correlated Topic Models (CTMs) using ideas from Gaussian Process (GP) based embedding. Since GPTMs w…
The paper addresses data uncertainty in graph embedding by modeling data points as Gaussian distributions.
problem Data uncertainty in machine learning pipelines leads to misleading embeddings and lower accuracy.
method The paper proposes modeling data uncertainty using Gaussian distributions and reformulates graph embedding techniques.
result The proposed methods improve the accuracy of graph embedding by accounting for data uncertainty.
The Information Bottleneck (IB) is a conceptual method for extracting the most compact, yet informative, representation of a set of variables, with respect to the target. It generalizes the notion of minimal sufficient statistics from classical parametric statistics to a broader information-theoretic sense. The IB curv…
New algorithm reduces sketching dimension to effective problem size.
problem Solving L2-regularized least-squares problems efficiently.
method Randomized algorithm using Gaussian and SRHT embeddings.
result Preserves convergence guarantees with reduced embedding dimension.
This paper concerns the global theory of properly embedded spacelike surfaces in three-dimensional Minkowski space in relation to their Gaussian curvature. We prove that every regular domain which is not a wedge is uniquely foliated by properly embedded convex surfaces of constant Gaussian curvature. This is a conseque…
Develops a rigorous theory for conditional mean embeddings.
problem Efficient conditioning of probability distributions in RKHSs.
method Mathematical theory for both centred and uncentred covariance operators.
result Significantly weakens conditions for applicability of CMEs.
Word embeddings provide point representations of words containing useful semantic information. We introduce multimodal word distributions formed from Gaussian mixtures, for multiple word meanings, entailment, and rich uncertainty information. To learn these distributions, we propose an energy-based max-margin objective…
A new deep clustering model learns both clustering and embedding simultaneously.
problem Optimizing autoencoders for clustering and embedding separately.
method Integrating clustering module into a deep autoencoder.
result Joint learning of clustering and embedding improves performance.
GMVAE improves clustering in molecular simulations data.
problem Clustering metastable states in multi-basin free-energy landscapes.
method Gaussian mixture variational autoencoder (GMVAE) for dimensionality reduction and clustering.
result Enhanced clustering of metastable states compared to standard VAEs.
Expected centre of mass for random embeddings is constant.
problem Understanding the expected centre of mass for random embeddings.
method Analyzing the Haar measure and Gaussian unitary ensemble on SL(N, C).
result The expectation of the centre of mass is a constant multiple of the identity matrix.
We propose a novel architecture for k-shot classification on the Omniglot dataset. Building on prototypical networks, we extend their architecture to what we call Gaussian prototypical networks. Prototypical networks learn a map between images and embedding vectors, and use their clustering for classification. In our…
Learning word representations has garnered greater attention in the recent past due to its diverse text applications. Word embeddings encapsulate the syntactic and semantic regularities of sentences. Modelling word embedding as multi-sense gaussian mixture distributions, will additionally capture uncertainty and polyse…
The paper corrects for node degree in spectral clustering using random walk Laplacian.
problem Node degree heterogeneity in spectral clustering.
method Graph spectral embedding using the random walk Laplacian.
result The embedding provides uniformly consistent estimates of degree-corrected latent positions.
The paper proves lower bounds for Gaussian-weighted curvature integrals of self-shrinkers.
problem Proving lower bounds for Gaussian-weighted \(L^2\)-curvature integrals of self-shrinkers.
method Combining normal coordinate functions with weighted Poincaré inequalities and first-eigenvalue estimates.
result Explicit lower bounds in terms of entropy for closed self-shrinkers, leading to curvature gaps.
Enhances topic models to better handle polysemous words.
problem Lack of polysemy handling in Gaussian latent Dirichlet allocation.
method Introduces a hierarchical structure to capture polysemy in Gaussian latent Dirichlet allocation.
result Significantly improves polysemy detection and provides more parsimonious topic representations.
We consider two natural problems arising in geometry which are equivalent to the local solvability of specific equations of Monge-Ampere type. These two problems are: the local isometric embedding problem for two-dimensional Riemannian manifolds, and the problem of locally prescribed Gaussian curvature for surfaces in …
The success of machine learning methods heavily relies on having an appropriate representation for data at hand. Traditionally, machine learning approaches relied on user-defined heuristics to extract features encoding structural information about data. However, recently there has been a surge in approaches that learn …
Develops a scalable multi-task Gaussian process with neural embedding for improved performance.
problem High model complexity and limited model capability in multi-task Gaussian processes.
method Neural embedding of coregionalization, advanced variational inference, sparse approximation.
result Higher prediction quality and better generalization of the NSVLMC model.
Gaussian equivalence fails for simple polynomial embeddings in quadratic scaling RF models.
problem Failure of Gaussian equivalence in polynomial feature embeddings under quadratic scaling.
method Introduced Conditional Gaussian Equivalent (CGE) model to capture non-Gaussian behavior.
result Correct asymptotics derived for training and test errors in CGE model.
This note provides an alternative proof of a result of Labourie. We show that the two complements of the convex core of a three dimensional quasi-fuchsian hyperbolic manifold may be foliated by embedded hypersurfaces of constant Gaussian curvature.
We show that a compact embedded minimal or constant mean curvature annulus with non-vanishing Gaussian curvature which is tangent to two spheres of same radius or tangent to a sphere and meeting a plane in constant contact angle is rotational.
The Gaussian curvature K is a fundamental geometric quantity discovered by Gauss in the case of surfaces embedded in R3. One can naturally extend the definition of the Gaussian curvature to arbitrary submanifolds of Rk so that the extrinsic interpretation of K, the Theorema Egregium and the …
The abstract finds conditions for creating curves of constant curvature.
problem Finding conditions for closed embedded curves of constant curvature.
method Using Almgren-Pitts min-max method for geodesic curvature.
result Closed embedded curves of any prescribed constant curvature found in S2. Bayesian optimization for high-dimensional combinatorial spaces using embeddings.
problem Optimizing expensive functions over large, complex input spaces.
method Dictionary-based ordinal embeddings for high-dimensional combinatorial structures, using Gaussian process models.
result The proposed method outperforms state-of-the-art BO methods on diverse real-world benchmarks.
The paper proves the existence of capillary geodesics on Riemannian 2-disks.
problem Existence of capillary geodesics on Riemannian 2-disks with specific conditions.
method Analytical proof and examples.
result Existence of capillary geodesics with contact angle θ ∈ (0, π/2).
Convex surfaces derived from specific Riemannian manifolds with high regularity.
problem Proving convexity of surfaces derived from Riemannian manifolds.
method Analyzing solutions to the very weak Monge-Ampère equation.
result Proved convexity of weakly regular surfaces with nonnegative intrinsic curvature.