Peer Revenue Now accepting positions

Papers

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

All of arXiv

Monday 9 November

Networking

Rethinking Adaptive Routing on Dragonfly

The Dragonfly topology is widely deployed in leading supercomputers, where adaptive routing is crucial for high-performance interconnection. Despite years of research, a dilemma remains: state-of-the-art adaptive routing algorithms achieve excellent performance but demand hardware budgets far beyond what real router chips can afford – prohibitive buffers, logically dependent floating-point operations, or exhaustive path-set traversals – whereas realizable algorithms deliver unsatisfactory performance. Furthermore, existing algorithms fail to exploit the abundant almost-minimal paths in Dragonfly: when only the local channels of a minimal path are congested, they reroute packets to significantly longer global non-minimal paths, wasting global bandwidth and increasing latency. To address both limitations, we analyze intra-group path contention and propose the Decoupled Incremental Adaptive Routing (DIAR) algorithm, which decouples routing into global path selection at the source and incremental local detours onto almost-minimal paths, guaranteeing deadlock freedom without additional virtual channels, escape rings, or turn models. Requiring only a few comparators, shifters, adders, and multiplexers, DIAR reduces buffer overhead by up to four orders of magnitude compared with state-of-the-art algorithms, while achieving comparable or superior performance across all evaluated scenarios: relative to the strongest realizable adaptive routing algorithm in each scenario, DIAR improves saturation throughput by up to 30.0% across synthetic traffic patterns and improves performance by up to 34.9% (13.2% on average) across HPC workloads.
Read the full abstract

Signal Processing

Sparse Range-Doppler Profile Recovery in Colored Interference for Adaptive Radar

Range-Doppler profile (RDP) recovery is a fundamental task in adaptive radar signal processing, whose performance can be severely degraded by Doppler grid mismatch and colored interference. This article develops a unified sparsity-aware framework for on-grid and off-grid RDP recovery in the presence of correlated clutter with unknown spectral properties. The problem is formulated within a regularized maximum likelihood framework by exploiting both primary and secondary data, where the sparse RDP and interference covariance are jointly inferred, while Doppler frequency displacements are additionally estimated in the off-grid case to mitigate basis mismatch. Both covariance-adaptive one-step formulations and their sample-covariance-matrix-based two-step alternatives are developed within the mentioned framework. The resulting challenging nonconvex optimization problems are efficiently tackled by a majorization-minimization (MM) algorithm for the on-grid case and an MM-minimum block improvement (MBI) approach for the off-grid counterpart. Furthermore, Bayesian information criterion (BIC)-based refinement strategies are introduced to improve RDP recovery and Doppler frequency displacement estimation. Numerical results under colored interference demonstrate the superior recovery performance of the proposed methods over representative benchmarks.
Read the full abstract

All authors Tao Wang, Augusto Aubry, Antonio De Maio, Junli Liang

Robotics

Budget-aware Correspondence-driven View Selection for Real-time 3D Perception of Mobile Robots

3D visual perception and scene reconstruction are critical for autonomous robots and intelligent transportation, yet real-world deployments often generate long, redundant image sequences that hinder downstream processing. This report investigates BCVS (budget-aware correspondence-driven view sampling), a pose-free view selection algorithm that offers 22+ FPS on a CPU, enabling online filtering for efficient 3D perception by mobile robots. Unlike existing approaches that rely on full structure-from-motion (SfM) pipelines or camera pose estimation, BCVS employs a purely correspondence-based scoring strategy that prioritizes view novelty while maintaining sufficient overlap for geometric stability. Given a user-specified budget, BCVS iteratively selects the most distinct frames and suppresses near-duplicates, producing compact subsets that preserve connectivity and minimize reconstruction loss. Extensive experiments on benchmark show that BCVS outperforms CPU-friendly baselines at tight budgets and remains competitive as budgets scale. Field trials with large aerial and marine robotics data further validate its practicality and scalability: BCVS reduces redundancy up to 16% while sustaining robust SfM registration and high-quality 3D reconstructions.
Read the full abstract

All authors Vaishnav Ramesh, Jacob Carter, Shivali J. Patel, Sanjeev J. Koppal, Md Jahidul Islam

Machine Learning

Efficient Online Submodular Maximization with Bandit Feedback

We study online monotone submodular maximization under a cardinality constraint with bandit feedback. On each round, the learner selects at most $k$ elements from a ground set of size $n$ and observes only the value of the selected set. We develop an efficient algorithm achieving $O\!\left(k\sqrt{nT\log(n/k)}\right)$ expected $(1-1/e)$-regret over $T$ rounds. To our knowledge, this is the first polynomial-time algorithm with $\sqrt{T}$ dependence on the horizon for arbitrary monotone submodular functions in the bandit setting. Our approach uses randomized sampling and a carefully constructed potential to reduce online submodular maximization to online linear optimization over the probability simplex.
Read the full abstract

