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,786 papers · 148 categories

Trend · papers per month

0.6%1.1%1.7%2.3% · Jan 199819922001200920172026
48 results for non-monotonic payoffs

The paper extends ERP framework to non-monotonic payoffs and short selling bans.

problem Valuation of contingent claims with short selling bans under ERP framework.
method Unified framework for ERP pricing, extending to non-monotonic payoffs, and comparing with Black-Scholes.
result Equal-risk prices differ from Black-Scholes prices under short selling bans.

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.

This paper studies the valuation and optimal strategy of convertible bonds as a Dynkin game by using the reflected backward stochastic differential equation method and the variational inequality method. We first reduce such a Dynkin game to an optimal stopping time problem with state constraint, and then in a Markovian…

2015-03-31abs ↗pdf ↗

The paper tackles non-monotonic learning performance and proposes algorithms to make models more monotone.

problem Non-monotonic learning performance where more data does not always improve model quality.
method Proposes three algorithms to make supervised learning models more monotone, proving consistency and monotonicity with high probability.
result The algorithm MT-HT reduces less than 1% non-monotonic decisions on MNIST while maintaining competitive error rates.

Productivity and credit limits affect aggregate production in non-monotonic ways.

problem Understanding how aggregate production is influenced by individual characteristics and financial constraints.
method Analytical proof of non-monotonic effects of productivity and credit limits on aggregate production in a general equilibrium model.
result Equilibrium aggregate production can be non-monotonic in both individual productivity and credit limit.

Study derives new equation for reserves in non-monotone information scenarios.

problem Modeling reserves in situations where information is not always increasing.
method Infinitesimal approach to derive generalized stochastic Thiele equation.
result New equation allows for information discarding and solves open problems.

New risk control method for non-monotonic losses in complex parameters.

problem Controlling risk for non-monotonic losses with multidimensional parameters.
method Stability-based guarantees for generic algorithms applied to non-monotonic losses.
result Guarantees depend on algorithm stability, with looser guarantees for unstable algorithms.

GradaGrad adapts learning rate non-monotonically, overcoming AdaGrad's step size decrease.

problem Fixed learning rate in AdaGrad leads to step size decrease over time.
method Introduces GradaGrad, which grows or shrinks the learning rate based on a different accumulation in the denominator.
result GradaGrad achieves similar convergence rates as AdaGrad and demonstrates non-monotone adaptation.

Study learns a neuron with non-monotonic activation functions.

problem Learning a single neuron with non-monotonic activation functions.
method Gradient descent (GD) with conditions on activation function and input distribution.
result Learnability of non-monotonic activation functions is established without monotonicity assumption.

Study non-monotonic loss functions in CRC, achieving valid risk control with large calibration samples.

problem Non-monotonic loss functions in CRC, violating existing theory's monotonicity assumption.
method Finite grid selection, calibration sample size analysis, Lipschitz continuity, monotonicity, distribution shift.
result Valid CRC achieved with large calibration samples, optimal excess risk rate of log(m)/n\sqrt{\log(m)/n}.

FLOWGEM generates complete datasets from incomplete data with non-monotone MAR missingness.

problem Dealing with non-monotone Missing at Random (MAR) missingness in data.
method Iterative particle evolution of Wasserstein Gradient Flow, approximated by local linear estimators of density ratio.
result FLOWGEM achieves state-of-the-art performance across various settings, including non-monotone MAR mechanisms.

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…

2005-08-04abs ↗pdf ↗

Study finds non-monotonic Value of Information in dynamic multi-market monopoly.

problem Investigates non-monotonicity in Value of Information for a price-setting monopolist.
method Uses a Bayesian inverse problem with Kalman-Bucy-Stratonovich filter in a dynamic discrete model.
result Non-monotonic relationship between signal variance and Value of Information.

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.

Paper tackles non-monotonic resource utilization in sequential decision-making.

problem Sequential decision-making under uncertainty with resource constraints.
method Introduces a new MDP policy with constant regret against LP relaxation.
result Develops a learning algorithm with logarithmic regret for unknown outcome distributions.

New findings show privacy affects generalization error in a non-monotonic way.

problem Privacy and robustness in distributed learning.
method Theoretical analysis and matching lower/upper bounds on algorithmic stability.
result Generalization error is non-monotonically affected by privacy, depending on noise level.

Study finds cheapest possible payoff under ambiguity, linking to maxmin expected utility.

