HSSE framework embeds single-cell RNA-seq data at multiple scales.
problem Capturing heterogeneous local structure in single-cell RNA-seq data.
method Hierarchical sheaf spectral embedding (HSSE) framework.
result HSSE achieves competitive or improved performance in single-cell RNA-seq data representation learning.
PolyNSD improves Neural Sheaf Diffusion with polynomial operators and spectral rescaling.
problem Limitations of common Neural Sheaf Diffusion implementations, including scalability and stability issues.
method Introduces Polynomial Neural Sheaf Diffusion (PolyNSD) with a degree-K polynomial propagation operator and spectral rescaling.
result PolyNSD achieves state-of-the-art results on both homophilic and heterophilic benchmarks with reduced runtime and memory requirements.
This paper is based on the paper "Locally free sheaves on complex supermanifolds" of A.L.Onishchik, E.G. Vishnyakova, where two classification theorems for locally free sheaves on supermanifolds were proved and a spectral sequence for a locally free sheaf of modules E was obtained. We consider another filtration of the…
A new framework for knowledge graph embedding using sheaves.
problem Learning representations for entities and relations in knowledge graphs.
method Using cellular sheaves to describe knowledge graph embeddings with consistency constraints.
result A generalized framework for reasoning about knowledge graph embedding models.
This review explores TDA and TDL beyond persistent homology.
problem Limitations of persistent homology in capturing topological invariants and homotopic evolution.
method Spectral representations, sheaf theory, Mayer topology, interaction topology, differential topology, geometric topology.
result Review of topological tools for various data types.
Spectro-Riemannian Graph Neural Networks integrate spectral and curvature signals for better graph representation learning.
problem Enhance graph representation learning by leveraging spectral and curvature signals.
method Proposes Spectro-Riemannian Graph Neural Networks (CUSP) that combines spectral and curvature insights.
result Empirical evaluation shows CUSP outperforms state-of-the-art models by up to 5.3%.
An important part of the classical theory of real or complex manifolds is the theory of (smooth, real analytic or complex analytic) vector bundles. With any vector bundle over a manifold (M,F) the sheaf of its (smooth, real analytic or complex analytic) sections is associated which is a locally free sheaf of F-modules,…
We study the cohomology theory of sheaf complexes for open embeddings of topological spaces and related subjects. The theory is situated in the intersection of the general Cech theory and the theory of derived categories. That is to say, on the one hand the cohomology is described as the relative cohomology of the sect…
We construct a spectral sequence associated to a stratified space, which computes the compactly supported cohomology groups of an open stratum in terms of the compactly supported cohomology groups of closed strata and the reduced cohomology groups of the poset of strata. Several familiar spectral sequences arise as spe…
On a Weinstein manifold, we define a constructible co/sheaf of categories on the skeleton. The construction works with arbitrary coefficients, and depends only on the homotopy class of a section of the Lagrangian Grassmannian of the stable symplectic normal bundle. The definition is as follows. Take any, possibly high …
Unified framework for hyperbolic embeddings from mixed data types.
problem Computing hyperbolic embeddings from noisy metric and non-metric data.
method Semidefinite programming and spectral factorization methods.
result Efficient computation of hyperbolic embeddings from arbitrary data.
A new convolutional spectral kernel network learns hierarchical and local features.
problem Lack of deep learning in non-stationary spectral kernels.
method Introduces convolutional filters and deep architectures into non-stationary spectral kernels, derives generalization error bounds, and introduces regularizers.
result Validated the effectiveness of the convolutional spectral kernel network on real-world datasets.
Nonparametric models are versatile, albeit computationally expensive, tool for modeling mixture models. In this paper, we introduce spectral methods for the two most popular nonparametric models: the Indian Buffet Process (IBP) and the Hierarchical Dirichlet Process (HDP). We show that using spectral methods for the in…
Functor connects sheaves on Lagrangian cobordisms, proving equivalence and action decreasing properties.
problem Understanding sheaf equivalences and actions on Lagrangian cobordisms.
method Analyzing sheaf quantizations and Legendrian lifts, proving functorial properties.
result Lagrangian cobordism functor is action decreasing and Morita equivalent to sheaf categories of Legendrians.
Proposes cone embedding for better graph hierarchical structure representation.
problem Lack of natural and interpretable hierarchical indicators in graph embeddings.
method Metric cone embedding method to capture hierarchical structure.
result Extracts hierarchical structure from other graph embedding outputs.
Let Λ be a Legendrian in the jet space of some manifold X. To a generating family presentation of Λ, we associate a constructible sheaf on X×R whose singular support at infinity is Λ, and such that the generating family homology is canonically isomorphic to the endomorphism algebra of this she…
Study homology manifolds using spectral sheaves and spectral six functor formalism.
problem Characterize and understand homology manifolds through spectral sheaves.
method Adapt six functor formalism to spectral sheaves on locally compact Hausdorff spaces.
result Prove that compact ANR homology manifolds are Poincaré duality complexes.
Improves hierarchical clustering in Euclidean space using autoencoders.
problem Lack of unsupervised methods for learning hierarchical structure in Euclidean space.
method Variational autoencoder with Gaussian mixture prior, rescaling latent space, and Ward's linkage.
result Improved dendrogram purity and Moseley-Wang cost function results.
Proposes a hierarchical clustering method for positive and negative dissimilarities.
problem Clustering dissimilarities, especially positive and negative.
method Hierarchical correlation clustering followed by tree preserving embedding.
result Performance on various datasets.
New algorithm B++&C improves hierarchical clustering on large deep embedding datasets.
problem Scaling up hierarchical clustering to massive datasets of deep embeddings.
method Proposes B++&C algorithm for practical hierarchical clustering, introduces B2SAT&C for theoretical approximation.
result Achieves 5%/20% improvement on MW/CKMM objectives compared to classic methods.
Study Higgs bundles on curves with punctures, extending spectral correspondence.
problem Classify Higgs bundles on punctured curves with logarithmic structures.
method Logarithmic Hecke compactification, spectral conditions, and sheaf classification.
result Logarithmic spectral correspondence extended to punctured curves.
Proves h-principle for loose Legendrian embeddings in contact topology.
problem Existence of non-loose Legendrian embeddings.
method h-principle from microlocal sheaf theory.
result Existence of non-loose Legendrian embeddings.
Sharp theory of neural network scaling laws for hierarchical targets.
problem Learning hierarchical multi-index models in neural networks.
method Sharp information-theoretic scaling laws derived for two-layer neural networks.
result Optimal rates achieved by a simple spectral estimator.
New framework tracks communities in dynamic networks.
problem Discovering and tracking communities in evolving networks.
method Spectral framework on Grassmann manifold for subspace tracking.
result Improved dynamic community detection results across various network types.
Survey on spectral embeddings for data analysis.
problem None explicitly stated in the abstract.
method Presentation of spectral embeddings from Riemannian geometry to data analysis.
result Survey of spectral embeddings and their applications.
The joint optimization of representation learning and clustering in the embedding space has experienced a breakthrough in recent years. In spite of the advance, clustering with representation learning has been limited to flat-level categories, which often involves cohesive clustering with a focus on instance relations.…
Deep learning explained through spectral filtering of hierarchical features.
problem Understanding how deep neural networks learn useful representations from data.
method Neural Low-Degree Filtering (Neural LoFi) as a stylized limit of gradient-based training.
result Predicts how representations are selected layer by layer and explains emergence of concepts.
Developed a theory of ultradifferentiable sheafs with applications.
problem Ultradifferentiable functions and their sheafs.
method Abstract theory development for ultradifferentiable sheafs.
result Applications to linear PDEs, differential geometry, and CR geometry.
This paper proposes a spectral clustering algorithm for hyperbolic spaces, improving efficiency over Euclidean methods.
problem Inefficient clustering in Euclidean spaces for complex data structures.
method Developed a spectral clustering algorithm using hyperbolic similarity matrices.
result The algorithm converges at least as fast as Euclidean spectral clustering and performs better on complex datasets.
This paper converts NACE classification into embeddings to preserve hierarchical structure.
problem Preserving hierarchical structure in NACE classification while reducing dimensions.
method Custom metrics for hierarchical structure retention; state-of-the-art models and dimensionality reduction.
result The proposed approach effectively preserves hierarchical structures in NACE classification.
This work improves KG embeddings by integrating hyperbolic and attention mechanisms.
problem Preserving hierarchical and logical patterns in KGs with low-dimensional embeddings.
method Combines hyperbolic reflections/rotations with attention mechanisms to capture complex relational patterns.
result Improves MRR by up to 6.1% on standard benchmarks and new state-of-the-art results in high dimensions.
In the framework of Abstract Differential Geometry, we show that to a given principal sheaf and a representation of its stuctural sheaf in An, where A is a sheaf of associative, commutative, unital algebras (over R or C), we associate a vector sheaf. Moreover, under some natural assumptions on the compatibility of t…
Spectral embedding improves with edge weight transformations.
problem Improving spectral embedding for weighted networks.
method Analyzed edge weight transformations for spectral embedding quality.
result Transformations like tempering or thresholding can significantly enhance spectral embedding.
Estimates spectral projections restricted to uniformly embedded submanifolds.
problem Estimating spectral projections on submanifolds of manifolds with nonpositive curvature.
method Estimates the L2(M)oLq(Σ) norm of spectral projection operators. result Sharp spectral projection estimates for small spectral windows.
For graphs generated from stochastic blockmodels, adjacency spectral embedding is asymptotically consistent. Further, adjacency spectral embedding composed with universally consistent classifiers is universally consistent to achieve the Bayes error. However when the graph contains private or sensitive information, trea…
Improved spectral clustering algorithm for better performance.
problem Improving the performance of spectral clustering algorithms.
method Developed a new performance guarantee under a weaker assumption and evaluated using a different spectral embedding map.
result Better performance guarantee under a weaker assumption and evaluation of a new spectral embedding map.
Reduces high granularity and dimensionality in hierarchical categorical variables.
problem Overfitting and estimation issues in predictive models due to high granularity and dimensionality.
method Entity embedding and top-down clustering algorithm to reduce granularity and dimensionality.
result The reduced hierarchy improves model fit and complexity balance.
Root Laplacian Eigenmaps help in spectral embedding of graphs.
problem Efficient spectral embedding of graphs.
method Square root of graph-Laplacian operator.
result Improved spectral embedding techniques.
Representation learning has become an invaluable approach for learning from symbolic data such as text and graphs. However, while complex symbolic datasets often exhibit a latent hierarchical structure, state-of-the-art methods typically learn embeddings in Euclidean vector spaces, which do not account for this propert…
Functor connects sheaf categories of Legendrian submanifolds.
problem Connecting sheaf categories of Legendrian submanifolds.
method Constructs a functor between sheaf categories using Nadler-Shende's work.
result Provides a sheaf theory description of Lagrangian cobordism.
Introduces sheaf quantization, a topological approach to geometric quantization.
problem Topological realization of WKB-states in geometric quantization.
method Enhancement of constructible sheaves, Betti counterpart of Fukaya--Floer theory.
result Introduction to sheaf quantization as a topological realization of WKB-states.
Regularization improves spectral embedding by focusing on the largest blocks.
problem Improving the quality of spectral embedding for graph data.
method Explained the impact of complete graph regularization on spectral embedding of a block model.
result Regularization forces spectral embedding to focus on the largest blocks, making it less sensitive to noise or outliers.
We learn hierarchical slate representations for collaborative filtering.
problem Building models for recommendation systems with hierarchical slates.
method Learning low-dimensional embeddings of hierarchical slates using recursive composition rules.
result Improved recommendation system performance on a real-world dataset.
A new drug embedding method using hierarchical drug relations and chemical structures.
problem Learning accurate drug representations from chemical structures and hierarchies.
method Semi-supervised drug embedding using VAE in hyperbolic space.
result The method accurately places drugs in a hierarchy and predicts side-effects.
Enhances image classification by integrating semantic hierarchy into CNN models.
problem Limited use of external guidance in image classification.
method Integrates label-hierarchy knowledge into CNN-based classifiers and uses order-preserving embeddings.
result Boosts image classification performance through semantic hierarchy integration.
Sheaf Neural Networks improve graph learning with geometric insights.
problem Graph heterophily and over-smoothing issues.
method Inspired by Riemannian geometry, computes sheaves using orthogonal maps.
result Achieves promising results with reduced computational overhead.
Unsupervised method learns hierarchical graph representations without labels.
problem Lack of hierarchical graph representations and need for labeled data in GNNs.
method Maximizes mutual information between local and global graph representations.
result Comparable performance to supervised methods on graph classification benchmarks.
A novel unsupervised domain adaptation method using hierarchical optimal transport.
problem Unsupervised domain adaptation between source and target domains.
method Hierarchical optimal transport, leveraging class labels for structure formation in the source domain and learning probability measures in the target domain.
result The proposed HOT-DA method outperforms state-of-the-art approaches on various datasets.