{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:40:09Z","timestamp":1750293609737,"version":"3.41.0"},"reference-count":49,"publisher":"Association for Computing Machinery (ACM)","issue":"8","license":[{"start":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T00:00:00Z","timestamp":1722384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["IIS 1652943, IIS 1849359, CNS 1932482, and CCF 2029543."],"award-info":[{"award-number":["IIS 1652943, IIS 1849359, CNS 1932482, and CCF 2029543."]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,9,30]]},"abstract":"<jats:p>\n            Linear discriminant analysis (LDA) is widely used for dimensionality reduction under supervised learning settings. Traditional LDA objective aims to minimize the ratio of the squared Euclidean distances that may not perform optimally on noisy datasets. Multiple robust LDA objectives have been proposed to address this problem, but their implementations have two major limitations. One is that their mean calculations use the squared\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(\\ell_{2}\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            -norm distance to center the data, which is not valid when the objective depends on other distance functions. The second problem is that there is no generalized optimization algorithm to solve different robust LDA objectives. In addition, most existing algorithms can only guarantee that the solution is locally optimal rather than globally optimal. In this article, we review multiple robust loss functions and propose a new and generalized robust objective for LDA. Besides, to remove the mean value within data better, our objective uses an optimal way to center the data through learning. As one important algorithmic contribution, we derive an efficient iterative algorithm to optimize the resulting non-smooth and non-convex objective function. We theoretically prove that our solution algorithm guarantees that both the objective and the solution sequences converge to globally optimal solutions at a sub-linear convergence rate. The results of comprehensive experimental evaluations demonstrate the effectiveness of our new method, achieving significant improvements compared to the other competing methods.\n          <\/jats:p>","DOI":"10.1145\/3665500","type":"journal-article","created":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T11:49:02Z","timestamp":1716292142000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["On Mean-Optimal Robust Linear Discriminant Analysis"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1480-3686","authenticated-orcid":false,"given":"Xiangyu","family":"Li","sequence":"first","affiliation":[{"name":"Colorado School of Mines, Golden, CO, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5986-7413","authenticated-orcid":false,"given":"Hua","family":"Wang","sequence":"additional","affiliation":[{"name":"Colorado School of Mines, Golden, CO, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,7,31]]},"reference":[{"key":"e_1_3_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00446"},{"key":"e_1_3_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00131148"},{"key":"e_1_3_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"e_1_3_1_5_1","unstructured":"Tom B. Brown Dandelion Man\u00e9 Aurko Roy Mart\u00edn Abadi and Justin Gilmer. 2017. Adversarial patch. arXiv:1712.09665. Retrieved from https:\/\/arxiv.org\/abs\/1712.09665"},{"key":"e_1_3_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"e_1_3_1_7_1","volume-title":"Introduction to Statistical Pattern Recognition","author":"Fukunaga Keinosuke","year":"2013","unstructured":"Keinosuke Fukunaga. 2013. Introduction to Statistical Pattern Recognition. Elsevier."},{"key":"e_1_3_1_8_1","first-page":"305","volume-title":"Proceedings of the Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics (HLT-NAACL \u201904)","author":"Goodman Joshua","year":"2004","unstructured":"Joshua Goodman. 2004. Exponential priors for maximum entropy models. In Proceedings of the Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics (HLT-NAACL \u201904). 305\u2013312."},{"key":"e_1_3_1_9_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1127647"},{"key":"e_1_3_1_10_1","doi-asserted-by":"crossref","unstructured":"Peter J. Huber. 1992. Robust estimation of a location parameter. In Breakthroughs in Statistics. Springer 492\u2013518. Retrieved from https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4612-4380-9_35","DOI":"10.1007\/978-1-4612-4380-9_35"},{"key":"e_1_3_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.291440"},{"key":"e_1_3_1_12_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i6.20665"},{"key":"e_1_3_1_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008321423879"},{"key":"e_1_3_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"e_1_3_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM58522.2023.00035"},{"key":"e_1_3_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2023.3345251"},{"key":"e_1_3_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2876327"},{"key":"e_1_3_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977172.55"},{"key":"e_1_3_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM54844.2022.00129"},{"key":"e_1_3_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/3367243.3367457"},{"key":"e_1_3_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975673.44"},{"key":"e_1_3_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3451395"},{"key":"e_1_3_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/3304889.3305001"},{"key":"e_1_3_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00806"},{"key":"e_1_3_1_25_1","volume-title":"Columbia Object Image Library (COIL-20)","author":"Nene Sameer A.","year":"1996","unstructured":"Sameer A. Nene, Shree K. Nayar, Hiroshi Murase. 1996. Columbia Object Image Library (COIL-20). Columbia University."},{"key":"e_1_3_1_26_1","first-page":"1433","article-title":"Robust principal component analysis with non-greedy l1-norm maximization","volume":"22","author":"Nie Feiping","year":"2011","unstructured":"Feiping Nie, Heng Huang, Chris Ding, Dijun Luo, and Hua Wang. 2011. Robust principal component analysis with non-greedy l1-norm maximization. In Proceedings-International Joint Conference on Artificial Intelligence (IJCAI), Vol. 22. 1433.","journal-title":"Proceedings-International Joint Conference on Artificial Intelligence (IJCAI)"},{"key":"e_1_3_1_27_1","first-page":"1565","volume-title":"Proceedings of the 23rd International Joint Conference on Artificial Intelligence","author":"Nie Feiping","year":"2013","unstructured":"Feiping Nie, Hua Wang, Heng Huang, and Chris Ding. 2013. Adaptive loss minimization for semi-supervised elastic embedding. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence. 1565\u20131571."},{"key":"e_1_3_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3369870"},{"key":"e_1_3_1_29_1","first-page":"1062","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Nie Feiping","year":"2014","unstructured":"Feiping Nie, Jianjun Yuan, and Heng Huang. 2014. Optimal mean robust principal component analysis. In Proceedings of the International Conference on Machine Learning. PMLR, 1062\u20131070."},{"key":"e_1_3_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2013.01.016"},{"key":"e_1_3_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3052973.3053009"},{"key":"e_1_3_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0262-8856(97)00070-X"},{"key":"e_1_3_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2980942"},{"key":"e_1_3_1_34_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.97"},{"key":"e_1_3_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289451"},{"key":"e_1_3_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2424721"},{"key":"e_1_3_1_37_1","first-page":"12","article-title":"Stacked denoising autoencoders: Learning useful representations in a deep network with a local denoising criterion","volume":"11","author":"Vincent Pascal","year":"2010","unstructured":"Pascal Vincent, Hugo Larochelle, Isabelle Lajoie, Yoshua Bengio, Pierre-Antoine Manzagol, and L\u00e9on Bottou. 2010. Stacked denoising autoencoders: Learning useful representations in a deep network with a local denoising criterion. Journal of Machine Learning Research 11, 12 (2010), 3371\u20133408.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2273355"},{"key":"e_1_3_1_39_1","first-page":"1836","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Wang Hua","year":"2014","unstructured":"Hua Wang, Feiping Nie, and Heng Huang. 2014. Robust distance metric learning via simultaneous l1-norm minimization and maximization. In Proceedings of the International Conference on Machine Learning. PMLR, 1836\u20131844."},{"key":"e_1_3_1_40_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9632"},{"key":"e_1_3_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.382983"},{"key":"e_1_3_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00707"},{"key":"e_1_3_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3321606"},{"key":"e_1_3_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2018.2799214"},{"key":"e_1_3_1_45_1","first-page":"12","volume-title":"Proceedings of the Advances in Neural Information Processing Systems (NIPS)","volume":"15","author":"Xing Eric P","year":"2002","unstructured":"Eric P Xing, Andrew Y Ng, Michael I Jordan, and Stuart Russell. 2002. Distance metric learning with application to clustering with side-information. In Proceedings of the Advances in Neural Information Processing Systems (NIPS), Vol. 15. Citeseer, 12."},{"issue":"3","key":"e_1_3_1_46_1","first-page":"2711","article-title":"KNN classification with one-step computation","volume":"35","author":"Zhang Shichao","year":"2021","unstructured":"Shichao Zhang and Jiaye Li. 2021. KNN classification with one-step computation. IEEE Transactions on Knowledge and Data Engineering 35, 3 (2021), 2711\u20132723.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"7","key":"e_1_3_1_47_1","first-page":"7382","article-title":"Reachable distance function for KNN classification","volume":"35","author":"Zhang Shichao","year":"2022","unstructured":"Shichao Zhang, Jiaye Li, and Yangding Li. 2022a. Reachable distance function for KNN classification. IEEE Transactions on Knowledge and Data Engineering 35, 7 (2022), 7382\u20137396.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.06.082"},{"key":"e_1_3_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2842023"},{"key":"e_1_3_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2013.2281428"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3665500","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3665500","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:03Z","timestamp":1750291563000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3665500"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,31]]},"references-count":49,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2024,9,30]]}},"alternative-id":["10.1145\/3665500"],"URL":"https:\/\/doi.org\/10.1145\/3665500","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2024,7,31]]},"assertion":[{"value":"2023-12-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-05-15","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}