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.

169,051 papers · 148 categories

Trend · papers per month

0.3%0.5%0.8%0.3% · May 201119922001200920182026
48 results for Peer-to-peer

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.

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.

This paper builds a recommendation system for borrowers on P2PL platforms to lower interest rates.

problem Help borrowers make wise decisions on P2PL platforms to achieve lower interest rates.
method Developed a recommendation system to suggest the type of loan borrowers should apply for.
result Borrowers can achieve lowered interest rates with a higher likelihood of getting funded using the recommendation system.

BrainTorrent uses peer-to-peer FL for medical image segmentation without a central server.

problem Lack of sufficient annotated data for personalized medical models.
method Peer-to-peer federated learning framework without a central server.
result BrainTorrent outperforms traditional server-based FL and achieves similar performance to pooled data training.

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.

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 ↗

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 ↗

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.

DEX allows HFTs to quickly acquire speed, improving price discovery without sacrificing liquidity.

problem Low-latency trading's externality and resource inefficiency in centralized exchanges.
method Model of decentralized exchanges with real-time speed acquisition from peer-to-peer networks.
result HFTs on DEX acquire more speed for shorter timespans, decreasing price discovery time and reducing resource lock-in.

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 ↗

This paper uses LSTM to predict P2P lending default rates, improving accuracy with macroeconomic data.

problem Predicting default rates in the P2P lending market for risk assessment.
method Long Short Term Memory (LSTM) model with unemployment rate as a macroeconomic factor.
result LSTM model outperforms traditional time series models in predicting default rates.

Two-stage scoring approach for P2P lending improves loan profitability prediction.

problem Class imbalance and lack of profitability prediction in existing scoring methods.
method Integrates credit scoring and profit scoring using wide and deep learning.
result Two-stage scoring approach outperforms existing methods in loan profitability prediction.

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.

Decentralized learning of personalized models and collaboration graphs without central coordination.

problem Training personalized models and collaboration graphs in a decentralized manner without a central coordinator.
method Alternates between training models given the graph and updating the graph given the models, using peer-to-peer exchanges.
result Communication-efficient approach that avoids exchanging personal data, with benefits demonstrated on synthetic and real datasets.

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.

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.

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.

Decentralized algorithm for non-convex problems converges faster than centralized methods.

problem Non-convex empirical risk minimization over decentralized networks.
method Decentralized stochastic gradient tracking (DSGT) with mini-batch SG steps.
result DSGT achieves comparable convergence rates to centralized SGD and can achieve linear speedup.

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 ↗

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.

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.

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.

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 ↗

Unified framework for Byzantine robust gossip algorithms with guaranteed performance.

problem Vulnerability of decentralized machine learning to misbehaving devices.
method Introduces F-RG framework and CS+ robust aggregation rule for Byzantine resilience.
result CS+-RG has near-optimal breakdown tolerance and outperforms existing methods.

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 ↗

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 ↗

Human stablecoin transactions predict political risk in cryptocurrency markets.

problem Predicting political risk in cryptocurrency markets.
method Structural break analysis and surrogate-based robustness tests.
result Human-driven stablecoin transactions shift significantly before major political events.

Study predicts P2P lending platform failures using machine learning.

problem Predicting failures of P2P lending platforms in China.
method Used machine learning models with filter and wrapper methods, forward selection, and backward elimination.
result Identified robust variables for predicting platform failures with high AUC and F1 scores.

Fragmented exchanges arise due to speed advantages in high-activity regions.

problem Fragmentation of distributed securities exchanges due to speed advantages in high-activity regions.
method Economic model and Monte Carlo simulations of a decentralized exchange with two miner clusters.
result Speed advantage increases with infrastructure asymmetry between regions.

Gossip-based actor-learner architectures improve deep reinforcement learning efficiency and scalability.

problem Stabilizing and scaling deep reinforcement learning through multi-simulator training.
method Gossip-based communication among actor-learners in a peer-to-peer topology, reducing synchronization.
result Gossip-based architectures outperform A2C in terms of robustness and sample efficiency.