neurise
LearningofDiscreteGraphicalModelswithNeural Networks SupplementaryMaterial
This document contains supplementary materials for the paper "Learning of Discrete Graphical Models with Neural Networks". This is an adversarial experiment for NeurISE when compared to GRISE. GRISE will learn this model in the second level of its hierarchy with O(p) parameters per optimization. The neural net used here is [d=3, w=15]. The θ parameters here are chosen uniformly from [0.3,1.3].
- North America > Canada > British Columbia > Metro Vancouver Regional District > Vancouver (0.05)
- Asia > India > Karnataka > Bengaluru (0.05)
- North America > United States > New Mexico > Los Alamos County > Los Alamos (0.04)
- North America > Canada (0.04)
- Europe > United Kingdom > England > Cambridgeshire > Cambridge (0.04)
- Asia > India > Karnataka > Bengaluru (0.04)
Learning of Discrete Graphical Models with Neural Networks
Graphical models are widely used in science to represent joint probability distributions with an underlying conditional dependence structure. The inverse problem of learning a discrete graphical model given i.i.d samples from its joint distribution can be solved with near-optimal sample complexity using a convex optimization method known as Generalized Regularized Interaction Screening Estimator (GRISE). But the computational cost of GRISE becomes prohibitive when the energy function of the true graphical model has higher order terms. We introduce NeurISE, a neural net based algorithm for graphical model learning, to tackle this limitation of GRISE. We use neural nets as function approximators in an Interaction Screening objective function.
- North America > United States > New Mexico > Los Alamos County > Los Alamos (0.04)
- North America > Canada > British Columbia > Metro Vancouver Regional District > Vancouver (0.04)
- Asia > India > Karnataka > Bengaluru (0.04)
Learning of Discrete Graphical Models with Neural Networks
Graphical models are widely used in science to represent joint probability distributions with an underlying conditional dependence structure. The inverse problem of learning a discrete graphical model given i.i.d samples from its joint distribution can be solved with near-optimal sample complexity using a convex optimization method known as Generalized Regularized Interaction Screening Estimator (GRISE). But the computational cost of GRISE becomes prohibitive when the energy function of the true graphical model has higher order terms. We introduce NeurISE, a neural net based algorithm for graphical model learning, to tackle this limitation of GRISE. We use neural nets as function approximators in an Interaction Screening objective function.
- North America > United States > New Mexico > Los Alamos County > Los Alamos (0.04)
- North America > Canada (0.04)
- Europe > United Kingdom > England > Cambridgeshire > Cambridge (0.04)
- Asia > India > Karnataka > Bengaluru (0.04)
Learning of Discrete Graphical Models with Neural Networks
Graphical models are widely used in science to represent joint probability distributions with an underlying conditional dependence structure. The inverse problem of learning a discrete graphical model given i.i.d samples from its joint distribution can be solved with near-optimal sample complexity using a convex optimization method known as Generalized Regularized Interaction Screening Estimator (GRISE). But the computational cost of GRISE becomes prohibitive when the energy function of the true graphical model has higher order terms. We introduce NeurISE, a neural net based algorithm for graphical model learning, to tackle this limitation of GRISE. We use neural nets as function approximators in an Interaction Screening objective function.