ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2006.04787
  4. Cited By
Classification Under Misspecification: Halfspaces, Generalized Linear
  Models, and Connections to Evolvability
v1v2 (latest)

Classification Under Misspecification: Halfspaces, Generalized Linear Models, and Connections to Evolvability

8 June 2020
Sitan Chen
Frederic Koehler
Ankur Moitra
Morris Yau
ArXiv (abs)PDFHTML

Papers citing "Classification Under Misspecification: Halfspaces, Generalized Linear Models, and Connections to Evolvability"

16 / 16 papers shown
A Unified Theoretical Analysis of Private and Robust Offline Alignment: from RLHF to DPO
A Unified Theoretical Analysis of Private and Robust Offline Alignment: from RLHF to DPO
Xingyu Zhou
Yulian Wu
Francesco Orabona
OffRL
540
5
0
21 May 2025
A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise
A Near-optimal Algorithm for Learning Margin Halfspaces with Massart NoiseNeural Information Processing Systems (NeurIPS), 2025
Ilias Diakonikolas
Nikos Zarifis
280
5
0
17 Jan 2025
Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension
Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension
Gautam Chandrasekaran
Adam R. Klivans
Vasilis Kontonis
Raghu Meka
Konstantinos Stavropoulos
365
11
0
01 Jul 2024
Online Learning of Halfspaces with Massart Noise
Online Learning of Halfspaces with Massart Noise
Ilias Diakonikolas
Vasilis Kontonis
Christos Tzamos
Nikos Zarifis
233
1
0
21 May 2024
Efficient Active Learning Halfspaces with Tsybakov Noise: A Non-convex
  Optimization Approach
Efficient Active Learning Halfspaces with Tsybakov Noise: A Non-convex Optimization ApproachInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2023
Yinan Li
Chicheng Zhang
204
1
0
23 Oct 2023
Cryptographic Hardness of Learning Halfspaces with Massart Noise
Cryptographic Hardness of Learning Halfspaces with Massart NoiseNeural Information Processing Systems (NeurIPS), 2022
Ilias Diakonikolas
D. Kane
Pasin Manurangsi
Lisheng Ren
213
32
0
28 Jul 2022
Semi-Random Sparse Recovery in Nearly-Linear Time
Semi-Random Sparse Recovery in Nearly-Linear TimeAnnual Conference Computational Learning Theory (COLT), 2022
Jonathan A. Kelner
Jungshian Li
Allen Liu
Aaron Sidford
Kevin Tian
269
18
0
08 Mar 2022
Agnostic Learnability of Halfspaces via Logistic Loss
Agnostic Learnability of Halfspaces via Logistic LossInternational Conference on Machine Learning (ICML), 2022
Ziwei Ji
Kwangjun Ahn
Pranjal Awasthi
Satyen Kale
Stefani Karp
253
3
0
31 Jan 2022
Learning General Halfspaces with General Massart Noise under the
  Gaussian Distribution
Learning General Halfspaces with General Massart Noise under the Gaussian Distribution
Ilias Diakonikolas
D. Kane
Vasilis Kontonis
Christos Tzamos
Nikos Zarifis
229
31
0
19 Aug 2021
Approximate Maximum Halfspace Discrepancy
Approximate Maximum Halfspace DiscrepancyInternational Symposium on Algorithms and Computation (ISAAC), 2021
Michael Matheny
J. Phillips
182
5
0
25 Jun 2021
Boosting in the Presence of Massart Noise
Boosting in the Presence of Massart NoiseAnnual Conference Computational Learning Theory (COLT), 2021
Ilias Diakonikolas
R. Impagliazzo
D. Kane
Rex Lei
Jessica Sorrell
Christos Tzamos
159
14
0
14 Jun 2021
Improved Algorithms for Efficient Active Learning Halfspaces with
  Massart and Tsybakov noise
Improved Algorithms for Efficient Active Learning Halfspaces with Massart and Tsybakov noiseAnnual Conference Computational Learning Theory (COLT), 2021
Chicheng Zhang
Yinan Li
314
25
0
10 Feb 2021
Near-Optimal Statistical Query Hardness of Learning Halfspaces with
  Massart Noise
Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart NoiseAnnual Conference Computational Learning Theory (COLT), 2020
Ilias Diakonikolas
D. Kane
419
30
0
17 Dec 2020
Robust Learning under Strong Noise via SQs
Robust Learning under Strong Noise via SQsInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2020
Ioannis Anagnostides
Themis Gouleakis
Ali Marashian
NoLa
223
0
0
18 Oct 2020
Online and Distribution-Free Robustness: Regression and Contextual
  Bandits with Huber Contamination
Online and Distribution-Free Robustness: Regression and Contextual Bandits with Huber ContaminationIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2020
Sitan Chen
Frederic Koehler
Ankur Moitra
Morris Yau
419
37
0
08 Oct 2020
A Polynomial Time Algorithm for Learning Halfspaces with Tsybakov Noise
A Polynomial Time Algorithm for Learning Halfspaces with Tsybakov Noise
Ilias Diakonikolas
D. Kane
Vasilis Kontonis
Christos Tzamos
Nikos Zarifis
282
22
0
04 Oct 2020
1
Page 1 of 1