Searcharxiv⌕ Search

arXiv subjects

Jiakai Li

Publications and source records attributed to Jiakai Li.

At least 19 recordsLinked to original sources

Real monopole Floer homology and the Alexander polynomial

We prove that the Euler characteristic of the framed real monopole Floer homology of the double branched cover of a link is given by the Alexander polynomial evaluated at $\sqrt{-1}$. For knots $K$ with determinant one, this formula shows that Miyazawa's degree invariant of $K$ can be computed in terms of the Alexander polynomial of $K$. The proof involves a new connected-sum formula and oriented skein exact triangles for some new variants of real monopole Floer homology, called the diagonal and cone real monopole Floer homology, which admit mod-two gradings. This is the monopole counterpart of Srivastava's Euler characteristic formula in real Heegaard Floer homology.

math.GT↗

Absolute mod-two gradings on framed real monopole Floer homology

We construct absolute mod-two gradings on framed real monopole Floer homology, for real 3-manifolds such that the image of the fixed point set in the quotient is nullhomologous. This allows us to fix the sign of Miyazawa's degree invariant. Our construction uses a mod-two index-theoretic correction term, the Arf invariant.

math.GT↗

Don't Worry About Quality: Robust Multi-Hop Retrieval despite Issues in Knowledge Graphs

Graph Retrieval-Augmented Generation (GraphRAG) has made substantial progress in multi-hop reasoning, but typically assumes that constructed knowledge graphs (KGs) provide sufficient structural support. In practice, cost and computing constraints often leave constructed KGs imperfect, raising the key challenge of achieving robust multi-hop retrieval. To address this challenge, we empirically analyze KG extraction across builders and find similar error patterns despite differences in error proportions, motivating a retrieval strategy targeted at these shared errors. We further summarize these patterns into two issue modes, spurious noise and incomplete information, which induce retrieval drift and retrieval hallucination by misleading evidence selection and weakening evidential support, respectively. Based on this, we propose CS-RAG, a robust GraphRAG framework that mitigates the impact of imperfect KGs during retrieval. CS-RAG first plans each query as an ordered sequence of executable atomic constraints and performs fine-grained anchor- and relation-aware retrieval to constrain evidence acquisition around the intended hop semantics. It then applies a sufficiency check to decide whether retrieved entities should serve as anchors for subsequent retrieval hops and activates textual recovery for unresolved constraints, thereby reducing hallucinated structural continuation. Experiments on three multi-hop QA benchmarks show that CS-RAG is less sensitive to builder choice and remains stable under controlled KG issue injection. Code is available at https://github.com/myz12138/CS-RAG.

cs.IR↗

SpecGuard: Detecting Multi-Turn LLM Jailbreaks via Specification-Based Runtime Monitoring

Multi-turn jailbreaks turn dialogue safety into a trace property: a violation may become identifiable only when user intent and assistant behavior are considered across multiple turns. Existing guard models largely classify individual messages or exchanges and return risk scores or labels, without executable safety semantics or a formally checkable decision trail. We present SpecGuard, a training-free, specification-driven framework for monitoring multi-turn LLM interactions. SpecGuard uses a fixed atomic-proposition contract to map natural-language observations into causally scoped, evidence-backed facts, and expresses forbidden interaction patterns as Linear Temporal Logic specifications. Each specification is compiled into a symbolic finite automaton that incrementally consumes the resulting dialogue trace. The same monitoring mechanism supports buffered runtime checking and retrospective auditing, while accepting runs produce replayable witnesses that identify the triggered specification, supporting facts, and relevant dialogue turns. Experiments on multi-turn safety benchmarks show that SpecGuard consistently outperforms representative open-source guard models while maintaining controlled false-positive rates. These results demonstrate a practical path from heuristic risk classification toward formally specified, verifiable, and auditable LLM safety monitoring, without learned detector parameters or access to the protected model.

cs.CR↗

Multi-framed real monopole Floer theory

