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"

3 / 3 papers shown
Title
An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds
An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds
Siyu Chen
Theodor Misiakiewicz
Ilias Zadik
Peiyuan Zhang
40
0
0
06 Jun 2025
Adaptive and oblivious statistical adversaries are equivalent
Adaptive and oblivious statistical adversaries are equivalent
Guy Blanc
Gregory Valiant
AAML
52
2
0
17 Oct 2024
Agnostically Learning Multi-index Models with Queries
Agnostically Learning Multi-index Models with Queries
Ilias Diakonikolas
Daniel M. Kane
Vasilis Kontonis
Christos Tzamos
Nikos Zarifis
61
4
0
27 Dec 2023
1