Optimization and Control
Route Based Map Matching via a Structured Codebook and Token Sequence Decoding
Takara Sakai and Hiroyuki Hasada
This study proposes an efficient and computationally light route based map matching method for GPS track data on urban expressway networks. The key idea is to exploit a symbolic structure of named lines and named junctions that link level map matching leaves unused. We represent each candidate route as a sequence of line and junction names, take the set of such sequences as a route codebook, and formulate map matching as scored
alignment of a probe trajectory against members of the codebook. Probes become
token sequences via a mesh quantizer, a precomputed grid mapping each coordinate to a line or junction
token, and the decoder returns a member of the codebook by construction. The codebook is indexed by a DAFSA $\times$ Levenshtein automaton, a fuzzy lookup technique from approximate string matching and
speech recognition; the per query decoding cost is orders of magnitude lower than a brute force scan. We evaluate the method on a deformed replica of the Tokyo Metropolitan Expressway
topology. The method recovers the exact route at moderate GPS noise and continues to identify the line and junction sequence under heavy noise; a sensitivity analysis maps the mesh resolution operating range. Real probe evaluation, channel model calibration, and a head to head HMM comparison are left to a forthcoming version.
Read the full abstract ▾
Rings and Algebras
Study of Rota-Baxter Operators in Matrix $C^*$-Algebras Motivated by Toeplitz Structures, and Applications to Sliding Mode Control
Marwa Ennaceur
This paper studies Rota-Baxter operators on the
matrix $C^*$-
algebra $M_n(\mathbb{C})$, motivated by the discrete Toeplitz
algebra (whose role is purely heuristic; see Remark~\ref{rem:toeplitz_scope}). We provide a structural classification of such operators compatible with the $C^*$-norm, analyze their induced Lie brackets, and apply them to deform system
matrices in discrete-time delayed systems under sliding mode control. Lyapunov-based Bilinear
Matrix Inequality conditions, together with a tractable linear reformulation via $Q=X^{-1}$, guarantee asymptotic stability on the sliding
manifold and $\mathcal{L}_2$-gain stability. The effective gain from uncertainty $\delta$ to state $x$ is $\gamma/\sqrt{\mu}$ with $\mu=\lambda_{\min}(-\mathcal{M})>0$ determined a posteriori; minimizing $\gamma$ alone does not minimize this bound, which holds under zero extended initial conditions ($V_0=0$). We work under the standing assumption $m=n$ (square actuation); a supplementary non-degenerate example with $m=1$, $n=2$ illustrates LMI feasibility with $\Pi\neq0$. All algebraic results are proved directly in $M_n(\mathbb{C})$; no infinite-dimensional reduction is used.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.CE
Scenario-driven optimization of passive vehicle suspensions: explaining the effectiveness of asymmetric damping
José Geraldo Telles Ribeiro and Americo Cunha Jr
Asymmetric damping is widely used in passive vehicle suspensions, with rebound damping often recommended to exceed compression damping by a factor of two to three. Despite its prevalence, this guideline remains largely empirical and lacks a systematic derivation based on vehicle dynamics and excitation conditions. This paper presents a scenario-driven optimization framework that provides a principled explanation for the effectiveness of asymmetric damping. A minimal quarter-car model is employed to isolate the key mechanisms governing the trade-off between ride comfort, road holding, and transient response, using standardized ISO~8608 road excitations. Rebound and compression damping ratios are treated as independent design variables, and optimal configurations are identified via a
stochastic Cross-
Entropy algorithm applied to a non-convex, simulation-based objective function. Performance is assessed through ISO~2631 weighted RMS acceleration, tire–ground contact force variability, and settling time. The results show that symmetric damping is often sufficient under moderate excitation, whereas asymmetric damping becomes necessary under severe conditions, with commonly cited rebound-to-compression ratios emerging as scenario-dependent near-optimal solutions rather than universal constants.
Read the full abstract ▾
Mathematical Physics
Quantum Dynamics: A Dilation-Based Approach
Caleb A. Mickelson
In the study of open
quantum systems, one commonly describes the
evolution of a system of interest through reduced dynamics, obtained by treating the environment indirectly rather than as a part of the full model. This thesis presents an expository account of an alternative, dilation-based viewpoint in the finite-dimensional setting, where a family of reduced dynamics is represented through
unitary evolution on a larger system consisting of the original system together with an ancillary environment. After reviewing the reduced-dynamics perspective and the
language of
quantum channels, we formulate finite-dimensional
quantum dynamics as channel-valued dynamical curves and use this framework to discuss Stinespring dilations of such curves. We then present exact dilation results for analytic dynamical curves, explain the singular behavior that can arise at t=0, and describe approximation results showing that Lipschitz-continuous dynamical curves admit approximate finite-dimensional Stinespring dilations. The thesis therefore provides a mathematically focused introduction to dilation-based modeling of
quantum dynamics and argues that a change of perspective can lead to new ways of formulating problems in the theory of open
quantum systems.
Read the full abstract ▾
Probability · Cross-listed from cs.LG
A Review of the Receiver Operating Characteristic Curve and a Proof About the Area Beneath It
Steven Redolfi
The Receiver Operating Characteristic (ROC) curve of a binary classifier has often been utilized to measure the performance of the classifier. The area beneath this curve is used in particular because of its quoted probabilistic interpretation as being equal to the probability that the classifier will rank a random positive observation above a random negative observation. This paper formalizes this claim, produces a bound on how far away from the truth it is if a hypothesis is not met, and gives a small literature review of the ROC curve.
Read the full abstract ▾
Numerical Analysis
Exploring physics-dynamics coupling using moist shallow water equations
Nell Hartney, Thomas M. Bendall and Jemma Shipton
One of the key choices for numerical models of geophysical fluids is how parametrisations of physical processes interact with the numerical methods that handle the resolved flow, known in the atmospheric community as the dynamical core. As both the dynamical core and parametrisations of physics processes continue to evolve and improve, the issue of physics-dynamics coupling - how these two different parts of the model interact - becomes ever more important. In this paper we use two variations of the moist shallow water equations to develop a simplified framework that can be used to investigate some of the questions associated with physics-dynamics coupling. The shallow water equations act as a simplified dynamical core that is computationally cheap but still retains pertinent features of the atmosphere, and the introduction of moisture means the addition to the model of a physical parametrisation. This study uses 'split-physics' moist thermal shallow water equations which couple moisture to the shallow water equations via a parametrisation, and also develops a new 'integrated-physics' formulation of the moist thermal shallow water equations which re-formulates the model so that all the moist processes are captured in the dynamics. This integrated-physics model thus requires no physics-dynamics coupling and acts as a ground-truth to compare coupling strategies in the split-physics formulation against. We use both models to examine the effect of varying the approach to how physics is coupled to the dynamics in the semi-implicit quasi-Newton timestepping scheme. The results demonstrate the usefulness of the integrated-physics moist shallow water equations and provide insights into how best to deal with physics in a model's timestep.
Read the full abstract ▾
Combinatorics
Visibility cliques, cubic containers, and dense orchard cores
Sohail Sarkar
The Big-Line-Big-Clique
Conjecture of Kara, Por and Wood asserts that, for every fixed $k$ and $\ell$, every sufficiently large finite planar point set contains either $k$ collinear points or $\ell$ pairwise visible points. We prove a quantitative form in two structured regimes and isolate the precise ambient obstruction to the full
conjecture. The main result is a deterministic cubic-container
theorem. If $A \subset \mathbb{R}^2$ has $n$ points, no $k$ collinear points, and all but $s$ points of $A$ lie on a real cubic, then the cubic-supported part of $A$ has a visible clique cover of size $O_k(s+1)$; in particular $V(A)$ contains a clique of size $\Omega_k(n/(s+1))$, unless the cubic is the excluded three-line case containing only $O_k(1)$ points. Combining this with the Green-Tao structure
theorem, we obtain that every $n$-point set with no $k$ collinear points and at most $Kn$ ordinary lines contains a visible clique of size $\Omega_{k,K}(n)$; more strongly, all but $O_K(1)$ points can be partitioned into $O_{k,K}(1)$ mutually visible sets. We also combine the cubic-container
theorem with the Elekes-Szabo
theorem on triple lines and cubic curves to prove the Big-Line-Big-Clique conclusion for point sets contained in any fixed irreducible algebraic curve. Finally, we prove a dense-orchard core lemma showing that the absence of a visible $K_\ell$ forces a positive-density subset in which every point lies on linearly many 3-rich lines, and we give a sharp one-blocker example showing why ambient blockers cannot be ignored.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.LG
Data Deletion Can Help in Adaptive RL
Param Budhraja, Aditya Gangrade, Alex Olshevsky et al. (+1 more)
Deploying reinforcement learning policies in the real world requires adapting to time-varying environments. We study this problem in the contextual Markov Decision Process (cMDP) framework, where a family of environments is indexed by a low-dimensional context unknown at test time. The standard approach decomposes the problem: train a so-called "universal policy" which assumes knowledge of the true context, then pair it with a context
estimator which approximates context using the observed trajectory. We identify a simple, counterintuitive trick that substantially improves the
estimator: randomly delete a fraction of the training buffer after each round. This works because data is collected across multiple rounds using progressively better policies, and older trajectories come from a different distribution than what the
estimator will face at deployment time; random deletion creates an implicit exponential decay on older data while preserving diversity without requiring any explicit identification of which samples are stale. This reduces robustness gap by 30% for MLPs and by 6% on average for recurrent networks. Strikingly, it allows a narrow MLP with 5x fewer parameters to outperform a wide MLP trained without deletion. To understand when and why deletion helps, we analyze regularized empirical risk minimization with a mismatch between the train distribution and the distribution at deployment; in this idealized setting, we prove that removing a single uniformly random training point decreases expected test loss in expectation under mild conditions. For ridge regression we make this quantitative: deletion helps when the regularization coefficient is moderate and the signal-to-noise ratio (SNR) is sufficiently low, and, crucially, this SNR threshold gives a direct measure of how large the distribution mismatch between training and deployment must be for deletion to be beneficial.
Read the full abstract ▾
All authors Param Budhraja, Aditya Gangrade, Alex Olshevsky, Venkatesh Saligrama
Algebraic Geometry
The logarithmic leaf complex and foliated d-semistability
Mauricio Corrêa, Pablo Perrella and Sebastián Velazquez
We study holomorphic foliations on normal crossings varieties arising as semistable degenerations. We do so by we exploring the notion of foliated d-semistability using the
language of logarithmic structures in the sense of Fontaine-Illusie. First, we identify both local and global obstructions to d-semistability. In order to analyze the existence of smoothings, we develop a logarithmic deformation theory of foliations and show that the corresponding
moduli functor admits a versal hull.
Read the full abstract ▾
Numerical Analysis · Cross-listed from cs.LG
A Dirac-Frenkel-Onsager principle: Instantaneous residual minimization with gauge momentum for nonlinear parametrizations of PDE solutions
Matteo Raviola and Benjamin Peherstorfer
Dirac-Frenkel instantaneous residual minimization evolves nonlinear parametrizations of PDE solutions in time, but ill-conditioning can render the parameter dynamics non-unique. We interpret this non-uniqueness as a gauge freedom: nullspace directions that leave the time derivative unchanged can be used to select better-conditioned parameter velocities. Building on Onsager's minimum-dissipation principle, we introduce a history variable – interpretable as momentum – and inject it only along the nullspace directions. The resulting Dirac-Frenkel-Onsager dynamics preserve instantaneous residual minimization, in contrast to standard regularization that can introduce bias, while promoting temporally smooth parameter evolutions. Examples demonstrate that the approach leads to increased robustness in singular and near-singular regimes.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.LG
High-Probability Convergence in Decentralized Stochastic Optimization with Gradient Tracking
Aleksandar Armacki, Haoyuan Cai and Ali H. Sayed
We study high-probability (HP) convergence guarantees in decentralized
stochastic optimization, where multiple
agents collaborate to jointly train a model over a network. Existing HP results in decentralized settings almost exclusively focus on the Decentralized
Stochastic Gradient Descent ($\mathtt{DSGD}$)
algorithm, which requires strong assumptions, such as bounded data heterogeneity, or strong convexity of each
agent's cost. This is contrary to the mean-squared error (MSE) results, where methods incorporating bias-correction techniques are known to converge under relaxed assumptions and achieve better practical performance. In this paper we provide the first step toward bridging the gap, by studying HP convergence of $\mathtt{DSGD}$ incorporating the gradient tracking technique, in the presence of noise satisfying a relaxed sub-Gaussian condition. We show that the resulting method, dubbed $\mathtt{GT-DSGD}$, achieves order-optimal HP convergence rates for both non-convex and Polyak-Łojasiewicz costs, of order $\mathcal{O}\Big(\frac{\log(1/\delta)}{\sqrt{nT}}\Big)$ and $\mathcal{O}\Big(\frac{\log(1/\delta)}{nT}\Big)$, respectively, where $n$ is the number of
agents, $T$ is the time horizon and $\delta \in (0,1)$ is the confidence parameter. Our results establish that $\mathtt{GT-DSGD}$ converges in the HP sense under the same conditions on the cost as in the MSE sense, while achieving comparable transient times. To the best of our knowledge, these are the first HP guarantees for decentralized optimization methods incorporating bias-correction. Numerical experiments on real and synthetic data verify our theoretical findings, underlining the superior performance of $\mathtt{GT-DSGD}$ and highlighting that the benefits of incorporating bias-correction are also maintained in the HP sense.
Read the full abstract ▾
Commutative Algebra
Elimination Templates in Macaulay2
Manav Batavia, Cheng Chen, Anna Natalie Chlopecki et al. (+4 more)
We introduce the package EliminationTemplates for the Macaulay2 computer
algebra system, which provides tools for constructing automatic solvers for families of zero-dimensional radical ideals depending on algebraically independent parameters. This article provides a self-contained description of how elimination templates are constructed for such families and their specialization properties. Additionally, we describe the main functionality and datatypes provided by our package, and illustrate its usage on several examples, including applications from computer
vision from which elimination templates originated.
Read the full abstract ▾
All authors Manav Batavia, Cheng Chen, Anna Natalie Chlopecki, Timothy Duff, William Huang, Aolong Li, Wanchun Shen
Logic
Uniformity of Consistency in Arithmetic and Gödel's Second Incompleteness Theorem: Ein Märchen
Harald Grobner
In much discussed work Artemov has recently argued that, for $\mathrm{PA}$, the consistency schema admits a form of uniform verification via selector-proofs, despite the unprovability of the corresponding uniform consistency sentence $\mathrm{Con}(\mathrm{PA})$. In this note, we show that this phenomenon extends to all sufficiently strong, uniformly reflexive arithmetizable theories, including $\mathrm{ZF}$ and many of their extensions: For such theories $T$, there exists a primitive recursive selector which, given a derivation code $d$, extracts a finite fragment $T_d\subseteq T$ containing the non-logical axioms occurring in $d$, uses a reflexivity proof of $\mathrm{Con}(T_d)$, and produces a $T$-proof that $d$ is not a derivation of $0=1$. As a dictum, one obtains a $T$-verification of the consistency of $T$ in a uniform way, despite the fact that it cannot be internalized as the single universal consistency sentence prohibited by Gödel's Second Incompleteness
Theorem. We further analyze this latter discrepancy and locate selector-proofs within the broader framework of provability and reflection.
Read the full abstract ▾
Geometric Topology
Smoothing of singular intersections of ellipsoids: pyramitoid
Enrique Artal Bartolo, Santiago López de Medrano and María Teresa Lozano Imízcoz
The goal of this work is to continue the study the smoothings of 3-dimensional
manifolds with singularities obtained as small covers of non simple right-angle Coxeter polyhedral orbifolds. They appear in the study of coaxial intersections of ellipsoids. In particular we introduce the concept of $n$-pyramitoid generalizing the $n$-pyramid.
Read the full abstract ▾
Information Theory
Joint Accuracy and Confidentiality in Semantic-Aware Secure Remote Reconstruction
Bowen Li and Nikolaos Pappas
In this paper, we consider remote reconstruction over wireless networks when simultaneous accuracy at the legitimate receiver and confidentiality against eavesdropping are required. These two objectives are often treated separately, even though they arise from the same update process and are marginals of a joint reconstruction event. This paper introduces confidential reconstruction accuracy (CRA), a metric to capture the joint event in which the legitimate receiver reconstructs correctly while the eavesdropper fails. Under randomized stationary policies, we develop a three-dimensional stationary analysis and derive closed-form expressions for the long-term average CRA and the optimal transmission probability. The results show that conventional marginal analysis can misidentify the optimal policy and misestimate the achievable simultaneous accuracy-confidentiality performance. They also reveal nontrivial behaviors: more frequent transmissions or better legitimate channels do not necessarily improve joint accurate and confidential reconstruction, and when the eavesdropping channel is strong, improving the legitimate channel alone may be insufficient. Finally, the framework induces the spatial safety boundary in a geofencing setting for secure remote reconstruction.
Read the full abstract ▾
Information Theory
Sequential Automorphism Ensemble Decoding with Early Stopping
Charles Pillet, Pascal Giard, Bassant Selim et al. (+1 more)
In this paper, a low-complexity approach for the
automorphism ensemble decoder (AED) using successive cancellation (SC) as constituent decoders is proposed. The approach sequentially activates sub-decoders and terminates the decoding process based on pre-optimized parameters, derived from the strong correlation observed between the decoding outcome and the SC path metric. An
algorithm is proposed to find a list of early termination thresholds that minimize average decoding complexity subject to a block-error rate (BLER) constraint. For various code parameters and a BLER below $10^{-3}$, simulation results show that average decoding complexity is reduced by a factor of at least $6 \times$, and up to $22 \times$, compared to the original AED complexity, with a negligible degradation in BLER.
Read the full abstract ▾
All authors Charles Pillet, Pascal Giard, Bassant Selim, François Leduc-Primeau
Information Theory · Cross-listed from eess.SP
The Resurrection of Spectrum Spreading for 6G and Beyond: From Sinusoids to Chirps
Hyeon Seok Rou, Giuseppe Thadeu Freitas de Abreu, Emil Björnson et al. (+2 more)
Orthogonal frequency-division multiplexing (OFDM) and its sinusoidal subcarriers have underpinned the 4G and 5G eras, delivering high spectral efficiency and resilience to multipath fading through an efficient multicarrier architecture. However, as future systems move toward doubly dispersive environments driven by high-mobility applications and migration to mmWave/sub-THz bands, the time-invariance assumption underlying OFDM becomes increasingly difficult to maintain, and Doppler-induced degradation becomes prominent. While enhancements such as
MIMO, advanced coding, and scheduling provide incremental remedies, they introduce additional overhead, because the sinusoidal subcarrier itself offers no inherent waveform-level robustness to Doppler impairments. Accordingly, two time-frequency spreading philosophies have emerged to improve Doppler resilience by distributing each symbol's energy across both dimensions of the time-frequency plane: (i) 2D isotropic spreading via the delay-Doppler (DD) domain, exemplified by the orthogonal time frequency space (OTFS) family, and (ii) sheared spreading via parameterizable chirps, exemplified by the affine frequency-division multiplexing (AFDM) family. In this article, we examine key considerations for future waveform design across these paradigms and argue that transitioning from the sinusoidal subcarriers of OFDM to the chirp-based subcarriers offers a viable design direction for improving Doppler robustness while retaining much of the mature OFDM infrastructure. This perspective also highlights the suitability of chirp-based waveforms for integrated sensing and communications (
ISAC) and their extensibility to emerging physical-layer techniques. Overall, we argue that the transition from sinusoids to chirps is a technically motivated, compelling evolutionary direction for future wireless physical layer design.
Read the full abstract ▾
All authors Hyeon Seok Rou, Giuseppe Thadeu Freitas de Abreu, Emil Björnson, Sunwoo Kim, Marios Kountouris