Video wird geladen...

Video konnte nicht geladen werden

Beim Laden dieses Videos ist ein Problem aufgetreten. Dies könnte an einem vorübergehenden Netzwerkproblem liegen oder das Video ist möglicherweise nicht verfügbar.

"Building Rome with Convex Optimization" has been accepted to #RSS2025! Try XM, our new structure from motion pipeline powered by GPU-accelerated convex semidefinite optimization: XM solves large-scale (nonconvex) global bundle adjustment problem via learned depth and a tight convex semidefinite relaxation. By implementing the Burer-Monteiro low-rank factorization algorithm in... show more

Heng Yang

5,001 subscribers

27,486 Aufrufe • vor 1 Jahr •via X (Twitter)

Wissenschaft & Technologie Nachrichten & Politik Bildung #RSS2025

Anya Rossi• Live Now

Private livecam show

2 Kommentare

Profilbild von Frank Dellaert

Frank Dellaertvor 1 Jahr

Wow!

Profilbild von Rainmaker

Rainmakervor 2 Jahren

Here I share an XGBoost model that delivers a 25% CAGR with minimal drawdown on Visa stock. In this free Substack post I share code and commentary for a powerful Machine Learning strategy that delivers powerful returns.

Ähnliche Videos

Video2Humanoid. Still trouble with bad retargeted humanoid motions? Humanoids now are Easy to track any video using our new Neural Motion Retargeting (NMR) Method. Optimization-based motion retargeting methods like IK and GMR are solving a non-convex problem frame by frame, which makes them sensitive to initialization, hard to tune, and prone to poor local minima. The result is familiar: joint discontinuities, self-collisions, and unstable foot contact. Our solution is simple but effective : instead of optimizing each frame independently, learn the mapping between human motion and robot motion as a distribution via networks. 📊Results on Unitree G1 - 0 joint jumps - 54% fewer self-collision frames - 61% fewer joint limit violations - Faster convergence for downstream control policy training NMR turns motion retargeting from a fragile optimization problem into a learned, scalable pipeline for more stable humanoid motion. please visit for more visualization results. opensource:

Video2Humanoid. Still trouble with bad retargeted humanoid motions? Humanoids now are Easy to track any video using our new Neural Motion Retargeting (NMR) Method. Optimization-based motion retargeting methods like IK and GMR are solving a non-convex problem frame by frame, which makes them sensitive to initialization, hard to tune, and prone to poor local minima. The result is familiar: joint discontinuities, self-collisions, and unstable foot contact. Our solution is simple but effective : instead of optimizing each frame independently, learn the mapping between human motion and robot motion as a distribution via networks. 📊Results on Unitree G1 - 0 joint jumps - 54% fewer self-collision frames - 61% fewer joint limit violations - Faster convergence for downstream control policy training NMR turns motion retargeting from a fragile optimization problem into a learned, scalable pipeline for more stable humanoid motion. please visit for more visualization results. opensource:

Xiao-Xiao Long

24,193 Aufrufe • vor 4 Monaten

Progressively Optimized Local Radiance Fields for Robust View Synthesis paper page: present an algorithm for reconstructing the radiance field of a large-scale scene from a single casually captured video. The task poses two core challenges. First, most existing radiance field reconstruction approaches rely on accurate pre-estimated camera poses from Structure-from-Motion algorithms, which frequently fail on in-the-wild videos. Second, using a single, global radiance field with finite representational capacity does not scale to longer trajectories in an unbounded scene. For handling unknown poses, we jointly estimate the camera poses with radiance field in a progressive manner. We show that progressive optimization significantly improves the robustness of the reconstruction. For handling large unbounded scenes, we dynamically allocate new local radiance fields trained with frames within a temporal window. This further improves robustness (e.g., performs well even under moderate pose drifts) and allows us to scale to large scenes. Our extensive evaluation on the Tanks and Temples dataset and our collected outdoor dataset, Static Hikes, show that our approach compares favorably with the state-of-the-art.

Progressively Optimized Local Radiance Fields for Robust View Synthesis paper page: present an algorithm for reconstructing the radiance field of a large-scale scene from a single casually captured video. The task poses two core challenges. First, most existing radiance field reconstruction approaches rely on accurate pre-estimated camera poses from Structure-from-Motion algorithms, which frequently fail on in-the-wild videos. Second, using a single, global radiance field with finite representational capacity does not scale to longer trajectories in an unbounded scene. For handling unknown poses, we jointly estimate the camera poses with radiance field in a progressive manner. We show that progressive optimization significantly improves the robustness of the reconstruction. For handling large unbounded scenes, we dynamically allocate new local radiance fields trained with frames within a temporal window. This further improves robustness (e.g., performs well even under moderate pose drifts) and allows us to scale to large scenes. Our extensive evaluation on the Tanks and Temples dataset and our collected outdoor dataset, Static Hikes, show that our approach compares favorably with the state-of-the-art.

AK

140,624 Aufrufe • vor 3 Jahren

Glad that our work “Inference-Time Enhancement of Generative Robot Policies via Predictive World Modeling”, led by Han Qi, has been accepted to IEEE Robotics and Automation Letters! 🎉 We propose Generative Predictive Control (GPC): sample action proposals from a pretrained diffusion policy (“look back”), roll them out with a diffusion-based action-conditioned video world model (“look forward”), then rank or optimize the actions using either a learned reward model or VLM preferences. Conceptually, this is trajectory optimization / MPC with hybrid sampling + gradient optimization, interpreted through modern diffusion priors and video world models. Interestingly, we first posted the paper on arXiv in Feb 2025, when action-conditioned video world models for planning were still rare—now this direction is rapidly gaining traction. Still many open questions, e.g., • how to avoid local minima in planning • what representations work best for world models • how to balance physics priors vs. data-driven learning Paper:

Glad that our work “Inference-Time Enhancement of Generative Robot Policies via Predictive World Modeling”, led by Han Qi, has been accepted to IEEE Robotics and Automation Letters! 🎉 We propose Generative Predictive Control (GPC): sample action proposals from a pretrained diffusion policy (“look back”), roll them out with a diffusion-based action-conditioned video world model (“look forward”), then rank or optimize the actions using either a learned reward model or VLM preferences. Conceptually, this is trajectory optimization / MPC with hybrid sampling + gradient optimization, interpreted through modern diffusion priors and video world models. Interestingly, we first posted the paper on arXiv in Feb 2025, when action-conditioned video world models for planning were still rare—now this direction is rapidly gaining traction. Still many open questions, e.g., • how to avoid local minima in planning • what representations work best for world models • how to balance physics priors vs. data-driven learning Paper:

Heng Yang

