pith. sign in

Hung Le

Identifiers

  • name variant Hung Le 0.60 · backfill

Papers (31)

  1. Eigenvectors of Experts are Training-free Non-collapsing Routers cs.LG · 2026 · author #2
  2. Uncertainty-Aware Budget Allocation for Adaptive Test-Time Reasoning cs.CL · 2026 · author #3
  3. Reviving Error Correction in Modern Deep Time-Series Forecasting cs.LG · 2026 · author #6
  4. Continual Fine-Tuning of Large Language Models via Program Memory cs.LG · 2026 · author #1
  5. Charting the Diameter Computation Landscape on Intersection Graphs in the Plane cs.CG · 2026 · author #5
  6. A Separator for Minor-Free Graphs Beyond the Flow Barrier cs.DS · 2026 · author #1
  7. Beyond Majority Voting: Efficient Best-Of-N with Radial Consensus Score cs.CL · 2026 · author #3
  8. Coarse Balanced Separators in Fat-Minor-Free Graphs math.CO · 2026 · author #2
  9. Do Domain-specific Experts exist in MoE-based LLMs? cs.CL · 2026 · author #2
  10. Hear Both Sides: Efficient Multi-Agent Debate via Diversity-Aware Message Retention cs.CL · 2026 · author #5
  11. Distance Is All You Need: Radial Dispersion for Uncertainty Estimation in Large Language Models cs.LG · 2025 · author #3
  12. Empowering Multi-Turn Tool-Integrated Agentic Reasoning with Group Turn Policy Optimization cs.LG · 2025 · author #2
  13. SPaCe: Unlocking Sample-Efficient Large Language Models Training With Self-Pace Curriculum Learning cs.LG · 2025 · author #4
  14. Rethinking Sparse Mixture of Experts from a Unified Perspective cs.CL · 2025 · author #2
  15. CodeT5+: Open Code Large Language Models for Code Understanding and Generation cs.CL · 2023 · author #2
  16. Learning to Remember More with Less Memorization cs.LG · 2019 · author #1
  17. On the existence and instability of solitary water waves with a finite dipole math.AP · 2018 · author #1
  18. Variational Memory Encoder-Decoder cs.CL · 2018 · author #1
  19. Designing Practical PTASes for Minimum Feedback Vertex Set in Planar Graphs cs.DS · 2018 · author #2
  20. Local Search is a PTAS for Feedback Vertex Set in Minor-free Graphs cs.DS · 2018 · author #1
  21. Dual Control Memory Augmented Neural Networks for Treatment Recommendations cs.LG · 2018 · author #1
  22. URLNet: Learning a URL Representation with Deep Learning for Malicious URL Detection cs.CR · 2018 · author #1
  23. Dual Memory Neural Computer for Asynchronous Two-view Sequential Learning cs.LG · 2018 · author #1
  24. Greedy spanners are optimal in doubling metrics cs.CG · 2017 · author #2
  25. Minor-free graphs have light spanners cs.DS · 2017 · author #2
  26. Elliptic equations with transmission and Wentzell boundary conditions and an application to steady water waves in the presence of wind math.AP · 2017 · author #1
  27. What are the Receptive, Effective Receptive, and Projective Fields of Neurons in Convolutional Neural Networks? cs.CV · 2017 · author #1
  28. Light spanners for bounded treewidth graphs imply light spanners for $H$-minor-free graphs cs.DS · 2017 · author #2
  29. Embedded-width: A variant of treewidth for plane graphs cs.DM · 2017 · author #3
  30. A better bound on the largest induced forests in triangle-free planar graphs math.CO · 2016 · author #1
  31. Optimal dynamic program for r-domination problems over tree decompositions cs.DS · 2015 · author #2

Mentions

  • 1502.00716 #2 · backfill · confidence 0.70 Hung Le
  • 2605.30992 #2 · arxiv_oai · confidence 0.70 Hung Le
  • 2503.22996 #2 · arxiv_oai · confidence 0.70 Hung Le
  • 2605.26849 #3 · arxiv_oai · confidence 0.70 Hung Le
  • 2605.21088 #6 · arxiv_oai · confidence 0.70 Hung Le
  • 2305.07922 #2 · arxiv_oai · confidence 0.70 Hung Le

Frequent Coauthors