Search Results for author: Ofir Lindenbaum

Found 34 papers, 11 papers with code

Self Supervised Correlation-based Permutations for Multi-View Clustering

no code implementations26 Feb 2024 Ran Eisenberg, Jonathan Svirsky, Ofir Lindenbaum

Fusing information from different modalities can enhance data analysis tasks, including clustering.

Clustering Pseudo Label

Contextual Feature Selection with Conditional Stochastic Gates

no code implementations21 Dec 2023 Ram Dyuthi Sristi, Ofir Lindenbaum, Maria Lavzin, Jackie Schiller, Gal Mishne, Hadas Benisty

We study the problem of contextual feature selection, where the goal is to learn a predictive function while identifying subsets of informative features conditioned on specific contexts.

feature selection

Gappy local conformal auto-encoders for heterogeneous data fusion: in praise of rigidity

no code implementations20 Dec 2023 Erez Peterfreund, Iryna Burak, Ofir Lindenbaum, Jim Gimlett, Felix Dietrich, Ronald R. Coifman, Ioannis G. Kevrekidis

Fusing measurements from multiple, heterogeneous, partial sources, observing a common object or process, poses challenges due to the increasing availability of numbers and types of sensors.

Local Distortion

Interpretable Deep Clustering

no code implementations7 Jun 2023 Jonathan Svirsky, Ofir Lindenbaum

Furthermore, we verify that our model leads to interpretable results at a sample and cluster level.

Clustering Deep Clustering +1

Neuronal Cell Type Classification using Deep Learning

no code implementations1 Jun 2023 Ofek Ophir, Orit Shefi, Ofir Lindenbaum

First, we classify neuronal cell types of mice data to identify excitatory and inhibitory neurons.

Classification Domain Adaptation

Anomaly Detection with Variance Stabilized Density Estimation

no code implementations1 Jun 2023 Amit Rozner, Barak Battash, Henry Li, Lior Wolf, Ofir Lindenbaum

Then, we design a variance stabilized density estimation problem for maximizing the likelihood of the observed samples while minimizing the variance of the density around normal samples.

Anomaly Detection Density Estimation

Multi-modal Differentiable Unsupervised Feature Selection

1 code implementation16 Mar 2023 Junchen Yang, Ofir Lindenbaum, Yuval Kluger, Ariel Jaffe

Multi-modal high throughput biological data presents a great scientific opportunity and a significant computational challenge.

feature selection

Revisiting the Noise Model of Stochastic Gradient Descent

no code implementations5 Mar 2023 Barak Battash, Ofir Lindenbaum

Following the central limit theorem, SGN was initially modeled as Gaussian, and lately, it has been suggested that stochastic gradient noise is better characterized using $S\alpha S$ L\'evy distribution.

Domain-Generalizable Multiple-Domain Clustering

1 code implementation31 Jan 2023 Amit Rozner, Barak Battash, Lior Wolf, Ofir Lindenbaum

This work generalizes the problem of unsupervised domain generalization to the case in which no labeled samples are available (completely unsupervised).

Clustering Domain Generalization

Unsupervised Acoustic Scene Mapping Based on Acoustic Features and Dimensionality Reduction

no code implementations1 Jan 2023 Idan Cohen, Ofir Lindenbaum, Sharon Gannot

Classical methods for acoustic scene mapping require the estimation of time difference of arrival (TDOA) between microphones.

Dimensionality Reduction

SG-VAD: Stochastic Gates Based Speech Activity Detection

1 code implementation28 Oct 2022 Jonathan Svirsky, Ofir Lindenbaum

Our key idea is to model VAD as a denoising task, and construct a network that is designed to identify nuisance features for a speech classification task.

Ranked #3 on Activity Detection on AVA-Speech (ROC-AUC metric)

Action Detection Activity Detection +1

Imbalanced Classification via a Tabular Translation GAN

no code implementations19 Apr 2022 Jonathan Gradstein, Moshe Salhov, Yoav Tulpan, Ofir Lindenbaum, Amir Averbuch

When presented with a binary classification problem where the data exhibits severe class imbalance, most standard predictive methods may fail to accurately model the minority class.

Binary Classification Classification +2

Support Recovery with Stochastic Gates: Theory and Application for Linear Models

1 code implementation29 Oct 2021 Soham Jana, Henry Li, Yutaro Yamada, Ofir Lindenbaum

Consider the problem of simultaneous estimation and support recovery of the coefficient vector in a linear data model with additive Gaussian noise.

Deep Unsupervised Feature Selection by Discarding Nuisance and Correlated Features

1 code implementation11 Oct 2021 Uri Shaham, Ofir Lindenbaum, Jonathan Svirsky, Yuval Kluger

Experimenting on several real-world datasets, we demonstrate that our proposed approach outperforms similar approaches designed to avoid only correlated or nuisance features, but not both.

feature selection

Probabilistic Robust Autoencoders for Outlier Detection

no code implementations1 Oct 2021 Ofir Lindenbaum, Yariv Aizenbud, Yuval Kluger

