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. 2302.06512
  4. Cited By
Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces
  and ReLU Regression under Gaussian Marginals

Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals

13 February 2023
Ilias Diakonikolas
D. Kane
Lisheng Ren
ArXivPDFHTML

Papers citing "Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals"

19 / 19 papers shown
Title
Active Learning of General Halfspaces: Label Queries vs Membership Queries
Ilias Diakonikolas
D. Kane
Mingchen Ma
27
1
0
03 Jan 2025
Reliable Learning of Halfspaces under Gaussian Marginals
Ilias Diakonikolas
Lisheng Ren
Nikos Zarifis
30
0
0
18 Nov 2024
Learning a Single Neuron Robustly to Distributional Shifts and
  Adversarial Label Noise
Learning a Single Neuron Robustly to Distributional Shifts and Adversarial Label Noise
Shuyao Li
Sushrut Karmalkar
Ilias Diakonikolas
Jelena Diakonikolas
OOD
49
0
0
11 Nov 2024
Sample and Computationally Efficient Robust Learning of Gaussian
  Single-Index Models
Sample and Computationally Efficient Robust Learning of Gaussian Single-Index Models
Puqian Wang
Nikos Zarifis
Ilias Diakonikolas
Jelena Diakonikolas
42
1
0
08 Nov 2024
Efficient Testable Learning of General Halfspaces with Adversarial Label
  Noise
Efficient Testable Learning of General Halfspaces with Adversarial Label Noise
Ilias Diakonikolas
Daniel M. Kane
Sihan Liu
Nikos Zarifis
36
0
0
30 Aug 2024
Cryptographic Hardness of Score Estimation
Cryptographic Hardness of Score Estimation
Min Jae Song
33
0
0
04 Apr 2024
Super Non-singular Decompositions of Polynomials and their Application
  to Robustly Learning Low-degree PTFs
Super Non-singular Decompositions of Polynomials and their Application to Robustly Learning Low-degree PTFs
Ilias Diakonikolas
Daniel M. Kane
Vasilis Kontonis
Sihan Liu
Nikos Zarifis
20
1
0
31 Mar 2024
Improved Hardness Results for Learning Intersections of Halfspaces
Improved Hardness Results for Learning Intersections of Halfspaces
Stefan Tiegel
31
3
0
25 Feb 2024
Collaborative Learning with Different Labeling Functions
Collaborative Learning with Different Labeling Functions
Yuyang Deng
Mingda Qiao
48
0
0
16 Feb 2024
Distribution-Specific Auditing For Subgroup Fairness
Distribution-Specific Auditing For Subgroup Fairness
Daniel Hsu
Jizhou Huang
Brendan Juba
20
0
0
27 Jan 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
24
4
0
27 Dec 2023
Distribution-Independent Regression for Generalized Linear Models with
  Oblivious Corruptions
Distribution-Independent Regression for Generalized Linear Models with Oblivious Corruptions
Ilias Diakonikolas
Sushrut Karmalkar
Jongho Park
Christos Tzamos
26
1
0
20 Sep 2023
Efficiently Learning One-Hidden-Layer ReLU Networks via Schur
  Polynomials
Efficiently Learning One-Hidden-Layer ReLU Networks via Schur Polynomials
Ilias Diakonikolas
D. Kane
32
4
0
24 Jul 2023
Information-Computation Tradeoffs for Learning Margin Halfspaces with
  Random Classification Noise
Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise
Ilias Diakonikolas
Jelena Diakonikolas
D. Kane
Puqian Wang
Nikos Zarifis
6
3
0
28 Jun 2023
Robustly Learning a Single Neuron via Sharpness
Robustly Learning a Single Neuron via Sharpness
Puqian Wang
Nikos Zarifis
Ilias Diakonikolas
Jelena Diakonikolas
22
9
0
13 Jun 2023
Tester-Learners for Halfspaces: Universal Algorithms
Tester-Learners for Halfspaces: Universal Algorithms
Aravind Gollakota
Adam R. Klivans
Konstantinos Stavropoulos
Arsen Vasilyan
37
8
0
19 May 2023
Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs:
  The Case of Extra Triangles
Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles
Guy Bresler
Chenghao Guo
Yury Polyanskiy
39
1
0
17 May 2023
Efficient Testable Learning of Halfspaces with Adversarial Label Noise
Efficient Testable Learning of Halfspaces with Adversarial Label Noise
Ilias Diakonikolas
D. Kane
Vasilis Kontonis
Sihan Liu
Nikos Zarifis
AAML
50
10
0
09 Mar 2023
Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice
  Problems
Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems
Stefan Tiegel
15
15
0
28 Jul 2022
1