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

237473710946 · Jun 202019922001200920172026
48 results for Peer-to-Peer Networks

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.

We provide two distributed confidence ball algorithms for solving linear bandit problems in peer to peer networks with limited communication capabilities. For the first, we assume that all the peers are solving the same linear bandit problem, and prove that our algorithm achieves the optimal asymptotic regret rate of a…

2016-04-26abs ↗pdf ↗

Paper tackles low sample and communication complexities in decentralized bilevel optimization.

problem Decentralized bilevel optimization problems with limited computation and communication capabilities.
method Proposes INTERACT and SVR-INTERACT algorithms to achieve low sample and communication complexities.
result Achieves both low sample and communication complexities for solving decentralized bilevel optimization problems.

FedCoin uses blockchain to fairly distribute incentives in federated learning.

problem Fairly incentivizing data owners in federated learning with privacy concerns.
method FedCoin uses a blockchain-based peer-to-peer payment system with a proof of Shapley (PoSap) protocol to calculate and distribute Shapley Values.
result FedCoin accurately computes Shapley Values and promotes high-quality data contributions.

Study optimal risk sharing in decentralized peer-to-peer markets with robust risk measures.

problem Optimizing risk sharing in decentralized markets with non-convex risk measures.
method Characterization of Pareto-optimal allocations using robust distortion risk measures and probabilistic risk aversion.
result Shape of allocations depends on agents' tail risk assessments.

Study finds Aave token network has core-periphery structure, with high decentralization predicting better returns.

problem Understanding the actual decentralization in DeFi token transactions on the Ethereum blockchain.
method Applied social network analysis to measure decentralization in Aave token transactions.
result A more decentralized Aave token network predicts higher returns and lower volatility.

We propose a decentralized learning algorithm over a general social network. The algorithm leaves the training data distributed on the mobile devices while utilizing a peer to peer model aggregation method. The proposed algorithm allows agents with local data to learn a shared model explaining the global training data …

2019-05-24abs ↗pdf ↗

The paper analyzes reinsurance strategies in peer-to-peer insurance schemes.

problem Strategic interaction between plan managers and reinsurers in P2P insurance.
method Develops two game-theoretic contract designs: Pareto and Bowley designs, deriving optimal contracts and analyzing their welfare effects.
result The Bowley design yields a unique optimal contract, while the Pareto design allows for multiple Pareto-optimal contracts.

The study improves credit evaluation in peer-to-peer lending using machine learning.

problem Traditional credit histories are insufficient for distinguishing good from bad borrowers.
method Used machine learning classification and clustering algorithms to predict creditworthiness.
result Achieved 65% F1 and 73% AUC on LendingClub data, identifying key secondary attributes.

Paper proves PI consensus algorithm converges exponentially under restricted secant inequality.

problem Proving convergence of PI consensus algorithm without convexity.
method Lyapunov theory, restricted secant inequality, rate-matching discretization, local pre-conditioning.
result Exponential convergence of PI consensus algorithm for non-convex functions.

The rise of connected personal devices together with privacy concerns call for machine learning algorithms capable of leveraging the data of a large number of agents to learn personalized models under strong privacy requirements. In this paper, we introduce an efficient algorithm to address the above problem in a fully…

2017-05-23abs ↗pdf ↗

A novel approach tackles sparse linear bandits with reduced communication costs and minimal cumulative regret.

problem Sparse linear bandits with high-dimensional feature vectors and limited relevant features.
method Cooperative Thresholded Lasso using Lasso and ridge regression for dimension reduction and aggregation.
result Regret bound of O(s0logd+s0T)\mathcal{O}(s_0 \log d + s_0 \sqrt{T}) with high probability.

A decentralized online quantum cash system, called qBitcoin, is given. We design the system which has great benefits of quantization in the following sense. Firstly, quantum teleportation technology is used for coin transaction, which prevents from the owner of the coin keeping the original coin data even after sending…

2017-08-15abs ↗pdf ↗

We consider the problem of training a machine learning model over a network of nodes in a fully decentralized framework. The nodes take a Bayesian-like approach via the introduction of a belief over the model parameter space. We propose a distributed learning algorithm in which nodes update their belief by aggregate in…

