We prove the existence of a Radner equilibrium in a model with proportional transaction costs on an infinite time horizon and analyze the effect of transaction costs on the endogenously determined interest rate. Two agents receive exogenous, unspanned income and choose between consumption and investing into an annuity.…
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,695 papers · 148 categories
Trend · papers per month
48 results for “time cost”
We seek decision rules for prediction-time cost reduction, where complete data is available for training, but during prediction-time, each feature can only be acquired for an additional cost. We propose a novel random forest algorithm to minimize prediction error for a user-specified {\it average} feature acquisition b…
We study the high-frequency limits of strategies and costs in a Nash equilibrium for two agents that are competing to minimize liquidation costs in a discrete-time market impact model with exponentially decaying price impact and quadratic transaction costs of size . We show that, for , equilibrium strategie…
Recently, machine learning algorithms have successfully entered large-scale real-world industrial applications (e.g. search engines and email spam filters). Here, the CPU cost during test time must be budgeted and accounted for. In this paper, we address the challenge of balancing the test-time cost and the classifier …
New algorithm reduces dynamic regret in time-varying movement costs.
problem Dynamic regret in online convex optimization with time-varying movement costs.
method Introduced a novel algorithm for time-varying movement costs, achieving comparator-adaptive dynamic regret bound.
result Established first comparator-adaptive dynamic regret bound of .
Optimizes insurance processing capacity to minimize costs.
problem Processing delays and backlogs in insurance claims.
method Optimal capacity selection to minimize delay-adjusted and fixed costs.
result Minimizes claims costs by balancing processing capacity and delays.
Optimizes portfolios with costs, showing existence of optimal strategies.
problem Risk-sensitive portfolio optimization with transaction costs.
method Log-return i.i.d. framework, Bellman equation analysis.
result Existence of optimal strategies for risk-averse and risk-seeking cases.
UCRL-CMDP algorithm optimizes RL with constraints on average costs.
problem Optimizing RL in MDPs with average cost constraints.
method Model-based RL algorithms maximizing reward while keeping costs within bounds.
result UCRL-CMDP algorithm's expected regret is upper-bounded by $T^{2\slash 3}$.
Study high-frequency trading game with price impact, finding unique equilibrium.
problem Optimal execution in a trading game with transient price impact.
method Analyzes high-frequency limit of an -trader optimal execution game.
result High-frequency limit converges to a continuous-time model with quadratic costs.
Equilibrium found for multi-agent trading with transaction costs.
problem Designing a trading equilibrium for multiple agents with transaction costs.
method Proving the existence of a continuous-time Radner equilibrium with incentives and transaction costs.
result Each agent optimally trades for a specific time interval before stopping, influenced by transaction costs.
Optimizes state monitoring in Markovian systems with cost constraints.
problem Balancing state queries with prediction costs in Markovian systems.
method Greedy policy and SGD-based learning variant for optimal predict-query tradeoff.
result Greedy policy is suboptimal but performs close to optimal under certain conditions.
New method optimizes costly evaluations in Bayesian optimization.
problem Costly evaluations in BO methods, especially in hyperparameter tuning.
method Formulated as a CMDP, developed rollout approximation for optimal policy.
result Improved cost efficiency over standard BO methods.
Paper presents a faster method for computing cost of equity and performing comparable company analysis.
problem Tedium and subjectivity in traditional cost of equity and comparable company analysis methods.
method Uses spectral and agglomerative clustering to compute cost of equity and perform comparable company analysis.
result Reduces time required for comps by orders of magnitude and improves consistency and reliability.
We devise an optimal allocation strategy for the execution of a predefined number of stocks in a given time frame using the technique of discrete-time Stochastic Control Theory for a defined market model. This market structure allows an instant execution of the market orders and has been analyzed based on the assumptio…
American options are studied in a general discrete market in the presence of proportional transaction costs, modelled as bid-ask spreads. Pricing algorithms and constructions of hedging strategies, stopping times and martingale representations are presented for short (seller's) and long (buyer's) positions in an Americ…
Two major financial market complexities are transaction costs and uncertain volatility, and we analyze their joint impact on the problem of portfolio optimization. When volatility is constant, the transaction costs optimal investment problem has a long history, especially in the use of asymptotic approximations when th…
In many real-world machine learning problems, feature values are not readily available. To make predictions, some of the missing features have to be acquired, which can incur a cost in money, computational time, or human time, depending on the problem domain. This leads us to the problem of choosing which features to u…
Update rules for learning in dynamic time warping spaces are based on optimal warping paths between parameter and input time series. In general, optimal warping paths are not unique resulting in adverse effects in theory and practice. Under the assumption of squared error local costs, we show that no two warping paths …
Algorithm for bandits with switching costs achieves optimal regret bounds.
problem Optimal regret bounds for stochastic and adversarial bandits with switching costs.
method Adaptation of Tsallis-INF algorithm with no prior knowledge of regime or time horizon.
result Achieves minimax optimal regret bounds in various settings.
Deep architecture such as hierarchical semi-Markov models is an important class of models for nested sequential data. Current exact inference schemes either cost cubic time in sequence length, or exponential time in model depth. These costs are prohibitive for large-scale problems with arbitrary length and depth. In th…
This work improves cost-aware Bayesian optimization by introducing Pareto-efficient acquisition functions.
problem Cost variability in hyperparameter evaluations affects the efficiency of Bayesian optimization.
method Reformulated cost-aware Bayesian optimization as Pareto efficiency, proposing a novel Pareto-efficient expected improvement.
result Pareto-efficient acquisition functions significantly outperform previous solutions, providing finer control over cost-accuracy trade-offs.
Simulation framework assesses ROI of chronic disease adherence and policy timing.
problem Uncertainty in ROI of adherence-enhancing interventions under heterogeneous patient behavior and socioeconomic variation.
method Simulation-based framework integrating disease progression, time-varying adherence, and policy timing.
result Early and adaptive interventions yield highest ROI, exceeding 20% under certain conditions.
Solves steering problem with continuous time, Hilbert-Schmidt cost, and matrix ODEs.
problem Fixed horizon linear quadratic covariance steering in continuous time with a specific terminal cost.
method Formulates necessary conditions as a coupled matrix ODE two-point boundary value problem, designs a matricial recursive algorithm, and proves convergence.
result Proposes and proves the convergence of a matricial recursive algorithm for solving the steering problem.
The paper introduces Robust Correlated Equilibrium for games with time-varying costs and proposes an algorithm to achieve it.
problem Games with time-varying costs and disturbances.
method Proposes Robust Correlated Equilibrium and a decentralized algorithm to learn optimal strategies.
result The algorithm converges to the Robust Correlated Equilibrium, showing no regret for each controller.
Based on a study of the coupling by reflection of diffusion processes, a new monotonicity in time of a time-dependent transportation cost between heat distribution is shown under Bakry-Emery's curvature-dimension condition on a Riemannian manifold. The cost function comes from the total variation between heat distribut…
New algorithms optimize time series classification speed and accuracy.
problem Efficiently classify time series data quickly without sacrificing accuracy.
method Optimization criterion balancing misclassification and delay costs, derived non-myopic algorithms.
result Supervised-based algorithms outperform unsupervised-based ones in real data sets.
In this study we model the warranty claims process and evaluate the warranty servicing costs under non-renewing and renewing free repair warranties. We assume that the repair time for rectifying the claims is non-zero and the repair cost is a function of the length of the repair time. To accommodate the ageing of the p…
Revisits superhedging under proportional costs in continuous time markets.
problem Superhedging in markets with proportional transaction costs.
method Set-valued stochastic analysis, continuous trading schemes, dynamic risk measure.
result Dynamic set-valued risk measure with multi-portfolio time-consistency.
Study optimal periodic dividend strategies for risky businesses with transaction costs.
problem Optimal periodic dividend strategies for spectrally positive Lévy risk processes with fixed transaction costs.
method Investigates periodic strategies for a Poisson arrival process of decision times.
result A periodic strategy is optimal with lump sum dividends net of transaction costs.
On-chain Peak Shavingecon.EM
Study on-chain peak shaving to reduce Ethereum transaction costs.
problem Reducing transaction costs in blockchain networks, especially during congested periods.
method Analyzing transaction-level data from multiple firms across various industries to understand scheduling responses and cost management strategies.
result Firms' scheduling responses to congestion vary, leading to different fee savings and residual costs.
Optimal reinsurance strategy with fixed cost and exponential preferences.
problem Maximizing expected utility of terminal wealth with fixed reinsurance cost.
method Two-step procedure: stochastic control and optimal stopping problem.
result Deterministic optimal strategy depends on model parameters.
The paper discusses the limitations of efficiency metrics in machine learning models.
problem Inadequate reporting of efficiency metrics leads to incomplete conclusions.
method Thoroughly discusses common cost indicators, their advantages and disadvantages, and how they contradict each other.
result Incomplete reporting of efficiency metrics can lead to partial conclusions and a blurred picture of model practical considerations.
Cost-effectiveness analyses (CEAs) are at the center of health economic decision making. While these analyses help policy analysts and economists determine coverage, inform policy, and guide resource allocation, they are statistically challenging for several reasons. Cost and effectiveness are correlated and follow com…
We consider the problem of optimizing the expected logarithmic utility of the value of a portfolio in a binomial model with proportional transaction costs with a long time horizon. By duality methods, we can find expressions for the boundaries of the no-trade-region and the asymptotic optimal growth rate, which can be …
Study how transaction costs impact stock returns and holdings in equilibrium.
problem Impact of quadratic transaction costs on equilibrium stock returns and holdings.
method Developed a continuous-time risk-sharing model with FBSDEs to characterize equilibrium stock holdings and trading rates.
result Equilibrium stock holdings and trading rates are uniquely determined by FBSDEs, and equilibrium return by a system of coupled FBSDEs.
In this research we study a finite horizon optimal purchasing problem for items with a mean reverting price process. Under this model a fixed amount of identical items are bought under a given deadline, with the objective of minimizing the cost of their purchasing price and associated holding cost. We prove that the op…
In real-world scenarios, different features have different acquisition costs at test-time which necessitates cost-aware methods to optimize the cost and performance trade-off. This paper introduces a novel and scalable approach for cost-aware feature acquisition at test-time. The method incrementally asks for features …
Proposes a method to train neural networks that solve differential equations faster.
problem Training neural networks that solve differential equations becomes computationally expensive.
method Introduces a differentiable surrogate for numerical solver time cost using higher-order derivatives.
result Trains models that are faster to solve while maintaining nearly the same accuracy.
Study schedules jobs with unknown holding costs to minimize expected cumulative cost.
problem Minimizing expected cumulative holding costs of jobs with unknown parameters.
method Learning-based rule scheduling with a preemption phase.
result Achieves near-optimal performance guarantees with nearly matching regret bounds.
On the Hedging of American Options in Discrete Time Markets with Proportional Transaction Costsmath.PR
In this note, we consider a general discrete time financial market with proportional transaction costs as in Kabanov and Stricker (2001), Kabanov et al. (2002), Kabanov et al. (2003) and Schachermayer (2004). We provide a dual formulation for the set of initial endowments which allow to super-hedge some American claim.…
Variational Prediction simplifies Bayesian inference without test time costs.
problem Bayesian inference's computational costs and posterior predictive distribution marginalization.
method Variational Prediction learns a variational approximation to the posterior predictive distribution using a variational bound.
result Directly learns a variational approximation to the posterior predictive distribution without test time marginalization costs.
Estimates returns for dollar cost averaging using geometric Brownian motion.
problem Estimating returns for dollar cost averaging investing strategy.
method Uses geometric Brownian motion and log-Normal distribution to construct a lower bound for returns. Computes parameters recursively and in closed form for dollar cost averaging. Compares to lump sum investing for matching wealth distributions.
result Probability of negative returns is less than 2.5% for 40 years of annual dollar cost averaging.
We consider an agent who invests in a stock and a money market account with the goal of maximizing the utility of his investment at the final time T in the presence of a proportional transaction cost. The utility function considered is power utility. We provide a heuristic and a rigorous derivation of the asymptotic ex…
The paper proposes a technique to speed up evolutionary algorithms by using lower-cost approximations of the objective function.
problem Evolutionary algorithms require many evaluations to solve computationally expensive black-box optimization problems.
method The paper introduces a technique to choose an appropriate approximate function cost during the execution of the optimization algorithm.
result The proposed approach can reach the same objective value in less than half the time in certain cases.
Cost-aware BO minimizes function evaluations with varying costs.
problem Optimization with varying evaluation costs in expensive functions.
method Cost Apportioned Bayesian Optimization (CArBO) combining initial and cost-cooled phases.
result CArBO finds better hyperparameter configurations with the same cost budget.
Study optimal execution in a transient price impact model with multiple traders.
problem Optimal execution among multiple traders with transient price impact.
method Analyzed -player optimal execution games in an Obizhaeva--Wang model with and without regularization. Derived equilibrium solutions and explained their behavior.
result Existence of equilibrium restored with a specific time-dependent cost on block trades, and equilibrium is tractable.
We study partial hedging for game options in markets with transaction costs bounded from below. More precisely, we assume that the investor's transaction costs for each trade are the maximum between proportional transaction costs and a fixed transaction costs. We prove that in the continuous time Black--Scholes (BS) mo…
Olympic Games consistently exceed budgets, leading to unpredictable costs.
problem High costs and unpredictability of the Olympic Games.
method Statistical analysis of historical data to explain cost risks.
result Olympic costs follow a power-law distribution with infinite mean and variance.