Learning with Noisy Labels Incorporating Fairness and Privacy Concerns
| Field | Value | Language |
| dc.contributor.author | Wu, Songhua | |
| dc.date.accessioned | 2023-12-20T22:47:07Z | |
| dc.date.available | 2023-12-20T22:47:07Z | |
| dc.date.issued | 2023 | en |
| dc.identifier.uri | https://hdl.handle.net/2123/32028 | |
| dc.description | Includes publication | |
| dc.description.abstract | In the era of big data, the volume of data is growing at a tremendous rate as data has been generated from multifarious sources, but without reasonable supervision. Consequently, the generated data are primarily imperfect, such as inaccurate, biased, and even invading privacy. However, modern machine learning systems heavily rely on the quality of data. Noisy labels (inaccurate data) can be easily memorized by deep neural networks and thereby leads to overfitting and poor generalization problems; biased data guide models to give unfair predictions toward certain groups; privacy-invasion data are inherently harmful to the machine learning community. To deal with noisy labels, we propose two solutions to this problem from diverse perspectives. The first one from a noise reduction perspective transforms data points with noisy class labels to data pairs with noisy similarity labels. The second one from a curriculum learning perspective designs a curriculum selecting training data based on their dynamics over the course of training to learn the clean classifier and the transition matrix simultaneously. We provide general frameworks for learning fair classifiers with noisy labels. For statistical fairness notions, we rewrite the classification risk and the fairness metric in terms of noisy data and thereby build robust classifiers. For the causality-based fairness notion, we exploit the internal causal structure of data to model the label noise and counterfactual fairness simultaneously; we propose a denoised and unbiased estimator for the classification risk with respect to the accurately labeled data by employing the noisy data with indirect supervision and then learn the optimal model under the empirical risk minimization framework. | en |
| dc.language.iso | en | en |
| dc.rights | Copyright All Rights Reserved | en |
| dc.subject | label noise | en |
| dc.subject | transition matrix | en |
| dc.subject | machine learning fairness | en |
| dc.subject | similarity learning | en |
| dc.title | Learning with Noisy Labels Incorporating Fairness and Privacy Concerns | en |
| dc.type | Thesis | |
| dc.type.thesis | Doctor of Philosophy | en |
| dc.rights.other | The author retains copyright of this thesis. It may only be used for the purposes of research and study. It must not be used for any other purposes and may not be transmitted or shared with others without prior permission. | en |
| usyd.faculty | SeS faculties schools::Faculty of Engineering::School of Civil Engineering | en |
| usyd.degree | Doctor of Philosophy Ph.D. | en |
| usyd.awardinginst | The University of Sydney | en |
| usyd.advisor | Liu, Tongliang | en |
| usyd.include.pub | Yes | en |
Associated file/s
Associated collections