{"total":14,"rows":[{"id":"2311.09197","title":"A Unified Approach to Learning Ising Models: Beyond Independence and Bounded Width","created":"2023-11-15","cited_by_count":14,"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":"2104.00995","title":"Exponential Reduction in Sample Complexity with Learning of Ising Model Dynamics","created":"2021-04-02","cited_by_count":6,"area":null},{"id":"2511.21008","title":"Estimating Ising Models in Total Variation Distance","created":"2025-11-26","cited_by_count":3,"area":null},{"id":"2401.01404","title":"Scalable network reconstruction in subquadratic time","created":"2024-01-02","cited_by_count":2,"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":"2403.18578","title":"SteinGen: Generating Fidelitous and Diverse Graph Samples","created":"2024-03-27","cited_by_count":1,"area":null},{"id":"2605.10237","title":"The Benefits of Temporal Correlations: SGD Learns k-Juntas from Random Walks Efficiently","created":"2026-05-11","cited_by_count":1,"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":"2112.01061","title":"Data-Driven Interaction Analysis of Line Failure Cascading in Power Grid Networks","created":"2021-12-02","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":"2505.15688","title":"A packing lemma for VCN${}_k$-dimension and learning high-dimensional data","created":"2025-05-21","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}