Analysis of PDEs
Lack of interior $L^q$ bounds for stable solutions to elliptic equations
Salvador Villegas
We consider stable solutions of semilinear
elliptic equations of the form $-\Delta u=f(u)$ in a bounded domain $\Omega\subset\mathbb{R}^N$. In a well-known paper \cite{cfrs}, Cabré, Figalli, Ros-Oton and Serra obtained interior estimates for the $W^{1,2}$-norm of $u$ in terms of the $L^1$-norm of $u$ and proved interior Hölder regularity for dimensions $N\leq 9$. All these results rely on the assumption that $f$ is nonnegative. We show that, for general nonlinearities $f\in C^\infty(\mathbb{R})$, it is impossible, in any dimension $N\geq 1$, to obtain an interior $L^q$ estimate in terms of the $L^p$-norm of $u$ whenever $1\leq p<q\leq \infty$.
Read the full abstract ▾
Information Theory
Pricing Innovation Under Latency Constraints: A Mean-Field Analysis of Coded Payload Delivery
Muriel Médard, Tarun Chitra, Moritz Grundei et al. (+1 more)
We study pricing mechanisms for low-latency payload delivery in settings where participant rewards depend on the time required to reconstruct a payload. In such environments, the decoding time distribution determines deadline-meeting probabilities and therefore bounds a participant's willingness to pay for additional delivery rate. Using a mean-field formulation, we derive price-rate bounds from simple
stochastic arrival models and instantiate them for (i) unsharded transmission and (ii) sharded delivery under three regimes: uncoded sharding, fixed-rate erasure coding, and rateless coding. These bounds yield a comparative characterization of how symbol usefulness translates into economic value under deadline-driven utilities. We further analyze a two-lane service consisting of a base lane and a Random Linear Network Coding (RLNC) fast lane. In this turbo decoding setting, a receiver combines shards arriving via both lanes to minimize time to decode. Under a fixed base-lane price-rate pair and an aggregate rate constraint, we derive a fast-lane pricing bound and show how even modest additional RLNC rate can generate measurable utility gains, depending on the base-lane propagation regime. The framework extends naturally to stepwise reward schedules with multiple deadlines, and we illustrate its applicability on representative scenarios motivated by blockchain message dissemination and latency-sensitive competition.
Read the full abstract ▾
All authors Muriel Médard, Tarun Chitra, Moritz Grundei, Sajida Zouarhi
Group Theory
From cut sets to cube complexes
Matthew Haulmark and Jason Fox Manning
In this paper, we obtain an action on a cube complex from an action on a path-connected topological space with a system of divisions. In the settings of
hyperbolic groups or relatively
hyperbolic groups with no peripheral splittings, our result provides an alternate route to Sageev's construction of a cube complex action from a collection of (relatively) quasiconvex subgroups of a (relatively)
hyperbolic group.
Read the full abstract ▾
Mathematical Physics · Cross-listed from cond-mat.stat-mech
Carolina Garcia, Lucía Perea Durán, Agnese Venezia et al. (+1 more)
A generalisation of Takens' delay-coordinate
embedding theorem to
stochastic systems, the
Stochastic Embedding Sufficiency
Theorem, is an inverse methodology enabling non-parametric recovery of both drift and
diffusion fields from scalar time series without prior assumptions about the governing physics. A blind protocol using only time series data is applied to nine domains: classical mechanics, statistical mechanics,
nuclear physics,
quantum mechanics, chemical kinetics, electromagnetism, relativistic
quantum mechanics,
quantum harmonic oscillator dynamics, and
quantum electrodynamics. Fundamental constants (the Boltzmann constant, the Planck constant, the speed of light, the Fano factor, and the Van Kampen scaling exponent) emerge in both drift and
diffusion channels without prior specification. The recovered
diffusion coefficients, viewed across domains, constitute an empirical pattern, the $\sigma$-continuum, in which $k_B$, $\hbar$, and $c$ play structurally distinct roles. The Gravitational
Diffusion Theorem, derived from the fluctuation-dissipation
theorem, massless mode structure of linearised
gravity, and gravitational self-coupling via the equivalence principle, determines the gravitational
diffusion coefficient as one Planck length per square root of Planck time. Four canonical axioms formalise the framework, within which the noise character, drift, covariance operator, and fluctuation amplitude are uniquely determined by
theorem, yielding the superspace
diffusion hypothesis: $\mathrm{d}g_{ij} = \mathcal{D}_{ij}[g]\,\mathrm{d}\tau + \ell_P\,\mathrm{d}W_{ij}$ where all coefficients are non-parametric, first-principles consequences of the axioms. An implication of the hypothesis is that coarse-graining of the superspace Fokker-Planck equation via Mori-Zwanzig projection yields predictions for
galactic-scale gravitational acceleration testable against kinematic data.
Read the full abstract ▾
All authors Carolina Garcia, Lucía Perea Durán, Agnese Venezia, Alex Conradie
Numerical Analysis · Cross-listed from cs.CR
Hawkeye: Reproducing GPU-Level Non-Determinism
Erez Badash, Dan Boneh, Ilan Komargodski et al. (+1 more)
We present Hawkeye, a system for analyzing and reproducing GPU-level arithmetic operations. Using our framework, anyone can re-execute on a CPU the exact
matrix multiplication operations underlying a machine learning model training or inference workflow that was executed on an NVIDIA GPU, without any precision loss. This is in stark contrast to prior approaches to verifiable machine learning, which either introduce significant computation overhead to the original model owner, or suffer from non-robustness and quality degradation. The main technical contribution of Hawkeye is a systematic sequence of carefully crafted tests that study rounding direction, subnormal number handling, and order of (non-associative) accumulation during
matrix multiplication on NVIDIA's Tensor Cores. We test and evaluate our framework on multiple NVIDIA GPU architectures ( Ampere, Hopper, and Lovelace) and precision types (FP16, BFP16, FP8). In all test cases, Hawkeye enables perfect reproduction of
matrix multiplication on a CPU, paving the way for efficient and trustworthy third-party
auditing of ML model training and inference. We provide source code for Hawkeye at https://github.com/badasherez/gpu-simulator.
Read the full abstract ▾
All authors Erez Badash, Dan Boneh, Ilan Komargodski, Megha Srivastava
Numerical Analysis · Cross-listed from cs.LG
Data-driven discovery of roughness descriptors for surface characterization and intimate contact modeling of unidirectional composite tapes
Sebastian Rodriguez, Mikhael Tannous, Jad Mounayer et al. (+3 more)
Unidirectional tapes surface roughness determines the
evolution of the degree of intimate contact required for ensuring the thermoplastic molecular
diffusion and the associated inter-tapes consolidation during manufacturing of composite structures. However, usual characterization of rough surfaces relies on statistical descriptors that even if they are able to represent the surface
topology, they are not necessarily connected with the physics occurring at the interface during inter-tape consolidation. Thus, a key research question could be formulated as follows: Which roughness descriptors simultaneously enable tape classification-crucial for process control-and consolidation modeling via the inference of the
evolution of the degree of intimate contact, itself governed by the process parameters?. For providing a valuable response, we propose a novel strategy based on the use of Rank Reduction Autoencoders (RRAEs), autoencoders with a linear latent vector space enforced by applying a truncated Singular Value Decomposition (SVD) to the latent
matrix during the encoder-decoder training. In this work, we extract useful roughness descriptors by enforcing the latent SVD modes to (i) accurately represent the roughness after decoding, and (ii) allow the extraction of existing a priori knowledge such as classification or modelling properties.
Read the full abstract ▾
All authors Sebastian Rodriguez, Mikhael Tannous, Jad Mounayer, Camilo Cruz, Anais Barasinski, Francisco Chinesta
Rings and Algebras
Geometry and classifications of some $\omega$-Lie algebras
Yin Chen, Shan Ren and Runxuan Zhang
Using group actions and orbit-stabilizer methods, we study the geometry of isomorphism classes of finite-dimensional $\omega$-Lie
algebras over a field $\mathbb{K}$ of characteristic $\neq 2$ and establish a one-to-one correspondence between the set of isomorphism classes and the orbit space of a stabilizer of $\omega$. We also apply techniques from computational ideal theory to explore the
geometric structure of the affine variety of all 3-dimensional $\omega$-Lie
algebras over $\mathbb{K}$, showing that this variety is a 6-dimensional irreducible affine variety and a complete intersection. As an application, we derive a complete classification of all 3-dimensional $\omega$-Lie
algebras over an algebraically closed field of characteristic $\neq 2$, up to $\omega$-Lie
algebra isomorphism.
Read the full abstract ▾
Information Theory · Cross-listed from quant-ph
Quantum Entanglement Assistance Improves the Capacity and Activates the Zero-Error Capacity of Classical Channels with Causal CSIT
Yuhang Yao and Syed A. Jafar
For classical point-to-point channels, it has been shown by Bennett et al. that
quantum entanglement assistance cannot improve their capacity, and by Cubitt et al. that
entanglement assistance cannot activate (increase from zero to non-zero) their zero-error capacity. In contrast, we show that for classical point-to-point channels with causal CSIT (channel state information at the transmitter),
quantum entanglement assistance can in some cases improve their capacity, and in some cases activate their zero-error capacity.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Activate the Dual Cones: A Tight Reformulation of Conic ACOPF Constraints
Saba Rafiei and Samuel Chevalier
By exploiting the observed tightness of dual rotated second-order cone (RSOC) constraints, this paper transforms the dual of a conic ACOPF relaxation into an equivalent, non-conic problem where dual constraints are implicitly enforced through eliminated dual RSOC variables. To accomplish this, we apply the RSOC-based Jabr relaxation of ACOPF, pose its dual, and then show that all dual RSOC constraints must be tight (i.e., active) at optimality. We then construct a reduced dual maximization problem with only non-negativity constraints, avoiding the explicit RSOC inequality constraints. Numerical experiments confirm that the tight formulation recovers the same dual objective values as a mature conic solver (e.g., MOSEK via PowerModels) on various PGLib
benchmark test systems (ranging from 3- to 1354-buses). The proposed formulation has useful performance benefits, compared with its conic counterpart, and it allows us to define a bounding function which provides a guaranteed lower bound on system cost. While this paper focuses on demonstrating the correctness and validity of the proposed structural simplification, it lays the groundwork for future GPU-accelerated first-order optimization methods which can exploit the unconstrained nature of the proposed formulation.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.GT
Meta-Learning for Repeated Bayesian Persuasion
Ata Poyraz Turna, Asrin Efe Yorulmaz and Tamer Başar
Classical
Bayesian persuasion studies how a sender influences receivers through carefully designed signaling policies within a single strategic interaction. In many real-world environments, such interactions are repeated across multiple games, creating opportunities to exploit structural similarity across tasks. In this work, we introduce Meta-Persuasion
algorithms, establishing the first line of theoretical results for both full-feedback and bandit-feedback settings in the Online
Bayesian Persuasion (OBP) and Markov Persuasion Process (MPP) frameworks. We show that our proposed meta-persuasion
algorithms achieve provably sharper regret rates under natural notions of task similarity, improving upon the best-known convergence rates for both OBP and MPP. At the same time, they recover the standard single-game guarantees when the sequence of games is picked arbitrarily. Finally, we complement our theoretical analysis with numerical experiments that highlight our regret improvements and the benefits of meta-learning in repeated persuasion environments.
Read the full abstract ▾
Logic · Cross-listed from cs.AI
Compression is all you need: Modeling Mathematics
Vitaly Aksenov, Eve Bodnia, Michael H. Freedman et al. (+1 more)
Human mathematics (HM), the mathematics humans discover and value, is a vanishingly small subset of formal mathematics (FM), the totality of all valid deductions. We argue that HM is distinguished by its compressibility through hierarchically nested definitions, lemmas, and
theorems. We model this with monoids. A mathematical deduction is a string of primitive symbols; a definition or
theorem is a named substring or macro whose use compresses the string. In the free abelian monoid $A_n$, a logarithmically sparse macro set achieves exponential expansion of expressivity. In the free non-abelian monoid $F_n$, even a polynomially-dense macro set only yields linear expansion; superlinear expansion requires near-maximal density. We test these models against MathLib, a large Lean~4 library of mathematics that we take as a proxy for HM. Each element has a depth (layers of definitional nesting), a wrapped length (
tokens in its definition), and an unwrapped length (primitive symbols after fully expanding all references). We find unwrapped length grows exponentially with both depth and wrapped length; wrapped length is approximately constant across all depths. These results are consistent with $A_n$ and inconsistent with $F_n$, supporting the thesis that HM occupies a polynomially-growing subset of the exponentially growing space FM. We discuss how compression, measured on the MathLib dependency graph, and a PageRank-style analysis of that graph can quantify mathematical interest and help direct automated
reasoning toward the compressible regions where human mathematics lives.
Read the full abstract ▾
All authors Vitaly Aksenov, Eve Bodnia, Michael H. Freedman, Michael Mulligan
Mathematical Physics · Cross-listed from cond-mat.mes-hall
Non-Hermitian Disordered Systems
Kohei Kawabata and Shinsei Ryu
Non-Hermitian disordered systems have emerged as a central arena in modern physics, with ramifications spanning condensed matter,
quantum, statistical, and high energy contexts. The same principles also underlie phenomena beyond physics, such as network science, complex systems, and biophysics, where dissipation, nonreciprocity, and stochasticity are ubiquitous. Here, we review the physics and mathematics of non-Hermitian disordered systems, with particular emphasis on non-Hermitian random
matrix theory. We begin by presenting the 38-fold
symmetry classification of non-Hermitian systems, contrasting it with the 10-fold way for Hermitian systems. After introducing the classic Ginibre ensembles of non-Hermitian random
matrices, we survey various diagnostics for complex-spectral statistics and distinct universality classes realized by
symmetry. As a key application to physics, we discuss how non-Hermitian random
matrix theory characterizes chaos and integrability in open
quantum systems. We then turn to the criticality due to the interplay of disorder and non-Hermiticity, including Anderson transitions in the Hatano-Nelson model and its higher-dimensional extensions. We also discuss the effective field theory description of non-Hermitian disordered systems in terms of nonlinear sigma models.
Read the full abstract ▾
Statistics Theory
From Cross-Validation to SURE: Asymptotic Risk of Tuned Regularized Estimators
Karun Adusumilli, Maximilian Kasy and Ashia Wilson
We derive the asymptotic risk function of regularized empirical risk minimization (ERM)
estimators tuned by $n$-fold cross-validation (CV). The out-of-sample prediction loss of such
estimators converges in distribution to the squared-error loss (risk function) of shrinkage
estimators in the normal means model, tuned by Stein's unbiased risk estimate (SURE). This risk function provides a more fine-grained picture of predictive performance than uniform bounds on worst-case regret, which are common in learning theory: it quantifies how risk varies with the true parameter. As key intermediate steps, we show that (i) $n$-fold CV converges uniformly to SURE, and (ii) while SURE typically has multiple local minima, its global minimum is generically well separated. Well-separation ensures that uniform convergence of CV to SURE translates into convergence of the tuning parameter chosen by CV to that chosen by SURE.
Read the full abstract ▾
Dynamical Systems
On a problem of Ö. Stenflo
Klaudiusz Czudek and Tomasz Szarek
We construct an e-chain on a locally compact space with the unique stationary distribution such that the strong law of large numbers does not hold. This answers negatively the question asked by Ö. Stenflo.
Numerical Analysis · Cross-listed from stat.ML
Formulation and Learning Of The Forecasting Problem
Edoardo Calvello, Elizabeth Carlson, Nikola Kovachki et al. (+2 more)
Machine learning has opened new frontiers in purely data-driven
forecasting of dynamical systems; the resulting methods are showing considerable promise in some application domains. However, in contrast to model-driven
algorithms, analysis of these data-driven methods is poorly developed. In this paper we address this issue, developing a theory to underpin data-driven methods to solve
forecasting problems. The theoretical framework comprises two key components: (i) establishing the existence of a mapping defining the
forecasting problem; (ii) showing that it is possible to approximate this mapping by supervised learning techniques, to arbitrary accuracy. We work in the continuous-time and noise-free setting as this defines a simple canonical setting in which to establish an underpinning theory; the continuous-time setting leads to an operator formulation of the problem in which the underlying
forecasting map is defined on pathspace. As a byproduct of our framework we show that analogous existence and approximation results may be obtained for the smoothing problem of recovering unobserved components of dynamical systems, from observed components, using supervised learning. The theoretical results, for both
forecasting and smoothing, are illustrated with experiments studying the Lorenz `63, Lorenz `96 and Kuramoto-Sivashinsky dynamical systems.
Read the full abstract ▾
All authors Edoardo Calvello, Elizabeth Carlson, Nikola Kovachki, Michael N. Manta, Andrew M. Stuart
Dynamical Systems
Bivariate partial mapping for detecting causality in complex non-autonomous system
Yang Ni, Changqing Liu, Yifan Zhang et al. (+4 more)
Identifying causality is fundamental for human understanding of the world, where complex non-autonomous systems such as species population changes,
brain activities, etc. are extensively existed. Since the phase spaces of such systems are not
manifolds, the existing method based on convergent cross mapping is not applicable. This paper proposes a novel bivariate partial mapping method for detecting causality in complex non-autonomous systems. It transforms a non-autonomous system to an autonomous skew product system, and then, by considering the causality changes due to the transformation, detects causality of the original non-autonomous system from the transformed skew product system. The effectiveness of the proposed method is verified by mathematical cases and a real
brain activity case, showing that the proposed method successfully detects the causality in complex non-autonomous systems.
Read the full abstract ▾
All authors Yang Ni, Changqing Liu, Yifan Zhang, Yifan Gao, Haonan Guo, James Gao, Yingguang Li
Probability · Cross-listed from stat.ML
Measure flow path recovery in Bayes Hilbert spaces
S. David Mis and Maarten V. de Hoop
We study the ill-posed problem of recovering a probability measure flow from finitely many moving localized sensors using a Bayes
Hilbert framework. Relative to a fixed reference probability measure, a probability law is represented by its centered log-ratio coordinates, so that an evolving law becomes a path in a
Hilbert space of functions. For sufficiently regular Bayes
Hilbert paths, we construct a canonical minimum-energy transport realization of the path by solving a weighted Neumann problem at each time, yielding an intrinsic transport form on tangent directions. We then formulate an inverse problem directly on Bayes
Hilbert path space. Linearization of an observation operator yields an observability form, and recoverability is governed by its interaction with the transport geometry through a joint transport–observability form. In the ambient infinite-dimensional setting, we develop a regularized variational theory and identify limitations of localized sensing: mobile sensors can make the joint form injective, but they do not in general yield a coercive stability estimate on the full state space. This obstruction leads naturally to finite-dimensional Bayes
Hilbert reductions. There the transport form becomes a kinetic tensor and the linearized observations become reduced sensing
matrices, so recoverability can be expressed through explicit Gramian conditions. We show that localized bump sensors detect every fixed reduced direction, that finitely many suitably placed static sensors yield uniform reduced observability, and there exist path-dependent sensor trajectories such that even a single moving sensor can recover the reduced path. Finally, we show that these reduced recovery results lift to approximate ambient recovery for paths that are well approximated by the chosen finite-dimensional subspaces, yielding stable reconstruction up to projection error.
Read the full abstract ▾
Metric Geometry
Universality of Lipschitz quotients and the curve-flat index
Jaan Kristjan Kaasik and Andrés Quilis
We study universality of Lipschitz quotients. First, we modify a construction of Johnson, Lindenstrauss, Preiss and Schechtman to obtain a complete separable metric space that has every complete separable metric space as a Lipschitz quotient. Our main result is in the compact setting, where we prove that no such universal metric space can exist. We deduce this impossibility result by studying the curve-flat index, an ordinal index which provides a measure of the complexity of the curve-fragment structure in a metric space. We show that Lipschitz quotients cannot increase this index in compact domains; while there exist compact spaces with arbitrarily high countable curve-flat index. The main technical part of the paper is dedicated to proving a strong version of the latter fact: for every ordinal $\alpha$ and every compact metric space $M$, there exists a compact metric space $N$ such that the curve-flat quotient of $N$ of order $\alpha$ is almost-isometric to $M$.
Read the full abstract ▾
Classical Analysis and ODEs
The shifted bilinear Hilbert transform
Lars Becker and Polona Durcik
We prove $L^p$ estimates for the shifted bilinear
Hilbert transform, with a polylogarithmic bound in the size of the shift. As applications, we obtain $r$-variation estimates for bilinear ergodic averages in the sharp range $r > 2$, a sharp bilinear Hörmander multiplier
theorem, and a $\log$-Dini
theorem for bilinear singular integrals.
Read the full abstract ▾
Quantum Algebra
Gandalf Lechner
The problem of classifying all
unitary R-
matrices of arbitrary finite dimension that have precisely two distinct
eigenvalues is described, working up to a natural equivalence relation given by the characters of their braid group representations. Up to one class that might or might not exist in even dimension larger than two, a full classification
theorem is obtained.
Read the full abstract ▾
Information Theory · Cross-listed from cs.CR
HQC Post-Quantum Cryptography Decryption with Generalized Minimum-Distance Reed-Solomon Decoder
Jiaxuan Cai and Xinmiao Zhang
Hamming Quasi-Cyclic (HQC) was chosen for the latest post-
quantum cryptography standardization. A concatenated Reed-Muller (RM) and Reed-Solomon (RS) code is decoded during the HQC decryption. Soft-decision RS decoders achieve better error-correcting performance than hard-decision decoders and accordingly shorten the required codeword and key lengths. However, the only soft-decision decoder for HQC in prior works is an erasure-only decoder, which has limited coding gain. This paper analyzes other hardware-friendly soft-decision RS decoders and discovers that the generalized minimum-distance (GMD) decoder can better utilize the soft information available in HQC. Extending the Agrawal-Vardy bound for the scenario of HQC, it was found that the RS codeword length for HQC-128 can be reduced from 46 to 36. This paper also proposes efficient GMD decoder hardware architectures optimized for the short and low-rate RS codes used in HQC. The HQC-128 decryption utilizing the proposed GMD decoder achieves 20% and 15% reductions on the latency and area, respectively, compared to the decryption with hard-decision decoders.
Read the full abstract ▾
Analysis of PDEs
Global solutions to cross-diffusion systems with independent advections in one dimension
Jakub Skrzeczkowski
We consider cross-
diffusion systems describing
evolution of two species $u$ and $v$ moving according to Darcy's law with the pressure law $p(s) = \frac{1}{\alpha-1} s^{\alpha-1}$ where $s=u+v$. One of the most challenging questions in the field is the construction of solutions to the problem in the presence of additional advection fields, without imposing any artificial structure on the fields or the initial conditions. Although advection arises naturally in these models, it breaks the
symmetry of the system and prevents application of techniques developed in recent years. Here, we provide a new approach to construct solutions in one space dimension that works in a unified manner for all pressure exponents $\alpha \in (0,\infty)$ and for arbitrary initial data. In~particular, in the regime $\alpha > 1$, this yields the first existence result of its kind, obtained without any structural assumptions. We construct the solutions as a limit of a vanishing viscosity approximation $(u_{\varepsilon}, v_{\varepsilon})$. The main challenge is to identify the limit of $u_{\varepsilon} \, \partial_x p(s_{\varepsilon})$, where $s_{\varepsilon} = u_{\varepsilon} + v_{\varepsilon}$. The key new insight is that possible oscillations of $u_\varepsilon$ and $\partial_x p(s_\varepsilon)$ are correlated, simplifying the Young measure analysis in the compensated compactness argument and allowing identification of the limit. Somewhat surprisingly, in contrast to the theory of $2\times2$
hyperbolic systems, the argument relies on only three
entropy-
entropy flux pairs. This is particularly useful for $\alpha>2$, where it is unclear whether additional
entropies are available.
Read the full abstract ▾
Algebraic Topology
Arboreal Objects and Their Homotopy Theory
Atabey Kaygun
We construct a category $\OrdFor$ as an arboreal extension of $\Delta_{\mathrm{epi}}\subseteq\Delta$, whose morphisms are ordered forests composed by grafting. We define a full functor $\pi\colon \OrdFor\to\Delta_{\mathrm{epi}}^{op}$ extracting the semisimplicial shadow. For every complete category $\mathcal C$, this induces a fully faithful functor from semisimplicial objects in $\mathcal C$ to $\mathcal C$-valued presheaves on $\OrdFor$, with right adjoint given by right Kan extension. We show that if weak equivalences of arboreal objects are detected by this right adjoint, then their Gabriel–Zisman localization is equivalent to that of semisimplicial objects. For bicomplete cofibrantly generated model categories, under the usual acyclicity hypothesis for right-induced transfer, the corresponding model structure on arboreal objects is Quillen equivalent to the Reedy model structure on semisimplicial objects.
Read the full abstract ▾
Statistics Theory
Classifier-Based Nonparametric Sequential Hypothesis Testing
Chia-Yu Hsu and Shubhanshu Shekhar
We consider the problem of constructing sequential power-one tests where the null and alternative classes are specified indirectly through historical or offline data. More specifically, given an offline
dataset consisting of observations from $L+1$ distributions $\{P_0, P_1, \ldots, P_L\}$, and a new unlabeled data stream $\{X_t: t \geq 1\} \overset{i.i.d}{\sim} P_\theta$, the goal is to decide between the null $H_0: \theta = 0$, against the alternative $H_1: \theta \in [L]:=\{1,\ldots,L\}$. Our main methodological contribution is a general approach for designing a level-$\alpha$ power-one test for this problem using a multi-class classifier trained on the given offline
dataset. Working under a mild "separability" condition on the distributions and the trained classifier, we obtain an upper bound on the expected stopping time of our proposed level-$\alpha$ test, and then show that in general this cannot be improved. In addition to rejecting the null, we show that our procedure can also identify the true underlying distribution almost surely. We then establish a sufficient condition to ensure the required separability of the classifier, and provide some converse results to investigate the role of the size of the offline
dataset and the family of classifiers among classifier-based tests that satisfy the level-$\alpha$ power-one criterion. Finally, we present an extension of our analysis for the training-and-testing distribution mismatch and illustrate an application to sequential change detection. Empirical results using both synthetic and real data provide support for our theoretical results.
Read the full abstract ▾
Statistics Theory · Cross-listed from econ.EM
Triple/Double-Debiased Lasso
Denis Chetverikov, Jesper R.-V. Sørensen and Aleh Tsyvinski
In this paper, we propose a triple (or double-debiased) Lasso
estimator for inference on a low-dimensional parameter in high-dimensional linear regression models. The
estimator is based on a moment function that satisfies not only first- but also second-order Neyman orthogonality conditions, thereby eliminating both the leading bias and the second-order bias induced by regularization. We derive an asymptotic linear representation for the proposed
estimator and show that its remainder terms are never larger and are often smaller in order than those in the corresponding asymptotic linear representation for the standard double Lasso
estimator. Because of this improvement, the triple Lasso
estimator often yields more accurate finite-sample inference and confidence intervals with better coverage. Monte Carlo simulations confirm these gains. In addition, we provide a general recursive formula for constructing higher-order Neyman orthogonal moment functions in Z-estimation problems, which underlies the proposed
estimator as a special case.
Read the full abstract ▾
Geometric Topology
Knotting and linking in 4 and 5 dimensions from barbell diffeomorphisms
Seungwon Kim, Gheehyun Nahm and Alison Tatsuoka
In this paper, we construct infinitely many non-isotopic 3-
knots in the 5-sphere, each of which has four critical points with respect to the standard height function of the 5-sphere. This contrasts with a
theorem of Scharlemann which says that any 2-
knot in the 4-sphere with four critical points is unknotted, and also provides infinitely many knotted solid
tori in the 4-sphere and 5-ball, which resolves the last remaining case of the
conjecture by Budney and Gabai on the existence of knotted handlebodies. We also construct various knotted and linked handlebodies, discs, and spheres in the 4-sphere, 5-ball, and 5-sphere, extending recent works of Hughes, Miller, and the first author, and a recent work of the authors. All of our examples are explicit and are constructed using barbell diffeomorphisms.
Read the full abstract ▾
Dynamical Systems
Cislunar State and Uncertainty Propagation via the Modified Generalized Equinoctial Orbital Elements
Maaninee Gupta and Kyle J. DeMars
The complex cislunar dynamical environment poses challenges for spacecraft
navigation and Space Domain Awareness (SDA) operations, where the knowledge of current and future spacecraft states is essential. Conventional Gaussian-based approaches for SDA degrade under the nonlinearities that manifest in this regime. To accurately model the underlying dynamics and characterize uncertainty, this work explores the Modified Generalized Equinoctial Orbital Elements under high-fidelity propagation for cislunar applications. The Henze-Zirkler test for multivariate normality is leveraged to evaluate uncertainty
evolution across a range of orbits, demonstrating improved preservation of Gaussian behavior in cislunar space.
Read the full abstract ▾
Information Theory · Cross-listed from cs.LG
GO-GenZip: Goal-Oriented Generative Sampling and Hybrid Compression
Pietro Talli, Qi Liao, Alessandro Lieto et al. (+3 more)
Current network data telemetry pipelines consist of massive streams of fine-grained Key Performance Indicators (KPIs) from multiple distributed sources towards central aggregators, making data storage, transmission, and real-time analysis increasingly unsustainable. This work presents a generative AI (GenAI)-driven sampling and hybrid compression framework that redesigns network telemetry from a goal-oriented perspective. Unlike conventional approaches that passively compress fully observed data, our approach jointly optimizes what to observe and how to encode it, guided by the relevance of information to downstream tasks. The framework integrates adaptive sampling policies, using adaptive masking techniques, with generative modeling to identify patterns and preserve critical features across temporal and spatial dimensions. The selectively acquired data are further processed through a hybrid compression scheme that combines traditional lossless coding with GenAI-driven, lossy compression. Experimental results on real network
datasets demonstrate over 50$\%$ reductions in sampling and data transfer costs, while maintaining comparable reconstruction accuracy and goal-oriented analytical fidelity in downstream tasks.
Read the full abstract ▾
All authors Pietro Talli, Qi Liao, Alessandro Lieto, Parijat Bhattacharjee, Federico Chiariotti, Andrea Zanella
Combinatorics
Computation and sampling for Schubert specializations
David Anderson, Greta Panova and Leonid Petrov
We present computational results on principal specializations $\mathfrak{S}_w(1^n)$ of Schubert
polynomials, which count reduced pipe dreams and reduced bumpless pipe dreams (RBPD). We find the first counterexample, at $n=17$, to the Merzon-Smirnov
conjecture (arXiv:1410.6857) that the maximum of $\mathfrak{S}_w(1^n)$ over $S_n$ is attained at a layered permutation. The simulations suggest that $\lim_{n \to \infty} \log(\max_{w\in S_n}\mathfrak{S}_w(1^n))/n^2$ equals the maximal layered permutations' constant from Morales-Pak-Panova (arXiv:1805.04341). We also explore the random permutation drawn from the distribution proportional to $\mathfrak{S}_w(1^n)$, revealing permuton-like asymptotics similar to those for Grothendieck
polynomials by Morales-Panova-Petrov-Yeliussizov (arXiv:2407.21653). We implement and compare three recurrences for $\mathfrak{S}_w(1^n)$: the descent formula (Macdonald), transition formula (Lascoux–Schutzenberger), and cotransition formula (Knutson). For sampling uniformly random RBPDs (whose count is $\sum_{w\in S_n} \mathfrak{S}_w(1^n)$), we show that reducedness breaks the sublattice property of the ASM
lattice, preventing monotone CFTP and causing false coalescence. We develop an efficient MCMC sampler with macroscopic "droop" updates for connectivity and fast mixing. Our code computes $\mathfrak{S}_w(1^n)$ up to $n\sim 20$ and samples random RBPDs up to $n\sim 60$ on a personal computer ($n\sim 100$ on a cluster).
Read the full abstract ▾
Dynamical Systems
Koopman and transfer operator techniques from the perspective of quantum theory
Dimitrios Giannakis and Michael Montgomery
The study of mathematical connections between operator-theoretic formulations of classical dynamics and
quantum mechanics began at least as early as the 1930s in work of Koopman and von Neumann and was developed in later decades by many authors, often independently, into a framework now broadly known as Koopman-von Neumann representation of classical dynamics. This article surveys aspects of this framework for measure-preserving ergodic dynamical systems and connects it with recent approximation techniques for Koopman and transfer operators that are amenable to data-driven numerical implementation. In broad terms, these methods are based on representations of (i) classical observables as elements of an
algebra of operators acting on a
Hilbert space; and (ii) classical probability measures as elements of the state space of that
algebra, with lifted versions of the Koopman and transfer operators inducing dynamical
evolution of observables and states, respectively. A common theme underlying the techniques surveyed here is the use of reproducing kernel
Hilbert spaces with coalgebra structure (so-called "reproducing kernel
Hilbert algebras”) that aids the
quantum representation of classical objects, as well as the use of Fock spaces to build approximation schemes with high expressivity and structure preservation properties (notably, preservation of positivity and multiplicativity of composition operators). Applications to
quantum algorithms for approximating the Koopman
evolution of observables in systems with pure point spectra are also discussed.
Read the full abstract ▾