arXiv preprints from January 1, 2026 through September 25, 2026 — 05:24:40 EST
Machine unlearning has become a crucial role in enabling generative models trained on large datasets to remove sensitive, private, or copyright-protected data. However, existing machine unlearning methods face three challenges in learning to forget identity of generative models: 1) inefficient, where identity erasure requires...
Agents built on vision-language models increasingly face tasks that demand anticipating future states rather than relying on short-horizon reasoning. Generative world models offer a promising remedy: agents could use them as external simulators to foresee outcomes before acting. This paper empirically examines whether current agents...
Ensuring the functional safety of Autonomous Vehicles (AVs) requires motion planning modules that not only operate within strict real-time constraints but also maintain controllability in case of system faults. Existing safeguarding concepts, such as Online Verification (OV), provide safety layers that detect infeasible planning...
Session-based recommendation aims to predict the next item that anonymous users may be interested in, based on their current session interactions. Recent studies have demonstrated that retrieving neighbor sessions to augment the current session can effectively alleviate the data sparsity issue and improve recommendation performance....
Uranium digermanide UGe$_2$, the first ferromagnetic superconductor, represents a key composition in the U-Ge system dominated by U-5$f$ states. To examine the impact of controlled stoichiometric deviations on the electronic structure, UGe$_{2\pm x}$ thin films ($0 \le x \le 1$) were prepared by triode sputtering and studied on...
We present the first comprehensive spectroscopic and deep photometric study of the globular cluster (GC) candidate Patchick~126. The spectroscopic analysis is based on high-resolution near-infrared data obtained with the IGRINS spectrograph, while the photometric analysis relies on HST observations from the Hubble Missing Globular...
The classical Mazur-Ulam theorem establishes that every surjective isometry between normed real vector spaces is an affine transformation. In various applied mathematical settings, however, one encounters maps that preserve distances not pointwise, but almost everywhere with respect to a probability measure. This paper provides a...
In this paper, we introduce a novel pipeline for predicting chemotherapy response in pediatric brain tumors that are not amenable to complete surgical resection, using pre-treatment magnetic resonance imaging combined with clinical information. Our method integrates a state-of-the-art pediatric brain tumor segmentation framework with...
Bigraph reactive systems offer a powerful and flexible mathematical framework for modelling both spatial and non-spatial relationships between agents, with practical applications in domains such as smart technologies, networks, sensor systems, and biology. While bigraphs theoretically support the identification of bisimilar agents, by...
We present an approach to implement binary search trees in the rule-based graph programming language GP 2. Our implementation uses GP 2's rooted graph transformation rules to be fast and supports insertion, deletion and query operations. We argue that the worst-case runtime for each of the operations is O(n) for a tree with n nodes....
We present a novel work-in-progress approach to the parsing of hypergraphs generated by context-free hyperedge replacement grammars. This method is based on a new LR parsing technique for positional grammars, which is also under active development. Central to our approach is a reduction from hyperedge replacement to positional...
Group Relative Policy Optimization (GRPO) has emerged as a popular algorithm for reinforcement learning with large language models (LLMs). However, upon analyzing its clipping mechanism, we argue that it is suboptimal in certain scenarios. With appropriate modifications, GRPO can be significantly enhanced to improve both flexibility...
Gurumuhkani et al. (CCC'24) introduced the local enumeration problem $Enum(k, t)$ as follows: for a natural number $k$ and a parameter $t$, given an $n$-variate $k$-CNF with no satisfying assignment with Hamming weight less than $t(n)$, enumerate all satisfying assignments of Hamming weight exactly $t(n)$. They showed that efficient...
Existing GPU-sharing techniques, including spatial and temporal sharing, aim to improve utilization but face challenges in simultaneously ensuring SLO adherence and maximizing efficiency due to the lack of fine-grained task scheduling on closed-source GPUs. This paper presents Hummingbird, an SLO-oriented GPU scheduling system that...
We report a room-temperature diode-pumped solid-state laser by water immersion cooling, which delivers a pulse energy of 11 J at the repetition rate of 100 Hz and the pulse duration of 7 ns, while the beam quality factor is 2.6 times the diffraction limit. To the best of our knowledge, this represents the highest performance achieved...
We consider energy-efficient multi-user hybrid downlink beamforming (BF) and power allocation under imperfect channel state information (CSI) and probabilistic outage constraints. In this domain, classical optimization methods resort to computationally costly conic optimization problems. Meanwhile, generic deep network (DN)...
Aligning text-to-video diffusion models with human preferences is crucial for generating high-quality videos. Existing Direct Preference Otimization (DPO) methods rely on multi-sample ranking and task-specific critic models, which is inefficient and often yields ambiguous global supervision. To address these limitations, we propose...
Portfolio diversification is a cornerstone of modern finance, while risk aversion is central to decision theory; both concepts are long-standing and foundational. We investigate their connections by studying how different forms of diversification correspond to notions of risk aversion. We focus on the classical distinctions between...
Nested case-control (NCC) studies are a widely adopted design in epidemiology to investigate exposure-disease relationships. This paper examines weighted analyses in NCC studies, focusing on two prominent weighting methods: Kaplan-Meier (KM) weights and Generalized Additive Model (GAM) weights. We consider three target estimands:...
Reliable operation of wind turbines requires frequent inspections, as even minor surface damages can degrade aerodynamic performance, reduce energy output, and accelerate blade wear. Central to automating these inspections is the accurate segmentation of turbine blades from visual data. This task is traditionally addressed through...
We prove the AKSZ theorem for shifted Poisson structures: if $X$ is an $n$-shifted Poisson derived stack, and $Y$ a $d$-oriented derived stack, then the mapping stack \[\underline{\mathrm{Map}}(Y,X)\] is naturally endowed with an $(n-d)$-shifted Poisson structure. For this, we prove that the data of an $n$-shifted Poisson structure on...
We employ molecular dynamics simulations and quantum rate theories to elucidate the complex condensed-phase dynamics underpinning triplet-state formation in organic photosensitizers. Using models informed by first-principles calculations complete with a molecular representation of solvents of different polarities, we elucidate the...
Improvements in return forecast accuracy do not always lead to proportional improvements in portfolio decision quality, especially under realistic trading frictions and constraints. This paper adopts the Smart Predict--then--Optimize (SPO) paradigm for portfolio optimization in real markets, which explicitly aligns the learning...
Generalist Vision-Language-Action models remain constrained by the scarcity of robotic data relative to the abundance of human video demonstrations. Existing Latent Action Models attempt to use video data but often suffer from visual entanglement, encoding noise rather than manipulation skills. To address this limitation, we propose...
We exhibit an explicit family $\mathcal{B}$ of $30$ subsets (``blocks'') of size $6$ of $[60]=\{1,2,\dots,60\}$ with the following property: for every $6$-subset $S\subset[60]$, there exists a block $B\in\mathcal{B}$ such that $|S\cap B|\ge 2$. The construction is fully explicit and the proof is purely combinatorial.