graph-attention-engine 0.7.25__tar.gz

graph_attention_engine-0.7.25/LICENSE

@@ -0,0 +1,179 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship made available under
+      the License, as indicated by a copyright notice that is included in
+      or attached to the work (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other transformations
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean, as submitted to the Licensor for inclusion
+      in the Work by the copyright owner or by an individual or Legal Entity
+      authorized to submit on behalf of the copyright owner. For the purposes
+      of this definition, "submitted" means any form of electronic, verbal,
+      or written communication sent to the Licensor or its representatives,
+      including but not limited to communication on electronic mailing lists,
+      source code control systems, and issue tracking systems that are managed
+      by, or on behalf of, the Licensor for the purpose of recording and
+      discussing modifications to the Work, but excluding communication that
+      is conspicuously marked or designated in writing by the copyright owner
+      as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any Legal Entity on behalf of
+      whom a Contribution has been received by the Licensor and included
+      within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by the combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a cross-claim
+      or counterclaim in a lawsuit) alleging that the Work or any Derivative
+      Work constitutes direct or contributory patent infringement, then any
+      patent licenses granted to You under this License for that Work shall
+      terminate as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or Derivative
+          Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, You must include a readable copy of the
+          attribution notices contained within such NOTICE file, in
+          at least one of the following places: within a NOTICE text
+          file distributed as part of the Derivative Works; within
+          the Source form or documentation, if provided along with the
+          Derivative Works; or, within a display generated by the
+          Derivative Works, if and wherever such third-party notices
+          normally appear. The contents of the NOTICE file are for
+          informational purposes only and do not modify the License.
+          You may add Your own attribution notices within Derivative
+          Works that You distribute, alongside or in addition to the
+          NOTICE text from the Work, provided that such additional
+          attribution notices cannot be construed as modifying the License.
+
+      You may add Your own license statement for Your modifications and
+      may provide additional grant of rights to use, copy, modify, merge,
+      publish, distribute, sublicense, and/or sell copies of the
+      Contribution, either on its own or as part of the Work.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any conditions of TITLE,
+      NONINFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR
+      PURPOSE. You are solely responsible for determining the
+      appropriateness of using or reproducing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or exemplary damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (even if such Contributor has been advised of the possibility
+      of such damages).
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer, and
+      charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may offer only
+      conditions that are completely consistent with the terms of this
+      License and You indemnify each Contributor for any liability
+      incurred by such Contributor as a result of warranty or additional
+      liability obligations You accept.
+
+   END OF TERMS AND CONDITIONS
+
+   Copyright 2024 Graph Attention Engine Contributors
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

graph_attention_engine-0.7.25/PKG-INFO

