SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2602.20001 · 2026

FairFS: Addressing Deep Feature Selection Biases for Recommender System

Kai Zhang, Zhenhua Dong, Jieming Zhu, Zhaocheng Du, Xianquan Wang, Qinglin Jia

arXiv · PDF · Open in the Atlas

Code that ran

1 of 1 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 0 no recorded run), measured 2026-11-22; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2602.20001.json · badge: /api/ran/2602.20001.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
xqwustc/FairFS canonical (classifier label)
classifier basis: census
1 ran · 0 no recorded run
FunctionStatusWhere it lives
get_feature_indices Ran
ran; our contract draft was wrong, not the code
xqwustc/FairFS/FM/run_expid_incre.py
pointer only (licence: NONE) · get_code("1c53b7f4d04a6a61")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, xqwustc/FairFS when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

Also present in other papers' code

Of 1 samples lifted from this paper's linked repositories, 1 carry a function identity and 0 do not. Of the 1 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 1 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Large-scale online marketplaces and recommender systems serve as critical technological support for e-commerce development. In industrial recommender systems, features play vital roles as they carry information for downstream models. Accurate feature importance estimation is critical as it helps find the most useful feature subsets from thousands of feature candidates for online services. With such a selection, optimizing online performance while reducing computation burden is possible. To solve the feature selection problems of deep learning, trainable gate-based and sensitivitybased methods are proposed and proven effective in the industry. Nevertheless, by analyzing real-world examples, we identified three bias issues that make feature importance estimation rely on partial model layers, samples, or gradients to make decisions, ultimately leading to an inaccurate feature importance estimation. We call these biases layer bias, baseline bias, and approximation bias. To mitigate these three biases, we propose FairFS, a fair and accurate feature selection algorithm. On one hand, FairFS directly regularizes feature importance estimated across all non-linear transformational layers to avoid layer bias. On the other hand, it utilizes a smooth baseline feature that is close to the classifier's decision boundary and an aggregated approximation method to mitigate bias issues. Extensive experiments show how FairFS mitigates these three biases and achieves SOTA feature selection results. • Information systems → Web applications.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2602.20001")
get_code_for_paper("2602.20001")
have("2602.20001")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2602.20001.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2602.20001.svg)](https://syntology.ai/paper/2602.20001)

Connect an agent — have() is free.