arXiv:2606. 31230v1 Announce Type: new Abstract: We study the task of learning the structure of a $d$-sparse Gaussian graphical model on $n$ variables from a single trajectory of Glauber dynamics.
By Eric Shen, Tony Wu, Mahbod Majid, Ankur Moitra
arXiv:2607. 08303v1 Announce Type: new Abstract: The problem of learning constant-depth circuits holds profound implications for computational learning theory.
By Weiming Feng, Xiongxin Yang, Yixiao Yu, Yiyao Zhang
The paper introduces the Generalized Graph Variational Autoencoder (GGVA), which replaces the Kullback–Leibler divergence in the standard variational graph autoencoder with any member of the Rényi–Tsallis family of order $q$. The authors show that for $q<1$ the Tsallis divergence is bounded, whereas the KL and Rényi divergences are unbounded, and that this boundedness can significantly increase the amount of posterior information retained—up to 49× more than the VGAE on several benchmark graphs. Experiments demonstrate that the GGVA’s retained information improves node classification performance, though it does not improve link‑prediction accuracy and only delays, rather than prevents, posterior collapse.
By Kleyton da Costa, Bernardo Modenesi, Ivan F. M. Menezes, Helio Lopes
arXiv:2411. 03163v4 Announce Type: replace-cross Abstract: In this work, we initiate the study of Hamiltonian learning for positive temperature bosonic Gaussian states, the quantum generalization of the widely studied problem of learning Gaussian graphical models.
By Marco Fanizza, Cambyse Rouz\'e, Daniel Stilck Fran\c{c}a
arXiv:2606. 27298v1 Announce Type: cross Abstract: We study the fundamental problem of learning a high-dimensional Gaussian truncated to an unknown halfspace.
By Haitong Liu, Deepak Narayanan Sridharan, David Steurer, Manuel Wiedmer
arXiv:2607. 14304v1 Announce Type: cross Abstract: We study sparse random geometric graphs generated by connecting pairs of high-dimensional vectors whose inner product exceeds a threshold.
By Manuel Fernandez V, Yizhe Zhu