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.

168,695 papers · 148 categories

Trend · papers per month

170341511681 · Jun 202019922001200920172026
48 results for Mean Prediction

Paper predicts high-frequency futures return directions using mean-uncertainty methods.

problem Data imbalance in short-term price movements of futures markets.
method Employed mean-uncertainty logistic regression and support vector machines under sublinear expectation framework.
result Mean-uncertainty approaches outperform conventional methods in classification metrics and average returns.

Integrates prediction models into portfolio optimization for better asset allocation.

problem Traditional portfolio optimization ignores prediction models, leading to suboptimal decisions.
method Developed a framework that combines regression prediction with mean-variance optimization, providing analytical solutions and neural-network-based optimization for inequality constraints.
result Demonstrated through simulations that integrating prediction models improves portfolio performance.

The paper proposes a method to produce well-calibrated predictions in regression tasks using maximum mean discrepancy.

problem The need for accurate uncertainty quantification in machine learning predictions.
method The method uses maximum mean discrepancy to minimize the kernel embedding measure and calibrate predictions.
result The method produces well-calibrated and sharp prediction intervals, outperforming state-of-the-art methods.

Regularization helps resolve ambiguity in mean-variance models, improving predictive uncertainty quantification.

problem Signal-to-noise ambiguity in overparameterized mean-variance models.
method Statistical field theory framework to explain phase transition.
result Regularization reduces variability and improves predictive uncertainty quantification.

MAGMA uses a common mean process to improve multi-step-ahead time series forecasting.

problem Improving multiple-step-ahead predictions for time series data.
method Proposes a novel multi-task Gaussian process framework with a common mean process for sharing information across tasks.
result Significantly improves predictive performances, even far from observations, and reduces computational complexity.

Improved stock volume prediction using Kalman Filters with various hidden states.

problem Improving accuracy of intraday trading volume prediction.
method Extended Kalman Filter with various hidden states for different stocks, using cross-validation to determine optimal state number.
result Demonstrated improved accuracy through comparison experiments and numerical analysis.

New model optimizes portfolios over multiple periods using predictive control.

problem Optimizing multi-period portfolios with risk and variance objectives.
method Model Predictive Control with Mean-Variance and Risk Parity.
result 30x faster and more robust solutions compared to single period models.

FastMuyGPs speeds up GP predictions for large datasets.

problem High cost of Gaussian process predictions for large data.
method Combines cross-validation, batching, nearest neighbors sparsification, and precomputation.
result Superior accuracy and competitive runtime compared to other methods.

GBMixed boosts mixed models for clustered data, estimating mean and variance flexibly.

problem Flexible estimation of mean and variance components in clustered data.
method Gradient Boosting framework for linear mixed models with likelihood-based gradients.
result GBMixed accurately recovers complex nonlinear fixed effects and covariances.

Bayes-assisted confidence sequences improve efficiency for bounded means.

problem Efficient uncertainty quantification for bounded IID means without parametric assumptions.
method Bayesian working predictive model selects adaptive martingale updates maximizing predictive log-growth.
result Asymptotically log-optimal performance with informative priors reducing width and sampling effort.

Optimal stock price prediction model using recurrent neural networks with RMSprop optimizer.

problem Stock price prediction using neural networks.
method Comparison of fully connected, convolutional, and recurrent architectures; inclusion of three optimization techniques.
result Single layer recurrent neural network with RMSprop optimizer produces optimal results with validation and test MAE of 0.0150 and 0.0148 respectively.

This study investigates how Decision-Focused Learning improves stock return predictions for better portfolio optimization.

problem The challenge of precise expected returns estimation in mean-variance optimization.
method Investigates Decision-Focused Learning (DFL) to adjust stock return prediction models for MVO.
result DFL tilts prediction errors by the inverse covariance matrix, leading to systematic prediction biases in portfolio optimization.

Study compares machine learning algorithms for predicting SST in the Great Barrier Reef.

problem Predicting sea surface temperature in the Great Barrier Reef region.
method Ridge regression, LASSO, Random Forest, and Extreme Gradient Boosting (XGBoost) algorithms were evaluated.
result XGBoost significantly outperforms other algorithms in terms of predictive accuracy and Kullback-Leibler Divergence.

Tests assess if predictions are prudent by comparing observations and predictions.

problem Assessing the prudence of predictions in samples of observations and predictions.
method Bootstrap and normal approximation algorithms for testing unweighted and weighted means, accounting for randomness.
result Tests reveal whether predictions are prudent by showing significantly negative mean differences.

Bayesian method predicts asset returns for better portfolio optimization.

problem Uncertainty in financial markets makes traditional portfolio optimization methods unreliable.
method Bayesian predictive synthesis (BPS) combined with dynamic linear models.
result Predicted distribution information improves portfolio performance.

JSRT improves regression tree performance by incorporating global node information.

problem Regression tree performance relies on local node means, ignoring global node information.
method Proposes JSRT by integrating global mean information from different nodes.
result Demonstrates superior performance and efficiency compared to other regression tree methods.

Enhances deep neural networks with fixed-mean Gaussian processes for uncertainty estimation.

