@pikaa-ai/pikaa 0.3.23 → 0.3.25

package/skills/pymc/SKILL.md

@@ -1,310 +0,0 @@
----
-name: pymc
-description: Bayesian modeling with PyMC. Build hierarchical models, MCMC (NUTS), variational inference, LOO/WAIC comparison, posterior checks, for probabilistic programming and inference.
-allowed-tools: Read Write Edit Bash
-compatibility: Requires Python 3.12+ and PyMC 6.0.1-compatible dependencies. Install reproducible environments with `uv pip install "pymc[nutpie]==6.0.1"`; optional NumPyro or BlackJAX samplers require separately pinned JAX-compatible dependencies.
-license: Apache License, Version 2.0
-metadata:
-  version: "1.3"
-  skill-author: K-Dense Inc.
----
-
-# PyMC Bayesian Modeling
-
-## Overview
-
-PyMC is a Python library for Bayesian modeling and probabilistic programming. Build, fit, validate, and compare Bayesian models using PyMC's modern API (version 6.x+), including hierarchical models, MCMC sampling (NUTS), variational inference, posterior predictive checks, and model comparison (LOO, WAIC).
-
-## Current Version and Setup
-
-PyMC 6.0.1 is the current stable release as of June 2026. It requires Python 3.12+, uses PyTensor 3 as the computational graph backend, and defaults to compiled backends such as Numba. For reproducible local environments, pin the version:
-
-```bash
-uv pip install "pymc[nutpie]==6.0.1"
-```
-
-The `nutpie` extra enables the faster Rust/Numba NUTS implementation. If using NumPyro or BlackJAX, install those optional sampler dependencies in the same environment and pin them in the project lockfile.
-
-## When to Use This Skill
-
-This skill should be used when:
-- Building Bayesian models (linear/logistic regression, hierarchical models, time series, etc.)
-- Performing MCMC sampling or variational inference
-- Conducting prior/posterior predictive checks
-- Diagnosing sampling issues (divergences, convergence, ESS)
-- Comparing multiple models using information criteria (LOO, WAIC)
-- Implementing uncertainty quantification through Bayesian methods
-- Working with hierarchical/multilevel data structures
-- Handling missing data or measurement error in a principled way
-
-## Standard Bayesian Workflow
-
-Never sample first and check later. The eight-step workflow — documented with code in
-[references/standard_workflow.md](references/standard_workflow.md) — is:
-
-1. **Data preparation** — including standardizing predictors so priors are interpretable.
-2. **Model building** — priors and likelihood in a `pm.Model` context.
-3. **Prior predictive check** — confirm the priors imply plausible data *before* fitting.
-4. **Fit model** — `pm.sample()` with an explicit seed.
-5. **Check diagnostics** — R-hat, ESS, divergences. Divergences invalidate the fit; fix
-   the model or reparameterize rather than raising `target_accept` and hoping.
-6. **Posterior predictive check** — does the fitted model reproduce the observed data?
-7. **Analyze results** — summaries and intervals from the posterior.
-8. **Make predictions** — on new data via `pm.set_data` and posterior predictive sampling.
-
-Reusable model structures and model comparison are in
-[references/model_patterns.md](references/model_patterns.md).
-
-## Distribution Selection Guide
-
-### For Priors
-
-**Scale parameters** (σ, τ):
-- `pm.HalfNormal('sigma', sigma=1)` - Default choice
-- `pm.Exponential('sigma', lam=1)` - Alternative
-- `pm.Gamma('sigma', alpha=2, beta=1)` - More informative
-
-**Unbounded parameters**:
-- `pm.Normal('theta', mu=0, sigma=1)` - For standardized data
-- `pm.StudentT('theta', nu=3, mu=0, sigma=1)` - Robust to outliers
-
-**Positive parameters**:
-- `pm.LogNormal('theta', mu=0, sigma=1)`
-- `pm.Gamma('theta', alpha=2, beta=1)`
-
-**Probabilities**:
-- `pm.Beta('p', alpha=2, beta=2)` - Weakly informative
-- `pm.Uniform('p', lower=0, upper=1)` - Non-informative (use sparingly)
-
-**Correlation matrices**:
-- `pm.LKJCholeskyCov('chol', n=n_vars, eta=2, sd_dist=pm.HalfNormal.dist(1))` - Preferred covariance prior
-- `pm.LKJCorr('corr', n=n_vars, eta=2)` - Correlation-only prior; eta=1 uniform, eta>1 prefers identity
-
-### For Likelihoods
-
-**Continuous outcomes**:
-- `pm.Normal('y', mu=mu, sigma=sigma)` - Default for continuous data
-- `pm.StudentT('y', nu=nu, mu=mu, sigma=sigma)` - Robust to outliers
-
-**Count data**:
-- `pm.Poisson('y', mu=lambda)` - Equidispersed counts
-- `pm.NegativeBinomial('y', mu=mu, alpha=alpha)` - Overdispersed counts
-- `pm.ZeroInflatedPoisson('y', psi=psi, mu=mu)` - Excess zeros
-- `pm.HurdleNegativeBinomial('y', psi=psi, mu=mu, alpha=alpha)` - Excess zeros plus overdispersion
-
-**Binary outcomes**:
-- `pm.Bernoulli('y', p=p)` or `pm.Bernoulli('y', logit_p=logit_p)`
-
-**Categorical outcomes**:
-- `pm.Categorical('y', p=probs)`
-
-**See:** `references/distributions.md` for comprehensive distribution reference
-
-## Sampling and Inference
-
-### MCMC with NUTS
-
-Default and recommended for most models:
-
-```python
-idata = pm.sample(
-    draws=2000,
-    tune=1000,
-    chains=4,
-    target_accept=0.9,
-    random_seed=42
-)
-```
-
-**Adjust when needed:**
-- Divergences → `target_accept=0.95` or higher
-- Slow sampling → Use ADVI for initialization
-- Discrete parameters → Use `pm.Metropolis()` for discrete vars
-
-### Variational Inference
-
-Fast approximation for exploration or initialization:
-
-```python
-with model:
-    approx = pm.fit(n=20000, method='advi')
-
-    # Use for initialization
-    initvals = approx.sample(return_inferencedata=False)[0]
-    idata = pm.sample(initvals=initvals)
-```
-
-**Trade-offs:**
-- Much faster than MCMC
-- Approximate (may underestimate uncertainty)
-- Good for large models or quick exploration
-
-**See:** `references/sampling_inference.md` for detailed sampling guide
-
-## Diagnostic Scripts
-
-### Comprehensive Diagnostics
-
-```python
-from scripts.model_diagnostics import create_diagnostic_report
-
-create_diagnostic_report(
-    idata,
-    var_names=['alpha', 'beta', 'sigma'],
-    output_dir='diagnostics/'
-)
-```
-
-Creates:
-- Trace plots
-- Rank plots (mixing check)
-- Autocorrelation plots
-- Energy plots
-- Local ESS plots
-- Summary statistics CSV
-
-### Quick Diagnostic Check
-
-```python
-from scripts.model_diagnostics import check_diagnostics
-
-results = check_diagnostics(idata)
-```
-
-Checks R-hat, ESS, divergences, and tree depth.
-
-## Common Issues and Solutions
-
-### Divergences
-
-**Symptom:** `idata.sample_stats.diverging.sum() > 0`
-
-**Solutions:**
-1. Increase `target_accept=0.95` or `0.99`
-2. Use non-centered parameterization (hierarchical models)
-3. Add stronger priors to constrain parameters
-4. Check for model misspecification
-
-### Low Effective Sample Size
-
-**Symptom:** `ESS < 400`
-
-**Solutions:**
-1. Sample more draws: `draws=5000`
-2. Reparameterize to reduce posterior correlation
-3. Use QR decomposition for regression with correlated predictors
-
-### High R-hat
-
-**Symptom:** `R-hat > 1.01`
-
-**Solutions:**
-1. Run longer chains: `tune=2000, draws=5000`
-2. Check for multimodality
-3. Improve initialization with ADVI
-
-### Slow Sampling
-
-**Solutions:**
-1. Use ADVI initialization
-2. Reduce model complexity
-3. Increase parallelization: `cores=8, chains=8`
-4. Use variational inference if appropriate
-
-## Best Practices
-
-### Model Building
-
-1. **Always standardize predictors** for better sampling
-2. **Use weakly informative priors** (not flat)
-3. **Use named dimensions** (`dims`) for clarity
-4. **Non-centered parameterization** for hierarchical models
-5. **Check prior predictive** before fitting
-
-### Sampling
-
-1. **Run multiple chains** (at least 4) for convergence
-2. **Use `target_accept=0.9`** as baseline (higher if needed)
-3. **Include `log_likelihood=True`** for model comparison
-4. **Set random seed** for reproducibility
-
-### Validation
-
-1. **Check diagnostics** before interpretation (R-hat, ESS, divergences)
-2. **Posterior predictive check** for model validation
-3. **Compare multiple models** when appropriate
-4. **Report uncertainty** (HDI intervals, not just point estimates)
-
-### Workflow
-
-1. Start simple, add complexity gradually
-2. Prior predictive check → Fit → Diagnostics → Posterior predictive check
-3. Iterate on model specification based on checks
-4. Document assumptions and prior choices
-
-## Resources
-
-This skill includes:
-
-### References (`references/`)
-
-- **`distributions.md`**: Comprehensive catalog of PyMC distributions organized by category (continuous, discrete, multivariate, mixture, time series). Use when selecting priors or likelihoods.
-
-- **`sampling_inference.md`**: Detailed guide to sampling algorithms (NUTS, Metropolis, SMC), variational inference (ADVI, SVGD), and handling sampling issues. Use when encountering convergence problems or choosing inference methods.
-
-- **`workflows.md`**: Complete workflow examples and code patterns for common model types, data preparation, prior selection, and model validation. Use as a cookbook for standard Bayesian analyses.
-
-### Scripts (`scripts/`)
-
-- **`model_diagnostics.py`**: Automated diagnostic checking and report generation. Functions: `check_diagnostics()` for quick checks, `create_diagnostic_report()` for comprehensive analysis with plots.
-
-- **`model_comparison.py`**: Model comparison utilities built on PSIS-LOO ELPD, the only criterion ArviZ 1.x `compare()` ranks on. Functions: `compare_models()`, `check_loo_reliability()`, `model_averaging()`.
-
-### Templates (`assets/`)
-
-- **`linear_regression_template.py`**: Complete template for Bayesian linear regression with full workflow (data prep, prior checks, fitting, diagnostics, predictions).
-
-- **`hierarchical_model_template.py`**: Complete template for hierarchical/multilevel models with non-centered parameterization and group-level analysis.
-
-## Quick Reference
-
-### Model Building
-```python
-with pm.Model(coords={'var': names}) as model:
-    # Priors
-    param = pm.Normal('param', mu=0, sigma=1, dims='var')
-    # Likelihood
-    y = pm.Normal('y', mu=..., sigma=..., observed=data)
-```
-
-### Sampling
-```python
-idata = pm.sample(draws=2000, tune=1000, chains=4, target_accept=0.9)
-```
-
-### Diagnostics
-```python
-from scripts.model_diagnostics import check_diagnostics
-check_diagnostics(idata)
-```
-
-### Model Comparison
-```python
-from scripts.model_comparison import compare_models
-compare_models({'m1': idata1, 'm2': idata2}, ic='loo')
-```
-
-### Predictions
-```python
-with model:
-    pm.set_data({'X_data': X_new})
-    pred = pm.sample_posterior_predictive(idata, predictions=True)
-```
-
-## Additional Notes
-
-- PyMC integrates with ArviZ for visualization and diagnostics; PyMC 6 / ArviZ 1 use xarray `DataTree` while retaining familiar groups such as `.posterior` and `.posterior_predictive`
-- Use `pm.model_to_graphviz(model)` to visualize model structure
-- Save results with `idata.to_netcdf('results.nc')`
-- Load with `az.from_netcdf('results.nc')`
-- For very large models, consider minibatch ADVI or data subsampling

