Peer Revenue Publish or profit

Papers

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

All of arXiv

Saturday 5 September

Computer Vision

Test-Time Weak-to-Strong Alignment: Transferring Implicit Rewards from Weak to Strong Flow Models

Aligning a text-to-image generation flow model with a reward makes it follow objectives that the training data alone does not provide. Alignment fine-tuning delivers this by reinforcement learning (RL) or preference optimization, but it must be repeated for every checkpoint and returns a model fixed at the reward and strength it was trained with. Test-time alignment instead steers a frozen model during sampling, allowing task-specific and sample-specific guidance. Existing methods obtain this only by drawing the per-step signal from the reward function itself, through its gradient, or through a separately trained value function. We propose changing the supervision source: let a pair of weak models, not a reward function, supply the supervision. A source aligned model, kept together with its base as a source alignment pair, stores its training reward as an implicit, step-wise, KL-anchored signal expressed in the sampler's own coordinates. We explore whether this model-form supervision can cross scale, and show that it does: our method, AlignGraft, aligns a larger, frozen, never-tuned model by adding the pair's velocity difference during sampling. The transport is exact under a shared noising kernel and needs neither the reward nor its gradient at test time. The method has no schedules, only a single scalar that controls the alignment strength and can extrapolate it beyond that of the source alignment pair. Across image and video flow models (Stable Diffusion 3.5, FLUX, and Wan), the transfer lifts the frozen large model on preference, compositional, and text-rendering rewards, can exceed the source aligned model itself, and preserves the large model's fidelity at a small constant sampling overhead. Extensive experiments show that one alignment run on a weak model produces supervision that the whole model family can reuse at test time.
Read the full abstract

Fluid Dynamics

Phase Reduction Analysis of Transonic Buffet

This paper develops a phase-reduced description of transonic buffet, treating buffet as a stable autonomous fluid limit cycle that is weakly perturbed by harmonic structural motion. When combined with aerodynamic work, the phase reduction model yields closed-form expressions for the equivalent aerodynamic damping and stiffness, together with a unified description of phase locking, phase slipping and aeroelastic stability of the fluid-structural system. The resulting analysis provides new insight into the mechanisms governing aeroelastic instability in oscillatory flows, including aerodynamic damping maps, singular behaviour at zero detuning, and broad regions of subcritical aeroelastic instability.
Read the full abstract

Machine Learning

On-the-go Forgetting without Explicit Unlearning via ERASE

Existing unlearning approaches typically rely on post hoc weight adaptation or distillation, leading to duplicated memory costs, degraded generalization, and limited scalability. In this work, we introduce ERASE, Erasure via Reconstructive Adversarial Signal Editing, a framework for on-the-go forgetting that suppresses the observable influence of private data without modifying model weights. ERASE leverages structured, class-conditioned input perturbations to induce selective forgetting during inference, eliminating the need for retraining, fine-tuning, or model copies. We rigorously characterize sufficient conditions when ERASE provably achieves functional forgetting of designated subclasses while preserving predictions across other subclasses within the same superclass. This analysis offers a principled foundation for inference-time forgetting under mild regularity assumptions. Across diverse architectures and benchmark datasets, ERASE maintains the best observed balance between forgetting efficacy, computational efficiency, and retention fidelity over recent unlearning-based methods. By reimagining data removal as forgetting without unlearning, our work establishes a scalable, regulation-aligned pathway for continual, privacy-conscious learning.
Read the full abstract

Differential Geometry

A Cheng-Yau type estimate for positive biharmonic functions

We establish a Cheng-Yau type estimate for positive biharmonic functions on complete Riemannian manifolds with Ricci curvature satisfies $Ric_g \ge -(n-1)K g$. If $u$ is a positive biharmonic function in $B_{2R}(p)$, then $$ -\frac{\Delta_g u}{u} +\frac{1}{8n}\frac{|\nabla u|_g^2}{u^2} \le C_n\left(R^{-2}+K\right) \quad\text{on }B_R(p). $$ Further, if the Ricci curvature is nonnegative, every global positive biharmonic function satisfies $\Delta_g u\equiv c$ and the sharp estimate $|\nabla u|_g^2\le2cu$ for some nonnegative constant $c$. We also show that every positive $k$-polyharmonic function has nonnegative constant $(k-1)$-st Laplacian and growth of order at most $2k-2$.
Read the full abstract

