Compositional Boundaries for Density Fusion

• URL: http://arxiv.org/abs/2606.05871v1
• Date: Thu, 04 Jun 2026 08:45:59 GMT
• Title: Compositional Boundaries for Density Fusion
• Abstract summary: We study the requirement for binary fusion of weighted probability densities.<n>We establish a compositional boundary for local segment-valued fusion rules.<n>We show that this obstruction is local to endpoint-to-candidate binary balancing, whereas global divergence barycenters retain additive-weight local limits.
• Score: 26.01053678258559
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Distributed uncertainty-management systems often combine local probabilistic models along aggregation trees chosen by communication, privacy, or scheduling constraints. The final density should depend on the weighted sources, not on the particular order in which intermediate nodes combine them. We study this requirement as an algebraic compositionality problem for binary fusion of weighted probability densities. The central question is when a local fusion rule can be executed hierarchically while remaining order-invariant. We establish a compositional boundary for local segment-valued fusion rules. Within the class of continuous binary rules with additive output weights and weight-only coefficients, order-invariant hierarchical execution characterizes normalized weighted linear pooling; norm-induced segment balancing realizes the corresponding coefficient. Smooth endpoint-to-candidate $f$-divergence balancing has a different local geometry: its quadratic expansion induces square-root effective weights, showing why pairwise solvability alone is insufficient for schedule-independent fusion. We show that this obstruction is local to endpoint-to-candidate binary balancing, whereas global divergence barycenters retain additive-weight local limits. Finally, Gaussian mixtures show how the same issue appears in finite model classes: exact fusion is compositional, whereas stepwise compression is compositional only under a congruence condition on unnormalized component measures. These results distinguish exact schedule-independent fusion from global aggregation objectives and local approximation heuristics.

Related papers

• Characterizing Heterogeneous Rates in Finite Mixture Estimation via Partial Optimal Transport [88.55403215843967]
  Voronoi-based partial optimal transport (VPOT) for obtaining refined local and global convergence guarantees for the maximum likelihood estimator of the mixing measure.<n>Results hold in arbitrary fixed dimension without requiring mixing proportions to be uniformly bounded away from zero or prior knowledge of the true number of mixture components.
  arXiv  Detail & Related papers  (2026-09-15T04:32:53Z)
• Bargmann Invariants Are Insufficient for Complete Local-Unitary Orbit Discrimination [7.293435425629241]
  We show that ordinary Bargmann algebra coincides with the full local unitary invariant ring if and only if both subsystems are qubits.<n>The missing data are geometric: they encode the placement of global eigenspaces relative to the tensor-product decomposition.
  arXiv  Detail & Related papers  (2026-09-10T05:00:01Z)
• Finite-Probe Total-Variation Certificates for Finite-Basis Drifting Models [1.2072720711193232]
  We describe a frozen measurement system for integrable antisymmetric interactions and absolutely continuous laws in a declared finite density basis.<n>For Gaussian-RBF interactions, a global envelope supports distribution-free and empirical-Bernstein radii without truncation.<n>We characterize random-probe observability by a population Gram matrix, identify rank and symmetry degenera, and prove large-bandwidth collapse toward mean matching.
  arXiv  Detail & Related papers  (2026-08-03T00:00:40Z)
• On the Geometry of Separation in Finite Gaussian Mixtures [93.28335398145147]
  We study the effects of the minimum component separation on the convergence rates of parameter estimation in finite Gaussian mixtures.<n>We develop a unified geometric framework based on novel Hellinger lower bounds.<n>We obtain separation-dependent convergence rates that continuously interpolate between point-wise and uniform estimation regimes.
  arXiv  Detail & Related papers  (2026-06-15T03:49:33Z)
• A Note on Stability for Orthogonalized Matrix Momentum with Client Sampling [7.035974899001363]
  We derive a finite-round upper-tail guarantee from a coupled-neighbor recursion stability and a weighted concentration step.<n>A one-dimensional counterexample shows why a gap, smoothing, or regularity condition is necessary.
  arXiv  Detail & Related papers  (2026-06-01T05:36:26Z)
