You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+13-26Lines changed: 13 additions & 26 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -11,62 +11,52 @@ Whether you are performing **Gradient-Free Neural Network Training** or **Automa
11
11
The library is logically structured into 6 core categories, each reflecting a unique mathematical or biological inspiration. This organization allows researchers to easily compare different families of algorithms.
Train any PyTorch model without using `loss.backward()`. This is ideal for non-differentiable objectives or when exploring global landscapes.
71
61
72
62
```python
@@ -98,7 +88,6 @@ optimizer.step(closure)
98
88
```
99
89
100
90
### 2. Hyperparameter Optimization (HPO)
101
-
102
91
Optimize architectural choices and training parameters (learning rates, layer sizes) using intelligent searchers instead of grid or random search.
103
92
104
93
```python
@@ -139,28 +128,28 @@ Our library has undergone a massive-scale rigorous evaluation of **118 algorithm
139
128
### 1. Model Training Benchmarks (Weight Optimization)
140
129
SwarmTorch enables the training of neural networks without gradients. Our tests on non-linear classification tasks show that several metaheuristics can achieve convergence comparable to standard gradient-based methods.
*Figure 1: Convergence history comparing Swarm Optimizers (PSO, HHO, etc.) against Adam and SGD. Many swarm algorithms exhibit highly stable descent.*
144
133
145
-

134
+

146
135
*Figure 2: The Top 25 most effective weight optimizers ranked by final loss. Hybrid and Swarm Intelligence algorithms show the strongest performance.*
147
136
148
137
### 2. High-Density Distribution Analysis
149
138
We analyzed the reliability of each category. Swarm and Hybrid categories demonstrated the highest stability and lowest variance across multiple trials.
*Figure 4: Success rate of metaheuristic searchers vs. the Random Search baseline. Over 94% of our algorithms outperformed Random Search.*
159
148
160
149
### 4. The "Generalist" Frontier
161
150
By mapping Training Robustness against HPO Accuracy, we identified the most versatile algorithms in the library—those that excel in both weight optimization and hyperparameter tuning.
*Figure 5: Scatter plot mapping Training Efficiency vs. HPO Accuracy. Elite generalist algorithms occupy the top-right quadrant.*
165
154
166
155
---
@@ -179,11 +168,9 @@ By mapping Training Robustness against HPO Accuracy, we identified the most vers
179
168
---
180
169
181
170
## 🤝 Acknowledgments & References
182
-
183
171
This library was developed with reference to the **[pyMetaheuristic](https://github.com/mariosv/pyMetaheuristic)** library. We are grateful for their contributions to the metaheuristic optimization community, which served as a foundational resource for the algorithmic implementations in **SwarmTorch**.
184
172
185
173
## 📝 Citation
186
-
187
174
If you use **SwarmTorch** in your research, please cite it as follows:
0 commit comments