High Energy Physics (Theory)

Discretising 2D Fermionic CFTs

We extend the exact fixed-point tensor construction of Cheng et al. to fermionic minimal models, providing an analytic construction of fixed-point tensors for fermionic rational conformal field theories. The fermionic fixed-point tensor is defined as a correlation function of boundary-changing operators on a triangle, with careful treatment of fermionic parity and spin structure. Boundary tensors are also constructed and combined with triangle tensors to form strips, enabling the extraction of scaling dimensions for boundary-changing operators. The construction incorporates modified weights for shrinkable boundary conditions, systematic depiction of spin structures, recovering both the Neveu-Schwarz and Ramond sectors. As a benchmark, our tensor with a minimal truncation of descendant levels yields convergence to the exact bulk scaling dimensions of many low energy states for the free Majorana fermion ($c=1/2$), demonstrating the efficiency of approximate fixed point tensors from boundary changing operators. We also make use of a more general description of fermionic CFTs based on fermionisation of rational bosonic CFTs, and make a generic prescription for discretisation making use of their connections to modular tensor categories. We show that the discretised spin structures on a spin surface naturally recover the signs needed to recover the R/NS sectors. We propose that the collection of OPE coefficients of the discretised 2d CFT can be naturally interpreted as a state-sum of spin-TQFTs, analogous to the bosonic case. This work provides analytically computed starting points for tensor network simulations of fermionic critical phenomena.
Read the full abstract

All authors Dazhuo Cheng, Hexuan Li, Gong Cheng, Ling-Yan Hung

Soft Condensed Matter

More particles or the pair? An exact test of how to improve mode-coupling theory

How a dense liquid arrests into a glass remains a central problem in physics. Mode-coupling theory (MCT), the leading microscopic theory of the glass transition, fails to reproduce mean-field caging. Two routes are proposed to repair it: tracking more-particle correlations, or enforcing repulsion within each colliding pair. Testing both on an exact benchmark liquid, we show that MCT lets touching spheres pass through each other at all orders: adding particles dilutes memory and worsens the transition, whereas restoring pair impenetrability recovers mean-field arrest and the cage size.
Read the full abstract

Numerical Analysis

Operator Learning of Microstructure-Dependent Internal-Variable Models for Inelastic Homogenization: Approximation and Complexity

We study the learning of homogenized constitutive laws for inelastic heterogeneous materials, aiming to replace costly concurrent unit-cell simulations with surrogates that generalize across loading histories and microstructures. We focus on the recurrent neural operator framework, motivated by the explicit form of homogenized Kelvin–Voigt linear viscoelasticity. In this framework, internal variables enable a Markovian approximation of loading-history dependence, and neural operators represent the microstructure-dependent constitutive response. For periodic Kelvin–Voigt viscoelasticity, we prove a universal approximation theorem showing that the model can approximate the homogenized constitutive law to any prescribed accuracy, uniformly in time and over a wide set of admissible strain trajectories and microstructural property fields, in two and three dimensions. This comprises a significant extension of the existing, somewhat limited, one-dimensional theory that uses explicit solutions for piecewise constant materials. Instead, in two and three dimensions, we adopt a more versatile approximation based on the spectral representation of the memory kernel that arises from homogenization. This also enables us to give an explicit bound on the internal-variable dimension, sufficient for approximation, exhibiting logarithmic growth in the inverse relative stress error and in material contrast. Numerical experiments on viscoelasticity and crystal plasticity complement the theory, illustrating the roles of internal-variable dimension and sample complexity in learning homogenized responses from unit-cell data. Theoretical results are formally verified in Lean 4.
Read the full abstract

Optics

Origin of devil's staircases and anomalous Arnold tongues of breathing solitons in optical Kerr resonators

Synchronization phenomena are ubiquitous across natural and engineered systems, and optical resonators supporting breathing solitons offer a natural platform for their investigation. In driven Kerr cavities described by the Lugiato-Lefever equation (LLE), breathing-soliton dynamics constitute a minimal setting in which such behavior can be systematically analyzed. Despite recent observations of intricate self-synchronization structures in mode-locked lasers-such as subharmonic entrainment, devil's staircases, and holes within Arnold tongues, i.e., regions of unsynchronized dynamics embedded within synchronized domains-their physical origin has remained elusive due to the complexity of laser dynamics. Here, we demonstrate that these phenomena emerge in the universal framework of the LLE. By reducing the problem to this model, we uncover the mechanism responsible for both the devil's staircase and the formation of holes within Arnold tongues. This provides a unified physical picture of synchronization in nonlinear systems, extending beyond optics and providing insight into analogous predictions and observations in fluids and other oscillatory media. In addition, we identify the regimes of high-order synchronization, enabling the generation of ultradense frequency combs, opening new directions for precision photonic applications.
Read the full abstract

All authors Tianhao Xian, Junsong Peng, Sonia Boscolo, Christophe Finot, Heping Zeng