problem Post-hoc uncertainty estimation of pre-trained deep neural networks.
method Fixed-mean Gaussian processes with variational inference for efficient stochastic optimization.
result FMGP improves uncertainty estimation and computational efficiency compared to state-of-the-art methods.

New insights on active sequential prediction for mean estimation.

problem Active sequential prediction-powered mean estimation problem.
method Combining uncertainty-based suggestion with a constant probability, analyzing non-asymptotic bounds, and using no-regret learning.
result The optimal query probability is close to the constraint when using no-regret learning.

PAS improves estimation of multiple means using ML predictions and shrinkage.

problem Improving statistical estimates with limited gold-standard data and noisy ML predictions.
method Prediction-Powered Adaptive Shrinkage (PAS) that combines PPI with empirical Bayes shrinkage.
result PAS adapts to the reliability of ML predictions and outperforms traditional methods in large-scale applications.

Calibrated Prediction-Powered Inference improves semisupervised mean estimation by calibrating prediction scores.

problem Semisupervised mean estimation with a small labeled sample and a large unlabeled sample, and miscalibrated prediction models.
method Calibrated Prediction-Powered Inference (Calibeating) post-hoc calibrates the prediction score on the labeled sample before using it for semisupervised estimation.
result Calibrated Prediction-Powered Inference can improve the original score both as a predictor of the outcome and as a regression adjustment for semisupervised inference.

Paper provides statistical guarantees for GNNs in link prediction.

problem Link prediction accuracy in graph neural networks.
method Proposes a linear GNN architecture (LG-GNN) and derives statistical guarantees.
result LG-GNN produces consistent estimators for edge probabilities and has better detection of high-probability edges.

Method selects the best deep learner for time-series prediction using Bayesian networks.

problem Selecting the most effective deep learning model for time-series prediction.
method Bayesian network selects deep learners based on input variables and cluster training data.
result Threshold value determines which deep learners predict time-series data robustly.

This paper improves Gaussian process predictions by integrating prior knowledge.

problem Gaussian processes lack predictive power when prior information is ignored.
method Derive mean and covariance functions from previous data using weighted sums of basis functions.
result Integrating prior knowledge significantly increases look-ahead time and accuracy.

Gradient Boosted Mixed Models estimate mean and variance components for clustered data.

problem Limited flexibility in linear mixed models for complex settings.
method Gradient Boosting extended to mixed models with likelihood-based gradients and flexible base learners.
result Accurate recovery of variance components and improved predictive accuracy.

The study assesses low-rank approximations in Gaussian Process regression.

problem Improving the efficiency of Gaussian Process regression while maintaining accuracy.
method Analyzes two low-rank approximations: random Fourier features and Mercer expansion truncation, and bounds the divergence and error between exact and approximate models.
result Theoretical bounds on the divergence and error between exact and approximate Gaussian Process models are provided.

Gaussian Processes enhance financial forecasting by predicting mean-reverting time series with probability distributions.

problem Accurate long-term financial predictions with probability distributions.
method Functional and augmented data structures for Gaussian Processes.
result Gaussian Processes offer improved long-term predictions with probability distributions.

Proposes a new network for accurate predictions and uncertainty estimation.

problem Uncertainty estimation in regression predictions without sacrificing accuracy.
method Decoupled two-stage training process with custom loss function.
result Reduces prediction error by 23-34% while maintaining 95% PICP.

Improved neural network model for predicting latent budgets in compositional data.

problem Predicting response variables in compositional data with non-negativity constraints.
method LBA-NN, a feed forward neural network model that incorporates K-means clustering for interpretation.
result LBA-NN outperforms traditional LBA in prediction accuracy, specificity, recall, and mean square error.

Nonparametric modeling approaches show very promising results in the area of system identification and control. A naturally provided model confidence is highly relevant for system-theoretical considerations to provide guarantees for application scenarios. Gaussian process regression represents one approach which provid…

2018-11-16abs ↗pdf ↗

Paper predicts bearing degradation stages for pharmaceutical industry maintenance.

problem Predicting when to maintain specific parts of production machines.
method AutoEncoder-based k-means segmentation of high-frequency vibration data.
result Framework generates reliable predictions for bearing degradation stages.

Bayesian model predicts interest rates with short-term accuracy and long-term stability.

problem Improving short- and long-term prediction of time series with temporary non-stationary behavior.
method Time-varying autoregressive model with Bayesian regularization and MCMC inference.
result Model outperforms existing methods in both short and long-term predictions.

Paper improves Tm prediction of protein fragments using sparsity and probabilistic models.

problem Improving accuracy of melting temperature prediction for protein fragments.
method Promoting sparsity in pre-trained transformer models and adopting probabilistic frameworks.
result Mean absolute error of 0.23C for predicting melting temperature.

Researchers use estimated Kolmogorov complexity for better link prediction in graphs.

problem Improving link prediction accuracy in complex networks.
method Regularization based on an approximation of Kolmogorov complexity, which is differentiable and compatible with recent link prediction algorithms.
result The regularization method shows good performance on diverse real-world networks, but the success is likely due to an aggregation method rather than actual estimation of Kolmogorov complexity.