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

Jianing Chu

dblp:354/3378 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
5since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Theory of computation · 1 · 1 first-author · 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.

Artificial intelligence
3 papers
Reinforcement learning · 54% Probabilistic and Bayesian machine learning · 31% Trustworthy machine learning · 15%
Theoretical computer science
2 papers
Mathematical optimization · 50% Algorithmic game theory and mechanism design · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › hierarchical modeling
hierarchical bayesian model
0.912025
Multi-Task Combinatorial Bandits for Budget Allocation · KDD (1) 2025
Machine learning › Probabilistic and Bayesian machine learning › causal inference
individualized treatment rule
0.912025
Doubly Robust Fusion of Many Treatments for Policy Learning · ICML 2025
Machine learning › Reinforcement learning
policy learning
0.912025
Doubly Robust Fusion of Many Treatments for Policy Learning · ICML 2025
Machine learning › Reinforcement learning
thompson sampling
0.912025
Multi-Task Combinatorial Bandits for Budget Allocation · KDD (1) 2025
Algorithmic game theory and mechanism design › resource allocation
budget allocation
0.912025
Multi-Task Combinatorial Bandits for Budget Allocation · KDD (1) 2025
Algorithmic game theory and mechanism design › multi-armed bandit
combinatorial multi-armed bandit
0.912025
Multi-Task Combinatorial Bandits for Budget Allocation · KDD (1) 2025
Mathematical optimization
combinatorial optimization
0.912025
Multi-Task Combinatorial Bandits for Budget Allocation · KDD (1) 2025
Mathematical optimization › statistical estimation › semiparametric estimation
semiparametric efficiency
0.912025
Efficient Causal Decision Making with One-sided Feedback · ICLR 2025
Machine learning › Reinforcement learning
off-policy evaluation
0.712023
Multiply Robust Off-policy Evaluation and Learning under Truncation by Death · ICML 2023
Machine learning › Reinforcement learning
off-policy reinforcement learning
0.712023
Multiply Robust Off-policy Evaluation and Learning under Truncation by Death · ICML 2023
Information retrieval
online advertising
0.312025
Multi-Task Combinatorial Bandits for Budget Allocation · KDD (1) 2025

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

thompson sampling · 2.6neural network · 2.6linear regression · 2.6gaussian process · 2.6bayesian hierarchical model · 2.6shadow variables · 0.9semiparametric theory · 0.9penalized working model · 0.9doubly robust estimation · 0.9calibration weighting · 0.9principal stratification · 0.7multiply robust estimation · 0.7
YearPublicationVenuePosition
2025 Efficient Causal Decision Making with One-sided Feedback
abstract
We study a class of decision-making problems with one-sided feedback, where outcomes are only observable for specific actions. A typical example is bank loans, where the repayment status is known only if a loan is approved and remains undefined if rejected. In such scenarios, conventional approaches to causal decision evaluation and learning from observational data are not directly applicable. In this paper, we introduce a novel value function to evaluate decision rules that addresses the issue of undefined counterfactual outcomes. Without assuming no unmeasured confounders, we establish the identification of the value function using shadow variables. Furthermore, leveraging semiparametric theory, we derive the efficiency bound for the proposed value function and develop efficient methods for decision evaluation and learning. Numerical experiments and a real-world data application demonstrate the empirical performance of our proposed methods.
Jianing Chu, Wenbin Lu, Pulak Ghosh
ICLR1
2025 Doubly Robust Fusion of Many Treatments for Policy Learning
abstract
Individualized treatment rules/recommendations (ITRs) aim to improve patient outcomes by tailoring treatments to the characteristics of each individual. However, in high-dimensional treatment settings, existing methods face significant challenges due to data sparsity within treatment groups and highly unbalanced covariate distributions across groups. To address these challenges, we propose a novel calibration-weighted treatment fusion procedure that robustly balances covariates across treatment groups and fuses similar treatments using a penalized working model. The fusion procedure ensures the recovery of latent treatment group structures when either the calibration model or the outcome model is correctly specified. In the fused treatment space, practitioners can seamlessly apply state-of-the-art ITR learning methods with the flexibility to utilize a subset of covariates, thereby achieving robustness while addressing practical concerns such as fairness. We establish theoretical guarantees, including consistency, the oracle property of treatment fusion, and regret bounds when integrated with multi-armed ITR learning methods such as policy trees. Simulation studies show superior group recovery and policy value compared to existing approaches. We illustrate the practical utility of our method using EHR-derived data from patients with Chronic Lymphocytic Leukemia and Small Lymphocytic Lymphoma.
Jianing Chu, Ilya Lipkovich, Wenyu Ye
ICML2
2025 Multi-Task Combinatorial Bandits for Budget Allocation
abstract
Today's top advertisers typically manage hundreds of campaigns simultaneously and consistently launch new ones throughout the year. A crucial challenge for marketing managers is determining the optimal allocation of limited budgets across various ad lines in each campaign to maximize cumulative returns, especially given the huge uncertainty in return outcomes. In this paper, we propose to formulate budget allocation as a multi-task combinatorial bandit problem and introduce a novel online budget allocation system. The proposed system: i) integrates a Bayesian hierarchical model to intelligently utilize the metadata of campaigns and ad lines and budget size, ensuring efficient information sharing; ii) provides the flexibility to incorporate diverse modeling techniques such as Linear Regression, Gaussian Processes, and Neural Networks, catering to diverse environmental complexities; and iii) employs the Thompson sampling technique to strike a balance between exploration and exploitation. Through extensive empirical evaluations with both synthetic data and real-world data from Amazon campaigns, our system demonstrates robustness and adaptability, effectively maximizing the overall cumulative returns. A Python implementation of the proposed procedure is available at https://anonymous.4open.science/r/MCMAB.
Yang Xu 0089, Jianing Chu, David Cramer, Fuhong Li, Kelly Paulson, Rui Song 0006
KDD (1)3
2024 Evaluating the Multifactorial Effects on SARS-CoV-2 Spread in Tokyo Metropolitan Area with an Agent-Based Model
Jianing Chu
COMPLEXIS1
2023 Multiply Robust Off-policy Evaluation and Learning under Truncation by Death
abstract
Typical off-policy evaluation (OPE) and off-policy learning (OPL) are not well-defined problems under "truncation by death", where the outcome of interest is not defined after some events, such as death. The standard OPE no longer yields consistent estimators, and the standard OPL results in suboptimal policies. In this paper, we formulate OPE and OPL using principal stratification under "truncation by death". We propose a survivor value function for a subpopulation whose outcomes are always defined regardless of treatment conditions. We establish a novel identification strategy under principal ignorability, and derive the semiparametric efficiency bound of an OPE estimator. Then, we propose multiply robust estimators for OPE and OPL. We show that the proposed estimators are consistent and asymptotically normal even with flexible semi/nonparametric models for nuisance functions approximation. Moreover, under mild rate conditions of nuisance functions approximation, the estimators achieve the semiparametric efficiency bound. Finally, we conduct experiments to demonstrate the empirical performance of the proposed estimators.
Jianing Chu, Wenbin Lu
ICML1