arXiv subjects

Qiankun Zhang

Publications and source records attributed to Qiankun Zhang.

9 recordsLinked to original sources

arXiv2026

InteractBench: Benchmarking LLMs on Competitive Programming under Unrevealed Information

Competitive programming is increasingly being used to evaluate the algorithmic reasoning capabilities of large language models (LLMs). However, existing benchmarks primarily focus on full-information tasks where all problem inputs are provided upfront. This overlooks a critical dimension of algorithmic reasoning: the ability of generated programs to operate when key information is not revealed upfront. Interactive problems, a distinctive component of competitive programming, embody this challenge. These problems require programs to engage in multi-round interaction with an interactor (a judge program) under strict protocol constraints and limited query budgets, with new information revealed only in response to queries. To address this gap, we introduce InteractBench, a benchmark comprising 322 high-quality interactive problems curated from Codeforces, AtCoder, IOI, and ICPC. Each problem is packaged with executable local interactors, enabling fully offline evaluation. Unlike existing benchmarks, InteractBench assesses whether model-generated code can acquire information and track state dynamically. Our evaluation reveals a significant interaction gap: even the most advanced reasoning models achieve limited success on interactive problems. Beyond success rates, we propose a fine-grained failure taxonomy to diagnose the root causes of these deficiencies. Although algorithmic logic errors remain dominant, protocol violations and query-budget overruns are frequent. Code is available at https://github.com/kmsgk0/InteractBench.

cs.SE↗

arXiv2026

TempJail: Temporal Jailbreak Attacks against Image-to-Video Generation Models

