Search arXiv⌕ Search

arXiv subjects

Hao Lin

Publications and source records attributed to Hao Lin.

At least 37 records · Page 2Linked to original sources

Memory Layer: Train the In-Model Cache for Recommendation Models

Early ranking stages in recommendation systems precompute item embeddings and cache them in-model for scoring within strict latency constraints. Because this cache exists only at serving time, outside the training loop, training and serving use different item representations, a structural discrepancy that limits quality and adds operational fragility. We show that co-designing the training and serving paths removes this representation discrepancy at its source. We introduce the memory layer, an in-model key-value embedding cache co-trained with the model: the item tower writes embeddings during training and the model reads them at serving, one source of truth for item representations by construction. Always-on embeddings cover items not yet cached, so every item receives a prediction, and the design consolidates three separate trainer-to-predictor update paths into a single self-contained pipeline. Deployed in production on Instagram Reels, the memory layer raises prediction coverage from 96% to 100%, improves embedding freshness from $O(5\text{ min})$ to $O(20\text{ s})$, and narrows the training-serving Normalized Entropy (NE) gap by up to 86%, yielding over $2\times$ recall for the freshest content and a 5-6% cold start engagement lift. Because embeddings are produced during training, the system needs no separate bulk-evaluation or publish-time recomputation, cutting training-and-publish computational cost by 30% at neutral serving computational cost.

cs.IR↗

Sharp Diagonal Thresholds for Tight Hamilton Cycles in Uniformly Dense $3$-Graphs

A $3$-uniform hypergraph (or $3$-graph) $H$ on $n$ vertices is \emph{$(n,d,μ)$-dense} if $e_H(X,Y,Z)\ge d|X||Y||Z|-μn^3$ for all $X,Y,Z\subseteq V(H)$. This is one of the weakest standard notions of quasirandomness for $3$-graphs and is also known as linear quasirandomness. In this paper, we determine the sharp diagonal thresholds for tight Hamilton cycles in $(n,d,μ)$-dense $3$-graphs $H$ under conditions on the minimum vertex degree $δ_1(H)$ and the minimum codegree $δ_2(H)$. We actually prove a general result: define \[ f(d):=\frac{1-\sqrt{(4d-1)/3}}2. \] We prove that $(n,d,μ)$-density together with $δ_1(H)\geα\binom{n-1}{2}$ forces a tight Hamilton cycle whenever $d > 1/3$ and $α>f(d)$. In particular, $f(1/3)=1/3$, which answers Problem~8.3(i) of Araújo, Piga and Schacht and confirms Conjecture~8.1 of Han, Shu and Wang. For the minimum codegree condition, the sharp diagonal threshold is $(κ,κ)$, where $κ$ is the unique real solution of $κ=(1-κ)^3$. Since $κ\approx0.3177>1/4$, this gives a negative answer to Problem~8.3(ii) of Araújo, Piga and Schacht and disproves Conjecture~8.2 of Han, Shu and Wang. The two proofs use a common Hamilton-framework reduction, but the two degree conditions lead to distinct dominant-component lemmas for $(n, d, μ)$-dense $3$-graphs, which are of independent interest and whose proofs do not rely on the absorption method.

math.CO↗

HAPS-enabled Downlink Coverage Enhancement in Islands and Maritime Areas

Non-terrestrial networks (NTNs) are poised to play a critical role in next-generation mobile communications, offering enhanced flexibility, improved line-of-sight (LoS) conditions, and overcoming the limitations of terrestrial networks (TNs). Among NTN platforms, high altitude platform stations (HAPSs) have emerged as a promising solution to provide Internet connectivity to underserved regions, including rural areas, islands, and maritime zones, where traditional infrastructure deployment is costly and challenging to deploy. In this paper, we investigate the feasibility of large-scale HAPS deployment to connect island and maritime users, considering real-world shadowing effects on part of HAPSs caused by the presence of island building clusters. We first analyze the coverage performance of onshore (island) and offshore (remote sea) users, in which the channels between HAPSs and the user follow the shadowed Rician distributions and Rician distributions, respectively. Next, we introduce an evaluation method for nearshore users in a hybrid channel environment with HAPSs, and propose approximations that can reduce computational complexity. Based on the simulation results, we discuss how the distance from the island boundary (i.e. the relative remoteness of maritime users) affects coverage performance under different HAPS densities. We also emphasize the importance of choosing a balanced HAPS density or an advanced HAPS deployment scheme.

cs.NI↗

WoVR: World Models as Reliable Simulators for Post-Training VLA Policies with RL

