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

71142212283 · Jun 202019922001200920172026
48 results for Sequence Likelihood Calibration

Noise titration benchmarks time series forecasting models rigorously.

problem Evaluation of time series forecasting models is often flawed due to lack of interventionist methods.
method Interventionist benchmarking using Gaussian noise titration of dynamical systems.
result Fern model outperforms state-of-the-art models in non-stationary conditions.

In this paper we study the probabilistic properties of the posteriors in a speech recognition system that uses a deep neural network (DNN) for acoustic modeling. We do this by reducing Kaldi's DNN shared pdf-id posteriors to phone likelihoods, and using test set forced alignments to evaluate these using a calibration s…

2016-06-14abs ↗pdf ↗

This work improves neural network calibration using explicit regularization.

problem Improving predictive uncertainty in neural networks.
method Introducing a probabilistic calibration measure and exploring explicit regularization techniques.
result Explicit regularization improves log-likelihood and predictive uncertainty.

PEP improves deep network performance and calibration by perturbing optimal parameters.

problem Improving deep network performance and calibration.
method Parameter Ensembling by Perturbation (PEP) constructs an ensemble of parameter values as random perturbations of the optimal set, maximizing log-likelihood on validation data.
result PEP provides a small to substantial improvement in calibration and log-likelihood, and in some cases, classification accuracy.

X-CAL improves survival model calibration without sacrificing predictive power.

problem Improving the calibration of survival models to better match observed data.
method Explicit calibration (X-CAL) turns distributional calibration into a differentiable objective for survival modeling.
result X-CAL improves calibration metrics without significantly reducing predictive performance.

SMURF-THP improves Transformer Hawkes process models by providing uncertainty quantification.

problem Uncertainty quantification for Transformer Hawkes process predictions.
method Score matching for learning the score function of event arrival times.
result SMURF-THP outperforms likelihood-based methods in confidence calibration.

The paper develops ML algorithms for calibrating credit rating transition models for high and low default portfolios.

problem Calibration of credit rating transition models for high and low default portfolios.
method Developed Maximum likelihood (ML) algorithms, including Laplace approximation for high-default portfolios and particle filter with Gaussian process regression for low-default portfolios.
result Both algorithms produce accurate approximations of the likelihood function and ML estimates of model parameters.

Study online monotone density estimation with expert aggregation and log-optimal calibration.

problem Online monotone density estimation and log-optimal calibration.
method Proposed two online estimators: Grenander estimator and expert aggregation estimator.
result Online estimators achieve O(n1/3)O(n^{1/3}) cumulative log-likelihood gap and nlogn\sqrt{n\log{n}} pathwise regret bound.

A simple method treats heteroscedastic variance variatively, improving model calibration and sample quality.

problem Brittle optimization impacts model likelihoods for mean and variance estimation.
method Proposes a variational approach to heteroscedastic variance, improving predictive mean and variance calibration.
result The proposed method significantly improves parameter calibration and sample quality for regression and VAEs.

Paper shows equivalence between two alignment methods and introduces a new algorithm.

problem Ensuring human alignment of large language models for useful, safe, and pleasant user experience.
method Introduces IPO-MD algorithm, showing equivalence between IPO and Nash-MD methods.
result Equivalence between IPO and Nash-MD methods proven when considering online version of IPO.

PD curve calibration refers to the transformation of a set of rating grade level probabilities of default (PDs) to another average PD level that is determined by a change of the underlying portfolio-wide PD. This paper presents a framework that allows to explore a variety of calibration approaches and the conditions un…

2012-12-15abs ↗pdf ↗

A new method optimizes neural sequence models for better task performance.

problem Training neural sequence models with maximum likelihood estimation ignores task losses.
method Maximum likelihood guided parameter search (MGS) in the parameter space.
result MGS optimizes sequence-level losses, reducing repetition and non-termination.

In this paper we revisit the weighted likelihood bootstrap, a method that generates samples from an approximate Bayesian posterior of a parametric model. We show that the same method can be derived, without approximation, under a Bayesian nonparametric model with the parameter of interest defined as minimising an expec…

2017-09-22abs ↗pdf ↗

We introduce a Bayesian solution for the problem in forensic speaker recognition, where there may be very little background material for estimating score calibration parameters. We work within the Bayesian paradigm of evidence reporting and develop a principled probabilistic treatment of the problem, which results in a…

2014-03-24abs ↗pdf ↗

Bayesian calibration for BCP self-assembly models using image data and measure transport.

problem Calibrating models of BCP self-assembly from image data with aleatory uncertainty.
method Likelihood-free inference via measure transport and summary statistics.
result Expected information gains can be computed efficiently for model calibration.

Unified approach for sequence design combining likelihood-free inference and black-box optimization.

problem Designing biological sequences efficiently and accurately.
method Unified probabilistic framework integrating likelihood-free inference and black-box optimization.
result Previous optimization methods can be adapted and new algorithms proposed within this framework.

Post-hoc calibration of neural networks using g-Layers proves theoretical justification.

