Machine Learning
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Friday 11 September
Ensuring the reliability of black-box machine learning models in safety-critical space missions remains a significant challenge, particularly when ground-truth is unavailable for validation. Although machine learning models offer a powerful means to augment standard pipelines by extracting transmission spectra from complex exoplanetary light curves, their susceptibility to unmodelled instrument anomalies, stellar activity, and domain shifts introduces unquantified risks. This study evaluates a modular safety cage architecture that operates as a parallel monitoring layer to assess the validity of a prediction without modifying the underlying estimator. By monitoring different runtime indicators, including uncertainty quantification, out-of-domain detection, and influence functions, the framework constrains the model's operational domain to a verified region. A controlled evaluation is conducted under both in-domain and cross-domain conditions, using datasets from the 2019 and 2021 editions of the Ariel Data Challenges. The results reveal that model failure is multifaceted and that no single indicator captures all failure modes, demonstrating the need for indicator fusion. The application of safety-driven rejection strategies shows that a modest 20% reduction in data coverage results in error reductions between 45% and 65% across different domains and evaluation metrics. Using a formalised coverage-risk framework, a systematic analysis of indicator combinations is performed to identify configurations that maximise risk-ranking accuracy and optimise the trade-off between data coverage and scientific performance. Safety cages provide a transparent mechanism for detecting unreliable predictions and represent a critical step towards the safe deployment of data-driven models in scientific applications, such as astrophysics, where ground truth is seldom available.
Logic
The universal measure of probabilistically nonrandom objects
A finite object is called probabilistically random if it is an algorithmically random element of a finite set whose Kolmogorov complexity is relatively small. This note studies the amount of probabilistically nonrandom objects (those that are not probabilistically random) as gauged by the universal measure and without assuming any structure on the objects. The main results imply that the universal measure of probabilistically nonrandom objects is vanishingly small and establish the dependence of their universal measure on the required degree of probabilistic randomness.
Read the full abstract
Machine Learning
A Measured Communication-Quality Frontier for Federated LoRA Fine-Tuning with Adaptive Phase-Switching
Federated fine-tuning of large language models with low-rank adaptation (LoRA) reduces the number of trainable parameters, but communication remains the dominant cost, and protocols are usually compared by parameter-count ratios rather than by measured bytes. This paper measures per-round upload and download bytes for five federated LoRA protocols, three of them from prior work, and places them on a single communication-quality frontier scored by held-out instruction-following loss. The frontier has a knee. ReverseAdaptive, which learns both LoRA factors before freezing one once the relative improvement in training loss falls below a dimensionless threshold, sits at that knee: it cuts measured round-trip communication by 40.5% relative to FLoRA at a held-out loss cost of 0.0063, and beats FFA-LoRA, which freezes that factor at initialization, by 0.0182 in held-out loss, more than twenty times the largest per-method seed standard deviation. The same threshold carries to LLaMA-3.2-3B without retuning, where it saves 30.0%.
Read the full abstract
Machine Learning
A Three-Axis Stress Test of LLM vs Classical ML for Network Intrusion Detection under Distribution Shift and Adversarial Evasion
Large language models are increasingly benchmarked against classical machine learning for network intrusion detection (NIDS), almost always using same-dataset evaluation, and that protocol turns out to be incomplete. Evaluating XGBoost and RoBERTa-LoRA on two independently collected NetFlow v2 networks across three axes (same-dataset performance, cross-dataset transfer, and adversarial evasion) reveals no universal winner. The two models are statistically tied same-dataset. XGBoost wins decisively under cross-dataset distribution shift, by 15 points of F1 and 25 points of balanced accuracy; on the target network RoBERTa-LoRA's false positive rate reaches 0.78, leaving it barely above chance despite a superficially moderate F1. RoBERTa-LoRA wins decisively under adversarial evasion, by roughly 17 points of F1 at a representative mid-range perturbation strength, while both models hold false positive rates below 0.01 throughout. The model an evaluator would recommend therefore depends entirely on which axis is tested, not on same-dataset accuracy alone. A staged feature-leakage ablation improves cross-dataset transfer non-monotonically, indicating the leakage signal is distributed across the feature representation rather than confined to a few columns, and cross-dataset transfer between our two networks is strongly directional. These results argue for evaluating NIDS models along multiple independent robustness axes, and with more than one metric per axis.
Read the full abstract
Instrumentation and Methods for Astrophysics
Photonic Integrated Circuits for the Habitable Worlds Observatory: Science Drivers, Material Platforms, Arrayed-Waveguide Spectrographs, and a Space-Qualification Roadmap
NASA's Habitable Worlds Observatory (HWO) will require ultraviolet, optical, and near-infrared instruments that are simultaneously compact, mechanically and thermally stable, high-throughput, and replicable at large channel counts. Space-qualified photonic integrated circuits (PICs) and optical fibres are key platforms that can deliver these properties: they manipulate light at the diffraction limit within micron-scale single-mode waveguide circuits. An astrophotonic instrument fully guides the starlight from focal plane to detector, eliminating scatter and ghosts and offering excellent stability with no moving parts. This paper examines how astrophotonics can address the principal science drivers of HWO through four topics: (I) the HWO observing modes best implemented with photonic instruments; (II) the waveguide and fibre materials that can span the demanding 100nm-2.5{\mu}m HWO wavelength range; (III) the potential of arrayed-waveguide-grating (AWG) spectrographs to reach the resolving powers and throughputs HWO science requires; and (IV) the steps needed to space-qualify PICs and fibres against radiation, thermal cycling, vacuum, and launch loads. For each topic, concrete technical requirements are extracted and the current Technology Readiness Level (TRL) is assessed. The main contribution of this paper is to unify these science drivers, candidate-aperture photon budgets, UV-to-near-infrared material platforms, AWG architectures, and space-qualification requirements within a single photon-budget framework that pairs each claimed benefit with a measurable requirement, a TRL, and an environmental test that can retire it. A phased roadmap advances the critical photonic components from their present TRL~2 to -5, depending on platform and application, to the TRL~6 needed at HWO's instrument-definition gate.
Read the full abstract
Numerical Analysis
Global convergence of an efficient splitting method for the defocusing Gross–Pitaevskii ground state problem
For computing the ground state of the defocusing Gross–Pitaevskii energy, we propose and analyze two efficient schemes based on the Davis–Yin three-operator splitting, which treats the potential and interaction terms explicitly, and the kinetic energy by a resolvent. One iteration costs one inversion of $I-\gamma\Delta$ for the first scheme, and of $I-\gamma\Delta+\gamma V_1$ for the second, with $V_1$ denoting the separable part of the potential, and on structured meshes both operators can be inverted by simple fast GPU solvers. For monotone discrete Laplacians, including the second-order finite difference scheme and the lumped linear finite element method on simplicial meshes with suitable angle conditions, we prove global convergence to the unique positive discrete ground state, for every positive normalized initial vector, for any constant step size below an explicit threshold. In contrast, the methods previously proven to converge globally to the ground state all invert a more difficult elliptic operator that depends on the iteration variable. In three-dimensional tests with up to $999^3$ unknowns on one GPU, a simple variable step size rule makes the proposed splitting schemes efficient in practice, comparable in wall-clock time to Riemannian conjugate gradient methods that also invert only a shifted Laplacian operator, and much more robust with respect to the choice of the initial guess.
Read the full abstract
Quantitative Methods
Automated Volumetric Segmentation of Microaneurysms on OCT Using Artificial Intelligence
Purpose: To develop and validate a deep learning-based method for the automated identification and volumetric segmentation of microaneurysms (MAs) in diabetic retinopathy (DR) using OCT. Participants: A total of 125 participants were enrolled, including 20 healthy eyes, 27 with mild NPDR, 30 with moderate NPDR, 30 with severe NPDR, and 18 with PDR. Methods: We obtained multiple repeated 3x3-mm scans from each participant using a commercial 120-kHz spectral-domain OCT system (Solix; Visionix/Optovue, Inc., California, USA), which were registered and averaged to generate high-definition volumes. We developed a 3D deep learning network to segment MAs volumetrically. The input to the network consists of the original OCT volume concatenated with its reflectance-inverted counterpart. Expert graders manually delineated MAs to generate annotations. We evaluated model performance at multiple levels, including voxel-level segmentation, lesion-level detection, and eye-level diagnosis. Results: In the test dataset (20 healthy, 20 DR eyes), the algorithm demonstrated high voxel-level accuracy, with F1 scores of 79.2% on single volumes and 86.1% on averaged volumes. Lesion-level detection reached an F1 score of 96.0% (single) and 97.1% (averaged), while scan-level diagnostic accuracy for MA presence was 97.5% (single and averaged). Conclusions: A deep learning-based method can accurately identify and segment MAs volumetrically on OCT, enabling quantification and characterization, and potentially aiding in the diagnosis, monitoring, and management of DR.
Read the full abstract
Machine Learning
Pretraining for Sample-Efficient Neural Interfaces
Brain-computer interfaces (BCIs) decode neural activity to restore lost function. Typically, training a high-performance neural decoder requires a large labeled dataset to be collected from every new subject. One way to reduce the labeled data cost is self-supervised pretraining, which learns general neural representations from unlabeled recordings that accumulate across subjects. However, for intracranial electroencephalography (iEEG) recordings, self-supervised learning has been challenging due to differences in contact placement and neuroanatomy between subjects. We propose MAPA, an otherwise vanilla masked autoencoder with two spatial encodings, an anatomical region embedding and a relative positional encoding, which together enable it to learn neural representations that transfer to unseen subjects and across various tasks. MAPA sets a new state of the art across all three regimes of the Neuroprobe benchmark without fine-tuning: within-session, cross-session, and cross-subject. In the cross-subject regime, a linear probe on MAPA's features needs only ${\sim}164$ labeled trials to reach the accuracy that takes 3,500 without pretraining. Our results show that self-supervised pretraining can scale across heterogeneous iEEG recordings and reduce the labeled data needed for accurate decoding in new subjects.
Read the full abstract
Neural and Evolutionary Computing
nBMS, a Neuromorphic Battery Management System with a Silicon-Validated Spiking State-of-Charge Core for eVTOL Aircraft
State-of-charge (SoC) estimation for electric vertical take-off and landing (eVTOL) aircraft must run on the vehicle under hard energy and certification budgets, on a duty cycle unlike anything in the automotive literature. In this study an event-driven spiking network, the state-estimation core of the nBMS neuromorphic battery management architecture, is designed for per-timestep SoC estimation and evaluated on a public 22-cell eVTOL dataset with an automotive cross-check. A delta and population encoder, a second-order sigma-delta spiking layer, and a rate-accumulator readout hold 34{,}433 int16 parameters with zero dense multiply-accumulate (MAC) operations. The estimator reaches 2.45% root-mean-square error (RMSE) against 1.74% for a tuned long short-term memory (LSTM) baseline, a gap characterized as a temporal-mixing limit in cruise; in exchange it degrades 1.6 times slower than an adaptive leaky integrate-and-fire control under sensor noise and needs roughly 3{,}500 additions per step where the LSTM needs 67{,}700 multiply-accumulates. The full core is deployed on a low-cost automotive-qualified Artix-7 field-programmable gate array at 87% block-RAM utilization, meets timing at 50~MHz, and reproduces the frozen fixed-point reference bit-exactly over a real 491-step flight segment on silicon. Fully annotated post-implementation analysis gives 1.30~$\mu$J per inference, an average of 0.65~$\mu$W at the 0.5~Hz mission cadence.
Read the full abstract
Quantum Physics
Heuristic Quantum Amplitude Amplification: A Traffic QUBO Case Study
Quantum Amplitude Amplification (QAA), the generalization of Grover's algorithm, is well-positioned for combinatorial optimization and is particularly promising for Quadratic Unconstrained Binary Optimization (QUBO) problems. QAA is appealing due to its ability to drive the quantum system to a target state, yielding the globally optimal solution with probability over $90$+%. However, realizing QAA for application-scale optimization currently exceeds quantum hardware capacity, which is further compounded by unresolved algorithmic challenges regarding the choice of free parameters. In this study, we address these issues by utilizing a realistic traffic flow QUBO problem to investigate the implementation of QAA as a heuristic solver. Specifically, allowing the diffusion operator parameter to take non-$\pi$ values expands the capabilities of QAA. This unlocks a new multiple-shot, low-iteration strategy that aims for a high cumulative probability rather than maximizing the probability of a single basis state. Using $25$-qubit simulations, our results demonstrate that heuristic QAA addresses two of the main challenges cited in previous studies. Firstly, heuristic QAA works even at a single iteration, reducing circuit depth by orders of magnitude compared to standard QAA. And secondly, we show that the problem-dependent parameters necessary for reaching optimal algorithmic performance can be reliably approximated with minimal upfront classical computing overhead.
Read the full abstract
Computer Vision
RIGOR: Rig-Informed Geometry for Omnidirectional Reconstruction
Recent developments in feed-forward 3D reconstruction resulted in models which can recover dense scene representations and camera motion solely from an image stream. However, such predictions are prone to becoming inconsistent over long trajectories, specifically in demanding environments with repetitive structures, weak textures and dynamic objects or people. One way to mitigate those challenges is to use an omnidirectional camera, which provides wide spatial coverage and captures richer visual information. Yet, the majority of models do not offer support for 360-degree imagery or require additional fine-tuning. To bridge these two aspects, we present RIGOR: a large-scale reconstruction pipeline for gravity-aligned omnidirectional videos that retains a frozen feed-forward perspective backbone and exploits each panorama as a four-view virtual rig. The rig structure is used to detect and repair locally inconsistent predictions, to retrieve loop closures through cyclic four-view consensus, and to geometrically verify candidate revisits before global optimization. Verified constraints drive a Sim(3) pose graph that corrects accumulated rotation, translation, and scale drift along the sequence. We demonstrate that the proposed consistency mechanisms improve both trajectory accuracy and reconstructed geometry over a feed-forward baseline on challenging construction-site sequences. The code is made available under this link: https://github.com/TangentH/RIGOR.
Read the full abstract
Fluid Dynamics
A Kinetic Energy Preserving and Entropy Conserving Two-Point Flux for Multi-species Compressible Flow
High-order entropy stable (ES) methods have attracted much interest in the computational fluid dynamics (CFD) research community over the past decade, as we seek to simulate practical engineering applications with high accuracy and robustness. As industry delves further into supersonic flight and space travel, we need schemes capable of modelling flows with multiple chemical species that interact and mix within the fluid. As such, there is a considerable amount of effort currently being focused on developing high-order ES schemes for multi-species (MS) flow. A key ingredient for these entropy stable schemes is the two-point flux, which determines the properties of the resulting high-order discretization. As such, the numerical scheme can possess important properties such as entropy conservation and kinetic energy preservation only if the two-point flux also mirrors these properties. At present, in the literature, the two-point fluxes used for high-order ES multi-species solvers are not kinetic energy preserving (KEP). In this short communication we develop a two-point flux that is both entropy conserving (EC) and kinetic energy preserving by adapting Ranocha's single-species methodology for multi-species. The newly proposed EC and KEP flux is tested against existing two-point fluxes in the literature using the density pulse advection and Taylor-Green vortex cases. It is shown that EC and KEP flux retains both properties while the other fluxes only retain one of the desired properties. Since the two-point flux dictates the properties of the resulting scheme, the proposed flux is the ideal option for simulating multi-species compressible flow.
Read the full abstract
Representation Theory
One-dimensional partial actions of 8-dimensional Hopf algebras and right coideal subalgebras
In this work, we complete the description of the one-dimensional partial actions of 8-dimensional Hopf algebras by computing the remaining cases: the Kac-Paljutkin algebra $\mathcal{A}$ and the unique non-semisimple non-pointed Hopf algebra $\mathcal{K}$. We prove that all these partial actions are symmetric, study their associated partial smash products and we determine all their partial coactions of dimension one. Beyond the 8-dimensional setting, we investigate which right coideal subalgebras of a Hopf algebra $H$ can be realized as partial smash products $\underline{ \Bbbk \# H}$ over the base field. In particular, we show that every right coideal subalgebra of a finite-dimensional cosemisimple Hopf algebra arises in this way.
Read the full abstract
Combinatorics
Oriented and Valuated Delta Matroids from Stable Polynomials
Stable polynomials are the natural multivariate generalization of real rooted univariate polynomials. While their definition is purely algebraic in nature, they have deep connections to combinatorics. One such connection is the support theorem proved by Brändén in 2007, showing that the support of any stable polynomial is a jump system, and hence that the support of any multiaffine stable polynomial is a $\Delta$-matroid. In this work, we generalize this result, showing that coefficients of multiaffine real stable polynomials give rise to oriented $\Delta$-matroids, and coefficients of multiaffine stable polynomials over Puiseux series give rise to valuated $\Delta$-matroids.
Read the full abstract
Machine Learning
One Spectrum, Two Resources: Data-Memory Scaling in Autoregressive Prediction
How much learned memory is needed to benefit from more data? We show that the two resources are governed by one predictive-energy spectrum in a positive-entropy autoregressive retrieval source. Each coordinate contributes its query probability times the squared radius of its unknown logit. Writing $\mu$ for the resulting energy spectrum, we prove the minimax law $\mathfrak R^*_{\rm value}(n,B)\asymp_R \Phi_\mu(n^{-1})+\Phi_\mu(\tau_B), \Phi_\mu(t)=\int\min\{x,t\}\,\mu(\mathrm dx),$ for $n$ prediction blocks and a learned state with at most $2^B$ values. Data set the resolution $1/n$; memory sets the level $\tau_B$ reached by optimal bit allocation. The complete curve also recovers the positive spectrum. Energy-dimension pairing is essential: two causal sources with identical block-energy and block-dimension marginals have different data and memory exponents. A masked query-key attention head learns the route and values, realizing the law with explicit routing, format, and arithmetic errors. Further results give exponent-adaptive allocation, finite-precision realization, and compute-precision laws under two-sided arithmetic assumptions. Experiments recover the data-memory collapse and coupling exponents, explain the routing and allocation mechanisms, and examine weight-only quantization across six pretrained-model scales.
Read the full abstract
Cryptography and Security
Canaries in the Bank: Auditing User-Level Privacy in Private Evolution
Private Evolution (PE) generates high-fidelity synthetic data in federated settings without exposing users' raw data. It aggregates clipped user votes over a shared candidate bank into a differentially private histogram, with noise calibrated to the worst-case user contribution. However, it is unclear whether an adversary can realize this worst-case privacy loss while following the PE protocol. We introduce a protocol-aware empirical audit in which the server commits to a single shared candidate bank and replaces roughly 1% of its entries with probes derived from a known, non-private canary. We evaluate eight attacks, including an unchanged-bank baseline, exact copies, plausible paraphrases, and high-entropy synthetic nonces. Experiments on Yelp and Sentiment140 show that natural-text attacks remain substantially below the theoretical DP bound, while nonce-based attacks yield considerably stronger bounds and come closest to the mechanism's privacy ceiling. These results quantify the gap between formal worst-case privacy and leakage achievable through protocol-valid candidate-bank manipulation.
Read the full abstract
Audio and Speech Processing
Building a Production Greek-English Speech Recognizer
We report a multi-month engineering program to build Sophea, a production bilingual Greek-English automatic speech recognition system. We evaluate the system against nine production gates covering Greek and English word error rate, language identification, and hallucinations on non-speech audio. Across twenty-three training iterations and two model architectures, no training-data composition passed all nine gates simultaneously. Meeting the Greek noisy-environment target required about 1,500 steps of dense domain exposure, while preserving English language identification tolerated only about 250 steps, or about 1,250 with a rebalanced mix that reduced Greek accuracy. We describe a six-stage data pipeline in which calibrating an audio-quality filter against in-domain anchors reduced the discarded share of scored Greek audio from 98.7 percent to 10.6 percent. A pre-registered ablation isolated a hallucination defect to one training-data package. A three-model ROVER ensemble increased gate coverage from 4-7 of 9 for individual models to 9 of 9 and reduced overlapping-speech WER from 53.35 percent to 37.87 percent, a 29 percent relative improvement. A separate learned per-clip arbiter over two models is listed as sophea/asr-k1 (preview) on the public Open ASR Leaderboard, with 4.26 percent average WER across eight public English test sets, and reaches 25.88 percent WER on live Greek noisy-environment traffic. We also document five cases in which a measurement tool produced a plausible but incorrect result and seven substantial approaches that were evaluated but not shipped. No model weights or training data are released; we report methodology and quantitative results only.
Read the full abstract
Quantum Gases
Scaling equations for Bose-Einstein condensate dynamics across all interaction regimes
We derive a unified set of scaling equations for Bose-Einstein condensates in time-dependent harmonic traps, connecting the weakly interacting Gaussian regime to the strongly interacting Thomas-Fermi regime. The exact Gross-Pitaevskii ground-state density is taken as a fixed profile in rescaled coordinates, with its dynamics described by three scaling factors corresponding to compression or expansion along the three spatial directions. The resulting equations contain no adjustable parameter, since their coefficients are determined once from the initial state. They recover analytically the Gaussian variational and Thomas-Fermi scaling equations in their respective limits and satisfy an axis-resolved virial theorem. The approach also yields the global phase and the low-lying collective-mode frequencies of the condensate. We benchmark the model against three-dimensional Gross-Pitaevskii simulations and against measured expansion energies. The model remains accurate across all interaction regimes, in strongly anisotropic traps, and along time-dependent sequences including a relatively fast quench, up to the point where the underlying frozen-profile hypothesis, shared by all three scaling approaches, breaks down.
Read the full abstract
Quantum Physics
Reservoir Support Sets the Minimum Loss for Non-Hermitian Dynamics
The minimum loss required to reproduce non-Hermitian dynamics depends on how many physical modes each reservoir can address coherently. Established positive-matrix criteria bound this cost. We construct a phase-controlled cubic-root Su-Schrieffer-Heeger chain in which three-mode reservoirs attain the unrestricted passivity threshold throughout its phase diagram and halve the minimum pair-supported loss at a tuned point. The bound constrains exact conditional trajectories, including time-dependent Markov controls, rather than preparation of one final state. A connected-chain protocol tests effective reservoir support through calibrated finite-time emission. Full system-auxiliary propagation then bounds conditional fidelity and target yield for every one-particle input. A coherent controller that accurately prepares the selected endpoint fails this propagator test. A singular-value bound excludes every unitary realization of the same conditional map. These results connect local reservoir access to a measurable loss cost for prescribed dynamics.
Read the full abstract
Probability
Second-order perturbation bounds for Gibbs samplers under strong spatial mixing
The basic question in perturbation analysis of Markov chains is how small changes in their transition kernels affect their stationary distributions. Classical perturbation bounds typically require the kernel error to be much smaller than $1/\tau$, where $\tau$ is a mixing or relaxation time. Although this scaling is sharp for Markov chains in general, we investigate a general "square-rooting" phenomenon in which one-step errors of order roughly $1/\sqrt{\tau}$ can be sufficient for local updates. We proved a form of this phenomenon in Lin, Liu and Smith (2025) under strong assumptions. Here we substantially weaken these assumptions, and prove this phenomenon occurs using three distinct approaches. First, block factorization applies under structural assumptions on the stationary measures of both chains. Second, approximate block-update arguments extend the result to statistically relevant Markov chain Monte Carlo (MCMC) settings, where structural guarantees are available for the exact posterior and its associated sampler, but not for the perturbed posterior. Third, we use direct calculations for a class of models with hard constraints where neither general result is directly available. We illustrate these results in three MCMC settings and show how they directly inform the tuning of approximate MCMC algorithms.
Read the full abstract
Human-Computer Interaction
Generative AI and Extended Reality in Collaborative Architectural Design Education: An Exploratory Studio Study
Architectural design education relies heavily on visual ideation and representation to support collaborative learning in studio environments. Recent advances in generative artificial intelligence (GenAI) and extended reality (XR) offer new opportunities for rapid idea exploration and immersive spatial visualization. This exploratory mixed-methods classroom study investigated how GenAI-assisted multi-user XR influenced collaborative architectural conceptual design. We developed GenARch, a pipeline that integrates GenAI-based visual generation with collaborative XR environments, and deployed it in an undergraduate architectural design studio. Twenty-seven students formed seven self-selected design teams; four teams incorporated GenARch into their usual course workflow to support collaborative ideation and visualization, while three teams continued the same course workflow without GenARch. Pre- and post-intervention surveys assessed design self-efficacy, attitudes toward collaborative learning, and teamwork; a seven-member panel evaluated team design presentations; and GenARch teams participated in group interviews. The quantitative results showed larger relative declines in confidence and outcome expectancy for the GenARch condition and a positive difference-in-differences estimate for perceived conflict management, while panel-rated presentation outcomes were not significantly different between conditions. Interviews indicated complementary roles for the technologies: GenAI supported idea externalization and visual reference generation, whereas XR supported spatial, contextual, and scale-based evaluation. Students also reported challenges related to control, dimensional fidelity, shared attention, and motion comfort. These findings highlight both opportunities and limitations when GenAI and XR are incorporated into collaborative design education.
Read the full abstract
Soft Condensed Matter
Liquid-Phase Near-Field Infrared Nanoscopy of Ion-Exchange Reactions
In situ monitoring of reactions with chemical specificity and nanometer-scale spatial resolution under aqueous conditions remains a long-standing experimental challenge. Here, we use thin SiC membrane-enabled liquid-phase infrared nanoimaging and nanospectroscopy to monitor Ca$^{2+}$/Na$^{+}$ ion exchange in a mixture of disodium terephthalate and CaCl$_2$ solution. Beneath the membrane, we follow the formation of calcium terephthalate (CaTP), a metal-organic framework (MOF)-type coordination phase in which terephthalate ligands link Ca$^{2+}$ centers. The symmetric and asymmetric carboxylate stretching modes serve as chemically specific near-field reporters of Ca$^{2+}$ coordination to the terephthalate linkers. Nano-FTIR spectra reveal pronounced peak shifts and linewidth changes in these vibrational modes, indicating modification of the carboxylate coordination environment during CaTP formation. Complementary near-field nanoimaging resolves the emergence of nanoscale precipitates beneath the SiC membrane following CaCl$_2$ injection, providing spatially resolved evidence of the formation of the CaTP coordination framework. Solid-phase nanoimaging and nanospectroscopy identify well-defined CaTP particles, providing further evidence for crystalline CaTP formation. We demonstrate that the chemistry of metal-ligand interactions can be monitored in situ via liquid-phase near-field nanoscopy. This capability could enable the study of catalytic, electrochemical, and biological processes under native aqueous conditions.
Read the full abstract
Information Theory
From Priors to Projections: Geometry and simplified MIMO demodulation of probabilistic shaping
Probabilistic shaping (PS) is a well-known method to achieve improved performance upon a regular quadrature amplitude modulation (QAM) by taking the target constellation and making the distribution of underlying points non-uniform. It has been extensively studied over the years for the additive white Gaussian noise (AWGN) and Rayleigh fading channels. However, the potential of probabilistic shaping in the multiple-input and multiple-output (MIMO) setting needs further investigations. In this paper, we prove that if shaped symbols follow Maxwell-Boltzmann distribution, the optimal maximum a posteriori (MAP) detection is equivalent to the case of uniform constellation with a simple preprocessing step. Our approach has multiple benefits. It enables to utilize the same processing chain for both shaped and unshaped system, which simplifies the receiver architecture. This technique can be applied for both linear MMSE and nonlinear (near-)MAP demapper types. In addition, the complexity of adaptive methods such as sphere decoding can be reduced.
Read the full abstract
Artificial Intelligence
Token Efficient Task Execution via Application Behavior Modeling for Web Agents
The strong performance of AI Agents across an impressive variety of tasks is driving an unprecedented investment in agentic infrastructures, however the cost of processing tokens is fast increasing. Web agents automate the execution of web-application tasks described in natural language, by analyzing the web-application's user interface (UI) and interacting with it. This work introduces OdoBot, a novel web-agent architecture that completes tasks at a fraction of the cost when compared to conventional web agents. This is achieved by leveraging a behavioral model of the underlying application constructed by analyzing successful task-execution demonstrations. Our experiments with 45 tasks on the Canvas Learning Management System (LMS) demonstrate that OdoBot uses 44% and 80% fewer tokens than two state-of-the-art competitor agents (Agent-E and WebVoyager), while also surpassing WebVoyager in terms of task success rate.
Read the full abstract
Systems and Control
Active Filter Design for Buffering Datacenter-Scale Power Fluctuations from Training AI
Training large AI models requires thousands of processors working in parallel. This synchronized load poses a challenge for traditional power delivery architectures, because IT power ramps much faster than grid hardware can compensate. This paper presents a hardware solution to this problem, introducing a novel power delivery architecture which automatically detects changes in load power and compensates using on-rack energy storage, giving time for the grid to respond to the varying load. The architecture is validated experimentally, powering a training load while limiting the grid-side power ramp rate such that it stays within pre-specified range. The prototype presented is rated to deliver up to 10 kW of buffered power in a 400 VDC system, with a bill of materials cost of $3,500 USD. The system design is described in detail. A key advantage of this architecture versus other approaches is that it reliably buffers power fluctuations without requiring any changes to system software, making it compatible with any training workload.
Read the full abstract
Information Retrieval
Pre-retrieval Query Clustering for Adaptive Top-k Document Retrieval in RAG Systems
RAG systems commonly retrieve a fixed number of documents (top-k) to ground generation, but this static approach is brittle: simple queries suffer over-retrieval (adding noise and cost) while complex queries are under-retrieved, causing recall failures that cascade into incorrect answers. Motivated by the question of how many documents must be retrieved to answer an arbitrary query reliably, we propose a practical, general framework for query-adaptive retrieval depth. Offline, we estimate per-query retrieval difficulty by measuring NDCG under the default retriever and deriving a query-specific saturation point k* from the NDCG-k curve. Because computing these signals online is expensive, we cluster a large set of queries in embedding space and summarize each cluster with a recommended retrieval depth that targets high coverage (e.g., ~95%) using a mean-plus-variance rule. At runtime, the system assigns an incoming query to a cluster and selects the corresponding top-k in constant time. Compared with post-retrieval confidence methods that rely on clustering retrieved documents, our approach is pre-retrieval and query-centric, making it robust in heterogeneous, case-like corpora and applicable across domains such as legal, healthcare, finance, and enterprise search. Finally, this framework has been tested in full-traffic queries that improved $F_1$ by over 36% while reducing token usage by 14% on low-complexity clusters without accuracy loss.
Read the full abstract
Statistical Methodology
Fingerprint Analysis for Climate Change Detection and Attribution under a Latent Factor Model
Detection and attribution (D&A) analyses provide a statistical framework for quantifying the contribution of external forcings to observed climate change. Optimal fingerprinting, the primary approach for D&A, is formulated as an errors-in-variables regression with a high-dimensional covariance structure. Reliable inference is challenging because covariance matrices must be estimated from a limited number of control simulations, and climate models may exhibit variability patterns that differ from those of the observed climate system. We develop a spiked optimal fingerprinting framework that exploits the spiked structure of dominant climate variability modes while providing stable covariance estimation in high-dimensional settings. The proposed method develops bias-corrected spiked covariance estimation for constructing adaptive weight matrices and incorporates variability inflation adjustments to account for model–observation differences in internal variability. We further develop a valid uncertainty quantification procedure for the scaling factor estimators and a residual consistency test for assessing model adequacy. Numerical studies demonstrate improved estimation accuracy and uncertainty quantification compared with existing practical approaches. Applied to annual mean near-surface temperature data, the proposed framework produces shorter and better-calibrated confidence intervals and leads to different detection and attribution conclusions in several regions, providing new insights into the interpretation of climate attribution results.
Read the full abstract
Human-Computer Interaction
The Addictive Intimacy of AI: Understanding User Disengagement from AI Companions and Why Some Relationships with AI Become Difficult to Leave
AI chatbots are increasingly used as sources of emotional support, on dedicated companion apps and general-purpose assistants alike, yet little is known about what happens when users try to leave. Combining a content analysis of Reddit posts about quitting or reducing use (N=2,782) with interviews with users who found leaving difficult (N=16), we show that disengagement sometimes is not a single decision but a recursive trajectory: triggers prompt users to question the relationship, attempts to leave collide with barriers, and some users cycle through quitting and returning. We propose the notion of the addictive intimacy of AI, a configuration in which the qualities that make a companion emotionally valuable are the same ones that make it harder for users to limit their use and leave, so that intimacy and disengagement risk cannot be treated as independent design problems. We close with design implications for responsible offboarding.
Read the full abstract
Information Retrieval
Mixture-of-Experts Language Models Can Be Strong and Efficient Retrievers
Recent work has shown that fine-tuning decoder-only large language models (LLMs) for retrieval yields strong first-stage retrievers, with effectiveness improving as backbones grow in size. However, every query and document must pass through the full model, so encoding cost increases with model size. Mixture-of-Experts (MoE) LLMs activate only a subset of parameters per token and are widely used to scale generative models, yet remain underexplored as retrievers. We systematically study MoE backbones for retrieval by training MoE and dense LLMs from several families using the same procedure, evaluating them across diverse datasets, and measuring query encoding time under the same serving configuration. We show that MoE retrievers outperform dense retrievers with comparable active parameter counts by up to 3.0 nDCG@10 points on BEIR. One of our strongest MoE retrievers matches an 8B dense retriever with 59% fewer active parameters and 18% lower query encoding time. We further show that the number of experts used for query encoding can be reduced without retraining or re-indexing, retaining more than 99% of retrieval effectiveness while reducing query encoding time by up to 26%. Recent rerankers provide only modest additional gains over strong MoE first stages, which often match or exceed the reranked configurations we evaluate. Together, these results show that MoE LLMs can be strong and efficient first-stage retrievers.
Read the full abstract
Software Engineering
Is Self-Admitted Technical Debt Tested? An Empirical Study of Coverage, Co-change, and Impact
When developers write a TODO or FIXME comment, they are explicitly admitting that the code is suboptimal: a built-in warning that this logic deserves extra scrutiny. Yet it is an open question whether Self-Admitted Technical Debt (SATD) actually receives that scrutiny in the form of software testing. We aim to characterize the relationship between SATD and testing across three dimensions: the extent to which SATD-affected code is covered by existing tests, whether developers synchronize test additions with debt resolution, and whether such testing affects the long-term observability of resulting defects. For that, we conducted an empirical study on eight open-source Java projects, analyzing test coverage of 784 SATD instances identified in the latest releases and performing a longitudinal examination of 5,175 SATD removal events. Our results show that while 60.7% of SATD-affected code is covered by existing test suites, developers rarely synchronize test modifications with debt resolution; manual inspection confirms that only 3.4% of SATD removal commits include new tests specifically targeting the resolved debt (vs. 12.5% that co-add tests in the same commit). Longitudinal analysis further suggests that SATD resolutions exhibit nearly identical localized bug induction rates within short-to-medium-term windows regardless of test modifications. However, over a longer, unrestricted observation window, a slight divergence emerges where the test-added group reaches a higher cumulative defect alignment probability (6.32% vs. 4.37%), a counterintuitive trend potentially driven by the selective testing of inherently complex components. Developers treat SATD repayment as an ordinary code change rather than as a high-risk maintenance activity: most debt removals proceed without targeted verification, despite the developer's own prior flag that the code is suboptimal.