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

52104155207 · Jun 202019922001200920172026
48 results for Decentralized policy

A decentralized policy achieves logarithmic regret for multi-agent MAB problems with communication constraints.

problem Decentralized policy for multi-agent MAB problems with option availability and communication constraints.
method Upper Confidence Bound (UCB) algorithms with non-stationary stochastic communication protocol.
result Guaranteed logarithmic regret for non-fully connected spatial graphs with communication constraints.

Flexible decentralized MARL framework for cooperative multi-agent learning.

problem Complexity and impracticality of centralized MARL in complicated applications.
method Flexible fully-decentralized actor-critic MARL framework using primal-dual hybrid gradient descent.
result Competitive performance in large-scale cooperative multi-agent environments.

Improved exploration in cooperative multi-agent reinforcement learning.

problem Limited expressiveness of Gaussian policies in DecSPG hinders effective exploration.
method Proposes decentralized diffusion policy learning (DDPL) with denoising diffusion probabilistic models.
result Consistently improved performance on various MARL benchmarks.

New MARL algorithms resolve the curse of multiagency with function approximation.

problem Challenges in Multi-Agent Reinforcement Learning (MARL) due to the curse of multiagency.
method V-Learning with Policy Replay and Decentralized Optimistic Policy Mirror Descent.
result First polynomial sample complexity results for learning approximate Coarse Correlated Equilibria (CCEs) of Markov Games under decentralized linear function approximation.

DePAint solves MARL for agents with local constraints, privacy, and no central controller.

problem Training multi-agent systems to optimize rewards while adhering to safety constraints in a decentralized setting.
method Formulated as a decentralized constrained multi-agent Markov Decision Problem, proposed DePAint method using momentum-based decentralized policy gradient.
result First privacy-preserving fully decentralized MARL algorithm considering both peak and average constraints.

Algorithm converges to Nash equilibria in competitive games.

problem Finding Nash equilibria in decentralized, competitive Markov games.
method Decentralized Optimistic Gradient Descent/Ascent with a critic.
result Converges to the set of Nash equilibria under self-play.

Improves data efficiency in multi-agent control tasks using model-based reinforcement learning.

problem Limited data efficiency in reinforcement learning for multi-agent tasks.
method Decentralized model-based policy optimization (DMPO) framework.
result DMPO achieves superior data efficiency and matches model-free methods using true models.

DORIS algorithm achieves no-regret learning in Markov games with adversarial opponents.

problem Decentralized policy learning in Markov games with nonstationary opponents.
method DORIS algorithm using optimistic hyperpolicy mirror descent.
result Achieves K\sqrt{K}-regret in general function approximation.

A decentralized routing framework for lunar exploration robots.

problem Routing data in intermittent connectivity lunar networks.
method Graph Attention-based Multi-Agent Reinforcement Learning (GAT-MARL).
result Higher delivery rates, no duplications, fewer packet losses.

Expectation maximization (EM) has recently been shown to be an efficient algorithm for learning finite-state controllers (FSCs) in large decentralized POMDPs (Dec-POMDPs). However, current methods use fixed-size FSCs and often converge to maxima that are far from optimal. This paper considers a variable-size FSC to rep…

2015-05-01abs ↗pdf ↗

We propose a method to model multi-agent behaviors with limited observation and mechanical constraints.

problem Modeling real-world multi-agent behaviors with limited observation and mechanical constraints.
method Decentralized generative models with partial observation and mechanical constraints based on hierarchical variational recurrent neural networks.
result Our method effectively models and predicts biologically plausible behaviors with minimal constraint violations.

This paper proposes a decentralized reinforcement learning method for multi-agent resource allocation.

problem Allocating heterogeneous resources among multiple agents in a decentralized manner.
method Liquid-Graph-Time Clustering-IPPO, integrating dynamic cluster consensus.
result LGTC-IPPO achieves more stable rewards, better coordination, and robust performance.

Bayesian network approach for efficient cooperative MARL.

problem Leveraging inter-agent coupling information for scalable MARL algorithms.
method Modeling cooperative MARL via Bayesian networks, identifying value dependency sets, proposing P-DTDE paradigm.
result P-DTDE policy gradient estimator has lower total variance than CTDE.

Policy-gradient method controls multiple non-cohesive targets.

problem Controlling multiple non-cohesive targets in a decentralized manner.
method Proximal Policy Optimization for target selection and driving.
result Effective control of non-cohesive targets without prior dynamics knowledge.

This paper examines market misconduct in DeFi and proposes regulatory solutions.

problem Novel forms of market misconduct in DeFi.
method Comprehensive analysis, comparative study, empirical measurements, and tailored regulatory framework investigation.
result Identification of key areas for regulatory enhancement in DeFi.

Decentralized learning ensures stability in online queuing systems with packet rates above 1.

problem Ensuring stability in online queuing systems with decentralized learning.
method Proposed cooperative queues and a learning algorithm for packet rates above 1.
result Decentralized learning strategies guarantee stability in queuing systems with packet rates above 1.

Proposes three decentralized multi-agent reinforcement learning algorithms to reduce network congestion.

problem Finding a joint policy maximizing long-term return in a decentralized multi-agent system.
method Three fully decentralized multi-agent natural actor-critic (MAN) algorithms using linear function approximations.
result The proposed algorithms achieve performance comparable to or better than standard methods in reducing network congestion.

Regulating crypto and DeFi for inclusive economic advancement.

problem Innovative financial systems pose challenges to traditional regulatory frameworks.
method Formulating regulatory structures that balance innovation and consumer protection.
result Regulatory frameworks are essential for leveraging crypto and DeFi for inclusive economic growth.

A new multi-agent learning method improves performance in complex games.

problem Performance gap between MAPG and value-based multi-agent approaches.
method Introduces value function decomposition into multi-agent actor-critic framework for off-policy learning.
result DOP significantly outperforms state-of-the-art multi-agent reinforcement learning algorithms.

Most previous studies on multi-agent reinforcement learning focus on deriving decentralized and cooperative policies to maximize a common reward and rarely consider the transferability of trained policies to new tasks. This prevents such policies from being applied to more complex multi-agent tasks. To resolve these li…

2019-09-27abs ↗pdf ↗

Research proposes a decentralized invoice discounting system using Kelly criterion.

problem Persistent funding gap for SMEs and inefficiencies in traditional factoring.
method Automated Market Maker (AMM) with Kelly criterion for premium calculation.
result Resilient decentralized system with optimal profit distribution policies.

This study compares decentralized banks and finds some lack decentralization.

problem Decentralized banks do not fully decentralize transactions as expected.
method Network analysis of transaction data from four banks using core-periphery features.
result MakerDao and Compound are more decentralized than Aave and Liquity.

New algorithm reduces complexity in multi-agent reinforcement learning.

problem High computational complexity in exact computations for multi-agent reinforcement learning.
method Design of a scalable algorithm based on Natural Policy Gradient, using local information and limited communication.
result Converges to globally optimal policy with dimension-free complexity and localization error.

Fairness is essential for human society, contributing to stability and productivity. Similarly, fairness is also the key for many multi-agent systems. Taking fairness into multi-agent learning could help multi-agent systems become both efficient and stable. However, learning efficiency and fairness simultaneously is a …

2019-10-31abs ↗pdf ↗