Peer Revenue Play credits. Real papers.

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Friday 24 April

Optimization and Control

Nonlinear balanced truncation model reduction through scalable Taylor series

The theory of nonlinear balanced truncation provides a system-theoretic framework for model reduction that preserves important properties such as stability, controllability, and observability. We present a scalable algorithm for computing reduced-order models based on the nonlinear balancing theory. The approach is based on polynomial approximations using the Kronecker product representation, building on recent numerical linear algebra advancements to enable scalability. We derive polynomial approximations for the balancing transformation and the explicit balanced realization of the full-order model, which yields true nonlinear reduced-order models upon truncation of redundant state components. The proposed tools are tested on various examples, demonstrating a nuanced perspective of the benefits and limitations of nonlinear balancing not shown in the existing literature.
Read the full abstract

Classical Analysis and ODEs

Single-Point Higher-Order Szegő Sum Rules in OPUC: Necessity for $m=1,2,3$

We give a direct algebraic proof of the necessity direction in the single-point higher-order Szegő sum rules on the unit circle for $m=1,2,3$. More precisely, for $H_m(e^{i\theta})=(1-\cos\theta)^m$, we show that $\int_0^{2\pi}H_m(e^{i\theta})\log w(\theta)\frac{d\theta}{2\pi}>-\infty$ implies $(S-1)^m\alpha\in\ell^2,\qquad \alpha\in\ell^{2m+2}.$ The proof is carried out within Yan's algebraic model for higher-order sum rules. The main point is to obtain coercive lower bounds for the nonlogarithmic part of the truncated sum rule: the quadratic component yields the principal finite-difference energy, while the higher-order correction terms are controlled by telescoping cancellations and relative bounds. The logarithmic remainder then gives the required $\ell^{2m+2}$-summability. The purpose is to isolate explicit low-order necessity arguments within the algebraic framework.
Read the full abstract

Optimization and Control

Computational Method for Desensitized Optimal Guidance Using Direct Collocation

A computational method is developed for desensitized optimal guidance using adaptive Gaussian quadrature collocation. The method computes a reference trajectory that reduces the sensitivity to uncertainties in the dynamic model by augmenting the objective functional to explicitly penalize the sensitivity of the state with respect to uncertain parameters. Using this desensitized reference trajectory as a starting point, the desensitized optimal guidance method developed in this paper computes a new optimal control on the remaining horizon at specified guidance update times. This shrinking horizon optimal control problem is solved using a Legendre-Gauss-Radau collocation method where, at each guidance update, a reduced-horizon mesh is determined by remapping the mesh to the remaining horizon and deleting the portion of the mesh associated with the expired portion of the horizon. The resulting guidance solution is found to improve robustness to external disturbances and modeling errors. The method is demonstrated on two numerical examples. The first example is Zermelo's navigation problem which illustrates the behavior of the method on a simple example. The second example is an atmospheric reentry problem that demonstrates the performance of the method on a more complex problem. For both examples, the dynamics are simulated in the presence of parameter uncertainties in the dynamic model, and Monte Carlo analysis is performed. The results show that the method developed in this paper produces tighter trajectory envelopes and smaller terminal state errors without significantly increasing the computational burden when compared with a method that does not penalize sensitivities.
Read the full abstract

Numerical Analysis

Sharp condition-number bounds for growth factors of Higham matrices in Gaussian elimination

Higham's conjecture on the growth factor of complex symmetric positive definite matrices is a longstanding problem in the stability theory of Gaussian elimination without pivoting. It asserts that every complex matrix $A=B+iC$ with $B$ and $C$ real symmetric positive definite, is called Higham matrix and has growth factor $\rho_n(A)<2$. In 2013, Drury [Linear Algebra Appl. 439 (2013), no.~10, 3129–3133] proved that $\rho_n(A)\le 2$. In fact, we will see his sectorial determinant method can be refined to give the strict bound $\rho_n(A)<2$ for each fixed Higham matrix; however, the resulting constant $1+\delta_A^2$ depends on the matrix $A$. In this paper, we establish sharp condition-number-dependent lower and upper bounds for the growth factors of Higham matrices, thereby providing a quantitative refinement of Drury's result. The main ingredient is a sharp scalar Schur-complement inequality, proved via a two-dimensional domination.We also obtain corresponding sharp scalar and diagonal estimates for accretive-dissipative matrices, and an improved entrywise growth bound for that broader class.
Read the full abstract

