Peer Revenue Play credits. Real papers.

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Tuesday 8 September

Computer Vision

LeCor: Learning to Be Corrected by Meta-Learned Test-Time Training for Interactive 3D Lung-Tumour Segmentation

Delineating lung tumours on computed tomography (CT) takes a considerable share of the time spent on radiotherapy planning, and a contour proposed by a model can be refined interactively by the clinician. Promptable foundation models such as SAM 3 support this workflow by writing each correction into a session memory that conditions the remaining slices, while the model weights stay fixed. On 690 test cases from five public CT cohorts, fine-tuning SAM 3 on lung tumours raises the Dice obtained from a single point prompt from 0.298 to 0.757, and seven rounds of corrections raise it further to 0.765, but under memory conditioning alone the accuracy on slices the annotator has not touched stops improving after six rounds. We therefore treat each correction as a training signal and propose LeCor, which performs test-time training on a small set of case adapters that are reset for every case and meta-learned such that a single gradient step driven by a click improves the slices that were not clicked. On the 133 test cases that span at least eight slices, LeCor raises the Dice reached after seven correction rounds from 0.787 with the fine-tuned model to 0.827, reduces the number of cases that never reach a Dice of 0.80 from 47 to 27, and reaches in three correction rounds the accuracy that the fine-tuned model attains in seven.
Read the full abstract

All authors Yi Luo, Yike Guo, Wenxuan Li, Zongwei Zhou, Rui Zhang, Kai Ding

Machine Learning

From Fixed Keys to Readable Schemas: Small Language Models for Vehicle Agent Function Calls

In-vehicle assistants must translate natural-language requests into accurate vehicle function calls under strict memory and latency constraints, making small language models (SLMs) attractive for on-device deployment. For such models, a key design choice is how the available function surface is presented. Two approaches are to represent each function with a dedicated Functional Token (FT) or provide function schemas directly in the prompt. FTs enable compact inference but are restricted to functions learned during training, whereas Schema-in-Prompt (SIP) can generalize to unseen functions at the cost of longer prompts and higher inference overhead. We introduce a benchmark of 9,822 single-turn examples spanning 79 vehicle functions derived from Android Automotive, including held-out functions and requests requiring refusal. We compare both approaches under matched fine-tuning across four SLMs from 270M to 1.7B parameters. On functions seen during training, scaling provides limited benefit: the 270M model can match the 1.7B model, and the highest Seen accuracy in our main grid occurs at 0.6B. On held-out functions, FT achieves zero accuracy by construction, whereas SIP generalizes and improves substantially with scale. On out-of-scope requests, FT can invoke an unavailable function it was trained to emit, while SIP more reliably refuses based on the functions offered. This flexibility comes with a higher inference cost, chiefly the latency of processing the schema prompt. Our theoretical analysis formalizes why only SIP can predict functions withheld as training targets and why longer schema contexts increase inference cost. Overall, function-surface representation, rather than model scale alone, determines the capabilities and failure modes of SLM-based vehicle function calling.
Read the full abstract

Signal Processing

Joint Deployment and Resource Management for Group-Tag-Based Physical-Layer Authentication and Collaborative Communication in NTN

Physical-layer authentication (PLA) in non-terrestrial networks (NTNs) has primarily been studied from a security perspective, while its system-level integration with communication remains less explored. We propose the secure adaptive framework for authentication in multi-zone networks (SAFA-MZ), a system-level formulation for the joint management of collaborative group-tag and private-data delivery in NTN, where high-altitude platform station (HAPS) placement, user association, and transmission powers are jointly selected under service and secrecy constraints. Group-level authentication tags and user data are collaboratively transmitted by multiple HAPSs, with artificial noise (AN) mitigating information leakage. We jointly optimize HAPS placement, user association, and power allocation to balance deployment regularity, tag distribution, and user-rate fairness under secrecy, quality-of-service (QoS), power, and coverage constraints. The problem is addressed using a repair-based cross-entropy method (RCEM) and a graph-aware advantage actor-critic (A2C) algorithm (GA2C). Under colluding and non-colluding eavesdropper models, GA2C improves average secrecy spectral efficiency (SSE) by 135–139% over its single-connect baseline and 21.1–23.2% over its baseline without AN. Across ten independent random seeds, GA2C achieves approximately 23.4% and 17.9% higher mean per-user SSE under non-colluding and colluding eavesdropping, respectively, and a 16.2% higher mean private-rate Jain's index than RCEM. These results quantify the gains of multi-node connectivity and AN within the proposed framework under the evaluated assumptions.
Read the full abstract

All authors Parsa Rajabi, Mohammad Reza Abedi, Paeiz Azmi, Nader Mokari

Discrete Mathematics

Polynomial-time algorithms for setting tight big-M coefficients in transmission expansion planning with disconnected buses

