pith. sign in

Pinyan Lu

Identifiers

  • name variant Pinyan Lu 0.60 · backfill

Papers (45)

  1. Unveiling Memorization-Generalization Coexistence: A Case Study on Arithmetic Tasks with Label Noise cs.LG · 2026 · author #2
  2. SHAPE: Stage-aware Hierarchical Advantage via Potential Estimation for LLM Reasoning cs.LG · 2026 · author #6
  3. Muon in Associative Memory Learning: Training Dynamics and Scaling Laws cs.LG · 2026 · author #4
  4. Tight Regret Bounds for Fixed-Price Bilateral Trade cs.GT · 2025 · author #3
  5. Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio cs.DS · 2019 · author #2
  6. Zeros of ferromagnetic 2-spin systems cs.DS · 2019 · author #3
  7. Counting independent sets and colorings on random regular bipartite graphs cs.DS · 2019 · author #3
  8. Revenue Maximization with Imprecise Distribution cs.GT · 2019 · author #2
  9. Approximability of the Eight-vertex Model cs.CC · 2018 · author #3
  10. Tight Approximation Ratio of Anonymous Pricing cs.GT · 2018 · author #2
  11. Zeros of Holant problems: locations and algorithms cs.DS · 2018 · author #3
  12. Approximability of the Six-vertex Model cs.CC · 2017 · author #3
  13. Counting hypergraph colorings in the local lemma regime cs.DS · 2017 · author #3
  14. The Value of Information Concealment cs.GT · 2017 · author #3
  15. Dichotomy for Real Holant$^c$ Problems cs.CC · 2017 · author #2
  16. An FPTAS for Counting Proper Four-Colorings on Cubic Graphs cs.DS · 2016 · author #1
  17. Combinatorial Multi-Armed Bandit with General Reward Functions cs.LG · 2016 · author #6
  18. Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems cs.DS · 2015 · author #2
  19. Canonical Paths for MCMC: from Art to Science cs.DS · 2015 · author #2
  20. FPTAS for Hardcore and Ising Models on Hypergraphs cs.DS · 2015 · author #1
  21. FPTAS for #BIS with Degree Bounds on One Side cs.DS · 2014 · author #2
  22. Competitive analysis via benchmark decomposition cs.GT · 2014 · author #3
  23. Improved Efficiency Guarantees in Auctions with Budgets cs.GT · 2014 · author #1
  24. FPTAS for Weighted Fibonacci Gates and Its Applications cs.DS · 2014 · author #1
  25. The Complexity of Ferromagnetic Two-spin Systems with External Fields cs.CC · 2014 · author #2
  26. Optimal Competitive Auctions cs.GT · 2014 · author #3
  27. FPTAS for Counting Monotone CNF cs.DS · 2013 · author #2
  28. A Simple FPTAS for Counting Edge Covers cs.DS · 2013 · author #3
  29. The complexity of approximating conservative counting CSPs cs.CC · 2012 · author #5
  30. Dichotomy for Holant* Problems with a Function on Domain Size 3 cs.CC · 2012 · author #2
  31. Inapproximability After Uniqueness Phase Transition in Two-Spin Systems cs.CC · 2012 · author #4
  32. Budget Feasible Mechanism Design: From Prior-Free to Bayesian cs.GT · 2012 · author #4
  33. Approximate Counting via Correlation Decay in Spin Systems cs.DS · 2011 · author #2
  34. Competitive Auctions for Markets with Positive Externalities cs.GT · 2011 · author #2
  35. Budget Feasible Mechanism Design via Random Sampling cs.GT · 2011 · author #4
  36. Mechanism Design without Money via Stable Matching cs.GT · 2011 · author #3
  37. Non-negative Weighted #CSPs: An Effective Complexity Dichotomy cs.CC · 2010 · author #3
  38. Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP cs.CC · 2010 · author #2
  39. On the Approximability of Budget Feasible Mechanisms cs.GT · 2010 · author #3
  40. Optimal Pricing in Social Networks with Incomplete Information cs.GT · 2010 · author #2
  41. On Tractable Exponential Sums cs.CC · 2010 · author #4
  42. From Holant To #CSP And Back: Dichotomy For Holant$^c$ Problems cs.CC · 2010 · author #3
  43. Graph Homomorphisms with Complex Values: A Dichotomy Theorem cs.CC · 2009 · author #3
  44. An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines cs.DS · 2008 · author #1
  45. A Family of Counter Examples to an Approach to Graph Isomorphism cs.CC · 2008 · author #2

Mentions

  • 1309.6115 #3 · backfill · confidence 0.70 Pinyan Lu
  • 2602.05725 #4 · arxiv_oai · confidence 0.70 Pinyan Lu
  • 1208.1783 #5 · backfill · confidence 0.70 Pinyan Lu
  • 1207.2354 #2 · backfill · confidence 0.70 Pinyan Lu
  • 1205.2934 #4 · backfill · confidence 0.70 Pinyan Lu
  • 1203.4455 #4 · backfill · confidence 0.70 Pinyan Lu
  • 1109.0604 #2 · backfill · confidence 0.70 Pinyan Lu
  • 1107.5221 #2 · backfill · confidence 0.70 Pinyan Lu
  • 1107.2994 #4 · backfill · confidence 0.70 Pinyan Lu
  • 1104.2872 #3 · backfill · confidence 0.70 Pinyan Lu
  • 2504.04349 #3 · arxiv_oai · confidence 0.70 Pinyan Lu
  • 2605.18022 #2 · arxiv_oai · confidence 0.70 Pinyan Lu
  • 1012.5659 #3 · backfill · confidence 0.70 Pinyan Lu
  • 1008.0683 #2 · backfill · confidence 0.70 Pinyan Lu
  • 1007.3801 #3 · backfill · confidence 0.70 Pinyan Lu
  • 1007.1501 #2 · backfill · confidence 0.70 Pinyan Lu
  • 1005.2632 #4 · backfill · confidence 0.70 Pinyan Lu
  • 1004.0803 #3 · backfill · confidence 0.70 Pinyan Lu
  • 0903.4728 #3 · backfill · confidence 0.70 Pinyan Lu
  • 0802.2851 #1 · backfill · confidence 0.70 Pinyan Lu
  • 0801.1766 #2 · backfill · confidence 0.70 Pinyan Lu

Frequent Coauthors