Reinforcement learning (RL) promises to unlock capabilities beyond imitation learning for Vision--Language--Action (VLA) models, but its requirement for massive real-world interaction prevents direct deployment on physical robots. Recent work attempts to use learned world models as simulators for policy optimization, yet closed-loop imagined rollouts inevitably suffer from hallucination and long-horizon error accumulation. Such errors not only degrade visual fidelity, but also mislead policy optimization by providing unreliable learning signals. We propose WoVR, a reliable world-model-based RL framework for post-training VLA policies. Instead of assuming a faithful world model, WoVR explicitly regulates how RL interacts with imperfect imagined dynamics. It improves rollout stability through a controllable action-conditioned video world model, reshapes imagined interaction to reduce effective error depth via Keyframe-Initialized Rollouts, and maintains policy--simulator alignment through World Model-Policy co-evolution. Extensive experiments demonstrate that WoVR enables stable long-horizon imagined rollouts and effective policy optimization, achieving superior LIBERO performance and consistent real-world gains across multiple robotic platforms. These results show that world models can serve as practical simulators for RL when hallucination is explicitly controlled. Additional visualization results are available at https://wovr-corl.github.io.

cs.RO↗

Terahertz frequency upconversion by coherently driving charge dynamics in the InSb/CdTe heterostructure

We investigate terahertz (THz) harmonic generation in the InSb/CdTe heterostructure, demonstrating, for the first time, efficient in-plane magnetic field-induced second-harmonic generation (SHG). We also achieve significant third-harmonic generation (THG), rivalling Dirac materials such as graphene and Cd3As2. Our theoretical analysis identifies the primary SHG mechanism as the orbital-Zeeman correction to Drude conductivity, while the dominant THG contribution also shows Drude-like behavior. The results provide a general route to efficient THz harmonic generation in high mobility materials.

cond-mat.mtrl-sci↗

Enhancing LLM-Based Code Translation with Verified Multi-Semantic Representations

Large language models (LLMs) have shown great promise for automated code translation, yet existing approaches often rely on token-level statistical patterns rather than sufficient understanding of program semantics. As a result, translated programs may still contain logical and semantic errors. Although high-quality semantic guidance, such as functional descriptions and test cases, can help mitigate these errors, such resources are often unavailable in real-world scenarios. This raises two key challenges: how to construct rich semantic information directly from source code, and how to ensure that such semantics are accurate and reliable enough to guide translation.To address these challenges, we propose Multisage, a multi-semantic augmentation and self-calibration framework for LLM-based code translation. Multisage consists of three modules. First, a semantic representation parsing module extracts structured base semantics from source code, including data-flow graphs, type constraints, and external API information. Second, a multi-semantic augmentation module builds on these representations to generate diverse augmented semantics, including code summaries, function-level test cases, and API-oriented descriptions and tests. Third, a semantic consistency calibration module uses semantics-preserving mutations and cross-semantic consistency verification to filter, calibrate, and refine the generated semantics.Experiments on the HumanEval-X code translation benchmark show that Multisage improves translation success rates by up to 2.22 times across diverse backbone models. It consistently outperforms vanilla prompting, instruction-tuned LLMs, and Chain-of-Thought reasoning, with the largest gains observed on smaller models. These results demonstrate that explicit semantic augmentation can substantially improve the reliability of LLM-based code translation.

cs.SE↗

Domino: Decoupling Causal Modeling from Autoregressive Drafting in Speculative Decoding

Speculative decoding accelerates LLM inference by drafting multiple tokens and verifying them in parallel with the target model. However, its practical speedup is constrained by the trade-off between draft quality and drafting cost: autoregressive drafters model causal dependencies among draft tokens but incur sequential overhead, while parallel drafters reduce drafting cost but weaken intra-block dependency modeling. In this paper, we propose Domino, a speculative decoding framework that decouples causal dependency modeling from expensive autoregressive draft execution. Domino first uses a parallel draft backbone to produce preliminary draft distributions for the entire block, and then applies a lightweight Domino head to refine them with prefix-dependent causal information. To stabilize teacher-forced causal encoding, we further introduce a base-anchored training curriculum that first strengthens the parallel backbone and then gradually shifts optimization toward the causally corrected final distribution. Experiments on Qwen3 models show that Domino achieves up to \(5.49\times\) end-to-end speedup under the Transformers backend and up to \(5.8\times\) throughput speedup under SGLang serving.

cs.CL↗

Share More, Search Less: Collaborative Parallel Thinking for Efficient Test-Time Scaling

