UME: Diverse Embeddings & Applications

• UME is a high-collision acronym with meanings that range from unified metadata embedding in image de-rendering to universal multimodal embedding in retrieval and beyond.
• Various implementations of UME demonstrate strong performance improvements, such as increased PSNR in image de-rendering and boosted retrieval accuracy through integrated reasoning.
• Its contextual interpretation depends on disciplinary specifics, with applications spanning computer vision, speech processing, geometric group theory, and combinatorial optimization.

Searching arXiv for the cited UME-related papers to ground the article in current records. UME is a recurrent acronym rather than a single technical term. In current arXiv literature it denotes, among other meanings, Unified Metadata Embedding in sRGB-to-RAW de-rendering, Universal Multimodal Embedding in cross-modal retrieval, Uniform Measured Equivalence in geometric group theory, Unified Multi-Speaker Encoder and Upcycling Mixture-of-Experts in speech processing, Universal Manifold Embedding in point-cloud registration, Uni-Modal Ensemble and Uni-Modal Ensemble with Missing Modality Adaptation in supervised multimodal learning, the uni-modular ensemble in random-matrix theory, the Unreactive Markovian Evader Interdiction problem in combinatorial optimization, a dedicated foundation model for electrodermal activity data, and the Universal Manipulation Exoskeleton in robotics. A plausible implication is that “UME” functions as a high-collision acronym whose meaning is determined almost entirely by disciplinary context (Chen et al., 2024, He et al., 2 Apr 2026, Das, 2015, Shakeel et al., 28 Aug 2025, Fu et al., 2024, Haitman et al., 2024, Du et al., 2023, 0911.4322, Joyner et al., 2017, Liang et al., 12 Jun 2026).

1. Acronymic scope and disciplinary usage

The main recorded meanings of UME in the cited literature are as follows.

UME expansion	Research area	Representative source
Unified Metadata Embedding	image and video de-rendering	(Chen et al., 2024)
Universal Multimodal Embedding	multimodal retrieval	(He et al., 2 Apr 2026)
Uniform Measured Equivalence	geometric group theory	(Das, 2015)
Unified Multi-Speaker Encoder	overlapping-speech modeling	(Shakeel et al., 28 Aug 2025)
Upcycling Mixture-of-Experts	automatic speech recognition	(Fu et al., 2024)
Universal Manifold Embedding	point-cloud registration	(Haitman et al., 2024)
Uni-Modal Ensemble	supervised multimodal learning	(Du et al., 2023)
Unreactive Markovian Evader Interdiction	network interdiction	(0911.4322)
uni-modular ensemble	random-matrix theory	(Joyner et al., 2017)
Universal Manipulation Exoskeleton	robot teleoperation	(Liang et al., 12 Jun 2026)

Some usages denote a module inside a larger architecture, such as Unified Metadata Embedding in RAWMamba. Others denote a task class or formal framework, such as Universal Multimodal Embedding or Uniform Measured Equivalence. Others are named systems or devices, such as the Universal Manipulation Exoskeleton and the UME oscillating-magnet Kibble balance. This suggests that acronym expansion alone is insufficient; the surrounding mathematical or application context is the operative definition.

2. Universal Multimodal Embedding in retrieval and reasoning

In retrieval literature, Universal Multimodal Embedding seeks a single embedding space in which heterogeneous inputs can be compared directly. The formal setup uses modality-specific mappings $f_m(x_m)\in\mathbb{R}^D$ into a shared space, with query–target alignment learned through bidirectional InfoNCE; in one formulation,

$$L_{NCE} = \frac{1}{N}\sum_{i=1}^N \left[-\log \frac{\exp(\mathrm{sim}(f(q_i),f(t_i))/\tau)} {\sum_{j=1}^N \exp(\mathrm{sim}(f(q_i),f(t_j))/\tau)}\right],$$

with $\mathrm{sim}(u,v)=u^\top v/(\|u\|\|v\|)$ (He et al., 2 Apr 2026).

A major line of work studies whether intermediate reasoning improves such embeddings. "Think Then Embed" introduces a reasoner–embedder decomposition in which a multimodal LLM first generates a reasoning trace $\psi=g_\omega(V,\mathrm{Ins},T)$ and an embedder then produces $h=\mathrm{Pool}(f_\theta(V,\mathrm{Ins},T,\psi))$ (Cui et al., 6 Oct 2025). On MMEB-V2, the reported overall averages are 61.2% for VLM2Vec-V2-7B, 68.6% for TTE_s-7B, and 71.5% for TTE_t-7B. The same study reports that simply prompting the backbone already boosts retrieval by approximately 3–4 points, while supervised fine-tuning of the reasoner adds another approximately 6 points (Cui et al., 6 Oct 2025).

