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 3 April

Numerical Analysis

A Non-compact Positivity-Preserving Numerical Scheme for Elliptic Differential Equations Based on Mathematical Expectation

We propose a novel non-compact, positivity-preserving scheme for linear non-divergence form elliptic equations. Based on the Feynman–Kac formula, the solution is represented as a conditional expectation associated with a diffusion process.Instead of using compact Markov chain approximations, we construct a wide-stencil scheme by approximating the expectation with carefully designed transition probabilities, ensuring both consistency and positivity preservation. The method is effective for anisotropic diffusion problems with mixed derivatives, where classical schemes typically fail unless the covariance matrix is diagonally dominant. A key feature of the proposed framework is its robust treatment of boundary conditions. For Dirichlet boundaries, we introduce a quadtree-based non-uniform stopping-time strategy, achieving $O(h)$ accuracy. For Neumann boundaries, a discrete specular reflection mechanism is employed, yielding $O(h^{1/2})$ convergence. Periodic boundaries are handled through modular wrapping, also achieving $O(h)$ accuracy. The resulting schemes are unconditionally stable and positivity-preserving due to their probabilistic structure. Numerical experiments confirm the theoretical convergence rates under all boundary conditions considered.
Read the full abstract

Combinatorics

An almost quadratic bound for the minimal excluded minors for a surface

As part of the graph minor project, Robertson and Seymour showed in 1990 that the class of graphs embeddable in a given surface can be characterized by a finite set of minimal excluded minors. However, the proof is purely existential and therefore provides no explicit information about these excluded minors. In 1993, Seymour established the first general upper bound on the order of such minimal excluded minors. Recently, Houdaigoui and Kawarabayashi improved this result by deriving a quasi-polynomial upper bound. Despite this advance, the gap between this bound and the known linear lower bound $\Omega(g)$ (where $g$ denotes the genus) remains substantial. In particular, they conjectured that a polynomial upper bound should hold. In this paper, we confirm this conjecture by showing that the order of the minimal excluded minors for a surface of genus $g$ is $g^{2+o(1)}$. This result significantly narrows the gap between the known lower and upper bounds, bringing the asymptotic behavior much closer to the conjectured optimum. Our approach relies on a new structural property of minimal excluded minors. Let $G$ be a minimal excluded minor for a surface of Euler genus $g$. Houdaigoui and Kawarabayashi showed that $G$ contains $O(\log g)$ pairwise disjoint cycles that are contractible and nested in some embedding of $G$. We strengthen this result by proving a separator-based variant: for any contractible subgraph $H \subseteq G$ with a separator of size $s$ (with $H$ contained entirely in one side), the subgraph $H$ contains $O(\log s)$ disjoint cycles that are contractible and nested in some embedding of $G$. This allows us to replace a genus-dependent bound with a separator-dependent one, which is the main new ingredient in deriving our polynomial bound.
Read the full abstract

Optimization and Control

Adaptive Newton-CG methods with global and local analysis for unconstrained optimization with Hölder continuous Hessian

In this paper, we study Newton-conjugate gradient (Newton-CG) methods for minimizing a nonconvex function $f$ whose Hessian is $(H_f,\nu)$-Hölder continuous with modulus $H_f>0$ and exponent $\nu\in(0,1]$. Recently proposed Newton-CG methods for this problem adopt (i) non-adaptive regularization and (ii) a nested line-search procedure, where (i) often leads to inefficient early progress and the loss of local superlinear convergence, and (ii) may incur high computational cost due to multiple solves of the Newton system per iteration. To address these limitations, we propose two novel Newton-CG algorithms, depending on the availability of $\nu$, that adaptively regularize the Newton system by leveraging the auto-conditioning technique to eliminate the nested line search. The proposed algorithms achieve the best-known iteration complexity ${\mathcal O}\big(H_f^{1/(1+\nu)}\epsilon^{-(2+\nu)/(1+\nu)}\big)$ for finding an $\epsilon$-stationary point and, simultaneously, enjoy local superlinear convergence near nondegenerate local minimizers. Numerical experiments further demonstrate the practical advantages of our algorithms over existing approaches.
Read the full abstract

Optimization and Control

A Canonical Structure for Constructing Projected First-Order Algorithms With Delayed Feedback

