1 code implementation • NAACL (ACL) 2022 • Seung Byum Seo, Hyoungwook Nam, Payam Delgosha
While there have been advances in Natural Language Processing (NLP), their success is mainly gained by applying a self-attention mechanism into single or multi-modalities.
no code implementations • 9 Mar 2022 • Payam Delgosha, Hamed Hassani, Ramtin Pedarsani
We introduce a classification method which employs a nonlinear component called truncation, and show in an asymptotic scenario, as long as the adversary is restricted to perturb no more than $\sqrt{d}$ data samples, we can almost achieve the optimal classification error in the absence of the adversary, i. e. we can completely neutralize adversary's effect.
no code implementations • 23 Jan 2022 • Mark Beliaev, Payam Delgosha, Hamed Hassani, Ramtin Pedarsani
In the past two decades we have seen the popularity of neural networks increase in conjunction with their classification accuracy.
no code implementations • 5 Apr 2021 • Payam Delgosha, Hamed Hassani, Ramtin Pedarsani
Under the assumption that data is distributed according to the Gaussian mixture model, our goal is to characterize the optimal robust classifier and the corresponding robust classification error as well as a variety of trade-offs between robustness, accuracy, and the adversary's budget.
no code implementations • 14 Mar 2019 • Payam Delgosha, Naveen Goela
Unlike deconvolution networks which generate continuous-valued data and which consist of upsampling filters and reverse pooling layers, multilayer switch networks are composed of adaptive switches which model conditional distributions of discrete random variables.
no code implementations • NeurIPS 2011 • Dominique Tschopp, Suhas Diggavi, Payam Delgosha, Soheil Mohajer
This paper addresses the problem of finding the nearest neighbor (or one of the $R$-nearest neighbors) of a query object $q$ in a database of $n$ objects, when we can only use a comparison oracle.