PLUME replaces explicit chain-of-thought with a short autoregressive rollout of continuous latent states, steered by a semantic-anchor-guided transition adapter and trained through a progressive explicit-to-latent curriculum (He et al., 2 Apr 2026). On the 78-task MMEB-v2 benchmark, PLUME reports 66.3 on Image, 44.1 on Video, 67.5 on VisDoc, and 61.6 overall, compared with 60.1 overall for UME-R1 and 58.0 for VLM2Vec-V2. The efficiency comparison on a single NVIDIA H20 GPU reports 8 latent steps and 298 ± 12 ms/sample for PLUME, versus 403 reasoning tokens and 9023 ± 187 ms/sample for UME-R1, yielding a 30.3× speedup (He et al., 2 Apr 2026).

Embed-RL shifts the emphasis from verbal rationales to retrieval-aligned evidential Traceability CoT optimized by Embedder-Guided Reinforcement Learning. Its reward combines format compliance, process alignment, and embedder-guided outcome alignment,

$$R_{\mathrm{total}}=\alpha R_{\mathrm{format}}+\beta R_{\mathrm{process}}+\gamma R_{\mathrm{outcome}},$$

with only the reasoner updated through GRPO (Jiang et al., 14 Feb 2026). On MMEB-V2, the reported overall scores are 64.5 for UME-R1-7B, 66.8 for Embed-RL-2B, and 68.1 for Embed-RL-4B; on UVRB, Embed-RL-4B is best on CG and FG and second on LC (Jiang et al., 14 Feb 2026).

Across these papers, UME denotes a retrieval paradigm rather than a specific architecture. The shared thread is a single embedding space for text, image, video, visual-document, and mixed inputs, while the main research divergence lies in how much explicit or latent intermediate reasoning is inserted before embedding.

3. Unified Metadata Embedding in sRGB-to-RAW de-rendering

In RAWMamba, UME denotes Unified Metadata Embedding, the first stage of a two-stage framework for sRGB-to-RAW de-rendering across both image and video domains (Chen et al., 2024). RAWMamba consists of UME and a reconstruction network built around Local Tone-Aware Mamba blocks. UME ingests the de-rendering sRGB input and associated metadata and produces a unified metadata embedding that is queried by the main network (Chen et al., 2024).

The module uses three CNN encoders: $f_1$ encodes the de-rendering sRGB frame(s) $x_{\mathrm{srgb}}\to F_{\mathrm{srgb}}$, $f_2$ encodes the sRGB portion of the metadata $x'_{\mathrm{srgb}}\to F'_{\mathrm{srgb}}$, and $$L_{NCE} = \frac{1}{N}\sum_{i=1}^N \left[-\log \frac{\exp(\mathrm{sim}(f(q_i),f(t_i))/\tau)} {\sum_{j=1}^N \exp(\mathrm{sim}(f(q_i),f(t_j))/\tau)}\right],$$0 encodes the RAW portion of the metadata $$L_{NCE} = \frac{1}{N}\sum_{i=1}^N \left[-\log \frac{\exp(\mathrm{sim}(f(q_i),f(t_i))/\tau)} {\sum_{j=1}^N \exp(\mathrm{sim}(f(q_i),f(t_j))/\tau)}\right],$$1 (Chen et al., 2024). Two parallel branches then extract reference cues: a Global Embedding Block and a Local Embedding Block. Their outputs are summed,

$$L_{NCE} = \frac{1}{N}\sum_{i=1}^N \left[-\log \frac{\exp(\mathrm{sim}(f(q_i),f(t_i))/\tau)} {\sum_{j=1}^N \exp(\mathrm{sim}(f(q_i),f(t_j))/\tau)}\right],$$2

The global branch forms a cross-affinity matrix

$$L_{NCE} = \frac{1}{N}\sum_{i=1}^N \left[-\log \frac{\exp(\mathrm{sim}(f(q_i),f(t_i))/\tau)} {\sum_{j=1}^N \exp(\mathrm{sim}(f(q_i),f(t_j))/\tau)}\right],$$3

