3 citations · 4 across the 4 of their papers we have counts for
4 papers
Learning Sample Reweighting for Accuracy and Adversarial Robustness
Chester Holtz, Tsui-Wei Weng, Gal Mishne
There has been great interest in enhancing the robustness of neural network classifiers to defend against adversarial perturbations through adversarial training, while balancing th…
Evaluating Disentanglement in Generative Models Without Knowledge of Latent Factors
Chester Holtz, Gal Mishne, Alexander Cloninger
Probabilistic generative models provide a flexible and systematic framework for learning the underlying geometry of data. However, model selection in this setting is challenging, p…
Comparative Analysis of Classic Garbage-Collection Algorithms for a Lisp-like Language
Tyler Hannan, Chester Holtz, Jonathan Liao
In this paper, we demonstrate the effectiveness of Cheney's Copy Algorithm for a Lisp-like system and experimentally show the infeasability of developing an optimal garbage collect…
A Refutation of the Clique-Based P=NP Proofs of LaPlante and Tamta-Pande-Dhami
Hector A. Cardenas, Chester Holtz, Maria Janczak +2
In this work, we critique two papers, "A Polynomial-Time Solution to the Clique Problem" by Tamta, Pande, and Dhami, and "A Polynomial-Time Algorithm For Solving Clique Problems" b…