Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Biqin Song

dblp:142/3893 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
3since 2021 · last 2026
0000-0003-1113-6432ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 67% Information theory · 33%
Artificial intelligence
1 paper
Trustworthy machine learning · 67% Learning theory · 33%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › multiple hypothesis testing
false discovery rate control
1.012026
Integral-based Knockoffs Inference for Partially Linear Models · AAAI 2026
Mathematical optimization › sparse learning
feature selection
1.012026
Integral-based Knockoffs Inference for Partially Linear Models · AAAI 2026
Information theory
statistical inference
1.012026
Integral-based Knockoffs Inference for Partially Linear Models · AAAI 2026
Machine learning › Trustworthy machine learning › risk control
false discovery rate control
0.912025
Knockoffs Inference for Partially Linear Models with Automatic Structure Discovery · AAAI 2025
Machine learning › Trustworthy machine learning
interpretability
0.912025
Knockoffs Inference for Partially Linear Models with Automatic Structure Discovery · AAAI 2025
Machine learning › Learning theory › model selection
variable selection
0.912025
Knockoffs Inference for Partially Linear Models with Automatic Structure Discovery · AAAI 2025

Methods — techniques the papers use, named apart from their topics

random fourier features · 1.0knockoffs · 1.0b-splines · 1.0structure discovery · 0.9partially linear model · 0.9knockoffs inference · 0.9
YearPublicationVenuePosition
2026 Integral-based Knockoffs Inference for Partially Linear Models
abstract
Partial linear models (PLM) have attracted much attention for regression estimation and variable selection due to their feasibility on utilizing linear and nonlinear approximations jointly. However, theoretical understanding of how they control the false discovery rate (FDR) during variable selection remains limited. To address this issue, we formulate a new integral-based knockoffs (IKO) inference scheme for controlled variable selection in PLM, where integral-based knockoff statistics are used to measure the variable importance and B-splines (or random Fourier features) are employed for approximating nonlinear components. In theory, FDR control is guaranteed for both linear and nonlinear parts, and the statistical analysis for its power is established. Empirical evaluations validate the effectiveness of our proposed approach.
Biqin Song, Rushi Lan, Hong Chen 0004
AAAI2
2025 Knockoffs Inference for Partially Linear Models with Automatic Structure Discovery
abstract
Partially linear models (PLM) have attracted much attention in the field of statistical machine learning. Specially, the ability of variable selection of PLM has been studied extensively due to the high requirement of model interpretability. However, few of the existing works concerns the false discovery rate (FDR) controllability of variable selection associated with PLM. To address this issue, we formulate a new Knockoffs Inference scheme for Linear And Nonlinear Discoverer (called KI-LAND), where FDR is controlled with respect to both linear and nonlinear variables for automatic structure discovery. For the proposed KI-LAND, theoretical guarantees are established for both FDR controllability and power, and experimental evaluations are provided to validate its effectiveness.
Biqin Song, Hao Deng 0017, Hong Chen 0004
AAAI2
2025 Controlled Feature Interaction Selection for Deep Sparse Networks
abstract
Deep sparse networks (DSNs) have demonstrated exceptional performance for nonlinear estimation and feature selection, which is crucial for enhancing predictive performance and interpretability. However, existing methods often overlook feature interactions and lack theoretical guarantees on false discovery rate (FDR), especially under interaction scenarios.To address the above issues, this paper develops a DSN-based knockoffs inference framework for feature interaction selection. Theoretical guarantee can be provided by knockoffs inference for controlling on FDR. Empirical evaluations on synthetic datasets demonstrate the capabilities of our proposal on FDR control and identification of informative interactions.
Biqin Song, Hong Chen 0004
CIKM2
2017 Error analysis of regularized least-square regression with Fredholm kernel
Yanfang Tao, Peipei Yuan, Biqin Song
Neurocomputing3
2016 Example-based super-resolution via social images
Yi Tang 0003, Hong Chen 0004, Zhanwen Liu, Biqin Song, Qi Wang 0009
Neurocomputing4
2014 Power line detection from optical images
Biqin Song, Xuelong Li 0001
Neurocomputing1