and aggregates RAW metadata as $$L_{NCE} = \frac{1}{N}\sum_{i=1}^N \left[-\log \frac{\exp(\mathrm{sim}(f(q_i),f(t_i))/\tau)} {\sum_{j=1}^N \exp(\mathrm{sim}(f(q_i),f(t_j))/\tau)}\right],$$4. The local branch adds positional encodings, deformable offsets, and position-aware attention to produce $$L_{NCE} = \frac{1}{N}\sum_{i=1}^N \left[-\log \frac{\exp(\mathrm{sim}(f(q_i),f(t_i))/\tau)} {\sum_{j=1}^N \exp(\mathrm{sim}(f(q_i),f(t_j))/\tau)}\right],$$5 (Chen et al., 2024).

The unification problem is explicit: in image de-rendering the metadata is a sparse sampling of RAW pixels $$L_{NCE} = \frac{1}{N}\sum_{i=1}^N \left[-\log \frac{\exp(\mathrm{sim}(f(q_i),f(t_i))/\tau)} {\sum_{j=1}^N \exp(\mathrm{sim}(f(q_i),f(t_j))/\tau)}\right],$$6, with $$L_{NCE} = \frac{1}{N}\sum_{i=1}^N \left[-\log \frac{\exp(\mathrm{sim}(f(q_i),f(t_i))/\tau)} {\sum_{j=1}^N \exp(\mathrm{sim}(f(q_i),f(t_j))/\tau)}\right],$$7 and $$L_{NCE} = \frac{1}{N}\sum_{i=1}^N \left[-\log \frac{\exp(\mathrm{sim}(f(q_i),f(t_i))/\tau)} {\sum_{j=1}^N \exp(\mathrm{sim}(f(q_i),f(t_j))/\tau)}\right],$$8; in video de-rendering the metadata is the first-frame pair $$L_{NCE} = \frac{1}{N}\sum_{i=1}^N \left[-\log \frac{\exp(\mathrm{sim}(f(q_i),f(t_i))/\tau)} {\sum_{j=1}^N \exp(\mathrm{sim}(f(q_i),f(t_j))/\tau)}\right],$$9, with optical-flow-warped positional encodings and deformable offsets used to compensate motion (Chen et al., 2024). By treating both settings as a unified $\mathrm{sim}(u,v)=u^\top v/(\|u\|\|v\|)$0 metadata pair, the model avoids separate architectures for image and video de-rendering.

The reported ablation on the Sony SLT-A57 subset of CAM quantifies the contribution of UME. The baseline without UME gives PSNR = 48.83 dB; adding GEB only gives 51.91 dB; adding LEB only gives 52.03 dB; combining GEB and LEB gives 52.68 dB; and full RAWMamba with LTA-Mamba gives 55.22 dB (Chen et al., 2024). On image sRGB-to-RAW de-rendering on CAM, RAWMamba reports 53.13 dB versus a prior best of 49.76 dB. On video sRGB-to-RAW de-rendering on RVD-Part2, it reports 51.97 dB versus a prior best of 49.71 dB (Chen et al., 2024).

Within this literature, UME therefore denotes a metadata harmonization module with explicit cross-affinity and local position-aware alignment, rather than a generic embedding space.

4. UME in multimodal robustness and geometric registration

In supervised multimodal learning, UME can denote Uni-Modal Ensemble, a late-fusion method that trains each modality-specific predictor independently and combines their soft predictions as

$\mathrm{sim}(u,v)=u^\top v/(\|u\|\|v\|)$1

There are no cross-modal parameters to train after the uni-modal stages (Du et al., 2023). The underlying argument is that poor uni-modal feature learning can hurt generalization, and the paper provides a theorem under which the ensemble of the uni-modal predictors has a smaller 0–1 loss than the joint model (Du et al., 2023). Reported top-1 test accuracy for UME is 86.8 on UCF101 and 91.92 ± 0.14 on ModelNet40, exceeding the listed late-fusion and intermediate-fusion baselines in those settings (Du et al., 2023).

