paper-with-me

Papers

RoLNiP: Robust Learning Using Noisy Pairwise Comparisons

2023-03-04 · Samartha S Maheshwara, Naresh Manwani

This paper presents a robust approach for learning from noisy pairwise comparisons. We propose sufficient conditions on the loss function under which the risk minimization framework becomes robust to noise in the pairwise similar dissimilar data. Our approach does not require the knowledge of noise rate in the uniform noise case. In the case of conditional noise, the proposed method depends on the noise rates. For such cases, we offer a provably correct approach for estimating the noise rates. Thus, we propose an end-to-end approach to learning robust classifiers in this setting. We experimentally show that the proposed approach RoLNiP outperforms the robust state-of-the-art methods for learning with noisy pairwise comparisons.

📄 PDF Abstract BibTeX arXiv:2303.02341

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Robust Ordinal VAE: Employing Noisy Pairwise Comparisons for Disentanglement

2019-10-14 · Junxiang Chen, Kayhan Batmanghelich

Recent work by Locatello et al. (2018) has shown that an inductive bias is required to disentangle factors of interest in Variational Autoencoder (VAE). Motivated by a real-world problem, we propose a setting where such …

DisentanglementInductive Bias

Optimal Differentially Private Ranking from Pairwise Comparisons

2025-07-12 · T. Tony Cai, Abhinav Chakraborty, Yichen Wang arxiv

Data privacy is a central concern in many applications involving ranking from incomplete and noisy pairwise comparisons, such as recommendation systems, educational assessments, and opinion surveys on sensitive topics. I…

Recommendation Systems

Ordinal Regression using Noisy Pairwise Comparisons for Body Mass Index Range Estimation

2018-11-08 · Luisa Polania, Dongning Wang, Glenn Fung

Ordinal regression aims to classify instances into ordinal categories. In this paper, body mass index (BMI) category estimation from facial images is cast as an ordinal regression problem. In particular, noisy binary sea…

General Classificationregression

On the Sample Complexity of Rank Regression from Pairwise Comparisons

2021-05-04 · Berkan Kadioglu, Peng Tian, Jennifer Dy, Deniz Erdogmus 외

We consider a rank regression setting, in which a dataset of $N$ samples with features in $\mathbb{R}^d$ is ranked by an oracle via $M$ pairwise comparisons. Specifically, there exists a latent total ordering of the samp…

regression

Clustering and Inference From Pairwise Comparisons

2015-02-16 · Rui Wu, Jiaming Xu, R. Srikant, Laurent Massoulié 외

Given a set of pairwise comparisons, the classical ranking problem computes a single ranking that best represents the preferences of all users. In this paper, we study the problem of inferring individual preferences, ari…

Clustering