arXiv Machine Learning

Distributionally Robust Set Representation Learning Under Inference-Time Element Corruption

arXiv:2605. 30089v2 Announce Type: replace Abstract: Standard Set Representation Learning methods typically excel on curated data but often overlook the challenge of inference-time element corruption.

arXiv Machine Learning
Jun 25

Learning with Monotone Adversarial Corruptions

arXiv:2601. 02193v2 Announce Type: replace Abstract: We study the extent to which standard machine learning algorithms rely on exchangeability and independence of data by introducing a monotone adversarial corruption model.

By Kasper Green Larsen, Chirag Pabbaraju, Abhishek Shetty
Hugging Face Trending Papers
6d ago

Wasserstein Filtering: A Sample Selection Method for Robust Distribution Learning

Given a dataset where a portion of the samples are contaminated, our goal is to recover the underlying clean population distribution. To this end, we propose Wasserstein Filtering (WF), a novel sample selection framework that discards a fraction of suspicious samples and estimates the target distribution using the empirical measure of the remaining data.