Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,341 papers · 148 categories

Trend · papers per month

1.7%3.4%5.0%6.7% · Mar 202019922001200920182026
48 results for communication channels

A framework for multi-agent communication over noisy channels in reinforcement learning.

problem Effective communication between multiple agents in a noisy environment.
method A novel multi-agent partially observable Markov decision process (MA-POMDP) framework considering noisy communication channels.
result Jointly learned policies outperform separate learning of communication and decision making.

Machine learning optimizes fiber communication rates without channel knowledge.

problem Achieving information rates in nonlinear fiber communication.
method Jointly optimizes input and auxiliary channel distributions using end-to-end autoencoder learning.
result Computes achievable information rates without explicit channel knowledge.

New algorithm trains communication systems without a differentiable channel model.

problem Training communication systems with unknown or non-differentiable channel models.
method Iterative training between receiver and transmitter using true and approximated gradients.
result Works as well as model-based training and achieves state-of-the-art performance.

Deep learning improves channel estimation in communication systems.

problem Improving channel estimation accuracy in communication systems.
method Proposed a deep learning pipeline using image processing techniques to estimate channel response.
result The proposed algorithm shows comparable performance to MMSE with full channel knowledge and better than ALMMSE.

Study neural communication systems with bandwidth-limited channels.

problem Reliable message transmission despite noisy channels.
method Jointly model compression and error correction with neural networks; introduce prior for missing information; use auxiliary latent variables.
result Joint neural communication systems outperform separate models under expected information loss.

This letter tackles channel assignment in uplink wireless communication systems.

problem Maximizing the sum rate of all users in uplink wireless communication systems with integer channel assignment constraints.
method A convex optimization based algorithm is used to find the optimal channel assignment. Machine learning approaches, including CNNs, FNNs, random forest, and GRUs, are employed to reduce computation time.
result Machine learning methods largely reduce computation time with slightly compromised prediction accuracy.

New ML models improve VVLC channel characterization for vehicular OWC.

problem Inaccurate channel models for VVLC due to mobility effects.
method Machine learning (ML) models incorporating ambient light, turbulence, and reflection effects.
result ML models predict VVLC channel loss and CFR more accurately than existing methods.

New model estimates unknown number of users in asynchronous multiuser communication.

problem Estimating unknown number of users in asynchronous multiuser communication.
method Infinite factorial finite state machine model with Bayesian nonparametric approach.
result Effective recovery of data-generating process for various scenarios.

Paper explores DNNs in modulation recognition with channel effects and adversarial attacks.

problem Automatic modulation recognition in wireless communications.
method Deep neural networks applied to channel models and adversarial perturbations.
result Impact of channel variations and adversarial attacks on DNN performance.

Optimal joint separation condition for radar and communications channels in dual-blind deconvolution.

problem Recovering information from overlaid radar and communications signals with unknown channels.
method Extremal functions from Beurling-Selberg interpolation theory for joint separation, nuclear norm minimization for matrix retrieval, and MUSIC for parameter estimation.
result Guaranteed well-conditioned Vandermonde matrix for MUSIC, validating theoretical findings.

FedRec learns universal receivers for fading channels without channel statistics.

problem Training neural network-based receivers for diverse fading channels without accurate statistics.
method Federated learning of a MAP detector for downlink fading channels.
result Performance approaches MAP without channel statistics, reduced communication overhead.

Random orthogonalization improves FL in massive MIMO systems without CSI.

problem Efficient model aggregation in FL with minimal channel estimation overhead.
method Combining FL with massive MIMO's channel hardening and favorable propagation, random orthogonalization reduces channel estimation overhead.
result Achieves model aggregation without CSI, significantly reducing channel estimation overhead.

End-to-end deep learning boosts IM/DD fiber communication over dispersive channels.

problem Improving data transmission over dispersive IM/DD channels with memory.
method Bidirectional recurrent neural network (BRNN) for end-to-end deep learning of the communication system.
result End-to-end SBRNN achieves significant bit-error-rate reduction compared to FFNNs.

New techniques improve channel prediction in noisy wireless systems.

problem Predicting channels in wireless communication systems from noisy observations.
method Adapted sequence-to-sequence models and transformers with reverse positional encoding and reversed encoder outputs.
result Improved robustness and relationship capture in channel prediction models.

A privacy-preserving method for transmitting data over a wiretap channel using generative networks.

problem Privacy protection in communication over a wiretap channel.
method Data-driven approach using variational autoencoder (VAE)-based joint source channel coding (JSCC).
result The approach provides high reconstruction quality at the receiver while confusing the eavesdropper about the latent sensitive attribute.

Paper tackles accurate channel modeling using variational GANs.

problem Accurately learning channel probability distribution functions (PDFs).
method Variational GAN architecture and loss function for stochastic channel modeling.
result Accurately captures stochastic channel behavior with improved PDFs.

End-to-end learning of codes for secure BPSK communication in Gaussian wiretap channel.

problem Secure communication in the presence of an adversary for BPSK modulation.
method Learning finite-length codes using deep neural networks (DNNs) with mutual information estimation.
result Learned codes achieve near-optimal security performance, as demonstrated by numerical results.

Generative diffusion models improve channel sampling from limited data.

problem Challenges in channel modelling and data collection for wireless systems.
method Diffusion model with U-Net architecture for frequency domain synthesis.
result Stable training and diverse high-fidelity samples generated from true channel distribution.

The paper analyzes generalization of noisy iterative algorithms using communication theory.

