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

158316474632 · Jun 202019922001200920172026
48 results for distributed agents

BGANs enable multi-agent learning with distributed private datasets.

problem Learning from distributed private datasets in multi-agent scenarios.
method Brainstorming GAN architecture for fully distributed learning.
result BGANs generate high-quality data samples with lower JSD and FID.

Paper studies IPG method's robustness in noisy distributed linear regression.

problem Distributed linear regression with noise.
method Iteratively Pre-conditioned Gradient-descent (IPG) method.
result IPG method's robustness against noise compared favorably to state-of-the-art algorithms.

We consider a financial market model which consists of a financial asset and a large number of interacting agents classified into many types. Different types of agents are heterogeneous in their price expectations. Each agent can change its type based on the current empirical distribution of the types and the equilibri…

2007-03-28abs ↗pdf ↗

Stochastic games provide a framework for interactions among multiple agents and enable a myriad of applications. In these games, agents decide on actions simultaneously, the state of every agent moves to the next state, and each agent receives a reward. However, finding an equilibrium (if exists) in this game is often …

2019-05-30abs ↗pdf ↗

Paper addresses fault-tolerance in distributed machine learning with stochastic gradient descent.

problem Fault-tolerance in distributed stochastic gradient descent (D-SGD) for machine learning.
method Proposes norm-based comparative gradient elimination (CGE) to robustify D-SGD against Byzantine faulty agents.
result CGE guarantees fault-tolerance against a bounded fraction of Byzantine agents under standard stochastic assumptions.

A method to minimize regret in multi-agent control systems with adversarial disturbances.

problem Optimal control of dynamical systems with adversarial disturbances and multiple agents.
method Reduction from online convex optimization to a distributed algorithm for multi-agent control.
result The resulting distributed algorithm has low regret relative to the optimal precomputed joint policy.

Agents cooperate to make decisions in multi-armed bandits over a graph.

problem Optimizing decisions in multi-agent multi-armed bandits with shared information.
method Designs consensus-based distributed estimation and cooperative algorithms for group decision-making.
result Achieves group performance close to centralized fusion center.

UD-SGD analysis shows efficient sampling by a few agents can outperform others.

problem Analyzing convergence speed and sampling strategies in UD-SGD.
method Asymptotic analysis of UD-SGD with various communication patterns and sampling strategies.
result Efficient sampling by a few agents can lead to better overall convergence.

We consider a distributed learning setup where a network of agents sequentially access realizations of a set of random variables with unknown distributions. The network objective is to find a parametrized distribution that best describes their joint observations in the sense of the Kullback-Leibler divergence. Apart fr…

2016-05-06abs ↗pdf ↗

We analyze a conservative market model for the competition among economic agents in a close society. A minimum dynamics ensures that the poorest agent has a chance to improve its economic welfare. After a transient, the system self-organizes into a critical state where the wealth distribution have a minimum threshold, …

2003-11-05abs ↗pdf ↗

The paper proposes a new method to evaluate LLM agent responses using ECDF clustering.

problem The standard evaluation of LLM agent responses via majority voting obscures response quality and distribution.
method The paper introduces a novel evaluation framework based on ECDF of cosine similarities and clustering of ECDFs using distances and kk-medoids algorithm.
result ECDF clustering reveals interpretable group structures in LLM responses, offering insights into agent settings.

New algorithm identifies near-optimal policies in adversarial distributed RL settings.

problem Adversarial agents in distributed RL settings that can collude and report arbitrary data.
method Weighted-Clique algorithm for robust mean estimation from batches, combined with novel distributed algorithms.
result Achieves superior robustness guarantees and near-optimal sample complexities in both offline and online settings.

Study optimal investment decisions for diverse risk-tolerant agents.

problem Optimizing investment choices for agents with varying risk preferences.
method Characterizes optimal behavior using certainty equivalents and lognormal risks.
result Derives optimal decision menus under known and uncertain preference distributions.

Extends Optimal Transport to multiple agents, aiming for equitable and optimal distribution.

problem Sharing costs or goods equitably among multiple agents with different preferences.
method Minimizes the maximum transportation cost or maximizes the minimum utility.
result Provides a new algorithm faster than standard linear programming.

We consider the ideal-gas models of trading markets, where each agent is identified with a gas molecule and each trading as an elastic or money-conserving (two-body) collision. Unlike in the ideal gas, we introduce saving propensity λλ of agents, such that each agent saves a fraction λλ of its money and trades with t…

2003-02-07abs ↗pdf ↗

This paper studies the trading volumes and wealth distribution of a novel agent-based model of an artificial financial market. In this model, heterogeneous agents, behaving according to the Von Neumann and Morgenstern utility theory, may mutually interact. A Tobin-like tax (TT) on successful investments and a flat tax …

2015-05-20abs ↗pdf ↗

New algorithm tackles multi-agent reinforcement learning issues.

problem Multi-agent reinforcement learning suffers from the curse of many agents.
method Proposes MF-FQI algorithm based on mean embeddings of distributions.
result Establishes a non-asymptotic analysis for MF-FQI algorithm.

New algorithm reduces individual regret and communication costs in cooperative bandits.

problem Optimal individual and group regret in cooperative multi-agent bandits.
method Integrates a new communication policy into a learning algorithm.
result Achieves optimal individual regret and constant communication costs.

This paper considers the problem of Byzantine fault tolerance in distributed linear regression in a multi-agent system. However, the proposed algorithms are given for a more general class of distributed optimization problems, of which distributed linear regression is a special case. The system comprises of a server and…