Category Theory

Cartan calculus of cubical forms in tangent categories

We construct the Cartan calculus of differential cubical forms on an object $X$ of a cartesian tangent category with a scalar multiplication by a commutative ring object $R$. We prove that the differential cubical forms are naturally equipped with the structure of a commutative differential graded algebra. Then we show that, if $R$ has no $2$-torsion, this CDGA together with the Lie algebra of vector fields and the inner derivatives constitutes a Cartan calculus, which lies between the initial Cartan calculus of algebraic Kaehler forms and the terminal one of Lie-Rinehart forms. We give a number of examples, including affine schemes and elastic diffeological spaces, and show that we recover the established notions of differential forms in all cases.
Read the full abstract

Robotics

Observation Design for Certified Control Authority: Projection–Estimability Separation and Active-Face Equivalence

A sound runtime admission gate executes only actions it can certify, and certifies only what its observations support. This paper asks how observations should be designed to maximize the set of actions that can be safely admitted, and shows the question is not a re-vocabulary of classical design problems. First, a projection–estimability separation: decomposing a constraint normal as $c=c_{\mathrm{Range}}+c_{\ker}$ relative to an information matrix, two-point discrimination along $c$ becomes arbitrarily reliable as the budget grows whenever $c_{\mathrm{Range}}\neq 0$, while robust admission of an action with normal $c$ is impossible at every budget whenever $c_{\ker}\neq 0$; such mixed directions are generic at any deficient rank, and at full rank the decoupling is bounded by the Kantorovich ratio and diverges with the condition number. Discrimination-optimal designs, being corner solutions of a linear criterion, land in exactly this regime. Second, an active-face equivalence theorem: the permissiveness-optimal design is $L$-optimal for a target matrix generated endogenously by the action faces that become certification bottlenecks, weighted inversely by their remaining slack; single-face collapse recovers $c$-optimal and goal-oriented design exactly, and a Caratheodory argument yields a bottleneck certificate of at most $r(r+1)/2+1$ faces. Around these we assemble exact certifiability per convex contract mode, for which $\kappa\approx 3.29$ is derived rather than calibrated, the $\sqrt{r}$ price of contract-agnostic design, an information-to-slack transfer theorem with a curvature-budget corollary, and a two-part audit in which a design meeting every margin requirement still leaves an action face at a certification cost above ten times its testing cost, in every probe library tested.
Read the full abstract

All authors Guangxi Wan, Hualong Du, Yuqi Liu, Qingwei Dong, Qingxin Li, Hongfei Bai, Peng Zeng

Number Theory

A $q$-microscope for mock-theta denominator patterns

We give a systematic creative-microscoping treatment of truncated basic hypergeometric sums attached to three classical third-order mock theta denominator patterns, represented by $\phi(q)$, $\omega(q)$, and $\nu(q)$. The main conceptual point is that these denominator patterns naturally admit exact finite theta evaluations at $a=q^{\pm n}$, microscopic $q$-supercongruences, and cyclotomic/$p$-adic consequences within a single framework. For \[ S(q,a):=\sum_{n\ge 0}\frac{q^{2n+1}(aq,q/a;q^2)_n}{(-q^2;q^2)_n}, \] we prove, for odd $n$, a finite theta evaluation at $a=q^{\pm n}$, equivalently a microscopic $q$-supercongruence. We prove an analogous finite theta evaluation for the $\nu$-type denominator \[ N_m(q,a):=\sum_{j=0}^{m} q^{2j+1}\frac{(aq,q/a;q^2)_j}{(-q;q^2)_{j+1}}. \] We then introduce the one-parameter denominator family \[ \T(q;b):=\sum_{n\ge 0} q^{2n}\frac{(q;q^2)_n^2}{(q^2;q^2)_n(b;q^2)_n}, \] whose specializations include the $\omega$-type shifted denominator ($b=q^3$) and the two-color family ($b=q^{2k}$). For its truncated $a$-extension we obtain an exact evaluation at $a=q^{\pm n}$, deduce microscopic congruences modulo $(a-q^n)(1-aq^n)$, and derive cyclotomic consequences, including zero congruences in the $q^{2k}$-subfamily and nontrivial $p$-adic versions for the cases $b=q$ and $b=q^3$.
Read the full abstract

