AIarXiv

Ranked by formulaVerdict: Notable

Geodesic-SVDD Latent Mixup for One-Shot Distributed Tabular Learning

Distributed Learning on structured data is a key and widely adopted approach in privacy-sensitive sectors, ranging from financial fraud prevention to federated healthcare diagnostics.

By Moleri, Internò, Olhofer +2

Score████░░░░░░3.7

VerdictWorth a reader's time today.

Read the originalPDF

Abstract

Distributed Learning on structured data is a key and widely adopted approach in privacy-sensitive sectors, ranging from financial fraud prevention to federated healthcare diagnostics. While Gradient Boosted Decision Trees are widely used in centralized settings due to their efficiency, they are incompatible with standard gradient-based federated learning protocols because of their non-differentiability. Conversely, standard deep classifiers that are amenable to federated optimization often suffer from catastrophic forgetting under label distribution skew. In this work, to address these gaps we propose Geodesic-SVDD, a framework for Distributed Spherical Prototype Learning that recasts each client's task as one-class density estimation on the hypersphere, so that local models can be aggregated as probabilistic manifolds in a single round. Specifically, for each client, we employ a Residual Spherical Encoder and Geodesic Latent Mixup that enforces strict hyperspherical constraints (\|φ(x)\| equiv 1), preventing the manifold collapse observed in linear approximations. Furthermore, leveraging this insight, we propose a novel One-Shot "Product of Experts" protocol that enables privacy-preserving aggregation without iterative synchronization. Finally, we mechanistically analyze the trade-off between interpolation strategies, demonstrating that while linear mixup offers an enticing computational shortcut, it destabilizes optimization gradients by orders of magnitude (10⁹×). Across five tabular benchmarks and four levels of label skew, Geodesic-SVDD attains the highest mean AUROC among seven federated methods, outperforms federated tree ensembles by up to 21 AUROC points on Covertype, and its One-Shot variant matches centralized Deep SVDD under IID and mild skew with a single communication round.

Andrea Moleri, Christian Internò, Markus Olhofer, Barbara Hammer, Ali Raza

The editor's rubric

Heuristic review

Leverage3 / 5
A method or resource many groups across the field will adopt within a year.
24% of this desk’s rubric
Magnitude4 / 5
A qualitative jump: a capability or regime that did not exist before.
18% of this desk’s rubric
Evidence3 / 5
Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
14% of this desk’s rubric
Novelty2 / 5
A new combination of known ideas.
16% of this desk’s rubric
Trajectory3 / 5
A clear path to scale.
18% of this desk’s rubric
Stakes2 / 5
Benefits a professional community (practitioners, clinicians, engineers).
10% of this desk’s rubric

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose); breadth (many tasks); gains (x-fold, orders of magnitude, outperforms); verification (multiple benchmarks); scale (orders of magnitude, efficient); stakes (prevention or cure).

How the score was computed

rank-2026-10-18

Score████░░░░░░3.7

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Desks place stronger verdicts first, then use this score to order work within the same verdict.

Merit
5.8 / 10
Weighted rubric, evidence-gated.
Adjusted merit
4.9 / 10
Shrunk toward the desk prior by editor confidence (48%).
Attention
0%
Citations, upvotes, points, mentions.
Freshness
49%
Half-life decay since publication.

No attention signals recorded yet.

The record

  • Reviewed by heuristic-v10 on Oct 27, 2026, 01:36 UTC. Paper type: method.
  • Categories: cs.LG
  • BRIEF, No.3 in the Artificial Intelligence edition of October 27, 2026.
Geodesic-SVDD Latent Mixup for One-Shot Distributed Tabular Learning · Humanity's List