SOM-VQ tokenizes discrete models with semantic structure and navigable topology.
problem Lack of semantic structure in vector quantized representations limits interpretable human control.
method Combines vector quantization with Self-Organizing Maps to learn discrete codebooks with explicit topology.
result SOM-VQ produces more learnable token sequences and provides an explicit navigable geometry in code space.
A new framework uses an Incremental Transformer to design geopolymer mixtures efficiently.
problem Designing geopolymer mixtures with limited data and physical constraints.
method Topology-aware surrogate framework guided by Incremental Transformer.
result The design space is redundant, with fewer effective mixture regimes.
A new method for predicting uncertainties in stream networks.
problem Uncertainty quantification in spatiotemporal graphs with directional flow constraints.
method Spatio-Temporal Adaptive Conformal Inference (STACI) integrating network topology and temporal dynamics.
result STACI effectively balances prediction efficiency and coverage, outperforming existing methods.
Topology-GS improves 3D GS for better structural and feature integrity.
problem Compromised pixel-level and feature-level integrity in 3D GS.
method Incorporates Local Persistent Voronoi Interpolation (LPVI) and PersLoss based on persistent homology.
result Topology-GS outperforms existing methods in PSNR, SSIM, and LPIPS metrics.
The paper proves D-SGD's stability and generalization bound, highlighting the importance of communication topology.
problem The stability and generalization of decentralized stochastic gradient descent (D-SGD).
method Theoretical analysis of D-SGD's stability and generalization bound, considering spectral gap and communication topology.
result D-SGD's generalization bound is positively correlated with the spectral gap of the communication topology.
Topological Flow Matching: A Generative Modeling Framework for Structured Spaces
problem Handling structured spaces in generative modeling
method Introducing topological flow matching
result Captures the structure of the underlying domain while preserving desirable properties
Machine-learning (ML) algorithms or models, especially deep neural networks (DNNs), have shown significant promise in several areas. However, researchers have recently demonstrated that ML algorithms, especially DNNs, are vulnerable to adversarial examples (slightly perturbed samples that cause misclassification). The …
OpEvo automates tensor operator optimization for better efficiency.
problem Manual optimization of tensor operators is inefficient and limited.
method OpEvo uses evolutionary computation with topology-aware mutation.
result OpEvo finds optimal configurations with less effort and variance.
CF-GNN provides reliable uncertainty estimates for graph data.
problem Lack of rigorous uncertainty estimates in GNNs.
method Conformal prediction extended to graph-based models (CF-GNN).
result CF-GNN produces prediction sets with provable coverage probability.
Resource is an important constraint when deploying Deep Neural Networks (DNNs) on mobile and edge devices. Existing works commonly adopt the cell-based search approach, which limits the flexibility of network patterns in learned cell structures. Moreover, due to the topology-agnostic nature of existing works, including…
Unified framework for measuring concentration in weighted networks considering both weight distributions and network structure.
problem Traditional indices neglect the topology of relationships among network elements.
method Develops a family of topology-aware concentration indices that jointly account for weight distributions and network structure.
result The proposed indices preserve key properties and allow concentration to be evaluated across different dimensions of dependence.
Proposes TSBP for matching topological signal distributions.
problem Matching signal distributions on topological domains.
method Topological Schrödinger Bridge (TSBP) with linear topology-aware stochastic dynamics.
result Derives closed-form topological SB (TSB) for Gaussian boundary distributions.
Paper introduces a new topological loss for better convergence.
problem Optimizing topological losses for model's desired topological behavior.
method Introduces a new regularized topology-aware loss function.
result Guarantees efficient optimization of the new loss function.
With the rapid adoption of machine learning techniques for large-scale applications in science and engineering comes the convergence of two grand challenges in visualization. First, the utilization of black box models (e.g., deep neural networks) calls for advanced techniques in exploring and interpreting model behavio…
This work proposes a new neural implicit manifold model for more accurate density estimation on manifolds.
problem Current generative models struggle with representing manifolds accurately and learning densities within them.
method Proposes a neural implicit manifold model and a constrained energy-based model to learn manifold-supported distributions.
result The proposed model can learn manifold-supported distributions with complex topologies more accurately than pushforward models.
Topology-enhanced loss improves 3D object reconstruction from 2D images.
problem Challenges in reconstructing 3D objects from 2D images, especially capturing shape information.
method Integrates multi-scale topological features into the reconstruction loss using cubical complexes and optimal transport distance.
result Topology-aware loss substantially improves 3D reconstruction quality.
A scalable GP model for online uncertainty quantification over graphs.
problem Scalable uncertainty quantification over graphs with dynamic data.
method Graph-aware parametric Gaussian process model using random features and online conformal prediction.
result Improved coverage and efficient prediction sets over existing methods.
A new method for state estimation on complex networks.
problem Reconstructing latent dynamics from multivariate time-series on topological cell complexes.
method Topology-aware state space framework derived from stochastic partial differential equations, with state evolution following heat-like topological diffusion.
result The proposed method successfully recovers latent states and topological structures in real-world networks.
PERCEPT detects changes in high-dimensional data streams using topological data analysis.
problem Detecting changes in high-dimensional data streams, especially when embedded in a low-dimensional space.
method Leverages topological data analysis to learn embedded topology as a point cloud via persistence diagrams, then applies non-parametric monitoring for detecting changes.
result Demonstrates efficient detection of online changes from high-dimensional data streams.
Unified toolkit for comparing neural representations using SRTD and NTS.
problem Heuristic asymmetry and unbounded scores in existing divergences.
method Developed SRTD and NTS to address these issues.
result Unified, robust, and scale-invariant metric for comparing neural representations.
Graph Substructure Networks (GSN) improves GNN expressivity by counting subgraph isomorphisms.
problem Limited expressivity of GNNs in detecting and counting graph substructures.
method Topologically-aware message passing scheme based on substructure encoding.
result GSN is strictly more expressive than the Weisfeiler-Leman (WL) test and can disambiguate even hard graph isomorphism instances.
Constructing VAE Latent Spaces with Prescribed Topology
problem Resolving topological mismatch in VAEs for non-Euclidean data
method A constructive framework for product covering spaces
result Topology-aware latent representations with closed-form KL divergences
FAST selects coresets more efficiently by matching distributions in the frequency domain.
problem Efficiently selecting representative subsets of large datasets for deep learning.
method FAST uses spectral graph theory and CFD to match distributions, addressing limitations of existing methods.
result FAST significantly outperforms state-of-the-art coreset selection methods in accuracy and energy efficiency.
A new penalty-free method optimizes portfolios without quantum annealing penalties.
problem Optimizing portfolios with quantum annealing penalties.
method Removing the penalty term and using a classical feasibility projector.
result Significant reduction in chain-break fractions and post-processed regret.
Generative model predicts multiple brain graphs from one, preserving topology.
problem Predicting multiple brain graphs from a single one, preserving topology.
method MultiGraphGAN architecture, graph adversarial auto-encoder, cluster-specific decoders, topological loss.
result Significantly outperformed variants in multi-view brain graph generation.