Skip to main content
Search

Sorbonne Université

6 related articles

Subscribe to updates
  1. bioRxiv

    Fox skips tree building for host-symbiont coevolution: reading paired alignments directly, it runs over three orders of magnitude faster than an ABC baseline

    Estimating the frequencies of host-symbiont coevolution events used to require reconstructing a host tree and then reconciling the symbiont tree against it, so tree-inference error propagated into the result. Fox instead uses a transformer to output the relative frequencies of cospeciation, host switching, loss and duplication directly from the host and symbiont multiple sequence alignments and their mapping, paying the simulation cost once at training time and processing each new system in a single forward pass. On the independent simulator treeducken, Fox reached a mean absolute error of 0.060 on the 92 datasets AmoCoala completed, against 0.131 for AmoCoala, while running more than three orders of magnitude faster.

  2. medRxiv

    Is a new gene link actually new? PESTO sorts 940 associations into four evidence tiers and calls 7% novel

    Rare-variant studies now yield more significant gene-phenotype associations than teams can place against prior evidence, and that placement has become the tighter bottleneck. PESTO combines large language model literature curation with structured Open Targets genetic evidence in one agentic pipeline that assigns Novel, Hypothesized, Existing or Established with supporting citations. Across 940 unique associations from two rare-variant studies, 7% were called Novel and 21% Hypothesized; 86% of 50 randomly paired negative controls fell into those two tiers.

  3. arXiv

    Systematic evaluation of streaming tabular foundation models: TabFM+FIFO leads on nearly all nine streams but serves over an order of magnitude slower than the fastest ensemble

    In a unified prequential (test-then-train) protocol across real and synthetic streams, this study systematically compares tabular foundation models (TFMs) with streaming learners and streaming AutoML, finding that TFMs reach the highest predictive accuracy, recover faster after drift, and stay most accurate under label delay, but cost more than an order of magnitude more to serve; memory size and backbone quality matter more than the memory management policy, and repeated context encoding is the dominant cost, which a compact causal model with cached encoded context can hold nearly constant across memory sizes at close accuracy.

  4. arXiv

    Where-OPD gives the teacher textual spatial hints over procedurally generated scenes, raising real-image averages by 3.23, 1.07 and 1.29 points across three MLLMs

    The work introduces Where-OPD, an on-policy self-distillation scheme in which the teacher additionally receives textual spatial hints naming question-relevant visual elements and their coordinates while the student sees only the image and question; training data is generated procedurally from geometric counting scenes with no human annotation or external teacher, and across Qwen3.5-4B, Qwen3.5-9B and Qwen3-VL-4B it improves counting, document and chart benchmarks and lifts the average over CVBench, V*, ZoomBench, BLINK, HR-Bench and MME-RealWorld by 3.23, 1.07 and 1.29 points despite training only on synthetic scenes.

  5. arXiv

    Predator self-competition and prey mobility jointly set spatial structure in an additional-food predator-prey system: weak competition gives whole-field oscillations, stronger competition gives fixed patches, and near the crossover the two combine into pulsing patterns

    The study builds a reaction-diffusion predator-prey model with additional food and predator intraspecific competition, locates the Hopf bifurcation of the coexistence state exactly in the well-mixed setting and shows the resulting cycle is stable, derives the diffusion-driven Turing threshold in the spatial setting, and finds that with prey mobility and competition strength as control parameters the pattern-forming and oscillatory instabilities meet at a single point, with simulations confirming that weak competition gives a whole-field oscillation, stronger competition with faster prey spread gives fixed patterns, and near the crossover the two combine into patterns that pulse in time.

  6. Mapping Pauli pools to F2 binary matrices lets the authors certify minimal complete pools in O(N³) by matrix rank and push NI-DUCC-VQE to a 26-qubit H2O

    The authors introduce a general framework based on Lie-algebraic properties that maps a pool of Pauli operators to a binary matrix ΓA over F2, proves that pool completeness and minimality can be decided in polynomial O(N³) time via the rank and congruence relations of that matrix, uses it to construct minimal complete pools (MCPs), proposes MB-ADAPT-VQE (adding a batch of k operators per iteration) to cut measurement overhead and accelerate convergence in quantum chemistry, and extends the fixed-ansatz NI-DUCC-VQE method, previously limited to N≤14 qubits by the MCP construction bottleneck, to a 26-qubit H2O system.

You’re all caught up