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

Dehan Kong

dblp:155/9235 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
5since 2021 · last 2024
—ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 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
1 paper
Representation and self-supervised learning · 50% Learning theory · 50%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
dimensionality reduction
0.612022
Nonparametric Principal Subspace Regression · J. Mach. Learn. Res. 2022
Machine learning › Learning theory
nonparametric regression
0.612022
Nonparametric Principal Subspace Regression · J. Mach. Learn. Res. 2022
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
principal component analysis
0.612022
Nonparametric Principal Subspace Regression · J. Mach. Learn. Res. 2022
Machine learning › Learning theory › nonparametric regression
varying coefficient model
0.612022
Nonparametric Principal Subspace Regression · J. Mach. Learn. Res. 2022
Mathematical optimization › sparse learning
feature selection
0.512021
Optimal Minimax Variable Selection for Large-Scale Matrix Linear Regression Model · J. Mach. Learn. Res. 2021
Mathematical optimization › statistical learning theory
high-dimensional regression
0.512021
Optimal Minimax Variable Selection for Large-Scale Matrix Linear Regression Model · J. Mach. Learn. Res. 2021
Mathematical optimization
statistical learning theory
0.512021
Optimal Minimax Variable Selection for Large-Scale Matrix Linear Regression Model · J. Mach. Learn. Res. 2021
Bioinformatics and computational biology
biomedical data analysis
0.112021
Optimal Minimax Variable Selection for Large-Scale Matrix Linear Regression Model · J. Mach. Learn. Res. 2021

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

minimax theory · 1.0two-step estimation · 0.6low-rank approximation · 0.6empirical process theory · 0.6iterative hard-thresholding · 0.5iterative hard thresholding · 0.5
YearPublicationVenuePosition
2024 General Phrase Debiaser: Debiasing Masked Language Models at a Multi-Token Level
abstract
The social biases and unwelcome stereotypes revealed by pretrained language models are becoming obstacles to their application. Compared to numerous debiasing methods targeting word level, there has been relatively less attention on biases present at phrase level, limiting the performance of debiasing in discipline domains. In this paper, we propose an automatic multi-token debiasing pipeline called General Phrase Debiaser, which is capable of mitigating phrase-level biases in masked language models. Specifically, our method consists of a phrase filter stage that generates stereotypical phrases from Wikipedia pages as well as a model debias stage that can debias models at the multi-token level to tackle bias challenges on phrases. The latter searches for prompts that trigger model’s bias, and then uses them for debiasing. State-of-the-art results on standard datasets and metrics show that our approach can significantly reduce gender biases on both career and multiple disciplines, across models with varying parameter sizes.
Bingkang Shi, Xiaodan Zhang 0004, Dehan Kong, Yulei Wu, Zongzhen Liu, Honglei Lyu, Longtao Huang
ICASSP3
2024 Modeling single cell trajectory using forward-backward stochastic differential equations
abstract
Recent advances in single-cell sequencing technology have provided opportunities for mathematical modeling of dynamic developmental processes at the single-cell level, such as inferring developmental trajectories. Optimal transport has emerged as a promising theoretical framework for this task by computing pairings between cells from different time points. However, optimal transport methods have limitations in capturing nonlinear trajectories, as they are static and can only infer linear paths between endpoints. In contrast, stochastic differential equations (SDEs) offer a dynamic and flexible approach that can model non-linear trajectories, including the shape of the path. Nevertheless, existing SDE methods often rely on numerical approximations that can lead to inaccurate inferences, deviating from true trajectories. To address this challenge, we propose a novel approach combining forward-backward stochastic differential equations (FBSDE) with a refined approximation procedure. Our FBSDE model integrates the forward and backward movements of two SDEs in time, aiming to capture the underlying dynamics of single-cell developmental trajectories. Through comprehensive benchmarking on multiple scRNA-seq datasets, we demonstrate the superior performance of FBSDE compared to other methods, highlighting its efficacy in accurately inferring developmental trajectories.
Dehan Kong, Zhaolei Zhang
PLoS Comput. Biol.3
2022 Nonparametric Principal Subspace Regression
abstract
In scientific applications, multivariate observations often come in tandem with temporal or spatial covariates, with which the underlying signals vary smoothly. The standard approaches such as principal component analysis and factor analysis neglect the smoothness of the data, while multivariate linear or nonparametric regression fails to leverage the correlation information among multivariate response variables. We propose a novel approach named nonparametric principal subspace regression to overcome these issues. By decoupling the model discrepancy, a simple two-step estimation procedure is introduced, which takes advantage of the low-rank approximation while keeping smooth dynamics. The theoretical property of the proposed procedure is established under an increasing-dimension framework. We demonstrate the favorable performance of our method in comparison with its counterpart, the conventional nonparametric regression, from both theoretical and numerical perspectives.
Mark Koudstaal, Dengdeng Yu, Dehan Kong
J. Mach. Learn. Res.4
2022 Federated learning for computational pathology on gigapixel whole slide images
abstract
Deep Learning-based computational pathology algorithms have demonstrated profound ability to excel in a wide array of tasks that range from characterization of well known morphological phenotypes to predicting non human-identifiable features from histology such as molecular alterations. However, the development of robust, adaptable and accurate deep learning-based models often rely on the collection and time-costly curation large high-quality annotated training data that should ideally come from diverse sources and patient populations to cater for the heterogeneity that exists in such datasets. Multi-centric and collaborative integration of medical data across multiple institutions can naturally help overcome this challenge and boost the model performance but is limited by privacy concerns among other difficulties that may arise in the complex data sharing process as models scale towards using hundreds of thousands of gigapixel whole slide images. In this paper, we introduce privacy-preserving federated learning for gigapixel whole slide images in computational pathology using weakly-supervised attention multiple instance learning and differential privacy. We evaluated our approach on two different diagnostic problems using thousands of histology whole slide images with only slide-level labels. Additionally, we present a weakly-supervised learning framework for survival prediction and patient stratification from whole slide images and demonstrate its effectiveness in a federated setting. Our results show that using federated learning, we can effectively develop accurate weakly-supervised deep learning models from distributed data silos without direct data sharing and its associated complexities, while also preserving differential privacy using randomized noise generation. We also make available an easy-to-use federated learning for computational pathology software package: http://github.com/mahmoodlab/HistoFL.
Ming Y. Lu, Richard J. Chen, Dehan Kong, Jana Lipková, Rajendra Singh, Drew F. K. Williamson, Tiffany Y. Chen, Faisal Mahmood 0001
Medical Image Anal.3
2021 Optimal Minimax Variable Selection for Large-Scale Matrix Linear Regression Model
abstract
Large-scale matrix linear regression models with high-dimensional responses and high-dimensional variables have been widely employed in various large-scale biomedical studies. In this article, we propose an optimal minimax variable selection approach for the matrix linear regression model when the dimensions of both the response matrix and predictors diverge at the exponential rate of the sample size. We develop an iterative hard-thresholding algorithm for fast computation and establish an optimal minimax theory for the parameter estimates. The finite sample performance of the method is examined via extensive simulation studies and a real data application from the Alzheimer's Disease Neuroimaging Initiative study is provided.
Meiling Hao, Lianqiang Qu, Dehan Kong, Liuquan Sun, Hongtu Zhu
J. Mach. Learn. Res.3
2019 Mask Embedding for Realistic High-Resolution Medical Image Synthesis
Yinhao Ren, Zhe Zhu, Yingzhou Li, Dehan Kong, Rui Hou 0002, Lars J. Grimm, Jeffrey R. Marks, Joseph Y. Lo
MICCAI (6)4
2018 Outlier Detection and Robust Estimation in Nonparametric Regression
abstract
This paper studies outlier detection and robust estimation for nonparametric regression problems. We propose to include a subject-specific mean shift parameter for each data point such that a nonzero parameter will identify its corresponding data point as an outlier. We adopt a regularization approach by imposing a roughness penalty on the regression function and a shrinkage penalty on the mean shift parameter. An efficient algorithm has been proposed to solve the double penalized regression problem. We discuss a data-driven simultaneous choice of two regularization parameters based on a combination of generalized cross validation and modified Bayesian information criterion. We show that the proposed method can consistently detect the outliers. In addition, we obtain minimax-optimal convergence rates for both the regression function and the mean shift parameter under regularity conditions. The estimation procedure is shown to enjoy the oracle property in the sense that the convergence rates agree with the minimax-optimal rates when the outliers (or regression function) are known in advance. Numerical results demonstrate that the proposed method has desired performance in identifying outliers under different scenarios.
Dehan Kong, Howard D. Bondell, Weining Shen
AISTATS1