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

1122 · Oct 202419922001200920172026
48 results for Clarke subderivative

Study shows AD for neural nets with machine-representable numbers can be incorrect.

problem Correctness of AD for neural nets with machine-representable numbers.
method Analyzed two sets of parameters: incorrect and non-differentiable. Proved bounds and conditions for AD correctness.
result AD can be incorrect for machine-representable numbers, but provides a Clarke subderivative on non-differentiable set.

The Cheap Gradient Principle (Griewank 2008) --- the computational cost of computing the gradient of a scalar-valued function is nearly the same (often within a factor of 55) as that of simply computing the function itself --- is of central importance in optimization; it allows us to quickly obtain (high dimensional) …

2018-09-23abs ↗pdf ↗

Hedging strategies in bond markets are computed by martingale representation and the Clark-Ocone formula under the choice of a suitable of numeraire, in a model driven by the dynamics of bond prices. Applications are given to the hedging of swaptions and other interest rate derivatives, and our approach is compared to …

2013-04-23abs ↗pdf ↗

We consider the problem of finding sufficient conditions for a locally Lipschitz mapping between Finsler manifolds to be a global homeomorphism. For this purpose, we develop the notion of Clarke generalized differential in this context and, using this, we obtain a version of the Hadamard integral condition for invertib…

2012-01-23abs ↗pdf ↗

Symplectic homology matches dual capacities for convex domains.

problem Understanding symplectic capacities and Reeb flows on convex domains.
method Isomorphic filtered symplectic homology to dual singular homology.
result Gutt-Hutchings capacities match spectral invariants for convex domains.

Paper explores subdifferential chain rules for matrix factorization and related machine learning models.

problem Clarke subdifferential chain rules for matrix factorization and factorization machines.
method Analyzes conditions for subdifferential chain rules to hold, especially for overparameterized models.
result Subdifferential chain rules hold for matrix factorization and factorization machines under certain conditions.

Establishes a microstructural foundation for a rough log-normal volatility model.

problem Developing a robust model for financial volatility under microstructural effects.
method Introduced a sequence of order-driven financial market models with Poisson process arrivals and analyzed their convergence to a log-normal rough volatility model.
result Weak convergence of price-volatility process to a log-normal rough volatility model with established weak error rates.

New auction design uses statistical learning to reduce costs and improve fairness.

problem Designing efficient multi-item auctions with reduced implementation costs and fairness.
method Nonparametric density estimation for credible intervals, two new strategies.
result Strategies consistently outperform alternative methods in revenue maximization and cost reduction.

G-framework is presented by Peng [41] for measure risk under uncertainty. In this paper, we define fractional G-Brownian motion (fGBm). Fractional G-Brownian motion is a centered G-Gaussian process with zero mean and stationary increments in the sense of sub-linearity with Hurst index H(0,1)H\in (0,1). This process has sta…

2013-06-18abs ↗pdf ↗

We prove that Morrison and Nieh's categorification of the su(3) quantum knot invariant is functorial with respect to tangle cobordisms. This is in contrast to the categorified su(2) theory, which was not functorial as originally defined. We use methods of Bar-Natan to construct explicit chain maps for each variation of…

2008-06-03abs ↗pdf ↗

This paper derives a portfolio decomposition formula when the agent maximizes utility of her wealth at some finite planning horizon. The financial market is complete and consists of multiple risky assets (stocks) plus a risk free asset. The stocks are modelled as exponential Brownian motions with drift and volatility b…

2007-02-24abs ↗pdf ↗

We give sufficient conditions for a Cc1 C^1_c -local diffeomorphism between Fréchet spaces to be a global one. We extend the Clarke's theory of generalized gradients to the more general setting of Fréchet spaces. As a consequence, we define the Chang Palais-Smale condition for Lipschitz functions and show that a functio…

2019-03-12abs ↗pdf ↗

