Foundations of Computational Mathematics最新文献

Classification of Finite Groups: Recent Developements and Open Problems 有限群的分类：最新发展和未决问题

IF 3 1区数学

Foundations of Computational Mathematics Pub Date : 2024-11-12 DOI: 10.1007/s10208-024-09688-1

Bettina Eick

引用次数: 0

Quantitative Convergence of a Discretization of Dynamic Optimal Transport Using the Dual Formulation 使用二元公式对动态优化运输进行离散化的定量收敛

IF 3 1区数学

Foundations of Computational Mathematics Pub Date : 2024-11-11 DOI: 10.1007/s10208-024-09686-3

Sadashige Ishida, Hugo Lavenant

引用次数: 0

Computing the Noncommutative Inner Rank by Means of Operator-Valued Free Probability Theory 利用算子值自由概率论计算非交换内等级

IF 3 1区数学

Foundations of Computational Mathematics Pub Date : 2024-11-11 DOI: 10.1007/s10208-024-09684-5

Johannes Hoffmann, Tobias Mai, Roland Speicher

引用次数: 0

Gabor Phase Retrieval via Semidefinite Programming 通过半定量编程实现 Gabor 相位检索

IF 3 1区数学

Foundations of Computational Mathematics Pub Date : 2024-11-07 DOI: 10.1007/s10208-024-09683-6

Philippe Jaming, Martin Rathmair

