evograd-diff 0.1.1__tar.gz → 0.1.2__tar.gz

{evograd_diff-0.1.1 → evograd_diff-0.1.2}/.claude/settings.local.json

@@ -10,7 +10,8 @@
       "Bash(uv run *)",
       "Bash(git check-ignore *)",
       "Bash(uv lock *)",
-      "Bash(git stash *)"
+      "Bash(git stash *)",
+      "Bash(grep -n '```' README.md)"
     ]
   }
 }

{evograd_diff-0.1.1 → evograd_diff-0.1.2}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: evograd-diff
-Version: 0.1.1
+Version: 0.1.2
 Summary: PyTorch-based framework for differentiable evolutionary computation and swarm intelligence
 Project-URL: Homepage, https://github.com/andreatangherloni/EvoGrad
 Project-URL: Repository, https://github.com/andreatangherloni/EvoGrad
@@ -122,10 +122,10 @@ ga = GA(pop_size=100, differentiable=False)
 # Fully differentiable GA with custom operators
 ga = GA(
     pop_size=100,
-    selection=RouletteSelection(differentiable=True, learn_temperature=True),
-    crossover=SBXCrossover(differentiable=True, learn_eta=True, learn_prob=True),
-    mutation=PolynomialMutation(differentiable=True, learn_eta=True, learn_prob=True),
-    survival=MergeSurvival(selection=RouletteSelection(differentiable=True)),
+    selection=RouletteSelection(adaptive=True, learn_temperature=True),
+    crossover=SBXCrossover(adaptive=True, learn_eta=True, learn_prob=True),
+    mutation=PolynomialMutation(adaptive=True, learn_eta=True, learn_prob=True),
+    survival=MergeSurvival(elitism=True, adaptive=True),
     differentiable=True,  # Makes population learnable
 )
 ```
@@ -134,7 +134,7 @@ ga = GA(
 |-----------|--------|
 | `differentiable=False` | Classical GA with discrete operators |
 | `differentiable=True` | Population is an `nn.Parameter` (learnable via backprop) |
-| Operator `differentiable=True` | Operator uses Gumbel-Softmax/Binary-Concrete for gradient flow |
+| Operator `adaptive=True` | Operator uses Gumbel-Softmax/Binary-Concrete for gradient flow |
 | Operator `learn_*=True` | Operator hyperparameters become learnable `nn.Parameter` |
 
 ### Differential Evolution (DE)
@@ -175,10 +175,10 @@ de = DE(pop_size=100, variant="DE/current-to-best/1/bin", adaptive=True, differe
 PSO uses the same **algorithm-level flags** as DE:
 
 ```python
-from evograd.algorithms import PSO, pso_constriction, pso_adaptive
+from evograd.algorithms import PSO, pso_constriction, pso_default
 
 # Classical PSO
-pso = PSO(pop_size=100, inertia=0.7, c1=1.5, c2=1.5)
+pso = PSO(pop_size=100, w=0.7, c1=1.5, c2=1.5)
 
 # Adaptive PSO (learnable inertia, c1, c2)
 pso = PSO(pop_size=100, adaptive=True)
@@ -256,7 +256,7 @@ EvoGrad provides a comprehensive library of evolutionary operators:
 | `BlendCrossover` | BLX-α crossover | ✓ |
 | `ArithmeticCrossover` | Weighted average | ✓ |
 | `UniformCrossover` | Gene-wise uniform swap | ✓ |
-| `SimulatedBinaryCrossover` | Alias for SBX | ✓ |
+| `NPointCrossover` | N-point crossover | ✓ |
 
 ### Mutation
 | Operator | Description | Differentiable |
@@ -264,21 +264,22 @@ EvoGrad provides a comprehensive library of evolutionary operators:
 | `PolynomialMutation` | Polynomial bounded mutation | ✓ |
 | `GaussianMutation` | Additive Gaussian noise | ✓ |
 | `UniformMutation` | Uniform random replacement | ✓ |
-| `AdaptiveMutation` | Self-adaptive mutation rates | ✓ |
+| `NonUniformMutation` | Annealed mutation strength | ✓ |
 
 ### Survival
 | Operator | Description |
 |----------|-------------|
 | `MergeSurvival` | (μ+λ) with optional elitism |