A related robustness-oriented variant is UME-MMA, short for Uni-Modal Ensemble with Missing Modality Adaptation. It uses uni-modal pre-trained weights inside a late-fusion multimodal model and performs on-the-fly missing-modality augmentation by replacing dropped inputs with modality-specific null substitutes (Li et al., 2023). The empirical summaries are large: on AV-MNIST under image-missing, audio-missing, and both settings, the naive ensemble average accuracy is approximately 60.98% and UME-MMA reports approximately 97.41%; on Kinetics-Sound it reports approximately 53.49% versus approximately 47.95%; on AVE it reports approximately 62.75% versus approximately 51.22%; with large ViT/ImageBind backbones on AVE it reports approximately 89.90% versus approximately 80.98%; on MM-IMDB with 20% text present it reports approximately 65.8 F1 versus approximately 54.6 F1; and on UPMC Food101 under 40% text it reports approximately 62% versus approximately 53% (Li et al., 2023).

In 3D geometry, UME instead denotes Universal Manifold Embedding. The core idea is to map observations of the same rigid object into a low-dimensional linear subspace whose column space is invariant to rigid motion, while the matrix representative is covariant under $\mathrm{sim}(u,v)=u^\top v/(\|u\|\|v\|)$2 (Haitman et al., 2024). In UMERegRobust, a colored point cloud is mapped to a matrix $\mathrm{sim}(u,v)=u^\top v/(\|u\|\|v\|)$3 whose span is a point on the Grassmann manifold $\mathrm{sim}(u,v)=u^\top v/(\|u\|\|v\|)$4, with transformation law

$\mathrm{sim}(u,v)=u^\top v/(\|u\|\|v\|)$5

where

$\mathrm{sim}(u,v)=u^\top v/(\|u\|\|v\|)$6

The extension adds a Sampling Equalizer Module, a UME-compatible sparse 3D convolutional feature extractor, a Grassmann-based UME contrastive loss, and an inference pipeline with matched manifold detection, RT-UME hypothesis generation, and feature-correlation-based hypothesis selection (Haitman et al., 2024).

The quantitative registration results are explicit. On KITTI, UMERegRobust reports 94.3 at RR@(1.5°, 0.6 m) and 87.8 at RR@(1°, 0.1 m), compared with 93.9 and 78.6 for GCL. On RotKITTI, it reports 81.1 and 73.3, compared with 40.1 and 28.8 for GCL (Haitman et al., 2024). The predecessor DeepUME combines a closed-form UME estimator based on second- and third-order moments with a learned joint-resampling strategy and SO(3)-invariant local features, trained end-to-end and in an unsupervised manner to overcome symmetry ambiguity and large-transformation scenarios (Lang et al., 2021).

These uses share the word “embedding,” but the mathematical object differs sharply: probability-vector fusion in late multimodal learning, missing-modality adaptation in late fusion, and Grassmannian or moment-based rigid-registration constructions in 3D geometry.

5. Mathematical meanings: measured equivalence, learnability, random matrices, and interdiction

In geometric group theory, UME stands for Uniform Measured Equivalence. For countable discrete groups $\mathrm{sim}(u,v)=u^\top v/(\|u\|\|v\|)$7 and $\mathrm{sim}(u,v)=u^\top v/(\|u\|\|v\|)$8, a measured coupling is a standard Borel space $\mathrm{sim}(u,v)=u^\top v/(\|u\|\|v\|)$9 with commuting, free, measure-preserving actions of both groups, each admitting a finite-measure fundamental domain. UME strengthens this by requiring that for every $\psi=g_\omega(V,\mathrm{Ins},T)$0, the translate $\psi=g_\omega(V,\mathrm{Ins},T)$1 be covered by finitely many $\psi=g_\omega(V,\mathrm{Ins},T)$2-translates of $\psi=g_\omega(V,\mathrm{Ins},T)$3; equivalently, the $\psi=g_\omega(V,\mathrm{Ins},T)$4-action on $\psi=g_\omega(V,\mathrm{Ins},T)$5 is uniformly bounded in terms of the $\psi=g_\omega(V,\mathrm{Ins},T)$6-action (Das, 2015). Kajal Das proves that coarse equivalence of box spaces implies UME of the underlying groups, and more generally that a coarse embedding of box spaces yields a UME-embedding (Das, 2015). Applications include cohomological-dimension monotonicity, proportionality of $\psi=g_\omega(V,\mathrm{Ins},T)$7-Betti numbers under coarse equivalence of box spaces, and the statement that no box-space of $\psi=g_\omega(V,\mathrm{Ins},T)$8 can coarsely embed into any box-space of $\psi=g_\omega(V,\mathrm{Ins},T)$9 for $h=\mathrm{Pool}(f_\theta(V,\mathrm{Ins},T,\psi))$0 (Das, 2015). A related theorem for warped cones shows that level-wise quasi-isometry, together with orbit and measure conditions, implies that the corresponding groups are quasi-isometric and uniformly measured equivalent (Das, 2020).

