Etash Guha
commited on
Commit
•
229e7eb
1
Parent(s):
0f38260
some small changes
Browse files
app.py
CHANGED
@@ -16,14 +16,13 @@ if 'response_content' not in st.session_state:
|
|
16 |
chat_col = st.container()
|
17 |
|
18 |
chat_col.title("CodeLATS")
|
19 |
-
description = """This demo is an implementation of Language Agent Tree Search (LATS) (https://arxiv.org/abs/2310.04406)
|
20 |
|
21 |
-
Listed below is an example programming problem (https://leetcode.com/problems/
|
22 |
|
23 |
```python
|
24 |
-
Given
|
25 |
```
|
26 |
-
:red[**NOTE:**] On average a call for a HumanEval or Leetcode question will cost around 5-30 cents on GPT-4, using the default parameters. This value may change depending on problem difficulty and parameters.
|
27 |
"""
|
28 |
|
29 |
chat_col.markdown(description)
|
@@ -32,7 +31,7 @@ sidebar = st.sidebar
|
|
32 |
runtime_container = st.container()
|
33 |
|
34 |
# Parameters Section
|
35 |
-
sidebar.title("
|
36 |
parameters_section = sidebar.expander("Parameters", expanded=False)
|
37 |
tree_width = parameters_section.number_input("Tree Width", min_value=1, max_value=5, value=1)
|
38 |
tree_depth = parameters_section.number_input("Tree Depth", min_value=1, max_value=8, value=3)
|
|
|
16 |
chat_col = st.container()
|
17 |
|
18 |
chat_col.title("CodeLATS")
|
19 |
+
description = """This demo is an implementation of Language Agent Tree Search (LATS) (https://arxiv.org/abs/2310.04406) with Samba-1 in the backend. Thank you to the original authors of demo on which this is based from [Lapis Labs](https://lapis.rocks/)
|
20 |
|
21 |
+
Listed below is an example programming problem (https://leetcode.com/problems/median-of-two-sorted-arrays/description/) to get started with.
|
22 |
|
23 |
```python
|
24 |
+
Given two sorted arrays `nums1` and `nums2` of size `m` and `n` respectively, return **the median** of the two sorted arrays. The overall run time complexity should be `O(log (m+n))`. **Example 1:** **Input:** nums1 = \[1,3\], nums2 = \[2\] **Output:** 2.00000 **Explanation:** merged array = \[1,2,3\] and median is 2. **Example 2:** **Input:** nums1 = \[1,2\], nums2 = \[3,4\] **Output:** 2.50000 **Explanation:** merged array = \[1,2,3,4\] and median is (2 + 3) / 2 = 2.5. **Constraints:** * `nums1.length == m` * `nums2.length == n` * `0 <= m <= 1000` * `0 <= n <= 1000` * `1 <= m + n <= 2000` * `-106 <= nums1[i], nums2[i] <= 106`
|
25 |
```
|
|
|
26 |
"""
|
27 |
|
28 |
chat_col.markdown(description)
|
|
|
31 |
runtime_container = st.container()
|
32 |
|
33 |
# Parameters Section
|
34 |
+
sidebar.title("From SambaNova Systems")
|
35 |
parameters_section = sidebar.expander("Parameters", expanded=False)
|
36 |
tree_width = parameters_section.number_input("Tree Width", min_value=1, max_value=5, value=1)
|
37 |
tree_depth = parameters_section.number_input("Tree Depth", min_value=1, max_value=8, value=3)
|