Test-Time Collective Action: Proxy-Based Perturbations for Correcting Algorithmic Harms
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.
Tom: Today's paper: "Test-Time Collective Action".
Jane: The gist:
Tom: First, who's behind it and why it matters.
Title and authors: Tom: Alright, let’s talk about the title and who wrote this thing. The paper is called "Test-Time Collective Action: Proxy-Based Perturbations for Correcting Algorithmic Harms." It’s pretty descriptive of what they are doing.
Jane: It sounds like a framework focused on taking action at the moment of testing, using some kind of proxy to guide the correction. The authors are Meghana Bhange, Ulrich Aïvodji, and Elliot Creager from the University of Waterloo and Vector Institute in Montreal.
Lu: Their work is situated in how users can actively steer a system toward a collective goal without needing access to the platform’s training process. They focus on user-driven mechanisms when provider fixes aren't an option.
Meng: So they are aiming at those situations where fairness is important, but the standard methods for fixing it—like pre-processing or in-processing—aren't feasible because the company won't cooperate.
Tom: Exactly. The core contribution here is proposing TTCA as a way for a group of users with query access to correct disparities affecting under-served subgroups without needing to participate in the platform’s training loop.
Jane: That’s the big takeaway: users can generate a correction based on their collective data contributions, even against a frozen black-box model.
Lu: They are moving away from traditional provider-centric fixes, which usually require the platform to retrain on modified data that users don't control.
Meng: So this is about giving power back to the end user in a very specific technical sense—letting them influence the output without influencing the training process.
The paper's summary: Tom: Let’s summarize what they actually did in this paper, "Test-Time Collective Action: Proxy-Based Perturbations for Correcting Algorithmic Harms." They introduce a method to correct algorithmic harms using a proxy-based approach.
Jane: They distill a collective proxy by pooling query access from the platform to generate a shared model approximation. Then, they use that proxy to optimize a per-class perturbation against it.
Lu: So they are creating this surrogate fproxy and then finding the best way to shift the output using delta y that minimizes an l-infinity budget against it.
Meng: It seems like they’re essentially using their pooled interactions to build a better guess of what the platform is doing, and then calculating a targeted adjustment based on that guess.
Tom: That’s right. The whole pipeline involves query pooling, proxy extraction using methods like KnockoffNets random sampling, and then optimizing that perturbation delta y for every class in G.
Jane: And finally, this perturbation delta y is applied at test time: a misclassified member applies x plus delta y to recover their true class by submitting it to the platform instead of the original input x.
Lu: The goal is that this process helps the affected subgroup—the bottom-ten percent under-performing classes, or sometimes user demographics—to improve its accuracy for both balanced and unbalanced platform training regimes <ref:2605.27689#pg1>.
Meng: They show results where those bottom classes move in the right direction, improving worst-group accuracy and equal-opportunity gap metrics.
The paper's improvements: Tom: They highlight a few key improvements over previous methods. First, the collective approach is query-budgeted, meaning it’s efficient because they only need to pay for proxy extraction and perturbation generation once.
Jane: That’s the efficiency point—you don't repeat that heavy work every time you want a correction; you reuse the perturbation delta y for non-contributing users at test time.
Lu: The collective advantage is that it pays the proxy-extraction and perturbation-generation cost once and produces a reusable perturbation delta y that can be applied by non-contributing affected users at test time.
Meng: And they showed that this approach works even when the collective’s proxy is smaller than the platform it queries, which suggests good transfer across architectures.
Tom: They also demonstrated that a small group of coordinated users can already improve model performance even at a pool size of Q = five hundred for subgroup accuracy without needing a high-fidelity proxy.
Jane: That’s really telling—the local recovery is possible because the perturbation is strong enough to lift the accuracy at that pool size, even if the proxy isn't perfectly faithful yet.
Conclusion: Tom: So to wrap up on "Test-Time Collective Action: Proxy-Based Perturbations for Correcting Algorithmic Harms," it shows that a small group of coordinated users can make real improvements to model performance and fairness without needing any platform retraining.
Jane: The implication is that we have a corrective intervention available when platform-side remediation is unavailable or delayed, offering users an external lever.
Lu: This work contributes a collective, black-box, query-budgeted formulation of corrective perturbations rather than proposing a new platform-side fairness intervention itself.
Meng: It’s about showing that coordinated action can be viable even when you don't know if your data was used to train the model.
Tom: The results were consistent across CIFAR-ten CIFAR-one hundred and FairFace, under both balanced and deliberately skewed platform training regimes <ref:2605.27689#pg1>. This method is consistent in its performance.
Jane: It’s a very concrete way to get subgroup accuracy gains for classes that are lagging behind the y equals x diagonal for equal-opportunity gap and disparate impact metrics.
Lu: The authors suggest that stronger individual attacks would shift the break-even K star upward, which means more aggressive individual corrections can be effective.
Meng: But they also point out that when the task itself is harmful, user action might need to move beyond simple correction and take forms like refusal or opt-out.
Tom: They conclude by proposing one specific implementation way using a KnockoffNets ensemble with a per-class optimized perturbation. The corrective rate substantially exceeds the cross-target rate at every pool size, indicating the perturbation is a stronger lever for correction than for misuse on these benchmarks.
University of Waterloo · ÉTS Montréal, Mila - Quebec AI Institute
cs.LG, cs.CR
Submitted: 2026-05-26
Updated: 2026-08-07
Code: https://github.com/tisl-lab/TestTimeCollectiveAction
License: http://creativecommons.org/licenses/by/4.0/
Importance score: 86/100
The gist: The gist: Test-Time Collective Action (TTCA) is a framework allowing a group of users to correct algorithmic harms affecting under-served subgroups by generating per-class perturbations at test time
Key concepts
- Test-Time Collective Action (TTCA)
- A framework where a group of users share query access to correct algorithmic harms. Users pool their queries to build a proxy model, generate class-specific corrections (perturbations), and apply these fixes to their own inputs at the moment of submission, bypassing the platform's training loop.
- Proxy Extraction
- The process where a collective of users uses their pooled queries to train a surrogate model (a 'proxy') that mimics the behavior of the main platform model. This proxy helps users understand and target specific weaknesses in the platform's predictions without needing full access to its internal workings.
- Per-Class Perturbation Optimization
- The mathematical process where users collaboratively find an optimal small change ($\delta_y$) for each class ($y$). This perturbation is designed to shift the proxy model's prediction towards the correct class, allowing individual users to apply this correction when submitting their inputs at test time.
Terminology
Summary
The gist: Test-Time Collective Action (TTCA) is a framework allowing a group of users to correct algorithmic harms affecting under-served subgroups by generating per-class perturbations at test time without requiring platform retraining.
Introduction and Motivation
Machine learning systems can exhibit performance disparities across different user groups, with documented examples in computer vision [Buolamwini and Gebru, 2018], safety features of language models [Chehbouni et al., 2024] and automated speech recognition [Koenecke et al., 2020]. When users encounter these harms, provider-centric fairness interventions such as pre-processing, in-processing, and post-processing methods are commonly used to address them [Caton and Haas, 2024]. This could be considered reasonable if platforms are willing to act towards reducing these harms; however, when remediation is unavailable, it leaves affected users with no lever of their own to address the situation [Page 1]. Recent work in Algorithmic Collective Action shows that coordinated users can steer an algorithmic system toward a collective goal, but the existing mechanisms require the provider to retrain on the collective’s modified data which users may not have control over [Page 1]. Test-Time Collective Action (TTCA) is proposed as a framework through which a group of users who share query access to the platform can correct disparities affecting under-served subgroup without participating in the platform’s training loop [Page 1].
How it works
The TTCA framework operates in two main phases, as illustrated in Figure 1 [Page 2]. Phase 1 involves distilling a collective proxy and optimizing y through collective queries on the platform model plat which yields a proxy, and then optimizing y against this proxy [Page 2]. Phase 2 is Test-Time Collective Action where a misclassified member applies y to recover their true class by submitting x + y at test time, requiring no cooperation from the platform [Page 2]. The high-level pipeline involves extracting a collective proxy from pooled queries, then applying the resulting perturbation at test-time [Page 2].
The mechanism for crafting the perturbation involves several steps:
-
Query pooling: Each member uses their query budget to label a subset of Dpub with predictions from fplat, which are aggregated into a shared pool Dproxy = (x, fplat(x)) of Q pairs [Page 4].
-
Proxy extraction: The collective then trains a surrogate fproxy on Dproxy via KnockoffNets random sampling [Orekondy et al., 2019], fitting a network with cross-entropy against the platform’s soft-probability outputs, and additionally trains K = 5 proxies with independent random seeds and ensembling their outputs as fens = (Page 4].
-
Perturbation optimization: For each class y in G, the collective optimizes a perturbation δy against the proxy ensemble under an l∞ budget: δy = arg min δ∞≤ε Ex∼Dy proxy CE(fens(˜x), y) [Page 4].
-
Test-time application: A member with input x of class y checks whether y ∈ G; if so, they submit clip(x + δy, 0, 1) instead of x; otherwise the input is sent unchanged [Page 4].
Empirical Evaluation and Performance
The mechanism was empirically evaluated on CIFAR-10, CIFAR-100, and FairFace under both balanced and unbalanced platform training regimes [Page 3]. The results show that modestly-sized collectives close most of the subgroup accuracy gap, transfer across architectures (a small proxy can attack a larger platform), and improve worst-group accuracy, equal-opportunity gap, and disparate impact [Page 1]. Specifically, subgroup accuracy improves even at the smallest pool size and once a proxy is faithful enough to the predictions of the platform model, additional queries do not significantly increase subgroup accuracy [Page 6].
A query-budget analysis comparing a per-user black-box attack baseline shows that pooling is cheaper than each subgroup member attacking alone [Page 1]. The collective’s intervention requires far fewer platform queries than individuals attacking alone; for instance, the collective spends N = 22,000 queries once to train a shared proxy, while individual SimBA requires approximately 2.3 million cumulative queries from the 1,000-user subgroup [Page 6].
Fairness and Comparison to Baselines
The primary outcome is the subgroup accuracy from Equation 1: SubgroupAcc = Pr fplat(x′) = y for y ∈ G, (1) [Page 4]. The intervention is corrective if subgroup accuracy rises while these metrics improve or hold [Page 6]. Most settings move in the improving direction for all three metrics: above the y=x diagonal for WGA and DI, and below it for EOD [Page 13].
The individual baseline is instantiated with targeted SimBA using the pixel variant, which models an uncoordinated scenario in which users attempt to correct their own misclassifications without sharing data, queries, or perturbations with others [Page 9]. The collective’s advantage is that it pays the proxy-extraction and perturbation-generation cost once and produces a reusable perturbation δy that can be applied by non-contributing affected users at test time [Page 12].
Conclusion
Test-Time Collective Action offers corrective intervention to users when platform-side remediation is unavailable or delayed [Page 1]. The work demonstrates that a small group of coordinated users can improve model performance and fairness without requiring model retraining, or even knowledge of its architecture [Page 2]. TTCA contributes a collective, black-box, query-budgeted formulation of corrective perturbations rather than a new platform-side fairness intervention [Page 2]. The result is consistent across CIFAR-10, CIFAR-100, and FairFace; under both balanced and deliberately skewed platform-training regimes; and even when the collective’s proxy is smaller than the platform it queries [Page 6].
The work contributes to the ongoing discussion on external, user-driven mechanisms to correct harms [Page 17]. The proposed mechanism shows that a small pool is already enough for that local recovery, which is why subgroup accuracy lifts at Q = 500 in §6.1 without the proxy’s overall fidelity being high [Page 19]. The collective reaches its ceiling with roughly 23,000 total platform queries paid once and reused across users, whereas bringing the 1,000 subgroup users to the individual ceiling requires approximately 2.3 million cumulative queries [Page 6].
The paper also notes that when the task itself is harmful, user-side action may need to move beyond the corrective framing developed in this paper and instead take forms such as refusal, opt-out, or contestation [Page 14]. The intervention focuses on quality-of-service harms where the underlying task objective is broadly useful to users [Page 2].
The work also suggests that platform defenses can be effective in preventing TTCA but also cost the platform in terms of accuracy degradation [Page 18]. The framework acts as a complementary approach to the ACA framework in the test-time setting, showing that collective action remains a viable option even when users cannot influence the training loop or know whether their data was used to train the model [Page 18].
The paper concludes by proposing one specific way of implementing a test-time collective action framework where we use a KnockoffNets ensemble with a per-class optimized perturbation [Page 13]. The authors emphasize that the corrective rate substantially exceeds the cross-target rate at every pool size, indicating that the perturbation is a stronger lever for correction than for misuse on these benchmarks [Page 18].
The paper also suggests that stronger individual attacks would shift the break-even K⋆ upward and tighten the per-contributor cost threshold [Page 12]. The comparison highlights the main advantage of pooling, as it amortizes the proxy-extraction and perturbation-generation cost across contributors, producing a reusable perturbation δy that can be applied by non-contributing affected users at test time [Page 12].
The authors also note that in settings where the task itself is harmful, user-side action may need to move beyond the corrective framing developed in this paper and instead take forms such as refusal, opt-out, or contestation [Page 14]. The intervention focuses on quality-of-service harms where the underlying task objective is broadly useful to users [Page 2].
The paper also suggests that platform defenses can be effective in preventing TTCA but also cost the platform in terms of accuracy degradation [Page 18]. The framework acts as a complementary approach to the ACA framework in the test-time setting, showing that collective action remains a viable option even when users cannot influence the training loop or know whether their data was used to train the model [Page 18].
Improvements for AI systems
-
The Test-Time Collective Action (TTCA) framework allows a
group of users who share query access to the platform, can correct disparities affecting under-served subgroup without participating in the platform’s training loop.
This enables users tocorrect quality-of-service harms
by applying aper-class universal perturbation
at inference time. -
The system can generate corrective perturbations using only API query access by first distilling a
collective proxy
from pooled queries, which is then used to optimize a perturbation against it. This process requires the collective topool their data contributions to generate a perturbation that mitigates the algorithmic harms of a frozen black-box model using only API query access.
-
The system can be deployed across different platform architectures because
a small proxy can attack a larger platform,
as demonstrated by cross-architecture transfer where perturbations crafted on a smaller proxytransfer effectively to the larger ResNet-50 or RegNet-Y-16GF platform.
-
The collective intervention translates subgroup accuracy gains into tangible fairness improvements, showing that the mechanism can improve
worst-group accuracy and equal-opportunity gap
by achieving results in Figure 5 that show metricsmove in the improving direction for all three metrics.
-
The system offers significant query efficiency compared to individual attacks, as pooling is
cheaper than each subgroup member attacking alone,
requiring a collective size of onlyn ≥ 6 at B=4,000
to match individual performance on CIFAR-100.
Abstract
When machine learning systems under-perform for particular subgroups, affected users typically have no way to correct these disparities without relying on platform-level fixes. Existing approaches to algorithmic fairness rely on provider-centric approaches to correct these failures, leaving users with no external lever when faced with harm. Recent work in Algorithmic Collective Action shows that coordinated users can steer an algorithmic system toward a collective goal, but the existing mechanisms require the provider to retrain on the collective's modified data which users may not have control over. We propose Test-Time Collective Action (TTCA), a framework through which a group of users who share query access to the platform, can correct disparities affecting under-served subgroup without participating in the platform's training loop. We implement this through a proxy-based mechanism where the collective pools query access to a black-box API to extract a proxy of the platform, then optimizes a per-class universal perturbation against the proxy. Each member applies this perturbation to their own inputs at submission time, requiring no cooperation from the platform. We empirically evaluate the mechanism on CIFAR-10, CIFAR-100, and FairFace, showing that modestly-sized collectives close most of the subgroup accuracy gap, transfer across architectures (a small proxy can attack a larger platform), and improve worst-group accuracy, equal-opportunity gap, and disparate impact. A query-budget analysis comparing a per-user black-box attack baseline shows that pooling is cheaper than each subgroup member attacking alone. Test-time collective action thus offers corrective intervention to users when platform-side remediation is unavailable or delayed.
Sources
- Minority Collective Action for User-Side Fairness
- Adversarial Patch
- Crowding Out The Noise: Algorithmic Collective Action Under Differential Privacy
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks