( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Size and Depth Separation in Approximating Benign Functions with Neural Networks.

, , , и . COLT, том 134 из Proceedings of Machine Learning Research, стр. 4195-4223. PMLR, (2021)

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.

Lior Shamir

Ohad Kammar

Ohad Soudry

Huschang Ohadi

Mansour Ohadi

 

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

Graph Approximation and Clustering on a Budget., , и . AISTATS, том 38 из JMLR Workshop and Conference Proceedings, JMLR.org, (2015)On the Iteration Complexity of Oblivious First-Order Optimization Algorithms., и . ICML, том 48 из JMLR Workshop and Conference Proceedings, стр. 908-916. JMLR.org, (2016)Multi-Player Bandits - a Musical Chairs Approach., , и . ICML, том 48 из JMLR Workshop and Conference Proceedings, стр. 155-163. JMLR.org, (2016)Depth-Width Tradeoffs in Approximating Natural Functions with Neural Networks., и . ICML, том 70 из Proceedings of Machine Learning Research, стр. 2979-2987. PMLR, (2017)A Stochastic PCA and SVD Algorithm with an Exponential Convergence Rate.. ICML, том 37 из JMLR Workshop and Conference Proceedings, стр. 144-152. JMLR.org, (2015)On the Complexity of Bandit Linear Optimization.. COLT, том 40 из JMLR Workshop and Conference Proceedings, стр. 1523-1551. JMLR.org, (2015)On the Complexity of Learning with Kernels., , и . COLT, том 40 из JMLR Workshop and Conference Proceedings, стр. 297-325. JMLR.org, (2015)Without-Replacement Sampling for Stochastic Gradient Methods.. NIPS, стр. 46-54. (2016)Oracle Complexity in Nonsmooth Nonconvex Optimization., и . NeurIPS, стр. 324-334. (2021)Efficient Online Learning via Randomized Rounding., и . NIPS, стр. 343-351. (2011)