Mathematical Physics

The large-mass limit of interacting quantum gases in the continuum

We study the large-mass limit of interacting quantum (Bose or Fermi) gases in thermal equilibrium. We show that in the suitably-defined large-mass limit, the system gives rise to a gas of classical interacting particles. The corresponding question for bosons on a lattice was previously addressed by Fröhlich, Knowles, Schlein, and the third author. In this work, we study the continuum regime which requires us to suitably tune the chemical potential. The starting point of our analysis is the Ginibre loop ensemble, which allows one to describe a system of interacting quantum gases in thermal equilibrium in terms of an ensemble of interacting Brownian paths. In a finite volume, our analysis is performed for stable and Hölder continuous interaction potentials and we are able to obtain explicit rates of convergence. When the interaction potential is nonnegative and satisfies suitable integrability conditions, we study the associated infinite-volume problem by means of cluster expansions.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Complex Stochastic Gradient Descent and Directional Bias in Reproducing Kernel Hilbert Spaces

Stochastic Gradient Descent (SGD) is a known stochastic iterative method popular for large-scale convex optimization problems due to its simple implementation and scalability. Some objectives, such as those found in complex-valued neural networks, benefit from updates like in SGD and Gradient Descent (GD) with a newly defined “gradient” that allows for complex parameters. This complex variant of the SGD/GD methods has already been proposed, but convergence guarantees without analyticity constraints have not yet been provided. We propose a variant of SGD (complex SGD) that allows for complex parameters, and we provide convergence guarantees under assumptions that parallel those from the real setting. Notably, these results extend to GD as well, and with the same set of assumptions, we confirm that some directional bias results extend from the real to the complex setting for kernel regression problems. We provide empirical results demonstrating the efficacy of the complex SGD in kernel regression problems utilizing complex reproducing kernel Hilbert spaces. In particular, we demonstrate we may recover superoscillation functions and Blaschke products from the Fock Space and Hardy Space, respectively, as the optimal functions for a particular choice of a loss function.
Read the full abstract

Mathematical Physics

Theoretical analysis of the effect of the kinetic energy operator on double heterostructure spectra

We report an analytical and numerical study of the effect of kinetic energy operator (KEO) ambiguity on the energy spectra of double heterostructures when the mass of the charge carriers, subjected to a potential, depends on position. The spectra are calculated using two complementary techniques. In the first case, which is not always possible, the energy spectrum satisfies a transcendental equation, which is obtained through an analytical process. While in the second, which can be used practically in any double heterostructure (DH), the energy spectra correspond to the poles of the reflection coefficient of the heterostructure. The spectra thus obtained complement those already reported in a previous reference, since we now include the spectra of another KEO. Finally, we show how these methods allow us to critically analyze some statements that have been made about the relevance of some kinetic energy operators in some simpler heterostructures.
Read the full abstract

All authors R. Valencia-Torres, J. García-Ravelo, E. Choreño-Ortiz, J. Avendaño

Numerical Analysis

Delay Modeling with Conformable and Caputo Derivatives: Analytical and Computational Insights

This work presents an analytical and computational study of fractional-order delay differential equations formulated using both the conformable and Caputo derivatives. For the conformable case, we develop the associated integral, exponential function, and Laplace transform, showing how the conformable Laplace framework preserves algebraic structure and facilitates explicit solutions. Delay terms are treated through series expansions and transform-based methods, ensuring causal and finite representations. In parallel, Caputo-based formulations are examined, highlighting the challenges posed by convolutional memory kernels and the potential for long-term numerical instability. Numerical implementations are carried out using mesh-aligned algorithms: Euler and Runge–Kutta schemes for conformable dynamics, and Euler, L2–$\sigma$, and a series–anchored predictor–corrector method for Caputo dynamics. Comparative experiments demonstrate that conformable derivatives yield stable, consistent agreement between analytic and numerical solutions, whereas Caputo dynamics require higher-order or series-anchored schemes to suppress discretization noise and maintain long-term accuracy. These results underscore the advantages of the conformable formalism in modeling dynamic phenomena with delay and memory, offering a tractable and physically interpretable alternative to integral-based fractional models.
Read the full abstract