This paper constructs a framed real monopole Floer homology for three-manifolds with involutions, marked with multiple basepoints. The relative gradings of these Floer homologies depend on the framing information and the paper gives a sufficient condition for the existence of relative mod two gradings. Assuming orientability and choices of orientations, this paper also proposes a definition of $\mathbf{Z}$-valued framed real Seiberg--Witten invariants for 4-manifolds with involutions, marked with circles.

math.GT↗

DeferKV: Rethinking Eviction Timing for One-Shot KV Cache Compression

Long-context large language models (LLMs) have demonstrated strong capabilities across a wide range of tasks, but the growing KV cache introduces substantial memory and inference overhead. Existing one-shot KV cache compression methods typically commit to irreversible eviction immediately after prefill, before any signal from actual generation becomes available. Our quantitative analysis shows that early queries from the actual generation stage provide attention signals that are more consistent with subsequent decode attention, with the largest single-step gain occurring at the prefill-decode boundary. Based on this observation, we propose DeferKV, which moves the eviction decision from the end of prefill to the first real decoding step and temporally combines prompt-side and decode-side observations, thereby better aligning KV importance estimation with subsequent generation requirements. DeferKV requires no additional training, draft model, or future-query prediction module, making it simple and easy to deploy. Experiments on LongBench, RULER, and Needle-in-a-Haystack demonstrate that DeferKV consistently improves model performance under KV cache compression while maintaining low inference latency.

cs.CL↗

Band Structure Modulation in Ternary-Based InAs/ AlAs1-xSbx /InAs1-xSbx Superlattices

This study demonstrates an overall view of recent quantum mechanical based modeling effort using empirical tight-binding method to expand the ability of calculation of electronic band structure for strained-layer superlattices composed of ternary InAs/InAs1-xSbx and InAs/InAs1-xSbx/AlAs1-xSbx materials. Using a modified sp3s* empirical tight-binding method and building the superlattice Hamiltonian, we demonstrate that combining the virtual crystal approximation with a bowing parameter for the s-on-site energy accurately predicts ternary superlattice behavior. We provide a comprehensive overview of our numerical simulations, which model diverse superlattice configurations ranging from long wavelength infrared range to wide-bandgap barrier architectures. Notably, the simulated energy levels strongly agree with experimental bandgap measurements of the ternary superlattices and their structural variants.

cond-mat.mtrl-sci↗

Control Synthesis against LTL Specifications with Long-Run Visit Proportion Objectives

This paper investigates the path-planning problem for systems required to satisfy a linear temporal logic (LTL) specification while achieving a desired long-run visit proportion. For a path represented in prefix-suffix structure, the long-run visit proportion quantifies the asymptotic occurrence proportion of an atomic proposition (AP) sequence of interest in the suffix trace. Such a quantitative requirement generally cannot be expressed by standard LTL specifications. Furthermore, we develop a planning approach that synthesizes an LTL-satisfying path whose long-run visit proportion remains within a prescribed tolerance of a desired value while satisfying an overall cost constraint. By adjusting the desired proportion, the synthesized path can allocate more or less long-run attention to the atomic proposition sequence of interest, thereby improving the flexibility and efficiency of the task execution. Finally, experiments on a quadruped robot demonstrate the practical significance of the proposed long-run visit proportion and the effectiveness of the proposed planning approach.

eess.SY↗

Existential Opacity for Discrete-Event Systems with State Observations

Opacity is a fundamental system property for confidentiality in discrete-event systems (DES). Classical opacity is typically defined under event-based observations, requiring that any secret system behavior remains indistinguishable from some non-secret behavior to an external intruder. However, in many applications such as path planning or opacity-preserving tasks, the intruder observes system states rather than events. Moreover, it often suffices that the system exhibits secret behaviors that can be exploited for opacity-preserving task execution, but such a system property cannot be fully captured by existing notions of state-observation-based opacity. Motivated by this limitation, we propose a relaxed notion of existing state-observation-based opacity, called existential opacity (EO), which only requires the existence of secret behaviors (instead of all secret behaviors) that are indistinguishable from a non-secret behavior under the state observations of the intruder. We show that the notion of EO is more expressive than existing state-observation-based opacity notions. In addition, a class of EO properties together with their corresponding verification approaches are developed, enabling the analysis of existential opacity in discrete-event systems and providing a new criterion for determining the feasibility of opacity-preserving problems.