18,994 Aufrufe • vor 5 Monaten

PointOdyssey: A Large-Scale Synthetic Dataset for Long-Term Point Tracking paper page: introduce PointOdyssey, a large-scale synthetic dataset, and data generation framework, for the training and evaluation of long-term fine-grained tracking algorithms. Our goal is to advance the state-of-the-art by placing emphasis on long videos with naturalistic motion. Toward the goal of naturalism, we animate deformable characters using real-world motion capture data, we build 3D scenes to match the motion capture environments, and we render camera viewpoints using trajectories mined via structure-from-motion on real videos. We create combinatorial diversity by randomizing character appearance, motion profiles, materials, lighting, 3D assets, and atmospheric effects. Our dataset currently includes 104 videos, averaging 2,000 frames long, with orders of magnitude more correspondence annotations than prior work. We show that existing methods can be trained from scratch in our dataset and outperform the published variants. Finally, we introduce modifications to the PIPs point tracking method, greatly widening its temporal receptive field, which improves its performance on PointOdyssey as well as on two real-world benchmarks.

PointOdyssey: A Large-Scale Synthetic Dataset for Long-Term Point Tracking paper page: introduce PointOdyssey, a large-scale synthetic dataset, and data generation framework, for the training and evaluation of long-term fine-grained tracking algorithms. Our goal is to advance the state-of-the-art by placing emphasis on long videos with naturalistic motion. Toward the goal of naturalism, we animate deformable characters using real-world motion capture data, we build 3D scenes to match the motion capture environments, and we render camera viewpoints using trajectories mined via structure-from-motion on real videos. We create combinatorial diversity by randomizing character appearance, motion profiles, materials, lighting, 3D assets, and atmospheric effects. Our dataset currently includes 104 videos, averaging 2,000 frames long, with orders of magnitude more correspondence annotations than prior work. We show that existing methods can be trained from scratch in our dataset and outperform the published variants. Finally, we introduce modifications to the PIPs point tracking method, greatly widening its temporal receptive field, which improves its performance on PointOdyssey as well as on two real-world benchmarks.

AK

122,560 Aufrufe • vor 3 Jahren

Can reinforcement learning from AI feedback unlock new capabilities in AI agents? Introducing Motif, an LLM-powered method for intrinsic motivation from AI feedback. Motif extracts reward functions from Llama 2's preferences and uses them to train agents with reinforcement learning. On the complex NetHack game, Motif solves previously unsolved tasks without needing any expert demonstrations. Surprisingly, Motif's reward leads to better game score than the one obtained by using the score itself as a reward. Given access to an event captioning mechanism, a few properties make Motif a general method: • it is entirely based on open models • the LLM doesn't need direct access to the environment dynamics (e.g., its source code) • the LLM doesn't need to understand observation and action spaces The best part? You can start using Motif right now, even on a small compute budget: the whole pipeline can take less than two GPU-days. Feel free to read our paper and try our code out. Paper: Code: Blog post: Work co-lead by Martin Klissarov and myself, with Shagun Sodhani Roberta Raileanu Pierre-Luc Bacon Pascal Vincent Amy Zhang Mikael Henaff Learn more in the thread 🧵

Can reinforcement learning from AI feedback unlock new capabilities in AI agents? Introducing Motif, an LLM-powered method for intrinsic motivation from AI feedback. Motif extracts reward functions from Llama 2's preferences and uses them to train agents with reinforcement learning. On the complex NetHack game, Motif solves previously unsolved tasks without needing any expert demonstrations. Surprisingly, Motif's reward leads to better game score than the one obtained by using the score itself as a reward. Given access to an event captioning mechanism, a few properties make Motif a general method: • it is entirely based on open models • the LLM doesn't need direct access to the environment dynamics (e.g., its source code) • the LLM doesn't need to understand observation and action spaces The best part? You can start using Motif right now, even on a small compute budget: the whole pipeline can take less than two GPU-days. Feel free to read our paper and try our code out. Paper: Code: Blog post: Work co-lead by Martin Klissarov and myself, with Shagun Sodhani Roberta Raileanu Pierre-Luc Bacon Pascal Vincent Amy Zhang Mikael Henaff Learn more in the thread 🧵

Pierluca D'Oro

311,920 Aufrufe • vor 2 Jahren

Another city. Another full 3D Gaussian Splat reconstruction. This entire neighborhood was captured while walking with an Insta360 X5, then processed with our GPU pipeline and transformed into a high-fidelity, machine-readable 3D environment with Over the Reality. What you’re seeing is not an isolated virtual world. It’s a 3D digital twin of a real-world location, built from structured spatial data where every building, street, and detail can become usable by AI, robotics, and XR. And it’s happening at scale, across cities in more than 180 countries every day. Have an Insta360 X5 and want to become a mapper? Apply here: Want to build a 3D Gaussian Splat from a video you already recorded? Do it for free at powered by Over the Reality.

Another city. Another full 3D Gaussian Splat reconstruction. This entire neighborhood was captured while walking with an Insta360 X5, then processed with our GPU pipeline and transformed into a high-fidelity, machine-readable 3D environment with Over the Reality. What you’re seeing is not an isolated virtual world. It’s a 3D digital twin of a real-world location, built from structured spatial data where every building, street, and detail can become usable by AI, robotics, and XR. And it’s happening at scale, across cities in more than 180 countries every day. Have an Insta360 X5 and want to become a mapper? Apply here: Want to build a 3D Gaussian Splat from a video you already recorded? Do it for free at powered by Over the Reality.

Over the Reality 🌐

400,097 Aufrufe • vor 3 Monaten

Can vision-language-action (VLA) models generalize to diverse OOD tasks and align with customized objectives? 🤔 🚀 We introduce GRAPE, a plug-and-play algorithm to generalize robot policies via preference alignment. GRAPE unfolds three benefits to boost the generalizability of VLAs: 👉1. GRAPE aligns VLAs on a trajectory level and endows the model with the ability for global decision-making, instead of merely cloning behavior; 👉2. GRAPE implicitly models reward from both successful and failed trials to boost generalizability to diverse tasks; 👉3. GRAPE adopts a scalable preference synthesis algorithm to rank trajectories with preferences that align with arbitrary objectives. Our experiments on a diverse array of real-world and simulated robotic tasks reveal: 1⃣GRAPE enhances the performance of state-of-the-art VLA models, increasing success rates on in-domain and unseen manipulation tasks by 51.79% and 60.36%; 2⃣GRAPE is versatile to be aligned with diverse objectives and reduce collision rates by 44.31% or rollout length by 11.15% when aligning towards safer or more efficient manipulation policy, respectively. Check out our full project for more details: 🔥 Paper: 🔥 Project: 🔥 Code:

Can vision-language-action (VLA) models generalize to diverse OOD tasks and align with customized objectives? 🤔 🚀 We introduce GRAPE, a plug-and-play algorithm to generalize robot policies via preference alignment. GRAPE unfolds three benefits to boost the generalizability of VLAs: 👉1. GRAPE aligns VLAs on a trajectory level and endows the model with the ability for global decision-making, instead of merely cloning behavior; 👉2. GRAPE implicitly models reward from both successful and failed trials to boost generalizability to diverse tasks; 👉3. GRAPE adopts a scalable preference synthesis algorithm to rank trajectories with preferences that align with arbitrary objectives. Our experiments on a diverse array of real-world and simulated robotic tasks reveal: 1⃣GRAPE enhances the performance of state-of-the-art VLA models, increasing success rates on in-domain and unseen manipulation tasks by 51.79% and 60.36%; 2⃣GRAPE is versatile to be aligned with diverse objectives and reduce collision rates by 44.31% or rollout length by 11.15% when aligning towards safer or more efficient manipulation policy, respectively. Check out our full project for more details: 🔥 Paper: 🔥 Project: 🔥 Code:

Huaxiu Yao

19,988 Aufrufe • vor 1 Jahr

Introducing "Building with Llama 4." This short course is created with Meta AI at Meta, and taught by Amit Sangani, Director of Partner Engineering for Meta’s AI team. Meta’s new Llama 4 has added three new models and introduced the Mixture-of-Experts (MoE) architecture to its family of open-weight models, making them more efficient to serve. In this course, you’ll work with two of the three new models introduced in Llama 4. First is Maverick, a 400B parameter model, with 128 experts and 17B active parameters. Second is Scout, a 109B parameter model with 16 experts and 17B active parameters. Maverick and Scout support long context windows of up to a million tokens and 10M tokens, respectively. The latter is enough to support directly inputting even fairly large GitHub repos for analysis! In hands-on lessons, you’ll build apps using Llama 4’s new multimodal capabilities including reasoning across multiple images and image grounding, in which you can identify elements in images. You’ll also use the official Llama API, work with Llama 4’s long-context abilities, and learn about Llama’s newest open-source tools: its prompt optimization tool that automatically improves system prompts and synthetic data kit that generates high-quality datasets for fine-tuning. If you need an open model, Llama is a great option, and the Llama 4 family is an important part of any GenAI developer's toolkit. Through this course, you’ll learn to call Llama 4 via API, use its optimization tools, and build features that span text, images, and large context. Please sign up here:

Introducing "Building with Llama 4." This short course is created with Meta AI at Meta, and taught by Amit Sangani, Director of Partner Engineering for Meta’s AI team. Meta’s new Llama 4 has added three new models and introduced the Mixture-of-Experts (MoE) architecture to its family of open-weight models, making them more efficient to serve. In this course, you’ll work with two of the three new models introduced in Llama 4. First is Maverick, a 400B parameter model, with 128 experts and 17B active parameters. Second is Scout, a 109B parameter model with 16 experts and 17B active parameters. Maverick and Scout support long context windows of up to a million tokens and 10M tokens, respectively. The latter is enough to support directly inputting even fairly large GitHub repos for analysis! In hands-on lessons, you’ll build apps using Llama 4’s new multimodal capabilities including reasoning across multiple images and image grounding, in which you can identify elements in images. You’ll also use the official Llama API, work with Llama 4’s long-context abilities, and learn about Llama’s newest open-source tools: its prompt optimization tool that automatically improves system prompts and synthetic data kit that generates high-quality datasets for fine-tuning. If you need an open model, Llama is a great option, and the Llama 4 family is an important part of any GenAI developer's toolkit. Through this course, you’ll learn to call Llama 4 via API, use its optimization tools, and build features that span text, images, and large context. Please sign up here:

Andrew Ng

67,846 Aufrufe • vor 1 Jahr

Check out our #ICRA2024 paper "Actor-Critic Model Predictive Control." Model-free #reinforcementlearning (RL) is known for its strong task performance and flexibility in optimizing general reward formulations. On the other hand, #ModelPredictiveControl (MPC) benefits from robustness and online replanning capabilities. We combine both approaches by introducing a new framework called Actor-Critic Model Predictive Control. The key idea is to embed a differentiable MPC within an Actor-Critic RL framework. The proposed approach leverages the short-term predictive optimization capabilities of MPC with the exploratory and end-to-end training properties of RL. The resulting policy effectively manages both short-term decisions through the MPC-based actor and long-term prediction via the critic network, unifying the benefits of both model-based control and end-to-end learning. We validate our method in simulation and the real world with a quadcopter across various high-level tasks. We show that the proposed architecture can achieve real-time control performance, learn complex behaviors via trial and error, and retain the predictive properties of the MPC to better handle out-of-distribution behavior. Paper: Full Video with more details: Kudos to Ángel Romero, Yunlong Song IEEE ICRA University of Zurich UZH Science UZH Space Hub Aerial Core AUTOASSESS European Research Council (ERC)

Check out our #ICRA2024 paper "Actor-Critic Model Predictive Control." Model-free #reinforcementlearning (RL) is known for its strong task performance and flexibility in optimizing general reward formulations. On the other hand, #ModelPredictiveControl (MPC) benefits from robustness and online replanning capabilities. We combine both approaches by introducing a new framework called Actor-Critic Model Predictive Control. The key idea is to embed a differentiable MPC within an Actor-Critic RL framework. The proposed approach leverages the short-term predictive optimization capabilities of MPC with the exploratory and end-to-end training properties of RL. The resulting policy effectively manages both short-term decisions through the MPC-based actor and long-term prediction via the critic network, unifying the benefits of both model-based control and end-to-end learning. We validate our method in simulation and the real world with a quadcopter across various high-level tasks. We show that the proposed architecture can achieve real-time control performance, learn complex behaviors via trial and error, and retain the predictive properties of the MPC to better handle out-of-distribution behavior. Paper: Full Video with more details: Kudos to Ángel Romero, Yunlong Song IEEE ICRA University of Zurich UZH Science UZH Space Hub Aerial Core AUTOASSESS European Research Council (ERC)

Davide Scaramuzza

34,889 Aufrufe • vor 2 Jahren