All authors Yhon Flores, Michel Molina del Sol, Genly Leon, Byron Droguett, Guillermo Fernández-Anaya, Yoelsy Leyva

Combinatorics

Burning Graph Powers and Branching Trees

Graph burning is a discrete-time process that models the spread of social contagion. Initially, all vertices are unburned. In each round, one unburned vertex is selected and burned, while any unburned vertex that has a burned neighbour from the previous round also becomes burned. The burning number of a graph is the minimum number of rounds needed to burn the entire graph. In this paper, we study the burning number of graph powers. First, we show that for a connected graph~$G$, its graph power~$G^k$ contains a~$(k+1)^+$-branching tree as a spanning tree. A~$(k+1)^+$-branching tree is one in which all internal vertices have degree at least~$k+1$. We then show that $(k+1)^+$-branching trees on~$n$ vertices have burning number at most $\left\lceil{\sqrt{\frac{4(k-1)n}{k^2}}}~\right\rceil$. As the burning number of a graph is at most the burning number of any of its spanning trees, this gives an upper bound on the burning number of graph powers. We also derive an alternative upper bound on the burning number of~$k^+$-branching trees using the strongest currently known general burning number bound [Bastide et al.]. We then identify the ranges of~$k$ and~$n$ for which our bound outperforms or matches this alternative bound. Finally, we show that~$b(G^k) \le (1+o(1))\sqrt{n/k}$ based on the asymptotic burning number bound of Norin and Turcotte.
Read the full abstract

All authors Jesper Jansson, Shashanka Kulamarva, Yukihiro Murakami, Nikolaas Verhulst

Numerical Analysis · Cross-listed from quant-ph

Accelerating quantum Gibbs sampling without quantum walks

Szegedy's quantum walk quadratically accelerates reversible classical Markov chains, but extending this mechanism to efficiently implementable quantum Gibbs samplers has remained challenging beyond special classes. We present a walk-free quantum algorithm for preparing purified Gibbs states with a quadratic improvement in spectral-gap dependence for a broad class of quantum Gibbs samplers that satisfy exact Kubo-Martin-Schwinger detailed balance. Our main structural result is an explicit factorization of the corresponding parent Hamiltonian into noncommutative first-order operators. This turns purified Gibbs-state preparation into a singular-value filtering problem and enables a quantum singular value transformation algorithm with quadratically improved gap dependence under standard coherent-access and warm-start assumptions. The framework applies to several efficiently implementable Gibbs samplers beyond the Davies setting. Moreover, we construct noncommuting Hamiltonians with efficiently preparable warm starts whose refinement under quantum Gibbs samplers requires exponential time. For these models, our algorithm achieves an end-to-end quantum speedup over the worst-case mixing scale.
Read the full abstract

Probability

Optimal strategies in the all-heads coin game

We study a sequential coin-flipping game: a player starts with $n$~coins, each heads with probability~$p$, and in each round flips all remaining coins and must set aside at least one head, losing if none shows. The player wins once all coins have been set aside. The optimal winning probability~$w_{n,p}$ obeys a Bellman equation with a nonlinear suffix-maximum operator. For $p=\tfrac12$ every strategy achieves $w_{n,1/2}=\tfrac12$. For $p>\tfrac12$ the strategy~\One{} (set aside a single head) is optimal, $n\mapsto w_{n,p}$ is strictly increasing, and the limit $W(p):=\lim_n w_{n,p}$ has an explicit series representation with $p\le W(p)<1$. For $p<\tfrac12$ near~$\tfrac12$ we give a first-order perturbation expansion in $\delta:=\tfrac12-p$: the deficit satisfies $\tfrac12-w_{n,\,1/2-\delta}\approx\delta\,c_n$, where $c_n$ obeys a linear recursion for $n\ge7$ with limit $L\approx1.7035$. To first order the optimal-value sequence has a strict local minimum at $n=5$ and no local maximum.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Testing independence in the presence of missing data: high-dimensional case

