caleb gross personal blog
Hard problems that reduce to document ranking
There are two claims I’d like to make: LLMs can be used effectively1 for listwise document ranking. Some complex problems can (surprisingly) be solved by transforming them into document ranking problems. I’ve primarily explored both of these claims in the context of using patch diffing to locate N-day…
- Points
- 318
- HN comments
- 54
- Submissions
- 1
- Cited by
- 0 commenters
Databases & DataAI & Machine Learning2025
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Feb 25, 2025 | Hard problems that reduce to document ranking by noperator | 318 | 54 |
