4 citations · 5 across the 5 of their papers we have counts for
15 papers
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…
Local Two-Sample Testing over Graphs and Point-Clouds by Random-Walk Distributions
Boris Landa, Rihao Qu, Joseph Chang +1
Rejecting the null hypothesis in two-sample testing is a fundamental tool for scientific discovery. Yet, aside from concluding that two samples do not come from the same probabilit…
Differentiable Unsupervised Feature Selection based on a Gated Laplacian
Ofir Lindenbaum, Uri Shaham, Jonathan Svirsky +2
Scientific observations may consist of a large number of variables (features). Identifying a subset of meaningful features is often ignored in unsupervised learning, despite its po…
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…
The Spectral Underpinning of word2vec
Ariel Jaffe, Yuval Kluger, Ofir Lindenbaum +3
word2vec due to Mikolov \textit{et al.} (2013) is a word embedding method that is widely used in natural language processing. Despite its great success and frequent use, theoretica…