package/skills/pymoo/SKILL.md

@@ -1,276 +0,0 @@
----
-name: pymoo
-description: Multi-objective optimization framework. NSGA-II, NSGA-III, MOEA/D, Pareto fronts, constraint handling, benchmarks (ZDT, DTLZ), for engineering design and optimization problems.
-license: Apache-2.0 license
-allowed-tools: Read Write Edit Bash
-compatibility: Requires Python 3.10+ and pymoo (uv pip install). Optional matplotlib for visualization plots; optional autograd for gradient-based features; optional joblib for JoblibParallelization.
-metadata:
-  version: "1.3"
-  skill-author: K-Dense Inc.
----
-
-# Pymoo - Multi-Objective Optimization in Python
-
-## Overview
-
-Pymoo is a comprehensive Python framework for optimization with emphasis on multi-objective problems. Solve single and multi-objective optimization using state-of-the-art algorithms (NSGA-II/III, MOEA/D, SPEA2), benchmark problems (ZDT, DTLZ), customizable genetic operators, and multi-criteria decision making methods. Excels at finding trade-off solutions (Pareto fronts) for problems with conflicting objectives. Current stable release: **pymoo 0.6.1.6** (November 2025).
-
-## Installation
-
-```bash
-uv pip install pymoo
-```
-
-For reproducible environments, pin a version: `uv pip install "pymoo==0.6.1.6"`.
-
-**Dependencies:** NumPy (2.x compatible since 0.6.1.3), SciPy, matplotlib (visualization). Autograd is optional for gradient-based features (since 0.6.1.3).
-
-**Documentation:** https://pymoo.org/ — LLM-friendly index: https://pymoo.org/llms.txt
-
-## When to Use This Skill
-
-This skill should be used when:
-- Solving optimization problems with one or multiple objectives
-- Finding Pareto-optimal solutions and analyzing trade-offs
-- Implementing evolutionary algorithms (GA, DE, PSO, NSGA-II/III)
-- Working with constrained optimization problems
-- Benchmarking algorithms on standard test problems (ZDT, DTLZ, WFG)
-- Customizing genetic operators (crossover, mutation, selection)
-- Visualizing high-dimensional optimization results
-- Making decisions from multiple competing solutions
-- Handling binary, discrete, continuous, or mixed-variable problems
-
-## Core Concepts
-
-### The Unified Interface
-
-Pymoo uses a consistent `minimize()` function for all optimization tasks:
-
-```python
-from pymoo.optimize import minimize
-
-result = minimize(
-    problem,        # What to optimize
-    algorithm,      # How to optimize
-    termination,    # When to stop
-    seed=1,
-    verbose=True
-)
-```
-
-**Result object contains:**
-- `result.X`: Decision variables of optimal solution(s)
-- `result.F`: Objective values of optimal solution(s)
-- `result.G`: Constraint violations (if constrained)
-- `result.algorithm`: Algorithm object with history
-
-### Problem Definition Styles
-
-Pymoo supports three problem definition styles:
-
-- **`Problem`**: Vectorized — `_evaluate` receives a batch of solutions (matrix)
-- **`ElementwiseProblem`**: One solution per call — recommended for custom problems and parallel evaluation
-- **`FunctionalProblem`**: Define objectives and constraints as separate functions without subclassing
-
-### Problem Types
-
-**Single-objective:** One objective to minimize/maximize
-**Multi-objective:** 2-3 conflicting objectives → Pareto front
-**Many-objective:** 4+ objectives → High-dimensional Pareto front
-**Constrained:** Objectives + inequality/equality constraints
-**Mixed-variable:** Continuous, integer, binary, and categorical variables in one problem
-**Dynamic:** Time-varying objectives or constraints
-
-## Quick Start Workflows
-
-Nine runnable workflows are in
-[references/quick_start_workflows.md](references/quick_start_workflows.md):
-
-| # | Workflow | Use when |
-| --- | --- | --- |
-| 1 | Single-objective optimization | one objective, GA or DE |
-| 2 | Multi-objective (2-3 objectives) | NSGA-II and a Pareto front |
-| 3 | Many-objective (4+ objectives) | NSGA-III or reference-direction methods |
-| 4 | Custom problem definition | subclassing `Problem` / `ElementwiseProblem` |
-| 5 | Constraint handling | inequality and equality constraints |
-| 6 | Decision making from a Pareto front | scalarization and MCDM selection |
-| 7 | Visualization | scatter, PCP, radviz, and heatmap views |
-| 8 | Parallel evaluation | threads, processes, or Dask for expensive objectives |
-| 9 | Mixed-variable optimization | integer, binary, and categorical variables |
-
-## Algorithm Selection Guide
-
-### Single-Objective Problems
-
-| Algorithm | Best For | Key Features |
-|-----------|----------|--------------|
-| **GA** | General-purpose | Flexible, customizable operators |
-| **DE** | Continuous optimization | Good global search |
-| **PSO** | Smooth landscapes | Fast convergence |
-| **CMA-ES** | Difficult/noisy problems | Self-adapting |
-
-### Multi-Objective Problems (2-3 objectives)
-
-| Algorithm | Best For | Key Features |
-|-----------|----------|--------------|
-| **NSGA-II** | Standard benchmark | Fast, reliable, well-tested |
-| **SPEA2** | Archive-based MOO | Strength-based fitness, external archive |
-| **R-NSGA-II** | Preference regions | Reference point guidance |
-| **MOEA/D** | Decomposable problems | Scalarization approach |
-
-### Many-Objective Problems (4+ objectives)
-
-| Algorithm | Best For | Key Features |
-|-----------|----------|--------------|
-| **NSGA-III** | 4-15 objectives | Reference direction-based |
-| **RVEA** | Adaptive search | Reference vector evolution |
-| **AGE-MOEA** | Complex landscapes | Adaptive geometry |
-
-### Constrained Problems
-
-| Approach | Algorithm | When to Use |
-|----------|-----------|-------------|
-| Feasibility-first | Any algorithm | Large feasible region |
-| Specialized | SRES, ISRES | Heavy constraints |
-| Penalty | GA + penalty | Algorithm compatibility |
-
-**See:** `references/algorithms.md` for comprehensive algorithm reference
-
-## Benchmark Problems
-
-### Quick problem access:
-```python
-from pymoo.problems import get_problem
-
-# Single-objective
-problem = get_problem("rastrigin", n_var=10)
-problem = get_problem("rosenbrock", n_var=10)
-
-# Multi-objective
-problem = get_problem("zdt1")        # Convex front
-problem = get_problem("zdt2")        # Non-convex front
-problem = get_problem("zdt3")        # Disconnected front
-
-# Many-objective
-problem = get_problem("dtlz2", n_obj=5, n_var=12)
-problem = get_problem("dtlz7", n_obj=4)
-```
-
-**See:** `references/problems.md` for complete test problem reference
-
-## Genetic Operator Customization
-
-### Standard operator configuration:
-```python
-from pymoo.algorithms.soo.nonconvex.ga import GA
-from pymoo.operators.crossover.sbx import SBX
-from pymoo.operators.mutation.pm import PM
-
-algorithm = GA(
-    pop_size=100,
-    crossover=SBX(prob=0.9, eta=15),
-    mutation=PM(eta=20),
-    eliminate_duplicates=True
-)
-```
-
-### Operator selection by variable type:
-
-**Continuous variables:**
-- Crossover: SBX (Simulated Binary Crossover)
-- Mutation: PM (Polynomial Mutation)
-
-**Binary variables:**
-- Crossover: TwoPointCrossover, UniformCrossover
-- Mutation: BitflipMutation
-
-**Permutations (TSP, scheduling):**
-- Crossover: OrderCrossover (OX)
-- Mutation: InversionMutation
-
-**See:** `references/operators.md` for comprehensive operator reference
-
-## Performance and Troubleshooting
-
-### Common issues and solutions:
-
-**Problem: Algorithm not converging**
-- Increase population size
-- Increase number of generations
-- Check if problem is multimodal (try different algorithms)
-- Verify constraints are correctly formulated
-
-**Problem: Poor Pareto front distribution**
-- For NSGA-III: Adjust reference directions
-- Increase population size
-- Check for duplicate elimination
-- Verify problem scaling
-
-**Problem: Few feasible solutions**
-- Use constraint-as-objective approach
-- Apply repair operators
-- Try SRES/ISRES for constrained problems
-- Check constraint formulation (should be g <= 0)
-
-**Problem: High computational cost**
-- Reduce population size
-- Decrease number of generations
-- Use simpler operators
-- Enable parallel evaluation via `elementwise_runner` (see Workflow 8)
-
-### Best practices:
-
-1. **Normalize objectives** when scales differ significantly
-2. **Set random seed** for reproducibility
-3. **Save history** to analyze convergence: `save_history=True`
-4. **Visualize results** to understand solution quality
-5. **Compare with true Pareto front** when available
-6. **Use appropriate termination criteria** (generations, evaluations, tolerance)
-7. **Tune operator parameters** for problem characteristics
-
-## Resources
-
-This skill includes comprehensive reference documentation and executable examples:
-
-### references/
-Detailed documentation for in-depth understanding:
-
-- **algorithms.md**: Complete algorithm reference with parameters, usage, and selection guidelines
-- **problems.md**: Benchmark test problems (ZDT, DTLZ, WFG) with characteristics
-- **operators.md**: Genetic operators (sampling, selection, crossover, mutation) with configuration
-- **visualization.md**: All visualization types with examples and selection guide
-- **constraints_mcdm.md**: Constraint handling techniques and multi-criteria decision making methods
-- **parallelization.md**: Parallel evaluation with StarmapParallelization and JoblibParallelization
-
-**Search patterns for references:**
-- Algorithm details: `grep -r "NSGA-II\|NSGA-III\|MOEA/D" references/`
-- Constraint methods: `grep -r "Feasibility First\|Penalty\|Repair" references/`
-- Visualization types: `grep -r "Scatter\|PCP\|Petal" references/`
-
-### scripts/
-Executable examples demonstrating common workflows:
-
-- **single_objective_example.py**: Basic single-objective optimization with GA
-- **multi_objective_example.py**: Multi-objective optimization with NSGA-II, visualization
-- **many_objective_example.py**: Many-objective optimization with NSGA-III, reference directions
-- **custom_problem_example.py**: Defining custom problems (constrained and unconstrained)
-- **decision_making_example.py**: Multi-criteria decision making with different preferences
-
-**Run examples:**
-```bash
-python3 scripts/single_objective_example.py
-python3 scripts/multi_objective_example.py
-python3 scripts/many_objective_example.py
-python3 scripts/custom_problem_example.py
-python3 scripts/decision_making_example.py
-```
-
-## Additional Notes
-
-**Common patterns:**
-- Use `ElementwiseProblem` for custom problems (or `FunctionalProblem` for function-based definitions)
-- Use `vars` dict with typed variables for mixed-variable problems
-- Constraints formulated as `g(x) <= 0` and `h(x) = 0`
-- Reference directions required for NSGA-III
-- Normalize objectives before MCDM
-- Use appropriate termination: `('n_gen', N)` or `get_termination("f_tol", tol=0.001)`