ISIT · 2014
Group Testing with Prior Statistics
IEEE International Symposium on Information Theory
How can prior probabilities reduce the number of group tests?
Adaptive and nonadaptive testing algorithms exploit heterogeneous prior probabilities of defective items. Under the stated independence and sparsity assumptions, their measurement requirements approach information theoretic lower bounds up to explicit constant factors.
Research themes
Cite this paper
Tongxin Li, Chun Lam Chan, Wenhao Huang, Tarik Kaced, Sidharth Jaggi. Group Testing with Prior Statistics. IEEE International Symposium on Information Theory, 2014. https://doi.org/10.1109/ISIT.2014.6875253
BibTeX
@inproceedings{tongxin-group-testing,
title = {{Group Testing with Prior Statistics}},
author = {Tongxin Li and Chun Lam Chan and Wenhao Huang and Tarik Kaced and Sidharth Jaggi},
year = {2014},
booktitle = {IEEE International Symposium on Information Theory},
url = {https://doi.org/10.1109/ISIT.2014.6875253},
doi = {10.1109/ISIT.2014.6875253}
}
Related papers
Adaptive Riemannian Graph Neural Networks
ARGNN learns a node specific Riemannian metric instead of imposing one fixed curvature on an entire graph. A diagonal metric parameterization and geometric regularization support efficient training, with convergence analysis and experiments on homophilic and heterophilic graphs.
How can a graph model adapt to different local geometries? information theory graph learning sample complexity compressed sensing graph neural networks Riemannian geometryEnergy Injection Identification enabled Disaggregation with Deep Multi-Task Learning
DualNILM jointly recognizes appliance states and identifies energy injected behind the meter. Its transformer architecture combines temporal learning tasks to separate consumption from injections, with evaluation on measured and synthesized datasets.
Can appliances be identified when solar and storage obscure meter readings? AI for energy electric vehicle charging demand response renewable energy load forecasting decarbonization information theory graph learning sample complexity compressed sensing graph neural networks Riemannian geometryLeveraging Machine-Learned Advice in Strategic Interactions with No-Regret Learners
A measure of advice quality connects simulators and payoff predictions to strategic performance. The paper establishes benefits of reliable advice for approximate Stackelberg play and limitations on simultaneously exploiting accurate advice and protecting against inaccurate advice.
How useful is imperfect advice against an adaptive opponent? game theory learning in games Bayesian games Stackelberg strategies equity public models learning augmented algorithms algorithms with predictions competitive analysis robustness consistency online optimization