QuizGenerator 0.4.2__py3-none-any.whl

QuizGenerator/premade_questions/cst463/gradient_descent/misc.py

@@ -0,0 +1,73 @@
+
+from typing import List, Tuple, Callable, Union, Any
+import sympy as sp
+
+from QuizGenerator.misc import Answer
+
+def generate_function(rng, num_variables: int, max_degree: int, use_quadratic: bool = True) -> tuple[Any, sp.Expr, sp.MutableDenseMatrix, sp.Equality]:
+  """
+  Generate a function, its gradient, LaTeX representation, and optimal point using SymPy.
+  Returns: (variables, function, gradient_function, equation)
+
+  Args:
+    rng: Random number generator
+    num_variables: Number of variables in the function
+    max_degree: Maximum degree of polynomial terms (only used if use_quadratic=False)
+    use_quadratic: If True, generates well-conditioned quadratic functions that converge nicely.
+                   If False, uses the original random polynomial generation.
+  """
+  # Create variable symbols
+  var_names = [f'x_{i}' for i in range(num_variables)]
+  variables = sp.symbols(var_names)  # returns a tuple; robust when n==1
+
+  if use_quadratic:
+    # Generate well-conditioned quadratic function: f = sum of (x_i - center_i)^2 terms
+    # This creates a paraboloid with a clear minimum at (center_0, center_1, ...)
+
+    # Random center point (small integers for clean calculations)
+    centers = [rng.choice([-2, -1, 0, 1, 2]) for _ in range(num_variables)]
+
+    # Random positive coefficients for each squared term (keeps function convex)
+    # Use small values (0.5 to 2) to avoid huge gradients
+    coeffs = [rng.choice([0.5, 1, 1.5, 2]) for _ in range(num_variables)]
+
+    # Build quadratic: sum of coeff_i * (x_i - center_i)^2
+    poly = sp.Add(*[
+      coeffs[i] * (variables[i] - centers[i])**2
+      for i in range(num_variables)
+    ])
+
+  else:
+    # Original random polynomial generation (may not converge well)
+    # monomials up to max_degree; drop constant 1
+    terms = [m for m in sp.polys.itermonomials(variables, max_degree) if m != 1]
+
+    # random nonzero integer coefficients in [-10,-1] ∪ [1,9]
+    coeff_pool = [*range(-10, 0), *range(1, 10)]
+
+    # polynomial; if no terms (e.g., max_degree==0), fall back to 0
+    poly = sp.Add(*(rng.choice(coeff_pool) * t for t in terms)) if terms else sp.Integer(0)
+
+  # f(x_1, ..., x_n) = poly
+  f = sp.Function('f')
+  function = poly
+  gradient_function = sp.Matrix([poly.diff(v) for v in variables])
+  equation = sp.Eq(f(*variables), poly)
+
+  return variables, function, gradient_function, equation
+  
+  
+def format_vector(vec: List[float]) -> str:
+  
+  vector_string = ', '.join(
+    [
+      sorted(Answer.accepted_strings(v), key=lambda s: len(s))[0]
+      for v in vec
+    ]
+  )
+  
+  if len(vec) == 1:
+    return vector_string
+  else:
+    return f"({vector_string})"
+

QuizGenerator/premade_questions/cst463/math_and_data/__init__.py

@@ -0,0 +1,2 @@
+from .matrix_questions import MatrixAddition, MatrixScalarMultiplication, MatrixMultiplication
+from .vector_questions import VectorAddition, VectorScalarMultiplication, VectorDotProduct, VectorMagnitude