This work introduces a canonical structure for a broad class of unconstrained first-order algorithms that admit a Lur'e representation, including systems with relative degree greater than one, e.g., systems with delayed gradient feedback. The proposed canonical structure is obtained through a simple linear transformation. It enables a direct extension from unconstrained optimization algorithms to set-constrained ones through projection in a Lyapunov-induced norm. The resulting projected algorithms attain the optimal solution while preserving the convergence rates of their unconstrained counterparts.
Read the full abstract

All authors Mengmou Li, Yu Zhou, Xun Shen, Masaaki Nagahara

Dynamical Systems

Linear response asymmetry between SRB and physical measures for families of intermittent maps with a transition point

We study linear response for families of intermittent maps whose SRB measure undergoes a transition from finite to infinite total mass at a critical parameter value. Our results reveal the following fundamental asymmetry arising from this transition. Smooth parameter dependence of the SRB measure implies continuity of the physical measure at the transition point, while simultaneously precluding its differentiability there. In particular, although the physical measure varies continuously with respect to the parameter at the transition, it fails to admit a linear response for a large class of potentials in the usual sense. We derive an explicit one-sided derivative formula describing this singular behavior and thereby give a quantitative characterization of how statistical properties degenerate as the total mass of the SRB measure diverges. The key ingredient in the proof of our main theorem is a new method that relates the parameter dependence of physical measures near the transition point to the behavior of the Riemann zeta function near its pole at 1.
Read the full abstract

Optimization and Control

A Sequential Cubic Programming Method with Second-Order Complexity Guarantees for Equality Constrained Optimization

We develop a new method for equality constrained optimization problems based on a sequential cubic programming framework. Each iteration utilizes a step decomposition based on the Jacobian of the constraints into a normal and a tangential component, the latter of which is found by solving a subproblem involving cubic regularization. The method incorporates second-order correction steps as necessary to ensure global convergence to second-order stationary points as well as local quadratic convergence. In addition, we show that the algorithm is the first to obtain worst case complexity guarantees on the order of $\mathcal{O}(\epsilon_g^{-3/2})$ for the gradient of the Lagrangian, $\mathcal{O}(\epsilon_H^{-3})$ in terms of second-order stationarity, and $\mathcal{O}(\epsilon_c^{-1})$ in terms of the constraint violation. These are the best known complexity guarantees of any method for this class of problems.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.stat-mech

Zero-Freeness of the Hard-Core Model with Bounded Connective Constant

We study the zero-free regions of the partition function of the hard-core model on finite graphs and their implications for the analyticity of the free energy on infinite lattices. Classically, zero-freeness results have been established up to the tree uniqueness threshold $\lambda_c(\Delta-1)$ determined by the maximum degree $\Delta$. However, for many graph classes, such as regular lattices, the connective constant $\sigma$ provides a more precise measure of structural complexity than the maximum degree. While recent approximation algorithms based on correlation decay and Markov chain Monte Carlo have successfully exploited the connective constant to improve the threshold to $\lambda_c(\sigma)$, analogous results for complex zero-freeness have been lacking. In this paper, we bridge this gap by introducing a proper definition of the connective constant for finite graphs based on a lower bound on the number of $k$-depth self-avoiding walks. We prove that for any graph family with a lower connective constant $\mu$, the partition function is zero-free in a complex neighborhood of the interval $[0, \lambda]$ for all $\lambda < \lambda_c(\mu)$. As a direct consequence, we establish the uniqueness and analyticity of the free energy density for infinite lattices up to the connective constant threshold, extending the known regions derived from maximum degree bounds. Our proof utilizes a block contraction technique that lifts the correlation decay property from a real interval to a strip-like complex neighborhood.
Read the full abstract

Optimization and Control · Cross-listed from stat.ML

State estimations and noise identifications with intermittent corrupted observations via Bayesian variational inference

This paper focuses on the state estimation problem in distributed sensor networks, where intermittent packet dropouts, corrupted observations, and unknown noise covariances coexist. To tackle this challenge, we formulate the joint estimation of system states, noise parameters, and network reliability as a Bayesian variational inference problem, and propose a novel variational Bayesian adaptive Kalman filter (VB-AKF) to approximate the joint posterior probability densities of the latent parameters. Unlike existing AKF that separately handle missing data and measurement outliers, the proposed VB-AKF adopts a dual-mask generative model with two independent Bernoulli random variables, explicitly characterizing both observable communication losses and latent data authenticity. Additionally, the VB-AKF integrates multiple concurrent multiple observations into the adaptive filtering framework, which significantly enhances statistical identifiability. Comprehensive numerical experiments verify the effectiveness and asymptotic optimality of the proposed method, showing that both parameter identification and state estimation asymptotically converge to the theoretical optimal lower bound with the increase in the number of sensors.
Read the full abstract

