scientific article; zbMATH DE number 7370576
From MaRDI portal
Publication:4998959
Dionysios S. Kalogerias, Konstantinos E. Nikolakakis, Anand Dilip Sarwate
Publication date: 9 July 2021
Full work available at URL: https://arxiv.org/abs/1812.04700
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
noisy dataIsing modelstructure learningpredictive learningChow-Liu algorithmdistribution estimationhidden Markov random fields
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Can local particle filters beat the curse of dimensionality?
- Estimation of high-dimensional graphical models using regularized score matching
- Sparse inverse covariance estimation with the graphical lasso
- Learning loopy graphical models with latent variables: efficient methods and guarantees
- Hoeffding's inequality for supermartingales
- Gibbs measures and phase transitions.
- Robust graphical modeling of gene networks using classical and alternative \(t\)-distributions
- Observability and nonlinear filtering
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- Self-organizing Ising model of financial markets
- Some extensions of score matching
- Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
- A few logs suffice to build (almost) all trees. II
- High-dimensional consistency in score-based and hybrid structure learning
- Learning a tree-structured Ising model in order to make predictions
- High-dimensional Ising model selection with Bayesian information criteria
- Strong data-processing inequalities for channels and Bayesian networks
- Consistency of the maximum likelihood estimator for general hidden Markov models
- Randomized Response: A Survey Technique for Eliminating Evasive Answer Bias
- Optimal phylogenetic reconstruction
- Tensor decompositions for learning latent variable models
- Robust estimators for nondecomposable elliptical graphical models
- Efficiently Learning Ising Models on Arbitrary Graphs
- An Introduction to Transfer Entropy
- Strong Data Processing Inequalities and <inline-formula> <tex-math notation="LaTeX">$\Phi $ </tex-math> </inline-formula>-Sobolev Inequalities for Discrete Channels
- Improved Greedy Algorithms for Learning Graphical Models
- What Can We Learn Privately?
- Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
- Elliptical graphical modelling
- Graphical Models with R
- Probability Inequalities for the Sum of Independent Random Variables
- Model selection and estimation in the Gaussian graphical model
- Graphical Models, Exponential Families, and Variational Inference
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Learning Gaussian Tree Models: Analysis of Error Exponents and Extremal Structures
- Testing Ising Models
- Grid Based Nonlinear Filtering Revisited: Recursive Estimation & Asymptotic Optimality
- Tree-based reparameterization framework for analysis of sum-product and related algorithms
- Graphical lassos for meta‐elliptical distributions
- Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
- High Dimensional Semiparametric Latent Graphical Model for Mixed Data
- Elements of Information Theory
- Approximating discrete probability distributions with dependence trees
- Theory of Cryptography
