Statistical Methodology
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Friday 28 August
Incomplete adjudication and endpoint misclassification arise when gold-standard event classification is available only for an internal validation sample. With accurate follow-up times and covariates but error-prone event indicators, naive Cox regression can be biased and inverseprobability weighting inefficient. We develop orthogonal validation-augmented Cox (OVAC) regression, a cross-fitted augmented Cox estimator for incomplete failure indicators. OVAC replaces the missing event indicator with a cross-fitted augmented pseudo-event and explicitly retains the first-order contribution from estimating the Cox risk-set mean. The same term emerges from projection of the full-data influence function through the validation mechanism, linking the score expansion to the observed-data efficient influence function. The score exhibits exact product-form nuisance drift, yielding double-robust identification, Neyman orthogonality, and root-n inference under product-rate conditions. In 1,000 R replications, full-variance SE/SD ratios were 0.997 and 0.992, with 95% coverage of 0.955 and 0.948. A 200-replication diagnostic showed that the risk-set term alone was 77.8% and 81.1% of the full-SE magnitude, although covariance cancellation made its net SE effect smaller than 0.3%. In a 250-replication method comparison, OVAC reduced empirical variance by 38.8% and 37.7% relative to IPW. OVAC provides machine-learning-compatible Cox estimation with explicit risk-set linearization, calibrated inference, and validation-design guidance.
Biomolecules
Reconstruction-Aware Cryo-EM Particle Picking
Cryo-electron microscopy (cryo-EM) determines the structures of proteins and macromolecular assemblies at near-atomic resolution, and the final 3D reconstruction depends on extracting a clean particle stack from noisy micrographs. This extraction decomposes into three sub-tasks, namely particle picking, contamination removal, and 2D class selection. Each of them, however, is trained and evaluated in isolation, and none is optimized for the reconstruction. We instead integrate the three sub-tasks into a single pipeline posed against downstream reconstruction quality. We instantiate the pipeline with a state-of-the-art component for each sub-task, CryoTransformer picking permissively, MicrographCleaner masking contamination, and CryoSift selecting 2D classes by a continuous quality score, and close the loop with a fine-tuning step that returns the surviving particles to the picker. The pipeline achieves a better 3D resolution than every picker we compare. We also show that the best 2D F1 is not the best resolution, so particle selection is better treated as one reconstruction-aware pipeline judged by the map it delivers.
Read the full abstract
Human-Computer Interaction
Delegating Before Learning: Where Generative AI Sits in Students' Professional Communication
We conducted an interview study with twelve students on their use of generative AI in academic communication. Students delegated professional messages to AI most where the pressure to sound professional is highest: email to instructors and administrators. AI involvement ranged from correcting the writer's own text to working out and writing the message outright, and students checked AI-written text against two criteria: whether it looks like AI and whether it sounds like them. Building on these findings, we model the AI-mediated process of writing a student–instructor email at the highest level of involvement we observed, and compare it with an unaided model of writing the same messages, built from participants' accounts and a classic model of the writing process. Three differences emerge: the learning loop that builds writing skill is removed, the message is no longer written for its specific recipient, and the confidence a successful exchange returns goes to using the system rather than to the writer's own ability. From these differences we derive two risks, that individual capacities never form and that authenticity and trust in communication become work. Design can respond to both but is unlikely to be enough, so the risks also need research and policy attention.
Read the full abstract
Mesoscale and Nanoscale Physics
Electrochemical impedance spectroscopy of graphene nanogaps
Graphene nanogaps represent an emerging platform for nanoscale electrochemical and sensing devices, with potential applications in next-generation biomolecular sequencing. However, their interfacial behavior in aqueous environments remains poorly characterized, particularly with respect to frequency-dependent impedance and charge transport mechanisms at the graphene edge. We fabricate graphene nanogaps by controlled electrical breakdown in an inert atmosphere and study their electrochemical response. Upon exposure to ambient conditions, a surface contamination layer supports electrochemical activity within an adsorbed ultrathin conductive film between the graphene edges. Electrochemical impedance spectroscopy reveals distinct frequency-dependent responses consistent with a Warburg element associated with diffusion in this confined interfacial film. The impedance evolves systematically with liquid $\mathrm{p}H$, reflecting changes in electrochemical reaction-diffusion processes at the graphene edges. A quantitative equivalent-circuit model captures these effects and enables extraction of an effective nanogap length scale from impedance spectra, providing information complementary to that obtained from tunneling measurements.
Read the full abstract
Databases
Engaging the scientific community in high-quality biocuration: a report on the International Society for Biocuration workshop, 'Maximizing community curation for the benefit of all'
Biological knowledgebases traditionally rely on expert, professional curation of the research literature to maintain up-to-date collections of data organized in machine-readable form. However, despite the increasing amount of curatable biomedical knowledge, support for knowledgebases is declining, leaving these resources no alternative but to explore additional ways of updating and maintaining content. One way in which knowledgebases have addressed this problem is by engaging researchers to help curate their published papers, a process generally known as 'community curation'. As helpful as community curation can be, though, it is not universally adopted and, for groups that do have it, there is a wide range of approaches. To learn about existing community curation pipelines and explore possibilities for working towards a common approach, we organized a workshop, Maximizing Community Curation for the Benefit of All, at the 18th International Biocuration Conference, hosted by the Stowers Institute for Medical Research. Our aim was to examine the different strategies that groups use, share successes, failures, and ongoing challenges, and produce suggested deliverables for broader adoption of common best practices and tools for effective community curation. Representatives from 18 different resources, ranging from model organism and specialty knowledgebases to journals and literature resources, presented their work. The result was a comprehensive assessment of the state-of-the-art for community curation and an in-depth discussion on how community curation can become standard practice for maintaining timely, highquality biological resources that will continue to provide scientists with the essential information they need for their research.
Read the full abstract
Combinatorics
Riordan array representation of recursive polynomial sequences, orthogonal polynomial sequences, and $d$-orthogonal polynomial sequences
We study when a polynomial sequence $\{p_n(x)\}$ satisfying a linear homogeneous recurrence with polynomial coefficients admits an ordinary Riordan array as its coefficient matrix. For second-order recurrences $p_{n+2}(x)=a(x)p_{n+1}(x)+b(x)p_n(x)$, we give a complete characterization. We extend this to a necessary condition and a full factorization criterion for recurrences of arbitrary order $\ell \geq 3$. We then develop a production-matrix framework for arbitrary orthogonal polynomial sequences (OPS), not restricted to the Riordan-array-type case: for any lower-triangular invertible coefficient matrix $A$ of an OPS, the production matrix $P_{A^{-1}}=ASA^{-1}$ is always the tridiagonal Jacobi matrix encoding the three-term recurrence, and the first column of $A^{-1}$ always gives the moment sequence – even when, as for the Legendre polynomials, the recurrence coefficients are non-constant and no Riordan array representation of the coefficient matrix exists. We illustrate this with Legendre and Chebyshev polynomials as, respectively, non-Riordan-type and Riordan-type examples, and give an explicit closed-form coefficient matrix and its inverse for the generalized Gegenbauer–Humbert OPS. Finally, we extend the framework to $d$-orthogonal polynomial sequences, showing that the coefficient matrix of a $d$-orthogonal sequence is always invertible, that its associated production matrix is $(d+2)$-banded (lower Hessenberg) and encodes the corresponding $(d+2)$-term recurrence, and that the first $d$ columns of the inverse matrix recover the moment sequences of the defining vector functional – identifying $d$-orthogonality with $(d+1)$-Hessenberg generalized Riordan arrays and extending the classical $d=1$ tridiagonal correspondence.
Read the full abstract
Artificial Intelligence
Evaluating the Hidden Costs of Personalization in Large Language Models
While Large language models (LLMs) incorporate user personalization signals to improve usability and helpfulness, they increasingly shift from providing balanced, informative responses toward optimizing for user satisfaction when conditioned on personal context such as conversation history, inferred preferences, and user profiles. Specifically, we identify three emerging risks: (1) irrelevant personalization, where models reference personal information in unnecessary contexts; (2) preference narrowing, where models reinforce informational echo chambers; and (3) sycophantic bias, where models agree excessively with user opinions. As a result, models may reference personal information in contexts where it is unnecessary, inadvertently collapse response diversity, or agree excessively with user opinions. Despite the growing use of personalization in AI assistants, there has been limited systematic evaluation of its potential side effects. To bridge this gap, we propose PRISK, a dynamic evaluation framework with automated data generation and tailored metrics that uncovers systematic limitations in current LLM personalization and how personalized information shapes its responses. Our empirical analysis across 13 LLMs demonstrates the presence of user profiles and retrieved memories consistently exacerbates biases, resulting in an average drop of 45.9% in irrelevant personalization, 41.7% in preference narrowing and 61.7% in sycophantic bias.
Read the full abstract
General Relativity and Quantum Cosmology
Torsion and Nonmetricity Constraints From Neutron Spin Rotation in Polarized Matter
Many modified-gravity frameworks employ non-Riemannian connection degrees of freedom, including torsion and nonmetricity. In Einstein-Cartan-type theories, torsion is associated with spin density, while more general metric-affine frameworks can be investigated through phenomenological searches for in-matter torsion and nonmetricity backgrounds. This work applies an effective field theory approach to characterize general couplings of electron and neutron operators to spacetime torsion and nonmetricity up to mass dimension six, predicting novel neutron-polarization signatures in the presence of an electron background. Neutron spin-rotation data from a polarized-electron ensemble inside a compensated ferrimagnet are used to constrain for the first time axially symmetric, direction-dependent in-matter torsion and nonmetricity combinations.
Read the full abstract
Mesoscale and Nanoscale Physics
Domain walls with alternating magnetic order in a model with dipolar coupling
A model for a one-dimensional chain of elongated nano-scale magnetic islands with dipole interactions is analyzed here for the properties of its static domain walls with site-by-site alternating order. The anisotropic magnetic islands on a nonmagnetic substrate have their longer axes oriented transverse ($y$-direction) to the chain direction ($x$-direction), in a transverse applied magnetic field. The islands' magnetic dipoles $\vec{\mu}_n$ are represented as macrospins of fixed length $\mu$. The nearest-neighbor (NN) dipole interactions drive transverse alternating order, allowing for doubly-degenerate, uniform, static, $y$-alternating states, where the dipoles alternately point transverse to the chain direction, as in $\vec{\mu}_n = \pm(-1)^n \mu \hat{y}$. Assuming only NN interactions, the domain walls connecting these two alternating states are found with numerical relaxation simulations and analyzed in a two-sublattice continuum theory. As the uniaxial anisotropy constant $K_1$ descends from larger values until it closely approaches the NN dipolar coupling constant $D$, the domain wall width grows indefinitely, and the large-$x$ continuum solutions closely approach the lattice numerical solutions. The applied field produces a very slight canting of the dipoles towards the field, maximum in the center of the domain wall. The dipoles on the two sublattices are found to rotate in opposite senses as one scans along the lattice, resulting in a large longitudinal magnetic moment of the domain wall. A much smaller transverse magnetic moment has a topological contribution that depends on whether the chain length is odd or even.
Read the full abstract
Computer Vision
BlobBoards: Robust Markers for Accurate Pose
We propose BlobBoards, a fiducial marker system comprising a dense, multi-scale field of Gaussian blobs and a feature-based pipeline for joint detection, identification, and pose estimation. Each board is registered from hundreds of blob features whose dense spatial coverage constrains pose, while multiple scales preserve detectability across large changes in focal length, distance, and obliquity. Learned local descriptors are matched to the reference pattern and spatially verified, so the correspondences determine pose and certify identity. Against motion-capture ground truth, BlobBoards achieve median translation errors of 3.6-5.0 mm, reducing AprilTag's median translation error by 89% on small boards and 70% on large ones. They also produce far fewer large-rotation failures than state-of-the-art tag systems. BlobBoards achieve the highest detection rate, 80% versus 74% for AprilTag and 58% for ArUco, with the largest margin on the smallest markers. Under 50% occlusion, they still detect 69% of boards with essentially unchanged median translation error, while AprilTag and ArUco detect none. In experiments BlobBoards give state-of-the-art detection rate, pose accuracy and occlusion robustness.
Read the full abstract
Solar and Stellar Astrophysics
The Hot, Continuum-compact State of the Yellow Hypergiant V509 Cassiopeiae: CHARA Diameters, CO-band Angular-extension Constraints, and Companion Limits
Yellow hypergiants are rare, evolved massive stars generally interpreted as post-red-supergiant objects evolving blueward through or near the dynamically unstable Yellow Evolutionary Void. V509~Cassiopeiae is a remarkable example: its spectroscopically inferred effective temperature increased from approximately 5000~K in the mid-1980s to about 7900~K by the late 1990s and has since remained near this value during its post-heating state. We use simultaneous six-telescope CHARA observations obtained in 2023 with MIRC-X in the $H$ band and MYSTIC in the $K$ band to measure its photospheric diameter, search for a luminous companion, and constrain any spatially extended CO atmosphere. Interferometric data fitting with fixed atmosphere-model center-to-limb variation profiles yield limb-darkened angular diameters of $1.1840$–$1.1950$~mas. Although nominally about 5% smaller than the previous Palomar Testbed Interferometer measurement, the difference is only $1.8\sigma$, indicating no significant secular change over 17–21~yr. The closure phases are consistent with a centrosymmetric brightness distribution, and no near-infrared-bright companion is detected over the sampled separations. The median $3\sigma$ limits are $\Delta H=5.28$~mag and $\Delta K=6.48$~mag. The B1~V companion proposed from ultraviolet spectroscopy is expected to lie below these limits and is not excluded. The CO first-overtone channels give a weighted mean CO-to-continuum diameter ratio of $1.011\pm0.004$, below the adopted $3\sigma$ detection criterion. We find no significant CO-band angular extension. V509~Cas is thus hot and molecularly compact despite retaining spectroscopically visible atomic circumstellar gas.
Read the full abstract
Quantum Physics
Representation Learning with Quantum Signal Processing
Representation learning begins when training changes the features that define similarity between data. A frozen-kernel model only reweights a fixed geometry. We establish quantum signal processing (QSP) as a solvable quantum model of the representation-learning regime. At arbitrary depth, we compute the exact mean and variance of its quantum neural tangent kernel, revealing an input-dependent angular geometry whose diagonal remains non-self-averaging even when the underlying unitary approaches Haar randomness. We also prove a sparse-data guarantee for the full nonlinear gradient flow without freezing or ensemble-averaging the kernel: the realized dynamics converges to an integrable scalar flow with a time-dependent kernel closure and explicit convergence times. A finite-depth speed limit holds for every data set and trajectory. At higher data density, numerical results show coupled evolution beyond both the scalar and frozen-kernel descriptions. These results give a controlled theory of learned quantum data geometry with provable training dynamics beyond the frozen limit.
Read the full abstract
Machine Learning (Statistics)
Quantitative Target Convergence and Uniform-in-Time Propagation of Chaos for Langevin-Regularized SVGD
We establish quantitative convergence to the target and uniform-in-time propagation of chaos for Langevin-regularized Stein variational gradient descent. The Stein interaction need not be small relative to the confining Langevin drift and does not generally yield a contractive particle coupling. At the mean-field level, the Stein and Langevin components dissipate the same relative entropy in the kernel-induced Stein and $2$-Wasserstein geometries, producing the squared kernel Stein discrepancy and relative Fisher information. Under a log-Sobolev inequality for the target, this yields exponential last-iterate convergence. We also derive a finite-particle entropy identity relative to the product target, giving exponential-in-time convergence of the empirical measure up to polynomial sampling errors. For propagation of chaos, we develop two complementary finite-time approaches. A synchronous coupling, combined with exponential moment estimates for the nonlinear mean-field diffusion, yields explicit single-exponential bounds in Wasserstein distance and kernel Stein discrepancy (KSD). Moving-product entropy gives joint-law relative entropy control relative to the evolving mean-field product law and, through entropy superadditivity and concentration, fixed-marginal relative entropy and total variation bounds and empirical KSD estimates. Under an additional $T_2$ inequality for the initial law, it also yields Wasserstein bounds. Combining these finite-time estimates with target convergence at a logarithmic cutoff time gives polynomial uniform-in-time propagation of chaos rates in expectation for empirical KSD and $W_2^2$, and for fixed-marginal total variation and $W_2^2$. All bounds control the last iterate in physical time. We also compare the two finite-time mechanisms and identify regimes in which each gives the sharper polynomial exponent.
Read the full abstract
Robotics
Dual Park-Ravani Interpolation of Rigid Motions: Acceleration-Field Continuity and Holonomic Hermite Repair
The Park-Ravani construction generates a twice continuously differentiable, frame-invariant spline on SO(3) by exponentiating cubic canonical-coordinate polynomials. We show that the construction transfers, without changing form, to the group of orthogonal dual tensors, a representation of rigid displacements. The transferred recurrence is stated compactly through the dual extension of the right Jacobian of the exponential map and its first Fréchet derivative. This yields interpolation of prescribed rigid poses and continuity of the body dual twist and its first derivative. Using the higher-order rigid-body kinematics of dual spatial twists, we then prove that the resulting curve has a continuous physical acceleration field, not merely a continuous quantity obtained by formally differentiating the dual part of a twist. We also distinguish algebraic dual transfer from temporal differential prolongation: their simultaneous first-order use takes place in a hyper-dual algebra, and interpolation of arbitrary prolonged nodal data need not be holonomic. A noncommuting three-pose example verifies the recurrence, all knot continuity statements, and dimensional covariance under a change from meters to millimeters. We define and analyze the first-order holonomy defect of a generic hyper-dual interpolant, exhibit an exact counterexample, and remove the defect by cubic or quintic Hermite interpolation in dual logarithmic coordinates.
Read the full abstract
Other Statistics
When to take one box, when to take two: A concrete analysis of Newcomb's problem
Fifty-seven years of debate have not led to a consensus on Newcomb's problem. I argue that this failure comes from not viewing the problem in concrete terms, for which common-sense intuitions are clearly applicable. If near-perfect predictions are not required - only predictions good enough that Evidential Decision Theory (EDT) recommends taking only one box - Newcomb scenarios without any fantastic elements are actually feasible. I give a detailed account of such concrete scenarios, in which the decision-maker has varying amounts of information about the prediction process. I argue that in these scenarios it is rational to take both boxes, as Causal Decision Theory (CDT) recommends. To make this more convincing, I introduce a simpler impersonal Newcomb problem, also with a concrete realization, to help bridge causal intuitions from everyday decisions to the standard Newcomb scenario. I also argue that Newcomb's problem with nearly perfect predictions can only be realized by a (currently fantastic) process in which the Predictor accurately simulates the thoughts of a Participant. In a functionalist view of consciousness, this simulation will be a conscious entity, whose experience will not be distinguishable from that of a “real” person. In this scenario, CDT recommends taking one box. I conclude that when Newcomb's problem is properly analysed in concrete terms, CDT gives the correct answer in all scenarios.
Read the full abstract
Artificial Intelligence
Discovering Machine Correlates of Consciousness
Currently, in biological systems Neural Correlates of Consciousness (NCCs) are characterized in terms of EEG and FMRI signals. Unfortunately, this characterization prevents the transferability of the NCCs concept to machines. Such transferability would be useful in order to investigate AI consciousness. In this paper we provide an alternate characterization that is transferable, and enables the analogous definition of Machine Correlates of Consciousness (MCCs). Specifically, we propose that NCCs (MCCs) are substrate-level signals that are not under human (AI agent) control, and that are reliably modulated by emotions. This paper presents the first empirical investigation of MCCs. Specifically, we present the results of experiments conducted with two LLMs, Llama-2 7B and Llama-3.1 70B parameters. In these LLMs we collect hardware anomaly traces that are substrate-level indicator-sequences. And we show that after controlling for confounding factors, these are modulated differently by emotional and neutral computations. And this difference is statistically significant for the larger Llama-3.1 70B, but not for the smaller Llama-2 7B. The results constitute initial empirical evidence that MCCs are present in the Llama-3.1 70B configuration. And they are consistent with the hypothesis that consciousness probability and degree increase with the LLM sophistication. Independently of consciousness, MCCs can also be used for detection of emotions in AI agents.
Read the full abstract
Computer Vision
Text-Driven Artistic Staging: 3D Posing, Lighting, and Camera References from Paintings
Artists coordinate human pose, illumination, and camera placement to convey narrative and emotion, but existing generative methods typically model these elements independently. We introduce text-to-editable 3D staging, a task that jointly generates human poses, a dominant light, and a camera configuration from an affective description. We construct 11,911 text–staging pairs from 2,328 figurative paintings by reconstructing SMPL bodies, estimating low-frequency illumination, recovering camera parameters, and pairing each scene with ArtEmis descriptions. We train a flow-matching transformer that supports variable numbers of figures and produces multiple staging alternatives for each prompt. On held-out descriptions, the model achieves 32.2% retrieval R@1, compared with 16.6% for CLIP-based nearest-neighbor retrieval, while approximately preserving corpus-level diversity. These results demonstrate the feasibility of generating editable, emotionally conditioned 3D staging references from text.
Read the full abstract
Computers and Society
Filling holes in science draws collective attention, but most higher-order holes remain unexplored
Most scientific discoveries justify their significance by filling holes between existing ideas and arguments. Representing knowledge as high-dimensional concept embeddings, we use persistent homology to detect scientific holes of increasing order, from lower-order gaps between disconnected ideas to higher-order cavities within unevenly connected ones; then we identify the research that fills them. Researchers who close holes draw outsized collective attention, staging novelty that the citing literature rewards, most strongly in discovery-oriented fields and least in design-oriented fields. Closing a hole is followed by persistent work on the same combinations of concepts at many times the rate of comparable holes left open. Yet as knowledge grows, higher-order holes explode while the fraction of research that fills them collapses, leaving most higher-order combinations unexplored. These results call for a richer science of holes and mark a frontier where contemporary AI might help fill the gaps human science opens.
Read the full abstract
Spectral Theory
Non-Elliptic Quadratic $\mathcal{PT}$-Symmetric Operators and Similarity to Self-Adjoint Operators
We prove a similarity result for non-self-adjoint non-elliptic quadratic $\mathcal{PT}$-symmetric operators with real spectrum satisfying a dynamical averaging condition. In particular, we show that such an operator is weakly similar to a self-adjoint operator precisely when the fundamental matrix of the associated quadratic form is diagonalizable.
Read the full abstract
Artificial Intelligence
Explainable Artificial Intelligence (XAI) in Computational Pathology: Definitions, Taxonomy, and Recommendations
Computational pathology (CompPath) is transforming medicine by leveraging artificial intelligence (AI) algorithms to support diagnosis, prognosis, and treatment prediction from gigapixel whole-slide images. Clinical adoption is progressing, but is constrained by concerns about safety, accountability, and regulatory oversight in high-stakes clinical environments. Explainable AI (XAI) systems hold promise for building trust and enabling verification, yet the literature remains fragmented due to inconsistent terminology, overlapping methodological families, ad hoc validation, and current reviews. This review aims to formalize XAI methods in CompPath through the: i) introduction of a pathology-centric vocabulary comprising seven core terms; ii) development of a taxonomy across methodological families and three orthogonal axes (stage, type, scope); and iii) establishment of a task-driven framework that maps five clinical questions to recommended methods, method evaluation, and deployment context. Five key gaps between current XAI capabilities and clinical deployment are identified, and actionable steps are proposed to advance XAI for CompPath.
Read the full abstract
Human-Computer Interaction
Visible but Not Yet Curatable: Characterizing the Curatability of Compact and Derived Open LLM Artifacts
Open Large Language Model (LLM) research increasingly produces compact and derived artifacts, such as adapters, quantized checkpoints, merged models, and distilled variants, that are distributed across papers, model hubs, model cards, code repositories, and release statements. Although these artifacts are publicly visible, digital libraries often lack sufficient evidence to identify, preserve, and cite them as coherent scholarly objects. We introduce a framework that conceptualizes curatability as a record-level property of distributed scholarly records and operationalizes it through four evidence dimensions: artifact identity, scholarly linkage, upstream evidence, and release assets. Guided by this framework, we conduct the first collection-scale characterization of open LLM curatability using a May 2026 snapshot of 191,375 public Hugging Face repositories and a core corpus of 2,214 scholarly papers. Our results reveal a pronounced visibility-to-curatability funnel. While 90.7% of paper records contain at least one useful curation signal, only 18.1% combine usable upstream evidence with concrete release evidence, and only 6.1% provide sufficiently coordinated evidence to support high-curatability records. Based on these findings, we derive a minimal seven-field curatable record and complementary responsibilities for model hubs, scholarly indexes, and digital libraries, providing practical guidance for improving the preservation and bibliographic control of open LLM artifacts.
Read the full abstract
Audio and Speech Processing
Accurate Plate Reverb Parameter Estimation Using Two-Stage Evolutionary Search
We describe our submission to Task A of the 1st DAFx parameter estimation challenge. The task is to recover the six physical parameters of a simulated metal-plate reverberator – its dimensions and material properties – from a single impulse response (IR). We treat this as a black-box optimization: candidate parameter sets are fed to the simulator and scored by a loss against the target IR. The method has two stages. The first uses CMA-ES, an evolutionary optimizer, to recover five of the six parameters, comparing IRs under an amplitude-normalized loss. Amplitude normalization makes the search robust but discards the cue to the sixth parameter, the plate's surface density; a second stage therefore estimates it alone, with a ternary search on the un-normalized loss. As the choice of loss strongly affects the search, we select it beforehand, and analyze why compression in the common multi-scale spectral loss degrades recovery. Finally, we test our method on a validation set of 50 IRs, discuss a pathological failure mode, and ablate to justify having two different stages instead of a unified CMA-ES search.
Read the full abstract
Quantitative Methods
CryoAnomaly: Few-Shot Cryo-EM Particle Picking via Anomaly-Guided Hard Negative Suppression
Cryo-electron microscopy (cryo-EM) is crucial for analyzing 3D biological structures, in which automated particle picking is essential for the workflow. However, fully supervised methods require extensive manual annotations. While few-shot learning offers a potential solution, existing approaches struggle to handle the diverse contaminations inherent in real micrographs owing to insufficient negative supervision, resulting in false positives that degrade the quality of the 3D reconstruction. Although synthetic data provides abundant and perfect labels, their use has primarily been restricted to validating identical proteins or augmenting full-shot training, leaving the potential for few-shot adaptation to novel proteins unexplored. In this study, we investigate the effective utilization of synthetic data for few-shot particle picking. We identify that direct transfer fails due to a “clean-vs-contaminated” Sim2Real gap. To overcome this, we propose CryoAnomaly, which is a framework that turns this gap into an advantage. By employing an anomaly detector trained on clean synthetic data, we identify real-world contaminants as anomalies and suppress them via a novel anomaly-guided hard negative suppression loss. On the CryoPPP benchmark, CryoAnomaly achieves the best picking accuracy and reconstruction resolution among state-of-the-art methods in the few-shot setting. The proposed anomaly-guided loss is confirmed to be effective on datasets with diverse contamination, where reliable pseudo-anomaly masks can be generated. Our code, dataset, and project page are available at: https://github.com/riku359/CryoAnomaly, https://huggingface.co/datasets/rikrikrik/CryoAnomaly, https://riku359.github.io/CryoAnomaly-page/.
Read the full abstract
Functional Analysis
A Proof of the Matrix Spencer Conjecture
We develop a novel approach to matrix discrepancy based on matrix small-ball estimates. Specifically, we use a determinantal weight (obtained from the log-barrier) to scale the small-ball probability into a partition function of a tilt of the Gaussian measure. We then employ matrix-weighted Poincaré inequalities to compare this partition function to that of a pinched or diagonal part of the matrix, obtaining dimension-free constants. Our technique yields a hereditary small-ball estimate for Gaussian series that should be of independent interest. As the main application, we resolve the Matrix Spencer conjecture: for symmetric $n\times n$ matrices $A_1,\dots,A_n$ with $\|A_i\|\le1$, one can efficiently find a coloring $x\in\{\pm1\}^n$ with $\|\sum_{i=1}^n x_iA_i\|=O(\sqrt n)$.
Read the full abstract
Algebraic Geometry
Noncommutative Hourglasses II 1/2: Derived Category of Birational Linkage with Well-Formed Singularities
We consider varieties whose singularities are complete intersections within toric singularities, which we call well-formed varieties. Using the construction of equivariant standard resolutions, we can extend several classical formulas in the derived category of bounded coherent sheaves to this singular setting. Finally, we also discuss the Bondal–Orlov localization for certain morphisms between terminal complex threefolds and their stacks.
Read the full abstract
Computer Vision
FigMirror: Ground It, Code It, Plot It
Converting scientific figures into executable code has gained increasing attention, yet existing methods primarily focus on reproducing the reference figure itself. A more practical setting is to plot new data while preserving the visual style of a reference figure (e.g., color scheme and typography). Prior approaches mimic the reference through pixel-level optimization and struggle to carry its style to new data. We show that the key to this task lies in the coordinate grounding and coding capabilities present in modern computer-use models. We propose FigMirror, an agentic framework that unlocks these capabilities through Grounded Measurement, which locates visual elements by coordinates and measures their properties through executable code. We further introduce PlotTwin-Bench, an expert-curated benchmark with fine-grained code and image-level style metrics. Experiments show that FigMirror consistently outperforms existing methods on reference-conditioned style transfer. All plots in this paper are generated by FigMirror, except those produced by other methods for comparison. Our code and data are available at: https://github.com/VILA-Lab/FigMirror.
Read the full abstract
Computational Complexity
Unconditional $V^0_1$-independence of a certified hitting-set principle
We show that a certified formalization of the hitting-set-existence axiom of Atserias and Tzameret, instantiated on the parity-based Nisan-Wigderson compression class of Khaniki, is independent of the two-sorted theory $V^0_1$ of $\mathrm{AC}^0$-reasoning, unconditionally: $V^0_1$ proves neither it nor its negation. The same holds for the corresponding certified dual weak pigeonhole principle, whose refutation is witnessed by a single seed that certified-computes every string of the model simultaneously. The mechanism is a bounded-arithmetic transfer of Atserias-Tzameret's reduction from hitting sets to the dual weak pigeonhole principle: the amplification half of that reduction, the sole source of its NP-oracle, is unnecessary at the native stretch of the Nisan-Wigderson map, and the compression half becomes a $V^0_1$-provable implication once circuit evaluation is replaced by its certified $\Sigma^B_0$ unfolding. This is, to our knowledge, the first independence result for a derandomization-flavoured existence principle at the $\mathrm{AC}^0$-reasoning level, and it makes explicit the bridge between the Khaniki Nisan-Wigderson line and the Atserias-Tzameret reverse mathematics of hitting sets.
Read the full abstract
Quantum Physics
Dissipation across the ultrastrong-coupling regime of nanomechanical quantum Rabi systems
Mechanical resonators ultrastrongly coupled to quantum two-level systems provide a promising route towards mechanical qubits by introducing significant anharmonicity to the mechanical modes, particularly in the slow-oscillator regime. Although the resulting hybrid system is well described by the quantum Rabi model, a consistent treatment of dissipation remains challenging across the broad parameter space routinely probed in current nanotube electromechanical devices. Here, we investigate dissipation in the open quantum Rabi model using a Born-Markov framework based on the slowly varying bath spectrum approximation, yielding a Lindblad master equation applicable far beyond conventional descriptions while recovering them in their respective limits. Using this framework, we analyze experimentally accessible observables across this parameter space. As the secular approximation breaks down, phonon blockade progressively washes out. Our approach remains valid in this regime, enabling a quantitative description of the continuous evolution of phonon blockade with coupling strength and dissipation. At finite temperature, we find a suppression of the temperature-induced increase of coherence decay rate for weak anharmonicity. Under driving, our approach remains applicable to substantially stronger perturbations than conventional dressed-state master equations and shows that an apparently classical observable can coexist with Wigner negativity. We further capture the weakly anharmonic regime arising from finite detuning in the double-quantum dot. These results establish a unified description of dissipation from weakly anharmonic operating regimes to the strongly anharmonic mechanical-qubit regime and provide experimentally relevant predictions for ultrastrong electromechanical systems.
Read the full abstract
Quantum Physics
BAHAMAS: A Control Plane for Optimization and Execution of Variational Quantum Circuits
Variational quantum algorithms (VQAs) suffer from unstable optimization due to temporal noise drift and static qubit mappings that distort gradient signals across iterations. We present BAHAMAS, an online control framework that stabilizes noise exposure by adaptively selecting physical mappings via consensus-based fidelity estimation, without requiring simulators, offline training, or prior executions. Across real quantum devices, BAHAMAS improves optimization reliability and supports inference-time retargeting under drift through robust, per-iteration control.
Read the full abstract
Statistical Methodology
CARB: A Covariate-Assessed Robust Borrowing Strategy with Literature-Informed Prior Weights for External Data
Borrowing external control data can improve the efficiency of clinical trials, particularly when patient accrual is difficult. A persistent challenge is how to prespecify the degree of borrowing systematically and transparently. In practice, prior weights are often selected heuristically or calibrated through simulation to achieve desired operating characteristics, making them difficult to justify scientifically. Moreover, patient-level covariate data from external sources are rarely available when the new trial is designed, precluding patient-level adjustment methods. We propose CARB (Covariate-Assessed Robust Borrowing), a framework that formalizes prior-weight specification as a design-stage assessment of baseline compatibility. Using only aggregate information, CARB quantifies discrepancies in prespecified baseline covariates between the new trial and each external source, without using outcome data from the new trial. A prespecified mapping translates the resulting dissimilarity measure into a source-specific prior weight on the exchangeable component of a robust borrowing model. Simulation studies show that CARB reduces bias and type I error inflation relative to fixed borrowing under observed and unobserved incompatibility, while improving efficiency when external controls are compatible. An application to advanced melanoma trials illustrates covariate-informed borrowing from multiple historical sources. An apparent discrepancy in reported baseline characteristics serves as a warning signal that reduces borrowing. CARB provides a transparent and reproducible way to borrow cautiously when patient-level covariate data from external sources are unavailable.