Numerical Analysis

Error Estimates of the Gain Approximation by Hermite-Galerkin Method in Feedback Particle Filter

The feedback particle filter (FPF) is a promising nonlinear filtering (NLF) method, but its practical implementation is hindered by the intractability of the gain function, which satisfies a boundary value problem (BVP). This paper proposes a novel two-step Hermite-Galerkin spectral method to address this challenge. First, the unknown density in the BVP is approximated by a kernel density estimator, whose error bounds are well-established in the literature. Second, rather than directly approximating the gain function, we approximate an auxiliary variable via the Galerkin spectral method using generalized Hermite functions. This auxiliary variable inherits the rapid decay property of the density at infinity, which aligns perfectly with the exponential decay characteristic of generalized Hermite functions, thereby obviating the need for artificial boundary conditions or domain truncation. Furthermore, we rigorously establish two fundamental error estimates: the kernel approximation error decays at the rate $O(N_p^{-\frac{s}{2s+1}})$, while the spectral approximation error converges at $O(M^{-s+1}\log M)$, providing complete theoretical guarantees for the method's accuracy. Comprehensive numerical experiments validate the theoretical results and demonstrate that the proposed method outperforms existing gain approximation schemes in both accuracy and computational efficiency.
Read the full abstract

Optimization and Control

Sparse control for VCHE with abstract J

We investigate a distributed optimal control problem for the viscous Camassa–Holm equations with sparse controls and a general cost functional. Considering three different forms of sparsity-promoting terms, we prove the existence of optimal solutions, derive the corresponding optimality conditions and analyze the stability of optimal solutions with respect to the sparsity parameter.
Read the full abstract

Number Theory

Explicit hypergeometric modularity of certain weight two and four Hecke eigenforms

Recently, Allen et al. developed the Explicit Hypergeometric Modularity Method (EHMM) that establishes the modularity of a large class of hypergeometric Galois representations in dimensions two and three. Motivated by this framework, we construct two explicit families of eta-quotients, which we call the $\mathbb{K}_4$ and $\mathbb{K}_5$ functions, from the hypergeometric background. These $\mathbb{K}_4$ and $\mathbb{K}_5$ functions are constructed using the theory of weight $1/2$ Jacobi theta functions and their cubic analogues, respectively. Using these constructions, we then express the Fourier coefficients of certain Hecke eigenforms of weight two and four in terms of finite field period functions. As an application, we obtain new identities expressing the Fourier coefficients of weight two Hecke eigenforms in terms of special values of finite field analogues of the Appell series $F_1$ and $F_2$. These results provide new explicit connections between hypergeometric character sums, modular forms, and multivariable hypergeometric functions over finite fields, thereby extending the scope of known instances of hypergeometric modularity.
Read the full abstract

Statistics Theory

Parameter Estimation of Incomplete Gamma Subordinators

In this paper, we estimate the parameters of InG, InG-$\epsilon$ and TInG subordinators which have been studied by Babulal et al (see \cite{babulal}). We have modified the method of moments technique to use fractional moments of the InG and InG-$\epsilon$ subordinator due to their infinite moments. For the TInG subordinator's parameter estimation, we have used the method of moments. We also compute the maximum likelihood estimator(MLE) for the parameter $\alpha$ of the InG and InG-$\epsilon$ subordinators using jump distribution of the process. We also discussed the asymptotic normality of MLE.
Read the full abstract

Analysis of PDEs

Quantitative homogenization for static contact Hamilton-Jacobi equations

