Deep Randomized Distributed Function Computation (DeepRDFC): Neural Distributed Channel Simulation

• URL: http://arxiv.org/abs/2603.10750v1
• Date: Wed, 11 Mar 2026 13:24:49 GMT
• Title: Deep Randomized Distributed Function Computation (DeepRDFC): Neural Distributed Channel Simulation
• Abstract summary: An autoencoder architecture is proposed to minimize the total variation distance between the probability distribution simulated by the AE outputs and an unknown target distribution, using only data samples.<n>Our designs establish deep learning-based RDFC methods and aim to facilitate the use of RDFC methods, especially when the amount of common randomness is limited and strong function computation guarantees are required.
• Score: 6.141945506223323
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The randomized distributed function computation (RDFC) framework, which unifies many cutting-edge distributed computation and learning applications, is considered. An autoencoder (AE) architecture is proposed to minimize the total variation distance between the probability distribution simulated by the AE outputs and an unknown target distribution, using only data samples. We illustrate significantly high RDFC performance with communication load gains from our AEs compared to data compression methods. Our designs establish deep learning-based RDFC methods and aim to facilitate the use of RDFC methods, especially when the amount of common randomness is limited and strong function computation guarantees are required.

Related papers

• Entropy-Regularized Probabilistic Gates for Sparse Model Discovery in Scarce-Data Federated Learning [0.0]
  Federated learning (FL) is a distributed machine learning (ML) paradigm with collaboration among multiple clients without sharing data.<n>We study entropy regularization of gate distributions as a mechanism to maintain uncertainty in sparse federated optimization.
  arXiv  Detail & Related papers  (2026-06-30T23:51:44Z)
• A Flow Matching Algorithm for Many-Shot Adaptation to Unseen Distributions [22.125693648279974]
  FP-FM learns basis functions to span the velocity fields corresponding to a set of training distributions.<n>It adapts to new distributions by computing a simple least-squares projection onto this basis.<n>It achieves greatly improved precision and recall relative to baselines across synthetic and image-based datasets.
  arXiv  Detail & Related papers  (2026-05-07T13:47:21Z)
• Consensus-based Recursive Multi-Output Gaussian Process [4.460583138505673]
  Multi-output Gaussian Processes provide principled uncertainty-aware learning of vector-valued fields.<n>This paper proposes a Consensus-based Recursive Multi-Output Gaussian Process framework.<n> Experiments on synthetic wind fields and real LiDAR data demonstrate that CRMGP achieves competitive predictive performance and reliable uncertainty calibration.
  arXiv  Detail & Related papers  (2026-04-11T10:21:03Z)
• Randomized Distributed Function Computation (RDFC): Ultra-Efficient Semantic Communication Applications to Privacy [7.255894982283692]
  We establish the randomized distributed function computation (RDFC) framework, in which a sender transmits just enough information for a receiver to generate a randomized function of the input data.<n>We show that security and privacy constraints naturally fit this model, as they generally require a randomization step.<n>Our results position RDFC as an energy-efficient semantic communication strategy for privacy-aware distributed computation systems.
  arXiv  Detail & Related papers  (2026-03-10T12:23:50Z)
• Scalable Random Wavelet Features: Efficient Non-Stationary Kernel Approximation with Convergence Guarantees [5.758073912084366]
  We introduce Random Wavelet Features (RWF), a framework that constructs scalable, non-stationary kernel approximations by sampling from wavelet families.<n>By harnessing the inherent localization and multi-resolution structure of wavelets, RWF generates an explicit feature map that captures complex, input-dependent patterns.<n>We demonstrate empirically on a range of challenging synthetic and real-world datasets that RWF outperforms stationary random features and offers a compelling accuracy-efficiency trade-off.
  arXiv  Detail & Related papers  (2026-02-01T02:56:56Z)
• Low-Dimensional Adaptation of Rectified Flow: A New Perspective through the Lens of Diffusion and Stochastic Localization [59.04314685837778]
  Rectified flow (RF) has gained considerable popularity due to its generation efficiency and state-of-the-art performance.<n>In this paper, we investigate the degree to which RF automatically adapts to the intrinsic low dimensionality of the support of the target distribution to accelerate sampling.<n>We show that, using a carefully designed choice of the time-discretization scheme and with sufficiently accurate drift estimates, the RF sampler enjoys an complexity of order $O(k/varepsilon)$.
  arXiv  Detail & Related papers  (2026-01-21T22:09:27Z)
