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,738 papers · 148 categories

Trend · papers per month

23466891 · Jun 202019922001200920172026
48 results for staking rewards

This paper explores leverage staking with stETH, revealing high returns but also significant risks.

problem Leverage staking introduces risks through intensified selling pressure and cascading liquidations.
method Formal framework for leverage staking, stress tests under extreme conditions of stETH devaluation.
result Leverage staking amplifies risks, leading to intensified selling pressure and price declines.

The paper examines stability of shares in Proof of Stake protocol, identifying different investor behaviors and phase transitions.

problem Stability of shares in Proof of Stake protocol.
method Identification of large, medium, and small investors under various rewarding schemes; dynamical population model analysis.
result Phase transitions and thresholds for stability are characterized; chaotic centralization leads to concentration of shares.

PoEL protocol aims to efficiently create and secure liquidity for blockchain networks.

problem Lack of sustainable liquidity and network security in Proof of Stake blockchains.
method PoEL uses staking rewards to attract risk capital, structuring incentives for capital efficiency and security.
result PoEL protocol enhances blockchain network security and liquidity sustainability.

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 …

2019-11-28abs ↗pdf ↗

The paper examines how algorithmic classification affects behavior and proposes democratizing stakes to mitigate predatory practices.

problem The impact of algorithmic classification on individual behavior and fairness in decision-making processes.
method Characterization of optimal classification by an algorithm designer and analysis of the effect of democratizing stakes.
result Optimal classification can lead to surprising behavior patterns, and democratizing stakes can mitigate predatory practices.

Ethereum transition to PoS reduces energy consumption and decentralizes the network.

problem Transitioning from proof-of-work to proof-of-stake to reduce energy consumption and decentralize the network.
method Analyzed the impact of the Ethereum transition to proof-of-stake on network performance, competing platforms, and transaction fees.
result The transition to PoS has reduced energy consumption by 99.98% and decreased network concentration.

Centralized exchanges influence staking behavior and decentralization in Proof of Stake blockchain ecosystems.

problem How do centralized exchanges affect staking behavior and decentralization in Proof of Stake blockchain ecosystems?
method Formulate a continuous-time mean field model of miners as validators and traders in a centralized market.
result Centralized trading activities enhance staking participation and promote decentralization through market incentives.

Paper proposes a framework for reliable off-policy evaluation in reinforcement learning.

problem Quantifying uncertainty in off-policy estimates for safe deployment of target policies.
method Distributionally robust optimization for creating confidence bounds.
result Non-asymptotic and asymptotic guarantees for robust cumulative reward estimates.

Optimal trading strategy in Proof-of-Stake blockchain using continuous-time control.

problem Finding the optimal balance between stake utility and consumption utility in Proof-of-Stake blockchain.
method Continuous-time control approach, dynamic programming, Hamilton-Jacobi-Bellman (HJB) equations.
result Close-form solutions for linear and convex utility functions, optimal strategies identified.

Model shows PoS networks can be captured by external finance, leading to centralization.

problem Long-term centralization of PoS networks under external finance pressures.
method Heterogeneous macroeconomic model with two actor classes: investors and consumers.
result External finance forces PoS networks to centralize, leading to zero internal staking yield.

Optimizes leveraged staking strategies in decentralized finance.

problem Maximizing returns on staked assets in decentralized lending platforms.
method Developed a mathematical framework to optimize leveraged staking strategies, reducing the multi-market problem to convex allocation over market exposures.
result Rebalanced leveraged positions can achieve up to 6.2% APY, significantly higher than unleveraged staking.

Model analyzes Proof-of-Stake network dynamics and speculative capital effects on token prices.

problem Understanding and managing price dynamics in Proof-of-Stake networks.
method Developed an open-economy macroeconomic model to analyze Proof-of-Stake dynamics and speculative capital effects.
result Speculative capital can shift staked-token ownership, potentially improving consensus decentralization.

Unified framework for risk-aware policy learning in contextual bandits.

problem Optimizing decision rules in high-stakes domains with adverse outcomes.
method Distributional framework for Lipschitz-continuous risk functionals, with novel empirical concentration inequalities.
result Data-dependent suboptimality bounds with an ildeO(1/n) ilde{\mathcal{O}}(1/\sqrt{n}) rate, matching risk-neutral offline policy optimization.

Proposes a method for obtaining interval bounds in off-policy evaluation.

problem Provides provably correct upper and lower bounds for off-policy evaluation.
method Searches for the maximum and minimum values of the expected reward among Lipschitz Q-functions.
result Introduces a Lipschitz value iteration method to monotonically tighten interval bounds.

The paper analyzes security issues in blockchain ecosystems with multiple SSPs and proposes two models for better stake management.