2019-01-31abs ↗pdf ↗

Exchanges acquire excess processing capacity to accommodate trading activity surges associated with zero-sum high-frequency trader (HFT) "duels." The idle capacity's opportunity cost is an externality of low-latency trading. We build a model of decentralized exchanges (DEX) with flexible capacity. On DEX, HFTs acquire …

2019-07-24abs ↗pdf ↗

Bitcoins and Blockchain technologies are attracting the attention of different scientific communities. In addition, their widespread industrial applications and the continuous introduction of cryptocurrencies are also stimulating the attention of the public opinion. The underlying structure of these technologies consti…

2018-04-06abs ↗pdf ↗

Study compares financial and gambling markets, finding similarities and potential applications.

problem Lack of comprehensive study on gambling markets compared to financial markets.
method Comprehensive comparison of five aspects: platform, product, procedure, participant, and strategy.
result Well-established financial strategies can be applied to gambling markets, particularly in peer-to-peer betting exchanges.

A novel fully asynchronous scheme for distributed reinforcement learning over networks.

problem Policy evaluation in distributed reinforcement learning over networks.
method Design of a stochastic average gradient (SAG) based distributed algorithm and push-pull augmented graph approach.
result The proposed algorithm converges at a linear rate of \(\mathcal{O}(c^k)\) with \(c\in(0,1)\) and \(k\) increasing by one per node update.

In this chapter, we analyze nonlinear filtering problems in distributed environments, e.g., sensor networks or peer-to-peer protocols. In these scenarios, the agents in the environment receive measurements in a streaming fashion, and they are required to estimate a common (nonlinear) model by alternating local computat…

2017-04-28abs ↗pdf ↗

This paper analyzes P2P collaborative insurance products and network structure impact.

problem Analyzing P2P collaborative insurance products and their network structure impact.
method Examined a P2P insurance product with reciprocal risk sharing contracts, studied network structure impact on risk reduction, and discussed optimal reciprocal commitments.
result The network structure, particularly the distribution of degrees, significantly impacts risk reduction in P2P insurance products.

Distributed securities exchanges may become de facto fragmented if they span geographical regions with asymmetric computer infrastructure. First, we build an economic model of a decentralized exchange with two miner clusters, standing in for compact areas of economic activity (e.g., cities). "Local" miners in the area …

2019-10-24abs ↗pdf ↗

We generalize stochastic subgradient descent methods to situations in which we do not receive independent samples from the distribution over which we optimize, but instead receive samples that are coupled over time. We show that as long as the source of randomness is suitably ergodic---it converges quickly enough to a …

2011-05-24abs ↗pdf ↗

This paper proposes a two-stage scoring approach to help lenders decide their fund allocations in the peer-to-peer (P2P) lending market. The existing scoring approaches focus on only either probability of default (PD) prediction, known as credit scoring, or profitability prediction, known as profit scoring, to identify…

2018-10-05abs ↗pdf ↗

A new framework integrates credit scoring into profit scoring for better P2P lending investments.

problem Maximizing profit while minimizing risk in P2P lending investments.
method Two-stage framework using Light Gradient Boosting Machine (lightGBM) to integrate credit scoring into profit scoring.
result The proposed framework identifies more profitable loans and provides better investment guidance.

Research tackles alliance formation in many-player zero-sum games, showing reinforcement learning fails but a contract mechanism can help.

problem Tackles the challenge of alliance formation in many-player zero-sum games.
method Demonstrates the social dilemma aspect of alliance formation, introduces a contract mechanism to augment reinforcement learning.
result Naïve reinforcement learning fails to form alliances, but a contract mechanism can help.

Decentralized ranking consensus via gossip for robust and scalable systems.

problem Achieving reliable and resilient consensus on collective rankings in a decentralized setting.
method Random gossip communication for decentralized computation of global rankings.
result Robust and scalable consensus on collective rankings achieved through decentralized, local interactions.

Credit risk prediction is an effective way of evaluating whether a potential borrower will repay a loan, particularly in peer-to-peer lending where class imbalance problems are prevalent. However, few credit risk prediction models for social lending consider imbalanced data and, further, the best resampling technique t…

2018-04-28abs ↗pdf ↗