On the public citation graph
The minimax learning rates of normal and Ising undirected graphical models
0 signed · 47 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1952.tb01393.xopenalex-snapshot
A Comparison of Signalling Alphabets
inferredcites →https://doi.org/10.1007/978-1-4612-1358-1openalex-snapshot
High Dimensional Probability II
inferredcites →https://doi.org/10.1007/978-1-4612-1880-7_29openalex-snapshot
Assouad, Fano, and Le Cam
inferredcites →https://doi.org/10.1007/978-1-4612-4946-7openalex-snapshot
Asymptotic Methods in Statistical Decision Theory
inferredcites →https://doi.org/10.1007/978-1-4613-0125-7openalex-snapshot
Combinatorial Methods in Density Estimation
inferredcites →https://doi.org/10.1007/978-3-642-22253-5openalex-snapshot
Mean Field Models for Spin Glasses
inferredcites →https://doi.org/10.1007/b13794openalex-snapshot
Introduction to Nonparametric Estimation
inferredcites →https://doi.org/10.1016/0016-0032(59)90368-0openalex-snapshot
Information theory and statistics
inferredcites →https://doi.org/10.1088/1751-8113/45/38/385001openalex-snapshot
Rigorous results on the bipartite mean-field model
inferredcites →https://doi.org/10.1093/acprof:oso/9780199535255.001.0001openalex-snapshot
Concentration Inequalities
inferredcites →https://doi.org/10.1109/focs.2017.39openalex-snapshot
Learning Graphical Models Using Multiplicative Weights
inferredcites →https://doi.org/10.1109/tit.2012.2191659openalex-snapshot
Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions
inferredcites →https://doi.org/10.1137/1116025openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1145/195058.195155openalex-snapshot
On the learnability of discrete distributions
inferredcites →https://doi.org/10.1145/2746539.2746631openalex-snapshot
Efficiently Learning Ising Models on Arbitrary Graphs
inferredcites →https://doi.org/10.1201/b19567-24openalex-snapshot
Learning Structured Distributions Ilias Diakonikolas
inferredcites →https://doi.org/10.1214/13-aop862openalex-snapshot
Complexity of random smooth functions on the high-dimensional sphere
inferredcites →https://doi.org/10.1214/aop/1176995384openalex-snapshot
Central Limit Theorems for Empirical Measures
inferredcites →https://doi.org/10.1214/aos/1193342380openalex-snapshot
Convergence of Estimates Under Dimensionality Restrictions
inferredcites →https://doi.org/10.1214/lnms/1215090078openalex-snapshot
Estimation of analytic functions
inferredcites →https://doi.org/10.2307/2289176openalex-snapshot
Nonparametric Density Estimation: The L 1 View.
inferredcites →https://doi.org/10.48550/arxiv.1402.4746openalex-snapshot
Near-optimal-sample estimators for spherical Gaussian mixtures
inferredcites →https://doi.org/10.48550/arxiv.1411.1434openalex-snapshot
On the Information Theoretic Limits of Learning Ising Models
inferredcites →https://doi.org/10.48550/arxiv.1605.07252openalex-snapshot
Interaction Screening: Efficient and Sample-Optimal Learning of Ising Models
inferredcites →https://doi.org/10.48550/arxiv.1705.11107openalex-snapshot
Information Theoretic Properties of Markov Random Fields, and their Algorithmic Applications
inferredcites →https://doi.org/10.48550/arxiv.1710.05209openalex-snapshot
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussians Mixtures via Compression Schemes
inferredcites →https://doi.org/10.7551/mitpress/8291.003.0026openalex-snapshot
Adaptive Computation and Machine Learning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.jmva.2024.105335openalex-snapshot
Tensor recovery in high-dimensional Ising models
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00049openalex-snapshot
Chow-Liu++: Optimal Prediction-Centric Learning of Tree Ising Models
inferred← citeshttps://doi.org/10.1109/tit.2022.3207420openalex-snapshot
Estimating Structurally Similar Graphical Models
inferred← citeshttps://doi.org/10.1137/22m1489678openalex-snapshot
Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu
inferred← citeshttps://doi.org/10.1145/3391403.3399541openalex-snapshot
Multi-Item Mechanisms without Item-Independence: Learnability via Robustness
inferred← citeshttps://doi.org/10.1145/3406325.3451066openalex-snapshot
Near-optimal learning of tree-structured distributions by Chow-Liu
inferred← citeshttps://doi.org/10.1145/3417994openalex-snapshot
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes
inferred← citeshttps://doi.org/10.1145/3564246.3585209openalex-snapshot
Learning Polynomial Transformations via Generalized Tensor Decompositions
inferred← citeshttps://doi.org/10.1145/3618260.3649674openalex-snapshot
A Unified Approach to Learning Ising Models: Beyond Independence and Bounded Width
inferred← citeshttps://doi.org/10.22331/q-2024-04-30-1319openalex-snapshot
Learning quantum many-body systems from a few copies
inferred← citeshttps://doi.org/10.48550/arxiv.1710.05209openalex-snapshot
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussians Mixtures via Compression Schemes
inferred← citeshttps://doi.org/10.48550/arxiv.1805.00216openalex-snapshot
Privately Learning High-Dimensional Distributions
inferred← citeshttps://doi.org/10.48550/arxiv.2002.09463openalex-snapshot
Privately Learning Markov Random Fields
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.