The increasing penetration of renewable energy and rising electricity demand are driving the need to integrate new buses and transmission lines into transmission grids. These trends are reshaping transmission expansion planning (TEP), motivating the development of effective methodologies to manage the resulting complexity. This paper introduces the longest shortest-path connection (LSPC) algorithm, a graph-based method to enhance the mixed-integer linear programming disjunctive formulation of TEP using valid inequalities (VIs). Traditional approaches for determining big-M coefficients in disconnected TEP networks typically rely on solving the computationally intensive longest path problem (LPP). In contrast, LSPC circumvents these limitations by efficiently identifying relevant power-flow paths between disconnected buses within the expansion network. We demonstrate that the VIs generated from these identified paths dominate those derived from LPP-based methods and other existing approaches.
Read the full abstract

Machine Learning (Statistics)

Mode Coverage in Normalizing Flow Boltzmann Generators via Log-Ratio Variation

Normalizing flow Boltzmann generators retain a tractable pushforward density, but training with forward KL depends on target samples that may be biased or omit modes. As a result, a flow can miss target mass while its observed importance weights give a high effective sample size. We introduce the log-ratio variation $\X_\omega$, the mean absolute pairwise difference of the target-to-pushforward log-density ratio under a weighting measure $\omega$, and use it to define KLXX, a new loss function. Two log-ratio variations are added to the forward KL (denoted by the two X's): one weighted by the target to improve accuracy, the other by a mixture of quench and temper samples with pushforward samples to search candidate modes. We derive the Fisher–Rao gradient flow of KLXX, where both variations contribute nonpositive dissipation, and a fixed-surrogate error bound for KLXX. We use KLXX in an adaptive-staging Boltzmann generator, with importance reweighting at every stage. We bound the sampling error of its inference scheme when the stage weights are essentially bounded, and prove it asymptotically unbiased in the sample size. In the numerical tests, KLXX improves mode coverage over forward KL. It also improves the generator's per-stage diagnostics against the loss that built the schedule. The observables the generator recovers are close to independent references. The log-ratio variations thus supply information that the forward KL loss usually omits.
Read the full abstract

All authors Qi Feng, Rongjie Lai, Di Qi, Xuda Ye

Human-Computer Interaction

Exploring 3D Glyph Physicalizations for Public Engagement through River Health

Introduction: In this paper, we present the preliminary design of a toolkit for making glyph-based physicalizations for public engagement. We use London river health data as a case study: a data set of significance to urban issues related to climate change and of interest to draw public attention, as part of the Greater London Authority's strategies. Design: We present the components of a 3D glyph-making toolkit, its encodings, and a step-by-step process for crafting a physicalization of a river's water quality using recycled materials. We reason about how users can use the template to learn about a data set while reflecting on the data's significance to their personal experience and self-mapping onto the physicalization. Reflection: We reflect on the opportunities that extending the design space of glyphs to 3D physicalization offers for supporting public engagement with complex, multi-dimensional data sets, scaffolding cognitive processes, and self-reflection, thereby bringing crucial environmental data to life. Conclusion: Future implementation of the 3D glyph template will enable the public of all abilities to explore river health data, physicalize complexity, and realize its relevance. We hope that its use in public engagement workshops will help raise awareness, invite care, and foster a sense of belonging.
Read the full abstract

All authors Maria Teresa Ortoleva, Min Chen, Rita Borgo, Alfie Abdul-Rahman

Statistical Methodology

Covariate-localized False Discovery Rates

We introduce a flexible model for covariate-dependent multiple testing which can be encoded using a nonparametric Gaussian mixture model. Weight-localized predictive recursion (PRx), a new development in the methodology of Newton's predictive recursion algorithm, is then leveraged to estimate the components of this mixture model, allowing for recovery of the covariate-localized false discovery rate $\text{Pr}(H_i = 0|z_i,x_i)$ using a single, unified algorithm. This quantity represents the most direct extension of Efron's local false discovery rate to the covariate-dependent setting, and admits provable Bayesian FDR control properties under simple rejection rules. We introduce several procedures for estimating and thresholding the local false discovery rate, and show using various simulations and a real-data example that our procedures lead to increased power, tighter Bayesian FDR control, and more interpretable rejections. We furthermore show that this holds for fixed and randomized hypothesis labels, indicating that our proposed methods perform well under both frequentist and Bayesian interpretations of multiple testing.
Read the full abstract

Mathematical Finance

Geometric and Arithmetic Likelihood Aggregation for Diffusions with Heterogeneous Volatility

We study how to combine diffusion models that disagree about drift and covariance. Candidate-first relative-entropy minimization gives geometric pooling, whereas expert-first minimization gives the arithmetic mixture associated with weighted logarithmic wealth. Different quadratic variations can make path-space entropy infinite, and the arithmetic mixture need not be a Markov diffusion. We therefore specify a local criterion combining drift information, normalized by the second argument's covariance, with quadratic transport between Gaussian shocks in a fixed state metric. A Gaussian identity and an Euler convergence estimate justify this chosen criterion. The expert-first projection has posterior-mean drift and an inverse-covariance penalty for drift dispersion; in one dimension this penalty increases volatility. For Ornstein–Uhlenbeck experts with a common mean-reversion rate, coefficient regularity holds on the full horizon for common volatility and away from the initial time for heterogeneous volatilities. The candidate-first problem has a Hamilton–Jacobi–Bellman characterization. Its matrix covariance selector reduces by congruence to a Bures–Wasserstein barycenter. The condition $H+\lambda M\succ0$, with value Hessian $H$ and state metric $M$, is sharp for finiteness of the unrestricted local covariance problem; compact constraints keep that problem finite. A covariance-disagreement budget interprets the penalty parameter. Linear–quadratic, exact-transition, and financial examples distinguish dynamic volatility reduction, drift-dispersion inflation, and martingale restrictions.
Read the full abstract

Materials Science

High-pressure elastic properties of GeO2 polymorphs up to 120 GPa

We systematically investigated the phase stability, pressure dependence of the elastic properties, and elastic anisotropy of four GeO2 polymorphs: rutile-, CaCl2-, alpha-PbO2-, and pyrite-type phases using theoretical calculations based on density functional theory. The elastic constants were calculated at regular pressure intervals within the stability fields of each phase, as determined by static enthalpy calculations. We further employed a strain-coupled Landau free-energy expansion to describe the pressure evolution of the elastic response associated with the rutile- to CaCl2-type transition and elucidate the origin of the elastic softening near the transition. The rutile- to CaCl2-type phase transition is consistent with a Landau-type second-order transition. As the transition is approached, elastic softening develops in the rutile-type phase, resulting in anomalous pressure dependence of the bulk and shear moduli. The calculated elastic-wave anisotropy increases markedly near the transition, primarily due to the rapid reduction in shear-wave velocity, reaching a maximum of approximately 190% at 20 GPa. Following the transition, the anisotropy decreases sharply in the CaCl2-type phase and exhibits discontinuity at the CaCl2-type/alpha-PbO2-type phase boundary. The higher-pressure alpha-PbO2- and pyrite-type phases exhibit comparatively weak pressure dependence of anisotropy, with small discontinuities at their respective phase boundaries. The pyrite-type phase has the lowest anisotropy with AP = 4% and AS = 12% at 120 GPa, consistent with its high-symmetry cubic structure and nearly isotropic elastic-wave propagation.
Read the full abstract

All authors Gulshan Kumar, Sumit Ghosh, Sharad Babu Pillai, Rajkrishna Dutta

Machine Learning

Code-to-Harness: Distilling Black-Box Optimizers from Self-Play

Can an agent learn a numerical search strategy through executable practice and then transfer that strategy as text? We study low-budget black-box optimization, where unaided language models remain well below strong classical optimizers. During development, an agent repeatedly writes and evaluates optimizer programs. It then distills the resulting program and practice record once into a 197-word primary Harness A, which is frozen before evaluation. Harness A reduces Gemini Flash regret by 48% in an independent $N=30$ study ($p<.001$), enters the GP-BO performance range on the practice family, and lowers mean regret on all three held-out BBOB landscapes. The same text improves every tested Gemini executor and transfers to Claude Sonnet, reducing regret by 43% and 49% ($p\leq.005$). An independent end-to-end replication produces Harness B, a different program and text at the same performance tier. The same framework also attains the lowest regret on a sealed YouTube reward-tuning production benchmark. Executable practice is thus a viable way to discover a search policy, and language a portable medium for deploying it.
Read the full abstract

All authors Yi Wu, Zheng Ren, Zhiyu Hu, Haochen Wang, Daryl Chang, Li Wei, Ting Wang, Zhen Li, Pooja Gupta, Nitin Jindal, Lukasz Heldt

Quantum Physics

Noise Limits on Fault-Tolerant Fermionic Quantum Computing

Determining the highest amount of noise that quantum circuits can handle is an interesting and crucial task in the development of fault-tolerant quantum computation. Previous work has constrained this upper limit for local depolarizing noise to $\approx 45~\%$ for circuits constructed using the universal Clifford with T gate set by finding the noise threshold where the gate set loses universality. In this work, we use a similar method with the matchgate with non-Gaussian resource universal gate set to find a limit of $p=(8 - 2 \sqrt{6})/5$ or $\approx 62~\%$ for fermionic quantum computing that is independent of circuit depth. To do this, we use Uhlmann-Wootters concurrences for a 4-mode fermionic Choi state representing a resourceful gate combined with local depolarizing noise to determine when the combined channel is convex Gaussian. These bounds are not directly comparable due to differences in noise model making the bound of $\approx 62~\%$ the best known for fermions.
Read the full abstract

Machine Learning

Exact-Form Regret for Gradient Descent, Mirror Descent and Follow-the-Regularized-Leader

Online gradient descent is usually studied through external regret, where the learner competes with fixed alternatives. Recent work shows that first-order methods control richer action-dependent deviations. We ask for a geometric characterization of the deviations with respect to which online gradient descent, mirror descent, and follow-the-regularized-leader (FTRL) achieve no regret. We identify exactness as the common principle. Exactness means that the relevant displacement field is generated by a scalar potential, or equivalently that the associated one-form is exact in the geometry used by the algorithm. This geometry depends on the algorithm. For gradient descent it is Euclidean geometry, for mirror descent it is the geometry induced by the regularizer, and for FTRL it is the cumulative dual state. Under mild regularity conditions, exactness yields sublinear regret, while nonzero circulation provides the complementary obstruction and leads to linear regret. This gives a unified geometric framework for understanding the deviation classes controlled by these algorithms and reveals that different first-order methods can control genuinely different classes of deviations. These deviation classes have direct consequences for learning, particularly in games. We study the equilibrium notions induced by exact-form deviations and introduce conservative correlated equilibrium, reflecting both the conservative geometry of the underlying displacement fields and the restricted family of deviations available to the players. We characterize its relation to correlated equilibrium, determine when the resulting equilibrium notions coincide and when they separate, and show how these relationships depend on the geometry and the learning algorithm. Overall, this work gives a unified geometric account of what first-order online learning algorithms are no-regret with respect to, beyond fixed comparators.
Read the full abstract

Computers and Society

Democracy Needs Reach: Political Equality, Online Speech, and Algorithmic Recommendation

Within democracies, the capacity to influence political outcomes through speech depends not only on the right to express oneself, but also on the opportunity to reach relevant audiences. In this paper, I argue that the unequal distribution of algorithmic reach on social media platforms undermines equality of opportunity for political influence (EOPI), which is a central democratic ideal. Drawing on Niko Kolodny's work, I contend that current recommendation algorithms create and perpetuate informal inequalities by concentrating attention among a small minority of already-amplified speakers while systematically marginalizing others. To address this problem, I propose recommendation floors as a mechanism for equalizing political speech. To help users achieve meaningful participation, each verified account would receive guaranteed minimum recommendation for up to a limited number of political posts per week. Although this measure represents one component of the structural reforms needed to move the digital public sphere closer to democratic ideals, it offers a feasible pathway to reducing informal inequalities in political influence online.
Read the full abstract

Quantum Gases

Prethermal ripplons in quenched binary Bose-Einstein condensates

Prethermal states–long-lived quasi-equilibrium configurations–occur in a wide range of physical systems that exhibit fast dephasing or reconfiguration followed by slow relaxation towards thermal equilibrium. We experimentally studied the 1D interface between immiscible 2D Bose-Einstein condensates (BECs); following a quench, the interfacial capillary waves (ripplons) quickly relaxed into a long-lived prethermal state characterized by a persistent non-equipartition of energy, evoking the classic Fermi-Pasta-Ulam-Tsingou problem. We directly measured the interface's height profile as it evolved in time, identified the contribution of individual ripplon modes, and find that, though their individual amplitudes are thermally distributed, they are not in thermal equilibrium–high-momentum modes rapidly equilibrated with the bulk phonon modes of the 2D BEC, while lower momentum modes remained at elevated temperatures, forming a long-lived prethermal configuration for the whole system. We attribute this to kinematic isolation: the absence of energy- and momentum-conserving relaxation processes in our system at ultracold temperature.
Read the full abstract

All authors Yanda Geng, Stephen Eckel, Gretchen K. Campbell, Ian B. Spielman

Quantum Gases

Temperature-induced effective topology in many-body ultracold atomic quantum systems

Ultracold atomic quantum systems offer an unprecedentedly powerful platform for exploring interacting symmetry-protected topological phases. Here, we show that their characteristic control over temperature provides a resource for engineering effective topological regimes with no zero-temperature counterpart. Employing finite-temperature matrix-product-state calculations, we investigate experimentally accessible Hamiltonians - the interacting bosonic Su-Schrieffer-Heeger and spin-1 XXZ chains - that host a topological phase at zero temperature, as well as a fermionic dipolar ladder model whose ground state exhibits no topological order. By tracking complementary topological markers, we identify an intriguing mechanism rooted in the structure of the zero-temperature phase diagrams: in finite-size systems, excitation gaps with different magnitudes define an intermediate-temperature window where the correlations associated with the lower gap are suppressed, while those protected by the larger gap persist. This enables the emergence of effective finite-temperature regimes exhibiting topological features that are either absent or qualitatively different from those at zero temperature. Our results establish a novel route toward exploring effective topological phases in ultracold atomic quantum systems.
Read the full abstract

All authors Nitya Cuzzuol, Michele Miotto, Arianna Montorsi, Giacomo Valtolina, Luca Barbiero

Computer Vision

Low-Rank Prompt Learning for Vision-Language Models with Fixed-Token Bases

Prompt learning adapts CLIP to downstream recognition by replacing hand-written templates with learned continuous context vectors, which in Context Optimization (CoOp) form a dense prompt matrix $\mathbf{P}\in\mathbb{R}^{m\times d}$ trained from only a few examples per class. We study whether this matrix is over-parameterized by factorizing it as $\mathbf{P}=\mathbf{B}\mathbf{A}$, which cuts the trainable prompt parameters from $md$ to $r(m+d)$, and to $rd$ once the token-side factor $\mathbf{B}$ is fixed. Across seven few-shot benchmarks and two CLIP backbones, low-rank prompts match or improve dense CoOp at far fewer parameters, with the clearest gains on low-shot base-to-new generalization. We then find that the token-side factor need not be learned at all: fixing $\mathbf{B}$ to a Gaussian, orthogonal, SVD-derived, or even random basis and training only the embedding-side factor $\mathbf{A}$ stays on par with the fully trainable factorization, and a source-trained $\mathbf{B}$ offers no advantage over a random one. A prompt-factor asymmetry and a local update-space dimension gap show why fixing $\mathbf{B}$ is far less restrictive than fixing $\mathbf{A}$, and a smoothness-only guarantee certifies that optimizing $\mathbf{A}$ over a fixed $\mathbf{B}$ converges. In the CLIP prompt setting, the embedding-side coefficients carry the adaptation while the token basis can simply be fixed.
Read the full abstract

All authors Tanvir Muntakim Tonoy, Sajjad Ghiasvand, Mahnoosh Alizadeh, Ramtin Pedarsani

Earth and Planetary Astrophysics

Earth-Projected Clustering of Historical Optical Transients in the Palomar Observatory Sky Survey-I (POSS-I)

Palomar Observatory Sky Survey-I (POSS-I) images obtained before the launch of Sputnik contain star-like point sources consistent with sub-second flashes that are absent from all subsequent observations. The nature and origin of these transients remain poorly understood. Based on models suggesting they are in geosynchronous orbit, we estimated the latitude/longitude over which POSS-I transients appeared. From a dataset of 107,875 POSS-I transients, we selected a subset with high probability of representing real objects based on a machine learning model. Two independent approaches were used to test whether transients non-randomly grouped over specific locations (hotspots). Based on comparing transient numbers in discrete 5{\deg} x 5{\deg} Earth-projected regions to numbers randomly expected in these same regions, 16 statistically-significant hotspots were identified. Separately, two-step cluster analysis identified 6 highly-distinct hotspots (silhouette value = 0.70). The two methods identified several similar hotspots not attributable to POSS-I survey biases: 1) Pacific ocean west of southern Mexico/Central America, 2) southern Gulf of Mexico, 3) southwestern US (Sedona, AZ, White Sands, NM regions). Transients accounting for reported transient-nuclear testing associations displayed location specificity, with exclusively Pacific transient locations during Pacific nuclear testing and primarily southwestern US locations during Nevada testing. Findings hint at intriguing POSS-I transient characteristics.
Read the full abstract

