Study finds color-coded DMSs improve driver behavior.
problem Improving driver behavior through dynamic message signs.
method Random forest algorithm for route diversion, choice, and compliance analyses.
result Color-coded DMSs are more effective than alphanumeric ones.
New method handles structural uncertainty in graphs better than existing models.
problem Handling heterophily and structural noise in semi-supervised learning on graphs.
method Sparse signed message passing network that models a posterior distribution over signed adjacency matrices.
result Our method outperforms strong baseline models on heterophilic benchmarks under both synthetic and real-world structural noise.
ADMP-GNN dynamically adjusts message-passing layers for better graph learning performance.
problem Fixed message-passing steps in GNNs do not account for nodes' varying computational needs.
method Proposes ADMP-GNN, which dynamically adjusts the number of message-passing layers for each node.
result Improves performance on node classification tasks compared to baseline GNN models.
In latent Gaussian trees the pairwise correlation signs between the variables are intrinsically unrecoverable. Such information is vital since it completely determines the direction in which two variables are associated. In this work, we resort to information theoretical approaches to achieve two fundamental goals: Fir…
Paper interprets contrastive learning dynamics using message passing.
problem Lack of rigorous understanding of contrastive learning dynamics.
method Casts contrastive objective into message passing scheme on augmentation graph.
result The learning dynamics of contrastive learning can be theoretically characterized.
Analyze message passing algorithms using free probability theory.
problem Dynamics of message passing algorithms for probabilistic models.
method Use freeness assumptions of random matrix theory.
result Recover and analyze properties of message passing algorithms.
Social messages classification is a research domain that has attracted the attention of many researchers in these last years. Indeed, the social message is different from ordinary text because it has some special characteristics like its shortness. Then the development of new approaches for the processing of the social…
DYMAG uses dynamic waveforms to improve graph neural networks.
problem Improving graph neural networks for better graph understanding.
method DYMAG employs dynamical system-based waveforms for message aggregation in graph neural networks.
result DYMAG outperforms baseline models in graph recovery, property prediction, and random graph generation.
Belief propagation and its variants are popular methods for approximate inference, but their running time and even their convergence depend greatly on the schedule used to send the messages. Recently, dynamic update schedules have been shown to converge much faster on hard networks than static schedules, namely the res…
The Duffing oscillator's parameters are identified online using variational message passing.
problem Estimating parameters of a nonlinear Duffing oscillator in real-time.
method Variational message passing on a factor graph of the Duffing oscillator's generative model.
result The online inference procedure performs as well as offline methods.
DRew dynamically rewires message passing to improve long-range tasks.
problem Over-squashing in MPNNs due to local message passing.
method Layer-dependent rewiring and delay mechanism for gradual densification.
result DRew outperforms graph Transformers and multi-hop MPNNs on long-range tasks.
Rich and complex time-series data, such as those generated from engineering systems, financial markets, videos or neural recordings, are now a common feature of modern data analysis. Explaining the phenomena underlying these diverse data sets requires flexible and accurate models. In this paper, we promote Gaussian pro…
Platform learns user preferences to avoid abandonment due to marketing fatigue.
problem Maximizing platform's cumulative payoff while avoiding user abandonment.
method Dynamic sequential choice model to balance exploration and exploitation.
result Proposed algorithm achieves optimal regret bound for online learning.
Agent uses message passing to optimize robot navigation, balancing exploration and exploitation.
problem Optimizing robot navigation in continuous-valued spaces with uncertainty.
method Autoregressive active inference agent using message passing on a factor graph.
result Agent modulates action based on predictive uncertainty, leading to better model of dynamics.
New framework for estimating treatment effects in experiments with network interference.
problem Network interference biases traditional treatment effect estimations in randomized experiments.
method Causal message-passing framework based on high-dimensional approximate message passing.
result Practical algorithm to estimate total treatment effect in multi-period experiments.
PMP extends GNNs to handle past states efficiently.
problem Efficient querying of data structures dependent on previous states.
method Persistent Message Passing (PMP) which persists past states through new nodes.
result Significantly outperforms GNNs in handling out-of-distribution data.
Paper extends MLFD to signed measures via bilevel approach.
problem Risk minimization for infinite width neural networks and sparse deconvolution.
method Bilevel reduction to extend MLFD to signed measures, investigating convergence rates.
result Improved convergence rates for bilevel MFLD in low-noise regime and local exponential convergence for single neuron learning.
The recognition of sign language is a challenging task with an important role in society to facilitate the communication of deaf persons. We propose a new approach of Spatial-Temporal Graph Convolutional Network to sign language recognition based on the human skeletal movements. The method uses graphs to capture the si…
TM-GCN learns dynamic graph embeddings using tensor algebra.
problem Handling dynamic graphs in graph neural networks.
method Tensor M-product for dynamic graph convolution.
result TM-GCN outperforms existing methods on edge classification and link prediction.
The paper develops a new algorithm for RBMs using dynamical mean-field theory.
problem Learning in Restricted Boltzmann Machines (RBMs) with complex dependencies.
method Dynamical mean-field theory applied to RBMs with rectangular coupling matrices drawn from a bi-rotation invariant ensemble.
result The algorithm converges globally under a stability criterion, with rates matching numerical simulations.
A new aggregation strategy improves GNN performance and learning dynamics.
problem Improving expressivity and learning dynamics of GNNs.
method Proposes a variance-preserving aggregation function (VPA) for GNNs.
result VPA leads to increased predictive performance and improved learning dynamics.
Graph neural networks are explained through heat diffusion analogy.
problem Limitations of graph neural networks (oversmoothing, oversquashing).
method Analogizing message passing in GNNs to heat dynamics.
result Fundamental understanding of GNNs and improved model design.
AMP method reconstructs rank-one matrices from noisy data efficiently.
problem Reconstructing rank-one matrices with prior structural information from noisy observations.
method Approximate Message Passing (AMP) with random initialization.
result AMP from random initialization converges rapidly and globally.
New algorithms improve rank one signal estimation from noisy data.
problem Estimating a rank one signal matrix from corrupted data with rotationally invariant noise.
method Developed approximate message-passing algorithms exploiting eigenvalues and iterates denoisers.
result Achieves optimal asymptotic estimation error among iterative algorithms.
We decompose the exchange rates returns of 41 currencies (incl. gold) into their sign and amplitude components. Then we group together all exchange rates with a common base currency, construct Minimal Spanning Trees for each group independently, and analyze properties of these trees. We show that both the sign and the …
In this paper, we recover sparse signals from their noisy linear measurements by solving nonlinear differential inclusions, which is based on the notion of inverse scale space (ISS) developed in applied mathematics. Our goal here is to bring this idea to address a challenging problem in statistics, \emph{i.e.} finding …
One approach for constructing copula functions is by multiplication. Given that products of cumulative distribution functions (CDFs) are also CDFs, an adjustment to this multiplication will result in a copula model, as discussed by Liebscher (J Mult Analysis, 2008). Parameterizing models via products of CDFs has some a…
DMPS learns set data by connecting graph and set learning.
problem Lack of relational learning for set data.
method Deep Message Passing on Sets (DMPS) that connects graph and set learning.
result DMPS achieves competitive or superior results on synthetic and real-world datasets.
Study explores rumor spread on Twitter using supervised learning.
problem Rumors spread quickly on social networks, affecting decision-making.
method Microscopic-level analysis of user interactions and features.
result Models predict rumor diffusion with 90% accuracy.
Revisiting Trade-sign Long-memory and Square-root Law price impact
problem Revisiting the Lillo-Mike-Farmer (LMF) theory and the square-root law (SQRL) of meta-order impact
method Using a coupled discrete reaction-diffusion formulation
result Long-memory of trade signs and square-root law of meta-order impact
Efficient algorithm learns Independent Cascade model from partial network observations.
problem Learning accurate spreading models from limited network data.
method Scalable dynamic message-passing approach for parameter learning.
result Improved prediction of marginal probabilities compared to original model.
New simulation method tackles sign problem in quantum fields.
problem Sign problem in real-time dynamics of quantum fields.
method Inspired by reinforcement learning, complex Langevin approach with learned optimal kernels.
result Significant extension of real-time simulations in 1+1d scalar field theory.
New algorithm for signal estimation in noisy matrix models.
problem Signal estimation in rectangular spiked matrix models with rotationally invariant noise.
method Orthogonal Approximate Message Passing (OAMP) algorithm for signal estimation.
result Optimal OAMP algorithm minimizes mean-squared error and achieves Bayes-optimal performance.
A new method models financial returns by separating sign and magnitude, improving forecasting accuracy.
problem Capturing nonlinear predictability in financial return dynamics.
method Decomposes returns into sign and magnitude components, using a joint distribution model.
result Significantly outperforms traditional linear models in forecasting U.S. stock market returns.
Christmas causes 2-month LIBOR to jump.
problem Understanding the short-term pattern in LIBOR dynamics.
method Analyzed the 21 days before Xmas and the sign and size of the jump.
result 2-month LIBOR jumps after Christmas, influenced by the trend 21 days prior.
Deep CapsNet improves sign language recognition from wearable IMUs.
problem Continuous recognition of sign language from wearable devices.
method Custom CapsNet architecture using deep capsule networks and game theory.
result Improved accuracy of 94% and 92.50% for 3 and 5 routings respectively, compared to 87.99% for CNN.
New framework predicts AMP behavior in spiked models for finite iterations.
problem Understanding AMP dynamics in high-dimensional spiked models.
method Developed a non-asymptotic framework for AMP in spiked matrix estimation.
result Predicted AMP behavior for up to O(polylognn) iterations in Z2 synchronization. Convolutional neural networks are the most widely used deep learning algorithms for traffic signal classification till date but they fail to capture pose, view, orientation of the images because of the intrinsic inability of max pooling layer.This paper proposes a novel method for Traffic sign detection using deep lear…
Deep learning improves classification and characterization of amorphous materials.
problem Challenges in quantifying structure-property relationships and identifying structural features in amorphous materials.
method Application of convolutional neural networks and message passing neural networks to molecular dynamics simulations.
result Message passing neural networks outperform convolutional neural networks in classifying and characterizing amorphous materials.
We propose to learn a kernel-based message operator which takes as input all expectation propagation (EP) incoming messages to a factor node and produces an outgoing message. In ordinary EP, computing an outgoing message involves estimating a multivariate integral which may not have an analytic expression. Learning suc…
AIF improves physical AI agents' performance in dynamic environments.
problem Physical AI agents are less capable than biological agents in open-ended real-world environments.
method Developed from probability theory, Bayesian machine learning, variational inference, and Active Inference (AIF), grounded in the Free Energy Principle.
result AIF minimizes variational free energy and is well-suited to physical constraints.
New algorithm estimates influence in social networks without sampling.
problem Estimating the number of influenced nodes in social networks.
method Dynamic message-passing approach for scalable influence estimation.
result Upper bound on expected spread for general graphs, exact for treelike networks.
In this paper, learning of tree-structured Gaussian graphical models from distributed data is addressed. In our model, samples are stored in a set of distributed machines where each machine has access to only a subset of features. A central machine is then responsible for learning the structure based on received messag…
We analyze oversquashing in topological message-passing using relational structures.
problem Oversquashing in topological message-passing remains understudied.
method A unifying axiomatic framework that bridges graph and topological message-passing.
result Potential to advance topological deep learning.
Message passing is the key to graph neural networks, but new terms are needed to avoid confusion.
problem Current methods of graph neural networks cannot solve all problems over given input graphs.
method Demonstrates that any function of interest can be expressed using pairwise message passing over a modified graph.
result Message passing is the fundamental approach for graph neural networks, and new terms are needed to avoid confusion.
MACE uses higher-order messages to create fast, accurate force fields.
problem Creating fast and accurate force fields in computational chemistry and materials science.
method Introducing MACE, an equivariant MPNN model that uses four-body messages.
result MACE reduces the required number of message passing iterations to just two, achieving state-of-the-art accuracy.
Graph Network-based Simulators learn complex physics simulations.
problem Simulating complex physical systems with high accuracy and scalability.
method Graph Network framework for particle dynamics, learned message-passing.
result Model generalizes well to different conditions and scales, robust to hyperparameters.
GemNet improves molecular predictions by overcoming graph neural network limitations.
problem Graph neural networks struggle with distinguishing certain types of molecular graphs.
method Discretized geometric message passing neural network (GemNet) with spherical representations.
result GemNet outperforms previous models on molecular datasets by 34-20%.