The following pages link to Agnostically Learning Halfspaces (Q3549323):
Displaying 40 items.
- The average sensitivity of an intersection of half spaces (Q347457) (← links)
- Improved approximation of linear threshold functions (Q371200) (← links)
- A complete characterization of statistical query learning with applications to evolvability (Q439989) (← links)
- Reliable agnostic learning (Q439993) (← links)
- On the hardness of learning intersections of two halfspaces (Q619909) (← links)
- A theory of learning with similarity functions (Q1009272) (← links)
- Halfspace learning, linear programming, and nonmalicious distributions (Q1336756) (← links)
- Learning from binary labels with instance-dependent noise (Q1631810) (← links)
- A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting (Q1656545) (← links)
- Analysis of the IJCNN 2007 agnostic learning vs. prior knowledge challenge (Q1932020) (← links)
- The regularized least squares algorithm and the problem of learning halfspaces (Q1944907) (← links)
- Polynomial regression under arbitrary product distributions (Q1959600) (← links)
- The hardest halfspace (Q1983325) (← links)
- Surrogate losses in passive and active learning (Q2008623) (← links)
- Depth separations in neural networks: what is actually being separated? (Q2117335) (← links)
- Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions (Q2290687) (← links)
- Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795) (← links)
- Dual polynomials for collision and element distinctness (Q2830865) (← links)
- Learning $$AC^0$$ Under k-Dependent Distributions (Q2988821) (← links)
- Quantum matchgate computations and linear threshold gates (Q3076715) (← links)
- Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces (Q3189646) (← links)
- Hardness Amplification and the Approximate Degree of Constant-Depth Circuits (Q3448791) (← links)
- Learning Halfspaces with Malicious Noise (Q3638067) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- Testing \(k\)-monotonicity (Q4638079) (← links)
- Agnostic Learning of Monomials by Halfspaces Is Hard (Q4910575) (← links)
- Agnostic Learning in Permutation-Invariant Domains (Q4962625) (← links)
- Improper learning by refuting (Q4993325) (← links)
- (Q4999109) (← links)
- Agnostic Learning from Tolerant Natural Proofs (Q5002638) (← links)
- (Q5009555) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- Agnostically Learning Boolean Functions with Finite Polynomial Representation (Q5136248) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5140844) (← links)
- (Q5743502) (← links)
- Approximating the Noise Sensitivity of a Monotone Boolean Function (Q5875511) (← links)
- Efficiently learning halfspaces with Tsybakov noise (Q6065173) (← links)