Test-Time Scaling (TTS) enhances the reasoning capabilities of large language models by allocating additional inference compute to explore the solution space. However, existing parallel TTS methods typically keep branches isolated during search: intermediate discoveries remain branch-private and cannot guide other branches in time. This information isolation causes substantial redundant exploration, as branches repeatedly rediscover information already found elsewhere and require more search steps to collect complete decision information needed to reach correct answers. To bridge this gap, we propose \textbf{Collaborative Parallel Thinking (CPT)}, a training-free inference framework that enables search-time information sharing across parallel branches. CPT extracts compact intermediate information from ongoing branches, maintains a deduplicated query-level information pool, and broadcasts pool entries through the input context, allowing each branch in subsequent search steps to reuse discoveries made by other branches rather than rediscover the same information. Empirically, experiments on HMMT and AIME benchmarks show that CPT establishes a stronger accuracy--latency Pareto frontier than strong baselines across rollout budgets and model scales, highlighting search-time collaboration as an effective direction for efficient parallel TTS.

cs.CL↗

Dynamic Optimization and Safety Indicator Injection for Jailbreaking Text-to-Image Models with Multimodal Safety Filters

Text-to-image (T2I) models can generate not-safe-for-work (NSFW) content, motivating multi-stage safety pipelines with both text and image filters. Newer LLM-based filters detect latent intent beyond keywords, making token-level perturbation attacks unreliable. Our evaluation further shows that existing jailbreak methods exhibit a sharp trade-off between filter evasion and semantic fidelity, while also requiring excessive queries to succeed. We introduce \textbf{OptJail}, an automated jailbreak framework that combines dynamic prompt optimization with multimodal feedback. It consists of two key components: (i) \textit{Dynamic Optimization}, an iterative process that leverages text-filter feedback and semantic consistency to rewrite prompts into adversarial variants; and (ii) \textit{Adaptive Safety Indicator Injection}, which formulates the injection of benign visual cues as a reinforcement learning problem to bypass image-level filters. OptJail achieves state-of-the-art performance, increasing the ShieldLM-7B bypass rate from 8.9\% (Sneakyprompt) to 99.0\%, improving CLIP score from 0.2637 to 0.2762. Moreover, it generalizes to unseen filters and successfully jailbreaks DALL E 3 in our evaluation. Mechanistic analysis reveals why these defenses fail: optimized prompts are projected into the ``safe'' region of the filter's representation space yet remain nearly stationary in the generative model's semantic space, and injected safety indicators redirect image detectors' attention away from NSFW content toward benign visual cues. This study reveals systemic vulnerabilities in current multimodal defenses and motivates stronger adaptive defenses.

cs.LG↗

Focused Forcing: Content-Aware Per-Frame KV Selection for Efficient Autoregressive Video Diffusion

Recent advances in autoregressive video diffusion have enabled sequential and streaming video generation. However, long-horizon generation requires increasingly large KV caches, making efficient compression without sacrificing quality challenging. Existing methods mostly select historical frames based on attention scores, but their context decisions remain coarse. When multiple frames are generated in the same chunk, these methods often apply a shared history selection to the whole chunk, score historical frames solely by attention, and assign head-wise budgets either uniformly or by attention-pattern heuristics rather than explicit head-importance estimation. We show that frames within the same generated chunk can depend on distinct historical frames, that the same historical frame can receive different attention scores as its relative temporal distance to the current frames changes, and that masking different heads induces unequal generation degradation. Motivated by these findings, we propose \textbf{Focused Forcing}, a training-free KV selection method that focuses cached history along both generated-frame and head dimensions. For each generated frame, Focused Forcing preserves the most relevant and distinctive historical frames by combining attention scores with diversity scores of historical frames, while assigning larger budgets to heads with higher estimated importance. Across multiple autoregressive generation paradigms, Focused Forcing achieves up to $\textbf{1.48}\times$ end-to-end acceleration without training, while \textbf{improving visual quality and text alignment}. \textit{Our code will be released on GitHub.}

cs.CV↗

Uniform Turán densities of $k$-uniform hypergraphs

