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

66132197263 · May 202619922001200920172026
48 results for monotonicity control

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.

The paper investigates quantitative rigidity using Colding's monotonicity formulas for Ricci curvature.

problem Quantifying rigidity in manifolds with nonnegative Ricci curvature.
method Investigates pinching of Colding's monotone functionals and constructs kk-splitting functions.
result Quantitative control of splitting functions by pinching at independent points controls the distance to the nearest cone.

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}.

Extends conformal prediction for controlling expected risk of monotone loss functions.

problem Controlling expected risk of monotone loss functions.
method Generalizes split conformal prediction with coverage guarantee, extending to distribution shift, quantile risk, multiple, adversarial, and expectations of U-statistics.
result Tight up to an O(1/n)\mathcal{O}(1/n) factor, with worked examples in computer vision and natural language processing.

A new method solves complex financial equations efficiently.

problem Solving worst-case and best-case prices for two-factor uncertain volatility models.
method Decompose and integrate, then optimize; piecewise constant control; closed-form Green's functions; 2D convolution integrals; monotone numerical integration; Fast Fourier Transforms.
result The method efficiently computes the value function and optimal control, converging to the viscosity solution of the HJB equation.

A new ML algorithm solves complex economic control problems.

problem Solving high-dimensional, finite-horizon stochastic control problems in economics.
method Deep neural network representation of optimal policy functions with three key features.
result Efficiently solves various economic control problems including recursive utility and growth models.

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.

New method for optimizing risk in financial models using Fourier transforms.

problem Optimizing risk in financial models with multi-period mean-CVaR.
method Strictly monotone 2D integration scheme via Fourier-trained transition kernels.
result Established robust and accurate optimization method for financial models.

Developed a monotone numerical method for MV portfolio optimization under jump-diffusion models.

problem Efficiently optimizing portfolios with jump-diffusion dynamics and investment constraints.
method Strictly monotone numerical integration method using Fourier transforms and composite quadrature rules.
result Proven to be \ell_{\infty}-stable and pointwise consistent, converging to the MV optimization solution.

Applications in machine learning, optimization, and control require the sequential selection of a few system elements, such as sensors, data, or actuators, to optimize the system performance across multiple time steps. However, in failure-prone and adversarial environments, sensors get attacked, data get deleted, and a…

2018-03-21abs ↗pdf ↗

We present techniques, inspired by monodromy considerations, for constructing compact monotone Lagrangians in certain affine hypersurfaces, chiefly of Brieskorn-Pham type. We focus on dimensions 2 and 3, though the constructions generalise to higher ones. The techniques give significant latitude in controlling the homo…

2020-02-01abs ↗pdf ↗

Develops methods to select informative conformal prediction sets with FCR control.

problem Selecting informative prediction sets with FCR control in supervised learning.
method Unified framework for informative conformal prediction sets with FCR control.
result First procedures providing FCR control for informative prediction sets.

We study a multiplicative transient price impact model for an illiquid financial market, where trading causes price impact which is multiplicative in relation to the current price, transient over time with finite rate of resilience, and non-linear in the order size. We construct explicit solutions for the optimal contr…

2015-01-08abs ↗pdf ↗

Proves flows of two-convex Lagrangians are regular, global, and converge.

problem Proves regularity, global existence, and convergence of Lagrangian mean curvature flows in the two-convex case.
method Uses a newly discovered monotone quantity to control two-convexity.
result Proves results for the mean curvature flow of area-decreasing Lagrangian submanifolds.

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.

Controller-Augmented Hidden Markov Models (CHMMs) are a framework for constrained sequential inference.

problem Hidden Markov models fail under pathwise constraints like precedence, visitation, or monotonic state progression.
method CHMMs compile constraints into finite-state controllers, then use standard forward-backward and Viterbi recursions to compute exact constrained posteriors and paths.
result CHMMs provide exact constrained inference, monotone ascent in constrained EM, and linear complexity in controller cardinality.

The control and sensing of large-scale systems results in combinatorial problems not only for sensor and actuator placement but also for scheduling or observability/controllability. Such combinatorial constraints in system design and implementation can be captured using a structure known as matroids. In particular, the…

2018-04-02abs ↗pdf ↗

Proposes non-exchangeable conformal risk control for better uncertainty bounds.

problem Handling non-exchangeable data in black-box models for better risk control.
method Leverages and extends split conformal prediction and monotone loss function approaches.
result Allows controlling expected value of any monotone loss function for non-exchangeable data.

