Numerical Analysis
Galerkin Approximation of the Fractional Sobolev Constant
Andreea Dima and Liviu I. Ignat
We establish sharp estimates for the discrete optimal constant of the fractional Sobolev inequality in dimension $N\geq 1$, with fractional exponent $s\in (0,\min\{1,N/2\})$. The convergence rates that we establish take place for the Galerkin approximation with piecewise linear elements, when the problem is posed in the unit ball, for which we employ a quasi-uniform and regular mesh. Since the infimum defining the fractional Sobolev constant is not attained on bounded domains, these estimates quantify how far a piecewise affine mesh of size $h$ can resolve the concentration of the optimizers: the discrete minimizers are close to bubbles concentrated at the scale $h^{2(2-s)/(N+4(1-s))}$, and the energy gap is exactly of order $h^{2(2-s)(N-2s)/(N+4(1-s))}$.
Read the full abstract ▾
Numerical Analysis · Cross-listed from cs.GR
A Neural Hierarchical-Matrix Preconditioner for Real-Time GPU Solves
Carl Osborne, Minghao Guo, Crystal Owens et al. (+1 more)
Interactive simulation solves Ax=b for a sparse SPD A that changes every frame, inside an 8-16 ms budget. At a few thousand unknowns, the setup of algebraic multigrid alone exceeds that budget, while Jacobi and other local preconditioners have no setup but cannot move error across the domain. We learn a preconditioner for this gap: a graph-and-
attention network predicts an SPD approximate inverse in H^2-
matrix format. On a spatially ordered 3D mesh, blocks of the true inverse lose rank as the clusters they couple move apart; the nested bases of the format follow that decay, so inference and apply are dominated by leaf-block work linear in N, where a dense inverse costs N^2. Our main finding concerns training. Probe losses reach M only through a product with A, so their gradient vanishes on the near-null modes that set the conjugate-gradient iteration count. A truncated Kaporin condition number has no such factor; changing only the objective cuts iterations on a held-out frame from 116 to 33. On a ladder of stiff tetrahedral
diffusion problems ours alone fits an 8.3 ms (120 fps) frame from N=572 to 3,647.
Read the full abstract ▾
All authors Carl Osborne, Minghao Guo, Crystal Owens, Wojciech Matusik
Dynamical Systems
Ergodic Optimization and Ground States: a brief Introduction
Artur O. Lopes
Our goal in this short note is to briefly and succinctly describe some basic concepts and properties of Ergodic Optimization for readers unfamiliar with the subject. We avoid technical issues in order to provide a global overview of this topic. We will not attempt to cover all of the many contributions of various authors, who have greatly enriched the theory with invaluable results. The author has made a personal selection of the topics to be addressed, keeping in mind two main objectives: to motivate the reasons for studying the subject, and to describe schematically and pictorially its relationship with relevant concepts and properties of Statistical Mechanics, which is one of the sources of inspiration for the theory. We will not present new results or detailed proofs. Some examples will be provided. We describe some procedures that may help in obtaining explicit solutions. We present some references that by no means aim to exhaust the bibliography on the subject, where possible, minimizing the number of references.
Read the full abstract ▾
Information Theory
Blind Recognition of Polar Codes Using Successive Cancellation List Decoding
Changwei Tu, Yang Liu, Xianzhao Feng et al. (+1 more)
Blind recognition of polar codes remains challenging in non-cooperative scenarios, particularly for information-set recognition with known code length. Existing methods mainly rely on threshold decisions determined by the generator-
matrix structure and channel bit error probability, without fully exploiting the soft information in received signals. In this letter, we propose a blind recognition method using successive cancellation list (SCL) decoding for polar codes with known code length. The proposed method exploits the distinct statistical behaviors of frozen and information bits in source-side decision log-likelihood ratios (LLRs) over multiple received vectors: frozen bits tend to favor zero decisions, whereas information bits exhibit nearly equiprobable $0/1$ decisions. Based on this property, the decoder expands candidate paths under the frozen-bit and information-bit hypotheses at each bit position, evaluates their reliabilities using the corresponding average path metrics, and retains only the $L_{\mathrm{list}}$ most reliable paths for subsequent recognition. Finally, the information-set pattern corresponding to the most reliable surviving path is selected as the recognition result. Simulation results show that the proposed scheme improves the recognition success rate as the list size increases. For the $(32,16)$, $(64,32)$, and $(128,64)$ polar codes, it achieves at least $2.5$ dB gain over the previous method when $L_{\mathrm{list}}=64$.
Read the full abstract ▾
All authors Changwei Tu, Yang Liu, Xianzhao Feng, Kai Niu
Optimization and Control
TRUST-TAEA: A trustworthiness-guided two-archive evolutionary algorithm with variable-grouping sparse search for large-scale multi-objective optimization
Junyi Cui, Chao Min, Stanisław Migórski et al. (+2 more)
Large-scale multi-objective optimization problems (LSMOPs) remain challenging due to the high-dimensional decision spaces, complex variable interactions, and limited function evaluation budgets, which make it difficult to balance the convergence, diversity, and stability. Existing two-archive evolutionary
algorithms can alleviate the conflict between convergence and diversity, but they often underuse archive reliability and problem-structure information, leading to inefficient search, incomplete front coverage, and late-stage archive drift. To address these issues, this paper proposes TRUST-TAEA, a trustworthiness-guided two-archive evolutionary
algorithm. Archive trustworthiness is defined by integrating evolutionary progress with convergence-archive maturity, and is used to coordinate variable-grouping sparse search, anchor-probing compensatory search, and archive stabilization. TRUST-TAEA is evaluated on the LSMOP
benchmark suite with 500–5000 decision variables and 2, 3-objectives. Experimental results show that TRUST-TAEA achieves superior and highly competitive performance in terms of convergence, diversity, and stability. A three-objective day-ahead scheduling case of a grid-connected microgrid further demonstrates its practical applicability, where TRUST-TAEA obtains the best IGD$^+$ value and generates a feasible dispatch strategy balancing cost, emissions, and grid-power fluctuation.
Read the full abstract ▾
All authors Junyi Cui, Chao Min, Stanisław Migórski, Binrong Wang, Yonglan Xie
Group Theory
Quasiisometric embeddings between right-angled Artin groups: flexibility
Shaked Bader, Oussama Bensaid and Harry Petyt
We give a complete characterisation of when the right-angled Artin group on one cycle graph can be quasiisometrically embedded in the right-angled Artin group on another cycle graph. In particular, we find infinitely many instances of quasiisometric
embeddings where there is no subgroup relation. This contrasts with the fact that such groups are quasiisometrically rigid. More generally, we construct quasiisometric
embeddings between graph products of finite or cyclic groups whose underlying graphs are cycles. As a special case, we obtain exotic quasiisometric
embeddings of the
hyperbolic plane in all right-angled Artin groups whose defining graph contains an induced cycle of length greater than four.
Read the full abstract ▾
Mathematical Physics
A Guide to Applications of $k$-Contact Geometry in Dissipative Field Equations
J. de Lucas, J. Lange and M. Krych
We study the practical scope of the $k$-contact Hamilton–De Donder–Weyl formalism as a
geometric framework for dissipative field equations. In particular, our work focuses on canonical $k$-contact
manifolds on $\bigoplus^k {\rm T}^*Q\times\mathbb{R}^k$ and $k$-contactifications of exact $k$-
symplectic phase spaces. A special two-contactification of exact two-
symplectic structures on cotangent bundles is defined and analysed. We also develop several tools for applications, including splitting results for the Hamilton–De Donder–Weyl equations on $k$-contactifications, regularity conditions for such spaces, criteria for the ultrahyperbolicity, hyperbolicity, or ellipticity of PDEs associated with
Hamiltonian $k$-contact systems, dissipation laws associated with infinitesimal dynamical
symmetries, relevance and applications of quadratic dissipative terms in the
Hamiltonian, etc. Our methods yield explicit
Hamiltonian descriptions for several nonlinear nonconservative PDEs with
polynomial dissipative terms, including damped Klein–Gordon, Allen–Cahn, generalized Burgers, porous medium equations with linear absorption, complex Ginzburg–Landau, damped nonlinear Schrödinger, Fisher–KPP, damped $\phi^4$, damped sine–Gordon, and FitzHugh–Nagumo equations, and many others. Our work also stresses the many further practical applications of this framework.
Read the full abstract ▾
Dynamical Systems · Cross-listed from cs.LG
MPINeuralODE: Multiple-Initial-Condition Physics-Informed Neural ODEs for Globally Consistent Dynamical System Learning
Lake Yang, Antonio Malpica-Morales, Frank Ioannis Papadakis Wood et al. (+1 more)
Neural ordinary differential equations (Neural ODEs) often fit training trajectories while generalizing poorly to unseen initial conditions and long horizons. We propose MPINeuralODE, which combines a soft physics-informed residual with a Multiple-Initial-Condition (MIC) multiple-shooting curriculum whose ingredients are structurally complementary: the physics term anchors the vector-field magnitude on the support that MIC enlarges. We evaluate along three axes: out-of-sample error, long-horizon stability, and
Hamiltonian drift, which together expose whether the learned dynamics recover the underlying vector field. On Lotka-Volterra, MPINeuralODE achieves the lowest out-of-sample and long-horizon MSE among data-driven methods, with a 24% reduction over the baseline Neural ODE, while essentially matching the PINN ablation on
Hamiltonian drift.
Read the full abstract ▾
All authors Lake Yang, Antonio Malpica-Morales, Frank Ioannis Papadakis Wood, Serafim Kalliadasis
Combinatorics
Double shortcuts of standard hypercube decompositions
Margherita Zannoni
In this paper, we study the double shortcuts associated with pairs of standard hypercube decompositions of arbitrary Bruhat intervals in the symmetric group. Our results imply that a
conjecture stated in [Bull. London Math. Soc., 57 (2025), no. 8] holds for the class of standard hypercube decompositions. If this
conjecture were to hold for all hypercube decompositions, then the Combinatorial Invariance
Conjecture for Kazhdan–Lusztig
polynomials would follow.
Read the full abstract ▾
Algebraic Geometry
Tautological modular forms of level two and degree two
Fabien Cléry and Gerard van der Geer
We show how to use divisors on the projectivized Hodge bundle to construct special vector-valued modular forms and then apply invariant theory to construct all vector-valued Siegel modular forms of level two and degree two. Thus we construct all modular forms in terms of certain basic modular forms that are intimately connected to the
moduli of curves of genus two.
Read the full abstract ▾
Geometric Topology
Twisted Alexander vanishing groups of knots
Katsumi Ishikawa, Takayuki Morifuji and Masaaki Suzuki
In our previous work, we introduced the notion of a twisted Alexander vanishing (TAV) group, defined as a finite group for which the corresponding twisted Alexander
polynomial of a
knot vanishes. In this paper, we discuss the orders of TAV groups and construct
knots whose twisted Alexander
polynomials vanish. Moreover, we show that every faithful irreducible representation of a TAV group causes the twisted Alexander
polynomial to be zero.
Read the full abstract ▾
Geometric Topology
Twisted Alexander polynomials of a knot for group extensions
Katsumi Ishikawa, Takayuki Morifuji and Masaaki Suzuki
In this paper, we discuss twisted Alexander
polynomials of a
knot for group extensions of a finite group in two directions. Firstly, we provide a mod $p$ formula for the twisted Alexander
polynomial of a
knot in the $3$-sphere associated with the regular representation of a finite group. Secondly, we consider twisted Alexander
polynomials of a
knot for a series of central extensions of a finite group. Moreover, we apply these formulas for twisted Alexander
polynomials to the study of twisted Alexander vanishing groups and orders for non-fibered
knots.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.LG
Delightful Exploration
Ian Osband
Most exploration
algorithms search broadly until uncertainty is resolved. When the action space is too large to resolve within budget, practitioners default to $\varepsilon$-greedy, which bounds disruption but spends its override blindly. We introduce Delight-gated exploration (DE), a host–override rule that spends exploratory actions only when their prospective delight (expected improvement times surprisal) exceeds a gate price. This practical heuristic recovers a classical result: Pandora's reservation-value rule for costly search, with surprisal setting the effective inspection cost. Resolved arms exit the gate, fresh arms shut off above a prior-determined threshold, and selected linear-bandit overrides consume finite information budget. Across Bernoulli bandits, linear bandits, and tabular MDPs, the same hyperparameters transfer without retuning, and DE shows much weaker regret growth than Thompson Sampling and $\varepsilon$-greedy in the tested unresolved regimes. Delight improves acting for the same reason it improves learning: it prices scarce resources by the product of upside and surprisal.
Read the full abstract ▾
Analysis of PDEs
Forward and inverse problems for a time-fractional pseudo-parabolic equation with variable coefficients
Ravshan Ashurov and Elbek Husanov
In this work, forward and inverse problems for a time-fractional pseudo-
parabolic equation $D_t^{\rho} [u(t) + \mu Au(t)] + \sigma(t) Au(t) = r(t)g$ are investigated in a
Hilbert space, where $A$ is an unbounded, positive, self-adjoint operator. According to the known papers, the forward problem has been studied only in the case $\sigma(t) = const$. The main novelty of the forward problem in this work is that the model is further generalized and investigated for a time-dependent coefficient $\sigma(t)$. To determine the solution of the forward problem, the
Fourier method is employed, and the global existence and uniqueness of the solution are proved. Moreover, when the operator $A$ is a second-order differential operator, a numerical scheme and an efficient computational
algorithm are developed. The inverse problem of determining a time-dependent source function is considered under the overdetermination condition of the form $F[u(t)] = \Phi(t)$. The functional $F$ is taken in a general form, and such an inverse problem has not been considered before. The global existence of the solution to the inverse problem is proved by applying Schauder's fixed point
theorem, and its uniqueness is established. Furthermore, several examples related to the operator $A$ and the functional $F$ are provided.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ML
Learning Perturbations to Extrapolate Your LLM
Zetai Cen, Chenfei Gu, Jin Zhu et al. (+3 more)
Recent advancements in large
language models demonstrate that injecting perturbations can substantially enhance extrapolation performance. However, current approaches often rely on discrete perturbations with fixed designs, which limits their flexibility. In this work, we propose a framework where
token prefixes are perturbed by a learnable transformation of a continuous latent vector within an
embedding space. To overcome the challenge of an intractable marginal likelihood, we derive unbiased estimating equations for model parameters and optimize them via
stochastic gradient descent. We establish the statistical properties of the resulting
estimator in over-parameterized regimes. Empirical evaluations on both synthetic and real-world
datasets demonstrate that our proposal yields significant gains in out-of-domain settings over a range of state-of-the-art baseline methods.
Read the full abstract ▾
All authors Zetai Cen, Chenfei Gu, Jin Zhu, Ting Li, Yunxiao Chen, Chengchun Shi
Statistics Theory · Cross-listed from cs.LG
Byzantine-Robust Distributed Sparse Learning Revisited
Yuxuan Wang, Lixin Zhang and Kangqiang Li
We revisit Byzantine robust distributed estimation for high-dimensional sparse linear models. By combining local $\ell_1$-regularized robust estimation with robust aggregation at the server, the framework applies to pseudo-Huber regression,
quantile regression, and sparse SVM. We show that the resulting
estimators yield non-asymptotic guarantees and attain near-optimal statistical rates under mild conditions, while remaining communication-efficient. Simulations confirm strong robustness in estimation, support recovery and classification accuracy under various Byzantine attacks.
Read the full abstract ▾
Optimization and Control
Proximal-Based Generative Modeling for Bayesian Inverse Problems
Boyang Zhang, Zhiguo Wang and Ya-Feng Liu
Score-based
diffusion models demonstrate superior performance in generative tasks but encounter fundamental bottlenecks in inverse problems due to the analytical intractability of the time-dependent likelihood score. To bridge this gap, we propose a novel proximal-based generative modeling (PGM) framework that rigorously circumvents explicit likelihood evaluation. Our framework is built upon a theoretical equivalence between Gaussian convolution in
diffusion processes and Moreau-Yosida regularization in nonsmooth optimization. This enables a new sampling mechanism driven by the proposed Moreau score, which admits a closed-form expression via proximal operators. Moreover, we introduce Moreau score matching to learn the proximal operators that rely solely on samples drawn from the prior distribution. Theoretically, PGM eliminates the early-stopping bias inherent in the score-based
diffusion model and achieves non-asymptotic convergence. Experiments demonstrate that PGM significantly surpasses state-of-the-art methods in reconstruction quality and sampling time.
Read the full abstract ▾
Dynamical Systems
Continuity properties of partial entropy
Gang Liao, Huirong Tao, Yao Tong et al. (+1 more)
We establish a general criterion on the upper semi-continuity of partial
entropy in all directions for $C^{1+\alpha}$ diffeomorphisms: it holds when the respective sums of Lyapunov exponents are continuous. This addresses, in arbitrary dimensions, the converse aspect of the entropic continuity of the Lyapunov exponents established by Buzzi, Crovisier, and Sarig. Consequently, the
entropy (and all the partial
entropies) is always upper semi-continuous at generic ergodic measures of every $C^{1+\alpha}$ diffeomorphism, which extends the $C^{\infty}$ result of Newhouse. Numerous applications and examples are provided, including topics related to measures with dominated splittings, SRB measures, average expanding diffeomorphisms, singular flows, standard maps, and symbolic codings for diffeomorphisms.
Read the full abstract ▾
All authors Gang Liao, Huirong Tao, Yao Tong, Jiagang Yang
Numerical Analysis
Robust approximation error estimates for analysis-suitable $G^1$ isogeometric multi-patch discretizations
Fatima Hasanova, Stefan Takacs and Thomas Takacs
We prove $p$-robust approximation error estimates for $H^2$-conforming isogeometric discretizations over planar multi-patch domains. Possible applications are fourth order boundary value problems, like the biharmonic equation or Kirchhoff-Love plates. Using Isogeometric Analysis, such conforming discretizations can be constructed effortlessly for the single-patch case. In order to obtain a globally $H^2$-conforming discretization in the multi-patch case, the functions must be $C^1$-smooth across the interfaces between the patches. To obtain optimal approximation properties, those $C^1$-smooth spaces must also reproduce splines of sufficiently high degree for traces and transversal derivatives at all patch interfaces. Such constructions are based on some assumptions on the geometry. We restrict ourselves to the class of analysis-suitable $G^1$ (AS-$G^1$) multi-patch domains, which is the subset of $C^0$-matching multi-patch domains that allows the definition of spline spaces that yield the necessary reproduction properties without the need to locally increase the degree. While approximation error estimates have been established for single-patch and $C^0$ isogeometric multi-patch spaces, corresponding results for the $C^1$ multi-patch setting have been missing. The resulting bounds on the approximation error depend on the geometry parameterization and on the Sobolev regularity of the target function, but are independent of the spline degree $p$.
Read the full abstract ▾
Analysis of PDEs · Cross-listed from cs.LG
Unified generalization analysis for physics informed neural networks
Yuka Hashimoto and Tomoharu Iwata
Physics-Informed Neural Networks (PINNs) and their variational counterparts (VPINNs) are neural networks that incorporate physical laws, making them useful for scientific problems. Existing generalization analyses for PINNs and VPINNs remain limited, often requiring restrictive assumptions such as stability conditions or linear ellipticity. In this paper, we derive generalization bounds for neural networks that involve differentiation with respect to input variables, covering PINNs and VPINNs under a unified framework. We apply Taylor expansion to represent nonlinear differential operators as linear operators on a high-dimensional space, enabling the use of Koopman-based analysis and showing that high-rank networks can generalize well even in settings involving differential operators. We also show that the nonlinearity of the differential operator exponentially enlarges the bound, highlighting its significant impact on generalization.
Read the full abstract ▾
Mathematical Physics · Cross-listed from cond-mat.mtrl-sci
Minimum energy paths for defect annihilation in finite dodecagonal quasicrystal clusters
Tiejun Zhou, Rong Liu, Gang Cui et al. (+3 more)
Defect repair in quasicrystals involves local structural rearrangements on a complex potential energy landscape. Here, we combine the string method with the spring pair method to compute a minimum energy path connecting a locally defective finite dodecagonal quasicrystal cluster to a locally repaired reference configuration in the Lennard-Jones–Gauss particle model. The computed path contains seven local minima connected through six transition states. A detailed analysis of one defective region resolves three successive stages: a phason flip, aggregation of neighboring shield-like defects, and decomposition of the aggregated motif. The phason flip restores the local outer-ring structure and relocates a shield-like defect into the interior. Subsequent collective rearrangements remove the defective motifs and yield a net decrease in the local interaction-energy measure together with an increase in local bond-orientational order. These results provide a microscopic description of a specific defect-repair pathway on the potential energy surface of a finite dodecagonal quasicrystal cluster.
Read the full abstract ▾
All authors Tiejun Zhou, Rong Liu, Gang Cui, Xianbo Huang, Li Peng, Kai Jiang
Statistics Theory · Cross-listed from stat.ML
The Sample Complexity of Multiple Change Point Identification under Bandit Feedback
Maximilian Graf and Victor Thuot
We study multiple change point localization under bandit feedback. An unknown piecewise-constant function on a compact interval can be queried sequentially at adaptively chosen inputs, and each query returns a noisy evaluation of the function. The goal is to identify a prescribed number of discontinuities, known as change points, within a target precision $\eta$ and confidence level $1-\delta$, while using as few samples as possible. We propose an adaptive
algorithm that first detects intervals likely to contain change points and then refines their locations to precision $\eta$. We establish non-asymptotic upper bounds on its sample budget, together with corresponding lower bounds. Prior work shows that jump magnitudes alone determine the asymptotic sample complexity as $\delta\to 0$. We reveal that this picture is incomplete beyond this regime. We demonstrate, both empirically and theoretically, that for general $\delta$ and $\eta$, the complexity is jointly governed by the jumps and the relative positions of the change points.
Read the full abstract ▾
Functional Analysis
On weak convergence in Köthe-Bochner function spaces
José Rodríguez
Let $E$ be an order continuous Köthe function space over a non purely atomic probability measure $\mu$ and let $X$ be a
Banach space, with topological duals $E^*$ and $X^*$, respectively. Let $E(X)$ and $E^*(X^*)$ be the corresponding Köthe-Bochner function spaces and consider $E^*(X^*)$ as a subspace of $E(X)^*$. We prove that if $X^*$ fails the Radon-Nikodým property, then there is a bounded, non weakly null sequence $(f_n)$ in $E(X)$ such that $\langle \varphi,f_n\rangle \to 0$ for every $\varphi\in E^*(X^*)$; in particular, the closed unit ball of $E^*(X^*)$ is not a James boundary for $E(X)$. This extends a result by B. Cascales and A.J. Pallarés [Collect. Math. 45 (1994), 263–270] on the case $E=L_1(\mu)$ and allows us to answer a question posed recently by S. Dwivedi [Rev. Real Acad. Cienc. Exactas Fis. Nat. Ser. A-Mat. RACSAM 120 (2026), 71].
Read the full abstract ▾
Algebraic Topology
Stable Cohomotopy in Codimensions Two and Three: From Algebraic Characterizations to Bordism-Theoretic Interpretations
Pengcheng Li, Jianzhong Pan and Jie Wu
This paper investigates stable cohomotopy groups in codimensions two and three from complementary algebraic and
geometric viewpoints. For general CW complexes, we give a complete characterization of stable cohomotopy in codimension two and a characterization in codimension three up to a $3$-primary parameter. Geometrically, we provide bordism-theoretic interpretations of these stable cohomotopy groups for oriented
manifolds in codimension two and string
manifolds in codimension three. As an application, we derive necessary and sufficient conditions for the existence of nowhere-vanishing sections of vector bundles, extending the foundational codimension-one results of Konstantis.
Read the full abstract ▾
Differential Geometry
Geometries with parallel, skew-symmetric and closed torsion
Andrei Moroianu and Paul Schwahn
We study Riemannian
manifolds carrying a metric connection with parallel, skew-symmetric and closed torsion, which we call in short PSCT
manifolds. We prove that PSCT
manifolds always locally split into a product of well-understood factors, allowing a complete local classification. Further, we investigate various $G$-structures of PSCT type, with a focus on almost Hermitian structures and their possible Gray–Hervella classes.
Read the full abstract ▾
Optimization and Control
Voltage-Aware Grid Aggregation: Expanding the European High-Voltage Network
Benjamin Stöckl, Marco Anarmo, Sonja Wogrin et al. (+1 more)
Energy system optimization models are indispensable for planning the European energy transition. Yet their applicability is constrained by the fundamental trade-off between spatial detail and computational tractability. Modelers often tackle this by spatially aggregating electricity networks. Existing methods, however, neglect differences in voltage levels, reducing them to a single level and thereby overlooking the critical role of
transformers in expansion planning. Therefore, we propose a novel voltage-aware network partitioning and aggregation methodology that preserves individual voltage levels and
transformers. We demonstrate the effectiveness of this approach and compare it against a voltage-unaware grid aggregation by solving a network expansion problem for a European case study using PyPSA. Our findings show that the proposed methodology preserves up to 70% of the
transformer expansion costs in the aggregated model compared to the full grid model, thereby significantly improving the accuracy of investment decisions for
transformers in the aggregated grid.
Read the full abstract ▾
All authors Benjamin Stöckl, Marco Anarmo, Sonja Wogrin, Yannick Werner
Optimization and Control
Stochastic Riccati equations with jumps for indefinite linear-quadratic control: A stochastic value-flow approach
Kai Ding, Jiaqiang Wen, Jie Xiong et al. (+1 more)
This paper studies the nonlinear
matrix-valued
stochastic Riccati equation with jumps (SRE-J) arising from indefinite
stochastic linear-quadratic optimal control problems with random coefficients and Poisson jumps. We demonstrate that the presence of jumps may cause the
matrix-valued optimal state process $\mathbf{X}$ to become singular, even under the standard condition. Consequently, the classical representation $P=\mathbf{Y}\mathbf{X}^{-1}$ used in the
diffusion case is generally unavailable. To overcome this difficulty, we construct the Riccati process directly from the
stochastic value flow under the uniform convexity condition on the cost functional, an approach that requires no invertibility condition on the jump coefficient. We then prove that the SRE-J admits a maximal strongly regular solution, which yields a closed-loop representation of the unique open-loop optimal control. Furthermore, we establish verifiable sufficient conditions for uniform convexity and provide examples of indefinite
stochastic linear-quadratic problems with jumps.
Read the full abstract ▾
All authors Kai Ding, Jiaqiang Wen, Jie Xiong, Xin Zhang
Information Theory
Decoding Product Codes and Staircase Codes with Iteration-Independent Weighting Coefficients
Andreas Straßhofer
This paper presents an improved FEC decoder design outperforming Chase-Pyndiah decoding of product codes by $0.23$ dB. To achieve this, the decoder does not require iteration-dependent coefficients, making it implementation-friendly for sliding-window decoding of staircase codes.
Combinatorics
Size and spectral conditions for a graph with given minimum degree to be $k$-$d$-critical
Zhenhao Zhang, Xiaogang Liu and Ligong Wang
A $k$-matching in a graph $G$ is defined as a function $f:E(G) \rightarrow \{0,1,\ldots,k\}$ satisfying $\sum_{e\in E_G(v)} f(e)$ $\leq k$ for each vertex $v\in V(G)$, where $E_G(v)$ denotes the set of edges incident to $v$ in $G$. For $1\leq d\leq k$ and $d \equiv |V(G)|~(\mathrm{mod}~2)$, if for any $ v \in V(G)$, there exists a $k$-matching $f$ such that $\sum_{e\in E_G(v)}f(e)=k-d$ and $\sum_{e\in E_G(u)}f(e)=k \text{ for any } u\in V(G)-\{v\}$, then $G$ is $k$-$d$-critical. A graph $G$ of odd order (resp. even order) is generalized factor-critical (resp. generalized bicritical) if the empty set is the unique set attaining the maximum value in $k$-Berge-Tutte-formula of $G$. In this paper, we provide sharp sufficient conditions in terms of size or spectral radius respectively for a graph $G$ to be $k$-$d$-critical, generalized factor-critical and generalized bicritical with minimum degree.
Read the full abstract ▾
Analysis of PDEs
Nesterov acceleration for the Wasserstein minimization of displacement-convex free energies
Pierre Monmarché
We show that the mean-field underdamped Langevin process (associated to the non-linear Vlasov-Fokker-Planck equation) achieves a Nesterov acceleration with respect to the Wasserstein gradient flow of a displacement-convex free energy, in the sense that it converges at a rate of order given by the square-root of the Polyak-Łojasiewicz constant of the free energy (which is the optimal convergence rate for the corresponding gradient flow). This result has been made possible by the recent breakthrough [42] by Jianfeng Lu, which establishes such a diffusive-to-ballistic improvement in term of
entropy in the linear case.
Read the full abstract ▾