Pages that link to "Item:Q3558016"

The following pages link to On Agnostic Learning of Parities, Monomials, and Halfspaces (Q3558016):

Displaying 16 items.

• Improved approximation of linear threshold functions (Q371200) (← links)
• A complete characterization of statistical query learning with applications to evolvability (Q439989) (← links)
• On the hardness of learning intersections of two halfspaces (Q619909) (← links)
• A new column generation algorithm for logical analysis of data (Q646710) (← links)
• Stronger data poisoning attacks break data sanitization defenses (Q2127214) (← links)
• Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
• Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
• Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time (Q2205636) (← links)
• Solving the learning parity with noise's open question (Q2444770) (← links)
• Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
• BKW meets Fourier new algorithms for LPN with sparse parities (Q2697880) (← links)
• Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem (Q2796401) (← links)
• New Algorithms for Learning in Presence of Errors (Q3012822) (← links)
• Algorithmic Signaling of Features in Auction Design (Q3449589) (← links)
• Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
• Improved learning of \(k\)-parities (Q5918966) (← links)