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,695 papers · 148 categories

Trend · papers per month

3867731,1591,545 · Jun 202019922001200920172026
48 results for Federated Reinforcement Learning

Unified view of federated learning and distributed RL using local stochastic approximation.

problem Finding the root of an operator composed of local operators in a network of agents with dependent data.
method Local stochastic approximation over a network of agents with Markov process-dependent data.
result Convergence rates of local stochastic approximation for both constant and time-varying step sizes, within a logarithmic factor of independent data.

Study Federated RL with diverse constraints, proposing new optimization methods.

problem Solving reinforcement learning with multiple constraints in federated learning.
method Federated primal-dual policy optimization methods based on policy gradient methods.
result FedNPG achieves global convergence with an ildeO(1/T) ilde{O}(1/\sqrt{T}) rate.

Paper proposes FedQ-Advantage for federated Q-learning with near-optimal regret and low communication cost.

problem Near-optimal federated Q-learning with low communication cost.
method Reference-advantage decomposition for variance reduction, synchronization between agents and server, policy update.
result Achieves almost optimal regret and near-linear regret speedup compared to single-agent learning.

Federated Q-Learning achieves linear regret speedup with low communication cost.

problem Achieving linear regret speedup in federated reinforcement learning without high communication costs.
method Proposed two federated Q-Learning algorithms: FedQ-Hoeffding and FedQ-Bernstein, using event-triggered synchronization, novel step size selection, and concentration inequalities.
result Total regrets achieve linear speedup compared to single-agent counterparts with logarithmic communication cost.

Federated UCBVI reduces communication costs while minimizing regret in multi-agent settings.

problem Minimizing regret in federated learning with heterogeneous agents.
method Federated Upper Confidence Bound Value Iteration (Fed-UCBVI) algorithm.
result Regret bound scales as ildeO(H3SAT/M) ilde{\mathcal{O}}(\sqrt{H^3 |\mathcal{S}| |\mathcal{A}| T / M}) with small additional term due to heterogeneity.

FedLCB-Q learns optimal policies from federated offline data with linear speedup.

problem Learning optimal policies from offline data with federated learning.
method Federated offline RL algorithm tailored for Q-learning, using local Q-function updates and central aggregation.
result Achieves linear speedup in sample complexity with collaboration among agents.

Federated Q-learning achieves linear speedup with heterogeneity, improving sample complexity.

problem Collaborative learning in distributed RL settings with limited data sharing.
method Analyzes synchronous and asynchronous federated Q-learning, proposes importance averaging.
result Achieves linear speedup with heterogeneity, robust to local trajectory heterogeneity.

In distributed reinforcement learning, it is common to exchange the experience memory of each agent and thereby collectively train their local models. The experience memory, however, contains all the preceding state observations and their corresponding policies of the host agent, which may violate the privacy of the ag…

2019-07-15abs ↗pdf ↗

PFedRL-Rep learns shared and personalized policies for heterogeneous environments.

problem Poor performance of single policy in heterogeneous environments.
method Develops PFedRL-Rep framework with shared feature representation and personalized weights.
result Proves linear convergence speedup with respect to the number of agents.

This work improves Q-learning for average-reward MDPs, reducing sample and communication complexities in federated settings.

problem Improving sample complexity of Q-learning for average-reward MDPs.
method Simple Q-learning algorithm with carefully chosen parameters for both single-agent and federated scenarios.
result Established first federated Q-learning algorithm for average-reward MDPs with provable efficiency in sample and communication complexities.

We consider the problem of reinforcing federated learning with formal privacy guarantees. We propose to employ Bayesian differential privacy, a relaxation of differential privacy for similarly distributed data, to provide sharper privacy loss bounds. We adapt the Bayesian privacy accounting method to the federated sett…

2019-11-22abs ↗pdf ↗

A DRL approach optimizes resource allocation in BFL to reduce latency and energy consumption.

problem Energy and CPU constraints of mobile devices and increased training latency due to blockchain mining.
method Deep Reinforcement Learning (DRL) to derive optimal decisions for MLMO.
result Optimal resource allocation and block generation rate to minimize system latency, energy consumption, and incentive cost.

Safe-EF improves federated learning for non-smooth, constrained optimization.

problem Federated learning's communication bottlenecks with high-dimensional model updates.
method Error feedback (EF) for non-smooth convex optimization with safety constraints.
result Safe-EF matches lower complexity bounds and ensures safety constraints.

A novel method for efficient CDRL over wireless networks.

problem Challenges in collaborative deep reinforcement learning over wireless networks.
method Semantic-aware heterogeneous federated deep reinforcement learning (HFDRL) algorithm.
result Superior performance compared to state-of-the-art baselines.

Improved fraud detection in finance with quantum-enhanced federated learning.

problem Challenges in detecting financial fraud with traditional methods.
method Hybrid quantum-enhanced federated learning framework combining quantum LSTM with privacy-preserving techniques.
result Approximately 5% improvement in performance metrics compared to conventional models.

This paper analyzes energy and carbon footprints in distributed and federated learning.

problem High energy costs and carbon emissions in centralized AI methods.
method A novel framework quantifying energy and carbon footprints in vanilla and consensus-based FL methods.
result Optimal bounds and operational points for green FL designs and sustainability assessment.

The paper tackles cooperative RL with function approximation, achieving near-optimal learning with limited communication.

