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

92183275366 · Jun 202019922001200920172026
48 results for Probability Output

RePULSe improves language model alignment by reducing undesired outputs without sacrificing overall performance.

problem Aligning language models with human preferences while minimizing undesired outputs.
method Integrates probabilistic inference into RL training to reduce undesired outputs.
result RePULSe achieves a better balance between expected reward and undesired output probability.

Proposes a deep ordinal regression framework using optimal transport loss and unimodal output probabilities.

problem Lack of unimodal output probabilities in recent ordinal regression models.
method Introduces a deep learning framework based on optimal transport loss and unimodal output distribution, inspired by the Proportional Odds model.
result Demonstrates improved performance and unimodal output probabilities on real-world datasets compared to existing methods.

We present a novel approach for learning an HMM whose outputs are distributed according to a parametric family. This is done by {\em decoupling} the learning task into two steps: first estimating the output parameters, and then estimating the hidden states transition probabilities. The first step is accomplished by fit…

2013-02-25abs ↗pdf ↗

Transformer with denoising diffusion improves probabilistic density estimation.

problem Estimating non-Gaussian and multimodal probability distributions for regression problems.
method Training a denoising diffusion head on top of a Transformer model.
result The model provides reasonable probability density estimation for high-dimensional inputs.

We study cross-country GDP losses due to financial crises in terms of frequency (number of loss events per period) and severity (loss per occurrence). We perform the Loss Distribution Approach (LDA) to estimate a multi-country aggregate GDP loss probability density function and the percentiles associated to extreme eve…

2012-01-04abs ↗pdf ↗

A new method calculates optimal decisions from classifier outputs, improving predictions in drug discovery.

problem Finding optimal decisions from classifier outputs in fields like medicine.
method Develops a transducer that calculates probabilities from classifier outputs, enabling expected-utility maximization.
result Improves prediction accuracy in drug discovery problems, sometimes close to theoretical maximum.

Research reveals simplicity bias in random logistic map, impacting data analysis and forecasting.

problem Simplicity bias in dynamical systems and its impact on data analysis and prediction.
method Examined the logistic map and random logistic map, focusing on simplicity bias and noise effects.
result Simplicity bias is observable in the random logistic map, persisting even with small noise levels.

A novel post-hoc calibration method reduces neural network calibration errors.

problem Neural networks produce poorly calibrated probabilities, leading to underconfidence and overconfidence.
method Probability bounding (PB) via box-constrained softmax (BCSoftmax) function.
result Consistently reduces calibration errors on four real-world datasets.

In this chapter we take a look at the universal approximation question for stochastic feedforward neural networks. In contrast to deterministic networks, which represent mappings from a set of inputs to a set of outputs, stochastic networks represent mappings from a set of inputs to a set of probability distributions o…

2019-10-22abs ↗pdf ↗

Paper proposes a new ML approach to estimate g-vulnerability without estimating conditional probabilities.

problem Estimating information leakage in black-box systems with large output domains.
method Developed a novel ML-based approach to estimate g-vulnerability without estimating conditional probabilities.
result The proposed method outperforms frequentist approach when dealing with large output domains.

Probabilistic classifiers output a probability distribution on target classes rather than just a class prediction. Besides providing a clear separation of prediction and decision making, the main advantage of probabilistic models is their ability to represent uncertainty about predictions. In safety-critical applicatio…

2019-02-19abs ↗pdf ↗

Sequences have become first class citizens in supervised learning thanks to the resurgence of recurrent neural networks. Many complex tasks that require mapping from or to a sequence of observations can now be formulated with the sequence-to-sequence (seq2seq) framework which employs the chain rule to efficiently repre…

2015-11-19abs ↗pdf ↗

Develops geometric framework for uncertainty-aware multi-class classification.

problem Silent failure of AI models when uncertain, especially in multi-class settings.
method Geometric framework treating probability vectors as points on the (c1)(c-1)-dimensional probability simplex, using Fisher--Rao metric for calibration and uncertainty quantification.
result Empirical validation shows 72.5% of errors captured while deferring 34.5% of ambiguous predictions, reducing automated decision error rates from 16.8% to 6.9%.

Unified framework for output analysis using Monte Carlo sampling.

problem Accurately assess the quality of estimated values in predictive models.
method Unified output analysis framework through Monte Carlo sampling, leveraging fast iterative bootstrap sampling and higher-order influence functions.
result Clear advantage in building more robust confidence intervals with higher coverage probability.

Study shows limitations and possibilities of learning quantum circuit output distributions.

problem Learnability of output distributions of local quantum circuits.
method Investigated within two oracle models: statistical query model and direct sample access model.
result Output distributions of super-logarithmic depth Clifford circuits are not efficiently learnable in the statistical query model.

Improves confidence calibration in neural networks by smoothing labels based on class similarity.

problem Improving confidence calibration in deep neural networks for safety-critical applications.
method Proposes a novel label smoothing technique where label values are based on similarities with the reference class, using different similarity measurements.
result Consistently outperforms state-of-the-art calibration techniques on various datasets and network architectures.

A method for consensus prediction from probabilistic classifier outputs.

problem Combining probabilistic classifier outputs without prior information.
method Iteratively updating predictions based on classifier diversity and convergence.
result Consensus predictions converge to a decision based on classifier outputs' correspondence.

Hierarchical nucleation patterns emerge in deep neural network layers.

