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.

168,742 papers · 148 categories

Trend · papers per month

265277103 · Oct 201919922001200920172026
48 results for Downlink Communication

Study improves communication efficiency in RIS-assisted downlink communication.

problem Improving performance of RIS-aided downlink communication over heterogeneous designs.
method Distributed learning with distributionally robust optimization.
result Our algorithm achieves 50% fewer communication rounds for similar worst-case performance.

BICompFL tackles bi-directional compression challenges in stochastic FL, reducing communication costs by an order of magnitude.

problem Communication bottleneck in federated learning, especially with stochastic updates.
method Introduces BICompFL, a bi-directional compression approach for stochastic federated learning.
result Significantly reduces communication costs (by an order of magnitude) while maintaining accuracy.

Paper improves communication in distributed optimization, reducing worker-to-server data exchanges.

problem Efficiency in server-to-worker communication in distributed optimization.
method MARINA-P, a novel downlink compression method using correlated compressors; M3, combining MARINA-P with uplink compression.
result MARINA-P achieves provably superior server-to-worker communication complexity with increasing number of workers.

DoCoFL compresses model updates for cross-device federated learning.

problem Downlink compression for cross-device federated learning where clients may appear only once.
method Proposes DoCoFL framework for downlink compression in cross-device federated learning.
result Significant bi-directional bandwidth reduction with competitive accuracy.

CyBeR-0 optimizes federated learning with Byzantine resilience and reduced communication costs.

problem Byzantine attacks and communication inefficiency in federated learning.
method Transformed robust aggregation for zero-order optimization under client heterogeneity.
result CyBeR-0 achieves stable performance with minimal communication costs and reduced memory usage.

MARINA-P improves non-smooth federated optimization with adaptive stepsizes.

problem Non-smooth federated optimization in machine learning applications.
method Extends EF21-P and MARINA-P to non-smooth convex setting, proving optimal convergence rate and communication complexity bounds.
result MARINA-P achieves O(1/T)O(1/\sqrt{T}) convergence rate and communication complexity matching classical subgradient methods.

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.

This study analyzes satellite communication latency using a stochastic geometry model.

problem Latency analysis of LEO satellite relay communication systems.
method Stochastic geometry framework with spherical BPP models, suboptimal satellite relay selection strategy.
result Derives distance distributions and analytical expressions for transmission delays.

Study investigates FL performance over a noisy downlink, showing analog approach outperforms digital.

problem Impact of bandwidth-limited downlink on federated learning performance.
method Modelled downlink and uplink channels; proposed digital and analog downlink approaches; analyzed convergence behavior.
result Analog downlink approach provides significant improvement over digital approach, especially with biased data distribution.

Knowledge of the channel state information (CSI) at the transmitter side is one of the primary sources of information that can be used for the efficient allocation of wireless resources. Obtaining downlink (DL) CSI in Frequency Division Duplexing (FDD) systems from uplink (UL) CSI is not as straightforward as in TDD sy…

2018-12-16abs ↗pdf ↗

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.

Optimizes wireless power control using graph neural networks and counterfactual optimization.

problem Mitigating interference in wireless networks with multiple transmitter-receiver pairs.
method Graph neural network architecture combined with unsupervised primal-dual counterfactual optimization.
result Guarantees a minimum rate constraint that adapts to network size, balancing user rates.

Paper introduces uncertainty injection for deep learning robust optimization.

problem Uncertainty in input data affects deep learning model performance in optimization problems.
method Uncertainty injection scheme for training deep learning models to produce robust solutions.
result Proposed scheme improves robustness of solutions in wireless communications applications.

AMS improves video inference on edge devices by adapting a small model with online knowledge distillation.

problem High computation cost of Deep Neural Networks for real-time video inference on edge devices.
method AMS uses a remote server to continually train and adapt a small model on edge devices, using online knowledge distillation from a large model.
result 0.4--17.8 percent mean Intersection-over-Union improvement in video semantic segmentation.

In this paper, we study the problem of multi-band (frequency-variant) covariance interpolation with a particular emphasis towards massive MIMO applications. In a massive MIMO system, the communication between each BS with M1M \gg 1 antennas and each single-antenna user occurs through a collection of scatterers in the e…

2018-01-11abs ↗pdf ↗

DeepCMC compresses CSI for massive MIMO systems, reducing overhead and improving performance.

