redsho 0.1.0__tar.gz

redsho-0.1.0/.gitignore

@@ -0,0 +1,219 @@
+# ---> Python
+# Byte-compiled / optimized / DLL files
+__pycache__/
+*.py[codz]
+*$py.class
+
+# C extensions
+*.so
+
+# Distribution / packaging
+.Python
+build/
+develop-eggs/
+dist/
+downloads/
+eggs/
+.eggs/
+lib/
+lib64/
+parts/
+sdist/
+var/
+wheels/
+share/python-wheels/
+*.egg-info/
+.installed.cfg
+*.egg
+MANIFEST
+
+# PyInstaller
+#   Usually these files are written by a python script from a template
+#   before PyInstaller builds the exe, so as to inject date/other infos into it.
+*.manifest
+*.spec
+
+# Installer logs
+pip-log.txt
+pip-delete-this-directory.txt
+
+# Unit test / coverage reports
+htmlcov/
+.tox/
+.nox/
+.coverage
+.coverage.*
+.cache
+nosetests.xml
+coverage.xml
+*.cover
+*.py.cover
+.hypothesis/
+.pytest_cache/
+cover/
+
+# Translations
+*.mo
+*.pot
+
+# Django stuff:
+*.log
+local_settings.py
+db.sqlite3
+db.sqlite3-journal
+
+# Flask stuff:
+instance/
+.webassets-cache
+
+# Scrapy stuff:
+.scrapy
+
+# Sphinx documentation
+docs/_build/
+
+# PyBuilder
+.pybuilder/
+target/
+
+# Jupyter Notebook
+.ipynb_checkpoints
+
+# IPython
+profile_default/
+ipython_config.py
+
+# pyenv
+#   For a library or package, you might want to ignore these files since the code is
+#   intended to run in multiple environments; otherwise, check them in:
+# .python-version
+
+# pipenv
+#   According to pypa/pipenv#598, it is recommended to include Pipfile.lock in version control.
+#   However, in case of collaboration, if having platform-specific dependencies or dependencies
+#   having no cross-platform support, pipenv may install dependencies that don't work, or not
+#   install all needed dependencies.
+# Pipfile.lock
+
+# UV
+#   Similar to Pipfile.lock, it is generally recommended to include uv.lock in version control.
+#   This is especially recommended for binary packages to ensure reproducibility, and is more
+#   commonly ignored for libraries.
+# uv.lock
+
+# poetry
+#   Similar to Pipfile.lock, it is generally recommended to include poetry.lock in version control.
+#   This is especially recommended for binary packages to ensure reproducibility, and is more
+#   commonly ignored for libraries.
+#   https://python-poetry.org/docs/basic-usage/#commit-your-poetrylock-file-to-version-control
+# poetry.lock
+# poetry.toml
+
+# pdm
+#   Similar to Pipfile.lock, it is generally recommended to include pdm.lock in version control.
+#   pdm recommends including project-wide configuration in pdm.toml, but excluding .pdm-python.
+#   https://pdm-project.org/en/latest/usage/project/#working-with-version-control
+# pdm.lock
+# pdm.toml
+.pdm-python
+.pdm-build/
+
+# pixi
+#   Similar to Pipfile.lock, it is generally recommended to include pixi.lock in version control.
+# pixi.lock
+#   Pixi creates a virtual environment in the .pixi directory, just like venv module creates one
+#   in the .venv directory. It is recommended not to include this directory in version control.
+.pixi
+
+# PEP 582; used by e.g. github.com/David-OConnor/pyflow and github.com/pdm-project/pdm
+__pypackages__/
+
+# Celery stuff
+celerybeat-schedule
+celerybeat.pid
+
+# Redis
+*.rdb
+*.aof
+*.pid
+
+# RabbitMQ
+mnesia/
+rabbitmq/
+rabbitmq-data/
+
+# ActiveMQ
+activemq-data/
+
+# SageMath parsed files
+*.sage.py
+
+# Environments
+.env
+.envrc
+.venv
+env/
+venv/
+ENV/
+env.bak/
+venv.bak/
+
+# Spyder project settings
+.spyderproject
+.spyproject
+
+# Rope project settings
+.ropeproject
+
+# mkdocs documentation
+/site
+
+# mypy
+.mypy_cache/
+.dmypy.json
+dmypy.json
+
+# Pyre type checker
+.pyre/
+
+# pytype static type analyzer
+.pytype/
+
+# Cython debug symbols
+cython_debug/
+
+# PyCharm
+#   JetBrains specific template is maintained in a separate JetBrains.gitignore that can
+#   be found at https://github.com/github/gitignore/blob/main/Global/JetBrains.gitignore
+#   and can be added to the global gitignore or merged into this file.  For a more nuclear
+#   option (not recommended) you can uncomment the following to ignore the entire idea folder.
+# .idea/
+
+# Abstra
+#   Abstra is an AI-powered process automation framework.
+#   Ignore directories containing user credentials, local state, and settings.
+#   Learn more at https://abstra.io/docs
+.abstra/
+
+# Visual Studio Code
+#   Visual Studio Code specific template is maintained in a separate VisualStudioCode.gitignore 
+#   that can be found at https://github.com/github/gitignore/blob/main/Global/VisualStudioCode.gitignore
+#   and can be added to the global gitignore or merged into this file. However, if you prefer, 
+#   you could uncomment the following to ignore the entire vscode folder
+# .vscode/
+
+# Ruff stuff:
+.ruff_cache/
+
+# PyPI configuration file
+.pypirc
+
+# Marimo
+marimo/_static/
+marimo/_lsp/
+__marimo__/
+
+# Streamlit
+.streamlit/secrets.toml
+
+reports/