Hardware Architecture

GPU-Accelerated Gate-Level Time-Based Power Analysis via Event-Density-Aware Partitioning and Kernel Fusion

Power analysis is crucial in modern chip design flow. Particularly, time-based power analysis can provide fine-grained power consumption information to facilitate the diagnosis of power issues and guide power optimization accordingly. However, it may take tens of hours to conduct time-based power analysis on modern large-scale circuits, which greatly slows down the power optimization flow. In this paper, we present the first GPU-accelerated gate-level time-based power analysis framework. We propose a novel data structure to enable efficient state-dependent power retrieval. To accommodate the imbalanced event distribution across gates, we propose an event-density-aware partitioning strategy that allocates GPU threads based on gate event density. Finally, we fuse the power computation into a single kernel invocation to reduce redundant work in separate kernels. Experimental results show that our proposed framework achieves high accuracy while delivering up to 37.63x end-to-end speedup compared to multi-threaded Synopsys PrimeTime PX.
Read the full abstract

All authors Weihao Wang, Yikang Ouyang, Hongyuan Liu, Yuzhe Ma

Computer Vision

FineHOI: Part-Aware Dense Representations for Zero-Shot Human-Object Interaction Detection

Human-Object Interaction (HOI) detection aims to localize humans and objects in images and classify their interactions. Zero-shot HOI focuses on recognizing interactions that are not observed during training, requiring models to generalize beyond seen verb-object compositions. Recent approaches leverage Vision-Language Models (VLMs), benefiting from rich semantic representations. However, they often rely on global or detector-centric features that compress interaction cues and hinder fine-grained spatial reasoning. To overcome this limitation, we propose FineHOI, a zero-shot HOI framework that explicitly models interactions from dense patch-level features. Our approach is motivated by the observation that human-object interactions are defined by localized spatial relationships, which are not preserved by global and detector-centric representations. To this end, we introduce an Adaptive Part-Level Attention module that decomposes humans and objects into semantically coherent parts via unsupervised clustering, and re-weights them based on their interaction relevance. These representations are then integrated through a Region-Aware Interaction Transformer that integrates part-aware and global features and produces the final HOI embedding. Extensive experiments demonstrate that FineHOI consistently outperforms existing zero-shot HOI methods, achieving particularly strong gains on unseen interactions. Code is available at https://github.com/francescotonini/fine-hoi.
Read the full abstract

All authors Francesco Tonini, Lorenzo Vaquero, Mohammad Mahdi Derakhshani, Cees Snoek, Elisa Ricci, Cigdem Beyan

Differential Geometry

Single Lie Brackets on Closed Manifolds

We prove that every smooth vector field on a closed smooth manifold is a single Lie bracket. The proof combines a relative transport construction on the complement of a ball with an exact extension across transverse graph disks. For the local extension, we first arrange that an auxiliary bracket is transverse to the disks, straighten it by its flow, and then remove the resulting scalar discrepancy. The argument applies without an orientability assumption. It also implies that every smooth fiberwise linear function on the cotangent bundle is a Poisson bracket of two such functions.
Read the full abstract

Quantum Physics

Reducing quantum and classical resources for quantum-centric supercomputing workloads on near-term hardware

Sample-based Krylov quantum diagonalization (SKQD) is a paradigmatic example of a quantum-centric supercomputing workflow that combines the convergence structure of Krylov quantum diagonalization with classical sampling-based post-processing. It provides convergence guarantees assuming that the important computational-basis configurations can be sampled from a set of Krylov states with sufficient probability. We analyze this assumption under depolarizing noise, deriving shot-count resource estimates that expose an exponential depth penalty, and perform experiments on current noisy hardware with the one-dimensional single-impurity Anderson model on a 20-site (40-qubit) instance. Device noise breaks the practical convergence predicted by the noiseless SKQD analysis, but approximate compilation techniques can compress the Krylov time-evolution circuits before execution. The compressed circuits accumulate less hardware noise, recover the expected energy convergence, and reduce both the quantum shot budget and the classical subspace dimension, remaining beneficial even when classical configuration recovery is applied.
Read the full abstract

All authors Maxence Grandadam, Vladyslav Bohun, Dikshant Dulal, Maciej Koch-Janusz

Computer Vision

STP-BENCH: A Unified Systematic Benchmark for Virtual Spatial Transcriptomics from Histopathology Images

Spatial transcriptomics (ST) provides unprecedented insights into tumor heterogeneity by capturing spatially resolved gene expression, yet its high experimental cost hinders large-scale adoption. Consequently, computational approaches that predict spatial gene expression directly from hematoxylin and eosin slides, termed virtual ST, have rapidly emerged. Despite this progress, assessing advances in the field remains difficult due to insufficient benchmarking: prior studies rely on small, heterogeneous datasets, inconsistent training and inference pipelines, and limited evaluation of biological interpretability and model robustness. To address these gaps, we present STP-BENCH, a standardized benchmark for virtual ST models. STP-BENCH comprises six cancer types spanning two ST platforms (Visium and Xenium), with each training dataset containing more than 30,000 spots and at least 15 slides to ensure statistical reliability. We evaluate 21 predictive approaches, re-implemented with a unified pathology foundation model as the morphological encoder when architecturally applicable. Beyond conventional benchmarks that report average predictive accuracy on highly variable genes, we systematically examine which genes and gene sets are recoverable from histomorphology. We further evaluate the downstream biological utility of predicted profiles through cell-type deconvolution and spatial domain identification, and assess model reliability under domain shifts and data scaling. Notably, unified morphological encoding substantially re-orders model rankings established in prior studies, indicating that architectural innovations and image encoding have been conflated in previous evaluations. We publicly release STP-BENCH to support reproducibility and serve as a community benchmark at https://github.com/NEXGEM/STP-Bench.
Read the full abstract

All authors Youngmin Chung, Ji Hun Ha, Andrew H. Song, Cristina Almagro-Pérez, Chaeyoung Seo, Won Jun Suh, Jeong Won Beom, Kyoung Bin Oh, Eytan Ruppin, Faisal Mahmood, Joo Sang Lee

Machine Learning

LoGIC: Budgeted Context Construction for Node-Level Graph In-Context Learning with Tabular Foundation Models

Tabular foundation models have become powerful graph learners. Systems such as G2T-FM and GraphPFN encode each node as a feature row and make predictions through in-context learning (ICL), with labeled rows serving as the prompt. Current protocols employ the complete training table as context, causing attention to scale quadratically with the labeled pool and introducing preprocessing and memory bottlenecks. We investigate context construction for node-level graph ICL: which labeled nodes and auxiliary unlabeled nodes should constitute the prompt for specified queries. We formulate this allocation in terms of two resources: a labeled-context budget for predictive evidence and an unlabeled-halo budget for adapter message passing without using label capacity. We present LoGIC, which retrieves labeled nodes via structural, feature-based, and coverage channels, shares each context across the queries in a graph-local cluster, incorporates an unlabeled halo for adapter backbones, and chooses the channel and context budget without test labels. Across three backbone configurations drawn from two model families on GraphLand, budgeted contexts maintain locally runnable full-context performance, stay competitive with published large-dataset results, and markedly lower peak memory requirements compared with full-context and whole-graph inference. They further permit frozen graph ICL on million-node graphs without retraining. Our analysis identifies when retrieval channels work best and connects their behavior with graph properties.
Read the full abstract

All authors Mingqi Yang, Zidong Guo, Jihui Yang, Wenming Zuo

Optimization and Control

Race, Exchange, Improve: Finding high-quality MIP solutions quickly

Mixed-integer programming (MIP) is a cornerstone in applied optimization, both in industry and academia. Recently, there has been increased attention to finding strong primal solutions quickly. This is reflected, for example, in the development of the NVIDIA cuOpt solver and, most recently, in the new MIPFEAS benchmark, which has a tight time limit of 600 seconds and evaluates solvers based on how quickly they find high-quality primal solutions. This article introduces a MIP portfolio parallelization scheme, focusing on efficiently exchanging information between its workers. We present two implementations of this scheme: one built directly into the open-source MIP solver SCIP, and an external one, which we call ReXi. ReXi is currently the fastest non-commercial solver in the MIPFEAS benchmark, followed by the SCIP-integrated implementation. Moreover, we present new versions of both implementations that considerably outperform their predecessors on the MIPFEAS benchmark.
Read the full abstract

Computer Vision

ProtoRAG: Prototype-Based Retrieval Augmentation for Few-Shot Fine-Grained Remote Sensing Object Detection

Few-shot fine-grained object detection (FGOD) in remote sensing imagery is challenging because limited annotations must support both object localization and discrimination among visually similar subcategories. Although multimodal large language models (MLLMs) provide strong coarse object localization, they lack explicit visual evidence for reliable fine-grained recognition. To address this limitation, we propose ProtoRAG, a prototype-based retrieval-augmented framework that decouples coarse localization from fine-grained recognition by equipping MLLMs with an external object-level visual memory. To construct a reliable visual memory from limited support samples, we introduce Discriminative Prototype Space Learning (DPSL), which encourages discriminative and prototype-stable representations through supervised contrastive learning and prototype-consistency regularization. We further develop an uncertainty-guided candidate-constrained reasoning strategy that augments MLLMs with retrieved candidate-specific visual references and invokes multimodal reasoning only for ambiguous instances. Extensive experiments show that ProtoRAG consistently surpasses representative baselines in nine few-shot settings, outperforming the strongest baselines by 14.80, 2.27, and 4.04 mAP$_{50}$ on MAR20, HRSC2016, and FAIR1M-2.0, respectively.
Read the full abstract

All authors Jian Wang, Yuxiang Hong, Chufeng Zhou, Chao Pang, Xiaokang Zhang

Machine Learning

QGB-W$k$NN: Quantum Granular-Ball Learning for Robust Classification

Nearest-neighbor classification is widely used in machine learning, yet existing methods often suffer from low computational efficiency and limited robustness in noisy environments. To jointly address these challenges, this paper proposes an efficient and reliable weighted $K$-nearest neighbor classification framework based on quantum granular balls, termed QGB-W$k$NN. The proposed framework improves computational efficiency by integrating quantum-enhanced granular-ball representation with hierarchical nearest-neighbor search, while enhancing classification reliability through a purity-aware weighted decision mechanism. Specifically, quantum-kernel granular balls are constructed to reduce retrieval redundancy and strengthen nonlinear feature representation under limited quantum resources. A granular-ball purity-guided HNSW optimization strategy is developed to exploit structural reliability for hierarchical graph construction during neighbor retrieval, alleviating the local optimality issue caused by conventional random layering. Finally, a weighted voting mechanism jointly incorporating granular-ball similarity and purity is introduced to produce more reliable classification decisions in noisy environments. Extensive experiments on benchmark datasets demonstrate that QGB-W$k$NN achieves competitive classification accuracy while exhibiting favorable Pareto trade-offs between classification performance and computational cost. Moreover, the proposed framework consistently improves robustness under various noisy conditions, suggesting that reliability-aware quantum granular-ball learning provides a promising paradigm for efficient and robust nearest-neighbor classification.
Read the full abstract

All authors Suzhen Yuan, Dehang Chen, Lifeng Shen, Shuyin Xia, Jeremiah D.Deng

Classical Analysis and ODEs

Regular closed gradient ranges and asymptotic gradient values

We prove that the gradient range of every nonzero compactly supported $C^1$ function on $\mathbb{R}^n$ is the closure of its interior, for every $n\geq1$. More generally, for an arbitrary $C^1$ function, the closure of its gradient range is the union of the closure of the range's interior and the set of asymptotic gradient values. We also prove that compact smooth Lagrangian submanifolds without boundary in $\mathbb{R}^{2n}$ and their images under symplectic homeomorphisms have regular closed momentum projections.
Read the full abstract

Number Theory

On the class number of certain cyclotomic fields

We construct four infinite families of cyclotomic fields and show that each member of these families has class number a multiple of 3. In fact, we show that the class number of the corresponding maximal real subfields has class number divisible by 3. A construction by Kishi and Miyake [11] and a result of Yamaguchi [13] help us achieve this target. Finally, we produce computational evidence corroborating our results.
Read the full abstract

Computation and Language

The Blindness of Document-Level Translation Evaluation

Document-level machine translation (MT) evaluation extends segment-level protocols by presenting full documents to annotators, on the assumption that such presentation elicits document-level judgments. We test this assumption with a counterfactual condition (MIX) in which each document combines segments drawn from different systems, preserving document-level presentation while breaking cross-segment consistency. Across 18,420 expert Englis-to-Korean annotations and 14 automatic metrics, scores, system rankings, and error annotations are statistically equivalent between coherent and incoherent documents. Perception does not explain this: shown matched passages, raters identify the coherent one as the work of a single translator in 87.3% of trials. Document presentation does change how annotators work, but that change does not reach the recorded output. What is blind is the protocol, not the annotator. The concern is not that scores fall short, but that the resources invested in document-level systems, metrics, and annotation may not be measuring what they are intended to measure.
Read the full abstract

All authors Ahrii Kim, Vilém Zouhar, Chanjun Park, Seong-heum Kim

Analysis of PDEs

Global Dynamic Patterns of Entropy Solutions for One-dimensional Pressureless Euler System

In this paper, we are concerned with the fine properties of entropy solutions of the Cauchy problem for the one-dimensional pressureless Euler system, wherein the initial density $\rho_0$ is a locally finite Radon measure and the initial velocity $u_0\in L^\infty_{\rho_0}$. We employ the solution formula introduced by [F.M. Huang and Z. Wang, Comm. Math. Phys. 222(1) (2001), 117–146.] for this Cauchy problem to analyze the entropy solutions and obtain various new fine properties of entropy solutions; these can be summarized in four aspects: (i) Characteristics and initial waves for the Cauchy problem; (ii) Fine local structures of entropy solutions; (iii) Divides and global structures of entropy solutions; (iv) Invariants and asymptotic behaviors of entropy solutions including the asymptotic profile and the corresponding decay rates. Through these results (i)-(iv), we establish the global dynamic patterns of entropy solutions of the Cauchy problem for the $1$-D pressureless Euler system with general initial data $\rho_0$ being locally finite Radon measures and $u_0\in L^\infty_{\rho_0}$.
Read the full abstract

All authors Gaowei Cao, Kai Hu, Feimin Huang, Guirong Tang

Artificial Intelligence

Beyond Final Decisions: A Process-Centric Benchmark for Transparent AI-Assisted Peer Review

Peer review is central to quality control in science. However, existing evaluations of AI-assisted peer review mainly focus on the overall quality of generated reviews or the accuracy of final decisions. They therefore provide limited evidence about whether model decisions are supported by sufficient and reliable review evidence. We introduce a process-centric diagnostic benchmark for AI-assisted peer review. It uses (x,$z_s$,$z_c$,$z_r$,y) to represent the paper content, summary, critique, suggestion, and decision. We convert heterogeneous review records from PeerRead, NLPeer ARR-22, and OpenReview-ICLR into process-aligned data. Our benchmark uses direct decision prediction from the paper content (Direct) as its baseline. It compares the decision value of Gold-process variables and Predicted-process variables, and conducts stage-level evaluation, chain-consistency evaluation, and interventional sensitivity analysis. Experiments across three datasets and six models show that Gold-process variables generally have higher decision value. For the main analysis model, the Gold–Predicted gap remains stable across datasets and random seeds. This gap is also reproduced in most model–dataset combinations. Although model-generated intermediate review texts show relatively high local consistency across adjacent stages, the final decisions are not consistently supported by the preceding review evidence. Our benchmark targets AI systems designed to assist rather than replace human reviewers. It provides a transparent and auditable diagnostic tool for evaluating the reliability of their review processes.
Read the full abstract

