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.
TRACER improves interpretability in high stakes analytics.
problem Interpreting complex models in high stakes applications.
method TRACER framework with TITV model for healthcare analytics.
result TRACER facilitates both accurate and interpretable analytics.
Avoid explaining black box models; use interpretable ones instead.
problem High-stakes decisions made by black box models cause societal harm.
method Design inherently interpretable models instead of trying to explain black box models.
result Inherently interpretable models are a better approach for high-stakes decisions.
Research predicts cryptocurrency staking rewards with high accuracy.
problem Predicting cryptocurrency staking rewards.
method Two predictive methodologies: sliding-window average and linear regression models.
result ETH staking rewards can be forecasted with RMSE within 0.7% and 1.1% of the mean value for 1-day and 7-day look-aheads respectively.
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.
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.
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.
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.
Staking and on-chain lending can reduce PoS network security if rewards are not calibrated properly.
problem Rational actors can reduce PoS network security if block rewards are not calibrated appropriately above on-chain lending yields.
method Simple stochastic model and agent-based simulations to validate the phase transition between staking and lending.
result Rational actors can reduce PoS network security if block rewards are not calibrated appropriately above on-chain lending yields.
Algorithm helps explain neural networks' decisions.
problem Lack of transparency in neural networks' decision-making.
method Proposes an algorithm to trace and detect adversarial attacks.
result Algorithm effectively traces DNNs' decision processes and detects adversarial attacks.
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.
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.
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.
Ethereum's Pectra upgrade introduces 0x02 compounding validators, offering higher stake and potential APR uplifts.
problem Staking rewards on Ethereum
method Analyzing compounding effects on consensus-layer rewards
result 0x02 validators achieve modestly higher median CL APR
Proof-of-Stake networks with EIP-1559 exhibit stable token prices and secure network security.
problem Token valuation and institutional capital in Proof-of-Stake networks under EIP-1559
method Open-economy macroeconomic equilibrium model
result Stable steady-state equilibrium price for ETH
New tools found to create hyperbolic links with lower volume bounds.
problem Finding lower bounds on volumes of staked links.
method Defining charm bracelets and constructing hyperbolic links.
result Infinitely many hyperbolic staked links with lower volume bounds.
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.
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.
New model assesses risks of staking and borrowing in smart contracts.
problem Security and efficiency of staking in smart contract platforms.
method Combines birth-death Pólya processes and credit derivatives models.
result Derivatives can reduce wealth concentration in staking networks.
Systematic review of conformal inference for treatment effect estimation.
problem Uncertainty quantification in treatment effect estimation.
method Conformal prediction methods for treatment effect estimation.
result Current state-of-the-art conformal prediction methods identified and described.
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.
Framework for responsible LLM deployment with human involvement and decentralized technologies.
problem Challenges in deploying LLMs for high-stakes decisions, including data security and accountability.
method Interactive human involvement through multiple iterations, decentralized technologies, and automated auditing.
result Enhanced security and accountability in LLM deployment for financial decisions.
Metareasoning optimizes modular systems by dynamically adjusting configurations.
problem Maximizing system utility in high-stakes tasks with modular subsystems.
method Employing reinforcement learning with rich contextual representations to dynamically adjust module configurations.
result Significant improvement in system performance across various reinforcement learning techniques.
AI updates can disrupt human-AI teams; new objective improves compatibility.
problem AI updates can disrupt human-AI team performance.
method Introduce compatibility concept, propose re-training objective.
result Current machine learning algorithms do not produce compatible updates.
Strategic feature selection in high-stakes domains like healthcare.
problem Strategic manipulation of input features in algorithmic predictors.
method Formal study of strategic classification through feature selection and ridge regularization.
result Excluding individual features based on manipulability is generally suboptimal.
Conformal Alignment ensures trustworthy outputs from foundation models.
problem Ensuring outputs from foundation models align with human values in high-stakes tasks.
method A framework that trains an alignment predictor using reference data to select trustworthy outputs.
result Conformal Alignment accurately identifies trustworthy outputs via lightweight training over moderate reference data.
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 and Model S through convex optimization and game-theoretic lens. result Model 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 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.
FairPOT balances fairness and AUC performance by selectively transforming risk scores.
problem Balancing fairness and AUC performance in high-stakes domains.
method FairPOT uses proportional optimal transport to selectively transform risk scores.
result FairPOT consistently improves fairness with minimal AUC degradation or even positive gains.
New method finds significant high-order interactions efficiently.
problem Finding statistically significant high-order interactions in high-dimensional data.
method Extends selective inference to high-order interaction models with pruning strategy.
result Demonstrated efficient and powerful method for high-order interactions.
Neural Additive Models combine neural nets with interpretable models for high stakes tasks.
problem Inability to understand how neural networks make decisions.
method Combines neural nets with generalized additive models to create Neural Additive Models (NAMs).
result NAMs are more accurate than intelligible models and as accurate as state-of-the-art generalized additive models.
A new method for optimizing stakes in a single event with multiple outcomes.
problem Maximizing expected log wealth in a single event with multiple outcomes.
method Using implicit state positions to derive the optimal stake formula.
result A compact formula and greedy algorithm for support selection.
This paper introduces a new method for uncertainty quantification in prediction models.
problem Quantifying uncertainty in high-stakes applications like medicine and finance.
method Confidence sets for outcome excursions, focusing on identifying subsets of features where outcomes exceed a threshold.
result Theoretical guarantees for the probability that confidence sets contain the true feature subset, both asymptotically and for finite sample sizes.
Fan tokens surged before World Cup matches, but declined during them, revealing cognitive biases.
problem Analyzing the impact of FIFA World Cup matches on fan tokens.
method Event study and intraday analysis of blockchain-based fan tokens.
result Fan tokens experienced a surge in returns six months before the World Cup, followed by a decline during the matches, revealing asymmetries in performance.
New voting strategies show committee-based consensus can scale efficiently.
problem Ensuring honest committees in committee-based consensus protocols.
method Empirical analysis of simpler voting strategies and their convergence to optimality.
result Simpler voting strategies converge to optimality exponentially quickly, ensuring robustness and efficiency.
ECS evaluates synthetic CXR images' distributional fidelity.
problem Evaluating synthetic CXR images' distributional fidelity under privacy constraints.
method Characteristic function transforms of feature embeddings.
result ECS uncovers clinically relevant distributional discrepancies.
Statistical performance bounds for reinforcement learning (RL) algorithms can be critical for high-stakes applications like healthcare. This paper introduces a new framework for theoretically measuring the performance of such algorithms called Uniform-PAC, which is a strengthening of the classical Probably Approximatel…
MCD offers a complete model understanding for high-stake decisions.
problem Local model understanding in XAI methods is not sufficient for high-stake decisions.
method MCD extends concept-based methods to ensure global model understanding via multi-dimensional subspaces.
result MCD provides a complete model understanding, ensuring the model reasoning is related to the actual model.
Paper proposes risk-averse reinforcement learning algorithms.
problem Managing model uncertainty in reinforcement learning.
method Entropic risk constrained policy gradient and actor-critic algorithms.
result Demonstrates usefulness of risk-averse algorithms on various domains.
Study on wealth and trading in PoS blockchain.
problem Decentralization and trading incentives in PoS.
method Analytic and stochastic tools, optimal control theory, mean field model.
result Miners balance PoS mining and trading for optimal strategy.
Model proposes how regulators should oversee complex algorithms in high-stakes applications.
problem Regulating complex algorithms used in high-stakes applications like lending, testing, and hiring.
method Proposes a model where regulators are limited in learning about complex algorithms with misaligned preferences, and explores different regulatory approaches.
result Complex algorithms can improve welfare, but regulation should focus on the source of incentive misalignment for optimal results.
The analysis of manifold-valued data requires efficient tools from Riemannian geometry to cope with the computational complexity at stake. This complexity arises from the always-increasing dimension of the data, and the absence of closed-form expressions to basic operations such as the Riemannian logarithm. In this pap…
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.
This paper advances theory on the process of collaboration between entities and its implications on the quality of services, information, and/or products (SIPs) that the collaborating entities provide to each other. It investigates the scenario of outsourced IS projects (such as custom software development) where the e…
Perry uses auxiliary data to estimate RL policy values with confidence intervals.
problem Leveraging auxiliary datasets for off-policy evaluation with uncertainty quantification.
method Two methods for constructing valid confidence intervals for OPE with data augmentation.
result Methods consistently produce confidence intervals covering ground truth policy values.