Skip to main content
Search

Université Paris 1 Panthéon-Sorbonne

2 related articles

Subscribe to updates
  1. 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.

  2. 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