English
Related papers

Related papers: Algorithmic aspects of Lipschitz functions

200 papers

Extending the notion of bounded variation, a function $u \in L_c^1(\mathbb R^n)$ is of bounded fractional variation with respect to some exponent $\alpha$ if there is a finite constant $C \geq 0$ such that the estimate \[ \biggl|\int u(x)…

Functional Analysis · Mathematics 2020-01-23 Roger Züst

Deep learning is moving towards increasingly sophisticated optimization objectives that employ higher-order functions, such as integration, continuous optimization, and root-finding. Since differentiable programming frameworks such as…

Programming Languages · Computer Science 2021-04-15 Benjamin Sherman , Jesse Michel , Michael Carbin

We study a class of ordinary differential equations with a non-Lipschitz point singularity, which admit non-unique solutions through this point. As a selection criterion, we introduce stochastic regularizations depending on the parameter…

Dynamical Systems · Mathematics 2024-11-20 Theodore D. Drivas , Alexei A. Mailybaev , Artem Raibekas

We present a simplified and streamlined characterisation of provably total computable functions of the theory ID_1 of non-iterated inductive definitions. The idea of the simplification is to employ the method of operator-controlled…

Logic · Mathematics 2012-05-15 Naohi Eguchi , Andreas Weiermann

We show that the gradient of a multi-variable strongly differentiable function at a point is the limit of a single coordinate-free Clifford quotient between a multi-difference pseudo-vector and a pseudo-scalar, or of a sum of Clifford…

Analysis of PDEs · Mathematics 2022-03-28 Paolo Roselli

We present an algorithm to compute values L(s) and derivatives of L-functions of motivic origin numerically to required accuracy. Specifically, the method applies to any L-series whose Gamma-factor is a product of any number of…

Number Theory · Mathematics 2013-09-23 Tim Dokchitser

We prove several conjectures made by Z.-W. Sun on the existence of permutations conditioned by certain rational functions. Furthermore, we fully characterize all integer values of the "inverse difference" rational function. Our proofs…

Combinatorics · Mathematics 2019-10-08 Guo-Niu Han

We provide sufficient conditions for a locally lipschitz mapping to be invertible . We use classical local invertibility conditions together with the non-smooth critical point theory.

Classical Analysis and ODEs · Mathematics 2017-04-17 M. Galewski , M. Radulescu

We view a conic optimization problem that has a unique solution as a map from its data to its solution. If sufficient regularity conditions hold at a solution point, namely that the implicit function theorem applies to the normalized…

Optimization and Control · Mathematics 2019-03-28 Enzo Busseti

A rational function $f(x)$ is rationally summable if there exists a rational function $g(x)$ such that $f(x)=g(x+1)-g(x)$. Detecting whether a given rational function is summable is an important and basic computational subproblem that…

Symbolic Computation · Computer Science 2025-03-21 Carlos E. Arreche , Hari P. Sitaula

The local Lipschitz constant of a neural network is a useful metric with applications in robustness, generalization, and fairness evaluation. We provide novel analytic results relating the local Lipschitz constant of nonsmooth vector-valued…

Machine Learning · Statistics 2021-01-12 Matt Jordan , Alexandros G. Dimakis

We investigate the properties of minimizers of one-dimensional variational problems when the Lagrangian has no higher smoothness than continuity. An elementary approximation result is proved, but it is shown that this cannot be in general…

Classical Analysis and ODEs · Mathematics 2017-04-12 Richard Gratwick

We study the distribution of partial sums of Rademacher random multiplicative functions $(f(n))_n$ evaluated at polynomial arguments. We show that for a polynomial $P\in \mathbb Z[x]$ that is a product of at least two distinct linear…

Number Theory · Mathematics 2026-03-09 Jake Chinis , Besfort Shala

The notion of program sensitivity (aka Lipschitz continuity) specifies that changes in the program input result in proportional changes to the program output. For probabilistic programs the notion is naturally extended to expected…

Programming Languages · Computer Science 2019-10-29 Peixin Wang , Hongfei Fu , Krishnendu Chatterjee , Yuxin Deng , Ming Xu

We consider and provide an accurate study for the fractional Zernike functions on the punctured unit disc, generalizing the classical Zernike polynomials and their associated $\beta$-restricted Zernike functions. Mainly, we give the…

Complex Variables · Mathematics 2023-01-23 Hajar Dkhissi , Allal Ghanmi , Safa Snoun

We introduce a generalized version of the local Lipschitz number $\textrm{lip}\,u$, and show that it can be used to characterize Sobolev functions $u\in W_{\textrm{loc}}^{1,p}(\mathbb R^n)$, $1\le p\le \infty$, as well as functions of…

Metric Geometry · Mathematics 2024-06-12 Panu Lahti

We continue the investigation of algorithmically random functions and closed sets, and in particular the connection with the notion of capacity. We study notions of random continuous functions given in terms of a family of computable…

Logic · Mathematics 2015-03-24 Douglas Cenzer , Christopher P. Porter

In this note, we establish the Lipschitz continuity of finite-dimensional globally convex functions on all given balls and global Lipschitz continuity for eligible functions of that type. The Lipschitz constants in both situations draw…

Optimization and Control · Mathematics 2024-08-02 Pham Duy Khanh , Vu Vinh Huy Khoa , Vo Thanh Phat , Le Duc Viet

We prove maximum and comparison principles for fractional discrete derivatives in the integers. Regularity results when the space is a mesh of length $h$, and approximation theorems to the continuous fractional derivatives are shown. When…

Analysis of PDEs · Mathematics 2016-05-24 Luciano Abadías , Marta de León-Contreras , José L. Torrea

We study the interaction between polynomial space randomness and a fundamental result of analysis, the Lebesgue differentiation theorem. We generalize Ko's framework for polynomial space computability in $\mathbb{R}^n$ to define…

Computational Complexity · Computer Science 2016-04-27 Xiang Huang , D. M. Stull
‹ Prev 1 8 9 10 Next ›