All authors Stephen Bruehl, Beatriz Villarroel, Hichem Guergouri, Brian Doherty, Alina Streblyanska

Emerging Technologies

OmniEye: Efficient Multimodal Forensic Video Intelligence for Law-Enforcement Body-Worn Cameras

We introduce OmniEye, a multimodal video intelligence system for law-enforcement training and review (source code available on request to verified law-enforcement and public-safety agencies). OmniEye ingests body-worn camera footage and perceives every 30-second window jointly across video and audio with one multimodal foundation model. It then stores the model's structured output in an embedded SQLite database with BM25 full-text search. Officers can question the footage through an agent that writes structured queries, retrieves candidate windows, and re-perceives them with the model before it may cite them. The whole system runs on one 16 GB GPU with a 4-bit quantization-aware-trained model, and it also scales to full bf16 precision on a multi-GPU cluster.
Read the full abstract

All authors Mamadou K. Keita, Angela Srbinovska, Anita Srbinovska, Nishka Desai, Isabella Zicari, P. Kwaku Sanaah-Faried, Sanjay Charitesh Makam, Wyatt Auten, Vivek Senthil, Hannah Desnick, Jonathan Bateman, Adrian Martin, Christopher Homan, John McCluskey, Ernest Fokoué

Astrophysics of Galaxies