Motivated by recent work of Choquet-Bruhat, Chrusciel, and Martin-Garcia, we prove monotonicity properties and comparison results for the area of slices of the null cone of a point in a Lorentzian manifold. We also prove volume comparison results for subsets of the null cone analogous to the Bishop-Gromov relative volu…

2010-08-03abs ↗pdf ↗

Study tackles criterion collapse in learning criteria, showing conditions for loss minimization.

problem Criterion collapse in optimization, focusing on error probability minimizers.
method Analyzes various learning criteria, including DRO, OCE risks, and non-monotonic criteria.
result Non-monotonic criteria can avoid collapse, while monotonic ones cannot.

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…

2016-11-06abs ↗pdf ↗

Derivative estimates for pluriclosed flow control curvature and torsion.

problem Deriving derivative estimates for the pluriclosed flow.
method Control higher order derivatives of Chern curvature and torsion using Chern curvature; derive an estimate for torsion tensor using Chern Ricci curvature in dimension two; find a monotonic quantity in Hermitian-symplectic case.
result All Hermitian-symplectic solitons are Kähler Ricci solitons.

Self-referential meta learning avoids explicit optimization by modifying itself.

problem Dependency on human engineering in meta learning algorithms.
method Investigates self-referential meta learning systems that modify themselves without explicit optimization.
result Self-referential neural networks can improve their own modifications without explicit optimization.

We analyze an N+1N+1-player game and the corresponding mean field game with state space {0,1}\{0,1\}. The transition rate of jj-th player is the sum of his control αjα^j plus a minimum jumping rate ηη. Instead of working under monotonicity conditions, here we consider an anti-monotone running cost. We show that the mean …

2019-08-16abs ↗pdf ↗

By means of a space-time Wasserstein control, we show the monotonicity of the W-entropy functional in time along heat flows on possibly singular metric measure spaces with non-negative Ricci curvature and a finite upper bound of dimension in an appropriate sense. The associated rigidity result on the rate of dissipatio…

2018-11-17abs ↗pdf ↗

Introduces SMMV preferences to avoid inconsistency in portfolio selection.

problem Monotone mean-variance preferences fail to differentiate strictly dominant payoffs.
method Introduces strictly monotone mean-variance preferences and applies them to portfolio selection problems.
result SMMV preferences provide a more rational basis for assessing prospects and coincide with MV preferences under certain conditions.

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.

A faster EM algorithm for unsupervised Gaussian mixture models.

problem Efficiently determining the number of components in Gaussian mixture models.
method Adaptive Anderson Acceleration (AA) for EM algorithm, with novel monotonicity control and covariance matrix preservation.
result Significantly faster convergence compared to non-accelerated EM, up to 60X in some cases.

Study tackles nonlinear factor models with unknown monotone links from incomplete and noisy data.

problem Learning nonlinear factor models with unknown monotone links from incomplete and noisy data.
method Formulated as joint recovery of low-rank factors, loadings, and nonlinear link function; proposed BCD algorithm with regularization.
result Established convergence guarantees and sublinear regret bounds for link-function updates.

New adaptive test for NPIV models controls size and has superior power.

problem Testing inequality and equality restrictions in nonparametric IV models.
method Adaptive hypothesis test based on modified leave-one-out sample quadratic distance.
result Adaptive test attains the adaptive minimax rate of testing in L2L^{2}.

Convolutional neural networks (CNNs) are commonly used for image classification tasks, raising the challenge of their application on data flows. During their training, adaptation is often performed by tuning the learning rate. Usual learning rate strategies are time-based i.e. monotonously decreasing. In this paper, we…

2019-11-18abs ↗pdf ↗

The paper proposes a method to align AI models using conformal risk control.

problem Aligning AI models to meet end-user requirements in non-generative settings.
method Post-processing a pre-trained model to better align with a subset of functions using conformal risk control.
result A probabilistic guarantee that the resulting conformal interval around a model contains a function approximately satisfying a desired property.

Study on convex ordering in stochastic control for swing contracts, proving value function convexity.

problem Pricing of swing contracts under stochastic dynamics.
method Discrete-time stochastic optimal control problem, convexity propagation, Brownian diffusion model, Stein's formula.
result Value function is convex in underlying asset price, relaxation of convexity assumption for semi-convexity.

Researchers develop a new framework to control neural network sensitivity.

problem Understanding and controlling the behavior of neural networks.
method Direct parameterization of bi-Lipschitzness in convex neural networks.
result A clear and tight control of neural network sensitivity achieved.