ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2202.05096
  4. Cited By
Near-Optimal Statistical Query Lower Bounds for Agnostically Learning
  Intersections of Halfspaces with Gaussian Marginals

Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals

10 February 2022
Daniel J. Hsu
Clayton Sanford
Rocco A. Servedio
Emmanouil-Vasileios Vlatakis-Gkaragkounis
ArXiv (abs)PDFHTML

Papers citing "Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals"

1 / 1 papers shown
Title
The Polynomial Method is Universal for Distribution-Free Correlational
  SQ Learning
The Polynomial Method is Universal for Distribution-Free Correlational SQ Learning
Aravind Gollakota
Sushrut Karmalkar
Adam R. Klivans
23
2
0
22 Oct 2020
1