arXiv research

Unified deep framework for personalized recommendations with uncertainty.

Kernel embeddings separate distinct probability distributions, simplifying testing.

Explains SNE, t-SNE, and their variants for manifold learning.

A new method embeds data using Gaussian processes based on the heat kernel.

Gaussian kernel fails on circle and related spaces.

This paper studies clustering and embedding in high-dimensional Gaussian mixture block models.

FedGTEA learns new tasks in federated learning with task embeddings and alignment.

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 …

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.

Derives a Matern Gaussian process on hypergraphs for regression and embedding.

Kernel discriminant analysis uses nonlinear embeddings to improve classification.

Small neural networks embed arbitrary metric spaces into Gaussian mixtures.

Proposes VCLANC for attributed network clustering using node and attribute embeddings.

Paper introduces a new distance measure for Gaussian Mixture Models.

Proposes using entity embedding vectors to improve Gaussian Process models for knowledge transfer across cell lines.

SA-REMBO adapts to nonstationary high-dimensional optimization.

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 $\mathcal{O}(n\log_2 n)$ 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.

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.

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…

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…

Graph embedding methods transform high-dimensional and complex graph contents into low-dimensional representations. They are useful for a wide range of graph analysis tasks including link prediction, node classification, recommendation and visualization. Most existing approaches represent graph nodes as point vectors i…

A new deep clustering model learns both clustering and embedding simultaneously.

Expected centre of mass for random embeddings is constant.

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…

Extracting insight from the enormous quantity of data generated from molecular simulations requires the identification of a small number of collective variables whose corresponding low-dimensional free-energy landscape retains the essential features of the underlying system. Data-driven techniques provide a systematic …

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.

Topic models are widely used to discover the latent representation of a set of documents. The two canonical models are latent Dirichlet allocation, and Gaussian latent Dirichlet allocation, where the former uses multinomial distributions over words, and the latter uses multivariate Gaussian distributions over pre-train…

The paper proves lower bounds for Gaussian-weighted curvature integrals of self-shrinkers.

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.

Gaussian equivalence fails for simple polynomial embeddings in quadratic scaling RF models.

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 $\mathbb{R}^3$. One can naturally extend the definition of the Gaussian curvature to arbitrary submanifolds of $\mathbb{R}^k$ so that the extrinsic interpretation of $K$, the Theorema Egregium and the …

The abstract finds conditions for creating curves of constant curvature.

Bayesian optimization for high-dimensional combinatorial spaces using embeddings.

The paper proves the existence of capillary geodesics on Riemannian 2-disks.

Convex surfaces derived from specific Riemannian manifolds with high regularity.

This paper presents a new insight into improving the performance of Stochastic Neighbour Embedding (t-SNE) by using Isolation kernel instead of Gaussian kernel. Isolation kernel outperforms Gaussian kernel in two aspects. First, the use of Isolation kernel in t-SNE overcomes the drawback of misrepresenting some structu…