In this paper, we consider the problem of testing independence in high-dimensional settings with missing data. Building upon a recently proposed Kendall-based statistic, we introduce two new modifications specifically designed to accommodate incomplete observations. The proposed methods are studied from both theoretical and empirical perspectives. A comprehensive simulation study illustrates the robustness and applicability of the new approaches. The findings contribute to the development of nonparametric methods for analyzing high-dimensional and incomplete data structures.
Read the full abstract

Algebraic Geometry

Ulrich bundles with $c_2(\mathcal E)^2=0$ and connectedness of Ulrich subvarieties

We give an almost complete classification of Ulrich bundles $\mathcal E$ with $c_2(\mathcal E)^2=0$ on a variety $X$ of dimension $n \ge 4$. Moreover, we show that there are strong constraints on the geometry of $X$ and we study disconnected Ulrich subvarieties.

Optimization and Control

A Reinforcement-learning-based Column Generation Algorithm for Integrated Operating Room Planning and Scheduling

In this paper, we propose a novel mixed integer programming model to formulate integrated operating room planning and scheduling problems, where several mandatory and elective surgeries are to be assigned and scheduled in operating rooms on different days. We consider both overtime in operating rooms and surgeons' daily availability limits. We propose a column generation (CG) algorithm to solve large-scale instances. In order to enhance the CG, we integrate the Reinforcement Learning Algorithm and the Genetic Algorithm and develop a hybrid algorithm to generate initial columns for the CG algorithm. For our analysis, we employed two sets of test instances: one consisting of synthetic data and the other based on real-world cases from a local hospital in Naples, Italy. Computational experiments demonstrate that our proposed model and methodology yields an average optimality gap of 1.23% for synthetic instances and 1.49% on real-world scenarios, significantly outperforming previous solution methodologies in the literature. Additionally, we demonstrate that the developed CG algorithm provides a high-quality solution for large-scale instances where other models and methods fail to obtain even a feasible solution. To further evaluate robustness under uncertainty, we examined scenarios with 20% variability in surgery durations. The results indicate that incorporating a 120-minute buffer time minimizes the overall cost. Moreover, we investigated the impact of emergency surgeries by either introducing additional cases or escalating surgical priorities. For synthetic instances, the inclusion of emergency surgeries increased the total rescheduling cost by 4.13%, whereas in the real-world Naples cases, priority escalation led to only a 0.11% increase.
Read the full abstract

All authors Mahdi Dolatkhah, Hossein Hashemi Doulabi, Walter Rei, Michel Gendreau

Representation Theory

The coloured mutation class of $\mathbb{D}_n$- quivers and their application to $m$-cluster tilted algebras

In this paper, we present an explicit and purely combinatorial characterization of the $m$-coloured quivers that appear within the $m$-coloured mutation class of a quiver of type $\mathbb{D}_n$. The $m$-coloured mutation, as defined by Buan and Thomas in \cite{BT}, generalises the well-known quiver mutation introduced by Fomin and Zelevinsky \cite{FZ}. Consequently, we derive a comprehensive description of the Gabriel quivers associated with $m$-cluster-tilted algebras of type $\mathbb{D}_n$. Notably, our characterization extends a result by Vatne, \cite{Va}, which we recover when $m=1$.
Read the full abstract

Optimization and Control · Cross-listed from cs.CE

Surrogate-Based Co-Design Coupling Analysis for Floating Offshore Wind Turbines

This work presents a design coupling analysis (DCA) framework to investigate the interactions among control and plant design variables in floating offshore wind turbine (FOWT) and to support the formulation of tractable control co-design (CCD) optimization strategies. DCA provides quantitative information that reveals the relationships and dependencies among design variables and to objective function, enabling improved design variable selection, identification of dominant variables that drive system interactions, and informed selection of optimization solution strategies. However, applying DCA to complex systems is challenging because the models used to describe their dynamics are computationally expensive, and constructing DCA information requires exhaustive model evaluations and optimizations. Here, a surrogate model of the FOWT system is employed to make the repeated model evaluations required for DCA computationally feasible. Using this framework, the bidirectional couplings between control and plant design variables, as well as the couplings among plant design variables, are estimated. The results reveal strong interactions among various design variables, and identify the most influential plant design variables affecting system performance. These insights guide the development of two DCA-based optimization strategies for large CCD problems: a sequential decomposition approach that preserves dominant design variable couplings while reducing problem size at each stage, and a reduced dimensional optimization approach that focuses on collectively the most influential variables. The results demonstrate that these strategies significantly reduce computational complexity while achieving solutions comparable to those obtained through full simultaneous optimization, demonstrating the value of DCA for understanding and solving complex design problems.
Read the full abstract

