Computational implications of reducing data to sufficient statistics (Q887274): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1409.3821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-dimensional structure estimation in Ising models: local separation criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Distinguishing Markov Random Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability after Uniqueness Phase Transition in Two-Spin Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistent estimation of the basic neighborhood of Markov random fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of exponential families / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of two‐state spin systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Random-Cluster Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neural networks and physical systems with emergent collective computational abilities. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-dimensional graphs and variable selection with the Lasso / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information, Physics, and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Greedy Algorithms for Learning Graphical Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting in two-spin models on \(d\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy, optimization and counting / rank
 
Normal rank

Latest revision as of 23:06, 10 July 2024

scientific article
Language Label Description Also known as
English
Computational implications of reducing data to sufficient statistics
scientific article

    Statements

    Computational implications of reducing data to sufficient statistics (English)
    0 references
    28 October 2015
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references