MTAdam optimizes multiple loss terms in neural models, balancing gradients dynamically.
problem Balancing multiple loss terms in neural model training is challenging and computationally demanding.
method Generalized Adam algorithm that computes separate derivatives and balances gradients across layers dynamically.
result Training with MTAdam leads to faster recovery from suboptimal initial loss weighting and matches conventional training outcomes.
BUDS balances privacy and utility by shuffling data, achieving strong privacy with minimal loss.
problem Balancing privacy and utility in crowd-sourced statistical databases.
method One-hot encoding, iterative shuffling, loss estimation, risk minimization.
result Achieves ε=0.02 for privacy, maintaining a privacy bound of ε=ln[t/((n1−1)S)]. This paper introduces new loss functions for balanced multi-class classification.
problem Balancing class imbalance in multi-class classification.
method Introduces two new surrogate loss families: GLA and GCA.
result GCA losses offer stronger theoretical guarantees in imbalanced settings.
Paper proposes ARB-Loss to improve classification precision in imbalanced datasets.
problem Improving classification precision on minor classes in imbalanced datasets.
method Introduces Attraction-Repulsion-Balanced Loss (ARB-Loss) to balance gradients across different classes.
result ARB-Loss achieves state-of-the-art performance with one-stage training.
Combines proportional and stop-loss reinsurance for insurer and reinsurer.
problem Addressing conflicting interests between insurer and reinsurer.
method Introduces proportional-stop-loss reinsurance using balanced loss function.
result Maximizes expected surplus for both insurer and reinsurer.
The balance property is crucial for insurance pricing, ensuring total actuarial price equals loss. Maximum likelihood GLMs fulfill it, but Lindholm-Wüthrich suggests three methods, with constrained GLM being superior.
problem Ensuring the balance property in insurance pricing models
method Using constrained GLM fitting
result Constrained GLM fitting is superior to the two previously discussed balance correction methods
The study identifies assets with local balance deviating from global balance to mitigate financial risk.
problem Selecting outperforming assets during financial crises.
method Investigates deviations of local balance from global balance as a criterion for asset selection.
result Assets with local balance deviating from global balance can mitigate financial risk.
This work improves structured prediction by learning the balance between signal and random noise.
problem Structured prediction with random perturbations.
method Learning the variance of randomized structured predictors to balance signal and noise.
result Learning the balance improves structured prediction effectiveness.
The paper explores symmetric losses for better learning from corrupted labels.
problem Learning from corrupted labels with balanced error rate or AUC maximization.
method Proves theoretical properties of symmetric losses and proposes a convex barrier hinge loss.
result Symmetric losses are advantageous in BER minimization and AUC maximization from corrupted labels.
Estimates density ratio for two-sample comparison using tree models.
problem Comparing two distributions given i.i.d. observations.
method Additive tree models with balancing loss for density ratio estimation.
result Bayesian inference provides uncertainty quantification for density ratio.
Proposes a simple framework to balance task difficulty in multi-task learning.
problem Varying difficulty levels among different tasks in multi-task learning.
method Introduces a Balanced Multi-Task Learning (BMTL) framework that transforms training losses to balance task difficulty.
result Empirical studies show state-of-the-art performance of the proposed BMTL framework.
Analyzes impermanent loss in decentralized exchanges and provides a replication formula.
problem Impermanent loss in decentralized exchanges like Uniswap and Balancer.
method Analytical static replication formula using European calls and puts.
result Guaranteed coverage for pool value within a predefined range.
Study shows sudden loss of balance in stock market networks after 2011, reducing predictability.
problem Reduced predictability in stock markets due to structural changes.
method Rank correlations and weighted signed networks to analyze interconnectivity and balance.
result Sudden loss of balance in stock market networks after 2011, leading to decreased predictability.
Stable GFlowNets prevent loss spikes and mode collapse in training.
problem Unstable training of GFlowNets leading to loss spikes and mode collapse.
method Assessed sensitivity of GFlowNet objectives, derived loss-to-TV bounds, and proposed Stable GFlowNets.
result Stable GFlowNets improve training behavior and distributional fidelity.
Paper proposes D3M to improve anti-spoofing detection by balancing loss function and using complementary features.
problem Improving automatic speaker verification systems against high-quality playback attacks.
method D3M uses a balanced focal loss function to dynamically scale loss based on sample traits, and combines three feature types for robust detection.
result D3M systems outperform conventional methods significantly, achieving min-tDCF of 0.0124 and EER of 0.55%.
Noise balance theory explains SGD's behavior in neural networks.
problem Understanding SGD's navigation in neural network loss landscapes.
method Analyzes minibatch noise and loss function symmetries.
result Derives the stationary distribution of SGD for deep networks.
Proposes φ-balancing for more balanced expert utilization in MoE models.
problem Balanced expert utilization in MoE models to avoid bias.
method Directly targets population-level balance by minimizing a convex potential function.
result Consistently outperforms prior methods in stability and effectiveness.
This paper finds a new method for decomposing insurer profits and losses.
problem Nonlinear balance sheets make it hard to attribute changes to risk factors.
method An axiomatic approach leading to infinitesimal sequential updating (ISU) decompositions.
result ISU decompositions are more general and applicable beyond insurance.
Symmetric losses improve classifier robustness from corrupted labels.
problem Improving classifier performance from corrupted labels.
method Symmetric losses that satisfy a certain condition.
result Symmetric losses enhance robust classification from corrupted labels.
Balanced Activation improves object detection performance on long-tailed datasets.
problem Mismatch between training and testing label distributions in object detection.
method Introduces Balanced Activation (Balanced Softmax and Balanced Sigmoid) to address label distribution shift.
result Balanced Activation provides ~3% gain in mAP on LVIS-1.0 compared to state-of-the-art methods.
Paper presents a Bayesian-decision-theory framework for long-tailed classification.
problem Heavy imbalance and asymmetric misprediction costs in long-tailed datasets.
method Bayesian-decision-theory perspective, unifying re-balancing and ensemble methods.
result Improves accuracy for all classes, especially tails, with provably optimal decisions.
Paper simplifies balancing weights by relaxing outcome assumptions.
problem Estimating missing outcomes in a target population.
method Relaxes outcome assumptions to simplify balancing weights.
result Balancing weights can be simplified with convex loss and minimum worst-case bias.
Proposes ADC for cross-domain recommendation balancing user preferences.
problem Users' preferences change across different domains (e.g., social media, e-commerce).
method Designs a neural architecture and cross-domain loss function to adaptively balance user preferences.
result ADC model effectively balances the impact of domains with different complexities.
A hybrid loss framework improves time series forecasting by balancing global and component errors.
problem Current time series methods may prioritize less significant sub-series, leading to forecasting bias.
method Proposes a hybrid loss framework combining global and component losses, dynamically adjusting weights.
result Improves time series forecasting performance by 0.5-2% on average.
TKIL improves class-balanced performance in incremental learning.
problem Catastrophic forgetting in sequential learning tasks.
method Introduces Tangent Kernel for Incremental Learning (TKIL) based on Neural Tangent Kernel (NTK).
result TKIL achieves better overall accuracy and variance across classes.
Study examines how balancing methods affect model behavior in imbalanced classification problems.
problem Impact of balancing methods on model behavior in imbalanced classification problems.
method Used Explainable Artificial Intelligence tools (variable importance method, partial dependence profile, accumulated local effects) to compare model behavior before and after balancing.
result Significant changes in model behavior due to balancing methods, leading to biased models.
UMAP's true loss function differs from what was previously thought, focusing on nearest neighbor graph similarities.
problem Understanding the true effectiveness and mechanism of UMAP for high-dimensional data visualization.
method Deriving UMAP's effective loss function in closed form and analyzing its optimization scheme.
result UMAP aims to reproduce similarities encoded in the nearest neighbor graph, not the full high-dimensional similarities.
GCVAE improves disentanglement in VAEs while balancing reconstruction error.
problem Improving disentanglement in VAEs while maintaining low reconstruction error.
method Introduces three controllable Lagrangian hyperparameters to optimize reconstruction and KL divergence loss.
result GCVAE outperforms state-of-the-art models in disentanglement while balancing reconstruction.
Paper introduces Balanced Meta-Softmax for better long-tailed visual recognition.
problem Long-tailed distribution mismatch between training and testing data.
method Balanced Meta-Softmax, an unbiased extension of Softmax, using a Meta Sampler.
result Balanced Meta-Softmax outperforms state-of-the-art solutions on visual recognition and instance segmentation.
A new method improves molecule generation accuracy and efficiency.
problem Posterior collapse in VAEs for molecule sequence generation.
method Re-balancing reconstruction loss to avoid posterior collapse.
result Our method achieves state-of-the-art reconstruction accuracy and competitive validity.
Improves representation learning for individual treatment effect estimation.
problem Estimating individual treatment effects with high accuracy.
method Introduces a structure keeper to maintain correlation between baseline covariates and representations, trains a discriminator to balance representation and information loss.
result Proposed SMRL algorithm minimizes treatment estimation error and outperforms state-of-the-art methods.
This research improves binary classification by balancing overfitting and generalization with a novel Bayesian approach.
problem Improving binary classification models to avoid overfitting and generalize well.
method Introduces a PAC-Bayes type learning rule with a balancing parameter λ to balance training error and KL divergence to a prior.
result A choice of λ ensures uniformly vanishing excess loss, even in the agnostic case, by under-regularizing or over-regularizing appropriately.
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.
New SVM model balances sparsity and robustness in noisy data.
problem Noise sensitivity and lack of sparsity in traditional SVM models.
method Combines elastic net loss with robust loss framework, integrates with SVM, uses half-quadratic algorithm.
result Proves sparsity and robustness, outperforms traditional SVMs in noisy environments.
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.
A simple banking network model is proposed which features multiple waves of bank defaults and is analytically solvable in the limiting case of an infinitely large homogeneous network. The model is a collection of nodes representing individual banks; associated with each node is a balance sheet consisting of assets and …
The problem of bipartite ranking, where instances are labeled positive or negative and the goal is to learn a scoring function that minimizes the probability of mis-ranking a pair of positive and negative instances (or equivalently, that maximizes the area under the ROC curve), has been widely studied in recent years. …
Optimizing noise variance in VAEs balances reconstruction quality and prior regularisation.
problem Balancing reconstruction quality and prior regularisation in VAEs.
method Learning the noise variance in the Gaussian likelihood to balance the ELBO loss.
result Optimizing noise variance improves VAE-generated sample quality and uncertainty.
Actuaries tackle loss of earning capacity in Denmark, balancing public benefits and private insurance.
problem Balancing public benefits and private insurance for loss of earning capacity in Denmark.
method Innovative approaches from researchers and practitioners, leveraging actuarial expertise.
result Development of equitable, data-driven solutions to mitigate risk and enhance societal well-being.
A new method detects and removes false trailing balances in credit data.
problem False trailing balances in credit data corrupt risk event timing.
method TruEnd-procedure defines and removes false trailing balances.
result Improved accuracy in predicting risk events and reducing credit losses.
Proposes a method to create fair ITRs that balance value and fairness.
problem Fairness issues in ITRs that can lead to unfair advantages or disadvantages.
method Optimal transport theory to transform optimal ITRs into fair ITRs.
result Established a theoretical upper bound on value loss for improved trade-off ITRs.
Sparse grid method improves risk measurement for financial and insurance companies.
problem Measuring risk in financial and insurance balance sheets.
method Sparse grid approximation for numerical estimation of loss distribution.
result Sparse grid approach is more efficient and competitive for models with moderate dimension.
We propose a generalization of the classical notion of the V@Rλ that takes into account not only the probability of the losses, but the balance between such probability and the amount of the loss. This is obtained by defining a new class of law invariant risk measures based on an appropriate family of acceptance set…
Paper tackles regression with cost-based rejection, balancing prediction and rejection costs.
problem Regression with cost-based rejection, balancing prediction and rejection costs in a continuous target space.
method Formulated expected risk, derived Bayes optimal solution, proposed surrogate loss function.
result Bayes optimal solution can be recovered by the proposed surrogate loss function.
Develops a direct debiased machine learning framework using Bregman divergence.
problem Reduces bias in machine learning estimates of causal effects or structural models.
method Neyman targeted estimation and generalized Riesz regression using Bregman divergence.
result Improves estimation of parameters of interest in causal models.
New method converts conventional ANNs to SNNs with minimal loss and efficiency.
problem Difficulty in training SNNs directly from conventional ANNs due to discreteness.
method Proposes a novel pipeline combining threshold balance and soft-reset mechanisms for efficient conversion.
result Achieves almost no accuracy loss with only 1/10 of typical SNN simulation time.
New algorithm balances limited resources for unknown customer types over time.
problem Allocating limited resources to diverse customers with uncertain demands.
method Synthesizes inventory balancing and online learning.
result Performance guarantee is tight, showing both competitive ratio and regret losses are relevant.
Paper finds exact Hessian sharpness in deep matrix factorization.
problem Understanding the geometry of loss landscapes in deep matrix factorization.
method Presented the first exact expression for Hessian maximum eigenvalue.
result Spectral-norm balance is a sufficient condition for flatness in deep matrix factorization.