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

Trend · papers per month

136271407542 · Jun 202019922001200920172026
48 results for predictability decomposition

New method for uncertainty analysis in TabPFN, a state-of-the-art tabular transformer.

problem No method for uncertainty decomposition in TabPFN.
method Casted as a Bayesian predictive inference problem, derived variance estimators using predictive CLT.
result Fast to compute credible bands that target epistemic uncertainty and achieve near-nominal frequentist coverage.

This study proposes methods for multi-step-ahead stock price prediction using decomposition and neural networks.

problem Inaccurate one-step-ahead forecasting limits stock market decision-making.
method Two novel methods: DCT-MFRFNN and VMD-MFRFNN.
result VMD-MFRFNN outperforms other methods in multi-step-ahead stock price prediction.

This work introduces a bias-variance decomposition for proper scores, improving uncertainty estimation in predictive models.

problem Reliable uncertainty estimation for predictions in safety-critical applications, especially under domain drift.
method Developed a general bias-variance decomposition for proper scores, introducing the Bregman Information as the variance term.
result The decomposition provides novel formulations for different predictive tasks, including classification and model ensembles.

New method uses conformal prediction for time series forecasting, accounting for temporal correlation.

problem Uncertainty quantification in temporally correlated time series data.
method Time series decomposition with component-wise conformal prediction.
result The method provides customized prediction intervals for different temporal components.

A new decomposition explains over-parameterized models' counterintuitive behaviors.

problem Understanding predictive error in over-parameterized models.
method Introducing the Generalized Aliasing Decomposition (GAD) to explain predictive performance.
result The GAD decomposes predictive error into three parts: model insufficiency, data insufficiency, and generalized aliasing.

Proposes a method to predict responses from covariates over time.

problem Predicting responses from covariates with changing conditional distributions over time.
method Invariant Subspace Decomposition (ISD) framework that splits the conditional distribution into time-invariant and time-dependent components.
result The decomposition can be used for zero-shot and time-adaptation prediction tasks.

We propose the Relational Tucker3 (RT) decomposition for multi-relational link prediction in knowledge graphs. We show that many existing knowledge graph embedding models are special cases of the RT decomposition with certain predefined sparsity patterns in its components. In contrast to these prior models, RT decouple…

2019-02-03abs ↗pdf ↗

TATD predicts missing entries in time-evolving tensors by exploiting temporal dependency and sparsity.

problem Predict missing entries in time-evolving tensors with temporal dependency and sparsity issues.
method TATD (Time-Aware Tensor Decomposition) integrates temporal dependency and time-varying sparsity through a smoothing regularization with Gaussian kernel and alternating optimization.
result TATD achieves state-of-the-art accuracy for decomposing temporal tensors.

We discuss structured Schatten norms for tensor decomposition that includes two recently proposed norms ("overlapped" and "latent") for convex-optimization-based tensor decomposition, and connect tensor decomposition with wider literature on structured sparsity. Based on the properties of the structured Schatten norms,…

2013-03-26abs ↗pdf ↗

Paper decomposes C-index to analyze survival prediction model performance.

problem Evaluating the performance of survival prediction models.
method Decomposes C-index into two weighted quantities: ranking observed vs. other events and observed vs. censored cases.
result Deep learning models outperform classical models in ranking observed events, leading to better C-index stability.

A new method models financial returns by separating sign and magnitude, improving forecasting accuracy.

problem Capturing nonlinear predictability in financial return dynamics.
method Decomposes returns into sign and magnitude components, using a joint distribution model.
result Significantly outperforms traditional linear models in forecasting U.S. stock market returns.

NA0_0CT2^2 improves tensor regression predictions with 0\ell_0 regularization.

problem Improving tensor regression predictions with structural information.
method Noise-Augmented 0\ell_0 regularization on Tucker decomposition.
result Achieves exact 0\ell_0 regularization on core tensor in linear and generalized linear tensor regression.

New method quantifies redundant information using information bottleneck.

problem Quantifying redundant information among multiple sources.
method Formulated as an information bottleneck problem, termed redundancy bottleneck.
result Extracts information that best predicts the target without revealing source identity.

KEDformer improves long-term time series forecasting with seasonal-trend decomposition.

problem Accurate long-term predictions in energy, finance, and meteorology.
method Knowledge extraction-driven framework integrating seasonal-trend decomposition.
result KEDformer enhances model's ability to capture short-term and long-term patterns.

Every cusped, finite-volume hyperbolic three-manifold has a canonical decomposition into ideal polyhedra. We study the canonical decomposition of the hyperbolic manifold obtained by filling some (but not all) of the cusps with solid tori: in a broad range of cases, generic in an appropriate sense, this decomposition ca…

2008-05-09abs ↗pdf ↗

SurvFD and SurvSHAP-IQ provide interpretable survival models by analyzing feature interactions.