JWST Spectra Conclusively Show an Excess of Neutral Gas Outflows in Quiescent Galaxies at z=2-5

Galaxies exhibit a broad range of star formation activity, from actively star-forming to quiescent systems. Yet, the mechanisms responsible for the rapid shutdown and continued suppression of star formation remain poorly understood, particularly for the quiescent galaxies recently uncovered by JWST at $z>3$. Neutral gas outflows provide a direct tracer of gas removal and regulation in quiescent galaxies. We therefore present a NaID $\lambda\lambda5891,5897$ absorption–line stacking analysis of 274 galaxies at $z=2$–5 drawn from the DAWN JWST Archive (DJA) and the EMBER JWST program, using JWST/NIRSpec medium-resolution grating spectroscopy and NIRCam photometry. NaID absorption is detected in all quiescent galaxy stacks spanning $z=2$–5, providing the first statistical evidence that neutral gas outflows are a ubiquitous feature of quiescent galaxies in the early Universe. Compared to the non-quiescent galaxy stacks, the quiescent stacks show mass loading factors higher by 2–4 dex, with mass outflow rates $\dot{M}_{\rm out} \sim 9$–$30\,M_\odot\,{\rm yr}^{-1}$ elevated by $\sim0.5$–$1$ dex and outflow velocities $v_{\rm out} \sim 310$–$570\,{\rm km\,s}^{-1}$ higher by a factor of $\sim2$. The extreme mass loading factor values and declining star formation histories strongly indicate that these outflows cannot be driven by current star formation alone. In the statistically reliable quiescent redshift bins at $2 \leq z < 3$ and $3 \leq z < 4$, the elevated $[\mathrm{N\,II}]/\mathrm{H}\alpha$ and $[\mathrm{O\,III}]/\mathrm{H}\beta$ ratios are consistent with a possible AGN contribution, suggesting that non-stellar feedback may play a role in sustaining quiescence in galaxies at these epochs.
Read the full abstract

