TIP-Search: Time-Predictable Inference Scheduling for Market Prediction under Uncertain Load

• URL: http://arxiv.org/abs/2506.08026v2
• Date: Mon, 16 Jun 2025 19:58:59 GMT
• Title: TIP-Search: Time-Predictable Inference Scheduling for Market Prediction under Uncertain Load
• Abstract summary: TIP-Search is a time-predictable inference scheduling framework for real-time market prediction under uncertain workloads.<n>We evaluate TIP-Search on three real-world limit order book datasets.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper proposes TIP-Search, a time-predictable inference scheduling framework for real-time market prediction under uncertain workloads. Motivated by the strict latency demands in high-frequency financial systems, TIP-Search dynamically selects a deep learning model from a heterogeneous pool, aiming to maximize predictive accuracy while satisfying per-task deadline constraints. Our approach profiles latency and generalization performance offline, then performs online task-aware selection without relying on explicit input domain labels. We evaluate TIP-Search on three real-world limit order book datasets (FI-2010, Binance BTC/USDT, LOBSTER AAPL) and demonstrate that it outperforms static baselines with up to 8.5% improvement in accuracy and 100% deadline satisfaction. Our results highlight the effectiveness of TIP-Search in robust low-latency financial inference under uncertainty.

Related papers

• Online LLM Selection via Constrained Bandits with Time-Varying Demand [11.284703747922757]
  Large Language Models (LLMs) are increasingly deployed in edge-cloud systems to handle diverse user tasks with heterogeneous accuracy, latency, and cost profiles.<n>We formulate this problem as a constrained bandit learning task, where the learner sequentially selects models under both packing-type (hard) and covering-type (soft) constraints.<n>We develop a novel online learning algorithm that leverages confidence-bound estimates and demand predictions to balance reward with long-term satisfaction.
  arXiv  Detail & Related papers  (2026-06-16T03:58:48Z)
• Bi-Level Chaotic Fusion Based Graph Convolutional Network for Stock Market Prediction Interval [0.0]
  Financial market forecasting is inherently uncertain, yet most deep learning approaches rely on single estimates without uncertainty.<n>The problem can be solved using prediction intervals, which allow obtaining an uncertainty and lower bound for the prediction.<n>Yet, the current methods tend to disregard relationships between assets or cannot simultaneously ensure good calibration sharpness.
  arXiv  Detail & Related papers  (2026-05-05T05:06:42Z)
• Towards Anytime-Valid Statistical Watermarking [63.02116925616554]
  We develop the first e-value-based watermarking framework, Anchored E-Watermarking, that unifies optimal sampling with anytime-valid inference.<n>Our framework can significantly enhance sample efficiency, reducing the average token budget required for detection by 13-15% relative to state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-02-19T18:32:26Z)
• Deadline-Aware Online Scheduling for LLM Fine-Tuning with Spot Market Predictions [11.849924812127371]
  We show the power of prediction in enabling cost-efficient scheduling and its sensitivity to estimation errors.<n>We propose an online allocation algorithm with prediction based on the committed horizon control approach.<n>An online policy selection algorithm is developed that learns the best policy from a pool constructed by varying the parameters of both algorithms.
  arXiv  Detail & Related papers  (2025-12-24T05:47:27Z)
• Reliable LLM-Based Edge-Cloud-Expert Cascades for Telecom Knowledge Systems [54.916243942641444]
  Large language models (LLMs) are emerging as key enablers of automation in domains such as telecommunications.<n>We study an edge-cloud-expert cascaded LLM-based knowledge system that supports decision-making through a question-and-answer pipeline.
  arXiv  Detail & Related papers  (2025-12-23T03:10:09Z)
• Confidence-Based Response Abstinence: Improving LLM Trustworthiness via Activation-Based Uncertainty Estimation [7.3923284353934875]
  We propose a method for confidence estimation in retrieval-augmented generation (RAG) systems that aligns closely with the correctness of large language model (LLM) outputs.<n>Our approach extends prior uncertainty quantification methods by leveraging raw feed-forward network (FFN) activations as auto-regressive signals.<n>Our results demonstrate that activation-based confidence modeling offers a scalable, architecture-aware path toward trustworthy RAG deployment.
  arXiv  Detail & Related papers  (2025-10-15T16:55:56Z)
• Beyond Greedy Exits: Improved Early Exit Decisions for Risk Control and Reliability [14.00844847268286]
  Early-Exit Deep Neural Networks enable adaptive inference by allowing prediction at intermediary layers.<n>Our framework demonstrates consistent improvements in speedup (1.70-2.10x) with a minimal performance drop (2%) as compared to full model performance.
  arXiv  Detail & Related papers  (2025-09-28T06:05:24Z)
• Smoothed Online Optimization for Target Tracking: Robust and Learning-Augmented Algorithms [14.970453355735225]
  We introduce a new framework that integrates three key objectives in online decision-making under uncertainty.<n>We first present BEST, a robust algorithm with provable competitive guarantees for SOOTT.<n>To enhance practical performance, we introduce CoRT, a learning-augmented variant that incorporates untrusted black-box predictions.
  arXiv  Detail & Related papers  (2025-09-07T05:22:41Z)
• Timing is Important: Risk-aware Fund Allocation based on Time-Series Forecasting [10.540006708939647]
  We introduce a Risk-aware Time-Series Predict-and-Allocate (RTS-PnO) framework to solve the problem of fund allocation.<n>The framework contains three features: (i) end-to-end training with objective alignment measurement, (ii) adaptive forecasting uncertainty calibration, and (iii) agnostic towards forecasting models.<n>The evaluation of RTS-PnO is conducted over both online and offline experiments.
  arXiv  Detail & Related papers  (2025-05-30T17:36:45Z)
