Skip to main content
Search

Carnegie Mellon University

42 related articles

Subscribe to updates
  1. bioRxiv

    Cryo-FIB-SEM volumes stop drowning in charging artifacts: a two-stage restoration lets a standard FIB-SEM membrane predictor read them directly

    Cryo focused-ion-beam scanning electron microscopy images cells in a near-native hydrated state in 3D, but charging artifacts, noise and weak membrane contrast have long hampered interpretation. A post-acquisition two-stage deep-learning pipeline translates cryo images toward the conventional room-temperature FIB-SEM domain: stage one suppresses large-scale artifacts slice by slice, and stage two uses five consecutive slices to enhance membrane contrast. On 164 held-out synthetic images, stage one raised mean paired PSNR by 16.74 dB over degraded inputs; across four experimental datasets, visible artifacts decreased and membranes became clearer, and the pretrained CebraNET membrane predictor could be applied directly to the processed volumes without retraining.

  2. arXiv

    Multi-talker transcription stops decoding each speaker alone: Pandemonium lets speakers see each other and reaches 14.7 average cpWER on meeting benchmarks

    Target-speaker recognition for multi-talker meetings previously decoded each speaker independently and was confined to 30-second windows. Pandemonium moves the diarization conditioning onto the longform Parakeet backbone, which decodes a whole conversation in one pass, and adds cross-speaker attention plus a mask refiner so that the speakers of one conversation become visible to each other inside the encoder. Trained on synthetic, pseudo-labeled and real data, it reaches state-of-the-art results across several meeting benchmarks, with an average cpWER of 19.2 under predicted diarization.

  3. Pharmacophore constraints go straight into 3D diffusion: PharmaDiff hits a 0.6990 exact-match rate without a target structure

    PharmaDiff turns a 3D pharmacophore hypothesis into an atom-level subgraph and injects it as a condition into diffusion-based generation, producing 3D molecules that follow the prescribed spatial arrangement. Across 250 pharmacophore conditions drawn from the GEOM-Drugs test set it reaches a mean match score of 0.8964 and a perfect match rate of 0.6990, above PGMG, TransPharmer, REINVENT4, ShEPhERD and PhoreGen; its average docking scores on four targets also beat DiffSBDD, which needs the protein structure, though its PoseBusters pass rate is below ShEPhERD and PhoreGen.

  4. arXiv

    Enzyme–reaction pairing moves beyond sequence similarity: RIVER pools evidence with multiple agents and places all four target enzymes near the top of 667 candidates

    RIVER is a training-free multi-agent retrieval framework that organizes large language models, biochemical computational tools and external knowledge resources into traceable evidence chains for bidirectional enzyme-to-reaction and reaction-to-enzyme retrieval. In four experimentally supported enzyme–reaction cases drawn from an E. coli metabolomics study, it ranked among 667 candidate proteins with a mean reciprocal rank of 0.833 using Qwen3.6-35B-A3B and 0.750 using GPT-5.6 Luna, above the general-purpose coding-agent combinations and domain methods listed in the comparison table. On public benchmarks it reached Top-1 query success rates of 82.3% on Enzyme-405 and 72.8% on Orphan-335.

  5. arXiv

    Computer-use agents stop swallowing every screenshot: VTR co-trains a router to keep 2.5–5.8× fewer visual tokens at full-resolution performance

    Computer-use agents encode each screenshot into thousands of visual tokens, and those tokens pile up into long contexts on long-horizon tasks and in real-time games. VTR trains a vision-language model jointly with a lightweight spatio-temporal router that inspects the same image region in the current and previous screenshots and decides whether that token enters the language model, using an adaptive loss to keep as few tokens as possible without losing action prediction. After only 2,000 training steps, VTR matches the full-resolution model on OSWorld, CUA-World and video-game action prediction while using 2.5–5.8× fewer visual tokens, cutting inference cost by up to 3.3× and speeding prefill by up to 2.9×.

  6. arXiv

    CyberArena puts AI agents in live attack-and-defense combat, and two frontier models pull ahead of the field

    CyberArena turns cybersecurity evaluation from static targets into multi-round combat: two agents in isolated sandboxes attack each other's services while patching their own, with objectives rotating every round. Across 40 challenges and 466 games, GPT-5.6 Sol and Claude Opus 5 led 12 frontier agents, and on 30 challenges all three compared models solved solo, round-three capture rates fell to 52%, 37% and 35%.

  7. arXiv

    Nine AI agents wrote 135 research follow-ups, and none cleared the domain scientists' bar on integrity, completeness and sufficiency

    Scientists at US Department of Energy national laboratories set the conditions an unpublished follow-up direction must meet, and nine frontier AI agents each wrote 15 follow-up papers, 135 in total. None passed all three checks of integrity, completeness and sufficiency, and 114 failed the integrity check, most often by claiming work that was never done or reporting numbers that contradict the recorded evidence. Agents readily produce papers that look like follow-ups, but none meets the standard the domain scientist set.

  8. arXiv

    Robota-Embed puts motion into the retrieval key: 47.33% clip-level R@1 on an 8,000-clip robot-experience gallery

    When a robot draws on past experience, matching usually relies on task or scene similarity, which cannot separate execution stages such as approaching a bowl from having already placed something in it. Robota-Embed encodes language, vision and native action together in both the current-state query and the recorded future clip, so motion enters the retrieval key itself. On Robota-Embed-Bench, 4,000 queries against a shared 8,000-clip gallery, it reaches 47.33% clip-level and 81.77% episode-level R@1; the abstract reports gains of 22.09 and 33.47 percentage points over the action-free Gemini Embedding 2, while Section 4.1 gives 22.09 and 33.18 points.

  9. arXiv

    Low-bit inference stops choosing between accuracy and speed: StrataFlux streams refinement bits from RAM and SSD, cutting 2-bit Llama-3.1-8B perplexity from 9.46 to 8.40

    StrataFlux, from Cornell and Carnegie Mellon researchers, keeps low-bit weights and KV cache resident on the GPU and fetches only a small set of refinement bits from host RAM or SSD for the computation at hand, recovering accuracy while retaining quantization's memory and speed advantages. On an RTX 5090, 2-bit Llama-3.1-8B-Instruct weights drop WikiText-2 perplexity from 9.46 to 8.40 while keeping 95.4% of the quantized base's throughput; with 2-bit weights and KV, Qwen3-8B's AIME 2024/2025 accuracy rises from 11.0% to 47.1% at unchanged GPU memory use.

  10. arXiv

    Online assignment of reusable resources stops ranking by match score alone: LAG prices in opportunity cost and beats greedy by up to 12.3% on peer-review data

    Online assignment of reusable resources such as reviewers, call agents and servers has long relied on greedy matching: dispatch whichever available resource scores highest now, ignoring the value lost when it is occupied later. LAG casts the problem as a contextual restless multi-armed bandit and uses an occupancy-measure linear program, together with its dual, to compute a closed-form index for each task-type and resource pair, equal to the match score minus the opportunity cost of keeping that resource free. On peer-review data and structured synthetic instances, LAG reaches 83–99% of that linear program's upper bound and improves over greedy by up to 12.3% on journal data and up to 36% on synthetic instances.