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

8152330 · May 202619922001200920172026
48 results for nonsmooth calculus

Develops a mathematical model for automatic differentiation in machine learning.

problem Current automatic differentiation lacks a simple mathematical model for machine learning.
method Articulates relationships between program differentiation and nonsmooth functions, provides a class of functions and nonsmooth calculus.
result Shows how nonsmooth calculus applies to stochastic approximation methods and evidence of artificial critical points.

New theory for nonsmooth systems helps optimize and control complex functions.

problem Optimizing and controlling systems with nonsmooth functions.
method Higher-order averaging theory with nonsmooth near-identity transformation and lexicographic differentiation.
result Closed formula for nonsmooth first and second-order averaging.

We introduce novel equations, in the spirit of rough path theory, that parametrize level sets of intrinsically regular maps on the Heisenberg group with values in R2\mathbb{R}^2. These equations can be seen as a sub-Riemannian counterpart to classical ODEs arising from the implicit function theorem. We show that they e…

2016-10-27abs ↗pdf ↗

In this paper we present a new theory of calculus over kk-dimensional domains in a smooth nn-manifold, unifying the discrete, exterior, and continuum theories. The calculus begins at a single point and is extended to chains of finitely many points by linearity, or superposition. It converges to the smooth continuum w…

2006-01-09abs ↗pdf ↗

We discuss smooth nonlinear control systems with symmetry. For a free and proper action of the symmetry group, the reduction of symmetry gives rise to a reduced smooth nonlinear control system. If the action of the symmetry group is only proper, the reduced nonlinear control system need not be smooth. Using the smooth …

2003-05-06abs ↗pdf ↗

PPGD solves nonconvex nonsmooth optimization problems without KL property.

problem Nonconvex and nonsmooth optimization problems in statistics and machine learning.
method Projective Proximal Gradient Descent (PPGD) for solving a class of nonconvex and nonsmooth problems.
result PPGD achieves a fast convergence rate of O(1/k^2) for k ≥ k_0.

Study on Adam-family methods for nonsmooth optimization with convergence guarantees.

problem Training nonsmooth neural networks with convergence guarantees.
method Two-timescale updating scheme and stochastic subgradient methods with gradient clipping.
result Convergence guarantees for various Adam-family methods in training nonsmooth neural networks.

This paper tackles nonsmooth optimization in machine learning.

problem Nonsmoothness in machine learning optimization problems.
method Identifying specific structures and leveraging them for practical applications.
result Compression, acceleration, and dimension reduction are possible with nonsmooth optimization.

Study on nonsmooth contractive SA with constant stepsize and Q-learning.

problem Understanding convergence and bias in nonsmooth contractive SA with different noise types.
method Proposed prelimit coupling technique for steady-state convergence and derived asymptotic bias.
result Asymptotic bias of nonsmooth SA is proportional to the square root of the stepsize.

New methods help escape strict saddle points in nonsmooth optimization.

problem Escaping strict saddle points in nonsmooth optimization.
method An inexact stochastically perturbed gradient method applied to the Moreau envelope.
result A variety of algorithms for nonsmooth optimization can efficiently escape strict saddle points of the Moreau envelope.

New Langevin Monte Carlo algorithms for sampling from nonsmooth distributions.

problem Sampling from distributions with nonsmooth convex composite potentials.
method Leveraging Bregman--Moreau envelopes and proximal operators in mirror descent.
result Efficiency in sampling from nonsmooth distributions, extending existing methods.

We analyze stochastic algorithms for optimizing nonconvex, nonsmooth finite-sum problems, where the nonconvex part is smooth and the nonsmooth part is convex. Surprisingly, unlike the smooth case, our knowledge of this fundamental problem is very limited. For example, it is not known whether the proximal stochastic gra…

2016-05-23abs ↗pdf ↗

New method solves nonsmooth low-rank matrix optimization problems efficiently.

problem Nonsmooth and low-rank matrix optimization problems in statistics and machine learning.
method Low-rank Extragradient Method with warm-start initialization.
result The extragradient method converges to an optimal solution with rate O(1/t)O(1/t) and requires only two low-rank SVDs per iteration.

Paper develops privacy-preserving federated learning for nonsmooth objectives.

problem Solving nonsmooth objective functions in a privacy-preserving manner.
method Zero-concentrated differential privacy (zCDP) with Gaussian noise, distributed ADMM, and approximation of augmented Lagrangian.
result The algorithm achieves a competitive privacy-accuracy trade-off and converges to the exact solution.

Paper develops algorithms for nonsmooth, nonconvex statistical learning problems.

problem Nonsmooth and nonconvex objectives in statistical learning.
method Bregman-surrogate algorithm framework, including local linear approximation, mirror descent, iterative thresholding, DC programming.
result Global convergence rates for nonconvex and nonsmooth objectives in high dimensions.

Theory of parallel transport on non-collapsed RCD spaces established.

problem Parallel transport on non-collapsed RCD spaces.
method General theory developed for parallel transport on non-collapsed RCD spaces, including geodesics and curves via time-dependent vector fields.
result Existence and uniqueness of parallel transport results obtained.

In regularized risk minimization, the associated optimization problem becomes particularly difficult when both the loss and regularizer are nonsmooth. Existing approaches either have slow or unclear convergence properties, are restricted to limited problem subclasses, or require careful setting of a smoothing parameter…

2016-02-25abs ↗pdf ↗

Paper develops an online covariance estimator for nonsmooth stochastic approximation problems.

problem Estimating covariance in nonsmooth, potentially non-monotone settings.
method Online batch-means covariance matrix estimator.
result Estimator achieves convergence rate of O(dn1/8+ε)O(\sqrt{d}n^{-1/8+\varepsilon}).

Unified Lagrangian-based methods for nonsmooth nonconvex optimization.

problem Minimizing nonsmooth nonconvex functions with constraints.
method Developed a unified framework for Lagrangian-based methods using subgradient updates.
result Global convergence guarantees for the proposed framework under mild conditions.

We consider in this paper a class of composite optimization problems whose objective function is given by the summation of a general smooth and nonsmooth component, together with a relatively simple nonsmooth term. We present a new class of first-order methods, namely the gradient sliding algorithms, which can skip the…

2014-06-04abs ↗pdf ↗

We show that every closed, simply connected, spin topological 4-manifold except S4S^4 and S2×S2S^2\times S^2 admits a homologically trivial, pseudofree, locally linear action of Zp\mathbb{Z}_p for any sufficiently large prime number pp which is nonsmoothable for any possible smooth structure.

2008-08-31abs ↗pdf ↗

The paper guarantees global stability for stochastic subgradient methods in nonsmooth nonconvex optimization.

problem Minimizing nonsmooth nonconvex functions with convergence guarantees.
method Developed a framework for stochastic subgradient methods with global stability guarantees.
result Iterates are uniformly bounded and asymptotically stabilize around the stable set of the differential inclusion.

Nesterov's extrapolation improves convergence in nonsmooth optimization.

problem Improving convergence rate in nonsmooth convex optimization.
method Nesterov's extrapolation applied to projected subgradient methods.
result Nesterov's extrapolation optimizes individual convergence for nonsmooth problems.

Improved shuffling gradient methods converge faster for nonsmooth convex optimization.

problem Improving convergence rates for nonsmooth convex optimization problems.
method Analysis of shuffling gradient methods, focusing on Random Reshuffle and Single Shuffle strategies.
result Shuffling gradient methods, particularly Random Reshuffle and Single Shuffle, converge faster than Proximal Gradient Descent for nonsmooth convex optimization.

Two new methods solve nonsmooth optimization on Riemannian Stiefel manifold.

problem Optimization over nonsmooth, non-differentiable functions on Riemannian manifolds.
method R-ProxSGD and R-ProxSPB, generalizing proximal SGD and SpiderBoost.
result R-ProxSPB finds ε-stationary points with IFO complexity of Ø(ε^(-3)) in online and Ø(n + √nε^(-2)) in finite-sum cases.

This paper concerns dictionary learning, i.e., sparse coding, a fundamental representation learning problem. We show that a subgradient descent algorithm, with random initialization, can provably recover orthogonal dictionaries on a natural nonsmooth, nonconvex 1\ell_1 minimization formulation of the problem, under mi…

2018-10-25abs ↗pdf ↗

We present a stochastic setting for optimization problems with nonsmooth convex separable objective functions over linear equality constraints. To solve such problems, we propose a stochastic Alternating Direction Method of Multipliers (ADMM) algorithm. Our algorithm applies to a more general class of nonsmooth convex …

2012-11-03abs ↗pdf ↗

Study shows limitations of Lie bracket commutation for nonsmooth vector fields.

problem Limitations of Lie bracket commutation for nonsmooth vector fields.
method Analysis of nonsmooth vector fields, focusing on commutation of flows and Lie bracket conditions.
result Lie bracket commutation cannot be extended to general a.e. differentiable vector fields, but holds for certain Sobolev regular fields.

In this paper, we consider the problem of minimizing the average of a large number of nonsmooth and convex functions. Such problems often arise in typical machine learning problems as empirical risk minimization, but are computationally very challenging. We develop and analyze a new algorithm that achieves robust linea…

2018-05-11abs ↗pdf ↗

New solver SR2 tackles deep neural network training with nonsmooth regularization.

problem Training deep neural networks with nonsmooth regularization to achieve sparsity and efficiency.
method Combines adaptive quadratic regularization with proximal stochastic gradient principles.
result Established worst-case iteration complexity of O(ε^−2) for SR2.

By the Thurston stability theorem, a group of C^1 orientation-preserving diffeomorphisms of the closed unit interval is locally indicable. We show that the local order structure of orbits gives a stronger criterion for nonsmoothability that can be used to produce new examples of locally indicable groups of homeomorphis…

2008-02-19abs ↗pdf ↗

Much of the vast literature on the integral during the last two centuries concerns extending the class of integrable functions. In contrast, our viewpoint is akin to that taken by Hassler Whitney [{\it Geometric integration theory}, Princeton Univ. Press, Princeton, NJ, 1957] and by geometric measure theorists because …

1993-10-01abs ↗pdf ↗