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,742 papers · 148 categories

Trend · papers per month

127253380506 · Jun 202019922001200920172026
48 results for predictive MSE

Deep nets trained with MSE loss exhibit Neural Collapse, collapsing features and classifiers to class means.

problem Understanding Neural Collapse in MSE-trained deep nets.
method Developed a new MSE loss decomposition and introduced the central path concept.
result Exact dynamics of Neural Collapse along the central path can be predicted.

This paper considers the quantification of the prediction performance in Gaussian process regression. The standard approach is to base the prediction error bars on the theoretical predictive variance, which is a lower bound on the mean square-error (MSE). This approach, however, does not take into account that the stat…

2016-06-13abs ↗pdf ↗

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.

Bagging can significantly improve the generalization performance of unstable machine learning algorithms such as trees or neural networks. Though bagging is now widely used in practice and many empirical studies have explored its behavior, we still know little about the theoretical properties of bagged predictions. In …

2019-08-07abs ↗pdf ↗

Paper proposes HIDAM model to improve MSE default risk assessment using heterogeneous information networks.

problem Default risk assessment for MSEs due to lack of credit information and diverse financial activities.
method HIDAM model incorporating heterogeneous information networks with multi-typed nodes and links, extracting interactive information through meta-paths, and using a hierarchical attention mechanism.
result HIDAM model outperforms state-of-the-art competitors on real-world banking data.

SurvSurf predicts first hitting times for intermittent events without monotonic violations.

problem Predicting first hitting times for intermittent events with monotonicity guarantees.
method Partially monotonic neural network for sequential events, incorporating unobserved events.
result SurvSurf outperforms existing models in MSE and IBS metrics.

The paper analyzes convergence rates of Gaussian process approximations for scalable regression.

problem Characterizing convergence rates of Gaussian process approximations for scalable regression.
method Analysis of kernel functions and dataset-size nn for isotropic kernels like Matérn and squared-exponential.
result Upper and lower bounds on predictive MSE and calibration metric convergence rates are derived.

Study evaluates uncertainty in BP estimation from PPG signals under domain shift.

problem Uncertainty quantification in healthcare, especially for cuffless BP estimation.
method Compared deep ensembles, Monte Carlo dropout, and various recalibration techniques.
result Deep ensembles provide stronger robustness under domain shift.

Study shows MSE with sigmoid can match SCE in classification tasks, especially with noisy data.

problem Inconsistent errors in neural network classification tasks.
method Introduced Output Reset algorithm to use MSE with sigmoid activation.
result MSE with sigmoid activation achieves comparable accuracy and convergence rates to Softmax Cross-Entropy, especially in noisy data scenarios.

SA-BCP combines long-term and local evidence for efficient, adaptive online prediction.

problem Balancing fast adaptation and stable coverage in online prediction.
method State-Adaptive Bayesian Conformal Prediction (SA-BCP) using gated convex combination of temporal inertia and spatial evidence.
result SA-BCP achieves at-or-above-nominal coverage with substantially sharper intervals compared to discounted Bayesian CP.

This article presents valuation of Treasury Bonds (T-Bonds) on Macedonian Stock Exchange (MSE) and empirical test of duration, modified duration and convexity of the T-bonds at MSE in order to determine sensitivity of bonds prices on interest rate changes. The main goal of this study is to determine how standard valuat…

2012-06-29abs ↗pdf ↗

Study sets a nontrivial upper limit on return forecasting accuracy.

problem Establishing a practical upper limit for return forecasting accuracy.
method Defined a coin-flip oracle model to theoretically outperform practical models and used its RextOOS2R^2_{ ext{OOS}} as an upper bound.
result Theoretical upper bound on RextOOS2R^2_{ ext{OOS}} is a quadratic function of directional accuracy.

New method improves model calibration by adjusting confidence based on prediction correctness.

problem Improving model confidence alignment with true class probabilities.
method Post-hoc calibration objective using transformed samples for training.
result Competitive calibration performance on in-distribution and out-of-distribution test sets.

This work justifies neural collapse under MSE loss and analyzes the optimization landscape.

problem Understanding neural collapse in deep neural networks under MSE loss.
method Global landscape analysis of vanilla nonconvex MSE loss.
result The only global minimizers are neural collapse solutions.

LeanML reduces machine learning project waste by estimating best performance without training models.

problem Avoidable wastes in machine learning projects.
method Lean design pattern based on mutual information and performance metrics.
result Estimating best performance without training models is faster and cheaper.

