Model infers diffusion networks from heterogeneous cascade data.
problem Understanding and predicting diffusion processes in interconnected populations.
method Double mixture directed graph model with layer-specific constraints.
result Convex formulation allows for statistical and computational guarantees.
In this paper, we analyze energy-harvesting adaptive diffusion networks for a distributed estimation problem. In order to wisely manage the available energy resources, we propose a scheme where a censoring algorithm is jointly applied over the diffusion strategy. An energy-aware variation of a diffusion algorithm is us…
An efficient algorithm for aligning diffusion trees to networks with information asymmetry.
problem Aligning diffusion trees to networks with information asymmetry.
method Tree correlation tests for extracting alignment information.
result Explicit lower bounds on the probability of correct matches for each vertex on the diffusion tree.
Efficiently reconstructs jump-diffusion processes from data using neural networks.
problem Reconstructing jump-diffusion processes from data.
method Temporally decoupled squared Wasserstein distance method using parameterized neural networks.
result Enhanced reconstruction of jump-diffusion processes from data.
Deep learning predicts information diffusion in complex networks.
problem Predicting information spread in heterogeneous networks with local and threshold limitations.
method Meta-path representation learning for global latent representation of heterogeneous networks, followed by deep learning.
result The proposed HDD approach outperforms existing methods in topic diffusion and cascade prediction.
Neural network approximates diffusion bridges for efficiency and robustness.
problem Efficient simulation of conditioned diffusion processes, especially rare events and multimodal distributions.
method Trains a neural network to approximate bridge dynamics, eliminating MCMC and score modeling.
result Efficient sampling of conditioned diffusion bridges at comparable cost to unconditioned process.
SM-netFusion estimates brain network atlas by considering multiple topological measures.
problem Limited BNA estimation methods that overlook topological measures and lack discriminative power.
method Supervised multi-topology network cross-diffusion framework using degree, closeness, and eigenvector centrality measures.
result SM-netFusion produces more centered and representative templates, and improves classification accuracy.
A new model captures diffusion dynamics in networks using hidden states.
problem Capturing temporal relationships and hidden content trajectories in network diffusion.
method A topological recurrent neural model that embeds diffusion history as hidden states.
result Good experimental performances for diffusion modeling and prediction.
A new neural network approach for diffusion on networks.
problem Inference and estimation of diffusion on network structures.
method Neural mean-field dynamics derived from Mori-Zwanzig formalism, approximated by learnable time convolution operators.
result Significantly outperforms existing approaches in accuracy and efficiency.
Improved neural model for social recommendation by integrating social and interest networks.
problem Data sparsity and lack of higher-order relationships in social recommendation.
method DiffNet++ models neural influence diffusion and interest diffusion in a unified framework using a multi-level attention network.
result Extensive experiments on real-world datasets show the effectiveness of DiffNet++.
This paper extends neural network approximation results to denoising diffusion models.
problem Improving the efficiency and accuracy of generative models.
method Leveraging connections to stochastic control and neural network approximation.
result Established neural network approximation results for the Föllmer drift are extended to denoising diffusion models.
New method identifies diffusion sources on networks with statistical confidence.
problem Identifying sources of diffusion on networks without restrictive assumptions.
method Statistical framework and confidence set inference approach based on hypothesis testing.
result Efficiently produces a small subset of nodes covering the source node with any confidence level.
Sparse diffusion steepest-descent for one-bit CS in sensor networks.
problem Estimating sparse vectors from sign measurements in wireless sensor networks.
method Diffusion strategy combined with steepest-descent optimization for cooperative sparse vector estimation.
result Simulation results show the proposed algorithm outperforms non-distributive methods.
Information diffusion in online social networks is affected by the underlying network topology, but it also has the power to change it. Online users are constantly creating new links when exposed to new information sources, and in turn these links are alternating the way information spreads. However, these two highly i…
Topo-LSTM improves diffusion prediction by 20-56%.
problem Diffusion prediction on graphs with limited deep learning exploration.
method Introduced Topo-LSTM, a novel topological recurrent neural network for dynamic DAGs.
result Topo-LSTM improves state-of-the-art baselines by 20-56% across multiple real-world datasets.
Method predicts diffusion reach probabilities using node embeddings.
problem Estimating diffusion reach probabilities with limited cascades and network information.
method Representation learning on node embeddings for cascade prediction.
result Proposed method outperforms using available cascade data.
A new network embedding method using diffusion to overcome limitations of random walks.
problem Limitations of random walk based network embedding methods in fragile sampling and disequilibrium networks.
method Proposes a network diffusion based embedding method that captures both depth and breadth information and uses cascades for global network information.
result The diffusion based models are more robust in fragile sampling and highly imbalanced networks.
DMTE integrates global connectivity for better text embeddings.
problem Lack of capturing complete connectivity between texts in graphs.
method Integrates global structural information through diffusion-convolution on text inputs, preserving high-order proximity.
result DMTE outperforms state-of-the-art methods on vertex-classification and link-prediction tasks.
Lower bounds on sample complexity for recovering diffusion network structures.
problem Determining the minimum number of samples needed to accurately recover network structures.
method Information-theoretic analysis of discrete and continuous-time diffusion models.
result Lower bounds of order Ω(klogp) for correct recovery of network structures. VINE reconstructs networks from diffusion data efficiently.
problem Reconstructing networks from limited diffusion data.
method Variational Inference for Network Reconstruction (VINE).
result VINE accurately recovers connected graphs from diffusion data.
Improved node classification in signed social networks using diffuse interface methods.
problem Classifying nodes in signed social networks (positive and negative interactions).
method Diffuse interface methods based on Ginzburg-Landau functional and extended graph Laplacian.
result Performance improvement in real signed social networks, outperforming state of the art.
Generative diffusion models mimic biological memory networks, encoding associative dynamics in deep neural weights.
problem Understanding long-term memory mechanisms in neuroscience and AI.
method Interpreting generative diffusion models as energy-based models and comparing them to Hopfield networks.
result Generative diffusion models can encode associative dynamics of Hopfield networks in deep neural weights.
Equivariant diffusion model generates 3D molecules efficiently.
problem Generating high-quality 3D molecules efficiently.
method Equivariant Diffusion Model (EDM) that operates on atom coordinates and types.
result Significantly outperforms previous methods in molecule quality and training efficiency.
Information diffusion and virus propagation are fundamental processes taking place in networks. While it is often possible to directly observe when nodes become infected with a virus or adopt the information, observing individual transmissions (i.e., who infects whom, or who influences whom) is typically very difficult…
Inference for SDEs using variational methods and neural networks.
problem Parameter inference for stochastic differential equations is challenging due to latent diffusion processes.
method Variational inference with a mean-field approximation for parameters and a recurrent neural network for diffusion paths.
result Accurate parameter estimates for SDE systems, demonstrated on Lotka-Volterra and epidemic models.
Improved NPE with conditional diffusions and summary networks.
problem Approximating complex posterior distributions efficiently and accurately.
method Conditional diffusions coupled with high-capacity summary networks.
result Conditional diffusions offer improved stability, accuracy, and faster training times.
Develops DSD for analyzing multiscale biological networks.
problem Analyzing multiscale structure in biological networks.
method Data-driven diffusion process with multitemporal analysis.
result Parameter-free inference of intrinsic data structure.
Paper connects neural network score approximation to reverse diffusion model distribution approximation.
problem Quantifying the relationship between neural network score approximation and the distribution generated by reverse diffusion models.
method Combines Hornik's universal approximation theorem, Girsanov's theorem, and data processing inequality.
result Neural network score approximation guarantees distribution approximation in reverse diffusion models.
Paper infers multiplex network structure from social interactions.
problem Challenges in understanding diffusion in social networks due to hidden structure and multiple interaction patterns.
method Proposes Multiplex Diffusion Model (MDM) using multivariate marked Hawkes process and topic model.
result MDM more effectively uncovers multiplex network structure compared to previous methods.
AdaPID optimizes diffusion-based samplers by dynamically adjusting schedules.
problem Optimizing the intermediate-time dynamics in diffusion-based samplers.
method Develops a time-varying stiffness schedule using Piece-Wise-Constant (PWC) parametrizations and a hierarchical refinement approach.
result QoS-driven PWC schedules consistently improve sampling fidelity and accuracy.
New nonlocal neural network learns stable dynamics for deeper nonlocal structures.
problem Capturing long-range dependencies in feature space.
method Spectrum analysis on weight matrices, new nonlocal block formulation.
result Stable dynamics in deeper nonlocal structures.
Unified approach for influence maximization using diffusion cascade representations.
problem Influence maximization on networks with diffusion cascades.
method Multi-task neural network learning influencer and susceptible vectors; greedy algorithm for influence maximization.
result IMINFECTOR outperforms other methods in efficiency and seed set quality.
Backpropagation is explained as a diffusion process in neural networks.
problem The biological plausibility of Backpropagation is questioned.
method Demonstrated that time-delayed neurons and forward-backward waves approximate the gradient in deep networks.
result Backpropagation can be interpreted as a diffusion process, approximating the gradient for non-fast inputs.
New method bypasses time-reversal for diffusion-based generative models.
problem Diffusion-based generative models require time-reversal, limiting flexibility.
method Constructs diffusion processes without time-reversal through mixtures of diffusion bridges.
result Exact transport without time-reversal, greater flexibility in dynamics.
Modern Hopfield networks help prevent forgetting in generative models after task changes.
problem How to prevent forgetting in generative models after task changes.
method Introduce intrinsic forgetting as an increase in Hopfield energy after task change, analyze memory replay effectiveness, and validate predictions in experiments.
result High-energy, outlier-like samples are more forgettable than cluster-like samples, and energy-based selection of replay samples mitigates forgetting.
The paper develops a neural network method for estimating drift functions of diffusion processes from discrete observations.
problem Nonparametric estimation of drift function for diffusion processes from high-frequency discrete observations.
method Neural network-based estimator for drift function estimation.
result Derives a non-asymptotic convergence rate for the neural network estimator.
Infinitely deep neural networks can be modeled as diffusion processes to avoid undesirable properties.
problem Desirable properties are lost as neural networks increase in depth.
method Parameter distributions shrink as depth increases, leading to well-behaved stochastic processes.
result Limiting processes do not suffer from vanishing dependency and restrictive function families issues.
Complex biological systems have been successfully modeled by biochemical and genetic interaction networks, typically gathered from high-throughput (HTP) data. These networks can be used to infer functional relationships between genes or proteins. Using the intuition that the topological role of a gene in a network rela…
Adaptive diffusions improve graph-based classification accuracy.
problem Diffusion-based classifiers' performance is affected by label propagation mechanisms specific to graphs.
method Disciplined approach to learning class-specific diffusion functions adapted to graph topology.
result Adapting diffusion functions significantly improves classification accuracy over fixed diffusions.
VDWs enhance graph neural networks for analyzing complex data.
problem Analyzing data on non-Euclidean geometries.
method Incorporating vector diffusion wavelets into geometric graph neural networks.
result VDW-GNNs effectively analyze synthetic and real-world data.
Improved LMP algorithm for better sensor network estimation in non-uniform noise.
problem Improving distributed estimation in sensor networks with non-uniform noise.
method Weighted sum of mean square error cost function and steepest-descent recursion for weight updates.
result Advantages over diffusion LMP in non-uniform noise conditions.
Improved sample complexity for training diffusion models.
problem How many samples are needed to train an accurate diffusion model?
method Analyzing the sample complexity of training diffusion models using neural networks.
result Exponential improvement in the dependence on Wasserstein error and depth, along with improved dependencies on other parameters.
HAD-Net forecasts glucose levels with insights into insulin and carbs diffusion.
problem Inaccurate predictions in glucose level forecasting without context understanding.
method Hybrid model combining deep learning and physiological models, using recurrent attention network.
result Achieves competitive performance in glucose level forecasting with plausible diffusion insights.
This paper identifies drift Lipschitz budget K as key to diffusion policy expressivity and statistical trade-offs.
problem Understanding and maximizing the expressivity of diffusion policies while managing statistical limitations.
method Identifying drift Lipschitz budget K as central, quantifying expressivity and statistical behavior, proving lower bounds, and providing practical implementation guidelines.
result Balancing expressivity and statistical complexity yields a finite-sample performance gap, with rates depending on sample size and drift type.
A new graph generator uses heat diffusion on graph Laplacians to create new graph structures.
problem Creating realistic and diverse graph structures for various applications.
method Adapting the Generator Matching paradigm to graph data, using graph Laplacian and heat kernel for diffusion.
result The method effectively generates graphs with structural properties of real and synthetic graphs.
Deep networks can approximate score functions in high-dimensional graphical models efficiently.
problem Approximation efficiency of score functions by deep neural networks in high-dimensional graphical models like Markov random fields.
method Variational inference denoising algorithms and efficient neural network representation.
result Efficient sample complexity bound for diffusion-based generative modeling when score functions are learned by deep neural networks.
This work combines recurrent models with diffusion for probabilistic time series forecasting.
problem Scalability and capturing high-dimensional distributions and cross-feature dependencies in time series forecasting.
method Combines recurrent neural networks' efficiency with diffusion models' probabilistic modeling, using stochastic interpolants and conditional generation.
result Offers scalable probabilistic time series forecasting methods.
Improves CNN stability by translating classical signal denoising methods.
problem Stability of CNNs is poorly understood.
method Interprets classical signal denoising methods as ResNet architectures.
result Translates diffusivities, shrinkage functions, and regularizers into CNN activation functions.