betaFeedback

WorksComputer Science

Shaped by What's Missing: Topological Invariance Simplification Discovers Behavioral Transitions

Abstract

Understanding how animals move between behaviors is a central question in neuroethology, yet most segmentation methods first partition time into discrete states, leaving transitions as the unmodeled residue between them. We take the opposite view: in a suitable feature space, sustained behaviors are dense regions of the trajectory's density landscape, and transitions are the sparse corridors and loops that connect them. Because this structure is a property of the landscape's shape rather than of any particular coordinates, it can be read off directly with topology and should persist across feature spaces. We build this landscape from frame-by-frame trajectories, extract its discrete-Morse graph, and keep two kinds of structure: paths, the corridors a trajectory follows between dense behavioral regions, and cycles, closed routes whose entry and exit take different ways. Clustering these structures yields transitions directly, with no upstream state partition. On a rat behavior dataset across three feature spaces, including the latent space of a neural-network controller that imitates the animal in a physics simulator, the approach recovers transitions at coverage comparable to state-space and topological-clustering baselines, while carrying substantially more information about the transition identity, forming clusters at least as tight as the baselines', and matching annotated transitions with less reliance on time-warping. More broadly, the results show that behavioral transitions are a topological feature of a representation: recoverable from the shape of its trajectories, and consistent across distinct feature spaces.

Editors: List of editors’ names

Website: https://kbian.org/TopoMimic-website/

Code: https://github.com/KevinBian107/TopoMIMIC

© 2026 K. Bian, E.J. Leonardis, Y. Yang, C. Zhang, Y. Wang & T.D. Pereira.

Introduction

How animals orchestrate transitions between behavioral modes (such as walking to rearing) is a central challenge in neuroethology, especially when the behavior is diverse. Transitions happen at many time scales, yet existing tools describe them only at macro resolution, because they treat a transition as downstream of a coarse-graining applied to the raw trajectory. An autoregressive HMM or a switching linear dynamical system (SLDS) [31, 30, 15] assigns each frame a syllable and summarizes transitions as a matrix over syllables. A variational autoencoder [16] partitions a latent embedding and treats transitions as switches between partitions. Mapper [23, 22] builds a cluster graph over overlapping density patches and reads transitions off its topology. The coarse-graining always happens first, so a transition is inherited from the state assignment rather than from the trajectory, and how the body reconfigures frame by frame is lost before any analysis is run.

Deep reinforcement learning imitation policies expand this toolkit by emulating behavior in a physics simulator that reproduces recorded motion trajectories [18, 1, 32]. In MIMIC-MJX [32] (Figure 4), inverse kinematics was performed on 3D pose recordings of freely behaving rats to produce joint angles (qpos) and serve as an imitation target. Then an encoder maps a short qpos reference window into a latent intention iti_t, and a decoder combines iti_t with proprioception to produce a biomechanically realistic action. Latent intentions and joint angles are control-relevant spaces that we utilize to study how behaviors transition, in comparison with the egocentric positions of body parts (keypoints) for contrast.

The MIMIC-MJX pipeline that produces the trajectories analyzed here

Figure 4. The MIMIC-MJX pipeline that produces the trajectories analyzed here ([32]). (A) 3D markerless motion capture is fit by inverse kinematics to a biomechanical model, and a deep-RL policy is trained to imitate the resulting joint trajectories. (B) The encoder maps a short reference trajectory st:t+5rs^{r}_{t:t+5} into a low-dimensional latent intention iti_t under Gaussian and AR(1) regularization, and the decoder combines iti_t with the proprioceptive state sts_t to produce a biomechanically realistic action ata_t.

We extract transition structure directly from the raw trajectory, applying discrete-Morse graph reconstruction [7, 17, 29] to the density-weighted trajectory point cloud and recover the one-dimensional skeleton of its density terrain (Figure 3A shows the canonical road-network example). Two primitives live on this skeleton (Figure 3B): DM-paths, the corridors between dense behavioral regions, and DM-cycles, the loops left when a behavior’s entry and exit arms occupy distinct routes. These are feature-level objects where one trajectory yields several primitives containing behavior segments. Our contributions are two fold: (i) We define these primitives and a Wasserstein clustering over them, a transition-centric representation needing no upstream state partition. (ii) We evaluate our method on a rat behavioral dataset in three feature spaces against Keypoint-MoSeq and Mapper baselines, showing its advantage lies in transition information, internal consistency, and agreement with ground truth behavior labels.

Discrete-Morse skeletonization and the two primitives

Figure 3. Discrete-Morse skeletonization and the two primitives. (A) Skeletonization intuition: a near-uniform point cloud sampled around a hidden graph induces a density terrain, and the discrete-Morse reconstruction recovers the hidden graph (red) as the ridges of that terrain, the road-network intuition of § 3.2. (B) The two DM primitives on one synthetic skeleton (a split tree plus one loop): the DM-cycle is the H1H_1 loop, and the DM-paths are the split-tree persistence pairs, each an up-fork leaf-to-saddle corridor (green, red), together with the essential global-max-to-global-min pair (blue). The skeleton is exactly the DM-cycle together with the DM-paths.

Related Work

Unsupervised discovery of behavioral structure from pose data has been approached through autoregressive HMMs (MoSeq) [31], discriminative classifiers on pose features (B-SOiD) [15], variational autoencoders on temporal segments (VAME) [16], and keypoint-conditioned AR-HMM/SLDS (Keypoint-MoSeq) [30]; all segment trajectories into discrete syllables and treat transitions as instantaneous switches, describing them at the resolution set upstream by clustering or syllable assignment. Topology has also been increasingly applied to neuroscience, including persistent-homology analyses of neural manifolds [12] (Carlsson 2009) Rybakken et al., [21] and Mapper-based characterization of transition structure in neural dynamics [23, 22]. The discrete-Morse graph reconstruction we build on [11, 6, 13, 20, 24, 29, 7, 17] has itself been applied to segmenting neuroanatomical volumes [2], and we give a more detailed account of it in Appendix § 8.§ 1; deep RL agents controlling simulated bodies have separately been analyzed as virtual model organisms [18, 1], but without examining topological structure. All of these analyze neural activity manifolds, whereas we apply TDA to behavioral manifolds, where topological features are transition routes rather than tuning curves; § 5 benchmarks both the segmentation and Mapper families against DM-primitives.

Background

Animal behavior emulation in simulation

In MIMIC-MJX [32], markerless motion capture is retargeted onto a biomechanical model in a physics simulator [27] and a reinforcement learning policy is trained to imitate the resulting kinematics (Figure 4A). At each step the encoder maps a short joint angle reference window st:t+5refs^{\mathrm{ref}}_{t:t+5} to a latent intention iti_t under Gaussian and AR(1) regularization. The decoder then combines it with the proprioceptive state sts_t to emit an action ata_t (Figure 4B). Crucially iti_t represents latent action rather than posture: it encodes the change the policy applies to reach the next reference joint angle pose.

We work in three representations at increasing levels of abstraction (details in Appendix § 8.§ 2): egocentric keypoints (ekp, R60\mathbb{R}^{60}), the 20 keypoint 3-D positions in a body-fixed frame; joint angles (qpos, R67\mathbb{R}^{67}), with the 7-dim global root pose removed; and intention (R16\mathbb{R}^{16}), the learned latent, drift-invariant by construction. These describe, respectively, where the body is, how it is posed, and what change drives it toward the next pose.

Discrete-Morse based graph skeletonization (DM-G)

Here we provide the intuition behind the discrete-Morse based graph skeletonization framework; Appendix § 8.§ 1 gives the full account, illustrated in Figure 3A. We introduce it through the road-network reconstruction problem of Wang et al. [29], which is the setting the method was developed for and the easiest place to see what the construction recovers.

There a density field derived from the locations of many cars concentrates around a hidden road network, but the data are noisy and the sampling non-uniform, so the network cannot simply be read off by thresholding (similar to the behavior case). Let f:Rd→Rf:\mathbb{R}^{d}\to\mathbb{R} denote that density field. Viewing ff as a terrain, the hidden roads are its mountain ridges, captured formally by the 11-stable manifolds of ff: the integral lines that connect local maxima to saddles. These curves connect density peaks through saddle points, separating low-density basins, and their union forms a graph that we take as the hidden skeleton.

These 1-stable manifolds are differential objects and can be hard and noisy to estimate in the discrete setting, especially in higher dimensional spaces. Following Dey et al. [7], one instead works with discrete Morse theory [11], a combinatorial analog of Morse theory over cell (and therefore simplicial) complexes, which admits a simple combinatorial strategy for reducing the topological complexity of a discrete Morse function and thereby simplifying the resulting 1-stable manifolds. Persistent homology (Edelsbrunner and Harer, [9]; Dey and Wang, [8]) is used to guide that simplification, so that only “important” topological features are preserved. We build on this formulation and on its extension to high-dimensional point-cloud data (Magee and Wang, [17]).

Methods

Our input is a collection of recorded rat behavior trajectories, each a window of markerless motion-capture frames retargeted onto a biomechanical model in a physics simulator (§ 3.2). The encoder EE of the MIMIC-MJX imitation policy (Zhang et al., [32]) maps each to a time series T:={p1,…,pn}T := \{p_1, \ldots, p_n\} in the latent space Z=RD\mathcal{Z} = \mathbb{R}^{D}. The same pipeline also runs unchanged on the joint-angle (qpos) and egocentric-keypoint (ekp) representations, which instantiate Z\mathcal{Z} at other dimensions. Three steps follow on the collection T={T1,…,TM}\mathcal{T} = \{T_1, \ldots, T_M\} (Figure 1): skeletonize each TiT_i into a DM-graph GiG_i (§ 4.1), decompose GiG_i into topological primitives (§ 4.2), and cluster the pooled primitives under a Wasserstein metric (§ 4.3).

Method overview

Figure 1. Method overview. A trajectory TiT_i is Takens-embedded and skeletonized into a discrete-Morse graph GiG_i (Step 1), decomposed into DM-cycles (H1H_1 loops) and DM-paths (the split tree) (Step 2), and the pooled primitives are clustered under W2W_2 into behavioral transition clusters (Step 3). Arrows mark each step’s output as the next step’s input. The two primitives are illustrated on a synthetic skeleton in Appendix Figure 3.

(Step 1) Discrete-Morse based skeletonization

