Co-occurring keywords · papers mentioning both
Papers
Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems
COLT 2023
On Accelerated Perceptrons and Beyond
ICLR 2023
Algorithms and Hardness for Learning Linear Thresholds from Label Proportions
NeurIPS 2022
Learnability of Linear Thresholds from Label Proportions
NeurIPS 2021
Reconstructing weighted voting schemes from partial information about their power indices
COLT 2021
The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals in the SQ Model
COLT 2021
Distribution-Independent Evolvability of Linear Threshold Functions
COLT 2011
On higher-order perceptron algorithms
NeurIPS 2007
Attribute-efficient learning of decision lists and linear threshold functions under unconcentrated distributions
NeurIPS 2006
Generalization Error Bounds for Threshold Decision Lists
JMLR 2004