Skip to content
This repository was archived by the owner on Jun 25, 2026. It is now read-only.
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
19 changes: 19 additions & 0 deletions docs/_includes/mathjax.html
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
<script>
MathJax = {
tex: {
inlineMath: [
["$", "$"],
["\\(", "\\)"],
],
displayMath: [
["$$", "$$"],
["\\[", "\\]"],
],
},
};
</script>

<script
src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js"
defer
></script>
2 changes: 2 additions & 0 deletions docs/functions/gradient_labyrinth.md
Original file line number Diff line number Diff line change
Expand Up @@ -25,3 +25,5 @@ The function is composed of four distinct layers:
* **Ill-Conditioning:** The ratio between the steepness of the walls and the slope of the floor is massive.
* **Parameter Coupling:** Due to rotation, movement in $x$ requires a precise compensatory movement in $y$ to stay in the valley.
* **Local Traps:** The floor is not smooth; optimizers must have enough energy (momentum) to hop over ridges but enough damping to stop at the global minimum.

{% include mathjax.html %}
2 changes: 2 additions & 0 deletions docs/functions/neural_canyon.md
Original file line number Diff line number Diff line change
Expand Up @@ -23,3 +23,5 @@ The function combines three terms:
* **Manifold Navigation:** The optimizer must follow the curved $\tanh$ path.
* **Vanishing Gradients:** Far from the center, the $\tanh$ curve is flat, providing very little gradient information about direction.
* **Noise Tolerance:** The landscape is "rough." Algorithms without adaptive learning rates or momentum may settle in local minima surrounding the global solution.

{% include mathjax.html %}
2 changes: 2 additions & 0 deletions docs/functions/quantum_well.md
Original file line number Diff line number Diff line change
Expand Up @@ -23,3 +23,5 @@ The function creates a "Cluster" of minima:
* **Deceptive Gradient:** At the start (far from center), the gradient looks like a simple convex problem.
* **Precision Docking:** As the optimizer nears $(0,0)$, it enters a field of deep local minima. It must find the specific hole at the origin, which is surrounded by nearly identical (but suboptimal) neighbors.
* **Barrier Crossing:** Escaping a local minimum near the center requires climbing high barriers relative to the local gradient.

{% include mathjax.html %}
Loading