Pages that link to "Item:Q2517820"

The following pages link to Cryptographic hardness for learning intersections of halfspaces (Q2517820):

Displaying 21 items.

• On the hardness of learning intersections of two halfspaces (Q619909) (← links)
• Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
• The hardest halfspace (Q1983325) (← links)
• New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
• The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
• Efficient learning algorithms yield circuit lower bounds (Q2517822) (← links)
• Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
• Complexity of training ReLU neural network (Q2673242) (← links)
• Fast Pseudorandom Functions Based on Expander Graphs (Q3179351) (← links)
• (Q4558174) (← links)
• (Q4614098) (← links)
• Convergence Results for Neural Networks via Electrodynamics (Q4993285) (← links)
• Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
• Fooling Polytopes (Q5066946) (← links)
• (Q5091179) (← links)
• Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability (Q5868941) (← links)
• Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)
• Polynomial‐time universality and limitations of deep learning (Q6074573) (← links)
• Statistical computational learning (Q6602226) (← links)
• Is ML-based cryptanalysis inherently limited? Simulating cryptographic adversaries via gradient-based methods (Q6652981) (← links)
• An algorithm for learning representations of models with scarce data (Q6660916) (← links)