I see lots of people launching projects where their agents weigh and interact with information they are provided with via X through their X accounts. I've been experimenting with agent function and for long before it was popular on X, so, it had been made very clear to me long before that such automations and their functions are nothing but novel instances of surface level "interaction", yet it is hard to even call it that. The weighing of these instances is something that I find if stressed and iterated upon, could produce a more capable agentic framework. I've outlined how the depicted error and rewarding loop can be improved to make a better agent. I intend to move agentic function beyond theatrical loops of prompt and response by interrogating the optimization substrate itself. Rather than treating reward as a convenient scalar pat on the head, I frame agent behavior as a constrained variational problem over latent state transitions, where policy updates approximate inference under structured uncertainty. My approach draws less from corporate folklore and more from specific technical inflection points such as the reanalysis framework in Reanalyse: A Simple Way to Improve Sample Efficiency in RL by Julian Schrittwieser and colleagues, the planning architecture of Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm by David Silver et al., and the value decomposition insights in QMIX: Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learning by Tabish Rashid. What interests me is not their surface performance but the structural concessions they make to tractability. By embedding differentiable world models and amortized belief updates into the agentic loop, I treat interaction as recursive posterior refinement across partially observable manifolds, not as a parade of conditioned tokens but as an evolving distribution over trajectories. At a higher altitude, I see agentic improvement as a question of mathematical hygiene. How does one approximate optimal control in a non convex landscape without dissolving into instability under recursive self modification. The error reward cycle, so often romanticized, is in fact a delicate dynamical system whose gradient flows inhabit curved statistical manifolds. Insights from regret bounds in bandit theory, contraction mappings in dynamic programming, and spectral analysis of iterative operators suggest that coherence is less about clever prompting and more about fixed point behavior under perturbation. I am particularly preoccupied with the spectral radius of update operators, the existence and uniqueness of equilibria in combinatorial policy spaces, and the computational hardness that shadows long horizon planning. If the agent is to be more than an improviser with memory, its loop must satisfy constraints that are as much algebraic as empirical, grounded in proofs of convergence rather than optimism about scale. -I’m not the greatest performer, so please bear with my narration in the video!

I see lots of people launching projects where their agents weigh and interact with information they are provided with via X through their X accounts. I've been experimenting with agent function and for long before it was popular on X, so, it had been made very clear to me long before that such automations and their functions are nothing but novel instances of surface level "interaction", yet it is hard to even call it that. The weighing of these instances is something that I find if stressed and iterated upon, could produce a more capable agentic framework. I've outlined how the depicted error and rewarding loop can be improved to make a better agent. I intend to move agentic function beyond theatrical loops of prompt and response by interrogating the optimization substrate itself. Rather than treating reward as a convenient scalar pat on the head, I frame agent behavior as a constrained variational problem over latent state transitions, where policy updates approximate inference under structured uncertainty. My approach draws less from corporate folklore and more from specific technical inflection points such as the reanalysis framework in Reanalyse: A Simple Way to Improve Sample Efficiency in RL by Julian Schrittwieser and colleagues, the planning architecture of Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm by David Silver et al., and the value decomposition insights in QMIX: Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learning by Tabish Rashid. What interests me is not their surface performance but the structural concessions they make to tractability. By embedding differentiable world models and amortized belief updates into the agentic loop, I treat interaction as recursive posterior refinement across partially observable manifolds, not as a parade of conditioned tokens but as an evolving distribution over trajectories. At a higher altitude, I see agentic improvement as a question of mathematical hygiene. How does one approximate optimal control in a non convex landscape without dissolving into instability under recursive self modification. The error reward cycle, so often romanticized, is in fact a delicate dynamical system whose gradient flows inhabit curved statistical manifolds. Insights from regret bounds in bandit theory, contraction mappings in dynamic programming, and spectral analysis of iterative operators suggest that coherence is less about clever prompting and more about fixed point behavior under perturbation. I am particularly preoccupied with the spectral radius of update operators, the existence and uniqueness of equilibria in combinatorial policy spaces, and the computational hardness that shadows long horizon planning. If the agent is to be more than an improviser with memory, its loop must satisfy constraints that are as much algebraic as empirical, grounded in proofs of convergence rather than optimism about scale. -I’m not the greatest performer, so please bear with my narration in the video!

Caro

246,343 Aufrufe • vor 5 Monaten

Exciting updates on Project GR00T! We discover a systematic way to scale up robot data, tackling the most painful pain point in robotics. The idea is simple: human collects demonstration on a real robot, and we multiply that data 1000x or more in simulation. Let’s break it down: 1. We use Apple Vision Pro (yes!!) to give the human operator first person control of the humanoid. Vision Pro parses human hand pose and retargets the motion to the robot hand, all in real time. From the human’s point of view, they are immersed in another body like the Avatar. Teleoperation is slow and time-consuming, but we can afford to collect a small amount of data. 2. We use RoboCasa, a generative simulation framework, to multiply the demonstration data by varying the visual appearance and layout of the environment. In Jensen’s keynote video below, the humanoid is now placing the cup in hundreds of kitchens with a huge diversity of textures, furniture, and object placement. We only have 1 physical kitchen at the GEAR Lab in NVIDIA HQ, but we can conjure up infinite ones in simulation. 3. Finally, we apply MimicGen, a technique to multiply the above data even more by varying the motion of the robot. MimicGen generates vast number of new action trajectories based on the original human data, and filters out failed ones (e.g. those that drop the cup) to form a much larger dataset. To sum up, given 1 human trajectory with Vision Pro -> RoboCasa produces N (varying visuals) -> MimicGen further augments to NxM (varying motions). This is the way to trade compute for expensive human data by GPU-accelerated simulation. A while ago, I mentioned that teleoperation is fundamentally not scalable, because we are always limited by 24 hrs/robot/day in the world of atoms. Our new GR00T synthetic data pipeline breaks this barrier in the world of bits. Scaling has been so much fun for LLMs, and it's finally our turn to have fun in robotics! We are building tools to enable everyone in the ecosystem to scale up with us. Links in thread:

Jim Fan

364,514 Aufrufe • vor 2 Jahren

I have now built, with some accuracy, the "spin / counter-spin" device seen by UFO contactees Norman Paulsen and Edwin Fuhr, a problem studied previously by Tom Valone. Precise "plans" have also been drawn many places in crops worldwide, instructing us on how to build that device. I followed those "plans" to reach success. Once I get one more part from China (a large ceramic bearing), I will try to look for any non-Newtonian properties, possibly useful for space travel? Any anti-gravity effect will be VERY SIGNIFICANT. Please feel to download this 6-minute video and share. If you require more technical detail, I can show another recent lab video, but do not wish to "bore" the casual reader with many details of electrical engineering! Anyone skilled at the art should be able to reproduce this new device easily for relatively low cost. EUREKA. One more step toward the stars. 🐶🛸

