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,694 papers · 148 categories

Trend · papers per month

117233350466 · Jun 202019922001200920172026
48 results for Non-Smooth Analysis

Smoothness analysis of adversarial training reveals LL_\infty constraints cause more non-smoothness.

problem Non-smoothness of adversarial training loss function.
method Analyzed the smoothness of adversarial training loss function using optimal attacks for model parameters.
result The LL_\infty constraint causes more non-smoothness than L2L_2 constraint.

MARINA-P improves non-smooth federated optimization with adaptive stepsizes.

problem Non-smooth federated optimization in machine learning applications.
method Extends EF21-P and MARINA-P to non-smooth convex setting, proving optimal convergence rate and communication complexity bounds.
result MARINA-P achieves O(1/T)O(1/\sqrt{T}) convergence rate and communication complexity matching classical subgradient methods.

New methods improve convergence in non-convex non-smooth learning problems.

problem Sparse learning from high-dimensional data with non-convex, non-smooth regularizers.
method Stochastic proximal gradient methods with arbitrary sampling.
result Independent sampling improves performance over uniform sampling.

New bounds explain deterministic non-smooth deep nets without large Lipschitz constants.

problem Challenges in explaining generalization of deterministic non-smooth deep nets.
method De-randomized PAC-Bayes margin bounds for deterministic non-convex and non-smooth predictors.
result New bounds avoid large Lipschitz constants, providing generalization guarantees.

Novel method for shape optimization of non-smooth PDEs.

problem Optimizing shapes governed by non-smooth PDEs.
method Functional variational approach and sensitivity analysis.
result Necessary conditions for locally optimal shapes.

New iterative regularization method tackles non-smooth, non-strongly convex functionals.

problem Tackles non-smooth, non-strongly convex functionals in regularization problems.
method Primal-dual algorithm with convergence and stability analysis.
result First iterative regularization procedure for non-smooth, non-strongly convex functionals.

Advances smooth over-parameterization for solving non-smooth optimization problems.

problem Non-smooth optimization with structural constraints in imaging and machine learning.
method Smooth over-parameterization of non-smooth problems, using gradient descent and mirror descent.
result Gradient descent on the reformulated smooth problem converges efficiently without parameter tuning.

Consistency models accelerate generation with theoretical guarantees.

problem Empirical success of consistency models without theoretical justification.
method Theoretical analysis of consistency models mapping inputs to arbitrary points.
result Achieve KL divergence of order O(ε2) O(\varepsilon^2) with $ O\left(\log\left(\frac{d}{\varepsilon} ight) ight) $ iterations.

New method tackles non-smooth tensor data for better recovery.

problem Non-smooth changes in tensor data degrade traditional t-SVD methods.
method Learnable tensor nuclear norm, Alternating Proximal Multiplier Method (APMM), multi-objective tensor recovery framework.
result The proposed method effectively recovers tensor data with non-smooth changes.

The paper extends macroscopic market making to stochastic games, revealing properties and solving equations.

problem Price competition among market makers in a stochastic game setting.
method Extension of macroscopic market making framework to stochastic games, introducing multidimensional characteristic equations.
result New well-posedness results for forward-backward stochastic differential equations.

We introduce non-smooth symplectic forms on manifolds and describe corresponding Poisson structures on the algebra of Colombeau generalized functions. This is achieved by establishing an extension of the classical map of smooth functions to Hamiltonian vector fields to the setting of non-smooth geometry. For mildly sin…

2014-03-02abs ↗pdf ↗

The paper explores various stationarity concepts in non-smooth optimization.

problem Understanding stationarity in non-smooth optimization problems.
method Introduction and discussion of different stationarity concepts for non-convex non-smooth functions.
result Clarification of the relationship among different stationarity concepts and their relevance in iterative methods.

Recent research connects Hörmander's old work to modern boundary Laplacian analysis.

problem How close is the Dirichlet-to-Neumann map to the boundary Laplacian?
method Investigates techniques from Hörmander's 1950s manuscript to solve modern boundary Laplacian problems.
result Obtained results for DtN maps on non-smooth boundaries, Helmholtz equation, and differential forms.

In the framework of Lorentzian warped products, we study the Friedmann-Robertson-Walker cosmological model to investigate non-smooth curvatures associated with multiple discontinuities involved in the evolution of the universe. In particular we analyze non-smooth features of the spatially flat Friedmann-Robertson-Walke…

2003-08-16abs ↗pdf ↗

This work speeds up hyperparameter selection for non-smooth convex models using implicit differentiation.

problem Optimizing hyperparameters of non-smooth convex models.
method Implicit differentiation of proximal gradient and coordinate descent methods.
result Implicit differentiation can speed up hyperparameter optimization, especially for non-smooth problems.

New bounds for online portfolio selection without smoothness assumptions.

problem Online portfolio selection with non-Lipschitz, non-smooth losses.
method Data-dependent bounds using novel smoothness characterizations and FTRL with self-concordant regularizers.
result Achieves logarithmic regrets when data is 'easy' and sublinear worst-case regrets.

We study the positive mass theorem for certain non-smooth metrics following P. Miao's work. Our approach is to smooth the metric using the Ricci flow. As well as improving some previous results on the behaviour of the ADM mass under the Ricci flow, we extend the analysis of the zero mass case to higher dimensions.

2011-04-12abs ↗pdf ↗

This paper analyzes stability and generalization of Markov chain stochastic gradient methods.

problem Analyzing stability and generalization of Markov chain stochastic gradient methods.
method Algorithmic stability in statistical learning theory.
result Established optimal generalization bounds for both smooth and non-smooth cases.

Positive mass theorem for non-smooth metrics on flat manifolds with corners.

problem Proving a positive mass theorem for non-smooth metrics on asymptotically flat manifolds with non-compact boundary.
method Proves a positive mass theorem for metrics that are only continuous across a compact hypersurface.
result Obtains a positive mass theorem on manifolds with non-compact corners.

Adaptive NN method improves matrix completion for non-smooth data.

problem Matrix completion with non-smooth non-linear functions under high missingness.
method Two-sided nearest neighbors with \Holder function class non-linearity.
result NN error rate matches oracle's for latent factors, non-trivial for wide range of missingness.

Deep neural networks outperform other methods in estimating non-smooth functions with singularities.

problem Estimating functions with singularities on hypersurfaces.
method Developed a minimax rate analysis for DNNs, proving their almost optimal convergence rate.
result DNNs outperform other estimators in estimating non-smooth functions with singularities.

New SPS variant improves non-smooth optimization without small gradients.

problem Improving non-smooth optimization without small gradients.
method Safeguarded Stochastic Polyak Step Size (SPSsafe_{safe}) for non-smooth optimization.
result Rigorous convergence guarantees for non-smooth convex optimization without strong assumptions.

The paper develops bounds and regularity for minimal boundaries in non-smooth spaces with Ricci curvature.

problem Minimal boundaries in non-smooth spaces with Ricci curvature.
method Intrinsic theory of Laplacian bounds, PDE principle, sharp Laplacian bounds on distance function, regularity theory for perimeter-minimizing boundaries.
result Sharp Laplacian bounds and regularity results for perimeter-minimizing boundaries.

Stochastic approximation proves asymptotic normality for non-smooth problems.

problem Solving non-smooth stochastic approximation problems.
method Stochastic approximation algorithms for solving smooth equations, extended to non-smooth problems.
result Asymptotic normality and optimality in non-smooth stochastic approximation is proven.