betaFeedback

WorksComputer Science

Balancing Representations by Identifying and Generating Under-represented Data

Abstract

Self-supervised learning inherits the coverage of its source data. When an unlabeled corpus is long-tailed, the representation becomes dense around frequent modes and thin where coverage is weak. Objectives for long-tailed SSL reweight the images already in the corpus and add no new ones. We introduce BRIDGE (Balancing Representations by Identifying and Generating Under-represented Data), a label-free feedback loop around the source set. The current encoder scores every source image by its mean kNN distance, and a budgeted acquisition rule selects images from a band of that score distribution where support is thin and the generator still produces faithful variants. A frozen image-to-image diffusion model then adds local variants of the selected anchors, and pretraining continues on the enlarged source set. We formulate acquisition as recoverability-weighted allocation of local support and derive when a finite budget should favor a sparse band that excludes the extreme tail and when reallocation after each repair is optimal under a fixed objective. Across five long-tailed, web-scraped and synthetic source regimes, BRIDGE has the highest seven-task linear-probe and kNN average of the compared methods, and paired experiments extend the gain to ViT-S under contrastive and self-distillation objectives, to low-label fine-tuning and to semantic segmentation. The linear-probe gain is smaller under masked reconstruction. Generated repair matches an oracle that restores the withheld real images, and under a frozen encoder the inserted images shrink the neighborhoods of the selected anchors about twice as much as those of matched unselected images. BRIDGE needs no labels and leaves the pretraining objective unchanged, so it can be added to pretraining on uncurated web data, where the encoder decides which images to generate.

Figure 1. Overview of BRIDGE. Left, an imbalanced source set embedded by the SSL encoder, with sparse under-represented samples in red. Right, the loop. Distance to the kk nearest neighbors in the current latent space selects sparse samples from the upper tail of the score distribution while the extreme tail is excluded, image-to-image generation adds variants of them, and the refined dataset is the source set of the next cycle.

Introduction

Self-supervised learning produces transferable visual representations from unlabeled images [10, 14, 8, 15, 32, 38], and every objective learns from what its source corpus contains. When that corpus is long-tailed, the representation concentrates around frequent modes, covers rare regions weakly and transfers worse [42, 3, 22, 19]. Prior work responds on the model side, with a temperature schedule [22], a pruned self-competitor [19] or imported external data [5], leaving the source set fixed.

We ask whether the source set can be repaired while learning proceeds. BRIDGE, Balancing Representations by Identifying and Generating Under-represented Data, embeds the source set with the current encoder after each cycle and scores every image by its mean distance to its kk nearest neighbors. It selects a sparse but semantically coherent band of that distribution, generates local variants of the selected images with a frozen image-to-image diffusion model and continues pretraining on the enlarged set (Figure 1), while no labels, class frequencies or downstream signals enter the loop.

We formalize acquisition as budgeted allocation over regions of representation space with diminishing returns to local support and repair fidelity that falls in the extreme tail. Under this model the budget belongs in a sparse band that excludes the extreme tail, and greedy reallocation after each repair is optimal under a fixed objective. In the experiments this band beats uniform acquisition by 6.6 to 6.8 points and top-tail acquisition by 7.8 to 8.0 points.

Across five long-tailed, web-scraped and synthetic sources, BRIDGE raises the seven-task linear-probe average of SimCLR on the same source by 2.4 to 10.6 points and has the best average of all compared methods under linear-probe and kkNN evaluation. With a power-law class imbalance imposed on ImageNet-100, repair adds 11.1 points, while a class-balanced source of the same size adds 0.1. On ViT-S the linear-probe average rises by 2.0 to 2.8 points under SimCLR, MoCo v3 and DINO, and generated repair reaches the accuracy of an oracle that adds real images withheld from the source, 41.5 against 40.7.

Our contributions are as follows.

  • A theory of label-free data repair as recoverability-weighted allocation of local support (Section 3), which shows that under diminishing returns and fidelity that decays with sparsity the budget belongs in a sparse band that excludes the extreme tail, and that greedy reallocation is optimal under a fixed separable objective.

  • BRIDGE, a label-free feedback loop that instantiates this policy (Section 4) with mean kkNN distance as the support estimate, a trimmed score band that holds sparse images the generator can still vary faithfully, farthest-point sampling against redundancy and a frozen image-to-image generator as the repair operator.

  • An evaluation on five source regimes and seven transfer tasks under linear-probe and kkNN protocols (Section 6), with paired ViT-S experiments across four SSL objectives, low-label fine-tuning, where accuracy rises by 2.0 and 3.2 points, and PASCAL VOC segmentation, where it rises by 2.4 mIoU.

  • An account of where the effect comes from (Sections 6.1 and 6.2). The band beats uniform and top-tail acquisition as Section 3 predicts, and a fixed-encoder test shows the generated images shrinking the neighborhoods of their own anchors twice as much as those of matched unselected images.

Related Work

Self-supervised learning under skewed sources. Contrastive, self-distillation and masked-reconstruction pretraining [10, 14, 8, 32, 38, 15] is sensitive to source imbalance, which has been addressed with clustered experts, the hidden uniform cluster prior and reweighting by estimated class frequency [42, 3, 26]. The closest methods change the objective on a fixed corpus, SDCLR with a pruned self-competitor [19] and Temperature Schedules by emphasizing head and tail at different times [22], or import external images [5].

Rarity, curation and budgeted acquisition. Mean deep nearest-neighbor distance has been used as a nonparametric out-of-distribution score [40], and we use it as a local-support estimate on the training set itself. Curation by prototype distance or concept-cluster complexity removes examples [39, 1] (Whang et al. 2023), SMOTE interpolates labeled minority examples [9], and DOPING oversamples the low-density edge of a learned latent distribution for anomaly detection with no image generator and no recomputed target [25], which our top-tail selection rule reproduces under our generator and budget. Active learning spends a finite budget under a learned representation, its core-set form treating acquisition as kk-center coverage under the greedy farthest-first traversal we use inside the mode window [37, 12]. ProbCover instead maximizes covered probability mass at a fixed radius (Yehuda et al., 2022), and Hacohen et al. [13] find dense regions the better target at small budgets.

Generative augmentation and synthetic sources. SDEdit adds noise to an image and denoises it under a diffusion prior [17, 35, 29], and that operator is our repair step. It has been applied to few-shot supervised recognition [44], class-conditional generation improves supervised ImageNet accuracy [4], and synthetic-data utility depends on prompting, filtering, diversity and domain gap [16, 11]. TADA generates faithful variants of the examples a supervised classifier learns slowly [30], a criterion that requires labels. Synthetic imagery has also been a training source for self-supervised features since Ren and Lee [34], from procedural noise and image programs [6, 7] to generator latents, synthetic ImageNet clones and text-to-image views [18, 43] (Sariyildiz et al. 2023), none allocating a budget over an observed skewed corpus. DiffAug jointly trains an encoder and a conditional diffusion generator so that generated positives improve contrastive learning (Zang et al., 2024), learning that generator from the small skewed source it is meant to repair, while BRIDGE holds a pretrained generator fixed and asks where it should intervene. Industrial data engines close a loop between a deployed model and its training data, diagnosing failures with vision-language and language models and then curating, auto-labeling and verifying [24] (Worker and Pathak 2022). They work from supervised task failures with annotation in the loop and acquire by semantic-cluster occupancy. A frozen generator also brings knowledge from its pretraining data [23, 41] (Yu et al. 2025). Appendix A tabulates the closest methods.

Theoretical Framework

Targeted repair is modeled as budgeted allocation over coherent regions of representation space. A repair helps only where it adds support in a region that contributes to downstream error and the generator preserves the content of its anchor, so the policy weighs support deficit against repairability and redundancy. Let rk(z;Z)r_k(z; Z) be the distance from zz to its kkth nearest neighbor in ZZ and AA a finite set of valid variants generated from zz. Appendix C gives complete proofs.

Proposition 1 (Monotone local support). For any finite AA, rk(z;Z∪A)≤rk(z;Z)r_k(z; Z \cup A) \le r_k(z; Z). The inequality is strict when an added point enters the first kk neighbors of zz and displaces a neighbor at strictly larger distance.

Adding points can only introduce smaller candidate distances, so the kkth order statistic cannot increase.

Partition the representation into regions jj with effective support njn_j and model the regional contribution to downstream error by

B(m)=∑jpjaj(nj+mj+κ)−γ,(1)\mathcal{B}(\mathbf{m}) = \sum_j p_j a_j (n_j + m_j + \kappa)^{-\gamma}, \tag*{(1)}

where pjp_j is the transfer-relevant mass of region jj, aja_j its difficulty, mjm_j the number of valid repairs allocated to it, and κ,γ>0\kappa,\gamma> 0. Write Δj(mj)=pjaj[(nj+mj+κ)−γ−(nj+mj+1+κ)−γ]\Delta_j(m_j) = p_j a_j[(n_j + m_j + \kappa)^{-\gamma} - (n_j + m_j + 1 + \kappa)^{-\gamma}] for the reduction from one more valid repair. None of pjp_j, aja_j, κ\kappa, γ\gamma or the regions is instantiated or estimated in the experiments, and Equation 1 is a qualitative model in the diminishing-returns form of empirical scaling laws [39].

Proposition 2 (Sparse-region marginal value). Δj(mj)\Delta_j(m_j) is positive and strictly decreasing in nj+mjn_j+m_j. Between two regions of equal transfer mass and difficulty, the region with less effective support has the larger marginal value.

The forward difference of the convex decreasing map x↦x−γx \mapsto x^{-\gamma} is positive and decreasing, which gives the claim.

Sparsity alone is not sufficient, because generation fails on corrupt or incoherent anchors. Let dd be a sparsity score, b(d)b(d) the marginal value of a valid repair at that score, ρ(d)\rho(d) the probability of a faithful variant and λ≥0\lambda\ge0 the cost of an unfaithful one, so the expected repair utility is

u(d)=ρ(d)b(d)−(1−ρ(d))λ.(2)u(d)=\rho(d)b(d)-(1-\rho(d))\lambda. \tag*{(2)}

Proposition 3 (Interior recoverable-support optimum). Suppose bb and ρ\rho are positive and continuously differentiable on [dmin⁡,dmax⁡][d_{\min},d_{\max}] with b′(d)>0b'(d)>0 and ρ′(d)<0\rho'(d)<0, and define g(d)=b′(d)/(b(d)+λ)+ρ′(d)/ρ(d)g(d)=b'(d)/(b(d)+\lambda)+\rho'(d)/\rho(d). If gg is strictly decreasing with g(dmin⁡)>0g(d_{\min})>0 and g(dmax⁡)<0g(d_{\max})<0, then uu has a unique maximizer d∗d^* in the interior, characterized by g(d∗)=0g(d^*)=0.

The sign of u′u' equals the sign of gg, so the unique sign change of gg is the unique maximum.

The monotonicity assumption on gg holds for b(d)=b0dβb(d)=b_0d^\beta with β∈(0,1]\beta\in(0,1] and ρ(d)=ρ0e−μd\rho(d)=\rho_0e^{-\mu d} (Proposition 6), where gg is strictly decreasing for every λ≥0\lambda\ge0 and d∗=β/μd^*=\beta/\mu at λ=0\lambda=0. The optimum moves outward when support value is closer to linear and inward when fidelity decays faster. BRIDGE uses a trimmed score band and estimates neither parameter. For the repeated case, consider a separable objective U(m)=∑jUj(nj+mj)U(\mathbf{m})=\sum_j U_j(n_j+m_j) with each UjU_j increasing and discretely concave and a budget of RR repairs, ∑jmj=R\sum_jm_j=R.

Proposition 4 (Adaptive allocation under diminishing returns). For integer allocations, repeatedly assigning one repair to the region with the largest current marginal gain maximizes U(m)U(\mathbf{m}). A fixed allocation may become suboptimal once a region’s marginal gain falls below that of another region.

Because every marginal sequence is nonincreasing, the greedy picks are the largest feasible marginals overall. In BRIDGE the encoder changes after every repair, and the regions and their marginals with it, so the benefit of re-estimation in the non-stationary case is an empirical claim.

Proposition 5 (Single-stage insensitivity). Let m\mathbf{m} and m′\mathbf{m}' be any two allocations of the same budget of RR repairs under (1), computed from one representation and applied without re-estimation. Then