In this manuscript we propose two objective terms for neural image compression: a compression objective and a cycle loss. These terms are applied on the encoder output of an autoencoder and are used in combination with reconstruction losses. The compression objective encourages sparsity and low entropy in the activatio…

2019-05-24abs ↗pdf ↗

New estimators outperform maximum likelihood without hyper-parameter estimation.

problem Improving system identification performance without hyper-parameter estimation.
method Developed generalized Bayes and closed-form biased estimators using excess MSE.
result New estimators have comparable performance to empirical-Bayes-based regularized estimator.

Signature kernel scoring rule improves weather forecasting by capturing temporal and spatial dependencies.

problem Lack of suitable scoring rules for probabilistic weather forecasting.
method Reframe weather variables as continuous paths using iterated integrals (signature kernels) to capture temporal and spatial dependencies.
result Signature kernel scoring rule outperforms conventional methods in weather forecasting, especially for long-term forecasts.

Paper uses DFL to optimize portfolio risk and outperforms conventional methods.

problem Optimizing portfolio risk and return under uncertainty.
method Decision-focused learning (DFL) to derive global minimum variance portfolio (GMVP).
result DFL-based methods consistently deliver superior decision performance in portfolio optimization.

This paper solves hedging in incomplete markets using neural networks.

problem Hedging in incomplete markets with risk factor, illiquidity, and discrete transaction dates.
method Proposes a jump-diffusion model and uses RNN, LSTM, and Mogrifier-LSTM neural networks for hedging strategies.
result Mogrifier-LSTM is the fastest and most effective model for hedging.

NeuroMem-FHP framework estimates FHP parameters efficiently.

problem Estimating parameters of fractional Hawkes process (FHP) with long-range dependence.
method Developed LSTM and Transformer neural architectures to estimate FHP parameters directly from inter-arrival times.
result Transformer achieves highest estimation accuracy (MSE = 0.1634) compared to classical MLE (MSE = 2.8032).

Study compares neural and statistical models for Parkinson's disease progression from voice data.

problem Difficult statistical analysis of longitudinal voice biomarkers due to subject correlation, small cohorts, and varied disease trajectories.
method Evaluated Neural Mixed Effects (NME), Generalized Neural Network Mixed Models (GNMMs), and semi-parametric Generalized Additive Mixed Models (GAMMs).
result GAMMs achieve stronger predictive performance and retain interpretable smooth effects and subject-level structure.

Paper proposes a dual-level approach for multi-step forecasting of dynamical systems.

problem Accurate multi-step forecasting of time series systems for automatic control and optimization.
method Hybrid input forecasting using LSTM-STMs and physics-informed neural networks (PINNs).
result Hybrid models achieve higher log-likelihood and lower MSE compared to conventional methods.

MMformer improves forecasting of environmental time series data.

problem Accurately forecasting environmental change trends for policy-making.
method Meta-learning MTS model combining self-attention and adaptive transferable multi-head attention.
result MMformer outperforms other models in air quality and climate datasets, reducing prediction errors by 50% in MSE and 20% in MAE.

CAEL-MIPS learns embeddings to improve MIPS for better OPE in contextual bandits.

problem High variance in IPS weighting for OPE in large action spaces.
method Context-Action Embedding Learning (CAEL) for MIPS to minimize MSE.
result CAEL-MIPS outperforms baselines in MSE for OPE in contextual bandits.

The paper explains why estimating a history-dependent policy can reduce MSE in reinforcement learning.

problem Understanding why history-dependent policies can improve MSE in off-policy evaluation.
method The paper derives a bias-variance decomposition of MSE for various OPE estimators, showing how history-dependent policies can decrease variance and increase bias.
result History-dependent policies can decrease the variance of importance sampling estimators, leading to lower MSE.

New method improves deep neural network performance in regression tasks.

problem Improving generalization, robustness, and explainability of deep neural networks in regression.
method Developed a new Information Bottleneck approach using Cauchy-Schwarz divergence.
result Demonstrated superior performance on six real-world regression tasks.

The paper explores MAE as a loss function for DNN vector-to-vector regression, proving its advantages over MSE.

problem Improving loss function for deep neural network based vector-to-vector regression.
method Presenting performance bounds and new properties of MAE, deriving generalized upper bounds, and interpreting MAE as a Laplacian distribution.
result MAE is a more suitable loss function than MSE for DNN based vector-to-vector regression, especially when errors follow a Laplacian distribution.