We present turnpike-type results for the risk tolerance function in an incomplete market setting under time-monotone forward performance criteria. We show that, contrary to the classical case, the temporal and spatial limits do not coincide. We also show that they depend directly on the left- and right-end of the suppo…
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,982 papers · 148 categories
Trend · papers per month
48 results for “forward monotonicity”
Study entropy for surfaces between two expanders, proving existence and monotonicity.
problem Entropy for surfaces trapped between two expanders.
method Developed relative entropy functional for obstacle problem and forward monotonicity formula.
result Existence and monotonicity of relative entropy for trapped surfaces.
New algorithms reduce variance in solving complex mathematical problems.
problem Solving convex-concave saddle point problems, variational inequalities, and inclusions.
method Stochastic variance reduction for extragradient, forward-backward-forward, and forward-reflected-backward methods.
result All proposed methods converge with complexities matching or improving deterministic counterparts.
A Unifying Framework for Variance Reduction Algorithms for Finding Zeroes of Monotone Operatorsstat.ML
Unified framework for variance reduction to solve monotone operator problems.
problem Large-scale monotone inclusion problems with finite sum structure.
method Developed a general framework for variance-reduced forward-backward splitting algorithms.
result Linear convergence rate under mild assumptions, with Catalyst acceleration and asynchronous implementation.
The problem of existence of arbitrage free and monotone CDO term structure models is studied. Conditions for positivity and monotonicity of the corresponding Heath-Jarrow-Morton-Musiela equation for the -forward rates with the use of the Milian type result are formulated. Two state spaces are taken into account - of…
In this paper, we first introduce the weighted forward reduced volume of Ricci flow. The weighted forward reduced volume, which related to expanders of Ricci flow, is well-defined on noncompact manifolds and monotone non-increasing under Ricci flow. Moreover, we show that, just the same as the Perelman's reduced volume…
This paper analyzes and improves monotonic accelerated algorithms like M-NAG and M-FISTA.
problem Establishing linear convergence of M-NAG and M-FISTA under strong convexity.
method Lyapunov analysis and modified Lyapunov functions.
result Linear convergence of M-NAG and M-FISTA is guaranteed without full NAG iterates.
FISAR uses neural networks to optimize safe reinforcement learning with forward-invariant constraints.
problem Safe reinforcement learning with constraints in safety-critical environments.
method Imposing linear constraints on policy parameters' updating dynamics, using a DNN-based optimizer to satisfy these constraints.
result The policy decreases constraint violation and maximizes cumulative reward monotonically.
SSFN self-estimates network size with low complexity and consistent performance.
problem Designing a self-estimating feed-forward network with low complexity and consistent performance.
method Joint optimization for layer and node estimation, low computational complexity, and use of lossless flow property and convex optimization.
result Consistent performance across Monte-Carlo trials and monotonically non-increasing cost with network growth.
Non-affine aggregation rules cannot preserve monotonicity in convex learning.
problem Designing non-affine aggregation rules that maintain monotonicity in convex learning.
method Proving that monotonicity of aggregated gradients is preserved only if the aggregation rule is positively affine.
result Non-affine aggregation prevents steady convergence and substantially degrades algorithmic stability.
The paper proves learning-curve monotonicity for maximum likelihood estimators in various parametric settings.
problem Establishing monotonicity guarantees for maximum likelihood estimators.
method Variants of GPT-5.2 Pro were used to derive the results.
result The paper proves monotonicity for maximum likelihood estimators in Gaussian and Gamma variables.
A new stochastic primal--dual algorithm for solving a composite optimization problem is proposed. It is assumed that all the functions/operators that enter the optimization problem are given as statistical expectations. These expectations are unknown but revealed across time through i.i.d. realizations. The proposed al…
Investigates time-inconsistent portfolio selection under MMV preferences.
problem Time-inconsistent optimal strategies for MMV preferences.
method Nash equilibrium controls for MMV and MV preferences, solving FBSDE and HJB equations.
result MMV optimal strategies lead to higher investment amounts than MV strategies, narrowing over time.
Monotone aggregation of dependent random vectors has an absolutely continuous distribution under certain conditions.
problem Monotone aggregation of dependent random vectors
method Coordinatewise monotonicity and uniform lower-increment conditions
result One-dimensional push-forwards of dependent random vectors have an absolutely continuous distribution
This paper considers general term structure models like the ones appearing in portfolio credit risk modelling or life insurance. We give a general model starting from families of forward rates driven by infinitely many Brownian motions and an integer-valued random measure, generalizing existing approaches in the litera…
Study forward investment performance in semimartingale markets with stochastic factors.
problem Investigate forward investment performance in incomplete semimartingale markets with power risk preferences and stochastic integrated factors.
method Develop necessary and sufficient conditions for FIPP existence, use integral representations, and solve ill-posed HJB equations.
result Explicit constructions for time-monotone FIPPs in semimartingale models, generalizing from Brownian to semimartingale markets.
A new family of momentum coefficients improves the convergence rate of accelerated algorithms.
problem Improving the convergence rate of accelerated gradient methods for strongly convex functions.
method Introducing a family of controllable momentum coefficients for forward-backward accelerated methods.
result Established a controllable $O\left(1/k^{2α}
ight)$ convergence rate for the NAG- method.
We consider a closed manifold M with a Riemannian metric g(t) evolving in direction -2S(t) where S(t) is a symmetric two-tensor on (M,g(t)). We prove that if S satisfies a certain tensor inequality, then one can construct a forwards and a backwards reduced volume quantity, the former being non-increasing, the latter be…
Solves a long-standing convex geometry problem about mixed volumes.
problem Characterizing the support of mixed area measures.
method Geometric approach to convex bodies in R^n and R^3.
result Resolved one direction of Schneider's conjecture for arbitrary convex bodies.
We consider the problem of optimal portfolio selection under forward investment performance criteria in an incomplete market. The dynamics of the prices of the traded assets depend on a pair of stochastic factors, namely, a slow factor (e.g. a macroeconomic indicator) and a fast factor (e.g. stochastic volatility). We …
Generalising the idea of the classical EM algorithm that is widely used for computing maximum likelihood estimates, we propose an EM-Control (EM-C) algorithm for solving multi-period finite time horizon stochastic control problems. The new algorithm sequentially updates the control policies in each time period using Mo…
New algorithms solve monotone inclusions and convex-concave minimax problems.
problem Solving maximally monotone equations and inclusions.
method Developed new accelerated algorithms based on Halpern-type fixed-point iteration and Popov's past extra-gradient method.
result Achieved convergence rates for various problems.
Perelman has discovered two integral quantities, the shrinker entropy $\cW$ and the (backward) reduced volume, that are monotone under the Ricci flow $\pa g_{ij}/\pa t=-2R_{ij}$ and constant on shrinking solitons. Tweaking some signs, we find similar formulae corresponding to the expanding case. The {\it expanding entr…
Improves GANs training through game theory.
problem Hard training of GANs due to antagonistic networks.
method Rewrote GAN training as a variational inequality and introduced a stochastic relaxed forward-backward algorithm.
result Algorithm converges to an exact solution or a neighborhood of it under monotonicity.
Established PFPPs in complete markets, solving integral equations.
problem Existence of Predictable Forward Performance Processes in complete markets.
method Solving a one-period integral equation using Fourier transform for tempered distributions.
result Closed-form solutions for PFPPs with inverse marginal functions that are completely monotonic.
Survival regression method improves log-likelihood scores.
problem Improper scoring rules in survival regression models.
method SurvivalMonotonic-net (SuMo-net) with monotonic neural networks.
result SuMo-net achieves state-of-the-art log-likelihood scores.
General lower bounds on neural network approximation in L^p norm.
problem Fundamental limits of neural network expressivity.
method General lower bound proof on approximation in L^p norm, applied to feed-forward neural networks.
result Neural networks can't approximate certain functions as well as previously thought.
A dissertation on scalable projection-free optimization methods.
problem Efficient optimization algorithms for large-scale machine learning problems.
method Study of Frank-Wolfe variants and their extensions to distributed and derivative-free settings.
result Development of 1-SFW and QFW, achieving state-of-the-art complexity and efficiency.
We study the heat equation on time-dependent metric measure spaces (as well as the dual and the adjoint heat equation) and prove existence, uniqueness and regularity. Of particular interest are properties which characterize the underlying space as a super Ricci flow as previously introduced by the second author. Our ma…
Revisiting Extragradient-Type Methods -- Part 1: Generalizations and Sublinear Convergence Ratesmath.OC
Paper generalizes extragradient methods for solving equations and inclusions with improved convergence rates.
problem Solving equations and inclusions using extragradient methods.
method Unified and generalized extragradient methods for a broader class of algorithms, analyzing sublinear convergence rates.
result Unified and improved convergence results for various extragradient variants.
The theory of convex risk functions has now been well established as the basis for identifying the families of risk functions that should be used in risk averse optimization problems. Despite its theoretical appeal, the implementation of a convex risk function remains difficult, as there is little guidance regarding ho…
Two new algorithms optimize decentralized convex optimization with reduced communication rounds.
problem Decentralized minimization of smooth strongly convex functions in a network.
method Proposes two new algorithms based on accelerated Forward Backward methods.
result First algorithm is optimal in terms of communication rounds and gradient computations.
New approaches improve adversarial robustness of DEQs.
problem Adversarial vulnerability of DEQs.
method Developed approaches to estimate intermediate gradients and integrate them into attacking pipelines.
result Demonstrated adversarial robustness of DEQs competitive with deep networks.
Unified approach to analysis on Ricci nonnegative manifolds and flows using optimal transport.
problem Generalizing Perelman's functionals to super Ricci flows.
method Optimal transport, Bochner inequality, gradient estimates, EVI.
result Unified condition equivalent to Ricci nonnegativity for smooth evolutions of Riemannian manifolds.
The paper addresses monotonicity in machine learning models for fairness and accountability.
problem Ensuring fairness and accountability in transparent machine learning models.
method Study of three types of monotonicity (individual, weak pairwise, strong pairwise) and propose monotonic groves of neural additive models.
result Monotonic groves of neural additive models maintain transparency, accountability, and fairness.
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.
Probit Monotone BARTstat.ML
Probit Monotone BART estimates binary outcomes using monotonic functions.
problem Estimating conditional mean functions for binary outcomes with monotonicity constraints.
method Proposes a new BART variant that incorporates monotonicity constraints for binary outcomes.
result Allows for more precise estimation of monotonic functions in binary outcome models.
In this paper we apply change of numeraire techniques to the optimal transport approach for computing model-free prices of derivatives in a two periods model. In particular, we consider the optimal transport plan constructed in \cite{HobsonKlimmek2013} as well as the one introduced in \cite{BeiglJuil} and further studi…
Monotone neural networks can approximate and interpolate functions efficiently.
problem Understanding the efficiency and expressiveness of monotone neural networks.
method Solving the monotone interpolation problem using depth-4 networks and comparing size bounds with arbitrary networks.
result Monotone neural networks can approximate and interpolate functions efficiently, but may require exponential size in high dimensions.
We introduce a new neural network model, together with a tractable and monotone online learning algorithm. Our model describes feed-forward networks for classification, with one output node for each class. The only nonlinear operation is rectification using a ReLU function with a bias. However, there is a rectifier on …
Improves k-NN for monotonic data with robustness against noise.
problem Class noise in real-life data violates monotonic constraints in k-NN.
method Monotonic Fuzzy k-NN (MonFkNN) with new fuzzy membership calculation.
result Significant accuracy improvements and robustness against monotonic noise.
Study examines explainable machine learning for monotonic models, finding Integrated gradients better for strong monotonicity.
problem Applying explainable machine learning to science-informed models.
method Proposed axioms for monotonicity, tested Shapley value and Integrated gradients methods.
result Integrated gradients provides better explanations for strong monotonicity.
Formula proves monotonicity for anisotropic minimal hypersurfaces.
problem Understanding anisotropic minimal hypersurfaces.
method Proved a monotonicity formula under a sign assumption on the Minkowski norm.
result Monotonicity formula for anisotropic minimal hypersurfaces.
The paper develops algorithms to restore monotonicity in non-monotone functions.
problem Non-monotone solutions from heuristic algorithms need to be corrected.
method Develops algorithms to restore monotonicity with limited queries.
result Restores monotonicity while degrading the function value by at most ε.
New example of manifolds with monotonic heat kernels found.
problem Understanding monotonicity of heat kernels on manifolds.
method Analyzing new examples and classifying flat tori.
result Generic metrics fail monotonicity at large times.
Proposes a Bayesian nonparametric model for monotonic functions.
problem Imposing monotonicity constraints in Bayesian nonparametric models.
method Numerical solutions of stochastic differential equations for nonparametric model of monotonic functions.
result Demonstrates competitive results on benchmark functions and utility in temporal alignment of time-series data.
Nonnegative matrix factorization (NMF) factorizes a non-negative matrix into product of two non-negative matrices, namely a signal matrix and a mixing matrix. NMF suffers from the scale and ordering ambiguities. Often, the source signals can be monotonous in nature. For example, in source separation problem, the source…
Monotone functions and mapsmath.LO
In [S. Basu, A. Gabrielov, N. Vorobjov, Semi-monotone sets. arXiv:1004.5047v2 (2011)] we defined semi-monotone sets, as open bounded sets, definable in an o-minimal structure over the reals, and having connected intersections with all translated coordinate cones in R^n. In this paper we develop this theory further by d…