All authors Siming Yuan, Xueyi Zhang, Wangze Ni, Tianfang Xiao, Shimin Di, Jia Zhu, Zhuoren Jiang, Rong Tan, Lei Chen, Kui Ren

Machine Learning

Interpretable and Fair Generalized Additive Neural Networks via Multi-objective Learning

Interpretability and fairness are two of the most emphasized dimensions in trustworthy artificial intelligence (AI). Various explainable AI methods have been introduced to improve interpretability. This paper focuses on neural network (NN)-based generalized additive models (GAMs), a class of self-interpretable models. While most existing research has prioritized improving the accuracy of NN-based GAMs, their interpretability remains largely underexplored. To address this gap, this paper introduces explicit quantitative metrics for evaluating the interpretability of NN-based GAMs, empirically examines their effectiveness, and explores strategies for improving interpretability within these models. In addition, the simultaneous and explicit optimization of both interpretability and fairness, along with their trade-offs and the underlying reasons, remains underexplored. To address this, we propose a multi-objective neural basis model (MONBM) framework based on multi-objective evolutionary learning to consider accuracy, interpretability, and fairness simultaneously. A partial retraining strategy is further developed to facilitate the practical application of evolutionary multi-objective optimization to deep model architectures. Based on MONBM, this paper reveals the complex relationships between these dimensions and the reasons behind these intricate relationships. This analysis demonstrates how multi-objective optimization can be combined with self-interpretable models to reveal relationships among trustworthiness objectives. In addition, MONBM obtains a set of models with different trade-offs between dimensions, and the competitiveness of the approach is validated by comparing it with state-of-the-art methods.
Read the full abstract

All authors Ziming Wang, Changwu Huang, Ke Tang, Yew-Soon Ong, Xin Yao

Commutative Algebra

Comparisons between ordinary and symbolic powers of edge ideals with respect to regularity and depth

In this paper, we investigate the difference between ordinary and symbolic powers of edge ideals on the Castelnuovo-Mumford regularity and the depth. As a main theorem, we prove that the regularities of ordinary and symbolic powers coincide for edge ideals of simplicial graphs, as a partial result of Minh's conjecture. For the depth, we first show that, for each $k\geq2$, the inequality $\operatorname{depth} S/I^{(k)}\geq\operatorname{depth} S/I^{k}$ does not hold for squarefree monomial ideals in general. On the other hand, we prove that it holds for edge ideals when $k=2,3$. We also study the symbolic-ordinary discrepancy module $I(G)^{(k)}/I(G)^{k}$ of the edge ideal $I(G)$ of a graph $G$ and give a graph-theoretic formula for its Krull dimension in terms of induced odd cycles of $G$, thereby answering a question and a problem posed by Ha and Minh.
Read the full abstract

Databases

sheval: An RDF data shapes evaluation tool and test-suite for recursive shapes

Two different languages have been developed to validate RDF data based on the concept of a shape: ShEx and SHACL. In each language it is possible to define a shape that refers to itself, which is called a recursive shape. While in the case of ShEx, the semantics of recursive shapes is well defined and is part of the specification, in the case of SHACL, the semantics of recursive shapes is left to the implementation of the different SHACL engines. Consequently, the different SHACL engines show different behaviours when confronted with recursive shapes. In this paper we present sheval: an evaluation framework consisting of a tool and a test suite that can be used to compare the behaviour of different shapes technologies when confronted with recursive definitions. The tool has been used to evaluate and understand the differences in the implementation of recursive shapes in ShEx and SHACL. It provides a framework for testing and comparing the behaviour of different shape engines, helping to identify inconsistencies and potential issues, and providing a basis for further research and development in the field of shape-based validation of RDF data.
Read the full abstract

All authors Shqiponja Ahmetaj, Iovka Boneva, Jan Hidders, Maxime Jakubowski, Jose-Emilio Labra-Gayo, Wim Martens, Filip Murlak, Cem Okulmus, Ognjen Savković, Mantas Šimkus, Dominik Tomaszuk

Analysis of PDEs

