paper-with-me

홈 › Papers

Fast and Scalable Learning of Sparse Changes in High-Dimensional Gaussian Graphical Model Structure

2017-10-30 · Beilun Wang, Arshdeep Sekhon, Yanjun Qi

We focus on the problem of estimating the change in the dependency structures of two $p$-dimensional Gaussian Graphical models (GGMs). Previous studies for sparse change estimation in GGMs involve expensive and difficult non-smooth optimization. We propose a novel method, DIFFEE for estimating DIFFerential networks via an Elementary Estimator under a high-dimensional situation. DIFFEE is solved through a faster and closed form solution that enables it to work in large-scale settings. We conduct a rigorous statistical analysis showing that surprisingly DIFFEE achieves the same asymptotic convergence rates as the state-of-the-art estimators that are much more difficult to compute. Our experimental results on multiple synthetic datasets and one real-world data about brain connectivity show strong performance improvements over baselines, as well as significant computational benefits.

📄 PDF Abstract BibTeX arXiv:1710.11223

Code (2)

QData/DIFFEE 공식 구현
QData/JointNets

Similar Papers 제목 키워드 기반

Large-scale Online Feature Selection for Ultra-high Dimensional Sparse Data

2014-09-27 · Yue Wu, Steven C. H. Hoi, Tao Mei, Nenghai Yu

Feature selection with large-scale high-dimensional data is important yet very challenging in machine learning and data mining. Online feature selection is a promising new paradigm that is more efficient and scalable tha…

feature selectionVocal Bursts Intensity Prediction

Fast and Scalable Spike and Slab Variable Selection in High-Dimensional Gaussian Processes

2021-11-08 · Hugh Dance, Brooks Paige

Variable selection in Gaussian processes (GPs) is typically undertaken by thresholding the inverse lengthscales of automatic relevance determination kernels, but in high-dimensional datasets this approach can be unreliab…

Gaussian ProcessesVariable SelectionVariational Inference

megaman: Manifold Learning with Millions of points

2016-03-09 · James McQueen, Marina Meila, Jacob VanderPlas, Zhongyue Zhang

Manifold Learning is a class of algorithms seeking a low-dimensional non-linear representation of high-dimensional data. Thus manifold learning algorithms are, at least in theory, most applicable to high-dimensional data…

Sequential change-point detection in high-dimensional Gaussian graphical models

2018-06-20 · Hossein Keshavarz, George Michailidis, Yves Atchade

High dimensional piecewise stationary graphical models represent a versatile class for modelling time varying networks arising in diverse application areas, including biology, economics, and social sciences. There has be…

Change Point DetectionVocal Bursts Intensity Prediction

SKIing on Simplices: Kernel Interpolation on the Permutohedral Lattice for Scalable Gaussian Processes

2021-06-12 · Sanyam Kapoor, Marc Finzi, Ke Alexander Wang, Andrew Gordon Wilson

State-of-the-art methods for scalable Gaussian processes use iterative algorithms, requiring fast matrix vector multiplies (MVMs) with the covariance kernel. The Structured Kernel Interpolation (SKI) framework accelerate…

Gaussian ProcessesGPU