pith. sign in

Shengyu Zhang

Identifiers

  • name variant Shengyu Zhang 0.60 · backfill

Papers (44)

  1. DeskCraft: Benchmarking Desktop Agents on Professional Workflows and Human-in-the-Loop Collaboration cs.AI · 2026 · author #9
  2. Learning to Adapt: Self-Improving Web Agent via Cognitive-Aware Exploration cs.AI · 2026 · author #7
  3. Breaking the scalability barrier via a vertical tunable coupler in 3D integrated transmon system quant-ph · 2026 · author #14
  4. Generalized i-boson model and boxed BUC plane partitions math-ph · 2026 · author #1
  5. Measure Twice, Click Once: Co-evolving Proposer and Visual Critic via Reinforcement Learning for GUI Grounding cs.LG · 2026 · author #8
  6. Semantic Trimming and Auxiliary Multi-step Prediction for Generative Recommendation cs.IR · 2026 · author #5
  7. FORGE: Forming Semantic Identifiers for Generative Retrieval in Industrial Datasets cs.IR · 2025 · author #10
  8. InfiGUI-R1: Advancing Multimodal GUI Agents from Reactive Actors to Deliberative Reasoners cs.AI · 2025 · author #6
  9. On the dynamical Lie algebras of quantum approximate optimization algorithms quant-ph · 2024 · author #4
  10. Alchemy: A Quantum Chemistry Dataset for Benchmarking AI Models cs.LG · 2019 · author #12
  11. A Meta Approach to Defend Noisy Labels by the Manifold Regularizer PSDR cs.LG · 2019 · author #4
  12. Utilizing Edge Features in Graph Neural Networks via Variational Information Maximization cs.LG · 2019 · author #5
  13. Non-Markovian Noise Characterization with the Transfer Tensor Method quant-ph · 2019 · author #5
  14. Rethinking the Usage of Batch Normalization and Dropout in the Training of Deep Neural Networks cs.LG · 2019 · author #6
  15. Understanding and Utilizing Deep Neural Networks Trained with Noisy Labels cs.LG · 2019 · author #4
  16. Networked Fairness in Cake Cutting cs.DS · 2017 · author #3
  17. On the complexity of probabilistic trials for hidden satisfiability problems cs.CC · 2016 · author #6
  18. Sensitivity Conjecture and Log-rank Conjecture for functions with small alternating numbers cs.CC · 2016 · author #2
  19. Semiquantum key distribution with secure delegated quantum computation quant-ph · 2015 · author #3
  20. Linear time algorithm for quantum 2SAT quant-ph · 2015 · author #4
  21. Fourier Sparsity of GF(2) Polynomials cs.CC · 2015 · author #3
  22. Quantum game players can have advantage without discord quant-ph · 2015 · author #2
  23. Nonlocality and conflicting interest games quant-ph · 2014 · author #5
  24. Multipartite Quantum Correlation and Communication Complexities quant-ph · 2014 · author #4
  25. Efficient quantum protocols for XOR functions cs.CC · 2013 · author #1
  26. Solving Linear Programming with Constraints Unknown cs.DS · 2013 · author #3
  27. Fourier sparsity, spectral norm, and the Log-rank conjecture cs.CC · 2013 · author #4
  28. On the Complexity of Trial and Error cs.CC · 2012 · author #3
  29. Correlation/Communication complexity of generating bipartite states cs.CC · 2012 · author #4
  30. On characterizing quantum correlated equilibria quant-ph · 2011 · author #2
  31. A quantum protocol for sampling correlated equilibria unconditionally and without a mediator cs.GT · 2011 · author #2
  32. The influence lower bound via query elimination cs.CC · 2011 · author #2
  33. Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models cs.CC · 2011 · author #3
  34. Quantum Strategic Game Theory quant-ph · 2010 · author #1
  35. Composition theorems in communication complexity quant-ph · 2010 · author #2
  36. Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas cs.CC · 2009 · author #3
  37. On the power of a unique quantum witness quant-ph · 2009 · author #6
  38. New bounds on classical and quantum one-way communication complexity cs.IT · 2008 · author #2
  39. A single-shot measurement of the energy of product states in a translation invariant spin chain can replace any quantum computation quant-ph · 2007 · author #3
  40. Several natural BQP-Complete problems quant-ph · 2006 · author #2
  41. New upper and lower bounds for randomized and quantum Local Search quant-ph · 2006 · author #1
  42. The Communication Complexity of the Hamming Distance Problem quant-ph · 2005 · author #3
  43. (Almost) tight bounds for randomized and quantum Local Search on hypercubes and grids quant-ph · 2005 · author #1
  44. On the power of Ambainis's lower bounds quant-ph · 2003 · author #1

Mentions

  • 1508.07090 #3 · backfill · confidence 0.70 Shengyu Zhang
  • 1508.06340 #4 · backfill · confidence 0.70 Shengyu Zhang
  • 1508.02158 #3 · backfill · confidence 0.70 Shengyu Zhang
  • 2606.03103 #9 · arxiv_oai · confidence 0.70 Shengyu Zhang
  • 1502.00207 #2 · backfill · confidence 0.70 Shengyu Zhang
  • 2605.31365 #7 · arxiv_oai · confidence 0.70 Shengyu Zhang
  • 1408.3281 #5 · backfill · confidence 0.70 Shengyu Zhang
  • 1405.6015 #4 · backfill · confidence 0.70 Shengyu Zhang
  • 2509.20904 #10 · arxiv_oai · confidence 0.70 Shengyu Zhang
  • 2407.12587 #4 · arxiv_oai · confidence 0.70 Shengyu Zhang
  • 1307.6738 #1 · backfill · confidence 0.70 Shengyu Zhang
  • 1304.1247 #3 · backfill · confidence 0.70 Shengyu Zhang
  • 1304.1245 #4 · backfill · confidence 0.70 Shengyu Zhang
  • 1205.1183 #3 · backfill · confidence 0.70 Shengyu Zhang
  • 1203.1153 #4 · backfill · confidence 0.70 Shengyu Zhang
  • 1105.5353 #2 · backfill · confidence 0.70 Shengyu Zhang
  • 1104.1770 #2 · backfill · confidence 0.70 Shengyu Zhang
  • 1102.4699 #2 · backfill · confidence 0.70 Shengyu Zhang
  • 1101.4555 #3 · backfill · confidence 0.70 Shengyu Zhang
  • 1012.5141 #1 · backfill · confidence 0.70 Shengyu Zhang
  • 2504.14239 #6 · arxiv_oai · confidence 0.70 Shengyu Zhang
  • 1003.1443 #2 · backfill · confidence 0.70 Shengyu Zhang
  • 0908.4453 #3 · backfill · confidence 0.70 Shengyu Zhang
  • 0906.4425 #6 · backfill · confidence 0.70 Shengyu Zhang
  • 0802.4101 #2 · backfill · confidence 0.70 Shengyu Zhang
  • 0710.1615 #3 · backfill · confidence 0.70 Shengyu Zhang

Frequent Coauthors