scientific article; zbMATH DE number 7255140

MaRDI QIDQ4969177

Chao Gao, Youngseok Kim

Publication date: 5 October 2020

Full work available at URL: https://arxiv.org/abs/1902.03316

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

variational inferencesparse linear regressionbiclusteringgraph Laplacianexpectation maximizationspike-and-slab prior

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Linear regression; mixed models (62J05) Bayesian problems; characterization of Bayes procedures (62C10) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Graph signal denoising using \(t\)-shrinkage priors ⋮ Unnamed Item

Uses Software

• R
• UNLocBoX
• SSS
• BGLR
• sparcl
• KronFit
• isotone
• genlasso

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The solution path of the generalized lasso
• Risk bounds for model selection via penalization
• Sparse regression with exact clustering
• Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs
• A dual active-set algorithm for regularized monotonic regression
• Evolutionary stochastic search for Bayesian model exploration
• Isotonic regression: Another look at the changepoint problem
• Optimal Estimation and Completion of Matrices with Biclustering Structures
• Proximal Splitting Methods in Signal Processing
• Volume Ratio, Sparsity, and Minimaxity Under Unitarily Invariant Norms
• Biclustering via Sparse Singular Value Decomposition
• Rao–Blackwellization for Bayesian Variable Selection and Model Averaging in Linear and Binary Regression: A Novel Data Augmentation Approach
• Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
• An Algorithm for Restricted Least Squares Regression
• Graphical Models, Exponential Families, and Variational Inference
• Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
• Bayesian Variable Selection in Linear Regression
• The Reduced Monotonic Regression Method
• Submatrix localization via message passing
• Sparsity and Smoothness Via the Fused Lasso
• The Spike-and-Slab LASSO
• A Bayesian Analysis for Change Point Problems
• Finding and certifying a large hidden clique in a semirandom graph
• EMVS: The EM Approach to Bayesian Variable Selection
• A Simple New Approach to Variable Selection in Regression, with Application to Genetic Fine Mapping
• A Framework for Feature Selection in Clustering
• Bayesian Variable Selection in Structured High-Dimensional Covariate Spaces With Applications in Genomics
• Shotgun Stochastic Search for “Largep” Regression
• Convex biclustering
• Minimizing Effective Resistance of a Graph
• Simultaneous Regression Shrinkage, Variable Selection, and Supervised Clustering of Predictors with OSCAR

This page was built for publication: