Artificial Intelligence
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 1 September
Personalized Large Language Models (PLLMs) aim to tailor responses to individual users, where a central challenge is preference reasoning: inferring query-relevant preferences from user-related history. Existing benchmarks, however, largely assume that such preference can be retrieved from semantically related history. We study an underexplored but practically important regime, profile-preference conceptual misalignment (PRCM), where observable profile cues and query-specific preferences lie in different concept spaces, making semantic retrieval inconsistent for personalization. We introduce VIBE-Bench, a benchmark with two psychology-grounded tasks, 3,504 personas and 12,239 dialogues, including a manually verified gold test set, and requires cross-concept preference reasoning beyond surface semantic overlap. Experiments with several personalization methods show that current PLLMs largely rely on shallow semantic correlations and fail to acquire robust cross-concept mappings. These findings establish PRCM as a distinct failure regime in PLLMs and position VIBE-Bench as a focused testbed for advancing preference reasoning beyond semantic matching.
Robotics
VerNav: Verifier-First Low-Latency Vision-and-Language Navigation
Vision-and-Language Navigation (VLN) requires an agent to navigate through unseen 3D environments according to natural-language instructions. Explicit reasoning can improve instruction understanding and semantic grounding, but autoregressive generation at every step accumulates large decision-stage latency over multi-step navigation. We propose VerNav, a verifier-first framework for low-latency LLM-based VLN. The verifier reduces decision-stage latency by replacing per-step autoregressive generation with batched action verification, while an entropy-based adaptive generator is invoked only for uncertain decisions to produce compact state evidence. To further improve navigation performance with the verifier, we introduce a two-stage alignment scheme: (i) VPO improves local action-preference alignment in static verifier training, and (ii) step-level reinforcement fine-tuning provides dense progress rewards over multi-step navigation rollouts during dynamic task execution. Experiments on the Room-to-Room (R2R) benchmark show that the verifier-only decision path of VerNav achieves competitive navigation performance among representative LLM-based VLN agents while reducing average decision-stage LLM latency per step by more than $10\times$ compared with autoregressive methods.
Read the full abstract
Graphics
HyperSketch: Controllable Video Sketching in a Style Hyperspace
Vector sketch animation offers tremendous advantages for multimedia and creative design through concise line expressions and flexible editing. Learning-based generation methods of sketch animation have made significant progress in the last decade, but still suffer from limited style diversity and controllability. This paper presents a controllable video sketching method that automatically converts videos into multi-style vector sketch animations. A continuous style hyperspace is constructed by multi-dimensional sketch styles (fidelity, simplicity, text guidance strength) and the timeline. With this hyperspace, stroke control points are parameterized as 4-variable Bernstein polynomials, ensuring smooth and differentiable style transitions. A multi-task, multi-stage optimization framework is designed to learn stroke hyperparameters accurately and efficiently. We further developed a web-based interactive interface that allows real-time style manipulation via editable curves. Experiments show the style controllability, high-quality, and user-friendliness of our method, which outperforms SOTA methods.
Read the full abstract
Artificial Intelligence
RPCBench: A Benchmark for Proactive Premise Critique in LLM-based Recommendation
Large language models are increasingly used as interactive recommender assistants. Their evaluation should therefore go beyond plausible item recommendation and test whether they can recognize flawed recommendation requests. Existing recommender benchmarks mainly assess ranking, generation, or preference satisfaction, while existing error-detection benchmarks are usually not grounded in recommendation-specific user and candidate evidence. To address this gap, we introduce RPCBench, a benchmark for evaluating Recommender-Premise Critique: the ability to detect, diagnose, and properly handle faulty premises in natural-language recommendation requests. RPCBench contains evidence-grounded test instances from five recommendation domains and covers ten types of premise failures. Each instance provides a visible recommendation context and a corrupted user query. We further design a fine-grained evaluation framework that measures proactive detection, error localization, post-detection handling strategy, and evidence faithfulness. Through a systematic evaluation of 11 LLMs, we find that proactive detection is the main bottleneck in Recommender-Premise Critique, and models perform worst on underspecified-premise errors. We also observe that target-critical information density matters more than redundant evidence, and that longer reasoning does not monotonically improve critique quality: performance peaks at intermediate reasoning length, while overly long reasoning is accompanied by an overthinking penalty. The code is available at https://github.com/ZhongruChen/RPCBench.
Read the full abstract
Differential Geometry
The Discrete Harmonic Center of a Quadrilateral
Triangulate a simple quadrilateral by connecting all vertices to an additional point. If the vertices carry values, the piecewise linear function can be assigned a Dirichlet energy. We show that the minimal Dirichlet energy as a function of the location of the inserted point is convex, and the location of the minimum is independent of the values at the corners - a quadrilateral has a discrete harmonic center, characterized by an equilibrium of currents across the inserted edges. It turns out that the fixed points of the Möbius involution swapping opposite corners of the quadrilateral are critical points of this energy, so the discrete harmonic center is Möbius-covariant. For tangential and cyclic quadrilaterals the center admits simple closed forms related to the circle centers. The center and its data-independence generalize to polytopes with d + 2 vertices in dimension d, but the conformal characterizations are special to four points in the plane.
Read the full abstract
High Energy Physics (Phenomenology)
Electric Dipole Moments in the CP-violating Generational Three-Higgs-Doublet Model
Motivated by the Yukawa interactions in the CP-violating Generational Three-Higgs-Doublet Model (G3HDM), we investigate the electric dipole moments (EDMs) of the $b$ quark, $c$ quark, electron, neutron, and mercury atom, imposing constraints from the observed $125~\mathrm{GeV}$ Higgs signals, flavor physics, and rare $B$-meson decays. We find that the $b$ quark, neutron, and mercury EDMs are predominantly controlled by top-enhanced charged-Higgs amplitudes, whose internal cancellations are generally weak. Meanwhile, pronounced pairwise cancellations between nearly degenerate neutral Higgs states occur in the $c$ quark, electron, neutron, and mercury EDMs. Using degenerate perturbation theory, we show that these cancellations originate from approximate relations among the neutral-Higgs mixing-matrix elements, which enforce the anti-alignment of the corresponding CP-odd coupling invariants.
Read the full abstract
Materials Science
Element priors and target support shape chemical transfer in materials graph networks
Materials graph neural networks must often transfer to chemical regions weakly represented in training data. Such transfer can rely on predefined relations among elements or supervised evidence from target-containing structures, but these pathways are usually entangled. Here, held-out-element splits and incremental target support separate their roles. Without target-containing training structures, formation-energy errors depend strongly on the element representation, particularly for H, O and F. Matched perturbations show that representation-induced sharing matters beyond input dimension or numerical form, while a label-free similarity-graph prior reduces selected zero-shot errors. Adding a few target-containing structures sharply lowers errors and contracts differences among one-hot, k-hot and continuous inputs across ALIGNN and CGCNN. Calibration explains only part of this recovery, and freezing the initial element projection preserves most gains in five of six ALIGNN splits. Target support therefore shifts chemical transfer from reliance on static element relations toward learning from target-containing environments.
Read the full abstract
Signal Processing
Sharp Minimax Limits and Compatibility Spectra for Critical Near-DFT Index-Only Frequency Estimation
An $M$-channel discrete Fourier transform (DFT) channelizer routes an on-grid sinusoid to a single output. When each frame reports only one energy-proportional channel index, signed sub-bin frequency estimation becomes nonregular: dark-channel probability is quadratic in the offset, whereas orientation enters cubically. We study $N$ independent labeled reports under a known uniform-replacement probability $\epsilon_N$ and a single deterministic unitary shared by all frequencies and frames, constrained to routing defect $\tau/N$. If $\sqrt{N}\epsilon_N \to \lambda < \infty$, we establish an attained global-in-frequency minimax limit at the critical scales $N^{-1/4}$ for frequency offset, $N^{-1/2}$ for unitary perturbation and replacement, and $N^{-1}$ for routing defect. The effective unitary tangent is a symmetric complete-graph edge field modulo one centering nuisance, and its first variation is a radius-dependent weighted divergence. For $\lambda>0$, evaluation at $k$ distinct normalized offset magnitudes yields an exact Fourier-Cauchy nullity spectrum: $\lfloor(M-1)/2\rfloor$ evaluations are necessary and sufficient, for every choice of distinct magnitudes, to certify neutrality at all magnitudes. The terminal nullspace has a greatest-common-divisor dimension formula and positive-definite aggregate curvature. Consequently, exact DFT routing is uniquely minimax within the complete critical tangent class for $M=3$, whereas every positive critical defect budget strictly improves the minimax constant for $M\geq4$. The analysis also yields a smallest-prime curvature-visibility law and, for $M\geq5$, discontinuous compatibility geometry but a continuous minimax value at the zero critical replacement floor $\lambda=0$.
Read the full abstract
Information Retrieval
SwapRec: Warming Up Cold Items Through Training-Time Swaps
Interactions with cold items negatively impact real-time personalization of ID-based recommender systems. This is because the use of such interactions degrades user preference estimates, whereas excluding cold items from the user profile prevents real-time recommendation updates. In industrial scenarios, one heuristic often applied to address this shortcoming at inference time is to replace, i.e., "swap", cold-start items by their most similar "warm" neighbor, where similarity is inferred from the items' side information. In this paper, we demonstrate that sequential models, most often used for real-time personalization, are not robust to such swaps, and propose SwapRec, an approach to address this issue. SwapRec relies on using the same swap heuristics already at training time. We apply SwapRec to state-of-the-art models for sequential recommendation and analyze its impact by means of quantitative experiments in three recommendation domains (online shopping, movie, music). The experimental results show that, irrespective of the underlying sequential architecture, our easy-to-implement SwapRec approach allows for substantially more accurate recommendations when in presence of interactions with cold items, simultaneously leading to a larger percentage of cold items in the recommendation lists.
Read the full abstract
High Energy Physics (Phenomenology)
Radiative pion-pair production in disperon QED
Based on the previously developed disperon QED method for incorporating data input into loop processes in Monte Carlo codes, we calculate $ee\to\pi\pi\gamma$ at NLO and include the pion vector form factor within the form-factor scalar QED approximation wherever it is physically justified. In particular, this includes insertions of the two-pion two-photon Compton tensor into loop diagrams. We also consider a subset of contributions beyond, involving the pion Compton tensor with three photons. For these terms the form-factor scalar QED approach is less well justified, but we gain insight into the associated theory uncertainty for selected experimental scenarios. All calculations are implemented and made available within the Monte Carlo framework McMule.
Read the full abstract
Risk Management
Pricing the DeFi Tail: Do Protocols or Depositors Price Operational Risk?
Similar to banks, DeFi protocols expose depositors to operational risk (USD 9.45 billion across 1,075 events since 2020). Unlike banks, they are not required to hold capital against it. A protocol may maintain a buffer voluntarily. Absent one, the risk falls on the depositor, who should then demand a risk premium in the supply yield. I quantify the underlying tail on one benchmark, a per-sector Basel loss-distribution approach fitted to a new operational risk event dataset, and test both margins against it. Tails in the four core sectors are no heavier than the Moscadelli banking band $[0.85, 1.39]$. Bridge, Derivatives, and the residual Other sector exhibit cyber-loss-level tails ($\hat\xi \approx 1.6$), with point estimates past the infinite-mean boundary. The Lending tail implies a $\mathrm{VaR}_{99.9}$ capital buffer of 18% of TVL and of the ten largest Lending venues, the four holding a buffer cover on average 5% of it. Under market discipline, depositors should demand a higher yield in compensation where a venue does not maintain a buffer. I find that venues without a buffer pay a higher premium than those with (a 125-bps gap in medians): evidence the market discriminates in the right direction. However, the premium falls far short of an adequately priced tail. This unpriced tail falls disproportionately on the retail depositor, who sees only the posted rate but lacks the information and skills to price it. Because these products are not bank-regulated, I recommend disclosure over capital mandates: protocols, and any service providers that front access to it, should publish standardized losses, existing capital buffers and tail coverage.
Read the full abstract
Adaptation and Self-Organizing Systems
Explosive Synchronization in Inertial Kuramoto Models: Determining Resilience in Power Grids
Maintaining power-grid stability is essential for a sustainable energy supply. Using empirical power-grid data, we show that the inertial Kuramoto model with correlated powers and coupling strengths provides a relevant framework for analyzing explosive synchronization and grid stability. We identify two distinct synchronization pathways, initiated by population-driven or coupling-driven seed rotors, that yield different order-parameter behaviors. Inertia, in turn, determines whether the resulting seed clusters retain distinct angular velocities. Similar mechanisms govern recovery from external disturbances, linking power-grid resilience to these two nucleation pathways. Our findings provide a microscopic framework for understanding synchronization and recovery, with implications for stable power-grid operation.
Read the full abstract
Computer Vision
A multicenter benchmark and clinically structured metric for coronary CTA report generation
Reliable evaluation of automated coronary computed tomography angiography (CCTA) report generation requires standardized multicentre benchmarks and clinically structured metrics. We established a four-centre benchmark comprising 3,021 CCTA series from 818 patient-report pairs to evaluate seven open-source three-dimensional vision-language models. We developed CSM$_{\text{CCTA}}$, a clinically structured metric for CCTA report evaluation, with patient-, vessel-, and segment-level variables defined according to clinical guidelines. Report pairs are compared at the finest shared anatomical level, and the contributions of different clinical components are weighted based on expert assessments. We estimated these weights using 70 expert-scored cases and evaluated clinical alignment in a non-overlapping set of 30 cases. CSM$_{\text{CCTA}}$ showed a strong correlation with radiologist scores (Pearson's $r=0.97$, $p<0.001$), exceeding the next-best metric, FORTE ($r=0.70$), by 0.27, and agreed with expert preferences in 115 of 160 pairwise comparisons (71.9%). Under controlled perturbations, CSM$_{\text{CCTA}}$ remained stable to clinically equivalent wording and decreased monotonically with progressive information omission. In the multicenter benchmark, the CCTA-trained C2RG model achieved the highest CSM$_{\text{CCTA}}$ scores across all four hospitals, although its performance remained far from optimal. In contrast, CCTA-irrelevant reports accounted for up to 98.7% of the outputs from generalist models. Together, the benchmark provides a standardized setting for model comparison, while CSM$_{\text{CCTA}}$ enables clinically structured evaluation of finding agreement and anatomical specificity. These results support a more clinically aligned and anatomically resolved approach to evaluating CCTA report generation. Code is available at https://openi.pcl.ac.cn/OpenMedIA/CSM_CCTA.
Read the full abstract
Robotics
Knowing When to Stop: Adaptive Action Chunking via Internal Cross-Attention Dynamics in VLAs
Action chunking is a standard execution strategy in modern Vision-Language-Action (VLA) frameworks, but fixed execution horizons impose a trade-off between efficiency and accuracy. Short chunks require frequent inference and may cause oscillatory behavior, whereas long chunks can become misaligned with newly observed states. We address this limitation with an adaptive action chunking approach based on internal cross-attention dynamics in the action expert. We observe that, as the prediction horizon extends, action-to-observation cross-attention becomes increasingly dispersed and its entropy rises toward a plateau. This pattern is associated with higher action prediction error and provides an online signal that the current observation offers limited grounding for further open-loop execution. Based on this observation, we introduce a training-free truncation mechanism that detects sustained high-entropy plateaus and dynamically selects the execution horizon during inference. The method uses attention weights already computed by the policy and introduces negligible additional overhead. Evaluations on $\pi_{0.5}$ and X-VLA across RoboTwin 2.0, LIBERO, and three real-world manipulation tasks show improved average task success over fixed-horizon and adaptive chunking baselines, while preserving efficient closed-loop control. These results show that cross-attention dynamics can provide a practical internal signal for adaptive action execution in VLAs.
Read the full abstract
High Energy Physics (Phenomenology)
Neutrino masses and mixing angles in the Plan B Model
The Plan B Model was proposed to improve the global fit quality of the Standard Model to observables involving the $b\rightarrow s \ell^+ \ell^-$ transition whilst simultaneously providing a qualitative explanation for the small magnitudes of some off-diagonal quark mixing matrix entries. The model is based on applying an additional spontaneously broken $U(1)_{3B_3-L_e-2L_\mu}$ gauge symmetry to the Standard Model with family-dependent fermion charges. Right-handed neutrino fields are present and cancel gauge anomalies. We investigate the implications of the Plan B Model for neutrino masses and mixing angles. The model naturally suggests a Froggatt-Nielsen mechanism for neutrino masses and mixing hierarchies. We find that an implementation of the Froggatt-Nielsen mechanism works when additional suppression is present from a clockwork mechanism. We show how current neutrino oscillation data can be fit with order unity fundamental dimensionless couplings.
Read the full abstract
Robotics
Peg-in-Bench: A Modular Benchmark for High-Precision Robotic Insertion
High-precision insertion remains a fundamental challenge in robotic manipulation due to the strict alignment requirements and contact-rich interactions involved. Although peg-in-hole tasks are widely used for evaluation, existing bench- marks often rely on fixed task configurations, limiting their ability to assess robustness and generalization across different insertion scenarios. This paper introduces a reconfigurable peg-in-hole benchmark designed to evaluate task generalization in high-precision insertion. The benchmark consists of a set of fully 3D-printable modular components, including multiple peg geometries, tolerance levels, and configurable base structures that can be combined to generate a large variety of insertion and assembly tasks. By varying object layouts, orientations, and task structures while maintaining controlled physical conditions, the benchmark enables systematic evaluation of adaptation to unseen scenarios. To support reproducibility, we additionally provide a scenario generation tool capable of producing standardized task configurations and machine-readable task descriptions. The scenario generation tool and the STL files of the benchmark pieces are available through the project repository: https://github.com/aistairc/peg-in-bench.
Read the full abstract
Machine Learning
When Metropolis and Hastings Meet Bradley and Terry: Exact MCMC From Preference Voting
Sampling from distributions conditioned on desired semantic properties is an emerging challenge in modern generative modeling. Metropolis-Hastings (MH) provides a principled route to conditional sampling, but requires access to exact pointwise target-density evaluations, which are not available in generative settings. Meanwhile, pairwise comparisons by humans or model "judge" are highly accessible and have proved valuable across diverse applications. We introduce Pref-MH, a general exact MH sampler for judge-induced conditional distributions using only stochastic binary pairwise comparisons. Our key observation is that the MH unnormalized density ratio matches the preference odds of the Bradley-Terry (BT) choice model. The central challenge is that while MH requires precise ratio computation, BT judges provide only sampled binary feedback. To this end, we develop a valid accept/reject rule whose resulting Markov chain provably converges to the target distribution. We further show that, for a fixed proposal kernel and budget, Pref-MH is optimal in the Peskun-Tierney sense among this class of exact reversible acceptance rules. Experiments on text generation and molecular design with LLM judges, as well as image generation with VLM judges, demonstrate that Pref-MH provides a practical and flexible approach to conditional sampling when comparative feedback is relatively easy to obtain.
Read the full abstract
Artificial Intelligence
In-Context Neurofeedback: Can LLMs Control Their Internal Representations through Privileged Access?
Whether large language models (LLMs) can control their own internal representations matters for both machine metacognition and AI safety. A recent study applied neurofeedback to LLMs and claimed that they can control their internal representations. However, the reported control may rely on superficial mechanisms rather than genuine internal access because the control targets in that study are not privileged, meaning that a third party can infer them from the prompt. We redesign the neurofeedback paradigm for LLMs so that the control target satisfies the privileged access requirement, which is closer to neurofeedback experiments in human cognitive neuroscience. Under this stricter setting, the models do not demonstrate reliable control over privileged internal representations, suggesting that previously reported control cannot exclude the possibility that it relies on superficial mechanisms. Our results indicate that rigorous assessments of metacognition in LLMs require evaluation methods that demand privileged access.
Read the full abstract
Systems and Control
Lightweight CFR-Based Modulation Adaptation in a Real-Time MIMO-OFDM SDR Testbed
Conventional link adaptation typically relies on scalar link-quality indicators such as signal-to-noise ratio (SNR), while richer channel state information (CSI) can improve adaptation at the cost of higher processing complexity. This paper investigates a compact alternative for modulation selection in a real-time multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) system using channel frequency response (CFR) magnitude descriptors. A dataset of 87,817 over-the-air (OTA) samples is collected using a USRP-based testbed, with CFR measurements extracted at the base station (BS) from received uplink pilots. Decision tree (DT), random forest (RF), and k-nearest neighbours (KNN) classifiers are evaluated using BS-side SNR, CFR features, and their combination. SNR-only classifiers achieve 35%-42% test accuracy, whereas CFR-only features achieve 73.6%, 81.4%, and 80.0% for DT, RF, and KNN, respectively. CFR-based performance is maintained near the 10% BLER reliability thresholds, with RF reaching 82.8%. A depth-7 DT with 123 leaves is further integrated into the LabVIEW C Node for real-time inference. The results show that compact BS-side CFR descriptors provide more discriminative information than the available scalar BS-side SNR while remaining suitable for lightweight SDR implementation.
Read the full abstract
Astrophysics of Galaxies
H II region filling factors in NGC 628: Luminosity-size relation and connection with polycyclic aromatic hydrocarbon emission
Understanding the internal structure of H II regions is fundamental for constraining star formation processes in galaxies. We investigated how the filling factor (FF) relates to luminosity, size, electron density, and H$\alpha$ equivalent width (EW(H$\alpha$)) in H II regions, and explored its connection with polycyclic aromatic hydrocarbon (PAH)-to-dust emission as a possible tracer of evolutionary stages. We analyzed 622 H II regions in NGC~628, combining 475 regions from SIGNALS and 147 from PHANGS-MUSE. We derived their luminosities, emission-line fluxes, radii, electron densities, and FF, and used PHANGS-JWST/MIRI imaging to quantify the PAH-to-dust ratio $R_{\rm PAH}$ from the 7.7, 11.3, and 21~$\mu$m bands. Higher FF and EW(H$\alpha$) values are found in luminous regions, whereas more extended regions with lower EW(H$\alpha$) exhibit lower FF. We show that the H II region radius definition significantly affects the $L_{\rm H\alpha}$–$R$ relation. Low-luminosity compact H II regions appear to mark a transition from cluster-powered regions to nebulae ionized by single massive stars, around $\log(L_{\rm H\alpha}) \sim 37~{\rm erg \ s^{-1}}$. The PAH-to-dust ratio correlates with the volumetric H$\alpha$ luminosity density, $L_{\rm H\alpha}/R^3$, with a transition around $\log(L_{\rm H\alpha}/R^3) \sim 32~{\rm erg \ s^{-1}}$, corresponding to $\log({\rm FF}) \approx -4.4$. Regions with lower FF exhibit higher $R_{\rm PAH}$, suggesting less efficient PAH processing in more porous structures. These results are consistent with an evolutionary scenario in which FF decreases with stellar cluster age as giant H II regions evolve toward fainter and more extended states. The volumetric H$\alpha$ luminosity density reduces covariance between $L_{\rm H\alpha}$ and $R$ induced by region-definition methods, enabling more consistent cross-catalog comparisons.
Read the full abstract
Computer Vision
HELIOS: From midnight to noon, continuous outdoor urban scene relighting
Modifying the illumination of driving images is a fundamental challenge, as most datasets are captured at specific times of day. Existing methods rely on synthetic data or paired multi-illumination supervision, which limits their generalization to the diverse and challenging conditions of real-world scenarios. To address this, we propose HELIOS, a novel image relighting approach that relies on unlabeled real-world datasets without requiring any paired images for training. Our approach integrates albedo-based conditioning into a cycle-consistent diffusion pipeline to prevent identity collapse and ensure accurate domain translation. To handle low-visibility nighttime conditions, we introduce a robust albedo distillation strategy that transfers structural stability from the daytime domain. Additionally, we replace traditional text prompts with a fine-grained control mechanism based on GPS-derived solar angles, enabling smooth and continuous lighting manipulation across the day-night cycle. Through extensive evaluation and a user study, we demonstrate that HELIOS produces structurally consistent and realistic results in both night-to-day and day-to-night tasks, outperforming state-of-the-art methods.
Read the full abstract
Materials Science
Fourier Neural Operators for Composition-Driven Crystal Structure Discovery
Crystalline materials discovery is essential for energy, electronics, and catalysis, but the vast chemical and structural space makes exhaustive screening infeasible. Existing voxel-based methods are limited by the local receptive fields of three-dimensional convolutional neural networks and the posterior collapse of high-dimensional variational autoencoders. Here, we develop a Fourier Neural Operator (FNO)-based crystal-field solver that maps a prescribed chemical formula and lattice parameters to periodic number-density and electron-density fields. By operating on global Fourier modes, the solver captures long-range correlations in periodic crystal fields beyond conventional local convolutions. Building on this solver, we construct a coupled generation-solving framework in which a conditional variational autoencoder generates diverse candidate lattice parameters in a low-dimensional basis-coefficient space, followed by density-field prediction and atomic reconstruction through peak detection, position optimization, and weight optimization. The reconstructed structures are further screened using voxel-level filtering, machine-learning interatomic-potential relaxation, and first-principle calculations. The framework generates novel structures across 104 chemical formulas with competitive reconstruction accuracy, demonstrating high generative diversity and structural validity. By extending Fourier neural operators to periodic crystal fields and coupling them with composition-conditioned lattice generation, our approach provides a scalable route to crystal structure discovery from prescribed chemical compositions.
Read the full abstract
Optics
Direct Optimization of a 3D Finite-Source Reflector via Neural-Network Parameterization
We present a direct optimization method for three-dimensional freeform reflectors that transform the light of a finite-étendue source into a prescribed far-field angular intensity distribution. The reflector profile is represented by a small neural network (a multilayer perceptron), which is trained end-to-end through a differentiable ray-tracing objective. We furthermore parameterize the emission directions in gnomonic coordinates, and show how we use this to ensure that every emitted ray intersects the reflector. At each iteration, the network is converted to a bicubic spline representation for ray-tracing efficiency, and intersections with this smooth surface are solved by a damped Newton solve, with gradients computed via the implicit function theorem. The traced output distribution is compared with the desired target on a 'soft' histogram, under an $H^{-1}$-type spectral weighting that emphasizes long-range transport of flux to improve convergence. Optimization is performed using a BFGS method with self-scaled Broyden updates and a plateau-perturbation rule to prevent stalling. The method converges reliably within seconds on a single GPU for all examples tested.
Read the full abstract
Computer Vision
Vision-Language-Guided Pseudo-Labels for Unsupervised Domain Adaptation in Semantic Segmentation for Waste Sorting
Obtaining labeled data for semantic segmentation in applied settings (e.g., autonomous driving, industrial waste sorting) is expensive and often infeasible at scale. We present a cross-modal pseudo-labeling pipeline that enables unsupervised domain adaptation without any target-domain annotations. The pipeline is built on two core foundation models: SAM generates class-agnostic region proposals, and EVA-CLIP assigns semantic labels based on region-text similarity, with confidence filtering ensuring that only reliable pseudo-labels are used for self-training a segmentation model. As an optional extension, BLIP provides language-grounded verification for ambiguous regions, thereby improving pseudo-label quality without altering the overall pipeline. Evaluated on two domain shifts, synthetic-to-real autonomous driving and, with a primary focus, lab-to-factory industrial waste sorting, the pipeline consistently improves over source-only baselines. Our results demonstrate that pseudo-label quality, not quantity, is a decisive factor in self-training under domain shift, and that cross-modal language grounding offers a practical path to reliable automatic annotation in deployment-critical applications.
Read the full abstract
Nuclear Theory
Femtoscopy as a New Probe of the Nuclear Equation of State
Femtoscopic correlations are widely regarded as precision probes of hadronic interactions through vacuum final-state interactions after kinetic freeze-out. Here we demonstrate that, in baryon-rich heavy-ion collisions, the nuclear mean field generates an additional dynamical contribution to femtoscopic correlations during the transport evolution. Using the Parton-Hadron-Quantum-Molecular Dynamics (PHQMD) transport approach, we investigate proton-proton, proton-$\Lambda$, three-proton, and proton-proton-$\Lambda$ correlations in Au+Au collisions at $\sqrt{s_{\rm NN}}=3$, 4.5, 7.7, and 19.6 GeV. We find that the nuclear mean field produces a characteristic low-$k^*$ enhancement that is strongest at the lowest beam energies and gradually disappears with increasing collision energy. Furthermore, both the stiffness and the momentum dependence of the nuclear equation of state leave distinct signatures in the femtoscopic correlation functions, with higher-order correlations exhibiting substantially enhanced sensitivity compared with conventional two-particle observables. Our results demonstrate that femtoscopy extends beyond its traditional role as a tool for studying hadronic interactions and serve as a new class of microscopic observables for the nuclear equation of state, complementary to collective flow and subthreshold strangeness production, thereby opening a new avenue for exploring dense baryonic matter in low-energy heavy-ion collisions.
Read the full abstract
Machine Learning
Poisson-Gamma Dynamical Systems with Time-varying Transition Dynamics
Bayesian methodologies for handling count-valued time series have gained prominence due to their ability to infer interpretable latent structures and to estimate uncertainties. Among these Bayesian models, Poisson-Gamma Dynamical Systems (PGDSs) are proven to be effective in capturing the evolving dynamics underlying observed count sequences. However, the state-of-the-art PGDS still falls short in capturing the transition dynamics that are commonly observed in real-world count time series. To mitigate this limitation, a PGDS with time-varying transition kernel (TV-PGDS), is proposed to allow the underlying transition matrices to evolve over time. Three specifically-designed Dirichlet Markov chains (Dir-Dir, Dir-Gam-Dir, PR-Gam-Dir) are constructed to accommodate heterogeneous structural mutations within these dependencies. Leveraging Dirichlet-Multinomial-Beta data augmentation techniques, a fully-conjugate and efficient Gibbs sampler is developed to perform posterior simulation. Experiments show that, in comparison with related models, the proposed PGDS achieves improved predictive performance due to its capacity to learn time-varying dependency structure captured by the time-evolving transition matrices.
Read the full abstract
Numerical Analysis
Asymptotic behavior of Eckhoff's method for convergence acceleration of Dirac eigenfunction expansions
The current paper considers the problem of recovering a vector-function on $[-1,1]$ from a limited number of coefficients of its expansion into a series of eigenfunctions of a one-dimensional Dirac system. The Krylov–Lanczos–Eckhoff–Gottlieb acceleration method is examined in the situation when the boundary values it requires have to be computed from the generalized Fourier coefficients themselves. This leads to a $2q\times 2q$ linear system whose matrix is a block Vandermonde matrix; its determinant and inverse are computed explicitly, and the asymptotic $L_2$-error constant of the method is found, paralleling the classical trigonometric case.
Read the full abstract
Commutative Algebra
Unique factorization results for generalized power series
Factorization in rings of the form $K((G^{\le 0} )) $ exhibits pathological behavior due to divisibility by monomials. It remains open whether this is the only obstruction and whether the quotient by the ideal generated by all monomials is a unique factorization domain. Prior to this work, the only instances of unique factorization beyond the irreducible elements followed directly from the primality of elements which aren't divisible by any monomial and whose support has order type $\omega$ or $\omega+1$. Using the $RV$ tool from valuation theory as a key ingredient, we establish unique factorization for elements of $ K((\mathbb{R}^{\le 0}))$ which aren't divisible by any monomial and whose support has order type $\omega^{\alpha} $ or $\omega^{\alpha}+1 $ for a large class of non additively principal ordinals $\alpha$.
Read the full abstract
Data Structures and Algorithms
Random-Priority Frontier Routing: Tight $\Theta(n^c)$ Bounds Against $c$-Node Cartels
We study path diversification in trusted-node networks, where sensitive material is relayed through intermediate nodes, some of which may be compromised. Our randomized routing rule assigns each vertex an independent random priority and repeatedly expands the highest-priority vertex on the global frontier of the explored region. Let $G$ have $n$ vertices, let $s,t$ be honest endpoints, and let $C$ be a set of $c$ compromised intermediate vertices, called a cartel, whose deletion leaves $s$ and $t$ connected. For every fixed $c$ and every fixed target probability $q\in(0,1)$, we prove that $\Theta(n^c)$ independent executions are sufficient in the worst case for some route to avoid $C$ with probability at least $q$.
Read the full abstract
Artificial Intelligence
CARE: Contrastive Anchor-based Rubric Evolution for Large Language Model Post-Training
Rubric-based reinforcement learning decomposes open-ended instructions into prompt-specific, flexible rubrics, making it better suited than reinforcement learning with verifiable rewards for post-training LLMs on open-ended tasks. However, static rubrics are inevitably hacked as the policy evolves, and existing dynamic approaches introduce new problems: undirected rubric extraction, unreliable hack detection, and unbounded rubric proliferation. We propose $\textbf{CARE}$ ($\textbf{C}$ontrastive $\textbf{A}$nchor-based $\textbf{R}$ubric $\textbf{E}$volution), which grounds every rubric evolution step in a high-quality anchor response generated by a frontier model conditioned on the prompt and its rubrics. At each training step, CARE contrasts the highest-scoring rollout against the anchor, enabling two complementary mechanisms: an Adaptive branch that reactively repairs reward misspecification; and a Chase branch that proactively converts frontier-level quality gaps into sharper rubrics. Together, the two branches $\textbf{maintain discriminative accuracy in the high-reward region}$—the precise region where reward over-optimization mostly originates. Experiments on WildChecklist-9K with Qwen2.5-7B-Base and Qwen2.5-7B-Instruct show that CARE achieves state-of-the-art performance on Arena-Hard-2.0, InfoBench, and FollowBench, and is the $\textbf{only}$ method whose win rate against GPT-4.1 anchor responses shows sustained improvement throughout 300 training steps; additional results on Llama-3.1-8B-Instruct and Qwen3-8B further indicate that CARE generalizes across model families.