Optimization and Control · Cross-listed from cs.LG
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Sunday 3 May
Hard thresholds, quantization, and discrete routing can produce training losses with flat regions and jumps, where ordinary gradients vanish or are undefined. We introduce PolyStep, a forward-only optimizer that evaluates rotated polytope probes and moves parameter blocks along weighted averages of the probe directions. We derive the weights from one-sided entropic transport and use its uncoupled softmax solution in our primary experiments. Our analysis explains when variation among probe costs produces motion and when that motion decreases the loss. On a regular simplex, nonconstant costs always give a nonzero direction. For monotone ridge losses, the softmax update cannot increase the loss at any positive temperature; a perturbation bound gives sufficient conditions for descent near curved jumps. For bounded measurable losses, we randomize the probe radii and identify an exact smoothing whose gradient equals the expected linear cost-weighted direction up to scale. This identity yields a stationarity bound for an idealized fixed-temperature variant: under regularity and sampling assumptions stronger than those met by our trained configurations, the bound has an $O(T^{-1/2})$ term and a persistent bias floor. We evaluate the practical method on networks with hard operations, discrete optimization, and policy search. On MNIST with hard-threshold spiking neurons, PolyStep reaches $93.0 \pm 0.2\%$, compared with $79.6 \pm 5.2\%$ for the best-tuned gradient-free baseline at matched evaluations. These gains come with a query cost proportional to the search dimension per fresh step, which limits the number of updates available at a fixed budget.
Differential Geometry
Local decomposition and linearization of Loday brackets
We study local splitting-type results for general Loday algebroids and use them to obtain a direct proof of the splitting theorem for Courant algebroids. We also discuss the linearization problem and establish a general linearization principle using Euler-like derivations.
Statistics Theory · Cross-listed from econ.EM
Estimation and Inference for the $\tau$-Quantile of Individual Heterogeneous Coefficient
This paper proposes estimation and inference procedures for quantiles of the heterogeneous individual-specific coefficients in panel data. Unlike conventional panel quantile regression, which focuses on outcome heterogeneity, our approach targets the $\tau$-quantile of the cross-sectional distribution of individual-specific slopes. We establish the asymptotic theory under both stochastic and deterministic designs, with convergence rates $\sqrt{N}$ and $\sqrt{N\sqrt{T}}$, respectively. We also develop two corresponding bootstrap procedures for practical inference, and formally establish their validity. The suggested methods are of practical interest since they require weaker sample size growth conditions than standard fixed-effect quantile regression, and accommodate large $N$ settings. Numerical simulations and an empirical application illustrate the empirical effectiveness of the methods under both designs.
Read the full abstract
Statistics Theory · Cross-listed from stat.ML
Extrapolation in Statistical Learning with Extreme Value Theory
Extreme value theory provides rigorous theory and statistical tools for extrapolation in machine learning, particularly in settings where traditional methods struggle due to data scarcity in the tails. A broad range of tasks benefit from these advances, including regression and classification beyond the training data, extreme quantile regression, supervised and unsupervised dimension reduction, generative artificial intelligence and anomaly detection. This review synthesizes recent developments in these fields at the intersection of statistical learning and extreme value theory, with a focus on principled methods based on asymptotically motivated representations of the tail of univariate and multivariate distributions. We consider different theoretical frameworks for both asymptotically dependent and independent data and discuss how they translate into efficient statistical methods for extrapolation to extreme regions. By addressing both theoretical and practical aspects, we offer a comprehensive overview of the state-of-the-art in this quickly evolving field, and identify promising directions for future research.
Read the full abstract
Statistics Theory · Cross-listed from stat.ML
Adaptive Estimation and Inference in Semi-parametric Heterogeneous Clustered Multitask Learning via Neyman Orthogonality
We study clustered multitask learning in a semiparametric setting where tasks share a latent cluster structure in their target parameters but exhibit heterogeneous, potentially infinite-dimensional nuisance components. Such heterogeneity poses a major challenge for existing multitask learning methods, which typically rely on aligned feature spaces or homogeneous task structures. To address this challenge, we propose an adaptive fused orthogonal estimator that integrates Neyman-orthogonal losses with data-driven pairwise fusion penalties. Our framework leverages task-specific pilot estimates to calibrate the fusion penalties and combines adaptive aggregation with orthogonalization to mitigate the impact of nuisance-parameter estimation error. Theoretically, we show that the proposed estimator achieves exact recovery of the latent clustering with high probability and attains pooled parametric convergence rates proportional to cluster size. Moreover, we establish asymptotic normality and show that, asymptotically, our estimator matches the performance of an oracle procedure that knows the true clustering in advance. Empirically, we show that the proposed method consistently outperforms strong baselines in various simulation setups. A real-world application to U.S. residential energy consumption demonstrates the effectiveness of our approach in uncovering meaningful regional clustering in electricity price elasticity, showcasing the efficacy of our method.
Read the full abstract
Optimization and Control
The Control Plant as A Communication Channel: Implicit Communication for Decentralized LQG Control
We study a decentralized linear quadratic Gaussian control problem, in which a leader and a follower must steer a linear system to a target state. The target state is known only to the leader, and no explicit communication channel exists between the agents. To address the challenge posed by this asymmetric information structure, we propose an integrated communication and control (ICoCo) framework in which the control plant itself serves as a communication channel: the leader encodes the target state into its control input through an additive communication term, and the follower decodes it from the resulting state trajectory. We design an implicit coordination scheme based on joint source-channel coding ideas, and prove that the follower's estimation error decreases monotonically to zero, enabling the two agents to coordinate increasingly well and ultimately steer the system to the target state. We then formulate the design of the communication power as an optimal control problem to minimize the overall control cost. In the fully actuated leader case, we derive necessary optimality conditions and in the under-actuated case, we solve the problem numerically. Numerical results show that the proposed scheme effectively coordinates the two agents and achieves a control cost close to that of the explicit-communication lower bound.
Read the full abstract
Optimization and Control
Fast Newton methods for linear-quadratic dynamic games with application to autonomous vehicle platooning and intersection crossing
We consider constrained linear-quadratic dynamic games arising in autonomous vehicle platooning, intersection crossing and other cooperative driving scenarios. Infinite-horizon Nash equilibria are reformulated as receding-horizon affine variational inequalities with special structure. Exploiting this formulation, we design Newton-type algorithms with local quadratic convergence. The resulting methods achieve extremely fast convergence, making them well suited for real-time and embedded receding-horizon control in safety-critical traffic applications. Simulations of platooning and intersection crossing demonstrate substantial performance gains over first-order and operator-splitting approaches, hence high application potential.
Read the full abstract
Probability
Poisson approximation by coupling
It is well known that a binomial $(n,p)$ can be approximated by a Poisson distribution with parameter $np$. The typical approach in undergraduate probability texts is to show a convergence result for the distribution of the binomial as $n$ goes to infinity and $np$ converges to some $\lambda$. In this note we use instead the coupling technique to show a much more general result. Moreover, we only use elementary results from probability.
Read the full abstract
Differential Geometry
Descent of Basic Forms to Quotients by Locally Free Lie Group Actions
We prove an equivariant version of the theorem of Hector, Macías-Virgós, and Sanmartín-Carbón identifying diffeological forms on the leaf space of a foliation with basic forms. For any group $K$ acting by foliation-preserving diffeomorphisms, we show that this identification is an isomorphism of $K$-equivariant cochain complexes. We then establish a descent theorem for basic differential forms under locally free Lie group actions without assuming properness. Let a Lie group $H$, not necessarily connected or second countable, act smoothly and locally freely on a second countable manifold $M$, and let $\mathcal F$ be the foliation by $H_0$-orbits. We prove that pullback induces an isomorphism \[ \Omega^\bullet(M/H)\cong\Omega^\bullet(M,\mathcal F)^H \] provided that $H$ is second countable or that the induced action of $H/H_0$ on $M/H_0$ satisfies a natural subduction condition. We also give a smooth free action for which descent fails, showing that an additional hypothesis is genuinely necessary.
Read the full abstract
Mathematical Physics
Properties of tensorial free cumulants
In the past two years, several points of view have been proposed to address the question of the generalization of the theory of free probability to random tensors with different invariances, and it is unclear at this point whether they lead to the same notions of tensorial free cumulants and freeness. One way to approach this problem, developed by Collins, Gurau and the second named author for local unitary invariant random tensors, relies on finite size quantities involving averages over the invariance group, and whose asymptotics naturally possess the properties expected for tensorial generalizations of free cumulants of arbitrary orders. At this point, this approach has only been carried out for certain distributions, and for a subset of the moments that define such theories, and a more systematic and exhaustive study is lacking. This is the program initiated in this paper: we link this approach to the one proposed by Nechita and Park; extend a number of their results as well as those of the aforementioned paper to arbitrary orders of fluctuations, thereby generalizing higher order free cumulants; push further the study of distributions with larger invariance groups; detail the link with the asymptotics of the free-energies of the tensor HCIZ and BGW integrals; and provide formulae for tensorial free cumulants of products of tensors. Another important question is that of the definition of concrete distributions whose tensorial free-cumulants take non-trivial values. We compute the tensorial free cumulants for Gaussian random tensors with non-trivial covariances, and show that they provide such examples.
Read the full abstract
Algebraic Geometry
Tropical Degenerations of Network Games:Valuation Classes and Equilibrium Coalescence
A valuation-theoretic framework is developed for studying tropical degenerations of multilinear network games. Equilibrium conditions are modeled by an ideal over the Puiseux field, and valuation classes and cluster multiplicities are used to describe the organization of Puiseux equilibrium branches under degeneration. For valuation vectors lying in the relative interiors of generator-wise maximal tropical cells, multilinearity is shown to force a binomial reduction of the generator-wise initial system. The resulting binomial systems are governed by exponent-difference graphs, strongly connected component decompositions, and lattice indices computed via Smith normal form. In particular, unimodular diagonal blocks yield initial-coefficient rigidity, whereas non-unimodular blocks give rise to torsion-type leading-coefficient multiplicities. The generic binomial theory is complemented by a collision-normalized cross-prism family. In this family, 2^L Puiseux equilibrium branches share the same valuation vector and the same leading-coefficient vector. The corresponding limiting initial fiber is supported at a single torus point, but this point is nonreduced with scheme-theoretic length 2^L. Thus valuation coalescence is realized as an intrinsic scheme-theoretic collision rather than merely as a loss of higher-order terms. These local degeneration invariants are then related to the algebraic-degree theory of network games, showing how global equilibrium counts can be refined by valuation classes, binomial initial systems, Smith lattice data, and nonreduced collision fibers.
Read the full abstract
Probability
Random trade timing and power-law tails in realized prices
This paper studies stochastic mechanisms under which light-tailed latent price dynamics yield realized prices with power-law tails. The realized price is modeled as $P_T=e^{X_T}$, where $X$ is a Markov-modulated Lévy process and $T$ is the random time of the next trade. We consider two trade-timing environments. In the intertrade-incidence model, trades occur on a discrete grid with type-dependent probabilities. In the intertrade-time model, the waiting time to the next trade is generalized Erlang, allowing for heterogeneous arrival rates and transaction-completion delays. We show that random trade timing can generate Pareto-type tails, possibly with a logarithmic correction, in realized prices even when the latent price process is light-tailed. In both models, the tail exponent is determined by the least frequent trading type, while the proportions of faster-trading types affect only the scale constant. We also provide sufficient conditions under which these Pareto-type tails sharpen to exact Paretian tails. These results identify random trade timing and heterogeneity in trading behavior as a general mechanism for generating power-law tails in realized prices.
Read the full abstract
Analysis of PDEs
Renormalized Solution for the Nonlinear Parabolic Problem with Lower Order Terms
In this paper, we consider the following nonlinear parabolic equation with non-coercive terms in \(R^N\) space \[ \dfrac{\partial u}{\partial t} -\nabla \cdot (a(x,t,u,\nabla u)+ \Phi(x,t,\nabla u))=f, \text{ in }\Omega \times (0,T). \] Here \(\Omega\) is a bounded open set of \(R^N\) with the boundary \(\partial \Omega\) satisfying Lipschitz condition. The Carathéodory function \(\Phi\) is restricted by $|\Phi(x,t,s)|\le c(x,t)|s|^\gamma$ with parameters depending on $p$ and $N$. And the initial value $u(x,0)=u_0(x)$. For convenience, we define the domain $Q := \Omega \times (0,T)$ and the boundary similarly. Then for $f\in L^1(Q)$ and $u_0\in L^1(\Omega)$, we prove the existence and uniqueness of a renormalized solution via truncation methods, monotone operator theory, and a prior gradient estimates.
Read the full abstract
Analysis of PDEs
Hardy Criticality in Axisymmetric Swirl
For smooth axisymmetric Navier–Stokes flow with swirl, set \(F=u^\theta/r\), \(\Gamma=ru^\theta\), \(G=\omega^\theta/r\), and \(U=u^r/r\). Weighted swirl energies are classical; we determine the sharp two-parameter coercivity spectrum of the exact power-weight family \(\int |F|^p r^\alpha\,dr\,dz\), \(p>1\), \(\alpha>1\). The full diffusion form has a positive gradient gap for \(\alpha<2p+1\), loses every uniform gap at \(\alpha=2p+1\), and is indefinite above it. Exactly at the same threshold the radial-strain term cancels, and the identity becomes the classical \(L^p\) circulation energy for \(\Gamma\). Thus stretching cancellation and Hardy criticality coincide within the power family. We also characterize \(r^3drdz\) by conservative \(F\)-transport, self-adjoint five-dimensional diffusion, and a flat \(G\)-source pairing, and obtain the optimal strain form-bound threshold within the Hardy-coercive powers.
Read the full abstract
Analysis of PDEs
Threshold Decomposition of Vorticity Stretching and Palinstrophy
We give an exact finite-time decomposition of vortex stretching by resolving the vorticity equation according to the size of the vorticity. For almost every threshold $a>0$, the stretching occurring where $|\omega|>a$ equals the change of the corresponding superlevel mass plus two nonnegative viscous terms: one measuring changes in vorticity direction and one measuring dissipation across the level surface $|\omega|=a$. Integrating this identity over all thresholds recovers the classical $L^p$ vorticity balance and, for $p=2$, the usual spacetime palinstrophy. At the scale-critical exponent $p=3/2$, the dissipation can be written through the nonlinear variable $Z=|\omega|^{-1/4}\omega$. The threshold formulation also gives a positive measure that can be used to assign overlapping high-vorticity episodes without double counting. Under additional compactness assumptions it leads, through empirical transition couplings supported on a closed physical transition relation, to a stationary Markov renormalization law; no deterministic return map is required. These are structural results; no unconditional three-dimensional regularity theorem is claimed.
Read the full abstract
Information Theory
Evolving Token Communication with Parametric Memory Network
Token communication has emerged as a promising framework for efficient wireless transmission by representing source data as compact semantic tokens. However, transmitting full semantic tokens still incurs considerable communication overhead. In this paper, we propose an evolving semantic token communication system with a parametric memory network over MIMO fading channels. Specifically, only an equal-length prefix of each semantic token is transmitted, which reduces transmission cost while preserving a consistent token structure for receiver-side recovery. At the receiver, a parametric memory network is introduced to reconstruct the missing suffix information from the received token prefixes, where semantic memory is stored implicitly in the network parameters. To realize this design, full semantic tokens are first organized into a codebook, and truncated tokens are paired with the codeword labels of their corresponding full tokens. Based on these token-label pairs, kNN-based teacher distributions are constructed to fine-tune a pretrained GPT-2-based recovery module, which learns to infer the codeword distribution of each incomplete token and recover the corresponding complete semantic token. In addition, an online evolution strategy is developed to periodically update the parametric memory network and the entire system using newly observed test samples, thereby improving adaptability under distribution shifts. Experimental results demonstrate that the proposed method consistently outperforms the existing evolving memory benchmark under different channel conditions and channel bandwidth ratios, with up to 1.09 dB PSNR improvement.
Read the full abstract
Numerical Analysis
Numerical Construction of Elliptic Lower-Dimensional Quasi-Periodic Solutions with a Priori Bound
A numerical framework for constructing full-dimensional quasi-periodic solutions in nearly integrable systems was recently developed by Fu and Shi[2026]. Based on an alternating scheme, this approach effectively overcomes the secular drift in angle variables, a fundamental limitation of symplectic integrators. However, in many applications, such as the restricted three-body problem, lower-dimensional quasi-periodic solutions hold greater significance. The construction of these solutions is considerably more challenging due to the presence of normal frequencies, leading to intricate resonance phenomena. Beyond the subspace resonance, one must also account for the first and second Melnikov conditions to eliminate small divisors. In this study, we extend the proposed alternating numerical scheme to compute the elliptic lower-dimensional quasi-periodic solutions. Numerical experiments are presented for the Hénon-Heiles model and the Fermi–Pasta–Ulam (FPU) model, demonstrating the effectiveness of the proposed method. Furthermore, we emphasize that the perturbation is not merely a polynomial with real coefficients but is a real-valued function. As a result, the associated perturbation operator exhibits Gevrey decay without possessing a Hankel structure. Meanwhile, we further simplify the multi-scale analysis by exploiting the resolvent identity, showing that the global inverse can be expressed linearly in terms of local inverses via the gluing procedure. This representation reveals a regime-dependent interaction structure: weak interactions dominate at short range, while strong interactions emerge at long range. This balance ensures that the Gevrey decay of the inverse remains uniformly controlled. Moreover, within this linear representation, the inversion conditions provide a clearer characterization of the localization properties.
Read the full abstract
Algebraic Geometry
Homotopy coherent Gysin functoriality
We construct homotopy coherent Gysin pullbacks for weak Borel-Moore theories on smooth schemes, addressing the higher coherence problem for Gysin morphisms associated with closed immersions and lci-type factorizations. The construction uses the higher deformation spaces of Dubouloz-Mayeux attached to flags of closed immersions, from which we build higher Gysin simplices and their simplicial identities up to contractible choices. A rigidification procedure then turns this coherent system into a strict contravariant simplicial functor extending both smooth pullbacks and closed-immersion Gysin morphisms. As an application, we prove a representability theorem for Rost-Schmid complexes associated with homodules over general noetherian excellent bases: these complexes form weak Borel-Moore theories, and hence are represented by motivic objects obtained from the main construction.
Read the full abstract
Information Theory
Optimal Communication Rate of Secure Aggregation over Ring Networks with Pairwise Keys
Information-theoretic topological secure aggregation (TSA)\cite{zhang2026information_regular} enables distributed users to compute neighborhood sums over arbitrary networks without revealing individual inputs, while remaining communication-efficient. It has broad applications, including secure model aggregation in decentralized federated learning (FL). Existing TSA formulations rely on arbitrarily correlated keys generated by a trusted key server, which introduces a single point of failure. In this paper, we instead study TSA with \tit{pairwise} secret keys, where each user pair $(i,j)$ shares an independent key $S_{i,j}$. Such keys can be established through inter-user communication, eliminating the need for a key server and improving robustness. Focusing on a ring topology with $K$ users, we characterize the minimum per-user communication rate: \tit{to securely compute one bit of the desired input sum, each user must send at least $1$ bit to its neighbors when $K=3,4$, and at least $2$ bits for all $K\ge 5$}. The higher rate in larger networks arises because each user must simultaneously satisfy two independent key-alignment constraints from its two neighborhoods, which cannot be resolved within a single broadcast symbol under pairwise key independence. We propose a linear pairwise-masking scheme that achieves these rates and prove its optimality via tight entropic converse bounds that exploit the dependency structure of the keys. Notably, for all $K\ge 4$, only a subset of the $\binom{K}{2}$ pairwise keys – specifically, those between users at ring distance $2$ – is sufficient to achieve optimality, revealing a nontrivial role of topological sparsity in secure aggregation.
Read the full abstract
Complex Variables
A bounded globally univalent quasiconformal harmonic map whose analytic part is unbounded
We construct, for every \(0<k<1\), a bounded globally univalent harmonic mapping \[ f=h+\overline g \colon \D\to\C \] such that \[ |g'(z)|\le k|h'(z)|,\qquad z\in\D, \] while the analytic part \(h\) is unbounded. The construction is based on a bounded logarithmic spiral map on a far right horizontal strip, together with a smaller logarithmic perturbation.
Read the full abstract
Information Theory
A Statistical-Physics Refinement of Soft Covering
We study the channel output distribution induced by a rate-$R$ random code via statistical physics. The partition function is $Z_n(\beta|\mathcal{C}) = \sum_{y^n}[P_{Y^n|\mathcal{C}}(y^n)]^\beta$, where $\mathcal{C}$ is the code and $\beta > 0$ is inverse temperature. Our focus is on the free energy which is the normalized logarithm of this quantity, which encodes the full Rényi spectrum of the output distribution. The single-letter formula derived for the annealed free energy decomposes into two branches which reflect a “competition” between two populations of codewords. One is the bulk branch, $\psi_{\mbox{\tiny b}}(\beta,R)$, which is driven by typical codewords and the other one is the sparse branch $\psi_{\mbox{\tiny s}}(\beta,R)$, which is driven by a-typical codewords, where the qualifiers `typical' and `atypical' are in a sense to become apparent later. We analyze the phase structure of each branch separately and characterize their competition. Both branches are derived for all $\beta > 0$. The phase boundary $R^\star(\beta)$, where the two branches are equal, is analyzed for $\beta \geq 1$, where it has an explicit closed-form expression. The phase diagram in the first quadrant of the $(\beta, R)$ plane has four regions separated by three boundaries: $R = I^{\mbox{\tiny b}}(\beta)$ (bulk branch transition), $R = R^\star(\beta)$ (bulk–sparse competition boundary), and $R = I^{\mbox{\tiny s}}(\beta)$ (sparse branch transition), all meeting at the point $(\beta, R) = (1, I(X;Y))$, where $I(X;Y)$ is the mutual information induced by the input type and the channel. Applications to guesswork, channel resolvability, and hypothesis testing are discussed, and all results are illustrated with a numerical example of a Z-channel.
Read the full abstract
Optimization and Control · Cross-listed from cs.DC
nvPAX: Constrained Optimization for Dynamic Power Allocation in Hierarchical and Multi-Tenant Systems
Power oversubscription is increasingly central to datacenter operation as power density grows, making it necessary to dynamically allocate limited power budgets across devices based on real-time demand. Existing approaches typically assume flat power domains, whereas in practice power distribution is hierarchical and allocation decisions must additionally respect tenant-level contractual constraints. We present nvPAX, a constrained-optimization policy that computes feasible power allocations at every control step via a three-phase hybrid QP/LP procedure. Phase I allocates power with minimum deviation from each device's power request, while respecting job priorities. Phase II fairly distributes excess power among active devices. Phase III fairly distributes any remaining power to idle devices. The rationale behind the three phases is to allow power oversubscription while maximizing datacenter utilization. On a trace-driven large-scale simulation using GPU power telemetry from a production datacenter, nvPAX runs with a mean wall-clock time of 264.69 ms per allocation interval and achieves a mean satisfaction ratio of 98.92%, outperforming static equal-share allocation and providing robustness beyond greedy proportional allocation in the presence of non-uniform hierarchical bottlenecks.
Read the full abstract
Information Theory
Remote Action Generation: Remote Control with Minimal Communication
We address the challenge of remote control where one or more actors, lacking direct reward access, are steered by a controller over a communication-constrained channel. The controller learns an optimal policy from observed rewards and communicates action guidance to the actors, which becomes demanding for large or continuous action spaces. To achieve rate-efficient communication throughout this interactive learning and control process, we introduce a novel framework leveraging remote generation. Instead of transmitting full action specifications, the controller sends minimal information, enabling the actors to locally generate actions by sampling from the controller's evolving target policy. This guided sampling is facilitated by an importance sampling approach. Concurrently, the actors use the received guidance as supervised learning data to learn the controller's policy. This actor-side learning improves their local sampling capabilities, progressively reducing future communication needs. Our solution, Guided Remote Action Sampling Policy (GRASP), demonstrates significant communication reduction, achieving an average 12-fold data reduction across all experiments (50-fold for continuous action spaces) compared to direct action transmission, and a 41-fold reduction compared to reward transmission.
Read the full abstract
Number Theory
On the generalized inverse tangent integral and Catalan's constant
In this paper, we develop new identities for the inverse tangent integral by connecting it to the dilogarithmic (polylogarithmic) structure and to a carefully designed auxiliary arctangent integral $Ti_2(a)$ with a tunable endpoint. The core idea is based on the introduction of an auxiliary integral depending on two parameters and analyzing it via a generating-function perspective. This converts the integral into an explicit formula, yielding a compact representation in terms of the real part of a dilogarithmic expression plus a companion dilogarithm contribution. In parallel, the inverse tangent integral is rewritten through standard integral transformations into a form governed by the imaginary part of a dilogarithm evaluated at a complex argument, producing a clean polylogarithmic description. Overall, we establish a coherent bridge between arctangent-type integrals, identities connected to Catalan's constant, and the systematic generation of new integral representations and decompositions.
Read the full abstract
Information Theory
Atomic Hybrid Sparse/Diffuse Channel Estimation and Cramér-Rao Bounds Analysis
In this paper, an atomic hybrid sparse/diffuse (aHSD) channel model in the frequency domain is proposed. Based on a structural analysis of the resolvable paths and diffuse scattering statistics, the Hybrid Atomic-Least-Squares (HALS) algorithm is designed to estimate sparse/diffuse components with a combined atomic and $\ell_2$ regularization. A theoretical analysis of the Lagrange dual problem is conducted, and the conditions required for primal and dual solutions are provided, supporting an off-the-grid delay-time estimator. The Cramér–Rao Bound (CRB) analysis in this paper focuses on the estimation of the channel parameters, resulting in a bound on the aggregate channel. Lower and upper bounds for the CRB on parameters are derived as functions of the minimum separations between frequency parameters. Numerical results via simulations on synthetic and real data validate the efficacy of the HALS estimation strategy and show the improved predictive ability of the CRB analysis for the performance of HALS versus previously considered bounds.
Read the full abstract
Dynamical Systems
Self-similarity of unions of self-similar sets and their translations
In this paper, we explore the self-similarity of unions of self-similar sets and their translations. For $N \in \mathbb{N}$ and $0< \beta < 1/(N+1)$, let $\Gamma$ be the self-similar set generated by the IFS \[ \Big\{ \phi_i(x)=\beta x + i \frac{1-\beta}{N}: i=0,1,\ldots, N \Big\}. \] We provide a complete characterization of translation vectors $\boldsymbol{t} =(t_0,t_1, \ldots, t_m) \in \mathbb{R}^{m+1}$ with $0=t_0 < t_1 < \cdots < t_m$ for which the union $\bigcup_{j=0}^m (\Gamma+t_j)$ is a self-similar set, by determining the existence of cycles in associated directed graphs. This extends the result of [Derong Kong, Wenxia Li, Zhiqiang Wang, Yuanyuan Yao, Yunxiu Zhang. On the union of homogeneous symmetric Cantor set with its translations. Math. Z., 2024]. Additionally, we present two types of self-similar sets for which the union with their translations cannot be self-similar.
Read the full abstract
Optimization and Control
Optimal transport between laws of random probability measures and the strict Monge problem
We consider an optimal transport problem between laws of random probability measures: given a base cost function, we build the associated OT cost between probability measures that in turn we use to define the OT cost between probability measures over probability measures. This setting admits a finer reformulation in terms of laws of random couplings, which retain more information than ordinary couplings. One of the main contributions of the paper is the characterization of the optimal ones in terms of Kantorovich potentials. Similarly, we also introduce the strict Monge problem, whose admissible competitors are more restrictive than in the usual Monge formulation. In this setting, we will give sufficient conditions under which the value of this problem is the same as the one considered above, in the spirit of the result by A. Pratelli. Then, for $p>1$, when the underlying cost is the distance to the power $p$ in a strictly convex Banach space, we will give sufficient conditions under which the optimal random coupling is unique and induced by a solution of the strict Monge problem, resembling the Brenier theorem.
Read the full abstract
Analysis of PDEs
Large data global well-posedness for a one-dimensional quasilinear wave equation
In this paper, we prove global well-posedness with large initial data for the one-dimensional quasilinear wave equation $$ u_{tt}=c(u)^2u_{xx}, \qquad (t,x)\in (0,T)\times\R, $$ where \(c\) is a positive, bounded, monotonically increasing function with bounded derivative. This result gives a partial resolution of an open problem posed by Glassey, Hunter and Zheng on the global existence of smooth solutions to this equation for large initial data. Our proof is based on upper and lower estimates for the Riemann variables via a new comparison principle.
Read the full abstract
Combinatorics
Latin hypercubes with restricted transversals
A $k$-plane of a $d$-dimensional array is a subarray formed by fixing $d-k$ coordinates and allowing the remaining $k$ coordinates to vary freely. A Latin hypercube of dimension $d$ and order $n$ is an $n\times n\times\cdots\times n$ array of dimension $d$ containing symbols from an $n$-set, such that each $1$-plane contains each of the possible entries exactly once. A transversal in a Latin hypercube of order $n$ is a set of $n$ entries of the hypercube, no pair of which agree in any coordinate or contain the same symbol. The aim of this paper is to construct Latin hypercubes that have transversals but which have many entries that are not in any transversal, or for which the number of disjoint transversals is limited. We show the following results in the case when the dimension $d$ is even. For all even $n\ge 10$ there exists a Latin hypercube of order $n$ that contains a transversal but for which all transversals hit one $(d-2)$-plane. For $n\in\{6,8\}$ there exists a Latin hypercube of order $n$ that contains a transversal but for which all transversals hit one of two $(d-2)$-planes. For even $d>2$ there is a Latin hypercube of order $n=4$ that contains a transversal but has $2^d$ entries that are not in any transversal. Our constructions use a quasigroup $(Q,\ast)$ to increase the dimension of a Latin hypercube using the rule $H_d(x_1,\dots,x_d)=H_{d-1}(x_1,\dots,x_{d-1})\ast x_d$. We give several characterisations which allow us to diagnose which entries of $H_d$ are in transversals in terms of properties of $H_{d-1}$ and $Q$.
Read the full abstract
Statistics Theory · Cross-listed from cs.LG
Beyond ECE: Calibrated Size Ratio, Risk Assessment, and Confidence-Weighted Metrics
Confidence calibration has been dominated by the Expected Calibration Error (ECE), a linear metric that counts calibration offset equally regardless of the confidence level at which it occurs. We show that ECE can remain small even under arbitrarily large overconfidence risk, so we propose Calibrated Size Ratio (CSR) instead, an interpretable metric that equals 1 under perfect calibration, from which we derive the risk probability $P_{\mathrm{risk}}$ that quantifies the statistical evidence for overconfidence. We further argue that overconfidence risk assessment must be complemented by a measure of discriminative value: whether the assigned confidences actively distinguish correct from incorrect predictions. We show that confidence-weighted accuracy $\mathrm{cwA}$ is the natural such complement, and that confidence-weighting extends to all standard classification metrics. In particular, we prove that the confidence-weighted AUC (cwAUC) captures the information about calibration while the classical AUC cannot. We validate the proposed indicators on several synthetic confidence distributions under multiple controlled calibration profiles and find that CSR separates risky from non-risky assignments. We also test the metrics on fifteen real datasets, with and without post-hoc calibration, and find that standard methods can yield risky confidence profiles.