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

155310465620 · Jun 202019922001200920172026
48 results for predictive representativity

Study counterfactuals in combinatorial choice using a representative agent model.

problem Analyzing decision-making from aggregated binary polytope data.
method Nonparametric approach based on a representative agent model, solving polynomial and mixed-integer convex programs.
result Developed a method for counterfactual prediction that works even under model misspecification.

This paper solves the open problem of computing Bayes optimal prediction for decision trees using a Markov chain Monte Carlo method.

problem Computing the Bayes optimal prediction for decision trees is infeasible due to an infeasible summation over all division patterns of a feature space.
method Solved the open problem using a Markov chain Monte Carlo method with adaptively tuned step size.
result Computed the Bayes optimal prediction for decision trees using a Markov chain Monte Carlo method.

Paper discusses optimal CP for second-order predictions.

problem How to incorporate second-order predictions into conformal prediction.
method Introduces Bernoulli prediction sets (BPS) for second-order predictions and applies conformal risk control for compromised validity.
result BPS provides the smallest prediction sets with conditional coverage.

In many graphs such as social networks, nodes have associated attributes representing their behavior. Predicting node attributes in such graphs is an important problem with applications in many domains like recommendation systems, privacy preservation, and targeted advertisement. Attributes values can be predicted by a…

2019-12-27abs ↗pdf ↗

Study reveals AI skin cancer classifiers underperform for darker skin phototypes, advocating for fairness auditing.

problem AI bias in dermatology, particularly for darker skin phototypes.
method Predictive Representativity (PR) framework, evaluating classifiers on HAM10000 and BOSQUE Test sets.
result Substantial performance disparities by skin phototype, highlighting AI bias.

With a growing interest in using non-representative samples to train prediction models for numerous outcomes it is necessary to account for the sampling design that gives rise to the data in order to assess the generalized predictive utility of a proposed prediction rule. After learning a prediction rule based on a non…

2017-11-13abs ↗pdf ↗

Predictive State Representations (PSRs) are an expressive class of models for controlled stochastic processes. PSRs represent state as a set of predictions of future observable events. Because PSRs are defined entirely in terms of observable data, statistically consistent estimates of PSR parameters can be learned effi…

2013-09-26abs ↗pdf ↗

Consumer Demand Response (DR) is an important research and industry problem, which seeks to categorize, predict and modify consumer's energy consumption. Unfortunately, traditional clustering methods have resulted in many hundreds of clusters, with a given consumer often associated with several clusters, making it diff…

2017-02-05abs ↗pdf ↗

We propose to represent a return model and risk model in a unified manner with deep learning, which is a representative model that can express a nonlinear relationship. Although deep learning performs quite well, it has significant disadvantages such as a lack of transparency and limitations to the interpretability of …

2018-10-01abs ↗pdf ↗

Predicting conversion rates (CVRs) in display advertising (e.g., predicting the proportion of users who purchase an item (i.e., a conversion) after its corresponding ad is clicked) is important when measuring the effects of ads shown to users and to understanding the interests of the users. There is generally a time de…

2018-02-01abs ↗pdf ↗

New method predicts spatial events like hurricanes and earthquakes with uncertainty.

problem Quantifying uncertainty in natural hazard predictions.
method Representing spatial point clouds as empirical measures, constraining prediction sets to spatial data manifold, using Wasserstein distance.
result Achieves near-nominal coverage and lower energy/manifold distances compared to baselines.

The paper develops a method to discover causal relations and predict material laws with uncertainty quantification.

problem Discovering causal relations and predicting material laws with uncertainty in civil engineering applications.
method The paper develops a causal discovery algorithm to infer causal relations among time-history data. It uses a deep neural network with dropout layers for uncertainty quantification and propagates predictions through a causal graph.
result The method accurately predicts material laws and quantifies uncertainty, as demonstrated in two numerical examples.

New approach models computer network activity as mixtures of sources.

problem Malicious activity detection in computer networks using standard algorithms is ineffective.
method Source separation approach to model short-term dynamics of computer network activity.
result Qualitative and quantitative experiments validate the approach.

Study how models represent features in naturalistic learning problems.

problem Understanding which features models use and ignore in naturalistic tasks.
method Synthetic datasets with controlled task-relevance of features, training models to recognize both easy and hard features.
result Models preferentially represent task-relevant features and suppress task-irrelevant ones over training.

NETpred uses graph models to predict multiple market indices.

problem Predicting multiple market indices with high accuracy.
method NETpred constructs a heterogeneous graph of related indices and stocks, selects representative nodes, and uses semi-supervised learning to predict index labels.
result NETpred outperforms state-of-the-art methods by 3%-5% in F-score on various datasets.

New methods improve prediction regions for high-dimensional data.

problem Creating effective prediction regions for high-dimensional data.
method CD-split and HPD-split methods that combine split method and data-driven partition.
result CD-split and HPD-split converge to oracle highest predictive density set and satisfy local and asymptotic conditional validity.

Binary classification models get more efficient predictive probabilities.

problem Computing predictive probabilities in Bayesian probit models is computationally challenging.
method Use of expectation propagation (EP) to find a closed-form expression for predictive probabilities.
result Closed-form predictive probabilities improve over existing methods.

New method models aptamer libraries as Boltzmann-weighted graph ensembles for better affinity predictions.

problem Anomalous candidates in SELEX datasets obscure true aptamer-ligand affinity.
method Boltzmann graph ensemble embeddings for thermodynamically parameterized exponential-family random graphs.
result Proposed embedding enables robust community detection and subgraph-level explanations for aptamer ligand affinity.

