Qixin Zhang

Orcid: 0000-0002-0535-3134

Affiliations:

Nanyang Technological University (NTU), College of Computing and Data Science, Singapore
City University of Hong Kong, School of Data Science, Kowloon Tong, Hong Kong (former)

According to our database¹, Qixin Zhang authored at least 39 papers between 2021 and 2026.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Bibliography

2026

STARS: Spike Tail-Aware Relational Synthesis for ANN-to-SNN Data-Free Knowledge Distillation.

[BibT_eX]

[DOI]

CoRR, May, 2026

TERGAD: Structure-Aware Text-Enhanced Representations for Graph Anomaly Detection.

[BibT_eX]

[DOI]

CoRR, May, 2026

CMKL: Modality-Aware Continual Learning for Evolving Biomedical Knowledge Graphs.

[BibT_eX]

[DOI]

CoRR, May, 2026

Learning Multi-Relational Graph Representations for DNA Methylation-Based Biological Age Estimation.

[BibT_eX]

[DOI]

CoRR, May, 2026

ZK-Value: A Practical Zero-Knowledge System for Verifiable Data Valuation.

[BibT_eX]

[DOI]

CoRR, May, 2026

FORGE: Fine-grained Multimodal Evaluation for Manufacturing Scenarios.

[BibT_eX]

[DOI]

CoRR, April, 2026

Multinoulli Extension: A Lossless Continuous Relaxation for Partition-Constrained Subset Selection.

[BibT_eX]

[DOI]

CoRR, March, 2026

Near-Oracle KV Selection via Pre-hoc Sparsity for Long-Context Inference.

[BibT_eX]

[DOI]

CoRR, February, 2026

Time Is All It Takes: Spike-Retiming Attacks on Event-Driven Spiking Neural Networks.

[BibT_eX]

[DOI]

CoRR, February, 2026

Make Anything Match Your Target: Universal Adversarial Perturbations against Closed-Source MLLMs via Multi-Crop Routed Meta Optimization.

[BibT_eX]

[DOI]

CoRR, January, 2026

Efficient Differentiable Causal Discovery via Reliable Super-Structure Learning.

[BibT_eX]

[DOI]

CoRR, January, 2026

Personalized Lattice Influence Maximization: Approximation Guarantees and Robustness.

[BibT_eX]

[DOI]

IEEE Trans. Netw. Sci. Eng., 2026

Spatio-temporal traffic accidents detection via graph based generative adversarial network.

[BibT_eX]

[DOI]

Eng. Appl. Artif. Intell., 2026

Reasoning over Precedents Alongside Statutes: Case-Augmented Deliberative Alignment for LLM Safety.

[BibT_eX]

[DOI]

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2026

2025

Sparsity-Controllable Dynamic Top-p MoE for Large Foundation Model Pre-training.

[BibT_eX]

[DOI]

CoRR, December, 2025

When Robots Obey the Patch: Universal Transferable Patch Attacks on Vision-Language-Action Models.

[BibT_eX]

[DOI]

CoRR, November, 2025

Sparse by Rule: Probability-Based N:M Pruning for Spiking Neural Networks.

[BibT_eX]

[DOI]

CoRR, November, 2025

Learning from Dense Events: Towards Fast Spiking Neural Networks Training via Event Dataset Distillation.

[BibT_eX]

[DOI]

CoRR, November, 2025

Your Reward Function for RL is Your Best PRM for Search: Unifying RL and Search-Based TTS.

[BibT_eX]

[DOI]

CoRR, August, 2025

MaskPro: Linear-Space Probabilistic Learning for Strict (N:M)-Sparsity on Large Language Models.

[BibT_eX]

[DOI]

CoRR, June, 2025

GraphOmni: A Comprehensive and Extendable Benchmark Framework for Large Language Models on Graph-theoretic Tasks.

[BibT_eX]

[DOI]

CoRR, April, 2025

Two Heads are Better Than One: Test-time Scaling of Multi-agent Collaborative Reasoning.

[BibT_eX]

[DOI]

CoRR, April, 2025

Graph convolutional network for traffic incidents duration classification.

[BibT_eX]

[DOI]

Eng. Appl. Artif. Intell., 2025

Effective Policy Learning for Multi-Agent Online Coordination Beyond Submodular Objectives.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Contextual Bandits for Unbounded Context Distributions.

[BibT_eX]

[DOI]

Proceedings of the Forty-second International Conference on Machine Learning, 2025

Refining Adaptive Zeroth-Order Optimization at Ease.

[BibT_eX]

[DOI]

Proceedings of the Forty-second International Conference on Machine Learning, 2025

Multinoulli Extension: A Lossless Yet Effective Probabilistic Framework for Subset Selection over Partition Constraints.

[BibT_eX]

[DOI]

Proceedings of the Forty-second International Conference on Machine Learning, 2025

Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

2024

Dynamic Assortment Selection Under Inventory and Limited Switches Constraints.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., March, 2024

Boosting Gradient Ascent for Continuous DR-submodular Maximization.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Nearly Optimal Competitive Ratio for Online Allocation Problems with Two-sided Resource Constraints and Finite Requests.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Communication-Efficient Decentralized Online Continuous DR-Submodular Maximization.

[BibT_eX]

[DOI]

Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

Online Learning for Non-monotone DR-Submodular Maximization: From Full Information to Bandit Feedback.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

Online Learning for Non-monotone Submodular Maximization: From Full Information to Bandit Feedback.

[BibT_eX]

[DOI]

CoRR, 2022

MNL-Bandits under Inventory and Limited Switches Constraints.

[BibT_eX]

[DOI]

CoRR, 2022

Continuous Submodular Maximization: Boosting via Non-oblivious Function.

[BibT_eX]

[DOI]

CoRR, 2022

Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

2021

Online Allocation with Two-sided Resource Constraints.

[BibT_eX]

[DOI]

CoRR, 2021

Towards Better Laplacian Representation in Reinforcement Learning with Generalized Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Qixin Zhang

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...