Zachary Feinstein

dblp:155/8639 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
2since 2021 · last 2024
0000-0002-6733-5724ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
YearPublicationVenuePosition
2024 Large Language Model in Financial Regulatory Interpretation
abstract
This study explores the innovative use of Large Language Models (LLMs) as analytical tools for interpreting complex financial regulations. The primary objective is to design effective prompts that guide LLMs in distilling verbose and intricate regulatory texts, such as the Basel III capital requirement regulations, into a concise mathematical framework that can be subsequently translated into actionable code. This novel approach aims to streamline the implementation of regulatory mandates within the financial reporting and risk management systems of global banking institutions. A case study was conducted to assess the performance of various LLMs, demonstrating that GPT-4 outperforms other models in processing and collecting necessary information, as well as executing mathematical calculations. The case study utilized numerical simulations with asset holdings - including fixed income, equities, currency pairs, and commodities - to demonstrate how LLMs can effectively implement the Basel III capital adequacy requirements.
Zhiyu Cao, Zachary Feinstein
CIFEr2
2024 Deep learning the efficient frontier of convex vector optimization problems
abstract
Abstract In this paper, we design a neural network architecture to approximate the weakly efficient frontier of convex vector optimization problems (CVOP) satisfying Slater’s condition. The proposed machine learning methodology provides both an inner and outer approximation of the weakly efficient frontier, as well as an upper bound to the error at each approximated efficient point. In numerical case studies we demonstrate that the proposed algorithm is effectively able to approximate the true weakly efficient frontier of CVOPs. This remains true even for large problems (i.e., many objectives, variables, and constraints) and thus overcoming the curse of dimensionality.
Zachary Feinstein, Birgit Rudloff
J. Glob. Optim.1
2017 A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle
Zachary Feinstein, Birgit Rudloff
J. Glob. Optim.1