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

Lulu Kang

dblp:63/9480 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2026
0000-0002-6000-3436ORCID · verified

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

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

Artificial intelligence
1 paper
Trustworthy machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
fairness
0.812024
Fair Multivariate Adaptive Regression Splines for Ensuring Equity and Transparency · AAAI 2024
Machine learning › Trustworthy machine learning › fairness › fair prediction
fair regression
0.812024
Fair Multivariate Adaptive Regression Splines for Ensuring Equity and Transparency · AAAI 2024
Machine learning › Trustworthy machine learning
interpretability
0.812024
Fair Multivariate Adaptive Regression Splines for Ensuring Equity and Transparency · AAAI 2024
Machine learning › Trustworthy machine learning › interpretability › explainable AI
interpretable regression
0.812024
Fair Multivariate Adaptive Regression Splines for Ensuring Equity and Transparency · AAAI 2024

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

multivariate adaptive regression splines · 0.8knot optimization · 0.8
YearPublicationVenuePosition
2026 Progressive Curriculum Learning With Teacher-Student Collaboration for Source-Free Unsupervised Domain Adaptation
abstract
In the present environment where privacy protection is increasingly emphasized, source-free unsupervised domain adaptation (SFUDA) has garnered more attention compared to standard unsupervised domain adaptation (UDA). It concentrates on transferring knowledge directly from well-trained source models to unlabeled target domains without requiring the involvement of source domain like UDA, greatly enhancing data protection capabilities. Many existing methods employ pseudo-labeling to guide this process, but due to domain shift, pseudo-labels often introduce significant noise. Although there are methods to filter out this noise and mitigate its impact, they may also result in the loss of crucial sample knowledge, leading to performance deterioration. In contrast, we propose a novel approach called Progressive Curriculum Learning with Teacher-Student Collaboration (PCTSC) method to mitigate the adverse influence of noisy labels in SFUDA. Inspired by curriculum learning, PCTSC assesses samples’ learning difficulty and trains models in an incremental manner from easy to hard, thereby enhancing the capability of model to against noise. Furthermore, PCTSC employs a two-stage learning approach: initially, a teacher model directs the student model, and later, the student model transitions to independent learning. We assess the effectiveness of PCTSC by conducting extensive experiments across three benchmark datasets, demonstrating its robustness against pseudo-label noise in SFUDA setting.
Qing Tian 0001, Junyu Shen, Lulu Kang, Weihua Ou, Jun Wan 0001, Zhen Lei 0001
IEEE Trans. Circuits Syst. Video Technol.3
2025 Source-Free Unsupervised Domain Adaptation through Trust-Guided Partitioning and Worst-Case Aligning
Qing Tian 0001, Lulu Kang
Knowl. Based Syst.2
2024 Fair Multivariate Adaptive Regression Splines for Ensuring Equity and Transparency
abstract
Predictive analytics has been widely used in various domains, including education, to inform decision-making and improve outcomes. However, many predictive models are proprietary and inaccessible for evaluation or modification by researchers and practitioners, limiting their accountability and ethical design. Moreover, predictive models are often opaque and incomprehensible to the officials who use them, reducing their trust and utility. Furthermore, predictive models may introduce or exacerbate bias and inequity, as they have done in many sectors of society. Therefore, there is a need for transparent, interpretable, and fair predictive models that can be easily adopted and adapted by different stakeholders. In this paper, we propose a fair predictive model based on multivariate adaptive regression splines (MARS) that incorporates fairness measures in the learning process. MARS is a non-parametric regression model that performs feature selection, handles non-linear relationships, generates interpretable decision rules, and derives optimal splitting criteria on the variables. Specifically, we integrate fairness into the knot optimization algorithm and provide theoretical and empirical evidence of how it results in a fair knot placement. We apply our fairMARS model to real-world data and demonstrate its effectiveness in terms of accuracy and equity. Our paper contributes to the advancement of responsible and ethical predictive analytics for social good.
Parian Haghighat, Denisa Gandara, Lulu Kang, Hadis Anahideh
AAAI3
2024 Active domain adaptation with mining diverse knowledge: An updated class consensus dictionary approach
Qing Tian 0001, Liangyu Zhou, Lulu Kang
Inf. Sci.4