We first present the Robust AutoEncoder (RAE) objective as a minimization problem for splitting the data into inliers and outliers.

Anomaly Detection Outlier Detection

L0-Sparse Canonical Correlation Analysis

no code implementations ICLR 2022 Ofir Lindenbaum, Moshe Salhov, Amir Averbuch, Yuval Kluger

We further propose $\ell_0$-Deep CCA for solving the problem of non-linear sparse CCA by modeling the correlated representations using deep nets.

Locally Sparse Neural Networks for Tabular Biomedical Data

1 code implementation11 Jun 2021 Junchen Yang, Ofir Lindenbaum, Yuval Kluger

By forcing the model to select a subset of the most informative features for each sample, we reduce model overfitting in low-sample-size data and obtain an interpretable model.

Survival Analysis

$\ell_0$-based Sparse Canonical Correlation Analysis

1 code implementation12 Oct 2020 Ofir Lindenbaum, Moshe Salhov, Amir Averbuch, Yuval Kluger

We further propose $\ell_0$-Deep CCA for solving the problem of non-linear sparse CCA by modeling the correlated representations using deep nets.

Deep Gated Canonical Correlation Analysis

no code implementations28 Sep 2020 Ofir Lindenbaum, Moshe Salhov, Amir Averbuch, Yuval Kluger

The proposed procedure learns two non-linear transformations and simultaneously gates the input variables to identify a subset of most correlated variables.

Kernel-based parameter estimation of dynamical systems with unknown observation functions

no code implementations9 Sep 2020 Ofir Lindenbaum, Amir Sagiv, Gal Mishne, Ronen Talmon

A low-dimensional dynamical system is observed in an experiment as a high-dimensional signal; for example, a video of a chaotic pendulums system.

LOCA: LOcal Conformal Autoencoder for standardized data coordinates

no code implementations15 Apr 2020 Erez Peterfreund, Ofir Lindenbaum, Felix Dietrich, Tom Bertalan, Matan Gavish, Ioannis G. Kevrekidis, Ronald R. Coifman

We propose a deep-learning based method for obtaining standardized data coordinates from scientific measurements. Data observations are modeled as samples from an unknown, non-linear deformation of an underlying Riemannian manifold, which is parametrized by a few normalized latent variables.

The Spectral Underpinning of word2vec

no code implementations27 Feb 2020 Ariel Jaffe, Yuval Kluger, Ofir Lindenbaum, Jonathan Patsenker, Erez Peterfreund, Stefan Steinerberger

word2vec due to Mikolov \textit{et al.} (2013) is a word embedding method that is widely used in natural language processing.

Open-Ended Question Answering

Variational Diffusion Autoencoders with Random Walk Sampling

1 code implementation ECCV 2020 Henry Li, Ofir Lindenbaum, Xiuyuan Cheng, Alexander Cloninger

Variational autoencoders (VAEs) and generative adversarial networks (GANs) enjoy an intuitive connection to manifold learning: in training the decoder/generator is optimized to approximate a homeomorphism between the data distribution and the sampling space.

Geometry Based Data Generation

no code implementations NeurIPS 2018 Ofir Lindenbaum, Jay Stanley, Guy Wolf, Smita Krishnaswamy

We propose a new type of generative model for high-dimensional data that learns a manifold geometry of the data, rather than density, and can generate points evenly along this manifold.

Clustering

Feature Selection using Stochastic Gates

1 code implementation ICML 2020 Yutaro Yamada, Ofir Lindenbaum, Sahand Negahban, Yuval Kluger

Feature selection problems have been extensively studied for linear estimation, for instance, Lasso, but less emphasis has been placed on feature selection for non-linear functions.

feature selection

Geometry-Based Data Generation

1 code implementation14 Feb 2018 Ofir Lindenbaum, Jay S. Stanley III, Guy Wolf, Smita Krishnaswamy

Then, it generates new points evenly along the manifold by pulling randomly generated points into its intrinsic structure using a diffusion kernel.

Kernel Scaling for Manifold Learning and Classification

no code implementations4 Jul 2017 Ofir Lindenbaum, Moshe Salhov, Arie Yeredor, Amir Averbuch

We propose to set a scale parameter that is tailored to one of two types of tasks: classification and manifold learning.

Classification Clustering +2

Multi-View Kernel Consensus For Data Analysis

no code implementations28 Jun 2016 Moshe Salhov, Ofir Lindenbaum, Yariv Aizenbud, Avi Silberschatz, Yoel Shkolnisky, Amir Averbuch

Data analysis methods aim to uncover the underlying low dimensional structure imposed by the low dimensional hidden parameters by utilizing distance metrics that consider the set of attributes as a single monolithic set.

Attribute

MultiView Diffusion Maps

no code implementations23 Aug 2015 Ofir Lindenbaum, Arie Yeredor, Moshe Salhov, Amir Averbuch

The multi-view dimensionality reduction is achieved by defining a cross-view model in which an implied random walk process is restrained to hop between objects in the different views.

Anomaly Detection Clustering +1

Cannot find the paper you are looking for? You can Submit a new open access paper.