4 citations · 5 across the 6 of their papers we have counts for
8 papers · 1 filter
Deep Unsupervised Feature Selection by Discarding Nuisance and Correlated Features
Uri Shaham, Ofir Lindenbaum, Jonathan Svirsky +1
Modern datasets often contain large subsets of correlated features and nuisance features, which are not or loosely related to the main underlying structures of the data. Nuisance f…
Doubly-Stochastic Normalization of the Gaussian Kernel is Robust to Heteroskedastic Noise
Boris Landa, Ronald R. Coifman, Yuval Kluger
A fundamental step in many data-analysis techniques is the construction of an affinity matrix describing similarities between data points. When the data points reside in Euclidean…
Spectral neighbor joining for reconstruction of latent tree models
Ariel Jaffe, Noah Amsel, Yariv Aizenbud +3
A common assumption in multiple scientific applications is that the distribution of observed data can be modeled by a latent tree graphical model. An important example is phylogene…
Defending against Adversarial Images using Basis Functions Transformations
Uri Shaham, James Garritano, Yutaro Yamada +5
We study the effectiveness of various approaches that defend against adversarial attacks on deep networks via manipulations based on basis function representations of images. Speci…
Learning Binary Latent Variable Models: A Tensor Eigenpair Approach
Ariel Jaffe, Roi Weiss, Shai Carmi +2
Latent variable models with hidden binary units appear in various applications. Learning such models, in particular in the presence of noise, is a challenging computational problem…
Data-Driven Tree Transforms and Metrics
Gal Mishne, Ronen Talmon, Israel Cohen +2
We consider the analysis of high dimensional data given in the form of a matrix with columns consisting of observations and rows consisting of features. Often the data is such that…