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.
This paper designs a new on-chain option that amortizes perpetual options for blockchain environments.
problem No equivalent standard for on-chain options exists, leading to high-frequency oracles and liquidation engines failures.
method Develops an amortizing perpetual option contract tailored to blockchain constraints, introducing a decentralized market framework.
result Demonstrates that the new contract functions as a risk primitive for DeFi, enabling applications like endogenous collateralization and de-peg insurance.
This paper presents the theory of non-smooth Lie group actions on chains of Banach manifolds. The rigorous functional analytic spaces are given to deal with quotients of such actions. A hydrodynamical example is studied in detail.
The paper uses AI to analyze on-chain parameters and identify risky cryptocurrencies.
problem Identifying risky cryptocurrencies and understanding their price factors.
method Historical data analysis, AI algorithms, clustering, classification.
result A significant negative correlation between cryptocurrency price and maximum and total supply, and a weak positive correlation with 24-hour trading volume.
Study on-chain peak shaving to reduce Ethereum transaction costs.
problem Reducing transaction costs in blockchain networks, especially during congested periods.
method Analyzing transaction-level data from multiple firms across various industries to understand scheduling responses and cost management strategies.
result Firms' scheduling responses to congestion vary, leading to different fee savings and residual costs.
Proof of Stake (PoS) is a burgeoning Sybil resistance mechanism that aims to have a digital asset ("token") serve as security collateral in crypto networks. However, PoS has so far eluded a comprehensive threat model that encompasses both Byzantine attacks from distributed systems and financial attacks that arise from …
Suppose that a topological space X is the union of an increasing sequence of open subsets each of which is homeomorphic to the Euclidean space Rn. Then X itself is homeomorphic to Rn. This is an old theorem of Morton Brown. We observe that this theorem is an immediate consequence of other two theorems of Mort…
This paper introduces an inner product on chain complexes of finite simplicial complexes that is well-adapted to the harmonic study of subdivisions. Its definition utilizes a decomposition of the chain spaces that suggests a sequence of subdivision invariants which we show do not all vanish for non-trivial subdivisions…
We study the problem of interactively learning a binary classifier using noisy labeling and pairwise comparison oracles, where the comparison oracle answers which one in the given two instances is more likely to be positive. Learning from such oracles has multiple applications where obtaining direct labels is harder bu…
This study examines whether tokenized assets improve liquidity and finds significant differences across categories.
problem Improving liquidity for real-world assets through tokenization.
method Examined tokenized real-world assets using Ethereum-based data, measuring liquidity through turnover, active addresses, and active-month indicator.
result Gold-backed tokens show more persistent on-chain activity than Treasury and private-credit-related products, but asset value alone does not reliably predict liquidity.
In this paper we present the Ricci curvature on cell-complexes and show the Gauss-Bonnnet type theorem on graphs and 2-complex that decomposes closed surface. The defferential forms on a cell complex is defined as linear maps on chain complex, and Laplacian operates this defferential forms. Then we construct the Bochne…
Paper addresses online alignment of large language models under uncertain preference feedback.
problem Online alignment of large language models with misspecified preference feedback.
method Formulates an oracle-robust objective as a worst-case optimization problem for log-linear policies, and develops projected stochastic composite updates.
result Shows that the robust objective admits an exact closed-form decomposition and achieves O(ε−2) oracle complexity.
We consider the problem of minimizing the sum of submodular set functions assuming minimization oracles of each summand function. Most existing approaches reformulate the problem as the convex minimization of the sum of the corresponding Lovász extensions and the squared Euclidean norm, leading to algorithms requiring …