• SCORENF: Score-based Normalizing Flows for Sampling Unnormalized distributions [5.204468049641428]
  We propose ScoreNF, a score-based learning framework built on the Normalizing Flow architecture.<n>We show that ScoreNF maintains high performance even with small training ensembles.<n>We also present a method for assessing mode-covering and mode-collapse behaviours.
  arXiv  Detail & Related papers  (2025-10-24T10:43:19Z)
• A Distribution-Aware Flow-Matching for Generating Unstructured Data for Few-Shot Reinforcement Learning [1.0709300917082865]
  We introduce a distribution-aware flow matching approach to generate synthetic unstructured data for few-shot reinforcement learning.<n>Our approach addresses key challenges in traditional model-based RL, such as overfitting and data correlation.<n>Results demonstrate that our method achieves stable convergence in terms of maximum Q-value while enhancing frame rates by 30% in the initial timestamps.
  arXiv  Detail & Related papers  (2024-09-21T15:50:59Z)
• Neural Conditional Probability for Uncertainty Quantification [22.951644463554352]
  We introduce Neural Conditional Probability (NCP), an operator-theoretic approach to learning conditional distributions.<n>By leveraging the approximation capabilities of neural networks, NCP efficiently handles a wide variety of com- plex probability distributions.<n>In experiments, we show that NCP with a 2-hidden-layer network matches or outperforms leading methods.
  arXiv  Detail & Related papers  (2024-07-01T10:44:29Z)
• Boundary-aware Decoupled Flow Networks for Realistic Extreme Rescaling [49.215957313126324]
  Recently developed generative methods, including invertible rescaling network (IRN) based and generative adversarial network (GAN) based methods, have demonstrated exceptional performance in image rescaling. However, IRN-based methods tend to produce over-smoothed results, while GAN-based methods easily generate fake details. We propose Boundary-aware Decoupled Flow Networks (BDFlow) to generate realistic and visually pleasing results.
  arXiv  Detail & Related papers  (2024-05-05T14:05:33Z)
• Distributed Markov Chain Monte Carlo Sampling based on the Alternating Direction Method of Multipliers [143.6249073384419]
  In this paper, we propose a distributed sampling scheme based on the alternating direction method of multipliers. We provide both theoretical guarantees of our algorithm's convergence and experimental evidence of its superiority to the state-of-the-art. In simulation, we deploy our algorithm on linear and logistic regression tasks and illustrate its fast convergence compared to existing gradient-based methods.
  arXiv  Detail & Related papers  (2024-01-29T02:08:40Z)
• Transforming Image Super-Resolution: A ConvFormer-based Efficient Approach [58.57026686186709]
  We introduce the Convolutional Transformer layer (ConvFormer) and propose a ConvFormer-based Super-Resolution network (CFSR) CFSR inherits the advantages of both convolution-based and transformer-based approaches. Experiments demonstrate that CFSR strikes an optimal balance between computational cost and performance.
  arXiv  Detail & Related papers  (2024-01-11T03:08:00Z)
• Score-based Source Separation with Applications to Digital Communication Signals [72.6570125649502]
  We propose a new method for separating superimposed sources using diffusion-based generative models. Motivated by applications in radio-frequency (RF) systems, we are interested in sources with underlying discrete nature. Our method can be viewed as a multi-source extension to the recently proposed score distillation sampling scheme.
  arXiv  Detail & Related papers  (2023-06-26T04:12:40Z)
• Efficient semidefinite-programming-based inference for binary and multi-class MRFs [83.09715052229782]
  We propose an efficient method for computing the partition function or MAP estimate in a pairwise MRF. We extend semidefinite relaxations from the typical binary MRF to the full multi-class setting, and develop a compact semidefinite relaxation that can again be solved efficiently using the solver.
  arXiv  Detail & Related papers  (2020-12-04T15:36:29Z)

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.