tpmjs/packages/tools/official/logistic-regression
Ajax Davis 5926373be6 chore: update ai package to 6.0.49 across all packages
- Updated all packages from ai@6.0.23 to ai@6.0.49
- Added pnpm override to ensure consistent version
- Created changeset for publishing affected packages
2026-01-25 11:33:03 +10:00
..
src feat: add 100+ official TPMJS tools 2025-12-31 22:55:56 +10:00
CHANGELOG.md chore: version packages 2025-12-31 23:54:47 +10:00
package.json chore: update ai package to 6.0.49 across all packages 2026-01-25 11:33:03 +10:00
README.md feat: add 100+ official TPMJS tools 2025-12-31 22:55:56 +10:00
tsconfig.json feat: add 100+ official TPMJS tools 2025-12-31 22:55:56 +10:00
tsup.config.ts feat: add 100+ official TPMJS tools 2025-12-31 22:55:56 +10:00

Logistic Regression Tool

Simple binary logistic regression implementation using gradient descent optimization.

Installation

npm install @tpmjs/tools-logistic-regression

Usage

import { logisticRegressionTool } from '@tpmjs/tools-logistic-regression';

// Example: Predict binary outcome from features
const result = await logisticRegressionTool.execute({
  x: [
    [1.0, 2.0],
    [2.0, 3.0],
    [3.0, 4.0],
    [4.0, 5.0],
  ],
  y: [0, 0, 1, 1],
  iterations: 1000,
});

console.log(result);
// {
//   coefficients: [0.5, 0.3, -0.2], // [intercept, feature1, feature2]
//   predictions: [0, 0, 1, 1],
//   accuracy: 1.0,
//   iterations: 1000,
//   convergence: {
//     finalLoss: 0.123,
//     converged: true
//   }
// }

API

Input

  • x (required): Feature matrix number[][] where each row is a sample
  • y (required): Binary labels number[] (must be 0 or 1)
  • iterations (optional): Number of gradient descent iterations (default: 1000)
  • learningRate (optional): Learning rate (default: 0.1)

Output

  • coefficients: Model weights including intercept
  • predictions: Binary predictions for each sample
  • accuracy: Classification accuracy (0 to 1)
  • iterations: Number of iterations performed
  • convergence: Loss and convergence status

Algorithm

Uses gradient descent to minimize binary cross-entropy loss:

  1. Initialize coefficients to zero
  2. For each iteration:
    • Calculate predictions using sigmoid function
    • Compute gradient of loss function
    • Update coefficients: θ = θ - α∇L
  3. Return fitted model

The sigmoid function maps linear combinations to probabilities [0, 1].

License

MIT