Research
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.

169,051 papers · 148 categories

Trend · papers per month

133266398531 · Jun 202019922001200920182026
48 results for prediction serving

PRETZEL optimizes machine learning prediction serving systems for better performance.

problem Low latency, high throughput, and graceful performance degradation under heavy load in prediction serving systems.
method Introducing a novel white box architecture enabling both end-to-end and multi-model optimizations.
result Average 5.5x reduction in 99th percentile latency, 25x reduction in memory footprint, and 4.7x increase in throughput compared to state-of-the-art approaches.

DeepLight accelerates CTR predictions in ad serving by 46X.

problem Significantly increased serving delay and high memory usage for ad serving.
method Explicitly searching feature interactions, pruning layers, promoting sparsity.
result Accelerates model inference by 46X on Criteo dataset.

HOLMES improves real-time model serving for ICU patients, balancing accuracy and speed.

problem Real-time model serving is crucial in ICU due to urgency and cost.
method Online model ensemble serving framework for healthcare applications.
result HOLMES achieves high accuracy and sub-second latency for model ensemble serving.

Proposes a flexible neural recommendation framework for better prediction performance.

problem Data sparsity, cold start problem, and long-tail distribution in recommendations.
method A modular neural recommendation framework that includes a neural collaborative filtering part and a text processing part as a regularizer.
result Achieves better prediction performance than state-of-the-art text-aware methods using a simple text processing approach.

The paper introduces uncertainty quantification for NER models.

problem Current NER models lack uncertainty measures, leading to downstream errors.
method Full-Sequence and Subsequence Conformal Prediction framework.
result The method provides formal guarantees about the reliability of model predictions.

A Bayesian agent learns about the structure of a stationary process from ob- serving past outcomes. We prove that his predictions about the near future become ap- proximately those he would have made if he knew the long run empirical frequencies of the process.

2014-06-25abs ↗pdf ↗

This paper improves prediction uncertainty estimation by inferring variation from neuron activation strength.

problem Estimating prediction uncertainty from ensemble methods is expensive and inaccurate.
method Introduced randomness into model training and inferred prediction variation from neuron activation strength.
result Average R squared on MovieLens is 0.56 and on Criteo is 0.81, with strong performance in variation detection.

Empirical analysis serves as an important complement to theoretical analysis for studying practical Bayesian optimization. Often empirical insights expose strengths and weaknesses inaccessible to theoretical analysis. We define two metrics for comparing the performance of Bayesian optimization methods and propose a ran…

2016-03-31abs ↗pdf ↗

The paper proposes a method to create efficient remote monitoring models.

problem Large and complex machine learning models are unsuitable for remote monitoring on edge devices.
method Decompose the model into a simple local monitoring function and a complex correction term evaluated on the server.
result The proposed framework learns monitoring models with significantly reduced complexity that maintain safety.

BrainSurfCNN predicts task contrasts from resting-state fingerprints, improving accuracy over baseline.

problem Predicting task-evoked activity from resting-state functional connectivity.
method Surface-based convolutional neural network (BrainSurfCNN) with reconstructive-contrastive loss.
result Significantly improved accuracy in predicting task contrasts over baseline.

Deep neural networks reduce weather forecast uncertainty estimation costs.

problem Accurate estimation of weather forecast uncertainty using ensemble prediction systems.
method Modified 3D U-Net architecture and models incorporating temporal data.
result Deep neural networks can estimate weather forecast uncertainty with fewer simulations.

New framework predicts earnings announcements using press release content, surpassing earnings surprises.

problem Predicting stock returns based on earnings press releases.
method Compared traditional and BERT-based embeddings of press releases, finding content as informative as earnings surprises.
result FinBERT yields highest predictive power for earnings announcement returns.

Deep learning models struggle with new data in stock price trend prediction.

problem Stock price trend prediction using Deep Learning models.
method Examination of fifteen state-of-the-art DL models on LOB data, using LOBCAST framework.
result All models show significant performance drop with new data, questioning their market applicability.

New bidirectional model predicts magnetohydrodynamics fields and estimates uncertainty.

problem Predicting multiple fields in magnetohydrodynamics with uncertainty.
method Bidirectional autoregressive latent diffusion approach.
result Model can estimate uncertainty without ground truth using self-supervised consistency.

Proposes a probabilistic approach to semi-supervised learning using normalizing flows.

problem Leveraging unlabelled data for semi-supervised learning with limited labelled data.
method Uses a normalizing flow to learn the posterior distribution over predictions for labelled data, serving as a prior for unlabelled data.
result Demonstrates improved performance on various tasks with varying output complexity.

DRIFT uses neural flows to replace distributional regression models.

problem Lack of neural network representations for distributional regression models.
method Inverse flow transformations (DRIFT) for distributional regression.
result Neural representations in DRIFT match classical statistical methods in performance.

We enhance conformal prediction for risk-averse decisions with action-conditional guarantees.

problem Uncertainty quantification and safety guarantees for machine learning decisions.
method Action-conditional conformal prediction, pinball-loss minimization.
result Action-conditional prediction sets optimize risk-averse decision-making.

Paper proposes a new method to evaluate AI model interpretability in bond default prediction.

problem Lack of standardized method to assess inherent interpretability of AI models.
method Uses LIME and SHAP to assess feature contributions in bond default prediction.
result Consistent results with intuitive understanding of model interpretability.

New method attributes feature uncertainty in ML models using cooperative game theory.

problem Lack of feature-level uncertainty attribution in explainable AI.
method Proposes a novel, model-agnostic uncertainty attribution method using cooperative game theory and conformal prediction.
result Demonstrates improved runtime efficiency and practical utility in real-world applications.

The paper critiques existing uncertainty concepts and proposes a new decision-theoretic approach.

problem Incoherence in existing discussions of aleatoric and epistemic uncertainty.
method Decision-theoretic perspective that relates uncertainty, predictive performance, and statistical dispersion.
result Popular information-theoretic quantities can be poor estimators but still useful for guiding data acquisition.

Improved bounds for online prediction with expert advice.

problem Online prediction with expert advice in finite-horizon games.
method Verification arguments from optimal control theory applied to PDEs to find sub- and supersolutions.
result Explicit bounds for any number of experts and horizon, improving upon previous results.

Neural network learns kernel functions for survival analysis and prediction intervals.

problem Predicting survival times for individuals based on similar training subjects.
method Develops a neural network framework to learn kernel functions for kernel survival analysis and uses these to construct valid prediction intervals.
result Neural network survival estimators are competitive with existing methods and provide valid prediction intervals.

The paper introduces a method for creating short proofs of predictions in AI models.

problem Creating reliable and explainable AI predictions.
method Defining robust hollow star numbers and analyzing certificate sizes for various hypothesis classes.
result The certificate coefficient εx\varepsilon_x precisely controls the sample size needed for predictions.

Differentially private conformal prediction improves statistical efficiency.

problem Quantifying uncertainty in private data analysis.
method Introducing differential conformal prediction and developing Differentially Private Conformal Prediction (DPCP).
result DPCP produces tighter prediction sets than existing private split conformal approaches.