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.

169,051 papers · 148 categories

Trend · papers per month

7.8%15.6%23.4%31.2% · Jun 202019922001200920172026
48 results for static optimization

We consider hedging of a contingent claim by a 'semi-static' strategy composed of a dynamic position in one asset and static (buy-and-hold) positions in other assets. We give general representations of the optimal strategy and the hedging error under the criterion of variance-optimality and provide tractable formulas u…

2017-09-16abs ↗pdf ↗

We compare optimal static and dynamic solutions in trade execution. An optimal trade execution problem is considered where a trader is looking at a short-term price predictive signal while trading. When the trader creates an instantaneous market impact, it is shown that transaction costs of optimal adaptive strategies …

2018-11-27abs ↗pdf ↗

Develops a hedging method for multi-asset derivatives with correlation risk.

problem Hedging multi-asset derivatives exposed to correlation and covariance risk.
method Combines dynamic trading with static hedging instruments using Galtchouk--Kunita--Watanabe decomposition.
result Explicit semi-static replication formulas for covariance swaps and geometric dispersion trades.

In incomplete financial markets not every contingent claim can be replicated by a self-financing strategy. The risk of the resulting shortfall can be measured by convex risk measures, recently introduced by Föllmer, Schied (2002). The dynamic optimization problem of finding a self-financing strategy that minimizes the …

2016-04-27abs ↗pdf ↗

We consider the martingale optimal transport duality for càdlàg processes with given initial and terminal laws. Strong duality and existence of dual optimizers (robust semi-static superhedging strategies) are proved for a class of payoffs that includes American, Asian, Bermudan, and European options with intermediate m…

2017-07-26abs ↗pdf ↗

Study optimal semi-static hedging for illiquid markets using dynamic cash and static quoted derivatives.

problem Optimal pricing of exotic derivatives in illiquid markets with bid-ask spreads.
method Use Galerkin method and integration quadratures to approximate hedging problem as convex optimization, solved by interior point method.
result Semi-static hedging improves pricing and reduces transaction costs compared to static or dynamic trading alone.

New algorithm achieves both static and dynamic regret optimally against an oblivious adversary for deterministic losses.

problem Achieving optimal static and dynamic regret simultaneously in adversarial bandits.
method Extends impossibility result to deterministic losses, uses negative static regret and Blackwell approachability.
result First algorithm achieving optimal static and dynamic regret simultaneously against an oblivious adversary.

Optimizes nonconvex optimization by converting it to static regret minimization.

problem Nonconvex optimization challenges in machine learning.
method Black-box online-to-nonconvex conversion with static regret minimization oracles.
result Achieves optimal convergence rates for nonconvex optimization.

Dynamic retirement glidepaths evolve over time based on some measure such as the retiree's funded status or current market valuations. Conversely, static glidepaths are fixed at a starting point and selected under the assumption that they will not change. In practice, new static glidepaths may be derived periodically m…

2015-06-28abs ↗pdf ↗

We propose a flexible framework for hedging a contingent claim by holding static positions in vanilla European calls, puts, bonds, and forwards. A model-free expression is derived for the optimal static hedging strategy that minimizes the expected squared hedging error subject to a cost constraint. The optimal hedge in…

2015-06-05abs ↗pdf ↗

Investigates model risk and semi-static hedging for martingale constrained models.

problem Model risk distributionally robust sensitivities for functionals on the Wasserstein space.
method Introduces distributionally robust problem with semi-static hedging strategies.
result Explicit characterizations of model risk optimal semi-static hedging strategies.

Paper proposes a new DRL algorithm optimizing Spectral Risk Measures for better risk management.

problem Inconsistencies and conservatism in existing risk measures in DRL.
method Optimizes a broader class of static Spectral Risk Measures (SRM) in DRL.
result Demonstrates improved performance over existing risk-neutral and risk-sensitive DRL models.

The paper proves a geometric capacitary inequality for sub-static manifolds with harmonic potentials.

