Optimizing Binary Symptom Checkers via Approximate Message Passing
원문 초록
Symptom checkers have been widely adopted as an intelligent e-healthcare application during the ongoing pandemic crisis. Their performance have been limited by the fine-grained quality of the collected medical knowledge between symptom and diseases. While the binarization of the relationships between symptoms and diseases simplifies the data collection process, it also leads to non-convex optimization problems during the inference step. In this paper, we formulate the symptom checking problem as an underdertermined non-convex optimization problem, thereby justifying the use of the compressive sensing framework to solve it. We show that the generalized vector approximate message passing (G-VAMP) algorithm provides the best performance for binary symptom checkers.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A Sample Efficient Conditional Independence Test in the Presence of Discretization
Discrete and Continuous Difference of Submodular Minimization
Knockoff-Guided Compressive Sensing: A Statistical Machine Learning Framework for Support-Assured Signal Recovery
RoBiS: Robust Binary Segmentation for High-Resolution Industrial Images
Addition is almost all you need: Compressing neural networks with double binary factorization
Physics-guided and fabrication-aware inverse design of photonic devices using diffusion models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.