Foundations of Computational Mathematics
Издатель: Springer Nature · ISSN 1615-3375,1615-3383 · 76 статей
-
Covering Numbers for Deep ReLU Networks with Applications to Function Approximation and Nonparametric Regression
Abstract Covering numbers of (deep) ReLU networks have been used to characterize approximation-theoretic performance, to upper-bound prediction error in nonparametric regression, and to quantify classification capacity. These results...
- A Nonsmooth Extension of the Brezzi-Rappaz-Raviart Approximation Theorem Via Metric Regularity Techniques and Applications to Nonlinear PDEs
- Any Nonincreasing Convergence Curves are Simultaneously Possible for GMRES and Weighted GMRES, As Well As for Left and Right Preconditioned GMRES
-
Alpha Shapes and Optimal Transport on the Sphere
Abstract In [3], the authors used the Legendre transform to give a tractable method for studying Topological Data Analysis (TDA) in terms of sums of Gaussian kernels. In this paper, we prove a variant for sums of cosine similarity-based...
-
Conley–Morse Persistence Barcode: A Homological Signature of Combinatorial Bifurcations
Abstract Bifurcation characterizes the qualitative changes in parameterized dynamical systems and is one of the major topics in the field. In this work, we study combinatorial bifurcations within the framework of combinatorial dynamical...
-
Generalised Hardness of Approximation and the SCI Hierarchy –On Determining the Boundaries of Training Algorithms in AI
Abstract Generalised hardness of approximation (GHA) is the phenomenon that one can easily compute an $$\epsilon $$ ϵ -approximation to a solution of a computational problem for $$\epsilon> \epsilon _1 > 0$$ ϵ > ϵ 1 > 0 , but for...
-
The Likelihood Correspondence
Abstract An arrangement of hypersurfaces in projective space is strict normal crossing (SNC) if and only if its Euler discriminant is nonzero. We study the critical loci of arbitrary Laurent monomials in the equations of the smooth...
-
First-Order Optimality Conditions for Non-Commutative Optimization Problems
Abstract We consider the problem of optimizing the state average of a polynomial of non-commuting variables, over all states and operators satisfying a number of polynomial constraints, and over all Hilbert spaces where such states and...
- Validated Enclosure of Renormalization Fixed Points Via Chebyshev Series and the DFT
-
Interior-Point Methods on Manifolds: Theory and Applications
Abstract Interior-point methods offer a highly versatile framework for convex optimization that is effective in theory and practice. A key notion in their theory is that of a self-concordant barrier. We give a suitable generalization of...
-
Inf-Sup Stability of Parabolic TraceFEM
Abstract We develop a parabolic inf-sup theory for a modified TraceFEM semi-discretization in space of the heat equation posed on a stationary hypersurface embedded in $$\mathbb {R}^n$$ R n . We consider the normal derivative volume...
-
Multigrid Monte Carlo Revisited: Theory and Bayesian Inference
Abstract Gaussian random fields play an important role in many areas of science and engineering. In practice, they are often simulated by sampling from a high-dimensional multivariate normal distribution, which arises from the...
- Shifted Composition III: Local Error Framework for KL Divergence
- Exact and Efficient Representation of Totally Anti-Symmetric Functions
- Measure-to-Measure Interpolation Using Transformers
- Generalized Local Polynomial Reproductions
-
A Convergent Finite Difference-Quadrature Scheme for the Porous Medium Equation with Nonlocal Pressure
Abstract We introduce and analyze a numerical approximation of the porous medium equation with fractional potential pressure introduced by Caffarelli and Vázquez: $$ \partial _t u = \nabla \cdot (u^{m-1}\nabla (-\Delta )^{-\sigma }u)...
- Persistence Diagram Bundles: A Multidimensional Generalization of Vineyards
- Symmetric Resonance Based Integrators and Forest Formulae
-
Accelerated Gradient Methods for Nonconvex Optimization: Escape Trajectories From Strict Saddle Points and Convergence to Local Minima
Abstract This paper considers the problem of understanding the behavior of a general class of accelerated gradient methods on smooth nonconvex functions. Motivated by some recent works that have proposed effective algorithms, based on...
-
Crouzeix-Raviart elements on simplicial meshes in d dimensions
Abstract In this paper we introduce Crouzeix-Raviart elements of general polynomial order k and spatial dimension $$d\ge 2$$ d ≥ 2 for simplicial finite element meshes. We give explicit representations of the non-conforming basis...
- Nearly Self-similar Blowup of Generalized Axisymmetric Navier–Stokes Equations
-
Extended Regge Complex for Linearized Riemann-Cartan Geometry and Cohomology
Abstract We show that the cohomology of the Regge complex in three dimensions is isomorphic to $$ \mathcal {H}^{{\scriptscriptstyle \bullet }}_{dR}(\varOmega )\otimes \mathcal{R}\mathcal{M}$$ H dR ∙ ( Ω ) ⊗ R M , the de Rham cohomology...
- The radius of statistical efficiency
- Ulam Meets Turing: Constructing Quadratic Maps with Non-Computable Physical Measures
- Spectrally Accurate Fully Discrete Schemes for Some Nonlocal and Nonlinear Integrable PDEs via Explicit Formulas
-
A Discrete Trace Theory for Non-Conforming Polytopal Hybrid Discretisation Methods
Abstract In this work we develop a discrete trace theory that covers non-conforming hybrid discretization methods and holds on polytopal meshes. A notion of discrete trace seminorm is defined, and trace and lifting results with respect...
- Preface
- Optimal sampling for least-squares approximation
- The Nullstellensatz and Positivstellensatz for Sparse Tropical Polynomial Systems