arXiv:2607. 20857v1 Announce Type: cross Abstract: Scientific machine learning methods such as neural operators and physics-informed neural networks have advanced engineering applications and inverse problems, but their training typically requires large volumes of simulated data.
arXiv:2608.27883v1 Announce Type: new Abstract: Physical systems are often modeled by solution operators that map input fields, parameters, geometries, or past states to steady or future physical sta...
arXiv:2607. 23338v1 Announce Type: new Abstract: Graph compression reduces the computational cost of graph learning, but its effect on signal propagation remains largely underexplored.
GraphK introduces an encoder‑sampler‑decoder framework that generates variable‑size graphs efficiently. It learns permutation‑invariant latent representations and samples new node embeddings via maximum likelihood, enabling both upscaling and downscaling of graph size. Edge construction uses KDTree‑based top‑k neighbor search in latent space, reducing computational cost while capturing graph properties.
arXiv:2601. 10199v2 Announce Type: replace Abstract: Multivariate data often exhibit complex dependencies that violate the assumption of isotropic residual noise.
arXiv:2602. 01553v3 Announce Type: replace-cross Abstract: Link prediction is a core challenge in graph machine learning, demanding models that capture rich and complex topological dependencies.
arXiv:2609.14977v1 Announce Type: cross Abstract: Finite element stress fields often exhibit strong local non-smoothness, where stress concentrations near holes, notches, and loading regions induce s...
arXiv:2605. 21247v3 Announce Type: replace Abstract: Graph Neural Networks (GNNs) have emerged as a cornerstone of deep learning, with most existing methods rooted in graph signal processing and diffusion equations to model message passing.
The paper introduces WST-Graph, a topology-preserving wavelet scattering front-end designed for speech deepfake detection. It reconstructs wavelet scattering paths into a sparse modulation‑carrier grid that feeds an AASIST graph backend, employing modulation‑level normalization and adaptive local attention pooling to produce fixed relative‑time representations while keeping acoustic axes intact. The resulting waveform‑to‑graph interface uses about 60% fewer trainable parameters than AASIST yet remains competitive, showing clear improvements on selected out‑of‑domain benchmarks.
arXiv:2508. 06588v3 Announce Type: replace-cross Abstract: Vector Quantization (VQ) has recently emerged as a promising approach for learning compressed and discrete representations for graph-structured data.
arXiv:2608. 09031v1 Announce Type: new Abstract: Graph neural networks typically propagate information through repeated message-passing layers, coupling the distance over which information travels with the number of nonlinear transformations applied.
arXiv:2607. 06833v1 Announce Type: new Abstract: Sampling stochastic signals supported on a graph underlies many graph machine learning tasks, including recommender systems, forecasting in financial markets, and wireless network optimization.
TWIG (Time‑Causal Wavelet Operator for Irregular Graphs) is a graph‑native neural operator designed for autoregressive surrogate modeling on static irregular graphs. It transforms each node’s history into causal multiscale temporal features, separating recent changes from slower memory components, and propagates these through graph‑wavelet operator blocks with gated pointwise channel mixing. The architecture is causal by construction, enabling closed‑loop forecasting where predictions are recursively reused as future inputs, and it consistently outperforms non‑time‑causal baselines across three irregular‑domain forecasting problems.