Risk Management

Diversified-Risk-Perception Risk Measures and Portfolio Selection

Traditional risk measures generally rely on a single probability model, potentially overlooking information from alternative models and leading to biased risk assessments. This limitation cannot be addressed by asset diversification alone in risk management. In this paper, we propose a Diversified-Risk-Perception (DRP) risk measure framework that integrates asset diversification and risk model diversification to provide a more comprehensive assessment of market risk while reducing reliance on any single model. First, we introduce a flexible exponential aggregation function to evaluate the risk of a portfolio, which accounts for the contributions of all loss components while placing greater emphasis on large losses. Second, we incorporate multiple risk models in the risk measure and optimize their weights based on their perceptions on the risk assessments. As a specific example, we introduce DRP expected shortfall (DRP-ES), establish its theoretical properties, and derive bounds quantifying its sensitivity to model parameters. Empirical experiments in the U.S., Chinese A-share, and South Korean stock markets show that trading strategies based on the DRP-ES achieve higher Sharpe ratios and lower maximum drawdowns than market benchmarks across different periods. Compared with asset diversification strategies based on individual probability models, the DRP strategy exhibits more stable and robust performance across different markets and periods. These findings suggest that the DRP framework can adapt to changing market conditions and improve the stability and effectiveness of portfolio risk management.
Read the full abstract

Computation and Language

HiddenPathQA: A Benchmark for Knowledge Graph Question Answering When Questions Hide Their Paths

Knowledge graph question answering (KGQA) systems are typically evaluated on questions whose surface tokens lexically expose the gold KG path. Users, however, may ask questions without knowing the underlying schema: "Which condition could Andrew have due to family history?" compresses a 4-hop chain "Andrew –[father]–> parent –[father]–> grandparent –[medical condition]–> disease –[subclass of]–> hereditary disorder" into a single phrase (family history) that names none of those relations. We identify this collapse of path-question alignment as a blind spot in existing KGQA evaluation. Three major LLM-KG paradigms, hop-by-hop exploration, plan-then-retrieve, and similarity-based retrieval, implicitly rely on such lexical cues, an assumption rarely tested in practice. We make three contributions. (i) We introduce HiddenPathQA, a manually verified benchmark of 1,055 questions spanning 2-6 hops and multiple domains, constructed so that question wording does not reveal the gold path's relations. (ii) We propose Holistic Path Selection, which compares questions against candidate relation chains in the local subgraph as complete units, replacing irreversible per-hop relation scoring with globally informed chain-level reasoning. We develop two implementations, TieredHolistic and FlatHolistic. (iii) We conduct a pseudoword stress test that replaces entity names with meaningless placeholders to distinguish KG-grounded reasoning from entity-level memorization. Holistic Path Selection outperforms six strong KGQA baselines (ToG, PoG, FiDeLiS, R2-KG, KAPING, and KARPA) by 8.8-17.9 accuracy points across two LLM backbones and both original and pseudoword settings. Its advantage under pseudoword replacement shows that the gains cannot be explained by entity-level memorization alone.
Read the full abstract

Information Retrieval

Proactive Dimension-Adaptive Denoising for Graph Collaborative Filtering via Representation Coherence

Implicit feedback in recommender systems contains noisy interactions (e.g., accidental clicks, impulse purchases) that propagate through user-item graphs and contaminate learned representations. Existing explicit denoising methods uniformly rely on training loss to estimate interaction reliability. However, loss is a fundamentally passive signal: it detects noise only after it has caused prediction errors, and it is heavily confounded by training stage, negative sampling, and hard positives. We propose Noise-aware Dimension Learning (NDL), a proactive dimension-adaptive denoising framework. NDL introduces Representation Coherence Detection (RCD), which evaluates the coherence between an interaction representation and the user's historical preference centroid in embedding space, providing an active noise signal independent of loss. RCD and the loss signal are fused via activity-aware weighting (active users rely more on coherence while cold-start users automatically fall back to loss), and the fused estimate drives an interaction-level dimension-adaptive mask that limits the effective representation capacity of unreliable interactions. A lightweight contrastive regularizer further improves embedding uniformity, stabilizing the geometry on which RCD discriminates. On three public benchmarks NDL consistently outperforms state-of-the-art denoising methods, lifting Recall@5 by +17.95% on Amazon-book, +12.33% on Yelp, and +5.63% on MovieLens-1M over the strongest baseline DAR; the core variant without contrastive learning already surpasses DAR on sparser datasets, confirming representation coherence as the primary driver of these gains. NDL is confined to the training loop and is serving-compatible with LightGCN-based production pipelines, adding no online latency or parameters at inference time. Code: https://github.com/GordonDongZHAO/NDL
Read the full abstract

All authors Wenjun Li, Dong Zhao, Jiaying Shi, Juan Zhang, Zhaoming Pan, Zhimin Zhang

