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

1122 · Oct 201919922001200920172026
27 results for prediction-only

We are concerned with modeling the strength of links in networks by taking into account how often those links are used. Link usage is a strong indicator of how closely two nodes are related, but existing network models in Bayesian Statistics and Machine Learning are able to predict only wether a link exists at all. As …

2014-02-18abs ↗pdf ↗

Quantile TD learning outperforms classical TD learning for value estimation.

problem Temporal-difference learning in reinforcement learning.
method Quantile Temporal-Difference Learning (QTD) for policy evaluation.
result QTD offers superior performance to classical TD learning, even in tabular settings.

In safety-critical applications a probabilistic model is usually required to be calibrated, i.e., to capture the uncertainty of its predictions accurately. In multi-class classification, calibration of the most confident predictions only is often not sufficient. We propose and study calibration measures for multi-class…

2019-10-24abs ↗pdf ↗

This paper explores sequential modelling of polyphonic music with deep neural networks. While recent breakthroughs have focussed on network architecture, we demonstrate that the representation of the sequence can make an equally significant contribution to the performance of the model as measured by validation set loss…

2019-11-26abs ↗pdf ↗

Proofs show finite subgroups of homeomorphism groups are almost nilpotent.

problem Finite subgroups of homeomorphism groups of compact topological manifolds.
method Finite group theoretic results provide a general strategy for proving Jordan-type theorems.
result Proof of the revised Ghys conjecture about nilpotent normal subgroups.

We are now witnessing the increasing availability of event stream data, i.e., a sequence of events with each event typically being denoted by the time it occurs and its mark information (e.g., event type). A fundamental problem is to model and predict such kind of marked temporal dynamics, i.e., when the next event wil…

2017-01-14abs ↗pdf ↗

By design, discriminatively trained neural network classifiers produce reliable predictions only for in-distribution samples. For their real-world deployments, detecting out-of-distribution (OOD) samples is essential. Assuming OOD to be outside the closed boundary of in-distribution, typical neural classifiers do not c…

2019-10-09abs ↗pdf ↗

Efficiently trains deep Gaussian processes with sparse approximations.

problem High computational complexity in training and inference for DGP models.
method Tensor Markov Gaussian Processes (TMGP) and hierarchical expansion to create DTMGP model.
result DTMGP model achieves superior computational efficiency compared to existing DGP models.

Paper proposes faster adaptation to distribution shifts in online settings.

problem Violation of exchangeability assumption in evolving data environments.
method Online conformal inference with retrospective adjustment.
result Faster adaptation to distributional shifts demonstrated through numerical studies.

A framework to explain decoder-only sequence classification models using intermediate predictions.

problem Explaining predictions of decoder-only sequence classification models.
method Progressive Inference framework with Single Pass-Progressive Inference and Multi Pass-Progressive Inference methods.
result Significantly better attributions compared to prior work on text classification tasks.

BART is extended to handle various response variables.

problem Modeling nonlinear regression functions for diverse response types.
method Generalized Bayesian Additive Regression Trees (GBART) for exponential family distributions.
result The posterior concentrates at a minimax rate for certain response distributions.

Bayesian optimization of antibodies learns from immune system evolution.

problem Efficiently optimizing antibody sequences in a large space of possibilities.
method Bayesian optimization guided by a generative model of evolving antibody sequences.
result CloneBO optimizes antibodies more efficiently than previous methods.

This study tackles mutual fund portfolio prediction, focusing on novel items.

problem Predicting novel items in mutual fund portfolios is challenging and less explored.
method Created a comprehensive benchmark dataset and evaluated various recommender system models.
result Autoencoder-based approaches outperform state-of-the-art models in predicting novel items.

This work approximates full conformal prediction for neural networks without sample splitting.

problem Uncertainty quantification for neural network regression models.
method Approximating full conformal prediction using Gauss-Newton influence for post-hoc uncertainty estimation.
result Locally-adaptive and often tighter prediction intervals compared to split-CP.

UCSL combines clustering with supervised learning to discover interpretable subtypes.

problem Discovering interpretable subtypes in datasets relevant to supervised tasks.
method UCSL (Unsupervised Clustering driven by Supervised Learning) framework integrating clustering and supervised learning.
result UCSL achieves +1.9 points in balanced accuracy for psychiatric diseases clustering.

This paper tackles graph translation challenges by predicting both node and edge attributes simultaneously.

problem Challenges in predicting both node and edge attributes in graph translation, especially in interactive, iterative, and asynchronous processes.
method Developed a novel framework integrating both node and edge translations seamlessly, using spectral graph regularization to maintain consistency.
result Demonstrated the effectiveness of the proposed method on both synthetic and real-world application data.

We consider the problem of predicting the next observation given a sequence of past observations, and consider the extent to which accurate prediction requires complex algorithms that explicitly leverage long-range dependencies. Perhaps surprisingly, our positive results show that for a broad class of sequences, there …

2016-12-08abs ↗pdf ↗

This research improves financial market predictions using LSTM networks.

problem Accurate real-time forecasting of financial time series.
method Sequentially trained many-to-one LSTMs with adaptive training epochs.
result Our approach maintains superior accuracy as predictions are made further in the future.

Meta-learning framework for few-shot one-class classification using order-equivariant networks.

problem Few labeled examples for positive class in one-class classification tasks.
method Order-equivariant networks for meta-learning a binary classifier conditioned on positive examples.
result Meta-learning framework outperforms baselines on unseen synthetic streams.