{"total":21,"rows":[{"id":"2310.02243","title":"Learning quantum Hamiltonians at any temperature in polynomial time","created":"2023-10-03","cited_by_count":23,"area":null},{"id":"2102.02171","title":"Outlier-Robust Learning of Ising Models Under Dobrushin's Condition","created":"2021-02-03","cited_by_count":14,"area":null},{"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":"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":"2211.13291","title":"Learning and Testing Latent-Tree Ising Models Efficiently","created":"2022-11-23","cited_by_count":7,"area":null},{"id":"2311.03332","title":"Learning Hard-Constrained Models with One Sample","created":"2023-11-06","cited_by_count":7,"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":"2411.11174","title":"Learning the Sherrington-Kirkpatrick Model Even at Low Temperature","created":"2024-11-17","cited_by_count":5,"area":null},{"id":"2506.00764","title":"Learning Juntas under Markov Random Fields","created":"2025-06-01","cited_by_count":3,"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":"2411.03163","title":"Efficient Hamiltonian, structure and trace distance learning of Gaussian states","created":"2024-11-05","cited_by_count":2,"area":null},{"id":"2509.20993","title":"Learning the Inverse Temperature of Ising Models under Hard Constraints using One Sample","created":"2025-09-25","cited_by_count":1,"area":null},{"id":"2607.08303","title":"Learning $\\mathsf{AC}^0$ under Locally Sampleable Graphical Models","created":"2026-07-09","cited_by_count":1,"area":null},{"id":"2102.08554","title":"Recoverability Landscape of Tree Structured Markov Random Fields under Symmetric Noise","created":"2021-02-17","cited_by_count":0,"area":null},{"id":"2310.13232","title":"Interaction Screening and Pseudolikelihood Approaches for Tensor Learning in Ising Models","created":"2023-10-20","cited_by_count":0,"area":null},{"id":"2406.09338","title":"Learning the Influence Graph of a High-Dimensional Markov Process with Memory","created":"2024-06-13","cited_by_count":0,"area":null},{"id":"2407.11473","title":"Quantum Maximum Entropy Inference and Hamiltonian Learning","created":"2024-07-16","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":"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}