Study adds investment gains and losses to recursive utility model, proving existence and uniqueness of utility process.
problem Existence and uniqueness of utility process in a recursive utility model with investment gains and losses.
method Generalized recursive utility model with constant elasticity of intertemporal substitution and relative risk aversion degree. Proved existence and uniqueness in a specific, finite-state Markovian setting.
result Utility process exists and is unique when agent derives nonnegative gain-loss utility, and non-existent or non-unique otherwise.
Study asset pricing with reference-dependent preferences, finding matching equity premia.
problem Understanding asset pricing under reference-dependent preferences.
method Discrete-time consumption-based capital asset pricing model with reference-dependent preferences.
result Models can generate equity premia matching empirical estimates, showing procyclical price-dividend ratio and countercyclical equity premium.
Active inference minimizes expected free energy for optimal behavior.
problem Understanding and optimizing behavior in complex systems.
method Combines Bayesian decision theory, optimal Bayesian design, and the free energy principle.
result Active inference emerges as a unified framework for information-seeking, utility maximization, and goal-directed behavior.
This study found significant asymmetry between potential maximum gain and loss in asset returns, improving predictability and utility for investors.
problem Understanding the economic value of price extremes in asset returns.
method Decomposing asset returns into PMG and PML, analyzing relationships and asymmetry, and testing predictive power.
result Significant asymmetry between PMG and PML, improving asset return predictability and utility for investors.
We develop a tractable model of realization utility that studies the role of reference-dependent S-shaped preferences in a dynamic investment setting with reinvestment. Our model generates both voluntarily realized gains and losses. It makes specific predictions about the volume of gains and losses, the holding periods…
Expands Bayesian experiment design framework to account for model discrepancies.
problem Model misspecification in Bayesian optimal experiment design.
method Introduces Expected General Information Gain and Expected Discriminatory Information criteria.
result Demonstrates improved robustness and detection capabilities in experiment design.
Novel framework for portfolio selection considering utility and risk.
problem Maximizing utility subject to risk constraints with various utility and risk functionals.
method General framework accommodating non-concave utilities and non-convex risk measures. Characterization of well-posedness using a simple either-or criterion.
result Minimal condition for well-posedness: either utility or risk must be sensitive to large losses.
This paper examines an optimal investment problem in a continuous-time (essentially) complete financial market with a finite horizon. We deal with an investor who behaves consistently with principles of Cumulative Prospect Theory, and whose utility function on gains is bounded above. The well-posedness of the optimisat…
Motivated by the AIG bailout case in the financial crisis of 2007-2008, we consider an insurer who wants to maximize the expected utility of the terminal wealth by selecting optimal investment and risk control strategies. The insurer's risk process is modelled by a jump-diffusion process and is negatively correlated wi…
Optimizes decision-making with variational Bayesian methods for continuous utilities.
problem Inference approximations for continuous utilities without full posterior knowledge.
method Automatic pipeline that co-opts continuous utilities into variational inference algorithms.
result Consistent improvement in decision-making when calibrating approximations for specific utilities.
PC-GAIN improves GAIN's imputation by incorporating category information.
problem Missing data in incomplete datasets.
method Pre-training with pseudo-labels and incorporating an auxiliary classifier into GAIN.
result Significantly improved imputation quality compared to GAIN.
New guarantees for adaptive combinatorial maximization with various objectives.
problem Maximizing under cardinality constraints and minimum cost coverage in adaptive settings.
method Bayesian approach with comprehensive approximation guarantees for various utility functions.
result Maximal gain ratio is a new parameter that provides stronger approximation guarantees than greedy policies.
In this article we consider an optimization problem of expected utility maximization of continuous-time trading in a financial market. This trading is constrained by a benchmark for a utility-based shortfall risk measure. The market consists of one asset whose price process is modeled by a Geometric Brownian motion whe…
Study examines how liquidity constraints impact optimal retirement decisions.
problem Impact of liquidity constraints on optimal retirement decisions.
method Analytical solution using duality method with different liquidity constraints.
result Sensitivity analysis reveals the effect of liquidity constraints on retirement decisions.
Neural networks approximate random utility models for choice prediction.
problem Approximating random utility models with neural networks.
method RUMnets, a neural network-based model inspired by RUM framework.
result RUMnets can approximate any RUM model arbitrarily closely and vice versa.
New algorithm for privacy-preserving nonconvex optimization.
problem Privacy-preserving nonconvex empirical risk minimization.
method Differentially private stochastic gradient descent algorithm.
result Achieves strong privacy guarantees efficiently with improved utility.
This paper proposes AI-based solutions for optimizing semiconductor manufacturing processes.
problem Optimizing semiconductor manufacturing processes with advanced analytics.
method Evolutionary Computing and Deep Learning algorithms for feature selection and neural networks.
result Advanced algorithm for intelligent feature selection in semiconductor manufacturing.
AdaS adapts SGD learning rate based on knowledge gain metrics.
problem Empirical step-size selection in SGD optimization lacks consistency and insight.
method Introduces AdaS algorithm that adapts SGD learning rate based on knowledge gain metrics.
result AdaS outperforms existing adaptive learning methods in convergence and generalization.
This paper seeks to answer the question: as the (near-) orthogonality of weights is found to be a favorable property for training deep convolutional neural networks, how can we enforce it in more effective and easy-to-use ways? We develop novel orthogonality regularizations on training deep CNNs, utilizing various adva…
The Kelly Criterion is applied to prediction markets to analyze risk and return.
problem Mean beliefs in prediction markets often differ from actual prices.
method Logarithmic utility and Kullback-Leibler divergence are used to study risk and return adjustments.
result Misjudgment of bias and investment fraction affect portfolio growth rate.
Adversaries with multiple antennas can fool deep learning modulators more effectively.
problem Improving evasion attacks on deep learning-based modulation classifiers.
method Utilizing multiple antennas to enhance adversarial attacks on deep learning classifiers.
result Adversarial attacks with multiple antennas significantly improve classifier accuracy.
Modeling business expansion as a stochastic control problem, the study finds that firms are incentivized to expand but may wait.
problem Optimizing business expansion under exposure constraints and opportunity costs.
method Formulated as a novel stochastic control problem combined with optimal stopping time, derived an explicit solution for exponential utility.
result Firms are incentivized to expand but may wait due to opportunity costs and other factors.
Algorithm samples fair rankings to ensure individual fairness while maintaining group fairness.
problem Fair ranking tasks with group fairness constraints and uncertainty in item utilities.
method Efficient algorithm that samples rankings from an individually-fair distribution ensuring group fairness.
result Expected utility of output ranking is at least α times optimal fair solution, where α depends on utilities and constraints.
Reinsurance can help life insurers maintain higher capital guarantees without losing utility.
problem Decreasing capital guarantees in life insurance products.
method Dynamic investment-reinsurance optimization problem with simultaneous Value-at-Risk and no-short-selling constraints. Introduced guarantee-equivalent utility gain for comparison.
result Optimally managed reinsurance allows insurers to offer higher capital guarantees without reducing expected utility.
PDBAL targets experiments for probabilistic models to maximize insights.
problem Designing experiments to yield valuable insights efficiently.
method Combines user-specified risk function with probabilistic model to adaptively choose designs.
result PDBAL consistently outperforms standard approaches in simulations and real-world drug screen data.
Modified Jones-Faddy skew t-distribution captures asymmetry in stock returns.
problem Negative skew and positive mean in stock returns due to broken symmetry of stochastic volatility.
method Modified Jones-Faddy skew t-distribution applied to split gains and losses, using stochastic differential equations for stock returns and volatility.
result The modified distribution effectively captures the asymmetry in daily S&P500 returns, including its tails.
New method assesses prediction intervals across different operating points.
problem Difficulty in comparing prediction intervals across studies.
method Operating characteristics curves and gain over a simple reference.
result A novel operating point agnostic assessment methodology for prediction intervals.
Supply Chain Management often requires independent organizations to work together to achieve shared objectives. This collaboration is necessary when coordinated actions benefit the group more than the uncoordinated efforts of individual firms. Despite the commonly reported benefits that can be gained in close relations…
Unified approach for Bayesian optimal experiment design using stochastic gradients.
problem Designing optimal experiments in high-dimensional settings.
method Stochastic gradient ascent to optimize variational lower bounds on expected information gain.
result Unified approach outperforms existing methods in higher dimensions.
Machine learning improves portfolio allocation between index and risk-free assets.
problem Finding optimal portfolio rules for time-varying returns and volatility.
method Two Random Forest models: one for sign probabilities of excess return, the other for optimized volatility.
result Substantial improvements in utility, risk-adjusted returns, and maximum drawdowns over buy-and-hold.
This paper tackles batch Bayesian optimal experimental design by using Wasserstein gradient flows.
problem The challenge of optimising high-dimensional, strongly non-convex expected information gain in batch settings.
method Probabilistic lifting to the space of probability measures, entropic regularisation, Wasserstein gradient flow, and particle-based algorithms.
result The proposed approach can be used directly as a randomised batch-design policy or as a computational relaxation.
Optimizes reinforcement learning by prioritizing sets of samples over individual ones.
problem Limits exploration and improvement on harder examples due to focusing on isolated samples.
method Proposes Pass@K Policy Optimization (PKPO) to optimize for sets of samples that maximize reward when considered jointly.
result Optimization with novel low variance unbiased estimators for pass@k and its gradient leads to significant pass@k gains.
Study finds multi-task learning and pre-training can improve healthcare models on EHR data.
problem Improving model performance on diverse EHR tasks using multi-task learning.
method Examined multi-task learning across various EHR tasks and training schemes, using pre-training and fine-tuning.
result Significant gains in model performance achieved via multi-task pre-training and single-task fine-tuning.
FairPOT balances fairness and AUC performance by selectively transforming risk scores.
problem Balancing fairness and AUC performance in high-stakes domains.
method FairPOT uses proportional optimal transport to selectively transform risk scores.
result FairPOT consistently improves fairness with minimal AUC degradation or even positive gains.
Develops a Bayesian framework for portfolio choice with a new posterior distribution.
problem Estimation risk in parametric portfolio policies.
method Generalized Bayesian framework with Gibbs posterior, utility maximization, and KNEEDLE algorithm.
result Optimal scaling parameter λ controls the balance between prior and data. The paper suggests using derivatives instead of stocks for better utility and risk management.
problem The use of stocks in portfolio construction is challenged.
method The study uses the Black--Scholes--Merton setting to demonstrate the benefits of derivatives for maximizing utility and minimizing risk.
result Two derivatives are sufficient to maximize utility and minimize risk exposure in a two-asset portfolio.
This study shows unstructured clinical notes can improve mortality prediction.
problem Lack of effective use of unstructured clinical notes in mortality prediction.
method Used a hierarchical architecture with convolutional and recurrent layers to predict in-hospital mortality from unprocessed clinical notes.
result Achieved higher metrics in mortality prediction compared to structured data approaches.
Proposes a framework for modeling RTB auctions using point processes.
problem Modeling and optimizing repeated auctions in the RTB ecosystem.
method Develops a stochastic framework using point processes to model and optimize RTB auctions.
result The proposed framework can be approximated to a Poisson point process, enabling the use of established properties.
Study finds no consistent return predictability using payout ratios across 16 countries.
problem Return predictability using payout ratios in various markets.
method Analysis of 16 developed countries' bond, equity, and housing markets using payout-price ratios.
result No consistent in-sample and out-of-sample performance with positive utility gain.
We study the gain of an insider having private information which concerns the default risk of a counterparty. More precisely, the default time τis modelled as the first time a stochastic process hits a random barrier L. The insider knows this barrier (as it can be the case for example for the manager of the counterpart…
Investigates optimal PPI strategies to reduce carbon emissions while managing financial risk.
problem Optimizing portfolio insurance strategies to mitigate carbon emissions.
method Modelled risky assets using stochastic factor model with partial information, solved optimization problem using CRRA utility function.
result Optimal carbon penalized PPI strategies reduce carbon emissions without sacrificing financial performance.
MSNet uses high frequency residual learning for efficient multi-scale image classification.
problem Efficient multi-scale image classification for mobile and embedded devices.
method Two network architecture: low resolution for low frequency, high resolution for high frequency residuals.
result MSNet achieves significant accuracy improvements over different base networks.
Optimizes investment under uncertain time horizons with non-concave utility.
problem Optimizing investment decisions with non-concave utility and uncertain time horizons.
method Established necessary and sufficient conditions for optimality, suggested recursive procedure for non-concave utility.
result Optimal investment strategies under uncertain time horizons exhibit multimodal distribution, indicating flexibility in switching between local maximizers.
Study analyzes broker's gain from trade in repeated context-based trading.
problem Maximizing traders' net utility in repeated context-based brokerage.
method Proposes algorithms achieving tight regret bounds in full and limited feedback settings.
result Achieves tight 1/2-approximation result for gain from trade.
Differentially private random block coordinate descent improves utility in machine learning.
problem Lack of privacy in classical CD methods when handling sensitive information.
method Proposes a differentially private random block coordinate descent method using sketch matrices and importance sampling.
result Demonstrates improved convergence rates and utility guarantees compared to non-private methods.
Gradient-free framework for Bayesian experimental design in complex systems.
problem Optimal experimental design in systems where gradient information is unavailable.
method Combines EKI and ALDI for optimization and sampling, with approximations for scalable utility estimation.
result Demonstrates robust, accurate, and efficient experimental design in various complex systems.
It is of increasing importance to develop learning methods for ranking. In contrast to many learning objectives, however, the ranking problem presents difficulties due to the fact that the space of permutations is not smooth. In this paper, we examine the class of rank-linear objective functions, which includes popular…
Paper improves privacy and utility of SGD with bounded domain and smooth losses.
problem Lack of tight privacy bounds and practical assumptions in DPSGD.
method Rigorous privacy characterization for DPSGD with general L-smooth and non-convex loss functions, tracking privacy loss over iterations.
result Privacy loss converges without convexity assumption for bounded domain, improving utility.