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

4181122162 · May 202619922001200920172026
48 results for certainty score

Study risk-sensitive market making with entropy regularization for better quote control.

problem Risk-sensitive market making with exponential utility and penalties.
method Entropy-regularized certainty-equivalent Bellman policies for discrete-time market dynamics.
result Proves convergence and performance bounds for entropy-regularized policies.

A novel approach for semi-supervised learning using regularized optimal transport.

problem Improving model performance with unlabeled data.
method Regularized optimal transport between empirical measures for affinity matrix construction, incremental label propagation, and certainty score.
result Surpasses state-of-the-art results on 12 benchmark datasets.

Study on implied certainty equivalent rates in financial markets and electric vehicles.

problem Investment risk in financial markets.
method Mathematical derivation of implied certainty equivalent rate, empirical analysis of stock and option data.
result Positive implied certainty equivalent rates are more suitable for investment than negative ones, but higher values increase risk.

This paper tackles over-certainty in test-time adaptation models, proposing a solution to improve calibration.

problem Over-certainty in predictions caused by domain shifts, leading to misplaced trust.
method Introduces a certainty regularizer that dynamically adjusts pseudo-label confidence based on backbone entropy and logit norm.
result Achieves state-of-the-art performance in terms of Expected Calibration Error and Negative Log Likelihood, while maintaining accuracy.

Study shows certainty equivalent policy minimizes regret in continuous-time systems.

problem Minimizing regret in continuous-time stochastic linear-quadratic systems.
method Theoretical analysis of randomized certainty equivalent policy.
result Establishes square-root of time regret bounds and linear scaling with parameters.

We propose Generative Well-intentioned Networks (GWINs), a novel framework for increasing the accuracy of certainty-based, closed-world classifiers. A conditional generative network recovers the distribution of observations that the classifier labels correctly with high certainty. We introduce a reject option to the cl…

2019-10-28abs ↗pdf ↗

The paper develops a new approach to conditional risk measures using modular convex analysis.

problem Developing a new method for conditional risk measures.
method Random modular approach to conditional certainty equivalents and niveloids in the conditional LL^{\infty}-space.
result Retrieves a conditional variational formula for optimized certainty equivalents and applies it to the conditional entropic risk measure.

Solves Merton's investment-consumption problem with certainty equivalent approach.

problem Maximizing CRRA utility of consumption over time and investment mix.
method Identifies a certainty equivalent problem for the Merton problem, reformulates it as an SOCP, and applies it to model predictive control.
result The certainty equivalent problem can be solved as an SOCP, facilitating model predictive control.

Overview of risk-sensitive Markov decision processes with Optimized Certainty Equivalent.

problem Optimizing decision-making under risk in Markov processes.
method Analyzes risk-sensitive criteria using Optimized Certainty Equivalent, including entropic risk and Conditional Value-at-Risk.
result Conditions for the existence of optimal policies and solution procedures are provided.

UnKGCP generates prediction intervals for uncertain knowledge graphs with statistical guarantees.

problem Lack of quantified predictive uncertainty in existing UnKGE methods.
method Proposes extsc{UnKGCP} framework using conformal prediction with a novel nonconformity measure.
result Sharp prediction intervals effectively capture predictive uncertainty in diverse UnKGE methods.

Deep learning solves dynamic programming with recursive utility.

problem Challenges in solving high-dimensional discrete-time dynamic programming problems with recursive utility.
method Certainty Equivalent Learning (CEL) algorithm that learns certainty-equivalent value directly with neural networks.
result Accurate value and policy approximations in high-dimensional problems, comparable to VFI in some cases.