We characterize possible pairs $(u_\varepsilon,c)\in C(\mathbb{R}^n\backslash\varepsilon\mathbb{Z}^n,\mathbb{R})\times\mathbb{R}$ addressing the homogenization problem for Hamilton–Jacobi equations $$ H\left(\frac{x}{\varepsilon}, d u_\varepsilon, u_\varepsilon\right)=c, \quad \left({\mathrm resp.} \quad H\left(\frac{x}{\varepsilon}, d u_\varepsilon, u_\varepsilon\right)=\varepsilon\Delta u_\varepsilon+c \right) $$ for all $\varepsilon>0$. Under a (not necessarily strict) monotonicity assumption on the Hamiltonian, we proposed certain criteria (based on the structure of Mather measures), under which all possible solutions $u_\varepsilon$ converge to a uniquely identified limit $u\in C(\mathbb{R}^n,\mathbb{R})$ solving the effective equation \[ \overline H( du,u)=c,\quad ({\mathrm resp.}\quad \overline H(du,u)=\Delta u+c) \] as $\varepsilon\rightarrow 0_+$ with a uniform rate $\mathcal{O}(\varepsilon)$.
Read the full abstract

Algebraic Geometry

Algebraization of absolute perfectoidization via section rings

We construct and study a graded version of absolute perfectoidization for $G$-graded adic rings. As a main geometric application, we show that the absolute perfectoidization of the structure sheaf of a projective-type formal scheme admits an algebraization.

Differential Geometry

Existence of Hermitian metrics with prescribed Hermitian-Yang-Mills tensors II

In this paper, we solve the prescribed Hermitian-Yang-Mills tensor problem for Higgs bundles over compact complex manifolds. Let $ (E,\theta) $ be a Higgs bundle over a compact Hermitian manifold $(M,\omega_g) $. Suppose that there exists a smooth Hermitian metric $ h_0 $ on $E$ such that the Hermitian-Yang-Mills tensor $ \Lambda_{\omega_g}\left(\sqrt{-1} R^{D^{h_0}}\right) $ of the Higgs connection is positive definite. Then for any Hermitian positive definite tensor $ P\in \Gamma\left(M,E^*\otimes \bar E^*\right) $, there exists a unique smooth Hermitian metric $ h $ on $E$ such that $$\Lambda_{\omega_g} \left(\sqrt{-1} R^{D^h}\right)=P.$$ We also establish quantitative Chern number inequalities for Higgs bundles.
Read the full abstract

All authors Jiaxuan Fan, Mingwei Wang, Xiaokui Yang, Shing-Tung Yau

Optimization and Control

Data-driven identification of critical links in transport networks using quantum annealing

In urban transport systems, time-varying demand and network conditions cause the importance of infrastructure elements to evolve, requiring the identification of period-specific critical links to support systemlevel risk and resilience analysis. However, static or time-averaged network analyses struggle to capture the temporal variation of infrastructure importance at the city scale. To address this gap, this study proposes a time-dependent critical link identification framework for large-scale urban transport networks. The problem is formulated as a Quadratic Unconstrained Binary Optimisation (QUBO) model and solved using quantum annealing on D-Wave hardware. Empirical analysis using real-world traffic data reveals a strong temporal concentration of critical links. Rather than persistently influencing system performance, critical links emerge mainly within a small number of key time windows, during which even limited disruptions can lead to substantial network delay amplification. These findings demonstrate the value of time-dependent analysis for risk screening, stress testing, and resilience-oriented transport management.
Read the full abstract

All authors Junxiang Xu, Chence Niu, Tingting Zhang, Divya Jayakumar Nair, Vinayak Dixit

Logic · Cross-listed from cs.LO

A Logic of Secrecy on Simplicial Models

We develop a logic of secrecy on simplicial models for multi-agent systems. Standard simplicial models provide a geometric semantics for knowledge by representing global states as facets of a chromatic simplicial complex and agents' local states as coloured vertices. However, secrecy cannot in general be captured as a genuinely new modality by relying on the ordinary simplicial knowledge structure alone. This motivates the introduction of an additional secrecy layer. To this end, we define simplicial secrecy models, which enrich standard simplicial epistemic models with agent-relative secrecy neighborhood functions attached to local states. On this basis, we introduce a primitive secrecy operator $S_a\varphi$. Semantically, $S_a\varphi$ holds when agent $a$ knows $\varphi$ in the ordinary simplicial sense and, moreover, the truth set of $\varphi$ belongs to one of the designated secrecy neighborhoods associated with $a$'s current local state. The clause for secrecy thus combines an ordinary knowledge requirement with an additional local-state-based neighborhood requirement, while the frame condition ensures that designated secrecy events remain non-trivial from the perspective of every other agent. We formulate a system $\mathsf{SSL}$ for the resulting language and show that it is sound with respect to the class of simplicial secrecy models. For the genuinely multi-agent case $|A|\ge 2$, we prove completeness by first constructing an auxiliary-colour canonical model and then representing it inside the original class of pure $A$-chromatic simplicial secrecy models. The resulting framework yields a primitive, local-state-based, and geometrically grounded account of secrecy on simplicial models, together with a sound axiomatization and, in the genuinely multi-agent case, a complete one.
Read the full abstract

