DECS tool assesses swap rates of DEXes and Fusion outperforms competitors.
problem Lack of unbiased swap rate comparisons in decentralized finance.
method Swap transaction monitoring and simulation techniques.
result 1inch Classic and Fusion consistently outperform competitors in swap rates.
Algorithm for agents to agree on a single objective in multi-task networks.
problem Decentralized decision-making in multi-task networks with multiple objectives.
method Distributed decision-making algorithm for agents observing different models.
result Agents reach agreement on which model to track for network performance enhancement.
Framework for responsible LLM deployment with human involvement and decentralized technologies.
problem Challenges in deploying LLMs for high-stakes decisions, including data security and accountability.
method Interactive human involvement through multiple iterations, decentralized technologies, and automated auditing.
result Enhanced security and accountability in LLM deployment for financial decisions.
This paper analyzes voter coalitions in MakerDAO's decentralized governance.
problem Understanding the governance structure and influence of voter coalitions in DAOs.
method Applied clustering algorithm to voting history of MakerDAO to identify voter coalitions.
result The emergence of a dominant voter coalition signals governance centralization in DAOs.
A decentralized approach for agents to learn and optimize collectively.
problem Challenges in coordinating non-cooperative agents to solve complex sequential decision problems.
method Designing a learning environment where agents learn by trading and optimizing local objectives, leading to a Nash equilibrium.
result Decentralized reinforcement learning algorithms that can handle various decision-making scenarios.
Review of recent advances in decentralized MARL with networked agents.
problem Sequential decision-making by networked agents without central coordination.
method Analysis of recent algorithms and their theoretical foundations.
result Inspiring more research in this challenging area.
Partner-aware algorithms improve AI collaboration in multi-agent settings.
problem Improving AI cooperation in teams with shared rewards.
method Proposed Partner-Aware strategy extending Upper Confidence Bound for decentralized MAB.
result Achieves logarithmic regret in collaborative decision-making.
This article reviews recent advances in secure distributed and decentralized inference and learning against Byzantine threats.
problem Securing distributed and decentralized inference and learning against malicious attacks.
method Review of recent algorithmic approaches under Byzantine threat model.
result A plethora of robust algorithmic approaches have been developed.
New RL method for swarm systems improves agent communication.
problem Scaling deep RL to large homogeneous swarm systems.
method Mean embeddings of agent distributions for decentralized decision making.
result Neural network mean embedding representation enhances collective strategies.
The paper addresses private and Byzantine-proof cooperative decision-making in multi-agent systems.
problem Designing algorithms for multi-agent decision-making that are private and resilient to faulty agents.
method Upper-confidence bound algorithms for stochastic bandit problems under privacy and Byzantine conditions.
result Optimal regret achieved in both private and Byzantine-tolerant settings.
WOCCE uses crowd wisdom to improve clustering decisions.
problem Improving clustering decisions through group wisdom.
method A feedback framework for cluster ensemble that evaluates decentralization, independence, and diversity criteria.
result WOCCE outperforms other algorithms in aggregate decision-making.
The problem of secure friend discovery on a social network has long been proposed and studied. The requirement is that a pair of nodes can make befriending decisions with minimum information exposed to the other party. In this paper, we propose to use community detection to tackle the problem of secure friend discovery…
New algorithms for decentralized MARL with networked agents maximize global return.
problem Fully decentralized multi-agent reinforcement learning with networked agents.
method Two decentralized actor-critic algorithms with function approximation for large-scale problems.
result Convergence guarantees for linear function approximations, validated by simulations.
Quantized Decentralized Gradient Descent (QDGD) solves distributed optimization with quantized communications.
problem Minimizing the sum of smooth and strongly convex functions over a network of distributed agents with quantized communications.
method Proposes QDGD algorithm combining quantized and local information for decentralized gradient descent.
result Achieves vanishing mean solution error under strong convexity and smoothness assumptions.
New algorithms detect anomalies in processes with minimal delay.
problem Sequentially selecting and observing processes to identify anomalies.
method Developed centralized and decentralized anomaly detection algorithms using reinforcement learning.
result Minimizes delay in decision making while identifying anomalies accurately.
Study uses multi-agent reinforcement learning to control self-assembly with high-resolution external control.
problem Designing effective external control protocols for self-assembly with high-resolution control.
method Investigated a multi-agent reinforcement learning approach, comparing fully decentralized and partially decentralized strategies.
result Partially decentralized approach outperforms fully decentralized in controlling self-assembly towards target structures.
This paper surveys methods to handle non-stationarity in multi-agent deep reinforcement learning.
problem Non-stationarity in multi-agent reinforcement learning environments.
method Modifications in training procedures, opponent policy representation learning, meta-learning, communication, and decentralized learning.
result A comprehensive review of recent works on addressing non-stationarity in multi-agent deep reinforcement learning.
COKE reduces communication in decentralized kernel learning.
problem Decentralized kernel learning challenges due to data-dependent decision variables.
method Random feature approximation and ADMM for iterative optimization; communication-censored algorithm.
result COKE achieves faster convergence and reduced communication load.
DeXposure-Claw supervises decentralized finance risks by grounding LLM decisions in evidence.
problem Weak evidence leads to over-interventions by general-purpose LLM agents in decentralized finance.
method DeXposure-Claw uses a graph time-series foundation model to forecast exposure networks, turning forecasts into alerts and constraining escalation with data-health gates.
result DeXposure-Claw reduces false alarms and improves regulator alignment in decentralized finance risk supervision.
Study improves cryptocurrency volatility forecasting using multiple data sources.
problem Improving accuracy of predicting cryptocurrency volatility.
method Developed CoMForE, a multimodal AdaBoost-LSTM ensemble model.
result Significantly improved cryptocurrency volatility forecasting (19.29% improvement).
Decentralized mechanism for collective predictions without sharing data or models.
problem Making predictions jointly among multiple parties without sharing data or models.
method Inspired by social science consensus-making, a decentralized mechanism for test-time collective predictions.
result Our mechanism converges to inverse meansquared-error weighting in the large-sample limit and achieves significant gains over classical model averaging.
New decentralized KRR algorithm adapts to node-specific data.
problem Consistent node-specific data in decentralized KRR.
method Data-dependent random features for adaptive RF generation.
result Average regression accuracy improved by 25.5% across six datasets.
This paper develops efficient federated learning and unlearning methods in Bayesian models.
problem Managing epistemic uncertainty and legal right to be forgotten in decentralized networks.
method Develops federated variational inference solutions based on decentralized local free energy minimization.
result Demonstrates efficient unlearning mechanisms in federated learning and unlearning.
Proposes efficient algorithm for system-level I&M decisions under uncertainty.
problem Optimal management strategies for deteriorating civil engineering systems.
method Factored partially observable Markov decision process with Bayesian networks and DDMAC reinforcement learning.
result DDMAC policies offer substantial benefits over heuristic approaches in system-level cost optimization.
Proposes a new algorithm to reduce communication costs in decentralized training.
problem How to apply error-compensated compression to decentralized training.
method Error-compensated stochastic gradient descent for decentralized training.
result Proposed algorithm outperforms existing methods in communication cost reduction.
Graph neural networks learn decentralized controllers from data.
problem Finding optimal decentralized controllers for autonomous agents is challenging.
method Adapting graph neural networks to handle delayed communications and ensure scalability and transferability.
result Graph neural networks can learn decentralized controllers from data, addressing the scalability and practical implementation issues of centralized controllers.
New algorithm improves decentralized learning in the presence of Byzantine faults.
problem Byzantine faults in decentralized learning on arbitrary graphs.
method Proposes ClippedGossip for Byzantine-robust consensus and optimization.
result First to provably converge to a specified neighborhood of the stationary point for non-convex objectives.
DeFi TrustBoost uses blockchain and AI to assess small business loans.
problem Assessing small business loans from low-wealth households.
method Combines blockchain and Explainable AI to ensure confidentiality, compliance, and security.
result Tamper-proof auditing and on-chain/off-chain data storage for financial organizations.
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.
Quantum self-attention boosts automated market maker performance in crypto trading.
problem Improving automated market maker rebalancing in crypto trading.
method Quantum Adaptive Self-Attention (QASA) using variational quantum circuits and softmax attention.
result QASA-Sequence variant achieves best single-model risk-adjusted performance in crypto trading.
This research simplifies lending pools in decentralized finance for better understanding and security.
problem Complexity and lack of executable models make lending pools hard to understand and predict.
method Developed a formal model to reflect common features of lending pools and proved general properties.
result Proved correct handling of funds and described vulnerabilities and attacks.
A system for supervising decentralized finance risks using LLMs and structured evidence.
problem Supervising decentralized finance risks
method Forecast-grounded agentic supervision system
result Developed a system that scores tickets against a regulator-aligned ground truth and false-intervention rate.
New framework learns swarm behaviors from demonstrations.
problem Applying IRL to large-scale, homogeneous multi-agent systems.
method Introducing swarMDP, reducing multi-agent IRL to single-agent, proposing heterogeneous learning scheme.
result Value functions of swarm agents coincide, enabling single-agent solution.
Agents learn shared dictionary elements and parameters in a decentralized online setting.
problem Discriminative dictionary learning in a distributed online setting.
method Formulated as a distributed stochastic program, solved using a block variant of the Arrow-Hurwicz saddle point algorithm with Lagrange multipliers.
result Decisions asymptotically achieve a first-order stationarity condition on average.
New method for decentralized learning from diverse clients.
problem Achieving high-performance global model from diverse client models.
method Decentralized Learning via Adaptive Distillation (DLAD).
result Demonstrates effectiveness of DLAD on multiple public datasets.
A deep RL framework optimizes resource allocation in wireless networks.
problem Optimizing resource allocation and interference in wireless networks.
method Multi-agent deep reinforcement learning for distributed decision-making.
result Our approach outperforms decentralized and centralized baselines in terms of user rates.
DICE estimates data influence cascade in decentralized learning networks.
problem Lack of fair incentives discourages participation in decentralized learning.
method Designs DICE to estimate influence cascade in decentralized networks.
result Influence cascade is influenced by data, topology, and loss landscape curvature.
Decentralized learning improves personalized models through gossip algorithms.
problem How to improve personalized models in a network of learning agents.
method Two asynchronous gossip algorithms: label propagation and iterative updates based on local and neighbor data.
result Decentralized learning algorithms enhance model accuracy and consistency.
Study on learning strategies in matching markets with uncertain preferences.
problem Decision-making in scarcity of shared resources with unknown agent preferences.
method Representation of preferences in a reproducing kernel Hilbert space, learning algorithm for uncertainty.
result Optimal strategies derived to maximize agents' expected payoffs, with stability and fairness properties.
This paper uses DRL to optimize liquidity in DeFi protocols, making markets more accessible.
problem Optimizing liquidity provisioning in decentralized finance protocols.
method Modeling liquidity provisioning as an MDP, training an agent with PPO to dynamically adjust positions.
result DRL-based strategy outperforms traditional heuristics in fee maximization and impermanent loss mitigation.
TRIBE model uses LLMs to simulate human trading behavior in bond markets.
problem Complexities in decentralized bond market transactions.
method Agent-based model augmented with LLMs to simulate human-like decision-making.
result Slight trade aversion in LLMs can lead to complete market collapse.
A new algorithm reduces regret in multiplayer bandits with minimal communication.
problem Maximizing rewards in multiplayer multi-armed bandits with collisions.
method DPE (Decentralized Parsimonious Exploration) algorithm.
result Achieves the same regret as optimal centralized algorithms with less communication.
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} 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.
The paper examines how decentralized credit curators have taken over risk management from traditional protocols.
problem Risk management in decentralized credit has shifted from centralized protocols to decentralized curators.
method Analysis of ERC 4626 vaults and third-party curators, focusing on capital utilization, concentration, and fee margins.
result Curators have a significant impact on the risk profile of decentralized credit systems, with a small set of curators handling a disproportionate share of system TVL.
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.
AsylADMM improves gossip-based learning for non-smooth objectives.
problem Efficient and robust decentralized learning on edge devices.
method Asynchronous gossip algorithm for non-smooth optimization.
result AsylADMM converges faster on non-smooth problems.
QLAMMP optimizes fees on AMMs using Q-Learning.
problem Static AMMs cannot adapt to market changes, leading to high slippage.
method Developed a Q-Learning Agent (QLAMMP) to learn optimal fee rates.
result QLAMMP consistently outperforms static AMMs under various market conditions.