In statistical learning theory, UME denotes Uniform Mean Estimability or UME-learnability. Here a family $h=\mathrm{Pool}(f_\theta(V,\mathrm{Ins},T,\psi))$1 of probability measures on $h=\mathrm{Pool}(f_\theta(V,\mathrm{Ins},T,\psi))$2 is UME-learnable if there exists an estimator $h=\mathrm{Pool}(f_\theta(V,\mathrm{Ins},T,\psi))$3 such that

$h=\mathrm{Pool}(f_\theta(V,\mathrm{Ins},T,\psi))$4

Separability of the mean-vector set $h=\mathrm{Pool}(f_\theta(V,\mathrm{Ins},T,\psi))$5 in $h=\mathrm{Pool}(f_\theta(V,\mathrm{Ins},T,\psi))$6 is sufficient for UME-learnability, but not necessary: the paper constructs a non-separable tree-indexed family that is still UME-learnable and proves that countable unions of UME-learnable families are UME-learnable (Devale et al., 24 Oct 2025). The paper positions this as going beyond classical $h=\mathrm{Pool}(f_\theta(V,\mathrm{Ins},T,\psi))$7-Glivenko-Cantelli by allowing arbitrary estimators rather than only empirical means (Devale et al., 24 Oct 2025).

In random-matrix theory, the uni-modular ensemble is a Hermitian ensemble with off-diagonal entries of exact unit modulus,

$h=\mathrm{Pool}(f_\theta(V,\mathrm{Ins},T,\psi))$8

with independent uniform phases for $h=\mathrm{Pool}(f_\theta(V,\mathrm{Ins},T,\psi))$9 (Joyner et al., 2017). The large-$$R_{\mathrm{total}}=\alpha R_{\mathrm{format}}+\beta R_{\mathrm{process}}+\gamma R_{\mathrm{outcome}},$$0 mean moments exhibit the leading Catalan term as in Wigner-type ensembles, but the first non-universal correction is $$R_{\mathrm{total}}=\alpha R_{\mathrm{format}}+\beta R_{\mathrm{process}}+\gamma R_{\mathrm{outcome}},$$1 rather than $$R_{\mathrm{total}}=\alpha R_{\mathrm{format}}+\beta R_{\mathrm{process}}+\gamma R_{\mathrm{outcome}},$$2 as in the GUE. The paper derives these corrections and fluctuation results by supersymmetry, combinatorial graph theory, and Brownian motion with Stein’s method, and shows Gaussian limits for fixed linear statistics with explicit variances $$R_{\mathrm{total}}=\alpha R_{\mathrm{format}}+\beta R_{\mathrm{process}}+\gamma R_{\mathrm{outcome}},$$3 for the $$R_{\mathrm{total}}=\alpha R_{\mathrm{format}}+\beta R_{\mathrm{process}}+\gamma R_{\mathrm{outcome}},$$4th Chebyshev trace and Wasserstein convergence rate $$R_{\mathrm{total}}=\alpha R_{\mathrm{format}}+\beta R_{\mathrm{process}}+\gamma R_{\mathrm{outcome}},$$5 (Joyner et al., 2017).

In combinatorial optimization, UME denotes the Unreactive Markovian Evader Interdiction Problem. The optimization chooses binary interdiction variables on edges or nodes under a budget constraint to maximize the probability of capturing one or more evaders moving according to Markov chains (0911.4322). For multiple evaders, the objective aggregates the individual capture probabilities $$R_{\mathrm{total}}=\alpha R_{\mathrm{format}}+\beta R_{\mathrm{process}}+\gamma R_{\mathrm{outcome}},$$6 into $$R_{\mathrm{total}}=\alpha R_{\mathrm{format}}+\beta R_{\mathrm{process}}+\gamma R_{\mathrm{outcome}},$$7 (0911.4322). The main theorem proves that node-interdiction UME with $$R_{\mathrm{total}}=\alpha R_{\mathrm{format}}+\beta R_{\mathrm{process}}+\gamma R_{\mathrm{outcome}},$$8 evaders is NP-hard even with interdiction efficiencies $$R_{\mathrm{total}}=\alpha R_{\mathrm{format}}+\beta R_{\mathrm{process}}+\gamma R_{\mathrm{outcome}},$$9, an undirected unweighted graph, and a single target, via a reduction from Planar Vertex Cover using the Four Color Theorem (0911.4322). The complexity of the 1-evader case remains open (0911.4322).