Methods for automated discovery of causal relationships from non-interventional data have received much attention recently. A widely used and well understood model family is given by linear acyclic causal models (recursive structural equation models). For Gaussian data both constraint-based methods (Spirtes et al., 199…

2012-05-09abs ↗pdf ↗

The paper analyzes risk estimation methods and derives bounds for OCE risk.

problem Estimating the Optimized Certainty Equivalent (OCE) risk from samples.
method Derives mean-squared error and concentration bounds for SAA of OCE, and analyzes an efficient stochastic approximation-based estimator.
result Finite sample bounds and mis-identification probability bounds for the efficient estimator.

Introduces new performance measures using scaled utility functions.

problem Performance measurement in financial contexts.
method Certainty equivalents defined via scaled utility functions, well-posed portfolio optimization problem under generic conditions.
result Link between portfolio dynamics, benchmark process, and utility function choice in the long-run setting.

Study scaling limits for option pricing in trinomial models.

problem Analyzing exponential hedging in trinomial models converging to Black-Scholes.
method Purely probabilistic approach using duality, martingale, and weak-convergence techniques.
result Derives a scaling limit for exponential certainty-equivalent prices in trinomial models.

Proposes a new method for localized uncertainty quantification in random forests using proximity measures.

problem Localized uncertainty quantification in random forests for improved reliability of predictions.
method Forming localized distributions of Out-Of-Bag (OOB) errors around nearby points defined by similarity measures (proximities) to create prediction intervals for regression and trust scores for classification.
result Localized prediction intervals and trust scores enhance model accuracy and provide higher accuracy-rejection AUC scores than competing methods.

CEFOL uses deep learning for dynamic programming with recursive utility.

problem Challenges in solving dynamic programming problems with recursive utility.
method Introduces a separate neural network for certainty equivalent, uses first-order optimality conditions to learn value and policy functions.
result CEFOL achieves high accuracy in learning value and policy functions, matching VFI benchmarks.

Proposes a new method to rank risky investments based on Omega measure.

problem Evaluating and ranking risky investment projects.
method Introduces an investment certainty equivalence approach and uses the Omega measure.
result Proposed method ranks projects differently from conventional risk-adjusted discount rate (RADR) approach.

We study the performance of the certainty equivalent controller on Linear Quadratic (LQ) control problems with unknown transition dynamics. We show that for both the fully and partially observed settings, the sub-optimality gap between the cost incurred by playing the certainty equivalent controller on the true system …

2019-02-21abs ↗pdf ↗

Study risk-sensitive reinforcement learning with optimized certainty equivalents.

problem Risk-sensitive reinforcement learning in finite discounted MDPs.
method Analyzed a simple model-based approach and derived PAC sample complexity bounds.
result Established tight sample complexity bounds for value and policy learning.

CPATTA uses conformal prediction for efficient test-time adaptation.

problem Low data selection efficiency in existing ATTA methods.
method Conformal Prediction, online weight-update algorithm, domain-shift detector, staged update scheme.
result CPATTA consistently outperforms state-of-the-art methods by 5% in accuracy.

This work uses a scalable approach to identify partially observed nonlinear systems.

problem Offline identification of partially observed nonlinear systems.
method Certainty-equivalent expectation-maximization (CEEM) as block coordinate-ascent.
result The CEEM approach can identify high-dimensional systems reliably and efficiently.

In this paper, we aim to solve for unsupervised domain adaptation of classifiers where we have access to label information for the source domain while these are not available for a target domain. While various methods have been proposed for solving these including adversarial discriminator based methods, most approache…

2019-06-08abs ↗pdf ↗

This study provides an independent, outside-in estimate of the cost and schedule risks of nuclear waste storage projects. Based on a reference class of 216 past, comparable projects, risk of cost overrun was found to be 202% or less, with 80% certainty, i.e., 20% risk of an overrun above 202%. Based on a reference clas…

2019-01-13abs ↗pdf ↗

Study optimal investment decisions for diverse risk-tolerant agents.

problem Optimizing investment choices for agents with varying risk preferences.
method Characterizes optimal behavior using certainty equivalents and lognormal risks.
result Derives optimal decision menus under known and uncertain preference distributions.

We consider the problem of optimal risk sharing in a pool of cooperative agents. We analyze the asymptotic behavior of the certainty equivalents and risk premia associated with the Pareto optimal risk sharing contract as the pool expands. We first study this problem under expected utility preferences with an objectivel…

2016-01-26abs ↗pdf ↗

We investigate task clustering for deep-learning based multi-task and few-shot learning in a many-task setting. We propose a new method to measure task similarities with cross-task transfer performance matrix for the deep learning scenario. Although this matrix provides us critical information regarding similarity betw…

2017-08-26abs ↗pdf ↗

This paper introduces new risk measures for evaluating losses with varying time horizons.

problem Capturing horizon risk and cash non-additivity in risk evaluation.
method Uses BSDEs and shortfall approaches to develop h-generalized shortfall risk measures.
result Introduces hq-entropic risk measures as a new family of fully-dynamic risk measures.

The paper develops robust risk measures for uncertain loss positions.

problem Risk assessment for loss positions with uncertain distributions.
method Robust optimized certainty equivalents and generalized quantiles are proposed and analyzed.
result Robust expectiles with specific penalization functions are coherent risk measures.

Improves policies with high certainty, even in small samples.

problem Ensuring new policies are better than the baseline with high probability.
method Leverages powerful safety tests and multiple testing for threshold policies.
result Controls the rate of adopting a worse policy to pre-specified error level.

Submodularity is studied for convex risk measures, including Expected Shortfall.

problem Characterizing submodularity in convex risk measures.
method Analyzing submodularity properties of law-invariant coherent risk measures, including Expected Shortfall and Value-at-Risk.
result AES is submodular only when it reduces to ES, and empirical analysis shows AES violations are less frequent than VaR and ES violations.

New bounds for adaptive control in high dimensions without fixed state space.

problem Adaptive control of linear systems in high or infinite dimensions.
method Novel perturbation bound for certainty equivalence, scaling with prediction error.
result First regret bounds for LQR in infinite dimensional systems, independent of ambient dimension.

We consider a model in which a trader aims to maximize expected risk-adjusted profit while trading a single security. In our model, each price change is a linear combination of observed factors, impact resulting from the trader's current and prior activity, and unpredictable random effects. The trader must learn coeffi…

2012-07-26abs ↗pdf ↗

Optimized certainty equivalents (OCEs) is a family of risk measures widely used by both practitioners and academics. This is mostly due to its tractability and the fact that it encompasses important examples, including entropic risk measures and average value at risk. In this work we consider stochastic optimal control…

2020-01-27abs ↗pdf ↗

We evaluated the effectiveness of an automated bird sound identification system in a situation that emulates a realistic, typical application. We trained classification algorithms on a crowd-sourced collection of bird audio recording data and restricted our training methods to be completely free of manual intervention.…

2018-09-04abs ↗pdf ↗

New methods reduce constraint violations to certainty in stochastic optimization.

problem Finding a point with certain constraint satisfaction and near-stationarity.
method Single-loop variance-reduced stochastic first-order methods with truncated momentum schemes.
result Achieves strong convergence guarantees for εε-stochastic stationary points with certain constraint satisfaction.

This paper tackles adaptive control of unknown Markov jump systems with sample complexity and regret bounds.

problem Adaptive control of unknown Markov jump systems with changing dynamics.
method Identification-based adaptive control using a system identification algorithm and certainty equivalent control.
result The proposed adaptive control scheme achieves O(T)\mathcal{O}(\sqrt{T}) regret, improving to O(polylog(T))\mathcal{O}(polylog(T)) with partial knowledge.

We study the dynamic indifference pricing with ambiguity preferences. For this, we introduce the dynamic expected utility with ambiguity via the nonlinear expectation--G-expectation, introduced by Peng (2007). We also study the risk aversion and certainty equivalent for the agents with ambiguity. We obtain the dynamic …

2015-03-30abs ↗pdf ↗

Proposes a new k-NN algorithm to improve classification accuracy by removing noise and pseudo-neighbours.

problem Noise and pseudo-neighbours in large-scale databases affect k-NN performance.
method Introduces a weighted mutual k-Nearest Neighbour algorithm to detect and remove noise, and minimize distant neighbours' influence.
result The proposed algorithm provides comparative better results compared to standard k-NN.