In recent years, image-to-video (I2V) generation models have made remarkable progress in subject consistency and temporal coherence, enabling high quality video synthesis. However, these advances also introduce new safety risks. Existing studies mainly focus on jailbreak attacks involving single frame violations, while largely overlooking the temporal dimension unique to video generation models. In this paper, we investigate three attack scenarios and uncover a temporal vulnerability in I2V systems: unsafe semantics may emerge not from a single frame, but from semantic composition over time. We further identify two key challenges in such attacks: temporal abstraction and semantic camouflage. To address these issues, we propose TempJail, a novel temporal jailbreak framework for I2V systems. For temporal abstraction, we decompose a target malicious caption into an initial frame visual condition and a temporal text instruction. For semantic camouflage, on the image side we model semantic injection as controlled latent perturbation in diffusion sampling and introduce gradient guidance from pretrained encoders. On the text side, we rewrite the caption into an innocuous ``subject-action-scene'' template that bypasses safety filters while preserving temporal guidance. In the black-box inference phase, these two modalities jointly enable malicious semantics to be gradually triggered over time. Experiments on closed-source commercial models, including Kling, Seedance, Veo and PixVerse, show that TempJail improves attack success rate over prior state-of-the-art methods by 23.3\% under GPT-5.2 evaluation and 22.0\% under human evaluation. Our codes are available at \href{https://github.com/luqi-glory/TempJail}{GitHub}.

cs.CV↗

arXiv2026

SuppreSensing: Expert-Guided Feature Recalibration and Discrepancy Augmentation for Multimodal Object Detection

Multimodal object detection in remote sensing faces challenges due to semantic heterogeneity and modality-specific noise interference. To this end, we propose SuppreSensing, which reformulates multimodal fusion as a selective collaboration process that jointly models shared information and modality-specific cues. SuppreSensing first designs an Expert-driven Multimodal Feature Recalibration (EMFR) module, which reformulates shared-consensus extraction as an input-adaptive multi-expert selection process to alleviate the symmetry trap in multimodal fusion. Complementing this, a modality-specific attribute augmentation strategy is employed to enhance specific modality features by modeling bidirectional discrepancy patterns, mitigating cross-modal heterogeneity. Furthermore, we propose an Expert-driven Customized Feature Purification (ECFP) module based on a "specialized inspection-comprehensive analysis-diagnostic update" physical examination paradigm to iteratively filter redundancies and reinforce task-relevant semantics. Extensive experiments on the DroneVehicle and VEDAI datasets demonstrate that SuppreSensing achieves state-of-the-art detection performance. Cross-domain evaluations on natural scene datasets (FLIR and LLVIP) further validate its superior robustness and generalization capability across diverse environmental conditions.

cs.CV↗

arXiv2023

AI-driven emergence of frequency information non-uniform distribution via THz metasurface spectrum prediction

Recently, artificial intelligence has been extensively deployed across various scientific disciplines, optimizing and guiding the progression of experiments through the integration of abundant datasets, whilst continuously probing the vast theoretical space encapsulated within the data. Particularly, deep learning models, due to their end-to-end adaptive learning capabilities, are capable of autonomously learning intrinsic data features, thereby transcending the limitations of traditional experience to a certain extent. Here, we unveil previously unreported information characteristics pertaining to different frequencies emerged during our work on predicting the terahertz spectral modulation effects of metasurfaces based on AI-prediction. Moreover, we have substantiated that our proposed methodology of simply adding supplementary multi-frequency inputs to the existing dataset during the target spectral prediction process can significantly enhance the predictive accuracy of the network. This approach effectively optimizes the utilization of existing datasets and paves the way for interdisciplinary research and applications in artificial intelligence, chemistry, composite material design, biomedicine, and other fields.

cs.LG↗

arXiv2023

Online Matching with Stochastic Rewards: Advanced Analyses Using Configuration Linear Programs

Mehta and Panigrahi (2012) proposed Online Matching with Stochastic Rewards, which generalizes the Online Bipartite Matching problem of Karp, Vazirani, and Vazirani (1990) by associating the edges with success probabilities. This new feature captures the pay-per-click model in online advertising. Recently, Huang and Zhang (2020) studied this problem under the online primal dual framework using the Configuration Linear Program (LP), and got the best known competitive ratios of the Stochastic Balance algorithm. Their work suggests that the more expressive Configuration LP is more suitable for this problem than the Matching LP. This paper advances the theory of Configuration LP in two directions. Our technical contribution includes a characterization of the joint matching outcome of an offline vertex and \emph{all its neighbors}. This characterization may be of independent interest, and is aligned with the spirit of Configuration LP. By contrast, previous analyses of Ranking generally focus on only one neighbor. Second, we designed a Stochastic Configuration LP that captures a stochastic benchmark proposed by Goyal and Udwani (2020), who used a Path-based LP. The Stochastic Configuration LP is smaller and simpler than the Path-based LP. Moreover, using the new LP we improved the competitive ratio of Stochastic Balance from $0.596$ to $0.611$ when the success probabilities are infinitesimal, and to $0.613$ when the success probabilities are further equal.

cs.DS↗

arXiv2021

Dissipative coupling induced phonon lasing with anti-parity-time symmetry

Phonon lasers, as the counterpart of photonic lasers, have been intensively studied in a large variety of systems, however, (all) most of them are based on the directly coherent pumping. Intuitively, dissipation is an unfavorable factor for gain in a laser. Here we demonstrate a novel mechanism of phonon lasing from the dissipative coupling in a multimode optomechanical system. By precisely engineering the dissipations of two membranes and tuning the intensity modulation of the cavity light, the two-membrane-in-the-middle system shows anti-parity-time (anti-PT) symmetry and the cavity mediated interaction between two nanomechanical resonators becomes purely dissipative. The level attraction and damping repulsion are clearly exhibited as the signature of dissipative coupling. After the exceptional point, a non-Hermitian phase transition, where eigenvalues and the corresponding eigenmodes coalesce, two phonon modes are simultaneously excited into the self-sustained oscillation regime by increasing the interaction strength over a critical value (threshold). In distinct contrast to conventional phonon lasers, the measurement of the second-order phonon correlation reveals the oscillatory and biexponential phases in the nonlasing regime as well as the coherence phase in the lasing regime. Our study provides a new method to study phonon lasers in a non-Hermitian open system and could be applied to a wide range of disciplines, including optics, acoustics, and quantum many-body physics.

physics.optics↗

arXiv2020

Adwords in a Panorama

Three decades ago, Karp, Vazirani, and Vazirani (STOC 1990) defined the online matching problem and gave an optimal $1-\frac{1}{e} \approx 0.632$-competitive algorithm. Fifteen years later, Mehta, Saberi, Vazirani, and Vazirani (FOCS 2005) introduced the first generalization called AdWords driven by online advertising and obtained the optimal $1-\frac{1}{e}$ competitive ratio in the special case of small bids. It has been open ever since whether there is an algorithm for general bids better than the $0.5$-competitive greedy algorithm. This paper presents a $0.5016$-competitive algorithm for AdWords, answering this open question on the positive end. The algorithm builds on several ingredients, including a combination of the online primal dual framework and the configuration linear program of matching problems recently explored by Huang and Zhang (STOC 2020), a novel formulation of AdWords which we call the panorama view, and a generalization of the online correlated selection by Fahrbach, Huang, Tao, and Zadimorghaddam (FOCS 2020) which we call the panoramic online correlated selection.

cs.DS↗

arXiv2020

Online Primal Dual Meets Online Matching with Stochastic Rewards: Configuration LP to the Rescue

Mehta and Panigrahi (FOCS 2012) introduce the problem of online matching with stochastic rewards, where edges are associated with success probabilities and a match succeeds with the probability of the corresponding edge. It is one of the few online matching problems that have defied the randomized online primal dual framework by Devanur, Jain, and Kleinberg (SODA 2013) thus far. This paper unlocks the power of randomized online primal dual in online matching with stochastic rewards by employing the configuration linear program rather than the standard matching linear program used in previous works. Our main result is a 0.572 competitive algorithm for the case of vanishing and unequal probabilities, improving the best previous bound of 0.534 by Mehta, Waggoner, and Zadimoghaddam (SODA 2015) and, in fact, is even better than the best previous bound of 0.567 by Mehta and Panigrahi (FOCS 2012) for the more restricted case of vanishing and equal probabilities. For vanishing and equal probabilities, we get a better competitive ratio of 0.576. Our results further generalize to the vertex-weighted case due to the intrinsic robustness of the randomized online primal dual analysis.

cs.DS↗

arXiv2018

Liquid phase mass production of air-stable black phosphorus/phospholipids nanocomposite with ultralow tunneling barrier

Few-layer black phosphorus (FLBP), a recently discovered two-dimensional semiconductor, has attracted substantial attention in the scientific and technical communities due to its great potential in electronic and optoelectronic applications. However, reactivity of FLBP flakes with ambient species limits its direct applications. Among various methods to passivate FLBP in ambient environment, nanocomposites mixing FLBP flakes with stable matrix may be one of the most promising approaches for industry applications. Here, we report a simple one-step procedure to mass produce air-stable FLBP/phospholipids nanocomposite in liquid phase. The resultant nanocomposite is found to have ultralow tunneling barrier for charge carriers which can be described by an Efros-Shklovskii variable range hopping mechanism. Devices made from such mass-produced FLBP/phospholipids nanocomposite show highly stable electrical conductivity and opto-electrical response in ambient conditions, indicating its promising applications in both electronic and optoelectronic applications. This method could also be generalized to the mass production of nanocomposites consisting of other air-sensitive two-dimensional materials, such as FeSe, NbSe2, WTe2, etc.

cond-mat.mtrl-sci↗