{"total":14,"rows":[{"id":"2405.00082","title":"Structure learning of Hamiltonians from real-time evolution","created":"2024-04-30","cited_by_count":9,"area":null},{"id":"2409.05284","title":"Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics","created":"2024-09-09","cited_by_count":8,"area":null},{"id":"2411.11174","title":"Learning the Sherrington-Kirkpatrick Model Even at Low Temperature","created":"2024-11-17","cited_by_count":5,"area":null},{"id":"2511.21008","title":"Estimating Ising Models in Total Variation Distance","created":"2025-11-26","cited_by_count":3,"area":null},{"id":"2410.13800","title":"Discrete distributions are learnable from metastable samples","created":"2024-10-17","cited_by_count":2,"area":null},{"id":"2412.18594","title":"Local and Mixing-Based Algorithms for Gaussian Graphical Model Selection from Glauber Dynamics","created":"2024-12-24","cited_by_count":2,"area":null},{"id":"2511.02487","title":"Learning CNF formulas from uniform random solutions in the local lemma regime","created":"2025-11-04","cited_by_count":2,"area":null},{"id":"2606.31230","title":"Learning Gaussian Graphical Models from a Glauber Trajectory Without Mixing","created":"2026-06-30","cited_by_count":1,"area":null},{"id":"2411.11516","title":"Efficient Sample-optimal Learning of Gaussian Tree Models via Sample-optimal Testing of Gaussian Mutual Information","created":"2024-11-18","cited_by_count":0,"area":null},{"id":"2502.07135","title":"One-Shot Learning for k-SAT","created":"2025-02-10","cited_by_count":0,"area":null},{"id":"2602.12449","title":"Computationally sufficient statistics for Ising models","created":"2026-02-12","cited_by_count":0,"area":null},{"id":"2607.18559","title":"Mixing-Free and Signal-Optimal Learning of Gaussian Graphical Models from Glauber Dynamics","created":"2026-07-20","cited_by_count":0,"area":null},{"id":"2607.22889","title":"Efficient Learning of Truncated Boolean Product Distributions: Influence to the Rescue","created":"2026-07-24","cited_by_count":0,"area":null},{"id":"2609.15268","title":"Learning CNF Formulas from Uniform Random Solutions: Near-Tight Sample Complexity for Valiant's Algorithm","created":"2026-09-14","cited_by_count":0,"area":null}],"next_cursor":null}