Update app.py

app.py

@@ -36,43 +36,39 @@ def compute_embeddings(problems):
     return model.encode(problems, normalize_embeddings=True)
 
 def find_similar_problems(df, similarity_threshold=0.9):
-    """Find similar problems using cosine similarity, optimized with clear UI updates."""
+    """Find similar problems using cosine similarity, optimized for speed."""
     
-    status_msgs = []
-
-    msg = st.status("🔄 Computing problem embeddings...")
-    status_msgs.append(msg)
+    st.status("🔄 Computing problem embeddings...")
     start_time = time.time()
     embeddings = compute_embeddings(df['problem'].tolist())
-
-    msg = st.status("🔄 Computing cosine similarity matrix...")
-    status_msgs.append(msg)
+    st.success("✅ Embeddings computed!", icon="✅")
+    
+    st.status("🔄 Computing cosine similarity matrix...")
     similarity_matrix = util.cos_sim(embeddings, embeddings).numpy()
+    st.success("✅ Similarity matrix computed!", icon="✅")
 
-    msg = st.status("🔄 Filtering similar problems...")
-    status_msgs.append(msg)
-    
+    # Use numpy.triu_indices to efficiently get upper-triangle indices (excluding diagonal)
     num_problems = len(df)
     upper_triangle_indices = np.triu_indices(num_problems, k=1)
     
+    st.status("🔄 Filtering similar problems...")
     i_indices, j_indices = upper_triangle_indices
     similarity_scores = similarity_matrix[i_indices, j_indices]
 
+    # Filter based on threshold
     mask = similarity_scores > similarity_threshold
     filtered_i = i_indices[mask]
     filtered_j = j_indices[mask]
     filtered_scores = similarity_scores[mask]
 
+    # Convert results into a sorted list of tuples
     pairs = [
         (df.iloc[i]["uuid"], df.iloc[j]["uuid"], float(score))
         for i, j, score in zip(filtered_i, filtered_j, filtered_scores)
     ]
     
     sorted_pairs = sorted(pairs, key=lambda x: x[2], reverse=True)
-
-    for msg in status_msgs:
-        msg.empty()
-        
+    
     st.success(f"✅ Analysis complete! Found {len(sorted_pairs)} similar problems in {time.time() - start_time:.2f}s", icon="🎉")
 
     return sorted_pairs