arXiv Machine Learning July 22, 2026 By Vignesh Tirukkonda, Gautam Dasarathy

Mixing-Free and Signal-Optimal Learning of Gaussian Graphical Models from Glauber Dynamics

Read the original on arXiv Machine Learning →

arXiv:2607. 18559v1 Announce Type: cross Abstract: Gaussian graphical model selection is usually studied under independent sampling, but in many applications the data arise as a single trajectory of a dependent stochastic process.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jul 1

Learning Gaussian Graphical Models from a Glauber Trajectory Without Mixing

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

efficiency

arXiv Machine Learning

Jul 10

Learning $\mathsf{AC}^0$ under Locally Sampleable Graphical Models

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

arXiv Machine Learning

Jun 2

Efficient Hamiltonian, structure and trace distance learning of Gaussian states

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 Machine Learning

Jun 26

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity

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 Machine Learning

Jul 17

Spectral Concentration and Recovery in Sparse High-Dimensional Random Geometric Graphs

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

arXiv Machine Learning

Aug 11

The Cost of Adaptivity: Matching Lower Bounds Across Learning Problems

arXiv:2608. 08826v1 Announce Type: new Abstract: Adaptive procedures must work without nuisance information an oracle may use, such as a gradient scale or smoothness index, and robust procedures may have to answer queries whose coordinate and inspection time are chosen only after the data are seen.

By Ibne Farabi Shihab, Adria Binte Habib

benchmarks

Related stories

Learning Gaussian Graphical Models from a Glauber Trajectory Without Mixing

Learning $\mathsf{AC}^0$ under Locally Sampleable Graphical Models

Efficient Hamiltonian, structure and trace distance learning of Gaussian states

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity

Spectral Concentration and Recovery in Sparse High-Dimensional Random Geometric Graphs

The Cost of Adaptivity: Matching Lower Bounds Across Learning Problems