paper-with-me

Papers

Cooperative neural networks (CoNN): Exploiting prior independence structure for improved classification

2019-06-01 · NeurIPS 2018 12 · Harsh Shrivastava, Eugene Bart, Bob Price, Hanjun Dai, Bo Dai, Srinivas Aluru

We propose a new approach, called cooperative neural networks (CoNN), which uses a set of cooperatively trained neural networks to capture latent representations that exploit prior given independence structure. The model is more flexible than traditional graphical models based on exponential family distributions, but incorporates more domain specific prior structure than traditional deep networks or variational autoencoders. The framework is very general and can be used to exploit the independence structure of any graphical model. We illustrate the technique by showing that we can transfer the independence structure of the popular Latent Dirichlet Allocation (LDA) model to a cooperative neural network, CoNN-sLDA. Empirical evaluation of CoNN-sLDA on supervised text classification tasks demonstrates that the theoretical advantages of prior independence structure can be realized in practice -we demonstrate a 23\% reduction in error on the challenging MultiSent data set compared to state-of-the-art.

📄 PDF Abstract BibTeX arXiv:1906.00291

Code (0)

등록된 구현이 없습니다.

Tasks

General Classificationtext-classificationText Classification

Similar Papers 제목 키워드 기반

Complexity of Decentralized Control: Special Cases

2009-12-01 · NeurIPS 2009 12 · Martin Allen, Shlomo Zilberstein

The worst-case complexity of general decentralized POMDPs, which are equivalent to partially observable stochastic games (POSGs) is very high, both for the cooperative and competitive cases. Some reductions in complexit…

Convergence Rates for Gaussian Mixtures of Experts

2019-07-09 · Nhat Ho, Chiao-Yu Yang, Michael. I. Jordan

We provide a theoretical treatment of over-specified Gaussian mixtures of experts with covariate-free gating networks. We establish the convergence rates of the maximum likelihood estimation (MLE) for these models. Our p…

parameter estimation

Model-based Multi-Agent Reinforcement Learning with Cooperative Prioritized Sweeping

2020-01-15 · Eugenio Bargiacchi, Timothy Verstraeten, Diederik M. Roijers, Ann Nowé

We present a new model-based reinforcement learning algorithm, Cooperative Prioritized Sweeping, for efficient learning in multi-agent Markov decision processes. The algorithm allows for sample-efficient learning on larg…

Model-based Reinforcement LearningMulti-agent Reinforcement LearningQ-Learningreinforcement-learning+2

Learning to Coordinate with Coordination Graphs in Repeated Single-Stage Multi-Agent Decision Problems

2018-07-01 · ICML 2018 7 · Eugenio Bargiacchi, Timothy Verstraeten, Diederik Roijers, Ann Nowé 외

Learning to coordinate between multiple agents is an important problem in many reinforcement learning problems. Key to learning to coordinate is exploiting loose couplings, i.e., conditional independences between ag…

Multi-Armed BanditsQ-LearningReinforcement Learning

Exploiting Independent Instruments: Identification and Distribution Generalization

2022-02-03 · Sorawit Saengkyongam, Leonard Henckel, Niklas Pfister, Jonas Peters

Instrumental variable models allow us to identify a causal function between covariates $X$ and a response $Y$, even in the presence of unobserved confounding. Most of the existing estimators assume that the error term in…

Econometrics