A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning
A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning
复制标题
一种近似福斯特变换的强多项式算法及其在半空间学习中的应用
DOI:
10.1145/3564246.3585191
复制
发表时间:
2023
期刊:
影响因子:
--
通讯作者:
Kane, Daniel M.
中科院分区:
文献类型:
--
作者:
Diakonikolas, Ilias;Tzamos, Christos;Kane, Daniel M.
The Forster transform is a method of regularizing a dataset by placing it inradial isotropic positionwhile maintaining some of its essential properties. Forster transforms have played a key role in a diverse range of settings spanning computer science and functional analysis. Prior work had givenweaklypolynomial time algorithms for computing Forster transforms, when they exist. Our main result is the firststrongly polynomial timealgorithm to compute an approximate Forster transform of a given dataset or certify that no such transformation exists. By leveraging our strongly polynomial Forster algorithm, we obtain the first strongly polynomial time algorithm fordistribution-freePAC learning of halfspaces. This learning result is surprising becauseproperPAC learning of halfspaces isequivalentto linear programming. Our learning approach extends to give a strongly polynomial halfspace learner in the presence of random classification noise and, more generally, Massart noise.
登录
查看更多内容
DOI:
--
发表时间:
2011
期刊:
Symposium on the Theory of Computing
影响因子:
--
作者:
László A. Végh
通讯作者:
László A. Végh
DOI:
10.1109/sfcs.1997.646140
发表时间:
1997
期刊:
Proceedings 38th Annual Symposium on Foundations of Computer Science
影响因子:
--
作者:
E. Cohen
通讯作者:
E. Cohen
影响因子:
0.8
作者:
L. Gurvits;Alex Samorodnitsky
通讯作者:
Alex Samorodnitsky
DOI:
10.1145/3188745.3188794
发表时间:
2017
期刊:
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
影响因子:
--
作者:
T. C. Kwok;L. Lau;Y. Lee;Akshay Ramachandran
通讯作者:
Akshay Ramachandran
影响因子:
2.7
作者:
D. Dadush;Sophie Huiberts;Bento Natura;L. V'egh
通讯作者:
L. V'egh