I have now built, with some accuracy, the "spin / counter-spin" device seen by UFO contactees Norman Paulsen and Edwin Fuhr, a problem studied previously by Tom Valone. Precise "plans" have also been drawn many places in crops worldwide, instructing us on how to build that device. I followed those "plans" to reach success. Once I get one more part from China (a large ceramic bearing), I will try to look for any non-Newtonian properties, possibly useful for space travel? Any anti-gravity effect will be VERY SIGNIFICANT. Please feel to download this 6-minute video and share. If you require more technical detail, I can show another recent lab video, but do not wish to "bore" the casual reader with many details of electrical engineering! Anyone skilled at the art should be able to reproduce this new device easily for relatively low cost. EUREKA. One more step toward the stars. 🐶🛸

Red Collie (Dr. Horace Drew) scientist/inventor

10,289 Aufrufe • vor 5 Monaten

📢 PERORMANCE V4 IS LIVE We've spent over 10 years at the Top of Performance Improvement companies, earning our place as the world’s #1 E-Sports PC Optimization Specialists. From elite players to top-tier orgs and hardware giants, our mission has always been clear: unlock every ounce of power your PC holds. Today, that mission reaches everyone. Whether you're a competitive gamer or managing high-level operations, tuned performance and low system latency matters. That’s why we’re proud to unveil Performance V4: a completely free utility app crafted and designed by my team and I as the first glimpse into increasing PC Performance for entirely free. Performance V4 is the beginning stages of the upcoming Paragon Tweak Utility (PTU): a revolutionary full-suite optimization platform, soon available through our website, and eventually to the Epic Games Store and Microsoft Store. Our current business strategy has two massive scale issues— the human resources required to optimize each customer's PC, and time to execution with appointment setting & correspondence. We believe that the next step is to create software that replaces that work, and in turn makes PC optimizations more accessible and more common for all, which is why we are launching on Believe. With more access to expendable cash, we can create our vision faster. The Performance V4 is LIVE , alongside an exclusive first look at PTU later next week. If you want to believe in something, believe in us 🫡

📢 PERORMANCE V4 IS LIVE We've spent over 10 years at the Top of Performance Improvement companies, earning our place as the world’s #1 E-Sports PC Optimization Specialists. From elite players to top-tier orgs and hardware giants, our mission has always been clear: unlock every ounce of power your PC holds. Today, that mission reaches everyone. Whether you're a competitive gamer or managing high-level operations, tuned performance and low system latency matters. That’s why we’re proud to unveil Performance V4: a completely free utility app crafted and designed by my team and I as the first glimpse into increasing PC Performance for entirely free. Performance V4 is the beginning stages of the upcoming Paragon Tweak Utility (PTU): a revolutionary full-suite optimization platform, soon available through our website, and eventually to the Epic Games Store and Microsoft Store. Our current business strategy has two massive scale issues— the human resources required to optimize each customer's PC, and time to execution with appointment setting & correspondence. We believe that the next step is to create software that replaces that work, and in turn makes PC optimizations more accessible and more common for all, which is why we are launching on Believe. With more access to expendable cash, we can create our vision faster. The Performance V4 is LIVE , alongside an exclusive first look at PTU later next week. If you want to believe in something, believe in us 🫡

Paragon│Boost Gaming PC Performance

55,054 Aufrufe • vor 1 Jahr

Milestone! We (robotic arms for gadgets assembly) finished the first commercial order, which brought the first revenue. Here are some learnings from this: The customer was a smart toy manufacturer. The task was to add a heatsink to Raspberry Pi. We received parts from them and returned the assembled modules back. Currently, it's done by teleoperation. Later it will be done by a remote employee via the Internet. Then it will be automated action by action, reducing the operator's time on this and making the task profitable. ps. If you have an assembly task that we can do for you asynchronically - leave a comment below. Learning 1. It's possible! This task which is usually done by the human arm with 5 fingers can be done with a two-finger gripper with the addition of a couple of simple tooling. The task was not simplified. We peeled off thin films from stickers, unpacked paper boxes, moved PCB boards full of components, etc. And no unsolvable problems have been encountered yet. Challenges: 1) The paper box shifted during the opening Solved with the plastic walls that you can lean against 2) Heat pad, stuck to the gripper instead of heat sync. Can be solved by gripper with a pump, but this time solved with the patience of the operator 3) The film on the pad is very thin. Turned out that sub-millimeter arm precision is enough to peel it off with just a regular gripper. 4) The working area has not enough space. You'll only know this by doing real tasks in bulk. This could be solved by an extra pair of long arms, but in this case, solved with the patience of the operator. I think that in the end, we will have 5-10 types of universal tooling and 5-10 types of grippers to solve almost all the problems in such assembly tasks. Learning 2. It's slow. It took 5 times more time, than doing it with human hands. But the good news is there's a lot of room for improvement. We now have specific “time for task” metrics, which we will decrease with iterations. The main reasons for slowness: 1) To rotate the gripper to a steep angle you are forced to control one robot arm with two hands instead of using both arms. We can fix this by just making more room for rotations. 2) Grabbing PCB board with two arms is hard. A slight difference in rotation can break the board, and it's hard to control these angles visually. To solve this, the best way is to use force feedback so you can feel the pressure applied to the item. 3) Accuracy and steadiness is still can be improved We will try a metal version and double the motors to do this. 4) It is physically difficult for the human hands to move with such precision To solve this, we will add a pad for the hands like in surgical robots Learning 3. It's a good business model The "Factory in the cloud" is a good business model for this stage. You send us parts and we send back assembled modules. Currently, it's more convenient than sending a robot to your place, as we can iterate/fix the robot quickly and utilize it 100% of the time. When we polish the set-up over time - we can send robots to your place. So if we can assemble something for you in the USA with Chinese prices by using modern automation - leave a comment below.

