Papers › FiBiNET: Combining Feature Importance and Bilinear feature Interaction for...

FiBiNET: Combining Feature Importance and Bilinear feature Interaction for Click-Through Rate Prediction

23 May 2019arXiv:1905.09433archive 2025-07-28

Tongwen Huang, Zhiqi Zhang, Junlin Zhang

Advertising and feed ranking are essential to many Internet companies such as Facebook and Sina Weibo. Among many real-world advertising and feed ranking systems, click through rate (CTR) prediction plays a central role. There are many proposed models in this field such as logistic regression, tree based models, factorization machine based models and deep learning based CTR models. However, many current works calculate the feature interactions in a simple way such as Hadamard product and inner product and they care less about the importance of features. In this paper, a new model named FiBiNET as an abbreviation for Feature Importance and Bilinear feature Interaction NETwork is proposed to dynamically learn the feature importance and fine-grained feature interactions. On the one hand, the FiBiNET can dynamically learn the importance of features via the Squeeze-Excitation network (SENET) mechanism; on the other hand, it is able to effectively learn the feature interactions via bilinear function. We conduct extensive experiments on two real-world datasets and show that our shallow model outperforms other shallow models such as factorization machine(FM) and field-aware factorization machine(FFM). In order to improve performance further, we combine a classical deep neural network(DNN) component with the shallow model to be a deep model. The deep FiBiNET consistently outperforms the other state-of-the-art deep models such as DeepFM and extreme deep factorization machine(XdeepFM).

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1905.09433")

Code

Syntology Ran 2 of 26 code samples harvested from 5 repositories linked to this paper; 24 have no recorded run. Of those that ran: 2 ran · honoured contract.

By repository: community (archive-listed): 26 samples from 5 repositories, 2 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

31 repositories listed; official and paper-mentioned ones first.

HaSai666/rec_pangu mentioned on GitHubpytorch report
Hirosora/LightCTR mentioned on GitHubtf report
Prayforhanluo/CTR_Algorithm mentioned on GitHubtf report
UlionTse/mlgb mentioned on GitHubpytorch report
YinzhenWan/recome_wan mentioned on GitHubpytorch report
ptzhangAlg/RecAlg mentioned on GitHubtf report
shenweichen/DeepCTR mentioned on GitHubtf report
shenweichen/DeepCTR-Torch mentioned on GitHubpytorchApache-2.0 report
tangxyw/RecAlgorithm mentioned on GitHubtfBSD-2-Clause report
xue-pai/FuxiCTR mentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

26 samples harvested; 2 ran; 2 honoured the contract we drafted; 24 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

2ran · honoured contract
24unverified

Licence: 3 of the 26 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 5 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

