@article{srinivasavaradhan2022improving,
  title={Improving Group Testing via Gradient Descent},
  author={Srinivasavaradhan, Sundara Rajan and Nikolopoulos, Pavlos and Fragouli, Christina and Diggavi, Suhas},
  journal={IEEE International Symposium on Information theory},
  year={2022},
  type={1},
  tags={conf,PET},
  pages={2243-2248},
  url_arxiv={https://arxiv.org/abs/2201.12325},
  abstract={We study the problem of group testing with non-identical, independent priors. So far, the pooling strategies that have been proposed in the literature take the following approach: a hand-crafted test design along with a decoding strategy is proposed, and guarantees are provided on how many tests are sufficient in order to identify all infections in a population. In this paper, we take a different, yet perhaps more practical, approach: we fix the decoder and the number of tests, and we ask, given these, what is the best test design one could use? We explore this question for the Definite Non-Defectives (DND) decoder. We formulate a (non-convex) optimization problem, where the objective function is the expected number of errors for a particular design. We find approximate solutions via gradient descent, which we further optimize with informed initialization. We illustrate through simulations that our method can achieve significant performance improvement over traditional approaches.},
}

{"_id":"QJdLrT58bfXPvbFLY","bibbaseid":"srinivasavaradhan-nikolopoulos-fragouli-diggavi-improvinggrouptestingviagradientdescent-2022","author_short":["Srinivasavaradhan, S. R.","Nikolopoulos, P.","Fragouli, C.","Diggavi, S."],"bibdata":{"bibtype":"article","type":"1","title":"Improving Group Testing via Gradient Descent","author":[{"propositions":[],"lastnames":["Srinivasavaradhan"],"firstnames":["Sundara","Rajan"],"suffixes":[]},{"propositions":[],"lastnames":["Nikolopoulos"],"firstnames":["Pavlos"],"suffixes":[]},{"propositions":[],"lastnames":["Fragouli"],"firstnames":["Christina"],"suffixes":[]},{"propositions":[],"lastnames":["Diggavi"],"firstnames":["Suhas"],"suffixes":[]}],"journal":"IEEE International Symposium on Information theory","year":"2022","tags":"conf,PET","pages":"2243-2248","url_arxiv":"https://arxiv.org/abs/2201.12325","abstract":"We study the problem of group testing with non-identical, independent priors. So far, the pooling strategies that have been proposed in the literature take the following approach: a hand-crafted test design along with a decoding strategy is proposed, and guarantees are provided on how many tests are sufficient in order to identify all infections in a population. In this paper, we take a different, yet perhaps more practical, approach: we fix the decoder and the number of tests, and we ask, given these, what is the best test design one could use? We explore this question for the Definite Non-Defectives (DND) decoder. We formulate a (non-convex) optimization problem, where the objective function is the expected number of errors for a particular design. We find approximate solutions via gradient descent, which we further optimize with informed initialization. We illustrate through simulations that our method can achieve significant performance improvement over traditional approaches.","bibtex":"@article{srinivasavaradhan2022improving,\n title={Improving Group Testing via Gradient Descent},\n author={Srinivasavaradhan, Sundara Rajan and Nikolopoulos, Pavlos and Fragouli, Christina and Diggavi, Suhas},\n journal={IEEE International Symposium on Information theory},\n year={2022},\n type={1},\n tags={conf,PET},\n pages={2243-2248},\n url_arxiv={https://arxiv.org/abs/2201.12325},\n abstract={We study the problem of group testing with non-identical, independent priors. So far, the pooling strategies that have been proposed in the literature take the following approach: a hand-crafted test design along with a decoding strategy is proposed, and guarantees are provided on how many tests are sufficient in order to identify all infections in a population. In this paper, we take a different, yet perhaps more practical, approach: we fix the decoder and the number of tests, and we ask, given these, what is the best test design one could use? We explore this question for the Definite Non-Defectives (DND) decoder. We formulate a (non-convex) optimization problem, where the objective function is the expected number of errors for a particular design. We find approximate solutions via gradient descent, which we further optimize with informed initialization. We illustrate through simulations that our method can achieve significant performance improvement over traditional approaches.},\n}\n\n","author_short":["Srinivasavaradhan, S. R.","Nikolopoulos, P.","Fragouli, C.","Diggavi, S."],"key":"srinivasavaradhan2022improving","id":"srinivasavaradhan2022improving","bibbaseid":"srinivasavaradhan-nikolopoulos-fragouli-diggavi-improvinggrouptestingviagradientdescent-2022","role":"author","urls":{" arxiv":"https://arxiv.org/abs/2201.12325"},"metadata":{"authorlinks":{}},"downloads":11},"bibtype":"article","biburl":"https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib","dataSources":["xJuTMZ3nEiMJi5Y9f","hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77","2BHqTGHtDg7BjRAJQ","XpqzCLvCgsYBqbTpK","QNNZyNQzfeETJyTbL","Z6bBhKezwKd3pPWRc"],"keywords":[],"search_terms":["improving","group","testing","via","gradient","descent","srinivasavaradhan","nikolopoulos","fragouli","diggavi"],"title":"Improving Group Testing via Gradient Descent","year":2022,"downloads":11}