💀 The Wall of Shame

The most cited papers with no code. Sorted by the weight of their sins.

Page 1

# Paper Cause of Death Category Citations Published
1 Tight Sample Complexity of Transformers
Chenxiao Yang, Nathan Srebro, Zhiyuan Li
cs.LG 0 2 months ago
2 Testing for a Hidden Geometry in Random Graphs
Amit Silber, Mor Oren-Loberman, Wasim Huleihel
cs.IT 0 2 months ago
3 Learning with Simulators: No Regret in a Computationally Bounded World
Sasha Voitovych, Abhishek Shetty, ... (+2 more)
cs.LG 0 2 months ago
4 A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions
Yuzhou Gu, Xin Li, Yinzhan Xu
cs.DS 0 2 months ago
5 Wasserstein Policy Learning for Distributional Outcomes
Yiyan Huang, Cheuk Hang Leung, ... (+2 more)
stat.ME 0 2 months ago
6 Toward Simultaneously Optimal Regret in U-Calibration
Rafael Frongillo, Haipeng Luo, ... (+2 more)
stat.ML 0 2 months ago
7 Accelerated Convex Optimization via Hamiltonian Dynamics with Deterministic Integration Time
Xiuyuan Wang, Vishwak Srinivasan, ... (+4 more)
math.OC 0 2 months ago
8 Computing Lewis weights to high precision using local relative smoothness
Sander Gribling, Aaron Sidford, Chenyi Zhang
cs.DS 0 2 months ago
9 An Exponential Lower Bound for Spectral Density Estimation on Unweighted Graphs
Pan Peng, Yuyang Wang, ... (+2 more)
cs.DS 0 2 months ago
10 Blackwell Approachability and Gradient Equilibrium are Equivalent
Brian W. Lee, Nika Haghtalab, ... (+2 more)
cs.LG 0 2 months ago
11 Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity
Haitong Liu, Deepak Narayanan Sridharan, ... (+2 more)
cs.DS 0 2 months ago
12 Space-Efficient Language Generation in the Limit
Nicolas Flammarion, Chirag Pabbaraju, ... (+3 more)
cs.DS 0 2 months ago
13 Data Augmentation: A Fourier Analysis Perspective
Behrooz Tahmasebi, Melanie Weber, Stefanie Jegelka
cs.LG 0 2 months ago
14 Active Learning on Adversarially Corrupted Graphs
Marco Bressan, Nicolò Cesa-Bianchi, ... (+3 more)
cs.LG 0 2 months ago
15 Fast, Parallel, Query-Efficient Binary Classification
Ishani Karmarkar, Liam O'Carroll, Aaron Sidford
math.OC 0 2 months ago
16 Open Problem: Is Interaction Necessary for Order-Optimal 1-bit Mean Estimation?
Ivan Lau, Jonathan Scarlett
cs.IT 0 2 months ago
17 Recovery of Planted Subgraphs
Wasim Huleihel
cs.IT 0 2 months ago
18 Random Reshuffling Dominates Stochastic Gradient Descent
Zijian Liu
math.OC 0 2 months ago
19 Boosting with List-Decodable Codes
Addison Prairie, Li-Yang Tan
stat.ML 0 1 month ago