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

Zhaobin Kuang

dblp:183/0951 · DBLP profile ↗
← Back
10ranked-venue papers
6as first author
2since 2021 · last 2023
0000-0001-9295-4669ORCID · corroborated

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

Artificial intelligence and machine learning · 10 · 6 first-author · 2 since 2021Databases, data management, data science and information retrieval · 3 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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.

Artificial intelligence
4 papers
Probabilistic and Bayesian machine learning · 54% Information extraction and text analysis · 36% Transfer learning and domain adaptation · 11%
Interdisciplinary, comprehensive, and emerging computing
4 papers
Medical and health informatics · 70% Bioinformatics and computational biology · 30%
Databases, data mining, and information retrieval
2 papers
Data mining · 54% Machine learning and data management · 46%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis
social media text analysis
0.712023
SMILE: Evaluation and Domain Adaptation for Social Media Language Understanding · KDD 2023
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.622018
Temporal Poisson Square Root Graphical Models · ICML 2018
A Screening Rule for l1-Regularized Ising Model Estimation · NIPS 2017
Medical and health informatics › pharmacovigilance
adverse drug reaction detection
0.622018
Temporal Poisson Square Root Graphical Models · ICML 2018
Pharmacovigilance via Baseline Regularization with Large-Scale Longitudinal Observational Data · KDD 2017
Bioinformatics and computational biology › drug discovery
drug repositioning
0.522016
Computational Drug Repositioning Using Continuous Self-Controlled Case Series · KDD 2016
Baseline Regularization for Computational Drug Repositioning with Longitudinal Observational Data · IJCAI 2016
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › structure learning › graphical model structure learning
ising model structure learning
0.312017
A Screening Rule for l1-Regularized Ising Model Estimation · NIPS 2017
Medical and health informatics
pharmacovigilance
0.312017
Pharmacovigilance via Baseline Regularization with Large-Scale Longitudinal Observational Data · KDD 2017
Data mining › temporal analysis
longitudinal analysis
0.312017
Pharmacovigilance via Baseline Regularization with Large-Scale Longitudinal Observational Data · KDD 2017
Mathematical optimization › statistical estimation › high-dimensional estimation
sparse estimation
0.312017
A Screening Rule for l1-Regularized Ising Model Estimation · NIPS 2017
Medical and health informatics
electronic health records
0.212016
Computational Drug Repositioning Using Continuous Self-Controlled Case Series · KDD 2016
Machine learning › Transfer learning and domain adaptation
domain adaptation
0.212023
SMILE: Evaluation and Domain Adaptation for Social Media Language Understanding · KDD 2023
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
generalized linear model
0.112017
Pharmacovigilance via Baseline Regularization with Large-Scale Longitudinal Observational Data · KDD 2017

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

