paper-with-me

Papers

Less is Better: Recovering Intended-Feature Subspace to Robustify NLU Models

2022-09-16 · COLING 2022 10 · Ting Wu, Tao Gui

Datasets with significant proportions of bias present threats for training a trustworthy model on NLU tasks. Despite yielding great progress, current debiasing methods impose excessive reliance on the knowledge of bias attributes. Definition of the attributes, however, is elusive and varies across different datasets. Furthermore, leveraging these attributes at input level to bias mitigation may leave a gap between intrinsic properties and the underlying decision rule. To narrow down this gap and liberate the supervision on bias, we suggest extending bias mitigation into feature space. Therefore, a novel model, Recovering Intended-Feature Subspace with Knowledge-Free (RISK) is developed. Assuming that shortcut features caused by various biases are unintended for prediction, RISK views them as redundant features. When delving into a lower manifold to remove redundancies, RISK reveals that an extremely low-dimensional subspace with intended features can robustly represent the highly biased dataset. Empirical results demonstrate our model can consistently improve model generalization to out-of-distribution set, and achieves a new state-of-the-art performance.

📄 PDF Abstract BibTeX arXiv:2209.07879

Code (1)

cuteythyme/risk 공식 구현 pytorch

Similar Papers 제목 키워드 기반

Phaseless Subspace Tracking

2018-09-11 · Seyedehsara Nayer, Namrata Vaswani

This work takes the first steps towards solving the "phaseless subspace tracking" (PST) problem. PST involves recovering a time sequence of signals (or images) from phaseless linear projections of each signal under the f…

Retrieval

Greedy Feature Selection for Subspace Clustering

2013-03-19 · Eva L. Dyer, Aswin C. Sankaranarayanan, Richard G. Baraniuk

Unions of subspaces provide a powerful generalization to linear subspace models for collections of high-dimensional data. To learn a union of subspaces from a collection of data, sets of signals in the collection that be…

Clusteringfeature selection

Subspace-Sparse Representation

2015-07-06 · C. You, R. Vidal

Given an overcomplete dictionary $A$ and a signal $b$ that is a linear combination of a few linearly independent columns of $A$, classical sparse recovery theory deals with the problem of recovering the unique sparse rep…

Sparse Representation-based Classification

Bayesian Semi-structured Subspace Inference

2024-01-23 · Daniel Dold, David Rügamer, Beate Sick, Oliver Dürr

Semi-structured regression models enable the joint modeling of interpretable structured and complex unstructured feature effects. The structured model part is inspired by statistical models and can be used to infer the i…

regression

Interpolating Convex and Non-Convex Tensor Decompositions via the Subspace Norm

2015-03-18 · NeurIPS 2015 12 · Qinqing Zheng, Ryota Tomioka

We consider the problem of recovering a low-rank tensor from its noisy observation. Previous work has shown a recovery guarantee with signal to noise ratio $O(n^{\lceil K/2 \rceil /2})$ for recovering a $K$th order rank …

Denoising