Cryptography and Security

Ultrasound-Assisted Biometric Watermarking Against Face Video Deepfakes

Currently, artificial intelligence-generated content (AIGC) poses a severe threat to facial video deepfakes, and many AIGC companies employ video watermarking to mitigate unauthorized fake video usage, but its effectiveness is limited due to watermark tampering and private-model forgery. Additionally, some schemes actively add watermarks to user videos. However, current approaches focus primarily on the quality of watermark embedding in offline scenarios, and no existing work offers a solution for protecting human facial videos in real-time online applications. To fill this gap, we propose, to the best of our knowledge, a novel biometric video watermarking method, UltraGuard, for the first time. It uses the smartphone's built-in speaker and microphone to emit ultrasonic signals and capture biometric features, which are then fused with spatio-temporal dynamic features derived from the video content. The fused features are encoded as watermarks and embedded into videos in real time, enabling dynamic, content-aware watermarking throughout transmission and propagation. Extensive experimental validation demonstrates that UltraGuard can effectively defend against malicious attacks such as forgery and editing, both at the source and during propagation, proving the system's efficacy. In the future, it can be deployed on users' mobile devices to provide real-time protection for users' facial videos, thereby preventing security and privacy breaches caused by various malicious attacks.
Read the full abstract

All authors Guodong Liu, Lei Wang, Dongxu Liu, Qianran Qiao, Meng Li, Haipeng Dai, He Huang, Guihai Chen

Differential Geometry

Curvature estimates for shrinking gradient Ricci solitons

Suppose $(M^5,g,f)$ is a complete gradient shrinking Ricci soliton with bounded scalar curvature. We prove that if $\nu(g)>-\log 2$, then its Riemannian curvature is bounded. The proof uses curvature blow-up, a local Ricci estimate, and the splitting given by the rescaled potential. An entropy estimate then allows us to apply the volume-ratio gap theorem for Ricci-flat four-manifolds.
Read the full abstract

All authors Fengjiang Li, Jianyu Ou, Yuanyuan Qu, Guoqiang Wu

Robotics

PAIR: Proprioception-Aligned Image-Ray Representations for Viewpoint-Robust Manipulation

While imitation learning has made substantial progress toward generalizable robot manipulation through scaling, viewpoint robustness remains a major bottleneck. Visuomotor policies rely heavily on visual inputs, yet images provide an inherently ambiguous signal under viewpoint change: similar scenes may appear markedly different across viewpoints, while distinct states may share certain visual overlaps. A policy must therefore infer not only the task-relevant state, but also how it is visually projected under a particular camera configuration. This entanglement of viewpoint-dependent appearance and task-relevant state can make learning inefficient and limit generalization to unseen viewpoints. Recent work has begun to address this challenge through camera-ray conditioning and representation learning using geometric cues to induce invariance. However, providing camera information as additional context does not by itself ground visual representations in how the task scene is visually projected, while geometric alignment without camera context can introduce spurious correspondences by ignoring viewpoint-dependent projection. We propose PAIR, a contrastive learning framework that aligns joint image-ray representations using robot proprioception. PAIR encourages observations with similar robot states to remain close in representation space across viewpoints, providing a structured grounding signal for learning viewpoint-robust features. PAIR is a highly adaptable framework: it can be used to train Diffusion Policy (DP) or post-train vision-language-action (VLA) models. In simulated and real-world manipulation benchmarks with camera variation, PAIR consistently outperforms the behavior cloning baseline without ray conditioning by 12.7% and 26.7% points, respectively, demonstrating stronger generalization to unseen viewpoints. Project website: PAIRrobot.github.io.
Read the full abstract

All authors Sung-Wook Lee, Xuhui Kang, Dylan Losey, Yen-Ling Kuo

Optics

Wide Field 3D Color Topography for Steep-slope Structures

Three-dimensional (3D) topography measurement is essential for industrial inspection and scientific research. However, existing techniques are limited by an inherent trade-off between resolution, speed, color imaging capability and the ability to measure large-angle surfaces. To overcome these limitations, we propose a novel method that integrates ring light illumination based wide-field 3D imaging with an iterative shape-from-focus (SFF) algorithm. The system employs coaxial epi-illumination combined with ring light illumination to simultaneously acquire information from flat regions and steep slopes. The proposed iterative SFF algorithm achieves high-resolution 3D topography measurement. Full-color 3D reconstructions of electronic chips and PCBs demonstrate that the proposed method enables fast scanning and sub-micrometer resolution and significantly extending the measurable inclination range for large-angle structures. This method fills a critical gap in existing technology for fast, natural-color, 3D imaging and measurement of samples with steep topographies.
Read the full abstract

All authors Yuchen Lin, Mengrui Wang, Fan Li, Jingxiang Zhang, Manming Shu, Jiajing Yan, Chang Liu, Tianyu Zhao, Yansheng Liang, Ming Lei

Genomics

