Yixin Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yixin Chen has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Arvinder Kang
University of Mississippi, Oxford, Mississippi, USA
1 shared publication - Christina Trotter
University of Mississippi, University, Mississippi, USA
1 shared publication Dao Nguyen
Department of Mathematics, University of Mississippi, University, MS, USA
1 shared publicationDawn Wilkins
Department of Computer and Information Science, University of Mississippi, University, MS, USA
1 shared publication- Silu Zhang
Department of Psychology and Biobehavioral Sciences, St. Jude Children’s Research Hospital , Memphis, Tennessee
1 shared publication - Thai Le
University of Mississippi, Oxford, Mississippi, USA
1 shared publication
Latest Publications
- Open Access
- 18 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 148-156
Exploring Fairness-Accuracy Trade-Offs in Binary Classification: A Comparative Analysis Using Modified Loss Functions
In this paper, we explore the trade-off between fairness and accuracy when data is biased and unbiased. We introduce two versions of a modified loss function: Group Equity and Group Equality Binary Cross Entropy (BCE). Both functions add the maximum group loss to the standard BCE loss and use a hyperparameter to adjust its significance. Group Equity BCE is more suited for unbiased data, while Group Equality BCE is useful for heavily bias data. We test both by training logistic regression models on Home Mortgage Disclosure Act (HMDA) data. We evaluate our data and models using multiple fairness metrics, including p-value and statistical parity difference. We observe race and race-sex group bias. Our results show that Group Equity BCE maintains high accuracy while slightly improving group fairness. Group Equality BCE in- creases group fairness substantially. However, there is usually a steep decline in accuracy.
- 18 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 148-156
Open AccessExploring Fairness-Accuracy Trade-Offs in Binary Classification: A Comparative Analysis Using Modified Loss Functions
In this paper, we explore the trade-off between fairness and accuracy when data is biased and unbiased. We introduce two versions of a modified loss function: Group Equity and Group Equality Binary Cross Entropy (BCE). Both functions add the maximum group loss to the standard BCE loss and use a hyperparameter to adjust its significance. Group Equity BCE is more suited for unbiased data, while Group Equality BCE is useful for heavily bias data. We test both by training logistic regression models on Home Mortgage Disclosure Act (HMDA) data. We evaluate our data and models using multiple fairness metrics, including p-value and statistical parity difference. We observe race and race-sex group bias. Our results show that Group Equity BCE maintains high accuracy while slightly improving group fairness. Group Equality BCE in- creases group fairness substantially. However, there is usually a steep decline in accuracy.
- Open Access
- 18 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 278-283
Toshakhana: A Multidimensional Panjabi Corpus in Gurmukhi Script
Panjabi (also referred to as Punjabi) is a name given to a collection of tonal languages originating in the Punjab area of South Asia. It is the ninth most spoken language in the world - roughly 1.9% of the world population. Panjabi is written in two scripts - Gurmukhi and Shahmukhi. Yet it can be considered a "low resource language" due to lack of basic building blocks of Natural Language Processing (NLP) research. Toshakhana is our attempt to build the first Panjabi corpus in Gurmukhi script with temporal component.
- 18 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 278-283
Open AccessToshakhana: A Multidimensional Panjabi Corpus in Gurmukhi Script
Panjabi (also referred to as Punjabi) is a name given to a collection of tonal languages originating in the Punjab area of South Asia. It is the ninth most spoken language in the world - roughly 1.9% of the world population. Panjabi is written in two scripts - Gurmukhi and Shahmukhi. Yet it can be considered a "low resource language" due to lack of basic building blocks of Natural Language Processing (NLP) research. Toshakhana is our attempt to build the first Panjabi corpus in Gurmukhi script with temporal component.
- 1 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 43 (6) , 1947-1963
Estimating Feature-Label Dependence Using Gini Distance Statistics
Identifying statistical dependence between the features and the label is a fundamental problem in supervised learning. This paper presents a framework for estimating dependence between numerical features and a categorical label using generalized Gini distance, an energy distance in reproducing kernel Hilbert spaces (RKHS). Two Gini distance based dependence measures are explored: Gini distance covariance and Gini distance correlation. Unlike Pearson covariance and correlation, which do not characterize independence, the above Gini distance based measures define dependence as well as independence of random variables. The test statistics are simple to calculate and do not require probability density estimation. Uniform convergence bounds and asymptotic bounds are derived for the test statistics. Comparisons with distance covariance statistics are provided. It is shown that Gini distance statistics converge faster than distance covariance statistics in the uniform convergence bounds, hence tighter upper bounds on both Type I and Type II errors. Moreover, the probability of Gini distance covariance statistic under-performing the distance covariance statistic in Type II error decreases to 0 exponentially with the increase of the sample size. Extensive experimental results are presented to demonstrate the performance of the proposed method.
- 1 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 43 (6) , 1947-1963
Estimating Feature-Label Dependence Using Gini Distance Statistics
Identifying statistical dependence between the features and the label is a fundamental problem in supervised learning. This paper presents a framework for estimating dependence between numerical features and a categorical label using generalized Gini distance, an energy distance in reproducing kernel Hilbert spaces (RKHS). Two Gini distance based dependence measures are explored: Gini distance covariance and Gini distance correlation. Unlike Pearson covariance and correlation, which do not characterize independence, the above Gini distance based measures define dependence as well as independence of random variables. The test statistics are simple to calculate and do not require probability density estimation. Uniform convergence bounds and asymptotic bounds are derived for the test statistics. Comparisons with distance covariance statistics are provided. It is shown that Gini distance statistics converge faster than distance covariance statistics in the uniform convergence bounds, hence tighter upper bounds on both Type I and Type II errors. Moreover, the probability of Gini distance covariance statistic under-performing the distance covariance statistic in Type II error decreases to 0 exponentially with the increase of the sample size. Extensive experimental results are presented to demonstrate the performance of the proposed method.