From post

Open Problem: The Statistical Query Complexity of Learning Sparse Halfspaces.

. COLT, том 35 из JMLR Workshop and Conference Proceedings, стр. 1283-1289. JMLR.org, (2014)

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.

 

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

No Free Lunch in "Privacy for Free: How does Dataset Condensation Help Privacy"., , и . CoRR, (2022)On The Power of Membership Queries in Agnostic Learning.. J. Mach. Learn. Res., (2009)Generalization in Adaptive Data Analysis and Holdout Reuse., , , , , и . NIPS, стр. 2350-2358. (2015)Stability of Stochastic Gradient Descent on Nonsmooth Convex Losses., , , и . NeurIPS, (2020)Dealing with Range Anxiety in Mean Estimation via Statistical Queries.. ALT, том 76 из Proceedings of Machine Learning Research, стр. 629-640. PMLR, (2017)A Complete Characterization of Statistical Query Learning with Applications to Evolvability.. Electron. Colloquium Comput. Complex., (2010)Federated Learning with Differential Privacy for End-to-End Speech Recognition., , , , , и . CoRR, (2023)Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity., , , , , и . SODA, стр. 2468-2479. SIAM, (2019)Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization., , и . SODA, стр. 1265-1277. SIAM, (2017)Generalization of ERM in Stochastic Convex Optimization: The Dimension Strikes Back.. NIPS, стр. 3576-3584. (2016)