When training data is sparse, more domain knowledge must be incorporated into the learning algorithm in order to reduce the effective size of the hypothesis space. This paper builds on previous work in which knowledge about qualitative monotonicities was formally represented and incorporated into learning algorithms (e…

2012-07-04abs ↗pdf ↗

In this paper we consider an optimal investment and reinsurance problem with partially unknown model parameters which are allowed to be learned. The model includes multiple business lines and dependence between them. The aim is to maximize the expected exponential utility of terminal wealth which is shown to imply a ro…

2020-01-30abs ↗pdf ↗

Myopic optimization outperforms reinforcement learning in portfolio management, leading to lower returns and higher risks.

problem Reinforcement learning strategies in portfolio management yield lower or negative returns and higher risks compared to myopic optimization.
method Modeling execution/liquidation frictions with mark-to-market accounting, using Malliavin calculus to derive policy gradients and risk shadow price, and quantifying phantom profit.
result Myopic optimization outperforms reinforcement learning in portfolio management, leading to better returns and lower risks.

The paper explores low-dimensional solenoidal manifolds and their properties.

problem Characterizing and understanding solenoidal manifolds of dimensions 1, 2, and 3.
method Survey and new results about solenoidal manifolds, using theorems of A. Clark and S. Hurder.
result Topologically homogeneous, compact solenoidal manifolds are McCord solenoids and behave like laminated versions of compact manifolds.

Adaptive learning method for stochastic programs with latent uncertainty.

problem Stochastic programming problems with implicitly decision-dependent uncertainty.
method Adaptive learning-based surrogate method integrating simulation and statistical estimates.
result Established non-asymptotic convergence rate analysis for enhanced stability and efficiency.

The ropelength problem asks for the minimum-length configuration of a knotted diameter-one tube embedded in Euclidean three-space. The core curve of such a tube is called a tight knot, and its length is a knot invariant measuring complexity. In terms of the core curve, the thickness constraint has two parts: an upper b…

2011-02-16abs ↗pdf ↗

Researchers develop Malliavin calculus for signatures, simplifying option Greeks computation.

problem Lack of tractability and explicit representations in Malliavin calculus.
method Focus on finite linear combinations of time-extended Brownian motion signatures, derive explicit formulas for Malliavin derivative, and compute Greeks for path-dependent options.
result Closed-form expressions for classical operators of Malliavin calculus, providing algebraic formulations.

Kalshi prediction markets forecast cryptocurrency volatility through monetary policy and inflation signals.

problem Forecasting cryptocurrency volatility using prediction markets.
method Monetary policy and inflation signals from Kalshi prediction markets.
result Signals from Kalshi prediction markets predict cryptocurrency volatility with statistical significance.

The paper develops a new probabilistic framework for denoising diffusion models using free entropy and stochastic analysis.

problem Developing a mathematical framework for denoising diffusion models in noncommutative settings.
method Formulating diffusion and reverse processes governed by operator-valued stochastic dynamics, using tools from free stochastic analysis.
result Establishing an information-geometric link between entropy production, transport, and deconvolution.

The abstract discusses convergence properties of Lipschitz functions and sets defined by equations.

problem Convergence of Lipschitz functions and sets defined by equations.
method Painlevé-Kuratowski convergence applied to Lipschitz functions and sets defined by equations.
result Generalizations and reverses of classical theorems on convergence of functions and sets.

New RL approach learns dynamic VCG mechanisms in unknown MDP environments.

problem Learning dynamic VCG mechanisms in unknown MDP environments.
method Reward-free online RL for exploration, combined with function approximation.
result Regret bound of O~(T2/3)\tilde{\mathcal{O}}(T^{2/3}) for dynamic VCG mechanism learning.

We solve the optimization of two-layer ReLU networks using convex math.

problem Optimizing two-layer ReLU neural networks.
method Exact characterization of optimal solutions via convex optimization.
result We prove that all globally optimal solutions can be found via convex optimization.

The paper studies properties of Sliced Wasserstein energy for discrete measures.

problem Optimizing discrete probability measures using Sliced Wasserstein loss.
method Investigates the regularity and optimisation properties of the Sliced Wasserstein energy and its Monte-Carlo approximation.
result Convergence results on the critical points of Monte-Carlo approximations to the Sliced Wasserstein energy.

This study proposes a framework for identifying profitable trading opportunities based on volatility and causal relationships.

problem Identifying profitable trading opportunities in financial markets.
method A combination of Gaussian Mixture Model (GMM), Granger Causality Test (GCT), Peter-Clark Momentary Conditional Independence (PCMCI) test, Dynamic Time Warping (DTW), and K-Nearest Neighbours (KNN) for identifying and executing trades.
result The proposed volatility-based trading strategy outperformed a Buy-and-Hold strategy, yielding a total return of 15.38%.