Adma proposes a flexible loss function for neural networks.
problem Static loss functions limit neural network performance.
method Introduces a flexible loss function that adapts to ANN complexity and data distribution.
result Flexible loss function achieves state-of-the-art performance.
Flexible framework for bounding high-loss predictions using quantiles.
problem Need for rigorous guarantees in risk-sensitive applications.
method Order statistics of loss values, flexible quantile-based metrics.
result Ability to rigorously control loss quantiles on real-world datasets.
Flexible framework for CMTF with ADMM for various constraints and couplings.
problem Challenges in data fusion from multiple sources with varying characteristics.
method Flexible algorithmic framework using AO and ADMM for various constraints, loss functions, and couplings.
result Accurate and computationally efficient results for various loss functions, including KL divergence.
New risk class penalizes loss deviations from mean on both sides.
problem Current risks are sensitive to loss tails on the upside and ignore the downside.
method Introduces a bi-directional risk class with flexible tail sensitivity.
result Derives high-probability learning guarantees without gradient clipping.
We present a class of flexible and tractable static factor models for the term structure of joint default probabilities, the factor copula models. These high-dimensional models remain parsimonious with pair-copula constructions, and nest many standard models as special cases. The loss distribution of a portfolio of con…
Although various linear log-distance path loss models have been developed, advanced models are requiring to more accurately and flexibly represent the path loss for complex environments such as the urban area. This letter proposes an artificial neural network (ANN) based multi-dimensional regression framework for path …
FlexCodeTS is a flexible time series density estimator.
problem Estimating conditional densities for time series data.
method Nonparametric conditional density estimator based on arbitrary regression methods.
result FlexCodeTS adapts its convergence rate based on the chosen regression method.
Model predicts credit portfolio losses with contagion effects.
problem Predicting credit portfolio losses with contagion effects.
method Introduced a model with a recursive algorithm and flexible distributions.
result Good fit for synthetic CDO tranches of the iTraxx index.
A new Branch-and-Bound solver tackles L0-penalized problems with flexible loss functions.
problem Solving L0-penalized optimization problems with a broader class of loss functions.
method Generic Branch-and-Bound procedure with closed-form expressions for key quantities.
result El0ps solver achieves state-of-the-art performance and extends computational feasibility.
Flexible tree ensemble learning framework supports arbitrary loss functions and multi-task learning.
problem Limited modeling capabilities of existing tree ensemble learning toolkits.
method Differentiable tree ensembles with tensor-based formulation for efficient training.
result Our framework leads to 100x more compact and 23% more expressive tree ensembles.
Hi-fi priors enhance BNNs by learning flexible activations.
problem Challenging to impose function-space priors on BNNs.
method Optimization techniques to learn flexible activations.
result BNNs with flexible activations can achieve desired priors.
Neural network model improves loss reserving accuracy and distribution flexibility.
problem Accurate estimation of claim variability alongside central estimates.
method Mixture Density Neural Network (MDN) with rolling-origin approach.
result MDN consistently outperforms classical models for central estimates and quantiles.
Generalized dual discriminator GANs improve upon traditional GANs by using two discriminators and a flexible loss function.
problem Mode collapse in GANs.
method Introducing dual discriminator α-GANs and extending the approach to arbitrary functions. result The approach reduces the optimization problem to a linear combination of an f-divergence and a reverse f-divergence. A new framework for deep matrix factorizations improves model consistency and flexibility.
problem Inconsistent loss functions in deep matrix factorizations.
method Introduces two new loss functions and a generic optimization framework.
result Demonstrates improved model performance on synthetic and real data.
New framework controls statistical dispersion for high-stakes applications.
problem Understanding and controlling the dispersion of loss distributions in high-stakes applications.
method Simple yet flexible framework for distribution-free control of statistical dispersion measures.
result Proposed methods control statistical dispersion measures with societal implications.
DiffEnc improves diffusion models by adding flexibility and achieving better likelihood on CIFAR-10.
problem Improving the likelihood of diffusion models on image datasets.
method Introducing a data- and depth-dependent mean function and a free weight parameter for noise variance.
result Achieved statistically significant improvement in likelihood on CIFAR-10.
Using an extended version of the credit risk model CreditRisk+, we develop a flexible framework with numerous applications amongst which we find stochastic mortality modelling, forecasting of death causes as well as profit and loss modelling of life insurance and annuity portfolios which can be used in (partial) intern…
Proposes measures for uncertainty quantification using proper scoring rules.
problem Uncertainty quantification for prediction tasks.
method Decomposes proper scoring rules into divergence and entropy components, tailoring uncertainty quantification to specific tasks.
result Flexibility in uncertainty quantification improves performance in selective prediction and active learning.
We introduce a new principle for model selection in regression and classification. Many regression models are controlled by some smoothness or flexibility or complexity parameter c, e.g. the number of neighbors to be averaged over in k nearest neighbor (kNN) regression or the polynomial degree in regression with polyno…
In many structured prediction problems, complex relationships between variables are compactly defined using graphical structures. The most prevalent graphical prediction methods---probabilistic graphical models and large margin methods---have their own distinct strengths but also possess significant drawbacks. Conditio…
The paper introduces a new FOR framework using Huber and ε-insensitive losses.
problem Handling outliers and sparsity in functional output regression.
method Proposes a flexible FOR framework with infimal convolution losses and computable algorithms.
result Demonstrates efficiency and effectiveness on synthetic and real-world data.
Motivated by the flexibility of biological neural networks whose connectivity structure changes significantly during their lifetime, we introduce the Unstructured Recursive Network (URN) and demonstrate that it can exhibit similar flexibility during training via gradient descent. We show empirically that many of the di…
Study uses spectral risk for learning with heavy-tailed data.
problem Learning with heavy-tailed loss distributions.
method Spectral risk with Lipschitz-continuous density, derivative-free learning.
result Excess risk guarantees and improved performance over traditional methods.
Easyllp simplifies LLP, achieving low task loss at individual instance level.
problem Weakly supervised classification with label proportions.
method Flexible debiasing approach based on aggregate labels, operating on arbitrary loss functions.
result Accurately estimates expected loss at individual level, with provable guarantees.
Optimizing full likelihoods adapts loss scales and shapes for robust modeling.
problem Rigid loss functions limit model adaptability and robustness.
method Optimize full likelihoods with adjustable parameters.
result Adaptive tuning of loss scales and shapes improves model robustness.
Extended LSTMs improve volatility prediction by 20%.
problem Predicting asset price volatility with long memory.
method Extended LSTMs with multiple flexible timescales.
result Extended LSTMs outperform rough volatility predictions by 20%.
Typically, loss functions, regularization mechanisms and other important aspects of training parametric models are chosen heuristically from a limited set of options. In this paper, we take the first step towards automating this process, with the view of producing models which train faster and more robustly. Concretely…
Paper introduces arctan pinball loss for XGBoost quantile regression.
problem Efficiently predicting multiple quantiles with XGBoost.
method Smooth approximation of pinball loss for XGBoost, using arctan pinball loss.
result Arctan pinball loss reduces quantile crossings and improves efficiency.
In this work we develop a new algorithm for regularized empirical risk minimization. Our method extends recent techniques of Shalev-Shwartz [02/2015], which enable a dual-free analysis of SDCA, to arbitrary mini-batching schemes. Moreover, our method is able to better utilize the information in the data defining the ER…
This paper improves operational risk modeling by selecting better loss severity distributions.
problem Inconsistent regulatory capital calculations due to changing loss severity distribution families.
method Presented truncation probability estimates and a consistent quantile scoring function for selection criteria. Also, recommended collecting loss frequencies below the minimum reporting threshold.
result More stable regulatory capital calculations through better selection of loss severity distributions.
Neural networks fit fewer samples than their parameters suggest in practice.
problem Understanding the practical limitations of neural network flexibility.
method Examination of neural network optimization, parameter efficiency, and loss surfaces.
result Neural networks can only fit training sets with significantly fewer samples than their parameters suggest.
Extends matrix factorization for deviance-based losses with GLM theory.
problem Improving data loss models beyond squared error.
method Adapts GLM theory to matrix factorization for deviance losses.
result Strong consistency and robustness of the proposed decomposition.
Structured entropy improves classification performance on structured targets.
problem Cross-entropy loss fails to account for target variable structure.
method Proposes structured entropy, a generalization of entropy using random partitions.
result Structured cross-entropy loss yields better results on classification problems with known structure.
This paper describes a flexible and tractable bottom-up dynamic correlation modelling framework with a consistent stochastic recovery specification. The stochastic recovery specification only models the first two moments of the spot recovery rate as its higher moments have almost no contribution to the loss distributio…
Real-world large-scale datasets usually contain noisy labels and are imbalanced. Therefore, we propose derivative manipulation (DM), a novel and general example weighting approach for training robust deep models under these adverse conditions. DM has two main merits. First, loss function and example weighting are commo…
Flexible algorithm of multicurrency trade on Forex market has been built on the grounds of non-linear stochastic wavelets (NSW) model. Probability of the loss-free trade has been evaluated. Results of the algorithm's real-time testing and issues of the algorithm's development are discussed.
The paper argues that uncertainty quantification in ML is application-specific and proposes a flexible family of measures.
problem The need for proper uncertainty quantification in machine learning for safety-critical applications.
method A flexible family of uncertainty measures tailored to specific applications, using proper scoring rules to control characteristics.
result Different uncertainty measures are more suitable for different tasks (e.g., selective prediction, out-of-distribution detection, active learning).
Regression models for limited continuous dependent variables having a non-negligible probability of attaining exactly their limits are presented. The models differ in the number of parameters and in their flexibility. Fractional data being a special case of limited dependent data, the models also apply to variables tha…
Paper introduces a new loss function for deep imbalanced classification.
problem Class ambiguity and imbalance in large datasets.
method Stochastic top-K hinge loss based on smoothed top-K operator.
result Our loss function significantly outperforms other baseline loss functions in imbalanced datasets.
This paper examines the Histogram Loss for regression, revealing its effectiveness without needing complex tuning.
problem Improving regression models by learning the entire distribution.
method Investigates Histogram Loss, a method that minimizes cross-entropy between a target distribution and a histogram prediction.
result The performance gain in regression models using Histogram Loss comes from optimization improvements, not extra modeling.
A new HP model balances interpretability and flexibility for EHR event sequences.
problem Balancing interpretability and flexibility in modeling diagnostic event sequences.
method Proposes a neural network-based HP with flexible impact kernel and transformer layers.
result Accurately recovers impact functions, competitive performance, and clinically meaningful interpretation.
This paper discusses different classes of loss models in non-life insurance settings. It then overviews the class Tukey transform loss models that have not yet been widely considered in non-life insurance modelling, but offer opportunities to produce flexible skewness and kurtosis features often required in loss modell…
New framework for DP-SMO with near-optimal privacy-loss trade-off.
problem Optimal trade-off between privacy and population loss in DP-SMO.
method General framework using Phased-ERM method and black-box optimization.
result Near-linear time algorithms with near-optimal guarantees.
EGFs use ergodicity to simplify generative flows for easier training and imitation learning.
problem Challenges in training generative flows, especially in continuous settings and for imitation learning.
method EGFs leverage ergodicity to build simple flows with universality guarantees and tractable FM loss. They introduce a KL-weakFM loss for IL training without a separate reward model.
result EGFs simplify generative flow training and enable effective imitation learning.
Paper proposes a deep hedging method for Bermudan swaptions to manage residual profit and loss.
problem Real-world market conditions differ from ideal assumptions in traditional hedging methods, leading to residual profit and loss.
method Deep hedging framework applied to Bermudan swaptions, allowing flexible risk measures and hedge strategies.
result Effective residual profit and loss management demonstrated through numerical analysis.
Point clouds, as a form of Lagrangian representation, allow for powerful and flexible applications in a large number of computational disciplines. We propose a novel deep-learning method to learn stable and temporally coherent feature spaces for points clouds that change over time. We identify a set of inherent problem…
This paper compares deeper and wider neural networks for optimal generalization error in Sobolev losses.
problem The dilemma of choosing between deeper or wider neural networks for optimal generalization error.
method Analytical investigations into the influence of sample points, parameters, and loss function regularity on neural network architecture.
result A higher number of parameters favors wider neural networks, while more sample points and greater loss function regularity favor deeper neural networks.
Unified framework for non-Euclidean CPD under scalable stochastic mirror descent.
problem Handling non-Euclidean losses in tensor decomposition.
method Tensor fiber sampling strategy-based stochastic mirror descent.
result Global convergence to a stationary point under reasonable conditions.