• Finite-Sample Selected Covariance Spectra in Classical Shadows [45.85698554568285]
  Main theorem applies to arbitrary shadow protocols.<n>For general local product shadow protocols with fixed local dimension, finite-weight product observables lead to bounds controlled by support sizes and local reconstruction coefficients.<n>For biased local Pauli shadows, we evaluate the relevant bound in closed form from the selected Pauli supports and local basis-selection probabilities.
  arXiv  Detail & Related papers  (2026-05-30T04:46:49Z)
• Midpoint Generative Models [52.59974039570536]
  We introduce Midpoint Generative Models (MGM), a principled framework for training one-step generative models.<n>MGM offers an effective and theoretically grounded approach to generative modeling, achieving competitive performance against existing one-step generative modeling methods.
  arXiv  Detail & Related papers  (2026-05-28T13:31:53Z)
• GeoFlowVLM: Geometry-Aware Joint Uncertainty for Frozen Vision-Language Embedding [3.0708725114491293]
  We propose textbfGeoFlowVLM as a post-hoc adapter that learns the joint distribution of paired $ell$-normalised dual-encoder VLM embeddings.<n>A consistency result shows that, in the population limit, the trained network exposes the joint flow and both cross-modal conditional flows.<n>We derive two quantities from this single model: a conditional retrieval entropy that quantifies aleatoric ambiguity with a decision-theoretic interpretation via a Fano-type bound, and a marginaltypicality score justified by an exact chain-rule decomposition of the joint NLL
  arXiv  Detail & Related papers  (2026-05-13T11:12:18Z)
• A Mathematical Theory of Ranking [0.0]
  Ranking systems produce ordered lists from scalar scores, yet the ranking itself depends only on pairwise comparisons.<n>We develop a mathematical theory that takes this observation seriously, centering the analysis on pairwise margins rather than absolute scores.
  arXiv  Detail & Related papers  (2026-04-09T17:00:49Z)
• Functionality-Oriented LLM Merging on the Fisher--Rao Manifold [14.349284217707575]
  Weight-space merging aims to combine multiple fine-tuned LLMs into a single model without retraining.<n>We derive a practical fixed-point algorithm using a lightweight spherical proxy that preserves norms and generalizes directly to multi-expert merging.
  arXiv  Detail & Related papers  (2026-03-05T09:08:38Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Localization Tensor Revisited: Geometric-Probabilistic Foundations and a Structure-Factor Criterion under Periodic Boundaries [2.5694382720775306]
  We revisit the localization tensor (LT) from geometric and probabilistic perspectives.<n>We identify the diagonal part, Cpp, as a "localization function" C(p), whose small-momentum behavior determines the LT in the thermodynamic limit.<n>We show that the finite-momentum behavior of C(p), together with an inverse participation ratio (IPR)-based upper bound valid in localized phases, provides a sharp criterion that discriminates localization from dimerization.
  arXiv  Detail & Related papers  (2026-02-16T14:29:57Z)
• $\texttt{FedBC}$: Calibrating Global and Local Models via Federated Learning Beyond Consensus [66.62731854746856]
  In federated learning (FL), the objective of collaboratively learning a global model through aggregation of model updates across devices tends to oppose the goal of personalization via local information. In this work, we calibrate this tradeoff in a quantitative manner through a multi-criterion-based optimization. We demonstrate that $texttFedBC$ balances the global and local model test accuracy metrics across a suite datasets.
  arXiv  Detail & Related papers  (2022-06-22T02:42:04Z)
• Simultaneous Transport Evolution for Minimax Equilibria on Measures [48.82838283786807]
  Min-max optimization problems arise in several key machine learning setups, including adversarial learning and generative modeling. In this work we focus instead in finding mixed equilibria, and consider the associated lifted problem in the space of probability measures. By adding entropic regularization, our main result establishes global convergence towards the global equilibrium.
  arXiv  Detail & Related papers  (2022-02-14T02:23:16Z)
• Coordinate Independent Convolutional Networks -- Isometry and Gauge Equivariant Convolutions on Riemannian Manifolds [70.32518963244466]
  A major complication in comparison to flat spaces is that it is unclear in which alignment a convolution kernel should be applied on a manifold. We argue that the particular choice of coordinatization should not affect a network's inference -- it should be coordinate independent. A simultaneous demand for coordinate independence and weight sharing is shown to result in a requirement on the network to be equivariant.
  arXiv  Detail & Related papers  (2021-06-10T19:54:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.