problem Security issues in blockchain ecosystems with multiple SSPs and stake fragmentation.
method Formalized the Multiple SSP Problem and analyzed two architectures: Model M\mathbb{M} and Model S\mathbb{S} through convex optimization and game-theoretic lens.
result Model S\mathbb{S} achieves tighter security guarantees through single validator sets and aggregated slashing logic.

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.

The paper introduces return parity for fairness in MDPs, addressing delayed and adverse effects.

problem Fairness in MDPs for dynamic domains with delayed and adverse effects.
method Proposes return parity, decomposes return disparity, and develops algorithms for state visitation distributional alignment.
result The proposed algorithms can successfully close the disparity gap while maintaining policy performance.

A new bandit problem where experiments can be interrupted if results are not promising.

problem Interruptible multi-armed bandit problem with a threshold for cumulative reward.
method Formalized survival regret, identified key components (regret and probability of ruin), derived lower bounds and optimal policies.
result No policy can achieve sublinear survival regret, but optimal policies minimize survival regret in a Pareto sense.

New framework assesses extreme errors in machine learning models.

problem Current validation methods fail to quantify extreme errors in high-stakes domains.
method Uses Extreme Value Theory (EVT) to estimate worst-case failures.
result Establishes EVT as a fundamental tool for assessing model reliability.

Extends PoS proof-of-stake transaction fee mechanism with miner utility model.

problem Designing a transaction fee mechanism for PoS protocol that incorporates miner utility.
method Introduced a new mechanism (BSP(θ)) incorporating a parameter θ to ensure user and miner incentives.
result The new mechanism (BSP(θ)) satisfies user and miner incentives and contract proofness.

Fair active learning selects data points to balance model accuracy and fairness.

problem Ensuring fairness in machine learning models used in high-stakes applications.
method Designing algorithms for fair active learning that select data points to balance model accuracy and fairness, focusing on demographic parity.
result Demonstrated the effectiveness of the proposed fair active learning approach over benchmark datasets.

A new policy learning method allows policies to abstain when uncertain, improving safety and applicability.

problem Risk of making decisions without full confidence in uncertain predictions.
method Policy learning with abstention, identifying near-optimal policies and constructing an abstention rule.
result Improved safety and applicability in policy learning, with theoretical guarantees.

The study determines conditions for hyperbolicity of links in thickened surfaces with boundary.

problem Conditions for hyperbolicity of links in thickened surfaces with boundary.
method Simple conditions and embeddings of surfaces in ambient manifolds.
result Conditions guaranteeing hyperbolicity of links in thickened surfaces and fiber bundles.

Deep neural networks (DNNs) may outperform human brains in complex tasks, but the lack of transparency in their decision-making processes makes us question whether we could fully trust DNNs with high stakes problems. As DNNs' operations rely on a massive number of both parallel and sequential linear/nonlinear computati…

2019-09-29abs ↗pdf ↗

This work develops confidence intervals for off-policy evaluation.

problem Estimating expected reward with uncertainty quantification.
method Primal-dual optimization with kernel Bellman loss and martingale concentration inequality.
result Developed practical algorithm for non-asymptotic confidence intervals.

New framework controls statistical dispersion for high-stakes applications.

problem Understanding and controlling the dispersion of loss distributions in high-stakes applications.
method Simple yet flexible framework for distribution-free control of statistical dispersion measures.
result Proposed methods control statistical dispersion measures with societal implications.

Paper proposes SCQ and P-TAMS for structured OOD testing in high-stakes ML.

problem Difficulty of incorporating auxiliary information in traditional conformal methods.
method Structure-adaptive conformal q-value (SCQ) and pseudo-score-guided transductive automated model selection (P-TAMS).
result Unified framework controls false discovery rate and improves power across diverse settings.

AI needs causal inference to avoid being just a correlation machine.

problem AI's inability to distinguish correlation from causation.
method Develops a unified framework connecting various causal statistical estimators and proves a Statistical Necessity Theorem for causal generalization.
result AI systems without causal grounding are brittle and biased, highlighting the need for causal statistics.

Novel AMM model for pegged cryptoassets using nested OU processes.

problem Liquidity and risk management in markets for pegged cryptoassets.
method Multi-level nested Ornstein-Uhlenbeck (OU) processes for exchange rate dynamics, calibrated and filtered AMM model.
result Consistent efficient quotes and improved liquidity provision for pegged cryptoassets.

Amazon SageMaker Model Monitor detects drift in deployed ML models.

problem Ensuring high performance of ML models in production environments.
method Automatically detects data, concept, bias, and feature attribution drift in real-time.
result Maintains high quality models by providing alerts and corrective actions.

The paper explores fairness metrics in automated decision-making and their limitations.

problem Discrimination in automated resource allocation decisions.
method Analysis of fairness metrics and distributive justice principles.
result Prominent fairness metrics fail to address egalitarian and sufficiency concerns in resource allocation.