UltraRonin commited on
Commit
126117c
·
1 Parent(s): 1ae8726
Files changed (1) hide show
  1. index.html +0 -3
index.html CHANGED
@@ -152,9 +152,6 @@
152
  <p>
153
  <strong>LR\({}^{2}\)Bench</strong> is a novel benchmark designed to evaluate the <strong>L</strong>ong-chain <strong>R</strong>eflective <strong>R</strong>easoning capabilities of LLMs. LR\({}^{2}\)Bench comprises 850 samples across six Constraint Satisfaction Problems (CSPs) where reflective reasoning is crucial for deriving solutions that meet all given constraints. Each type of task focuses on distinct constraint patterns, such as knowledge-based, logical, and spatial constraints, providing a comprehensive evaluation of diverse problem-solving scenarios.
154
  </p>
155
- <p>
156
- **Note**: We plan to release the LR\({}^{2}\)Bench dataset soon. If you're interested in the performance of your model or have any questions, please feel free to contact us at [email](mailto: <a href="mailto: [email protected]"> [email protected]</a>).
157
- </p>
158
  <p>
159
  <strong>Note:</strong> We plan to release the LR\({}^{2}\)Bench dataset soon. If you're interested in the performance of your model or have any questions, please feel free to contact us at <a href="mailto:[email protected]">[email protected]</a>.
160
  </p>
 
152
  <p>
153
  <strong>LR\({}^{2}\)Bench</strong> is a novel benchmark designed to evaluate the <strong>L</strong>ong-chain <strong>R</strong>eflective <strong>R</strong>easoning capabilities of LLMs. LR\({}^{2}\)Bench comprises 850 samples across six Constraint Satisfaction Problems (CSPs) where reflective reasoning is crucial for deriving solutions that meet all given constraints. Each type of task focuses on distinct constraint patterns, such as knowledge-based, logical, and spatial constraints, providing a comprehensive evaluation of diverse problem-solving scenarios.
154
  </p>
 
 
 
155
  <p>
156
  <strong>Note:</strong> We plan to release the LR\({}^{2}\)Bench dataset soon. If you're interested in the performance of your model or have any questions, please feel free to contact us at <a href="mailto:[email protected]">[email protected]</a>.
157
  </p>