Introducing DataGemma, open models that enhance LLM factuality by grounding them with real-world data from Data Commons → https://t.co/ha0fYHyIW5
Learn how the models use RIG & RAG approaches to:
📖 Harness Data Commons knowledge
🧠 Fact-check numbers
🛠️ Develop responsible AI
Announcing DataGemma, a set of open models that utilize Data Commons through Retrieval Interleaved Generation (RIG) & Retrieval Augmented Generation (RAG) to ground LLMs in real-world data for fact-checking, responsible AI development & more. Read more at https://t.co/0dGE6Qqf9c
here is o1, a series of our most capable and aligned models yet:
https://t.co/yzZGNN8HvD
o1 is still flawed, still limited, and it still seems more impressive on first use than it does after you spend more time with it.
OpenAI o1 — our first model trained with reinforcement learning to think hard about problems before answering. Extremely proud of the team!
This is a new paradigm with vast opportunity. This is evident quantitatively (eg reasoning metrics are already a step function improved) and qualitatively (eg faithful chains of thought make models interpretable by letting you “read the model’s mind” in plain English).
One way to think about this is that our models do System I thinking, while chains of thought unlock System II thinking. People have discovered a while ago that prompting the model to “think step by step” boosts performance. But training the model to do this, end to end with trial and error, is far more reliable and — as we’ve seem with games like Go or Dota — can generate extremely impressive results.
It’s still early days for the o1 technology. It provides new safety opportunities which we are exploring actively, including on reliability, hallucinations, and robustness to adversarial attackers. For example, we’ve seen great uplift in our safety metrics by letting the model reason about policies via chain of thought.
Its accuracy also has huge room for further improvement— for example, from our launch post, our model achieved 49th percentile / 213 points in this year’s competitive programming Olympiad (IOI) under human conditions of 50 submissions per problem. But with 10,000 submissions per problem, the model achieved a score of 362.14 — above the gold medal threshold. So the model is capable of even greater outputs than it appears at first glance.
Once again, an AI system is not "thinking", it's "processing", "running predictions",... just like Google or computers do.
Giving the false impression that technology systems are human is just cheap snake oil and marketing to fool you into thinking it's more clever than it is.
OpenAI Strawberry (o1) is out! We are finally seeing the paradigm of inference-time scaling popularized and deployed in production. As Sutton said in the Bitter Lesson, there're only 2 techniques that scale indefinitely with compute: learning & search. It's time to shift focus to the latter.
1. You don't need a huge model to perform reasoning. Lots of parameters are dedicated to memorizing facts, in order to perform well in benchmarks like trivia QA. It is possible to factor out reasoning from knowledge, i.e. a small "reasoning core" that knows how to call tools like browser and code verifier. Pre-training compute may be decreased.
2. A huge amount of compute is shifted to serving inference instead of pre/post-training. LLMs are text-based simulators. By rolling out many possible strategies and scenarios in the simulator, the model will eventually converge to good solutions. The process is a well-studied problem like AlphaGo's monte carlo tree search (MCTS).
3. OpenAI must have figured out the inference scaling law a long time ago, which academia is just recently discovering. Two papers came out on Arxiv a week apart last month:
- Large Language Monkeys: Scaling Inference Compute with Repeated Sampling. Brown et al. finds that DeepSeek-Coder increases from 15.9% with one sample to 56% with 250 samples on SWE-Bench, beating Sonnet-3.5.
- Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters. Snell et al. finds that PaLM 2-S beats a 14x larger model on MATH with test-time search.
4. Productionizing o1 is much harder than nailing the academic benchmarks. For reasoning problems in the wild, how to decide when to stop searching? What's the reward function? Success criterion? When to call tools like code interpreter in the loop? How to factor in the compute cost of those CPU processes? Their research post didn't share much.
5. Strawberry easily becomes a data flywheel. If the answer is correct, the entire search trace becomes a mini dataset of training examples, which contain both positive and negative rewards.
This in turn improves the reasoning core for future versions of GPT, similar to how AlphaGo’s value network — used to evaluate quality of each board position — improves as MCTS generates more and more refined training data.