Sparse model selection in the highly under-sampled regime
From MaRDI portal
Publication:3302832
Abstract: We propose a method for recovering the structure of a sparse undirected graphical model when very few samples are available. The method decides about the presence or absence of bonds between pairs of variable by considering one pair at a time and using a closed form formula, analytically derived by calculating the posterior probability for every possible model explaining a two body system using Jeffreys prior. The approach does not rely on the optimisation of any cost functions and consequently is much faster than existing algorithms. Despite this time and computational advantage, numerical results show that for several sparse topologies the algorithm is comparable to the best existing algorithms, and is more accurate in the presence of hidden variables. We apply this approach to the analysis of US stock market data and to neural data, in order to show its efficiency in recovering robust statistical dependencies in real data with non stationary correlations in time and space.
Recommendations
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Sparse inverse covariance estimation with the graphical lasso
- Bayesian structure learning in sparse Gaussian graphical models
- High-dimensional graphs and variable selection with the Lasso
- Bayesian model selection with graph structured sparsity
Cites work
- scientific article; zbMATH DE number 3423418 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A new look at the statistical model identification
- An invariant form for the prior probability in estimation problems
- Approximating discrete probability distributions with dependence trees
- Belief propagation and replicas for inference and learning in a kinetic Ising model with hidden spins
- Compressed sensing
- Counting probability distributions: Differential geometry and model selection
- Dynamic instability in generic model of multi-assets markets
- Efficient Markov Network Structure Discovery Using Independence Tests
- Estimating the dimension of a model
- Estimation of sparse binary pairwise Markov networks using pseudo-likelihoods
- Expectation consistent approximate inference
- Fisher information and stochastic complexity
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- High-dimensional Ising model selection with Bayesian information criteria
- High-dimensional structure estimation in Ising models: local separation criterion
- Improving Markov network structure learning using decision trees
- Information, Physics, and Computation
- Learning factor graphs in polynomial time and sample complexity
- Reconstruction of Markov random fields from samples: some observations and algorithms
- Theory of Financial Risk and Derivative Pricing
- Universal coding, information, prediction, and estimation
Cited in
(5)- scientific article; zbMATH DE number 6283304 (Why is no real title available?)
- Selection procedures for sparse data
- Sparse structure selection and estimation
- On the complexity of logistic regression models
- Inferring neuronal couplings from spiking data using a systematic procedure with a statistical criterion
This page was built for publication: Sparse model selection in the highly under-sampled regime
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3302832)