Milestone! We (robotic arms for gadgets assembly) finished the first commercial order, which brought the first revenue. Here are some learnings from this: The customer was a smart toy manufacturer. The task was to add a heatsink to Raspberry Pi. We received parts from them and returned the assembled modules back. Currently, it's done by teleoperation. Later it will be done by a remote employee via the Internet. Then it will be automated action by action, reducing the operator's time on this and making the task profitable. ps. If you have an assembly task that we can do for you asynchronically - leave a comment below. Learning 1. It's possible! This task which is usually done by the human arm with 5 fingers can be done with a two-finger gripper with the addition of a couple of simple tooling. The task was not simplified. We peeled off thin films from stickers, unpacked paper boxes, moved PCB boards full of components, etc. And no unsolvable problems have been encountered yet. Challenges: 1) The paper box shifted during the opening Solved with the plastic walls that you can lean against 2) Heat pad, stuck to the gripper instead of heat sync. Can be solved by gripper with a pump, but this time solved with the patience of the operator 3) The film on the pad is very thin. Turned out that sub-millimeter arm precision is enough to peel it off with just a regular gripper. 4) The working area has not enough space. You'll only know this by doing real tasks in bulk. This could be solved by an extra pair of long arms, but in this case, solved with the patience of the operator. I think that in the end, we will have 5-10 types of universal tooling and 5-10 types of grippers to solve almost all the problems in such assembly tasks. Learning 2. It's slow. It took 5 times more time, than doing it with human hands. But the good news is there's a lot of room for improvement. We now have specific “time for task” metrics, which we will decrease with iterations. The main reasons for slowness: 1) To rotate the gripper to a steep angle you are forced to control one robot arm with two hands instead of using both arms. We can fix this by just making more room for rotations. 2) Grabbing PCB board with two arms is hard. A slight difference in rotation can break the board, and it's hard to control these angles visually. To solve this, the best way is to use force feedback so you can feel the pressure applied to the item. 3) Accuracy and steadiness is still can be improved We will try a metal version and double the motors to do this. 4) It is physically difficult for the human hands to move with such precision To solve this, we will add a pad for the hands like in surgical robots Learning 3. It's a good business model The "Factory in the cloud" is a good business model for this stage. You send us parts and we send back assembled modules. Currently, it's more convenient than sending a robot to your place, as we can iterate/fix the robot quickly and utilize it 100% of the time. When we polish the set-up over time - we can send robots to your place. So if we can assemble something for you in the USA with Chinese prices by using modern automation - leave a comment below.

Igor Kulakov

37,266 Aufrufe • vor 1 Jahr

The next frontier in protein design will not be defined by structure alone, but by the capacity to engineer motion as a first-class principle of function. This is because dynamics is where the real biology lives. Foundational work by Karplus, Levitt & Warshel made clear that chemistry cannot be understood without motion, mechanism, and scale. Gō, Brooks & others showed that proteins possess characteristic collective motions - low-frequency normal modes that capture how whole molecules bend, breathe, and fluctuate. Frauenfelder then sharpened the picture further: proteins are not static objects occupying a single minimum, but dynamic ensembles traversing rugged energy landscapes. And yet the modern AI revolution in protein science has been, above all, a revolution in structure. In our new paper in Matter, Bo Ni and I ask a different question: not what structure will this sequence adopt? but what sequence will realize a prescribed pattern of motion? VibeGen inverts the conventional design paradigm. Rather than treating dynamics as a consequence to be analyzed after the fact, it makes dynamics the design objective from the outset. Using a language diffusion model with two cooperating agents - a designer that proposes sequences and a predictor that critiques them against the target motion profile - the system converges on de novo proteins with tailored vibrational behavior. One of the most intriguing results is a form of functional degeneracy - distinct sequences and distinct folds can satisfy the same target dynamical specification. For a given functional pattern of motion, evolution may have sampled only a small region of the physically realizable design space. The space of viable molecular mechanics may be far larger than the repertoire biology happened to discover. We have made "vibe" into a cultural metaphor - something intuitive, affective, subjective. But at the molecular scale, vibe is not metaphor: It is physics. For a protein, the vibe is the pattern of motion itself; the fluctuations, resonances, and collective displacements that determine what the molecule can do.

Markus J. Buehler

89,806 Aufrufe • vor 4 Monaten

D-Wave announced a scientific breakthrough published in the esteemed journal Science Magazine, confirming that its annealing quantum computer outperformed one of the world’s most powerful classical supercomputers in solving a complex magnetic materials simulation problem with relevance to materials discovery. The new landmark peer-reviewed paper, “Beyond-Classical Computation in Quantum Simulation,” validates this achievement as the world’s first and only demonstration of quantum computational supremacy on a useful problem. An international collaboration of scientists led by D-Wave performed simulations of quantum dynamics in programmable spin glasses—a computationally hard magnetic materials simulation problem with known applications to business and science—on both D-Wave’s Advantage2™ prototype annealing quantum computer and the Frontier supercomputer at the Department of Energy’s Oak Ridge Lab. D-Wave’s quantum computer performed a complex simulation in minutes and with a level of accuracy that would take nearly a million years using the supercomputer. In addition, it would require more than the world’s annual electricity consumption to solve this problem using the supercomputer, which is built with graphics processing unit (GPU) clusters. For decades, scientists have aspired to build a quantum computer capable of solving complex materials simulation problems beyond the reach of classical computers. D-Wave's advancements in quantum hardware have made it possible for its annealing quantum computers to process these types of problems for the first time. Magnetic materials simulations, like those conducted in this work, use computer models to study how tiny particles not visible to the human eye react to external factors. Magnetic materials are widely used in medical imaging, electronics, superconductors, electrical networks, sensors, and motors. This is an incredibly important achievement. Please join us in congratulating the D-Wave team and our global collaborators on this remarkable milestone. It’s a significant moment for the quantum computing industry. Learn more about this monumental achievement: Read the press release here: #QuantumSupremacy #QuantumRealized #QuantumComputing #DWave #Technology #Innovation #Optimization #MaterialsDiscovery #ScientificBreakthrough $QBTS

D-Wave announced a scientific breakthrough published in the esteemed journal Science Magazine, confirming that its annealing quantum computer outperformed one of the world’s most powerful classical supercomputers in solving a complex magnetic materials simulation problem with relevance to materials discovery. The new landmark peer-reviewed paper, “Beyond-Classical Computation in Quantum Simulation,” validates this achievement as the world’s first and only demonstration of quantum computational supremacy on a useful problem. An international collaboration of scientists led by D-Wave performed simulations of quantum dynamics in programmable spin glasses—a computationally hard magnetic materials simulation problem with known applications to business and science—on both D-Wave’s Advantage2™ prototype annealing quantum computer and the Frontier supercomputer at the Department of Energy’s Oak Ridge Lab. D-Wave’s quantum computer performed a complex simulation in minutes and with a level of accuracy that would take nearly a million years using the supercomputer. In addition, it would require more than the world’s annual electricity consumption to solve this problem using the supercomputer, which is built with graphics processing unit (GPU) clusters. For decades, scientists have aspired to build a quantum computer capable of solving complex materials simulation problems beyond the reach of classical computers. D-Wave's advancements in quantum hardware have made it possible for its annealing quantum computers to process these types of problems for the first time. Magnetic materials simulations, like those conducted in this work, use computer models to study how tiny particles not visible to the human eye react to external factors. Magnetic materials are widely used in medical imaging, electronics, superconductors, electrical networks, sensors, and motors. This is an incredibly important achievement. Please join us in congratulating the D-Wave team and our global collaborators on this remarkable milestone. It’s a significant moment for the quantum computing industry. Learn more about this monumental achievement: Read the press release here: #QuantumSupremacy #QuantumRealized #QuantumComputing #DWave #Technology #Innovation #Optimization #MaterialsDiscovery #ScientificBreakthrough $QBTS

