Undergrad and PhD student @PKU1898 LLM Agent | AI4Science | Generative Models | Continual Learning. Intern @ Tencent Hy agent team

Beijing, China
Joined May 2023
Excited to release Hyra! It’s been less than 3 months since I joined Hunyuan. We turned Hyra into reality in a short time. kudos to great colead @chengjiale4 and great boss @ShunyuYao12 and great Hyra team. Looking forward to seeing Hyra optimize Hy models and Tencent products!
Introducing Hyra-1.0, the first version of Hunyuan Research Agent. 💡💡💡 Built to recursively improve solutions for performance-driven research and engineering tasks. Explore our demos in AI4AI, AI4Science, and AI4Fun: hy.tencent.com/research/hyra
2
2
56
312,932
Haowei Lin retweeted
Robotics has spent years scaling demonstration data and model size. What happens when we scale EXPLORATION for robot agents? We're incredibly excited to share RAX, an agentic robotics system that learns by scaling online exploration. A coding agent connects directly to the robot’s perception and control APIs, learns from feedback, and builds programs that perceive, plan, and act. The model stays frozen. As exploration scales, the agent improves its programs and builds up reusable skills. The results: • ZERO teleoperation or action demonstrations on real robots—from insertion with 0.1 mm clearance and air-fryer manipulation to deformable objects and long-horizon mobile whole-body control. • +37 percentage points on average over leading learned policies across five simulation benchmarks: RoboDojo, BEHAVIOR-1K, HumanoidArena, DexJoCo’s bimanual tasks, and LIBERO-Pro. • One framework spanning single-arm, bimanual, dexterous, humanoid, and mobile robots, with new embodiments connected through APIs. The craziest part: on each real-world embodiment, going from scratch to mastering the tasks took roughly two hours. No teleop. No model finetuning. We’re open-sourcing the full framework AND every experiment session. We can’t wait to see what people build with it! Project + sessions: robot-agent-exploration.com/ Paper: assets.robot-agent-explorati… GitHub: N Project fully led by @RunhanH and @xczhangxx who are absolutely awesome. How it works, experiments, and robot videos below 🧵 (1/N)
36
105
32
573
70,235
So happy to have this paper accepted!
Harbor Adapters and Harbor-Index (previously named as harbor-mix) accepted at NeurIPS E&D! Congrats and special thanks to all of our contributors, advisors, and funding partners!
1
15
1,526
Haowei Lin retweeted
Harbor Adapters and Harbor-Index arxiv.org/pdf/2609.04298 1+year work, 120+contributors, 300+PRs, 10+ funding partners.
1
41
14
182
31,237
Some interesting math results just dropped... though not entirely surprising, given the current surge in math discoveries.
Hyra keeps pushing the frontier. Since our last math update, four more advances have landed: 📐 3D Blaschke–Lebesgue: raised the universal lower bound for constant-width bodies from 0.380799w³ → 0.411040w³ (now 97.9% of the conjectured Meissner optimum). ∫ Beurling–Ahlfors: improved the best uniform (L^p) coefficient from 1.575 → 1.523958, moving closer to Iwaniec’s conjectured sharp bound. ± Partial Hadamard matrices: extended asymptotic counting from the cubic scale down to the near-quadratic regime. [,] Operator commutators: improved the cost of approximating the identity from Tao’s O(log⁵(1/ε)) to O(log³), narrowing the gap toward the known logarithmic lower bound. We are making open-source models better at solving open problems! Check the results: github.com/Tencent-Hunyuan/h…
8
710
Haowei Lin retweeted
Hyra keeps pushing the frontier. Since our last math update, four more advances have landed: 📐 3D Blaschke–Lebesgue: raised the universal lower bound for constant-width bodies from 0.380799w³ → 0.411040w³ (now 97.9% of the conjectured Meissner optimum). ∫ Beurling–Ahlfors: improved the best uniform (L^p) coefficient from 1.575 → 1.523958, moving closer to Iwaniec’s conjectured sharp bound. ± Partial Hadamard matrices: extended asymptotic counting from the cubic scale down to the near-quadratic regime. [,] Operator commutators: improved the cost of approximating the identity from Tao’s O(log⁵(1/ε)) to O(log³), narrowing the gap toward the known logarithmic lower bound. We are making open-source models better at solving open problems! Check the results: github.com/Tencent-Hunyuan/h…
5
7
2
157
22,465
Haowei Lin retweeted
This is a nice simple construction, which answers a natural question. The exposition is more complicated than it needs to be (especially for an expert in the area), so I wrote a short note giving my 'digestion' of this construction. thomasbloom.org/notes/sumdif…
For a finite set of integers (A), how much faster can (|A+A|) grow than (|A-A|)? A 1969 theorem gave an upper bound of 2 for the exponent. For more than 50 years, the best constructions barely exceeded 1.1. With help from our research agent Hyra and the Hy3 model, we found an explicit construction showing that the optimal exponent is exactly 2. A 50-year-old problem, solved. Paper: arxiv.org/abs/2607.27199 Hyra blog: hy.tencent.ai/research/hyra Formal proof: github.com/linhaowei1/sum-di…
3
7
97
10,681
This is insane. This is a VERY central problem in additive combinatorics and it’s been resolved via AI… wow
For a finite set of integers (A), how much faster can (|A+A|) grow than (|A-A|)? A 1969 theorem gave an upper bound of 2 for the exponent. For more than 50 years, the best constructions barely exceeded 1.1. With help from our research agent Hyra and the Hy3 model, we found an explicit construction showing that the optimal exponent is exactly 2. A 50-year-old problem, solved. Paper: arxiv.org/abs/2607.27199 Hyra blog: hy.tencent.ai/research/hyra Formal proof: github.com/linhaowei1/sum-di…
8
37
5
824
116,298
I and @AndyLin2001 used 𝐇𝐲𝟑 to settle a combinatorics problem that had been open for half a century. This isn't just one more AI-generated mathematical discovery -- it's a "Eureka moment" for an 𝐨𝐩𝐞𝐧-𝐰𝐞𝐢𝐠𝐡𝐭𝐬 𝐦𝐨𝐝𝐞𝐥. How much larger can the sumset of a set of integers be than its difference set? A classical result from 1969 showed that the exponent governing this gap is at most 2. But whether this bound was optimal remained open. More recently, Terence Tao and others explored AI-assisted approaches to improve the lower bound, but the results remained around 1.1. Then 𝐇𝐲𝟑 produced an elegant construction achieving a lower bound of 2 -- matching the upper bound and completely resolving the problem.
For a finite set of integers (A), how much faster can (|A+A|) grow than (|A-A|)? A 1969 theorem gave an upper bound of 2 for the exponent. For more than 50 years, the best constructions barely exceeded 1.1. With help from our research agent Hyra and the Hy3 model, we found an explicit construction showing that the optimal exponent is exactly 2. A 50-year-old problem, solved. Paper: arxiv.org/abs/2607.27199 Hyra blog: hy.tencent.ai/research/hyra Formal proof: github.com/linhaowei1/sum-di…
3
12
3
101
18,189
A 50-year-old math problem, solved with the help of Hyra and Hy3. Huge credit to @AndyLin2001, who led this result, and to the whole team. Excited to be co-leading Hyra as we build AI4AI and AI4Science. We’re just getting started—and we’re hiring. Reach out if this mission resonates.
For a finite set of integers (A), how much faster can (|A+A|) grow than (|A-A|)? A 1969 theorem gave an upper bound of 2 for the exponent. For more than 50 years, the best constructions barely exceeded 1.1. With help from our research agent Hyra and the Hy3 model, we found an explicit construction showing that the optimal exponent is exactly 2. A 50-year-old problem, solved. Paper: arxiv.org/abs/2607.27199 Hyra blog: hy.tencent.ai/research/hyra Formal proof: github.com/linhaowei1/sum-di…
3
7
1,046
No, it's fine that a Chinese system has caught a mathematical result, I just… just didn't expect it to be Tencent. Using Sol as a judge is also unfortunate.
For a finite set of integers (A), how much faster can (|A+A|) grow than (|A-A|)? A 1969 theorem gave an upper bound of 2 for the exponent. For more than 50 years, the best constructions barely exceeded 1.1. With help from our research agent Hyra and the Hy3 model, we found an explicit construction showing that the optimal exponent is exactly 2. A 50-year-old problem, solved. Paper: arxiv.org/abs/2607.27199 Hyra blog: hy.tencent.ai/research/hyra Formal proof: github.com/linhaowei1/sum-di…
1
4
71
9,284
Join us in pushing the boundaries of AI4S! We are building Hyra, our research agent harness, and advancing the research capabilities of the next-generation Hy model. Our team brings together frontier AI research and rigorous, production-grade model development: turning cutting-edge ideas into reliable, real-world systems. Come work with us and help shape the future of scientific discovery.
Hy ai4s is hiring :)
2
5
540
200B opensourced Hy3! 50+ yrs open problem solved!
For a finite set of integers (A), how much faster can (|A+A|) grow than (|A-A|)? A 1969 theorem gave an upper bound of 2 for the exponent. For more than 50 years, the best constructions barely exceeded 1.1. With help from our research agent Hyra and the Hy3 model, we found an explicit construction showing that the optimal exponent is exactly 2. A 50-year-old problem, solved. Paper: arxiv.org/abs/2607.27199 Hyra blog: hy.tencent.ai/research/hyra Formal proof: github.com/linhaowei1/sum-di…
4
24
2,681
Excited to contribute one music task and review several tasks for fb (tb3)! Hope to see stronger models achieve 80%+ in one year...
We’re releasing Frontier-Bench: a benchmark that measures and evolves with the frontier of agent work. Built by the team behind Terminal-Bench and Harbor, Frontier-Bench is an on-going community effort. Frontier-Bench v0.1 contains 74 tasks on which the best agents score ~34%
4
238
Haowei Lin retweeted
Introducing Hyra-1.0, the first version of Hunyuan Research Agent. 💡💡💡 Built to recursively improve solutions for performance-driven research and engineering tasks. Explore our demos in AI4AI, AI4Science, and AI4Fun: hy.tencent.com/research/hyra
21
94
18
874
444,787
Harbor-Index is now live! Many thanks to our collaborators and funding partners. Come join us and push the frontier of LLMs and agents.
Introducing Harbor-Index, a compact, diverse, and high-quality benchmark built to challenge frontier agents. We carefully select, audit and fix 82 high-signal tasks out of 6,627 candidates spanning 54 benchmarks. No agent gets above 30%. (1/5)
1
4
490
Haowei Lin retweeted
HPC-AI is heading to #ICML2026! 🚀 Looking for top-tier compute efficiency or building the next generation of AI Agents? We’ve got you covered! Stop by Booth B301 to talk cutting-edge technology, supercharge your projects, and grab awesome perks! 🎁 Exclusive ICML Swag & Perks: 📱 Interact & Win: Engage with this post to grab our custom caps & eco-friendly canvas bags for FREE! 🧢💼 📝 1-Min Survey: Complete a quick questionnaire and claim your exclusive ICML badges & tech stickers! 🧲✨ 🔋 Top-up Bonus: Top up your account during ICML and take home a premium Bluetooth speaker! 🔊 📝 Accepted Author Special: Got a paper at ICML? Unlock our Author Incentive Program to get exclusive vouchers for GPU compute and Model APIs! 🎓💡 ⚡ Why Choose HPC-AI? 1️⃣ GPU Cloud Compute | High Performance & Elasticity - Full-Spectrum GPU Coverage: From H200 to B200, we provide top-tier GPUs for training, fine-tuning, and inference. - Flexible & Cost-Effective: Pay-as-you-go billing with ultimate price-to-performance ratio. - Stable & Ready-to-Use: Instant deployment, elastic scaling, and enterprise-grade reliability for both corporate R&D and academic research. 2️⃣ Model APIs | One-Click Access to Frontier LLMs - Mainstream Models Covered: Seamlessly access DeepSeek, GLM, Kimi, MiMo, and more, with continuous updates. - High-Performance Inference: Built on enterprise GPU infrastructure, ensuring accelerated inference and high availability for massive workloads. - Seamless Ecosystem Integration: Compatible with 40+ mainstream AI frameworks and tools (Dify, Cursor, Open Claw, Open Code, etc.). Connect in 3 easy steps! 📍 Booth B301 📅 July 7-10 🏢 ICML Conference (Korea Seoul) #ICML2026 #HPCAI #MachineLearning #DeepLearning #GPU #ModelAPIs #LLM #AICompute
7
134
165
2,748
📣 Announcing Terminal-Bench Science: benchmarking AI agents on real scientific workflows – now open for task contributions👇 tbench.ai/news/tb-science-an… @AnthropicAI, @OpenAI, and @GoogleDeepMind use Terminal-Bench to evaluate AI on coding tasks. We're now extending it to scientific workflows. 1/6🧵
16
105
30
507
916,701