Consider a trajectory T={p1,…,pn}T = \{p_1, \ldots, p_n\}, with pi∈Z=RDp_i \in\mathcal{Z} = \mathbb{R}^{D} the feature vector at frame ii. A single frame is an ambiguous descriptor of intention, as the same instantaneous configuration can occur within different movements. We therefore first apply a time-delay (Takens) embedding (Takens, [25]) so that each point carries a short window of recent motion: we map TT to the point cloud X={x1,…,xn′}⊂RmDX = \{x_1, \ldots, x_{n'}\} \subset\mathbb{R}^{mD}, xt=[pt,pt−τ,…,pt−(m−1)τ]x_t = [p_t, p_{t-\tau}, \ldots, p_{t-(m-1)\tau}], a set of n′=n−(m−1)τn' = n - (m - 1)\tau points, one per admissible frame, with the delay τ\tau and embedding dimension mm fixed by the average-mutual-information and False-Nearest-Neighbors heuristics (qpos and ekp are first reduced to their leading principal components; Appendices § 8.§ 2, § 8.19.1). Each point of XX is therefore the short-time pattern of how the signal evolves rather than a raw posture, position or action at a single instant.

Retaining the temporal index only so that skeleton vertices can later be mapped back to frames, we reconstruct the density-weighted graph skeleton of XX with the discrete-Morse based reconstruction algorithm of Magee and Wang [17], which extends Dey et al. [7] to high dimensions. It builds a sparse weighted Rips filtration over XX from a kk-nearest-neighbor density estimate, writing ρ\rho for the induced inverse-density score (large where the local kk-NN density is low), and then performs the persistence-guided discrete-Morse simplification of § 3.2 at a persistence threshold δ\delta. The output is a one-dimensional graph skeleton GTG_T whose vertices are a subset of the points of XX and whose edges trace the density ridges of the trajectory: a clip of n≈500n \approx500 frames becomes a skeleton of a few hundred vertices, which Step 2 cuts into primitives of ∼\sim60–190 frames each (Appendix § 8.11).

(Step 2) Topological primitive extraction

We now decompose the DM-skeleton GTG_T into more refined topological primitives which potentially capture clean individual behavior transitions.

DM-cycles. Loops in GTG_T mark a recurring movement pattern: the embedded trajectory leaves a region and returns by a different route. Because each embedded point is a short motion window (the Takens delay embedding), such of embedding is a recurrence of dynamics rather than returning to a single static pose. This is the same as a pendulum traces a line in position but a loop in phase space. Cycles flag the asymmetry between the outgoing and returning routes, so they are most informative on transitions with a large change in dynamics (Appendix § 8.§ 7).

We take as DM-cycles a minimum cycle basis of GTG_T (Hagberg et al., [14]): writing len⁡(γ)\operatorname{len}(\gamma) for the total edge weight of a cycle γ⊆GT\gamma\subseteq G_T, the set Γ∗={γ1∗,…,γg∗}\Gamma^* = \{\gamma_1^*, \ldots, \gamma_g^*\} of g=β1(GT)g = \beta_1(G_T) independent loops whose length sequence ℓ1=len⁡(γ1∗)≤⋯≤ℓg=len⁡(γg∗)\ell_1 = \operatorname{len}(\gamma_1^*) \le\cdots\le\ell_g = \operatorname{len}(\gamma_g^*) is lexicographically smallest. We instantiate len⁡(e)\operatorname{len}(e) for e=(u,v)e = (u,v) as max⁡(ρ(u),ρ(v))\max(\rho(u),\rho(v)), the inverse density at the sparser endpoint of ee, rather than as Euclidean distance. Such instantiation makes its value in the lower-star filtration of ρ\rho on GTG_T (not its sparse-Rips filtration value), so the basis prefers loops through denser regions and serve as a practical surrogate for the persistence-optimal basis of Magee and Wang [17]. The basis is canonical, keeping cycles comparable across clips. A loopless skeleton contributes none and cycles share no edges with the DM-paths below since every basis cycle is closed.

DM-paths. Removing Γ∗\Gamma^* from GTG_T, that is GT∖Γ∗G_T \setminus\Gamma^*, leaves a forest F={F1,…,Fs}\mathcal{F} = \{F_1, \ldots, F_s\}, s≥0s \ge0. Nodes of each tree FF are peaks and saddles, so ordering them by the height function h=−ρ:F→Rh = -\rho: F \to\mathbb{R} makes (F,h)(F,h) a split tree and orders vertices as the density of Appendix § 8.§ 1. Such tree is also rooted at the lowest value with all non-leaf nodes upward forks (Figure 3B). Running the persistence algorithm on the filtration of FF induced by hh, via a union-find data structure (Dey and Wang, [8]), yields saddle-maximum pairs (s,m)(s,m). The unique tree path between ss and mm is then one DM-path. We further take the path from the global minimum to the global maximum (intuitively a persistent pair in the extended persistence diagram). We emphasise that this is not a new filtration. It is exactly the standard 0-dimensional super-level-set persistence of a height function on a tree, equivalent under h↦−hh \mapsto-h to the sub-level-set formulation. What is specific to our construction is not the filtration but its reading. Each pair (s,m)(s,m) is taken as a transition corridor of the trajectory that is edge-disjoint from the DM-cycles. We keep every such pair, with no persistence pruning of the paths (sensitivity in Appendix § 8.14). Repeating over F\mathcal{F} converts each trajectory TT into a collection of DM-cycles and DM-paths, its behavior segments, each mapped back to its frames and split at temporal gaps (Appendix § 8.19.1).

Why drift-invariant spaces. Both primitives rest on a skeleton that forms only when behaviorally similar frames recur near each other, which fails under uncorrected drift. When the same behavior at different times drifts apart, no dense region recurs and neither loops nor corridors survive. Hence the spaces of § 3.2, and our expectation that primitives are cleanest in intention and qpos and weakest in ekp, the most drift-laden space.

(Step 3) Wasserstein Clustering

Step 2 yields a pooled collection P={π1,…,πN}\mathcal{P} = \{\pi_1,\ldots,\pi_N\} over T\mathcal{T}, each πj\pi_j an ordered sequence of points in Z=RD\mathcal{Z} = \mathbb{R}^{D}. The two primitive types and the three feature spaces are clustered separately, producing the DMC and DMP variants of § 5. Primitives differ in length, so we read each as an empirical distribution μj=1∣πj∣∑p∈πjδp\mu_j = \frac{1}{|\pi_j|}\sum_{p\in\pi_j}\delta_p and compare them under the 2-Wasserstein distance [19], which matches the regions of Z\mathcal{Z} two primitives occupy instead of imposing a frame-by-frame correspondence, and so absorbs the local time-reparameterization between two instances of one behavior. Resampling every primitive to a common length L=100L = 100 and solving the exact discrete optimal transport for each pair gives an N×NN \times N distance matrix D\mathbf{D}, which we embed with metric MDS at a dimension selected per variant by within-cluster consistency (Appendix § 8.19.2) before running KK-means on the embedded coordinates. We call this Discrete-Morse Wasserstein KK-means Clustering (DM-WKC) and apply the identical W2→MDS→KW_2 \to\mathrm{MDS} \to K-means backend to the baseline primitives of § 4.4. Appendix § 8.12 gives the construction in full.

Baselines and Evaluation Metrics

We compare against two baseline families (hyperparameters in Appendix § 8.19.3). State-space: Keypoint-MoSeq [30] on intentions (KPMS-Int) and on ego-centric keypoints (KPMS-KP). Topological clustering: Mapper [23] (Appendix § 8.19.3) on all three spaces, using the Fiedler vector of the kk-nearest-neighbour graph Laplacian as its 1D lens, a standard Mapper filter chosen independently of our own construction. Both families assign every frame a discrete label, a syllable or a graph node, so we build their transition primitives natively rather than through the W2W_2 backend of § 4.3: each cluster is one ordered pair of consecutive sustained labels, and the most frequent such pairs are retained. We keep each method’s own transition unit instead of imposing a common backend, and Appendix § 8.15 corrects for the label-cardinality asymmetry this creates. We also include a full-clip control (Full) that treats each clip’s whole intention trajectory as one primitive, ablating the decomposition step itself. Ground-truth labels (Appendix § 8.§ 3) are used only for evaluation, never during clustering. All alignment metrics operate in the same root-stripped qpos space: dynamic time warping (DTW) measures frame-level boundary alignment, and kernel inception distance (KID) (Bińkowski et al., [4]) compares the frame distributions of a cluster and its ground-truth window. KID is a maximum mean discrepancy under the polynomial kernel k(x,y)=((x⋅y)/d+1)3k(x,y)=((x\cdot y)/d+1)^3; we borrow it from the generative-modelling literature, where it scores sample quality, and apply the kernel directly to our features. Internal consistency is the mean pairwise DTW within a cluster, and we decompose the warping path into a sync ratio and a non-diagonal fraction (Table 1, Appendix § 8.16). Beyond alignment we evaluate each coarse-graining via the per-frame mutual information I(T;Y)I(T;Y) between its label TtT_t and the directed-transition class YtY_t, with cardinality-corrected AMI (Vinh et al., [28]) (Appendix § 8.15).

TransitionDTW to GT (↓) DMC* (Int)DTW to GT (↓) DMP* (Qpos)DTW to GT (↓) Mapper (Qpos)DTW to GT (↓) KPMS (KP)Consistency (↓) DMC* (Int)Consistency (↓) DMP* (Qpos)Consistency (↓) Mapper (Qpos)Consistency (↓) KPMS (KP)Non-diag (↓) DMC* (Int)Non-diag (↓) DMP* (Qpos)Non-diag (↓) Mapper (Qpos)Non-diag (↓) KPMS (KP)KID (↓) DMC* (Int)KID (↓) DMP* (Qpos)KID (↓) Mapper (Qpos)KID (↓) KPMS (KP)
Immobile→Rear [L]—0.854—0.831—0.803—0.821—0.128—0.245—0.002—0.006
Rear→Immobile [L]—0.855†0.8790.855—0.659†0.7430.708—0.111†0.1780.165—0.026†0.0090.010
Immobile→Rear [R]—0.880†—0.848†—0.718†—0.854†—0.170†—0.173†—0.033†—0.010†
Immobile→Rear [S]0.9340.8920.8950.9670.7660.6320.7140.9360.0800.0630.0550.0960.0320.0240.0100.011
Rear→Immobile [S]0.863†0.8920.8560.8770.8020.6320.7650.8160.080†0.0630.0520.1090.011†0.0240.0080.008
Immobile→Turn [L]0.8090.7880.8010.7700.6520.7240.6900.6860.0120.0190.0330.0360.0090.0030.0060.002
Turn→Immobile [L]0.7400.7210.7900.849†0.6010.5850.5900.659†0.0320.0540.0620.086†0.0050.0080.0100.013†
Immobile→Turn [R]0.7590.756†0.715†0.7470.7030.729†0.669†0.6880.0120.005†0.019†0.0250.0070.009†0.008†0.003
Immobile→Walk [L]0.759†—0.8180.9180.928———0.087———0.003†—0.0080.003
Rear→Turn [L]0.8260.7780.8180.9180.7820.6070.6430.7950.1420.1690.1890.1640.0050.0150.0080.013
Turn→Walk [L]0.643———0.582———0.096———0.004———
Mean of ±0.0070.0160.0250.0190.0770.0650.1390.0900.0110.0170.0290.0180.0030.0030.0030.002
Std of ±0.0030.0110.0120.0110.0470.0440.0530.0390.0080.0220.0180.0140.0030.0020.0020.002

Table 1. Alignment, coherence, warping and distributional fidelity. One fixed variant per family: DMC-Int, DMP-Qpos, Mapper-Qpos, KPMS-KP. Rows are directed transitions with turn direction ([L] left, [R] right, [S] straight). Lower is better in all four blocks. — = not discovered; † = one seed only. Summary rows give the per-column mean and std of the 3-seed ±. *Ours.

Results

All methods are evaluated on the same rat dataset against the auto-labeling ground truth of Appendix § 8.§ 3. Twelve variants are compared. Six of them are ours, the DM-cycle (DMC) and DM-path (DMP) primitives of § 4.3 on each of intention, qpos and ekp; the baselines are Mapper on the same three spaces and the two Keypoint-MoSeq streams KPMS-Int and KPMS-KP, together with the full-clip control. Ours are marked * in Table 1 and in the per-variant tables of Appendix § 8.16. We report alignment and coherence (§ 5.1) and transition information (§ 5.2), with where the primitives appear and what the clusters look like in Appendices § 8.§ 4 and § 8.21. Control experiments are collected in Appendix § 8.9.

Alignment, consistency, and warping

Each family in Table 1 is represented by a single variant, the one carrying the most transition information I(T;Y)I(T;Y) (Table 8) and that variant is held fixed down its column. (Appendix § 8.8). Rows are the 11 transitions that at least two families recover and transitions found by only one family appear in Appendix § 8.8.

MethodH(T)H(T)I(T;Y)I(T;Y)lift over floorNMIAMIefficiencyH(Y∣T)H(Y \mid T)
DMC-Ekp<u>1.068</u>0.2340.0400.1380.1230.2192.441
DMC-Intention5.184<u>0.873</u>0.278<u>0.234</u><u>0.213</u>0.168<u>1.802</u>
DMC-Qpos2.8530.4740.1210.1720.1660.1662.200
DMP-Ekp1.6740.3630.0890.1710.1630.2172.312
DMP-Intention2.9770.5110.1620.1810.1720.1712.164
DMP-Qpos4.9180.895<u>0.276</u>0.2470.2300.1821.780
KPMS-Int2.600±0.0812.600 \pm0.0810.286±0.0360.286 \pm0.0360.164±0.0310.164 \pm0.0310.108±0.0120.108 \pm0.0120.108±0.0120.108 \pm0.0120.110±0.0110.110 \pm0.0112.389±0.0362.389 \pm0.036
KPMS-KP3.908±0.1603.908 \pm0.1600.525±0.0110.525 \pm0.0110.225±0.0040.225 \pm0.0040.162±0.0000.162 \pm0.0000.159±0.0010.159 \pm0.0010.135±0.0030.135 \pm0.0032.150±0.0112.150 \pm0.011
Mapper-EKP2.313±0.1902.313 \pm0.1900.276±0.0120.276 \pm0.0120.084±0.0070.084 \pm0.0070.111±0.0020.111 \pm0.0020.110±0.0020.110 \pm0.0020.120±0.0060.120 \pm0.0062.399±0.0122.399 \pm0.012
Mapper-Int0.940±0.4680.940 \pm0.4680.155±0.0860.155 \pm0.0860.060±0.0380.060 \pm0.0380.091±0.0360.091 \pm0.0360.080±0.0400.080 \pm0.0400.154±0.0220.154 \pm0.0222.520±0.0862.520 \pm0.086
Mapper-Qpos2.622±0.0932.622 \pm0.0930.322±0.0190.322 \pm0.0190.108±0.0110.108 \pm0.0110.122±0.0070.122 \pm0.0070.121±0.0070.121 \pm0.0070.123±0.0080.123 \pm0.0082.353±0.0192.353 \pm0.019

Table 8. Information-theoretic coarse-graining metrics on rat transitions. Each row is one method variant, averaged over three seeds for stochastic baselines and deterministic for DM methods. Columns report the entropy of the coarsening label H(T)H(T); mutual information I(T;Y)I(T;Y); lift over the within-clip shuffle floor; normalized mutual information (NMI); cardinality-corrected adjusted mutual information (AMI); coarsening efficiency I(T;Y)/H(T)I(T;Y)/H(T); and residual transition entropy H(Y∣T)H(Y \mid T). Bold = best per column, <u>underline</u> = second. Baseline methods have different seeds due to their stochasticity in coarse-graining stage whereas DM decomposition is deterministic.

The DM family exhibits the strongest internal coherence on 9 of the 11 transitions. While alignment with annotated boundaries is more evenly distributed across methods, with the DM family achieving the best DTW scores on only 5 transitions, the warping decomposition reveals a clearer distinction. Specifically, the DM family achieves the lowest non-diagonal fraction on 9 of 11 transitions (Table 1) and the highest synchronization ratio on 9 of 11 (Table 11), whereas KPMS-KP does not lead on either metric. On each of the 4 rows where KPMS-KP has the lowest DTW its warping path is less diagonal than ours, so it reaches that DTW by stretching a primitive onto the annotated window, whereas the DM primitives follow the window at their own timescale. Two of the 11 rows are populated by DMC-Int alone among these columns; on the other 9 the DM family still leads on 7 for coherence, non-diagonal fraction and sync ratio alike.

TransitionDMC∗^{*} (Int)DMC∗^{*} (Qpos)DMC∗^{*} (EKP)DMP∗^{*} (Int)DMP∗^{*} (Qpos)DMP∗^{*} (EKP)Mapper (Int)Mapper (Qpos)Mapper (EKP)KPMS (Int)KPMS (KP)Full (Int)
Immobile→Rear [S]0.4910.4930.483—0.494__0.496__0.4950.4950.4950.4920.4890.497†^{\dagger}
Immobile→Rear [L]—0.4730.4640.490†^{\dagger}0.4760.4770.448———0.462__0.484__
Immobile→Rear [R]——0.477—__0.482__†^{\dagger}0.478————__0.474__†^{\dagger}0.480
Immobile→Turn [L]0.4980.498—0.498__0.499__—0.498†^{\dagger}0.4950.4940.4990.4970.495
Immobile→Turn [R]0.5000.499—0.500†^{\dagger}0.500†^{\dagger}—0.499†^{\dagger}0.498†^{\dagger}0.494—0.4980.498
Immobile→Walk [L]0.493†^{\dagger}—————__0.483__—————
Rear→Immobile [S]0.491†^{\dagger}—0.497†^{\dagger}0.495—0.4910.4900.4940.4980.4930.484—
Rear→Immobile [L]—0.4810.475—0.491†^{\dagger}0.4810.475†^{\dagger}__0.484__0.479—0.4830.482
Rear→Immobile [R]——————0.442†^{\dagger}—__0.462__†^{\dagger}———
Rear→Turn [L]0.482——__0.488__0.4770.4840.4720.473—0.4910.480—
Rear→Turn [R]0.486†^{\dagger}———————————
Rear→Walk [L]——__0.470__†^{\dagger}———0.450†^{\dagger}—__0.433__†^{\dagger}———
Turn→Immobile [L]0.4980.499—0.4990.495—0.4880.489——__0.495__†^{\dagger}0.494
Turn→Rear [L]0.462†^{\dagger}———————————
Turn→Walk [L]0.492—————__0.485__†^{\dagger}——__0.480__†^{\dagger}——
Walk→Immobile [S]———0.496†^{\dagger}————————
Walk→Turn [L]———0.489†^{\dagger}————————
Mean of ±\pm0.0020.0020.0070.0020.0020.0030.0030.0060.0030.0030.0040.005
Std of ±\pm0.0010.0020.0040.0020.0020.0020.0030.0040.0020.0030.0030.005

Table 11. DTW-to-frame-sync ratio by directed transition (↑\uparrow higher is better). Bold = best per row over populated cells; underline = second. — = method did not discover this transition. Direction tags: [L] left, [R] right, [S] straight. ∗^{*}Ours. Higher means less reliance on warping rescue. †^{\dagger} marks cells populated by only a single seed (no ±\pm available). The two summary rows under the table give the per-column mean and standard deviation of the per-cell ±\pm (std across 3 random seeds), aggregated over the populated rows.

On pure distribution metrics, DMC-Int trails KPMS-KP by 13% on KID, which contrasts with the DTW result but in an informative way since the two metrics score different properties. DTW matches a primitive to its window under a monotone time correspondence, so it rewards recovering the order in which the body reconfigures, which is what a corridor or loop on the skeleton encodes and what the non-diagonal fraction confirms. KID is unchanged by permuting frames, so it rewards only covering the same region of pose space, where breadth helps: a KPMS-KP cluster holds a median of roughly 14,000 frames against 4,000 for DMP-Qpos, sampling the annotated window more fully while being markedly less coherent internally. The ordered structure our primitives capture is invisible to KID by construction, and we claim no distributional advantage. Coverage is likewise comparable, DMC-Int reaching 10 of the 16 discovered directed transitions against 11 for Mapper-Int and 9 for KPMS-KP (Appendix § 8.8).

An information-theoretic view of coarse-graining

Beyond alignment, we ask how much of the transition signal each coarse-graining retains, computing the per-frame mutual information I(T;Y)I(T;Y) between the method’s label TtT_t and the directed-transition class YtY_t and placing each configuration on the Information Bottleneck plane (Tishby et al. [26]) (Figure 2A). DM cycle and path extraction in intention and qpos reaches the top of the plane, with the qpos DM-path carrying the most transition information of any method both before and after correcting label cardinality. DM methods reach this regime without an upstream state-label partition or a downstream pair-construction step. We read the gain through the same filter as in § 5.1: a DM label is given only to frames on a persistent ridge, so it groups the cleaned part of the trajectory rather than every frame of the raw one. The within-DM ordering (intention ≈\approx qpos >> ekp) agrees with the alignment results. The information view shows that these features carry more transition signal than the best state-space pair-type construction while arising from a fundamentally different construction (per-variant numbers in Table 8).

Three-panel comparison of coarse-graining methods: Information Bottleneck plane, family-pooled transition information, and adjusted mutual information

Figure 2. How each coarse-graining preserves the transition signal. (A) Information Bottleneck plane: per-frame capacity H(T)H(T) vs. transition information I(T;Y)I(T;Y) in bits, one dot per (method, seed); up-and-left dominates. (B,C) Family-pooled I(T;Y)I(T;Y) and adjusted mutual information (AMI); the KPMS box is bimodal because KPMS-KP (high) and KPMS-Int (low) bracket the family. Per-variant numbers: Table 8.

Discussion and Limitations

Several limitations remain. DM-G operates on individual ∼500\sim500-frame clips at 30 Hz, potentially missing transitions that span multiple clips. While pooling clips can recover these transitions (Appendix § 8.§ 6), scalability is limited by the quadratic cost of sparse-Rips construction (Appendix § 8.18). Finally, DM-G is not intended to compete with supervised transition classification in accuracy, but rather to provide a complementary, unsupervised, control-grounded representation of behavioral transitions (Appendix § 8.17).

Conclusion

Topological data analysis offers new tools for understanding behavioral dynamics. Existing pipelines coarse-grain the trajectory before ever asking how one behavior becomes the next, fixing a transition’s describable resolution in advance. We instead reconstruct each trajectory’s discrete-Morse skeleton in the control-grounded spaces of a deep-RL biomechanical emulator ([32]), a sparse subspace “shaped by what is missing,” and read two primitives off it: DM-paths through the corridors between dense behavioral regions, and DM-cycles around recurrences whose outgoing and returning routes differ. Because the skeleton keeps only the frames on persistent density ridges, it acts as a spatiotemporal filter on the raw feature space, much like recovering a road network from noisy car positions, so the primitives serve as an clean version of the trajectory. Clustering these primitives retains more transition information than baselines and matches the annotated boundaries with less warping and with more consistent clusters. Rather than replacing state-based methods, topology offers a complementary, transition-centric view of open-ended behavioral repertoires through their shape rather than the states into which they are partitioned.

Appendix

Discrete-Morse Based Graph Skeletonization Framework

Discrete Morse theory was introduced by Forman [11] as a combinatorial analog of Morse theory on cell complexes. Combined with persistent homology it yields a robust framework for extracting graph skeletons from a density field [6, 13, 20, 24, 29]: the skeleton is read off the ridges of the density terrain, and persistence retains only the topologically significant ridges while cancelling noise. Dey et al. [7] formulate and simplify this with theoretical guarantees, and Magee and Wang [17] extend it to high-dimensional point clouds. We extend it in turn to trajectories, and decompose the resulting skeletons to capture behavior transition patterns.

§ 3.2 gives the road-network intuition; we make the underlying objects precise here. Let f:Rd→Rf : \mathbb{R}^{d} \to\mathbb{R} be the density field, described for d=2d=2 for concreteness, whose graph {(x,f(x))}\{(x, f(x))\} is the terrain of Figure 3A. We take the gradient to be the steepest descending direction, the reverse of the usual convention but the one that makes flow lines easier to describe. Critical points are those where it vanishes: maxima (peaks), minima (valley bottoms) and saddles. A drop of water released on the terrain traces a flow line downhill to a critical point; extending such lines uphill as well gives the integral lines of ff, which begin and end at critical points. The objects of interest are the 1-stable manifolds, the integral lines joining maxima to saddles: they connect density peaks through the saddles separating low-density basins, and their union is the graph we take as the hidden skeleton.

Being differential objects, 1-stable manifolds are hard to estimate reliably from discrete samples, the more so in high dimension. Dey et al. [7] therefore work with the discrete Morse analog over simplicial complexes, where a simple combinatorial cancellation reduces the topological complexity of a discrete Morse function and so simplifies its 1-stable manifolds; persistent homology [9, 8] guides that cancellation so only topologically important features survive. See Dey et al. [7] for the algorithm and its guarantees.

Feature Space Construction Details

The three feature spaces (ekp, qpos, intention) are defined in § 3.2. The egocentric rotation removes the heading angle θ=atan2⁡(2(wz+xy),1−2(y2+z2))\theta= \operatorname{atan2}(2(wz+xy), 1-2(y^{2}+z^{2})) and drops the root keypoint, leaving 20 keypoints ×\times 3 = 60 dims. For qpos, the 7-dim root we strip is the global (x,y,z)(x,y,z) position plus the orientation quaternion. For ekp and qpos we additionally apply PCA to the leading 10 components to absorb residual allocentric variance into the discarded tail before running DM-G; intention’s drift-invariance by construction makes this step unnecessary.

Auto-Labeling Pipeline

All ground-truth labels used in this paper are produced by an open-source heuristic auto-labeling pipeline1 and then proofread by two annotators. Labels are used exclusively for evaluation, never during clustering. A representative instance of every directed transition is rendered in Figure 5.

Rat behavior lexicon: twelve panels showing rat poses across directed transitions between Walk, Immobile, Turn, and Rear

Figure 5. Rat behavior lexicon. Each panel superimposes six poses of one representative ground-truth transition between two of the four macro-behaviors (Walk, Immobile, Turn, Rear), rendered in-scene from MJX rollouts with a shared camera, so the bodies occupy the positions the animal actually visited. Temporal progression is light-to-dark. Instances are selected by scoring each side of the labelled boundary against the kinematic signature of its own label (speed, yaw rate, torso height) and taking the weaker of the two, so both behaviors are legible rather than only the more energetic one. Panel titles give the directed transition type and its instance count nn. Purely rotational transitions (Turn→ImmobileTurn \to Immobile, Immobile→TurnImmobile \to Turn) remain the most compact, since a heading change at fixed position projects into self-occlusion from any single viewpoint.

Rat Behavior Lexicon

The pipeline labels every frame with a behavior (one of four macro-categories) and a direction (one of three turn modes), maintained as two parallel tracks per clip. The categories are defined by simple, interpretable kinematic heuristics applied over a 15-frame (∼0.5\sim0.5 s) sliding window:

Rear (R). Triggered when the root height exceeds a fixed threshold or is rising rapidly relative to the moving baseline. Captures both supported and unsupported rears as a single category, since the MJX model lacks an environment surface and the two are visually indistinguishable in body coordinates.

Turn (T). Triggered when planar rotational speed exceeds a threshold while planar translational speed stays below a translation cutoff. Captures stationary or low-velocity reorientations of the body axis.

Walk (W). Triggered when planar translational speed exceeds the walk threshold. Captures all coordinated locomotion (walking and running are not separated in this version).

Immobile (I). The default fallback when none of the above triggers. Captures stationary postures including grooming-like local limb activity that does not generate enough rotational or translational signal to fire one of the above triggers.

Priority and post-processing. The four behaviors are assigned by first-match-wins priority Rear >> Turn >> Walk >> Immobile (a frame can only carry one behavior). After per-frame assignment, two passes clean up flicker: (i) any segment shorter than 0.25 s is absorbed into its longer neighbors, and (ii) any sandwiched “A–B–A” pattern with the inner B-segment shorter than 0.5 s is bridged into a single “A” segment.

Direction track (Left / Right / Straight). The direction label is computed independently from the behavior label by integrating the signed yaw rate of the body axis across the same window: positive integral above a turn-magnitude cutoff yields Left, negative yields Right, and below-cutoff integrals yield Straight. The direction track is orthogonal to the behavior track, so any behavior can carry any direction (e.g., a rear can be straight, left, or right depending on the body’s yaw during ascent).

Manual proofreading. After auto-labeling, two annotators independently scan every clip and override frames where the heuristic clearly misfires (e.g., a slow drift labelled Walk that should be Immobile, or a rotational artifact during rearing). The proofreading is conservative: annotators only intervene when both reviewers agree the auto-label is wrong. The dataset used for evaluation throughout this paper reflects the post-proofread state of behavior_labels/rat_labels.csv.

Cluster-to-label assignment. For evaluating a clustering method, each discovered cluster is assigned a transition label by majority vote over all of its members. Each member contributes the directed pair of the two behaviors that cover the most of its frames, ordered by first appearance (e.g., Rear →\to Walk), together with the turn direction over the same frames: Left or Right if any frame carries that direction, the more frequent of the two winning and ties going to Left, and Straight otherwise. The most frequent (behavior pair, direction) tuple across the members becomes the cluster’s ground-truth assignment, with ties broken alphabetically.

Where the Primitives Appear

The construction predicts that primitives appear exactly where behavior changes, and three checks bear this out: root displacement is larger for cycle-bearing clips than cycle-free ones, the longest DM-loop collapses on stationary clip pools while surviving on moving ones, and bootstrap-mean cycle counts are strictly higher for asymmetric A→B→AA \to B \to A triplets than symmetric ones in every feature space (Appendices § 8.§ 6, § 8.§ 7). Qualitatively, DM-G recovers both behaviors as density peaks (minima of ρ\rho) and threads a corridor through the low-density band where their ground-truth frames meet, in every feature space (Figure 6 and Figure 7, Appendix § 8.§ 5). A clip may carry several persistent features or none, so we extract every cycle and path above a frame-count threshold and let the W2W_2 clustering absorb the multiplicity. The three subsections below give each check in full.

DM-cycles × feature space across intention, qpos, and ekp feature spaces

Figure 6. DM-cycles × feature space. Rows: intention / qpos / ekp; columns: the canonical transition pools. t-SNE of the Takens-embedded point cloud, with frames of the first behavior in blue, the second in red, and all other frames grey; gold stars mark the persistent density peaks (minima of ρ\rho) DM-G identifies with the two behaviors, and the dashed black curve is the top DM-cycle of that pool, drawn closed. Intention and qpos recover clean loops for every pool; ekp, the most drift-laden space, recovers a loop in each but a visibly sparser one.

DM-cycle filmstrips showing all feature spaces

Figure 7. DM-cycle filmstrips, all feature spaces. Same layout as Figure 6: rows are feature spaces, columns the transition pools. Each strip shows the poses actually traversed around that pool’s top DM-cycle, tinted light-to-dark by position along the loop, so the loop reads as a movement rather than as a curve in an embedding.

Transition Projections Across Feature Spaces

Figure 6 and Figure 7 give the qualitative view of the DM-cycles referenced in § 5, across all three feature spaces. For each of the canonical transition pools we take the Takens-embedded point cloud of the pooled clips, project it to two dimensions with t-SNE for visualisation only (the skeleton itself is built in the full embedding space, never on the projection), and overlay the extracted structure: frames labelled with the first behavior of the pair are drawn in blue, frames labelled with the second in red, all remaining frames in grey, gold stars mark the persistent density peaks (minima of ρ\rho) that DM-G identifies with the two behaviors, and the dashed black curve is the top DM-cycle of that pool, drawn closed. Figure 7 then renders the poses actually traversed around each of those loops as a chronophotography filmstrip, tinted light-to-dark by position along the loop, so the loop can be read as a movement rather than as a curve in an embedding. Two things are visible. First, in every pool the two labelled behaviors occupy distinct regions and the recovered cycle passes through both, with the low-density corridor between them carrying the frames where the ground-truth transition is annotated: this is the qualitative signature behind the quantitative alignment results of § 5.1. Second, the feature spaces differ in how cleanly they expose it. Intention and qpos recover clean, well-separated loops for every transition pool, whereas ekp, the most drift-laden space, still recovers a loop in each pool but a visibly sparser one, consistent with the drift argument of § 4.2 and with ekp’s weaker position in the alignment (Appendix § 8.16) and transition-information (Appendix § 8.15) results.

DM-G Identifies Stationary Clips

Of the 842 rat clips analyzed with DM-G in intention space, 602 produce at least one cycle (behaviorally rich) and 240 produce no cycles (stationary or topologically simple). Root displacement (mean ∣Δ∣|\Delta| per frame, n=50n=50 per group) is systematically larger along every world axis for cycle-bearing clips than for no-cycle clips (Figure 8A), so the cycles preferentially survive on behaviorally rich segments rather than emerging at random. The longest DM-loop length on a 5-clip pool collapses to near-zero on a stationary-only composition while moving pools retain a long loop (Figure 8B), and the contrast scales smoothly across n∈{2,3,4,5}n \in\{2,3,4,5\} pooled trajectories (Figure 8C), with a small bump at n=4n=4 tracking the increased chance that a stationary pool happens to include a low-amplitude limb bout. The no-cycle population is dominated by Immobile frames, with the residual Turn / Walk / Rear mass corresponding to bouts that fall below DM-G’s persistence threshold.

DM-G identifies stationary clips

Figure 8. DM-G identifies stationary clips. (A) Root displacement per frame (∣Δx∣,∣Δy∣,∣Δz∣|\Delta x|, |\Delta y|, |\Delta z|) for clips with DM-cycles (orange) vs. without (blue), n=50n = 50 per group; cycle-bearing clips move more along every world axis. (B) Longest DM-loop length on a 5-clip moving (orange) vs. stationary (blue) pool: with no topological feature to encode, the skeleton collapses on the stationary pool. (C) Same contrast swept across pool size n∈{2,3,4,5}n \in\{2, 3, 4, 5\}, 10 trials per point: pooled moving clips sustain a long loop across the full sweep while stationary-only pools stay flat near zero.

Behavioral Asymmetry Across Feature Spaces

A direct empirical consequence of the asymmetry intuition (§ 4.2) is that an A→\toB→\toA triplet whose entry and exit arms occupy spatially distinct routes should carry more H1H_1 cycles than a symmetric triplet whose arms overlap. Bootstrapping the per-triplet cycle-count-per-100-frames (nboot=1000n_{\mathrm{boot}} = 1000) across the rodent dataset matches this expectation in every feature space (Figure 9). Asymmetric triplets dominate symmetric ones at all three abstraction levels (intention, qpos, ekp), with the gap widening on the abstract intention space, consistent with the drift-invariance argument of § 4.2: intention does not have to allocate cycle budget to residual allocentric drift, so any cycle that does survive is more likely to be a behavioral asymmetry signal. We stress that these A→B→AA \to B \to A triplets are only a convenient subset, chosen because a clear posture or position change makes the asymmetry easy to see; they are an experimental probe, not the full picture. Because the skeleton is built on the dynamics rather than on posture or position, other and more complex asymmetries can exist that this triplet test does not capture.

Violin plots comparing asymmetric and symmetric A→B→A triplets across intention, qpos, and EKP feature spaces

Figure 9. Asymmetric A→B→A triplets carry strictly more cycles than symmetric ones across all feature spaces. Violins are over bootstrap-mean (nboot=1000n_{\mathrm{boot}} = 1000) cycle counts per 100 frames. Orange = asymmetric (outgoing and returning routes differ in the dynamics), blue = symmetric. Mean and 95% bootstrap percentile interval overlaid as black markers. Each panel uses its own y-axis because EKP cycle magnitudes are an order of magnitude smaller than intention / qpos.

Behavioral Coverage

Table 2 reports coverage at the directed, direction-turn level, where Immobile→Turn is counted separately from Turn→Immobile and each is split by turn direction (left / right / straight). The label space nests: the four macro-behaviors give six unordered pairs, twelve directed transitions, and, tagged by turn direction, 36 classes, of which 25 have ground-truth instances in the evaluation split and 16 are discovered by at least one method; Table 2 lists these 16, and Table 1 reports the 11 of them for which more than one method family yields alignment metrics. Rear→Walk [L], which appears in the per-variant alignment grids of Appendix § 8.16, has no ground-truth instance in the evaluation split and is therefore not counted here. DM-WKC reaches transition coverage on par with the strongest existing models rather than exceeding them: DMC-Int discovers 10 of the 16 discovered directed transition classes, one fewer than Mapper-Int (11), with KPMS-KP at 9 and DMP-Int and DMP-Qpos at 8. Coverage breadth therefore does not by itself separate the methods; the DM advantage is in transition information (Table 8) and lower warping (Table 1), not in the number of transitions discovered. The two families are not nested: four transitions, among them Walk→Turn [L] and Walk→Immobile [S], are recovered only by DM primitives (no baseline finds them at any tested setting), while Rear→Immobile [R] is recovered only by Mapper, so each family exposes a few transitions the other misses. EKP-based DM methods sit at the narrow end of DM coverage (5 and 6 classes) because Cartesian keypoint coordinates retain the most residual allocentric drift after centering, washing out the density peaks for transitions that involve subtle postural changes (§ 4.2).

TransitionGT nnDMC* (Int)DMC* (Qpos)DMC* (EKP)DMP* (Int)DMP* (Qpos)DMP* (EKP)Mapper (Int)Mapper (Qpos)Mapper (EKP)KPMS (Int)KPMS (KP)Full (Int)
Immobile→Rear\mathrm{Immobile}\to\mathrm{Rear} [S]31✓✓✓×✓✓✓✓✓✓✓✓
Immobile→Rear\mathrm{Immobile}\to\mathrm{Rear} [L]4×✓✓✓✓✓✓×××✓✓
Immobile→Rear\mathrm{Immobile}\to\mathrm{Rear} [R]2××✓×✓✓××××✓✓
Immobile→Turn\mathrm{Immobile}\to\mathrm{Turn} [L]95✓✓×✓✓×✓✓✓✓✓✓
Immobile→Turn\mathrm{Immobile}\to\mathrm{Turn} [R]45✓✓×✓✓×✓✓✓×✓✓
Immobile→Walk\mathrm{Immobile}\to\mathrm{Walk} [L]1✓×××××✓×××××
Rear→Immobile\mathrm{Rear}\to\mathrm{Immobile} [S]26✓×✓✓×✓✓✓✓×✓×
Rear→Immobile\mathrm{Rear}\to\mathrm{Immobile} [L]4×✓✓×✓✓✓✓✓×✓✓
Rear→Immobile\mathrm{Rear}\to\mathrm{Immobile} [R]2××××××✓×✓×××
Rear→Turn\mathrm{Rear}\to\mathrm{Turn} [L]26✓××✓✓✓✓✓×✓✓×
Rear→Turn\mathrm{Rear}\to\mathrm{Turn} [R]6✓×××××××××××
Turn→Immobile\mathrm{Turn}\to\mathrm{Immobile} [L]102✓✓×✓✓×✓✓××✓✓
Turn→Rear\mathrm{Turn}\to\mathrm{Rear} [L]6✓×××××××××××
Turn→Walk\mathrm{Turn}\to\mathrm{Walk} [L]22✓×××××✓××✓××
Walk→Immobile\mathrm{Walk}\to\mathrm{Immobile} [S]11×××✓××××××××
Walk→Turn\mathrm{Walk}\to\mathrm{Turn} [L]17×××✓××××××××
Total discovered10658861176597

Table 2. Behavioral coverage by method (directed, direction-turn). Each cell indicates whether the method discovered (✓) or missed (×) at least one cluster majority-voted to the given directed transition and turn direction (Immobile→Turn is distinct from Turn→Immobile). Direction tags: [L] left, [R] right, [S] straight. GT nn = ground-truth instances in the evaluation split. Only the 16 classes that at least one method discovers are listed; the evaluation split contains 25 classes with ground-truth instances.

Controls

Three controls rule out simpler explanations. First, none of 110 variants spanning KPMS stickiness and state count or Mapper lens and interval count improves on the tuned baselines (Appendix § 8.10). Second, the full-clip control, which omits decomposition, performs worse than both DM variants in alignment (mean DTW 0.888) and coherence (0.797), showing that decomposition rather than Wasserstein clustering recovers the transitions. Third, DM-cycle DTW varies by at most 0.03 across kk in every feature space, while persistence pruning trades transition information for cluster quality without a uniformly better operating point; we therefore retain all paths (Appendices § 8.13 and § 8.14). The primitives are also complementary: DM-paths resolve kinematically similar modes, whereas DM-cycles capture transitions involving larger postural changes.

*Ours.

Baseline Scale Sensitivity

State-space and topological baselines expose timescale-related knobs that directly control how long a typical behavioral segment lasts: KPMS’s stickiness κ\kappa and number of states NstatesN_{\mathrm{states}} jointly set the expected syllable dwell time, and Mapper’s number of cover intervals nintervalsn_{\mathrm{intervals}} sets how finely the lens partitions the manifold. To characterize how baseline coverage depends on these knobs rather than assuming a single setting, we sweep these hyperparameters and ask, for each variant, how many of the 16 directed, direction-turn transition classes of Table 2 it discovers, scored over the same rows so the two tables share a denominator.

For KPMS we sweep κ∈{103,104,105,106,107}\kappa\in\{10^{3}, 10^{4}, 10^{5}, 10^{6}, 10^{7}\} against Nstates∈{5,10,15,20,30}N_{\mathrm{states}} \in\{5, 10, 15, 20, 30\} on both feature streams, 50 fits in total. Every fit is scored for discovery; we deliberately apply no model-selection criterion first, since the question here is whether these knobs limit baseline coverage at all, which is a question about the union over settings rather than about any single preferred setting. Both streams use the heading treatment of Appendix § 8.19.3. For Mapper we pair four lenses (Fiedler, eccentricity, kNN-density, and PCA-1D) with three feature spaces (intention, qpos, ekp) and sweep nintervals∈{5,10,15,20,25}n_{\mathrm{intervals}} \in\{5, 10, 15, 20, 25\}, yielding 60 Mapper variants. The remaining Mapper settings are held fixed across the sweep at overlap fraction 0.5, DBSCAN min_samples=5, and the same global neighbourhood-radius rule as Appendix § 8.19.3; nodes covering fewer than 500 frames in total are pruned before discovery is scored, which the benchmark configuration of Appendix § 8.19.3 does not do. The sweep therefore characterizes sensitivity to the cover and the lens, and not to the inner-clustering scale. A transition A↔BA \leftrightarrow B counts as discovered if the variant produces at least one cluster whose frame-level ground-truth purity for that transition exceeds a fixed threshold and whose member-clip count clears a minimum support size. Table 3 reports the count for every one of the 110 variants.

Table 3. Baseline scale-hyperparameter sweep. Each cell is the number of the 16 directed, direction-turn transition classes of Table 2 that the variant discovers, over the same rows and the same evaluation split, so the two tables share a denominator. (a) Keypoint-MoSeq over stickiness κ\kappa and NstatesN_{\mathrm{states}} on both feature streams (50 fits). (b) Mapper over lens and nintervalsn_{\mathrm{intervals}} on all three feature spaces (60 variants). Primitives are built exactly as for the benchmark baselines, from sustained syllable or node pairs, and each cluster is majority-voted to a class by the same labeller used for Table 2. Every fit is scored with no model-selection criterion applied first, so the union line is a true oracle union over all 110 variants. Remaining settings are held at a common default rather than at the per-stream tuned values of Appendix § 8.19.3, and no swept setting improves on the tuned configurations reported in Table 2.

Cells count the 16 directed, direction-turn classes of Table 2, with primitives built and labelled exactly as for the benchmark baselines. Discovery stays low across the whole grid: no intention fit recovers more than 2 of the 16 classes, the keypoint stream recovers none at κ=103\kappa=10^3 for any state count, and no fit with Nstates=5N_{\mathrm{states}}=5 recovers more than one class on either stream. The best single KPMS variant reaches 4 of the 16 classes and the best single Mapper variant 6, the latter on ekp with the Fiedler lens, while the union over all 50 KPMS variants reaches 10 and the union over all 60 Mapper variants 9. Decisively, no swept setting improves on the tuned baseline configurations of Appendix § 8.19.3, which reach 9 of 16 for KPMS and 11 for Mapper in Table 2: the sweep holds every remaining setting at a common default rather than at those per-stream tuned values, and varying the timescale knobs around it never recovers the difference. The configurations reported in Table 2 therefore remain the strongest baselines we obtained, and stickiness and state count are not hiding a better one. Over the settings explored the sweep therefore shows that the baselines’ coverage is not primarily an artifact of these knobs; it also holds Mapper’s DBSCAN neighbourhood radius fixed, so it bounds coverage over the cover and lens rather than over every hyperparameter.

Trajectory-to-Skeleton Reduction

Table 4 reports the size of a trajectory at each stage of the pipeline, per feature space: the original clip length, the DM-skeleton it is summarized to, and the lengths of the DM-cycle and DM-path primitives the skeleton decomposes into. A raw clip of n≈500n \approx500 frames yields a skeleton of about 263 (intention), 344 (qpos), and 260 (ekp) vertices, and Step 2 cuts that skeleton into primitives that are short sub-trajectories: DM-cycles average 75, 113, and 191 frames and DM-paths 62, 113, and 105 frames across the three spaces, so each captures a few seconds of behavior rather than the whole clip. Skeleton sizes are averaged over the clips that produce a non-empty skeleton, the primitive lengths over all extracted primitives.

Feature spaceFramesSkeletonDM-cycleDM-path
Intention4992637562
Qpos500344113113
EKP500260191105

Table 4. Trajectory-to-skeleton reduction by feature space. Mean over rat clips of the original trajectory length (Frames), the DM-skeleton vertex count (Skeleton), and the per-primitive lengths of the DM-cycles and DM-paths. Frames and both primitive lengths are in frames; Skeleton is in graph vertices. Skeleton is averaged over clips that yield a non-empty skeleton, the primitive lengths over all extracted primitives. Each primitive is resampled to L=100L = 100 frames before clustering (§ 4.3).

Before clustering, every primitive is resampled to a fixed length of L=100L = 100 frames (Step 3, § 4.3), down-sampling the longer ones and interpolating the shorter ones up, so that all are compared as equal-size empirical distributions regardless of their native span.

Wasserstein Clustering of Primitives

§ 4.3 states the DM-WKC construction; here we record what it takes to reproduce it. Primitives run from roughly 60 to 190 frames (Appendix § 8.11), so each is resampled to L=100L = 100 before any distance is computed, keeping evenly spaced frames when a primitive is longer than LL and interpolating frame indices when it is shorter, with primitives of fewer than three frames discarded; clip and frame indices travel with the resampled primitive, so a cluster can be mapped back to the frames it was built from, which is what Appendix § 8.21 renders. Because both measures then carry LL atoms of equal mass 1/L1/L, an optimal plan may be taken to be a permutation and the transport cost is a minimum-cost perfect matching between the two point sets, which we solve exactly by network simplex ([10]) rather than by an entropic approximation, under a squared Euclidean ground cost, Oracle union over all 50 KPMS variants: 10 of 16. Over all 60 Mapper variants: 9 of 16. Combined baseline union: 11 of 16.

Feature spaceκ\kappa510152030
Intention, Nstates=103N_{\mathrm{states}}=10^302222
Intention, Nstates=104N_{\mathrm{states}}=10^412111
Intention, Nstates=105N_{\mathrm{states}}=10^511011
Intention, Nstates=106N_{\mathrm{states}}=10^610020
Intention, Nstates=107N_{\mathrm{states}}=10^711010
Keypoint, Nstates=103N_{\mathrm{states}}=10^300000
Keypoint, Nstates=104N_{\mathrm{states}}=10^413112
Keypoint, Nstates=105N_{\mathrm{states}}=10^502304
Keypoint, Nstates=106N_{\mathrm{states}}=10^603322
Keypoint, Nstates=107N_{\mathrm{states}}=10^712332

Table 3a. (a) Keypoint-MoSeq.

Feature spaceLens510152025
IntentionFiedler02001
IntentionkNN-density00000
IntentionPCA-1D10231
IntentionEccentricity01010
QposFiedler34212
QposkNN-density03210
QposPCA-1D00243
QposEccentricity03100
EKPFiedler24363
EKPkNN-density00120
EKPPCA-1D12112
EKPEccentricity00010

Table 3b. (b) Mapper.

so the entries of D\mathbf{D} are squared 2-Wasserstein distances. One consequence is that μj\mu_j is unordered: the transport is computed on the per-frame feature vectors pt∈Z\mathbf{p}_t \in\mathcal{Z} that a primitive visits rather than on their Takens embeddings, so the distance does not see the order in which a primitive is traversed, and temporal structure enters only through which frames the skeleton assigns to the primitive. For qpos and ekp these are the root-stripped and egocentric features of § 3, without the PCA applied before skeletonization. The matrix is then rescaled entrywise by ricj\sqrt{r_i c_j}, with rir_i and cjc_j the median off-diagonal distances of row ii and column jj, putting every primitive’s distances on a comparable scale, before metric MDS on precomputed dissimilarities and KK-means with K=25K = 25 (Appendix § 8.19.1). We cache D\mathbf{D}, so the embedding dimension can be swept (Appendix § 8.19.2) without recomputing any transport; those O(N2)O(N^2) solves dominate the cost of this stage (Appendix § 8.18).

Discrete-Morse kk-Neighbor Sensitivity

The skeleton is built from a kk-nearest-neighbor density estimate (§ 4.1), so kk sets how strongly the density is smoothed before simplification. We sweep k∈{3,5,8}k \in\{3, 5, 8\} (k=3k=3 shipped) on all three feature spaces, holding every other setting at its production value and rerunning the full pipeline per kk so the numbers stay comparable to the main results. Table 5 reports the label-free skeleton structure (DM-cycles per clip and giant-connected-component fraction) and the DM-cycle alignment (DTW, KID, coverage).

Spacekkcycles/clipgiant-CCDTWKIDcov
Intention32.200.510.800.0096.0
51.590.400.830.0146.3
80.830.250.820.0177.3
Qpos30.830.410.850.0085.0
50.750.440.830.0095.3
80.670.460.830.0095.7
EKP30.190.130.940.0104.0
50.160.120.930.0154.0
80.140.100.930.0254.7

Table 5. Discrete-Morse kk-neighbor sensitivity on rat transitions. Per feature space and kkNN parameter kk (shipped value k=3k=3 in bold), the label-free skeleton structure (mean number of DM-cycle primitives per clip, counted after temporal splitting, and the fraction of all embedded points in the largest connected component of the skeleton) and the DM-cycle ground-truth alignment (DTW, KID, and number of discovered transitions). DTW is flat across kk in every space; larger kk erodes the intention cycle structure and its KID with no alignment gain.

The headline metric is essentially flat: DTW varies by at most 0.03 across kk in every space. The only clear directional effect favors small kk where cycles carry the most signal. In intention, raising kk from 3 to 8 erodes the cycle structure (DM-cycles per clip: 2.20→\to0.83, giant-component fraction: 0.51→\to0.25) and worsens the distributional metric (KID: 0.009→\to0.017) with no offsetting gain, and the same KID degradation appears in ekp (0.010→\to0.025); qpos drifts mildly the other way in connectivity while its alignment stays flat. Larger kk buys only marginally more coverage (intention: 6.0 →\to 7.3) at equal or worse alignment. We therefore ship k=3k=3, which recovers the richest topology and is best in intention on both structure and alignment. Since kk and δ\delta jointly shape the skeleton, this characterizes sensitivity at each space’s shipped δ\delta rather than over the full (k,δ)(k,\delta) grid.

Path-Selection Persistence Sensitivity

The DM-path decomposition (§ 4.2) keeps every peak-to-saddle path plus each tree’s global-max-to-global-min path in density (§ 4.2); the shipped δpath=0\delta_{\mathrm{path}} = 0 keeps all of them. A threshold δpath>0\delta_{\mathrm{path}} > 0 discards the low-persistence paths, the minor density peaks that merge into a higher one through a saddle of nearly the same density, leaving only deep, well-separated corridors. We sweep δpath\delta_{\mathrm{path}} as a multiple of each space’s construction threshold δ\delta; because this only re-filters branches of the already-built skeleton, it reuses the cached skeleton with no DM-G rerun. We score both the transition information of the path labeling (I(T;Y)I(T;Y) and AMI; Table 6) and the downstream DMP clustering alignment (Table 7).

Spaceδpath/δ\delta_{\mathrm{path}}/\deltapathsI(T;Y)I(T;Y)AMIH(T)H(T)
Intention013890.5110.1722.98
0.513330.4950.1692.90
112010.4620.1632.70
28810.3680.1462.13
48250.3460.1412.00
Qpos011400.8960.2304.92
0.59420.8270.2234.55
17960.7570.2194.10
25620.5520.1903.02
45530.5280.1832.97
EKP04130.3640.1631.67
0.53370.3220.1511.49
12900.2810.1381.32
22530.2490.1261.20
42450.2420.1231.18

Table 6. Path-selection persistence: transition information. Per feature space and path-persistence multiplier δpath/δ\delta_{\mathrm{path}}/\delta (shipped 0 in bold), the number of DM-paths and the transition information of the per-frame DMP coarse-graining: mutual information I(T;Y)I(T;Y), cardinality-corrected AMI, and label entropy H(T)H(T). All three decrease monotonically as the threshold rises.

Spaceδpath/δ\delta_{\mathrm{path}}/\deltaDTWKIDcov
Intention00.7580.0132.7
10.7550.0073.0
40.8010.0103.0
Qpos00.8400.0134.3
10.8420.0116.3
40.8380.0106.3
EKP00.9160.0145.7
10.9240.0136.0
40.9150.0156.3

Table 7. Path-selection persistence: downstream alignment. DMP clustering alignment (DTW, KID, and discovered-transition coverage) at three path-persistence multipliers (0 = shipped, in bold). A mild threshold (δpath=δ\delta_{\mathrm{path}}=\delta) lowers KID and raises coverage in intention and qpos with DTW unchanged, while ekp is roughly unchanged.

The two views disagree on the optimum. Transition information falls monotonically as δpath\delta_{\mathrm{path}} rises, in every space and even for the cardinality-corrected AMI, so the discarded paths carry signal rather than noise: a low-persistence path is a short, localized mode-to-boundary corridor and is highly transition-specific, whereas the high-persistence backbone spans the whole trajectory and is less so, so keeping all paths maximizes raw information. Downstream, however, a mild threshold helps the drift-clean spaces: at δpath=δ\delta_{\mathrm{path}}=\delta, intention and qpos drop KID by 46 and 17 percent with DTW unchanged and coverage equal or higher (removing short noisy branches tightens the clusters), while ekp gains little (KID

0.014→0.0130.014 \to0.013, DTW 0.916→0.9240.916 \to0.924). The shipped δpath=0\delta_{\mathrm{path}} = 0 thus sits at the information-optimal end and is safe everywhere, with δpath≈δ\delta_{\mathrm{path}} \approx\delta a defensible alternative when downstream cluster quality in intention and qpos is the priority.

Information-Theoretic Analysis of Coarse-Graining

We evaluate each unsupervised behavioral coarse-graining by measuring how much information its per-frame output retains about an external relevance variable. The relevance variable is the ground-truth directed-transition class, and we report mutual information together with normalized and cardinality-corrected variants. All variables are defined on the labeled subset of the rodent dataset that contains at least one valid transitions (578/842 clips). For frame tt in clip cc, Yt∈{1,…,12}Y_t \in\{1,\ldots,12\} denotes the directed transition class (produced by the auto-labeling pipeline in Appendix § 8.§ 3). This variable is method-agnostic and has marginal entropy H(Y)=2.67H(Y) = 2.67 bits, which upper-bounds any achievable I(T;Y)I(T;Y). The coarse-graining label TtT_t is the method-specific integer primitive assigned to frame tt, with Tt=−1T_t = -1 reserved for unassigned frames. The construction of TtT_t differs by method:

  • DM-cycles (DMC): TtT_t is the global index, across all clips, of the discrete-Morse cycle containing frame tt, or −1-1 if no cycle contains it.

  • DM-paths (DMP): TtT_t is defined analogously using descending-path primitives.

  • KPMS: TtT_t is the retained ordered pair type of source and target syllables for the sustained-transition window containing frame tt.

  • Mapper: TtT_t is the analogous ordered pair type, formed exactly as for KPMS but over Mapper graph-node labels instead of syllables (Appendix § 8.19.3).

This definition preserves each method’s native transition unit. DM methods produce instance-level topological objects, so DMC and DMP have hundreds of labels across the dataset, depending on feature space. In contrast, KPMS and Mapper reuse type-level state-pair labels across clips. We retain this asymmetry because it reflects the intrinsic design of each method, and use adjusted mutual information to correct for label-cardinality differences. We use the per-frame rather than per-instance distribution, so a primitive spanning kk frames contributes kk rows to the cross-tabulation. We report:

  • H(T)H(T): entropy of the coarsening label;

  • I(T;Y)=H(Y)−H(Y∣T)I(T;Y) = H(Y) - H(Y \mid T): mutual information between the coarsening and transition class;

  • H(Y∣T)H(Y \mid T): residual transition entropy, or information not preserved by the coarsening;

  • NMI=I(T;Y)/H(T)H(Y)\mathrm{NMI} = I(T;Y)/\sqrt{H(T)H(Y)}: normalized mutual information;

  • AMI: adjusted mutual information correcting for random partitions of the same cardinality;

  • shuffle floor: I(T;Y)I(T;Y) after independently permuting TT within each clip;

  • lift over shuffle floor: I−IshuffledI-I_{\mathrm{shuffled}}, isolating cross-clip transition signal from clip-identity effects.

Table 8 reports the eleven variants that enter this comparison, our six DM variants against the two Keypoint-MoSeq and three Mapper baselines; § 5.2 states the ranking. The full-clip control is an ablation of the decomposition step rather than a competing coarse-graining, so it is reported with the other controls in Appendix § 8.9 and is held out of this analysis and of Figure 2. Two further points are visible only here. The DM primitives retain a large lift over the within-clip shuffle floor (DMC-Int = 0.278), which isolates the frame-level transition signal the decomposition recovers from mere clip identity. And although both baseline families build transitions the same way, as ordered pairs of sustained states, KPMS-KP carries more than three times the transition information of the weakest Mapper variant (0.525 against 0.155 bits), so a state-pair construction is not automatically transition-informative across feature spaces. This analysis complements the alignment evaluation of § 5.1: alignment asks whether discovered clusters overlap ground-truth windows, whereas I(T;Y)I(T;Y) asks whether the coarse-graining label itself is transition-informative.

Detailed Alignment & Consistency Results

The head-to-head comparison of § 5.1 is Table 1 in the main text, where each family is pinned to a single variant selected by transition information (DMC-Int, DMP-Qpos, Mapper-Qpos, KPMS-KP), so every column corresponds to one runnable configuration. The tables below give the full per-variant grids behind it, including the sync ratio, which the main table omits for space.

The remaining tables give the full per-direction breakdown across all twelve variants (DMC, DMP, and Mapper on intention, qpos, and ekp; KPMS-Int, KPMS-KP, and the full-clip control Full-Int), from which the fixed-space selections above are drawn: Table 9 and Table 10 for DTW and consistency, Table 11 and Table 12 for the warping decomposition, and Table 13 for KID. All three alignment metrics live in the same root-stripped qpos space; only the kernel changes.

TransitionDMC* (Int)DMC* (Qpos)DMC* (EKP)DMP* (Int)DMP* (Qpos)DMP* (EKP)Mapper (Int)Mapper (Qpos)Mapper (EKP)KPMS (Int)KPMS (KP)Full (Int)
Immobile→Rear [S]0.9340.9130.941—0.8920.9480.9060.8950.9450.9610.9670.949†
Immobile→Rear [L]—0.9290.9340.927†0.8540.9660.756———0.8310.978
Immobile→Rear [R]——0.972—0.880†1.009————0.848†0.989
Immobile→Turn [L]0.8090.792—0.8050.788—0.952†0.8010.8100.8720.7700.817
Immobile→Turn [R]0.7590.732—0.727†0.756†—0.810†0.715†0.795—0.7470.770
Immobile→Walk [L]0.759†—————0.767—————
Rear→Immobile [S]0.863†—1.151†0.930—0.9190.8230.8560.8860.9260.877—
Rear→Immobile [L]—0.8880.926—0.855†0.8840.892†0.8790.839—0.8550.933
Rear→Immobile [R]——————0.823†—0.852†———
Rear→Turn [L]0.826——0.8380.7780.8720.7880.818—0.8680.918—
Rear→Turn [R]0.915†———————————
Rear→Walk [L]——0.841†———0.745†—0.703†———
Turn→Immobile [L]0.7400.720—0.7970.721—0.7220.790——0.849†0.778
Turn→Rear [L]0.907†———————————
Turn→Walk [L]0.643—————0.698†——0.644†——
Walk→Immobile [S]———0.694†————————
Walk→Turn [L]———0.623†————————
Mean of ±0.0070.0380.0240.0380.0160.0250.0160.0250.0160.0430.0190.024
Std of ±0.0030.0300.0120.0230.0110.0170.0100.0120.0120.0190.0110.024

Table 9. DTW distance to ground truth by directed transition (↓ lower is better). Bold = best per row over populated cells; underline = second. — = method did not discover this transition. Direction tags: [L] left, [R] right, [S] straight. *Ours. † marks cells populated by only a single seed (no ± available). The two summary rows under the table give the per-column mean and standard deviation of the per-cell ± (std across 3 random seeds), aggregated over the populated rows.

Table 10: Internal cluster consistency by directed transition (↓\downarrow lower is better). Bold = best per row over populated cells; <u>underline</u> = second. — = method did not discover this transition. Direction tags: [L] left, [R] right, [S] straight. ∗{}^{*}Ours. †{}^{\dagger} marks cells populated by only a single seed (no ±\pm available). The two summary rows under the table give the per-column mean and standard deviation of the per-cell ±\pm (std across 3 random seeds), aggregated over the populated rows.

TransitionDMC{sup}* (Int)DMC{sup}* (Qpos)DMC{sup}* (EKP)DMP{sup}* (Int)DMP{sup}* (Qpos)DMP{sup}* (EKP)Mapper (Int)Mapper (Qpos)Mapper (EKP)KPMS (Int)KPMS (KP)Full (Int)
Immobile→\toRear [S]0.7660.7540.931—0.6320.7800.999<u>0.714</u>0.7710.9280.9360.779{sup}†
Immobile→\toRear [L]—0.8130.7440.877{sup}†<u>0.803</u>0.9790.831———0.8210.868
Immobile→\toRear [R]——<u>0.823</u>—0.718{sup}†0.911————0.854{sup}†0.886
Immobile→\toTurn [L]0.652<u>0.573</u>—0.5520.724—1.120{sup}†0.6900.7040.7490.6860.788
Immobile→\toTurn [R]0.7030.638—0.706{sup}†<u>0.729</u>{sup}†—0.844{sup}†0.669{sup}†<u>0.648</u>—0.6880.768
Immobile→\toWalk [L]0.928{sup}†—————0.790—————
Rear→\toImmobile [S]0.802{sup}†—0.750{sup}†0.853—0.8310.6650.765<u>0.695</u>0.7100.816—
Rear→\toImmobile [L]—0.8500.867—0.659{sup}†0.7160.551{sup}†0.743<u>0.655</u>—0.7080.913
Rear→\toImmobile [R]——————0.688{sup}†—<u>0.776</u>{sup}†———
Rear→\toTurn [L]0.782——0.8250.6070.8180.777<u>0.643</u>—0.8720.795—
Rear→\toTurn [R]0.884{sup}†———————————
Rear→\toWalk [L]——<u>0.683</u>{sup}†———0.930{sup}†—0.619{sup}†———
Turn→\toImmobile [L]0.6010.492—0.6430.585—<u>0.546</u>0.590——0.659{sup}†0.577
Turn→\toRear [L]0.908{sup}†———————————
Turn→\toWalk [L]0.582—————<u>0.722</u>{sup}†——<u>0.704</u>{sup}†——
Walk→\toImmobile [S]———0.556{sup}†————————
Walk→\toTurn [L]———0.562{sup}†————————
Mean of ±\pm0.0770.0810.1180.0680.0650.0810.0960.1390.0350.1350.0900.054
Std of ±\pm0.0440.0380.0610.0340.0440.0290.1190.0530.0280.1400.0390.029

Table 10. Internal cluster consistency by directed transition (↓\downarrow lower is better). Bold = best per row over populated cells; underline = second. — = method did not discover this transition. Direction tags: [L] left, [R] right, [S] straight. ∗{}^{*}Ours. †{}^{\dagger} marks cells populated by only a single seed (no ±\pm available). The two summary rows under the table give the per-column mean and standard deviation of the per-cell ±\pm (std across 3 random seeds), aggregated over the populated rows.

TransitionDMC* (Int)DMC* (Qpos)DMC* (EKP)DMP* (Int)DMP* (Qpos)DMP* (EKP)Mapper (Int)Mapper (Qpos)Mapper (EKP)KPMS (Int)KPMS (KP)Full (Int)
Immobile→Rear [S]0.0800.0920.143—0.0630.0630.0450.0550.0320.0970.0960.025†
Immobile→Rear [L]—0.2210.2700.072†0.1280.1480.273———0.2450.131
Immobile→Rear [R]——0.201—0.170†0.173————0.173†0.184
Immobile→Turn [L]0.0120.023—0.0220.019—0.040†0.0330.0510.0110.0360.049
Immobile→Turn [R]0.0130.015—0.006†0.005†—0.007†0.019†0.028—0.0250.026
Immobile→Walk [L]0.080†—————0.089—————
Rear→Immobile [S]0.080†—0.053†0.053—0.1080.0800.0520.0150.0820.109—
Rear→Immobile [L]—0.1560.206—0.111†0.1950.252†0.1780.190—0.1650.175
Rear→Immobile [R]——————0.323†—0.265†———
Rear→Turn [L]0.142——0.0990.1690.1360.1600.189—0.0850.164—
Rear→Turn [R]0.135†———————————
Rear→Walk [L]——0.214†———0.261†—0.334†———
Turn→Immobile [L]0.0320.024—0.0190.054—0.0870.062——0.086†0.075
Turn→Rear [L]0.256†———————————
Turn→Walk [L]0.096—————0.103†——0.131†——
Walk→Immobile [S]———0.061†————————
Walk→Turn [L]———0.098†————————
Mean of ±0.0110.0150.0240.0230.0170.0220.0230.0290.0150.0180.0180.036
Std of ±0.0080.0090.0170.0100.0220.0180.0340.0180.0090.0170.0140.037

Table 12. Non-diagonal fraction of DTW warping path by directed transition (↓ lower is better). Bold = best per row over populated cells; underline = second. — = method did not discover this transition. Direction tags: [L] left, [R] right, [S] straight. *Ours. Lower means the warping path runs closer to the diagonal, so the primitive matches the annotated window at its own timescale rather than being stretched or compressed onto it. † marks cells populated by only a single seed (no ± available). The two summary rows under the table give the per-column mean and standard deviation of the per-cell ± (std across 3 random seeds), aggregated over the populated rows.

Table 13: Kernel Inception Distance by directed transition (↓\downarrow lower is better). Bold = best per row over populated cells; underline = second. — = method did not discover this transition. Direction tags: [L] left, [R] right, [S] straight. ∗{}^{*}Ours. †{}^{\dagger} marks cells populated by only a single seed (no ±\pm available). The two summary rows under the table give the per-column mean and standard deviation of the per-cell ±\pm (std across 3 random seeds), aggregated over the populated rows.

TransitionDMC∗{}^{*} (Int)DMC∗{}^{*} (Qpos)DMC∗{}^{*} (EKP)DMP∗{}^{*} (Int)DMP∗{}^{*} (Qpos)DMP∗{}^{*} (EKP)Mapper (Int)Mapper (Qpos)Mapper (EKP)KPMS (Int)KPMS (KP)Full (Int)
Immobile→\toRear [S]0.0320.0190.012—0.0240.0160.007<u>0.010</u>0.0160.0220.0110.021†{}^{\dagger}
Immobile→\toRear [L]—0.010<u>0.005</u>0.028†{}^{\dagger}0.0020.0090.005———0.0060.022
Immobile→\toRear [R]——0.014—0.033†∣0.045∣−∣−∣−∣−∣∗∗0.010{}^{\dagger} | 0.045 | - | - | - | - | **0.010{}^{\dagger}**<u>0.011</u>
Immobile→\toTurn [L]0.0090.011—0.0150.003—0.018${}^{\dagger} | 0.006 | 0.011 | 0.009 | 0.002 | 0.001
Immobile→\toTurn [R]0.0070.011—0.006†∣0.009{}^{\dagger} | 0.009{}^{\dagger}—0.008†∣0.008{}^{\dagger} | 0.008{}^{\dagger}0.011—0.003<u>0.003</u>
Immobile→\toWalk [L]0.003${}^{\dagger} | — | — | — | — | — | <u>0.013</u> | — | — | — | — | —
Rear→\toImmobile [S]0.011†{}^{\dagger}—0.111†{}^{\dagger}0.013—0.0080.018<u>0.008</u>0.0170.0040.008—
Rear→\toImmobile [L]—0.0040.007—0.026†{}^{\dagger}0.0120.011†{}^{\dagger}0.0090.009—0.010<u>0.006</u>
Rear→\toImmobile [R]——————0.015†{}^{\dagger}—0.008${}^{\dagger} | — | — | —
Rear→\toTurn [L]<u>0.005</u>——0.0130.0150.0040.0060.008—0.0110.013—
Rear→\toTurn [R]0.017${}^{\dagger} | — | — | — | — | — | — | — | — | — | — | —
Rear→\toWalk [L]——<u>0.017†</u>∣−∣−∣−∣∗∗0.014{}^{\dagger}</u> | - | - | - | **0.014{}^{\dagger}**—0.031†{}^{\dagger}———
Turn→\toImmobile [L]0.0050.010—0.0150.008—0.0080.010——0.013†{}^{\dagger}0.002
Turn→\toRear [L]0.004${}^{\dagger} | — | — | — | — | — | — | — | — | — | — | —
Turn→\toWalk [L]0.004—————0.020†{}^{\dagger}——0.003†{}^{\dagger}——
Walk→\toImmobile [S]———0.011†{}^{\dagger}————————
Walk→\toTurn [L]———0.001†{}^{\dagger}————————
Mean of ±\pm0.0030.0050.0050.0100.0030.0020.0030.0030.0060.0060.0020.003
Std of ±\pm0.0030.0030.0050.0070.0020.0020.0040.0020.0030.0050.0020.004

Table 13.

Reading the warping decomposition. The point of reporting DTW alongside KID is that if a method’s DTW lead came from DTW’s flexibility to warp away misalignment, the KID column, which cannot warp, would re-rank the methods. To diagnose how a method achieves its DTW score, we decompose the warping path into the DTW-to-frame-sync ratio (higher = less warping rescue) and the non-diagonal fraction (lower = a more diagonal alignment, i.e., the primitive matches the transition timescale rather than relying on time-warping). The two point the same way: a method that aligns to ground truth without heavy warping has a high sync ratio and a low non-diagonal fraction.

Relation to Supervised and Large-Model Approaches

A supervised model, including a large transformer, can classify transitions given labels, and with enough compute would likely do so accurately. Our aim is different and complementary: the DM primitives are obtained without transition labels, which are exactly what such a classifier needs and what is expensive to annotate at frame resolution. The output is also an interpretable geometric object, a corridor or a loop in the feature space, rather than an opaque class posterior, and the extraction is cheap, so the method is usable without large-model infrastructure. The contribution is thus an unsupervised, control-grounded representation of transitions, not a competitor to supervised classification accuracy.

Computational Cost

DM-G runs once per clip on a commodity CPU and needs no GPU; among the methods compared, only Keypoint-MoSeq’s Gibbs sampler benefits from one. The dominant cost is the sparse weighted Rips construction of the reference implementation ([17]): the pairwise-distance matrix and greedy permutation are O(n2D)O(n^{2}D), the all-pairs edge enumeration feeding the ε\varepsilon-sparsifier is O(n2)O(n^{2}), and the surviving simplex count mm then enters PHAT’s persistence reduction ([3]) at O(m2.37)O(m^{2.37}). For the n≈500n \approx500-frame clips studied here this is tractable per clip.

Hyperparameters

Hyperparameters for DM-G Methods

Table 14 lists the DM-G hyperparameters used for each feature space and dataset. All feature spaces share kk-NN connectivity k=3k=3 (sensitivity analysis in Appendix § 8.13) and edge threshold ε=0.99\varepsilon=0.99. The persistence threshold δ\delta varies by feature space: intention embeddings tolerate a larger δ\delta because the 16D space is compact, while qpos (67D after root stripping) and ekp (60D) require smaller δ\delta to resolve structure in the sparser high-dimensional point cloud. PCA to 10 dimensions is applied to qpos and ekp before DM-G extraction; intention is used without dimensionality reduction. Takens delay τ\tau is selected as the first local minimum of the Average Mutual Information computed independently per feature space.

Table 14: DM-G hyperparameters by feature space and dataset.

DatasetFeature spaceRaw dimPCA dimmmτ\taukkδ\delta
ratIntention16—3631.0
ratQpos67103930.2
ratEKP60103830.1

Table 14.

Additional shared parameters: ε=0.99\varepsilon=0.99 for all configurations. Each DM-cycle and DM-path is mapped back to its frames, which are sorted in time and split wherever consecutive frames are more than 50 frames apart (segment gap limit); segments with fewer than 30 skeleton vertices are discarded, so one basis cycle or path can yield zero, one or several primitives. For Wasserstein clustering (§ 4.3): target window length L=100L=100 and K=25K=25 clusters. The MDS embedding dimension is selected per variant by within-cluster consistency (Appendix § 8.19.2); the selected values are 20 (DMC-Int), 40 (DMC-Qpos), 5 (DMC-EKP), 10 (DMP-Int), 40 (DMP-Qpos) and 40 (DMP-EKP). Three random seeds (0, 1, 2) are used for all clustering experiments.

Selection of the MDS Embedding Dimension

Step 3 embeds the W2W_2 distance matrix by multidimensional scaling before KK-means (§ 4.3). The embedding dimension governs how much of the transport geometry survives into the clustering step and is a free parameter of the method. We sweep it over {3,5,10,20,40,60}\{3,5,10,20,40,60\} for every primitive type and feature space at three seeds, and select per variant the value that minimises within-cluster consistency, the mean pairwise DTW among the members of a cluster. Consistency is computed from the discovered clusters alone and never references the ground-truth labels, so the selection is independent of the alignment metrics reported in § 5.1. Table 15 gives the full grid: block (a) is the selection criterion, and blocks (b) to (d) report the resulting alignment, distributional fidelity and coverage, which take no part in the choice. Means are taken over the transitions a variant populates at every dimension, so a setting cannot appear better merely by discovering a different subset.

Table | MDS embedding dimension | | | | | Variant | 3 | 5 | 10 | 20 | 40 | 60 (a) Within-cluster consistency ↓\downarrow (selection criterion) | | | | | | DMC-Int | 0.765 | 0.746 | 0.737 | 0.698 | 0.747 | 0.718 DMC-Qpos | 0.769 | 0.775 | 0.732 | 0.728 | 0.726 | 0.754 DMC-EKP | 0.872 | 0.841 | 0.853 | 0.876 | 0.847 | 0.849 DMP-Int | 0.643 | 0.645 | 0.597 | 0.638 | 0.641 | 0.648 DMP-Qpos | 0.704 | 0.717 | 0.762 | 0.793 | 0.691 | 0.739 DMP-EKP | 0.915 | 0.862 | 0.874 | 0.884 | 0.839 | 0.882 (b) DTW to ground truth ↓\downarrow | | | | | | DMC-Int | 0.827 | 0.831 | 0.802 | 0.796 | 0.806 | 0.801 DMC-Qpos | 0.856 | 0.857 | 0.855 | 0.856 | 0.851 | 0.854 DMC-EKP | 0.935 | 0.943 | 0.943 | 0.933 | 0.926 | 0.931 DMP-Int | 0.770 | 0.771 | 0.801 | 0.773 | 0.801 | 0.791 DMP-Qpos | 0.854 | 0.844 | 0.839 | 0.860 | 0.828 | 0.831 DMP-EKP | 0.927 | 0.948 | 0.952 | 0.957 | 0.933 | 0.936 (c) KID ↓\downarrow | | | | | | DMC-Int | 0.010 | 0.017 | 0.010 | 0.010 | 0.011 | 0.011 DMC-Qpos | 0.009 | 0.009 | 0.010 | 0.012 | 0.011 | 0.009 DMC-EKP | 0.010 | 0.009 | 0.008 | 0.010 | 0.009 | 0.010 DMP-Int | 0.014 | 0.014 | 0.015 | 0.013 | 0.014 | 0.004 DMP-Qpos | 0.013 | 0.010 | 0.010 | 0.010 | 0.011 | 0.010 DMP-EKP | 0.014 | 0.012 | 0.014 | 0.011 | 0.016 | 0.013 (d) Transitions discovered (union over 3 seeds) | | | | | | DMC-Int | 8.0 | 9.0 | 8.0 | 10.0 | 9.0 | 11.0 DMC-Qpos | 6.0 | 7.0 | 7.0 | 7.0 | 6.0 | 6.0 DMC-EKP | 4.0 | 6.0 | 6.0 | 6.0 | 6.0 | 6.0 DMP-Int | 3.0 | 4.0 | 8.0 | 7.0 | 5.0 | 7.0 DMP-Qpos | 5.0 | 7.0 | 6.0 | 6.0 | 8.0 | 6.0 DMP-EKP | 7.0 | 6.0 | 6.0 | 6.0 | 6.0 | 6.0

Table 15. Selection of the MDS embedding dimension. Sweep over {3,5,10,20,40,60}\{3, 5, 10, 20, 40, 60\} at three seeds. The dimension is selected per variant by minimising within-cluster consistency (block a), which uses no ground-truth labels; blocks (b)–(d) take no part in the choice. Best per row in bold. Means are over the transitions a variant populates at every dimension. DMP-Int shares only two such transitions, so its block (c) row is noisy.

No single dimension is best for all variants: the selected values span 5 to 40, each inside the swept range. Selecting instead on DTW would change the choice for three of the six variants (DMC-EKP, DMP-Int and DMP-EKP) but for neither of the two reported in Table 1, so the ground-truth-free criterion leaves the head-to-head comparison unchanged. We note that the corresponding hyperparameters of the baselines were not swept in the same way; the baseline settings are those of Appendix § 8.19.3.

Hyperparameters for Baseline Methods

The KPMS settings below, including the choice of model type, were selected by reconstruction MSE computed on the fitted data for each feature stream. The state-count sweep of Appendix § 8.10 uses a different criterion, for the reason given there. Mapper is not fit to data and has no training objective, so its settings are fixed rather than tuned. For every baseline, transition primitives are the twenty-five most frequent ordered pairs of consecutive sustained labels having at least three instances, matching the cluster budget K=25K=25 given to DM-WKC. Final configurations are listed below.

Keypoint-MoSeq expects observations of shape (frames, bodyparts, spatial dimensions) and, by default, estimates a per-frame heading from a designated anterior–posterior axis and rotates it out. The two feature streams require opposite treatments of that step, and we set them accordingly.

KPMS (intention). Switching linear dynamical system (SLDS) with latent dimension 10, 25 states, sticky parameter κ=1.35×104\kappa=1.35 \times10^{4}, 100 AR-only iterations followed by 300 full-model iterations, minimum sustained duration 25 frames. The intention latent is not spatial: it enters as (T,k,1)(T, k, 1), one “bodypart” per latent coordinate in a single dimension, for which a heading is undefined. We therefore hold the heading fixed at zero so that only the centroid is removed and no rotation is applied.

KPMS (keypoint). Autoregressive HMM (AR-HMM) with latent dimension 15, 25 states, sticky parameter κ=1.09×106\kappa=1.09 \times10^{6}, 100 AR-only iterations, minimum sustained duration 25 frames. The keypoints are allocentric marker positions obtained by forward kinematics, so the animal’s heading is a nuisance factor: it spans the full circle across the dataset and varies by roughly 190° within a single clip. We therefore let KPMS estimate and remove it, taking the head as the anterior landmark and the two hips as the posterior landmarks. This variant is fit in AR-only mode, so the full-model stage that infers the keypoint centroid, heading, and noise scales is not run.

Mapper. Mapper (Singh et al., [23]) is run on the three rat feature spaces used for DM-primitive extraction (intention, qpos, ekp), on the same inputs DM-G receives (qpos and ekp reduced by PCA to 10 dimensions) and with the Takens parameters (m,τm,\tau) that DM-G uses in each space (Table 14). The 1D lens is the Fiedler vector, the eigenvector of the smallest non-zero eigenvalue of the normalised Laplacian of an unweighted kk-nearest-neighbour graph over the pooled cloud, computed with scikit-learn’s spectral embedding. We start from k=15k=15 rather than DM-G’s k=3k=3, since a kk-NN connectivity graph needs a larger kk than a kk-NN density estimate and at k=3k=3 the Takens-embedded filaments break into components, on which spectral embedding silently returns a component indicator instead of a Fiedler vector. We therefore test connectivity and double kk until it holds: intention and ekp connect at k=15k=15, while qpos needs k=30k=30 on one seed and k=60k=60 on the other two, the growth being seed-dependent because the graph is fit on a random subsample. The raw lens is heavy-tailed, placing over 99.8% of intention points in one decile on every seed and so collapsing the cover to a single interval, so we rank-normalise it, a monotone reparameterisation that preserves its level sets; the arbitrary eigenvector sign is pinned deterministically. All clips are pooled into one cloud carrying one graph, which is what makes cross-clip node pairs meaningful; for tractability it is fit on a uniform random subsample of 10510^5 of the roughly 4×1054 \times10^5 points, the rest inheriting their nearest subsample neighbour’s assignment. The cover is the standard cubical cover with nintervals=10n_{\mathrm{intervals}}=10 and overlap fraction 0.5; inner clustering is DBSCAN with min_samples=5 and one global neighbourhood radius, the median pairwise distance of a 10310^3-point sample. Overlaps are resolved by assigning each frame to the containing node whose cover interval is centred nearest its lens value, and primitives are then formed as for KPMS: runs of at least 50 frames with one node label count as sustained, each cluster is one ordered pair of consecutive sustained labels, and the twenty-five most frequent pairs with at least three instances are retained, leaving Takens warm-up and DBSCAN noise frames unlabelled. This configuration differs from the Mapper variant swept in Appendix § 8.10.

Reproducibility

All code, ground-truth labels, and extracted primitives needed to reproduce the results will be released accordingly, containing: (i) the full analysis pipeline (Takens embedding, DM-G skeletonization, DM-cycle and DM-path extraction, and the W2→MDS→KW_2 \to\mathrm{MDS} \to K-means clustering of § 4.3); (ii) the heuristic auto-labeling and proofreading pipeline of Appendix § 8.§ 3 together with the proofread rat_labels.csv; and (iii) configuration files that generate every table and figure in the paper.

Determinism and seeds. DM-G skeletonization and primitive extraction are deterministic given a feature space and its hyperparameters (Appendix § 8.19.1), so the seed spread of the DM-WKC results comes only from the MDS embedding and the KK-means stage. The stochastic baselines and the MDS and KK-means stages are run over three fixed seeds (0, 1, 2), and the tables report their mean and standard deviation. Mapper’s only stochastic elements are the subsample used for the graph fit and the sample used to set the DBSCAN neighbourhood radius (Appendix § 8.19.3), so its seed spread reflects subsampling rather than the algorithm itself. The subsample also fixes the neighbourhood size kk at which the lens graph first becomes connected, so on qpos that value varies across seeds.

Inputs. The trajectories analyzed are rollouts of a trained MIMIC-MJX imitation policy [32]. The derived per-clip feature arrays (intention, qpos, ekp) that DM-G consumes were extracted from those rollouts and will be released with the code, so the analysis can be reproduced without access to the emulator itself. The upstream markerless-capture recordings remain subject to the terms of their original release [32].

Hyperparameters and entry points. All DM-G and baseline hyperparameters are listed in Appendices § 8.19.1 and § 8.19.3, and the repository README maps each reported table and figure to the exact command that produces it.

Discovered Cluster Examples

Figure 10, Figure 11, Figure 12 and Figure 13 render discovered clusters for the four variants reported in Table 1: DMP-Qpos, DMC-Int, and the two baselines at their reported variants, KPMS-KP and Mapper-Qpos. Each figure shows up to six unique cluster labels (transition type with turn direction), two clusters per row and two members per cluster. Members are superimposed in the scene rather than laid out as a strip, so the poses sit where the animal actually was and the shape of the trajectory is visible alongside the posture. Within each cluster the two members should trace the same gross movement, which is the visual counterpart of the coherence numbers in Table 1.

DMP-Qpos cluster examples, seed 0

Figure 10. DMP-Qpos cluster examples, seed 0. Two clusters per row, two members per cluster, six poses per member superimposed in-scene under a shared camera and tinted light-to-dark by time. The title above each pair is the cluster’s majority-vote label. All five of this variant’s unique labels are shown.

DMC-Int cluster examples

Figure 11. DMC-Int cluster examples. Same layout as Figure 10; all six of this variant’s unique labels are shown.

KPMS-KP cluster examples

Figure 12. KPMS-KP cluster examples. Same layout as Figure 10. KPMS-KP yields 7 unique cluster labels at this seed, against 5 for DMP-Qpos and 6 for DMC-Int; six of the seven are shown, to keep every panel of this appendix on one page.

Mapper-Qpos cluster examples

Figure 13. Mapper-Qpos cluster examples. Same layout as Figure 10, for the Mapper variant reported in Table 1; all four of its unique labels are shown.

References

  1. [1]Diego Aldarondo, Josh Merel, Jesse D. Marshall, Leonard Hasenclever, Ugne Klibaite, Amanda Gellis, Yuval Tassa, Greg Wayne, Matthew Botvinick, and Bence P. Ölveczky. A virtual rodent predicts the structure of neural activity across behaviours. Nature, 632:594–602, 2024. doi: 10.1038/s41586-024-07633-4.DOI
  2. [2]Samik Banerjee, Lucas Magee, Dingkang Wang, Xu Li, Bing-Xing Huo, Jaikishan Jayakumar, Katherine Matho, Meng-Kuan Lin, Keerthi Ram, Mohanasankar Sivaprakasam, Josh Huang, Yusu Wang, and Partha P. Mitra. Semantic segmentation of microscopic neuroanatomical data by combining topological priors with encoder–decoder deep networks. Nature Machine Intelligence, 2(10):585–594, 2020. doi: 10.1038/s42256-020-0227-9.DOI
  3. [3]Ulrich Bauer, Michael Kerber, Jan Reininghaus, and Hubert Wagner. PHAT – persistent homology algorithms toolbox. Journal of Symbolic Computation, 78:76–90, 2017. doi: 10.1016/j.jsc.2016.03.008.DOI
  4. [4]Mikołaj Bińkowski, Danica J. Sutherland, Michael Arbel, and Arthur Gretton. Demystifying MMD GANs. In International Conference on Learning Representations, 2018.arxiv.org/abs/1801.01401
  5. [6]Olaf Delgado-Friedrichs, Vanessa Robins, and Adrian Sheppard. Skeletonization and partitioning of digital images using discrete Morse theory. IEEE Transactions on Pattern Analysis and Machine Intelligence, 37(3):654–666, 2015. doi: 10.1109/TPAMI.2014.2346172.
  6. [7]Tamal K. Dey, Jiayuan Wang, and Yusu Wang. Graph reconstruction by discrete morse theory. In 34th International Symposium on Computational Geometry, volume 99 of Leibniz International Proceedings in Informatics, pages 31:1–31:15, 2018. doi: 10.4230/LIPIcs.SoCG.2018.31.DOI
  7. [8]Tamal Krishna Dey and Yusu Wang. Computational Topology for Data Analysis. Cambridge University Press, 2022. doi: 10.1017/9781009099950.DOI
  8. [9]Herbert Edelsbrunner and John Harer. Computational Topology: An Introduction. American Mathematical Society, 2010. ISBN 978-0-8218-4925-5.
  9. [10]Rémi Flamary, Nicolas Courty, Alexandre Gramfort, Mokhtar Z. Alaya, Aurélie Boisnunon, Stanislas Chambon, Laetitia Chapel, Adrien Corenflos, Kilian Fatras, Nemo Fournier, Léo Gautheron, Nathalie T. H. Gayraud, Hicham Janati, Alain Rakotomamonjy, Ievgen Redko, Antoine Rolet, Antony Schutz, Vivien Seguy, Danica J. Sutherland, Romain Tavenard, Alexander Tong, and Titouan Vayer. POT: Python optimal transport. Journal of Machine Learning Research, 22(78):1–8, 2021.
  10. [11]Robin Forman. Morse theory for cell complexes. Advances in Mathematics, 134(1):90–145, 1998. doi: 10.1006/aima.1997.1650.DOI
  11. [12]Richard J. Gardner, Erik Hermansen, Marius Pachitariu, Yoram Burak, Nils A. Baas, Benjamin A. Dunn, May-Britt Moser, and Edvard I. Moser. Toroidal topology of population activity in grid cells. Nature, 602(7895):123–128, 2022. doi: 10.1038/s41586-021-04268-7.DOI
  12. [13]Attila Gyulassy, Mark Duchaineau, Vijay Natarajan, Valerio Pascucci, Eduardo Bringa, Andrew Higginbotham, and Bernd Hamann. Topologically clean distance fields. IEEE Transactions on Visualization and Computer Graphics, 13(6):1432–1439, 2007. doi: 10.1109/TVCG.2007.70603.DOI
  13. [14]Aric A. Hagberg, Daniel A. Schult, and Pieter J. Swart. Exploring network structure, dynamics, and function using NetworkX. In Gaël Varoquaux, Travis Vaught, and Jarrod Millman, editors, Proceedings of the 7th Python in Science Conference (SciPy 2008), pages 11–15, Pasadena, CA USA, 2008.
  14. [15]Alexander I. Hsu and Eric A. Yttri. B-SOiD, an open-source unsupervised algorithm for identification and fast prediction of behaviors. Nature Communications, 12:5188, 2021. doi: 10.1038/s41467-021-25420-x.DOI
  15. [16]Kevin Luxem, Petra Mocellin, Falko Fuhrmann, Johannes Kürsch, Stephanie R. Miller, Jorge J. Palop, Stefan Remy, and Pavol Bauer. Identifying behavioral structure from deep variational embeddings of animal motion. Communications Biology, 5:1267, 2022. doi: 10.1038/s42003-022-04080-7.DOI
  16. [17]Lucas Magee and Yusu Wang. Graph skeletonization of high-dimensional point cloud data via topological method. Journal of Computational Geometry, 13(1):429–470, 2022. doi: 10.20382/jocg.v13i1a16. Earlier version available as arXiv:2109.07606.DOI
  17. [18]Josh Merel, Diego Aldarondo, Jesse Marshall, Yuval Tassa, Greg Wayne, and Bence Ölveczky. Deep neuroethology of a virtual rodent. In International Conference on Learning Representations, 2020.arxiv.org/abs/1911.09451
  18. [19]Gabriel Peyré and Marco Cuturi. Computational optimal transport: With applications to data science. Foundations and Trends in Machine Learning, 11(5-6):355–607, 2019. doi: 10.1561/2200000073.
  19. [20]Vanessa Robins, Peter J. Wood, and Adrian P. Sheppard. Theory and algorithms for constructing discrete Morse complexes from grayscale digital images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(8):1646–1658, 2011. doi: 10.1109/TPAMI.2011.95.DOI
  20. [21]Erik Rybakken, Nils Baas, and Benjamin Dunn. Decoding of neural data using cohomological feature extraction. Neural Computation, 31(1):68–93, 2019. doi: 10.1162/neco_a_01150.DOI
  21. [22]Manish Saggar, James M. Shine, Raphaël Liégois, Nico U. F. Dosenbach, and Damien Fair. Precision dynamical mapping using topological data analysis reveals a hub-like transition state at rest. Nature Communications, 13(1):4791, 2022. doi: 10.1038/s41467-022-32381-2.DOI
  22. [23]Gurjeet Singh, Facundo Mémoli, and Gunnar Carlsson. Topological methods for the analysis of high dimensional data sets and 3D object recognition. In Eurographics Symposium on Point-Based Graphics, pages 91–100, 2007. doi: 10.2312/SPBG/SPBG07/091-100.
  23. [24]Thierry Sousbie. The persistent cosmic web and its filamentary structure – I. theory and implementation. Monthly Notices of the Royal Astronomical Society, 414(1):350–383, 2011. doi: 10.1111/j.1365-2966.2011.18394.x.DOI
  24. [25]Floris Takens. Detecting strange attractors in turbulence. In Dynamical Systems and Turbulence, Warwick 1980, volume 898 of Lecture Notes in Mathematics, pages 366–381. Springer, 1981. doi: 10.1007/BFb0091924.DOI
  25. [26]Naftali Tishby, Fernando C. Pereira, and William Bialek. The information bottleneck method. arXiv preprint physics/0004057, 2000.
  26. [27]Emanuel Todorov, Tom Erez, and Yuval Tassa. MuJoCo: A physics engine for model-based control. In 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, pages 5026–5033. IEEE, 2012. doi: 10.1109/IROS.2012.6386109.DOI
  27. [28]Nguyen Xuan Vinh, Julien Epps, and James Bailey. Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance. Journal of Machine Learning Research, 11:2837–2854, 2010.
  28. [29]Suyi Wang, Yusu Wang, and Yanjie Li. Efficient map reconstruction and augmentation via topological methods. In Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 1–10, 2015. doi: 10.1145/2820783.2820833.DOI
  29. [30]Caleb Weinreb, Jonah E. Pearl, Sherry Lin, Mohammed Abdal Monium Osman, Libby Zhang, Sidharth Annapragada, Eli Conlin, Red Hoffmann, Sofia Makowska, Winthrop F. Gillis, Maya Jay, Shaokai Ye, Alexander Mathis, Mackenzie W. Mathis, Talmo Pereira, Scott W. Linderman, and Sandeep Robert Datta. Keypoint-MoSeq: Parsing behavior by linking point tracking to pose dynamics. Nature Methods, 21(7):1329–1339, 2024. doi: 10.1038/s41592-024-02318-2.DOI
  30. [31]Alexander B. Wiltschko, Matthew J. Johnson, Giuliano Iurilli, Ralph E. Peterson, Jesse M. Katon, Stan L. Pashkowski, Victoria E. Abraira, Ryan P. Adams, and Sandeep Robert Datta. Mapping sub-second structure in mouse behavior. Neuron, 88(6):1121–1135, 2015. doi: 10.1016/j.neuron.2015.11.031.DOI
  31. [32]Charles Y. Zhang, Yuanjia Yang, Aidan Sirbu, Elliott T. T. Abe, Emil Wärnberg, Eric J. Leonardis, Diego E. Aldarondo, Adam Lee, Aaditya Prasad, Jason Foat, Kaiwen Bian, Joshua Park, Rusham Bhatt, Vyom N. Patel, Hutton Saunders, Austin O. Barbano, Akira Nagamori, Ayesha R. Thanawalla, Kee Wui Huang, Fabian Plum, Hendrik K. Beck, Steven W. Flavell, David Labonte, Blake A. Richards, Bingni W. Brunton, Eiman Azim, Bence P. Ölveczky, and Talmo D. Pereira. MIMIC-MJX: Neuromechanical emulation of animal behavior, 2025.arxiv.org/abs/2511.20532

Paper details

vlnc:W_6rzmxv7h
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 6

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents