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

1223 · May 202419922001200920172026
48 results for Clarke subdifferential

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.

Counterexamples show failure of uniform laws of large numbers for subdifferentials.

problem Failure of uniform laws of large numbers for subdifferentials under natural assumptions.
method Univariate and bivariate random Lipschitz and convex functions with smooth pieces.
result Counterexamples demonstrate failure of uniform laws of large numbers for subdifferentials.

This work establishes uniform convergence of subdifferentials in stochastic optimization.

problem Understanding how empirical stationary points approximate population ones in nonsmooth, nonconvex stochastic optimization.
method Reduction principle for weakly convex stochastic objectives, focusing on subgradient convergence.
result Sharp uniform convergence rates for subdifferential mappings in stochastic convex-composite optimization.

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.

Study on tensor nuclear norm's decomposability and subdifferential.

problem Understanding tensor nuclear norm in higher-order tensors.
method Showed decomposability over specific subspaces, derived subdifferential inclusions, and studied subgradients.
result Established the statistical performance of tensor robust principal component analysis.

The paper tackles finding stationary points in stochastic convex optimization problems.

problem Finding stationary points for stochastic convex optimization problems.
method The approach relies on dimension theory to decompose the graph of the subdifferential of a convex function, showing how stochastic sampling preserves 'pieces' of these graphs, and allowing effective application of proximal-point-like methods.
result The paper provides convergence guarantees for finding stationary points in stochastic convex optimization problems.

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.

We investigate the notion of H-subdifferential and H-normal map of a function on the Heisenberg group, based on its sub-Riemannian structure. In particular, a characterization of the convexity of a function is given via the nonemptiness of the H-subdifferential at every point.

2008-11-14abs ↗pdf ↗

The paper defines subdifferentials on Hadamard manifolds and identifies conditions for Fenchel conjugate equality.

problem Understanding convex analysis on Riemannian manifolds.
method Using Busemann functions to define subdifferentials and investigate Fenchel conjugate equality.
result Identifies conditions for equality in the Fenchel-Young inequality on Hadamard manifolds.

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 ↗

We prove that every function f:RnRf:\mathbb{R}^n\to \mathbb{R} satisfies that the image of the set of critical points at which the function ff has Taylor expansions of order n1n-1 and non-empty subdifferentials of order nn is a Lebesgue-null set. As a by-product of our proof, for the proximal subdifferential $\partial_{…

2016-05-05abs ↗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.

New algorithms optimize spectral risk measures, improving interpolation between average and worst-case performance.

problem Optimizing spectral risk measures for learning systems.
method Developed stochastic algorithms to optimize spectral risk measures by characterizing their subdifferential and addressing challenges like biasedness of subgradient estimates and non-smoothness.
result Our approach outperforms out-of-the-box stochastic subgradient and dual averaging methods in optimizing spectral risk measures.

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.

Recently, based on the idea of randomizing space theory, random convex analysis has been being developed in order to deal with the corresponding problems in random environments such as analysis of conditional convex risk measures and the related variational problems and optimization problems. Random convex analysis is …

2016-03-23abs ↗pdf ↗

Study proves convergence of subgradients for optimal transport-based objectives.

problem Ensuring statistical consistency and optimization stability in transport-based models.
method Proves graphical convergence of subdifferentials to the subdifferential of the population objective.
result Standard subgradient methods consistently approach stationary points of the population-level problem.

We propose a new class of convex penalty functions, called \emph{variational Gram functions} (VGFs), that can promote pairwise relations, such as orthogonality, among a set of vectors in a vector space. These functions can serve as regularizers in convex optimization problems arising from hierarchical classification, m…

2015-07-16abs ↗pdf ↗

The concept of subdifferentiability is studied in the context of C1C^1 Finsler manifolds (modeled on a Banach space with a Lipschitz C1C^1 bump function). A class of Hamilton-Jacobi equations defined on C1C^1 Finsler manifolds is studied and several results related to the existence and uniqueness of viscosity solutions…

2014-07-10abs ↗pdf ↗

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.

Given a real-valued function defined on the Heisenberg group, we provide a definition of abstract convexity and Fenchel transform that takes into account the sub-Riemannian structure of the group. In our main result, we prove that, likewise the Euclidean case, a convex function can be characterized via its iterated Fen…

2008-12-15abs ↗pdf ↗

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 ↗

New examples of sub-Riemannian structures satisfying Minimizing Sard conjecture found.

problem Finding complete sub-Riemannian structures satisfying the Minimizing Sard conjecture.
method Techniques from nonsmooth analysis and geometric measure theory.
result Complete sub-Riemannian structures associated with distributions of co-rank 2 or generic distributions of rank ≥ 2 satisfy the Minimizing Sard conjecture.

Generalized matrix-fractional (GMF) functions are a class of matrix support functions introduced by Burke and Hoheisel as a tool for unifying a range of seemingly divergent matrix optimization problems associated with inverse problems, regularization and learning. In this paper we dramatically simplify the support func…

2017-03-04abs ↗pdf ↗

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.

We show how risk measures originally defined in a model free framework in terms of acceptance sets and reference assets imply a meaningful underlying probability structure. Hereafter we construct a maximal domain of definition of the risk measure respecting the underlying ambiguity profile. We particularly emphasise li…

2017-03-03abs ↗pdf ↗

The subdifferential of convex functions of the singular spectrum of real matrices has been widely studied in matrix analysis, optimization and automatic control theory. Convex analysis and optimization over spaces of tensors is now gaining much interest due to its potential applications to signal processing, statistics…

2015-06-08abs ↗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 ↗