ε-greedy Epsilon-greedy algorithm 90% of the time, pick the strategy you've found works best (greedy). 10% of the time, try something random (epsilon = chance of exploration). Keeps you from getting stuck on stale winners. bandit Multi-armed bandit Classic decision-making algorithm. Each 'arm' is one strategy ROGUE could try; the bandit pulls higher-yield arms more often, lower-yield arms less. Online learning — gets smarter every day without retraining.
An online learner that rates each jailbreak-hunting query by how many novel attacks per dollar it surfaces.
6000.00
novel attacks / $
in plain Englishextremely cost-efficient — 10+ novel attacks per $
- github_pliny_umbrella6000
- arxiv_actorattack2842.11
- vendor_openai_blog2666.67
why it mattersStops you from wasting Bright Data budget on queries that no longer find anything new — the hot arm gets the next 90% of pulls automatically.