eess.SY↗

Stop When Further Reasoning Won't Help: Attention-State Adaptive Generation in Reasoning Models

By incorporating test-time compute scaling, large reasoning models (LRMs) can solve complex problems through explicit chain-of-thought (CoT) reasoning processes. However, they often suffer from overthinking, resulting in redundant token outputs and degraded accuracy. Current methods to mitigate this issue remain limited: training-based approaches require substantial computational resources, while training-free methods rely on well-crafted prompts or unreliable confidence signals. In this work, we investigate early stopping from the perspective of attention distributions and propose a simple method, ASAG, which infers the model's reasoning state and adaptively adjusts the generation strategy. The proposed framework is training-free and plug-and-play, enabling seamless integration into existing LRMs. Extensive experiments on nine benchmarks demonstrate consistent improvements across mainstream LRMs with varying parameter scales, including the DeepSeek-R1-Distill and Qwen3 series. Specifically, ASAG improves average accuracy by 3.2% while reducing the number of generated tokens by nearly 40% across all reasoning tasks on Qwen3-8B.

cs.CL↗

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework

Converting high-level tasks described by natural language into formal specifications like Linear Temporal Logic (LTL) is a key step towards providing formal safety guarantees over cyber-physical systems (CPS). While the compliance of the formal specifications themselves against the safety restrictions imposed on CPS is crucial for ensuring safety, most existing works only focus on translation consistency between natural languages and formal specifications. In this paper, we introduce AutoSafeLTL, a self-supervised framework that utilizes large language models (LLMs) to automate the generation of LTL specifications complying with a set of safety restrictions while preserving their logical consistency and semantic accuracy. As a key insight, our framework integrates Language Inclusion check with an automated counterexample-guided modification mechanism to ensure the safety-compliance of the resulting LTL specifications. In particular, we develop 1) an LLM-as-an-Aligner, which performs atomic proposition matching between generated LTL specifications and safety restrictions to enforce semantic alignment; and 2) an LLM-as-a-Critic, which automates LTL specification refinement by interpreting counterexamples derived from Language Inclusion checks. Experimental results demonstrate that our architecture effectively guarantees safety-compliance for the generated LTL specifications, achieving a 0% violation rate against imposed safety restrictions. This shows the potential of our work in synergizing AI and formal verification techniques, enhancing safety-aware specification generation and automatic verification for both AI and critical CPS applications.

cs.LO↗

Rethinking LLM-Driven Heuristic Design: Generating Efficient and Specialized Solvers via Dynamics-Aware Optimization

Large Language Models (LLMs) have advanced the field of Combinatorial Optimization through automated heuristic generation. Instead of relying on manual design, this LLM-Driven Heuristic Design (LHD) process leverages LLMs to iteratively generate and refine solvers to achieve high performance. However, existing LHD frameworks face two critical limitations: (1) Endpoint-only evaluation, which ranks solvers solely by final gap to a reference solution, ignoring the convergence process and runtime efficiency; (2) High adaptation costs, where distribution shifts necessitate re-adaptation to generate specialized solvers for heterogeneous instance groups. To address these issues, we propose Dynamics-Aware Solver Heuristics (DASH), a framework that co-optimizes solver search mechanisms and runtime schedules guided by a convergence-aware metric, thereby identifying efficient and high-performance solvers. Furthermore, to mitigate expensive re-adaptation, DASH incorporates Profiled Library Retrieval (PLR), which maintains group-specialized solvers for profile-aware warm starts. These solvers are archived concurrently during evolution, allowing DASH to reuse matched specialists across heterogeneous distributions without restarting adaptation. Experiments on four combinatorial optimization problems demonstrate that DASH improves runtime efficiency by over 4 times while outperforming prior LHD baselines in the overall balance between gap and runtime across diverse problem scales. Furthermore, by enabling profile-aware warm starts, DASH maintains lower gap under distribution shift while reducing LLM adaptation costs by about 90%.