problem Ensuring the confidence of neural network decisions in real-world applications.
method Proves theoretical justification for post-hoc calibration methods by adding g-Layers and minimizing NLL.
result Proves that adding g-Layers and minimizing NLL can lead to a calibrated network.

Variance-Calibrated Modulation (VCM) addresses the likelihood trap in LLMs by reshaping the probability distribution before truncation.

problem LLMs fall into the likelihood trap, leading to repetitive degeneration and vocabulary dullness.
method VCM reshapes the probability distribution before truncation through Contextual Searchlight and Adaptive Self-Debiasing.
result VCM mitigates the likelihood trap across open-ended generation, factual QA, and mathematical reasoning.

Schervish (1985b) showed that every forecasting system is noncalibrated for uncountably many data sequences that it might see. This result is strengthened here: from a topological point of view, failure of calibration is typical and calibration rare. Meanwhile, Bayesian forecasters are certain that they are calibrated-…

2013-06-20abs ↗pdf ↗

We study the calibration of several state of the art neural machine translation(NMT) systems built on attention-based encoder-decoder models. For structured outputs like in NMT, calibration is important not just for reliable confidence with predictions, but also for proper functioning of beam-search inference. We show …

2019-03-03abs ↗pdf ↗

A new framework for PPLS combines noise estimation, optimization, and calibration.

problem Probabilistic PLS models need interpretable latent factors and calibrated uncertainty.
method End-to-end pipeline combining noise estimation, constrained optimization, and prediction calibration.
result Achieves near-nominal coverage and native calibrated uncertainty across benchmarks.

Improved upper bound for online calibrated forecasting of binary sequences.

problem Online calibrated forecasting of binary sequences.
method Introducing a variant of Qiao & Valiant's sign preservation game called sign preservation with reuse (SPR) and proving its equivalence to calibrated forecasting.
result Improved upper bound of O(T2/3ε)O(T^{2/3 - \varepsilon}) for calibrated forecasting, improving the O(T2/3)O(T^{2/3}) bound of Foster & Vohra.

This paper provides a method for noise-calibrated inference from DP synthetic data.

problem Inference from DP synthetic data is often miscalibrated and lacks principled uncertainty quantification.
method Release DP sufficient statistics, perform noise-calibrated likelihood-based inference, and optional synthetic data generation.
result Asymptotic normality and valid confidence intervals for the plug-in DP MLE.

Several machine learning problems arising in natural language processing can be modeled as a sequence labeling problem. We provide Gaussian process models based on pseudo-likelihood approximation to perform sequence labeling. Gaussian processes (GPs) provide a Bayesian approach to learning in a kernel based framework. …

2014-12-25abs ↗pdf ↗

This paper compares log-likelihood and BLEU scores for sequence generation tasks.

problem The discrepancy between density estimation and sequence generation performance.
method Comparing several density estimators on five machine translation tasks.
result The correlation between log-likelihood and BLEU varies depending on model families.

ACNML method improves uncertainty estimation for deep networks.

problem Uncertainty estimation and calibration for deep neural networks under distribution shift.
method Approximate Bayesian inference to approximate CNML distribution.
result ACNML compares favorably to prior techniques for uncertainty estimation.

New method calibrates neural SBI to avoid overconfident posteriors.

problem Overconfident posteriors in SBI due to inaccurate uncertainty quantification.
method Introduces a calibration term into neural model training objective, enabling end-to-end backpropagation.
result Achieves competitive or better coverage and posterior density than existing methods.

We derive an explicit formula for likelihood function for Gaussian VARMA model conditioned on initial observables where the moving-average (MA) coefficients are scalar. For fixed MA coefficients the likelihood function is optimized in the autoregressive variables ΦΦ's by a closed form formula generalizing regression c…

2016-04-29abs ↗pdf ↗

The paper studies the distance from calibration in sequential prediction, proving upper and lower bounds.

problem The challenge is to measure and minimize the deviation from perfect calibration in sequential binary prediction.
method The approach involves proving an O(T)O(\sqrt{T}) upper bound and an Ω(T1/3)Ω(T^{1/3}) lower bound, using structural results and minimax arguments.
result An O(T)O(\sqrt{T}) upper bound on the calibration distance is achieved, with an Ω(T1/3)Ω(T^{1/3}) lower bound showing the inherent difficulty.

The paper proposes a method to construct confidence sets using likelihood ratios for sequential decision-making.

problem Constructing valid uncertainty estimates for unknown quantities in sequential decision-making.
method The method uses likelihood ratios to create any-time valid confidence sequences without specialized treatment for each application.
result The proposed confidence sets maintain the prescribed coverage in a model-agnostic manner and their size depends on the choice of estimator sequence.

The task of calibration is to retrospectively adjust the outputs from a machine learning model to provide better probability estimates on the target variable. While calibration has been investigated thoroughly in classification, it has not yet been well-established for regression tasks. This paper considers the problem…

2018-06-20abs ↗pdf ↗