We analyze impermanent loss in AMMs and show G3Ms are simplest.
problem Understanding impermanent loss in automated market makers.
method Developed a general framework and analyzed Geometric Mean Market Makers (G3Ms).
result G3Ms have the simplest impermanent loss characteristics.
The article provides formulas to hedge impermanent loss in decentralized markets.
problem Impermanent loss in concentrated liquidity provision in decentralized markets.
method Analytical characterizations and static replication formulas using European calls or puts.
result Static replication formulas accurately hedge impermanent loss.
Framework to generalize impermanent loss for decentralized exchanges.
problem Difficult analysis of impermanent loss due to diverse market maker algorithms and fee structures.
method Developed a framework to generalize impermanent loss for constant function market makers with optional concentrated liquidity.
result Identified conditions for profitability of liquidity provisioning.
This work analyzes impermanent loss in decentralized markets and provides a hedging strategy.
problem Impermanent loss in automated market makers (AMMs).
method Analytical derivation of a static replication formula using European options, and numerical example with real data.
result Guaranteed hedging coverage for all final prices within a predefined interval.
This research improves capital efficiency and impermanent loss in cryptocurrency markets using multi-token trading pools.
problem Poor impermanent loss and capital efficiency in automated market makers.
method Analysis and construction of a multi-token token proactive market maker (MPMM).
result MPMM shows better impermanent loss and capital efficiency than comparable market makers.
G3M impermanent losses are a key issue in decentralized finance, affecting diversification benefits.
problem Impermanent losses in G3M market makers due to negative convexity.
method Established non-arbitrage bounds and analyzed empirical data.
result Median liquidity pools have net nil ROI when Impermanent Losses are considered.
Geometric Mean Market Makers super-hedge impermanent loss without models.
problem Super-hedging impermanent loss in Geometric Mean Market Makers.
method Model-free rebalancing strategy.
result Loss-versus-rebalancing vanishes due to finite variation exchange rate.
Analyzes impermanent loss in decentralized exchanges and provides a replication formula.
problem Impermanent loss in decentralized exchanges like Uniswap and Balancer.
method Analytical static replication formula using European calls and puts.
result Guaranteed coverage for pool value within a predefined range.
Paper calculates greeks for DeFi LPs and introduces Impermanent Gain.
problem Liquidity Providers in DeFi are exposed to Impermanent Loss.
method Tailored Black & Scholes formulas for DeFi markets.
result Introduced Impermanent Gain for risk management.
Uniswap analyzes liquidity provider risk and impermanent loss.
problem Risk and loss for liquidity providers in decentralized exchanges.
method Improved impermanent loss function for Uniswap v2, v3 comparison.
result Improved impermanent loss function for Uniswap v2.
A new AMM design reduces impermanent loss and retains more liquidity.
problem Inefficiencies in conventional AMM designs lead to liquidity loss and user engagement issues in DEXs.
method Proposes a dual-mechanism framework: a power-law invariant BMM and dynamic rebate system.
result Reduces impermanent loss by 36% and retains 3.98x more liquidity during price volatility.
QubitSwap improves DEX efficiency by reducing impermanent loss and slippage.
problem Challenges in decentralised exchanges, especially impermanent loss and slippage.
method Hybrid approach integrating external oracle price with internal pool dynamics, parameterized by z. result Reduction in impermanent loss and slippage compared to traditional DEX frameworks.
The paper explores IL and LVR in AMMs, identifying three regimes and the effect of fees.
problem The relationship between impermanent loss and loss-versus-rebalancing in AMMs.
method Statistical analysis, focus on fees, block times, and continuous time limit.
result Three regimes identified: identical, distinct distribution functions, and distinct averages.
The paper examines statistical properties of IL and LVR in automated market makers.
problem Assessing the performance of automated market makers and their profitability.
method Analysis of random walk properties and statistical integral combined with CFMM mechanics.
result IL and LVR have identical expectation values but different distribution functions for Brownian motion.
UAMM uses external market prices to improve AMM efficiency and reduce liquidity provider risk.
problem Traditional AMMs lack consideration of external markets and risk management.
method UAMM calculates prices by incorporating external market prices and impermanent loss, maintaining constant product curve properties.
result UAMM eliminates arbitrage opportunities when external market prices are efficient, reducing liquidity provider risk.
New metric to measure liquidity position PNL, delta hedging algorithm for automated market makers.
problem Vulnerability of liquidity positions to price changes in underlying assets.
method Proposes a new metric for measuring PNL, delta hedging algorithm for various AMMs.
result New metric more accurately measures net value change due to price movement.
This paper examines the uniform properties of AMMs in cryptocurrency markets.
problem Theoretical uniformity of AMMs despite diverse strategies.
method Derives a universal formula for liquidity provisioning and compares models.
result Constant function and token swap models are equivalent under uniform liquidity.
Uniswap v3 LPs suffer significant Impermanent Loss despite higher fees.
problem Impermanent Loss in leveraged liquidity provision on Uniswap v3.
method Analysis of 17 pools covering 43% of TVL, calculating fees and IL.
result LPs would have been better off by $60.8m had they HODLd.
Unified methods for hedging impermanent loss in decentralized exchanges.
problem Hedging impermanent loss in liquidity provision at decentralized exchanges.
method Static and dynamic approaches using arbitrage-based methods for valuation and risk management.
result Unified valuation and hedging formulas for IL protection claims.
Study analyzes factors affecting profits in crypto liquidity provision.
problem Liquidity providers lack guidance for developing profitable strategies.
method Developed a measurement model based on impermanent loss to analyze key parameters.
result Uncovered influences of key parameters on LPs' profits.
Optimizes liquidity withdrawal timing for AMM LPs to balance fees and impermanent loss.
problem Balancing fees and impermanent loss in automated market makers.
method Stochastic control problem with endogenous stopping time, numerical solutions via Euler scheme and Longstaff-Schwartz method.
result Optimal exit strategy depends on volatility, fees, and market dynamics.
This paper analyzes and compares different Automated Market Maker mechanisms.
problem Impermanent loss in Constant Function Market Makers.
method Mean-Variance analysis of liquidity providers' profit and loss, comparison of different mechanisms.
result Optimized oracle-based mechanisms outperform Constant Function Market Makers.
Optimizes liquidity provision in decentralized exchanges with utility indifference market makers.
problem Impermanent loss in decentralized exchanges without transaction fees.
method Mathematical formulation of liquidity provision, focusing on utility indifference market makers.
result No-arbitrage conditions and optimal arbitrage strategies are established.
The paper develops a new framework for pricing and hedging liquidity in crypto markets.
problem Arbitrage and risk management in crypto market making.
method Developed a new mathematical framework using a coordinate system defined by price and intrinsic liquidity.
result Established a linear dependence of asset reserves and value functions on intrinsic liquidity, facilitating arbitrage-free pricing and delta hedging.
Novel method reconstructs liquidity data for CLMMs, optimizing dynamic liquidity strategies.
problem Challenges in evaluating and optimizing CLMMs due to lack of historical liquidity data.
method Reconstructs historical liquidity states from swap transaction data using machine learning.
result Identifies outperformance of dynamic liquidity strategies over uniform allocation benchmarks.
Investors optimize liquid staking decisions in LSP and AMM protocols.
problem Optimal timing and allocation in liquid staking protocols.
method Derive optimal allocation strategy and model optimal exit timing using Laplace transforms and free-boundary techniques.
result Optimal stop-loss strategy maximizes expected payoff, influenced by fees and opportunity gains.
Hydrodynamics principles applied to finance, solving complex market models.
problem Understanding financial market dynamics using physics principles.
method Unified mathematical framework using Kelvin waves to solve differential and pseudo-differential equations.
result Solved various financial models including volatility and variance swaps.
This paper mixes constant sum and constant product market makers to improve their features.
problem Improving the balance between stable exchange rates and liquidity in automated market makers.
method Mixing and designing new methods for AMMs with specific features.
result Demonstrates new tools for creating markets with desired characteristics.
This paper uses DRL to optimize liquidity in DeFi protocols, making markets more accessible.
problem Optimizing liquidity provisioning in decentralized finance protocols.
method Modeling liquidity provisioning as an MDP, training an agent with PPO to dynamically adjust positions.
result DRL-based strategy outperforms traditional heuristics in fee maximization and impermanent loss mitigation.
Introduces Fitzpatrick losses, tighter than Fenchel-Young losses.
problem Improving loss functions for machine learning.
method Introduces Fitzpatrick losses based on the Fitzpatrick function.
result Fitzpatrick losses are tighter than Fenchel-Young losses.
We study losses for binary classification and class probability estimation and extend the understanding of them from margin losses to general composite losses which are the composition of a proper loss with a link function. We characterise when margin losses can be proper composite losses, explicitly show how to determ…
We present the Tamed Cross Entropy (TCE) loss function, a robust derivative of the standard Cross Entropy (CE) loss used in deep learning for classification tasks. However, unlike other robust losses, the TCE loss is designed to exhibit the same training properties than the CE loss in noiseless scenarios. Therefore, th…
Unified surrogate loss framework for multi-label learning with strong consistency guarantees.
problem Improving consistency and accounting for label correlations in multi-label learning.
method Introducing multi-label logistic loss and extending it to comprehensive multi-label comp-sum losses, proving strong consistency guarantees for any multi-label loss.
result Unified surrogate loss framework benefiting from strong consistency guarantees for any multi-label loss.
This paper introduces new loss functions for balanced multi-class classification.
problem Balancing class imbalance in multi-class classification.
method Introduces two new surrogate loss families: GLA and GCA.
result GCA losses offer stronger theoretical guarantees in imbalanced settings.
We present α-loss, α∈[1,∞], a tunable loss function for binary classification that bridges log-loss (α=1) and 0-1 loss (α=∞). We prove that α-loss has an equivalent margin-based form and is classification-calibrated, two desirable properties for a good surrogate loss function for the ideal y…
This work broadens calibeating to various proper losses using Bregman divergence.
problem Calibration for a wide range of proper losses.
method Regret minimization and Bregman divergence approach.
result U-calibration results for a family of Tsallis losses with logarithmic regret and dimension independence.
This work generalizes calibeating for a broader range of proper losses using Bregman divergence.
problem Calibration for a wide range of proper losses beyond Brier and log loss.
method Regret minimization based on Bregman divergence for a family of proper losses.
result U-calibration results for a family of Tsallis losses with logarithmic regret and dimension independence.
Proposes squentropy loss for improved classification accuracy and model calibration.
problem Theoretical and empirical evidence for cross-entropy loss is lacking.
method Introduces squentropy loss as the sum of cross-entropy and average square loss over incorrect classes.
result Squentropy loss outperforms cross-entropy and rescaled square losses in classification accuracy and model calibration.
New loss function calibrates WW-hinge loss for multiclass SVM.
problem WW-hinge loss not calibrated with 0-1 loss.
method Introduced ordered partition loss and proved WW-hinge loss is calibrated.
result WW-hinge loss is calibrated with ordered partition loss.
The study analyzes a model for aggregate losses with dependent and overdispersed inter-losses times.
problem Analyzing aggregate loss models with dependent and overdispersed inter-losses times.
method The study uses a two-state Markovian arrival process (MAP2) and a Markov renewal process to model the inter-losses times. Severities are modeled using a heavy-tailed, double-Pareto Lognormal distribution. The model is estimated via direct maximization of the likelihood function.
result The model with dependence and overdispersion in inter-losses times leads to higher capital charges compared to a Poisson process.
Symmetric losses improve classifier robustness from corrupted labels.
problem Improving classifier performance from corrupted labels.
method Symmetric losses that satisfy a certain condition.
result Symmetric losses enhance robust classification from corrupted labels.
Two new algorithms improve performance in adversarial bandits with unbounded losses.
problem Adversarial Multi-Armed Bandits with unbounded losses.
method Developed UMAB-NN and UMAB-G for non-negative and general unbounded losses respectively.
result UMAB-NN achieves the first adaptive and scale-free regret bound for non-negative unbounded losses.
Paper explores connections between loss functions and consistency in binary classification and regression.
problem Consistency in binary classification and regression applications.
method Characterization of conformable loss functions and derivation of a new Huber-type loss function.
result Margin-based loss functions are equivalent to loss functions of squared standardized logistic regression residuals.
Paper introduces a new topological loss for better convergence.
problem Optimizing topological losses for model's desired topological behavior.
method Introduces a new regularized topology-aware loss function.
result Guarantees efficient optimization of the new loss function.
Novel loss functions improve decision tree learning from noisy data.
problem Training decision trees with noisy labels.
method Introducing distribution losses and a new negative exponential loss.
result The negative exponential loss leads to efficient and robust decision tree learning.
Theoretical analysis of cross-entropy loss functions and their robustness.
problem Guarantees for using cross-entropy as a surrogate loss function.
method Theoretical analysis of a broad family of loss functions, including cross-entropy.
result First H-consistency bounds for comp-sum losses and smooth adversarial comp-sum losses. This paper improves operational risk modeling by selecting better loss severity distributions.
problem Inconsistent regulatory capital calculations due to changing loss severity distribution families.
method Presented truncation probability estimates and a consistent quantile scoring function for selection criteria. Also, recommended collecting loss frequencies below the minimum reporting threshold.
result More stable regulatory capital calculations through better selection of loss severity distributions.
This paper improves loss functions for deep learning with noisy labels.
problem Training deep neural networks with noisy labels.
method The paper introduces a normalization technique to make any loss function robust to noisy labels and proposes a framework called Active Passive Loss (APL) to combine robust loss functions.
result The proposed APL framework consistently outperforms state-of-the-art methods, especially under high noise rates.