• FinTSB: A Comprehensive and Practical Benchmark for Financial Time Series Forecasting [58.70072722290475]
  Financial time series (FinTS) record the behavior of human-brain-augmented decision-making.<n>FinTSB is a comprehensive and practical benchmark for financial time series forecasting.
  arXiv  Detail & Related papers  (2025-02-26T05:19:16Z)
• Anytime Incremental $ρ$POMDP Planning in Continuous Spaces [5.767643556541711]
  We present an anytime solver that dynamically refines belief representations, with formal guarantees of improvement over time.<n>We demonstrate its effectiveness for common entropy estimators, reducing computational cost by orders of magnitude.<n> Experimental results show that $rho$POMCPOW outperforms state-of-the-art solvers in both efficiency and solution quality.
  arXiv  Detail & Related papers  (2025-02-04T18:19:40Z)
• SURE: SUrvey REcipes for building reliable and robust deep networks [12.268921703825258]
  In this paper, we revisit techniques for uncertainty estimation within deep neural networks and consolidate a suite of techniques to enhance their reliability. We rigorously evaluate SURE against the benchmark of failure prediction, a critical testbed for uncertainty estimation efficacy. When applied to real-world challenges, such as data corruption, label noise, and long-tailed class distribution, SURE exhibits remarkable robustness, delivering results that are superior or on par with current state-of-the-art specialized methods.
  arXiv  Detail & Related papers  (2024-03-01T13:58:19Z)
• Score Matching-based Pseudolikelihood Estimation of Neural Marked Spatio-Temporal Point Process with Uncertainty Quantification [59.81904428056924]
  We introduce SMASH: a Score MAtching estimator for learning markedPs with uncertainty quantification. Specifically, our framework adopts a normalization-free objective by estimating the pseudolikelihood of markedPs through score-matching. The superior performance of our proposed framework is demonstrated through extensive experiments in both event prediction and uncertainty quantification.
  arXiv  Detail & Related papers  (2023-10-25T02:37:51Z)
• Diffusion Variational Autoencoder for Tackling Stochasticity in Multi-Step Regression Stock Price Prediction [54.21695754082441]
  Multi-step stock price prediction over a long-term horizon is crucial for forecasting its volatility. Current solutions to multi-step stock price prediction are mostly designed for single-step, classification-based predictions. We combine a deep hierarchical variational-autoencoder (VAE) and diffusion probabilistic techniques to do seq2seq stock prediction. Our model is shown to outperform state-of-the-art solutions in terms of its prediction accuracy and variance.
  arXiv  Detail & Related papers  (2023-08-18T16:21:15Z)
• Stream-based Active Learning with Verification Latency in Non-stationary Environments [6.883906273999368]
  We investigate the influence of finite, time-variable, and unknown verification delay, in the presence of concept drift on AL approaches. We propose PRopagate, a latency independent utility estimator which predicts the requested, but not yet known, labels. We empirically show that the proposed method consistently outperforms the state-of-the-art.
  arXiv  Detail & Related papers  (2022-04-14T08:51:15Z)
• Bayesian Bilinear Neural Network for Predicting the Mid-price Dynamics in Limit-Order Book Markets [84.90242084523565]
  Traditional time-series econometric methods often appear incapable of capturing the true complexity of the multi-level interactions driving the price dynamics. By adopting a state-of-the-art second-order optimization algorithm, we train a Bayesian bilinear neural network with temporal attention. By addressing the use of predictive distributions to analyze errors and uncertainties associated with the estimated parameters and model forecasts, we thoroughly compare our Bayesian model with traditional ML alternatives.
  arXiv  Detail & Related papers  (2022-03-07T18:59:54Z)
• Low-Rank Temporal Attention-Augmented Bilinear Network for financial time-series forecasting [93.73198973454944]
  Deep learning models have led to significant performance improvements in many problems coming from different domains, including prediction problems of financial time-series data. The Temporal Attention-Augmented Bilinear network was recently proposed as an efficient and high-performing model for Limit Order Book time-series forecasting. In this paper, we propose a low-rank tensor approximation of the model to further reduce the number of trainable parameters and increase its speed.
  arXiv  Detail & Related papers  (2021-07-05T10:15:23Z)
• The Benefit of the Doubt: Uncertainty Aware Sensing for Edge Computing Platforms [10.86298377998459]
  We propose an efficient framework for predictive uncertainty estimation in NNs deployed on embedded edge systems. The framework is built from the ground up to provide predictive uncertainty based only on one forward pass. Our approach not only obtains robust and accurate uncertainty estimations but also outperforms state-of-the-art methods in terms of systems performance.
  arXiv  Detail & Related papers  (2021-02-11T11:44:32Z)
• Optimizing for the Future in Non-Stationary MDPs [52.373873622008944]
  We present a policy gradient algorithm that maximizes a forecast of future performance. We show that our algorithm, called Prognosticator, is more robust to non-stationarity than two online adaptation techniques.
  arXiv  Detail & Related papers  (2020-05-17T03:41:19Z)
• Uncertainty Quantification for Demand Prediction in Contextual Dynamic Pricing [20.828160401904697]
  We study the problem of constructing accurate confidence intervals for the demand function. We develop a debiased approach and provide the normality guarantee of the debiased estimator.
  arXiv  Detail & Related papers  (2020-03-16T04:21:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.