Geometric Topology

Families of cosmetic surgeries

We construct infinite families of chirally cosmetic surgeries on chiral hyperbolic knots and purely cosmetic surgeries on hyperbolic manifolds with multiple cusps, disproving conjectures that these phenomena do not appear, including Problem 1.12(d) in the K3 problem list. We also give some hints regarding why chirally cosmetic surgeries appear to be more common than purely cosmetic surgeries on $1$-cusped manifolds.
Read the full abstract

Optimization and Control

Quantum optimisation in cities: Limitations and prospects of urban transport systems

Recently, quantum computing has gained attention in urban studies as a tool for complex transport planning problems, but its role remains unclear. This paper reviews quantum computing research in urban transport planning and highlights major limits in scalability, robustness, constraint handling, and engineering feasibility.Stable and reproducible advantages of quantum optimisation in real urban systems have yet to be shown. By comparing quantum methods with established classical optimisation methods, it is found that decomposition methods, metaheuristics, and reinforcement learning already provide transparent, scalable, and policy-interpretable solutions for medium and large-sized urban transport networks. In contrast, the contribution of quantum methods largely lies in the exploratory analysis of limited, discrete combinatorial subproblems rather than full system-level optimisation. It is argued in this paper for a shift from technology-driven application narrative towards problem-driven method selection. From an urban transport planning perspective, we have identified the specific problem types where the exploratory use of quantum computing may be relevant, including critical link and node vulnerability identification, combinatorial screening of congestion and failure scenarios, disaster-related condition analysis, constrained path option selection, and small-scale facility location and investment option assessment. It is concluded that hybrid frameworks represent a more realistic pathway for integrating quantum computing into urban transport research, in which classical methods ensure systemlevel consistency and policy interpretability while quantum methods support local combinatorial exploration. Until stable engineering advantages are demonstrated, public agencies and researchers should prioritise method validation, scenario suitability, and cross-disciplinary collaboration.
Read the full abstract

All authors Junxiang Xu, Chence Niu, Divya Jayakumar Nair, Vinayak Dixit

Differential Geometry

Area and antipodal distance in convex hypersurfaces

We establish a lower bound for the surface area of a closed, convex hypersurface in Euclidean space in terms of its displacement under continuous maps. As a result, a hypothesized lower bound for the volume of a Riemannian $n$-sphere, proved by Berger in dimension $n=2$ and disproved by Croke in dimensions $n \geq 3$, is valid for convex hypersurfaces in all dimensions. We also establish a sharp lower bound for the mean width of a convex hypersurface.
Read the full abstract

Optimization and Control · Cross-listed from cs.AI

Let's Have a Conversation: Designing and Evaluating LLM Agents for Interactive Optimization

Optimization is as much about modeling the right problem as solving it. Identifying the right objectives, constraints, and trade-offs demands extensive interaction between researchers and stakeholders. Large language models can empower decision-makers with optimization capabilities through interactive optimization agents that can propose, interpret and refine solutions. However, it is fundamentally harder to evaluate a conversation-based interaction than traditional one-shot approaches. This paper proposes a scalable and replicable methodology for evaluating optimization agents through conversations. We build LLM-powered decision agents that role-play diverse stakeholders, each governed by an internal utility function but communicating like a real decision-maker. We generate thousands of conversations in a school scheduling case study. Results show that one-shot evaluation is severely limiting: the same optimization agent converges to much higher-quality solutions through conversations. Then, this paper uses this methodology to demonstrate that tailored optimization agents, endowed with domain-specific prompts and structured tools, can lead to significant improvements in solution quality in fewer interactions, as compared to general-purpose chatbots. These findings provide evidence of the benefits of emerging solutions at the AI-optimization interface to expand the reach of optimization technologies in practice. They also uncover the impact of operations research expertise to facilitate interactive deployments through the design of effective and reliable optimization agents.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

A Numerical Method for Coupling Parameterized Physics-Informed Neural Networks and FDM for Advanced Thermal-Hydraulic System Simulation

