A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
We present a fast and scalable algorithm to induce non-monotonic logic programs from statistical learning models. We reduce the problem of search for best clauses to instances of the High-Utility Itemset Mining (HUIM) problem. In the HUIM problem, feature values and their importance are treated as transactions and util…
Study optimal control strategy for hedge funds managers with PSAHARA utility family.
problem Optimizing risk and reward in incomplete markets with non-monotone risk aversion and convex compensation.
method Introduced PSAHARA utility family to model non-monotone risk aversion and convex compensation. Proved concavification techniques for non-concave utility functions. Derived explicit optimal control strategy.
result PSAHARA utility induces risk-taking behavior even with convex compensation, leading to high returns and volatility.
The accumulation of individual fitness or wealth is modelled as a population game in which pairs of individuals are recurrently and randomly matched to play a game over a resource. In addition, all individuals have random access to a constant background resource, and their fitness or wealth depreciates over time. For b…
In industrial environments, an increasing amount of wireless devices are used, which utilize license-free bands. As a consequence of these mutual interferences of wireless systems might decrease the state of coexistence. Therefore, a central coexistence management system is needed, which allocates conflict-free resourc…
Learning performance can show non-monotonic behavior. That is, more data does not necessarily lead to better models, even on average. We propose three algorithms that take a supervised learning model and make it perform more monotone. We prove consistency and monotonicity with high probability, and evaluate the algorit…
Subjective expected utility theory assumes that decision-makers possess unlimited computational resources to reason about their choices; however, virtually all decisions in everyday life are made under resource constraints - i.e. decision-makers are bounded in their rationality. Here we experimentally tested the predic…
We study a resource utilization scenario characterized by intrinsic fitness. To describe the growth and organization of different cities, we consider a model for resource utilization where many restaurants compete, as in a game, to attract customers using an iterative learning process. Results for the case of restauran…
Diminishing-returns (DR) submodular optimization is an important field with many real-world applications in machine learning, economics and communication systems. It captures a subclass of non-convex optimization that provides both practical and theoretical guarantees. In this paper, we study the fundamental problem of…
The information dynamics in finance and insurance applications is usually modeled by a filtration. This paper looks at situations where information restrictions apply such that the information dynamics may become non-monotone. A fundamental tool for calculating and managing risks in finance and insurance are martingale…
We study a portfolio optimization problem for competitive agents with CRRA utilities and a common finite time horizon. The utility of an agent depends not only on her absolute wealth and consumption but also on her relative wealth and consumption when compared to the averages among the other agents. We derive a closed …
In this work we construct Calabi quasi-morphisms on the universal cover of the group Ham(M) of Hamiltonian diffeomorphisms for some non-monotone symplectic manifolds. This complements a result by Entov and Polterovich which applies in the monotone case. Moreover, in contrast to their work, we show that these quasi-morp…
Differentially private algorithms for submodular maximization under various constraints.
problem Maximizing decomposable submodular functions under constraints while preserving privacy.
method Designing differentially private algorithms for both monotone and non-monotone decomposable submodular maximization under general matroid constraints.
result Improved utility guarantees and competitive performance compared to non-private algorithms.
Large multi-tenant production clusters often have to handle a variety of jobs and applications with a variety of complex resource usage characteristics. It is non-trivial and non-optimal to manually create placement rules for scheduling that would decide which applications should co-locate. In this paper, we present De…
In this paper, we study fundamental problems of maximizing DR-submodular continuous functions that have real-world applications in the domain of machine learning, economics, operations research and communication systems. It captures a subclass of non-convex optimization that provides both theoretical and practical guar…
A mathematical analysis of the distribution of voting power in the Council of the European Union operating according to the Treaty of Lisbon is presented. We study the effects of Brexit on the voting power of the remaining members, measured by the Penrose--Banzhaf Index. We note that the effects in question are non-mon…
The paper analyzes Variable Annuities with surrender charges, providing a pricing formula and optimal exercise boundary.
problem Analyzing Variable Annuities with surrender charges and early termination rights.
method Formulated as an optimal stopping problem with a discontinuous payoff, non-monotonic optimal stopping boundaries are proven continuous and regular.
result A rigorous pricing formula and optimal exercise boundary for surrender options are derived.