All authors Rion Oh, Gourav Khullar, Arianna S. Long, Julissa Sarmiento, Hollis B. Akins, Caitlin M. Casey, Yingjie Cheng, Andreas L. Faisst, Maximilien Franco, Ghassem Gozaliasl, Micheaela Hirschmann, Erini Lambrides, Jacqueline E. McCleary, Tiara Anderson, David C. Andrews, Dylan Berry, Nguyen Binh, Elaine Gammon

Artificial Intelligence

ContractEval: Query-Conditioned Execution Matching for Procedural Instruction Conformance

As LLM agents move from answering questions to carrying out procedures, failures can be unwarranted rather than visibly wrong: the final response looks acceptable even though the system skipped the check, branch, dependency, or invariant that made the answer justified. Output-only evaluation sees the answer, and trace-aware judging sees activity, but neither identifies which obligations were active for the query. We introduce CONTRACTEVAL, a diagnostic framework for making those active obligations explicit. It represents procedural instructions as query-active obligations and matches them against response or trace evidence, turning omissions, wrong branches, ordering errors, extra actions, invariant breaches, and output-contract violations into distinct conformance failures. On a controlled suite of audited procedural contracts, output-only and trace-aware LLM judges miss many injected structural failures; under gold expected and observed graphs, ContractEval detects and localizes all of them. LLM-backed extraction preserves much of this signal but remains calibration-sensitive. ContractEval is therefore not a compliance guarantee; it makes procedural conformance auditable rather than implicit in final-answer quality.
Read the full abstract

