{"paper_id":"2403.15243","title":"Robust Utility Optimization via a GAN Approach","authors":["Florian Krach","Josef Teichmann","Hanna Wutte"],"paper_date":"2024-03-22","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2403.15243v2","page_url":"https://thequant.space/flowcharts/robust-utility-optimization-via-a-gan-approach/","scores":{"empirical_rigor":7.5,"math_complexity":8,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a generative adversarial network (GAN) approach to solve robust utility optimization problems in realistic market settings with trading costs.","quote":"In this work, we propose a generative adversarial network (GAN) approach to (approximately) solve robust utility optimization problems in general and realistic settings.","summary":"Robust utility optimization enables an investor to deal with market uncertainty in a structured way, with the goal of maximizing the worst-case outcome. In this work, we propose a generative adversarial network (GAN) approach to (approximately) solve robust utility optimization problems in general…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Both the actor and the market networks only receive current stock prices and portfolio value as input, not each other's outputs.","type":"market","stated":"explicit","quote":"both the actor and the market network only get the current stock prices as well as the current portfolio value as input, but not the outputs of each other."},{"assumption":"Utility functions are continuous and can be any shape (e.g., log, power).","type":"model","stated":"explicit","quote":"This approach is applicable for any continuous utility function"},{"assumption":"Path‑wise constraints are imposed on the adversarial market measures.","type":"model","stated":"explicit","quote":"We introduce fairly general, path-wise constraints for adversarial market measures"},{"assumption":"Training data consist of Gaussian increments.","type":"data","stated":"explicit","quote":"D {training set of gaussian increments}"},{"assumption":"Early stopping based on validation metrics approximating worst‑case expected utility.","type":"other","stated":"explicit","quote":"we make use of this by early stopping criteria based on validation metrics approximating the worst-case expected utility"}]},"datasets":{"status":"available","items":[{"name":"Gaussian increments","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"D {training set of gaussian increments}"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"synthetic"},"transaction_costs":{"status":"available","modeled":"yes","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R1","candidates":{"front_matter":"yes","evidence_card":"unclear","evidence_card_quoted":false},"meaning":"costs are part of the reported headline results"},"results":{"status":"available","evaluation_type":"trading-pnl","findings":[{"finding":"GAN approaches successfully recover optimal strategies in multi‑asset friction‑less markets with log utilities.","kind":"performance","quote":"We empirically show that the GAN approaches successfully recover the optimal strategies in multi-asset, friction-less markets with log utilities."},{"finding":"With trading costs, GAN‑based robust strategies outperform explicit friction‑less solutions.","kind":"performance","quote":"we found that with trading costs, GAN-based robust strategies outperform explicit strategies that were obtained as solutions in the friction-less setting."},{"finding":"Non‑robustly trained GAN strategies exhibit robust behavior by reducing risky investments compared to asymptotically optimal strategies.","kind":"performance","quote":"even non-robustly trained GAN-based strategies displayed robust behavior, meaning that they learned to overall reduce risky investments compared to asymptotically optimal investment strategies"},{"finding":"Feed‑forward and recurrent neural network architectures yield comparable performance.","kind":"performance","quote":"we saw comparable performance with feed-forward and recurrent NN architectures"},{"finding":"Fully robust GAN strategy outperforms non‑robust GAN and pure bank‑account strategies in noisy market evaluations.","kind":"performance","quote":"other strategies in the evaluation with noisy markets"}],"reported_performance":null,"out_of_sample":{"method":"holdout","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":48,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":true,"code_url":"https://github.com/FlorianKrach/RobustUtilityOptimizationGAN","note":null},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":1,"extracted_at":"2026-11-14T18:12:40Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}