All functions |
|
|---|---|
PCA ordering (PC1) |
|
Construct a csmooth_em object |
|
Construct a smooth_em object from an EM_algorithm fit |
|
Backward greedy feature partition into two orderings (csmoothEM, warm-start only) |
|
Compare posterior position summaries across two histories |
|
Run csmoothEM iterations |
|
Run collapsed-ML csmoothEM iterations (homoskedastic only) |
|
Run SmoothEM for a given number of iterations on a smooth_em object |
|
Fiedler ordering from a kNN graph |
|
Forward greedy feature partition into two orderings (csmoothEM version) |
|
Generalized log-determinant (sum of log positive eigenvalues) |
|
Extract a (u, gamma) block for a given progressive history index |
|
Greedy backward filtering of features for csmoothEM ordering inference |
|
Hello, World! |
|
Cache covariance inverses and log-determinants |
|
Initialize csmoothEM (coordinate-specific SmoothEM) |
|
Initialize GMM parameters using an ordering method |
|
Initialize ordering for csmoothEM (diagonal-variance version) |
|
Initialize SmoothEM (single- or multi-scale) |
|
Landmark Isomap ordering (no vegan; avoids O(n^2) dist matrix) |
|
Krige SmoothEM mean functions from an observed grid to the final grid |
|
Krige/interpolate from observed nodes using a Gaussian precision matrix |
|
Scale random-walk penalty strength to account for grid spacing |
|
Numerically stable log-sum-exp |
|
Prior precision for VAR(1) on K time points (d-dimensional) |
|
Default random initialization for a Gaussian mixture model |
|
Construct a hierarchy of nested grids inside a final grid |
|
Initialization from an ordering vector |
|
Initialization from an ordering vector for csmoothEM |
|
Prior precision for q-th order random walk on a K x K lattice (d-dimensional) |
|
Sparse prior precision for q-th order random walk on a K x K lattice (d-dimensional) |
|
Prior precision for q-th order random walk on K time points (d-dimensional) |
|
Sparse prior precision for q-th order random walk on K time points (d-dimensional) |
|
Match locations on an old grid to indices on a new grid |
|
Choose the best SmoothEM initialization by ELBO |
|
Optimize csmoothEM initialization by comparing multiple methods after a warm start |
|
Run multiple SmoothEM initializations in parallel |
|
Run multiple csmoothEM initializations in parallel and summarize results |
|
Partition features by comparing per-coordinate collapsed scores from two fits |
|
Principal curve ordering |
|
Plot a csmooth_em object |
|
Plot a smooth_em object |
|
Plot data embedding with SmoothEM component means |
|
Plot a 2D embedding with Smooth-EM component means overlaid |
|
Plot change in a single coordinate between two histories |
|
Plot kriged mean curves from mu_full_history |
|
Plot a 2D embedding colored by an ordering vector with EM means overlaid |
|
Print csmooth_em object |
|
Print method for smooth_em objects |
|
Print summary of csmooth_em |
|
Print method for summary.smooth_em objects |
|
Progressive-resolution initialization for SmoothEM via kriging on a final grid |
|
Score a single feature given responsibilities (Gamma) |
|
Score features under a fitted csmooth_em model via per-coordinate collapsed contributions |
|
Simulate a 2D Archimedean spiral (helix-like) with noise |
|
Simulate a 2D "swiss roll" spiral with a 1D latent parameter |
|
Simulate a two-ordering GP dataset (Matern) for feature partitioning |
|
Subset a csmooth_em object by features (columns) |
|
Summary for csmooth_em object |
|
Summary method for smooth_em objects |
|
t-SNE ordering |
|