problem Understanding the generation of meaningful representations in deep neural networks.
method Analysis of the probability density of ImageNet dataset across hidden layers.
result Density peaks in subsequent layers mirror the semantic hierarchy of concepts, resembling nucleation process.

Proposes h-calibration for improving miscalibrated probability outputs of neural networks.

problem Improving reliability of probability outputs from neural networks.
method Probabilistic learning framework for calibration, including a simple yet effective post-hoc algorithm.
result Significantly better performance than traditional methods, validated by experiments.

Learning to predict multi-label outputs is challenging, but in many problems there is a natural metric on the outputs that can be used to improve predictions. In this paper we develop a loss function for multi-label learning, based on the Wasserstein distance. The Wasserstein distance provides a natural notion of dissi…

2015-06-17abs ↗pdf ↗

One of the central themes in the classification task is the estimation of class posterior probability at a new point x\bf{x}. The vast majority of classifiers output a score for x\bf{x}, which is monotonically related to the posterior probability via an unknown relationship. There are many attempts in the literature …

2019-09-12abs ↗pdf ↗

JES optimizes expensive functions by considering joint entropy over input and output spaces.

problem Optimizing expensive functions with limited evaluations.
method Joint Entropy Search (JES) considers joint entropy over input and output spaces.
result JES outperforms other information-theoretic methods in Bayesian optimization.

In this paper we consider the problem of finding stable maxima of expensive (to evaluate) functions. We are motivated by the optimisation of physical and industrial processes where, for some input ranges, small and unavoidable variations in inputs lead to unacceptably large variation in outputs. Our approach uses multi…

2019-02-21abs ↗pdf ↗

New method uses machine learning to estimate sensitivity without binning.

problem Estimating sensitivity of high-dimensional data sets without binning.
method Combines machine-learning classification with likelihood-based inference tests using Kernel Density Estimators.
result Significance estimation is not sensitive to non-smooth probability distributions.

In most classification tasks there are observations that are ambiguous and therefore difficult to correctly label. Set-valued classifiers output sets of plausible labels rather than a single label, thereby giving a more appropriate and informative treatment to the labeling of ambiguous instances. We introduce a framewo…

2016-09-02abs ↗pdf ↗

New method calibrates neural network predictions for better reliability.

problem Improper probability estimates from deep networks leading to unreliable predictions.
method Proposes a constrained optimization approach for a monotonic calibration map.
result Achieves state-of-the-art performance across various datasets and models.

Sig-PCA integrates model outputs and observations to correct model biases.

problem Improving model accuracy and reliability by correcting biases and numerical approximations.
method Sig-PCA framework that combines summary statistics from model outputs with localized observations via a neural network.
result Corrects model outputs to align closely with observational data, preserving essential statistical information.

Convolutional Bayesian filtering generalizes state estimation by incorporating inequality conditions.

problem Standard Bayesian filtering assumes exact conditional probabilities, limiting its applicability.
method Introducing inequality conditions transforms conditional probabilities into convolutional forms, expanding the filtering framework.
result Convolutional Bayesian filtering encompasses standard Bayesian filtering and allows for more nuanced model consideration.

Generative source separation methods such as non-negative matrix factorization (NMF) or auto-encoders, rely on the assumption of an output probability density. Generative Adversarial Networks (GANs) can learn data distributions without needing a parametric assumption on the output density. We show on a speech source se…

2017-10-30abs ↗pdf ↗

We introduce a novel conditional density estimation model termed the conditional density operator (CDO). It naturally captures multivariate, multimodal output densities and shows performance that is competitive with recent neural conditional density models and Gaussian processes. The proposed model is based on a novel …

2019-05-27abs ↗pdf ↗

We investigate a multi-household DSGE model in which past aggregate consumption impacts the confidence, and therefore consumption propensity, of individual households. We find that such a minimal setup is extremely rich, and leads to a variety of realistic output dynamics: high output with no crises; high output with i…

2019-07-17abs ↗pdf ↗

KCal calibrates deep networks by embedding logits in a metric space.

problem Overconfident predictions from DNNs, especially in high-risk applications.
method KCal learns a metric space on the penultimate-layer latent embedding and generates predictions using kernel density estimates.
result KCal provides a provable full calibration guarantee and consistently outperforms baselines.

We consider a setting, where the output of a linear dynamical system (LDS) is, with an unknown but fixed probability, replaced by noise. There, we present a robust method for the prediction of the outputs of the LDS and identification of the samples of noise, and prove guarantees on its statistical performance. One app…

2018-08-03abs ↗pdf ↗

Paper improves generalization bounds for structured output prediction problems.

problem Large label sets in structured output prediction problems.
method Developed novel high-probability bounds and generalization bounds in expectation.
result Significantly improved generalization bounds with logarithmic dependency on label set size.

A key prerequisite to optimal reasoning under uncertainty in intelligent systems is to start with good class probability estimates. This paper improves on the current best probability estimation trees (Bagged-PETs) and also presents a new ensemble-based algorithm (MOB-ESP). Comparisons are made using several benchmark …

2012-07-11abs ↗pdf ↗

Bayesian method for estimating inputs leading to specific probability outputs.

problem Estimating inputs for specific probability outputs of uncertain functions.
method Bayesian strategy using Gaussian process modeling and SUR principle.
result Surpassed performance of existing methods through numerical experiments.