Research
On-device research index

arXiv research

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.

168,695 papers · 148 categories

Trend · papers per month

96193289385 · Jun 202019922001200920172026
48 results for value maximization

In this paper, we use replica analysis to determine the investment strategy that can maximize the net present value for portfolios containing multiple development projects. Replica analysis was developed in statistical mechanical informatics and econophysics to evaluate disordered systems, and here we use it to formula…

2018-10-15abs ↗pdf ↗

The basic financial purpose of a firm is to maximize its value. An inventory management system should also contribute to realization of this basic aim. Many current asset management models currently found in financial management literature were constructed with the assumption of book profit maximization as basic aim. H…

2013-01-16abs ↗pdf ↗

FavMac maximizes value while controlling cost in multi-label prediction.

problem Value-maximizing predictions with strict cost control in multi-label scenarios.
method FavMac pipeline combining any multi-label classifier with online update mechanism.
result FavMac achieves higher value with strict cost control compared to baselines.

Maximal extractable value in CFMMs can degrade or improve routing quality, with reordering MEV showing logarithmic impact.

problem Maximal extractable value in constant function market makers (CFMMs) and its impact on routing quality.
method Game theoretic analysis of MEV in CFMMs, constructing price of anarchy and analyzing reordering MEV.
result Conditions under which reordering MEV shows logarithmic impact, and implications for MEV searchers and CFMM designers.

The basic financial purpose of an enterprise is maximization of its value. Trade credit management should also contribute to realization of this fundamental aim. Many of the current asset management models that are found in financial management literature assume book profit maximization as the basic financial purpose. …

2013-01-16abs ↗pdf ↗

In the large financial market, which is described by a model with countably many traded assets, we formulate the problem of the expected utility maximization. Assuming that the preferences of an economic agent are modeled with a stochastic utility and that the consumption occurs according to a stochastic clock, we obta…

2014-03-24abs ↗pdf ↗

Maximal regularity for nonuniformly parabolic problems with normal degeneration.

problem Nonuniformly parabolic boundary value problems with degeneration in normal direction.
method Theory of linear parabolic differential equations on noncompact Riemannian manifolds.
result Optimal solution theory for natural degeneration case.

This work introduces uncertainty principles to mitigate Maximal Extractable Value in blockchain systems.

problem Maximal Extractable Value (MEV) in decentralized systems due to transaction submission privacy and monopolist power.
method Unified approaches via uncertainty principles, akin to harmonic analysis and physics, to quantify trade-offs between transaction flexibility and user economic payoff.
result Demonstrates a quantitative trade-off between transaction flexibility and user economic payoff, analogous to the Nyquist-Shannon sampling theorem.

In 1966, Jenkins and Serrin gave existence and uniqueness results for infinite boundary value problems of minimal surfaces in the Euclidean space, and after that such solutions have been studied by using the univalent harmonic mapping theory. In this paper, we show that there exists a one-to-one correspondence between …

2019-09-03abs ↗pdf ↗

The paper introduces SuccessProbaMax to optimize policy success probability in online advertising.

problem Optimizing policy success probability in online advertising systems.
method SuccessProbaMax algorithm that optimizes for the probability of success rather than expected value.
result SuccessProbaMax outperforms conventional algorithms in terms of success rate.

This work takes up the challenges of utility maximization problem when the market is indivisible and the transaction costs are included. First there is a so-called solvency region given by the minimum margin requirement in the problem formulation. Then the associated utility maximization is formulated as an optimal swi…

2010-03-15abs ↗pdf ↗

Optimizes information acquisition to reduce estimation risk and maximize utility.

problem Estimation risk in investor decision-making.
method Derives closed-form value functions using CARA and CRRA utility functions, employs variational methods to explore optimal acquisition.
result Acquiring information earlier is more valuable in reducing estimation risk and achieving higher utility.

Study solves utility maximization in a transient price impact market.

problem Utility maximization in a market with transient price impact.
method Developed a discrete-time model and removed market depth and resilience process restrictions.
result Solved the utility maximization problem without convexity of attainable portfolio values.

This paper aims at theoretically and empirically comparing two standard optimization criteria for Reinforcement Learning: i) maximization of the mean value and ii) minimization of the Bellman residual. For that purpose, we place ourselves in the framework of policy search algorithms, that are usually designed to maximi…

2016-06-24abs ↗pdf ↗

Maximally hyperbolic solutions contain future neighborhoods of intersecting hypersurfaces.