cs.LG↗

DSAS: A Universal Plug-and-Play Framework for Attention Optimization in Multi-Document Question Answering

While large language models (LLMs) show considerable promise across various fields, they have notable limitations in handling multi-document question answering (Multi-doc QA) tasks. The first challenge is long-range dependency modeling, where LLMs struggle to focus on key information in long texts, which weakens important semantic connections. Second, most LLMs suffer from the ''lost-in-the-middle'' issue, where they have difficulty processing information in the middle of long inputs. Current solutions either truncate global dependencies or demand costly finetuning, ultimately lacking a universal and simple solution for these challenges. To resolve these limitations, we propose Dual-Stage Adaptive Sharpening (DSAS) containing two modules. (i) The Contextual Gate Weighting (CGW) module alleviates ''lost-in-the-middle'' by assessing paragraph relevance through layer-wise attention tracking and position-aware weighting. (ii) The Reciprocal Attention Suppression (RAS) module enhances focus on critical paragraphs by suppressing information exchange between key and irrelevant texts, thus mitigating the limitations in long-range dependency modeling. Notably, DSAS functions as a plug-and-play solution requiring no architectural modifications or extra training parameters. Extensive experiments on four benchmarks demonstrate DSAS's efficacy across mainstream LLMs (Llama, Qwen, Mistral, and Deepseek), with an average F1-score improvement of 4.2% in Multi-doc QA tasks on Llama-3.1-8B-Instruct and Qwen2.5-14B-Instruct. Ablation studies confirm the essential contributions of both the CGW and RAS modules. In addition, detailed discussions in the Appendix further validate the robustness and scalability of DSAS.

cs.CL↗

Quantum Mechanical Approach for Modeling of Ternary Based Strained-Layer Superlattice

Ternary-based InAs/InAs1-xSbx Strained-Layer Superlattice (SLS)material with type-II band alignment belongs to the 6.1 A family with reasonably small lattice mismatch with GaSb substrate for epitaxial growth. InAs/InAs1-xSbx SLS have been proven to have more advantages such as longer carrier lifetime, better control on growth and manufacturability, and being considered as an alternative material system for infrared photodetectors. In this article a quantum mechanical based modelling on electronic band structure of InAs/InAs1-xSbx is presented. A modified sp3s* empirical tight binding method along with implementing a virtual crystal approximation with a bowing of the s-on-site tight-binding energy, were incorporated. In this approach, a theoretical explanation of atomic segregation in superlattices is suggested and used in calculations. The simulations show good agreement with experimentally measured band gap of InAs/InAs1-xSbx superlattices.

cond-mat.mtrl-sci↗

Monopole Invariants for Webs and Foams

We develop a package of monopole Floer-theoretic invariants for webs and foams using real Seiberg-Witten theory with orbifold singularities, based on Kronheimer and Mrowka's framework of monopole Floer homology.

math.GT↗

Real monopoles and a spectral sequence from Khovanov homology

Given a based link $(K,p)$, we define a "tilde"-version $\tilde{HMR}(K,p)$ of real monopole Floer homology and prove an unoriented skein exact triangle. We show the Euler characteristic of $\tilde{HMR}(K,p)$ is equal to Miyazawa's invariant $|deg(K)|$ arXiv:2312.02041 and examine some examples. Further, we construct a spectral sequence over $\mathbb{F}_2$ abutting to $\tilde{HMR}(K,p)$, whose $E_2$ page is the reduced Khovanov homology $Khr(\overline{K})$ of the mirror link $\overline{K}$.

math.GT↗

Monopole Floer Homology and Real Structures

We define a "real" version of Kronheimer-Mrowka's monopole Floer homology for a 3-manifold equipped with an involution. As a special case, we obtain invariants for links via their double branched covers. The new input is the notion of a real spin-c structure, which consists of a spin-c structure along with a compatible anti-linear involution on the spinor bundle.

math.GT↗