Skip to main content
Search

University of Michigan

22 related articles

Subscribe to updates
  1. Advanced Science

    Enzyme function prediction learns from unlabeled homologs: EZpred lifts four-digit EC F1 to 0.786 on 720 newly annotated enzymes

    EZpred carries the homolog-based features long used in protein structure prediction into enzyme function prediction, taking only sequence features from homologs and ignoring their function labels. Most deep learning models for this task read features from the target sequence alone, and the few that use homologs only aggregate labeled ones. On 720 enzymes with new EC numbers in UniProt 2024_02, EZpred reaches an F1 of 0.786 for full four-digit EC numbers, 27% and 31% above CLEAN and GraphEC.

  2. bioRxiv

    No bend sensors needed for finger labels: Freebie tracks primate hands in real time with a 16 ms median latency

    Finger-movement labels in non-human primates have long come from instrumented manipulanda fitted with bend sensors, which cap the dimensionality of measurable movement. Freebie uses several synchronized cameras and real-time pose estimation to output finger keypoints directly, reaching median end-to-end latencies of 15.8 ms at 30 FPS and 16.2 ms at 60 FPS, with a median absolute correlation of 0.96 against bend-sensor signals. EMG decoders trained on Freebie labels matched those trained on bend-sensor labels in closed-loop control, indicating that training a decoder need not require instrumenting the hand.

  3. arXiv

    World models need not rerun per candidate: one extraction of local shape scores sixteen actions faster than the source generator

    Extracting the local shape of the action-conditioned data manifold once lets any number of candidate actions be scored by matrix multiplication alone, making sixteen candidates over an order of magnitude faster than the source generator and more accurate at short horizons.

  4. arXiv

    Corrupted distances, still a near-optimal spanning tree: logarithmic approximation under arbitrary tampering, with no true-distance queries

    In a metric whose pairwise distances are each corrupted with fixed probability by an adversary, an algorithm sees only the corrupted values. For increase-only, decrease-only and unrestricted corruption, the work gives polynomial-time or quasi-polynomial-time approximations, reaching a logarithmic factor in the unrestricted case that matches the known information-theoretic lower bound, all without querying true distances.

  5. arXiv

    Language models keep giving the same answer: search embedding gaps to cut collisions by up to 12.8%

    Language models often return semantically similar answers to open-ended questions even when many plausible alternatives exist. Gap Detection searches a shared text embedding space for relevant but unoccupied directions, scoring each by the product of query relevance (Demand) and dissimilarity to the nearest existing item (Defensibility), then mapping directions to concept words and text. On five curated topics and 90 INFINITY-CHAT queries, reported mean relative reductions in output Collision are 12.8% and 10.8%; in iterative synthetic-data augmentation with 100 training examples per method, Collision falls from 0.324 to 0.298 and the Vendi Score rises from 27.16 to 29.20, while accuracy differs by one example on a 40-example test set.

  6. arXiv

    World models stop guessing whole frames: learn an uncertainty map, let diffusion fill only what it must

    D3WM splits next-frame prediction into a deterministic part and an uncertain part, using a learned uncertainty map to steer a diffusion model toward occlusions and dynamic textures, and it beats comparison world models on both robotic manipulation and camera motion.

  7. arXiv

    Vascular CT super-resolution stops chasing pixels: vessels get their own 3D label space, and broken portal veins reconnect

    Vessels reconstructed from low-resolution contrast-enhanced CT can come out broken, spurious, or wrongly connected, and image-quality metrics do not capture those structural errors. VascuSR separates vascular structure from CT intensity reconstruction: a conditional 3D rectified-flow refiner corrects vessels in label space, a lightweight controller injects the refined structure into the diffusion decoder, and each new super-resolved volume re-extracts the structure for the next round. On re-annotated MSD Task08 and HVM, it beats interpolation and learning-based baselines in Dice and clDice, cuts class-averaged connected-component counts by over 20% on both datasets and mean centerline distance by over 10% on MSD, while keeping image quality comparable to its SR backbone.

  8. arXiv

    Masked diffusion models no longer pay for sequence length: latent structure sets the sample count

    Transformer-based masked diffusion models now have an end-to-end statistical guarantee: when the data distribution is well approximated by a mixture of hidden Markov trees, the training samples needed for a target KL accuracy are governed by latent structural complexity rather than growing exponentially with the sequence space. The analysis covers both the parallelization error of parallel unmasking and the finite-sample estimation error of the mask predictor, and the transformer architecture and sampling procedure need no knowledge of tree topologies or component parameters, adapting to unknown latent structure.

  9. arXiv

    Remory adds residual memory tokens to summaries, lifting SummHay citation F1 by 4.04 points and approaching full-context joint score

    Remory trains a neural memory network to append a bounded sequence of soft memory tokens after a generated summary, helping a frozen LLM approximate the continuation it would produce with the full history; on SummHay it raises citation F1 by 4.04 points and joint score by 3.55 using about 5.2% of input positions, and yields consistent gains for Qwen3.8-27B and GLM-5.3-Flash on long-horizon agent benchmarks while reducing repeated tool outputs and tool errors.

  10. arXiv

    An evidence-driven human-agent-robot teaming architecture for Earth-independent anomaly triage, demonstrated end to end with Reachy Mini and MARS

    The work presents an evidence-driven human-agent-robot teaming architecture for Earth-independent anomaly triage in deep-space crews: agentic AI acts only as a coordinator over explicit state and bounded, inspectable services, with a triage state manager holding hypotheses, evidence provenance and uncertainty, a crew-facing embodied agent eliciting observations and explaining assessment changes, and a mobile robot acquiring localized evidence; two scenarios, a Mars-transit case anchored on an actual ISS ammonia false alarm and a lunar-base power-interface anomaly, illustrate the architecture, and a hardware-in-the-loop prototype using Reachy Mini and an Innate MARS robot exercises the closed evidence loop end to end.