Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2104.05091
Cited By
Simple, Optimal Algorithms for Random Sampling Without Replacement
11 April 2021
Daniel Ting
Re-assign community
ArXiv (abs)
PDF
HTML
Github
Papers citing
"Simple, Optimal Algorithms for Random Sampling Without Replacement"
3 / 3 papers shown
Scalable Subsampling Inference for Deep Neural Networks
ACM / IMS Journal of Data Science (JIDS), 2024
Kejin Wu
D. Politis
213
4
0
14 May 2024
A Simple Bootstrap for Chatterjee's Rank Correlation
Biometrika (Biometrika), 2023
Holger Dette
Marius Kroll
364
11
0
02 Aug 2023
Scalable subsampling: computation, aggregation and inference
D. Politis
202
9
0
13 Dec 2021
1
Page 1 of 1