For $k\ge 3$, the $(k-2)$-uniform Turán density $π_{k-2}(F)$ of a $k$-graph $F$ is the supremum of $d$ for which there are arbitrarily large $F$-free $k$-graphs that are uniformly $d$-dense with respect to the $k$-vertex cliques of every $(k-2)$-graph on the same vertex set. We develop a \emph{palette framework} for this density. For every family $\mathcal F$ of $k$-graphs, we prove that $π_{k-2}(\mathcal F)$ equals the corresponding palette Turán density. We further establish palette classification tools for the existence of $k$-graphs satisfying prescribed palette colorability constraints. Those together allow us to reduce exact density computations to a palette-homomorphism framework without relying on the hypergraph regularity method. As applications, for all $k\ge 3$ and $r\ge 2$, we establish the following values \[ \frac{r-1}{r},\quad \frac{(r-1)^2}{r^2},\quad \frac{r-1}{2r},\quad \frac{(k-1)^k}{k^k},\quad \frac{4(k-2)^{k-2}}{k^k},\quad \frac{4(k-2)^{k-2}}{3k^k} \] as $(k-2)$-uniform Turán densities of single $k$-graphs. Finally, for every $k\ge3$, we show that there exist $k$-graphs $F_1,F_2$ such that \[ π_{k-2}(\{F_1,F_2\})< \min\{π_{k-2}(F_1),π_{k-2}(F_2)\}, \] which provides the first examples of \emph{non-principal} families for this density.

math.CO↗

DynaTrain: Fast Online Parallelism Switching for Elastic LLM Training

Modern large language model (LLM) training is inherently dynamic: resource fluctuations, RLHF phase shifts, and cluster elasticity continually reshape the optimal parallelism layout, posing a significant challenge to existing training frameworks built around a static execution model. We present DynaTrain, a distributed training system for sub-second, online reconfiguration across arbitrary multi-dimensional parallelism. At its core, we propose a Virtual Parameter Space (VPS) abstraction that unifies all distributed training states under one logical coordinate space, turning any parallelism configuration into a deterministic mapping and collapsing complex transition into manageable geometric intersections. On top of VPS, a state routing-and-transition layer executes rank-local transfers under a memory-aware, deadlock-free schedule, and an Elastic Device Manager overlaps new-world construction with ongoing training to mask topology-change cost. On dense and MoE models up to 235B parameters, DynaTrain reconfigures a 70B dense model in under 2s and a 235B MoE model in 4.36s, outperforming state-of-the-art checkpoint-based and elastic systems by up to three orders of magnitude while preserving correctness.

cs.LG↗

Knowing but Not Correcting: Routine Task Requests Suppress Factual Correction in LLMs

LLMs reliably correct false claims when presented in isolation, yet when the same claims are embedded in task-oriented requests, they often comply rather than correct. We term this failure mode \emph{correction suppression} and construct a benchmark of 300 false premises to systematically evaluate it across eight models. Suppression rates range from 19\% to 90\%, with four models exceeding 80\%, establishing correction suppression as a prevalent and severe phenomenon. Mechanistic analysis reveals that suppression is not a knowledge failure: the model registers the error internally but task context diverts early-layer attention from the false claim as output intent crystallizes toward compliance at middle layers. We characterize this as \emph{knowing but not correcting} -- suppression occurs at response selection rather than knowledge encoding. Guided by this mechanism, we propose two training-free interventions. Correction Direction Steering (CDS) estimates a correction-compliance direction from matched pairs and injects it at middle layers before output intent crystallizes. Dynamic Payload Amplification (DPA) localizes payload tokens via attention divergence between early and late layers and amplifies their representation at the final layer, requiring no calibration data. Experiments on Qwen3.5-9B and LLaMA3.1-8B show both methods substantially improve factual strictness. CDS achieves the highest correction rate on Qwen3.5-9B (0\%$\to$58.2\%). DPA is the only method that preserves or improves reasoning capability on both models. These findings introduce \emph{factual strictness} -- the willingness to uphold accuracy against contextual pressures -- as a new dimension of model reliability.

cs.LG↗

Turán density of stars in uniformly dense hypergraphs

A $3$-uniform hypergraph (or $3$-graph) $H=(V,E)$ is $(d,μ,1)$-\emph{dense} if for any subsets $X,Y,Z\subseteq V$, the number of triples $(x,y,z)\in X\times Y\times Z$ such that $\{x,y,z\}$ is an edge of $H$ is at least $d|X||Y||Z|-μ|V|^3$. The \emph{$k$-star} $S_k$ is the $3$-graph with a center vertex and $k$ distinct leaf vertices, whose edge set consists of all triples containing the center and two distinct leaves. Restricting to $dot$-dense $3$-graphs, determining the \emph{$1$-uniform Turán density} $π_1(S_k)$ of $S_k$ for $k\ge 4$ was proposed by Schacht in ICM 2022. In particular, Reiher, Rödl and Schacht gave a palette construction showing that $π_1(S_k)\ge \frac{k^2-5k+7}{(k-1)^2}$ for $k\ge 3$, and also proved that $π_1(S_3)=1/4$. Lamaison and Wu later showed that this palette construction is optimal for $k\ge 48$. In this paper, we improve the results of Lamaison and Wu by proving that \[ π_1(S_k)=\frac{k^2-5k+7}{(k-1)^2} \qquad\text{for all } k\ge 9. \]