All authors Elena Fernandez Bravo, Sunil Tamang, Yong Hoon Lee, James T. Allison

Analysis of PDEs

Scattering of the 3D Zakharov-Kuznetsov equation

We consider the Zakharov-Kuznetsov equation in space dimension 3: \[ \left\{ \begin{array}{l} \partial_t u + \partial_x \Delta u + \partial_x \frac{u^2}{2} = 0 \\ u(t = 0) = u_0 \end{array} \right. \] where $u : (t, x, y) \in \mathbb{R} \times \mathbb{R} \times \mathbb{R}^2 \mapsto u(t, x, y) \in \mathbb{R}$, and $\Delta = \partial_x^2 + \Delta_y$ is the full Laplacian. We show that, for any $u_0$ satisfying \[ \Vert (1 + x^2 + |y|^2) u_0 \Vert_{H^1} \ll 1 \] then the global solution exhibits scattering in $H^1$. This is done using the method of space-time resonances, and more precisely the partial symmetries approach [GPW23] in order to treat the anisotropy. We introduce well suited anisotropic weighted norms, prove dispersive decay estimates adapted to these norms and an a priori estimate allowing to close by a bootstrap argument.
Read the full abstract

Analysis of PDEs

Large-Scale Regularity for the Periodic Kinetic Fokker-Planck equation

We first prove a homogenization result for the fundamental solution of the linear kinetic Fokker Planck equation. We show that this solution converges, in an averaged $L^2$ sense, to the fundamental solution of an effective heat equation with constant effective diffusivity determined by corrector functions solving associated cell problems on the torus. A key feature of the proof is the necessity of second-order correctors to control the averaging of the velocity variable, and the handling of a non-divergence form error term arising from limited spatial regularity of solutions. Additionally, building on this homogenization result, we establish a large-scale regularity result for solutions of this Fokker Planck equation. More specifically, we show that solutions by heterogeneous polynomials, analogous to Taylor polynomials, with an explicit error on large scale domains. Furthermore, we show that in a larger regime, this approximating polynomial solves this Fokker Planck equation.
Read the full abstract

Optimization and Control

Modeling Epidemic Spread with Strategic Vaccination and Socialization: a Mean Field Game Analysis

We study a game-theoretic model of epidemic control in a large population with finitely many groups and non-cooperative individuals. In the model, individuals jointly choose their socialization levels and vaccination rates, and vaccination is subject to a linear individual cost structure. We derive a forward-backward ordinary differential equations (FBODE) system that characterizes the mean field Nash equilibrium, show that the equilibrium vaccination rate exhibits an at-most one-jump bang-bang structure, and establish the existence of a Carathéodory solution to the FBODE. This establishes a realistic interpretation of the vaccination decisions, meaning individuals decide to vaccinate until a time point which is determined by model parameters and then stop after. We further consider a population-awareness extension in which individuals incorporate population infection information into their objective functions, and we prove a similar at-most one-jump bang-bang property under suitable conditions. Finally, we propose a numerical algorithm for solving the FBODE and conduct simulations to validate the theoretical findings. The experiments highlight two main insights: the trade-off between socialization and vaccination, and the greater importance of quarantining infected individuals instead of restricting susceptible individuals.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Quantum Dynamics and Collapse-and-Revival Phenomena in the Dunkl Anharmonic Oscillator

We study the Dunkl anharmonic oscillator (Kerr medium) Hamiltonian from an algebraic approach of the $SU(1,1)$ group. In order to obtain the exact energy spectrum of this problem, we write its Hamiltonian in terms of the Dunkl creation and annihilation operators, which close the $su(1,1)$ Lie algebra. This allows us to exactly solve this Hamiltonian and obtain its parity-dependent energy spectrum. Then, we investigate the quantum dynamics of the system, particularly the collapse and revival phenomena, by using an initial state given by a superposition of even and odd Dunkl coherent states. We compute the field quadrature and the survival probability, showing that the Dunkl parameter $\mu$ modulates the fractional revivals and produces perfect state reconstructions at half-periods for specific deformation values. We analyze the quadrature variance to show that the Dunkl deformation generates interference-induced squeezed states around $t \approx \pi$. The standard Kerr medium dynamics are exactly recovered in the limit $\mu \rightarrow 0$.
Read the full abstract

Analysis of PDEs

Nash-Aronson Estimate for the Linear Kinetic Fokker-Planck equation

We prove a Nash-Aronson-type upper bound on the fundamental solution of the linear kinetic Fokker Planck equation with friction term, distinguishing two regimes. For long times, we derive a Gaussian upper bound matching the classical parabolic estimate, which reflects the averaging of the velocity variable that occurs in this regime. For short times, the fundamental solution is governed by that of the constant-coefficient Kolmogorov equation, with the friction and potential terms negligible.
Read the full abstract

Algebraic Geometry

Sobolev embedding theorem and subanalytic measures

We focus on Borel measures that have a globally subanalytic density function. We prove, given such a measure $\mu$ on a set $A$ and a globally subanalytic mapping $\Phi:A\to \Omega$, with $\Omega$ bounded open subset of $\mathbb{R}^n$, a Sobolev embedding theorem for the Sobolev space $W^{k,p}_{\Phi_*\mu}(\Omega)$ of the push-forward measure $\Phi_*\mu$. We derive an embedding of $W^{k,p}_{\Phi_*\mu}(\Omega)$ into the space of inner Lipschitz functions and give an application to kernel theory.
Read the full abstract

Numerical Analysis · Cross-listed from physics.class-ph

Electric potential of insulated conducting objects in presence of electric charges – some exact and approximate results

Determination of the electric potential of insulated conducting objects is an important problem both theoretically and practically. For an insulated conducting object in the presence of external charges or charges distributed on the object surface, the problem of potential determination is reformulated using a newly introduced $J$ formalism. Using the $J$ formalism, it is shown how the electric potential can be calculated exactly for spherical objects and efficiently approximated for other object geometries using geometrical properties of the insulated conducting object. This approach does not require calculation of the surface charge distribution at the object surface of the calculation of the electric potential in the surrounding space. Properties and the performance of the approach are investigated numerically using the Robin Hood method. Possible applications of the approach based on the $J$ formalism are outlined for calculation of capacitance of conducting objects.
Read the full abstract

Information Theory · Cross-listed from cs.CR

Module Lattice Security (Part II): Module Lattice Reduction via Optimal Sign Selection

We extend the CDPR's quantum attack from ideal lattices to module lattices over $2^k$-th cyclotomic rings. Using trace orthogonality of the power basis, we decompose a rank-$d$ module into mutually orthogonal rank-$1$ submodules, and apply CDPR's analysis to each independently and return the shortest candidate. The Hermite factor $\exp(\tilde{O}(\sqrt{n}))$ matches the ideal case, with a module reduction factor $\alpha_d=O(1)$ independent of the rank, under a balance hypothesis (proved for Gaussian distribution) automatic for MLWE-distributed bases. To enable a bounded-precision implementation, we replace coordinate-wise rounding with Chinese Remainder Theorem-scaled rounding at totally split primes, reducing the Gram-Schmidt rounding radius from $n/2$ to $\le 1$ at cost $O(d^2 r n \log n)$. Finally, we reformulate the CDPR's sign-selection step as a mixed-integer linear program and prove its optimum is no more than 1/2 for all $k$ ($\approx 0.4407$ for all tested $k\le 12$, conjecturally universal). This replaces the previous heuristic discrepancy $\Theta(\sqrt{nk})$. All results build on the class number condition $h_k^+=1$ established in Part I of this series.
Read the full abstract

Optimization and Control

Relaxation-Informed Training of Neural Network Surrogate Models

ReLU neural networks trained as surrogate models can be embedded exactly in mixed-integer linear programs (MILPs), enabling global optimization over the learned function. The tractability of the resulting MILP depends on structural properties of the network, i.e., the number of binary variables in associated formulations and the tightness of the continuous LP relaxation. These properties are determined during training, yet standard training objectives (prediction loss with classical weight regularization) offer no mechanism to directly control them. This work studies training regularizers that directly target downstream MILP tractability. Specifically, we propose simple bound-based regularizers that penalize the big-M constants of MILP formulations and/or the number of unstable neurons. Moreover, we introduce an LP relaxation gap regularizer that explicitly penalizes the per-sample gap of the continuous relaxation at training points. We derive its associated gradient and provide an implementation from LP dual variables without custom automatic differentiation tools. We show that combining the above regularizers can approximate the full total derivative of the LP gap with respect to the network parameters, capturing both direct and indirect sensitivities. Experiments on non-convex benchmark functions and a two-stage stochastic programming problem with quantile neural network surrogates demonstrate that the proposed regularizers can reduce MILP solve times by up to four orders of magnitude relative to an unregularized baseline, while maintaining competitive surrogate model accuracy.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Carrollian quantum states and flat space holography

We study free Carrollian quantum field theories from an algebraic perspective and explore their implications for flat space holography. As explicit examples, we construct the electric and magnetic Carrollian Weyl algebras obtained from Carroll limits of the relativistic scalar field and analyze their states, including vacuum and thermal configurations. For the massive electric theory, we find a regular Carroll-invariant vacuum state and a regular KMS state, yielding a consistent Carrollian thermodynamic system. By contrast, the massless electric and magnetic theories are more subtle: depending on the quantization, they admit either no regular distinguished vacuum or only nonregular Carroll-invariant ground states, while still supporting nonregular thermal states. We further analyze alternative classes of states in the massless electric theory, including spatially homogeneous quasifree pure states and Sorkin–Johnston states. Motivated by these results, we discuss consequences for flat space holography. We construct a well-defined state relevant for Carrollian holography whose Hilbert-space representation factorizes into a standard Fock sector and a nonseparable zero-mode sector, thereby highlighting the role of infrared degrees of freedom in the boundary theory.
Read the full abstract

Information Theory · Cross-listed from cs.SI

Multiplex Hypergraph Modeling of Higher Order Structures in Psychometric Networks

Psychiatric disorders have been traditionally conceptualized as latent conditions producing observable symptoms, but recent studies suggest that psychopathology may emerge from symptoms interactions. Psychometric networking model these relations focusing on pairwise associations but overlooks higher-order dependencies arising among groups of variables. These dependencies may reflect synergistic mechanisms, where joint symptom configurations convey more information than pairwise relations, or redundancy, where information overlaps. We introduce an information-theoretic multiplex hypergraph framework to identify and compare higher-order interactions in eating disorders data, across diagnostic groups (e.g., anorexia nervosa). Higher-order structures are quantified using $\Omega$-information, a measure that captures the balance between redundancy and synergy. To address the combinatorial growth of candidate subsets, multiple testing and estimation instability, we propose a structured pipeline comprising: (i) targeted candidate selection based on dyadic network topology and theory-driven subscale information; (ii) a three-stage inferential procedure combining null-model testing with bootstrap robustness assessment; and (iii) the construction and analysis of diagnosis-layered, synergistic and redundant multiplex hypergraphs. Results highlight how synergy captures the emergent, higher-order organization of diagnoses, revealing both a stable transdiagnostic core and diagnosis-specific ways in which these domains combine. By contrast, redundancy is confined to eating and body-image related content, marking reinforcement rather than broader symptom integration.
Read the full abstract

All authors Francesca Possenti, Laura Girelli, Paolo Tieri, Manuela Petti

Information Theory · Cross-listed from eess.SP

Minimax Optimal Procedures for Joint Detection and Estimation

We investigate the problem of jointly testing a pair of composite hypotheses and, depending on the test result, estimating a random parameter under distributional uncertainties. Specifically, it is assumed that the distribution of the data given the parameter of interest, is subject to uncertainty. Both, a Bayesian formulation and a Neyman-Pearson-like formulation, are considered. It is shown that the optimal policy induces an $f$-similarity that must be maximized to identify the least favorable distributions. Besides the general results, the implementation is investigated using a band-type uncertainty model. For designing the minimax procedures, existing algorithms are modified to increase convergence speed while maintaining numerical stability. The proposed theory is supplemented by numerical results for both formulations.
Read the full abstract