problem High CSI overhead in massive MIMO systems limits spectral efficiency.
method Deep learning-based fully convolutional neural network with residual layers and entropy coding.
result DeepCMC outperforms state-of-the-art schemes in CSI reconstruction quality for the same compression rate.

Satellite imaging is a critical technology for monitoring and responding to natural disasters such as flooding. Despite the capabilities of modern satellites, there is still much to be desired from the perspective of first response organisations like UNICEF. Two main challenges are rapid access to data, and the ability…

2019-10-04abs ↗pdf ↗

Optimizes data power control in cell-free networks for better spectral efficiency.

problem Maximizing overall spectral efficiency in cell-free networks with multi-objective optimisation.
method Applied scalable multi-objective Bayesian optimisation to solve convergence-time limitations.
result Improved radio resource management in cell-free networks.

Paper proposes efficient UAV placement for aerial base stations.

problem Efficient placement of UAVs as aerial base stations to serve varying traffic demand.
method Modeling UAV deployment as a non-cooperative game and using a learning-based algorithm to update UAV locations.
result Significant performance gains up to 52% and 74% in terms of throughput and dropped users compared to an optimized baseline algorithm.

A new framework maximizes influence spread in social networks by accounting for inter-community diffusion.

problem Real-world social networks have inter-community influence that is often overlooked in community-based IM approaches.
method Community-IM++ uses a heuristic based on community-based diffusion degree and progressive budgeting to model and prioritize cross-community diffusion.
result Community-IM++ achieves near-greedy influence spread at up to 100 times lower runtime than existing methods.

We introduce the concept of community trees that summarizes topological structures within a network. A community tree is a tree structure representing clique communities from the clique percolation method (CPM). The community tree also generates a persistent diagram. Community trees and persistent diagrams reveal topol…

2017-10-11abs ↗pdf ↗

We introduce a new paradigm that is important for community detection in the realm of network analysis. Networks contain a set of strong, dominant communities, which interfere with the detection of weak, natural community structure. When most of the members of the weak communities also belong to stronger communities, t…

2017-02-24abs ↗pdf ↗

Study exact community detection in k-community Gaussian mixtures with different intensities.

problem Community detection in k-community Gaussian mixtures with varying intensities.
method Explicitly find the threshold for exact recovery of maximum likelihood estimation.
result Threshold for exact recovery of maximum likelihood estimation is identified.

The paper introduces a method for detecting principal communities and embedding vertices.

problem Detecting and embedding vertices in graphs with community structure.
method Principal graph encoder embedding method that detects principal communities and produces vertex embeddings.
result The method successfully detects principal communities and produces accurate vertex embeddings.

Improved distributed learning with reduced communication costs.

problem Efficient communication in resource-constrained environments for distributed learning.
method Proposed a cost-effective partial communication protocol.
result Communication cost is reduced to O(logT)O(\log T), improving significantly on full communication.

FedSpace optimizes ML training on satellites and ground stations.

problem Training machine learning models on satellites with limited bandwidth.
method Federated Learning framework that dynamically schedules model aggregation based on satellite orbits.
result Reduces training time by 1.7 days over state-of-the-art algorithms.

Statistical estimates can often be improved by fusion of data from several different sources. One example is so-called ensemble methods which have been successfully applied in areas such as machine learning for classification and clustering. In this paper, we present an ensemble method to improve community detection by…

2013-09-01abs ↗pdf ↗

MACC learns communication protocols by adapting counterfactual reasoning.

problem Credit assignment and non-stationarity in communication environments.
method Adapts counterfactual reasoning to overcome credit assignment and uses action policy and Q-function of other agents to handle non-stationarity.
result MACC outperforms state-of-the-art baselines in four scenarios.

A novel framework for adaptive multi-agent communication in reinforcement learning.

problem Manual specification of communication structures in multi-agent reinforcement learning.
method Learning Structured Communication (LSC) framework using hierarchical graph neural networks.
result Adaptive hierarchical formations and efficient message propagation among agents.

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.

Real-world networks usually have community structure, that is, nodes are grouped into densely connected communities. Community detection is one of the most popular and best-studied research topics in network science and has attracted attention in many different fields, including computer science, statistics, social sci…

2018-08-26abs ↗pdf ↗

GRADE models evolving graph dynamics by learning node and community representations.

problem Lack of tools to study temporal community dynamics in evolving graphs.
method GRADE is a probabilistic model that learns evolving node and community representations via a random walk prior and variational inference.
result GRADE outperforms baselines in dynamic link prediction and dynamic community detection.