Improved GNN handles long-range dependencies in multi-relational graphs.
problem Vanishing gradients in GNNs for multi-relational graphs.
method Proposes a Gated Graph Neural Network with improved long-range dependency handling.
result Outperforms popular GNN models in synthetic tasks.
Novel graph neural network combines random walks with local message passing.
problem Graph neural networks struggle with long-range dependencies.
method Combines random walks with local message passing in a novel architecture.
result Significant performance improvements on graph benchmarks.
HGNet improves GNNs' ability to handle long-range interactions in graphs.
problem Insufficiency of GNNs in capturing long-range interactions.
method Introduces hierarchical message passing models with multi-resolution graph representations.
result HGNet outperforms conventional GNNs in molecular property prediction.
IGNN captures long-range graph dependencies using fixed-point equations.
problem Limited GNN ability to capture long-range graph dependencies.
method Fixed-point equilibrium equations involving implicitly defined state vectors, leveraging Perron-Frobenius theory and projected gradient descent.
result IGNN consistently captures long-range dependencies and outperforms state-of-the-art GNNs.
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.
Persistent homology enhances graph classification by capturing long-range graph properties.
problem Lack of formal assessment of persistent homology in graph learning.
method Brief introduction and theoretical discussion of persistent homology in graph context, followed by empirical analysis.
result Persistent homology improves graph classification, especially for data with prominent topological structures.
HC-GNN tackles long-range graph information and high-order neighbourhoods.
problem Costly encoding of long-range information and failure to encode high-order neighbourhoods.
method Hierarchical structure with multi-level super graphs and innovative intra- and inter-level propagation.
result HC-GNN efficiently captures long-range interactions and incorporates meso- and macro-level semantics.
Graph neural networks struggle to propagate long-range information, causing over-squashing.
problem Graph neural networks struggle to propagate long-range information.
method Identified over-squashing as the bottleneck in GNNs, demonstrated on various models.
result Breaking the bottleneck improves GNNs' performance on long-range problems.
A new GNN module learns geometric scattering features for better graph classification and feature exploration.
problem Learning long-range graph relations and extracting meaningful features from graphs.
method Proposes a learnable geometric scattering (LEGS) module in graph neural networks (GNNs), incorporating wavelet filters.
result LEGS-based GNNs outperform existing methods in graph classification and feature extraction tasks.
Combines PCA and message passing for better graph node embeddings.
problem Challenges of learning long-range dependencies in graph data.
method PCAPass: PCA + message passing for unsupervised node embeddings.
result Empirically shows competitive performance on node classification benchmarks.
Geom-GCN improves graph neural networks by preserving structural information and capturing long-range dependencies.
problem Weaknesses in MPNNs' aggregators: loss of structural information and lack of long-range dependencies.
method Proposes a geometric aggregation scheme with three modules: node embedding, structural neighborhood, and bi-level aggregation.
result Achieved state-of-the-art performance on various graph datasets.
Spatial-temporal graph modeling is an important task to analyze the spatial relations and temporal trends of components in a system. Existing approaches mostly capture the spatial dependency on a fixed graph structure, assuming that the underlying relation between entities is pre-determined. However, the explicit graph…
New neural model processes 2D data with long-range dependencies efficiently.
problem Limited receptive field of convolutions for complex 2D tasks.
method Proposes Matrix Shuffle-Exchange network with O(logn) layers and O(n2logn) complexity. result Exceeds convolutional and graph neural network baselines in long-range dependency modeling.
This paper looks into the analysis of the long-range auto-correlations and cross-correlations in bond market. Based on Detrended Moving Average (DMA) method, empirical results present a clear evidence of long-range persistence that exists in one year scale. The degree of long-range correlation related to maturities has…
Graph algorithms are key tools in many fields of science and technology. Some of these algorithms depend on propagating information between distant nodes in a graph. Recently, there have been a number of deep learning architectures proposed to learn on undirected graphs. However, most of these architectures aggregate i…
Study evaluates neural networks based on random graph structures and finds key performance indicators.
problem Understanding and optimizing neural network architectures using graph theory.
method Evaluation of neural networks with random graph structures, focusing on structural and numerical properties.
result A new numerical graph characteristic selects a set of quasi-1-dimensional graphs that perform well.
Spatial and time-dependent data is of interest in many applications. This task is difficult due to its complex spatial dependency, long-range temporal dependency, data non-stationarity, and data heterogeneity. To address these challenges, we propose Forecaster, a graph Transformer architecture. Specifically, we start b…
Research on long-range memory in financial and social systems using various models.
problem Understanding the nature of long-range memory in socioeconomic systems.
method Various Markov processes including point processes, stochastic differential equations, and agent-based models.
result New estimators of self-similarity and long-range memory for non-Gaussian systems are needed.
GAttNHP predicts future events in temporal knowledge graphs by encoding long-range dependencies and handling mutual excitation.
problem Forecasting future events in temporal knowledge graphs due to long-range dependencies, mutual excitation, and heavy-tailed inter-arrival times.
method GAttNHP uses a self-attention encoder, semantic soft-grouping, and NCQ regression to address these issues.
result GAttNHP improves entity and time prediction on six benchmark TKG datasets compared to state-of-the-art baselines.
In hyperspectral image (HSI) classification, spatial context has demonstrated its significance in achieving promising performance. However, conventional spatial context-based methods simply assume that spatially neighboring pixels should correspond to the same land-cover class, so they often fail to correctly discover …
This study uses moving average cluster entropy to analyze financial market dynamics.
problem Understanding long-range dependence in financial markets.
method Moving average cluster entropy approach applied to ARFIMA and FBM processes.
result Long-range positive correlation in financial markets is linked to the cluster entropy behavior.
Graph embedding techniques are useful to characterize spectral signature relations for hyperspectral images. However, such images consists of disjoint classes due to spatial details that are often ignored by existing graph computing tools. Robust parameter estimation is a challenge for kernel functions that compute suc…
A new graph neural network framework captures long-range interactions efficiently.
problem Efficiently modeling long-range interactions in graph neural networks for PDEs.
method Proposes a multi-level graph neural network framework using multipole methods.
result Captures interaction at all ranges with only linear complexity, learning discretization-invariant solution operators.
A new method extracts events and their arguments efficiently from text.
problem Efficiently extract event information from texts with long-range dependencies and associations.
method Graph Convolutional Networks with shortest dependency paths to capture syntactic relationships.
result Significant improvement over state-of-the-art methods.
A method to generate long-range human actions by leveraging graph convolutional networks and self-attention.
problem Generating long-range skeleton-based human actions is challenging due to small frame deviations.
method Proposes a variant of GCNs with self-attention to adaptively sparsify action graphs and capture structure information.
result Extensive experiments show superior performance compared to existing methods on human action datasets.
pLSTM tackles long-range language modeling and computer vision tasks with parallelizable linear source transition mark networks.
problem Challenges of existing recurrent architectures in handling sequences and multi-dimensional data.
method Introduces pLSTM, a parallelizable linear source transition mark network for linear graphs and DAGs, addressing vanishing/exploding activation/gradient issues.
result pLSTM outperforms Transformers in long-range tasks like arrow-pointing extrapolation and image size extrapolation.
We propose a model of fractal point process driven by the nonlinear stochastic differential equation. The model is adjusted to the empirical data of trading activity in financial markets. This reproduces the probability distribution function and power spectral density of trading activity observed in the stock markets. …
New model incorporates long-range dependence in mortality rates for better valuation and risk management.
problem Lack of appropriate models for valuing and managing mortality securities with long-range dependence.
method Proposes a novel class of Volterra mortality models that incorporate LRD, derived in closed-form solution.
result Models provide flexibility and tractability for valuing and hedging mortality-related products.
Spacetimeformer learns spatiotemporal relationships from data alone.
problem Forecasting multivariate time series with distinct spatial relationships.
method Transformers with dynamic graph connections learning interactions between space, time, and value.
result Competitive results on various time series prediction benchmarks.
Proposes a graph-based approach for better stock prediction.
problem Long-range dependencies and chaotic property in stock prediction.
method Transforms time series into graphs, extracting structural information to resolve issues.
result Obtains the best performance among state-of-the-art benchmarks and highest cumulative profits in trading simulations.
We propose a multiresolution Gaussian process to capture long-range, non-Markovian dependencies while allowing for abrupt changes. The multiresolution GP hierarchically couples a collection of smooth GPs, each defined over an element of a random nested partition. Long-range dependencies are captured by the top-level GP…
Previous studies indicate that nonlinear properties of Gaussian time series with long-range correlations, ui, can be detected and quantified by studying the correlations in the magnitude series ∣ui∣, i.e., the ``volatility''. However, the origin for this empirical observation still remains unclear, and the exact …
We review ideas on temporal dependences and recurrences in discrete time series from several areas of natural and social sciences. We revisit existing studies and redefine the relevant observables in the language of copulas (joint laws of the ranks). We propose that copulas provide an appropriate mathematical framework…
TK-GCN forecasts spatiotemporal dynamics using Koopman-enhanced graph convolutional networks.
problem Forecasting complex spatiotemporal dynamics over irregular domains.
method Two-stage framework: Koopman-enhanced Graph Convolutional Network (K-GCN) for spatial encoding and Transformer for temporal modeling.
result TK-GCN outperforms state-of-the-art methods in spatiotemporal cardiac dynamics forecasting.
Image partitioning, or segmentation without semantics, is the task of decomposing an image into distinct segments, or equivalently to detect closed contours. Most prior work either requires seeds, one per segment; or a threshold; or formulates the task as multicut / correlation clustering, an NP-hard problem. Here, we …
New method uses curvature to improve graph neural networks.
problem Graph Neural Networks struggle with over-smoothing and over-squashing.
method Augmented Forman-Ricci curvature (AFRC) for scalable rewiring.
result AFRC effectively mitigates over-smoothing and over-squashing.
Scalable machine learning with path signatures for time series and graphs.
problem Challenges in real-world time series and graph data.
method Combines rough path theory with probabilistic, deep, and kernel methods.
result Scalable models for time series and graph data.
Study on price fluctuations in NFT market, showing heavy-tailed distributions and long-range memory.
problem Characterizing price fluctuations in NFT market.
method Analysis of capitalization, floor price, transactions, inter-transaction times, and volume value of NFTs.
result NFT market exhibits heavy-tailed probability distribution functions, well described by stretched exponentials, with long-range memory.
A new method uses burst and inter-burst duration to test long-range memory in financial markets.
problem Varying results from long-range memory estimators in financial markets.
method Burst and inter-burst duration statistical analysis of limit order book data.
result The new method provides a more reliable evaluation of the Hurst exponent.
Transformers can perform well with less long-range memory.
problem The need for deep long-range memory in Transformers for language modeling.
method Performed interventions to show performance can be achieved with fewer long-range memories and by limiting attention range.
result Comparable performance can be achieved with 6X fewer long-range memories and better performance with limited attention range.
In this work, we propose an order book model with herd behavior. The proposed model is built upon two distinct approaches: a recent empirical study of the detailed order book records by Kanazawa et al. [Phys. Rev. Lett. 120, 138301] and financial herd behavior model. Combining these approaches allows us to propose a mo…
Inspired by the recent literature on aggregation theory, we aim at relating the long range correlation of the stocks return volatility to the heterogeneity of the investors' expectations about the level of the future volatility. Based on a semi-parametric model of investors' anticipations, we make the connection betwee…
We quantitatively investigate the ideas behind the often-expressed adage `it takes volume to move stock prices', and study the statistical properties of the number of shares traded QΔt for a given stock in a fixed time interval Δt. We analyze transaction data for the largest 1000 stocks for the two-year period 1…
Quantum computing improves graph neural network aggregation.
problem Limitations of classical GNNs in processing global graph features.
method Quantum computer-generated aggregation weights for graph neural networks.
result Quantum-enhanced GNN performs similarly to classical models on standard datasets.
Introduces Spectral Attention for better long-range time series forecasting.
problem Challenges in capturing long-range dependencies in time series forecasting.
method Spectral Attention mechanism that preserves temporal correlations and long-range dependencies.
result Achieves state-of-the-art results on 11 real-world time series datasets.
A new method reduces memory requirements for Graph Transformers by sparsely training a network.
problem Quadratic memory complexity in Graph Transformers limits their scalability to large graphs.
method Spexphormer: trains a narrow network on augmented graph, then uses only active connections in a wider network.
result Spexphormer achieves good performance with drastically reduced memory requirements.
Method integrates logical rules into neural multi-hop reasoning for drug repurposing.
problem Capturing long-range dependencies in biomedical data.
method Combines logical rules with neural multi-hop reasoning using reinforcement learning.
result Our method outperforms baseline methods in drug repurposing tasks.
We investigate how simultaneously recorded long-range power-law correlated multi-variate signals cross-correlate. To this end we introduce a two-component ARFIMA stochastic process and a two-component FIARCH process to generate coupled fractal signals with long-range power-law correlations which are at the same time lo…