These mathematical usages are unrelated in formal content. Their commonality is purely acronymic.

6. Speech, sensing, metrology, and embodied systems

In speech processing, UME can denote Unified Multi-Speaker Encoder, a shared-encoder architecture for speaker diarization, speech separation, and multi-speaker ASR (Shakeel et al., 28 Aug 2025). The backbone is OWSM v3.1, a stack of $f_1$0 E-Branchformer layers, and the key fusion mechanism is Residual Weighted-Sum Encoding,

$f_1$1

The model is trained end-to-end with diarization, SI-SDR separation, and joint CTC/attention ASR losses under PIT (Shakeel et al., 28 Aug 2025). Reported results include diarization error rates of 1.37% on Libri2Mix and 2.29% on Libri3Mix, separation scores of 95.64 STOI, 17.41 SDR, and 17.06 SI-SNR on Libri2Mix “mixclean,” and a 6.4% WER for multi-speaker ASR on Libri2Mix “mixclean” (Shakeel et al., 28 Aug 2025).

A different ASR meaning is Upcycling Mixture-of-Experts. Here UME converts pretrained dense ASR checkpoints into larger sparsely gated MoE architectures by replacing FFNs with $f_1$2 experts initialized by copying the dense FFN weights, freezing non-MoE layers, and adding a Switch-Transformer-style load-balancing loss with coefficient $f_1$3 (Fu et al., 2024). On a 170k-hour Mandarin/English mixture, the method reports 11.9% relative error-rate reduction over the pretrained baseline, comparable latency to the dense baseline, and up to 86.7% training-time reduction relative to training models of the same size from scratch (Fu et al., 2024).

In physiological time-series modeling, UME is the first dedicated foundation model for electrodermal activity data (Alchieri et al., 20 Feb 2026). The model uses a 1-D EfficientNet-style CNN of approximately 1 M parameters on 3-channel, 60 s windows of phasic, tonic, and raw EDA. It is trained by InfoNCE on EDAMAME, a 24-dataset collection comprising approximately 25,000 h from 634 users (Alchieri et al., 20 Feb 2026). The reported finding is that UME outperforms baselines in eight out of ten scenarios, matches generalist timeseries foundation models on average, and uses approximately 20× fewer FLOPs than Mantis, with UME at approximately 0.08 GFLOP versus Mantis at approximately 1.6 GFLOP (Alchieri et al., 20 Feb 2026).

In metrology, the UME oscillating-magnet Kibble balance is a compact one-phase balance in which a permanent-magnet assembly oscillates while the coil remains mechanically fixed, separating induced AC Faraday voltage from the coil’s DC resistive drop (Ahmedov et al., 2018). The measurement is organized around the virtual-power relation

$f_1$4

and the reported preliminary result is

$f_1$5

with a combined relative standard uncertainty of 6 ppm (Ahmedov et al., 2018).

In robotics, UME denotes the Universal Manipulation Exoskeleton, a 7-DoF upper-limb exoskeleton with quasi-direct-drive actuators, embedded IMU, and real-time haptic torque feedback for teleoperation (Liang et al., 12 Jun 2026). The hardware weighs approximately 12 kg, has total material cost of approximately \$1,900, and supports a universal retargeting algorithm to OpenArm, Franka, and X-ARM (Liang et al., 12 Jun 2026). The control loop maps robot torques back to exoskeleton torques through Jacobian-based moment transformations and runs at approximately 1 kHz (Liang et al., 12 Jun 2026). In autonomous policy learning, the reported success rates over 20 trials are 0.90 for box pushing, 0.85 for box flipping, 0.95 for GPU picking, and 0.95 for fridge retrieval, compared with lower rates for the no-torque and UMI baselines (Liang et al., 12 Jun 2026).

Taken together, these meanings show that UME can name a shared encoder, an MoE upcycling method, a time-series foundation model, a Kibble-balance apparatus, or an exoskeleton platform. The acronym therefore carries little standalone semantic content outside its local field-specific definition.