Nonlinear profiles on solutions to the surface quasi-geostrophic equation

The quasi-geostrophic equation is well known as a model for predicting potential temperature around low-pressure systems in high-latitude regions. When diffusion effects are added to this equation, it serves as a model for potential temperature at the sea surface. In either case, the nonlinear term represents the effect of the Coriolis force. This paper yields nonlinear profile in solutions to the surface quasi-geostrophic equation. This profile is determined uniquely from the perspective of large-time behavior of solutions. Components of solutions are arranged sequentially from slow to fast decay based on the parabolic scale. Then such an expansion is determined uniquely. Since the equation is subcritical in the context of large-time effects, the main components exhibit linear features. Nonlinear characteristics appear in components that have a smaller effect on solutions. From the perspective of the correlation between spacetime variables, nonlinear profiles exhibit characteristics that are distinctly different from those of linear profiles. Moreover, the nonlinear effects of this equation are expected to be weaker than those of other equations with the same scale due to their spatial structure. The main theorem publishes minute, but unique rotational flow arising from the Coriolis force.
Read the full abstract

Algebraic Geometry

Relative Geometric Invariant Theory: Reductive and Non-reductive

We construct good quotients for equivariant actions of group homomorphisms on morphisms of schemes. Using Geometric Invariant Theory, we obtain explicit open semistable loci in the source with Hilbert-Mumford descriptions admitting good quotients relative to a given good quotient of the target. In particular, we obtain quotients for reductive groups acting on projective-over-affine morphism. In the non-reductive case, we consider equivariant actions on affine morphisms which are 'graded' by a multiplicative group and satisfy certain unipotent stabiliser assumptions. This recovers known results in projective non-reductive GIT as a special case, which also proves the Hilbert-Mumford criterion in that setting. As applications, we consider moduli of unstable objects, representations of quivers with multiplicities and jets.
Read the full abstract

Robotics

Moment-Matching Probabilistic Data Association for Optimization-Based SLAM

Optimization-based simultaneous localization and mapping (SLAM) makes it possible to reduce accumulated navigation errors of sensing platforms by returning to known areas (loop closure). In this paper, we present an approach to combine probabilistic data association (PDA) with optimization-based SLAM. Instead of associating a single measurement with each landmark, we follow the PDA paradigm from the multiobject tracking community. In particular, in a processing stage performed in addition to the nonlinear least-squares solver of optimization-based SLAM, our method (i) assigns multiple measurements to landmarks probabilistically, (ii) computes the mean and covariance of landmark distributions via moment matching by taking multiple measurement-to-landmark associations into account, and (iii) establishes a virtual landmark measurement and a corresponding linear-Gaussian measurement model that leads to the mean and covariance matrix as moment-matching PDA in (ii). By converting the PDA update step into an equivalent linear-Gaussian measurement update step, PDA can be performed effectively within any optimization-based SLAM method. Our preliminary numerical evaluation in a scenario with false negatives and false positives indicates that incremental smoothing and mapping 2 (iSAM2), combined with the proposed PDA approach, can improve agent localization performance compared to conventional iSAM2.
Read the full abstract

Functional Analysis

On Besov and Triebel-Lizorkin spaces associated with the Grushin operator

In this article, we define classical and non-classical Besov and Triebel–Lizorkin spaces associated with the Grushin operator with or without drift. We establish various characterisations of these spaces, and study their complex interpolation, embedding properties, and fractional Leibniz rules.
Read the full abstract

Numerical Analysis

A structure-preserving implicit-explicit method for a hyperbolic approximation of fourth-order PDEs

We introduce a novel structure-preserving numerical method for a first-order hyperbolic approximation system, which approximates the solutions of general fourth-order partial differential equations. By employing an implicit-explicit (IMEX) splitting between the stiff and non-stiff terms, we rigorously prove that the proposed scheme is energy-consistent and positivity-preserving under a CFL-type condition. Furthermore, we show that the method remains robustly stable in asymptotic regimes, with a time-step restriction that is entirely independent of the relaxation parameters. Finally, we present a series of numerical examples for thin film equations to validate the theoretical properties and efficacy of the scheme.
Read the full abstract