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

Trend · papers per month

11233445 · May 202619922001200920172026
48 results for Lipschitz modulus

Defines a new modulus for Lipschitz surfaces and proves a homological duality theorem.

problem Lipschitz homology classes and their moduli.
method Defining a new modulus dModp\operatorname{dMod}_p and proving a homological duality theorem.
result Every relative Lipschitz kk-homology class has a unique dual class satisfying a specific modulus product equality.

Proves conditions for Fourier transforms in rank 1 symmetric spaces.

problem Understanding Fourier transform bounds in symmetric spaces.
method Proves sufficient and necessary conditions using Lipschitz and Fourier type integral conditions.
result Establishes bounds for Fourier transforms in rank 1 symmetric spaces with specific moduli of continuity.

Sharp Lipschitz bounds and gradient estimates for fully nonlinear parabolic equations.

problem Understanding moduli of continuity for fully nonlinear parabolic equations.
method Proving moduli of continuity of viscosity solutions are subsolutions of one-dimensional parabolic equations.
result Sharp Lipschitz bounds and gradient estimates for fully nonlinear parabolic equations with bounded initial data.

A scattering transform defines a signal representation which is invariant to translations and Lipschitz continuous relatively to deformations. It is implemented with a non-linear convolution network that iterates over wavelet and modulus operators. Lipschitz continuity locally linearizes deformations. Complex classes o…

2011-12-05abs ↗pdf ↗

New bounds on the wildness of Bing's involution.

problem Analyzing the wildness of Bing's involution in terms of its modulus of continuity.
method Proving a nearly exponential modulus of continuity for topologically conjugate involutions.
result The modulus of continuity for topologically conjugate Bing involutions is at least exponential up to a polylogarithmic factor.

Softmax and k-means clustering are mathematically linked, improving neural network robustness.

problem Improving neural network robustness against adversarial attacks.
method Formally proving the connection between softmax and k-means, proposing Centroid Based Tailoring.
result The proposed Gauss network is less susceptible to one-pixel attacks.

Let CC be a subset of Rn\mathbb{R}^n (not necessarily convex), f:CRf:C\to\mathbb{R} be a function, and G:CRnG:C\to\mathbb{R}^n be a uniformly continuous function, with modulus of continuity ωω. We provide a necessary and sufficient condition on ff, GG for the existence of a convex function FC1,ω(Rn)F\in C^{1, ω}(\mathbb{R}^n)

2015-07-14abs ↗pdf ↗

Establishes a lower bound for Kähler hyperbolicity modulus in hyperconvex domains and bounded strongly pseudoconvex domains.

problem Kähler hyperbolicity modulus for simply-connected Kähler hyperbolic manifolds
method Computes the Kähler hyperbolicity modulus for bounded symmetric domains
result Establishes a lower bound for the Kähler hyperbolicity modulus in terms of the boundary behavior of the gradient length of a plurisubharmonic function

The pp--modulus modp(F){\rm mod}_p(\mathcal{F}) of a foliation F\mathcal{F} on a Riemannian manifold MM is a generalization of extremal length of plane curves introduced by L. Ahlfors. We study the variation tmodp(Ft)t\mapsto{\rm mod}_p(\mathcal{F}_t) of the modulus. In particular, we consider product of moduli of orthogonal fo…

2012-05-30abs ↗pdf ↗

For any link and for any modulus mm we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring is formed by each assignment of colors to the arcs of the diagram that is obtaine…

2012-08-05abs ↗pdf ↗

Study on the Euler-Plateau energy with elastic modulus, focusing on minimizers and critical surfaces.

problem Minimizing the Euler-Plateau energy with elastic modulus.
method Analyzing the energy functional and its minimizers, considering different boundary conditions and topological constraints.
result Potential minimizers are highly dependent on physical rigidity parameters, and the area of critical surfaces can be computed from boundary data.

Deep networks improve by progressively refining approximations at each layer.

problem Standard approximation theory doesn't explain the role of intermediate layers in deep neural networks.
method Developed a mixed-activation architecture with a geometric scale interpretation of depth.
result Each intermediate layer approximates the target function with a geometric rate.

Unified approach for sample aggregation in transfer learning across various divergence measures.

problem Optimizing sample aggregation from source to target distributions for improved target performance.
method Unified algorithmic approach that adapts to multiple divergence measures via a weak modulus of transfer.
result Unified approach achieves near optimal rates in terms of the unknown strong modulus, applicable in more general settings.

We discuss the maximum modulus principle, and weak unique continuation, for CR functions on an abstract almost CR manifold M. We investigate these matters under the assumption of weak pseudoconcavity, and obtain sharp results about propagation along Sussmann leaves.

2007-11-09abs ↗pdf ↗

Study on existence and properties of continuous solutions to complex Hessian equations.

