default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQixin Zhang 0001
Person information
- affiliation: Nanyang Technological University (NTU), College of Computing and Data Science, Singapore
- affiliation (former): City University of Hong Kong, School of Data Science, Kowloon Tong, Hong Kong
Other persons with the same name
- Qixin Zhang (aka: Qi-xin Zhang) — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j3]Lyuyi Zhu
, Qixin Zhang, Xiangru Jian, Yu Yang, Lishuai Li:
Spatio-temporal traffic accidents detection via graph based generative adversarial network. Eng. Appl. Artif. Intell. 165: 113488 (2026)- [i23]Pingchuan Ma, Qixin Zhang, Shuai Wang, Dacheng Tao:
Efficient Differentiable Causal Discovery via Reliable Super-Structure Learning. CoRR abs/2601.05474 (2026) - [i22]Can Jin, Rui Wu, Tong Che, Qixin Zhang, Hongwu Peng, Jiahui Zhao, Zhenting Wang, Wenqi Wei, Ligong Han, Zhao Zhang, Yuan Cao, Ruixiang Tang, Dimitris N. Metaxas:
Reasoning over Precedents Alongside Statutes: Case-Augmented Deliberative Alignment for LLM Safety. CoRR abs/2601.08000 (2026) - [i21]Hui Lu, Yi Yu, Yiming Yang, Chenyu Yi, Xueyi Ke, Qixin Zhang, Bingquan Shen, Alex C. Kot, Xudong Jiang:
Make Anything Match Your Target: Universal Adversarial Perturbations against Closed-Source MLLMs via Multi-Crop Routed Meta Optimization. CoRR abs/2601.23179 (2026) - [i20]Yi Yu, Qixin Zhang, Shuhan Ye, Xun Lin, Qianshan Wei, Kun Wang, Wenhan Yang, Dacheng Tao, Xudong Jiang:
Time Is All It Takes: Spike-Retiming Attacks on Event-Driven Spiking Neural Networks. CoRR abs/2602.03284 (2026) - [i19]Yifei Gao, Lei Wang, Rong-Cheng Tu, Qixin Zhang, Jun Cheng, Dacheng Tao:
Near-Oracle KV Selection via Pre-hoc Sparsity for Long-Context Inference. CoRR abs/2602.08329 (2026) - 2025
- [j2]Lyuyi Zhu, Qixin Zhang, Xiangru Jian, Yu Yang:
Graph convolutional network for traffic incidents duration classification. Eng. Appl. Artif. Intell. 151: 110570 (2025) - [c9]Qixin Zhang, Zongqi Wan, Yu Yang, Li Shen, Dacheng Tao:
Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency. ICLR 2025 - [c8]Qixin Zhang, Wei Huang, Can Jin, Puning Zhao, Yao Shu, Li Shen, Dacheng Tao:
Multinoulli Extension: A Lossless Yet Effective Probabilistic Framework for Subset Selection over Partition Constraints. ICML 2025 - [c7]Yao Shu, Qixin Zhang, Kun He, Zhongxiang Dai:
Refining Adaptive Zeroth-Order Optimization at Ease. ICML 2025 - [c6]Puning Zhao, Rongfei Fan, Shaowei Wang, Li Shen, Qixin Zhang, Zong Ke, Tianhang Zheng:
Contextual Bandits for Unbounded Context Distributions. ICML 2025 - [i18]Yao Shu, Qixin Zhang, Kun He, Zhongxiang Dai:
Refining Adaptive Zeroth-Order Optimization at Ease. CoRR abs/2502.01014 (2025) - [i17]Qixin Zhang, Zongqi Wan, Yu Yang, Li Shen, Dacheng Tao:
Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency. CoRR abs/2502.05028 (2025) - [i16]Can Jin, Hongwu Peng, Qixin Zhang, Yujin Tang, Dimitris N. Metaxas, Tong Che:
Two Heads are Better Than One: Test-time Scaling of Multi-agent Collaborative Reasoning. CoRR abs/2504.09772 (2025) - [i15]Hao Xu, Xiangru Jian, Xinjian Zhao, Wei Pang, Chao Zhang, Suyuchen Wang, Qixin Zhang, Joao Monteiro, Qiuzhuang Sun, Tianshu Yu:
GraphOmni: A Comprehensive and Extendable Benchmark Framework for Large Language Models on Graph-theoretic Tasks. CoRR abs/2504.12764 (2025) - [i14]Yan Sun, Qixin Zhang, Zhiyuan Yu, Xikun Zhang, Li Shen, Dacheng Tao:
MaskPro: Linear-Space Probabilistic Learning for Strict (N:M)-Sparsity on Large Language Models. CoRR abs/2506.12876 (2025) - [i13]Can Jin, Yang Zhou, Qixin Zhang, Hongwu Peng, Di Zhang, Marco Pavone, Ligong Han, Zhang-Wei Hong, Tong Che, Dimitris N. Metaxas:
Your Reward Function for RL is Your Best PRM for Search: Unifying RL and Search-Based TTS. CoRR abs/2508.14313 (2025) - [i12]Qixin Zhang, Yan Sun, Can Jin, Xikun Zhang, Yao Shu, Puning Zhao, Li Shen, Dacheng Tao:
Effective Policy Learning for Multi-Agent Online Coordination Beyond Submodular Objectives. CoRR abs/2509.22596 (2025) - [i11]Shuhan Ye, Yi Yu, Qixin Zhang, Chenqi Kong, Qiangqiang Wu, Kun Wang, Xudong Jiang:
Learning from Dense Events: Towards Fast Spiking Neural Networks Training via Event Dataset Distillation. CoRR abs/2511.12095 (2025) - [i10]Shuhan Ye, Yi Yu, Qixin Zhang, Chenqi Kong, Qiangqiang Wu, Xudong Jiang, Dacheng Tao:
Sparse by Rule: Probability-Based N:M Pruning for Spiking Neural Networks. CoRR abs/2511.12097 (2025) - [i9]Hui Lu, Yi Yu, Yiming Yang, Chenyu Yi, Qixin Zhang, Bingquan Shen, Alex C. Kot, Xudong Jiang:
When Robots Obey the Patch: Universal Transferable Patch Attacks on Vision-Language-Action Models. CoRR abs/2511.21192 (2025) - [i8]Can Jin, Hongwu Peng, Mingcan Xiang, Qixin Zhang, Xiangchi Yuan, Amit Hasan, Ohiremen Dibua, Yifan Gong, Yan Kang, Dimitris N. Metaxas:
Sparsity-Controllable Dynamic Top-p MoE for Large Foundation Model Pre-training. CoRR abs/2512.13996 (2025) - 2024
- [j1]Hongbin Zhang, Qixin Zhang, Feng Wu, Yu Yang:
Dynamic Assortment Selection Under Inventory and Limited Switches Constraints. IEEE Trans. Knowl. Data Eng. 36(3): 1056-1068 (2024) - [i7]Qixin Zhang, Zongqi Wan, Zengde Deng, Zaiyi Chen, Xiaoming Sun, Jialin Zhang, Yu Yang:
Boosting Gradient Ascent for Continuous DR-submodular Maximization. CoRR abs/2401.08330 (2024) - 2023
- [c5]Qixin Zhang, Zengde Deng, Zaiyi Chen, Kuangqi Zhou, Haoyuan Hu, Yu Yang:
Online Learning for Non-monotone DR-Submodular Maximization: From Full Information to Bandit Feedback. AISTATS 2023: 3515-3537 - [c4]Qixin Zhang, Zengde Deng, Xiangru Jian, Zaiyi Chen, Haoyuan Hu, Yu Yang:
Communication-Efficient Decentralized Online Continuous DR-Submodular Maximization. CIKM 2023: 3330-3339 - [c3]Qixin Zhang, Wenbing Ye, Zaiyi Chen, Haoyuan Hu, Enhong Chen, Yu Yang:
Nearly Optimal Competitive Ratio for Online Allocation Problems with Two-sided Resource Constraints and Finite Requests. ICML 2023: 41786-41818 - 2022
- [c2]Qixin Zhang, Zengde Deng, Zaiyi Chen, Haoyuan Hu, Yu Yang:
Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function. ICML 2022: 26116-26134 - [i6]Qixin Zhang, Zengde Deng, Zaiyi Chen, Yu Yang:
Continuous Submodular Maximization: Boosting via Non-oblivious Function. CoRR abs/2201.00703 (2022) - [i5]Hongbin Zhang, Yu Yang, Feng Wu, Qixin Zhang:
MNL-Bandits under Inventory and Limited Switches Constraints. CoRR abs/2204.10787 (2022) - [i4]Qixin Zhang, Zengde Deng, Zaiyi Chen, Kuangqi Zhou, Haoyuan Hu, Yu Yang:
Online Learning for Non-monotone Submodular Maximization: From Full Information to Bandit Feedback. CoRR abs/2208.07632 (2022) - [i3]Qixin Zhang, Zengde Deng, Xiangru Jian, Zaiyi Chen, Haoyuan Hu, Yu Yang:
Communication-Efficient Decentralized Online Continuous DR-Submodular Maximization. CoRR abs/2208.08681 (2022) - 2021
- [c1]Kaixin Wang, Kuangqi Zhou, Qixin Zhang, Jie Shao, Bryan Hooi, Jiashi Feng:
Towards Better Laplacian Representation in Reinforcement Learning with Generalized Graph Drawing. ICML 2021: 11003-11012 - [i2]Kaixin Wang, Kuangqi Zhou, Qixin Zhang, Jie Shao, Bryan Hooi, Jiashi Feng:
Towards Better Laplacian Representation in Reinforcement Learning with Generalized Graph Drawing. CoRR abs/2107.05545 (2021) - [i1]Qixin Zhang, Wenbing Ye, Zaiyi Chen, Haoyuan Hu, Enhong Chen, Yang Yu:
Online Allocation with Two-sided Resource Constraints. CoRR abs/2112.13964 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-03-27 21:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