Publications as benchmarks: auditing AI agents on spatial transcriptomics alignment

AI agents are increasingly automating data analysis, but responsible adoption requires reliable performance evaluation, which is costly in specialized scientific domains. We introduce a framework that translates scientific publications into auditable benchmarks for AI agents and demonstrate its use on spatial transcriptomics alignment tasks. Across 121 tasks, 16 baseline methods, and six AI agents, the best agents (GPT-6-Astra and Gemini-4-Argon) matched or outperformed all baselines on 80% of tasks, often using surprisingly simple heuristics. Agent performance was robust to prompting and access to pre-installed packages. Benchmark construction also uncovered errors in prior work and shortcuts in current evaluation metrics. Finally, we show that agent-generated solutions can be distilled into a reusable program that ranks in the top 10% of baseline methods on unseen data. Our framework offers a scalable way to evaluate AI agents in specialized scientific domains by leveraging and stress-testing existing papers and metrics.
Read the full abstract

All authors Yiqun T. Chen, Jan Matthias, Jianing Yao, Hongyu Eric Zhao, Stephanie C. Hicks

High Energy Physics (Phenomenology)

Probing the inhomogeneous phases in magnetized quark matter via the bosonic two-point function

We investigate the stability of homogeneous chiral condensates in magnetized quark matter within the two-flavor Nambu-Jona-Lasinio model. By expanding the effective action to quadratic order, we derive the full momentum-dependent bosonic two-point function in a constant magnetic field. At zero temperature, our analytical results show that each occupied Landau level produces a sharp logarithmic divergence at its corresponding Fermi momentum. This severe Peierls instability is driven by one-dimensional Fermi surface nesting within the effectively 1+1-dimensional subsystems created by Landau quantization. Numerically, we map out the momentum-space topography of the two-point function across varying magnetic fields and temperatures. We find that strong magnetic fields induce deep negative canyons. While thermal fluctuations smooth these canyons into shallower valleys as the temperature increases, the negative regions remain robust at intermediate temperatures and only vanish entirely at sufficiently high temperatures. Intriguingly, at larger chemical potentials where the system is strictly stable, a broad positive basin with a flat curvature at the origin persists at non-zero momentum. This non-monotonic dispersion is the hallmark of a moat regime, acting as a precursor state that strongly signals a residual tendency toward inhomogeneous chiral symmetry breaking. Our findings provide valuable insights into the phase structure of dense, magnetized quark matter.
Read the full abstract

All authors Kang Deng, Bo Feng, Tianle Wei, Shuai Yuan

Computation and Language

ChemInsight: A Comprehensive Benchmark for Evaluating and Diagnosing Chemistry Understanding and Reasoning in Large Language Models

We introduce ChemInsight, a benchmark designed to evaluate large language models (LLMs) on chemistry tasks that require multi-step reasoning and structured chemical understanding. We propose a two-dimensional scoring system (scope and depth) to assess both task coverage and reasoning completeness. ChemInsight consists of 203 challenging chemistry questions organized into 50 bundles, which support the two-dimensional scoring evaluation scheme. We evaluate ten representative LLMs using ChemInsight and observe consistently low performance across models, with scope scores below 30% and depth scores below 11%, substantially lower than human expert performance. We then proceed to ask (1) What factor limits the advancement of current LLMs in chemistry? (2) To what extent are statistically driven language-model training methods effective at modeling chemistry symbolic language such as SMILES? And (3) Can LLM performance in chemistry be improved through intensive training on large, domain-specific corpora?
Read the full abstract

All authors Changyu Hu, Yiming Zou, Xin Tang, Yiru Pan, Zicheng Huang, Deng Zhao, Qing Cui, Zhenduo Zhang, Wang Ren, Xiao Li

Computer Vision

Benchmarking CNNs, Vision Transformers, and Foundation Models for Explainable Brain Tumor MRI Classification: Calibration, Decision Analysis, and External Validation

Deep learning models for brain tumor MRI classification are usually compared by accuracy alone, on public datasets whose independence is rarely checked. We benchmarked six architectures: two convolutional networks (EfficientNetV2-M and ConvNeXt-V2-Tiny), two vision transformers (Swin-V2-S and ViT-L/16), and two foundation models (DINOv2-L and MedSigLIP-448), for four-class classification of 7,216 public MRI images. We assessed accuracy, calibration, explainability, ensembles, and decision curves, with every fitted quantity estimated on validation data only. Pixel-verified duplicate screening showed that 36% of the test images had a near-duplicate in the training data. Test accuracy ranged from 94.5% to 95.6%, with no pairwise difference after Holm correction, and fell to 90.3% to 91.7% on the 773 test images free of duplicates and shared patients. Ensembles did not outperform the best single model. Attribution maps passed a model-randomization test but localized expert-annotated tumors poorly. On 1,675 external BDNeuro-MRI images that did not duplicate the training data, accuracy ranged from 77.6% (MedSigLIP-448) to 95.0% (ViT-L/16), and 12 of 15 pairwise differences were significant. Internal accuracy on this public collection therefore did not distinguish the architectures, whereas the duplicate-filtered external test did.
Read the full abstract

Machine Learning

APO2CS: Advantage-Aware Preference Optimization for Two-Level Constructive Search in Combinatorial Optimization

Preference optimization has emerged as a promising alternative to reward-based training for neural combinatorial optimization. However, existing methods typically rely on binary pairwise labels, which discard the magnitude of solution-quality differences and provide supervision only at the complete-solution level. We propose Advantage-aware Preference Optimization for Two-level Constructive Search (APO2CS), a preference-based training objective for constructive neural solvers that integrates both macro-level and micro-level supervision. At the macro level, APO2CS enriches pairwise preferences with an advantage term derived from objective-value differences. At the micro level, it compares partial trajectories, thereby providing denser supervision throughout the sequential construction process. The resulting objective can be used either to train a policy from scratch or to fine-tune a pretrained one. Experimental results show that APO2CS improves the expressiveness and search capability of preference learning for combinatorial optimization, while demonstrating strong effectiveness and adaptability across multiple combinatorial optimization tasks.
Read the full abstract

All authors Kaixi Yang, Linbo Qiao, Wei Shang, Yanqi Shi, Dongsheng Li

Systems and Control

MAC+: Mobility-Aware Co-Expansion Planning for Distribution Grid and Electric Vehicle Charging Infrastructure

We study the least-cost co-expansion of power distribution networks and public charging ports to accommodate the growth of electric vehicles (EVs). Our approach, MAC+, exploits the flexibility of charging along each EV's itinerary and coordinates it across the fleet to reduce the peak violations of each feeder's hosting capacity and port capacity. This coordination is an extremely large, spatio-temporally coupled optimization problem with binary plug-in variables. We solve it by iterated price response (IPR), which repeatedly posts a two-tier tariff on feeder load and port occupancy, lets millions of EVs best-respond in parallel, and certifies the optimality gap at every iteration. We develop a custom exact dynamic-programming algorithm that solves each EV's best-response problem, a mixed-integer quadratic program, about 20 times faster than off-the-shelf solvers. The case study covers the San Francisco Bay Area at 30% EV adoption, with 1.8 million EVs on week-long itineraries and 1,303 feeder service regions, each with a utility-published hosting capacity and a port capacity set by its existing public ports. On this instance, IPR reaches a certified gap below 10% in a few hours. MAC+ saves about $15 billion of the upgrade investment that unmanaged charging would require. It also needs over 90% less investment than charging that is fully coordinated but flexible only within each session, and over 80% less than charging that is flexible along the itinerary but uncoordinated.
Read the full abstract

All authors Yi Ju, Lunlong Li, Jingchun Wang, Scott Moura

Computer Vision

FMA-Net: Flexible Modality Adaptation for Robust Multimodal Face Presentation Attack Detection

Multimodal face presentation attack detection (fPAD) improves robustness using complementary RGB, depth, and infrared (IR) cues, but deployment remains challenging when modalities are unavailable or incomplete. Existing flexible-modality methods mainly use zero-filling or modality omission, potentially discarding cross-modal information and introducing modality-dependent bias. We propose the Flexible Modality Adaptation Network (FMA-Net), a unified framework that compensates for missing modalities through instruction-guided latent-space translation. The Face Modality Instruct Translator (FMIT) estimates target modality observations from RGB inputs, while context-aware category enhancement uses learnable text prompts as modality-invariant semantic anchors. A Facial Feature Adapter (F2A) integrates global facial structure and local spoof-relevant cues to enhance discriminative representations. Synthetic-to-Real Face Domain Alignment (SR-FDA) reduces feature discrepancies between translated and real modalities, with benefits depending on the missing-modality pattern and data domain. Experiments on WMCA and PADISI-Face validate the framework. On WMCA with a 70% modality missing ratio, FMA-Net achieves a mean ACER of 3.22% across four intra-domain missing-modality protocols, compared with 4.24% for the strongest baseline by the same criterion. When both depth and IR are entirely unavailable, it achieves 5.23% ACER, compared with 5.99% for the best competing result. Cross-domain experiments also reveal limitations of synthetic-to-real alignment under dataset shifts. These results support FMA-Net as a practical approach to fPAD with flexible and incomplete modalities.
Read the full abstract

All authors Yuhao Gao, Yichen Shi, Zitong Yu, Hongyang Wang, Hongrui Li, Ruixin Zhang, Shouhong Ding, Jun Feng

Robotics

HolidayFactory 1.0: Simulating, Generating, and Evaluating Industrial Robot Tasks

