Graph-based methods are known to be successful in many machine learning and pattern classification tasks. These methods consider semi-structured data as graphs where nodes correspond to primitives (parts, interest points, segments, etc.) and edges characterize the relationships between these primitives. However, these …
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,051 papers · 148 categories
Trend · papers per month
48 results for “Stochastic Graphlet Embedding”
Enhances graph-based pattern recognition by preserving structural information.
problem Loss of structural information in graph embedding.
method Hierarchical structure construction and Stochastic Graphlet Embedding (SGE).
result Improved graph representation with robustness.
CNN estimates graphlet counts efficiently from historic graphs.
problem Difficulty in computing exact graphlet counts due to exponential growth.
method Convolutional Neural Network (CNN) framework with preprocessing techniques.
result Substantial speedup and high accuracy in estimating graphlet counts.
Exploratory analysis over network data is often limited by the ability to efficiently calculate graph statistics, which can provide a model-free understanding of the macroscopic properties of a network. We introduce a framework for estimating the graphlet count---the number of occurrences of a small subgraph motif (e.g…
From social science to biology, numerous applications often rely on graphlets for intuitive and meaningful characterization of networks at both the global macro-level as well as the local micro-level. While graphlets have witnessed a tremendous success and impact in a variety of domains, there has yet to be a fast and …
Graphlets are induced subgraphs of a large network and are important for understanding and modeling complex networks. Despite their practical importance, graphlets have been severely limited to applications and domains with relatively small graphs. Most previous work has focused on exact algorithms, however, it is ofte…
Improved protein structure classification using weighted graphlets and deep neural networks.
problem Protein structure classification for function prediction.
method Developed a weighted network and graphlet-based measure, combined with a deep neural network.
result Significantly improved performance on 36 real datasets compared to existing methods.
GoT-WAVE improves temporal network alignment by 25% accuracy and 64% speed.
problem Finding conserved network regions in temporal networks.
method Using graphlet-orbit transitions (GoTs) as a dynamic node similarity measure within DynaWAVE.
result GoT-WAVE outperforms DynaWAVE in accuracy and speed on synthetic networks.
A faster graph kernel using optical random features.
problem High computation cost of graphlet kernel due to isomorphism test.
method Kernel random features, optical random features, mean kernel metric.
result The proposed method is orders of magnitude faster with similar or better accuracy.
GraphMoE generates random graphs using neural networks and graphlets.
problem Learning generative models for random graphs.
method GraphMoE uses a neural network trained with graphlets and subgraph counts to match the distribution of random graphs.
result GraphMoE can generate graphs that mimic various real-world datasets and fool graph classifiers.
Massively parallel architectures such as the GPU are becoming increasingly important due to the recent proliferation of data. In this paper, we propose a key class of hybrid parallel graphlet algorithms that leverages multiple CPUs and GPUs simultaneously for computing k-vertex induced subgraph statistics (called graph…
This paper introduces a novel graph-analytic approach for detecting anomalies in network flow data called GraphPrints. Building on foundational network-mining techniques, our method represents time slices of traffic as a graph, then counts graphlets -- small induced subgraphs that describe local topology. By performing…
Repelling Random Walksstat.ML
Repelling random walks improve graph-based sampling efficiency.
problem Efficient graph-based sampling and statistical estimation.
method Induces correlations between trajectories of an ensemble of walkers on a graph, maintaining unbiasedness.
result Improves concentration of statistical estimators on graphs.
GNNS uses graph neural networks to efficiently estimate subgraph frequency distributions.
problem Efficiently calculating subgraph frequency distributions in large networks.
method Graph Neural Networks (GNNS) for sampling and estimating subgraph frequencies.
result GNNS achieves comparable accuracy with a significant speedup of three orders of magnitude.
Experimental determination of protein function is resource-consuming. As an alternative, computational prediction of protein function has received attention. In this context, protein structural classification (PSC) can help, by allowing for determining structural classes of currently unclassified proteins based on thei…
Consider a linear regression model where the design matrix X has n rows and p columns. We assume (a) p is much large than n, (b) the coefficient vector beta is sparse in the sense that only a small fraction of its coordinates is nonzero, and (c) the Gram matrix G = X'X is sparse in the sense that each row has relativel…
Previous work in network analysis has focused on modeling the mixed-memberships of node roles in the graph, but not the roles of edges. We introduce the edge role discovery problem and present a generalizable framework for learning and extracting edge roles from arbitrary graphs automatically. Furthermore, while existi…
Proposes a privacy-preserving method for graph embedding.
problem Privacy leakage in adjacency spectral embedding for stochastic blockmodels.
method Differentially private adjacency spectral embedding algorithm for stochastic blockmodels.
result Estimates latent positions close to those by non-private embedding, maintaining accuracy at desired privacy levels.
Generative LLE modifies LLE to generate stochastic embeddings.
problem Nonlinear dimensionality reduction and manifold learning.
method Generative LLE modifies LLE by using stochastic linear reconstruction.
result Generative LLE can generate various LLE embeddings stochastically.
Proposes SSE, a data-driven method to regularize embedding layers in neural nets.
problem Reduces overfitting in embedding layers of neural nets.
method Stochastically shares embeddings during SGD, integrating with existing algorithms.
result Improves generalization on various tasks, including recommender systems and natural language models.
A new method embeds sparse stochastic graphs into low dimensions.
problem Embedding large, sparse, stochastic graphs into low-dimensional spaces.
method Spaceland Embedding (SG-t-SNE) inspired by t-SNE, leveraging modern computing techniques.
result Effective embedding results on synthetic and real-world graphs.
Vertex clustering in a stochastic blockmodel graph has wide applicability and has been the subject of extensive research. In thispaper, we provide a short proof that the adjacency spectral embedding can be used to obtain perfect clustering for the stochastic blockmodel and the degree-corrected stochastic blockmodel. We…
We propose a fast algorithm for spectral embedding using stochastic gradient descent.
problem Scalability issue in spectral embedding due to eigendecomposition bottleneck.
method Reformulate spectral embedding as a stochastic optimization problem, replacing orthogonality constraint with an orthogonalization matrix.
result Efficient algorithm based on mini-batch gradient descent that outperforms existing techniques in execution speed.
The paper studies how adding an ℓ2 penalty affects network embeddings.
problem The impact of ℓ2 regularization on network embeddings.
method Analyzes the asymptotic behavior of ℓ2 regularized node2vec embeddings under graphon theory.
result The learned embeddings asymptotically form a graphon with a nuclear-norm-type penalty.
Unified view of SOMs and SNE from a common framework.
problem Comparing and understanding SOMs and SNE.
method Unified mathematical framework, quantitative comparison on datasets.
result SOMs and SNE can be derived from a common framework.
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.
Stochastic Neighbor Embedding and its variants are widely used dimensionality reduction techniques -- despite their popularity, no theoretical results are known. We prove that the optimal SNE embedding of well-separated clusters from high dimensions to any Euclidean space R^d manages to successfully separate the cluste…
Theoretical Connection between Locally Linear Embedding, Factor Analysis, and Probabilistic PCAstat.ML
This work connects LLE, factor analysis, and probabilistic PCA through a stochastic perspective.
problem Exploring the theoretical connection between LLE, factor analysis, and probabilistic PCA.
method Solving the stochastic linear reconstruction of LLE using expectation maximization.
result LLE, factor analysis, and probabilistic PCA are shown to be connected through a stochastic perspective.
Geometric approach for unsupervised word embedding alignment.
problem Learning alignment between word embeddings of source and target languages.
method Formulates alignment as domain adaptation on the manifold of doubly stochastic matrices, employing Riemannian conjugate gradient algorithm.
result Empirically outperforms state-of-the-art methods on bilingual lexicon induction tasks.
Proposes robust graph embedding with noisy link weights.
problem Learning feature vectors from noisy link weights.
method β-graph embedding with empirical moment β-score.
result Computational tractability and local minimization of β-score.
Bayesian model estimates latent dimension and communities in graphs.
problem Automatic selection of latent dimension and number of communities in spectral embeddings.
method Bayesian model for simultaneous selection of latent dimension and number of communities.
result Promising performance in recovering latent community structure on simulated and real-world data.
Improved graph embedding through refined linear transformation and community recovery.
problem Identifying meaningful latent communities in graph data.
method Refined graph encoder embedding via linear transformation, self-training, and latent community recovery.
result Improved vertex embedding and better decision boundaries for vertex classification.
A new method estimates rare failure events in complex systems.
problem Estimating the probability of rare failure events in non-linear systems.
method Stochastic Spectral Embedding (SSE) combined with modifications for efficient rare event estimation.
result Rare failure probability decomposed into conditional probabilities for easier computation.
The paper examines node2vec embeddings for community detection in networks.
problem Theoretical understanding of node2vec embeddings for community detection.
method Analysis of node2vec embeddings for community recovery in stochastic block models.
result k-means clustering on node2vec embeddings gives weakly consistent community recovery for stochastic block models.
Proposes MR-SNE for multimodal data visualization.
problem Visualizing data from multiple domains with relations across them.
method Extends t-SNE to compute augmented relations and jointly embed them in a low-dimensional space.
result Demonstrates promising performance in visualizing Flickr and Animal with Attributes 2 datasets.
The paper tackles biases in session-based recommender systems by modeling user interest as a stochastic process.
problem Data uncertainty, popularity bias, and exposure bias in session-based recommender systems.
method The paper proposes treating user interest as a stochastic process in the latent space, debiasing item embeddings, modeling dense user interest, and introducing fake targets to simulate extended exposure.
result The proposed approach mitigates challenges in session-based recommender systems, as shown by computational experiments on various datasets.
Combines SBMs and graph neural nets for graph embeddings.
problem Discovering community structure and link prediction on graphs.
method Sparse variational autoencoder integrating SBMs and graph neural nets.
result Encouraging link prediction results with interpretable latent structure.
Dimensionality Reduction of Complex Metastable Systems via Kernel Embeddings of Transition Manifoldsmath.DS
Enhances machine learning for complex systems by embedding transition manifolds.
problem Identifying low-dimensional dynamics in high-dimensional multiscale systems.
method Kernel embeddings of transition manifolds in reproducing kernel Hilbert spaces.
result Robust and more efficient algorithm for identifying reaction coordinates.
The paper introduces new KMEs to capture stochastic process filtrations.
problem Missing filtration information in stochastic processes.
method Higher order kernel mean embeddings (KMEs) conditioned on filtrations.
result Consistent estimators and tests for filtration-sensitive information.
We describe a method for learning word embeddings with data-dependent dimensionality. Our Stochastic Dimensionality Skip-Gram (SD-SG) and Stochastic Dimensionality Continuous Bag-of-Words (SD-CBOW) are nonparametric analogs of Mikolov et al.'s (2013) well-known 'word2vec' models. Vector dimensionality is made dynamic b…
Embeds sparsity in deep neural networks, allowing exact zero parameters.
problem Learning sparse structures in deep networks.
method Embeds sparsity into neural network structure, allowing exact zero parameters during training.
result Can learn both structured and unstructured sparsity.
ULES embeds dynamic networks with stability guarantees.
problem Stability of time-varying node embeddings in evolving networks.
method Unfolded Laplacian Spectral Embedding (ULSE) using normalized Laplacian operators.
result ULES satisfies cross-sectional and longitudinal stability under dynamic stochastic block model.
Compact KD encoding reduces embedding size by 98% without sacrificing performance.
problem Overfitting and high parameter count in conventional embedding methods.
method Proposes K-way D-dimensional discrete encoding and a stochastic gradient descent optimization approach.
result Reduces embedding size by up to 98% while maintaining or improving performance.
A probabilistic method for deep embedding that improves classification accuracy and interpretability.
problem Improving classification accuracy and interpretability in deep learning.
method A probabilistic approach that treats embeddings as random variables, using a product distribution over labeled instances and marginalizing prototype proximity.
result Superior large- and open-set classification accuracy compared to state-of-the-art methods.
Inference for the stochastic blockmodel is currently of burgeoning interest in the statistical community, as well as in various application domains as diverse as social networks, citation networks, brain connectivity networks (connectomics), etc. Recent theoretical developments have shown that spectral embedding of gra…
DeepWalk embeddings converge on SBM graphs, recovering cluster structure.
problem Theoretical guarantees for DeepWalk embeddings on complex graphs.
method Solving a nonconvex optimization problem using random walks.
result DeepWalk embeddings on SBM graphs recover cluster structure with high probability.
We unify subsampling methods for network embeddings and prove their asymptotic distribution.
problem Understanding and improving the performance of network embeddings learned via subsampling.
method Unified framework for node2vec-like methods, proving asymptotic distribution under exchangeable graph assumption.
result Asymptotic distribution of learned embedding vectors decouples and provides rates of convergence.
Node2vec embeddings are unstable and unstable with parameter choices.
problem Stability and robustness of node2vec embeddings for graph classification.
method Analysis of node2vec embeddings from multiple perspectives.
result Node2vec embeddings are unstable with respect to parameter choices.