Severe accident analysis using system-level codes such as MELCOR is indispensable for nuclear safety assessment, yet the computational cost of repeated simulations poses a significant bottleneck for parametric studies and uncertainty quantification. Existing surrogate models accelerate these analyses but depend on large volumes of simulation data, while physics-informed neural networks (PINNs) enable data-free training but must be retrained for every change in problem parameters. This study addresses both limitations by developing the Parameterized PINNs coupled with FDM (P2F) method, a node-assigned hybrid framework for MELCOR's Control Volume Hydrodynamics/Flow Path (CVH/FP) module. In the P2F method, a parameterized Node-Assigned PINN (NA-PINN) accepts the water-level difference, initial velocity, and time as inputs, learning a solution manifold so that a single trained network serves as a data-free surrogate for the momentum conservation equation across all flow paths without retraining. This PINN is coupled with a finite difference method (FDM) solver that advances the mass conservation equation at each time step, ensuring exact discrete mass conservation while replacing the iterative nonlinear momentum solve with a single forward pass. Verification on a six-tank gravity-driven draining scenario yields a water level mean absolute error of $7.85 \times 10^{-5}$ m and a velocity mean absolute error of $3.21 \times 10^{-3}$ m/s under the nominal condition with $\Delta t = 1.0$ s. The framework maintains consistent accuracy across time steps ranging from 0.2 to 1.0 s and generalizes to five distinct initial conditions, all without retraining or simulation data. This work introduces a numerical coupling methodology for integrating parameterized PINNs with FDM within a nuclear thermal-hydraulic system code framework.
Read the full abstract

All authors Jeesuk Shin, Donggyun Seo, Sihyeong Yu, Joongoo Jeon

Optimization and Control

Quantum Optimisation for Transport Vulnerability Identification

Transport network vulnerability analysis plays a crucial role in safeguarding urban resilience. Traditional vulnerability identification approaches have provided valuable insights, yet they face two major limitations. First, the number of disruption scenarios increases combinatorially with the number of disrupted links considered simultaneously, making classical approaches computationally prohibitive. Second, most studies approximate the impacts of multiple simultaneous link failures through linear aggregation, which fails to capture the nonlinear interaction effects observed in real networks. To address these gaps, we reformulate the bi-level Mixed-Integer Nonlinear Programming (MINLP) model into a quantum-compatible Quadratic Unconstrained Binary Optimisation (QUBO) structure, enabling parallel exploration of complex disruption scenarios while incorporating nonlinear interaction effects. We develop a hybrid optimisation framework that integrates the quantum optimisation algorithm with the Frank-Wolfe method to validate the model's effectiveness on the small-scale network. Then, we further verify the framework through the D-Wave hardware across benchmark networks of different scales, including Sioux Falls, Anaheim, Chicago Sketch, and Berlin Full, to examine scalability and feasibility. The results show that this framework achieves strong solvability and stability. In particular, optimisation for large and larger networks is completed within minutes (Approximately 2.8 minutes for the 914-link, 9.8 minutes for the 2950-link, and 31.2 minutes for the 6018-link on D-Wave), demonstrating a computational efficiency improvement by one to two orders of magnitude compared with classical metaheuristic algorithms. These findings highlight the feasibility and potential of applying quantum computing to network vulnerability identification and open a new avenue for resilience-oriented planning.
Read the full abstract

All authors Junxiang Xu, Chence Niu, Divya Jayakumar Nair, Vinayak Dixit

Numerical Analysis · Cross-listed from cs.LG

Low-Rank Compression of Pretrained Models via Randomized Subspace Iteration

The massive scale of pretrained models has made efficient compression essential for practical deployment. Low-rank decomposition based on the singular value decomposition (SVD) provides a principled approach for model reduction, but its exact computation is expensive for large weight matrices. Randomized alternatives such as randomized SVD (RSVD) improve efficiency, yet they can suffer from poor approximation quality when the singular value spectrum decays slowly, a regime commonly observed in modern pretrained models. In this work, we address this limitation from both theoretical and empirical perspectives. First, we establish a connection between low-rank approximation error and predictive performance by analyzing softmax perturbations, showing that deviations in class probabilities are controlled by the spectral error of the compressed weights. Second, we demonstrate that RSVD is inadequate, and we propose randomized subspace iteration (RSI) as a more effective alternative. By incorporating multiple power iterations, RSI improves spectral separation and provides a controllable mechanism for enhancing approximation quality. We evaluate our approach on both convolutional networks and transformer-based architectures. Our results show that RSI achieves near-optimal approximation quality while outperforming RSVD in predictive accuracy under aggressive compression, enabling efficient model compression.
Read the full abstract

