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.
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.
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.
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
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.
In this paper, we propose a family of graph partition similarity measures that take the topology of the graph into account. These graph-aware measures are alternatives to using set partition similarity measures that are not specifically designed for graph partitions. The two types of measures, graph-aware and set parti…
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.
CAGNN learns graph embeddings without labels by clustering and refining graph topology.
problem Learning graph embeddings without labeled data.
method Cluster-aware graph neural network (CAGNN) with self-supervised learning and topology refinement.
result CAGNN achieves significant improvements in node clustering accuracy.
Anomaly Awareness detects anomalies in particle physics and computer vision.
problem Detect anomalies in complex data sets.
method Modifies cost function to learn normal events and anomalies.
result Effective at identifying new anomalies not previously seen.
Starfield optimizes satellite links for LEO mega-constellations by aligning ISLs with regional traffic patterns.
problem Forming a stable satellite topology in LEO mega-constellations with limited ISLs and unstable acquisition.
method Starfield uses a demand-aware heuristic algorithm based on traffic flows and Riemannian geometry to assign satellite links.
result Starfield reduces hop count and improves stretch factor by up to 30% compared to existing methods.
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.
NEST optimizes deep learning training by placing devices efficiently across networks and memory.
problem Inefficient device placement in distributed deep learning leads to high communication and memory overhead.
method NEST uses network-, compute-, and memory-aware dynamic programming to optimize device placement.
result NEST achieves up to 2.43 times higher throughput and better memory efficiency.
Z-GCNETs uses topological data to improve time series forecasting.
problem Improving time series forecasting accuracy.
method Integrates topological data into graph convolutional networks (GCNs) using zigzag persistence.
result Z-GCNETs outperforms 13 state-of-the-art methods in traffic forecasting and Ethereum price prediction.
A new method detects small holes in noisy data.
problem Detecting small holes in high-density regions from noise.
method Robust Density-Aware Distance (RDAD) filtration, incorporating distance-to-measure concept.
result The RDAD filtration prolongs the persistences of small holes, making them distinguishable from noise.
We present a new recurrent neural network topology to enhance state-of-the-art machine learning systems by incorporating a broader context. Our approach overcomes recent limitations with extended narratives through a multi-layered computational approach to generate an abstract context representation. Therefore, the dev…
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.
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.
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.
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…
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 …
Adding attributes for nodes to network embedding helps to improve the ability of the learned joint representation to depict features from topology and attributes simultaneously. Recent research on the joint embedding has exhibited a promising performance on a variety of tasks by jointly embedding the two spaces. Howeve…
Sequential portfolio selection has attracted increasing interests in the machine learning and quantitative finance communities in recent years. As a mathematical framework for reinforcement learning policies, the stochastic multi-armed bandit problem addresses the primary difficulty in sequential decision making under …
HLTF generates chemically valid 3D molecules with improved topology control.
problem Generating chemically valid 3D molecules is challenging due to bond topology errors.
method HLTF uses a latent multi-scale plan for global context and a constraint-aware sampler to suppress topology-driven failures.
result HLTF achieves high validity and uniqueness on QM9 and GEOM-DRUGS datasets.
GUST framework improves self-training by estimating node uncertainty and generating pseudo-labels.
problem Over-confidence in pseudo-labels during self-training.
method Graph-based uncertainty-aware self-training with stochastic node labeling.
result GUST achieves state-of-the-art performance, especially in sparse labeled data settings.
Morse neural networks improve uncertainty quantification and detection.
problem Uncertainty quantification and out-of-distribution detection.
method Generalizes unnormalized Gaussian densities to high-dimensional submanifolds using KL-divergence loss.
result Unified approach for OOD detection, anomaly detection, and continuous learning.
The topological information is essential for studying the relationship between nodes in a network. Recently, Network Representation Learning (NRL), which projects a network into a low-dimensional vector space, has been shown their advantages in analyzing large-scale networks. However, most existing NRL methods are desi…
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.
The implementation of Deep Convolutional Neural Networks (ConvNets) on tiny end-nodes with limited non-volatile memory space calls for smart compression strategies capable of shrinking the footprint yet preserving predictive accuracy. There exist a number of strategies for this purpose, from those that play with the to…
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.
JORC-UMAP improves UMAP by incorporating geometric and topological priors.
problem UMAP's local Euclidean distance assumption fails to capture intrinsic manifold geometry, leading to topological tearing and structural collapse.
method JORC-UMAP introduces Ollivier-Ricci curvature as a geometric prior and Jaccard similarity as a topological prior to reinforce edges and reduce redundant links.
result JORC-UMAP reduces tearing and collapse more effectively than standard UMAP and other DR methods, as measured by SVM accuracy and triplet preservation scores.
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.
CRAUM-Net improves salient object detection with context and uncertainty modeling.
problem Accurate salient object detection with precise boundary delineation.
method Contextual Recursive Attention with Uncertainty Modeling, multi-scale context aggregation, attention mechanisms, edge-aware decoder, Monte Carlo Dropout.
result Superior performance in producing accurate and reliable saliency maps.
New method reduces spatial graphs while preserving their topological features.
problem Finding a smaller spatial graph with the same structure.
method Topological spatial graph coarsening approach based on triangle-aware graph filtration.
result Significant reduction in graph size while preserving topological information.
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
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.
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.
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.
AdaCGP learns dynamic graph topology from time series data, improving over existing methods.
problem Learning dynamic graph topology from time-varying signals, especially in real-time applications.
method AdaCGP is a sparsity-aware adaptive algorithm that recursively estimates the Graph Shift Operator (GSO) through variable splitting.
result AdaCGP outperforms state-of-the-art methods in GSO estimation, achieving improvements exceeding 83%.
Prototype selection improved using topological data analysis.
problem Improving prototype selection methods for data compression.
method Introducing two topological prototype selector variants: TPS and BoundaryTPS.
result BoundaryTPS achieves the lowest mean Friedman rank on H1 persistence-diagram preservation. Proposes a graph pooling method leveraging node proximity for hierarchical graph representation learning.
problem Efficiently exploiting the geometry of graph data for hierarchical representation learning.
method Combines node proximity with kernel representation of topology and node features for adaptive node signal similarities evaluation.
result Achieves state-of-the-art performance on graph classification benchmark datasets.
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…
TRA detects causal direction from bivariate data using geometric shapes.
problem Inferring causal direction from observational data is challenging and unreliable.
method TRA compares rank-based copula-standardized residual clouds to detect causal direction.
result TRA is robust and superior in detecting causal direction across various scenarios.
Unified framework recovers exact input from SOM activation patterns.
problem Generating high-dimensional data from Self-Organizing Maps (SOMs).
method Inverting SOM activation patterns to recover input, using linear system and Tikhonov regularization.
result MUSIC framework produces coherent semantic transitions and maintains high classifier confidence.
Software Defined Networking (SDN) achieves programmability of a network through separation of the control and data planes. It enables flexibility in network management and control. Energy efficiency is one of the challenging global problems which has both economic and environmental impact. A massive amount of informati…
Syllabification does not seem to improve word-level RNN language modeling quality when compared to character-based segmentation. However, our best syllable-aware language model, achieving performance comparable to the competitive character-aware model, has 18%-33% fewer parameters and is trained 1.2-2.2 times faster.
New activation networks improve model efficiency and performance.
problem Creating hardware-efficient deep learning models.
method Restructurable Activation Networks (RANs) with RAN-explicit and RAN-implicit methods.
result RANs achieve state-of-the-art results with improved hardware efficiency.
New model learning objective improves continuous control tasks.
problem Challenges in solving continuous control tasks using model-based reinforcement learning.
method Derived a novel value-aware model learning objective and identified and addressed stale value estimates issue.
result Value-aware objectives can be successfully deployed in solving continuous control tasks without tuning hyper-parameters.
Develops new methods to create imperceptible image changes that fool classifiers.
problem Improving the robustness of image classifiers by creating subtle changes undetectable to humans.
method Two methods: Edge-Aware and Color-Aware, designed to reduce detectability of image perturbations.
result Demonstrated that the new methods effectively cause misclassification and are computationally efficient.