Demo Data from EDBT 2026 / reviewers in the wild / expert
Kejun He
dblp:150/3754
· DBLP profile ↗
4ranked-venue papers
1as first author
3since 2021 · last 2026
0000-0002-3996-6246ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author
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.
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 100% | |
| Artificial intelligence
1 paper |
Learning paradigms · 50% Learning theory · 50% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Recommender systems
generative recommendation |
1.0 | 1 | 2026 | From Past To Path: Masked History Learning for Next-Item Prediction in Generative Recommendation · ACL (1) 2026 |
Recommender systems › sequential recommendation
next-item recommendation |
1.0 | 1 | 2026 | From Past To Path: Masked History Learning for Next-Item Prediction in Generative Recommendation · ACL (1) 2026 |
Machine learning › Learning theory
functional linear regression |
0.7 | 1 | 2023 | A Unified Analysis of Multi-task Functional Linear Regression Models with Manifold Constraint and Composite Quadratic Penalty · J. Mach. Learn. Res. 2023 |
Machine learning › Learning paradigms
multi-task learning |
0.7 | 1 | 2023 | A Unified Analysis of Multi-task Functional Linear Regression Models with Manifold Constraint and Composite Quadratic Penalty · J. Mach. Learn. Res. 2023 |
Mathematical optimization
regularization |
0.7 | 1 | 2023 | A Unified Analysis of Multi-task Functional Linear Regression Models with Manifold Constraint and Composite Quadratic Penalty · J. Mach. Learn. Res. 2023 |
Recommender systems
sequential recommendation |
0.3 | 1 | 2026 | From Past To Path: Masked History Learning for Next-Item Prediction in Generative Recommendation · ACL (1) 2026 |
Methods — techniques the papers use, named apart from their topics
penalized splines · 1.3manifold constraint · 1.3generic chaining · 1.3masked history learning · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | From Past To Path: Masked History Learning for Next-Item Prediction in Generative RecommendationabstractKaiwen Wei, Kejun he, Xiaomian Kang, Jie Zhang, Ymyang, Li Jin, Zhenyang Li, Jiang Zhong, Richard He Bai, Junnan Zhu. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026. Kaiwen Wei, Kejun He, Xiaomian Kang, Ymyang, He Bai 0002, Junnan Zhu |
ACL (1) | 2 |
| 2023 | A Unified Analysis of Multi-task Functional Linear Regression Models with Manifold Constraint and Composite Quadratic PenaltyabstractThis work studies the multi-task functional linear regression models where both the covariates and the unknown regression coefficients (called slope functions) are curves. For slope function estimation, we employ penalized splines to balance bias, variance, and computational complexity. The power of multi-task learning is brought in by imposing additional structures over the slope functions. We propose a general model with double regularization over the spline coefficient matrix: i) a matrix manifold constraint, and ii) a composite penalty as a summation of quadratic terms. Many multi-task learning approaches can be treated as special cases of this proposed model, such as a reduced-rank model and a graph Laplacian regularized model. We show the composite penalty induces a specific norm, which helps quantify the manifold curvature and determine the corresponding proper subset in the manifold tangent space. The complexity of tangent space subset is then bridged to the complexity of geodesic neighbor via generic chaining. A unified upper bound of the convergence rate is obtained and specifically applied to the reduced-rank model and the graph Laplacian regularized model. The phase transition behaviors for the estimators are examined as we vary the configurations of model parameters. Shiyuan He, Hanxuan Ye, Kejun He |
J. Mach. Learn. Res. | 3 |
| 2022 | Causal discovery with heterogeneous observational dataabstractWe consider the problem of causal discovery (structure learning) from heterogeneous observational data. Most existing methods assume homogeneous sampling scheme and causal mechanism, which may lead to misleading conclusions when violated. We propose a novel approach that exploits data heterogeneity to infer possibly cyclic causal structures from causally insufficient systems. The core idea is to model the direct causal effects as functions of exogenous covariates that help explain sampling and causal heterogeneity. We investigate the structure identifiability properties of the proposed model. Structure learning is carried out in a fully Bayesian fashion, which provides natural uncertainty quantification. We demonstrate its utility through extensive simulations and two real-world applications. Fangting Zhou, Kejun He |
UAI | 2 |
| 2014 | DivRec: A Framework for Top-N Recommendation with Diversification in E-commerce
Kejun He, Junyu Niu, Chaofeng Sha |
APWeb | 1 |