problem Cooperative multi-agent reinforcement learning with function approximation.
method Careful message-passing and cooperative value iteration.
result Achieving near-optimal no-regret learning with limited communication in cooperative multi-agent settings.

FedCONST adapts update magnitudes to enhance feature generalization in FL.

problem Heterogeneous client data in FL leads to overfitting and distorted transferable features.
method FedCONST uses linear convex constraints to stabilize training and preserve generalization.
result FedCONST enhances feature transferability and robustness, achieving state-of-the-art performance.

Parameter-transfer is a well-known and versatile approach for meta-learning, with applications including few-shot learning, federated learning, and reinforcement learning. However, parameter-transfer algorithms often require sharing models that have been trained on the samples from specific tasks, thus leaving the task…

2019-09-12abs ↗pdf ↗

This paper develops a federated EM algorithm for unsupervised learning of mixture models.

problem Theoretical foundations of unsupervised federated learning are lacking.
method Introduces a federated gradient EM algorithm (FedGrEM) for unsupervised learning of mixture models.
result Theoretical analysis shows FedGrEM outperforms local single-task learning.

A practical one-shot federated learning algorithm for cross-silo setting.

problem Limited applicability of existing one-shot federated learning algorithms due to specific model support and lack of privacy guarantees.
method FedKT, a one-shot federated learning algorithm that supports any classification models and provides differential privacy guarantees.
result FedKT significantly outperforms other state-of-the-art federated learning algorithms with a single communication round.

Unified framework for randomized exploration in cooperative MARL.

problem Efficient exploration in cooperative multi-agent reinforcement learning.
method Unified algorithm framework with two Thompson Sampling algorithms, CoopTS-PHE and CoopTS-LMC.
result Theoretical O~(d3/2H2MK)\widetilde{\mathcal{O}}(d^{3/2}H^2\sqrt{MK}) regret bound for parallel MDPs with linear transition.

pFedGame uses game theory for decentralized federated learning in dynamic networks.

problem Performance bottlenecks, data bias, model convergence issues, and model poisoning attacks in federated learning.
method pFedGame employs game theory to decentralize federated learning, avoiding a central aggregation server and addressing dynamic network challenges.
result pFedGame achieves higher accuracy (over 70%) in heterogeneous data compared to existing methods.

A framework to compare federated learning algorithms in high-dimensional settings.

problem Comparing the performance of federated learning algorithms in high-dimensional settings.
method Formulating federated learning as a multi-criterion objective and analyzing a linear regression model.
result Federated Averaging with simple client fine-tuning achieves the same asymptotic risk as more intricate approaches and outperforms without personalization.

Federated learning linked to mean-field games for large-scale learning.

problem Large-scale distributed and privacy-preserving learning algorithms.
method Established a connection between federated learning and mean-field games, presenting federated learning as a differential game.
result Properties of the equilibrium of the federated learning game were discussed.

A fair reward system boosts participation in federated learning.

problem Fairness in federated learning among competitive agents with siloed data.
method Hierarchically fair federated learning (HFFL) framework with proportional rewards based on contribution levels.
result Efficacy of HFFL in maintaining fairness and facilitating federated learning in competitive settings.

Federated multi-mini-batch improves efficiency in non-IID environments.

problem Performance and communication efficiency challenges in federated learning with non-IID data.
method Introduces federated multi-mini-batch approach to balance performance and communication.
result Federated multi-mini-batch outperforms federated averaging in non-IID settings.

This work improves fairness in federated learning by using zero-shot data augmentation.

problem Statistical heterogeneity leads to biased and less uniform accuracy across clients in federated learning.
method Proposes a federated learning system with zero-shot data augmentation to mitigate statistical heterogeneity and improve fairness.
result Empirical results show improved test accuracy and fairness across clients.

In federated learning, a central server coordinates the training of a single model on a massively distributed network of devices. This setting can be naturally extended to a multi-task learning framework, to handle real-world federated datasets that typically show strong statistical heterogeneity among devices. Despite…

2019-06-14abs ↗pdf ↗

Sherpa.ai framework combines federated learning and differential privacy for edge AI services.

problem Protecting data privacy in edge AI services.
method Holistic federated learning and differential privacy approach with methodological guidelines.
result Demonstrated through classification and regression use cases.

Federated learning studies separate client data and distribution gaps.

problem Understanding performance differences in federated learning across different datasets.
method Proposed a framework to disentangle out-of-sample and participation gaps.
result Dataset synthesis strategy is crucial for realistic simulations of federated learning generalization.

A new federated learning method reduces communication costs and improves adaptivity.

problem Large communication overhead and lack of adaptivity in federated learning.
method FedCAMS: A novel communication-efficient adaptive federated learning method with theoretical guarantees.
result FedCAMS achieves the same convergence rate as non-compressed federated learning methods.

Federated learning technique improves convergence speed with communication delays.

problem Communication delays between edge nodes and aggregator in federated learning.
method Developed FedDelAvg, a technique that generalizes federated averaging to incorporate a weighting between current local model and delayed global model.
result FedDelAvg achieves a significant improvement in convergence speed, especially when optimizing the weighting scheme to account for delays.

This paper analyzes privacy threats in federated matrix factorization.

problem Privacy threats in federated matrix factorization models.
method Categorizes federated matrix factorization into three types and analyzes privacy threats.
result This is the first study of privacy threats in federated matrix factorization.