problem Finding cost-efficient payoffs in uncertain market conditions.
method Developed a new concept of robust cost-efficient payoff and linked it to maxmin expected utility.
result Solutions to maxmin robust expected utility are robust cost-efficient.

We introduce signature payoffs, a family of path-dependent derivatives that are given in terms of the signature of the price path of the underlying asset. We show that these derivatives are dense in the space of continuous payoffs, a result that is exploited to quickly price arbitrary continuous payoffs. This approach …

2018-09-25abs ↗pdf ↗

The paper uncovers the impact of price and payoff autocorrelations in multi-period asset pricing models.

problem Hidden dependence of asset pricing models on price and payoff autocorrelations.
method Obtained approximations of the basic pricing equation describing various parameters.
result Valid results for other pricing models like ICAPM and APM.

Study on MMV in jump-diffusion models resolves MV's non-monotonicity issues.

problem Non-monotonicity and free cash flow stream problems in MV preferences.
method Explicit solution for MMV preferences in jump-diffusion models, proving non-negative potential measures.
result MMV resolves MV's non-monotonicity and free cash flow stream issues.

New method speeds up model selection for complex scientific tasks.

problem Exhaustive model selection is computationally infeasible for large model spaces.
method Branch-and-bound algorithm with non-monotonic criteria.
result Guaranteed identification of optimal models with significant computational speedups.

Paper tackles online DR-submodular maximization with various convex sets.

problem Maximizing DR-submodular functions online over different convex sets.
method Develops online algorithms with approximation guarantees for various convex sets.
result Achieves 1/e1/e-approximation ratio with O(T2/3)O(T^{2/3}) regret for down-closed sets.

We propose non-stationary spectral kernels for Gaussian process regression. We propose to model the spectral density of a non-stationary kernel function as a mixture of input-dependent Gaussian process frequency density surfaces. We solve the generalised Fourier transform with such a model, and present a family of non-…

2017-05-24abs ↗pdf ↗

Researchers propose a non-monotone quantum natural gradient for quantum systems.

problem Applying natural gradient methods to quantum systems without monotonicity.
method Introducing a non-monotone quantum natural gradient (QNG) and demonstrating its superiority over conventional QNG.
result Non-monotone QNG outperforms conventional QNG in terms of convergence speed.

The paper improves PCS approximation for ranking and selection under limited simulation budgets.

problem Improving finite sample performance in Ranking and Selection.
method Develops a Bahadur-Rao type expansion for PCS, proposes a novel FCBA policy.
result FCBA policy achieves superior PCS performance compared to traditional methods.

Insider trading is reduced when penalized, affecting expected penalties in a non-monotone way.

problem Reducing insider trading behavior when insiders face legal penalties.
method Characterized via a backward stochastic differential equation (BSDE) with a non-linear operator.
result The insider's expected penalties are non-monotone in the fee structure and determined by relative entropy.

New findings show pure strategy equilibria are more robust in a war of attrition game.

problem Analyzing a game of war of attrition under complete information.
method Examined the stability of equilibria in pure and mixed strategies under varying payoffs.
result Pure strategy equilibria are more robust to perturbations of the canonical model.

We study the use of the multilevel Monte Carlo technique in the context of the calculation of Greeks. The pathwise sensitivity analysis differentiates the path evolution and reduces the payoff's smoothness. This leads to new challenges: the inapplicability of pathwise sensitivities to non-Lipschitz payoffs often makes …

2011-02-07abs ↗pdf ↗

New algorithms for stochastic linear bandits with heavy-tailed payoffs achieve nearly optimal regret.

problem Stochastic linear bandits with heavy-tailed payoffs.
method Median of means and dynamic truncation.
result Sublinear regret bound of O(d12T11+ε)O(d^{\frac{1}{2}}T^{\frac{1}{1+ε}}) for ε(0,1]ε\in(0,1].

Study of 2imes22 imes 2 zero-sum games with noisy observations and commitments.

problem Analyzing 2imes22 imes 2 zero-sum games with noisy observations and commitments.
method Modeling a 2imes22 imes 2 zero-sum game with a leader committing to a strategy and a follower observing a noisy version of the leader's action.
result Observing the leader's action is either beneficial or immaterial for the follower, and the equilibrium payoff is bounded.

This paper studies robust payoff allocation in submodular games, especially against replication.

problem Payoff allocation in submodular games, especially robustness against replication.
method Systematically studied replication manipulation in submodular games, introduced replication robustness metric, and validated with empirical ML data market.
result Conditions characterizing robustness of semivalues in submodular games.