problem Existence and properties of continuous solutions to complex Hessian equations.
method Established new capacity estimates and weak stability estimates for the mm-Hessian measure.
result Existence of continuous solutions to the complex Hessian equation under certain conditions.

This article concerns exact results on the minimum number of colors of a Fox coloring over the integers modulo r, of a link with non-null determinant. Specifically, we prove that whenever the least prime divisor of the determinant of such a link and the modulus r is 2, 3, 5, or 7, then the minimum number of colors is 2…

2010-01-08abs ↗pdf ↗

Cannon, Floyd and Parry have studied the modulus of finite subdivision rules extensively. We investigate the properties of the modulus of subdivision rules with linear and exponential growth at every vertex, using barycentric subdivision and a subdivision rule for the Borromean rings as examples. We show that the subdi…

2011-09-29abs ↗pdf ↗

We investigate the properties of a modulus of a foliation on a Riemannian manifold. We give necessary and sufficient conditions for the existence of an extremal function and state some of its properties. We obtain the integral formula which, in a sense, combines the integral over the manifold with integral over the lea…

2012-05-07abs ↗pdf ↗

In this work, we study data preconditioning, a well-known and long-existing technique, for boosting the convergence of first-order methods for regularized loss minimization. It is well understood that the condition number of the problem, i.e., the ratio of the Lipschitz constant to the strong convexity modulus, has a h…

2014-08-13abs ↗pdf ↗

Study on Hölder continuity of complex Monge-Ampère solutions on Stein spaces.

problem Understanding continuity of solutions to complex Monge-Ampère equations on Stein spaces.
method Analyzing solutions with LpL^p densities and Hölder boundary data on Stein spaces with isolated singularities.
result Solutions are Hölder continuous outside singular points if boundary data is Hölder continuous.

We develop methods to efficiently approximate data in metric spaces without additional assumptions.

problem Efficiently approximating data in metric spaces without imposing structural assumptions.
method Identify discrete modulus of continuity, investigate consistency, propose algorithm, and develop approximation theory.
result Consistent approximation of data in metric spaces without structural assumptions.

Researchers establish bounds and continuity of decomposed Möbius energies using cosine formula.

problem Estimating the bounds and continuity of decomposed Möbius energies.
method Using the cosine formula to evaluate upper and lower bounds and modulus of continuity of decomposed energies.
result Affirmative answer to the question of estimating decomposed energies using the cosine formula.

Consider the massless Dirac operator on a 3-torus equipped with Euclidean metric and standard spin structure. It is known that the eigenvalues can be calculated explicitly: the spectrum is symmetric about zero and zero itself is a double eigenvalue. The aim of the paper is to develop a perturbation theory for the eigen…

2013-06-24abs ↗pdf ↗

By regular tessellation, we mean any hyperbolic 3-manifold tessellated by ideal Platonic solids such that the symmetry group acts transitively on oriented flags. A regular tessellation has an invariant we call the cusp modulus. For small cusp modulus, we classify all regular tessellations. For large cusp modulus, we pr…

2014-06-11abs ↗pdf ↗

The Korányi ellipsoidal ring E\mathcal{E} of radii BB and AA, 0<B<A0<B<A, is defined as the image of the Korányi spherical ring of the same radii and centred at the origin via a linear contact map LL in the Heisenberg group. If K1K\ge 1 is the maximal distortion of LL then we prove that the modulus of E\mathcal{E} i…

2018-07-31abs ↗pdf ↗

Physics-informed GANs estimate elastic moduli from mechanical tests.

problem Estimating spatially-varying elastic moduli from measured deformations.
method Physics-informed Generative Adversarial Networks (PI-GANs) with PDE constraints.
result Generated stiffness samples match true distribution statistics.

We prove the Fundamental Gap Conjecture, which states that the difference between the first two Dirichlet eigenvalues (the spectral gap) of a Schrödinger operator with convex potential and Dirichlet boundary data on a convex domain is bounded below by the spectral gap on an interval of the same diameter with zero poten…

2010-06-09abs ↗pdf ↗

This paper optimizes ReLU networks for approximating Hölder continuous functions.

problem Optimizing the approximation rate of ReLU networks in terms of width and depth.
method Constructive proof of ReLU networks' approximation power with specific width and depth constraints.
result Optimal approximation rate of ReLU networks with width and depth constraints.

The Gauss-Newton method is analyzed for neural networks using Riemannian optimization techniques.

problem Training neural networks with smooth activations and convergence rates.
method Riemannian optimization perspective, analyzing the Gauss-Newton method in both underparameterized and overparameterized regimes.
result Geometric convergence rates independent of conditioning and eigenvalues, demonstrating accelerated convergence.

Sharp estimates derived for quasilinear equations on metric measure spaces.

problem Estimating solutions and eigenvalues of quasilinear equations on smooth metric measure spaces.
method Sharp estimates derived using comparisons with one-dimensional equations.
result Optimal lower bounds for the first Dirichlet eigenvalue of quasilinear operators.