arXiv:2510. 03690v4 Announce Type: replace Abstract: Real-world graph datasets often arise from mixtures of populations, where graphs are generated by multiple distinct underlying distributions.
By Ali Azizpour, Reza Ramezanpour, Santiago Segarra
arXiv:2609.06093v1 Announce Type: new
Abstract: Connectomes, graph-level maps of neurons and their synaptic connections, provide a structural basis for understanding how brain circuits support functi...
By Zhuolin Yu, Xingyu Liu, Yuanhao Jia, Yunhang Xiao, Hairuo Xue, Feihan Sun, Guozhang Chen
The paper introduces RGC‑Net, a Reservoir‑Based Graph Convolutional Network that combines fixed‑random reservoir dynamics with a structured convolutional framework for graph learning. It addresses limitations of existing reservoir‑based GNNs by adding a leaky integrator for better feature retention and a robust, adaptable architecture for graph classification and generation. Experiments demonstrate state‑of‑the‑art performance on classification and generative tasks, including dynamic brain connectivity, with faster convergence and reduced over‑smoothing.
By Mayssa Soussia, Gita Ayu Salsabila, Mohamed Ali Mahjoub, Islem Rekik
The paper introduces xVGAE, a hierarchical variational graph autoencoder designed for exchangeable graphs. Leveraging the Aldous-Hoover theorem, the model uses a graph-level latent variable, exchangeable node-specific latent variables, and a graphon function to learn and generate graph distributions efficiently. Experiments demonstrate that xVGAE produces high-quality graphs quickly while capturing key structural properties of the training data.
By Daniele Micheletti, Federica Zoe Ricci, Erik B. Sudderth
arXiv:2509. 24256v2 Announce Type: replace-cross Abstract: The pretrain-transfer paradigm, which underpins the success of large language models (LLMs), has demonstrated the immense power of creating foundation models that learn generalizable representations from vast datasets.
By Yunhao Liang, Pujun Zhang, Yuan Qu, Jingyuan Yang, Shaochong Lin, Zuo-jun Max Shen
The paper introduces adVersarial Parameter Decomposition (VPD), a method that splits a language model’s parameters into simple subcomponents, each responsible for a small part of the model’s algorithm. VPD optimizes these decompositions so that the model’s input‑output behavior remains intact even when many subcomponents are removed, including adversarially chosen ones. This approach enables a new form of circuit analysis by tracing how sequences of parameter subcomponents interact to produce outputs for specific inputs.
By Lucius Bushnaq, Dan Braun, Oliver Clive-Griffin, Bart Bussmann, Nathan Hu, Michael Ivanitskiy, Linda Linsefors, Lee Sharkey