Matching the Statistical Query Lower Bound for k-sparse Parity Problems
with Stochastic Gradient Descent

Matching the Statistical Query Lower Bound for k-sparse Parity Problems with Stochastic Gradient Descent

18 April 2024

Quanquan Gu

Papers citing "Matching the Statistical Query Lower Bound for k-sparse Parity Problems with Stochastic Gradient Descent"

4 / 4 papers shown

Title
From Sparse Dependence to Sparse Attention: Unveiling How Chain-of-Thought Enhances Transformer Sample Efficiency Kaiyue Wen Huaqing Zhang Hongzhou Lin Jingzhao Zhang MoE LRM 56 2 0 07 Oct 2024
Repetita Iuvant: Data Repetition Allows SGD to Learn High-Dimensional Multi-Index Functions Luca Arnaboldi Yatin Dandi Florent Krzakala Luca Pesce Ludovic Stephan 59 11 0 24 May 2024
Benign Overfitting in Two-Layer ReLU Convolutional Neural Networks for XOR Data Xuran Meng Difan Zou Yuan Cao MLT 16 7 0 03 Oct 2023
SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics Emmanuel Abbe Enric Boix-Adserà Theodor Misiakiewicz FedML MLT 76 72 0 21 Feb 2023