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

Lu Tang 0003

dblp:23/3111-3 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
6since 2021 · last 2025
0000-0001-6143-9314ORCID · verified

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

Artificial intelligence and machine learning · 4 · 1 first-author · 3 since 2021Human-computer interaction and ubiquitous computing · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 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 · 100%
Artificial intelligence
2 papers
Trustworthy machine learning · 32% Reinforcement learning · 32% Probabilistic and Bayesian machine learning · 28%
Human-computer interaction and pervasive computing
1 paper
Human-AI interaction · 77% Design research and methods · 23%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Medical and health informatics · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
fairness
0.612022
RISE: Robust Individualized Decision Learning with Sensitive Variables · NeurIPS 2022
Medical and health informatics › precision medicine
individual treatment effect estimation
0.612022
A Tree-based Model Averaging Approach for Personalized Treatment Effect Estimation from Heterogeneous Data Sources · ICML 2022
Mathematical optimization › statistical estimation › high-dimensional estimation
debiased estimation
0.512021
Method of Contraction-Expansion (MOCE) for Simultaneous Inference in Linear Models · J. Mach. Learn. Res. 2021
Mathematical optimization › statistical learning theory
high-dimensional regression
0.512021
Method of Contraction-Expansion (MOCE) for Simultaneous Inference in Linear Models · J. Mach. Learn. Res. 2021
Mathematical optimization › selective inference
post-selection inference
0.512021
Method of Contraction-Expansion (MOCE) for Simultaneous Inference in Linear Models · J. Mach. Learn. Res. 2021
Mathematical optimization
simultaneous inference
0.512021
Method of Contraction-Expansion (MOCE) for Simultaneous Inference in Linear Models · J. Mach. Learn. Res. 2021
Mathematical optimization › statistical estimation › high-dimensional estimation
sparse estimation
0.512021
Method of Contraction-Expansion (MOCE) for Simultaneous Inference in Linear Models · J. Mach. Learn. Res. 2021
Machine learning › Probabilistic and Bayesian machine learning
data integration
0.212016
Fused Lasso Approach in Regression Coefficients Clustering - Learning Parameter Heterogeneity in Data Integration · J. Mach. Learn. Res. 2016
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
regression
0.212016
Fused Lasso Approach in Regression Coefficients Clustering - Learning Parameter Heterogeneity in Data Integration · J. Mach. Learn. Res. 2016
Medical and health informatics
intensive care unit
0.212024
Sketching AI Concepts with Capabilities and Examples: AI Innovation in the Intensive Care Unit · CHI 2024
Design research and methods
design workshops
0.212024
Sketching AI Concepts with Capabilities and Examples: AI Innovation in the Intensive Care Unit · CHI 2024
Machine learning › Optimization for machine learning
robust optimization
0.212022
RISE: Robust Individualized Decision Learning with Sensitive Variables · NeurIPS 2022
Distributed systems
distributed data processing
0.212022
A Tree-based Model Averaging Approach for Personalized Treatment Effect Estimation from Heterogeneous Data Sources · ICML 2022
Distributed systems › distributed machine learning
privacy-preserving distributed learning
0.212022
A Tree-based Model Averaging Approach for Personalized Treatment Effect Estimation from Heterogeneous Data Sources · ICML 2022

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