Robots are typically evaluated in episodes that begin from a reset, while industrial work consists of repeated jobs whose outcomes affect subsequent operations. Evaluating such work at scale requires simulation of task-critical physical interactions, construction of industrial environments, and measurements of performance as scene state persists. We present HOLIDAYFACTORY 1.0, a framework for simulating, generating, and evaluating industrial robot work. Given a human-specified workplace and task, the framework defines a world pairing a scenario of scene variants and process logic with an evaluation defining a job, metrics, and a rubric. HOLIDAYFACTORY 1.0 comprises three components. HOLIDAY-SIM extends Newton's SDF-based hydroelastic contact with additional constitutive laws and a semi-implicit primal-dual solver, couples stateful actuator dynamics to articulated motion, and derives tactile and joint observations from simulated states. Agentic world construction generates simulation-ready assets and scene variants using geometric and interaction checks, and proposes task-conditioned evaluations for human confirmation and executable checks. 24/7-BENCH introduces seven industrial tasks in which jobs are evaluated without resetting the scene, measuring completed, failed, and unfinished jobs, throughput, latency, and motor energy. Controlled studies characterize the proposed contact, actuator, and tactile models and examine the effectiveness of verification-guided world construction. Experiments on scene and evaluation generation further reveal the limitations of model critics and the difficulty of ensuring that generated evaluations faithfully capture task requirements. We examine job-level evaluations with scripted trajectories (e.g., code-as-policy) but have not yet compared policies over persistent runs.
Read the full abstract

All authors Holiday Robotics: Jeongmin Lee, Taehyeon Kim, Dohyun Jang, Minji Lee, Seonghun Oh, Dongwoo Park, Geonhyup Lee, Jaehyung Kim, Jaemin Yoon, Jinseop Bok, Jungwoo Kim, Minseok Yang, Philsik Chang, Soomin Lee

Analysis of PDEs

On the sharp weak-type inequality for Riesz transforms

We prove that the weak-type $(1,1)$ norm of each classical Riesz transform $R_j$, $j=1,\dots,n$, on real-valued inputs on $\R^n$ and $\T^n$ is $\KD$. The constant $\KD=\pi^2/(8\Gcat)$, where $\Gcat$ is Catalan's constant, was obtained by Davis \cite{Davis1974} for the Hilbert transform on $\R$ and the conjugate-function operator on the circle $\T$. The Burkholder–Bellman function argument also applies to coordinate Riesz transforms of product generators. If $-L$ generates a symmetric sub-Markov semigroup on a nonzero standard $\sigma$-finite measure space $Y$, then $-\partial_x(-\partial_x^2+L)^{-1/2}$ has the same exact norm on both $\mathbb R\times Y$ and $\mathbb T\times Y$. The derivative acts in the ordinary line or circle factor, while $L$ governs the independent transverse variables. An explicit integral inequality strengthens the weak-type estimate and bounds the truncated second moment of the transform. The general theorem applies to Gaussian, Dunkl, Laguerre, Jacobi, Schrödinger, and Laplace–Beltrami transverse generators, finite reversible chains, and subordinated semigroups.
Read the full abstract

Numerical Analysis

Structure-Informed Electromagnetic Feedback Control of the Vlasov-Maxwell System with Delayed Observations

Feedback control of kinetic plasma instabilities is challenging because observing the full phase-space distribution is costly, while sensing and actuation inevitably introduce delay. We develop a structure-informed electromagnetic feedback framework for the Vlasov-Maxwell system that uses only macroscopic observations to control the full kinetic distribution. We first show that magnetic actuation alone does not directly regulate radial velocity moments, motivating the use of combined electric and magnetic controls. A nonlinear perturbation estimate yields an instantaneous cancellation-dissipation feedback law. To account for delayed observations, we then use Maxwell's equations to identify the macroscopic quantities governing the resulting cancellation errors, namely currents and spatial field gradients. These quantities serve as inputs to a low-rank neural operator that learns a residual correction to the delayed cancellation baseline. Thus, while the feedback depends only on low-dimensional macroscopic observables, the control objective remains the stabilization of the full distribution toward a prescribed kinetic equilibrium. Numerical experiments for two-stream and Weibel-type instabilities demonstrate effective long-time stabilization under substantial feedback delays.
Read the full abstract

Machine Learning

Payoff-Aware Prediction of Population Game Dynamics

Population game dynamics describe how aggregate behavior evolves in response to payoff signals. In many applications, the payoff function may change, and the goal is to predict the population trajectory induced by a new payoff design before trajectory data under that design are available. We study this problem as $\textbf{payoff-aware prediction of population game dynamics}$. Standard dynamics learning methods fit the motion observed under training payoffs, but do not separate the payoff-dependent incentive from the payoff-independent response structure needed for prediction under new payoffs. Building on the existing framework of Riemannian game dynamics, we propose PA-RmD, a payoff-aware learning method that keeps payoff information explicit and learns the payoff-independent response structure from data. Theoretically, we show that the learned model preserves fixed-payoff Nash equilibria and derive finite-time one-step prediction bounds under shared-response and payoff-coverage conditions. Empirically, we evaluate PA-RmD on synthetic zero-sum and potential games, as well as a YouTube Trending multi-country dataset, showing that our method performs well under changing payoff designs.
Read the full abstract