problem Non-additivity of hazard and survival functions limits standard additive explanation methods.
method SurvFD decomposes higher-order effects into time-dependent and time-independent components, extending Shapley interactions to time-indexed functions.
result SurvFD and SurvSHAP-IQ offer a new perspective on survival explanations, explicitly characterizing feature interactions.

In multi-label learning, each sample is associated with several labels. Existing works indicate that exploring correlations between labels improve the prediction performance. However, embedding the label correlations into the training process significantly increases the problem size. Moreover, the mapping of the label …

2011-03-01abs ↗pdf ↗

Generalizes bias-variance decomposition for Bregman divergences.

problem No specific problem stated; generalization of bias-variance for Bregman divergences.
method Provided a generalization of the bias-variance decomposition for Bregman divergences.
result A clear, standalone derivation of the bias-variance decomposition for Bregman divergences.

Paper decomposes risk into aleatoric and epistemic uncertainties and generates predictive uncertainty measures.

problem Unclear relationships between various predictive uncertainty measures in literature.
method Bayesian estimation to decompose risk into aleatoric and epistemic uncertainties, generating different predictive uncertainty measures.
result Experimental validation confirms usefulness of derived predictive uncertainty measures for detecting out-of-distribution and misclassified instances.

This work introduces a method to decompose uncertainty in in-context learning for large language models.

problem Understanding the sources of uncertainty in in-context learning for large language models.
method Variational uncertainty decomposition framework without sampling from latent parameter posterior.
result Quantitative and qualitative validation of decomposed epistemic and aleatoric uncertainties.

The paper studies and mitigates accuracy disparity in regression models.

problem Accuracy disparity between different demographic subgroups in high-stakes domains.
method Error decomposition theorem and distribution alignment algorithm.
result The proposed algorithm effectively mitigates accuracy disparity while maintaining predictive power.

The paper studies batch decompositions of random datasets with probabilistic similarity constraints.

problem Understanding how to optimally split large datasets into batches for better model learning.
method Assumes independent data points from a space, defines similarity, and uses probabilistic and martingale methods to find bounds on batch sizes.
result Demonstrates an inherent tradeoff between relaxing similarity constraints and batch size, and provides bounds for maximum similarity subsets.

Model predicts short-term Amazon rainforest fires with high accuracy.

problem Accurate short-term forecasting of Amazon rainforest fires is challenging.
method Used Seasonal and Trend decomposition based on Loess combined with multi-month-ahead load forecasting algorithms.
result Proposed decomposition-ensemble models provide more accurate forecasts than other models.

In this paper, we study the possibility of inferring early warning indicators (EWIs) for periods of extreme bitcoin price volatility using features obtained from Bitcoin daily transaction graphs. We infer the low-dimensional representations of transaction graphs in the time period from 2012 to 2017 using Bitcoin blockc…

2018-09-19abs ↗pdf ↗

The paper proposes a method to balance fairness and prediction accuracy by adjusting data representations.

problem Machine learning models can inherit and amplify historical biases, leading to unfair outcomes.
method The paper uses subspace decomposition and influence analysis to control the fairness-utility trade-off.
result The method effectively improves fairness while preserving predictive performance.

Ensembles of neural networks have been shown to give better performance than single networks, both in terms of predictions and uncertainty estimation. Additionally, ensembles allow the uncertainty to be decomposed into aleatoric (data) and epistemic (model) components, giving a more complete picture of the predictive u…

2020-02-26abs ↗pdf ↗

Machine learning can improve 2SLS first stage predictions, but nonlinear methods often introduce bias.

problem Improving the first stage of 2SLS using machine learning.
method Decomposed bias into three components, investigated through simulation.
result Nonlinear machine learning methods can introduce substantial bias in second-stage estimates.

We propose a novel sparse tensor decomposition method, namely Tensor Truncated Power (TTP) method, that incorporates variable selection into the estimation of decomposition components. The sparsity is achieved via an efficient truncation step embedded in the tensor power iteration. Our method applies to a broad family …

2015-02-05abs ↗pdf ↗

Marginal MAP inference involves making MAP predictions in systems defined with latent variables or missing information. It is significantly more difficult than pure marginalization and MAP tasks, for which a large class of efficient and convergent variational algorithms, such as dual decomposition, exist. In this work,…

2015-11-09abs ↗pdf ↗

We provide a unified view of additive explanations for dependent inputs.

problem Challenges in obtaining a tractable representation and estimating the decomposition for dependent inputs.
method Combining Hilbert space methods with generalized functional ANOVA, we build an explicit decomposition Riesz Basis.
result Proposed a simple yet powerful algorithm to estimate the decomposition from data.

Enhances stock movement prediction using Higher Order Transformers for multimodal time-series data.

problem Predicting stock movements in financial markets with complex dynamics.
method Introduced Higher Order Transformers, extending self-attention and transformer architecture to capture complex market dynamics. Employed low-rank tensor decomposition and kernel attention to manage computational complexity. Integrated technical and fundamental analysis from historical prices and tweets.
result Demonstrated effectiveness of the method on the Stocknet dataset, improving stock movement prediction.