-| `ReplacementSurvival` | (μ,λ) generational replacement |
-| `AgingSurvival` | Age-based replacement |
+| `CommaSurvival` | (μ,λ) generational replacement |
+| `ReplaceWorstSurvival` | Steady-state worst replacement |
+| `AgeSurvival` | Age-based replacement |
 | `FitnessSurvival` | Pure fitness-based truncation |
 
 ### Repair
 | Operator | Description |
 |----------|-------------|
 | `BoundsRepair` | Clamp to bounds |
-| `ReflectionRepair` | Bounce off boundaries |
+| `ReflectRepair` | Bounce off boundaries |
 | `WrapRepair` | Toroidal wrap-around |
 | `RandomRepair` | Random resampling |
 
@@ -290,7 +291,7 @@ EvoGrad provides a comprehensive library of evolutionary operators:
 import torch
 import torch.nn as nn
 from evograd.algorithms import CMAES
-from evograd.core import Problem
+from evograd.core import Problem, minimize
 from evograd.core.termination import MaxEvaluations
 
 
@@ -344,7 +345,7 @@ print(f"Final loss: {result.best_fitness:.6f}")
 ### Callbacks for Logging
 
 ```python
-from evograd.core import minimize
+from evograd.core import minimize, MaxEvaluations
 from evograd.utils import HistoryCallback, PrintCallback
 
 callbacks = [

{evograd_diff-0.1.1 → evograd_diff-0.1.2}/README.md

@@ -95,10 +95,10 @@ ga = GA(pop_size=100, differentiable=False)
 # Fully differentiable GA with custom operators
 ga = GA(
     pop_size=100,
-    selection=RouletteSelection(differentiable=True, learn_temperature=True),
-    crossover=SBXCrossover(differentiable=True, learn_eta=True, learn_prob=True),
-    mutation=PolynomialMutation(differentiable=True, learn_eta=True, learn_prob=True),
-    survival=MergeSurvival(selection=RouletteSelection(differentiable=True)),
+    selection=RouletteSelection(adaptive=True, learn_temperature=True),
+    crossover=SBXCrossover(adaptive=True, learn_eta=True, learn_prob=True),
+    mutation=PolynomialMutation(adaptive=True, learn_eta=True, learn_prob=True),
+    survival=MergeSurvival(elitism=True, adaptive=True),
     differentiable=True,  # Makes population learnable
 )
 ```