{"title":"Gabor Phase Retrieval via Semidefinite Programming","authors":"Philippe Jaming, Martin Rathmair","doi":"10.1007/s10208-024-09683-6","DOIUrl":"https://doi.org/10.1007/s10208-024-09683-6","url":null,"abstract":"We consider the problem of reconstructing a function (fin L^2({mathbb R})) given phase-less samples of its Gabor transform, which is defined by $$begin{aligned} {mathcal {G}}f(x,y) :=2^{frac{1}{4}} int _{mathbb R}f(t) e^{-pi (t-x)^2} e^{-2pi i y t},text{ d }t,quad (x,y)in {mathbb R}^2. end{aligned}$$More precisely, given sampling positions (Omega subseteq {mathbb R}^2) the task is to reconstruct f (up to global phase) from measurements ({|{mathcal {G}}f(omega )|: ,omega in Omega }). This non-linear inverse problem is known to suffer from severe ill-posedness. As for any other phase retrieval problem, constructive recovery is a notoriously delicate affair due to the lack of convexity. One of the fundamental insights in this line of research is that the connectivity of the measurements is both necessary and sufficient for reconstruction of phase information to be theoretically possible. In this article we propose a reconstruction algorithm which is based on solving two convex problems and, as such, amenable to numerical analysis. We show, empirically as well as analytically, that the scheme accurately reconstructs from noisy data within the connected regime. Moreover, to emphasize the practicability of the algorithm we argue that both convex problems can actually be reformulated as semi-definite programs for which efficient solvers are readily available. The approach is based on ideas from complex analysis, Gabor frame theory as well as matrix completion. As a byproduct, we also obtain improved truncation error for Gabor expensions with Gaussian generators.","PeriodicalId":55151,"journal":{"name":"Foundations of Computational Mathematics","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142597481","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Theory of the NEPv Approach for Optimization on the Stiefel Manifold 斯蒂费尔曼菲尔德上优化的 NEPv 方法理论

IF 3 1区数学

Foundations of Computational Mathematics Pub Date : 2024-10-31 DOI: 10.1007/s10208-024-09687-2

Ren-Cang Li

{"title":"A Theory of the NEPv Approach for Optimization on the Stiefel Manifold","authors":"Ren-Cang Li","doi":"10.1007/s10208-024-09687-2","DOIUrl":"https://doi.org/10.1007/s10208-024-09687-2","url":null,"abstract":"The NEPv approach has been increasingly used lately for optimization on the Stiefel manifold arising from machine learning. General speaking, the approach first turns the first order optimality condition into a nonlinear eigenvalue problem with eigenvector dependency (NEPv) and then solve the nonlinear problem via some variations of the self-consistent-field (SCF) iteration. The difficulty, however, lies in designing a proper SCF iteration so that a maximizer is found at the end. Currently, each use of the approach is very much individualized, especially in its convergence analysis phase to show that the approach does work or otherwise. Related, the NPDo approach is recently proposed for the sum of coupled traces and it seeks to turn the first order optimality condition into a nonlinear polar decomposition with orthogonal factor dependency (NPDo). In this paper, two unifying frameworks are established, one for each approach. Each framework is built upon a basic assumption, under which globally convergence to a stationary point is guaranteed and during the SCF iterative process that leads to the stationary point, the objective function increases monotonically. Also the notion of atomic function for each approach is proposed, and the atomic functions include commonly used matrix traces of linear and quadratic forms as special ones. It is shown that the basic assumptions of the approaches are satisfied by their respective atomic functions and, more importantly, by convex compositions of their respective atomic functions. Together they provide a large collection of objectives for which either one of approaches or both are guaranteed to work, respectively.","PeriodicalId":55151,"journal":{"name":"Foundations of Computational Mathematics","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142562122","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Explicit A Posteriori Error Representation for Variational Problems and Application to TV-Minimization 变量问题的显式后验误差表示法及其在电视最小化中的应用

IF 3 1区数学

Foundations of Computational Mathematics Pub Date : 2024-10-18 DOI: 10.1007/s10208-024-09676-5

Sören Bartels, Alex Kaltenbach

引用次数: 0

The Gromov–Wasserstein Distance Between Spheres 球体间的格罗莫夫-瓦瑟施泰因距离

IF 3 1区数学

Foundations of Computational Mathematics Pub Date : 2024-09-16 DOI: 10.1007/s10208-024-09678-3

Shreya Arya, Arnab Auddy, Ranthony A. Clark, Sunhyuk Lim, Facundo Mémoli, Daniel Packer

{"title":"The Gromov–Wasserstein Distance Between Spheres","authors":"Shreya Arya, Arnab Auddy, Ranthony A. Clark, Sunhyuk Lim, Facundo Mémoli, Daniel Packer","doi":"10.1007/s10208-024-09678-3","DOIUrl":"https://doi.org/10.1007/s10208-024-09678-3","url":null,"abstract":"The Gromov–Wasserstein distance—a generalization of the usual Wasserstein distance—permits comparing probability measures defined on possibly different metric spaces. Recently, this notion of distance has found several applications in Data Science and in Machine Learning. With the goal of aiding both the interpretability of dissimilarity measures computed through the Gromov–Wasserstein distance and the assessment of the approximation quality of computational techniques designed to estimate the Gromov–Wasserstein distance, we determine the precise value of a certain variant of the Gromov–Wasserstein distance between unit spheres of different dimensions. Indeed, we consider a two-parameter family ({d_{{{text {GW}}}p,q}}_{p,q=1}^{infty }) of Gromov–Wasserstein distances between metric measure spaces. By exploiting a suitable interaction between specific values of the parameters p and q and the metric of the underlying spaces, we are able to determine the exact value of the distance (d_{{{text {GW}}}4,2}) between all pairs of unit spheres of different dimensions endowed with their Euclidean distance and their uniform measure.","PeriodicalId":55151,"journal":{"name":"Foundations of Computational Mathematics","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142235260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Unbiasing Hamiltonian Monte Carlo Algorithms for a General Hamiltonian Function 一般哈密顿函数的无偏哈密顿蒙特卡洛算法

IF 3 1区数学

Foundations of Computational Mathematics Pub Date : 2024-09-16 DOI: 10.1007/s10208-024-09677-4

T. Lelièvre, R. Santet, G. Stoltz

{"title":"Unbiasing Hamiltonian Monte Carlo Algorithms for a General Hamiltonian Function","authors":"T. Lelièvre, R. Santet, G. Stoltz","doi":"10.1007/s10208-024-09677-4","DOIUrl":"https://doi.org/10.1007/s10208-024-09677-4","url":null,"abstract":"Hamiltonian Monte Carlo (HMC) is a Markov chain Monte Carlo method that allows to sample high dimensional probability measures. It relies on the integration of the Hamiltonian dynamics to propose a move which is then accepted or rejected thanks to a Metropolis procedure. Unbiased sampling is guaranteed by the preservation by the numerical integrators of two key properties of the Hamiltonian dynamics: volume-preservation and reversibility up to momentum reversal. For separable Hamiltonian functions, some standard explicit numerical schemes, such as the Störmer–Verlet integrator, satisfy these properties. However, for numerical or physical reasons, one may consider a Hamiltonian function which is nonseparable, in which case the standard numerical schemes which preserve the volume and satisfy reversibility up to momentum reversal are implicit. When implemented in practice, such implicit schemes may admit many solutions or none, especially when the timestep is too large. We show here how to enforce the numerical reversibility, and thus unbiasedness, of HMC schemes in this context by introducing a reversibility check. In addition, for some specific forms of the Hamiltonian function, we discuss the consistency of these HMC schemes with some Langevin dynamics, and show in particular that our algorithm yields an efficient discretization of the metropolized overdamped Langevin dynamics with position-dependent diffusion coefficients. Numerical results illustrate the relevance of the reversibility check on simple problems.","PeriodicalId":55151,"journal":{"name":"Foundations of Computational Mathematics","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142235261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Signed Barcodes for Multi-parameter Persistence via Rank Decompositions and Rank-Exact Resolutions 通过秩分解和秩精确解析实现多参数持久性的签名条形码

IF 3 1区数学

Foundations of Computational Mathematics Pub Date : 2024-09-04 DOI: 10.1007/s10208-024-09672-9

Magnus Bakke Botnan, Steffen Oppermann, Steve Oudot

{"title":"Signed Barcodes for Multi-parameter Persistence via Rank Decompositions and Rank-Exact Resolutions","authors":"Magnus Bakke Botnan, Steffen Oppermann, Steve Oudot","doi":"10.1007/s10208-024-09672-9","DOIUrl":"https://doi.org/10.1007/s10208-024-09672-9","url":null,"abstract":"In this paper, we introduce the signed barcode, a new visual representation of the global structure of the rank invariant of a multi-parameter persistence module or, more generally, of a poset representation. Like its unsigned counterpart in one-parameter persistence, the signed barcode decomposes the rank invariant as a ({mathbb {Z}})-linear combination of rank invariants of indicator modules supported on segments in the poset. We develop the theory behind these decompositions, both for the usual rank invariant and for its generalizations, showing under what conditions they exist and are unique. We also show that, like its unsigned counterpart, the signed barcode reflects in part the algebraic structure of the module: specifically, it derives from the terms in the minimal rank-exact resolution of the module, i.e., its minimal projective resolution relative to the class of short exact sequences on which the rank invariant is additive. To complete the picture, we show some experimental results that illustrate the contribution of the signed barcode in the exploration of multi-parameter persistence modules.\u0000","PeriodicalId":55151,"journal":{"name":"Foundations of Computational Mathematics","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142138385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

New Ramsey Multiplicity Bounds and Search Heuristics 新的拉姆齐多重性边界和搜索启发法

IF 3 1区数学

Foundations of Computational Mathematics Pub Date : 2024-08-26 DOI: 10.1007/s10208-024-09675-6

Olaf Parczyk, Sebastian Pokutta, Christoph Spiegel, Tibor Szabó

{"title":"New Ramsey Multiplicity Bounds and Search Heuristics","authors":"Olaf Parczyk, Sebastian Pokutta, Christoph Spiegel, Tibor Szabó","doi":"10.1007/s10208-024-09675-6","DOIUrl":"https://doi.org/10.1007/s10208-024-09675-6","url":null,"abstract":"We study two related problems concerning the number of homogeneous subsets of given size in graphs that go back to questions of Erdős. Most notably, we improve the upper bounds on the Ramsey multiplicity of (K_4) and (K_5) and settle the minimum number of independent sets of size 4 in graphs with clique number at most 4. Motivated by the elusiveness of the symmetric Ramsey multiplicity problem, we also introduce an off-diagonal variant and obtain tight results when counting monochromatic (K_4) or (K_5) in only one of the colors and triangles in the other. The extremal constructions for each problem turn out to be blow-ups of a graph of constant size and were found through search heuristics. They are complemented by lower bounds established using flag algebras, resulting in a fully computer-assisted approach. For some of our theorems we can also derive that the extremal construction is stable in a very strong sense. More broadly, these problems lead us to the study of the region of possible pairs of clique and independent set densities that can be realized as the limit of some sequence of graphs.","PeriodicalId":55151,"journal":{"name":"Foundations of Computational Mathematics","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142084945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0