All authors Kang Wang, Xiao Wang, Bo Li, Renzhe Xu

Statistics Theory

On the robustness of locally D-optimal designs under parameter uncertainty in single-factor generalized linear models

Local and Bayesian approaches to optimal experimental design specify information about the regression parameters through a nominal value and a prior distribution, respectively. A practical question is whether accounting for parameter uncertainty justifies replacing a locally optimal design. We investigate when locally D-optimal designs remain Bayesian D-optimal in single-factor Poisson, gamma and logistic regression on the unit interval. Analytical arguments and numerical comparisons under normal and uniform slope priors examine how prior form and dispersion affect the optimal support and the Bayesian D-efficiency of retaining a local design.
Read the full abstract

Optics

Three-dimensional polarization of thermal fields at arbitrary distances from thin-film emitters

Recent advances have shown that thermal radiation can exhibit strong polarization in both the near and far fields. However, most existing studies focus on paraxial far-field emission, where polarization can be described using conventional two-dimensional (2D) Stokes parameters. Non-paraxial thermal radiation, with three nonzero vector components, requires a fully three-dimensional (3D) polarization description. This work develops a generalized theoretical method for analyzing thermal-radiation polarization at arbitrary distances from an emitter. Fluctuation-dissipation theory is employed to determine the $3\times3$ coherence matrix of the thermally emitted electromagnetic field, from which generalized 3D Stokes parameters are obtained. This method is applied to planar slabs composed of isotropic, anisotropic, and nonreciprocal materials. The results reveal distinct polarization behavior across the near- and far-field regimes. Near-field polarization is strongly influenced by evanescent waves and polariton dispersion, whereas far-field polarization is primarily governed by polarization-dependent radiative properties, including differences between transverse-electric (TE) and transverse-magnetic (TM) emission. Slab thickness further modifies polarization by controlling supported modes and interference effects. In addition, circular polarization, which vanishes in reciprocal slabs, is observed in n-type doped InAs under an external magnetic field that breaks reciprocity. This work provides a unified framework for characterizing the polarization of thermal electromagnetic fields from the extreme near field to the far field.
Read the full abstract

General Economics

Fairness Drift: Assessing Algorithmic Fairness in a Moving Market

Flexible models and richer data can reduce systematic valuation errors and improve fairness. Yet algorithmic values stay fixed between updates while the market moves, so a new algorithm gains most against an intact distortion and least where uneven appreciation has eroded or just reversed it. We study property assessment, which sets tax bills and has long over-assessed cheaper homes. Cook County replaced township regressions and manual adjustments with a gradient-boosted model and richer data on its triennial cycle: Chicago in 2021, northern suburbs in 2022, southern in 2023. We estimate difference-in-differences in how the assessment-to-price ratio varies with sale price and neighborhood minority share. In Chicago, the reform halved the relative over-assessment of cheaper homes and, among equally priced homes, weakened the link to neighborhood racial composition. In the suburbs the price gradient was unchanged: the North's legacy values were already accurate, and the South's cheap neighborhoods had appreciated faster under frozen values, correcting part of the distortion, then stalled in the reassessment year, leaving the new values too high where prices had gained and accuracy unimproved. Fairness thus drifts with the market between updates, and single-deployment evaluations may credit or blame the algorithm for what the market did.
Read the full abstract

Artificial Intelligence

CABrain: A Correlation-Aware Brain Foundation Model for EEG Decoding

Electroencephalography (EEG) foundation models have emerged as promising paradigms for decoding brain activity through large-scale self-supervised pretraining. Notably, most existing approaches employ masked patch reconstruction, in which randomly selected EEG patches are masked and recovered by the network. However, purely random masking may limit representation learning as informative patches from highly correlated channels often remain unmasked, causing the network to underutilize weakly correlated channels or serial dependencies. Furthermore, because these models are typically based on transformer architectures, their performance is influenced by the choice of positional encoding. Although positional encoding has been extensively explored in natural language processing and computer vision, few studies have adapted it to the unique characteristics of EEG signals. To address these limitations, this study introduces a conditional positional encoding method based on graph convolutional networks (GCNs) to explicitly model inter-channel correlations, along with an adaptive masking strategy that enhances representation learning by modulating the difficulty of masked patch reconstruction. To the best of our knowledge, this is the first study to integrate graph-based representations into conditional positional encoding and introduce adaptive masking within EEG foundation model pretraining. Experimental results on ten benchmark datasets demonstrate that the proposed GCN-based positional encoding and adaptive masking strategies, both individually and in combination, achieve state-of-the-art or competitive performance, highlighting their effectiveness in EEG foundation modeling.
Read the full abstract