problem Maximally globally hyperbolic solutions of higher-dimensional vacuum Einstein equations.
method Analyzing intersections of characteristic hypersurfaces.
result Contains a future neighborhood of intersecting hypersurfaces.

Study stretch laminations in hyperbolic 3-manifolds via circle-valued maps.

problem Characterize stretch laminations in hyperbolic 3-manifolds.
method Use Thurston norm and Dehn filling slope length to determine stretch laminations as unions of core curves.
result Show existence of infinitely many examples with fibration and only closed leaves.

Solves initial boundary value problem for vacuum Einstein equations and proves geometric uniqueness.

problem Initial boundary value problem for vacuum Einstein equations.
method Formulated IBVP, solved simultaneously in local harmonic coordinates, constructed unique maximal globally hyperbolic solution.
result Vacuum spacetimes satisfying fixed initial-boundary conditions and corner conditions are geometrically unique near the initial surface.

We investigate the ergodic problem of growth-rate maximization under a class of risk constraints in the context of incomplete, Itô-process models of financial markets with random ergodic coefficients. Including {\em value-at-risk} (VaR), {\em tail-value-at-risk} (TVaR), and {\em limited expected loss} (LEL), these cons…

2007-06-04abs ↗pdf ↗

Study of elliptic boundary value problems on non-compact manifolds.

problem Analyzing elliptic differential operators on manifolds with non-compact boundaries.
method Regularity theory and trace theorems for sections in the maximal domain under various assumptions.
result Systematic study of local and nonlocal boundary conditions, including the Atiyah-Patodi-Singer condition.

We give a general formulation of the utility maximization problem under nondominated model uncertainty in discrete time and show that an optimal portfolio exists for any utility function that is bounded from above. In the unbounded case, integrability conditions are needed as nonexistence may arise even if the value fu…

2013-07-13abs ↗pdf ↗

We consider the problem of utility maximization for small traders on incomplete financial markets. As opposed to most of the papers dealing with this subject, the investors' trading strategies we allow underly constraints described by closed, but not necessarily convex, sets. The final wealths obtained by trading under…

2005-08-24abs ↗pdf ↗

Let F\mathbb F be a real closed field. We define the notion of a maximal framing for a representation of the fundamental group of a surface with values in Sp(2n,F){\rm Sp}(2n,\mathbb F). We show that ultralimits of maximal representations in Sp(2n,R){\rm Sp}(2n,\mathbb R) admit such a framing, and that all maximal framed represen…

2015-09-03abs ↗pdf ↗

In this paper, we firstly give a brief introduction of expectation maximization (EM) algorithm, and then discuss the initial value sensitivity of expectation maximization algorithm. Subsequently, we give a short proof of EM's convergence. Then, we implement experiments with the expectation maximization algorithm (We im…

2013-05-03abs ↗pdf ↗

We consider a utility-maximization problem in a general semimartingale financial model, subject to constraints on the number of shares held in each risky asset. These constraints are modeled by predictable convex-set-valued processes whose values do not necessarily contain the origin; that is, it may be inadmissible fo…

2011-02-02abs ↗pdf ↗

The paper proves stability of eigenvalue inequalities on surfaces.

problem Stability of isoperimetric inequalities for Laplace eigenvalues on surfaces.
method Employing eigenvalues of measures and Sobolev space W1,2W^{-1,2}, the paper proves stability estimates for the first and second nonzero Laplace eigenvalues on surfaces.
result Metrics almost maximizing the normalized eigenvalue are W1,2W^{-1,2}-close to a maximal metric.

In this paper, we consider the problem of black box continuous submodular maximization where we only have access to the function values and no information about the derivatives is provided. For a monotone and continuous DR-submodular function, and subject to a bounded convex body constraint, we propose Black-box Contin…

2019-01-28abs ↗pdf ↗

Several fundamental problems that arise in optimization and computer science can be cast as follows: Given vectors v1,,vmRdv_1,\ldots,v_m \in \mathbb{R}^d and a constraint family B2[m]{\cal B}\subseteq 2^{[m]}, find a set SBS \in \cal{B} that maximizes the squared volume of the simplex spanned by the vectors in SS. A motivatin…

2017-07-10abs ↗pdf ↗

New algorithm maximizes non-monotone adaptive submodular functions in linear time.

problem Maximizing non-monotone adaptive submodular functions subject to a cardinality constraint.
method Developed a linear-time algorithm for non-monotone adaptive submodular maximization.
result Achieved a 1/eε1/e-ε approximation ratio with O(nε2logε1)O(nε^{-2}\log ε^{-1}) value oracle queries.