2019-03-20abs ↗pdf ↗

New collaborative algorithm improves personalized mean estimation in online settings.

problem Online estimation of means from multiple, possibly overlapping distributions.
method Novel collaborative strategy for active querying and mean estimation.
result Algorithm improves mean estimates through communication among agents.

The paper proves convergence to global optima for a class of distributed algorithms for nonconvex optimization in network-based multi-agent settings. Agents are permitted to communicate over a time-varying undirected graph. Each agent is assumed to possess a local objective function (assumed to be smooth, but possibly …

2019-03-18abs ↗pdf ↗

DEOT method compares distributions across agents with privacy and efficiency.

problem Comparing distributions across agents in a distributed system.
method Decentralized entropic optimal transport with mini-batch randomized block-coordinate descent and decentralized kernel approximation.
result The method provides a privacy-preserving and communication-efficient solution to distributed distribution comparison.

Paper proposes a pre-conditioning method to speed up gradient descent in multi-agent optimization.

problem Speed up convergence of gradient descent in multi-agent optimization problems.
method Iterative pre-conditioning approach to mitigate the effect of problem conditioning.
result Significant improvement in convergence speed of gradient descent method.

In this article, we established a stock market model based on agents' investing mentality. The agents decide whether to purchase the shares at the probability, according to their anticipation of the market's behaviors. The expectation of the amount of shares they want to buy is directly proportional to the value of ass…

2004-06-16abs ↗pdf ↗

We consider the ideal-gas models of trading markets, where each agent is identified with a gas molecule and each trading as an elastic or money-conserving (two-body) collision. Unlike in the ideal gas, we introduce saving propensity λλ of agents, such that each agent saves a fraction λλ of its money and trades with t…

2003-11-11abs ↗pdf ↗

Robust reinforcement learning agents generalize well to out-of-distribution settings using pretrained representations.

problem Achieving sample-efficient reinforcement learning agents that generalize to real-world settings.
method Trained 240 representations and 10,000 RL policies on a simulated robotic setup, evaluating different pretrained VAE-based representations' effects on OOD generalization.
result Many reinforcement learning agents are surprisingly robust to realistic distribution shifts, including sim-to-real cases.

We model a closed economic system with interactions that generates the features of empirical wealth distribution across all wealth brackets, namely a Gibbsian trend in the lower and middle wealth range and a Pareto trend in the higher range, by simply limiting the an agents' interaction to only agents with nearly the s…

2007-10-04abs ↗pdf ↗

Locally private reinforcement learning protects individual environments from reverse engineering.

problem Protecting private information in distributed reinforcement learning environments.
method Locally differentially private algorithms that protect local agents' models from adversarial reverse engineering.
result Demonstrated that the proposed algorithm performs well under local differential privacy (LDP).

Gaussian prior and likelihood improve bandit learning performance.

problem Improving bandit learning with misspecified Gaussian distributions.
method An agent with a bounded information ratio interacts with a Bernoulli bandit based on a Gaussian prior and likelihood.
result The regret increase is at most linear in the square-root of the time horizon for diffuse distributions.

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.

We study the model of interacting agents proposed by Chatterjee et al that allows agents to both save and exchange wealth. Closed equations for the wealth distribution are developed using a mean field approximation. We show that when all agents have the same fixed savings propensity, subject to certain well defined app…

2004-07-29abs ↗pdf ↗

Boltzmann-Gibbs distribution arises as the statistical equilibrium probability distribution of money among the agents of a closed economic system where random and undirected exchanges are allowed. When considering a model with uniform savings in the exchanges, the final distribution is close to the gamma family. In thi…

2012-08-02abs ↗pdf ↗

This work proposes ACTC for adaptive distributed learning under communication constraints.

problem Adaptive distributed learning in networks with communication constraints.
method ACTC (Adapt-Compress-Then-Combine) strategy with diffusion exchange of compressed updates.
result ACTC iterates converge to the optimizer with significant bit savings.

We propose a model for equity trading in a population of agents where each agent acts to achieve his or her target stock-to-bond ratio, and, as a feedback mechanism, follows a market adaptive strategy. In this model only a fraction of agents participates in buying and selling stock during a trading period, while the re…

2018-09-25abs ↗pdf ↗

In this work we essentially reinterpreted the Sieczka-Hołyst (SH) model to make it more suited for description of real markets. For instance, this reinterpretation made it possible to consider agents as crafty. These agents encourage their neighbors to buy some stocks if agents have an opportunity to sell these stocks.…

2013-01-11abs ↗pdf ↗

Tax dynamics affects wealth distribution in a linearly growing socio-economic model.

problem Analyzing how tax policies impact wealth distribution in a stochastic resetting system.
method Analytical and numerical study of a system of agents with linear wealth growth, stochastic resetting, and tax redistribution.
result Optimal taxation leads to economic equality, while excessive taxation results in reverse disparity.

This paper accelerates distributed convex optimization by mitigating ill-conditioning issues.

problem Distributed convex optimization with ill-conditioned aggregate cost functions.
method Iterative pre-conditioning technique to improve convergence rate and stability.
result The proposed algorithm converges linearly with improved convergence rate and superlinearly under certain conditions.

Algorithm reduces regret in distributed kernel bandits with shared randomness.

problem Minimizing regret in collaborative function maximization.
method Uniform exploration at local agents and shared randomness with central server.
result Achieves optimal regret order with sublinear communication cost.