@@ -107,7 +107,7 @@ ga = GA(
 |-----------|--------|
 | `differentiable=False` | Classical GA with discrete operators |
 | `differentiable=True` | Population is an `nn.Parameter` (learnable via backprop) |
-| Operator `differentiable=True` | Operator uses Gumbel-Softmax/Binary-Concrete for gradient flow |
+| Operator `adaptive=True` | Operator uses Gumbel-Softmax/Binary-Concrete for gradient flow |
 | Operator `learn_*=True` | Operator hyperparameters become learnable `nn.Parameter` |
 
 ### Differential Evolution (DE)
@@ -148,10 +148,10 @@ de = DE(pop_size=100, variant="DE/current-to-best/1/bin", adaptive=True, differe
 PSO uses the same **algorithm-level flags** as DE:
 
 ```python
-from evograd.algorithms import PSO, pso_constriction, pso_adaptive
+from evograd.algorithms import PSO, pso_constriction, pso_default
 
 # Classical PSO
-pso = PSO(pop_size=100, inertia=0.7, c1=1.5, c2=1.5)
+pso = PSO(pop_size=100, w=0.7, c1=1.5, c2=1.5)
 
 # Adaptive PSO (learnable inertia, c1, c2)
 pso = PSO(pop_size=100, adaptive=True)
@@ -229,7 +229,7 @@ EvoGrad provides a comprehensive library of evolutionary operators:
 | `BlendCrossover` | BLX-α crossover | ✓ |
 | `ArithmeticCrossover` | Weighted average | ✓ |
 | `UniformCrossover` | Gene-wise uniform swap | ✓ |
-| `SimulatedBinaryCrossover` | Alias for SBX | ✓ |
+| `NPointCrossover` | N-point crossover | ✓ |
 
 ### Mutation
 | Operator | Description | Differentiable |
@@ -237,21 +237,22 @@ EvoGrad provides a comprehensive library of evolutionary operators:
 | `PolynomialMutation` | Polynomial bounded mutation | ✓ |
 | `GaussianMutation` | Additive Gaussian noise | ✓ |
 | `UniformMutation` | Uniform random replacement | ✓ |
-| `AdaptiveMutation` | Self-adaptive mutation rates | ✓ |
+| `NonUniformMutation` | Annealed mutation strength | ✓ |
 
 ### Survival
 | Operator | Description |
 |----------|-------------|
 | `MergeSurvival` | (μ+λ) with optional elitism |
-| `ReplacementSurvival` | (μ,λ) generational replacement |
-| `AgingSurvival` | Age-based replacement |
+| `CommaSurvival` | (μ,λ) generational replacement |
+| `ReplaceWorstSurvival` | Steady-state worst replacement |
+| `AgeSurvival` | Age-based replacement |
 | `FitnessSurvival` | Pure fitness-based truncation |
 
 ### Repair
 | Operator | Description |
 |----------|-------------|
 | `BoundsRepair` | Clamp to bounds |
-| `ReflectionRepair` | Bounce off boundaries |
+| `ReflectRepair` | Bounce off boundaries |
 | `WrapRepair` | Toroidal wrap-around |
 | `RandomRepair` | Random resampling |
 
@@ -263,7 +264,7 @@ EvoGrad provides a comprehensive library of evolutionary operators:
 import torch
 import torch.nn as nn
 from evograd.algorithms import CMAES
-from evograd.core import Problem
+from evograd.core import Problem, minimize
 from evograd.core.termination import MaxEvaluations
 
 
@@ -317,7 +318,7 @@ print(f"Final loss: {result.best_fitness:.6f}")
 ### Callbacks for Logging
 
 ```python
-from evograd.core import minimize
+from evograd.core import minimize, MaxEvaluations
 from evograd.utils import HistoryCallback, PrintCallback
 
 callbacks = [

{evograd_diff-0.1.1 → evograd_diff-0.1.2}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "hatchling.build"
 
 [project]
 name = "evograd-diff"
-version = "0.1.1"
+version = "0.1.2"
 description = "PyTorch-based framework for differentiable evolutionary computation and swarm intelligence"
 readme = "README.md"
 license = { text = "Apache-2.0" }

evograd_diff-0.1.2/test.py

@@ -0,0 +1,32 @@
+import torch
+from evograd.core import Problem, minimize, MaxEvaluations
+from evograd.algorithms import GA, DE, PSO, CMAES
+
+# Define an optimisation problem
+problem = Problem(
+    objective=lambda x: (x**2).sum(dim=-1),  # Sphere function
+    n_var=30,
+    xl=-100.0,
+    xu=100.0,
+)
+
+# Run with Genetic Algorithm
+ga = GA(pop_size=100, differentiable=True)
+result = minimize(problem, ga, termination=MaxEvaluations(10000), seed=42)
+print(f"GA Best: {result.best_fitness:.6f}")
+
+# Run with Differential Evolution
+de = DE(pop_size=100, variant="DE/rand/1/bin", adaptive=True)
+result = minimize(problem, de, termination=MaxEvaluations(10000), seed=42)
+print(f"DE Best: {result.best_fitness:.6f}")
+
+# Run with Particle Swarm Optimisation
+pso = PSO(pop_size=100, adaptive=True, differentiable=True)
+result = minimize(problem, pso, termination=MaxEvaluations(10000), seed=42)
+print(f"PSO Best: {result.best_fitness:.6f}")
+
+# Run with CMA-ES
+cmaes = CMAES(sigma=0.5, adaptive=True)
+result = minimize(problem, cmaes, termination=MaxEvaluations(10000), seed=42)
+print(f"CMA-ES Best: {result.best_fitness:.6f}")
+

evograd_diff-0.1.2/test2.py

@@ -0,0 +1,20 @@
+from evograd.algorithms import GA
+from evograd.operators import (
+    RouletteSelection,
+    SBXCrossover,
+    PolynomialMutation,
+    MergeSurvival,
+)
+
+# Classical GA (no gradients)
+ga = GA(pop_size=100, differentiable=False)
+
+# Fully differentiable GA with custom operators
+ga = GA(
+    pop_size=100,
+    selection=RouletteSelection(differentiable=True, learn_temperature=True),
+    crossover=SBXCrossover(differentiable=True, learn_eta=True, learn_prob=True),
+    mutation=PolynomialMutation(differentiable=True, learn_eta=True, learn_prob=True),
+    survival=MergeSurvival(selection=RouletteSelection(differentiable=True)),
+    differentiable=True,  # Makes population learnable
+)

{evograd_diff-0.1.1 → evograd_diff-0.1.2}/uv.lock

@@ -156,7 +156,7 @@ wheels = [
 
 [[package]]
 name = "evograd-diff"
-version = "0.1.1"
+version = "0.1.2"
 source = { editable = "." }
 dependencies = [
     { name = "matplotlib" },