math.CO↗

Extremal problems in uniformly dense hypergraphs and digraphs

The uniform Turán density $π_{u}(F)$ of a $3$-uniform hypergraph (or $3$-graph) $F$ is the supremum of all $d$ such that there exist infinitely many $F$-free $3$-graphs $H$ in which every induced subhypergraph on a linearly sized vertex set has edge density at least $d$. Determining $π_{u}(F)$ for a given $3$-graph $F$ was proposed by Erdős and Sós in the 1980s, yet only a few cases are known. In particular, it remains open whether $1/2$ can occur as a value of $π_{u}$. In this paper, we establish a novel connection between Turán-type extremal problems for digraphs and uniform Turán densities of $3$-graphs. Using digraph extremal results, we give the first verifiable conditions for $3$-graphs $F$ with $π_{u}(F) = (r-1)/r$ and $π_{u}(F) = (r-1)^2/r^2$ for all $r \ge 2$, and identify the corresponding $3$-graphs. In particular, these $3$-graph classes contain some specific $3$-graphs, such as $K^{(3)-}_4$. We also present a sufficient condition ensuring $π_{u}(F)=4/27$ and construct $3$-graphs satisfying it; in particular, our examples are different from the tight $3$-uniform cycles whose uniform Turán density $4/27$ was determined in [{Trans. Amer. Math. Soc. 376 (2023), 4765-4809}]. Finally, we give a short proof of the existence of $3$-graphs $F$ with $π_{u}(F)=1/27$, originally established by Garbe, Král' and Lamaison [{Israel J. Math. 259 (2024), 701-726}] via the hypergraph regularity method.

math.CO↗

Not Just What's There: Enabling CLIP to Comprehend Negated Visual Descriptions Without Fine-tuning

Vision-Language Models (VLMs) like CLIP struggle to understand negation, often embedding affirmatives and negatives similarly (e.g., matching "no dog" with dog images). Existing methods refine negation understanding via fine-tuning CLIP's text encoder, risking overfitting. In this work, we propose CLIPGlasses, a plug-and-play framework that enhances CLIP's ability to comprehend negated visual descriptions. CLIPGlasses adopts a dual-stage design: a Lens module disentangles negated semantics from text embeddings, and a Frame module predicts context-aware repulsion strength, which is integrated into a modified similarity computation to penalize alignment with negated semantics, thereby reducing false positive matches. Experiments show that CLIP equipped with CLIPGlasses achieves competitive in-domain performance and outperforms state-of-the-art methods in cross-domain generalization. Its superiority is especially evident under low-resource conditions, indicating stronger robustness across domains.

cs.CV↗

$π_\texttt{RL}$: Online RL Fine-tuning for Flow-based Vision-Language-Action Models

Vision-Language-Action (VLA) models enable robots to understand and perform complex tasks from multimodal input. Although recent work explores using reinforcement learning (RL) to automate the laborious data collection process in scaling supervised fine-tuning (SFT), applying RL to large-scale flow-based VLAs (\eg, $π_0$, $π_{0.5}$) remains challenging due to intractable action log-likelihoods raised from flow matching. We address this challenge with $π_{\texttt{RL}}$, featuring two technical approaches: (1) \textbf{Flow-Noise} models the denoising process as a discrete-time MDP with a learnable noise network for exact log-likelihood computation. (2) \textbf{Flow-SDE} integrates denoising with agent-environment interaction, formulating a two-layer MDP that employs ODE-to-SDE conversion for efficient RL exploration. We evaluate $π_{\texttt{RL}}$ across various benchmarks, with experiments demonstrating that RL yields significant performance improvements in both in-distribution and out-of-distribution settings.

cs.LG↗

Non-Hermitian second-order topological insulator with point gap

The zero-mode corner states in the gap of two-dimensional non-Hermitian Su-Schrieffer-Heeger model are robust to infinitesimal perturbations that preserve chiral symmetry. However, we demonstrate that this general belief is no longer valid in large-sized systems. To reveal the higher-order topology of non-Hermitian systems, we establish a correspondence between the stable zero-mode singular states and the topologically protected corner states of energy spectrum in the thermodynamic limit. Within this framework, the number of zero-mode singular values is directly linked to the number of mid-gap corner states. The winding numbers in real space can be defined to count the number of stable zero-mode singular states. Our results formulate a bulk-boundary correspondence for both static and Floquet non-Hermitian systems, where topology arises intrinsically from the non-Hermiticity, even without symmetries.

quant-ph↗