Crossref
On the complexity of data debugging for classifiers trained with stochastic gradient descent
Theoretical Computer Science · 2026-09 · 1082 · 116140
DOI: 10.1016/j.tcs.2026.116140 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-09. Verfasst von Pengyu Chen und 3 weiteren Autor:innen. Die Arbeit nennt 29 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Chen, P., Guo, Z., Wang, Y., & Miao, D. (2026). On the complexity of data debugging for classifiers trained with stochastic gradient descent. Theoretical Computer Science, 1082, 116140. https://doi.org/10.1016/j.tcs.2026.116140
Vancouver
Chen P, Guo Z, Wang Y, Miao D. On the complexity of data debugging for classifiers trained with stochastic gradient descent. Theoretical Computer Science. 2026;1082:116140. doi:10.1016/j.tcs.2026.116140
BibTeX
@article{Chen2026,
author = {Chen, Pengyu and Guo, Zizheng and Wang, Yuanfei and Miao, Dongjing},
title = {On the complexity of data debugging for classifiers trained with stochastic gradient descent},
journal = {Theoretical Computer Science},
year = {2026},
volume = {1082},
pages = {116140},
doi = {10.1016/j.tcs.2026.116140}
}
EUVIMED