count_params codectr/RefineCTR/evaluation/mains/main_criteo_base.py community (archive-listed) ran · honoured contract no licence file found · pointer only · c7366824116a54de · report
train codectr/RefineCTR/evaluation/mains/main_criteo_base.py community (archive-listed) ran · honoured contract no licence file found · pointer only · e2dddebbea9ec26d · report
activation_layer datawhalechina/torch-rechub/torch_rechub/basic/activation.py community (archive-listed) unverified MIT (permissive) · b9cfbe7def435449 · report
afm_model_fn tangxyw/RecAlgorithm/algorithm/AFM/afm.py community (archive-listed) unverified BSD-2-Clause (permissive) · c0a4eb57bcd0b82c · report
auc_score datawhalechina/torch-rechub/torch_rechub/basic/metric.py community (archive-listed) unverified MIT (permissive) · f595ec56e4f6d96c · report
bidirectional_dynamic_rnn tangxyw/RecAlgorithm/algorithm/DIEN/rnn.py community (archive-listed) unverified BSD-2-Clause (permissive) · 655674e1dd763c2b · report
columns_info DataCanvasIO/DeepTables/deeptables/eda/utils.py community (archive-listed) unverified Apache-2.0 (permissive) · 8d782cde176050f5 · report
cross_layer tangxyw/RecAlgorithm/algorithm/DCN/cross_layer.py community (archive-listed) unverified BSD-2-Clause (permissive) · 6ab7bf854f4e2b6a · report
dice tangxyw/RecAlgorithm/algorithm/DIN/activations.py community (archive-listed) unverified BSD-2-Clause (permissive) · cf507ada9edcace1 · report
dynamic_rnn tangxyw/RecAlgorithm/algorithm/DIEN/rnn.py community (archive-listed) unverified BSD-2-Clause (permissive) · e9998a77e293fcee · report
eval_input_fn tangxyw/RecAlgorithm/algorithm/utils.py community (archive-listed) unverified BSD-2-Clause (permissive) · cffd7b17cdcd0cf1 · report
example_parser tangxyw/RecAlgorithm/algorithm/AFM/afm.py community (archive-listed) unverified BSD-2-Clause (permissive) · e123b326d5597e1a · report
extract_feature_info datawhalechina/torch-rechub/torch_rechub/utils/model_utils.py community (archive-listed) unverified MIT (permissive) · b05d0a65616555c4 · report
gauc_score datawhalechina/torch-rechub/torch_rechub/basic/metric.py community (archive-listed) unverified MIT (permissive) · 8a2d833b56e533eb · report
generate_dummy_input datawhalechina/torch-rechub/torch_rechub/utils/model_utils.py community (archive-listed) unverified MIT (permissive) · 39e31791691af4ad · report
generate_dummy_input_dict datawhalechina/torch-rechub/torch_rechub/utils/model_utils.py community (archive-listed) unverified MIT (permissive) · bd1115d11db962ea · report
get_auc huangjunheng/recommendation_model/FiBiNET/FibiNET.py community (archive-listed) unverified no licence file found · pointer only · d1f034d725053a85 · report
get_user_pred datawhalechina/torch-rechub/torch_rechub/basic/metric.py community (archive-listed) unverified MIT (permissive) · 073e23c27ccb1369 · report
leakyrelu tangxyw/RecAlgorithm/algorithm/BST/leakyrelu.py community (archive-listed) unverified BSD-2-Clause (permissive) · a454c87f745b2bc3 · report
mini_dt_space_validator DataCanvasIO/DeepTables/deeptables/models/hyper_dt.py community (archive-listed) unverified Apache-2.0 (permissive) · acec900be1840259 · report
prelu tangxyw/RecAlgorithm/algorithm/DIN/activations.py community (archive-listed) unverified BSD-2-Clause (permissive) · 3e2819d0a6e96a88 · report
raw_rnn tangxyw/RecAlgorithm/algorithm/DIEN/rnn.py community (archive-listed) unverified BSD-2-Clause (permissive) · d657922c4bdcd359 · report
target_rate_encodeing DataCanvasIO/DeepTables/deeptables/preprocessing/utils.py community (archive-listed) unverified Apache-2.0 (permissive) · 24e398d27e643ab0 · report
to_sparse_tensor tangxyw/RecAlgorithm/algorithm/utils.py community (archive-listed) unverified BSD-2-Clause (permissive) · edc3a0e6c82606b3 · report
top_categories DataCanvasIO/DeepTables/deeptables/eda/utils.py community (archive-listed) unverified Apache-2.0 (permissive) · a472efb327506298 · report
train_input_fn tangxyw/RecAlgorithm/algorithm/utils.py community (archive-listed) unverified BSD-2-Clause (permissive) · 35705e483fa1b7a1 · report

Tasks

Click-Through Rate PredictionFeature ImportanceRecommendation Systems

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Click-Through Rate Prediction Criteo FiBiNET AUC 0.8103 #21 of 39 Archive leaderboard report
Click-Through Rate Prediction Criteo FiBiNET Log Loss 0.4423 #21 of 39 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections