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

Kwun Chuen Gary Chan

dblp:226/3598 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 3 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
2 papers
Algorithms and data structures · 67% Mathematical optimization · 33%
Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 60% Learning theory · 40%
Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 100%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures
kernel methods
1.012026
Flexible Functional Treatment Effect Estimation · J. Mach. Learn. Res. 2026
Algorithms and data structures › kernel methods
kernel ridge regression
1.012026
Flexible Functional Treatment Effect Estimation · J. Mach. Learn. Res. 2026
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
pseudolikelihood estimation
0.812024
A Pairwise Pseudo-likelihood Approach for Matrix Completion with Informative Missingness · NeurIPS 2024
Mathematical optimization › continuous optimization › matrix optimization › matrix recovery
matrix completion
0.812024
A Pairwise Pseudo-likelihood Approach for Matrix Completion with Informative Missingness · NeurIPS 2024
Machine learning › Learning theory
statistical guarantees
0.512021
Matrix Completion with Model-free Weighting · ICML 2021
Machine learning and data management
matrix completion
0.512021
Matrix Completion with Model-free Weighting · ICML 2021
Mathematical optimization › continuous optimization › matrix optimization › matrix recovery
low-rank matrix recovery
0.212024
A Pairwise Pseudo-likelihood Approach for Matrix Completion with Informative Missingness · NeurIPS 2024

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

convex optimization · 2.0regularization · 1.5pairwise pseudo-likelihood · 1.5low-rank estimation · 1.5representer theorem · 1.0kernel ridge regression · 1.0importance weighting · 1.0
YearPublicationVenuePosition
2026 Flexible Functional Treatment Effect Estimation
abstract
We study treatment effect estimation with functional treatments where the average potential outcome functional is a function of functions, in contrast to continuous treatment effect estimation where the target is a function of real numbers. By considering a flexible scalar-on-function marginal structural model, a weight-modified kernel ridge regression (WMKRR) is adopted for estimation. The weights are constructed by directly minimizing the uniform balancing error resulting from a decomposition of the WMKRR estimator, instead of being estimated under a particular treatment selection model. Despite the complex structure of the uniform balancing error derived under WMKRR, finite-dimensional convex algorithms can be applied to efficiently solve for the proposed weights thanks to a representer theorem. The optimal convergence rate is shown to be attainable by the proposed WMKRR estimator without any smoothness assumption on the true weight function. Corresponding empirical performance is demonstrated by a simulation study and a real data application.
Raymond K. W. Wong, Kwun Chuen Gary Chan
J. Mach. Learn. Res.4
2024 A Pairwise Pseudo-likelihood Approach for Matrix Completion with Informative Missingness
abstract
While several recent matrix completion methods are developed to deal with non-uniform observation probabilities across matrix entries, very few allow the missingness to depend on the mostly unobserved matrix measurements, which is generally ill-posed. We aim to tackle a subclass of these ill-posed settings, characterized by a flexible separable observation probability assumption that can depend on the matrix measurements. We propose a regularized pairwise pseudo-likelihood approach for matrix completion and prove that the proposed estimator can asymptotically recover the low-rank parameter matrix up to an identifiable equivalence class of a constant shift and scaling, at a near-optimal asymptotic convergence rate of the standard well-posed (non-informative missing) setting, while effectively mitigating the impact of informative missingness. The efficacy of our method is validated via numerical experiments, positioning it as a robust tool for matrix completion to mitigate data bias.
Jiangyuan Li, Raymond K. W. Wong, Kwun Chuen Gary Chan
NeurIPS4
2021 Matrix Completion with Model-free Weighting
abstract
In this paper, we propose a novel method for matrix completion under general non-uniform missing structures. By controlling an upper bound of a novel balancing error, we construct weights that can actively adjust for the non-uniformity in the empirical risk without explicitly modeling the observation probabilities, and can be computed efficiently via convex optimization. The recovered matrix based on the proposed weighted empirical risk enjoys appealing theoretical guarantees. In particular, the proposed method achieves stronger guarantee than existing work in terms of the scaling with respect to the observation probabilities, under asymptotically heterogeneous missing settings (where entry-wise observation probabilities can be of different orders). These settings can be regarded as a better theoretical model of missing patterns with highly varying probabilities. We also provide a new minimax lower bound under a class of heterogeneous settings. Numerical experiments are also provided to demonstrate the effectiveness of the proposed method.
Raymond K. W. Wong, Xiaojun Mao, Kwun Chuen Gary Chan
ICML4