All authors Praphul Singh, Shanu Kumar, Akshat Agarwal, Ganesh Kumar

Quantum Physics

A Block Tensor Train Burer-Monteiro Framework for Low-Rank Quantum State Tomography

Quantum state tomography is a fundamental technique for estimating the state of a quantum system from measured data and plays a crucial role in evaluating the performance of quantum devices. However, standard estimation methods become computationally prohibitive as the system size increases due to the exponential growth of the density matrix, describing a quantum state, with the number of qubits. We propose a low-rank tensor-network framework for mixed-state quantum state tomography based on a block tensor train (Block-TT) factorization. Specifically, the density matrix is represented as the contraction of a Block-TT with its Hermitian transpose, yielding a TT analogue of the Burer-Monteiro factorization. This parameterization guarantees Hermiticity and positive semidefiniteness by construction while compressing the number of optimization variables from exponential to linear in the number of qubits. Building on this representation, we develop single-site and two-site density matrix renormalization group (DMRG) algorithms for estimating quantum states from compressed measurements. The resulting methods operate directly on the compressed parameterization, support adaptive rank refinement, and exploit efficient tensor-network contractions for expectation-value evaluation. The framework is applicable to a broad class of low-rank quantum states, including pure states, nearly pure states, and ground states that admit accurate tensor-network approximations. Numerical experiments demonstrate accurate state reconstruction from limited measurements together with substantial reductions in memory requirements and computational cost compared with conventional low-rank tomography methods.
Read the full abstract

All authors Shakir Showkat Sofi, Charlotte Vermeylen, Fatemeh Mohammadi, Lieven De Lathauwer

Group Theory

Involutory automorphisms of finite groups of odd order

