Approximate inference using DC programming for collective graphical models
Collective graphical models (CGMs) provide a framework for reasoning about a population of independent and identically distributed individuals when only noisy and aggregate observations are given. Previous approaches for inference in CGMs work on a junction-tree representation, thereby highly limiti...
Saved in:
Main Authors: | NGUYEN, Duc Thien, Akshat KUMAR, LAU, Hoong Chuin, SHELDON, Daniel |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2016
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3400 https://ink.library.smu.edu.sg/context/sis_research/article/4401/viewcontent/ApproximateInterference.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
APPROXIMATE INFERENCE FOR COMPLEX MODELS
by: YU XUEJUN
Published: (2022) -
Probabilistic combinatorial optimization: Moments, semidefinite programming, and asymptotic bounds
by: Bertsimas, D., et al.
Published: (2013) -
Limit theorems for the number of maxima in random samples from planar regions
by: Bai, Z.-D., et al.
Published: (2014) -
ADVANCES IN COOPERATON TECHNIQUES FOR WIRELESS COMMUNICATION NETWORKS
by: GUO YINGHAO
Published: (2017) -
Uniform nonparametric inference for time series
by: LI, Jia, et al.
Published: (2020)