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

0111 · Dec 202019922001200920172026
8 results for multichain

Faster algorithms for solving multichain MDPs under average-reward criterion.

problem Navigating towards the best connected component in multichain MDPs.
method Developed algorithms to better solve the navigational subproblem, achieving faster convergence rates.
result Improved rates of convergence and sharper complexity measures for multichain MDPs.

Study optimality in safety-constrained Markov decision processes using asynchronous value iteration and modified Q-learning.

problem Optimality in safety-constrained Markov decision processes with multichain structure.
method Formulated as a zero-sum game, constructed asynchronous value iteration scheme and modified Q-learning algorithm.
result Resolved Bellman's principle of optimality for multichain Markov decision processes and provided learning algorithms.

A new approach uses circuit topology to study complex polymer interactions.

problem Understanding structural phase transitions in entangled polymer systems.
method Braided circuit topology framework for multiple-chain systems.
result Circuit topological motif fractions are effective order parameters for structural transitions.

The paper proposes a machine learning framework for detecting DeFi fraud across multiple blockchain chains.

problem Early detection of financial crimes in decentralized finance (DeFi) ecosystems.
method Extracting features from different blockchain chains, employing XGBoost and Neural Network for fraud detection.
result Introduction of novel DeFi-related features significantly improves fraud detection accuracy.

Optimizes learning policies in MDPs with weakly communicating structure.

problem Learning optimal policies in weakly communicating MDPs with generative model.
method Span-based approach, reducing to discounted MDPs for analysis.
result First minimax optimal sample complexity bound for weakly communicating MDPs.