D-Wave

65,039 Aufrufe • vor 1 Jahr

🚨 SIGGRAPH Asia 2025 Paper Alert 🚨 ➡️Paper Title: WorldExplorer: Towards Generating Fully Navigable 3D Scenes 🌟Few pointers from the paper 🎯Generating 3D worlds from text is a highly anticipated goal in computer vision. Existing works are limited by the degree of exploration they allow inside of a scene, i.e., produce stretched-out and noisy artifacts when moving beyond central or panoramic perspectives. 🎯 To this end, authors of this paper proposed “WorldExplorer”, a novel method based on autoregressive video trajectory generation, which builds fully navigable 3D scenes with consistent visual quality across a wide range of viewpoints. 🎯They initialize their scenes by creating multi-view consistent images corresponding to a 360 degree panorama. 🎯Then, they expanded it by leveraging video diffusion models in an iterative scene generation pipeline. 🎯Concretely, they generated multiple videos along short, pre-defined trajectories, that explore the scene in depth, including motion around objects. 🎯Their novel scene memory conditions each video on the most relevant prior views, while a collision-detection mechanism prevents degenerate results, like moving into objects. 🎯Finally,they fuse all generated views into a unified 3D representation via 3D Gaussian Splatting optimization. 🎯Compared to prior approaches, WorldExplorer produces high-quality scenes that remain stable under large camera motion, enabling for the first time realistic and unrestricted exploration. 🎯They believe this marks a significant step toward generating immersive and truly explorable virtual 3D environments. 🏢Organization: TU München 🧙Paper Authors: Manuel-Andreas Schneider, Lukas Höllein , Matthias Niessner 📝 Read the Full Paper here: 🗂️ Project Page: 🧑‍💻 Code: 🎥 Be sure to watch the attached Technical Summary Video - Sound on 🔊🔊 Find this Valuable 💎 ? ♻️QT and teach your network something new Follow me 👣, naveen manwani , for the latest updates on Tech and AI-related news, insightful research papers, and exciting announcements. #SIGGRAPHAsia2025

🚨 SIGGRAPH Asia 2025 Paper Alert 🚨 ➡️Paper Title: WorldExplorer: Towards Generating Fully Navigable 3D Scenes 🌟Few pointers from the paper 🎯Generating 3D worlds from text is a highly anticipated goal in computer vision. Existing works are limited by the degree of exploration they allow inside of a scene, i.e., produce stretched-out and noisy artifacts when moving beyond central or panoramic perspectives. 🎯 To this end, authors of this paper proposed “WorldExplorer”, a novel method based on autoregressive video trajectory generation, which builds fully navigable 3D scenes with consistent visual quality across a wide range of viewpoints. 🎯They initialize their scenes by creating multi-view consistent images corresponding to a 360 degree panorama. 🎯Then, they expanded it by leveraging video diffusion models in an iterative scene generation pipeline. 🎯Concretely, they generated multiple videos along short, pre-defined trajectories, that explore the scene in depth, including motion around objects. 🎯Their novel scene memory conditions each video on the most relevant prior views, while a collision-detection mechanism prevents degenerate results, like moving into objects. 🎯Finally,they fuse all generated views into a unified 3D representation via 3D Gaussian Splatting optimization. 🎯Compared to prior approaches, WorldExplorer produces high-quality scenes that remain stable under large camera motion, enabling for the first time realistic and unrestricted exploration. 🎯They believe this marks a significant step toward generating immersive and truly explorable virtual 3D environments. 🏢Organization: TU München 🧙Paper Authors: Manuel-Andreas Schneider, Lukas Höllein , Matthias Niessner 📝 Read the Full Paper here: 🗂️ Project Page: 🧑‍💻 Code: 🎥 Be sure to watch the attached Technical Summary Video - Sound on 🔊🔊 Find this Valuable 💎 ? ♻️QT and teach your network something new Follow me 👣, naveen manwani , for the latest updates on Tech and AI-related news, insightful research papers, and exciting announcements. #SIGGRAPHAsia2025

naveen manwani

10,578 Aufrufe • vor 10 Monaten

Studies have shown ChatGPT outperforms human annotators for Structured Data by about 25% and costs 30x less. 1 In just 2 months, miners on SN33 running ChatGPT without optimization can’t survive. Today we announce SN33 is now ReadyAI to fully align with our mission 👇 SN33 is building a more performant and significantly cheaper alternative to Scale AI Today structured data is performed primarily by human annotation services like Amazon’s Mechanical Turk and Scale AI It is now more important than ever for every business and individual to make their data AI Ready. However, taking unstructured data and making it Structured Data using today’s tools is extremely costly. SN33 revolutionizes this process, unlocking immense opportunities for commercialization. We lay out the vision for it in this detailed blog post: Validators TODAY can monetize access to this structured data pipeline independently, but we’re streamlining this process, launching a frontend soon that any validator can opt into to provide bandwidth. We've received great feedback from the community, recognizing that what we're building goes far beyond Conversational AI. Building the world's largest annotated conversational dataset (which we've already accomplished) is just one of countless real-world applications for SN33's Structured Data pipeline. We're building a decentralized Scale AI, offering a full suite of Structured Data commodities—from text metadata tagging (available today) to fully customizable queries for company-specific data annotation use cases and image metadata tagging coming soon 👀. Thanks for all the feedback! It has been invaluable so keep bringing it to us! 🙏$TAO Openτensor Foundaτion 1 “ChatGPT Outperforms Crowd-Workers for Text-Annotation Tasks” shows “The zero-shot accuracy of ChatGPT exceeds that of crowd-workers by about 25 percentage points on average [...] Moreover, the per-annotation cost of ChatGPT is less than $0.003—about thirty times cheaper than MTurk”

