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.
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.
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.
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.
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.
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
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.
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.
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.
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.
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.
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.
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
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.
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.
Activists align with large fund preferences for success.
problem Aligning with large fund preferences increases activist success.
method Analyzed previous proxy voting behavior to estimate preferences and correlated them with activist success.
result Campaigns with higher alignment receive more votes and are more successful.
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.
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.
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…
Adapts safe policies for exploration in high-risk settings.
problem Balancing safety and exploration in high-risk environments.
method Uses conformal calibration on a safe reference policy to determine aggressive action limits.
result Safe exploration improves performance without requiring model class identification or hyperparameter tuning.
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.
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. Study evaluates five LLMs for financial report analysis, revealing performance differences and variability.
problem Lack of understanding in reliability, consistency, and transparency of LLMs in financial analysis.
method Human evaluation, automated similarity metrics, and behavioral diagnostics applied to five transformer-based LLMs over U.S. 10-K filings.
result No single LLM consistently dominates across all evaluation perspectives, highlighting variability and need for interpretability.
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.
Deep learning is increasingly being used in high-stake decision making applications that affect individual lives. However, deep learning models might exhibit algorithmic discrimination behaviors with respect to protected groups, potentially posing negative impacts on individuals and society. Therefore, fairness in deep…
We present a large-scale study of gender bias in occupation classification, a task where the use of machine learning may lead to negative outcomes on peoples' lives. We analyze the potential allocation harms that can result from semantic representation bias. To do so, we study the impact on occupation classification of…
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.
AI agents are being developed to support high stakes decision-making processes from driving cars to prescribing drugs, making it increasingly important for human users to understand their behavior. Policy summarization methods aim to convey strengths and weaknesses of such agents by demonstrating their behavior in a su…
Black box machine learning models are currently being used for high stakes decision-making throughout society, causing problems throughout healthcare, criminal justice, and in other domains. People have hoped that creating methods for explaining these black box models will alleviate some of these problems, but trying t…
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.
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.
We study hyperbolic bongles and find their volumes.
problem Characterizing and quantifying hyperbolic bongles.
method Provided necessary and sufficient conditions for hyperbolicity, calculated volumes, and established upper bounds.
result All balanced hyperbolic n-bongles have the same volume and this volume is an upper bound for any hyperbolic n-bongle. Combining global and local explanations improves user understanding of RL agents.
problem Challenges in explaining agent behavior due to large state spaces and delayed rewards.
method Integrating strategy summaries with saliency maps to provide both global and local explanations.
result Summaries including important states significantly improve user understanding of RL agents.
Framework enhances AI explainability by aligning with human cognitive models.
problem Lack of explainability in AI models hinders trust and accountability.
method Integrates explainability techniques with Malle's five category model of behavior explanation.
result Demonstrates practical relevance in credit risk assessment and regulatory analysis.
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.
GLIME improves LIME's stability and local fidelity.
problem LIME's instability and low local fidelity.
method Introducing GLIME, an enhanced framework that derives an equivalent formulation of LIME with faster convergence and improved stability.
result GLIME generates explanations with higher local fidelity and is independent of reference choice.
LLMs can collude in market divisions, maximizing profits.
problem Strategic collusion of LLM agents in multi-commodity markets.
method Examined LLMs in Cournot competition frameworks, analyzing pricing and resource allocation strategies.
result LLMs can monopolize specific commodities without direct human input or explicit collusion commands.
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.
Shapley values explain financial language models, aligning with domain knowledge.
problem Lack of explainability in financial applications of large language models.
method Shapley value analysis for financial textual data.
result Shapley values provide consistent explanations with financial reasoning.
The paper breaks down AUC into cluster-level components for better model diagnostics.
problem Global AUC masks weaknesses in specific subpopulations, leading to financial or operational risks.
method Formal decomposition of AUC into intra- and inter-cluster components, comparing with other performance metrics.
result Allows practitioners to evaluate and diagnose model performance within and across clusters.
This paper introduces a new task to better understand Transformers in quantitative contexts.
problem Understanding Transformers in high-stakes quantitative and scientific applications.
method Introduces a novel contextual counting task and analyzes it with causal and non-causal Transformer architectures.
result Causal attention is better suited for the contextual counting task, and no positional embeddings lead to the best accuracy.
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.
Proposes a real-time anomaly detection system using IRL.
problem Real-time anomaly detection in sequential data.
method Uses inverse reinforcement learning to infer reward function and evaluate anomalies.
result Effective in identifying anomalies in real-world data.
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…
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.