Optimization and Control
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Sunday 13 September
We prove a Filippov-type stability theorem for integro-differential sweeping processes of Volterra type with an outer multivalued perturbation, in a separable Hilbert space, under the assumptions that the moving sets are uniformly prox-regular and Lipschitz continuous with respect to the Hausdorff distance and that the perturbation is one-sided Lipschitz. Given an absolutely continuous solution of the system perturbed both in the state argument of the multivalued term and by an outer integrable term, we show the existence of a solution of the original Volterra sweeping process and estimate the distance between the two trajectories explicitly in terms of the data of the problem. The estimate becomes sharper when only the outer perturbation is present, and it recovers the Lipschitz dependence on the initial condition of Filippov's classical theorem. The proof combines a reduction of the constrained dynamics to an unconstrained differential inclusion, measurable selection arguments, and an enhanced version of Grönwall's inequality established in this work. As an application, we obtain the Lipschitz dependence of the attainable set on the initial set with respect to the Hausdorff distance, together with a one-sided estimate quantifying the effect of the perturbations. We also work out a spatially distributed fishery model with ecological memory whose harvesting rule, triggered by the aggregate biomass, is one-sided Lipschitz but is not Lipschitz continuous with respect to the Hausdorff distance, so that the classical framework does not apply. For this model, our estimates produce a stability constant governed only by the biological data.
Sound
Grounded in Sound: Reinforcement Learning with a Frozen Acoustic Judge to Curb ASR Insertion Hallucinations
When reinforcement learning (RL) is used for post-training automatic speech recognition (ASR), the reward almost always lives in the text space: it compares a hypothesis with the reference and never checks whether the hypothesis is supported by the audio. On highly regular speech this licenses a shortcut - guessing from a strong language prior rather than listening. Once the acoustics degrade, the shortcut runs unchecked and emits fluent but ungrounded words, i.e., insertion errors. We propose an acoustic-fidelity reward: a GRPO reward augmented with a separately pretrained, permanently frozen, non-autoregressive character-level wav2vec2-CTC acoustic judge, used strictly at training and absent at inference, where a single model decodes greedily. Trained on LibriSpeech and evaluated across a six-tier difficulty gradient including real AMI meeting speech (33,282 utterance-condition instances), the method reduces insertion errors by 28.3% on close-talking AMI-IHM and 22.3% on far-field AMI-SDM, while lowering WER on AMI-SDM from 35.89% to 34.71% and showing no detectable WER difference on the other five tiers, against a schedule-matched WER-GRPO baseline. The insertion reduction holds under a meeting-level clustered bootstrap. Four prespecified analyses support content-conditioned insertion calibration: output collapses 85-90% on unintelligible audio that preserves energy and voice activity; the gain is not recovered by the evaluated 32-best CTC rescoring configuration, yet RL internalizes it into a single greedy decoding run; and policy-only confidence yields lower insertion-AURC in all four evaluated settings. We frame this as a mechanism paper, demonstrated in one instantiation: a 7B speech LLM with a 0.3B CTC judge.
Read the full abstract
Quantum Physics
Squeezing measurement with spectrally broadened in microstructured fiber local oscillator
Recently, continuous variables (CV) quantum computing, i.e. computing employing squeezed states, has attracted significant attention, as it enables to increase the dimensionality of the system. In CV protocols, homodyne detection plays a key role in the realization of the required gates and operations. Multimode squeezed light generated via parametric down-conversion (PDC) benefits from the broadband bandwidth, which encompasses multiple frequency modes. However, its broadband structure simultaneously requires the precise matching of the local oscillator (LO) with the squeezed light modes for their correct homodyne detection and processing. Achieving such matching is usually a challenging task, since the spectral bandwidth of the local oscillator is typically significantly narrower than the bandwidth of the squeezed-light modes. In this work, we propose and experimentally demonstrate a technique for expanding the bandwidth of the LO by passing it through the microstructured fiber. We validate the proposed concept by measuring squeezing in the modes of multimode squeezed light generated in type-0 and type-II PDC. We show that the broadened LO starts to spectrally match the modes generated via type-II PDC. The presented technique might be beneficial for implementing various CV systems and protocols.
Read the full abstract
Representation Theory
Igusa–Todorov Algebras and the Auslander–Reiten Conjecture
We prove that every Igusa–Todorov Artin algebra satisfies the Auslander–Reiten conjecture. More precisely, let $V$ be an $n$-Igusa–Todorov witness, and let $t$ be the number of isomorphism classes of nonprojective indecomposable summands of $V$. If a finitely generated module $M$ satisfies $\Ext_A^i(M,A)=0$ for every $i>0$ and $\Ext_A^q(M,M)=0$ for $1\leq q\leq 2t+1$, then $M$ is projective. As applications, algebras of representation dimension at most three and algebras satisfying $J^{2m+1}=0$ for which $A/J^m$ has finite representation type satisfy the Auslander–Reiten conjecture.
Read the full abstract
Human-Computer Interaction
Show Me Your Prompts! How Writers Feel About Sharing Prompts in Collaborative Text Editors
Generative AI writing assistants are becoming integrated into collaborative text editors; however, it is unclear how much information about a user's prompting activities should be shared with collaborators. We explore the effects of different levels of prompt information sharing within collaborative text editors: not sharing anything, sharing a placeholder to indicate AI use; sharing details about how the resulting text was generated; and sharing everything, including how the prompt was formulated, in real-time. Sixteen participants wrote persuasive essays in pairs using all four techniques. Results suggest a strong preference for techniques that share more information about prompting activities for increased awareness. Our work shows that collaborative text editors should share more information among writers on when, how, and where AI is used.
Read the full abstract
Machine Learning
Follow the Geometry, Not the Model: Cold Start Semi-Supervised Learning
Modern semi-supervised learning (SSL) couples pseudo-label generation and classifier training, using the classifier's own confidence to select the pseudo-labels that are then used to update the model. In the cold-start regime, where at most a few labels per class are available, this coupling is ill-posed, since the classifier cannot supervise itself before it has learned. To address this problem, we propose VAST (Veracity-Aware Semi-Supervised Training), which decouples these two stages. Probabilistic beliefs over the unlabeled set are first inferred directly from the geometry of a frozen self-supervised embedding and only then distilled into an inductive classifier. The construction rests on the Veracity Matrix, a kernel-based structure that aggregates label evidence across the data manifold and admits an interpretation as a Dirichlet posterior under a per-observation powered-likelihood model. Additionally, we introduce Veracity Propagation, a self-terminating belief-spreading step that extends coverage beyond the kernel neighborhood of the labeled set. Under a controlled protocol in which all methods receive identical frozen embeddings and labeled sets, VAST outperforms the strongest graph-based SSL baselines at every operating point across three datasets, with statistically significant gains in 7 of 9 comparisons, while producing a deployable inductive classifier rather than requiring transductive graph inference. Compared with end-to-end confidence-gated SSL, we further find that these methods underperform in this setting and, in our experiments, do not consistently exceed labeled-only performance.
Read the full abstract
Robotics
EcoBoat: Design and Experimental Validation of an Autonomous Body-Board Boat For Cleaning Water Bodies
Cleaning water bodies such as swimming pools and lakes typically demands significant manual effort or reliance on costly, sensor-intensive robotic systems. This paper presents EcoBoat, a low-cost autonomous surface vehicle built on a modified hull, designed to collect floating debris in both indoor and outdoor water bodies. For indoor environments, EcoBoat uses ultrasonic sensors to detect boundaries and obstacles, combining random-walk motion with boundary-following behavior. For outdoor environments, it relies on GPS-based geofencing paired with a random-walk strategy for area coverage. A key design feature is a Tesla-valve-inspired collection basket that allows debris intake during forward motion while preventing its escape during turning or braking. Field experiments in pools and lakes validated the design through iterative refinement, demonstrating that a minimalist sensing and computation approach can achieve effective, versatile debris collection across diverse water bodies.
Read the full abstract
Machine Learning
Towards Identifying the Dataset Biases Causing Phantom Transfer
Recent work has shown that a teacher model can transfer a bias to a student through a dataset from which every explicit reference to that bias has been filtered out, and that none of the tested data-level defenses reliably removes or detects such a bias, even when the defender knows what to look for. To shed light on the hidden traces these biases leave, we embed a dataset's completions with Sentence-BERT, subtract the embeddings of clean reference completions, and compare the result to an open vocabulary of candidate topics. This simple signature identifies the topic of the bias with a Matthews correlation coefficient of 0.83 when the attacker's teacher model is known, and 0.46 when it is not. We also observe that different teacher models appear to express the same bias through different vocabulary.
Read the full abstract
Computation and Language
NeuroActiSep: Detecting Factual Hallucinations from Feed-Forward Neurons in a Single Pass
Hallucination in large language models reduces their reliability and slows adoption. Various white-box studies have used internal representations to detect patterns of truthfulness and factuality. A less-studied approach is to identify feed-forward neurons correlated with hallucination. In this empirical study, we propose a method to rank feed-forward neurons at the final prompt token and use it to investigate the feasibility of utilizing them for hallucination detection in the first forward pass. Using a neuron selection dataset built from CounterFact for identifying neurons correlated with hallucination, we transfer the selected neuron identities to train hallucination classifiers on other factual question-answering datasets. Our work provides empirical evidence that probes trained using the features from sparse sets of selected neurons perform on par with probes trained on internal representations. We also analyze the distribution of selected neurons and the effects of layer depth and neuron budget on detection performance. Our results show that randomly drawn neuron sets are also competitive at larger budgets, suggesting that signals correlated with hallucination are distributed across many neurons, while selection can help in extremely sparse sets.
Read the full abstract
Signal Processing
Vision Language Models for Radiation Patterns to Antenna Parameters
Observed radiation patterns often serve as a primary evidence of antenna's behavior, but translating them into meaningful interpretations is a nontrivial and expertise intensive task. This demand necessitates automated pattern interpretation, a diagnosis problem encountered in applications encompassing Radio Frequency (RF) surveillance, non cooperative emitter characterization and Over The Air (OTA) testing. This work addresses the incorporation of Contrastive Language Image Pre training (CLIP) and other recent vision language models to perform such a diagnosis. These models analyze the multimodal data and extract discriminative features directly from radiation pattern images, to train Machine Learning (ML) approaches for meaningful inferences on geometrical and performance parameters of the antenna. Performance of three such vision language models is demonstrated using RadPat 50K, a synthetic dataset of radiation pattern images generated for uniform linear arrays (ULAs). The radiation pattern images are processed by the vision language models to obtain discriminative features. The CLIP extracted features are processed by either ML classification models to infer antenna parameters number of elements, element spacing, weighting scheme, presence of grating lobe and steering angle, or ML regression models to infer parameters beam width, directivity and main lobe direction. ML models achieve accuracies exceeding 70 percent, highlighting the potential of multimodal Artificial Intelligence (AI) towards intuitive antenna analysis.
Read the full abstract
High Energy Physics (Phenomenology)
Probe of Solar Neutrino Magnetic Moments through Spin-Flavor Precession: Resonance Structure and Antineutrino Appearance
We investigate solar-neutrino spin–flavor precession (SFP) induced by magnetic moments in the three-active-flavor framework. For Majorana neutrinos, SFP can convert solar neutrinos into antineutrinos of different active flavors. In the Dirac case, SFP instead produces sterile right-handed states and can lead to the disappearance of active neutrinos. Using the full $6\times6$ Hamiltonians and GS98 and AGSS09 solar profiles, we examine propagation-eigenvalue crossings at $B_\perp=0$ and the projected magnetic couplings between the corresponding states. For normal mass ordering and $1\leq E_\nu/\mathrm{MeV}\leq20$, we confirm the absence of finite-density Majorana crossings. A magnetically coupled Dirac crossing emerges above approximately $12~\mathrm{MeV}$ but involves only a subdominant electron-flavor component, limiting resonant disappearance. Nonresonant Majorana conversion nevertheless offers a distinctive lepton-number-violating solar $\bar\nu_e$ signal, motivating our sensitivity study for the Jinping Neutrino Experiment. For a proposed $3~\mathrm{kt}$ detector operating for five to ten years, we project a 90% C.L. sensitivity of $P(\nu_e\to\bar\nu_e)\simeq(0.85-1.3)\times10^{-5}$. In the $\mu_{12}$-only benchmark, optimistic solar-core transverse magnetic fields of $B_\perp=7-10~\mathrm{MG}$ imply a reach of $|\mu_{12}|\simeq(2.3-4.1)\times10^{-13}\,\mu_B$, numerically below existing direct-scattering limits and commonly quoted stellar-cooling bounds. This could enable Jinping to provide one of the most stringent projected terrestrial sensitivities to Majorana transition magnetic moments.
Read the full abstract
Systems and Control
Computing Robustness to Sparse Diagonal Uncertainty
A new robustness metric $\nu$ was recently proposed as a substitute for the structured singular value $\mu$ to better capture robustness to sparse diagonal uncertainty, but its computation has remained an open problem. In this paper, we show that computing $\nu$ is equivalent to maximizing the spectral radius of a nonnegative matrix product. This equivalence allows us to transfer existing results on spectral-radius maximization to $\nu$, including a refined upper bound and conditions under which the bounds coincide. We then provide reformulations and structural results that enable an algorithm to solve the nonconvex optimization problem for nontrivial problems using global solvers. This also enables identification of the most fragile parts of the system. Our results do not yet provide a scalable solution for computing $\nu$, but they are an important step toward computability and interpretability.
Read the full abstract
Differential Geometry
Hamiltonian stationary Lagrangian currents in Ricci-flat Kähler manifolds
In this paper, we investigate Hamiltonian stationary Lagrangian currents with single-valued phases in open sets of Ricci-flat Kähler manifolds. We first establish the relation between phase and mean curvature for a class of integral Lagrangian currents in Ricci-flat Kähler manifolds. Then we derive several fundamental properties of integral Lagrangian currents with single-valued harmonic phases, including an almost monotonicity formula, an Allard-type regularity theorem, and the structure of limits of currents in this class. Finally, we apply the above results to study the regularity and rigidity of Hamiltonian stationary Lagrangian graphs in complex Euclidean space under certain conditions.
Read the full abstract
Analysis of PDEs
Global boundedness of the chemotaxis system with weakly singular sensitivity and nonlocal term in any dimension
This paper is concerned with the parabolic-elliptic chemotaxis system involving weakly singular sensitivity and a nonlocal source: $u_t=\Delta u-\chi\nabla\cdot\left(\frac{u}{v^k}\nabla v\right) +u^\alpha\left(r-\mu\int_\Omega u^\beta\,dx\right)$ and $0=\Delta v-v+u^\gamma$ under homogeneous Neumann boundary conditions in a smooth bounded domain \(\Omega\subset\mathbb{R}^N\) with \(N\ge1\), where \(\chi,r,\mu,\gamma>0\), \(k\in(0,1)\) and \(\alpha,\beta\ge1\). In view of the enhanced aggregation induced by singular sensitivity and the suppression of excessive population growth by the nonlocal damping, we identify sufficient conditions under which solutions remain globally bounded. We show that classical solutions are globally bounded in the following cases: \par\smallskip \begin{center} \small \setlength{\tabcolsep}{5pt} \setlength{\arrayrulewidth}{0.3pt} \renewcommand{\arraystretch}{1.25} \begin{tabular}{c|c|c|c} \multirow{2}{*}{$\beta>1$} & \multirow{2}{*}{$\gamma=1$} & $N=1$ & $1\leq\alpha<1+2\beta$ \\ \cline{3-4} & & $N\geq2$ & $\begin{gathered} 1\leq\alpha<2,\quad \alpha+\beta>2+\tfrac{N}{2},\\[-0.5mm] \text{or}\quad 2\leq\alpha<1+\tfrac{2\beta}{N} \end{gathered}$ \\ \hline \multirow{2}{*}{$\beta=1$} & $\gamma=1$ & $N=1$ & \multirow{2}{*}{ $\begin{array}{l@{\quad}l@{\quad}l} \text{Case 1:} & 1\leq\alpha<1+\tfrac{2}{N} & \text{if}\quad m_0<\tfrac{r}{\mu},\\[4pt] \text{Case 2:} & \alpha\geq1 & \text{if}\quad m_0\geq\tfrac{r}{\mu} \end{array}$ } \\ \cline{2-3} & $0<\gamma<\tfrac{2}{N}$ & $N\geq2$ & \\ \end{tabular} \end{center} \par \smallskip \noindent Here \(m_0:=\int_\Omega u_0\) denotes the initial total mass. It is worth noting that both the uniform-in-time \(L^p\)-estimate and the \(L^\infty\)-bound obtained by Moser iteration are derived without first establishing a uniform positive lower bound for \(v\).
Read the full abstract
Data Structures and Algorithms
Toward Optimal Time-Space Tradeoffs for Set Reconciliation
Set reconciliation, where two parties each holding a large set of elements aim to identify their set difference, is a fundamental task in many areas. Time (computation cost) and space (communication cost) are two important metrics in this problem, and much existing work optimizes one at the expense of the other, creating a clear trade-off. We study this trade-off through algorithmic upper bounds and matching space lower bounds. On one side, we propose XYZ-Sketch. For sufficiently large $d$, XYZ-Sketch achieves high-probability reconciliation for sets whose differing elements are uniformly random, using only $(1+\varepsilon)d$ elements for communication, while achieving $O(\log(1/\varepsilon))$ insertion time and expected $O(d\log V\log^{3/2}(1/\varepsilon))$ decoding time, where $d$ and $V$ denote the size of the difference between two sets and the universe size, respectively. On the other side, we establish a broad fixed-support canonical model and prove a matching space lower bound, establishing the asymptotic optimality of XYZ-Sketch. Our proof also establishes an extremality theorem resolving Walzer's conjecture. Experiments demonstrate the practical advantages of XYZ-Sketch, and the source code is available at https://github.com/djwj233/XYZ-Sketch.
Read the full abstract
Computer Vision
From Visual Attribution to Clinical Reasoning: Explainable Parkinson's Disease Screening from Hand-Drawn Patterns
Parkinson's disease (PD) manifests early neuromotor impairments that become observable in controlled hand-drawn patterns such as spirals and meanders, where tremor-induced oscillations, stroke irregularity, and curvature instability reflect underlying motor degradation. In this work, we present an explainable framework for PD screening from offline hand-drawn patterns that integrates discriminative visual modeling with clinically grounded reasoning. The predictive model captures distributed structural distortions and fine-grained texture variations. It is evaluated under subject-disjoint protocols to ensure reliable generalization. To move beyond black-box classification, we introduce a multi-stage explainability pipeline that combines visual attribution with structured symptom abstraction. Salient regions are identified using attention- and gradient-based localization, followed by extraction of clinically meaningful motor descriptors quantifying contour roughness, curvature irregularity, stroke variability, and tremor-frequency energy. These descriptors are subsequently translated into coherent clinical rationales through a language-based reasoning module, linking model evidence to established PD symptomatology. By bridging visual attribution and clinical interpretation, the proposed framework advances interpretable document intelligence for neurological screening using hand-drawn patterns. Experimental results on publicly available Parkinson's disease handwriting datasets demonstrate competitive predictive performance and clinically consistent explanations.
Read the full abstract
Lattice Field Theory
Thermal modifications of the B-meson spectrum
A first-principles investigation of heavy-light meson behaviour in hot QCD matter is essential for the interpretation of experimental results associated with open heavy flavour productions in relativistic heavy-ion collision experiments. Using anisotropic lattice ensembles from the FASTSUM collaboration with Nf=2+1 dynamical Wilson-clover fermions at non-zero temperatures, we study the B and B_s spectra at non-zero temperature. We use relativistic light quark propagators, while the b quark propagators are computed with a non-relativistic effective theory (NRQCD). We find that above T_c, thermal effects on the B meson states are more significant than those on the B_s states. Also, our results support the dissolution of the B-meson bound states above T_c.
Read the full abstract
Computer Vision
Context-Aware Mutual Learning for Blind Image Inpainting and Beyond
Blind image inpainting, aiming to recover contaminated images in the case of unknown masks, is a challenging task. Motivated by the perspective of human vision and knowledge, blind image inpainting can be decomposed into two stages: mask estimation and image inpainting based on the estimated mask. The two-stage idea exhibits evident advantages in enhancing inpainting quality and augmenting the generalization capability of unknown real-world contamination by explicitly employing the estimated mask for image inpainting compared to one-stage scheme. This two-stage idea has also been intuitively implemented. However, existing two-stage methods excessively emphasize the unilateral relationship of mask estimation to image inpainting, and may overlook the mutual relations between them. Specifically, mask estimation can provide more contextual semantics for image inpainting to strengthen the understanding of semantics, and image inpainting can offer more contextual details (e.g., textures and edges) for mask estimation to improve the learning of details. In this work, we propose a novel Context-Aware Mutual Learning (CAML) framework for blind image inpainting that joints mask estimation and image inpainting to mutually exploit contextual information. In the CAML framework, we design the Inpainting-Guided Context-Mutual (IGCM) learner to acquire the complementary contextual details from image inpainting for assisting mask estimation, and the Estimation-Guided Context-Mutual (EGCM) learner to strengthen the understanding of contextual semantics from mask estimation for assisting image inpainting. Ablation studies validate the efficacy of our CAML. Extensive experiments show that our CAML achieves state-of-the-art performance on both blind image inpainting and additional vision tasks, i.e., snow removal, shadow removal, and watermark removal, indicating its superiority.
Read the full abstract
Computers and Society
A latent dimension of Condorcet's jury theorem for multiple AI advisers
When the same question is asked of multiple AI advisers, as in self-consistency and LLM-as-a-judge panels, Condorcet's jury theorem predicts that adding independent, competent advisers makes the majority more reliable. The theorem, however, has a latent dimension when viewed from the user's vantage: adding advisers also makes disagreement more visible. A binomial model reveals that this “visible dissent” becomes nearly inevitable as the number of advisers grows, and that reliability and disagreement approach certainty at rates that cross at an adviser accuracy of 4/5 (0.8); below it, visible dissent eventually becomes more likely than a correct majority. Even ideal panels of independent and competent advisers can be correct in aggregate but appear divided; such disagreement does not by itself indicate aggregation failure. The way advisers split also provides a common basis for predictive multiplicity, reconciliation load, and reliance miscalibration. These results separate aggregation from disclosure and turn the latter into testable questions about how disagreement should be presented and interpreted.
Read the full abstract
Computer Vision
Lightweight Generalized DeepFake Face Detection with WAVIE: Wavelet Augmented Vision Intermediate Embeddings
Deepfake detection systems often exhibit significant performance degradation when deployed on unseen manipulation methods, limiting their reliability in real-world multimedia environments. This lack of generalization poses critical challenges for misinformation mitigation, digital forensics, and human-centric AI systems. Existing detectors perform well on the forgery methods they are trained on, but their accuracy drops sharply on unseen pipelines. To bridge this generalization gap, we propose WAVIE (Wavelet Augmented Vision Intermediate Embeddings), an end-to-end architecture that combines complementary spatial and frequency cues on top of a frozen CLIP backbone. WAVIE projects intermediate transformer embeddings through a lightweight learnable module, applies a three-level Daubechies-6 (db6) discrete wavelet transform (DWT), refines the low-frequency branch while preserving the high-frequency branch, reconstructs the feature via inverse DWT, and performs classification. Trained only on FaceForensics++, WAVIE achieves AUROC = 0.852 on Celeb-DF-v1, 0.852 on Celeb-DF-v2 and 0.831 on WildDeepFake (WDF) at the frame level, outperforming several state-of-the-art generalization baselines. Extensive ablation studies confirm the importance of both the wavelet module and the intermediate-feature aggregation for cross-dataset performance, highlighting the necessity of jointly leveraging spatial and frequency domains. These results position WAVIE as a strong baseline for deepfake detection in the wild.
Read the full abstract
Quantum Physics
From breakfast, lunch, and dinner to the Bell-inequality tetrahedron
A simple pedagogical discussion and visualization of certain Bell inequalities is presented with the help of a system involving two \textquotedblleft twins\textquotedblright, originally discussed in 2605.03104. These twins answer identically when the same `question' is posed, here exemplified with: Did you like breakfast/lunch/dinner? In analogy, for two entangled particles at distant locations, the `twin-like' quantum state is such that the same outcome for the same measurement (i.e. spin direction) is obtained. In the space $(X,Y,Z)$ of mixed moments (i.e. $X$ refers to breakfast-lunch correlation, being $1$ for same answers and $-1$ for opposite ones), the space of Bell local models is contained in a tetrahedron, while the quantum space is bound by an elliptope that embeds the tetrahedron. The whole no-signalling region in the $(X,Y,Z)$ space is the cube $[-1,1]^{3}.$ The twin scenario applies e.g. to the decay of the Higgs into fermions.
Read the full abstract
Algebraic Geometry
Deformation invariance of canonical nefness in smooth Kahler morphisms
Let $f\colon X\to\Delta$ be a smooth Kähler morphism from complex manifold $X$ to the unit disc. We prove that the canonical bundle $K_{X_t}$ is nef for every fiber as soon as it is nef for one fiber. This answers, in arbitrary dimension and in the Kähler setting, the deformation-openness problem for non-nefness of the canonical bundle raised by Campana and Peternell.
Read the full abstract
Information Theory
Hermitian Duality and Syndrome Structure of CSS-Type Codes over the ring $\mathbb{Z}_q[i]$
We study the algebraic structure of principal ideal codes and CSS-type stabilizer constructions over the ring $ R_q=\mathbb Z_q[i],$ where every prime divisor of $q$ is congruent to $1$ modulo $4$. Although such ring-based constructions have recently been considered in the context of classical and quantum error correction, the precise relationship among principal ideal cardinalities, Hermitian duality, algebraic cosets, and stabilizer syndromes requires further structural analysis. We obtain cardinality formulas for principal ideals and their annihilators. For a length-one principal ideal code $C=\langle\alpha\rangle$, we show that its Hermitian dual is $ C^{\perp_H}=\operatorname{Ann}(\sigma(\alpha)). $ For nested codes satisfying $ C_2^{\perp_H}\subseteq C_1\subseteq C_2, $ we determine the corresponding CSS-type stabilizer and prove that the kernel of the physical $X$-error syndrome map is $ \ker(\operatorname{Syn}_X)=C_2. $ Consequently, $C_2/C_1$ parametrizes logical $X$-operator classes and $R_q^n/C_2$ parametrizes physical $X$-error syndrome classes. Using this syndrome quotient, we construct a transversal of $C_2$ in $R_q^n$ whose elements have pairwise distinct physical $X$-error syndromes. The corresponding $X$-type error family is correctable by stabilizer syndrome measurement, yielding a syndrome-based recovery procedure that is consistent with the stabilizer structure. Explicit examples illustrate the resulting duality, cardinality, and syndrome structure.
Read the full abstract
Symbolic Computation
Probably correct row echelon form in the F4 algorithm
The computation of row echelon form is one of the main bottlenecks in the F4 algorithm. Several state of the art implementations use a probabilistic algorithm attributed to Monagan, Pearce, and Steel to accelerate this computation. Despite this, no bound on the probability that the algorithm returns an incorrect result appears to be available. In this paper, we provide such a bound. Furthermore, building on this result, we propose a Las-Vegas variant of the F4 algorithm and show experimentally that it can outperform deterministic F4 on some classical examples.
Read the full abstract
Robotics
EMoG: Emotion-Modulated Gait Generation for Expressive Humanoid Locomotion
Existing humanoid locomotion systems primarily focus on stability and task execution, while integrating expressiveness with explicit locomotion control remains challenging. We propose EMoG, an emotion-modulated gait generation framework for expressive humanoid locomotion. EMoG introduces an emotional-style code with continuously adjustable intensity. Conditioned on this code and physical commands, a lightweight MLP generates expressive, command-consistent periodic gait trajectories in real time, which are tracked by a unified reinforcement learning policy for physical execution. To support training, we collect a large-scale emotion-annotated gait dataset from professional performers and develop an automated pipeline to extract physically consistent periodic gait cycles. EMoG also integrates an LLM-based parser that converts free-form language into emotional style and motion parameters for interactive control. Experiments demonstrate that our system achieves continuous gait-style modulation with perceptible expressive cues while maintaining command tracking. EMoG provides a practical approach to parameterized emotional-style walking for human-robot interaction.
Read the full abstract
Sound
Exploiting Speech LLM Representations for Multilingual and Cross-Lingual Parkinson's Disease Detection
Speech Large Language Models (Speech LLMs) have shown strong performance across diverse tasks, yet their utility for pathological speech analysis remains underexplored. In this work, we investigate the effectiveness of internal representations from encoder and decoder components of Speech LLMs for Parkinson's Disease (PD) detection across multilingual and cross-lingual settings. Our findings reveal that encoder representations consistently outperform their decoder counterparts in most models and settings and that pathological cues may be progressively attenuated as audio representations are projected into the language model space. We further show that generative outputs are less reliable for clinical tasks compared to internal representations. To leverage information spread across multiple layers, we propose a Squeeze-and-Excitation (SE)-based dynamic layer aggregation framework, which surpasses best-layer selection in multiple experiments, suggesting that PD-relevant acoustic cues are distributed across transformer layers rather than concentrated in one.
Read the full abstract
Classical Analysis and ODEs
On the weighted weak-type constant for the dyadic square function
We present an explicit construction of examples showing that the estimate $ \|S(f)\|_{L^2(w)\to L^{2,\infty}(w)}\lesssim \big([w]_{A_2} \log(1 + [w]_{A_2})\big)^{1/2}$ for the dyadic square function is sharp in terms of the characteristic $[w]_{A_2}$.
Strongly Correlated Electrons
Kagome lattice candidate URhSn: Measured Bragg diffraction patterns and theory for hexagonal and trigonal Sohncke phases
Ternary intermetallics use a ZrNiAl-type chemical structure known as a kagome system. Complexity observed in the phase diagrams of these compounds is attributed to the geometric frustration. The 5f-electron compound URhSn exhibits two phase transitions at 16 K and 54 K. No super-lattice reflections in neutron powder diffraction patterns are detected in the intermediate range of temperatures (16 K - 54 K). Recent resonant x-ray diffraction patterns for uranium ions in the intermediate phase suggest a chiral structure and a trigonal Sohncke space group. It is firmly established that a simple hexagonal space group describes the parent structure at room temperature. A ferroic order parameter that includes hexadecapoles is shown to characterize the trigonal Sohncke phase. Resonant x-ray diffraction by this phase is fully investigated with our symmetry informed theory. It repairs symmetry in the original data analysis by using a grey group, and it lifts an unjustified spatial condition on uranium positions. The theory uses axial atomic multipoles that satisfy sum-rules established in the first instance for x-ray dichroic signals. A confrontation between observed and calculated diffraction patterns lends support to a trigonal Sohncke phase, and exposes grounds for additional experimental work on an enigmatic compound.
Read the full abstract
Quantum Physics
Indistinguishability Theory for Identical Particles with Invariant Degrees of Freedom
Identical particles have dynamically invariant labels in all setups where their degrees of freedom can be partitioned into two parts, which we call internal and visible, with the visible part subject to unitary evolution, while the dynamically invariant internal part accounts for the partial distinguishability of particles. We give the explicit form of the visible state in terms of the indistinguishability function, generalizing the standard symmetrization/antisymmetrization postulate for bosons/fermions with internal modes. The indistinguishability function on the symmetric group accounts for the permutation symmetry of the dynamically invariant label state and gives a self-contained description of the symmetry spectrum of the visible state. It is shown that the indistinguishability of single particles emitted independently from a stable source is completely characterized by the projective measures on the symmetry spectrum. We reveal a hierarchy of successive upper bounds on the projective measure of indistinguishability in terms of marginal projective measures. We point out an experimentally feasible way to get the upper bounds on the indistinguishability of an arbitrarily large number of single photons by direct experimental readout of their marginal projective measures. We also analyze the indistinguishability of coherent superpositions and convex mixtures and resolve a recently posed problem.
Read the full abstract
Sound
Differentiable Digital Signal Processing Mixture Model-Guided Diffusion for Synthesis Parameter Estimation from Harmonic Sound Mixtures
A differentiable digital signal processing (DDSP) autoencoder reconstructs a monophonic harmonic sound through three types of synthesis parameters: fundamental frequency, loudness, and timbre features. To handle mixtures of harmonic sounds within the DDSP approach, we have previously proposed a DDSP mixture model (DDSPMM). It represents a mixture as the sum of source signals synthesized by the decoders of pretrained DDSP autoencoders. Although DDSPMM enables direct estimation of synthesis parameters of each source from mixtures, it does not explicitly model temporal variations in the synthesis parameters and can produce excessive temporal fluctuations. In this paper, we propose a method for estimating synthesis parameters with temporally plausible trajectories by incorporating a denoising diffusion probabilistic model (DDPM) into the DDSPMM-based estimation. The DDPM is trained as a generative model of synthesis parameters. During estimation, the proposed method guides the DDPM reverse diffusion process with the reconstruction error between the observed mixture and the mixture synthesized by DDSPMM from the current estimates. Experiments on woodwind and string instrument ensembles showed that the DDPM-based regularization improves synthesis parameter estimation by imposing temporal plausibility on the estimated trajectories.