Auto-Regressive Control of Execution Costs
Bertsimas and Lo's seminal work established a foundational framework for addressing the implementation shortfall dilemma faced by large institutional investors. Their models emphasized the critical role of accurate knowledge of market microstructure and price/information dynamics in optimizing trades to minimize execution costs. However, this paper recognizes that perfect initial knowledge may not be a realistic assumption for new investors entering the market. Therefore, this study aims to bridge this gap by proposing an approach that iteratively derives OLS estimates of the market parameters from period to period. This methodology enables uninformed investors to engage in the market dynamically, adjusting their strategies over time based on evolving estimates, thus offering a practical solution for navigating the complexities of execution cost optimization without perfect initial knowledge.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Leveraging Speculative Sampling and KV-Cache Optimizations Together for Generative AI using OpenVINO
Inference optimizations are critical for improving user experience and reducing infrastructure costs and power consumption. In this article, we illustrate a form of dynamic execution known as speculative sampling to redu…
QuantizationText GenerationReal-Time Execution with Autoregressive Policies
Real-time execution, enabled by asynchronous inference that ensures both smooth action trajectories and fast reactivity, is critical for realistic deployments of large-scale Vision-Language-Action models. However, recent…
Quality versus speed in energy demand prediction for district heating systems
In this paper, we consider energy demand prediction in district heating systems. Effective energy demand prediction is essential in combined heat power systems when offering electrical energy in competitive electricity m…
PredictionSparser, Faster, Lighter Transformer Language Models
Scaling autoregressive large language models (LLMs) has driven unprecedented progress but comes with vast computational costs. In this work, we tackle these costs by leveraging unstructured sparsity within an LLM's feedf…
Non-Monotonic Latency in Apple MPS Decoding: KV Cache Interactions and Execution Regimes
Autoregressive inference is typically assumed to scale predictably with decoding length, with latency increasing smoothly as generated sequence length grows. In this work, we identify unexpected non-monotonic latency beh…