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

Trend · papers per month

62125187249 · Jun 202019922001200920172026
48 results for smooth versions

We present a definable smooth version of the Thom transversality theorem. We show further that the set of non-transverse definable smooth maps is nowhere dense in the definable smooth topology. Finally, we prove a definable version of a theorem of Trotman which says that the Whitney (a)(a)-regularity of a stratification…

2017-11-29abs ↗pdf ↗

We recall and partially improve four versions of smooth, non-abelian gerbes: Cech cocycles, classifying maps, bundle gerbes, and principal 2-bundles. We prove that all these four versions are equivalent, and so establish new relations between interesting recent developments. Prominent partial results we prove are a bij…

2011-03-24abs ↗pdf ↗

A version of smooth K-theory is constructed, which is adapted to the total Chern class instead of the Chern character (contrarily to previous theories). Some total Chern class morphism from this K-theory to Cheeger-Simons differential characters is constructed. This answers a question raised by U. Bunke.

2008-06-30abs ↗pdf ↗

New moving plane method for varifolds promotes smoothness from boundary to interior.

problem Promoting smoothness from boundary to interior for singular hypersurfaces.
method Introduced a moving plane method for varifolds, showing smoothness as a conclusion.
result Smoothness and symmetry in the interior can be promoted from smoothness and symmetry at infinity.

This paper formalizes and compares different CV methods for estimating classifier performance.

problem Variations of cross-validation methods for estimating classifier performance are not well understood.
method Mathematical formalization and analysis of different CV methods, proving their properties and suggesting a smooth estimator.
result The repeated KK-fold CV is the only smooth estimator, but it estimates both conditional and mean performance accurately.

RS-PINN uses randomized smoothing to speed up high-dimensional PDE simulations without sacrificing accuracy.

problem High computational cost and bias in PINNs for high-dimensional PDEs.
method Introduces Gaussian noise for stochastic smoothing of PINNs, enabling Monte Carlo derivative approximation.
result Proposes bias correction techniques and a hybrid method to optimize the bias-variance trade-off.

We show that one can skip the skew-symmetry assumption in the definition of Nambu-Poisson brackets. In other words, a n-ary bracket on the algebra of smooth functions which satisfies the Leibniz rule and a n-ary version of the Jacobi identity must be skew-symmetric. A similar result holds for a non-antisymmetric versio…

2001-04-11abs ↗pdf ↗

The Morse complex is shown to be an infinite functor.

problem Understanding the structure of Morse complexes as infinite functors.
method Showed the Morse complex of a compact Lie monoid can be given the structure of an f-bialgebra and defined an ∞-functor.
result Obtained two other ∞-functors mapping manifolds and actions to their Morse complexes.

We construct an analytic multiplicative model of smooth K-theory. We further introduce the notion of a smooth K-orientation of a proper submersion and define the associated push-forward which satisfies functoriality, compatibility with pull-back diagrams, and projection and bordism formulas. We construct a multiplicati…

2007-06-30abs ↗pdf ↗

Quantifies scalar curvature under C0C^0 convergence, proving a refined version in all dimensions.

problem Proving a refined quantitative bound for scalar curvature under C0C^0 convergence.
method Established the refined quantitative bound in all dimensions using smoothing techniques.
result Established the refined quantitative bound for scalar curvature in all dimensions.

Algorithm tackles adaptive discretization in adversarial Lipschitz bandits for dynamic pricing and auctions.

problem Adaptive discretization in adversarial Lipschitz bandits.
method Adversarial Zooming algorithm for adaptive discretization.
result First algorithm for adversarial Lipschitz bandits with instance-dependent regret bounds.

Classifies Real line bundles with Real connections on manifolds with involution.

problem Classifying Real line bundles with Real connections on manifolds with involution.
method Defines Real smooth Deligne cohomology to interpolate between equivariant sheaf cohomology and smooth imaginary-valued forms.
result Classifies Real line bundles with Real connections on manifolds with involution.

The paper proves a nonlocal version of the Alexandrov Theorem for smooth boundaries.

