Sparse and low-rank matrix regularization for learning time-varying Markov networks
DOI10.1007/S10994-016-5568-6zbMATH Open1454.68122OpenAlexW2465084082WikidataQ55499129 ScholiaQ55499129MaRDI QIDQ1689602FDOQ1689602
Authors: Jun-ichiro Hirayama, Aapo Hyvärinen, Shin Ishii 
Publication date: 12 January 2018
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-016-5568-6
Recommendations
alternating direction method of multipliersnuclear-norm regularizationL1-norm regularizationtime-varying Markov network
Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22)
Cites Work
- Clustering by passing messages between data points
- Numerical Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- High-dimensional graphs and variable selection with the Lasso
- Atomic Decomposition by Basis Pursuit
- Model Selection and Estimation in Regression with Grouped Variables
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Sparse inverse covariance estimation with the graphical lasso
- Estimation of sparse binary pairwise Markov networks using pseudo-likelihoods
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- A Singular Value Thresholding Algorithm for Matrix Completion
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- The Group Lasso for Logistic Regression
- Title not available (Why is that?)
- Efficiency of pseudolikelihood estimation for simple Gaussian fields
- Local Regression and Likelihood
- Title not available (Why is that?)
- Proximal methods for hierarchical sparse coding
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- The composite absolute penalties family for grouped and hierarchical variable selection
- Probabilistic graphical models.
- Time varying undirected graphs
- Estimating time-varying networks
- Alternating direction method for covariance selection models
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Title not available (Why is that?)
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Restoration of Poissonian Images Using Alternating Direction Optimization
- Dynamic matrix-variate graphical models
- Finding approximately rank-one submatrices with the nuclear norm and \(\ell_1\)-norm
- Consistency of Pseudolikelihood Estimation of Fully Visible Boltzmann Machines
Cited In (6)
- Direct Learning of Sparse Changes in Markov Networks by Density Ratio Estimation
- Learning short multivariate time series models through evolutionary and sparse matrix computation
- Structured learning of time-varying networks with application to \(\mathrm{PM}_{2.5}\) data
- CMD: controllable matrix decomposition with global optimization for deep neural network compression
- Innovated scalable dynamic learning for time-varying graphical models
- Support consistency of direct sparse-change learning in Markov networks
Uses Software
This page was built for publication: Sparse and low-rank matrix regularization for learning time-varying Markov networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689602)
