← Search

Ofir Lindenbaum

26 accepted papers

2026

No Prior, No Leakage: Revisiting Reconstruction Attacks in Trained Neural Networks

ICLR 2026poster

The memorization of training data by neural networks raises pressing concerns for privacy and security. Recent work has shown that, under certain conditions, portions of the training set can be reconstructed directly from model parameters. Some of these methods exploit implicit bias toward margin ma…

Cited by 0SourceScholar
2026

Unsupervised Feature Selection Through Group Discovery

AAAI 2026technical

Unsupervised feature selection (FS) is essential for high-dimensional learning tasks where labels are not available. It helps reduce noise, improve generalization, and enhance interpretability. However, most existing unsupervised FS methods evaluate features in isolation, even though informative sig

Cited by 0SourcePDFScholar
2025

AdaRankGrad: Adaptive Gradient Rank and Moments for Memory-Efficient LLMs Training and Fine-Tuning

ICLR 2025poster

Training and fine-tuning large language models (LLMs) come with challenges related to memory and computational requirements due to the increasing size of the model weights and the optimizer states. To tackle these challenges, various techniques have been developed, such as low-rank adaptation (LoRA)…

Cited by 3SourcePDFScholar
2025

COPER: Correlation-based Permutations for Multi-View Clustering

ICLR 2025spotlight

Combining data from different sources can improve data analysis tasks such as clustering. However, most of the current multi-view clustering methods are limited to specific domains or rely on a suboptimal and computationally intensive two-stage process of representation learning and clustering. We p…

Cited by 0SourcePDFScholar
2025

Hybrid Autoencoders for Tabular Data: Leveraging Model-Based Augmentation in Low-Label Settings

NeurIPS 2025poster

Deep neural networks often under-perform on tabular data due to their sensitivity to irrelevant features and a spectral bias toward smooth, low-frequency functions. These limitations hinder their ability to capture the sharp, high-frequency signals that often define tabular structure, especially und…

Cited by 0SourceScholar
2025

Partition First, Embed Later: Laplacian-Based Feature Partitioning for Refined Embedding and Visualization of High-Dimensional Data

ICML 2025oral

Embedding and visualization techniques are essential for analyzing high-dimensional data, but they often struggle with complex data governed by multiple latent variables, potentially distorting key structural characteristics. This paper considers scenarios where the observed features can be partitio…

Cited by 0SourcePDFScholar
2025

SUMO: Subspace-Aware Moment-Orthogonalization for Accelerating Memory-Efficient LLM Training

NeurIPS 2025poster

Low-rank gradient-based optimization methods have significantly improved memory efficiency during the training of large language models (LLMs), enabling operations within constrained hardware without sacrificing performance. However, these methods primarily emphasize memory savings, often overlookin…

Cited by 0SourceScholar
2024

Anomaly Detection with Variance Stabilized Density Estimation

UAI 2024poster

We propose a modified density estimation problem that is highly effective for detecting anomalies in tabular data. Our approach assumes that the density function is relatively stable (with lower variance) around normal samples. We have verified this hypothesis empirically using a wide range of real-…

2024

Contextual Feature Selection with Conditional Stochastic Gates

ICML 2024poster

Feature selection is a crucial tool in machine learning and is widely applied across various scientific disciplines. Traditional supervised methods generally identify a universal set of informative features for the entire population. However, feature relevance often varies with context, while the co…

Cited by 3SourcePDFScholar
2024

Knowledge Editing in Language Models via Adapted Direct Preference Optimization

EMNLP 2024finding

Large Language Models (LLMs) can become outdated over time as they may lack updated world knowledge, leading to factual knowledge errors and gaps. Knowledge Editing (KE) aims to overcome this challenge using weight updates that do not require expensive retraining. We propose treating KE as an LLM al…

Cited by 9SourcePDFScholar
2024

Transductive and Inductive Outlier Detection with Robust Autoencoders

UAI 2024poster

Accurate detection of outliers is crucial for the success of numerous data analysis tasks. In this context, we propose the Probabilistic Robust AutoEncoder (PRAE) that can simultaneously remove outliers during training (transductive) and learn a mapping that can be used to detect outliers in new dat…

Cited by 2SourcePDFScholar
2024

Unsupervised Acoustic Scene Mapping Based on Acoustic Features and Dimensionality Reduction

ICASSP 2024accepted

Classical methods for acoustic scene mapping require the estimation of the time difference of arrival (TDOA) between microphones. Unfortunately, TDOA estimation is very sensitive to reverberation and additive noise. We introduce an unsupervised data-driven approach that exploits the natural structur…

Cited by 0SourceScholar
2023

Multi-modal differentiable unsupervised feature selection

UAI 2023poster

Multi-modal high throughput biological data presents a great scientific opportunity and a significant computational challenge. In multi-modal measurements, every sample is observed simultaneously by two or more sets of sensors. In such settings, many observed variables in both modalities are often n…

2022

Locally Sparse Neural Networks for Tabular Biomedical Data

ICML 2022spotlight

Tabular datasets with low-sample-size or many variables are prevalent in biomedicine. Practitioners in this domain prefer linear or tree-based models over neural networks since the latter are harder to interpret and tend to overfit when applied to tabular datasets. To address these neural networks’…

2021

Differentiable Unsupervised Feature Selection based on a Gated Laplacian

NeurIPS 2021poster

Scientific observations may consist of a large number of variables (features). Selecting a subset of meaningful features is often crucial for identifying patterns hidden in the ambient space. In this paper, we present a method for unsupervised feature selection, and we demonstrate its advantage in c…

2020

Variational Diffusion Autoencoders with Random Walk Sampling

ECCV 2020poster

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. This is a construction that strives to de…