problem Proving the nonlocal version of the Alexandrov Theorem for sets with smooth boundaries.
method Formulated a necessary and sufficient condition for the theorem to hold, used a specific formula for the tangential derivative of the nonlocal mean curvature, and applied the method of moving planes.
result The only set with smooth boundary and constant nonlocal mean curvature is an Euclidean ball.

The simplicial volume of oriented closed connected smooth manifolds that admit a non-trivial smooth S1S^1-action vanishes. In the present work we prove a version of this result for the integral foliated simplicial volume of aspherical manifolds: The integral foliated simplicial volume of aspherical oriented closed conn…

2017-04-27abs ↗pdf ↗

We define a new combinatorial class of triangulations of closed 3-manifolds, satisfying a weak version of 0-efficiency combined with a weak version of minimality, and study them using twisted squares. As an application, we obtain strong restrictions on the topology of a 3-manifold from the existence of non-smooth maxim…

2013-12-18abs ↗pdf ↗

The static of smooth maps from the two-dimensional disc to a smooth manifold can be regarded as a simplified version of the Classical Field Theory. In this paper we construct the Tulczyjew triple for the problem and describe the Lagrangian and Hamiltonian formalism. We outline also natural generalizations of this appro…

2010-05-16abs ↗pdf ↗

Smoothed SGD improves quantile estimation without crossing curves.

problem Estimating quantiles without crossing estimated curves.
method Smoothed SGD algorithm with Bahadur representation and Gaussian approximation.
result Smoothed SGD provides non-asymptotic tail probability bounds and a Gaussian approximation for quantile estimates.

We propose a new sparsity-smoothness penalty for high-dimensional generalized additive models. The combination of sparsity and smoothness is crucial for mathematical theory as well as performance for finite-sample data. We present a computationally efficient algorithm, with provable numerical convergence properties, fo…

2008-06-25abs ↗pdf ↗

We give several versions of local and global inverse mapping theorem for tame non necessarily smooth, mappings. Here tame mapping means a mapping which is subanalytic or, more generally, definable in some o-minimal structure. Our sufficient conditions are formulated in terms of various properties (convexity, positivity…

2007-12-17abs ↗pdf ↗

Smooth approximation of integral cycles mod 2 in Riemannian manifolds.

problem Approximating mod 2 integral cycles by smooth submanifolds.
method Approximation of mod 2 integral cycles by smooth submanifolds with controlled singularities.
result Every mod 2 integral cycle can be approximated by a smooth submanifold with a controlled singular set.

The immersions of a smooth manifold MM in a symplectic manifold (N,σ)(N,σ) inducing a given closed form ωω on MM satisfy the C0C^0-dense hh-principle in the space of all continuous maps which pull back the deRham cohomology class of σσ onto that of ωω. In this paper we prove a foliated version of this result due to …

2007-06-21abs ↗pdf ↗

New SQ lower bound shows complexity nearly matches known upper bound for smoothed agnostic learning.

problem Smoothed agnostic learning of halfspaces under subgaussian distributions.
method Statistical Query (SQ) lower bound using moment-matching hard distribution and linear programming duality.
result First non-trivial lower bound on complexity nearly matches known upper bound.

In this paper, we study the implicit regularization of the gradient descent algorithm in homogeneous neural networks, including fully-connected and convolutional neural networks with ReLU or LeakyReLU activations. In particular, we study the gradient descent or gradient flow (i.e., gradient descent with infinitesimal s…

2019-06-13abs ↗pdf ↗

We discuss the nature of structure-preserving maps of varies function algebras. In particular, we identify isomorphisms between special Colombeau algebras on manifolds with invertible manifold-valued generalized functions in the case of smooth parametrization. As a consequence, and to underline the consistency and vali…

2010-10-18abs ↗pdf ↗

Smoothed analysis of complexity bounds and condition numbers has been done, so far, on a case by case basis. In this paper we consider a reasonably large class of condition numbers for problems over the complex numbers and we obtain smoothed analysis estimates for elements in this class depending only on geometric inva…

2006-05-24abs ↗pdf ↗

We prove a categorified version of the Poincaré lemma. The natural setting for our result is that of \infty-local systems. More precisely, we show that any smooth homotopy between maps ff and gg induces an A\mathsf{A}_\infty-natural transformation between the corresponding pullback functors. This transformation is…

2018-08-20abs ↗pdf ↗