Machine Learning
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 15 September
Hyperbolic geometry provides a natural inductive bias for genomic representation learning, but existing hyperbolic genomic models primarily use Lorentz convolutions to learn local sequence representations, while their residual pathways do not directly aggregate full Lorentz representations. We propose HyCoSeq, a contextual hyperbolic representation learning framework for genomic sequences. HyCoSeq incorporates weighted Lorentzian residual aggregation into multi-curvature Lorentz encoding, allowing full Lorentz representations to participate directly in geometry-consistent local aggregation. It further introduces a bidirectional long short-term memory network that integrates information from both sequence directions to learn contextual relationships among local representations at different positions within a genomic sequence, thereby extending local hyperbolic convolutional encoding to sequence-level contextualized representations. Extensive experiments across diverse genomic tasks show that HyCoSeq outperforms existing hyperbolic baselines and, without large-scale genomic pretraining, achieves competitive performance against substantially larger pretrained DNA language models.
High Energy Physics (Theory)
Positivity Bounds in $\mathcal N =1$ Supersymmetry
For a low-energy Effective Field Theory (EFT) to admit a consistent ultraviolet (UV) completion, it must adhere to the fundamental principles of locality, unitarity, analyticity, and Lorentz invariance. This leads to positivity constraints on certain Wilson coefficients via dispersion relations of $2\rightarrow2$ forward elastic amplitudes, which carry significant implications for both theoretical consistency and experimental phenomenology. In this work, we extend this bootstrap framework to $\mathcal N = 1$ supersymmetric theories, where the super-Poincaré algebra relates the bosonic and fermionic degrees of freedom within a single supermultiplet. Supersymmetric Ward identities (SWIs) enforce exact linear relations among component scattering amplitudes. Consequently, the Wilson coefficients associated with different $2\rightarrow2$ processes are mutually constrained, rendering their respective positivity bounds dependent. Focusing on dimension-8 operators, we explicitly show the positivity bounds on quartic interactions involving scalars, fermions and gauge fields, and demonstrate how they are related as a direct consequence of the SWIs. Furthermore, we expect that the algebraic nature of this framework naturally extends to loop-level superamplitudes and higher-point processes, providing a unified bootstrap perspective on supersymmetric EFTs.
Read the full abstract
Data Structures and Algorithms
High-Multiplicity Bin Packing is FPT
Bin packing asks whether a collection of items can be packed into at most a given number of bins of a given capacity. We consider the high-multiplicity setting with $d$ distinct item sizes, in which both the item sizes and the number of items of each size are encoded in binary. Goemans and Rothvos (JACM 2020) gave an XP algorithm parameterized by $d$. Whether this problem is fixed-parameter tractable (FPT) in $d$ has remained a central open problem. We resolve this question by giving a deterministic $O^*(2^{d^{O(d)}})$-time algorithm. We formulate bin packing as an integer linear program (ILP) with at most $(d+1)d^d$ variables. A bin configuration records the number of items of each type in one bin. We partition these configurations by their coordinate remainders modulo $d$. For each class, we use one variable for the bin count and $d$ variables for the total item counts. The convex hull of each class has the integer decomposition property, which guarantees that every feasible ILP solution corresponds to a packing.
Read the full abstract
Logic
Multiplicatively idempotent HSI algebras satisfy all equations of $\mathbb{N}$
An algebra with binary operations $+,\cdot,\uparrow$ and constant $1$ is called an HSI algebra if it satisfies the basic commutative semiring laws for $+,\cdot,1$ on~$\mathbb{N}$ as well as the familiar index laws for exponentiation $\uparrow$. These basic axioms, known as the “High School Identities” are known to be incomplete, and an algebra satisfying $\HSI$ but failing an equation valid on ${\bf N}:=\langle \mathbb{N};+,\cdot,\uparrow,1\rangle$ is called a Gurevič algebra. It is currently unknown if there is an algorithm to recognise finite Gurevič algebras, and the best current result is that there exists a 12-element Gurevič algebra, and that none of the five 2-element HSI algebras are Gurevič algebras. We explain how the work of Alex Wilkie can be used to provide an algorithm for deciding validity of the equational laws of $\langle \mathbb{N};+,\cdot,\uparrow,1\rangle$, and use this to show that multiplicatively-idempotent HSI algebras satisfy all valid laws of $\langle \mathbb{N};+,\cdot,\uparrow,1\rangle$. As consequences of this result, we show that all 44 HSI algebras on 3 elements lie in the variety of $\langle \mathbb{N};+,\cdot,\uparrow,1\rangle$ (that is, are not Gurevič algebras), as well as 597 of the 657 models on 4 elements and 11158 of the 13577 models on 5 elements. A further consequence is that every Brouwerian lattice lies in the variety of $\langle \mathbb{N};+,\cdot,\uparrow,1\rangle$ (up to a simple term equivalence), showing that the variety of $\langle \mathbb{N};+,\cdot,\uparrow,1\rangle$ has continuum many subvarieties. The constant-free signature is also explored, and it is shown that in this case all $2$-element models of the constant-free High School Laws satisfy all valid constant-free laws in $\langle \mathbb{N};+,\cdot,\uparrow\rangle$.
Read the full abstract
Information Theory
Constructions of LCPs and LCD codes from twisted Reed-Solomon codes
Linear complementary pairs (LCPs) and linear complementary dual (LCD) codes have important applications in orthogonal direct-sum masking (ODSM), which provides effective countermeasures against side-channel attacks and fault-injection attacks. While LCD codes have been extensively investigated, comparatively fewer results are available for general LCPs. In this paper, we further investigate LCPs of twisted Reed–Solomon (TRS) codes. We derive necessary conditions for two TRS codes to form an LCP and establish several sufficient conditions and explicit constructions. We also study LCD codes constructed from TRS codes and investigate the security parameters of the resulting LCPs. Furthermore, under suitable conditions, we obtain MDS LCPs of TRS codes.
Read the full abstract
Optimization and Control
Invariance of Hurwitz-Stability of Polynomials of Degree Five under Positive Hadamard Powers
A complete characterization of the stability-preserving exponent set for fractional Hadamard powers of a monic Hurwitz-stable polynomial f of degree five is presented. The stability problem is reduced to the analysis of a single scalar function depending only on three parameters formed from the coefficients of the polynomial f. This reduction leads to a unique stability threshold $p_*(f) \in (0,1)$ such that the $p$-th Hadamard power of $f$ is Hurwitz stable if and only if $p > p_*(f)$. Consequently, the stability-preserving exponent set is precisely $(p_*(f),\infty)$. This threshold depends smoothly on the parameters and provides a global coordinate on the admissible parameter region. Finally, smooth dependence is illustrated by a one-parameter family of Hurwitz-stable polynomials whose complex-conjugate zeros approach the imaginary axis.
Read the full abstract
Computer Vision
NeuroSymbEAD: A Large Scale Neuro-Symbolic Caption Dataset for Omni-Directional Embodied Autonomous Driving
This paper introduces NeuroSymbEAD, a large-scale neuro-symbolic caption dataset featuring an ego-centric knowledge graph (KG) of static and dynamic objects annotated with classes, categories, heading directions, orientations, and distances from the ego-vehicle. These annotations are used on the KITTI-360 dataset to generate multilevel textual captions representing a lightweight version of an ego-centric scene map. Outdoor scene-map reconstruction, visual recognition, and object grounding establish baselines for driving common sense and traffic/scene understanding. For these purposes, natural language-based grounded captioning of objects and their complex relationships is a widely adopted contextual representation for indoor scene tasks. Neuro-symbolic representations have proven effective in handling structured information for various computer vision and language applications. Our data annotation pipeline allows the generation of varied map segments, populating simulated or real objects within the bounding boxes predicted by any 3D object detection network, and building hierarchical text captions. We benchmark our neuro-symbolic and ontological caption generation using pre-trained grounding and learned auto-regressive captioning networks. By converting 3D driving scenes into structured ego-centric language, NeuroSymbEAD provides a benchmark for vision-language and foundation models for traffic-scene explanation, 3D reasoning, and interpretable autonomous-driving perception.
Read the full abstract
Analysis of PDEs
Improved Regularity for Nonlocal Hamilton–Jacobi Equations with Superlinear Hamiltonians
We investigate the regularity of viscosity solutions to a class of nonlocal Hamilton-Jacobi equations driven by x-dependent integro-differential operators and coercive superlinear Hamiltonians. We first establish Hölder regularity for bounded viscosity solutions under general structural and continuity assumptions on the underlying Lévy measures, without imposing any ellipticity condition on the nonlocal operator. The Hölder exponent is given explicitly in terms of the order $\sigma$ $\in$ (0, 2) of the operator and the growth exponent m > 1 of the Hamiltonian. In particular, our approach applies to arbitrary superlinear Hamiltonians, including the delicate regime 1 < m < $\sigma$ < 2, and yields an improved regularity exponent when $\sigma$ $\in$ (1, 2). Assuming in addition a weak ellipticity condition on the nonlocal operator, we prove that viscosity solutions are globally Lipschitz continuous. The proof combines the Hölder regularity supplied by the coercive Hamiltonian with the regularizing effect of the nonlocal diffusion through an Ishii-Lions argument, allowing us to treat Hamiltonians with arbitrary superlinear growth. Finally, we provide a counterexample showing that, in the absence of ellipticity, Lipschitz regularity may fail if the spatial dependence of the Lévy measures is merely Hölder continuous, thereby illustrating the sharpness of our continuity assumptions.
Read the full abstract
Multiagent Systems
Multi-Agent Learning with Cooperation-Driven Optimization Dynamics
Multilayer Artificial Neural Networks trained via backpropagation are the basic blocks of many, more complex, classification algorithms. Their strength lies in the possibility of realizing, with arbitrary precision, any function. This result comes at the cost of the large number of involved parameters to be optimized. In this work, we propose a mechanism for cooperation, i.e., information exchange among several artificial neural networks, with the goal of reducing model complexity while maintaining performance. More precisely, we consider several "small" agents, i.e., containing fewer parameters than a reference "large" one, that during training share their predictions by incorporating this information into the loss function and thus directly influence weight updates. We consider several strategies for implementing cooperation, e.g., the voter model, majority model, and weighted average model based on an agent's confidence in its prediction. We numerically compare the accuracy of those strategies on several standard benchmarks. Our results support the claim that several small agents can outperform a single large model on a given classification task; the shared signals affect each agent's optimization algorithm by modulating both the descent direction and the step size, converging toward a global consensus. The proposed proof-of-concept significantly reduces the number of parameters to be trained while preserving comparable performance, thereby limiting computational resource usage.
Read the full abstract
Statistics Theory
Pitman closest equivariant estimators under multivariate scale and location–scale models
For multivariate scale and location–scale models with independent components, we extend the univariate results of Zhou and Nayak (2012) and derive optimum equivariant estimators under the generalized Pitman closeness criterion. We first show, by a counterexample, that in the multivariate case the Pitman closeness comparison within the class of equivariant estimators is not transitive, so that a Pitman closest equivariant estimator does not exist in general. We then enlarge the transformation group by the coordinate permutations—equivalently, impose the formal equivariance principle of Berger (1985) across isomorphic component problems, in the spirit of the separable rules of Robbins' (1951) compound decision theory—and show that within the resulting restricted class an optimum is restored. A multivariate median lemma based on strictly convex losses then yields explicit Pitman closest equivariant estimators of the scale parameters, powers of the scale parameters, and the location parameters, given by median-adjusted versions of any given equivariant estimator. Applications to the multivariate uniform and multivariate normal distributions are worked out in detail. Monte Carlo experiments for the Rayleigh distribution and for a competing risks model with Rayleigh component lifetimes confirm that the proposed estimators dominate the maximum likelihood and Bayes estimators under the Pitman closeness criterion, and a real industrial data set on ball bearing failure times illustrates the feasibility of the method in practice.
Read the full abstract
Cryptography and Security
ROSETTA: Efficient and Accurate Privacy-Preserving LLM Decoding via Hybrid CKKS/TFHE Evaluation
Generative large language models (LLMs) have achieved state-of-the-art performance on many real-world tasks such as code generation and question answering. These models predominantly rely on an autoregressive decoding strategy that generates output tokens sequentially. However, their pervasive deployment raises serious privacy concerns, motivating private inference frameworks based on fully homomorphic encryption (FHE). A major limitation of existing FHE frameworks is their inefficiency in evaluating nonlinear operations, which incur substantial overhead and dominate the decode stage. In this paper, we propose ROSETTA, a hybrid CKKS/TFHE framework that overcomes this limitation. We first observe that nonlinear operations in the decode stage exhibit heterogeneous workload patterns, which can be handled effectively via a hybrid approach. We then realize this with two key contributions: 1) an adaptive segmented lookup-table protocol based on TFHE that enables efficient and accurate evaluation of nonlinear operations; and 2) a scheme-aware operator-selection framework that automatically assigns each nonlinear operator to CKKS or TFHE to minimize end-to-end decoding latency. We demonstrate that ROSETTA achieves up to $4.8\times$ Softmax speedup and $1.5$–$2.1\times$ end-to-end speedup over the SOTA framework CacheMir.
Read the full abstract
Data Structures and Algorithms
Improved Regular Expression Matching with Simple Backreferences
A regular expression with backreferences (rewb) specifies a set of strings formed by characters combined with concatenation, union, star operators, and backreferences. A backreference consists of a capturing group $(\cdot)_i$ and a reference $\backslash i$. The substring matched by the reference must match the substring matched by the corresponding capturing group. Given a rewb $R$ and a string $Q$, the rewb matching problem is to decide whether $Q$ is one of the strings specified by $R$. In full generality, rewb matching is NP-complete, but efficient solutions exist for various subclasses. In the paper, we focus on rewb containing a single capturing group and $k$ references. For this class, Uezato~[CPM 2026] gave an $O((k n^2 m^2)$ time and $O(n^2m^2)$ space algorithm, where $m$ is the length of the regular expression $R$ and $n$ is the length of the string $Q$. For the special case of $k=1$, Nogami and Terauchi~[MFCS 2025] gave an $O(n^2m^2)$ time and $O(n+ m^2)$ space algorithm. On the other hand, Nogami, Nakamura, and Terauchi~[arXiv 2026] gave a conditional lower bound, showing that we cannot solve the problem in $O(n^{2-\epsilon} \mathrm{poly}(m))$ for any $\epsilon > 0$ assuming the orthogonal vector hypothesis. Our main result is a new algorithm that runs in $O(n^2m)$ time and uses $O(nm)$ space. This improves the above results (by a factor of $km$ and $m$, respectively) and the former's space bound (by a factor of $nm$). We also show how to extend our algorithm to handle a slightly more general class of ordered and single-nested rewbs.
Read the full abstract
Combinatorics
Further results on non-negativity conjectures for copartition products
Burson and Eichhorn proposed infinite and finite coefficientwise non-negativity conjectures for products arising from copartitions. We obtain several further results. First, both products admit decompositions into elementary local blocks, and the finite conjecture reduces exactly to its diagonal specialization. The finite conjecture is proved when the first truncation parameter is one or when the two residue parameters are equal. We also prove that every finite product has non-negative coefficients below the third shifted signed exponent. For fixed finite parameters, the coefficient sequence is shown to be eventually quasipolynomial; an explicit period bound, an explicit onset for the quasipolynomial formula, and the leading term on every residue class are obtained. This yields eventual strict positivity, apart from forced odd-degree zeros in one solved diagonal case. For the infinite conjecture, we prove non-negativity under the broader condition $a\equiv b\pmod m$, which includes the known case $a=b$. Finally, for arbitrary $b\mid a$, we improve the uniform initial non-negative range from degrees below $a+m$ to degrees below $a+2m$.
Read the full abstract
Computation and Language
Lit3R: Retrieve-Relate-Read for Evidence-Grounded Question Answering over Scientific Literature
We describe tus-nlp's Lit3R (Retrieve-Relate-Read) system for LitTraceQA, a shared task for literature-grounded question answering that requires systems to retrieve relevant papers, identify supporting evidence, and generate answers. Lit3R combines off-the-shelf retrieval, reranking, and large language model (LLM) components without task-specific training. The retriever iteratively combines BM25-based sparse and dense retrieval, cross-encoder reranking, and LLM-based verification, and complements retrieval based on the question with paper-to-paper expansion. The reader first identifies supporting evidence within individual papers and then synthesizes evidence across papers to produce the final answer and evidence trace. On the official test set, our system ranked 4th on the leaderboard. Our code is available at https://github.com/tus-ist-nlp/littraceqa.
Read the full abstract
Solar and Stellar Astrophysics
Promise and pitfalls of plasma emission as an exo-space-weather tool
Significant observational effort has been spent on identifying stellar analogues to solar type II and III bursts, which are plasma emission that is produced when coronal mass ejections and fast electron beams, respectively, propagate through the corona and wind. The sensitivity of these bursts to ambient plasma and their association with energetic transient particle flux makes them powerful diagnostics of exo-solar space weather. However, analyses of stellar bursts often rely on the assumption that the coronae of the stars that produce them are similar to the solar corona or that the instability requirements are the same as for the Sun. By extension, the assumption is that the forms of stellar bursts are very similar to that of solar bursts. I introduce a simple framework and the python package, swabs, to predict the shapes of stellar type II and III bursts to understand how they may deviate from the shapes of solar bursts. I present the burst expectations in the range of 10–170 MHz for two well-studied active stars: the M dwarf AD Leonis, and the G dwarf EK Draconis. The results for these stars suggest that the coronae of active stars may lead to bursts that have substantially (1) delayed arrival times to the observing band, (2) shallower drift rates, and (3) longer durations than solar bursts. The hot and fast winds may also inhibit the development of type~II and III bursts, regardless of the Alfvén speed. Non-isothermal winds reduce this inhibition, but may increase the delays and durations of the bursts. This work demonstrates that stellar bursts may deviate radically from their solar analogues. These deviations need to be considered in how we conduct searches for stellar bursts and how we evaluate the coronal conditions that cause the burst structures.
Read the full abstract
Data Structures and Algorithms
Improved Approximation for Unsplittable CVRP via a Greedy Approach
We devise a polynomial-time $3.159$-approximation algorithm for the metric unsplittable Capacitated Vehicle Routing Problem. We build on the Relative Greedy Algorithm suggested by Traub (2025), which can be considered as a variant of the LP rounding algorithm of Friggstad, Mousavi, Rahgoshay, and Salavatipour (2025). Our main ingredient is the Average Greedy Algorithm, a new algorithm that controls both tour costs and the coverage of clients with high demand. This additional control enables a sharper averaging argument for the cost of subsequent greedy choices. Similarly to Zhao and Xiao (2026), combining the Average Greedy with variants of tour partitioning and a matching algorithm yields the final approximation guarantee.
Read the full abstract
Computer Vision
PiPS: Post-Hoc Prototypical Explanations for Interpretable Semantic Segmentation
With the increasing deployment of deep neural networks in critical systems, such as medical diagnostics and autonomous vehicles, ensuring their interpretability is crucial to building trust in decision-making systems. In the field of explainable artificial intelligence, prototype-based reasoning has gained particular popularity, as it mimics human cognitive processes by explaining model decisions based on visual similarity under the looks like this paradigm. While this paradigm has been thoroughly investigated in the context of global image classification, the interpretability of dense predictions, particularly semantic segmentation, remains largely unexplored despite its immense importance in tasks requiring precise object localization. Existing prototype-based interpretable segmentation models rely on ante-hoc architectures, which entails significant limitations because they require costly training from scratch and modifications to the network structure, ultimately leading to a noticeable drop in predictive performance compared to standard black-box models. To address this issue, we propose PiPS (Post-hoc interpretable Prototypical Segmentation), the first fully post-hoc solution for generating prototypical explanations for semantic segmentation models. Our method enables the extraction of intuitive, spatially localized explanations from any pre-trained network without modification or fine-tuning, thereby preserving 100% of the model's original predictive performance. This approach opens a new avenue for the safe and cost-effective deployment of transparent systems in advanced computer vision tasks. Codebase available at https://github.com/gmum/PIPS.
Read the full abstract
Dynamical Systems
An Efficient Symbolic Algorithm for Computing Lyapunov Constants in Planar Switching Systems
Lyapunov constants are a crucial tool for analyzing bifurcation behavior in switching systems. This paper proposes an efficient algebraic symbolic algorithm for computing Lyapunov constants in planar switching systems. By mapping the vector fields into the complex domain, we construct a normal form algorithm based on Laurent poly?nomials. The classical Poincaré map method requires repeated symbolic integration, which may lead to substantial computational difficulties at high orders. Our ap?proach improves computational efficiency by replacing continuous integration with direct algebraic operations. We apply this approach to investigate two switching models. For a generalized switching quartic Liénard system, the algebraic method extracts the center conditions and proves the existence of 10 small-amplitude limit cycles, establishing a new lower bound for its cyclicity. Furthermore, a physically motivated circuit-level modification of the Alpazur oscillator is investigated. We show that at most one small-amplitude limit cycle can bifurcate from the center and that this upper bound is attainable, illustrating the applicability of the proposed algorithm to a practical switching circuit. This application shows that our method provides a systematic framework for analyzing and interpreting complex dynamical phenomena arising in practical piecewise smooth systems.
Read the full abstract
Human-Computer Interaction
Disrupted Companionship: A Risk Assessment Framework and Cross-Platform Quantitative Analysis of Psychosocial Responses to AI Companion Disruptions
AI companions can provide meaningful relationships, yet these relationships remain vulnerable to platform-initiated changes. We study AI companion disruptions: platform changes that alter or terminate users' ongoing companionship with an AI. We compile 30 disruption events across major platforms, develop a taxonomy of six disruption types, identify three broad reasons for disruption, and propose a risk-assessment framework comprising four dimensions: relational discontinuity, population vulnerability, communication deficit, and transition-support deficit. Using longitudinal Reddit data, we estimate community-level psychosocial responses with a hierarchical Bayesian interrupted time-series model incorporating predictive controls. Across events, disruption onset was associated with immediate increases in anxiety, stress, suicidal expression, and grief activation, with relational discontinuity and transition-support deficit being associated with more adverse immediate responses across several outcomes. Our findings provide a cross-platform characterization of AI companion disruptions, quantitative evidence of their psychosocial impacts, and a prospective framework for assessing their potential risks before implementation.
Read the full abstract
Computation and Language
Deconstructing Stereotypes: Scope-Conditioned Generation for Effective Multilingual Counterspeech
Counterspeech (CS) - direct responses that counter online Hate Speech (HS) using reasoning and alternative viewpoints - has emerged as an alternative to content removal. Current automatic CS generation methods, however, frequently produce generic, ineffective replies that fail to target the implicit stereotypes behind HS. To bridge this gap, we propose a novel scope-conditioned generation framework that explicitly integrates structured stereotype characteristics into Large Language Models prompts. We validate our approach on a novel, human-curated dataset annotated in English, Italian, and Spanish. Extensive evaluations show that stereotype-conditioned prompting substantially outperforms generic baselines across all three languages, obtaining significant gains in factuality, specificity, cogency, and effectiveness for both explicit and implicit implied stereotypes.
Read the full abstract
Functional Analysis
Besov and Triebel–Lizorkin Spaces on Filtered Lie Groups, III: the Spaces $F^{\infty,q}_\alpha$
We continue to develop a theory of (Besov and) Triebel–Lizorkin spaces associated with weighted subcoercive operators on a real connected Lie group, focusing on the Triebel–Lizorkin space $F^{\infty,q}_\alpha(\beta)$, which requires a more technical treatment.
Mesoscale and Nanoscale Physics
Propulsion of magnetic domain walls via elastic damping in magnetostrictive materials
The interaction between magnetic and elastic degrees of freedom is increasingly central to advanced spintronics technology. In magnetostrictive materials, a moving domain wall carries a localized elastic deformation. Here, we investigate these elastic deformations and their back-action on field-driven domain wall dynamics using a fully coupled micromagnetic-elastodynamic framework and an analytical collective coordinates model. We show that mechanical damping acts as a non-magnetic dissipation channel, extracting energy from the magnetic texture and sustaining translational domain wall motion even in the complete absence of intrinsic Gilbert damping ($\alpha=0$). Specifically, elastic damping impacts domain wall dynamics in a manner equivalent to magnetic losses, allowing us to map it onto an effective magnetoelastic contribution to the Gilbert damping parameter, $\alpha_\text{me}$. We calculate the localized stress tensor profiles co-moving with the domain wall and show that mechanical dissipation breaks their spatial symmetry. Using our collective coordinates model, we demonstrate that these asymmetric stress profiles-specifically the localized stress gradients across the wall core-exert direct propelling forces that balance field-induced magnetic precession, enabling steady-state motion. Overall, these findings reveal a fundamental energy transfer and relaxation mechanism between magnetic and elastic subsystems, providing valuable insights for controlling magnetic texture dynamics via strain engineering and mechanical damping design in acoustic spintronic devices.
Read the full abstract
Soft Condensed Matter
Bayesian inference in active microrheology with wall and particle-particle interactions
Active microrheology infers rheological properties from the motion of a force-driven probe. In small samples, however, the probe is often close to walls or other probes, and the resulting hydrodynamic interactions bias the inferred parameters. We present a Bayesian framework in which these interactions are built into simplified analytical models for Newtonian and linear viscoelastic fluids and test it on noisy synthetic data from finite-element simulations of Newtonian and Oldroyd-B fluids. Accounting for the interactions substantially improves the accuracy of the inferred parameters. Near a wall, oblique forcing allows the material parameters and the wall distance to be identified jointly from a single experiment. In the nonlinear viscoelastic regime, posterior predictive checks over multiple force levels reveal the inadequacy of the linear model. Finally, when the probe size is comparable to the heterogeneity length scale, the framework distinguishes spatial variations in the modulus from measurement noise.
Read the full abstract
Functional Analysis
Besov and Triebel–Lizorkin Spaces on Filtered Lie Groups, II: Pointwise Multiplication, Localization, Differences
We continue to develop a theory of Besov and Triebel-Lizorkin spaces associated with weighted subcoercive operators on a real connected Lie group, focusing on the algebra properties, pointwise multipliers, localized norms, and characterization by differences.
Quantum Physics
Portable Vector NV-Diamond Magnetometer for Shot-Noise-Limited, Drift-Free Operation in Unshielded Environments
Ensemble nitrogen-vacancy (NV) diamond magnetometers combine high sensitivity with vector-field reconstruction, but practical deployment is limited by errors arising from high-frequency laser noise during short-duration operations and slow-varying gain fluctuations and offset drift during long-term operation. Here, we present an integrated digital architecture for achieving NV magnetometry stability across distinct timescales. A dynamic differential readout continuously balances fluorescence and reference channels to suppress correlated laser noise. Second-derivative Lorentzian lineshape tracking enables in-situ correction of slope variations arising from slow changes in gain and optical excitation. We further identify temperature-induced bias-magnet fluctuations as a dominant source of long-term drift and introduce a magnetic eigenvector transformation that uses the intrinsic response of NV resonances to eliminate these variations. We show, under unshielded ambient conditions, that this architecture achieves an off-resonance noise factor of 1.0 $\pm$ 0.1, matching the fundamental limit with ten-fold suppression of long-term drift, enabling stable, field-ready quantum magnetometry.
Read the full abstract
Computation and Language
RiskChainBench: A Benchmark for Obfuscated Platform Message Restoration and Evidence-Grounded Web Investigation
Platform abuse campaigns conceal redirection instructions with emojis, homophones, character decomposition, and redundant symbols, then route users through disguised links to services associated with pornography, fraud, gambling, or illicit transactions. Existing benchmarks evaluate obfuscated text and risky webpages separately, obscuring how target recovery affects downstream evidence acquisition. We introduce RiskChainBench, pairing 3,600 synthetic token-text restoration inputs from 600 source sessions with 600 corresponding human-labeled local web environments. A model first restores the message, operational intent, and destination; the same underlying model then acts as a VLM-driven web agent that investigates the correctly associated website and produces a frozen, evidence-cited risk report without message-side semantics or domain-reputation cues. We score restoration and correct-routing web investigation separately and compose them offline by applying the frozen primary-entry prediction as a gate to the same Task 2 result. Human labels determine task correctness, while a fixed multimodal evidence judge assesses faithfulness, sufficiency, completeness, and consistency. Across ten models, Entry Top-1 ranges from 35.2% to 95.2% and web decision accuracy from 26.3% to 62.8%; the leading systems differ across entry recovery, full reconstruction, website decisions, and fine-grained typing. Execution failures account for 31.9% of web runs, whereas post-decision type errors account for only 0.9%, identifying stable exploration and risk judgment as the principal bottlenecks. We release the benchmark, protocol, and resettable local sandbox.
Read the full abstract
Systems and Control
Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization
This paper studies the cost-optimal operation of a network of charging energy hubs for electric vehicles, which provide onsite renewable energy sources and stationary battery storage and are connected with each other via DC-lines as well as with the distribution grid. Specifically, we first formulate a dynamic optimal control problem for the entire network as a convex quadratic program, whereby the charging power profiles of the individual vehicles and the energy flows between hubs and the grid are subject to optimization. Second, we propose a problem decomposition that allows for a distributed solution via ADMM algorithms that preserves global optimality guarantees and privacy of the individual stations. We showcase our framework on a case-study for the Netherlands considering a two-day ahead deterministic formulation with perfect foresight. Our results show that compared to the case where charging powers are fixed a priori, optimizing their profiles (V1G) can significantly reduce the operational costs and emissions by more than 25%. Moreover, we verify our distributed algorithm against a centralized solution, paving the way to the optimal operation of large networks and online implementations.
Read the full abstract
Hardware Architecture
OptiPrime: Optimizing Private Inference through Protocol-Hardware Co-design
Private deep neural network (DNN) inference based on hybrid homomorphic encryption (HE) and multi-party computation (MPC) can protect user data with a formal guarantee, but at the cost of significant latency overhead due to HE. Customized HE accelerators have been proposed and have achieved orders-of-magnitude speedup for individual HE operations. However, when directly applying a commercial HE accelerator to state-of-the-art HE-MPC frameworks, we observe only limited end-to-end performance gain. This is because HE-MPC frameworks often require wireless transmission of input and output ciphertexts for each HE operation, leading to a severe network communication bottleneck. To overcome this challenge, we introduce OptiPrime, a protocol-hardware co-optimization framework for efficient private DNN inference. OptiPrime features a novel HE protocol for convolutions that substantially reduces the number of transmitted output ciphertexts and mitigates the network communication bottleneck. Meanwhile, as the new protocol introduces complex computation for fewer output ciphertext, we observe new memory access challenges due to a high volume of weight plaintexts and intermediate ciphertexts. Hence, we further propose a lightweight compression system for the weight plaintexts, reducing memory traffic by 10 times, as well as a specialized dataflow to maximize on-chip data reuse of intermediate ciphertexts. Extensive experiments show that our framework outperforms the Cheetah baseline by at most 5.7 times on CPUs and 4.2 times with an accelerator.
Read the full abstract
Statistics Theory
The Equivariance Criterion in a Linear Model for Random-$X$ Cases
Equivariance is increasingly used in machine learning and statistics, often without systematic justification. In a companion article, the equivariance criterion was applied to the normal linear model with a fixed design matrix (fixed-$X$), yielding the minimum risk equivariant (MRE) estimators of the coefficient vector and of the condensed diagonal covariance matrix under a multivariate invariant location–scale group. We extend these results to the random-$X$ case, with covariates sampled from a population. The extension hinges on a distinction vacuous for fixed-$X$ but fundamental for random-$X$: whether risk and unbiasedness are evaluated conditionally on the realized design or after averaging over the design distribution. Under conditional evaluation, the fixed-$X$ group applies given $X$: least squares remains the best equivariant estimator of the coefficient vector, and the MRE estimators of the population variances keep their fixed-$X$ forms with population sizes at the realized design. Under absolute evaluation with an i.i.d.\ design, the picture changes qualitatively: the natural scale group acting jointly on $(Y,X)$ fixes the coefficient vector, the induced parameter-space action is intransitive, equivariant risks are constant only along orbits indexed by the signal-to-noise ratio $\rho=\|\beta\|^2/\sigma^2$, and no uniformly minimum risk equivariant estimator exists. In the scalar case the optimal equivariant weight is the oracle shrinkage factor $w^*(\rho)=\rho/(\rho+E[T^{-1}])$, with least squares recovered as the infinite-signal limit $\rho\to\infty$—explaining and refining the known failure of the Gauss–Markov theorem with random regressors. For a centered design under location–scale transformations, least squares remains optimal within the natural invariant-contrast class, and the MRE estimator $S^2/(n-p+2)$ of the error variance is valid under both modes.
Read the full abstract
High Energy Physics (Theory)
Unitarity and the Forward Direction in Theories with Long-Range Forces
Integrating scattering amplitudes over the forward direction, and consequently the unitarity constraints one extracts from such integrals, can appear ambiguous in theories with long-range forces. Standard techniques for bounding EFT couplings then typically produce bounds that depend on an arbitrary infrared scale. We study a non-relativistic model in which the standard techniques produce such an ambiguous bound, but which is simple enough that the exact bound can also be derived non-perturbatively and shown to involve no infrared scale. We then show how to derive bounds perturbatively, with no infrared scale entering at any stage. This requires two ingredients: accounting for the modified distributional structure of long-range amplitudes, and using distorted-wave perturbation theory (DWPT), which treats the Coulomb dynamics exactly. Together they give amplitudes with well-defined partial-wave projections and no spurious infrared divergences. Interpreting the model as an EFT with an ultraviolet cutoff $\Lambda_{\rm EFT}$, we derive cutoff-dependent bounds valid for arbitrary UV completions. Taking $\Lambda_{\rm EFT}\to\infty$ at each order yields bounds that rapidly converge to the exact bound, reaching $0.002\%$ accuracy at fourth order in the expansion. Finally, we demonstrate that every order of the DWPT expansion resums infinitely many Feynman diagrams of short-range perturbation theory, which individually evaluate to multiple polylogarithms and complete elliptic integrals, into a compact expression. At the orders we compute, no integration is even required, suggesting that DWPT may offer a simpler representation of scattering amplitudes than standard perturbation theory.