Dynamical Systems

Bellis strong stable sets on infinite hyperbolic surfaces

We provide a corrected proof of a theorem of A. Bellis on strong stable sets in the unit tangent bundle of certain hyperbolic surfaces. The theorem states that, for vectors whose geodesic rays encounter arbitrarily short closed geodesics, the strong stable set in the dynamical sense does not coincide with the associated horocyclic orbit. The proof is based on Bellis' idea of constructing geodesic rays that wind around infinitely many closed geodesics.
Read the full abstract

Combinatorics

On the number of 4-contractible edges in plane triangulations

In 2007, Ando and Egawa proved a theorem which provides a lower bound on the number of contractible edges preserving $4$-connectedness in $4$-connected graphs. In this paper, we refine their bounds, especially for the $4$-connected plane triangulations. In particular, we show that if $G$ is a $4$-connected plane triangulation of order at least $7$, then $G$ contains at least $|V_{\ge 5}|+2$ contractible edges preserving $4$-connectedness, where $V_{\ge 5}$ is the set of vertices of degree at least $5$. We also determine the extremal graphs.
Read the full abstract

All authors Toshiki Abe, Michitaka Furuya, Raiji Mukae, Shoichi Tsuchiya

Optimization and Control · Cross-listed from cs.LG

Conditional Sampling via Wasserstein Autoencoders and Triangular Transport

We present Conditional Wasserstein Autoencoders (CWAEs), a framework for conditional simulation that exploits low-dimensional structure in both the conditioned and the conditioning variables. The key idea is to modify a Wasserstein autoencoder to use a (block-) triangular decoder and impose an appropriate independence assumption on the latent variables. We show that the resulting model gives an autoencoder that can exploit low-dimensional structure while simultaneously the decoder can be used for conditional simulation. We explore various theoretical properties of CWAEs, including their connections to conditional optimal transport (OT) problems. We also present alternative formulations that lead to three architectural variants forming the foundation of our algorithms. We present a series of numerical experiments that demonstrate that our different CWAE variants achieve substantial reductions in approximation error relative to the low-rank ensemble Kalman filter (LREnKF), particularly in problems where the support of the conditional measures is truly low-dimensional.
Read the full abstract

All authors Mohammad Al-Jarrah, Michele Martino, Marcus Yim, Bamdad Hosseini, Amirhossein Taghvaei

Differential Geometry

The Calabi flow with prescribed curvature on finite graphs

In this paper, we investigate the prescribed curvature problem associated with a special Lin-Lu-Yau curvature on finite graphs of girth at least 6. We define the corresponding Calabi flow for this curvature type, and establish an equivalent characterization of the problem, namely, the solution to the Calabi flow exists globally in time and converges if and only if there exists a weight function that realizes the prescribed curvature. In particular, for constant curvature weights, we prove that the solution to the Calabi flow exists globally in time and converges under certain topological conditions.
Read the full abstract

All authors Yi Li, Jie Wang, Pingsan Yuan, Chao Zheng

Algebraic Geometry

Higher Chow cycles, cyclic cubic fourfolds and Lagrangian subvarieties

In this paper we initiate the study of higher Chow cycles on holomorphic symplectic manifolds. Our concrete central result is construction of explicit indecomposable (2,1)- and (4,1)-cycles on the Fano varieties of lines on cyclic cubic fourfolds. This is the first explicit example of such cycles on holomorphic symplectic manifolds. The proof of indecomposability is done by degeneration to cuspidal cubic fourfolds. Along the way, we develop a method of inducing (p,1)-cycles on Hilbert squares of K3 surfaces. Finally, we study restriction of (2,1)-cycles to Lagrangian subvarieties, and observe the phenomenon that the restricted cycles are always decomposable in the examples in our hand.
Read the full abstract

Category Theory

Frobenius quotients, inflation categories and weighted projective lines

We propose the notion of Frobenius quotients between Frobenius exact categories. It turns out that any Frobenius quotient induces Frobenius quotients between the corresponding inflation categories. We obtain an explicit Frobenius quotient from the category of vector bundles on weighted projective lines with three weights to a certain category consisting of monomorphism grids.
Read the full abstract