Vincent Y. F. Tan

On the Maximum Size of Block Codes Subject to a Distance Criterion

2018 · IEEE Transactions on Information Theory

We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than d. The achievability argument involves an iterative construction of a set of radius-d balls, …

An Interpretable Intensive Care Unit Mortality Risk Calculator

2021 · 2021 43rd Annual International Conference of the IEEE Engineering in Medicine & Biology Society (EMBC)

Mortality risk is a major concern to patients who have just been discharged from the intensive care unit (ICU). Many studies have been directed to construct machine learning models to predict such risk. Although these …

CIFS: Improving Adversarial Robustness of CNNs via Channel-wise Importance-based Feature Selection

2021 · arXiv (Cornell University)

We investigate the adversarial robustness of CNNs from the perspective of channel-wise activations. By comparing \textit{non-robust} (normally trained) and \textit{robustified} (adversarially trained) models, we observe that adversarial training (AT) robustifies CNNs by aligning the channel-wise …

SGA: A Robust Algorithm for Partial Recovery of Tree-Structured\n Graphical Models with Noisy Samples

2021 · arXiv (Cornell University)

We consider learning Ising tree models when the observations from the nodes\nare corrupted by independent but non-identically distributed noise with unknown\nstatistics. Katiyar et al. (2020) showed that although the exact tree structure\ncannot be recovered, one …