All Classes and Interfaces

Class
Description
An implementation of the AdaDelta gradient optimiser.
An implementation of the AdaGrad gradient optimiser.
An implementation of the AdaGrad gradient optimiser with regularized dual averaging.
An implementation of the Adam gradient optimiser.
Cosine similarity used as a distance measure.
A dense matrix, backed by a primitive array.
The output of a successful Cholesky factorization.
The output of a successful eigen decomposition.
The output of a successful LU factorization.
A matrix which is dense in the first dimension and sparse in the second.
A dense vector, backed by a double array.
Interface for distance functions.
The built-in distance functions.
Normalizes the exponential values of the input array.
A Parameters for models which make a single prediction like logistic regressions and neural networks.
CLI options for configuring a gradient optimiser.
Type of the gradient optimisers available in CLIs.
Merges each SparseVector separately using a PriorityQueue as a heap.
A k-d tree nearest neighbour query implementation.
A factory which creates k-d tree nearest neighbour query objects.
An interface for a Mercer kernel function.
L1 (or Manhattan) distance.
L2 (or Euclidean) distance.
A linear kernel, u.dot(v).
A Parameters for producing linear models.
Interface for 2 dimensional Tensors.
Interface for matrix factorizations.
Merges each DenseSparseMatrix using a PriorityQueue as a heap on the MatrixIterator.
A mutable tuple used to avoid allocation when iterating a matrix.
An interface for merging an array of DenseSparseMatrix into a single DenseSparseMatrix.
A class for sampling from multivariate normal distributions.
A brute-force nearest neighbour query implementation.
A factory which creates brute-force nearest neighbour query objects.
An interface for nearest neighbour query objects.
An interface for factories which create nearest neighbour query objects.
These are the supported neighbour query implementations.
NoopNormalizer returns a copy in NoopNormalizer.normalize(double[]) and is a no-op in place.
Normalizes, but first subtracts the minimum value (to ensure positivity).
Tribuo Math specific helper functions for building ONNX protos.
Averages the parameters across a gradient run.
An interface to a Tensor[] array which accepts updates to the parameters.
An implementation of the Pegasos gradient optimiser used primarily for solving the SVM problem.
A polynomial kernel, (gamma*u.dot(v) + intercept)^degree.
A Radial Basis Function (RBF) kernel, exp(-gamma*|u-v|^2).
An implementation of the RMSProp gradient optimiser.
An implementation of single learning rate SGD and optionally momentum.
Momentum types.
Interface for 1 dimensional Tensors.
A subclass of DenseMatrix which shrinks the value every time a new value is added.
An interface which tags a Tensor with a convertToDense method.
A subclass of DenseVector which shrinks the value every time a new value is added.
A sigmoid kernel, tanh(gamma*u.dot(v) + intercept).
Normalizes the input by applying a logistic sigmoid to each element.
A sparse vector.
Interface for gradient based optimisation methods.
An interface for Tensors, currently Vectors and Matrices.
A functional interface that generates a normalized version of a double array.
A mutable tuple used to avoid allocation when iterating a vector.