problem Generalization of models trained by noisy iterative algorithms under different distributions.
method Connecting noisy iterative algorithms to additive noise channels in communication theory.
result Distribution-dependent generalization bounds for noisy iterative algorithms.

Data-driven symbol detection improves performance in complex channels.

problem Designing robust symbol detectors in systems with poorly understood channels.
method Hybrid approach combining model-based algorithms with machine learning.
result Near-optimal performance of model-based algorithms achieved without channel model knowledge.

A-FADMM improves FL scalability and privacy via wireless channel perturbations and interference.

problem Challenges in model training due to wireless channel randomness and interference.
method Formulated a novel constrained optimization problem and proposed A-FADMM framework.
result Proves convergence and privacy guarantees for A-FADMM under time-varying channels.

New adaptive SGD algorithms for federated learning over physical channels.

problem Reducing communication cost in federated learning over physical channels.
method Proposed adaptive federated SGD algorithms considering channel noise and hardware constraints.
result Demonstrated convergence rates adaptive to stochastic gradient noise level.

The possibility of latency arbitrage in financial markets has led to the deployment of high-speed communication links between distant financial centers. These links are noisy and so there is a need for coding. In this paper, we develop a gametheoretic model of trading behavior where two traders compete to capture laten…

2015-04-27abs ↗pdf ↗

Unified framework for hyperbolic network embedding considering multiplex interactions.

problem Misleading results from ignoring multiplex interactions in real-world networks.
method Combines multiplex network hyperbolic embedding and community detection using random walk.
result Effective and efficient node embedding across multiplex channels compared to state-of-the-art.

New approach uses SPG for semantic communication without a known channel model.

problem Designing efficient semantic communication systems without a known channel model.
method Applying Stochastic Policy Gradient (SPG) for reinforcement learning.
result Achieves comparable performance to model-aware approaches with a decreased convergence rate.

This study examines how communication between deep learning models impacts performance.

problem The exchange of data and instructions between deep learning models during training.
method Examined decentralized parallel computations, simplified communication protocols, and purposeful language exchange.
result Decentralized communication can be beneficial for performance, especially in simplified setups.

This work improves communication efficiency in federated learning over wireless networks by optimizing energy consumption.

problem Optimizing energy consumption in federated learning over wireless networks.
method Adopting SignSGD for gradient sign exchange, considering channel capacity with outage, and proposing a stochastic sign-based algorithm for uneven data distribution.
result Proposed methods achieve a balance between learning performance and energy consumption.

New method recovers radar and communication signals from overlaid data.

problem Recover radar and communication signals from overlaid data with unknown parameters.
method Propose minimizing the sum of multivariate atomic norms (SoMAN) for multi-antenna receiver.
result Minimum number of samples and antennas required for perfect recovery is logarithmically dependent on the maximum of radar targets and communications paths.

Paper tackles federated linear bandit learning with AirComp for noisy channels.

problem Minimize cumulative regret in federated linear bandit learning.
method Proposes a federated linear bandits scheme using over-the-air computation (AirComp) over noisy fading channels.
result Determines the regret bound of the proposed scheme.

We optimize distributed learning algorithms to maintain linear convergence with limited communication.

problem Limited communication time affects the convergence of distributed learning algorithms.
method We design quantizers to compress algorithm information while preserving linear convergence and characterize communication time.
result We show how to co-design machine learning and communication protocols for optimal performance.

New algorithm reduces communication time in federated learning.

problem Intermittent connectivity and non-i.i.d. data slow federated learning convergence.
method Lyapunov optimization for efficient device scheduling.
result Significant reduction in communication time with improved convergence rates.

Few-shot domain adaptation improves autoencoder performance in changing wireless channels.

problem Frequent retraining of autoencoder for low decoding error rate in changing channel conditions is impractical.
method Uses Gaussian mixture density network and class and component-conditional affine transformations for few-shot adaptation.
result Effective adaptation using very small number of target domain samples, improving performance in real mmWave setups.

The paper applies communication theory to improve language model reranking.

problem Ensuring safety and accuracy in language model outputs.
method Drawing parallels between communication theory and language model reranking, the authors propose a protocol to improve reliability.
result The proposed protocol can achieve asymptotically error-free performance in noisy communication scenarios.

New metrics needed for better understanding emergent communication in multi-agent systems.

problem Current metrics for emergent communication are insufficient for complex environments.
method Training deep reinforcement learning agents in simple games to analyze communication effectiveness.
result Messages in emergent communication can be misleading and do not always impact the environment.

Adversarial attacks are ineffective when the surrogate models are trained with different channel effects.

problem Adversarial attacks against wireless signal classifiers are ineffective when the adversary's surrogate model differs from the transmitter's classifier.
method Investigated different topologies to analyze how channel effects influence the performance of adversarial attacks.
result Surrogate models trained with different channel-induced inputs severely limit the attack performance.

Adversaries manipulate wireless power allocation to reduce user rates.

problem Adversaries exploit deep learning for power control to decrease communication rates.
method Adversaries craft perturbations to inputs of a DNN to minimize power allocation.
result Adversarial attacks are highly effective and robust to uncertainties.

A new machine learning framework reduces IoT data transfer by two orders of magnitude.

problem Reducing data transfer in IoT devices over wireless channels.
method Developed a machine learning framework for distributed functional compression over GMAC and AWGN channels.
result The framework reduces communication by two orders of magnitude compared to cloud-based methods.

Quantum federated learning improves with non-IID data using one-shot communication.

problem Performance degradation in federated learning with non-IID data.
method Quantum algorithms and local density estimators for non-IID data.
result One-shot communication complexity for non-IID quantum federated learning.