Co-occurring keywords · papers mentioning both
Papers
Sandwiching Polynomials for Geometric Concepts with Low Intrinsic Dimension
COLT 2026
Agnostic Membership Query Learning with Nontrivial Savings: New Results and Techniques
ALT 2024
Testably Learning Polynomial Threshold Functions
NeurIPS 2024
Attribute-Efficient PAC Learning of Low-Degree Polynomial Threshold Functions with Nasty Noise
ICML 2023
Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems
COLT 2023
Active Learning Polynomial Threshold Functions
NeurIPS 2022
Approximating bounded tree-width Bayesian network classifiers with OBDD
PGM 2020
Hardness of Learning Noisy Halfspaces using Polynomial Thresholds
COLT 2018
PAC Learning Depth-3 AC^0 Circuits of Bounded Top Fanin
ALT 2017
Attribute-Efficient Learning andWeight-Degree Tradeoffs for Polynomial Threshold Functions
COLT 2012
Learning DNF Expressions from Fourier Spectrum
COLT 2012
Toward Attribute Efficient Learning of Decision Lists and Parities
JMLR 2006