causal inference · 1.7first-hand account · 1.5design workshop · 1.5tree-based model averaging · 1.1ensemble learning · 1.1quantile-optimal decision rule · 0.6lasso · 0.5forward screening · 0.5asymptotic normality · 0.5regularization · 0.2fused lasso · 0.2
YearPublicationVenuePosition
2025 Static Algorithm, Evolving Epidemic: Understanding the Potential of Human-AI Risk Assessment to Support Regional Overdose Prevention
abstract
Drug overdose deaths, including those due to prescription opioids, represent a critical public health issue in the United States and worldwide. Artificial intelligence (AI) approaches have been developed and deployed to help prescribers assess a patient's risk for overdose-related death, but it is unknown whether public health experts can leverage similar predictions to make local resource allocation decisions more effectively. In this work, we evaluated how AI-based overdose risk assessment could be used to inform local public health decisions using a working prototype system. Experts from three health departments, of varying locations and sizes with respect to staff and population served, were receptive to the potential benefits of algorithmic risk prediction and of using AI-augmented visualization to connect across data sources. However, they also expressed concerns about whether the risk prediction model's formulation and underlying data would match the state of the overdose epidemic as it evolved in their specific locations. Our findings extend those of other studies on algorithmic systems in the public sector, and they present opportunities for future human-AI collaborative tools to support decision-making in local, time-varying contexts.
Venkatesh Sivaraman, Yejun Kwak, Courtney Kuza, Qingnan Yang, Kayleigh Adamson, Katie Suda, Lu Tang 0003, Walid Gellad, Adam Perer
Proc. ACM Hum. Comput. Interact.7
2025 Harmony-based data integration for distributed single-cell multi-omics data
abstract
Large-scale single-cell projects generate rapidly growing datasets, but downstream analysis is often confounded by data sources, requiring data integration methods to do correction. Existing data integration methods typically require data centralization, raising privacy and security concerns. Here, we introduce Federated Harmony, a novel method combining properties of federated learning with Harmony algorithm to integrate decentralized omics data. This approach preserves privacy by avoiding raw data sharing while maintaining integration performance comparable to Harmony. Experiments on various types of single-cell data showcase superior results, highlighting a novel data integration approach for distributed multi-omics data without compromising data privacy or analytical performance.
Ruizhi Yuan, Ziqi Rong, Shiyue Tao, Lu Tang 0003
PLoS Comput. Biol.7
2024 Sketching AI Concepts with Capabilities and Examples: AI Innovation in the Intensive Care Unit
abstract
Advances in artificial intelligence (AI) have enabled unprecedented capabilities, yet innovation teams struggle when envisioning AI concepts. Data science teams think of innovations users do not want, while domain experts think of innovations that cannot be built. A lack of effective ideation seems to be a breakdown point. How might multidisciplinary teams identify buildable and desirable use cases? This paper presents a first hand account of ideating AI concepts to improve critical care medicine. As a team of data scientists, clinicians, and HCI researchers, we conducted a series of design workshops to explore more effective approaches to AI concept ideation and problem formulation. We detail our process, the challenges we encountered, and practices and artifacts that proved effective. We discuss the research implications for improved collaboration and stakeholder engagement, and discuss the role HCI might play in reducing the high failure rate experienced in AI innovation.
Nur Yildirim, Susanna Zlotnikov, Deniz Sayar, Jeremy M. Kahn, Leigh A. Bukowski, Sher Shah Amin, Kathryn A. Riman, Billie S. Davis, John S. Minturn, Andrew J. King 0002, Dan Ricketts, Lu Tang 0003, Venkatesh Sivaraman, Adam Perer, Sarah Masud Preum, James McCann, John Zimmerman
CHI12
2022 A Tree-based Model Averaging Approach for Personalized Treatment Effect Estimation from Heterogeneous Data Sources
abstract
Accurately estimating personalized treatment effects within a study site (e.g., a hospital) has been challenging due to limited sample size. Furthermore, privacy considerations and lack of resources prevent a site from leveraging subject-level data from other sites. We propose a tree-based model averaging approach to improve the estimation accuracy of conditional average treatment effects (CATE) at a target site by leveraging models derived from other potentially heterogeneous sites, without them sharing subject-level data. To our best knowledge, there is no established model averaging approach for distributed data with a focus on improving the estimation of treatment effects. Specifically, under distributed data networks, our framework provides an interpretable tree-based ensemble of CATE estimators that joins models across study sites, while actively modeling the heterogeneity in data sources through site partitioning. The performance of this approach is demonstrated by a real-world study of the causal effects of oxygen therapy on hospital survival rate and backed up by comprehensive simulation results.
Xiaoqing Tan, Chung-Chou H. Chang, Lu Tang 0003
ICML4
2022 RISE: Robust Individualized Decision Learning with Sensitive Variables
abstract
This paper introduces RISE, a robust individualized decision learning framework with sensitive variables, where sensitive variables are collectible data and important to the intervention decision, but their inclusion in decision making is prohibited due to reasons such as delayed availability or fairness concerns. A naive baseline is to ignore these sensitive variables in learning decision rules, leading to significant uncertainty and bias. To address this, we propose a decision learning framework to incorporate sensitive variables during offline training but not include them in the input of the learned decision rule during model deployment. Specifically, from a causal perspective, the proposed framework intends to improve the worst-case outcomes of individuals caused by sensitive variables that are unavailable at the time of decision. Unlike most existing literature that uses mean-optimal objectives, we propose a robust learning framework by finding a newly defined quantile- or infimum-optimal decision rule. The reliable performance of the proposed method is demonstrated through synthetic experiments and three real-world applications.
Xiaoqing Tan, Zhengling Qi, Christopher W. Seymour, Lu Tang 0003
NeurIPS4
2021 Method of Contraction-Expansion (MOCE) for Simultaneous Inference in Linear Models
abstract
Simultaneous inference after model selection is of critical importance to address scientific hypotheses involving a set of parameters. In this paper, we consider a high-dimensional linear regression model in which a regularization procedure such as LASSO is applied to yield a sparse model. To establish a simultaneous post-model selection inference, we propose a method of contraction and expansion (MOCE) along the line of debiasing estimation in that we investigate a desirable trade-off between model selection variability and sample variability by the means of forward screening. We establish key theoretical results for the inference from the proposed MOCE procedure. Once the expanded model is properly selected, the theoretical guarantees and simultaneous confidence regions can be constructed by the joint asymptotic normal distribution. In comparison with existing methods, our proposed method exhibits stable and reliable coverage at a nominal significance level and enjoys substantially less computational burden. Thus, our MOCE approach is trustworthy in solving real-world problems.
Lu Tang 0003, Peter X. K. Song
J. Mach. Learn. Res.3
2016 Fused Lasso Approach in Regression Coefficients Clustering - Learning Parameter Heterogeneity in Data Integration
abstract
As data sets of related studies become more easily accessible, combining data sets of similar studies is often undertaken in practice to achieve a larger sample size and higher power. A major challenge arising from data integration pertains to data heterogeneity in terms of study population, study design, or study coordination. Ignoring such heterogeneity in data analysis may result in biased estimation and misleading inference. Traditional techniques of remedy to data heterogeneity include the use of interactions and random effects, which are inferior to achieving desirable statistical power or providing a meaningful interpretation, especially when a large number of smaller data sets are combined. In this paper, we propose a regularized fusion method that allows us to identify and merge inter-study homogeneous parameter clusters in regression analysis, without the use of hypothesis testing approach. Using the fused lasso, we establish a computationally efficient procedure to deal with large-scale integrated data. Incorporating the estimated parameter ordering in the fused lasso facilitates computing speed with no loss of statistical power. We conduct extensive simulation studies and provide an application example to demonstrate the performance of the new method with a comparison to the conventional methods.
Lu Tang 0003, Peter X. K. Song
J. Mach. Learn. Res.1