Studies have shown ChatGPT outperforms human annotators for Structured Data by about 25% and costs 30x less. 1 In just 2 months, miners on SN33 running ChatGPT without optimization can’t survive. Today we announce SN33 is now ReadyAI to fully align with our mission 👇 SN33 is building a more performant and significantly cheaper alternative to Scale AI Today structured data is performed primarily by human annotation services like Amazon’s Mechanical Turk and Scale AI It is now more important than ever for every business and individual to make their data AI Ready. However, taking unstructured data and making it Structured Data using today’s tools is extremely costly. SN33 revolutionizes this process, unlocking immense opportunities for commercialization. We lay out the vision for it in this detailed blog post: Validators TODAY can monetize access to this structured data pipeline independently, but we’re streamlining this process, launching a frontend soon that any validator can opt into to provide bandwidth. We've received great feedback from the community, recognizing that what we're building goes far beyond Conversational AI. Building the world's largest annotated conversational dataset (which we've already accomplished) is just one of countless real-world applications for SN33's Structured Data pipeline. We're building a decentralized Scale AI, offering a full suite of Structured Data commodities—from text metadata tagging (available today) to fully customizable queries for company-specific data annotation use cases and image metadata tagging coming soon 👀. Thanks for all the feedback! It has been invaluable so keep bringing it to us! 🙏$TAO Openτensor Foundaτion 1 “ChatGPT Outperforms Crowd-Workers for Text-Annotation Tasks” shows “The zero-shot accuracy of ChatGPT exceeds that of crowd-workers by about 25 percentage points on average [...] Moreover, the per-annotation cost of ChatGPT is less than $0.003—about thirty times cheaper than MTurk”

David Fields

13,639 Aufrufe • vor 2 Jahren

"Every time I go to Bangalore, I come back twice as energised. I meet people who speak fluent German and have never been to Germany. We will go to where that kind of talent is," -CEO, Mercedes-Benz Bengaluru has come a long way from being known as an IT services hub to becoming the heart of innovation-driven growth. Our tech ecosystem today competes on competence, not cost and on value, not valuation. What draws global leaders here isn’t low-cost manpower, but deep technical expertise. Bengaluru is emerging as the top destination for skilled talent in the APAC region, ranking first for tech talent acquisition. With 36% of the world’s tech talent concentrated in the US and India, the city is driving the next wave of innovation, powered by people who don’t just execute, but think, build and solve for the world. It’s no surprise that global CEOs continue to choose Karnataka as their base for building the technologies of tomorrow.

"Every time I go to Bangalore, I come back twice as energised. I meet people who speak fluent German and have never been to Germany. We will go to where that kind of talent is," -CEO, Mercedes-Benz Bengaluru has come a long way from being known as an IT services hub to becoming the heart of innovation-driven growth. Our tech ecosystem today competes on competence, not cost and on value, not valuation. What draws global leaders here isn’t low-cost manpower, but deep technical expertise. Bengaluru is emerging as the top destination for skilled talent in the APAC region, ranking first for tech talent acquisition. With 36% of the world’s tech talent concentrated in the US and India, the city is driving the next wave of innovation, powered by people who don’t just execute, but think, build and solve for the world. It’s no surprise that global CEOs continue to choose Karnataka as their base for building the technologies of tomorrow.

Priyank Kharge / ಪ್ರಿಯಾಂಕ್ ಖರ್ಗೆ

29,212 Aufrufe • vor 9 Monaten

“Harmonic is building Mathematical Superintelligence (MSI)” With $295M+ in total funding at a recent $1.45B post-money valuation, Harmonic's mission is to solve math problems that have remained unsolved for centuries, unlocking progress across physics, engineering.. & maybe even time travel? Co-founded by Vlad Tenev (Vlad Tenev) CEO of Robinhood, & Harmonic CEO Tudor Achim (Tudor Achim), the company has raised from leading investors including Ribbit, Sequoia, Kleiner Perkins, Index, Paradigm, DST Global, & more.. Funding history & lead investors: - Series A (Sept 2024): $75M led by steve beaker - Series B (July 2025): $100M led by Kleiner Perkins - Series C (Nov 2025): $120M at a $1.45B post-money valuation led by Ribbit Capital "Harmonic’s flagship Aristotle model recently achieved gold-medal level performance at the International Mathematical Olympiad, considered the most prestigious mathematical competition in the world, and is now available to the public. Unlike other models, Aristotle makes use of formal verification using Lean4 to ensure accuracy and eliminate hallucinations. In the first few weeks since its API beta launch, Aristotle has already been used by mathematicians and researchers to accelerate progress and create novel discoveries." . . . "Harmonic is building what we call mathematical super intelligence, and it's an artificial intelligence that can solve math problems better than any human mathematician. The company's been around for a couple of years. The North Star was, can we actually solve really, really important math problems like the Riemann Hypothesis or Hodge Conjecture? There's this group of math problems that have been open for hundreds of years that are called the Millennium Prize problems, and they're considered very big, difficult, and actually valuable. So that was kind of the North Star, and the reason we wanted to do that was if we could solve those problems, everything downstream of math, like theoretical physics becomes unlocked. So then you can imagine solving really hard physics problems. And actually, if you can solve that, then there's all kinds of exciting engineering developments, like depending on how that theory looks, you can imagine things like faster than light travel and it gets really crazy."

“Harmonic is building Mathematical Superintelligence (MSI)” With $295M+ in total funding at a recent $1.45B post-money valuation, Harmonic's mission is to solve math problems that have remained unsolved for centuries, unlocking progress across physics, engineering.. & maybe even time travel? Co-founded by Vlad Tenev (Vlad Tenev) CEO of Robinhood, & Harmonic CEO Tudor Achim (Tudor Achim), the company has raised from leading investors including Ribbit, Sequoia, Kleiner Perkins, Index, Paradigm, DST Global, & more.. Funding history & lead investors: - Series A (Sept 2024): $75M led by steve beaker - Series B (July 2025): $100M led by Kleiner Perkins - Series C (Nov 2025): $120M at a $1.45B post-money valuation led by Ribbit Capital "Harmonic’s flagship Aristotle model recently achieved gold-medal level performance at the International Mathematical Olympiad, considered the most prestigious mathematical competition in the world, and is now available to the public. Unlike other models, Aristotle makes use of formal verification using Lean4 to ensure accuracy and eliminate hallucinations. In the first few weeks since its API beta launch, Aristotle has already been used by mathematicians and researchers to accelerate progress and create novel discoveries." . . . "Harmonic is building what we call mathematical super intelligence, and it's an artificial intelligence that can solve math problems better than any human mathematician. The company's been around for a couple of years. The North Star was, can we actually solve really, really important math problems like the Riemann Hypothesis or Hodge Conjecture? There's this group of math problems that have been open for hundreds of years that are called the Millennium Prize problems, and they're considered very big, difficult, and actually valuable. So that was kind of the North Star, and the reason we wanted to do that was if we could solve those problems, everything downstream of math, like theoretical physics becomes unlocked. So then you can imagine solving really hard physics problems. And actually, if you can solve that, then there's all kinds of exciting engineering developments, like depending on how that theory looks, you can imagine things like faster than light travel and it gets really crazy."

Molly O’Shea

51,281 Aufrufe • vor 7 Monaten