Develops a neural framework for probabilistic forecasting of dynamical systems.

problem Uncertainty quantification in dynamical systems using trajectory-oriented approaches.
method D2D neural probabilistic forecasting framework using kernel mean embeddings and mixture density networks.
result The D2D model captures distributional evolution in chaotic systems and produces skillful probabilistic forecasts.

In this paper we use artificial neural networks to predict and help compute the values of certain knot invariants. In particular, we show that neural networks are able to predict when a knot is quasipositive with a high degree of accuracy. Given a knot with unknown quasipositivity we use these predictions to identify b…

2016-10-18abs ↗pdf ↗

Professional software developers spend a significant amount of time fixing builds, but this has received little attention as a problem in automatic program repair. We present a new deep learning architecture, called Graph2Diff, for automatically localizing and fixing build errors. We represent source code, build config…

2019-11-04abs ↗pdf ↗

The paper explores how ReLU DNNs can represent MPC policies and vice versa.

problem Representing MPC policies as ReLU DNNs and vice versa.
method Developed an approximate method for identifying input-space in ReLU nets resulting in PWA functions over polyhedral regions. Studied inverse multiparametric linear or quadratic programs for reconstruction of constraints and cost functions given a PWA function.
result Identification and representation of MPC policies as ReLU DNNs and vice versa.

Unified framework predicts S&P500 index direction using transfer learning and causal graph.

problem Predicting the movement of financial indices like S&P500.
method Transfer learning, causal graph, multidisciplinary knowledge, VAE network.
result 74.3% accuracy, 67% F1-score, 0.42 Matthew correlation on 12 years test period.

Bayesian search optimizes exploration of feasible solutions under expensive constraints.

problem Identifying feasible solutions in computationally expensive constraint spaces.
method Bayesian models with an acquisition function for efficient exploration and exploitation.
result The proposed acquisition function improves the prediction of feasibility.

In this paper we formulate a regression problem to predict realized volatility by using option price data and enhance VIX-styled volatility indices' predictability and liquidity. We test algorithms including regularized regression and machine learning methods such as Feedforward Neural Networks (FNN) on S&P 500 Index a…

2019-09-22abs ↗pdf ↗

GRU-PFG model extracts inter-stock correlations from stock factors using graph neural networks.

problem Limited effectiveness of models relying solely on stock factors for capturing stock correlations.
method Project stock factors into a graph and use graph neural networks to extract inter-stock correlations.
result Achieves better prediction results than models relying solely on stock factors and comparable to second category models.

New findings show second-order scoring rules can't accurately represent epistemic uncertainty.

problem Lack of epistemic uncertainty representation in second-order learners.
method Generalised second-order scoring rules introduced to prove theoretical limitations.
result No loss function incentivizes second-order learners to accurately represent epistemic uncertainty.

In this thesis we present the novel semi-supervised network-based algorithm P-Net, which is able to rank and classify patients with respect to a specific phenotype or clinical outcome under study. The peculiar and innovative characteristic of this method is that it builds a network of samples/patients, where the nodes …

2017-02-04abs ↗pdf ↗

Graph-based ML improves defect prediction in software development.

problem Challenges in predicting defect-prone changes in complex software development.
method Building contribution graphs from developers and source files, using graph-based ML for defect prediction.
result Graph-based ML leads to significantly better defect prediction (F1 score up to 77.55%, MCC up to 53.16%).

The majority of cancer treatments end in failure due to Intra-Tumor Heterogeneity (ITH). ITH in cancer is represented by clonal evolution where different sub-clones compete with each other for resources under conditions of Darwinian natural selection. Predicting the growth of these sub-clones within a tumour is among t…

2019-11-28abs ↗pdf ↗

The accurate and interpretable prediction of future events in time-series data often requires the capturing of representative patterns (or referred to as states) underpinning the observed data. To this end, most existing studies focus on the representation and recognition of states, but ignore the changing transitional…

2019-05-10abs ↗pdf ↗

Most speech recognition tasks pertain to mapping words across two modalities: acoustic and orthographic. In this work, we suggest learning encoders that map variable-length, acoustic or phonetic, sequences that represent words into fixed-dimensional vectors in a shared latent space; such that the distance between two w…

2019-08-01abs ↗pdf ↗

Motivation: Understanding functions of proteins in specific human tissues is essential for insights into disease diagnostics and therapeutics, yet prediction of tissue-specific cellular function remains a critical challenge for biomedicine. Results: Here we present OhmNet, a hierarchy-aware unsupervised node feature le…

2017-07-14abs ↗pdf ↗

Separating the short jobs from the long is a known technique to improve scheduling performance. In this paper we describe a method we developed for accurately predicting the runtimes classes of the jobs to enable this separation. Our method uses the fact that the runtimes can be represented as a mixture of overlapping …

2016-05-02abs ↗pdf ↗

The paper presents a new method to represent directed graphs using pseudo-Riemannian manifolds.

problem Representing directed graphs in a compact and meaningful way.
method Combines pseudo-Riemannian metric structure, non-trivial global topology, and a unique likelihood function.
result Low-dimensional cylindrical Minkowski and anti-de Sitter spacetimes produce equal or better graph representations than curved Riemannian manifolds.

A new model predicts spatio-temporal data using adaptive decision trees and point processes.

problem Predicting spatio-temporal data with real-life applications.
method Hawkes process, adaptive decision tree, joint optimization algorithm.
result Significant improvement in predictions compared to standard methods.