cargo
Rust package manager (36 subcommands).
Information geometry for Bayesian inference. Fisher-Rao metric on statistical manifolds, Riemannian optimization for model selection, Wasserstein geodesics connecting geomstats to Gromov-Wasserstein optimal transport.
Full skill instructions
The natural metric on probability distributions is the Fisher-Rao metric
Information geometry connecting geomstats to Bayesian inference and optimal transport.
origin/main
22 notebooks in plurigrid's geomstats fork spanning:
<<<<<<< HEAD The Fisher-Rao metric is the unique Riemannian metric (up to scale) that is invariant under sufficient statistics. This means:
MonadDistribution m => FisherRao (distribution m)
score/factor call in monad-bayes implicitly moves along a geodesic
on the Fisher-Rao manifold. The MCMC acceptance ratio is the exponential map.The Fisher-Rao metric is the unique Riemannian metric (up to scale) invariant under sufficient statistics:
origin/main
-- Natural gradient MCMC on Fisher-Rao manifold
naturalGradientStep :: MonadMeasure m => SPDMatrix -> m Parameters
naturalGradientStep fisherInfo = do
currentParams <- get
proposal <- mvNormal currentParams (inverse fisherInfo)
let logRatio = logLikelihood proposal - logLikelihood currentParams
accept <- bernoulli (min 1 (exp logRatio))
if accept then return proposal else return currentParams
<<<<<<< HEAD
geomstats <-> plurigrid/ontology:GW via optimal transport:
| Component | Trit | Role |
|---|---|---|
| geomstats computation | +1 | Generation (geometric objects) |
| Fisher-Rao metric | 0 | Coordination (natural metric) |
| Wasserstein validation | -1 | Validation (distance bounds) |
Conservation: +1 + 0 + (-1) = 0
=======
Every score/factor call in monad-bayes implicitly moves along a geodesic on the Fisher-Rao manifold. The MCMC acceptance ratio is the exponential map.
geomstats connects to Gromov-Wasserstein optimal transport:
pip install geomstats
# geomstats pulls in numpy, scipy, matplotlib
# Clone the plurigrid fork (already present locally):
git clone [email protected]:plurigrid/geomstats.git
# Upstream:
# git clone [email protected]:geomstats/geomstats.git
Local fork path: /Users/alice/v/worlds/g/geomstats
| # | Topic | Path |
|---|---|---|
| 00 | Introduction to geomstats | notebooks/00_foundations__introduction_to_geomstats.ipynb |
| 02 | Connection & Riemannian metric | notebooks/02_foundations__connection_riemannian_metric.ipynb |
| 08 | Information geometry (Fisher-Rao) | notebooks/08_practical_methods__information_geometry.ipynb |
| 12 | EMG classification on SPD manifold | notebooks/12_real_world_applications__emg_sign_classification_in_spd_manifold.ipynb |
| 13 | Graph embedding in hyperbolic space | notebooks/13_real_world_applications__graph_embedding_and_clustering_in_hyperbolic_space.ipynb |
| 20 | Graph space (Frechet mean) | notebooks/20_real_world_applications__graph_space.ipynb |
| 21 | Heisenberg group geometry | notebooks/21_foundations__sub_riemannian_geometry_and_the_heisenberg_group.ipynb |
All notebooks at: /Users/alice/v/worlds/g/geomstats/notebooks/
#!/usr/bin/env python3
"""
Compute Fisher-Rao geodesic distance between two univariate normal
distributions on the statistical manifold.
The Fisher information matrix for N(mu, sigma^2) is:
g = diag(1/sigma^2, 2/sigma^2)
The Fisher-Rao distance between N(mu1,s1^2) and N(mu2,s2^2) is the
geodesic distance on the upper half-plane with this metric.
Run:
python3 fisher_rao_demo.py
"""
import geomstats.backend as gs
gs.random.seed(42)
from geomstats.information_geometry.normal import NormalDistributions
# The statistical manifold of univariate normals
manifold = NormalDistributions()
# Two distributions: N(0, 1) and N(3, 2)
# Parameters are [mu, sigma] (NOT sigma^2)
p = gs.array([0.0, 1.0]) # N(0, 1)
q = gs.array([3.0, 2.0]) # N(3, 2)
# Fisher-Rao geodesic distance
dist = manifold.metric.dist(p, q)
print(f"Fisher-Rao distance between N(0,1) and N(3,2): {float(dist):.6f}")
# Geodesic curve (10 points from p to q on the statistical manifold)
geodesic_fn = manifold.metric.geodesic(initial_point=p, end_point=q)
t = gs.linspace(0.0, 1.0, 10)
geodesic_points = geodesic_fn(t)
print(f"\nGeodesic path (mu, sigma) from N(0,1) → N(3,2):")
for i, pt in enumerate(geodesic_points):
print(f" t={float(t[i]):.1f}: N({float(pt[0]):.3f}, {float(pt[1]):.3f})")
# Fisher information matrix at a point
fim = manifold.metric.metric_matrix(p)
print(f"\nFisher information matrix at N(0,1):\n{fim}")
from geomstats.geometry.spd_matrices import SPDMatrices
import geomstats.backend as gs
spd = SPDMatrices(n=3)
A = spd.random_point()
B = spd.random_point()
d = spd.metric.dist(A, B)
print(f"Affine-invariant distance between two 3x3 SPD matrices: {float(d):.4f}")
| Path | Description |
|---|---|
/Users/alice/v/worlds/g/geomstats/ | Plurigrid fork of geomstats |
notebooks/08_practical_methods__information_geometry.ipynb | Fisher-Rao notebook |
geomstats/information_geometry/normal.py | NormalDistributions manifold implementation |
geomstats/geometry/spd_matrices.py | SPD matrices with affine-invariant metric |
origin/main
Rust package manager (36 subcommands).
Translate Figma nodes into production-ready code with 1:1 visual fidelity using the Figma MCP workflow (design context, screenshots, assets, and project-convention translation). Trigger when the user provides Figma URLs or node IDs, or asks to implement designs or components that must match Figma...
**Status**: 🌳 Production Ready (upstream in StringZilla v3+) **Type**: High-Performance String Operations / SIMD-Accelerated Text Processing **Principle**: Zero-copy views, SIMD/SWAR acceleration, deterministic hashing **Frame**: Cross-language interoperability (C, C++, Python, Rust, Go, Swift, ...
Conformal Geometric Algebra (CGA) for circles, spheres, and Möbius transformations
Verifies code implements exactly what documentation specifies for blockchain audits. Use when comparing code against whitepapers, finding gaps between specs and implementation, or performing compliance checks for protocol implementations.
Systems programming and performance optimization using Zig. Provides low-level abstractions, memory-safe compiled code, and performance benchmarking. Use for system-level operations, optimization, and interoperability with C/POSIX APIs.
Topological soliton detection and agency bridge with anyonic fusion algebra for concept composition
PayPal MCP server integration for invoices, payments, subscriptions, disputes, and transaction reporting via @paypal/mcp.
Unison language - content-addressed functional programming with abilities for effects, distributed computing, and structural types. Use for pure functional code, effect management, distributed systems, and refactoring-safe codebases.
Google Tasks management via TasksACSet. Transforms task operations into GF(3)-typed Interactions, routes to triadic queues, detects saturation for task-zero-as-condensed-state.
World C Skill
Syrup binary serialization for OCapN/CapTP wire format. Canonical encoding for capability messages.
Generate, edit, and beat-sync AI video with leading models in one workspace.
The world's fastest calendar for remote work
Transform Your Design with AI Designer by ImgCreator.ai
Revolutionizing Video Production with AI-Powered Creativity
Extend an image past the frame and let AI fill the new aspect ratio.
Discover your celebrity doppelgänger with StarByFace!
ChainClarity explains 700+ crypto whitepapers in plain English, with layered summaries, comparisons, research tools, alerts, and a $4.99 Pro plan.
Opus.ai: Revolutionize Your Web Experience