redsho-0.1.0/.python-version

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

redsho-0.1.0/LICENSE

@@ -0,0 +1,18 @@
+MIT License
+
+Copyright (c) 2026 brohrer
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
+associated documentation files (the "Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the
+following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial
+portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
+LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO
+EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
+USE OR OTHER DEALINGS IN THE SOFTWARE.

redsho-0.1.0/PKG-INFO

@@ -0,0 +1,67 @@
+Metadata-Version: 2.5
+Name: redsho
+Version: 0.1.0
+Summary: robust evolutionary direction set hyperparameter optimizer
+Author-email: Brandon Rohrer <brohrer@gmail.com>
+License-Expression: MIT
+License-File: LICENSE
+Requires-Python: >=3.12
+Requires-Dist: matplotlib>=3.11.1
+Requires-Dist: numpy>=2.5.2
+Description-Content-Type: text/markdown
+
+# redsho
+
+Robust Evolutionary Direction Set Hyperparameter Optimizer
+
+It's a discrete optimizer, which means that it works with parameters that can
+only take on a certain set of values. This works well for evaluating neural
+networks and other large and complex models, since it takes so long to
+train and test them, and since the hyperparameters can have non-intuitive,
+strongly non-linear, and interactive effects.
+
+
+![REDSHO animated](/redsho/landing_page_demo.gif)
+
+REDSHO (pictured in action above), an evolutionary search algorithm variant
+inspired by direction set methods like 
+[Powell's method](https://en.wikipedia.org/wiki/Powell%27s_method), so much
+so that it was originally called Evolutionary Powell's method .
+Here is [a detailed description of how it works](https://brohrer.github.io/evopowell.html).
+As far as I know this method is novel and has not previously been published.
+Please let me know if you've seen something like it before.
+
+## Installation
+
+Clone the repository to your local machine and install it from there.
+
+```bash
+git clone https://codeberg.org/brohrer/redsho.git
+python3 -m pip install -e redsho
+```
+
+## Run the demo
+
+```bash
+python3
+```
+```python3
+>>> import redsho.demo
+```
+
+## Parallelization
+
+REDSHO can seamlessly take advantage of multiple processor systems.
+Instead of 
+
+```python
+import redsho.redsho
+```
+
+try
+
+```python
+import redsho.redsho_parallel
+```
+
+It automatically recuits all your processors but one to do its bidding.

redsho-0.1.0/README.md

@@ -0,0 +1,55 @@
+# redsho
+
+Robust Evolutionary Direction Set Hyperparameter Optimizer
+
+It's a discrete optimizer, which means that it works with parameters that can
+only take on a certain set of values. This works well for evaluating neural
+networks and other large and complex models, since it takes so long to
+train and test them, and since the hyperparameters can have non-intuitive,
+strongly non-linear, and interactive effects.
+
+
+![REDSHO animated](/redsho/landing_page_demo.gif)
+
+REDSHO (pictured in action above), an evolutionary search algorithm variant
+inspired by direction set methods like 
+[Powell's method](https://en.wikipedia.org/wiki/Powell%27s_method), so much
+so that it was originally called Evolutionary Powell's method .
+Here is [a detailed description of how it works](https://brohrer.github.io/evopowell.html).
+As far as I know this method is novel and has not previously been published.
+Please let me know if you've seen something like it before.
+
+## Installation
+
+Clone the repository to your local machine and install it from there.
+
+```bash
+git clone https://codeberg.org/brohrer/redsho.git
+python3 -m pip install -e redsho
+```
+
+## Run the demo
+
+```bash
+python3
+```
+```python3
+>>> import redsho.demo
+```
+
+## Parallelization
+
+REDSHO can seamlessly take advantage of multiple processor systems.
+Instead of 
+
+```python
+import redsho.redsho
+```
+
+try
+
+```python
+import redsho.redsho_parallel
+```
+
+It automatically recuits all your processors but one to do its bidding.

redsho-0.1.0/pyproject.toml

@@ -0,0 +1,27 @@
+[project]
+name = "redsho"
+version = "0.1.0"
+description = "robust evolutionary direction set hyperparameter optimizer"
+readme = "README.md"
+authors = [
+    { name = "Brandon Rohrer", email = "brohrer@gmail.com" }
+]
+license = "MIT"
+requires-python = ">=3.12"
+dependencies = [
+    "matplotlib>=3.11.1",
+    "numpy>=2.5.2",
+]
+
+[build-system]
+requires = ["hatchling"]
+build-backend = "hatchling.build"
+
+
+[dependency-groups]
+dev = [
+    "pytest>=9.1.1",
+]
+
+[tool.ruff]
+line-length = 80

redsho-0.1.0/src/redsho/demo.py

@@ -0,0 +1,149 @@
+import matplotlib.pyplot as plt
+import numpy as np
+import toolbox as tb
+from matplotlib import cm
+
+from redsho.optimizer import Redsho
+
+plt.switch_backend("agg")
+
+
+def main():
+    # Define your conditions - your discrete search space - by creating
+    # a dictionary of key, value pairs
+    # where each key is a parameter name, and each value
+    # is the list of values that parameter can take.
+    # Those values can be any object: numbers or strings, lists or dicts,
+    # even functions of classes.
+    conditions = {
+        "x": list(np.linspace(0, np.pi, 10)),
+        "y": list(np.linspace(0, np.pi, 10)),
+    }
+
+    # Choose your optimization algorithm and run its optimize() method.
+    optimizer = Redsho(verbose=False)
+    _, _, results_logfile = optimizer.optimize(evaluate, conditions)
+
+    print(
+        "All done! The data on each condition evaluated, and its error\n"
+        + f"are stored in {results_logfile}."
+    )
+
+    # Optionally, when you're done you can turn the results into an image.
+    visualize(results_logfile)
+
+
+def evaluate(x=0, y=0):
+    """
+    The objective function is a 2D variant of the sinc function.
+    """
+    x0 = 1
+    y0 = 1.5
+    return -np.sinc(x - x0) * np.sinc(y - y0)
+
+
+def visualize(results_logfile):
+    """
+    The error is multiplied by -1 here, so that it looks like the
+    algorithm is trying to climb the mountain, rather than find its
+    way to the bottom of a well. It's easier to visualize well and
+    a bit more cheerful.
+    """
+    results = tb.results_csv_to_dict_list(results_logfile)
+    x = []
+    y = []
+    z = []
+    best_so_far = []
+    bsf = 1e-10
+    for result in results:
+        x.append(float(result["x"]))
+        y.append(float(result["y"]))
+        zval = -1 * float(result["error"])
+        z.append(zval)
+        bsf = max(bsf, zval)
+        best_so_far.append(bsf)
+
+    fig = plt.figure()
+
+    # The upper left plot shows a 3D surface of the objective function.
+    ax_surf = fig.add_subplot(221, projection="3d")
+    x_all_hi = np.linspace(0, np.pi, 100)
+    y_all_hi = np.linspace(0, np.pi, 100)
+    X, Y = np.meshgrid(x_all_hi, y_all_hi)
+    Z = -1 * evaluate(x=X, y=Y)
+
+    ax_surf.plot_surface(
+        X, Y, Z, cmap=cm.inferno, linewidth=0, antialiased=False
+    )
+    ax_surf.set_xlabel("x")
+    ax_surf.set_ylabel("y")
+    ax_surf.set_xlim(0, np.pi)
+    ax_surf.set_ylim(0, np.pi)
+    ax_surf.set_zlim(-0.2, 1)
+
+    # The upper right plot shows a 3D representation of the points
+    # in the search space that were evaluated.
+    ax_eval = fig.add_subplot(222, projection="3d")
+    ax_eval.scatter(
+        x,
+        y,
+        z,
+        c=z,
+        cmap=cm.inferno,
+        vmax=1,
+        vmin=-0.2,
+        s=10,
+    )
+
+    for i in range(len(x)):
+        ax_eval.plot(
+            [x[i], x[i]],
+            [y[i], y[i]],
+            [z[i], 0],
+            linewidth=0.5,
+            color="blue",
+        )
+    ax_eval.set_xlabel("x")
+    ax_eval.set_ylabel("y")
+    ax_eval.set_xlim(0, np.pi)
+    ax_eval.set_ylim(0, np.pi)
+    ax_eval.set_zlim(-0.2, 1)
+
+    # The lower left function shows the best error score found so far as
+    # more points are evaluated.
+    ax_bsf = fig.add_subplot(223)
+    ax_bsf.plot(
+        np.arange(len(best_so_far)) + 1,
+        best_so_far,
+        color="blue",
+    )
+    ax_bsf.set_xlabel("Points evaluated")
+    ax_bsf.set_ylabel("Best value so far")
+    ax_bsf.set_xlim(0, len(best_so_far) + 1)
+    ax_bsf.set_ylim(-0.01, 1.01)
+
+    # A 2D version of the plot in the upper right, showing the points
+    # evaluated so far and the error associated with them.
+    ax_cover = fig.add_subplot(224)
+    ax_cover.scatter(
+        x,
+        y,
+        c=z,
+        vmax=1,
+        vmin=-0.2,
+        cmap=cm.inferno,
+        s=20,
+    )
+    ax_cover.set_xlabel("x")
+    ax_cover.set_ylabel("y")
+    ax_cover.set_xlim(-0.1, np.pi + 0.1)
+    ax_cover.set_ylim(-0.1, np.pi + 0.1)
+
+    viz_file = "demo_visualization.png"
+    fig.savefig(viz_file, dpi=300)
+    plt.close()
+
+    print(f"There's also a 3D visualization of it in {viz_file}.")
+
+
+main()