∣B(m)−B(m′)∣≤Rγmax⁡jpjaj(nj+κ)−γ−1,(3)\left|\mathcal{B}(\mathbf{m})-\mathcal{B}(\mathbf{m}')\right|\le R\gamma\max_j p_j a_j(n_j+\kappa)^{-\gamma-1}, \tag*{(3)}

which tends to zero as R/nmin⁡→0R/n_{\min}\to0 for the least-supported region nmin⁡n_{\min}.

Both allocations subtract at most RR marginals from the same baseline, and the mean value theorem bounds every marginal.

A single allocation can therefore differ from any other only in proportion to the budget it adds, and the effect of the acquisition rule accumulates when the allocation is re-estimated over several cycles.

BRIDGE: Balancing Representations by Identifying and Generating Under-represented Data

Loop and scoring

Let D(0)D^{(0)} be an unlabeled source set and fθf_\theta an SSL encoder. BRIDGE alternates pretraining and repair over CC cycles, with encoder fθ(c)f_{\theta^{(c)}}, source set D(c)D^{(c)} and embedding set Z(c)Z^{(c)} at cycle cc. The encoder is the only learned component, so the loop applies to any objective that yields embeddings. Every cycle continues from the previous encoder with a fresh optimizer schedule and retains all earlier images.

After training on D(c)D^{(c)} we embed each image, zi(c)=fθ(c)(xi)z_i^{(c)} = f_{\theta^{(c)}}(x_i), normalize to unit length, and compute

di(c)=1k∑z∈Nk(zi(c);Z(c)∖{zi(c)})∥zi(c)−z∥22(4)d_i^{(c)} = \frac{1}{k} \sum_{z \in\mathcal{N}_k(z_i^{(c)}; Z^{(c)} \setminus\{z_i^{(c)}\})} \lVert z_i^{(c)} - z \rVert_2^2 \tag*{(4)}

where Nk(z;Z)\mathcal{N}_k(z; Z) is the set of kk nearest neighbors of zz in ZZ, so a large score marks an image in a sparse part of the current representation. We use k=100k = 100.

Sparse and recoverable anchor selection

The extreme tail holds artifacts, degenerate crops and images the generator cannot vary faithfully, while uniform sampling spends most of its budget in regions that are already dense. In three steps (Figure 2) the selector restricts attention to the band U(c)={i∣q0.75≤di(c)≤q0.99}U^{(c)} = \{i \mid q_{0.75} \le d_i^{(c)} \le q_{0.99}\}, locates the center dˉ(c)\bar{d}^{(c)} of the modal bin of a histogram over that band, forms the pool P(c)⊆U(c)P^{(c)} \subseteq U^{(c)} of size αB\alpha B that minimizes ∑i∈P(c)∣di(c)−dˉ(c)∣\sum_{i \in P^{(c)}} \lvert d_i^{(c)} - \bar{d}^{(c)} \rvert, and selects the anchor set S(c)S^{(c)} of size BB from that pool by greedy farthest-point sampling in embedding space. In every run the modal bin of the right-skewed band sits at its lower edge, so the candidate pool is the 4B4B scores just above the 75th percentile and the histogram step changes nothing (Figure 2). We use α=4\alpha= 4 and B=500B = 500.

Figure 2. Score histogram of one ImageNet-100-LT run at cycle 0 with the 75th and 99th percentiles marked. The green pool holds the 4B4B scores nearest the modal bin of the band, which lies at its lower edge, the red region is the top-tail selection rule, and the 500 selected anchors are overlaid.

Local generative repair and continued pretraining

For each anchor we generate G=5G = 5 variants with a frozen image-to-image diffusion model gϕg_{\phi}, conditioning on the anchor image under an empty text prompt so the repair signal comes from the anchor alone, and set D(c+1)=D(c)∪{gϕ(xi,ϵj)∣i∈S(c),j∈[G]}D^{(c+1)} = D^{(c)} \cup\{g_{\phi}(x_i, \epsilon_j) \mid i \in S^{(c)}, j \in[G]\}. The noise ϵj\epsilon_j indexes independent translations of one anchor, so variants keep coarse structure while changing texture, pose or color. We use Stable Diffusion 3 Medium with 20 denoising steps and strength 0.6 at the training crop resolution, and Algorithm 1 gives the loop.

Experimental Setup

Sources, targets and protocol. We pretrain on five unlabeled source regimes, the long-tailed ImageNet-100-LT [27], CIFAR-10-LT and CIFAR-100-LT [21], and 10,000-image subsets of the web corpora PASS [2] and DiffusionDB [45]. Transfer is measured on seven benchmarks: CIFAR-10-LT, CIFAR-100-LT, Stanford Cars [20], FGVC Aircraft [28], Oxford Flowers [31], Oxford-IIIT Pets [33] and ImageNet-100-LT, by linear probe and by kkNN classification on frozen features. Every number is a three-seed mean and standard deviation, paired comparisons share seeds and checkpoints, and ResNet-50 is the default backbone. The baselines train five cycles of 100 epochs on a source that does not grow, while BRIDGE trains the same epochs on a source that grows from about 10,000 to about 20,000 images, so it receives about 1.5 times the gradient updates in Table 2 and Table 3. The cycle ablation and the paired ViT-S experiments match updates exactly. The seed standard deviation of a seven-task average is 0.6 to 1.5 points, so differences below about one point are inside seed variation. Appendix D gives implementation details.

SourceMethodC10C100CarsAircraftFlowersPetsIN100-LTAvg.
ImageNet-100-LTSimCLR73.9±0.573.9 \pm0.546.8±0.446.8 \pm0.413.7±0.313.7 \pm0.319.6±0.219.6 \pm0.235.9±7.235.9 \pm7.238.6±1.538.6 \pm1.550.4±0.550.4 \pm0.539.8±1.539.8 \pm1.5
ImageNet-100-LTTS72.5±0.472.5 \pm0.444.0±0.544.0 \pm0.512.5±1.212.5 \pm1.215.0±0.115.0 \pm0.135.7±1.835.7 \pm1.840.6±2.240.6 \pm2.256.7±1.256.7 \pm1.239.6±1.139.6 \pm1.1
ImageNet-100-LTSDCLR41.1±1.741.1 \pm1.718.0±0.618.0 \pm0.61.4±0.31.4 \pm0.32.3±0.52.3 \pm0.510.8±1.710.8 \pm1.710.4±0.310.4 \pm0.321.9±0.621.9 \pm0.615.1±0.815.1 \pm0.8
ImageNet-100-LTBRIDGE (ours)75.8±0.275.8 \pm0.249.3±0.249.3 \pm0.216.4±1.216.4 \pm1.222.4±0.422.4 \pm0.436.8±1.936.8 \pm1.942.9±1.042.9 \pm1.053.8±0.153.8 \pm0.142.5±0.742.5 \pm0.7
CIFAR-10-LTSimCLR67.8±0.267.8 \pm0.238.0±1.038.0 \pm1.06.5±0.46.5 \pm0.416.0±0.916.0 \pm0.919.2±1.619.2 \pm1.624.0±1.324.0 \pm1.332.0±0.732.0 \pm0.729.1±0.929.1 \pm0.9
CIFAR-10-LTTS68.5±1.368.5 \pm1.336.0±1.736.0 \pm1.74.3±0.24.3 \pm0.210.3±0.110.3 \pm0.113.1±2.013.1 \pm2.019.7±2.319.7 \pm2.331.5±1.231.5 \pm1.226.2±1.326.2 \pm1.3
CIFAR-10-LTSDCLR39.6±1.139.6 \pm1.115.6±0.215.6 \pm0.21.1±0.11.1 \pm0.12.4±0.92.4 \pm0.912.0±1.612.0 \pm1.69.1±1.89.1 \pm1.816.5±1.616.5 \pm1.613.8±1.113.8 \pm1.1
CIFAR-10-LTBRIDGE (ours)78.1±0.378.1 \pm0.349.8±0.449.8 \pm0.49.2±0.89.2 \pm0.817.7±1.017.7 \pm1.018.2±1.118.2 \pm1.127.4±2.727.4 \pm2.739.0±0.639.0 \pm0.634.2±1.034.2 \pm1.0
CIFAR-100-LTSimCLR59.0±1.559.0 \pm1.531.1±1.631.1 \pm1.64.1±0.34.1 \pm0.311.2±1.011.2 \pm1.012.6±3.412.6 \pm3.420.1±1.020.1 \pm1.028.7±1.328.7 \pm1.323.8±1.423.8 \pm1.4
CIFAR-100-LTTS56.3±0.256.3 \pm0.228.0±0.128.0 \pm0.12.8±0.62.8 \pm0.68.5±0.28.5 \pm0.215.5±2.515.5 \pm2.516.2±3.116.2 \pm3.126.2±1.826.2 \pm1.821.9±1.221.9 \pm1.2
CIFAR-100-LTSDCLR37.1±0.837.1 \pm0.815.7±0.215.7 \pm0.21.9±0.11.9 \pm0.12.4±0.72.4 \pm0.79.4±1.09.4 \pm1.09.9±1.79.9 \pm1.716.2±0.316.2 \pm0.313.2±0.713.2 \pm0.7
CIFAR-100-LTBRIDGE (ours)74.2±0.574.2 \pm0.548.1±0.448.1 \pm0.48.3±1.08.3 \pm1.018.2±0.718.2 \pm0.724.4±2.324.4 \pm2.327.6±0.727.6 \pm0.739.8±1.139.8 \pm1.134.4±1.034.4 \pm1.0
PASS-10kSimCLR72.3±0.272.3 \pm0.245.5±0.545.5 \pm0.511.0±0.211.0 \pm0.217.5±1.417.5 \pm1.433.3±1.333.3 \pm1.333.3±0.933.3 \pm0.944.7±0.944.7 \pm0.936.8±0.836.8 \pm0.8
PASS-10kTS71.5±0.271.5 \pm0.243.5±0.543.5 \pm0.510.2±1.210.2 \pm1.217.2±0.217.2 \pm0.233.1±2.133.1 \pm2.136.4±1.836.4 \pm1.849.4±0.449.4 \pm0.437.3±0.937.3 \pm0.9
PASS-10kSDCLR42.2±1.142.2 \pm1.117.7±0.817.7 \pm0.81.8±0.31.8 \pm0.32.2±0.82.2 \pm0.810.6±1.310.6 \pm1.38.2±1.68.2 \pm1.620.8±0.420.8 \pm0.414.8±0.914.8 \pm0.9
PASS-10kBRIDGE (ours)73.9±0.373.9 \pm0.347.1±0.447.1 \pm0.413.6±0.713.6 \pm0.720.5±0.720.5 \pm0.737.7±1.037.7 \pm1.037.1±0.737.1 \pm0.749.1±0.549.1 \pm0.539.9±1.039.9 \pm1.0
DiffusionDB-10kSimCLR74.4±0.574.4 \pm0.548.6±0.248.6 \pm0.210.9±0.710.9 \pm0.717.6±0.817.6 \pm0.831.2±2.431.2 \pm2.436.1±1.336.1 \pm1.345.3±0.545.3 \pm0.537.7±0.937.7 \pm0.9
DiffusionDB-10kTS72.3±0.372.3 \pm0.344.4±0.344.4 \pm0.310.7±0.610.7 \pm0.615.4±0.615.4 \pm0.633.1±1.133.1 \pm1.139.9±2.739.9 \pm2.748.8±0.248.8 \pm0.237.8±0.837.8 \pm0.8
DiffusionDB-10kSDCLR42.4±0.242.4 \pm0.218.4±0.218.4 \pm0.21.1±0.21.1 \pm0.22.4±0.52.4 \pm0.513.0±3.713.0 \pm3.78.2±1.48.2 \pm1.421.0±0.621.0 \pm0.615.2±0.915.2 \pm0.9
DiffusionDB-10kBRIDGE (ours)75.9±0.475.9 \pm0.449.9±0.549.9 \pm0.512.8±1.012.8 \pm1.020.0±0.420.0 \pm0.435.7±1.135.7 \pm1.137.7±0.837.7 \pm0.849.1±0.549.1 \pm0.540.1±0.740.1 \pm0.7

Table 2. Linear-probe transfer from five sources to seven tasks, mean ±\pm standard deviation over three seeds. BRIDGE has the best average on every source, 2.4 to 10.6 points above SimCLR. Bold marks the best value in a column.

SourceMethodC10C100CarsAircraftFlowersPetsIN100-LTAvg.
ImageNet-100-LTSimCLR68.6±0.468.6 \pm0.437.3±0.237.3 \pm0.26.0±0.76.0 \pm0.711.2±0.411.2 \pm0.432.2±0.732.2 \pm0.723.6±0.323.6 \pm0.343.9±0.943.9 \pm0.931.8±0.531.8 \pm0.5
TS68.4±0.368.4 \pm0.336.5±0.136.5 \pm0.14.7±0.24.7 \pm0.28.3±0.58.3 \pm0.526.6±1.026.6 \pm1.023.6±1.723.6 \pm1.752.2±0.552.2 \pm0.531.5±0.631.5 \pm0.6
SDCLR32.5±0.432.5 \pm0.410.9±0.210.9 \pm0.21.0±0.31.0 \pm0.32.1±0.12.1 \pm0.110.7±0.710.7 \pm0.74.7±0.24.7 \pm0.211.2±0.211.2 \pm0.210.4±0.310.4 \pm0.3
BRIDGE (ours)69.0±0.569.0 \pm0.537.8±0.337.8 \pm0.37.0±0.27.0 \pm0.211.7±0.211.7 \pm0.236.5±0.436.5 \pm0.425.3±1.025.3 \pm1.048.1±0.648.1 \pm0.633.6±0.433.6 \pm0.4
CIFAR-10-LTSimCLR66.9±0.466.9 \pm0.433.4±0.333.4 \pm0.33.7±0.43.7 \pm0.49.8±0.79.8 \pm0.716.5±0.816.5 \pm0.813.9±0.813.9 \pm0.824.0±0.824.0 \pm0.824.0±0.624.0 \pm0.6
TS66.3±0.666.3 \pm0.627.8±0.427.8 \pm0.42.4±0.62.4 \pm0.66.4±0.26.4 \pm0.210.5±0.710.5 \pm0.711.1±0.411.1 \pm0.422.0±0.922.0 \pm0.920.9±0.520.9 \pm0.5
SDCLR30.1±0.330.1 \pm0.310.0±0.310.0 \pm0.31.7±0.31.7 \pm0.32.2±0.22.2 \pm0.210.1±0.710.1 \pm0.74.4±0.44.4 \pm0.49.8±0.39.8 \pm0.39.7±0.49.7 \pm0.4
BRIDGE (ours)74.8±0.474.8 \pm0.441.0±0.441.0 \pm0.44.8±0.54.8 \pm0.510.0±0.210.0 \pm0.224.2±0.624.2 \pm0.616.2±0.716.2 \pm0.729.7±0.329.7 \pm0.328.7±0.428.7 \pm0.4
CIFAR-100-LTSimCLR59.3±0.859.3 \pm0.830.1±0.930.1 \pm0.93.0±0.33.0 \pm0.37.4±0.47.4 \pm0.413.7±0.213.7 \pm0.210.8±0.410.8 \pm0.421.8±1.121.8 \pm1.120.9±0.620.9 \pm0.6
TS53.1±0.653.1 \pm0.624.6±0.424.6 \pm0.42.4±0.42.4 \pm0.45.5±0.35.5 \pm0.39.3±0.49.3 \pm0.48.3±0.28.3 \pm0.218.7±1.018.7 \pm1.017.4±0.517.4 \pm0.5
SDCLR25.7±1.225.7 \pm1.28.5±0.68.5 \pm0.60.9±0.40.9 \pm0.41.9±0.21.9 \pm0.27.3±0.37.3 \pm0.33.9±0.33.9 \pm0.38.3±1.18.3 \pm1.18.1±0.68.1 \pm0.6
BRIDGE (ours)69.3±0.569.3 \pm0.539.5±0.139.5 \pm0.14.8±0.64.8 \pm0.68.9±0.18.9 \pm0.121.9±0.121.9 \pm0.115.5±0.115.5 \pm0.129.1±0.729.1 \pm0.727.0±0.327.0 \pm0.3
PASS-10kSimCLR67.2±0.267.2 \pm0.237.0±0.337.0 \pm0.35.4±0.35.4 \pm0.310.3±0.510.3 \pm0.530.4±0.030.4 \pm0.016.7±0.516.7 \pm0.538.3±0.338.3 \pm0.329.3±0.329.3 \pm0.3
TS65.2±0.765.2 \pm0.734.6±0.334.6 \pm0.34.4±0.24.4 \pm0.27.9±0.27.9 \pm0.224.5±0.124.5 \pm0.114.4±0.414.4 \pm0.439.3±0.439.3 \pm0.427.2±0.327.2 \pm0.3
SDCLR32.4±1.532.4 \pm1.511.5±0.811.5 \pm0.81.3±0.21.3 \pm0.22.0±0.12.0 \pm0.18.6±0.78.6 \pm0.75.2±0.25.2 \pm0.211.1±0.811.1 \pm0.810.3±0.610.3 \pm0.6
BRIDGE (ours)67.5±0.367.5 \pm0.336.9±0.336.9 \pm0.35.8±0.55.8 \pm0.510.7±0.410.7 \pm0.433.7±0.233.7 \pm0.217.8±0.617.8 \pm0.641.4±0.841.4 \pm0.830.6±0.430.6 \pm0.4
DiffusionDB-10kSimCLR67.3±0.167.3 \pm0.136.2±0.436.2 \pm0.44.3±0.24.3 \pm0.28.8±0.18.8 \pm0.126.8±0.426.8 \pm0.417.3±0.117.3 \pm0.136.7±0.836.7 \pm0.828.2±0.328.2 \pm0.3
TS64.7±0.464.7 \pm0.433.6±0.333.6 \pm0.33.1±0.53.1 \pm0.57.3±0.37.3 \pm0.323.2±0.423.2 \pm0.417.0±0.017.0 \pm0.037.8±0.637.8 \pm0.626.7±0.426.7 \pm0.4
SDCLR32.6±1.232.6 \pm1.210.0±0.310.0 \pm0.31.3±0.11.3 \pm0.12.2±0.22.2 \pm0.26.1±0.76.1 \pm0.74.8±0.44.8 \pm0.410.6±0.510.6 \pm0.59.7±0.59.7 \pm0.5
BRIDGE (ours)68.3±0.268.3 \pm0.237.4±0.437.4 \pm0.45.4±0.35.4 \pm0.39.8±0.19.8 \pm0.130.4±0.230.4 \pm0.218.6±0.218.6 \pm0.239.4±1.039.4 \pm1.029.9±0.329.9 \pm0.3

Table 3. kNN counterpart of Table 2. BRIDGE again has the best average on every source.

Long-tailed construction. ImageNet-100 is class-balanced, so we construct its long-tailed version. A Pareto profile with exponent α=2.5\alpha= 2.5 over the 100 class ranks is rescaled to per-class retention counts between 1,280 and 5 images and permuted over the classes. Each image is kept with the retention probability of its class. The balanced source of Table 1 uses the average of those probabilities for every class, so the two sources have the same expected size and a different class distribution. CIFAR-10-LT and CIFAR-100-LT use their standard configurations.

ProtocolSourceC10C100CarsAircraftFlowersPetsIN100-LTAvg.
Linear probeBalanced65.3±1.265.3 \pm1.237.0±0.837.0 \pm0.88.0±0.58.0 \pm0.515.1±0.715.1 \pm0.722.4±1.622.4 \pm1.631.2±2.031.2 \pm2.039.0±1.039.0 \pm1.031.1±1.131.1 \pm1.1
Linear probePurposefully imbalanced65.4±4.265.4 \pm4.238.6±1.438.6 \pm1.47.6±1.17.6 \pm1.115.3±0.915.3 \pm0.923.7±1.023.7 \pm1.028.4±1.328.4 \pm1.339.6±0.339.6 \pm0.331.2±1.431.2 \pm1.4
Linear probeBRIDGE on the imbalanced source76.0±0.376.0 \pm0.349.1±0.249.1 \pm0.215.2±1.215.2 \pm1.222.4±0.422.4 \pm0.436.8±1.936.8 \pm1.942.9±1.042.9 \pm1.053.8±0.153.8 \pm0.142.3±0.742.3 \pm0.7
kNNBalanced63.6±0.763.6 \pm0.732.8±0.832.8 \pm0.84.4±0.44.4 \pm0.49.0±0.49.0 \pm0.422.3±0.122.3 \pm0.117.2±0.117.2 \pm0.134.0±1.134.0 \pm1.126.2±0.526.2 \pm0.5
kNNPurposefully imbalanced63.9±0.263.9 \pm0.233.2±0.333.2 \pm0.34.5±0.64.5 \pm0.69.0±0.39.0 \pm0.322.5±0.322.5 \pm0.316.8±0.216.8 \pm0.234.3±0.334.3 \pm0.326.3±0.326.3 \pm0.3
kNNBRIDGE on the imbalanced source69.0±0.569.0 \pm0.537.8±0.337.8 \pm0.36.7±0.36.7 \pm0.311.7±0.211.7 \pm0.236.5±0.436.5 \pm0.425.3±1.025.3 \pm1.048.1±0.648.1 \pm0.633.6±0.533.6 \pm0.5

Table 1. Imposed imbalance on ImageNet-100 over three seeds. Balancing the classes changes SimCLR by 0.1 points, while BRIDGE on the long-tailed source adds 11.1 linear-probe and 7.3 kNN points.

Compared methods and baselines. We compare with two groups of methods. TS and SDCLR change the loss on a fixed long-tailed source and are trained on each of the five sources, with hybrids in the appendix. TADA, AIDE and DiffAug add generated images as BRIDGE does, so they start from the same ImageNet-100-LT checkpoint per seed and follow the same five cycles, and only the choice or generation of images differs. All ablations use ImageNet-100-LT pretraining, the same downstream suite and three seeds under the five-cycle protocol. The generator ablation includes an oracle that stores 2,500 withheld real images per repair, the same count as the generated variants, placing true support at a deficit no label-free method can see.

Results

Imposed imbalance on ImageNet-100. ImageNet is class-balanced by construction, so the first question is what a class imbalance costs once it is imposed on purpose. Two sources are drawn from the same pool, one with the power-law profile of Section 5 and one subsampled uniformly at its average retention rate, so they differ only in how images are spread over classes. The two SimCLR runs differ by 0.1 points, 31.1 against 31.2 on the linear-probe seven-task average and 26.2 against 26.3 under kNN. BRIDGE on the imbalanced source reaches 42.3 and 33.6, which is 11.1 and 7.3 points above SimCLR on the same source and a similar margin above the balanced one. The remaining experiments use sources that are long-tailed without our intervention.

Transfer across five source regimes. BRIDGE has the best seven-task average in every source regime under both protocols (Table 2 and Table 3), and against SimCLR and TS it is best in 31 of 35 linear-probe cells and 33 of 35 kNN cells. The gain over source-matched SimCLR is above ten linear-probe points under CIFAR-100-LT and above five under CIFAR-10-LT, the two smallest and most skewed sources, and 2.4 to 3.1 points under the three larger sources. TS wins the in-domain target under the ImageNet-100-LT and PASS sources, and SDCLR’s pruning schedule was tuned for larger sources, so at 10,000 images its averages fall to 13 to 15.

ObjectiveMethodC10C100CarsAircraftFlowersPetsIN100-LTAvg. linearAvg. kNN
SimCLRSSL baseline60.5±0.560.5 \pm0.535.0±0.235.0 \pm0.27.2±0.27.2 \pm0.210.9±0.410.9 \pm0.432.9±2.732.9 \pm2.725.0±1.225.0 \pm1.242.0±1.442.0 \pm1.430.530.530.430.4
with BRIDGE60.5±0.360.5 \pm0.336.3±0.136.3 \pm0.18.2±0.28.2 \pm0.211.8±0.411.8 \pm0.436.2±0.936.2 \pm0.928.8±3.028.8 \pm3.043.9±1.143.9 \pm1.132.532.531.131.1
MoCo v3SSL baseline60.0±0.460.0 \pm0.434.5±0.134.5 \pm0.17.6±0.27.6 \pm0.211.1±1.311.1 \pm1.330.3±1.430.3 \pm1.429.3±3.129.3 \pm3.144.8±1.244.8 \pm1.231.131.133.033.0
with BRIDGE62.4±0.562.4 \pm0.536.3±0.136.3 \pm0.19.6±0.39.6 \pm0.313.4±1.013.4 \pm1.036.8±6.136.8 \pm6.131.2±4.031.2 \pm4.047.5±0.947.5 \pm0.933.933.932.832.8
DINOSSL baseline58.9±0.958.9 \pm0.933.6±1.833.6 \pm1.88.1±0.28.1 \pm0.211.4±1.011.4 \pm1.038.1±5.238.1 \pm5.227.5±2.327.5 \pm2.344.6±1.544.6 \pm1.531.831.830.530.5
with BRIDGE61.3±0.161.3 \pm0.135.2±0.335.2 \pm0.39.5±0.99.5 \pm0.913.3±0.613.3 \pm0.637.2±2.637.2 \pm2.634.6±3.634.6 \pm3.646.8±0.846.8 \pm0.834.034.032.032.0
MAESSL baseline37.7±3.737.7 \pm3.713.2±1.913.2 \pm1.91.5±0.21.5 \pm0.22.4±1.02.4 \pm1.010.5±5.910.5 \pm5.910.1±3.010.1 \pm3.019.9±2.119.9 \pm2.113.613.69.69.6
with BRIDGE41.5±2.241.5 \pm2.215.0±2.415.0 \pm2.41.6±0.41.6 \pm0.43.2±0.73.2 \pm0.78.5±2.38.5 \pm2.38.6±2.28.6 \pm2.222.2±2.422.2 \pm2.414.414.411.611.6

Table 4. Paired runs with and without BRIDGE, three seeds. (A) Repair raises the linear-probe average of all four SSL objectives on ViT-S. (B) The gain persists under fine-tuning and segmentation. Bold marks the better run of each pair.

SSL baselineWith BRIDGEPaired difference
Full fine-tuningIN100-LT, 1% labels14.31±0.3314.31 \pm0.3316.29±1.11\mathbf{16.29 \pm1.11}+1.97±0.78+1.97 \pm0.78
Full fine-tuningIN100-LT, 10% labels21.56±0.7521.56 \pm0.7524.72±1.75\mathbf{24.72 \pm1.75}+3.17±1.66+3.17 \pm1.66
SegmentationPASCAL VOC, 10%12.78±0.7912.78 \pm0.7915.20±0.86\mathbf{15.20 \pm0.86}+2.42±0.27+2.42 \pm0.27

Table 4. End-to-end downstream adaptation, SimCLR ResNet-50

Pre-training objectives and end-to-end adaptation. Four objectives run paired on ViT-S under their reference recipes and one repair budget, and BRIDGE raises the seven-task linear-probe average of each, by 2.0 points for SimCLR, 2.8 for MoCo v3 and 2.2 for DINO, and by 0.8 for MAE, inside seed variation. Under kkNN the MoCo v3 average is unchanged to slightly lower, 33.0 against 32.8, while the MAE average rises 2.0 points. Of the 14 measurements per objective, 12 or 13 improve, and fine-grained targets gain most, up to 7.1 points on Pets for DINO. The same ResNet-50 representations improve after end-to-end adaptation, by 2.0 and 3.2 points of fine-tuning accuracy with 1 and 10 percent of the labels and by 2.4 mIoU on PASCAL VOC segmentation.

Prior methods. Table 5 compares BRIDGE with three methods that also add generated images. BRIDGE has the highest average under both probes, 2.8 linear-probe points and 1.5 kkNN points above the best prior method, and the highest accuracy on six of the seven targets. The exception is Flowers, where TADA reaches 39.2 against 36.8. No prior method raises either average by more than 0.3 points over SimCLR. TADA generates variants of the examples a supervised classifier learns slowly. Without labels, we select the 500 images with the highest InfoNCE loss under the current encoder and repair them with the image-to-image step of BRIDGE. AIDE samples images inversely to the size of their cluster in CLIP ViT-B/32 feature space, captions them with BLIP and generates new images from the caption alone. Both use the same generator and image budget as BRIDGE, so the gap comes from which images are chosen and how they are generated. DiffAug trains its own diffusion generator jointly with the encoder and reaches 11.3, and adding BRIDGE repair to it changes the average by less than half a point.

MethodC10C100CarsAircraftFlowersPetsIN100-LTAvg.kkNN Avg.
SimCLR73.9 ± 0.546.8 ± 0.413.7 ± 0.319.6 ± 0.235.9 ± 7.238.6 ± 1.550.4 ± 0.539.8 ± 1.531.8 ± 0.5
DiffAug35.5 ± 5.710.2 ± 3.31.1 ± 0.22.7 ± 0.13.1 ± 2.18.2 ± 0.718.6 ± 1.511.3 ± 1.622.0 ± 0.2
DiffAug + BRIDGE36.1 ± 4.010.3 ± 2.41.2 ± 0.12.6 ± 0.21.1 ± 1.47.5 ± 2.119.0 ± 1.111.1 ± 1.422.3 ± 0.2
TADA (SSL loss)73.9 ± 1.545.0 ± 2.214.4 ± 0.815.3 ± 1.439.2 ± 2.440.1 ± 1.450.2 ± 1.039.7 ± 1.031.7 ± 0.8
AIDE (CLIP clusters, BLIP captions)72.9 ± 0.444.8 ± 1.614.8 ± 0.017.0 ± 0.937.7 ± 2.540.8 ± 3.349.7 ± 0.939.7 ± 0.532.1 ± 0.3
BRIDGE (ours)75.8 ± 0.249.3 ± 0.216.4 ± 1.222.4 ± 0.436.8 ± 1.942.9 ± 1.053.8 ± 0.142.5 ± 0.733.6 ± 0.4

Table 5. Prior methods on ImageNet-100-LT with one source checkpoint per seed and three seeds. Averages cover both probes, and the SimCLR and BRIDGE rows repeat Tables 2 and 3.

GroupSettingC10C100CarsAircraftFlowersPetsIN100-LTAvg.
GeneratorStable Diffusion 3 (default)75.0 ± 0.348.5 ± 0.216.3 ± 0.820.7 ± 0.435.7 ± 0.941.8 ± 0.852.4 ± 0.741.5 ± 0.6
FLUX70.7 ± 0.442.1 ± 1.410.3 ± 1.317.5 ± 0.929.4 ± 4.631.5 ± 2.943.7 ± 1.435.0 ± 1.9
Oracle (withheld real images restored)74.8 ± 0.447.8 ± 0.713.1 ± 0.120.5 ± 0.540.3 ± 6.138.1 ± 1.550.3 ± 0.440.7 ± 1.4
BLIP caption to SD3 text-to-image72.6 ± 1.045.1 ± 1.214.3 ± 0.317.4 ± 0.635.9 ± 3.743.3 ± 2.549.2 ± 0.039.7 ± 0.1
SD3 image-to-image with BLIP caption as prompt70.7 ± 1.041.5 ± 1.212.7 ± 0.114.5 ± 1.135.9 ± 5.239.7 ± 2.447.4 ± 0.437.5 ± 0.8
DistillationSD3 latent regression, no generated images70.7 ± 1.142.3 ± 1.113.2 ± 0.914.6 ± 1.633.8 ± 4.839.9 ± 2.147.1 ± 0.537.4 ± 1.5
SD3 latent regression and BRIDGE69.6 ± 0.440.9 ± 0.613.0 ± 0.114.1 ± 0.135.3 ± 1.838.9 ± 6.547.8 ± 0.137.1 ± 1.1
SelectionMode window, lower cutoff p175.6 ± 0.149.2 ± 0.216.9 ± 0.721.9 ± 0.434.6 ± 2.943.5 ± 0.752.8 ± 0.142.1 ± 0.7
Mode window, lower cutoff p5075.5 ± 0.149.3 ± 0.415.2 ± 0.322.4 ± 0.635.5 ± 1.143.8 ± 3.153.4 ± 0.942.2 ± 0.9
Mode window, lower cutoff p75 (default)76.0 ± 0.349.1 ± 0.215.2 ± 1.222.4 ± 0.436.8 ± 1.942.9 ± 1.053.8 ± 0.142.3 ± 0.7
Top tail70.8 ± 0.543.1 ± 1.010.0 ± 1.715.9 ± 1.327.7 ± 1.030.5 ± 1.242.2 ± 1.434.3 ± 1.2
Uniform71.5 ± 0.243.8 ± 0.79.3 ± 0.917.5 ± 1.232.9 ± 0.431.7 ± 3.942.0 ± 0.935.5 ± 1.2
Inverse cluster occupancy69.9 ± 1.940.9 ± 1.915.3 ± 0.616.5 ± 0.333.6 ± 8.439.5 ± 2.749.4 ± 0.637.9 ± 0.6
Cycles2 cycles68.9 ± 0.641.6 ± 1.310.6 ± 1.216.4 ± 0.430.7 ± 4.533.2 ± 0.943.3 ± 0.635.0 ± 1.4
5 cycles (default)76.0 ± 0.349.1 ± 0.215.2 ± 1.222.4 ± 0.436.8 ± 1.942.9 ± 1.053.8 ± 0.142.3 ± 0.7
10 cycles70.5 ± 1.243.8 ± 0.69.2 ± 0.917.2 ± 1.624.8 ± 5.231.3 ± 1.741.9 ± 0.634.1 ± 1.7
ArchitectureResNet-1868.8 ± 0.841.7 ± 1.213.5 ± 0.319.7 ± 0.638.7 ± 3.438.4 ± 2.650.2 ± 0.238.7 ± 1.1
ResNet-50 (default)76.0 ± 0.349.1 ± 0.215.2 ± 1.222.4 ± 0.436.8 ± 1.942.9 ± 1.053.8 ± 0.142.3 ± 0.7
ViT-S62.7 ± 0.437.6 ± 0.68.8 ± 0.512.2 ± 0.235.1 ± 4.230.2 ± 1.642.5 ± 1.232.7 ± 1.3
ViT-B66.0 ± 2.340.6 ± 2.38.3 ± 0.514.3 ± 0.838.8 ± 2.631.3 ± 2.144.5 ± 1.734.8 ± 1.8

Table 6. Ablations on ImageNet-100-LT, linear probe, three seeds, defaults shaded. Generated repair matches the real-image oracle, every band window beats uniform and top-tail selection, and five cycles beat two and ten.

Ablations

Generator. Generated repair with Stable Diffusion 3 matches the oracle of Section 5, 41.5 against 40.7. With FLUX at six sampling steps and guidance 2.5, the average falls to 35.0, 6.5 points below Stable Diffusion 3. With the BLIP captions of AIDE at the anchors of BRIDGE, generating from the caption alone reaches 39.7 and passing it as the prompt of the image-to-image step reaches 37.5.

Selection. The three mode windows with lower cutoffs at the 1st, 50th and 75th percentile reach 42.1 to 42.3 and are not separated, while uniform acquisition reaches 35.5 ± 1.2 and the top tail 34.3 ± 1.2 (Welch t-tests with Holm adjustment, p≤.011p \le.011 for every window against both). This agrees with Proposition 3, where excluding the extreme tail raises the objective, and leaves the lower boundary of the band unresolved. Each window changes trimming and diversification at once, and the 6.6 to 8.0 points include both effects. The inverse-occupancy rule of AIDE on N\sqrt{N} spherical kk-means clusters of the encoder features reaches 37.9.

Distillation. A linear head on the encoder regresses the averaged Stable Diffusion 3 VAE latent of each training image, with a cosine loss of weight 0.1 added to the SimCLR loss. The average is 37.4 without generated images and 37.1 with BRIDGE repair, 5.2 points below BRIDGE alone, so the gain of BRIDGE comes from the generated images at the selected anchors.

Cycles and backbone. At fixed total repair volume and optimizer budget, five cycles improve the seven-task average over two by 7.3 points and remain 8.2 points ahead of ten. Two cycles spend most of the budget before the representation has changed, and ten leave only 50 epochs of training after each repair. Among the tested backbones, ResNet-50 has the highest average at this source size.

Representation geometry

Under the frozen cycle-0 encoder (Figure 3), inserting the generated variants reduces the radius of the treated anchors by 4.7 percent against 2.4 percent for unselected images matched within class on initial radius, a paired difference of −2.3 points. Purity falls by 0.6 points at the anchors and by 2.0 at the matched images, so the variants inserted near the anchors mostly share the query’s class. The diagnostic uses k=20k = 20, and per-seed values are in Appendix § 13.

GroupSettingC10C100CarsAircraftFlowersPetsIN100-LTAvg.
GeneratorStable Diffusion 3 (default)68.6 ± 0.137.2 ± 0.26.4 ± 0.611.5 ± 0.235.2 ± 0.324.3 ± 0.646.8 ± 0.732.9 ± 0.4
FLUX65.8 ± 1.035.4 ± 0.85.7 ± 0.79.4 ± 0.927.7 ± 1.018.8 ± 1.338.7 ± 1.228.8 ± 1.0
Oracle (withheld real images restored)68.8 ± 0.237.7 ± 0.36.6 ± 0.511.4 ± 0.532.7 ± 0.123.6 ± 0.644.4 ± 0.432.2 ± 0.4
BLIP caption to SD3 text-to-image70.1 ± 0.439.6 ± 0.87.2 ± 0.511.7 ± 0.431.9 ± 1.621.1 ± 0.941.6 ± 0.931.9 ± 0.5
SD3 image-to-image with BLIP caption as prompt69.6 ± 0.139.1 ± 0.67.4 ± 0.311.7 ± 0.231.5 ± 0.820.8 ± 0.441.2 ± 0.631.6 ± 0.3
DistillationSD3 latent regression, no generated images70.3 ± 0.239.3 ± 0.27.2 ± 0.311.3 ± 0.430.5 ± 0.621.8 ± 0.741.1 ± 0.331.7 ± 0.1
SD3 latent regression and BRIDGE68.6 ± 0.738.6 ± 0.47.5 ± 0.611.6 ± 0.331.0 ± 0.920.8 ± 1.040.4 ± 0.231.2 ± 0.5
SelectionMode window, lower cutoff p169.2 ± 0.337.7 ± 0.26.6 ± 0.211.4 ± 0.235.9 ± 0.225.0 ± 0.548.3 ± 0.333.4 ± 0.3
Mode window, lower cutoff p5068.7 ± 0.138.0 ± 0.27.3 ± 0.211.3 ± 0.236.5 ± 0.124.8 ± 0.848.5 ± 0.433.6 ± 0.3
Mode window, lower cutoff p75 (default)69.0 ± 0.537.8 ± 0.36.7 ± 0.311.7 ± 0.236.5 ± 0.425.3 ± 1.048.1 ± 0.633.6 ± 0.5
Top tail65.7 ± 0.834.4 ± 0.24.1 ± 0.49.6 ± 0.223.9 ± 0.918.1 ± 0.835.4 ± 1.227.3 ± 0.6
Uniform66.1 ± 1.035.7 ± 0.34.9 ± 0.110.2 ± 0.725.3 ± 0.419.0 ± 0.837.4 ± 0.628.4 ± 0.6
Inverse cluster occupancy68.7 ± 0.338.6 ± 0.27.7 ± 0.211.8 ± 0.332.1 ± 0.921.4 ± 0.641.2 ± 0.431.6 ± 0.2
Cycles2 cycles65.3 ± 0.434.2 ± 0.55.0 ± 0.710.0 ± 0.226.1 ± 0.818.7 ± 0.635.9 ± 0.327.9 ± 0.5
5 cycles (default)69.0 ± 0.537.8 ± 0.36.7 ± 0.311.7 ± 0.236.5 ± 0.425.3 ± 1.048.1 ± 0.633.6 ± 0.5
10 cycles66.4 ± 0.535.4 ± 0.34.8 ± 0.310.4 ± 0.625.2 ± 0.818.6 ± 0.936.0 ± 0.728.1 ± 0.6
ArchitectureResNet-1866.3 ± 0.235.7 ± 0.35.9 ± 0.211.1 ± 0.433.5 ± 0.123.3 ± 0.544.5 ± 0.731.5 ± 0.4
ResNet-50 (default)69.0 ± 0.537.8 ± 0.36.7 ± 0.311.7 ± 0.236.5 ± 0.425.3 ± 1.048.1 ± 0.633.6 ± 0.5
ViT-S67.3 ± 0.437.5 ± 0.35.3 ± 0.27.6 ± 0.136.2 ± 0.720.1 ± 1.042.1 ± 1.030.9 ± 0.5
ViT-B69.3 ± 0.840.1 ± 0.86.0 ± 0.28.3 ± 0.239.8 ± 0.821.9 ± 1.445.1 ± 0.732.9 ± 0.7

Table 7. kNN counterpart of Table 6.

Figure 4. Scores of one ImageNet-100-LT run over four repair cycles, 75th to 99th percentile band shaded. The distribution shifts at every cycle, so the band is re-derived each time.

Limitations

BRIDGE depends on informative encoder neighborhoods in the first cycle and on a frozen generator that imports the biases of its own pretraining data. Repair fidelity, the ρ\rho of § 3, is not measured in pixel or semantic space, and the deficit of top-tail selection is consistent with low fidelity there. Measured fidelity could set the band edges in place of fixed percentiles. Later cycles select generated images as anchors, 7 to 13 percent at cycle 1 and 34 to 45 percent at cycle 4, with no filter applied. The band, neighborhood size and budget were held at their defaults across all five sources. The loop adds 30 to 45 percent wall-clock time (Appendix § 16).

Conclusion

In this paper we introduce BRIDGE, which lets a self-supervised learner fill the sparse regions of its own representation and improves transfer from every long-tailed source we tested. Web-scale pretraining corpora are long-tailed in the same way as our sources, and as generators improve, the representation itself could decide at each stage of large-scale pretraining which regions to fill, making data curation part of training. The same loop applies to any modality with a pretrained generator, such as audio, video or molecules, which should be explored in further research.

AI USE STATEMENT

In this work we used generative AI tools for writing and debugging the data generators, the training and evaluation scripts and the analysis code, for tabulating results, and for editing the text of the manuscript under the direction of the authors. We also used them to check the bibliography, and every entry was subsequently verified against its publisher, proceedings or arXiv record by the authors. We have not used generative AI tools for generating research ideas. The generated images that enter pretraining come from the frozen image generator described in § 4, and no assistant-written text or code is part of that data. All AI-assisted code was reviewed and tested by the authors, every number in the paper was checked against the evaluation outputs, and all text was reviewed and revised by the authors. We take responsibility for the final content of this work, including text, claims and artifacts produced with the aid of generative AI.

REPRODUCIBILITY STATEMENT

§ 4 and Algorithm 1 specify the loop, § 5 and Appendix § 15 give every operating parameter, schedule, generator setting and data split, and Appendix § 14 contains complete proofs with their assumptions stated in § 3. Appendix § 19 reports every per-task number behind the main-text averages.

ETHICS STATEMENT

The work uses public datasets under their release terms and a frozen pretrained image generator, releases no new generator, scraped collection or generated corpus, and involves no human subjects. Generative repair inherits the biases and memorization risks of the generator’s pretraining data, and a deployment would require a task-specific review of fairness, privacy and content safety, as Appendix § 18 discusses.

Comparison with Related Acquisition Methods

Classical oversampling and TADA receive labels or supervised learning signals (Table 8). DOPING uses latent rarity, targets anomaly detection and does not close the loop through a changing SSL representation. GenRep and StableRep make synthetic images or latent neighborhoods the source of contrastive views without allocating a repair budget over an observed skewed corpus. DiffAug is the prior SSL method most similar to ours, since it also iterates between encoder and generator, and it jointly learns a generator for generic positive views without asking where a frozen generator should intervene. AIDE and industrial data engines retrain a model on data collected where it fails a supervised task, using VLM and LLM reasoning, annotation and domain-specific verification. BRIDGE studies the label-free case in which local support in the current SSL representation is both the diagnostic and the acquisition signal.

MethodLabels or task lossAcquisition signalData actionFeedback
SMOTEclass labelsclass minorityinterpolate examplesno
DOPINGno labelslatent edge densitylatent oversamplingno
Concept pruningno task labelscluster complexityremove examplesno
DA-Fusionlabels or few-shot setclass and exemplarimage-conditioned diffusionno
TADAsupervised loss dynamicsslow-learned examplesfaithful diffusion variantsno
GenRep and StableRepprompts or generator latentglobal samplingsynthetic SSL viewsno
DiffAugno labelslearned positive-view objectivejointly learned diffusion viewsyes
AIDEtask labels and failuresVLM and LLM failure analysiscurate, generate, annotateyes
BRIDGEno labelslocal support in current SSL spacebudgeted local variantsyes

Table 8.

Table 8: Closest methods and the dimensions relevant to the acquisition problem. Feedback means that the learner or task model changes the next acquisition decision, and the methods are cited in Section 2.

Representation Diagnostics

The fixed-encoder intervention test freezes the cycle-0 encoder and queries the same original images before and after inserting all generated samples, so any change reflects the inserted points alone. First-cycle anchors are matched one-to-one within class to original images with the closest initial kkNN radius that are never selected in any cycle, and Table 9 reports the per-seed values behind Figure 3. Figure 5 draws every paired ViT-S measurement of Table 4 as a difference. The learned-space comparison retrains the encoder after the intervention and evaluates the same original-image panel. On that panel MoCo v3 on ViT-S gains 21.97±1.5821.97 \pm1.58 in effective rank, 0.296±0.0190.296 \pm0.019 in spectral entropy and 3.80±0.803.80 \pm0.80 points of 1-NN accuracy after repair, and the first two survive Holm correction, whereas SimCLR improves transfer while its effective rank falls and its local effect is mixed. We therefore use the fixed-encoder result to locate where the variants land in representation space and the learned-space statistics as objective-dependent diagnostics.

Figure 3. With the encoder frozen, generated images shrink the neighborhoods of their own anchors about twice as much as those of matched excluded images. Seed means with one standard deviation.

SeedRadius change (%) AnchorsRadius change (%) MatchedPurity change (pts) AnchorsPurity change (pts) MatchedDifference RadiusDifference Purity
0−5.38−2.27−1.57−2.79−3.11+1.22
1−5.01−2.35−0.20−1.91−2.66+1.70
2−3.62−2.58−0.07−1.17−1.05+1.09
Mean−4.67−2.40−0.61−1.96−2.27+1.34

Table 9. Fixed-encoder intervention test behind Figure 3, cycle-0 encoder, k=20k = 20. Generated images shrink the radius of their own anchors about twice as much as that of matched unselected images, and lower anchor purity less. The last two columns are anchor-minus-matched differences.

Figure 5. Repair against no repair for four objectives on ViT-S, one bar per downstream measurement (linear probe and kkNN on each of seven datasets), from the paired runs of Table 4. Blue bars are improvements. Red bars are regressions, two for SimCLR and MoCo v3 (CIFAR-10 and CIFAR-100 under kkNN), one for DINO (Flowers) and two for MAE (Flowers and Pets under the linear probe).

Where the temperature-schedule hybrid helps. Combining BRIDGE with TS lowers the seven-task average in every source regime, and it wins 7 of the 70 individual cells (Appendix Tables 10 and 11). Six of those seven fall on CIFAR-10 and ImageNet-100-LT, the two long-tailed downstream targets, and the largest are +3.3 and +2.8 points on ImageNet-100-LT and CIFAR-10 under a PASS and a CIFAR-10-LT source. The fine-grained targets lose almost every case. TS reweights the contrastive temperature toward rare samples, which sharpens the head-to-tail boundary that the long-tailed targets score, and the hybrid gains on those targets. BRIDGE alone gains more on the four fine-grained targets.

Proofs for the Support-Allocation Framework

Proposition 6 (Closed-form interior optimum). Let b(d)=b0dβb(d) = b_0d^{\beta} with b0>0b_0 > 0 and β∈(0,1]\beta\in(0,1], and let ρ(d)=ρ0e−μd\rho(d) = \rho_0e^{-\mu d} with μ>0\mu> 0. Then gg is strictly decreasing on (0,∞)(0,\infty) for every λ≥0\lambda\ge0, so Proposition 3 applies whenever gg changes sign on the interval. If λ=0\lambda= 0 the maximizer is d∗=β/μd^* = \beta/\mu, independent of b0b_0 and ρ0\rho_0.

Proof of Proposition 1. Sort the distances from zz to points in Z\mathbb{Z} and denote their kkth order statistic by rk(z;Z)r_k(z;\mathbb{Z}). Adding AA preserves every old candidate distance and may introduce smaller ones. The kkth order statistic can therefore only decrease. It decreases strictly when an added distance enters the first kk positions and displaces a strictly larger distance. □

Proof of Proposition 2. Let x=nj+mj+κx = n_j + m_j + \kappa. Since f(x)=x−γf(x) = x^{-\gamma} is positive, strictly decreasing and strictly convex for x>0x > 0, the forward difference f(x)−f(x+1)f(x) - f(x+1) is positive and strictly decreases with xx. Multiplication by pjaj>0p_j a_j > 0 preserves both properties. Equal pjajp_j a_j therefore leaves effective support as the sole determinant of the marginal ordering. □

Proof of Proposition 3. Rewrite the utility as u(d)=ρ(d)(b(d)+λ)−λu(d) = \rho(d)(b(d) + \lambda) - \lambda. Its derivative is

u′(d)=ρ(d)(b(d)+λ)[b′(d)b(d)+λ+ρ′(d)ρ(d)]=ρ(d)(b(d)+λ)g(d).u'(d) = \rho(d)(b(d) + \lambda)\left[\frac{b'(d)}{b(d) + \lambda} + \frac{\rho'(d)}{\rho(d)}\right] = \rho(d)(b(d) + \lambda)g(d).

The factor preceding g(d)g(d) is positive. Since gg is strictly decreasing and changes sign across the interval, it has exactly one root d⋆d^\star by continuity. Hence uu increases before d⋆d^\star and decreases after it, making d⋆d^\star the unique global maximizer.

Proof of Proposition 6. With b(d)=b0dβb(d) = b_0d^\beta and ρ(d)=ρ0e−μd\rho(d) = \rho_0e^{-\mu d} we have ρ′(d)/ρ(d)=−μ\rho'(d)/\rho(d) = -\mu, so

g(d)=b0βdβ−1b0dβ+λ−μ=βdβ−1dβ+c−μ,c=λ/b0≥0.g(d) = \frac{b_0\beta d^{\beta-1}}{b_0d^\beta+ \lambda} - \mu= \frac{\beta d^{\beta-1}}{d^\beta+ c} - \mu,\qquad c = \lambda/b_0 \ge0.

Write h(d)=βdβ−1(dβ+c)−1h(d) = \beta d^{\beta-1}(d^\beta+ c)^{-1}. Differentiating,

h′(d)=βdβ−2[(β−1)(dβ+c)−βdβ](dβ+c)2=βdβ−2[(β−1)c−dβ](dβ+c)2.h'(d) = \frac{\beta d^{\beta-2}\left[(\beta- 1)(d^\beta+ c) - \beta d^\beta\right]}{(d^\beta+ c)^2} = \frac{\beta d^{\beta-2}\left[(\beta- 1)c - d^\beta\right]}{(d^\beta+ c)^2}.

For β∈(0,1]\beta\in(0, 1] we have (β−1)c≤0<dβ(\beta- 1)c \le0 < d^\beta for all d>0d > 0, so the bracket is strictly negative and h′(d)<0h'(d) < 0. Hence g=h−μg = h - \mu is strictly decreasing for every λ≥0\lambda\ge0. When λ=0\lambda= 0 we have c=0c = 0 and g(d)=β/d−μg(d) = \beta/d - \mu, with unique root is d⋆=β/μd^\star= \beta/\mu. Since gg is positive below it and negative above it, d⋆d^\star is the maximizer by the argument of Proposition 3.

Proof of Proposition 4. For region jj define the marginal sequence δj,t=Uj(nj+t)−Uj(nj+t−1)\delta_{j,t} = U_j(n_j + t) - U_j(n_j + t - 1) for t≥1t \ge1, which discrete concavity makes nonincreasing, so every feasible allocation of RR repairs selects a prefix of length mjm_j from each sequence and its utility is the baseline plus the selected prefix marginals. After tt greedy steps the selected set is the tt largest prefix-feasible marginals, and the next greedy pick is the largest remaining prefix-feasible marginal, so the set stays the top $t + 1 and the claim follows by induction on tt. No feasible allocation can therefore exceed the greedy total. For the second sentence take two regions with marginal sequences (3,1,1)(3, 1, 1) and (2,2,2)(2, 2, 2) and a budget of three, where the fixed allocation (3,0)(3, 0) built from the initial ordering yields $5$ while greedy yields 3+2+2=73 + 2 + 2 = 7.

Proof of Proposition 5. Write f(x)=x−γf(x) = x^{-\gamma}. For x>0x > 0 the mean value theorem gives f(x)−f(x+1)=γξ−γ−1f(x) - f(x + 1) = \gamma\xi^{-\gamma-1} for some ξ∈(x,x+1)\xi\in(x, x + 1), so

0<Δj(mj)=pjaj[f(nj+mj+κ)−f(nj+mj+1+κ)]≤pjajγ(nj+κ)−γ−1,0 < \Delta_j(m_j) = p_ja_j\left[f(n_j + m_j + \kappa) - f(n_j + m_j + 1 + \kappa)\right] \le p_ja_j\gamma(n_j + \kappa)^{-\gamma-1},

using ξ>nj+mj+κ≥nj+κ\xi> n_j + m_j + \kappa\ge n_j + \kappa and mj≥0m_j \ge0. Both B(m)\mathcal{B}(\mathbf{m}) and B(m′)\mathcal{B}(\mathbf{m}') are obtained from the common baseline B(0)\mathcal{B}(\mathbf{0}) by subtracting sums of at most RR such marginals, since ∑jmj=∑jmj′=R\sum_j m_j = \sum_j m'_j = R. Each sum lies in [0,Rγmax⁡jpjaj(nj+κ)−γ−1][0, R\gamma\max_j p_ja_j(n_j + \kappa)^{-\gamma-1}], and the difference of two numbers drawn from an interval is bounded by its length. Monotonicity of (n+κ)−γ−1(n + \kappa)^{-\gamma-1} in nn gives the nmin⁡n_{\min} form.

Implementation and Reproducibility

Training schedule. The encoder is warm-started from the previous cycle and is never retrained from scratch. Each cycle uses a fresh optimizer and learning-rate schedule. All earlier real and generated images remain in the source set, so the setting differs from sequential-task learning in which previous data disappear. The cycle ablation holds the total optimizer update budget and the total number of generated images fixed and compares fewer repairs with more learning between them against more frequent repairs with less.

Core configuration. The main experiments use ResNet-50 encoders, five cycles of 100 epochs, mean kkNN distance with k=100k = 100, 500 anchors per cycle and five variants per anchor. The optimizer is AdamW with weight decay 10−410^{-4}, and method-specific learning rates and temperatures follow the settings of each baseline. The paired ViT-S experiments use the reference recipe of each objective. DINO uses two global and eight local crops at 96×9696 \times96 with a bottleneck projection head, and MAE runs five cycles of 80 epochs.

Scoring and selection. Scoring uses the mean squared normalized ℓ2\ell_2 distance of Equation (4). For unit vectors the squared distance is an affine function of the cosine, so cosine scoring selects the identical anchor set. The mode-window selector restricts the score distribution to the 75th to 99th percentile range, builds a histogram with the automatic bin heuristic, forms a mode-centered candidate pool of size 4B4B and applies greedy farthest-point sampling on normalized features to select the final BB anchors.

Generators. The main method uses Stable Diffusion 3 Medium in image-to-image mode, where an empty prompt makes the guidance scale inert. The generation ablation replaces it with FLUX or with the oracle, which adds the withheld real images and runs no generator. In the PASS and DiffusionDB experiments the SD3 batch size is 12 to fit the 24-hour wall-time limit. The DiffusionDB source is itself synthetic and shows the stylistic bias of the generator that produced it, so the added variants there are synthetic images derived from synthetic anchors.

Source data. PASS and DiffusionDB use train[:10000] with pretraining split override [1.0, 0.0, 0.0]. The long-tailed ImageNet-100, CIFAR-10 and CIFAR-100 sources use their standard long-tailed configurations without the 10,000-image restriction. The ImageNet-100 long tail is built from the clane9/imagenet-100 train and validation split. Class ranks 1 to 100 receive Pareto weights r−1/αr^{-1/\alpha} with α=2.5\alpha= 2.5, the weights are min-max normalized and mapped linearly onto retention counts from 1,280 down to 5 images, the resulting per-class ratios are permuted uniformly at random over the classes, and each image is retained by an independent Bernoulli draw with the ratio of its class. The balanced source of Table 1 reads the same split and replaces the per-class ratios by their mean, so it removes the same expected fraction of images uniformly over classes.

Seeds and reporting. All claims rest on three-seed averages reported as mean and standard deviation. Paired comparisons share seeds and, where stated, source checkpoints. Multiple comparisons within one table are corrected by the Holm procedure. No two conditions within a table share an encoder fingerprint.

Compute Resources and Runtime

Most experiments use one node with two NVIDIA A100 80GB GPUs under a 24-hour wall-time limit. The DINO runs fit on a single 48GB card at the batch size used. The 454 completed runs retained for this paper total approximately 5,471 wall-clock hours, of which the baselines and ablations that appear only in the appendix account for 2,987. Runs on two-GPU nodes consume roughly twice that in GPU hours, while the paired ViT-S runs hold a single card each. Failed runs, timeouts, cache migration and pilot jobs are excluded from these totals.

Mean wall-clock times over three seeds are 16.9 hours for SimCLR and 21.8 for BRIDGE on ImageNet-100-LT, 10.2 and 14.9 on PASS, and 11.6 and 16.4 on DiffusionDB. The loop therefore raises wall-clock time by roughly 30 to 45 percent over the corresponding no-repair run, of which embedding pass is a small fraction and diffusion sampling the remainder. Four repairs add 10,000 images, which is 10 percent of a 100,000-image source and 1 percent of a one-million-image source. Whether a fixed budget still helps at 100,000 or one million images was not tested.

Assets and Terms of Use

ImageNet-100-LT is derived from ImageNet. The ImageNet access terms restrict the images to non-commercial research and educational use. PASS is released under Creative Commons Attribution 4.0 and DiffusionDB under CC0-1.0. CIFAR-10, CIFAR-100, Stanford Cars, FGVC Aircraft, Oxford Flowers and Oxford-IIIT Pets are used from their official academic releases under their original terms. Stable Diffusion 3 Medium is used under the Stability AI Community License. FLUX.1-dev is used only in the ablation under the FLUX.1-dev Non-Commercial License. We do not redistribute model weights, third-party datasets or generated image corpora.

Broader Impact

A method that improves representation quality under biased source data can reduce the need for manual relabeling and can make SSL more useful where balanced data are difficult to collect. The method also relies on large image generators and web-sourced datasets, which raise risks of license violations, privacy and unintended memorization or harmful content. Our experiments stay within existing dataset and model release terms, release no new generators or scraped collections, and any deployment would need a review of these risks for its own task.

Full Results

SourceMethodC10C100CarsAircraftFlowersPetsIN100-LTAvg.
ImageNet-100-LTSimCLR73.9 ± 0.546.8 ± 0.413.7 ± 0.319.6 ± 0.235.9 ± 7.238.6 ± 1.550.4 ± 0.539.8 ± 1.5
ImageNet-100-LTTS72.5 ± 0.444.0 ± 0.512.5 ± 1.215.0 ± 0.135.7 ± 1.840.6 ± 2.256.7 ± 1.239.6 ± 1.1
ImageNet-100-LTSDCLR41.1 ± 1.718.0 ± 0.61.4 ± 0.32.3 ± 0.510.8 ± 1.710.4 ± 0.321.9 ± 0.615.1 ± 0.8
ImageNet-100-LTBRIDGE (ours)75.8 ± 0.249.3 ± 0.216.4 ± 1.222.4 ± 0.436.8 ± 1.942.9 ± 1.053.8 ± 0.142.5 ± 0.7
ImageNet-100-LTBRIDGE+TS (ours)74.2 ± 0.545.6 ± 0.89.4 ± 0.515.0 ± 0.225.5 ± 2.533.1 ± 2.848.3 ± 0.435.9 ± 1.1
ImageNet-100-LTBRIDGE+SDCLR (ours)43.8 ± 1.718.4 ± 0.72.0 ± 0.32.5 ± 0.810.0 ± 0.812.2 ± 3.121.8 ± 0.515.8 ± 1.1
CIFAR-10-LTSimCLR67.8 ± 0.238.0 ± 1.06.5 ± 0.416.0 ± 0.919.2 ± 1.624.0 ± 1.332.0 ± 0.729.1 ± 0.9
CIFAR-10-LTTS68.5 ± 1.336.0 ± 1.74.3 ± 0.210.3 ± 0.113.1 ± 2.019.7 ± 2.331.5 ± 1.226.2 ± 1.3
CIFAR-10-LTSDCLR39.6 ± 1.115.6 ± 0.21.1 ± 0.12.4 ± 0.912.0 ± 1.69.1 ± 1.816.5 ± 1.613.8 ± 1.1
CIFAR-10-LTBRIDGE (ours)78.1 ± 0.349.8 ± 0.49.2 ± 0.817.7 ± 1.018.2 ± 1.127.4 ± 2.739.0 ± 0.634.2 ± 1.0
CIFAR-10-LTBRIDGE+TS (ours)78.6 ± 0.346.1 ± 0.37.5 ± 0.911.1 ± 0.714.5 ± 0.625.1 ± 2.739.6 ± 0.831.8 ± 0.9
CIFAR-10-LTBRIDGE+SDCLR (ours)40.9 ± 0.717.9 ± 0.51.4 ± 0.12.2 ± 0.611.0 ± 2.410.0 ± 2.721.0 ± 0.614.9 ± 1.1
CIFAR-100-LTSimCLR59.0 ± 1.531.1 ± 1.64.1 ± 0.311.2 ± 1.012.6 ± 3.420.1 ± 1.028.7 ± 1.323.8 ± 1.4
CIFAR-100-LTTS56.3 ± 0.228.0 ± 0.12.8 ± 0.68.5 ± 0.215.5 ± 2.516.2 ± 3.126.2 ± 1.821.9 ± 1.2
CIFAR-100-LTSDCLR37.1 ± 0.815.7 ± 0.21.9 ± 0.12.4 ± 0.79.4 ± 1.09.9 ± 1.716.2 ± 0.313.2 ± 0.7
CIFAR-100-LTBRIDGE (ours)74.2 ± 0.548.1 ± 0.48.3 ± 1.018.2 ± 0.724.4 ± 2.327.6 ± 0.739.8 ± 1.134.4 ± 1.0
CIFAR-100-LTBRIDGE+TS (ours)73.7 ± 0.147.3 ± 0.57.9 ± 0.614.1 ± 0.518.2 ± 3.228.4 ± 0.441.3 ± 0.333.0 ± 0.8
CIFAR-100-LTBRIDGE+SDCLR (ours)42.0 ± 1.516.9 ± 0.91.3 ± 0.12.2 ± 0.610.6 ± 0.88.3 ± 0.816.2 ± 0.814.5 ± 0.8
PASS-10kSimCLR72.3 ± 0.245.5 ± 0.511.0 ± 0.217.5 ± 1.433.3 ± 1.333.3 ± 0.944.7 ± 0.936.8 ± 0.8
PASS-10kTS71.5 ± 0.243.5 ± 0.410.2 ± 1.217.2 ± 0.233.1 ± 2.136.4 ± 1.849.4 ± 0.437.3 ± 0.9
PASS-10kSDCLR42.2 ± 1.117.7 ± 0.81.8 ± 0.32.2 ± 0.810.6 ± 1.38.2 ± 1.620.8 ± 0.414.8 ± 0.9
PASS-10kBRIDGE (ours)73.9 ± 0.347.1 ± 1.413.6 ± 0.720.5 ± 0.737.7 ± 4.037.1 ± 0.749.1 ± 0.539.9 ± 1.0
PASS-10kBRIDGE+TS (ours)68.9 ± 0.640.6 ± 0.712.1 ± 0.414.1 ± 0.534.6 ± 2.931.6 ± 1.552.4 ± 0.636.4 ± 1.0
PASS-10kBRIDGE+SDCLR (ours)44.0 ± 0.918.8 ± 0.91.4 ± 0.31.8 ± 0.912.6 ± 2.612.4 ± 1.321.2 ± 1.116.0 ± 1.1
DiffusionDB-10kSimCLR74.4 ± 0.548.6 ± 0.210.9 ± 0.717.6 ± 0.831.2 ± 2.436.1 ± 1.345.3 ± 0.537.7 ± 0.9
DiffusionDB-10kTS72.3 ± 0.344.4 ± 0.310.7 ± 0.615.4 ± 0.633.1 ± 1.139.9 ± 2.748.8 ± 0.237.8 ± 0.8
DiffusionDB-10kSDCLR42.4 ± 0.218.4 ± 0.21.1 ± 0.22.4 ± 0.113.0 ± 3.78.2 ± 1.421.0 ± 0.615.2 ± 0.9
DiffusionDB-10kBRIDGE (ours)75.9 ± 0.449.9 ± 1.112.8 ± 1.020.0 ± 0.435.7 ± 1.137.7 ± 0.849.1 ± 0.540.1 ± 0.7
DiffusionDB-10kBRIDGE+TS (ours)67.8 ± 0.639.1 ± 0.59.4 ± 1.212.4 ± 0.430.3 ± 3.033.7 ± 1.950.8 ± 0.634.8 ± 1.2
DiffusionDB-10kBRIDGE+SDCLR (ours)43.8 ± 0.918.5 ± 0.31.3 ± 0.42.5 ± 0.014.3 ± 1.611.4 ± 0.621.9 ± 0.616.2 ± 0.6

Table 10. Full linear-probe transfer results across all source datasets and comparison methods.

SourceMethodC10C100CarsAircraftFlowersPetsIN100-LTAvg.
ImageNet-100-LTSimCLR68.6 ± 0.437.3 ± 0.26.0 ± 0.711.2 ± 0.432.2 ± 0.723.6 ± 0.343.9 ± 0.931.8 ± 0.5
TS68.4 ± 0.336.5 ± 0.14.7 ± 0.28.3 ± 0.526.6 ± 1.023.6 ± 1.752.2 ± 0.531.5 ± 0.6
SDCLR32.5 ± 0.410.9 ± 0.21.0 ± 0.32.1 ± 0.110.7 ± 0.74.7 ± 0.211.2 ± 0.210.4 ± 0.3
BRIDGE (ours)69.0 ± 0.537.8 ± 0.37.0 ± 0.211.7 ± 0.236.5 ± 0.425.3 ± 1.048.1 ± 0.633.6 ± 0.4
BRIDGE+TS (ours)65.4 ± 0.233.6 ± 0.33.1 ± 0.17.1 ± 0.318.2 ± 0.215.6 ± 0.740.8 ± 0.526.3 ± 0.3
BRIDGE+SDCLR (ours)36.3 ± 0.813.0 ± 0.51.1 ± 0.32.4 ± 0.29.7 ± 0.35.4 ± 0.413.9 ± 1.011.7 ± 0.5
CIFAR-10-LTSimCLR66.9 ± 0.433.4 ± 0.33.7 ± 0.49.8 ± 0.716.5 ± 0.813.9 ± 0.824.0 ± 0.824.0 ± 0.6
TS66.3 ± 0.627.8 ± 0.42.4 ± 0.66.4 ± 0.210.5 ± 0.711.1 ± 0.422.0 ± 0.920.9 ± 0.5
SDCLR30.1 ± 0.310.0 ± 0.31.7 ± 0.32.2 ± 0.210.1 ± 0.74.4 ± 0.49.8 ± 0.39.7 ± 0.4
BRIDGE (ours)74.8 ± 0.441.0 ± 0.44.8 ± 0.510.0 ± 0.224.2 ± 0.616.2 ± 0.729.7 ± 0.328.7 ± 0.4
BRIDGE+TS (ours)77.6 ± 0.735.3 ± 0.53.1 ± 0.36.6 ± 0.416.3 ± 0.612.5 ± 1.026.7 ± 0.125.5 ± 0.5
BRIDGE+SDCLR (ours)34.4 ± 1.211.4 ± 0.61.2 ± 0.22.2 ± 0.28.8 ± 1.55.0 ± 0.211.7 ± 1.110.7 ± 0.7
CIFAR-100-LTSimCLR59.3 ± 0.830.1 ± 0.93.0 ± 0.37.4 ± 0.413.7 ± 0.210.8 ± 0.421.8 ± 1.120.9 ± 0.6
TS53.1 ± 0.624.6 ± 0.42.4 ± 0.45.5 ± 0.39.3 ± 0.48.3 ± 0.218.7 ± 1.017.4 ± 0.5
SDCLR25.7 ± 1.28.5 ± 0.60.9 ± 0.41.9 ± 0.27.3 ± 0.33.9 ± 0.38.3 ± 1.18.1 ± 0.6
BRIDGE (ours)69.3 ± 0.539.5 ± 0.14.8 ± 0.68.9 ± 0.121.9 ± 0.115.5 ± 0.129.1 ± 0.727.0 ± 0.3
BRIDGE+TS (ours)64.3 ± 0.436.6 ± 0.42.9 ± 0.36.3 ± 0.116.4 ± 0.512.3 ± 0.028.2 ± 0.623.9 ± 0.3
BRIDGE+SDCLR (ours)31.9 ± 0.410.4 ± 0.50.8 ± 0.12.1 ± 0.57.5 ± 1.64.5 ± 0.19.1 ± 0.79.5 ± 0.6
PASS-10kSimCLR67.2 ± 0.237.0 ± 0.35.4 ± 0.310.3 ± 0.530.4 ± 0.016.7 ± 0.538.3 ± 0.329.3 ± 0.3
TS65.2 ± 0.734.6 ± 0.34.4 ± 0.27.9 ± 0.224.5 ± 0.114.4 ± 0.439.3 ± 0.427.2 ± 0.3
SDCLR32.4 ± 1.511.5 ± 0.81.3 ± 0.22.0 ± 0.18.6 ± 0.75.2 ± 0.211.1 ± 0.810.3 ± 0.6
BRIDGE (ours)67.5 ± 0.336.9 ± 0.35.8 ± 0.510.7 ± 0.433.7 ± 0.217.8 ± 0.641.4 ± 0.830.6 ± 0.4
BRIDGE+TS (ours)58.8 ± 0.527.9 ± 0.53.0 ± 0.26.6 ± 0.123.0 ± 0.313.4 ± 0.438.8 ± 0.824.5 ± 0.4
BRIDGE+SDCLR (ours)37.1 ± 2.013.6 ± 1.01.6 ± 0.22.4 ± 0.210.1 ± 0.56.3 ± 0.313.1 ± 0.612.0 ± 0.7
DiffusionDB-10kSimCLR67.3 ± 0.136.2 ± 0.44.3 ± 0.28.8 ± 0.126.8 ± 0.417.3 ± 0.136.7 ± 0.828.2 ± 0.3
TS64.7 ± 0.433.6 ± 0.33.1 ± 0.57.3 ± 0.323.2 ± 0.417.0 ± 0.037.8 ± 0.626.7 ± 0.4
SDCLR32.6 ± 1.210.0 ± 0.11.3 ± 0.12.2 ± 0.26.1 ± 0.74.8 ± 0.410.6 ± 0.59.7 ± 0.5
BRIDGE (ours)68.3 ± 0.237.4 ± 0.45.4 ± 0.39.8 ± 0.130.4 ± 0.218.6 ± 0.239.4 ± 1.029.9 ± 0.3
BRIDGE+TS (ours)57.5 ± 0.826.6 ± 0.33.0 ± 0.46.5 ± 0.121.7 ± 0.815.5 ± 0.437.0 ± 0.424.0 ± 0.5
BRIDGE+SDCLR (ours)35.2 ± 0.711.1 ± 0.31.0 ± 0.12.2 ± 0.18.1 ± 1.05.0 ± 0.311.3 ± 0.710.6 ± 0.5

Table 11. Full kkNN transfer results across all source datasets and comparison methods.

SettingC10C100CarsAircraftFlowersPetsIN100-LTAvg.
Stable Diffusion 3 (default)75.0 ± 0.348.5 ± 0.216.3 ± 0.820.7 ± 0.435.7 ± 0.941.8 ± 0.852.4 ± 0.741.5 ± 0.6
FLUX70.7 ± 0.442.1 ± 1.410.3 ± 1.317.5 ± 0.929.4 ± 4.631.5 ± 2.943.7 ± 1.435.0 ± 1.9
Oracle (withheld real images restored)74.8 ± 0.447.8 ± 0.713.1 ± 0.120.5 ± 0.540.3 ± 6.138.1 ± 1.550.3 ± 0.440.7 ± 1.4

Table 12. Augmentation mechanism ablation with full linear-probe results. The oracle row restores the withheld real images.

SettingC10C100CarsAircraftFlowersPetsIN100-LTAvg.
Stable Diffusion 3 (default)68.6 ± 0.137.2 ± 0.26.4 ± 0.611.5 ± 0.235.2 ± 0.324.3 ± 0.646.8 ± 0.732.9 ± 0.4
FLUX65.8 ± 1.035.4 ± 0.85.7 ± 0.79.4 ± 0.927.7 ± 1.018.8 ± 1.338.7 ± 1.228.8 ± 1.0
Oracle (withheld real images restored)68.8 ± 0.237.7 ± 0.36.6 ± 0.511.4 ± 0.532.7 ± 0.123.6 ± 0.644.4 ± 0.432.2 ± 0.4

Table 13. Augmentation mechanism ablation with full kkNN results. The oracle row restores the withheld real images.

SettingC10C100CarsAircraftFlowersPetsIN100-LTAvg.
Mode-window q1-99 + diversity75.6 ± 0.149.2 ± 0.216.9 ± 0.721.9 ± 0.434.6 ± 2.943.5 ± 0.752.8 ± 0.142.1 ± 0.7
Mode-window q50-99 + diversity75.5 ± 0.149.3 ± 0.415.2 ± 0.322.4 ± 0.635.5 ± 1.143.8 ± 3.153.4 ± 0.942.2 ± 0.9
Mode-window q75-99 + diversity (default)76.0 ± 0.349.1 ± 0.215.2 ± 1.222.4 ± 0.436.8 ± 1.942.9 ± 1.053.8 ± 0.142.3 ± 0.7
Top-tail70.8 ± 0.543.1 ± 1.010.0 ± 1.715.9 ± 1.327.7 ± 1.030.5 ± 1.242.2 ± 1.434.3 ± 1.2
Uniform71.5 ± 0.243.8 ± 0.79.3 ± 0.917.5 ± 1.232.9 ± 0.431.7 ± 3.942.0 ± 0.935.5 ± 1.2

Table 14. Selection rule ablation with full linear-probe results.

SettingC10C100CarsAircraftFlowersPetsIN100-LTAvg.
Mode-window q1-99 + diversity69.2 ± 0.337.7 ± 0.26.6 ± 0.211.4 ± 0.235.9 ± 0.225.0 ± 0.548.3 ± 0.333.4 ± 0.3
Mode-window q50-99 + diversity68.7 ± 0.138.0 ± 0.27.3 ± 0.211.3 ± 0.236.5 ± 0.124.8 ± 0.848.5 ± 0.433.6 ± 0.3
Mode-window q75-99 + diversity (default)69.0 ± 0.537.8 ± 0.36.7 ± 0.311.7 ± 0.236.5 ± 0.425.3 ± 1.048.1 ± 0.633.6 ± 0.5
Top-tail65.7 ± 0.834.4 ± 0.24.1 ± 0.49.6 ± 0.223.9 ± 0.918.1 ± 0.835.4 ± 1.227.3 ± 0.6
Uniform66.1 ± 1.035.7 ± 0.34.9 ± 0.110.2 ± 0.725.3 ± 0.419.0 ± 0.837.4 ± 0.628.4 ± 0.6

Table 15. Selection rule ablation with full kkNN results.

SettingC10C100CarsAircraftFlowersPetsIN100-LTAvg.
2 cycles68.9 ± 0.641.6 ± 1.310.6 ± 1.216.4 ± 0.430.7 ± 4.533.2 ± 0.943.3 ± 0.635.0 ± 1.4
5 cycles (default)76.0 ± 0.349.1 ± 0.215.2 ± 1.222.4 ± 0.436.8 ± 1.942.9 ± 1.053.8 ± 0.142.3 ± 0.7
10 cycles70.5 ± 1.243.8 ± 0.69.2 ± 0.917.2 ± 1.624.8 ± 5.231.3 ± 1.741.9 ± 0.634.1 ± 1.7

Table 16. Cycle count ablation with full linear-probe results.

MethodCarsAircraftFlowersPetsCIFAR-10CIFAR-100IN100-LT
SimCLR, SSL baseline7.15±0.197.15 \pm0.1910.92±0.4010.92 \pm0.4032.90±2.7232.90 \pm2.7225.00±1.2525.00 \pm1.2560.46±0.4660.46 \pm0.4634.96±0.2034.96 \pm0.2041.95±1.4341.95 \pm1.43
SimCLR, with BRIDGE8.18±0.428.18 \pm0.4211.82±0.4311.82 \pm0.4336.60±2.8536.60 \pm2.8529.80±2.9829.80 \pm2.9860.85±0.3560.85 \pm0.3536.33±0.1436.33 \pm0.1443.93±1.0943.93 \pm1.09
MoCo v3, SSL baseline7.57±0.237.57 \pm0.2311.05±1.3111.05 \pm1.3130.28±1.3630.28 \pm1.3629.26±3.1329.26 \pm3.1359.96±0.3959.96 \pm0.3934.47±0.0134.47 \pm0.0144.79±1.1744.79 \pm1.17
MoCo v3, with BRIDGE9.55±0.349.55 \pm0.3413.42±0.9813.42 \pm0.9836.82±6.0736.82 \pm6.0731.25±4.0031.25 \pm4.0062.36±0.4662.36 \pm0.4636.30±0.1336.30 \pm0.1347.55±0.8647.55 \pm0.86
DINO, SSL baseline8.10±0.258.10 \pm0.2511.40±1.0311.40 \pm1.0338.13±5.2438.13 \pm5.2427.54±2.3427.54 \pm2.3458.93±0.9458.93 \pm0.9433.56±1.7533.56 \pm1.7544.63±1.4744.63 \pm1.47
DINO, with BRIDGE9.49±0.889.49 \pm0.8813.28±0.5813.28 \pm0.5837.25±2.6137.25 \pm2.6134.60±3.6234.60 \pm3.6261.30±0.0761.30 \pm0.0735.23±0.3135.23 \pm0.3146.78±0.7746.78 \pm0.77
MAE, SSL baseline1.54±0.191.54 \pm0.192.44±1.002.44 \pm1.0010.46±5.8810.46 \pm5.8810.05±3.0310.05 \pm3.0337.69±3.7337.69 \pm3.7313.20±1.9413.20 \pm1.9419.93±2.1319.93 \pm2.13
MAE, with BRIDGE1.56±0.431.56 \pm0.433.18±0.703.18 \pm0.708.50±2.268.50 \pm2.268.61±2.208.61 \pm2.2041.46±2.2041.46 \pm2.2015.00±2.4015.00 \pm2.4022.19±2.3522.19 \pm2.35

Table 20. Linear-probe accuracy of the paired ViT-S runs of Table 4 on every task, mean ±\pm standard deviation over three seeds. MAE runs five cycles of 80 epochs, the other objectives five of 100.

MethodCarsAircraftFlowersPetsCIFAR-10CIFAR-100IN100-LT
SimCLR, SSL baseline6.26±0.176.26 \pm0.177.09±0.177.09 \pm0.1736.53±0.8936.53 \pm0.8919.16±0.6419.16 \pm0.6466.05±0.4866.05 \pm0.4836.72±0.3636.72 \pm0.3641.21±0.7241.21 \pm0.72
SimCLR, with BRIDGE6.52±0.226.52 \pm0.227.56±0.237.56 \pm0.2338.29±0.8338.29 \pm0.8319.93±0.5319.93 \pm0.5365.70±0.8565.70 \pm0.8536.46±0.3336.46 \pm0.3342.91±0.7842.91 \pm0.78
MoCo v3, SSL baseline6.65±0.386.65 \pm0.387.71±0.167.71 \pm0.1638.91±1.0338.91 \pm1.0323.56±1.1223.56 \pm1.1269.29±0.2569.29 \pm0.2539.98±0.4439.98 \pm0.4445.14±0.4645.14 \pm0.46
MoCo v3, with BRIDGE6.74±0.266.74 \pm0.268.21±0.188.21 \pm0.1840.51±1.4540.51 \pm1.4524.91±0.4524.91 \pm0.4565.41±0.2165.41 \pm0.2136.24±0.4636.24 \pm0.4647.71±1.5347.71 \pm1.53
DINO, SSL baseline6.05±0.276.05 \pm0.277.73±0.527.73 \pm0.5238.52±1.1938.52 \pm1.1919.26±0.1619.26 \pm0.1662.69±2.4262.69 \pm2.4233.98±2.8033.98 \pm2.8045.28±0.9845.28 \pm0.98
DINO, with BRIDGE6.39±0.226.39 \pm0.228.16±0.268.16 \pm0.2640.72±0.3140.72 \pm0.3121.79±1.1521.79 \pm1.1564.38±3.5164.38 \pm3.5135.59±2.5135.59 \pm2.5147.14±0.2947.14 \pm0.29
MAE, SSL baseline1.00±0.141.00 \pm0.142.24±0.292.24 \pm0.295.30±0.525.30 \pm0.524.58±0.174.58 \pm0.1731.34±1.6531.34 \pm1.6510.96±0.4410.96 \pm0.4411.75±0.3811.75 \pm0.38
MAE, with BRIDGE1.38±0.371.38 \pm0.372.50±0.702.50 \pm0.707.54±2.137.54 \pm2.135.35±0.765.35 \pm0.7635.58±7.1435.58 \pm7.1413.44±3.4613.44 \pm3.4615.46±2.6815.46 \pm2.68

Table 21. kkNN accuracy of the paired ViT-S runs of Table 4 on every task, mean ±\pm standard deviation over three seeds. MAE runs five cycles of 80 epochs, the other objectives five of 100.

SettingC10C100CarsAircraftFlowersPetsIN100-LTAvg.
2 cycles65.3±0.465.3 \pm0.434.2±0.534.2 \pm0.55.0±0.75.0 \pm0.710.0±0.210.0 \pm0.226.1±0.826.1 \pm0.818.7±0.618.7 \pm0.635.9±0.335.9 \pm0.327.9±0.527.9 \pm0.5
5 cycles (default)69.0±0.569.0 \pm0.537.8±0.337.8 \pm0.36.7±0.36.7 \pm0.311.7±0.211.7 \pm0.236.5±0.436.5 \pm0.425.3±1.025.3 \pm1.048.1±0.648.1 \pm0.633.6±0.533.6 \pm0.5
10 cycles66.4±0.566.4 \pm0.535.4±0.335.4 \pm0.34.8±0.34.8 \pm0.310.4±0.610.4 \pm0.625.2±0.825.2 \pm0.818.6±0.918.6 \pm0.936.0±0.736.0 \pm0.728.1±0.628.1 \pm0.6

Table 17. Cycle count ablation with full kkNN results.

SettingC10C100CarsAircraftFlowersPetsIN100-LTAvg.
ResNet-1868.8±0.168.8 \pm0.141.7±0.241.7 \pm0.213.5±0.313.5 \pm0.319.7±0.619.7 \pm0.638.7±3.438.7 \pm3.438.4±2.638.4 \pm2.650.2±0.250.2 \pm0.238.7±1.138.7 \pm1.1
ResNet-50 (default)76.0±0.376.0 \pm0.349.1±0.249.1 \pm0.215.2±1.215.2 \pm1.222.4±0.422.4 \pm0.436.8±1.936.8 \pm1.942.9±1.042.9 \pm1.053.8±0.153.8 \pm0.142.3±0.742.3 \pm0.7
ViT-S62.7±0.462.7 \pm0.437.6±0.637.6 \pm0.68.8±0.58.8 \pm0.512.2±0.212.2 \pm0.235.1±4.235.1 \pm4.230.2±1.630.2 \pm1.642.5±1.242.5 \pm1.232.7±1.332.7 \pm1.3
ViT-B66.0±2.366.0 \pm2.340.6±2.340.6 \pm2.38.3±0.58.3 \pm0.514.3±0.814.3 \pm0.838.8±2.638.8 \pm2.631.3±2.131.3 \pm2.144.5±1.744.5 \pm1.734.8±1.834.8 \pm1.8

Table 18. Backbone architecture ablation with full linear-probe results.

SettingC10C100CarsAircraftFlowersPetsIN100-LTAvg.
ResNet-1866.3±0.266.3 \pm0.235.7±0.335.7 \pm0.35.9±0.25.9 \pm0.211.1±0.411.1 \pm0.433.5±0.133.5 \pm0.123.3±0.523.3 \pm0.544.5±0.744.5 \pm0.731.5±0.431.5 \pm0.4
ResNet-50 (default)69.0±0.569.0 \pm0.537.8±0.337.8 \pm0.36.7±0.36.7 \pm0.311.7±0.211.7 \pm0.236.5±0.436.5 \pm0.425.3±1.025.3 \pm1.048.1±0.648.1 \pm0.633.6±0.533.6 \pm0.5
ViT-S67.3±0.467.3 \pm0.437.5±0.337.5 \pm0.35.3±0.25.3 \pm0.27.6±0.17.6 \pm0.136.2±0.736.2 \pm0.720.1±1.020.1 \pm1.042.1±1.042.1 \pm1.030.9±0.530.9 \pm0.5
ViT-B69.3±0.869.3 \pm0.840.1±0.840.1 \pm0.86.0±0.26.0 \pm0.28.3±0.28.3 \pm0.239.8±0.839.8 \pm0.821.9±1.421.9 \pm1.445.1±0.745.1 \pm0.732.9±0.732.9 \pm0.7

Table 19. Backbone architecture ablation with full kkNN results.

Algorithm

Algorithm 1 BRIDGE training loop with mode-window selection

  1. Initialize source set D(0)D^{(0)}, encoder fθ(0)f_{\theta^{(0)}}, frozen generator gϕg_{\phi}, cycle lengths {Ec}c=0C−1\{E_c\}_{c=0}^{C-1}

  2. for c=0,…,C−1c = 0, \ldots, C - 1 do

  3. Continue training fθ(c)f_{\theta^{(c)}} on D(c)D^{(c)} for EcE_c epochs with a fresh optimizer schedule

  4. if c<C−1c < C - 1 then

  5. Compute normalized embeddings Z(c)={fθ(c)(xi)∣xi∈D(c)}Z^{(c)} = \{f_{\theta^{(c)}}(x_i) \mid x_i \in D^{(c)}\}

  6. Compute mean kNN scores {di(c)}\{d_i^{(c)}\} from Z(c)Z^{(c)}

  7. Restrict to the 75th to 99th percentile band and locate the modal bin center dˉ(c)\bar{d}^{(c)}

  8. Form the candidate pool P(c)P^{(c)} of the αB\alpha B images with scores closest to dˉ(c)\bar{d}^{(c)}

  9. Select S(c)⊆P(c)S^{(c)} \subseteq P^{(c)} with ∣S(c)∣=B\lvert S^{(c)} \rvert= B by greedy farthest-point sampling in embedding space

  10. Form D~(c)={gϕ(xi,ϵj)∣i∈S(c), j∈[G]}\widetilde{D}^{(c)} = \{g_{\phi}(x_i, \epsilon_j) \mid i \in S^{(c)},\ j \in[G]\} and set D(c+1)=D(c)∪D~(c)D^{(c+1)} = D^{(c)} \cup\widetilde{D}^{(c)}

  11. end if

  12. end for

  13. Return the final encoder fθ(C−1)f_{\theta^{(C-1)}}

References

  1. [1]Amro Kamal Mohamed Abbas, Evgenia Rusak, Kushal Tirumala, Wieland Brendel, Kamalika Chaudhuri, and Ari S. Morcos. Effective pruning of web-scale datasets based on complexity of concept clusters. In International Conference on Learning Representations, 2024. doi: 10.48550/arXiv.2401.04578.DOI
  2. [2]Yuki Asano, Christian Rupprecht, Andrew Zisserman, and Andrea Vedaldi. PASS: An ImageNet replacement for self-supervised pretraining without humans. In Joaquin Vanschoren and Serena Yeung, editors, Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks, volume 1, 2021. doi: 10.48550/arXiv.2109.13228.DOI
  3. [3]Mahmoud Assran, Randall Balestriero, Quentin Duval, Florian Bordes, Ishan Misra, Piotr Bojanowski, Pascal Vincent, Michael Rabbat, and Nicolas Ballas. The hidden uniform cluster prior in self-supervised learning. In International Conference on Learning Representations, 2023. doi: 10.48550/arXiv.2210.07277.DOI
  4. [4]Shekoofeh Azizi, Simon Kornblith, Chitwan Saharia, Mohammad Norouzi, and David J. Fleet. Synthetic data from diffusion models improves ImageNet classification. Transactions on Machine Learning Research, 2023. doi: 10.48550/arXiv.2304.08466.DOI
  5. [5]Jianhong Bai, Zuozhu Liu, Hualiang Wang, Jin Hao, Yang Feng, Huanpeng Chu, and Haoji Hu. On the effectiveness of out-of-distribution data in self-supervised long-tail learning. In International Conference on Learning Representations, 2023. doi: 10.48550/arXiv.2306.04934.DOI
  6. [6]Manel Baradad, Jonas Wulff, Tongzhou Wang, Phillip Isola, and Antonio Torralba. Learning to see by looking at noise. In M. Ranzato, A. Beygelzimer, Y. Dauphin, P.S. Liang, and J. Wortman Vaughan, editors, Advances in Neural Information Processing Systems, volume 34, pages 2556–2569. Curran Associates, Inc., 2021. doi: 10.48550/arXiv.2106.05963.DOI
  7. [7]Manel Baradad, Chun-Fu (Richard) Chen, Jonas Wulff, Tongzhou Wang, Rogerio Feris, Antonio Torralba, and Phillip Isola. Procedural image programs for representation learning. In S. Koyejo, S. Mohamed, A. Agarwal, D. Belgrave, K. Cho, and A. Oh, editors, Advances in Neural Information Processing Systems, volume 35, pages 6450–6462. Curran Associates, Inc., 2022. doi: 10.5220/068431-0467.arxiv.org/abs/2211.16412
  8. [8]Mathilde Caron, Hugo Touvron, Ish an Misra, Hervé Jégou, Julien Mairal, Piotr Bojanowski, and Armand Joulin. Emerging properties in self-supervised vision transformers. In 2021 IEEE/CVF International Conference on Computer Vision (ICCV), pages 9630–9640. IEEE, 2021. doi: 10.1109/ICCV48922.2021.00951.
  9. [9]Nitesh V. Chawla, Kevin W. Bowyer, Lawrence O. Hall, and W. Philip Kegelmeyer. SMOTE: Synthetic minority over-sampling technique. Journal of Artificial Intelligence Research, 16: 321–357, 2002. doi: 10.1613/jair.953.DOI
  10. [10]Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey Hinton. A simple framework for contrastive learning of visual representations. In Hal Daumé III and Aarti Singh, editors, Proceedings of the 37th International Conference on Machine Learning, volume 119 of Proceedings of Machine Learning Research, pages 1597–1607. PMLR, 13–18 Jul 2020. doi: 10.48550/arXiv.2002.05709.DOI
  11. [11]Lijie Fan, Kaifeng Chen, Dilip Krishnan, Dina Katabi, Phillip Isola, and Yonglong Tian. Scaling laws of synthetic images for model training ... for now. In 2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 7382–7392. IEEE, 2024. doi: 10.1109/CVPR52733.2024.00705.DOI
  12. [12]Teofilo F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293–306, 1985. doi: 10.1016/0304-3975(85)90224-5.DOI
  13. [13]Guy Hacohen, Avihu Dekel, and Daphna Weinshall. Active learning on a budget: Opposite strategies suit high and low budgets. In Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvári, Gang Niu, and Sivan Sabato, editors, Proceedings of the 39th International Conference on Machine Learning, volume 162 of Proceedings of Machine Learning Research, pages 8175–8195. PMLR, 17–23 Jul 2022. doi: 10.48550/arXiv.2202.02794.DOI
  14. [14]Kaiming He, Haoqi Fan, Yuxin Wu, Saining Xie, and Ross Girshick. Momentum contrast for unsupervised visual representation learning. In 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 9726–9735. IEEE, 2020. doi: 10.1109/CVPR42600.2020.00975.DOI
  15. [15]Kaiming He, Xinlei Chen, Saining Xie, Yanghao Li, Piotr Dollár, and Ross Girshick. Masked autoencoders are scalable vision learners. In 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 15979–15988. IEEE, 2022. doi: 10.1109/CVPR52688.2022.01553.DOI
  16. [16]Ruifei He, Shuyang Sun, Xin Yu, Chuhui Xue, Wenqing Zhang, Philip Torr, Song Bai, and Xiaoj uan Qi. Is synthetic data from generative models ready for image recognition? In International Conference on Learning Representations, 2023. doi: 10.48550/arXiv.2210.07574.DOI
  17. [17]Jonathan Ho, Ajay Jain, and Pieter Abbeel. Denoising diffusion probabilistic models. In Hugo Larochelle, Marc’Aurelio Ranzato, Raia Hadsell, Maria-Florina Balcan, and Hsuan-Tien Lin, editors, Advances in Neural Information Processing Systems, volume 33, pages 6840–6851. Curran Associates, Inc., 2020. doi: 10.48550/arXiv.2006.11239.DOI
  18. [18]Ali Jahanian, Xavier Puig, Yonglong Tian, and Phillip Isola. Generative models as a data source for multiview representation learning. In International Conference on Learning Representations, 2022. doi: 10.48550/arXiv.2106.05258.DOI
  19. [19]Ziyu Jiang, Tianlong Chen, Bobak J. Mortazavi, and Zhangyang Wang. Self-damaging contrastive learning. In Marina Meila and Tong Zhang, editors, Proceedings of the 38th International Conference on Machine Learning, volume 139 of Proceedings of Machine Learning Research, pages 4927–4939. PMLR, 18–24 Jul 2021. doi: 10.48550/arXiv.2106.02990.DOI
  20. [20]Jonathan Krause, Michael Stark, Jia Deng, and Li Fei-Fei. 3D object representations for fine-grained categorization. In 2013 IEEE International Conference on Computer Vision Workshops, pages 554–561. IEEE, 2013. doi: 10.1109/ICCVW.2013.77.DOI
  21. [21]Alex Krizhevsky. Learning multiple layers of features from Tiny Images. Technical report, University of Toronto, 2009. URL https://www.cs.toronto.edu/~kriz/learning-features-2009-TR.pdf.
  22. [22]Anna Kukleva, Moritz Böhle, Bernt Schiele, Hilde Kuehne, and Christian Rupprecht. Temperature schedules for self-supervised contrastive methods on long-tail data. In International Conference on Learning Representations, 2023. doi: 10.48550/arXiv.2303.13664.
  23. [23]Daiq ing Li, Huan Ling, Amlan Kar, David Acuna, Seung Wook Kim, Karsten Kreis, Antonio Torralba, and Sanja Fidler. DreamTeacher: Pretraining image backbones with deep generative models. In 2023 IEEE/CVF International Conference on Computer Vision (ICCV), pages 16652–16662. IEEE, 2023. doi: 10.1109/ICCV51070.2023.01531.
  24. [24]Mingfu Liang, Jong-Chyi Su, Samuel Schulter, Sparsh Garg, Shiyu Zhao, Ying Wu, and Manmohan Chandraker. AIDE: An automatic data engine for object detection in autonomous driving. In 2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 14695–14706. IEEE, 2024. doi: 10.1109/CVPR52733.2024.01392.
  25. [25]Swee Kiat Lim, Yi Loo, Ngoc-Trung Tran, Ngai-Man Cheung, Gemma Roig, and Yuval Elovici. DOPING: Generative data augmentation for unsupervised anomaly detection with GAN. In 2018 IEEE International Conference on Data Mining (ICDM), pages 1122–1127. IEEE, 2018. doi: 10.1109/ICDM.2018.00146.
  26. [26]Ci-Siang Lin, Min-Hung Chen, and Yu-Chiang Frank Wang. Frequency-aware self-supervised long-tailed learning. In 2023 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW), pages 963–972. IEEE, 2023. doi: 10.1109/ICCVW60793.2023.00103.DOI
  27. [27]Ziwei Liu, Zhongqi Miao, Xiaohang Zhan, Jiayun Wang, Boqing Gong, and Stella X. Yu. Large-scale long-tailed recognition in an open world. In 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 2532–2541. IEEE, 2019. doi: 10.1109/CVPR.2019.00264.DOI
  28. [28]Subhransu Maji, Esa Rahtu, Juho Kannala, Matthew B. Blaschko, and Andrea Vedaldi. Fine-grained visual classification of aircraft. arXiv preprint arXiv:1306.5151, 2013. doi: 10.48550/arXiv.1306.5151.DOI
  29. [29]Chenlin Meng, Yutong He, Yang Song, Jiaming Song, Jiajun Wu, Jun-Yan Zhu, and Stefano Ermon. SDEdit: Guided image synthesis and editing with stochastic differential equations. In International Conference on Learning Representations, 2022. doi: 10.48550/arXiv.2108.01073.
  30. [30]Dang Nguyen, Jiping Li, Jinghao Zheng, and Baharan Mirzasoleiman. Do we need all the synthetic data? Targeted image augmentation via diffusion models. In International Conference on Learning Representations, 2026. doi: 10.48550/arXiv.2505.21574.
  31. [31]Maria-Elena Nilsback and Andrew Zisserman. Automated flower classification over a large number of classes. In 2008 Sixth Indian Conference on Computer Vision, Graphics & Image Processing, pages 722–729. IEEE, 2008. doi: 10.1109/ICVGIP.2008.47.DOI
  32. [32]Maxime Oquab, Timothée Darcet, Théo Moutakanni, Huy Vo, Marc Szafraniec, Vasil Khalidov, Pierre Fernandez, Daniel Haziza, Francisco Massa, Ala aeldin El-Nouby, Mahmoud Assran, Nicolas Ballas, Wojciech Galuba, Russell Howes, Po-Yao Huang, Shang-Wen Li, Ishan Misra, Michael Rabbat, Vasu Sharma, Gabriel Synnaeve, Hu Xu, Hervé Jégou, Julien Mairal, Patrick Labatut, Armand Joulin, and Piotr Bojanowski. DINOv2: Learning robust visual features without supervision. Transactions on Machine Learning Research, 2024. doi: 10.48550/arXiv.2304.07193.
  33. [33]Omkar M. Parkhi, Andrea Vedaldi, Andrew Zisserman, and C. V. Jawahar. Cats and dogs. In 2012 IEEE Conference on Computer Vision and Pattern Recognition, pages 3498–3505. IEEE, 2012. doi: 10.1109/CVPR.2012.6248092.DOI
  34. [34]Zhongzheng Ren and Yong Jae Lee. Cross-domain self-supervised multi-task feature learning using synthetic imagery. In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 762–771. IEEE, 2018. doi: 10.1109/CVPR.2018.00086.DOI
  35. [35]Robin Rombach, Andreas Blattmann, Dominik Lorenz, Patrick Esser, and Björn Ommer. High-resolution image synthesis with latent diffusion models. In 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 10674–10685. IEEE, 2022. doi: 10.1109/CVPR52688.2022.01042.DOI
  36. [37]Ozan Sener and Silvio Savarese. Active learning for convolutional neural networks: A core-set approach. In International Conference on Learning Representations, 2018. doi: 10.48550/arXiv.1708.00489.
  37. [38]Oriane Siméoni, Huy V. Vo, Maximilian Seitzer, Federico Baldassarre, Maxime Oquab, Cijo Jose, Vasil Khalidov, Marc Szafraniec, Seungeun Yi, Michaël Ramamonjisoa, Francisco Massa, Daniel Haziza, Luca Wehrstedt, Jianyang Wang, Timothée Darcet, Théo Moutakanni, Leonel Santana, Claire Roberts, Andrea Vedaldi, Jamie Tolan, John Brandt, Camille Couprie, Julien Mairal, Hervé Jégou, Patrick Labatut, and Piotr Bojanowski. DINOv3. arXiv preprint arXiv:2508.10104, 2025. doi: 10.48550/arXiv.2508.10104.DOI
  38. [39]Ben Sorscher, Robert Geirhos, Shashank Shekhar, Surya Ganguli, and Ari S. Morcos. Beyond neural scaling laws: Beating power law scaling via data pruning. In S. Koyejо, S. Mohamed, A. Agarwal, D. Belgrave, K. Cho, and A. Oh, editors, Advances in Neural Information Processing Systems, volume 35, pages 19523–19536. Curran Associates, Inc., 2022. doi: 10.52202/068431-1419.DOI
  39. [40]Yiyou Sun, Yifei Ming, Xiaojin Zhu, and Yixuan Li. Out-of-distribution detection with deep nearest neighbors. In Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvári, Gang Niu, and Sivan Sabato, editors, Proceedings of the 39th International Conference on Machine Learning, volume 162 of Proceedings of Machine Learning Research, pages 20827–20840. PMLR, 17–23 Jul 2022. doi: 10.48550/arXiv.2204.06507.DOI
  40. [41]Luming Tang, Menglin Jia, Qianqian Wang, Cheng Perng Phoo, and Bharath Hariharan. Emergent correspondence from image diffusion. In A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt, and S. Levine, editors, Advances in Neural Information Processing Systems, volume 36, pages 1363–1389. Curran Associates, Inc., 2023. doi: 10.52202/075280-0068.DOI
  41. [42]Yonglong Tian, Olivier J. Hénaff, and Aäron van den Oord. Divide and contrast: Self-supervised learning from uncurated data. In 2021 IEEE/CVF International Conference on Computer Vision (ICCV), pages 10043–10054. IEEE, 2021. doi: 10.1109/ICCV48922.2021.00991.
  42. [43]Yonglong Tian, Lijie Fan, Phillip Isola, Huiwen Chang, and Dilip Krishnan. StableRep: Synthetic images from text-to-image models make strong visual representation learners. In A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt, and S. Levine, editors, Advances in Neural Information Processing Systems, volume 36, pages 48382–48402. Curran Associates, Inc., 2023. doi: 10.52202/075280-2098.
  43. [44]Brandon Trabucco, Kyle Doherty, Max Gurinas, and Ruslan Salakhutdinov. Effective data augmentation with diffusion models. In International Conference on Learning Representations, 2024. doi: 10.48550/arXiv.2302.07944.
  44. [45]Zijie J. Wang, Evan Montoya, David Munechika, Haoyang Yang, Benjamin Hoover, and Duen Horng Chau. DiffusionDB: A large-scale prompt gallery dataset for text-to-image generative models. In Anna Rogers, Jordan Boyd-Graber, and Naoki Okazaki, editors, Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 893–911, Toronto, Canada, July 2023. Association for Computational Linguistics. doi: 10.18653/v1/2023.acl-long.51.

Paper details

vlnc:W_zumcjq8e
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

generative AI tools

View statement
Looking for related papers…
Contents