problem Proving a geometric capacitary inequality for sub-static manifolds with harmonic potentials.
method Introducing a one-parameter family of functions that are monotone along the level-set flow of the potential, up to the optimal threshold.
result Proves a geometric capacitary inequality where the capacity of the horizon plays the same role as the ADM mass in the celebrated Riemannian Penrose Inequality.

New static black hole uniqueness theorems for negative cosmological constant.

problem Uniqueness of static black holes in asymptotically locally hyperbolic spaces.
method Inequality relating surface gravity and topology, rigidity of Kottler black holes, monotone quantities under IMCF, regularity theorem for IMCF.
result Static black holes are uniquely determined by their geometry and topology.

The optimal strategies for a long-term static investor are studied. Given a portfolio of a stock and a bond, we derive the optimal allocation of the capitols to maximize the expected long-term growth rate of a utility function of the wealth. When the bond has constant interest rate, three models for the underlying stoc…

2013-11-24abs ↗pdf ↗

In a discrete-time market, we study model-independent superhedging, while the semi-static superhedging portfolio consists of {\it three} parts: static positions in liquidly traded vanilla calls, static positions in other tradable, yet possibly less liquid, exotic options, and a dynamic trading strategy in risky assets …

2014-02-11abs ↗pdf ↗

In many practical applications of clustering, the objects to be clustered evolve over time, and a clustering result is desired at each time step. In such applications, evolutionary clustering typically outperforms traditional static clustering by producing clustering results that reflect long-term trends while being ro…

2011-04-11abs ↗pdf ↗

Neural networks can find financial arbitrage opportunities without needing market models.

problem Finding arbitrage opportunities in financial markets without using market models.
method Used neural networks to solve convex semi-infinite programs and detect arbitrage opportunities.
result Neural networks can detect model-free static arbitrage strategies in financial markets.

Bayesian Experience Reuse improves learning from multiple experts.

problem Learning from multiple experts with conflicting goals.
method Bayesian neural networks with shared features to model uncertainty and derive a probability distribution over expert models.
result BERS method effectively samples demonstrations from the derived distribution to reuse them in new tasks.

Study classifies static potentials on 3-manifolds, proving one-dimensionality under specific conditions.

problem Classifying the dimension of static potentials on 3-manifolds.
method Analysis of relative zero sets of static potentials, using Miao and Tam's technique.
result Proves one-dimensionality of static potentials under specific conditions.

TASTE combines static and temporal data for phenotyping EHRs.

problem Phenotyping EHRs with both static and temporal data.
method Jointly models static and temporal tensors using PARAFAC2 and non-negative matrix factorization, alternatingly solving sub-problems.
result TASTE outperforms existing methods in speed and clinical meaningfulness of phenotypes.

This is the second of two works, in which we discuss the definition of an appropriate notion of mass for static metrics, in the case where the cosmological constant is positive and the model solutions are compact. In the first part, we have established a positive mass statement, characterising the de Sitter solution as…

2017-11-19abs ↗pdf ↗

The paper analyzes risk measures and optimal reserve allocation strategies.

problem Risk measures and optimal reserve allocation across multiple lines of business.
method Formalizes expected maximum deficit, introduces implicitly bounded risk measures, and proposes capital allocation approaches.
result Theoretical results on static and dynamic coherence, convexity, and exact optimizations of aggregate minimum reserves.

The paper finds optimal strategies for hedging in incomplete markets using derivatives.

problem Optimal static hedging in incomplete markets with two underlying assets and vanilla options.
method Formulated as a utility maximization problem, solved through variational methods and fixed point analysis.
result Semi-analytical solutions for exponential, power/logarithmic, and quadratic utilities, with convergence to a fixed point for exponential utility.

Investigates fund separations and stability for long-term optimal investments.

problem Optimizing long-term investments in an incomplete market with risky and safe assets.
method Analyzes three market models with different state variable processes to find optimal portfolios and prove convergence stability.
result Dynamic optimal portfolios converge to static portfolios over time, with vanishing sensitivities in the long run.

