Qiaosheng Zhang

Orcid: 0000-0001-6114-8453

Affiliations:
  • Shanghai Artificial Intelligence Laboratory, China
  • Shanghai Innovation Institute, China
  • National University of Singapore, Department of ECE, Singapore (2019 - 2022)
  • Chinese University of Hong Kong, Department of Information Engineering, Hong Kong (PhD 2019)


According to our database1, Qiaosheng Zhang authored at least 40 papers between 2015 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
ICL-Router: In-Context Learned Model Representations for LLM Routing.
CoRR, October, 2025

The Path of Self-Evolving Large Language Models: Achieving Data-Efficient Learning via Intrinsic Feedback.
CoRR, October, 2025

Optimal Information Security Against Limited-View Adversaries: The Benefits of Causality and Feedback.
IEEE Trans. Commun., August, 2025

PerPilot: Personalizing VLM-based Mobile Agents via Memory and Exploration.
CoRR, August, 2025

Unsupervised Skill Discovery through Skill Regions Differentiation.
CoRR, June, 2025

The Avengers: A Simple Recipe for Uniting Smaller Language Models to Challenge Proprietary Giants.
CoRR, May, 2025

Do We Truly Need So Many Samples? Multi-LLM Repeated Sampling Efficiently Scales Test-Time Compute.
CoRR, April, 2025

If Multi-Agent Debate is the Answer, What is the Question?
CoRR, February, 2025

Graph Feedback Bandits on Similar Arms: With and Without Graph Structures.
CoRR, January, 2025

Sample-Efficient Reinforcement Learning From Human Feedback via Information-Directed Sampling.
IEEE Trans. Inf. Theory, 2025

Provably efficient information-directed sampling algorithms for multi-agent reinforcement learning.
Artif. Intell., 2025

Online Preference Alignment for Language Models via Count-based Exploration.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

2024
Enhancing Covert Communication in OOK Schemes by Phase Deflection.
IEEE Trans. Inf. Forensics Secur., 2024

Understanding When and Why Graph Attention Mechanisms Work via Node Classification.
CoRR, 2024

Community Detection in the Multi-View Stochastic Block Model.
CoRR, 2024

Ensemble successor representations for task generalization in offline-to-online reinforcement learning.
Sci. China Inf. Sci., 2024

Matrix Completion With Hypergraphs: Sharp Thresholds and Efficient Algorithms.
Proceedings of the Learning on Graphs Conference, 26-29 November 2024, Virtual., 2024

Constrained Ensemble Exploration for Unsupervised Skill Discovery.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

On the Role of General Function Approximation in Offline Reinforcement Learning.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
Optimal Information Security Against Limited-View Adversaries: Beyond MDS Codes.
IEEE Trans. Commun., December, 2023

Exact Recovery in the General Hypergraph Stochastic Block Model.
IEEE Trans. Inf. Theory, 2023

Covert Communication Gains From Adversary's Uncertainty of Phase Angles.
IEEE Trans. Inf. Forensics Secur., 2023

2022
Mc2g: An Efficient Algorithm for Matrix Completion With Social and Item Similarity Graphs.
IEEE Trans. Signal Process., 2022

Covert Communication with Mismatched Decoders.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Community Detection and Matrix Completion With Social and Item Similarity Graphs.
IEEE Trans. Signal Process., 2021

Covert Identification Over Binary-Input Discrete Memoryless Channels.
IEEE Trans. Inf. Theory, 2021

Optimal Change-Point Detection With Training Sequences in the Large and Moderate Deviations Regimes.
IEEE Trans. Inf. Theory, 2021

2020
Covert Communication With Polynomial Computational Complexity.
IEEE Trans. Inf. Theory, 2020

Stealthy Communication Over Adversarially Jammed Multipath Networks.
IEEE Trans. Commun., 2020

Covert Identification over Binary-Input Memoryless Channels.
CoRR, 2020

Optimal Resolution of Change-Point Detection with Empirically Observed Statistics and Erasures.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Achievability Bounds for Community Detection and Matrix Completion with Two-Sided Graph Side-Information.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Community Detection and Matrix Completion with Two-Sided Graph Side-Information.
CoRR, 2019

Undetectable Radios: Covert Communication under Spectral Mask Constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Covert Communication over Adversarially Jammed Channels.
Proceedings of the IEEE Information Theory Workshop, 2018

Multipath Stealth Communication with Jammers.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2016
Computationally efficient deniable communication.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Talking reliably, secretly, and efficiently: A "complete" characterization.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Coding against a limited-view adversary: The effect of causality and feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Reliable and secure communication over adversarial multipath networks: A survey.
Proceedings of the 10th International Conference on Information, 2015


  Loading...