( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A strong composition theorem for junta complexity and the boosting of property testers.

, , , и . FOCS, стр. 1757-1777. IEEE, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Li Tan

Li Tan

Yang Li

Yang Li

Li Yang

 

Другие публикации лиц с тем же именем

Harnessing the Power of Choices in Decision Tree Learning., , , , , и . CoRR, (2023)Fooling Gaussian PTFs via local hyperconcentration., , и . STOC, стр. 1170-1183. ACM, (2020)Approximating Boolean Functions with Depth-2 Circuits., и . CCC, стр. 74-85. IEEE Computer Society, (2013)Boolean Function Monotonicity Testing Requires (Almost) n1/2 Non-adaptive Queries., , , и . STOC, стр. 519-528. ACM, (2015)Fooling polytopes., , и . STOC, стр. 614-625. ACM, (2019)On the Distribution of the Fourier Spectrum of Halfspaces, , , , и . (2012)cite arxiv:1202.6680.Fooling Intersections of Low-Weight Halfspaces., и . FOCS, стр. 824-835. IEEE Computer Society, (2017)Decision Tree Heuristics Can Fail, Even in the Smoothed Setting., , , и . APPROX-RANDOM, том 207 из LIPIcs, стр. 45:1-45:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Properly learning decision trees with queries is NP-hard., , и . FOCS, стр. 2383-2407. IEEE, (2023)A query-optimal algorithm for finding counterfactuals., , , и . ICML, том 162 из Proceedings of Machine Learning Research, стр. 2075-2090. PMLR, (2022)