New static vacuum metrics confirmed for near Euclidean boundary data.

problem Establishing sufficient conditions for near Euclidean boundary data in static vacuum metrics.
method Using new arguments from studying the conjecture for arbitrary static vacuum metrics.
result Any hypersurface in a dense subfamily is static regular.

In online learning, the dynamic regret metric chooses the reference (optimal) solution that may change over time, while the typical (static) regret metric assumes the reference solution to be constant over the whole time horizon. The dynamic regret metric is particularly interesting for applications such as online reco…

2018-10-08abs ↗pdf ↗

Extends static vacuum metrics with specific boundary conditions.

problem Proving the existence of static vacuum metrics with prescribed boundary data.
method Introducing static regular types (I) and (II), showing local well-posedness, and confirming Bartnik's conjecture.
result Confirms Bartnik's static vacuum extension conjecture for a broad range of boundary conditions.

ARO overfits by making constraints dependent on uncertainty, leading to brittleness.

problem ARO's adaptive policies become brittle when realizations fall outside the uncertainty set.
method Assigning constraint-specific uncertainty set sizes with probabilistic guarantees.
result Regularization through specific uncertainty set sizes ensures stability and flexibility.

Paper analyzes trade-offs between static and dynamic regret in online learning.

problem Analyzing trade-offs between static and dynamic regret in online learning.
method Rigorously characterizes the effect of forgetting factors for online Newton algorithms and proposes a novel gradient descent step size rule.
result Achieves dynamic regret of max{O(log T), O(√TV)} for exp-concave and strongly convex objectives.

Existence of strong randomized equilibria in mean-field games with common noise.

problem Existence of strong solutions in mean-field games of optimal stopping.
method Connection with Bank-El Karoui's representation problem and continuity assumptions.
result Existence of strong randomized mean-field equilibrium under certain conditions.

We classify static manifolds which admit more than one static decomposition whenever a condition on the curvature is fullfilled. For this, we take a standard static vector field and analyze its associated one parameter family of projections onto the base. We show that the base itself is a static manifold and the warpin…

2009-10-26abs ↗pdf ↗

With model uncertainty characterized by a convex, possibly non-dominated set of probability measures, the agent minimizes the cost of hedging a path dependent contingent claim with given expected success ratio, in a discrete-time, semi-static market of stocks and options. Based on duality results which link quantile he…

2014-08-21abs ↗pdf ↗

Geometric inequalities for static convex domains in hyperbolic space proved.

problem Proving geometric inequalities for static convex domains in hyperbolic space.
method Using static convexity of flow hypersurfaces, new inequalities are derived.
result New family of geometric inequalities for static convex domains in hyperbolic space.

The paper classifies vacuum static spaces with harmonic curvature.

problem Classifying vacuum static spaces with harmonic curvature.
method Extending the 4-dimensional work by Kim-Shin, the paper classifies nn-dimensional spaces (n5n\geq 5).
result New counterexamples to the Fischer-Marsden conjecture on compact vacuum static spaces.

The paper investigates geometrical aspects of static spacetime with almost gradient Ricci solitons.

problem Geometrical properties of static spacetime with almost gradient Ricci solitons.
method Analyzing conditions and properties of static spacetime with almost gradient Ricci solitons.
result Conditions and properties of static spacetime with almost gradient Ricci solitons are determined.

The study proves geometric inequalities for static convex domains in static rotationally symmetric spaces.

problem Proving geometric inequalities for static convex domains in static rotationally symmetric spaces.
method Locally constrained curvature flow in a static rotationally symmetric space Nn+1\mathbf{N}^{n+1}, proving graphical solutions and static convexity preservation.
result Proves weighted geometric inequalities for static convex domains close to a slice of Nn+1\mathbf{N}^{n+1}.

Optimal switching regret for all segmentations in online convex optimisation.

problem Non-stationary online convex optimisation problems.
method Developed an efficient algorithm to achieve optimal switching regret on every possible segmentation.
result Achieved asymptotically optimal switching regret on every possible segmentation simultaneously.