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

82165247329 · Jun 202019922001200920172026
48 results for Total Value Locked

Study finds TVL doesn't predict cryptocurrency returns.

problem Assumption of TVL predicting returns in crypto markets.
method Examined TVL-sorted portfolios against crypto market returns, using various TVL measures.
result TVL-sorted portfolios' returns are linear functions of crypto market returns, replicable with standard tools.

Study factors affecting liquidity on decentralized exchanges, introducing new metrics.

problem Understanding and predicting liquidity on decentralized exchanges (DEXs).
method Analyzes platform, blockchain, token pair, and liquidity pool factors; introduces new metrics.
result Identifies how various factors affect liquidity through concentration and total value locked.

Lock-in, the escalating commitment of decision-makers to an ineffective course of action, has the potential to explain the large cost overruns in large scale transportation infrastructure projects. Lock-in can occur both at the decision-making level (before the decision to build) and at the project level (after the dec…

2013-07-08abs ↗pdf ↗

Study on bit threads and their locking properties in holographic spacetimes.

problem Understanding the conditions under which regions can be locked in holographic spacetimes.
method Investigation of different density bounds and their implications on the locking of regions.
result Non-crossing regions can be locked under the most stringent bound, but crossing regions cannot.

Study analyzes risk management in Aave and Compound lending protocols, finding v3 better than v2.

problem Risk management in decentralized lending protocols.
method Cross-version and cross-chain analysis using fixed effects model.
result v3 protocols have better risk management, with stronger impact on L2 blockchains.

This paper introduces STAP to measure DEX efficiency and shows better routing algorithms increase DEX performance and stakeholder benefits.

problem Measuring and improving the efficiency of decentralized exchanges (DEXs).
method Introduces STAP as a measure of DEX efficiency and compares two routing algorithms.
result Better routing algorithms improve DEX efficiency and stakeholder benefits.

Training the deep convolutional neural network for computer vision problems is slow and inefficient, especially when it is large and distributed across multiple devices. The inefficiency is caused by the backpropagation algorithm's forward locking, backward locking, and update locking problems. Existing solutions for a…

2019-09-05abs ↗pdf ↗

Study shows cryptocurrency market impact on DeFi returns stronger than other drivers.

problem Understanding drivers of DeFi returns and their relative importance.
method Investigated four drivers: cryptocurrency market exposure, network effect, investor attention, and valuation ratio. Designed a new market index, DeFiX.
result Cryptocurrency market impact on DeFi returns is stronger than other drivers and provides superior explanatory power.

Paper tackles dynamic behavior of variable topology mechanisms, presenting new transition conditions.

problem Dynamic behavior of mechanisms with changing kinematic topology.
method Presented new transition conditions for variable topology mechanisms using projected motion equations and Voronets equations.
result Results show the dynamic behavior of joint locking in 3R and 6DOF mechanisms.

Stablecoin liquidity was affected by the SVB collapse, with USDC's transparency leading to market reactions.

problem Impact of stablecoin transparency on liquidity during market turmoil.
method Adapted MCI measure to Uniswap, Difference-in-Differences analysis on MCI and TVL, measured liquidity concentration.
result USDC's transparency led to swift market reactions, while USDT's opacity provided a safety net.

New methods combine model predictions to avoid linear mixtures' limitations.

problem Combining predictions from different models to avoid linear mixtures' limitations.
method Log-linear pooling (locking) and quantum superposition (quacking) to optimise model weights.
result Demonstrated locking method with illustrative example and practical application.

Stochastic variational inference (SVI) employs stochastic optimization to scale up Bayesian computation to massive data. Since SVI is at its core a stochastic gradient-based algorithm, horizontal parallelism can be harnessed to allow larger scale inference. We propose a lock-free parallel implementation for SVI which a…

2018-01-12abs ↗pdf ↗

Backpropagation algorithm is indispensable for the training of feedforward neural networks. It requires propagating error gradients sequentially from the output layer all the way back to the input layer. The backward locking in backpropagation algorithm constrains us from updating network layers in parallel and fully l…

2018-04-27abs ↗pdf ↗

Optimizes financial decisions with illiquid assets using Kelly criterion.

problem Determining optimal betting strategies in games with external capital constraints.
method Dynamic programming and WKB approximation for multi-round games; Kelly criterion for single-round games.
result Rational players adjust their risk-taking based on the proportion of their capital locked away.

Study on Gauss images of specific minimal surfaces with finite curvature.

problem Characterizing Gauss images of minimal surfaces with finite total curvature.
method Analyzing the number and weight of omitted and totally ramified values of Gauss maps.
result Construction of new minimal surfaces with specific Gauss map properties.

Stochastic gradient descent~(SGD) and its variants have attracted much attention in machine learning due to their efficiency and effectiveness for optimization. To handle large-scale problems, researchers have recently proposed several lock-free strategy based parallel SGD~(LF-PSGD) methods for multi-core systems. Howe…

2016-12-11abs ↗pdf ↗

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.

This paper tackles resource allocation in the Lightning Network using DRL.

problem Complex combinatorial problem of node selection and resource allocation in the Lightning Network.
method Attention-based Deep Reinforcement Learning framework.
result Improved resource allocation leads to better performance and decentralization in the LN.

The study constructs new minimal surfaces with more ramified values than previously known.

problem Understanding minimal surfaces with finite total curvature and specific ramification properties.
method Systematic construction of meromorphic functions on punctured spheres.
result New minimal surfaces with νg=2.5ν_g = 2.5 and Dg=1D_g = 1 on the four-punctured sphere.

Study optimality conditions for interval-valued optimization problems on Riemannian manifolds.

problem Optimizing interval-valued functions on Riemannian manifolds under a total order relation.
method Generalized Hukuhara directional differentiability to derive KKT-type optimality conditions.
result Derives optimality conditions for interval-valued optimization problems on Riemannian manifolds.

We study the curvature of a manifold on which there can be defined a complex-valued submersive harmonic morphism with either, totally geodesic fibers or that is holomorphic with respect to a complex structure which is compatible with the second fundamental form. We also give a necessary curvature condition for the exis…

2014-02-20abs ↗pdf ↗

Probabilistic programming aids in automatically dating ice cores, reducing manual error and uncertainty.

problem Automatically dating ice cores with high accuracy and capturing uncertainty.
method Probabilistic models and probabilistic programming for automatic inference.
result Demonstrated the use of probabilistic programming for ice core dating, showcasing its benefits and limitations.

Unified approach to totally ramified values in various surface theories.

problem Totally ramified values in value distribution theory, normal family theory, and Gauss maps of surfaces.
method Bloch--Ros principle applied to various surface theories.
result Unified approach to phenomena concerning totally ramified values.

The purpose of this article is to introduce, analyze and compare two performance participation methods based on a portfolio consisting of two risky assets: Option-Based Performance Participation (OBPP) and Constant Proportion Performance Participation (CPPP). By generalizing the provided guarantee to a participation in…

2013-02-21abs ↗pdf ↗

This paper investigates the scaling dependencies between measures of "activity" and of "size" for companies included in the FTSE 100. The "size" of companies is measured by the total market capitalization. The "activity" is measured with several quantities related to trades (transaction value per trade, transaction val…

2004-07-29abs ↗pdf ↗

We consider the expected value for the total curvature of a random closed polygon. Numerical experiments have suggested that as the number of edges becomes large, the difference between the expected total curvature of a random closed polygon and a random open polygon with the same number of turning angles approaches a …

2012-10-24abs ↗pdf ↗

Proves Riemannian positive mass theorem with singularities.

problem Proves Riemannian positive mass theorem for specific types of singular manifolds.
method Uses initial data sets with a second fundamental form to transfer convexity between different singularity components.
result Proves the theorem for manifolds with some mean-concave components and others mean-convex.

We consider a basic problem at the interface of two fundamental fields: submodular optimization and online learning. In the online unconstrained submodular maximization (online USM) problem, there is a universe [n]={1,2,...,n}[n]=\{1,2,...,n\} and a sequence of TT nonnegative (not necessarily monotone) submodular functions arrive …

2018-06-08abs ↗pdf ↗