evograd-diff 0.1.0__tar.gz

evograd_diff-0.1.0/.claude/settings.local.json

@@ -0,0 +1,12 @@
+{
+  "permissions": {
+    "allow": [
+      "Bash(git add *)",
+      "Bash(git commit -m ' *)",
+      "Bash(git push *)",
+      "Bash(uv build *)",
+      "Bash(python -m zipfile -l dist/evograd-0.1.0-py3-none-any.whl)",
+      "WebFetch(domain:pypi.org)"
+    ]
+  }
+}

evograd_diff-0.1.0/.python-version

@@ -0,0 +1 @@
+3.12

evograd_diff-0.1.0/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

evograd_diff-0.1.0/PKG-INFO

@@ -0,0 +1,439 @@
+Metadata-Version: 2.4
+Name: evograd-diff
+Version: 0.1.0
+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
+Project-URL: Issues, https://github.com/andreatangherloni/EvoGrad/issues
+Author-email: Andrea Tangherloni <andrea.tangherloni@unibocconi.it>
+License: Apache-2.0
+License-File: LICENSE
+Keywords: CMA-ES,differentiable programming,differential evolution,evolutionary computation,genetic algorithm,metaheuristics,optimization,particle swarm optimization,pytorch
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Science/Research
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Requires-Python: >=3.12
+Requires-Dist: matplotlib>=3.10.8
+Requires-Dist: numpy>=2.4.4
+Requires-Dist: pandas>=3.0.2
+Requires-Dist: scipy>=1.17.1
+Requires-Dist: seaborn>=0.13.2
+Requires-Dist: torch>=2.11.0
+Description-Content-Type: text/markdown
+
+# EvoGrad: Metaheuristics in a Differentiable Wonderland
+
+<p align="center">
+  <img src="https://img.shields.io/badge/python-3.9+-blue.svg" alt="Python 3.9+">
+  <img src="https://img.shields.io/badge/pytorch-2.0+-orange.svg" alt="PyTorch 2.0+">
+  <img src="https://img.shields.io/badge/license-Apache%20License%202.0-blue.svg" alt="License: Apache-2.0">
+ 
+</p>
+
+**EvoGrad** is a PyTorch-based framework for differentiable Evolutionary Computation and Swarm Intelligence. It bridges classical population-based optimisation with modern differentiable programming by enabling gradient flow through evolutionary operators.
+
+## 🌟 Key Features
+
+- **Fully Differentiable**: All operators support gradient computation via reparameterisation tricks (Gumbel-Softmax, Binary-Concrete, pathwise gradients)
+- **GPU Accelerated**: Native PyTorch implementation for seamless CPU/GPU/MPS execution
+- **Modular Design**: Dependency injection pattern inspired by [pymoo](https://pymoo.org/) for flexible operator composition
+- **Learnable Hyperparameters**: Automatically tune algorithm parameters via backpropagation
+- **Four Algorithms**: GA, DE, PSO, and CMA-ES with multiple variants
+
+## 📦 Installation
+
+```bash
+# Clone the repository
+git clone https://github.com/YOUR_USERNAME/evograd.git
+cd evograd
+
+# Install dependencies
+pip install torch numpy
+
+# Install in development mode
+pip install -e .
+```
+
+## 🚀 Quick Start
+
+```python
+import torch
+from evograd.core import Problem, minimize
+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, max_evals=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, max_evals=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, max_evals=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, max_evals=10000, seed=42)
+print(f"CMA-ES Best: {result.best_fitness:.6f}")
+```
+
+## 🔧 Algorithms and Operating Modes
+
+### Genetic Algorithm (GA)
+
+The GA uses **operator-level differentiability**. Each operator (selection, crossover, mutation, survival) can independently be set to differentiable mode:
+
+```python
+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
+)
+```
+
+| Parameter | Effect |
+|-----------|--------|
+| `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 `learn_*=True` | Operator hyperparameters become learnable `nn.Parameter` |
+
+### Differential Evolution (DE)
+
+DE uses **algorithm-level flags** for adaptive hyperparameters and differentiable population:
+
+```python
+from evograd.algorithms import DE, de_rand_1_bin, de_best_1_bin
+
+# Classical DE
+de = DE(pop_size=100, variant="DE/rand/1/bin", F=0.5, CR=0.9)
+
+# Adaptive DE (learnable F, CR, selection temperature)
+de = DE(pop_size=100, variant="DE/best/1/bin", adaptive=True)
+
+# Differentiable population
+de = DE(pop_size=100, variant="DE/rand/1/bin", differentiable=True)
+
+# Both adaptive and differentiable
+de = DE(pop_size=100, variant="DE/current-to-best/1/bin", adaptive=True, differentiable=True)
+```
+
+| `adaptive` | `differentiable` | Effect |
+|------------|------------------|--------|
+| False | False | Classical DE |
+| True | False | F, CR, temperatures learnable via backprop |
+| False | True | Population learnable via backprop |
+| True | True | Both hyperparameters and population learnable |
+
+**Supported Variants:**
+- `DE/rand/1/bin`, `DE/rand/1/exp`, `DE/rand/2/bin`, `DE/rand/2/exp`
+- `DE/best/1/bin`, `DE/best/1/exp`, `DE/best/2/bin`, `DE/best/2/exp`
+- `DE/current-to-best/1/bin`, `DE/current-to-best/1/exp`
+- `DE/current-to-rand/1`
+
+### Particle Swarm Optimisation (PSO)
+
+PSO uses the same **algorithm-level flags** as DE:
+
+```python
+from evograd.algorithms import PSO, pso_constriction, pso_adaptive
+
+# Classical PSO
+pso = PSO(pop_size=100, inertia=0.7, c1=1.5, c2=1.5)
+
+# Adaptive PSO (learnable inertia, c1, c2)
+pso = PSO(pop_size=100, adaptive=True)
+
+# Per-particle adaptive coefficients
+pso = PSO(pop_size=100, adaptive=True, per_particle_coeffs=True)
+
+# Constriction factor PSO
+pso = pso_constriction(pop_size=100)
+
+# Fully differentiable
+pso = PSO(pop_size=100, adaptive=True, differentiable=True)
+```
+
+| `adaptive` | `differentiable` | Effect |
+|------------|------------------|--------|
+| False | False | Classical PSO |
+| True | False | Inertia, c1, c2 learnable via backprop |
+| False | True | Particle positions learnable via backprop |
+| True | True | Both coefficients and positions learnable |
+
+### CMA-ES
+
+CMA-ES supports **adaptive coefficients** and **restart strategies** (IPOP/BIPOP):
+
+```python
+from evograd.algorithms import CMAES, cmaes_ipop, cmaes_bipop
+
+# Classical CMA-ES
+cmaes = CMAES(pop_size=50, sigma=0.5)
+
+# Adaptive CMA-ES (learnable cc, cs, c1, cmu, damps)
+cmaes = CMAES(pop_size=50, sigma=0.5, adaptive=True)
+
+# Differentiable mean
+cmaes = CMAES(pop_size=50, sigma=0.5, differentiable=True)
+
+# IPOP-CMA-ES (increasing population restarts)
+cmaes = cmaes_ipop(restarts=9, incpopsize=2)
+
+# BIPOP-CMA-ES (alternating small/large populations)
+cmaes = cmaes_bipop(restarts=9)
+```
+
+| `adaptive` | `differentiable` | Effect |
+|------------|------------------|--------|
+| False | False | Classical CMA-ES |
+| True | False | Adaptation coefficients learnable via backprop |
+| False | True | Distribution mean μ learnable via backprop |
+| True | True | Both coefficients and mean learnable |
+
+**Restart Strategies:**
+- **IPOP**: Restart with doubled population after convergence
+- **BIPOP**: Alternate between small (focused) and large (exploratory) populations
+
+## 📚 Operators Library
+
+EvoGrad provides a comprehensive library of evolutionary operators:
+
+### Selection
+| Operator | Description | Differentiable |
+|----------|-------------|----------------|
+| `RandomSelection` | Uniform random selection | ✗ |
+| `RouletteSelection` | Fitness-proportionate (Gumbel-Softmax) | ✓ |
+| `TournamentSelection` | Tournament with soft winner (Gumbel-Softmax) | ✓ |
+| `RankSelection` | Rank-based probabilities | ✓ |
+| `StochasticUniversalSampling` | SUS with soft selection | ✓ |
+
+### Crossover
+| Operator | Description | Differentiable |
+|----------|-------------|----------------|
+| `SBXCrossover` | Simulated Binary Crossover | ✓ |
+| `BinomialCrossover` | DE-style binomial | ✓ |
+| `ExponentialCrossover` | DE-style exponential | ✓ |
+| `BlendCrossover` | BLX-α crossover | ✓ |
+| `ArithmeticCrossover` | Weighted average | ✓ |
+| `UniformCrossover` | Gene-wise uniform swap | ✓ |
+| `SimulatedBinaryCrossover` | Alias for SBX | ✓ |
+
+### Mutation
+| Operator | Description | Differentiable |
+|----------|-------------|----------------|
+| `PolynomialMutation` | Polynomial bounded mutation | ✓ |
+| `GaussianMutation` | Additive Gaussian noise | ✓ |
+| `UniformMutation` | Uniform random replacement | ✓ |
+| `AdaptiveMutation` | Self-adaptive mutation rates | ✓ |
+
+### Survival
+| Operator | Description |
+|----------|-------------|
+| `MergeSurvival` | (μ+λ) with optional elitism |
+| `ReplacementSurvival` | (μ,λ) generational replacement |
+| `AgingSurvival` | Age-based replacement |
+| `FitnessSurvival` | Pure fitness-based truncation |
+
+### Repair
+| Operator | Description |
+|----------|-------------|
+| `BoundsRepair` | Clamp to bounds |
+| `ReflectionRepair` | Bounce off boundaries |
+| `WrapRepair` | Toroidal wrap-around |
+| `RandomRepair` | Random resampling |
+
+## 🎯 Advanced Usage
+
+### Training Neural Networks with EvoGrad
+
+```python
+import torch
+import torch.nn as nn
+from evograd.algorithms import CMAES
+from evograd.core import Problem
+from evograd.core.termination import MaxEvaluations
+
+
+# Define a simple MLP
+class MLP(nn.Module):
+    def __init__(self):
+        super().__init__()
+        self.net = nn.Sequential(
+            nn.Linear(10, 64),
+            nn.Tanh(),
+            nn.Linear(64, 1),
+        )
+    
+    def forward(self, x):
+        return self.net(x)
+
+# Flatten parameters for optimisation
+model = MLP()
+n_params = sum(p.numel() for p in model.parameters())
+
+def loss_fn(params):
+    # Reshape flat params back to model
+    idx = 0
+    for p in model.parameters():
+        numel = p.numel()
+        p.data.copy_(params[idx:idx+numel].view(p.shape))
+        idx += numel
+    
+    # Compute loss on dummy data
+    x = torch.randn(32, 10)
+    y = torch.randn(32, 1)
+    pred = model(x)
+    return ((pred - y)**2).mean()
+
+# Batch evaluation
+def batch_loss(pop):
+    return torch.stack([loss_fn(p) for p in pop])
+
+problem = Problem(
+    objective=batch_loss,
+    n_var=n_params,
+    xl=-10.0,
+    xu=10.0,
+)
+
+cmaes = CMAES(pop_size=50, sigma=1.0, adaptive=True)
+result = minimize(problem, cmaes, MaxEvaluations(10000))
+print(f"Final loss: {result.best_fitness:.6f}")
+```
+
+### Callbacks for Logging
+
+```python
+from evograd.core import minimize
+from evograd.utils import HistoryCallback, PrintCallback
+
+callbacks = [
+    PrintCallback(every=10),  # Print progress every 10 generations
+    HistoryCallback(),        # Record full history
+]
+
+result = minimize(problem, algorithm, termination=MaxEvaluations(10000), callback=callbacks)
+
+# Access history
+print(f"Fitness over time: {result.history['best_fitness']}")
+```
+
+## 🏗️ Architecture
+
+```
+evograd/
+├── algorithms/
+│   └── cmaes.py          # CMA-ES with IPOP/BIPOP
+│   ├── de.py             # Differential Evolution
+│   ├── ga.py             # Genetic Algorithm
+│   ├── pso.py            # Particle Swarm Optimisation
+├── core/
+│   ├── algorithm.py      # Base Algorithm class
+│   ├── maximize.py       # Optimisation loop (maximisation)
+│   ├── minimize.py       # Optimisation loop (minimisation)
+│   ├── problem.py        # Problem definition
+│   ├── result.py         # Result container
+│   └── termination.py    # Stopping criteria
+├── operators/
+│   ├── crossover.py      # Crossover operators
+│   ├── mutation.py       # Mutation operators
+│   ├── sampling.py       # Sampling operators
+│   ├── selection.py      # Selection operators
+│   ├── survival.py       # Survival/replacement
+│   └── repair.py         # Constraint handling
+└── utils/
+    ├── callbacks.py      # Logging utilities
+    ├── device.py         # Device management
+    └── duplicates.py     # Duplicate elimination
+```
+
+## 🔬 How It Works
+
+EvoGrad makes evolutionary algorithms differentiable through:
+
+1. **Reparameterisation Trick**: Convert random sampling into deterministic transformations of parameter-free noise:
+   ```
+   x = g_θ(ε), ε ~ p(ε)  →  ∇_θ L ≈ ∇_θ f(g_θ(ε))
+   ```
+
+2. **Gumbel-Softmax**: Differentiable approximation for categorical selection:
+   ```python
+   # Soft selection (differentiable)
+   probs = softmax((log_probs + gumbel_noise) / temperature)
+   selected = probs @ population  # Weighted combination
+   ```
+
+3. **Binary-Concrete**: Differentiable approximation for binary masks (mutation/crossover):
+   ```python
+   # Soft mask (differentiable)
+   mask = sigmoid((log(u) - log(1-u) + logits) / temperature)
+   # Straight-through estimator for hard decisions
+   hard_mask = (mask > 0.5).float() - mask.detach() + mask
+   ```
+
+4. **Pathwise Gradients**: For continuous distributions (Gaussian sampling in CMA-ES):
+   ```python
+   # x = μ + σ * L @ z, z ~ N(0, I)
+   z = torch.randn(pop_size, n_var)
+   x = mean + sigma * (L @ z.T).T  # Fully differentiable
+   ```
+
+## 📊 Benchmarks
+
+TODO
+
+## 📖 Citation
+
+TBA
+
+## 📄 License
+
+This project is licensed under the Apache-2.0 License - see the [LICENSE](LICENSE) file for details.
+
+## 🤝 Contributing
+
+Contributions are welcome! Please feel free to submit a Pull Request. For major changes, please open an issue first to discuss what you would like to change.
+
+1. Fork the repository
+2. Create your feature branch (`git checkout -b feature/amazing-feature`)
+3. Commit your changes (`git commit -m 'Add amazing feature'`)
+4. Push to the branch (`git push origin feature/amazing-feature`)
+5. Open a Pull Request
+
+## 🙏 Acknowledgements
+
+- Inspired by [pymoo](https://pymoo.org/) for API design
+- Built with [PyTorch](https://pytorch.org/) for automatic differentiation