@@ -0,0 +1,214 @@
+Metadata-Version: 2.4
+Name: graph-attention-engine
+Version: 0.7.25
+Summary: Standalone numpy-only graph attention library (GAE v5)
+Author-email: Arindam Banerji <banerji.arindam@gmail.com>
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://github.com/ArindamBanerji/graph-attention-engine
+Project-URL: Repository, https://github.com/ArindamBanerji/graph-attention-engine
+Project-URL: Documentation, https://www.dakshineshwari.net
+Classifier: Development Status :: 4 - Beta
+Classifier: Intended Audience :: Developers
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: numpy>=1.24
+Provides-Extra: dev
+Requires-Dist: pytest>=7.4; extra == "dev"
+Requires-Dist: pytest-asyncio>=0.23; extra == "dev"
+Dynamic: license-file
+
+# Graph Attention Engine (GAE)
+
+Graph Attention Engine is a standalone, NumPy-only scoring engine that implements Cross-Graph Attention for domain-independent decision systems. It is pure Python and requires no database, network access, or event loop. GAE is licensed under Apache 2.0.
+
+## Install
+
+Install the published package:
+
+```bash
+pip install graph-attention-engine
+```
+
+For editable development installs:
+
+```bash
+pip install -e ".[dev]"
+```
+
+## Quick Start
+
+### Scaled dot-product attention
+
+```python
+import numpy as np
+from gae import scaled_dot_product_attention
+
+rng = np.random.default_rng(7)
+Q = rng.normal(size=(4, 8))
+K = rng.normal(size=(6, 8))
+V = rng.normal(size=(6, 16))
+
+out, weights = scaled_dot_product_attention(Q, K, V)
+
+assert out.shape == (4, 16)
+assert weights.shape == (4, 6)
+```
+
+### Profile scoring
+
+`ProfileScorer` compares a factor vector with category-specific action centroids. The convenience factory accepts named categories and actions:
+
+```python
+import numpy as np
+from gae import ProfileScorer, build_profile_scorer
+
+categories = ["routine", "critical"]
+actions = ["accept", "review", "escalate"]
+
+# Shape: (2 categories, 3 actions, 4 factors)
+mu = np.array(
+    [
+        [
+            [0.2, 0.2, 0.1, 0.2],
+            [0.5, 0.4, 0.5, 0.4],
+            [0.8, 0.8, 0.9, 0.8],
+        ],
+        [
+            [0.1, 0.2, 0.2, 0.1],
+            [0.5, 0.6, 0.5, 0.6],
+            [0.9, 0.9, 0.8, 0.9],
+        ],
+    ],
+    dtype=np.float64,
+)
+
+centroids = {
+    category: {
+        action: mu[category_index, action_index].tolist()
+        for action_index, action in enumerate(actions)
+    }
+    for category_index, category in enumerate(categories)
+}
+
+scorer: ProfileScorer = build_profile_scorer(
+    categories=categories,
+    actions=actions,
+    centroids=centroids,
+    n_factors=4,
+)
+result = scorer.score(np.array([0.85, 0.90, 0.80, 0.90]), category_index=1)
+
+print(result.action_index)
+print(result.confidence)
+print(result.probabilities)
+```
+
+The returned `ScoringResult` contains the recommended `action_index`, `action_name`, calibrated `confidence`, full `probabilities`, distances, entropy, and confidence gap.
+
+## Core API
+
+### Core Scoring
+
+| API | Description |
+|---|---|
+| `ProfileScorer` | Scores factor vectors against category and action centroids. |
+| `ScoringResult` | Contains the recommendation, confidence, probabilities, and diagnostics. |
+| `KernelType` | Selects the distance kernel used for scoring. |
+| `build_profile_scorer` | Builds a scorer from named categories, actions, and centroid mappings. |
+
+### Oracle
+
+| API | Description |
+|---|---|
+| `OracleProvider` | Protocol for producing independent ground-truth outcomes. |
+| `GTAlignedOracle` | Returns outcomes aligned with supplied ground truth. |
+| `BernoulliOracle` | Samples deterministic-seeded Bernoulli outcomes. |
+
+### Evaluation
+
+| API | Description |
+|---|---|
+| `EvaluationScenario` | Defines one scored evaluation case and expected action. |
+| `compute_ece` | Computes expected calibration error. |
+| `run_evaluation` | Evaluates a scorer across a scenario collection. |
+
+### Judgment
+
+| API | Description |
+|---|---|
+| `compute_judgment` | Converts a scoring result into an explained judgment. |
+| `CONFIDENCE_HIGH` | Threshold for high-confidence judgments. |
+| `CONFIDENCE_MEDIUM` | Threshold for medium-confidence judgments. |
+
+### Calibration
+
+| API | Description |
+|---|---|
+| `CalibrationProfile` | Holds scoring and learning calibration parameters. |
+| `compute_theta_min` | Computes the deployment-aware conservation threshold. |
+
+### Primitives
+
+| API | Description |
+|---|---|
+| `scaled_dot_product_attention` | Computes scaled dot-product attention and its weights. |
+| `softmax` | Computes a numerically stable probability distribution. |
+
+### Learning
+
+| API | Description |
+|---|---|
+| `LearningState` | Tracks centroids and learning metadata. |
+| `WeightUpdate` | Describes a validated learning update. |
+
+### Convergence
+
+| API | Description |
+|---|---|
+| `get_convergence_metrics` | Reports centroid movement and convergence diagnostics. |
+
+### Kernels
+
+| API | Description |
+|---|---|
+| `L2Kernel` | Computes standard squared Euclidean distance. |
+| `DiagonalKernel` | Applies per-factor diagonal weights. |
+| `CovarianceEstimator` | Estimates covariance for adaptive distance calculations. |
+| `KernelSelector` | Recommends a kernel from observed data properties. |
+
+### Persistence
+
+| API | Description |
+|---|---|
+| `save_state` | Saves learning state to JSON. |
+| `load_state` | Loads learning state from JSON. |
+
+The complete public export list is available in [`gae/__init__.py`](gae/__init__.py).
+
+## Conservation Law
+
+GAE checks the constraint `alpha * q * V >= theta_min`, combining category coverage (`alpha`), observed quality (`q`), and verified volume (`V`). Meeting the threshold provides the operational guarantee that evidence is sufficient to maintain accuracy above the configured boundary; use [`compute_theta_min`](#calibration) to derive the deployment-aware threshold.
+
+## Testing
+
+```bash
+pytest tests/ -v
+```
+
+The current suite contains 1,244 passing tests.
+
+## Documentation
+
+- [Authoritative design document](docs/design/gae_design_v10_8.md)
+- [Cross-Graph Attention mathematical foundation](https://www.dakshineshwari.net/post/cross-graph-attention-mathematical-foundation-with-experimental-validation)
+- [Dakshineshwari](https://www.dakshineshwari.net)
+
+## License
+
+Apache 2.0. See the [LICENSE](LICENSE) file.

graph_attention_engine-0.7.25/README.md

@@ -0,0 +1,189 @@
+# Graph Attention Engine (GAE)
+
+Graph Attention Engine is a standalone, NumPy-only scoring engine that implements Cross-Graph Attention for domain-independent decision systems. It is pure Python and requires no database, network access, or event loop. GAE is licensed under Apache 2.0.
+
+## Install
+
+Install the published package:
+
+```bash
+pip install graph-attention-engine
+```
+
+For editable development installs:
+
+```bash
+pip install -e ".[dev]"
+```
+
+## Quick Start
+
+### Scaled dot-product attention
+
+```python
+import numpy as np
+from gae import scaled_dot_product_attention
+
+rng = np.random.default_rng(7)
+Q = rng.normal(size=(4, 8))
+K = rng.normal(size=(6, 8))
+V = rng.normal(size=(6, 16))
+
+out, weights = scaled_dot_product_attention(Q, K, V)
+
+assert out.shape == (4, 16)
+assert weights.shape == (4, 6)
+```
+
+### Profile scoring
+
+`ProfileScorer` compares a factor vector with category-specific action centroids. The convenience factory accepts named categories and actions:
+
+```python
+import numpy as np
+from gae import ProfileScorer, build_profile_scorer
+
+categories = ["routine", "critical"]
+actions = ["accept", "review", "escalate"]
+
+# Shape: (2 categories, 3 actions, 4 factors)
+mu = np.array(
+    [
+        [
+            [0.2, 0.2, 0.1, 0.2],
+            [0.5, 0.4, 0.5, 0.4],
+            [0.8, 0.8, 0.9, 0.8],
+        ],
+        [
+            [0.1, 0.2, 0.2, 0.1],
+            [0.5, 0.6, 0.5, 0.6],
+            [0.9, 0.9, 0.8, 0.9],
+        ],
+    ],
+    dtype=np.float64,
+)
+
+centroids = {
+    category: {
+        action: mu[category_index, action_index].tolist()
+        for action_index, action in enumerate(actions)
+    }
+    for category_index, category in enumerate(categories)
+}
+
+scorer: ProfileScorer = build_profile_scorer(
+    categories=categories,
+    actions=actions,
+    centroids=centroids,
+    n_factors=4,
+)
+result = scorer.score(np.array([0.85, 0.90, 0.80, 0.90]), category_index=1)
+
+print(result.action_index)
+print(result.confidence)
+print(result.probabilities)
+```
+
+The returned `ScoringResult` contains the recommended `action_index`, `action_name`, calibrated `confidence`, full `probabilities`, distances, entropy, and confidence gap.
+
+## Core API
+
+### Core Scoring
+
+| API | Description |
+|---|---|
+| `ProfileScorer` | Scores factor vectors against category and action centroids. |
+| `ScoringResult` | Contains the recommendation, confidence, probabilities, and diagnostics. |
+| `KernelType` | Selects the distance kernel used for scoring. |
+| `build_profile_scorer` | Builds a scorer from named categories, actions, and centroid mappings. |
+
+### Oracle
+
+| API | Description |
+|---|---|
+| `OracleProvider` | Protocol for producing independent ground-truth outcomes. |
+| `GTAlignedOracle` | Returns outcomes aligned with supplied ground truth. |
+| `BernoulliOracle` | Samples deterministic-seeded Bernoulli outcomes. |
+
+### Evaluation
+
+| API | Description |
+|---|---|
+| `EvaluationScenario` | Defines one scored evaluation case and expected action. |
+| `compute_ece` | Computes expected calibration error. |
+| `run_evaluation` | Evaluates a scorer across a scenario collection. |
+
+### Judgment
+
+| API | Description |
+|---|---|
+| `compute_judgment` | Converts a scoring result into an explained judgment. |
+| `CONFIDENCE_HIGH` | Threshold for high-confidence judgments. |
+| `CONFIDENCE_MEDIUM` | Threshold for medium-confidence judgments. |
+
+### Calibration
+
+| API | Description |
+|---|---|
+| `CalibrationProfile` | Holds scoring and learning calibration parameters. |
+| `compute_theta_min` | Computes the deployment-aware conservation threshold. |
+
+### Primitives
+
+| API | Description |
+|---|---|
+| `scaled_dot_product_attention` | Computes scaled dot-product attention and its weights. |
+| `softmax` | Computes a numerically stable probability distribution. |
+
+### Learning
+
+| API | Description |
+|---|---|
+| `LearningState` | Tracks centroids and learning metadata. |
+| `WeightUpdate` | Describes a validated learning update. |
+
+### Convergence
+
+| API | Description |
+|---|---|
+| `get_convergence_metrics` | Reports centroid movement and convergence diagnostics. |
+
+### Kernels
+
+| API | Description |
+|---|---|
+| `L2Kernel` | Computes standard squared Euclidean distance. |
+| `DiagonalKernel` | Applies per-factor diagonal weights. |
+| `CovarianceEstimator` | Estimates covariance for adaptive distance calculations. |
+| `KernelSelector` | Recommends a kernel from observed data properties. |
+
+### Persistence
+
+| API | Description |
+|---|---|
+| `save_state` | Saves learning state to JSON. |
+| `load_state` | Loads learning state from JSON. |
+
+The complete public export list is available in [`gae/__init__.py`](gae/__init__.py).
+
+## Conservation Law
+
+GAE checks the constraint `alpha * q * V >= theta_min`, combining category coverage (`alpha`), observed quality (`q`), and verified volume (`V`). Meeting the threshold provides the operational guarantee that evidence is sufficient to maintain accuracy above the configured boundary; use [`compute_theta_min`](#calibration) to derive the deployment-aware threshold.
+
+## Testing
+
+```bash
+pytest tests/ -v
+```
+
+The current suite contains 1,244 passing tests.
+
+## Documentation
+
+- [Authoritative design document](docs/design/gae_design_v10_8.md)
+- [Cross-Graph Attention mathematical foundation](https://www.dakshineshwari.net/post/cross-graph-attention-mathematical-foundation-with-experimental-validation)
+- [Dakshineshwari](https://www.dakshineshwari.net)
+
+## License
+
+Apache 2.0. See the [LICENSE](LICENSE) file.