Weighted Sampling without Replacement for Deep Top-k Classification

Dieqiao Feng, Yuanqi Du, Carla P. Gomes, B. Selman
2/12/2026

No confident code implementation found for this paper.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Faster Query Times for Fully Dynamic k-Center Clustering with Outliers

81% match2026

Fast Algorithms for Distributed k-Clustering with Outliers

80% match2026

Differentially Private Federated k-Means Clustering with Server-Side Data

79% match1 repo62026

SFESS: Score Function Estimators for k-Subset Sampling

78% match1 repo42026

Improved Guarantees for Fully Dynamic k-Center Clustering with Outliers in General Metric Spaces

77% match2026

Average Sensitivity of Hierarchical k-Median Clustering

76% match2026

Cite this paper

@article{feng2026weighted,
  title  = {Weighted Sampling without Replacement for Deep Top-k Classification},
  author = {Dieqiao Feng and Yuanqi Du and Carla P. Gomes and B. Selman},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:3c0f8913ed5c3c27bcec4eb5ea87ca7423a7c2c0},
  journal = {ICML 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/3c0f8913ed5c3c27bcec4eb5ea87ca7423a7c2c0.svg)](https://codeofpaper.com/paper/3c0f8913ed5c3c27bcec4eb5ea87ca7423a7c2c0)

Discussion