Using LLMs to solve security problems
TL;DR: Raink—a novel, general-purpose listwise document ranking algorithm using an LLM as the ranking model—can be used to solve non-trivial security problems. A very simple explanation of how the Raink algorithm works: Split big list of items into small groups (e.g., 10 items per group) Ask the LLM to rank/order each small group according prompt relevance Shuffle everything and repeat this process several times Keep track of how each item performs across different groups Focus more attention on the items that consistently rank highly The approach is fast, cheap, and handles far more items than would fit in a typical LLM’s context window....