baseline regularization · 1.4multiple self-controlled case series · 0.9transformer · 0.7tokenizer · 0.7sparsistency analysis · 0.7pseudo-likelihood estimation · 0.7pre-training · 0.7screening rule · 0.6blockwise coordinate descent · 0.6logistic regression · 0.5temporal modeling · 0.2self-controlled case series · 0.2
YearPublicationVenuePosition
2023 SMILE: Evaluation and Domain Adaptation for Social Media Language Understanding
abstract
We study the ability of transformer-based language models (LMs) to understand social media language. Social media (SM) language is distinct from standard written language, yet existing benchmarks fall short of capturing LM performance in this socially, economically, and politically important domain. We quantify the degree to which social media language differs from conventional language and conclude that the difference is significant both in terms of token distribution and rate of linguistic shift. Next, we introduce a new benchmark for Social MedIa Language Evaluation (SMILE) that covers four SM platforms and eleven tasks. Finally, we show that learning a tokenizer and pretraining on a mix of social media and conventional language yields an LM that outperforms the best similar-sized alternative by 4.2 points on the overall SMILE score.
Vasilisa Bashlovkina, Riley Matthews, Zhaobin Kuang, Simon Baumgartner, Michael Bendersky
KDD3
2022 Firebolt: Weak Supervision Under Weaker Assumptions
abstract
Modern machine learning demands a large amount of training data. Weak supervision is a promising approach to meet this demand. It aggregates multiple labeling functions (LFs)–noisy, user-provided labeling heuristics—to rapidly and cheaply curate probabilistic labels for large-scale unlabeled data. However, standard assumptions in weak supervision—such as user-specified class balance, similar accuracy of an LF in classifying different classes, and full knowledge of LF dependency at inference time—might be undesirable in practice. In response, we present Firebolt, a new weak supervision framework that seeks to operate under weaker assumptions. In particular, Firebolt learns the class balance and class-specific accuracy of LFs jointly from unlabeled data. It carries out inference in an efficient and interpretable manner. We analyze the parameter estimation error of Firebolt and characterize its impact on downstream model performance. Furthermore, we show that on five publicly available datasets, Firebolt outperforms a state-of-the-art weak supervision method by up to 5.8 points in AUC. We also provide a case study in the production setting of a tech company, where a Firebolt-supervised model outperforms the existing weakly-supervised production model by 1.3 points in AUC and speedup label model training and inference from one hour to three minutes.
Zhaobin Kuang, Chidubem Arachie, Bangyong Liang, Pradyumna Narayana, Giulia DeSalvo, Michael S. Quinn, Bert Huang, Geoffrey Downs
AISTATS1
2020 Ivy: Instrumental Variable Synthesis for Causal Inference
abstract
A popular way to estimate the causal effect of a variable x on y from observational data is to use an instrumental variable (IV): a third variable z that affects y only through x. The more strongly z is associated with x, the more reliable the estimate is, but such strong IVs are difficult to find. Instead, practitioners combine more commonly available IV candidates—which are not necessarily strong, or even valid, IVs—into a single "summary" that is plugged into causal effect estimators in place of an IV. In genetic epidemiology, such approaches are known as allele scores. Allele scores require strong assumptions—independence and validity of all IV candidates—for the resulting estimate to be reliable. To relax these assumptions, we propose Ivy, a new method to combine IV candidates that can handle correlated and invalid IV candidates in a robust manner. Theoretically, we characterize this robustness, its limits, and its impact on the resulting causal estimates. Empirically, Ivy can correctly identify the directionality of known relationships and is robust against false discovery (median effect size <= 0.025) on three real-world datasets with no causal effects, while allele scores return more biased estimates (median effect size >= 0.118).
Zhaobin Kuang, Frederic Sala, Nimit Sharad Sohoni, Sen Wu 0002, Aldo Córdova-Palomera, Jared Dunnmon, James Priest, Christopher Ré
AISTATS1
2018 Temporal Poisson Square Root Graphical Models
abstract
We propose temporal Poisson square root graphical models (TPSQRs), a generalization of Poisson square root graphical models (PSQRs) specifically designed for modeling longitudinal event data. By estimating the temporal relationships for all possible pairs of event types, TPSQRs can offer a holistic perspective about whether the occurrences of any given event type could excite or inhibit any other type. A TPSQR is learned by estimating a collection of interrelated PSQRs that share the same template parameterization. These PSQRs are estimated jointly in a pseudo-likelihood fashion, where Poisson pseudo-likelihood is used to approximate the original more computationally intensive pseudo-likelihood problem stemming from PSQRs. Theoretically, we demonstrate that under mild assumptions, the Poisson pseudolikelihood approximation is sparsistent for recovering the underlying PSQR. Empirically, we learn TPSQRs from a real-world large-scale electronic health record (EHR) with millions of drug prescription and condition diagnosis events, for adverse drug reaction (ADR) detection. Experimental results demonstrate that the learned TPSQRs can recover ADR signals from the EHR effectively and efficiently.
Sinong Geng, Zhaobin Kuang, Peggy L. Peissig, David Page
ICML2
2018 Recursive Feature Elimination by Sensitivity Testing
abstract
There is great interest in methods to improve human insight into trained non-linear models. Leading approaches include producing a ranking of the most relevant features, a non-trivial task for non-linear models. We show theoretically and empirically the benefit of a novel version of recursive feature elimination (RFE) as often used with SVMs; the key idea is a simple twist on the kinds of sensitivity testing employed in computational learning theory with membership queries (e.g., [1]). With membership queries, one can check whether changing the value of a feature in an example changes the label. In the real-world, we usually cannot get answers to such queries, so our approach instead makes these queries to a trained (imperfect) non-linear model. Because SVMs are widely used in bioinformatics, our empirical results use a real-world cancer genomics problem; because ground truth is not known for this task, we discuss the potential insights provided. We also evaluate on synthetic data where ground truth is known.
Nicholas Sean Escanilla, Lisa Hellerstein, Ross Kleiman, Zhaobin Kuang, James Shull, David Page
ICMLA4
2018 Stochastic Learning for Sparse Discrete Markov Random Fields with Controlled Gradient Approximation Error
Sinong Geng, Zhaobin Kuang, Jie Liu 0006, Stephen J. Wright 0001, David Page
UAI2
2017 Pharmacovigilance via Baseline Regularization with Large-Scale Longitudinal Observational Data
abstract
Several prominent public health incidents that occurred at the beginning of this century due to adverse drug events (ADEs) have raised international awareness of governments and industries about pharmacovigilance (PhV), the science and activities to monitor and prevent adverse events caused by pharmaceutical products after they are introduced to the market. A major data source for PhV is large-scale longitudinal observational databases (LODs) such as electronic health records (EHRs) and medical insurance claim databases. Inspired by the Multiple Self-Controlled Case Series (MSCCS) model, arguably the leading method for ADE discovery from LODs, we propose baseline regularization, a regularized generalized linear model that leverages the diverse health profiles available in LODs across different individuals at different times. We apply the proposed method as well as MSCCS to the Marshfield Clinic EHR. Experimental results suggest that incorporating the heterogeneity among different patients and different times help to improve the performance in identifying benchmark ADEs from the Observational Medical Outcomes Partnership ground truth
Zhaobin Kuang, Peggy L. Peissig, Vítor Santos Costa, Richard Maclin, David Page
KDD1
2017 A Screening Rule for l1-Regularized Ising Model Estimation
abstract
We discover a screening rule for l1-regularized Ising model estimation. The simple closed-form screening rule is a necessary and sufficient condition for exactly recovering the blockwise structure of a solution under any given regularization parameters. With enough sparsity, the screening rule can be combined with various optimization procedures to deliver solutions efficiently in practice. The screening rule is especially suitable for large-scale exploratory data analysis, where the number of variables in the dataset can be thousands while we are only interested in the relationship among a handful of variables within moderate-size clusters for interpretability. Experimental results on various datasets demonstrate the efficiency and insights gained from the introduction of the screening rule.
Zhaobin Kuang, Sinong Geng, David Page
NIPS1
2016 Baseline Regularization for Computational Drug Repositioning with Longitudinal Observational Data
Zhaobin Kuang, James A. Thomson, Michael Caldwell, Peggy L. Peissig, Ron M. Stewart, David Page
IJCAI1
2016 Computational Drug Repositioning Using Continuous Self-Controlled Case Series
abstract
Computational Drug Repositioning (CDR) is the task of discovering potential new indications for existing drugs by mining large-scale heterogeneous drug-related data sources. Leveraging the patient-level temporal ordering information between numeric physiological measurements and various drug prescriptions provided in Electronic Health Records (EHRs), we propose a Continuous Self-controlled Case Series (CSCCS) model for CDR. As an initial evaluation, we look for drugs that can control Fasting Blood Glucose (FBG) level in our experiments. Applying CSCCS to the Marshfield Clinic EHR, well-known drugs that are indicated for controlling blood glucose level are rediscovered. Furthermore, some drugs with recent literature support for the potential effect of blood glucose level control are also identified.
Zhaobin Kuang, James A. Thomson, Michael Caldwell, Peggy L. Peissig, Ron M. Stewart, David Page
KDD1