For a finite group $G$ we write $\gamma_\infty(G)$ to denote the nilpotent residual of $G$, that is, the intersection of all terms of the lower central series. The following theorem is proved: Let $G$ be a finite group of odd order admitting an involutory automorphism $\varphi$ such that $G=[G,\varphi]$ and suppose that $\gamma_\infty(C_G(\varphi))$ has order $m$. Then the order of $\gamma_\infty(G')$ is bounded by a function depending only on $m$. This complements several earlier results on groups of odd order admitting involutory automorphisms.
Read the full abstract

Medical Physics

Develop and Optimize 5DCT Imaging Simulation and Reconstruction Methods

Purpose: To develop and optimize a 5DCT (3D + cardiac phase + respiratory phase) imaging simulation and reconstruction pipeline, and to compare two sinogram-space interpolation methods for reconstructing images at arbitrary combinations of cardiac and respiratory phase. Methods: Helical CT projections were simulated from the 4D XCAT phantom across a range of cardiac and respiratory motion states, with Poisson and electronic noise added. Ground-truth-matched volumes were generated at 5 cardiac phases and 10 respiratory amplitudes (50 total phase combinations). Because acquired projections are sparsely and unevenly distributed across this joint phase space, each target slice was reconstructed by interpolating rebinned sinogram rows to the target cardiac phase and respiratory amplitude, using either 2D scattered barycentric interpolation or 2D scattered local linear interpolation with a circular kernel for cardiac phase. Reconstructed volumes were compared to phantom ground truth using mean absolute error (MAE), and to conventional respiratory-gated 4DCT (r4DCT) reconstructed from the same simulated data. Results: Both interpolation methods eliminated the severe axial misalignment artifacts present when helical projections were reconstructed without phase-space interpolation. Local linear interpolation achieved lower MAE than barycentric interpolation across most tested conditions, with the largest improvement at low pitch. The 5DCT pipeline also produced respiratory-only volumes with fewer residual cardiac-motion artifacts than conventional r4DCT reconstructed from the same projection data, including at standard clinical pitch (0.1). Conclusions: 5DCT reconstruction using sinogram-space interpolation is feasible and can jointly resolve cardiac and respiratory motion with better accuracy than conventional 4DCT reconstruction.
Read the full abstract

All authors Yuhao Wang, Zhendong Zhang, Edward Robert Criscuolo, John Ginn, Ke Lu, Yao Hao, Deshan Yang

Optimization and Control

Unifying Variational View of Accelerated Primal-Dual Methods

We develop a unifying variational framework for accelerated primal-dual flows in affinely constrained convex optimization. In particular, it is shown that applying the Euler-Lagrange-Rayleigh (ELR) principle to coupled augmented Bregman Lagrangians systematically generates accelerated dynamics over general Bregman geometries and recovers a family of existing primal-dual mirror and Alternating Direction Method of Multipliers (ADMM) flows as special cases. We then establish $\mathcal{O}(e^{-b_t})$ convergence guarantees for these flows under mild assumptions. Lastly, we show that the proposed framework for algorithmic development extends from finite-dimensional optimization to constrained optimization over probability distributions.
Read the full abstract

Functional Analysis

A discrete Mellin calculus in the Toeplitz algebra

We prove that the classical Cesàro operator belongs to the Toeplitz algebra, providing an independent solution to a question raised by Barría and Halmos. Our approach is based on a discrete Mellin calculus for the sampled-ratio matrices \[ W(\kappa)_{jk} = \frac{1}{j+1}\, \kappa\!\left(\frac{k+1}{j+1}\right). \] For a natural algebra of kernels $A$, we prove that this quantization is multiplicative modulo Hilbert–Schmidt operators, \[ W(\kappa)W(\eta) - W(\kappa \star \eta) \in S_2, \qquad \kappa,\eta \in A. \] We further show that every operator $W(\kappa)$, $\kappa \in A$, belongs to the commutator ideal of the Toeplitz algebra. Since the Cesàro operator corresponds to the kernel $\kappa = \mathbf 1_{(0,1]}$, this resolves the Barría–Halmos question as a special case of the general framework.
Read the full abstract

Astrophysics of Galaxies

Characterization of Orbits in Bars in Disc Galaxies Using Fourier Frequencies

Bars are among the most prominent dynamical structures in disc galaxies, yet their long-term evolution and the orbital families that sustain them remain only partially understood. In this work, we introduce a new methodology based on frozen potentials combined with Fourier analysis of particle trajectories to identify regular and sticky orbits in self-consistent $N$-body simulations. This approach allows us to isolate particles belonging to the $x_1$ family, directly associated with the bar, and the $x_2$ family, linked to a secondary perpendicular structure. Tracking these orbits across multiple snapshots enables us to quantify the time evolution of key bar properties, including its mass fraction, semi-axes, and density profile. Compared with established used diagnostics, our method provides the closest match to the temporal behaviour of the Fourier bar-strength parameter $A_2$, while offering a direct dynamical interpretation and full three-dimensional characterization that Fourier-based approaches cannot provide. Our analysis further reveals that the indices $n_x$, $n_y$, and $n_z$ describing the bar density distribution are anisotropic and rarely equal to the canonical $n=2$ assumed in Ferrers profiles, highlighting the limitations of standard analytical approximations. We also find strong correlations between bar growth, orbital chaoticity, and angular momentum redistribution, with the bar acting both as a sink and as a driver of angular momentum transfer. A comparison between the two models analysed shows that rapidly forming bars are weaker and less stable than those that grow more gradually. Altogether, our methodology provides a robust framework for linking orbital structure to the dynamical evolution of barred galaxies.
Read the full abstract

Machine Learning

Uncertainty-Aware Sea-Ice Type Mapping with Multiple Ice Charts

Sea-ice stage of development (SoD) describes the age and associated thickness of sea ice and provides important information for navigation, and operational ice monitoring. SoD labels are obtained from operational ice charts, where trained analysts interpret satellite observations and assign standardized stage codes to regions with similar ice conditions. These codes often represent ranges of compatible ice thicknesses rather than exact physical values. Deep-learning methods can automate SoD mapping and commonly adopt operational ice charts as reference labels for training. These annotations are not exact, however; this is because chart interpretation relies on analyst judgement and on the observations available at the time, so different ice services may assign different SoD labels to the same conditions. We term this variation across independently produced expert annotations multi-annotator label uncertainty; collapsing the annotations into a single deterministic target discards this variation. A second source of uncertainty originates in the learned model itself. In this paper, we quantify both sources: annotation uncertainty from disagreement among independent ice-service charts and model uncertainty from the learned predictive models. We then evaluate their relationship by testing whether model uncertainty is higher where ice services disagree. We observe that supervision incorporating information from multiple annotators can improve this correspondence, with soft supervision achieving the highest overall correlation of 0.256. The relationship becomes substantially stronger near the ice edge, where model predictive uncertainty closely tracks multi-annotator disagreement, reaching a correlation of 0.704 within 0–10 km. Among the uncertainty-estimation approaches, Monte Carlo dropout provides the best-calibrated confidence estimates, with an expected calibration error of 0.050.
Read the full abstract

All authors Samira Alkaee Taleghan, Younghyun Koo, Andrew P. Barrett, Farnoush Banaei-Kashani

Systems and Control

Data-driven design of steady-state feedforward inputs for nonlinear systems under partial measurement

Designing trajectory tracking controllers for nonlinear systems remains a significant challenge, traditionally requiring precise mathematical models and complex analytical derivations. While the Internal Model Principle (IMP) provides a robust theoretical foundation for such problems, its application is often hindered by model uncertainty and the inherent complexity of nonlinear controller synthesis. This work proposes a practical data-driven control framework that bypasses the need for an explicit first-principles model by utilizing raw input-output data. By integrating fundamental results from IMP theory with nonlinear system analysis, the proposed approach improves design tractability. The framework's efficacy is validated through numerical simulations on two distinct nonlinear platforms: a mechanical load with a nonlinear friction term and an electrohydraulic actuator system.
Read the full abstract

All authors Sathya Aswath Govind Raju, Berk Altiner, Zongxuan Sun, Arunava Banerjee, Rajasree Sarkar, Kenneth Kim, Chol-Bum Mike Kweon

Optimization and Control

Afterimage Slow Regions in First-Order Methods for Linear Conic Programming

First-order methods for linear conic programming often stall on long plateaus. Existing analyses characterize when during a run or on which problem instances slow convergence occurs; we instead ask where in the state space slow convergence is present. We introduce the slow region family for parameterized averaged fixed-point iterations. On a slow region, one step moves the state by only a small fraction of its distance to the fixed-point set, so an orbit starting there keeps almost its initial distance for arbitrarily many iterations. We then develop the afterimage principle to construct them. A center family and a nearby petal family share the same limit parameter, so their residual fields become close, while their fixed-point sets or forward drifts stay far apart. The petal geometry then certifies a slow region for the center. We verify the standing assumptions for ADMM, sGS-ADMM, and PDHG, and give an LP, SOCP, and SDP gallery showing how varied slow regions can be.
Read the full abstract

Artificial Intelligence

Do Agents Know When They Succeed? Calibrating Agent Confidence from Internal Representations

As agentic systems getting adopted rapidly in safety critical applications, it is vital to measure the confidence associated with the agentic actions. In comparison to the traditional machine learning systems, agentic workflows have complex failure modes with planning, tool invocation and dynamic environment interactions. In this paper, we investigate whether model's internal representations provide stronger signals of eventual task success in multi-turn agentic setups. We introduce two complementary methods: Latent Trajectory Dynamics (LTD), which summarizes changes in residual-stream representations across an interaction trajectory, and the Action Representation Probe (ARP), which predicts success from representations formed at action decisions. Across three interactive benchmarks (Bash, SQL, Python) and three model families (Qwen14B, Qwen7B, DeepSeek6.7B), our methods consistently outperform surface level generation and sequence-based calibration baselines providing a zero-overhead reliability monitor that requires neither prompt alterations nor multi-sample rollouts.
Read the full abstract