Optimization and Control · Cross-listed from quant-ph
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 13 May
We study the fully generalized Grover's algorithm to find the optimal phase changes for each step of the iteration to maximize gain in probability of observation of the target, and when phase matching is required. We find that classical Grover's algorithm and phase matching remains to be optimal till the target probability gets close 1. However, as the probability of observation approaches 1, the optimal phase changes differ from $\pi$ and no longer observe phase matching. We provide the optimization statement to find the optimal phase changes given the current amplitude vector and the size of the set. To analyze this formula, we approach it from a numerical and analytical perspective, with the analytical perspective focusing on special cases that simplify the optimization and allow for general statements about its behavior. Finally, we provide an example of a 5 qubit system and show that for the final iteration the optimal phase changes differ from traditional Grover's algorithm and do not observe phase matching, but lead to an increase in the probability of the target.
Probability · Cross-listed from cs.PF
SPLIT: SymPathy for Large jobs Improves Tail latency
We study the asymptotic response time tail in the M/G/n multi-server queue with heavy-tailed (regularly varying) job sizes, a setting representative of modern computing workloads. For single-server systems, tail optimization is well understood: under heavy-tailed job sizes, policies such as SRPT that strictly prioritize short jobs are strongly tail optimal, and giving any priority to large jobs is harmful. For multi-server systems, the question has been almost entirely open. This paper gives the first strongly tail-optimal scheduling policies for the M/G/n queue with heavy-tailed job sizes. Our central finding is that the multi-server case is intrinsically different from the single-server case: giving a small amount of “sympathy” to large jobs is essential for strong tail optimality. We establish strong (or arbitrarily close to strong) tail optimality across the full stability region, both with and without knowledge of job sizes.
Read the full abstract
Optimization and Control · Cross-listed from cs.RO
TinySDP: Real Time Semidefinite Optimization for Certifiable and Agile Edge Robotics
Semidefinite programming (SDP) provides a principled framework for convex relaxations of nonconvex geometric constraints in motion planning, yet existing solvers are too computationally expensive for real-time control, particularly on resource-constrained embedded systems. To address this gap, we introduce TinySDP, the first semidefinite programming solver designed for embedded systems, enabling real-time model-predictive control (MPC) on microcontrollers for problems with nonconvex obstacle constraints. Our approach integrates positive-semidefinite cone projections into a cached-Riccati-based ADMM solver, leveraging computational structure for embedded tractability. We pair this solver with an a posteriori rank-1 certificate that converts relaxed solutions into explicit geometric guarantees at each timestep. On challenging benchmarks, e.g., cul-de-sac and dynamic obstacle avoidance scenarios that induce failures in local methods, TinySDP achieves collision-free navigation with up to 73% shorter paths than state-of-the-art baselines. We validate our approach on a Crazyflie quadrotor, demonstrating that semidefinite constraints can be enforced at real-time rates for agile embedded robotics.
Read the full abstract
Combinatorics
Helmholzian Spectra of Graphs: Novel Properties
Let $\grad$, $\curl$, and $\dv$ be the graph-theoretic analogues of the gradient, curl, and divergence operators from multivariate calculus. The graph Laplacian $-\dv \grad$ gives rise to the celebrated Laplacian matrix, while the matrix representation of the graph Helmholtzian $\grad \grad^* + \curl^* \curl$ is called the Helmholtzian matrix. In this paper, we present a new graph-theoretic proof that the Helmholtzian matrix indeed represents the graph Helmholtzian. We then investigate the spectral properties of this matrix. Our main results are as follows: (i) a classification of graphs having exactly two distinct Helmholtzian eigenvalues; (ii) the nullity of the Helmholtzian matrix; and (iii) a combinatorial interpretation of the coefficients of the Helmholtzian polynomial. Furthermore, we determine the Helmholtzian spectrum for certain graph products and characterize Helmholtzian integral graphs, as well as derive bounds for the smallest Helmholtzian eigenvalue. Meanwhile, we pose some open problems for future research.
Read the full abstract
Probability
Stochastic evolution equations driven by arbitrary cylindrical Lévy processes
We establish the first existence and uniqueness result for mild solutions of abstract stochastic evolution equations driven by arbitrary cylindrical Lévy processes in Hilbert spaces. The coefficients are assumed to satisfy global Lipschitz conditions, and no moment assumptions are imposed on the driving noise. The principal difficulty arises from the fact that cylindrical Lévy processes exist solely in a generalised sense and typically admit no semimartingale or Lévy-Itô decomposition, which precludes the use of classical existence methods. To overcome these obstacles, we develop a pathwise adaptive Euler-Peano approximation scheme based on noise-dependent stopping times and a fixed-point formulation of the mild solution operator. The resulting approach avoids stochastic calculus techniques relying on semimartingale decompositions and provides a robust and flexible framework for treating multiplicative cylindrical Lévy noise in infinite-dimensional systems.
Read the full abstract
Algebraic Geometry
Euclidean distance degree defect of singular projective varieties
The unit Euclidean distance degree and the generic Euclidean distance degree are two well-studied invariants of projective varieties. These quantities measure the algebraic complexity of nearest-point problems on a variety, and in many examples arising in optimization, engineering, statistics, and data science, there is a significant gap between them. We refer to this difference as the defect of the Euclidean distance (ED) degree. In this paper, we provide a constructible enhancement and a topological formula for the defect of the ED degree of an arbitrary complex projective variety, extending our previous results from the smooth setting. Since the generic Euclidean distance degree is typically more tractable, our approach offers a new method for computing ED degrees in broad generality.
Read the full abstract
Numerical Analysis
A multigrid and neural network approach to reduce the computational cost of phi-FEM
In this work, we present a combination of a multigrid approach and the phi-FEM immersed boundary finite element method to reduce its computational cost while preserving its accuracy. To further reduce the numerical cost of the approach, we also propose the combination of the previous technique with some neural network methods. We illustrate the efficiency of these two approaches with numerical test cases in 2D and 3D.
Read the full abstract
Number Theory
Large values of shifted mixed character sums
We consider sums of the form $$F_\chi(\alpha,\beta;\theta) := \sum_{\alpha p<n\le\beta p}\chi(n)e(n\theta),$$ where $\chi$ is a non-principal Dirichlet character modulo a prime number $p$. We prove that $$ \sqrt p \log \log p \ll \max_{0 \le \theta < 1}{\left|F_\chi(\alpha,\beta;\theta)\right|} \ll \sqrt{p}\log p, $$ generalizing an old result of Montgomery as well as a recent result of Iggidr in two aspects: we allow general non-principal characters $\chi$, and we consider incomplete mixed character sums.
Read the full abstract
Statistics Theory
Pattern-based tests for two-dimensional copulas
In statistics permutations typically arise in the context of rank plots for two-dimensional data. Such plots can also be interpreted as discrete copulas. In discrete mathematics, typically in the context of the description of large (non-random) objects, two-dimensional copulas appear as limits of permutations and are then known as permutons if the topology refers to the convergence of pattern frequencies. We obtain a functional central limit theorem for such pattern frequencies in the context of two-dimensional random samples. The result serves as the basis for nonparametric goodness-of-fit tests, for two-sample tests, and for tests of symmetry. This includes a suitable variant of the bootstrap for obtaining critical values. Pattern-based procedures are also of interest in a parametric context. We consider two examples, the Farlie-Gumbel-Morgenstern class and a family of delay copulas. We discuss implementation aspects of the resulting procedures and we provide a simulation study that supplements the theoretical results in the nonparametric case.
Read the full abstract
Analysis of PDEs
Lax-Oleinik formula for nonautonomous Hamilton-Jacobi equations on networks
We provide a Lax-Oleinik-type representation formula for solutions to nonautonomous Hamilton-Jacobi equations posed on networks with a rather general geometry. The networks may possess countably many arcs and allow for the presence of loops. We consider Hamiltonians that are convex and superlinear in the momentum variable, and satisfy a Lipschitz-type condition in the time variable. The representation formula is constructed via an overall Lagrangian that accounts for both the arc-specific dynamics and vertex-based constraints, called flux limiters, which ensure the well-posedness of the problem. We prove that the corresponding action functional admits Lipschitz continuous minimizers without needing to rule out the Zeno phenomenon. Furthermore, we demonstrate that the formula yields the unique solution to the problem even when the flux limiters exceed standard upper bounds.
Read the full abstract
Logic
On p-Lie algebras of finite Morley rank
Mathematical Physics · Cross-listed from quant-ph
Berry-Phase-Induced Chirality in Thermodynamics
Geometric phases are foundational to isolated quantum systems, yet their thermodynamic role in open systems remains unrevealed Developing a dissipative adiabatic perturbation expansion, we discover a Berry-phase-induced chiral work difference that survives decoherence. This chirality evolves from an interferometric thermodynamic Aharonov-Bohm effect in the unitary regime to a fringe-free signal in the dissipative regime. We illustrate this framework in a two-level system and assess its experimental feasibility. Our findings clarify the role of quantum geometry in the geometric formulation of thermodynamics.
Read the full abstract
Information Theory · Cross-listed from cs.LG
Scale-Sensitive Shattering: Learnability and Evaluability at Optimal Scale
We study the optimal scale at which real-valued function classes exhibit uniform convergence and learnability. Our main result establishes a scale-sensitive generalization of the fundamental theorem of PAC learning: for every bounded real-valued class and every $\gamma>0$, uniform convergence at scale $\gamma$, agnostic learnability at scale $\gamma/2$, and finiteness of the fat-shattering dimension at every scale $\gamma'>\gamma$ are equivalent. This resolves a question by Anthony and Bartlett (Cambridge Univ. Press 1999) on the precise scales governing learnability, refuting a conjecture attributed there to Phil Long that a multiplicative 2-factor gap is unavoidable, and improves the upper bounds of Bartlett and Long (JCSS 1998), which incur such a loss. The key technical ingredient is a direct bound on empirical $\ell_\infty$ covering numbers, avoiding the standard detour through packing numbers. As a consequence, we obtain sharp asymptotic metric-entropy bounds in terms of the fat-shattering scale $\gamma$: an $O(\log^2 n)$ bound holds already at scale $\gamma/2$, while an $O(\log n)$ bound holds at scale $2\gamma$. We further show that the $O(\log^2 n)$ bound is sometimes tight. These results resolve open questions by Alon et al. (JACM 1997) and Rudelson and Vershynin (Ann. of Math. 2006). As an application, we establish a sharp dichotomy for bounded integral probability metrics: every such IPM is either estimable or cannot be weakly evaluated within any multiplicative factor $c<3$, while $3$-weak evaluability always holds, resolving an open question from Aiyer et al. (ICML 2026). We also highlight several open questions on quantitative sample complexity and evaluability.
Read the full abstract
Logic
O-minimal open core is not an elementary property
Given a structure $\mathcal{M}$ with a definable topology, its open core is a structure defined on the same universe whose language consists of all open sets of all arities definable in $\mathcal{M}$. In response to questions raised by Dolich, Miller, and Steinhorn in their early work on open core, we prove that having an o-minimal open core is not an elementary property. In particular, we construct an expansion of the structure $(\mathbb{Q},<)$ that has an o-minimal open core, but some of its elementary superstructures do not.
Read the full abstract
Mathematical Physics
Stochastic modeling of Fourier modes in two-dimensional turbulence via filtered white noise
Modeling turbulent flows by a random Fourier decomposition is a classical procedure in order to use simplified models of turbulence in heat transport and other applications. We investigate the Fourier time series of two-dimensional Navier-Stokes equations with friction and damping, forced at intermediate scales, and identify significant statistical structures. In particular, we find the existence of a typical time correlation length, and propose a stochastic model for the Fourier components. Finally, we compute the transport of a passive scalar under advection-diffusion dynamics by means of direct numerical simulation of the stochastic damped Navier-Stokes equation and compare it with analytical predictions of the effective diffusion produced by the stochastic model.
Read the full abstract
Dynamical Systems · Cross-listed from eess.SY
Bounded-Input True Proportional Navigation for Impact-Time Control
This paper proposes a nonlinear guidance strategy capable of intercepting a constant-velocity, non-maneuvering target while strictly satisfying the prescribed bounds on the control input (commanded acceleration). Unlike conventional strategies that estimate time-to-go using linearization or small-angle approximations, the proposed strategy employs true proportional-navigation guidance (TPNG) as a baseline, which utilizes an exact time-to-go formulation and is applicable over a wide range of target motions. In contrast to most existing strategies, which do not incorporate control input bounds into the guidance design, the proposed approach explicitly accounts for these limits by modeling the interceptor acceleration as a dynamic variable. Based on the sliding mode control technique, an effective guidance law that achieves time-constrained interception while accounting for bounded input is then derived. The performance of the proposed strategy is evaluated for various engagement scenarios.
Read the full abstract
Probability
When Does the Dice Sum Become Prime?
Given a (possibly infinite) subset $A$ of the natural numbers, we ask how many times a fair six-sided die must be rolled until the rolled numbers add up to an element of $A$. Using a one-dimensional dynamic programming recursion together with truncation and rigorous error bounds, we compute the expected number of rolls efficiently and with very high accuracy. When $A$ is the set of prime numbers, the irregular distribution of primes makes it difficult to obtain explicit error estimates. Nevertheless, the density of primes implies that the associated survival probability decays exponentially fast, which enables highly accurate truncation estimates. As a result, our calculations yield significantly sharper estimates for this expectation and its higher moments than the original results of Conroy, Alon, and Malinovsky. In particular, we determine the expectation to more than $1000$ decimal places.
Read the full abstract
Commutative Algebra
Distance Reduction in Bouquet Decompositions and Toric Ideals of Graphs
The distance-reduction property for a generating set, i.e., a Markov basis, of a toric ideal is a condition that ensures tight connectivity of its fibres. In this paper, we study the distance-reduction property for toric ideals of graphs and move on to explore the relationship between the distance-reduction property and the bouquet structure of homogeneous toric ideals, which includes the class of toric ideals of graphs. For toric ideals of graphs which are complete intersection, we show that the minimal Markov bases are distance-reducing if and only if they distance-reduce the circuits of the ideal. We then consider how the distance-reduction properties interact with the bouquet structure of the toric ideal. Bouquets are a combinatorial structure that capture the essential combinatorial information of the toric ideal. Under the condition of homogeneity, we show that, for toric ideals with the same bouquet structure and signature, the distance-reduction properties are preserved. For homogeneous toric ideals whose bouquet matrix is a monomial curve in $\mathbb{A}^3$, we give necessary and sufficient conditions for when the minimal Markov bases are distance-reducing.
Read the full abstract
Algebraic Geometry
Infinitesimal automorphisms and obstruction theory on the moduli of $L$-valued $G$-Higgs bundles
For an arbitrary reductive group $G$, we compute the infinitesimal automorphisms of $L$-valued principal $G$-Higgs bundles over a compact Kähler manifold $X$, extending known results for $\Omega_X^{1}$-valued $G$-Higgs bundles. Using this computation, when $G$ is semisimple and $X$ is a smooth projective variety, we show that the moduli stack of stable $L$-valued $G$-Higgs bundles is a Deligne-Mumford (DM) stack. Furthermore, when $X$ is a smooth projective surface and $L=K_X$, we construct a symmetric perfect obstruction theory on this stable locus. We expect this will provide a foundation for defining Vafa-Witten invariants for reductive groups $G$.
Read the full abstract
Complex Variables
Hardy spaces and quasiregular mappings: averaged derivatives and the $\mathbb{BMO}$ case
We study the Hardy spaces $\mathcal{H}^p$, $0<p<\infty$ of quasiregular mappings on the unit ball $\mathbb{B}^n$ in ${\mathbb{R}}^n$ under the appropriate growth and multiplicity conditions. Our focus is on the averaged derivatives of maps and their Harnack and quantitative Harnack estimates. The averaged derivatives are employed to study the non-tangential limit functions and non-tangential maximal functions of quasiregular mappings and to characterize $\mathcal{H}^p$ in the case of finite multiplicity of $f$. Moreover, we study relations between quasiregular mappings, averaged derivatives, BMO spaces and Carleson measures on $\mathbb{B}^n$ and the role of the multiplicity of a map. We also apply our results to the second order elliptic PDEs and $\mathcal{A}$-harmonic equations. Our paper extends results by Astala and Koskela [AK] and Nolder [No1] to the setting of quasiregular maps.
Read the full abstract
Statistics Theory
Weighted and Truncated Tail Index Estimation under Random Censoring: A Unified Full-Range Framework
Estimation of the extreme value index under right censoring is a fundamental problem in extreme value theory, with important applications in finance, insurance, and reliability. Classical integral estimators for Pareto-type tails typically require that the asymptotic proportion of uncensored observations in the tail is larger than one half, corresponding to the weak censoring regime. This restriction excludes many practically relevant situations involving strong censoring, where the proportion of uncensored observations is smaller than or equal to one half, and reflects the absence of a uniformly valid Gaussian approximation for the associated tail empirical process. To overcome this limitation, we introduce a weighted and truncated Nelson–Aalen tail empirical process and construct a class of integral estimators indexed by a tuning parameter larger than one. This approach restores a tractable asymptotic structure over the entire censoring range, from very weak to very strong censoring. Under standard regular variation conditions, we establish a uniform Gaussian approximation and derive consistency and asymptotic normality without imposing restrictions on the censoring level. A key ingredient of the analysis is a linearization of the estimator as a functional of the underlying process. Simulation studies and real data applications demonstrate improved stability and accuracy, particularly under moderate and strong censoring. In particular, the analysis of insurance loss data, representing weak censoring, and Australian AIDS survival data, representing strong censoring, illustrates the practical relevance of the proposed methodology across contrasting censoring regimes.
Read the full abstract
Probability
Sticky CIR process with potential: invariant measure and exact sampling
We study the sticky Cox–Ingersoll–Ross (CIR) process in one dimension, a diffusion on $[0,\infty)$ with a sticky boundary condition at the origin, arising as the marginal process in a sparse Bayesian inference framework based on Hadamard–Langevin dynamics. For the parameter range $\delta\in(1,2)$, in which the origin is accessible but not absorbing, we prove well-posedness of the process and uniqueness of its invariant measure, which is a mixture of a point mass at zero and a weighted gamma-type density on the interior. We derive an explicit Green's function in terms of confluent hypergeometric functions, and use this to construct an exact sampler for the invariant measure in the zero-potential case. For a non-trivial potential $G$, we establish existence and uniqueness of the tilted invariant measure via a Girsanov change of measure, and develop two sampling algorithms: a Metropolis–Hastings corrected sampler that targets the invariant measure exactly, and a cheaper, biased unadjusted Langevin algorithm (ULA) for a boundary-clamped variant, for which we prove a first-order expansion of the stationary bias with an explicit constant, its leading term of order $h |\log h |$, independent of $\delta$. Numerical experiments confirm the predicted behaviour: the Metropolis–Hastings sampler achieves the target invariant measure at all step sizes, while the ULA bias follows the proven first-order law, including its constant.
Read the full abstract
Combinatorics
Quantum Fractional Revival and Entanglement Entropy in Unitary Cayley Graphs
This paper extends the theory of quantum fractional revival (QFR) on unitary Cayley graphs $X=(V(\mathbb{Z}_n),E(S))$ in several directions that remained unresolved in previous work. First, we investigate QFR with respect to the Laplacian matrix Hamiltonian in addition to the adjacency matrix Hamiltonian. In particular, we prove that for regular graphs the two models differ only by a global phase factor, and we determine the conditions under which the Laplacian framework independently admits QFR. Second, for unitary Cayley graphs of order $n=2p$, where $p$ is an odd prime, we derive an explicit closed-form expression for the minimum revival time, $t^{*}=\frac{2\pi}{p},$ and show that the associated revival amplitudes are given by \[ \alpha=\cos\!\left(\frac{2\pi}{p}\right), \qquad \beta=-i\sin\!\left(\frac{2\pi}{p}\right). \] Third, we provide a complete characterization of strongly cospectral vertex pairs in $X=(V(\mathbb{Z}_n),E(S))$ through the arithmetic structure of $\mathbb{Z}_n$, establishing that strong cospectrality is equivalent to antipodality whenever $n$ is twice a prime. Finally, we compute the von Neumann entanglement entropy generated by QFR for all admissible graphs, thereby obtaining a collection of quantum information measures and proving that the entropy depends solely on the revival amplitudes $|\alpha|$ and $|\beta|$.
Read the full abstract
Combinatorics
Multiplicative Diophantine approximation and bounds for lattice sums
We estimate the lattice sums arising in the context of the integer point counting in polyhedra.
Optimization and Control · Cross-listed from cs.LG
Achieving $\epsilon^{-2}$ Sample Complexity for Single-Loop Actor-Critic under Minimal Assumptions
In this paper, we establish last-iterate convergence rates for off-policy actor–critic methods in reinforcement learning. In particular, under a single-loop, single-timescale implementation and a broad class of policy updates, including approximate policy iteration and natural policy gradient methods, we prove the first $\tilde{\mathcal{O}}(\epsilon^{-2})$ sample complexity guarantee for finding an $\epsilon$-optimal policy under minimal assumptions, namely, the existence of a policy that induces an irreducible Markov chain. This stands in stark contrast to the existing literature, where an $\tilde{\mathcal{O}}(\epsilon^{-2})$ sample complexity is achieved only through nested-loop updates and/or under strong, algorithm-dependent assumptions on the policies, such as uniform mixing and uniform exploration. Technically, to address the challenges posed by the coupled update equations arising from the single-loop implementation, as well as the potentially unbounded iterates induced by off-policy learning, our analysis is based on a coupled Lyapunov drift framework. Specifically, we establish a geometric convergence rate for the actor and an $\tilde{\mathcal{O}}(1/T)$ convergence rate for the critic, and combine the two Lyapunov drift inequalities through a cross-domination property. We believe this analytical framework is of independent interest and may be applicable to other coupled iterative algorithms with unbounded
Read the full abstract
Analysis of PDEs
Orbital stability of black solitons for quasilinear Schrödinger equations with nonzero conditions at infinity
We investigate the orbital stability of black solitons for a broad class of quasilinear Schrödinger equations in one space dimension, with nonzero boundary conditions at infinity. Namely, our framework handles general defocusing semilinear nonlinearities and focusing or defocusing quasilinear nonlinearities. First, we establish sufficient conditions on the quasi-linear nonlinearities ensuring the existence of a local branch of finite-energy solitons parameterized by their speed. Within this branch, the black soliton, also called kink, corresponds to the stationary solution. Our main result is the orbital stability of the black soliton in the energy space, provided that the Vakhitov-Kolokolov (VK) slope condition holds; namely, that the derivative of the momentum with respect to the speed is negative at zero. Moreover, we derive an explicit formula for verifying this VK condition. The proof relies on the analysis of a carefully designed variational problem, which allows us to control the sup-norm of the evolution of a perturbation of the kink in terms of the energy and momentum, both of which are conserved by the flow. A delicate part of the argument is the analysis of minimizing sequences for this variational problem, since the infimum is not attained.
Read the full abstract
Combinatorics
A note on arithmetic progressions with restricted differences
In this note, we show how to adapt Tao's slice rank method to extend the Ellenberg–Gijswijt theorem on cap sets to the problem of forbidding arithmetic progressions with restricted differences. In particular, we show that if $q$ is an odd prime power, there is $\varepsilon_q>0$ such that if $S \subseteq \mathbb{F}_q$ with $0 \in S$ and $|S|>(q+1)/2$ and $A \subseteq \mathbb{F}_q^n$ contains no three-term arithmetic progression whose common difference is in $S^n$, then $|A| \leq q^{(1-\varepsilon_q)n}$.
Read the full abstract
Commutative Algebra
Betti numbers for cochordal zero-divisor graphs of commutative rings
This paper studies the zero-divisor graphs attached to several finite chain-ring families and computes the homological invariants of their edge ideals by using cochordal constructible systems. We begin with a general layered graph $C(q,L)$, whose vertices are arranged according to valuation layers and whose adjacency is governed by the single rule $k+\ell\ge L$, form some integers $k$ and $\ell$. This graph models the zero-divisor structure of a finite chain ring with residue field of order $q$ and nilpotency index $L$. We prove that $C(q,L)$ is cochordal, determine its type sequence, then correct and refine the Betti formula of its edge ideal [Dung and Vu, Cochordal zero divisor graphs and Betti numbers of their edge ideals, Comm. Algebra 54(2) (2026) 736–744]. The results are then specialized to the Gaussian quotient rings $\mathbb Z_{2^m}[i]$ and to the truncated polynomial rings $\mathbb Z_p[x]/(x^c)$. We compute projective dimension, regularity, independence number, height, Hilbert series, and Cohen–Macaulay behavior. The computations show that these quotient rings have $2$-linear resolutions, while Cohen–Macaulayness occurs only in the expected degenerate or complete-graph cases.
Read the full abstract
Numerical Analysis
A Majorization-Minimization with Monte Carlo Approach for Hyperparameter Estimation
We consider inverse problems with linear forward models and Gaussian priors, but with unknown hyperparameters that may arise from the model, the noise, or the specification of the prior. We model this using a hierarchical Bayes framework resulting in a posterior distribution that is non-Gaussian, in general, and challenging to sample from. Consequently, we use an empirical Bayes framework for estimating the maximum a posteriori estimate of the hyperpameters by considering the marginalized posterior distribution. However, the optimization problem is also computationally challenging due to the need for repeated evaluation of log determinants. To address this issue, we propose a Majorization-Minimization with Monte Carlo approach, which we call M$^{3}$C, for hyperparameter estimation. Specifically, we replace the challenging optimization problem with a sequence of simpler ones by utilizing a majorization function (or majorant) for the log-determinant term, combined with a Monte Carlo estimator to approximate the majorant. We provide theoretical results, showing that under certain assumptions, the M$^{3}$C iterates converge with high probability to a critical point of the original cost function. A variety of numerical examples are provided from seismic tomography, super-resolution imaging, and contaminant source identification.
Read the full abstract
Commutative Algebra
On Some Properties of LCM-Lattices of Edge Ideals of k-Uniform Hypergraphs
In this article, we investigate the combinatorial and algebraic properties of the lcm-lattice associated with the edge ideal of a hypergraph. Let $\H$ be a hypergraph, $I(\H)$ its corresponding edge ideal in a polynomial ring in $n$ variables, and $\mathrm{Icm}(I(\H))$ the associated lcm-lattice. We establish conditions under which the lcm-lattice of an edge ideal is Boolean, modular, or complemented. Furthermore, we extend these results to the case of the product of lcm-lattices in the complemented case. Additionally, we study the effects of polarization on the lcm-lattices of $I(\H)$ and its polarized ideal.