Knockoffs method selects financial factors, controlling false discoveries.
problem Controlling false discoveries in financial factor selection.
method Apply knockoff procedure to build fake factors.
result Shows versatility in fund replication and network inference.
Corporate bond factor research is flawed due to measurement errors and ex-post filtering.
problem Replication crisis in corporate bond factor research.
method Analysis of 108 signals across nine thematic clusters, correction of transaction prices and return filtering.
result Majority of previously documented factors do not produce statistically significant alphas after correction.
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.
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.
The study models mortgage prepayment risk, accounting for behavioral uncertainty, and provides replication strategies.
problem Modeling and replicating the prepayment option of mortgages with behavioral uncertainty.
method Modeling behavioral uncertainty as a non-hedgeable risk factor, proving its impact on exposure value, and using IRSs and swaptions for replication.
result Including behavioral uncertainty reduces the exposure's value, and swaptions are necessary for optimal replication.
Machine learning helps estimate risk premiums of stocks without knowing their factors.
problem Estimate risk premiums of stocks without knowing their underlying factors.
method Used elastic-net machine learning to project stock returns onto peers and construct replicate portfolios.
result Unique stocks have higher SARP and excess returns than ubiquitous stocks.
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 ρ. 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. 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.
A semi-static approach efficiently replicates and prices callable interest rate derivatives.
problem Efficiently replicating and pricing callable interest rate derivatives under dynamic market conditions.
method Proposes a semi-static hedging algorithm that updates the replication portfolio on a finite number of instances, rather than continuously.
result The hedging error can be made arbitrarily small with a sufficiently large replication portfolio, and closed-form error margins are determined.
RL methods applied to option pricing using modified QLBS and RLOP models.
problem Applying reinforcement learning to price options accurately.
method Developed modified QLBS and RLOP models, implemented RL learning algorithm with neural networks.
result Optimal hedging strategies learned by RL outperform baseline models.
New gradient coding schemes reduce decoding error in both random and adversarial straggler settings.
problem Creating efficient approximate gradient coding schemes for distributed optimization.
method Introduced novel approximate gradient codes based on expander graphs, achieving optimal decoding coefficients.
result Achieved nearly optimal error in random setting and nearly half the error in adversarial setting compared to existing codes.
QRAFTI uses multi-agent framework to improve equity factor research.
problem Replicating and developing new equity factors in large financial datasets.
method Integrates a research toolkit with MCP servers for data access and custom coding operations.
result Improves performance and explainability in multi-step empirical tasks.
The completeness of a bond market model with infinite number of sources of randomness on a finite time interval in the Heath-Jarrow-Morton framework is studied. It is proved that the market is not complete. A construction of a bounded contingent claim, which can not be replicated, is provided.
The study finds that factor momentum is significant only at short lags compared to stock momentum.
problem Investigating the relationship between factor momentum and stock momentum.
method Replicated earlier findings and conducted a spanning test controlling for stock momentum and factor exposure.
result Factor momentum is significant only at short lags after controlling for stock momentum and factor exposure.
The paper introduces a new method to improve model generalization by routing model copies through permutations.
problem Improving model generalization in machine learning.
method The method replicates a model \(M\) times and rewire the contexts in which local learning messages are computed using permutations.
result The method improves generalization by structured message sharing rather than coupling parameters.
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.
Paper introduces non-linear discounting models for default compensation and climate valuation.
problem Valuation of non-replicable value and damage under default risk.
method Develops two models: one for risk-neutralising discounting and another for survival probability dependent discounting.
result Non-decaying discount factors (negative discount rates) are possible under certain scenarios.
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.
We discuss a general dynamic replication approach to counterparty credit risk modeling. This leads to a fundamental jump-process backward stochastic differential equation (BSDE) for the credit risk adjusted portfolio value. We then reduce the fundamental BSDE to a continuous BSDE. Depending on the close out value conve…
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.
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%.
Financial event studies often misestimate causal effects due to misspecified factor models.
problem Misspecification of factor models in financial event studies leads to inconsistent estimates of causal effects.
method Proposed synthetic control methods to construct replicating portfolios from control securities.
result Synthetic control methods provide more accurate estimates of causal effects in event studies.
The completeness problem of the bond market model with the random factors determined by a Wiener process and Poisson random measure is studied. Hedging portfolios use bonds with maturities in a countable, dense subset of a finite time interval. It is shown that under natural assumptions the market is not complete unles…
We consider the pricing of European-style structured credit payoff in a static framework, where the underlying default times are independent given a common factor. A practical application would consist of the pricing of nth-to-default baskets under the Gaussian copula model (GCM). We provide necessary and sufficient co…
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 …
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…
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 …
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.
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.
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 explores perpetual contracts in a financial market without arbitrage.
problem Modeling perpetual contracts in a continuous-time financial market.
method Derive model-free and semi-robust expressions for perpetual contracts' funding and discount rates.
result Explicit replication strategies for perpetual contracts are derived, relating them to traditional financial instruments.
The behavior of many Bayesian models used in machine learning critically depends on the choice of prior distributions, controlled by some hyperparameters that are typically selected by Bayesian optimization or cross-validation. This requires repeated, costly, posterior inference. We provide an alternative for selecting…
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.