Transfer learning improves portfolio optimization by identifying transfer risk.
problem Financial portfolio optimization problem.
method Introduces transfer risk concept within transfer learning framework.
result Transfer risk is a significant indicator of transferability and enhances portfolio management efficiency.
Paper analyzes transfer risk in transfer learning for finance.
problem Evaluate transferability of transfer learning in finance.
method Proposes transfer risk concept and applies to stock return prediction and portfolio optimization.
result Transfer risk correlates with transfer learning performance and identifies appropriate source tasks.
Mathematical framework for transfer learning feasibility and transfer risk.
problem Theoretical analysis of transfer learning.
method Reformulated transfer learning as an optimization problem, introduced transfer risk concept.
result Demonstrated the potential and benefits of incorporating transfer risk in transfer learning evaluation.
New estimator achieves minimax optimal risk in transfer learning.
problem Nonparametric regression with transfer learning.
method Confidence thresholding estimator and data-driven adaptive algorithm.
result Adaptive algorithm achieves minimax risk up to a logarithmic factor.
Extends SORTE to multivariate risk functions.
problem Analyzing systemic risk in financial institutions or insurance-reinsurance markets.
method Develops a new framework for multivariate utility functions and applies duality theory.
result Proves existence, uniqueness, and Nash Equilibrium property of Multivariate Systemic Optimal Risk Transfer Equilibrium.
SORTE optimizes systemic performance over individual rationality.
problem Systemic risk and optimal risk transfer.
method Endogenous determination of budget constraints through systemic utility maximization.
result Existence, uniqueness, and Pareto optimality of SORTE.
Develops estimators for near-optimal linear regression under distribution shift.
problem Linear regression under distribution shift with scarce target domain data.
method Minimax linear risk estimators covering various transfer learning settings.
result Achieves near-optimal risk for linear regression problems under distribution shift.
Paper extends transfer learning for decision rules, improving treatment rule estimation.
problem Estimating optimal individualized treatment rules under changing conditions.
method Bayes decision rules and low-dimensional empirical risk minimization.
result Consistent estimators and risk bounds established under mild conditions.
New method tackles concept shifts in nonparametric regression using robust and adaptive transfer learning.
problem Concept shifts and sample scarcity in target domains hinder nonparametric regression.
method Robust and adaptive transfer learning procedure leveraging fixed bandwidth Gaussian kernels.
result Spectral algorithms with fixed bandwidth Gaussian kernels attain minimax convergence rates for nonparametric regression.
Algorithmic insurance tackles financial risks from AI errors, proving CVaR-optimal thresholds reduce tail risk.
problem High-stakes AI errors lead to heterogeneous losses, challenging traditional insurance assumptions.
method Analyzed binary classification performance to tail risk exposure, using CVaR to quantify extreme losses.
result CVaR-optimal thresholds reduce tail risk up to 13-fold compared to accuracy maximization.
Paper proposes methods for transfer learning with random coefficient ridge regression.
problem Estimation and prediction in high-dimensional settings with related models.
method Two estimators using weighted sums of ridge estimates from target and source models.
result Explicit expression of estimation and prediction risks derived using random matrix theory.
SATL adapts to varying smoothness in hypothesis transfer learning.
problem Fixed kernel regularization fails in varying smoothness settings.
method Proposes SATL, a two-phase KRR algorithm with adaptive Gaussian kernels.
result SATL achieves minimax optimality with matching upper and lower bounds.
In this paper we will discuss the optimal risk transfer problems when risk measures are generated by G-expectations, and we present the relationship between inf-convolution of G-expectations and the inf-convolution of drivers G.
Optimal feature transfer identified through bias-variance analysis.
problem Optimizing feature transfer in transfer learning.
method Simple linear model with fine-grained bias-variance decomposition.
result Optimal pretrained feature transform is naturally sparse.
This paper optimizes insurance reinsurance design under solvency constraints.
problem Optimizing risk transfer from an insurance company to a reinsurer under solvency constraints.
method Martingale method to derive optimal reinsurance design maximizing terminal value of surplus.
result Optimal reinsurance designs include a combination of proportional and stop-loss protection.
New method identifies optimal subset of stable information to transfer for better model generalization.
problem Non-reliability of machine learning models to dataset shifts.
method Causal minimax learning approach to identify optimal subset of stable information.
result Proposed algorithm efficiently searches for optimal subset with minimal worst-case risk.
Develops a Bonus-Malus model for cyber risk insurance to incentivize cybersecurity.
problem Lack of effective insurance strategies to incentivize cybersecurity.
method Proposes a Bonus-Malus model and a mathematical model with a numerical algorithm.
result Demonstrates how a Bonus-Malus system resolves moral hazard and benefits the insurer.
Paper tackles robust knowledge transfer in parallel RL tasks.
problem Transfer knowledge from low-tier to high-tier tasks in parallel RL without shared dynamics or reward functions.
method Identifies Optimal Value Dominance condition and proposes online learning algorithms for both tasks.
result Achieves constant regret on partial states and near-optimal regret when tasks are dissimilar.
Pareto optimal centralized risk sharing with multiple agents
problem Centralized risk sharing with endogenous prices
method Inclusive and fair Pareto optimality
result Equivalence between inclusive and fair Pareto optimality and balanced sequential optimization
Study discovers rules linking patient symptoms to unplanned ICU transfers.
problem Identifying patients at risk for unplanned ICU transfers.
method Mixed-integer optimization approach to learn association rules.
result Significant rules discovered for each patient subgroup.
Paper tackles robust transfer learning with unreliable source data.
problem Challenges in robust transfer learning stemming from ambiguity in Bayes classifiers and weak transferable signals.
method Introduces ambiguity level, proposes Transfer Around Boundary (TAB) model, establishes general theorem.
result Demonstrates efficiency and robustness of TAB model improving classification while avoiding negative transfer.
Paper optimizes trading strategies by creating shadow prices for markets with transaction costs.
problem Optimizing trading strategies in markets with transaction costs.
method Developed shadow prices to simplify optimization into a frictionless market, considering second-order transaction costs.
result Alternative strategies outperform shadow prices for risk aversion different from one.
Trans-GLMC tackles source heterogeneity in transfer learning for structured clusters.
problem Source heterogeneity makes it hard to use multiple related auxiliary sources effectively.
method Trans-GLMC constructs clusters of sources, then combines global fusion, within-cluster refinement, and target debiasing.
result Improves facility-specific prediction and identifies interpretable communities of hospitals with mutual transferability.
Transfer learning and data augmentation improve stock classification performance.
problem Challenges in stock classification due to noise and volatility.
method Pre-trained model on S&P500 index features, transfer learning to new models, data augmentation on feature space.
result Augmentation on feature space leads to 20% increase in risk-adjusted returns.
Paper proposes a statistical test for transfer learning in linear regression.
problem Theoretical framework for parameter transfer in linear regression.
method Developed a statistical test to predict transfer quality.
result The test can predict if a fine-tuned model has lower prediction risk.
Study shows benefits of transfer learning with neural networks.
problem Understanding generalization errors in transfer learning.
method Mean-field analysis applied to α-ERM and fine-tuning. result Established conditions for generalization error and convergence rates.
Model assesses credit risk using behavioral data from Experian and Bank of Italy.
problem Improving credit risk assessment in financial institutions.
method Statistical and machine learning techniques applied to behavioral data from Experian and Bank of Italy.
result Demonstrates transferability of the model from private to central data.
Novel model improves clinical risk prediction by transferring knowledge between tasks over time.
problem Negative transfer in multi-task learning for clinical risk prediction.
method Temporal Probabilistic Asymmetric Multi-Task Learning (TPAMTL).
result Significantly outperforms various deep learning models for time-series prediction.
Framework improves risk neutral density estimation in illiquid markets.
problem Challenges in estimating Risk Neutral Density in illiquid markets.
method Introduces Deep Log-Sum-Exp Neural Network leveraging Deep and Transfer learning.
result Framework recovers Risk Neutral Density with few option quotes in severe illiquidity.
A new boosting method reduces overfitting and negative transfer in transfer learning.
problem Overfitting and negative transfer in transfer learning.
method Importance sampling in boosting and random-forest based ensemble methodology.
result Performs better than competitive transfer learning methodologies 63% of the time.
Unified approach for sample aggregation in transfer learning across various divergence measures.
problem Optimizing sample aggregation from source to target distributions for improved target performance.
method Unified algorithmic approach that adapts to multiple divergence measures via a weak modulus of transfer.
result Unified approach achieves near optimal rates in terms of the unknown strong modulus, applicable in more general settings.
The study models and values CAT bonds across multiple regions.
problem Valuation of CAT bonds with dependencies across different regions.
method Developed models for independent, proportional, and arbitrary two-dimensional distribution cases of catastrophe losses in different areas. Applied normal approximation and Wang's transform for pricing.
result Illustrated differences in scenarios and performance of the approximation on real data.
A novel transfer learning framework combines multiple data sources for PU learning.
problem Challenges in PU learning due to lack of negative labels and data scarcity.
method Model averaging of heterogeneous data sources, including binary labeled, semi-supervised, and PU data.
result Method outperforms other methods in predictive accuracy and robustness, especially under limited labeled data.
The study analyzes transfer learning using information theory.
problem Transfer learning in different distributions.
method Information-theoretic analysis, focusing on KL divergence.
result Upper bounds for general transfer learning algorithms and specific ERM.
This paper introduces a new transfer learning method for regression.
problem Boosting predictive power in scenarios with scarce data.
method Affine model transfer, following expected-square loss minimization.
result The affine model transfer method encompasses various existing methods and clarifies its theoretical properties.
Framework improves target domain prediction using quantile matching.
problem Improving prediction accuracy in data-scarce target domains.
method Conditional quantile matching for distributional alignment.
result Empirical risk minimizer achieves tighter excess risk bound.
Novel AMP framework for multi-environment transfer learning.
problem Characterizing risk of Lasso-based transfer learning estimators.
method Multi-Environment Generalized Long AMP (multi-environment GLAMP) framework.
result Precise characterization of the risk of three Lasso-based transfer learning estimators.
Study optimizes insurance and investment strategies for risk-averse insurers under ambiguity.
problem Optimizing insurance and investment strategies for risk-averse insurers under ambiguity.
method Solves a coupled FBSDE to derive optimal strategies and value function.
result Optimal consumption, investment, and reinsurance strategies influenced by risk aversion and EIS.
We consider the Hypothesis Transfer Learning (HTL) problem where one incorporates a hypothesis trained on the source domain into the learning procedure of the target domain. Existing theoretical analysis either only studies specific algorithms or only presents upper bounds on the generalization error but not on the exc…
It had been believed in the conventional practice that the risk of a bank going bankrupt is lessened in a straightforward manner by transferring the risk of loan defaults. But the failure of American International Group in 2008 posed a more complex aspect of financial contagion. This study presents an extension of the …
We establish linear regret bounds for convex smooth losses using Fenchel-Young losses.
problem Establishing linear regret bounds for convex smooth losses.
method Constructing a convex smooth surrogate loss using Fenchel-Young losses generated by the convolutional negentropy.
result We derive a smooth loss with a linear surrogate regret bound.
This paper aims to optimize incident-specific cyber insurance design.
problem Complexity in determining optimal risk retention and transfer.
method Economic foundation for incident-specific cyber insurance with Pareto optimality.
result Illustrates feasibility of designing incident-specific indemnities for both parties.
Agent learns to trade currency pairs with improved risk management.
problem Improving systematic FX trading performance with online transfer learning.
method Online inductive transfer learning using feature representation from Gaussian mixture model to a reinforcement learning agent.
result Annualized portfolio information ratio of 0.52, compound return of 9.3%.
A new framework for robust transfer learning that avoids negative transfer in domains with unequal information.
problem Negative transfer in unsupervised domain adaptation, especially when source and target domains have different levels of informativeness.
method Decision-theoretic framework based on Le Cam's theory of statistical experiments, using constructive approximations to replace strict invariance with directional simulability.
result Le Cam Distortion achieves near-perfect frequency estimation and zero source utility loss in various domains, demonstrating superior performance compared to traditional methods.
LOL-GP model improves surrogate modeling of expensive simulators.
problem Costly computer simulations for complex systems.
method Local transfer learning Gaussian process.
result Improved surrogate performance over existing methods.
Proposes a decentralized insurance protocol for DeFi.
problem Over-insurance and inefficiencies in DeFi collateral.
method Smart contract-based economic model without external dependencies.
result Solves over-insurance and capital inefficiencies.
A new class of risk measures called cash sub-additive risk measures is introduced to assess the risk of future financial, nonfinancial and insurance positions. The debated cash additive axiom is relaxed into the cash sub additive axiom to preserve the original difference between the numeraire of the current reserve amo…
Training a source model optimally for its own task is suboptimal for downstream transfer.
problem The optimality of a source model for its own task hinders downstream transfer performance.
method Analyzes L2-SP ridge regression, characterizes transfer-optimal source penalty, and identifies alignment-dependent effects.
result Transfer benefits from stronger source regularization when aligned imperfectly, and from weaker regularization when aligned perfectly.