The paper proposes an efficient nested simulation design using likelihood ratio method.
problem Designing nested simulations with fixed outer scenarios and minimizing simulation effort.
method Proposes a bi-level optimization problem to decide inner replications and pooling strategies.
result Optimized design achieves $\cO(Γ^{-1})$ mean squared error of estimators.
Study liquidity provision in decentralized exchanges considering risk aversion and replication costs.
problem Economic viability of liquidity provision in decentralized exchanges (DEXs).
method Formulated strategic interactions as a sequential game with risk-averse LP, traders, and arbitrageurs.
result DEX liquidity depth is crucial for risk management, influenced by risk aversion and replication costs.
Study the impact of overfitting on linear predictive models' performance.
problem Overfitting reduces the out-of-sample performance of linear predictive trading strategies.
method Computed in- and out-of-sample means and variances of PnLs to derive replication ratios.
result Replication ratio diminishes for complex strategies with many assets.
Study cash-flow forecasting for derivatives, aligning with replication strategy and addressing timing frictions.
problem Inconsistencies in cash-flow forecasting under different measures and stochastic payment times.
method Use discounting sensitivities (funding-curve hedge ratios) for replication and propose a liquidity valuation adjustment.
result Aligns forecasting with replication strategy and avoids measure-mixing issues.
The paper prices and replicates various financial contracts on a risky asset with stochastic volatility and jumps.
problem Pricing and replicating financial contracts on assets with stochastic volatility and jumps.
method Develops pricing and hedging formulas for various financial contracts, independent of the volatility process dynamics.
result Pricing and hedging formulas for financial contracts are derived without dependence on the volatility process dynamics.
TraderTalk uses LLMs to simulate human trading interactions in financial markets.
problem Simulating realistic human trading interactions in financial markets.
method Hybrid ABM with LLM-generated behaviors for detailed conversations.
result Successfully replicates trade-to-order volume ratios in financial markets.
Spectral clustering is widely used to partition graphs into distinct modules or communities. Existing methods for spectral clustering use the eigenvalues and eigenvectors of the graph Laplacian, an operator that is closely associated with random walks on graphs. We propose a new spectral partitioning method that exploi…
ARF synthesizes epidemiological data to match original findings.
problem Synthetic data quality and privacy in epidemiology.
method Adversarial Random Forests (ARF) for efficient data synthesis.
result ARF-generated synthetic data consistently matches original epidemiological findings.
Replicates deep learning strategy for trading factor residuals, finds strong performance.
problem Exploiting mis-pricing from unexplained cross-sectional variation in factor models.
method Adhering to PIT principles, used CNNs and Transformers on recent data.
result Out-of-sample Sharpe ratios exceeding 10 in certain tests.
Study uses deep learning for pairs trading in Polish equities, achieving profits in 2017-2019.
problem Statistical arbitrage in Polish equities market using traditional methods.
method Deep learning (LSTMs) for asset replication, PCA for risk factor analysis, Ornstein Uhlenbeck process for residual modeling.
result Deep learning methods, especially LSTMs, show promise for profitable trading in Polish equities.
Partial (replication) index tracking is a popular passive investment strategy. It aims to replicate the performance of a given index by constructing a tracking portfolio which contains some constituents of the index. The tracking error optimisation is quadratic and NP-hard when taking the L0 constraint into account so …
New algorithm ensures consistent results in constrained MAB problems.
problem Achieving consistent results in constrained MAB problems.
method Developed replicable algorithms for constrained MAB problems using the optimism principle.
result Regret and constraint violation of replicable algorithms match those of non-replicable ones.
Unified framework for fixed-income pricing and liability replication.
problem Static arbitrage and discount curve construction.
method Model-free framework for static fixed-income pricing and liability replication.
result Existence of strictly positive discount curves reproducing market prices and least-cost super-replicating portfolios.
Characterizes super-replication prices in a financial market model.
problem Characterizing prices in a financial market model.
method Characterizes prices as the supremum of mono-prior super-replication prices through extreme priors and martingale measures.
result Super-replication prices are the supremum of mono-prior super-replication prices.
New study on replicability and stability in machine learning algorithms.
problem Ensuring consistent results in machine learning models without fixing randomness.
method Introduced global stability and list replicability concepts, proving their equivalence and boosting list replicability.
result Global stability can only be achieved weakly, while list replicability can be boosted to achieve high probability of consistent results.
This paper simplifies hedge ratios in financial models using pathwise algorithmic differentiation.
problem Expensive and unstable computation of hedge ratios from pathwise sensitivities.
method Develops reduced stochastic hedge ratios of the form φ_j^r = Σ_j^r ξ_j^q X_q, retaining sensitivity tensor through empirical averages.
result Two coefficient criteria are introduced to minimize pathwise residuals and satisfy moment equations.
Study on computational aspects of replicable learning, bridging statistical and algorithmic perspectives.
problem Understanding the computational connections between replicability and various learning paradigms.
method Design of replicable learners, lifting framework, and transformation techniques.
result Efficient replicable learners for specific learning problems under various distributions.
The paper classifies self-replicating 3D shapes using algebraic models.
problem Understanding self-replicating 3D shapes.
method Using idempotents in the (2+1)-cobordism category to classify 3-manifolds.
result A classification theorem for self-replicating 3-manifolds.
New algorithm prevents strategic replication in multi-armed bandit problems.
problem Strategic replication by agents can exploit bandit algorithms' balance.
method Designs Hierarchical UCB (H-UCB) and Robust Hierarchical UCB (RH-UCB) algorithms.
result Achieves O(lnT)-regret and sublinear regret in realistic scenarios. Extends super-replication theorem with dynamic strategies and transaction costs.
problem Dynamic super-replication under proportional transaction costs.
method Generalizes admissible strategies and defines a well-defined super-replication price process.
result Well-defined super-replication price process in dynamic setting.
Study reveals statistical bias in dataset replication, reducing accuracy drop from 11-14% to 3.6%.
problem Statistical bias in dataset replication affects model generalization accuracy.
method Analyzed ImageNet-v2, identified and corrected for bias, and compared results.
result Correcting bias reduces accuracy drop from 11-14% to 3.6%.
Study replicability in high-dimensional statistics, resolving open problems.
problem Ensuring consistent results in high-dimensional statistical tasks.
method Introduced replicable learning algorithms and established computational and statistical equivalence with high-dimensional isoperimetric tilings.
result Matching sample complexity upper and lower bounds for replicable mean estimation and coin problem.
New uniformity tester ensures consistent results across different samples.
problem Non-replicable behavior of uniformity testing algorithms.
method Develops a replicable uniformity tester with improved sample complexity.
result Achieves nearly linear dependence on replicability factor ρ. This paper studies the empirical tracking performance of leveraged ETFs on gold, and their price relationships with gold spot and futures. For tracking the gold spot, we find that our optimized portfolios with short-term gold futures are highly effective in replicating prices. The market-traded gold ETF (GLD) also exhi…
ERICA assesses replicability of cluster analysis results.
problem Lack of quantitative scrutiny for clustering results.
method ERICA: a framework to assess replicability of cluster analysis.
result Clusters are found to be replicable in synthetic data but not in real-world datasets.
In this work we introduce the notion of fully incomplete markets. We prove that for these markets the super-replication price coincide with the model free super-replication price. Namely, the knowledge of the model does not reduce the super-replication price. We provide two families of fully incomplete models: stochast…
By the classical Martingale Representation Theorem, replication of random vectors can be achieved via stochastic integrals or solutions of stochastic differential equations. We introduce a new approach to replication of random vectors via adapted differentiable processes generated by a controlled ordinary differential …
Proposes incorporating noise sources in machine learning evaluation for more reliable conclusions.
problem Inadequate handling of nondeterminism in machine learning research leads to unreliable results.
method Uses linear mixed effects models (LMEMs) and generalized likelihood ratio tests (GLRT) to analyze performance evaluation scores and assess performance differences.
result Demonstrates how to incorporate various sources of noise and data properties into statistical significance testing and reliability analysis.
Proposes an optimization framework for sparse robust subspace estimation.
problem Sparse robust one-dimensional subspace estimation.
method l1-norm regularization, linear relaxation, simple ratios, sorting techniques.
result Achieves global optimality for sparse robust subspace with polynomial time efficiency.
We study super--replication of contingent claims in markets with fixed transaction costs. This can be viewed as a stochastic impulse control problem with a terminal state constraint. The first result in this paper reveals that in reasonable continuous time financial market models the super--replication price is prohibi…
A new model decomposes equity returns and volatilities into memory components.
problem Understanding long-term equity dynamics and volatility patterns.
method Proposes a multivariate generalization of the variance ratio to decompose long-horizon equity dynamics.
result Identifies a five-factor model capturing persistent, antipersistent, and multi-scale memory in returns and volatility.
Optimizing expensive black-box systems with limited data is an extremely challenging problem. As a resolution, we present a new surrogate optimization approach by addressing two gaps in prior research -- unimportant input variables and inefficient treatment of uncertainty associated with the black-box output. We first …
Paper improves MMD estimation for analytical mean embeddings.
problem Improving MMD estimation for distributions with analytical mean embeddings.
method Proposes a tighter concentration result for MMD estimation under semi-explicit settings and extends to unbounded kernels.
result Demonstrates efficiency in real-world applications like index replication and calibration.
Adaptive replication improves stochastic function optimization.
problem Challenges in accurately estimating functions with high variance.
method Trust-region-based Bayesian optimization with adaptive replication.
result Adaptive replication substantially improves solution accuracy and efficiency.
We investigate two new strategies for the numerical solution of optimal stopping problems within the Regression Monte Carlo (RMC) framework of Longstaff and Schwartz. First, we propose the use of stochastic kriging (Gaussian process) meta-models for fitting the continuation value. Kriging offers a flexible, nonparametr…
Replicable clustering algorithms for k-medians, k-means, and k-centers are proposed.
problem Designing clustering algorithms that produce the same partition on repeated runs under the same distribution.
method Utilizing approximation routines for combinatorial clustering problems in a black-box manner.
result Replicable algorithms for statistical k-medians, k-means, and k-centers with specified approximation and sample complexities. Recent advances in smart cities applications enforce security threads such as node replication attacks. Such attack is take place when the attacker plants a replicated network node within the network. Vehicular Ad hoc networks are connecting sensors that have limited resources and required the response time to be as lo…
In this paper we propose a new robust algorithm to find the optimal static replicating portfolios for general nonlinear payoff functions and give the estimate of the rate of convergence that is absent in the literature. We choose the static replication by minimizing the error bound between the nonlinear payoff function…
The paper prices long-term options with a reflecting barrier model.
problem Pricing long-term options with asset price limits.
method Model asset price as geometric Brownian motion with a lower reflecting barrier, pricing options using compound options.
result Option prices can be determined using standard risk-neutral arguments, and hedging strategies are available.
New RL algorithm ensures stable, replicable policies.
problem Stability and replicability issues in RL algorithms.
method Introduced weak and strong forms of list replicability, developed a novel planning strategy, and tested state reachability.
result Proved efficient tabular RL algorithm with polynomial list complexity.
Study on replicability in reinforcement learning algorithms.
problem Ensuring consistent policy outputs in reinforcement learning.
method Mathematical study focusing on replicability in discounted tabular MDPs with a generative model.
result Design of efficient replicable and TV indistinguishable algorithms for policy estimation.
Replicates and improves Uniswap V3 model using DDQN and Mamba.
problem Improving liquidity provision in Uniswap V3 with reinforcement learning.
method Combines DDQN with Mamba and introduces a new reward function.
result Shows stronger theoretical support and better performance than original model.
Efficient algorithms improve learning of large-margin halfspaces.
problem Learning large-margin halfspaces efficiently and reproducibly.
method Design of efficient, dimension-independent, polynomial-time algorithms; SGD-based approach; DP-to-Replicability reduction.
result Improved sample complexity compared to previous algorithms, with optimal sample complexity for one algorithm.
This paper studies robust payoff allocation in submodular games, especially against replication.
problem Payoff allocation in submodular games, especially robustness against replication.
method Systematically studied replication manipulation in submodular games, introduced replication robustness metric, and validated with empirical ML data market.
result Conditions characterizing robustness of semivalues in submodular games.
We describe TF-Replicator, a framework for distributed machine learning designed for DeepMind researchers and implemented as an abstraction over TensorFlow. TF-Replicator simplifies writing data-parallel and model-parallel research code. The same models can be effortlessly deployed to different cluster architectures (i…
The study examines a financial model with sticky prices and finds no arbitrage when interest rate is zero.
problem Analyzing financial markets with sticky asset prices and proving no arbitrage conditions.
method Introduced a financial market model with a risky asset following a sticky geometric Brownian motion and a riskless asset with a constant interest rate. Proved no arbitrage conditions and derived pricing equations.
result No arbitrage conditions are met only when the interest rate is zero, and all replicable payoffs are derived under this condition.
We develop a unified valuation theory that incorporates credit risk (defaults), collateralization and funding costs, by expanding the replication approach to a generality that has not yet been studied previously and reaching valuation when replication is not assumed. This unifying theoretical framework clarifies the re…
New algorithm ensures replicable results in multi-armed bandits with minimal extra regret.
problem Ensuring consistent results in multi-armed bandit studies.
method Incorporates randomness into decision-making to ensure replicability while maintaining minimal extra regret.
result For large time horizons, proposed algorithm suffers only K2/ρ2 times smaller amount of exploration than existing algorithms.