A new concordance loss improves model performance and reliability in survival prediction.
problem Inconsistent evaluation of deep survival models using likelihood losses.
method Proposed a value-monotone concordance loss (SCL) to improve reliability and optimization.
result SCL achieves comparable discrimination and is the best or within one standard deviation of the best C-index across multiple datasets.
The logcosh loss function helps neural networks learn set-valued functions better.
problem Learning set-valued functions with neural networks.
method Using artificial neural networks with logcosh loss.
result Neural networks with logcosh loss can classify samples based on set-valued functions.
This work improves diffusion models by estimating the optimal loss value for better training diagnostics.
problem The optimal loss value of diffusion models is unknown and not indicative of absolute data-fitting quality.
method Derive the optimal loss in closed form and develop effective estimators, including a stochastic variant.
result Unlocking the optimal loss as a metric for diagnosing training quality of diffusion models.
The paper examines optimal insurance design using Lambda-Value-at-Risk.
problem Optimal insurance design based on Lambda-Value-at-Risk.
method Analyzes optimal insurance solutions using Lambda-Value-at-Risk and closed-form expressions.
result Truncated stop-loss indemnity is optimal under certain conditions.
Enhances Transformers for better risk assessment in finance.
problem Transformer models lack sensitivity to extreme financial losses.
method Integrates Loss-at-Risk function with Value at Risk (VaR) and Conditional Value at Risk (CVaR).
result Improves risk prediction and management in financial datasets.
When optimizing against the mean loss over a distribution of predictions in the context of a regression task, then even if there is a distribution of targets the optimal prediction distribution is always a delta function at a single value. Methods of constructing generative models need to overcome this tendency. We con…
Adaptive loss scaling speeds up and improves deep learning training.
problem Numerical underflow in mixed precision training.
method Adaptive loss scaling that automatically computes layer-wise loss scale values during training.
result Adaptive loss scaling leads to shorter convergence time and improved accuracy.
Study vector-valued robust control under uncertainty.
problem Dynamic stochastic control with multi-objective criteria under model uncertainty.
method Robust minimax approach, set-valued framework, dynamic programming principle.
result Derived weak and strong versions of dynamic programming principle for vector-valued control problems.
Introduces CHL, a new loss function for continuous similarity learning.
problem Binary similarity learning limitations.
method CHL is a novel loss function that generalizes histogram loss to continuous similarities.
result CHL solves a wider range of tasks including similarity learning, representation learning, and data visualization.
Sobolev training helps neural nets fit function values and derivatives.
problem Training neural nets to match function values and derivatives accurately.
method Using Sobolev loss with gradient flow for overparameterized networks.
result Gradient flow from random initialization can fit any function and its derivatives.
The paper analyzes how well classes are separated in neural network feature space.
problem Understanding class separability in neural network feature space.
method Theoretical analysis of intra-class and inter-class distances in feature space.
result A lower bound for the probability of inter-class distance being greater than intra-class distance as a function of loss value.
Improves model generalization by minimizing loss sharpness.
problem Overparameterized models often fail to generalize well despite low training loss.
method Sharpness-Aware Minimization (SAM) minimizes both loss value and sharpness.
result SAM improves model generalization across various datasets and models.
Q-SHAP efficiently calculates feature contributions in boosting trees.
problem Global evaluation of feature contributions in tree models.
method Q-SHAP, an efficient algorithm that reduces Shapley values calculation to polynomial time.
result Q-SHAP improves computational efficiency and enhances accuracy of feature-specific R2 estimates. The paper explores how different loss functions impact reinforcement learning algorithms.
problem Improving reinforcement learning algorithms by optimizing loss functions.
method Comprehensive survey on loss functions in reinforcement learning, proving the benefits of specific loss functions.
result Binary cross-entropy loss leads to first-order bounds and is more efficient than squared loss.
Paper develops a duality approach for robust loss functions in infinite-dimensional RKHSs.
problem Robustness issues in infinite-dimensional RKHSs with operator-valued kernels.
method Develops a duality approach to solve OVK machines for various loss functions.
result Empirical improvements and theoretical stability analysis for robust structured data applications.
Paper introduces a new robust loss function for RL.
problem Heuristic selection of threshold parameters in quantile Huber loss.
method Derived from Wasserstein distance, captures noise in quantile values.
result Enhances robustness against outliers and enables parameter adjustment.
Investigates conditions for risk or utility functionals to be sensitive to large losses.
problem Conditions for risk or utility functionals to be sensitive to large losses.
method Analyzes sensitivity to large losses for various risk and utility functionals.
result Value at Risk and Expected Shortfall generally fail to be sensitive to large losses, but expected utility functionals and certain adjusted versions are sensitive.
The paper analyzes how to combine self-protection and self-insurance for risk reduction.
problem Combining self-protection and self-insurance for risk reduction when market insurance is absent.
method The approach uses Value-at-Risk and Tail Value-at-Risk to evaluate residual risk and solves the problem using isoquant geometry based on marginal-balance curves.
result The analysis identifies the conditions under which self-protection and self-insurance behave as substitutes or complements.
In the hypothesis of rare loss events, the general expression of the policy value has been determined as a functional of the "expected frequency / loss severity" function and of the retention function. Exponential disutility has been chosen after mathematical characterization of some of its economical aspects, where fu…
Global implicit function theorem for Fréchet spaces, solving derivative loss problems.
problem Solving initial value problems with derivative loss in Fréchet spaces.
method Global implicit function theorems for Keller's Cc1-mappings in Fréchet spaces, applied through submersions and transversality. result Global existence and uniqueness of solutions to initial value problems with derivative loss.
Learning a generative model is a key component of model-based reinforcement learning. Though learning a good model in the tabular setting is a simple task, learning a useful model in the approximate setting is challenging. In this context, an important question is the loss function used for model learning as varying th…
This work analyzes impermanent loss in decentralized markets and provides a hedging strategy.
problem Impermanent loss in automated market makers (AMMs).
method Analytical derivation of a static replication formula using European options, and numerical example with real data.
result Guaranteed hedging coverage for all final prices within a predefined interval.
In this paper, we study two classes of optimal reinsurance models from perspectives of both insurers and reinsurers by minimizing their convex combination where the risk is measured by a distortion risk measure and the premium is given by a distortion premium principle. Firstly, we show that how optimal reinsurance mod…
In structural credit risk models, default events and the ensuing losses are both derived from the asset values at maturity. Hence it is of utmost importance to choose a distribution for these asset values which is in accordance with empirical data. At the same time, it is desirable to still preserve some analytical tra…
The paper extends mixability theory to function-valued forecasts, proving various loss functions are mixable.
problem Efficient aggregation of functional and probabilistic forecasts in online prediction games.
method Adapting mixable and exponentially concave loss functions to function-valued forecasts.
result Various loss functions used for probabilistic forecasting are mixable (exp-concave).
Proposes risk-averse learning framework using CVaR for better performance evaluation.
problem Risk-averse evaluation of machine learning algorithms.
method Develops algorithms based on stochastic gradient descent for CVaR optimization with weaker distributional assumptions.
result Shows convergence and generalization bounds for the proposed algorithms.
Paper introduces DCoVaR for aggregate risk models, outperforming existing methods.
problem Lack of coherent risk measures for aggregate risk models.
method Proposes Dependent Conditional Value-at-Risk (DCoVaR) for a target loss dependent on another random loss.
result DCoVaR outperforms MCoVaR and CCoVaR in numerical simulations and empirical studies.
EX-DRL improves extreme quantile prediction for financial risk management.
problem Inaccurate estimation of extreme quantiles in loss distributions.
method EX-DRL uses Generalized Pareto Distribution (GPD) to model the tail of the loss distribution and Quantile Regression (QR) to improve extreme quantile prediction.
result EX-DRL provides more precise estimates of extreme quantiles, improving risk metrics reliability.
New property shows VaR subadditivity for comonotonic loss variables.
problem Understanding VaR subadditivity and comonotonicity.
method Analyzes VaR subadditivity and comonotonicity relationship.
result VaR subadditivity holds for comonotonic loss variables.
A new method for forming learning objectives using the sum of ranked range.
problem Forming learning objectives from aggregated values.
method Sum of ranked range (SoRR) minimization with DCA.
result The proposed method effectively forms learning objectives and is applicable to binary and multi-label/multi-class classification.
A new model calculates LGD distribution based on firm value and credit market conditions.
problem Estimating LGD distribution in credit markets.
method Uses last passage time of a linear diffusion process to model LGD distribution.
result Explicit distributions of default time and LGD are obtained under minimal assumptions.
A new convex loss function optimizes set predictions with balanced size and coverage.
problem Optimizing set predictions with balanced size and coverage.
method Proposes a convex loss function using Choquet integrals for nondecreasing subset-valued functions.
result Optimal trade-offs between conditional probabilistic coverage and set size.
The paper improves privacy accounting for discrete-valued mechanisms and the subsampled Gaussian mechanism.
problem Improving the accuracy and efficiency of differential privacy accounting for discrete outputs.
method Uses fast Fourier transform (FFT) for rigorous error analysis and accounting of privacy loss.
result Provides strict lower and upper bounds for (ε,δ)-values, demonstrating up to 75% reduction in noise variance. Gradient flows of neural networks converge to optimal values or diverge, with thresholds and asymptotic behaviors.
problem Understanding the convergence and divergence of gradient flows in neural networks.
method Analysis of gradient flows on loss landscapes of neural networks using o-minimal structures.
result Gradient flows either converge to optimal values or diverge to infinity, with thresholds and asymptotic behaviors.
In this paper we consider Fourier transform techniques to efficiently compute the Value-at-Risk and the Conditional Value-at-Risk of an arbitrary loss random variable, characterized by having a computable generalized characteristic function. We exploit the property of these risk measures of being the solution of an ele…
This paper calculates worst-case target semi-variances for uncertain losses.
problem Managing risk when loss distribution is uncertain and only partial information is known.
method Derives worst-case target semi-variances for symmetric or non-negative losses under uncertainty sets representing investor's undesirable scenarios.
result Closed-form expressions for worst-case target semi-variances are derived.
We consider the problem of maximizing a real-valued continuous function f using a Bayesian approach. Since the early work of Jonas Mockus and Antanas Žilinskas in the 70's, the problem of optimization is usually formulated by considering the loss function maxf−Mn (where Mn denotes the best function value ob…
A new method uses Shapley values to select important features for classification.
problem Feature selection for improving classification models.
method Classification game with Shapley value apportioning of hinge loss.
result Threshold 0 on SVEA value identifies significant features.
A new tail-shape index based on Value at Risk and Expected Shortfall.
problem Measuring and comparing tail behavior of loss distributions.
method Introducing a new θ-index based on equal level relationships between Value at Risk and Expected Shortfall. result The θ-index provides a level-dependent, scale-free measure of upper tail behavior. New binary loss functions improve density ratio estimation accuracy.
problem Improving accuracy of density ratio estimators using binary classifiers.
method Characterized loss functions based on prescribed error measures in Bregman divergences.
result Novel loss functions prioritize accurate estimation of large density ratio values.
Optimal transport distances help impute missing data.
problem Missing data in real-world datasets.
method Use optimal transport distances as a loss function to impute missing data values.
result OT-based methods match or outperform state-of-the-art imputation methods.
Proposes an alternative probabilistic interpretation of Huber loss.
problem Lack of intuitive understanding of Huber loss transition point.
method Relates Huber loss to Kullback-Leibler divergence between Laplace distributions.
result Identifies optimal transition point intuitively based on data noise.
The paper explores optimal insurance contracts using various deviation measures.
problem Optimal insurance contracts with mean-deviation measures.
method Study of convex signed Choquet integrals and standard deviation as deviation measures, analyzing premium principles like expected value, Value-at-Risk, and Expected Shortfall.
result Characterization of optimal indemnities and deductibles under different premium principles.
Study quantifies firm risks from nature decline, showing significant equity losses.
problem Estimating the financial impact of nature deterioration on companies.
method Developed metrics (Country Degradation Index, Nature Risk Score) and assessed five environmental hazards.
result Global equities lose 26.8% in a nature decline scenario, with worst firms losing 75%.
Introduces SoRR for aggregating losses in supervised learning.
problem Aggregating individual losses into a single output for machine learning models.
method Sum of ranked range (SoRR) minimization using DCA.
result Demonstrates effectiveness of AoRR and TKML in improving robustness of multi-label learning.
Paper tackles tensor decomposition for unaligned observations using RKHS and novel loss functions.
problem Tackles tensor decomposition for unaligned observations.
method Uses functions in RKHS to represent mode with unaligned observations, introduces versatile loss function, proposes optimization algorithm and stochastic gradient method.
result Demonstrates improved tensor decomposition efficiency and effectiveness with synthetic and real data.
Loss minimization leads to multicalibration for neural networks.
problem Ensuring fairness in predictions across multiple protected groups.
method Minimizing squared loss over neural networks of size n.
result Minimizing loss over neural nets of size n implies multicalibration for most values of n.
In economics, insurance and finance, value at risk (VaR) is a widely used measure of the risk of loss on a specific portfolio of financial assets. For a given portfolio, time horizon, and probability α, the 100α% VaR is defined as a threshold loss value, such that the probability that the loss on the portfolio ove…