Last active
January 3, 2026 21:17
-
-
Save JoeJoe1313/d6c4c92ce18d7a537df39041853055ea to your computer and use it in GitHub Desktop.
Thinking Backwards: The "Reversal Blessing" in LLM Multiple-Choice Reasoning
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| { | |
| "cells": [ | |
| { | |
| "cell_type": "markdown", | |
| "id": "583c59cd", | |
| "metadata": {}, | |
| "source": [ | |
| "For R2L models, the paper proposes \"reverse thinking\" based on Bayes' rule, which evaluates how likely the question is given a particular answer. The authors test three scoring paradigms and find that the simplest one performs the best:\n", | |
| "\n", | |
| "- **Paradigm 1 (Normalized + Prior):**\n", | |
| "\n", | |
| "$$\n", | |
| "s_i^{(1)} = \\frac{1}{M_i} \\log p_{R2L}(q \\mid a_i) + \\log p_{R2L}(a_i)\n", | |
| "$$\n", | |
| "\n", | |
| "- **Paradigm 2 (Unnormalized + Prior):**\n", | |
| "\n", | |
| "$$\n", | |
| "\\tilde{s}_i^{(2)} = \\log p_{R2L}(q \\mid a_i) + \\log p_{R2L}(a_i)\n", | |
| "$$\n", | |
| "\n", | |
| "- **Paradigm 3 (Unnormalized, Uniform Prior):**\n", | |
| "\n", | |
| "$$\n", | |
| "s_i^{(3)} = \\log p_{R2L}(q \\mid a_i)\n", | |
| "$$\n", | |
| "\n", | |
| "Empirically, Paradigm 3 consistently yields the highest MCQ accuracy. By ignoring the prior probability of the answer, it avoids noisy estimations and cleanly sidesteps the surface-form competition issue." | |
| ] | |
| }, | |
| { | |
| "cell_type": "markdown", | |
| "id": "99bb236b", | |
| "metadata": {}, | |
| "source": [] | |
| } | |
| ], | |
| "metadata": { | |
| "language_info": { | |
| "name": "python" | |
| } | |
| }, | |
| "nbformat": 4, | |
| "nbformat_minor": 5 | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment