Exclusive | Caltech Researchers Claim Radical Compression of High-Fidelity AI Models - WSJ
<a href="https://news.google.com/rss/articles/CBMiuANBVV95cUxPaE1QTlFMU1BDempxR1MtZmowZWNQRXhRYVRBLW1QbXNrUHR4WkxyUmJuWkdmS2JweXBDV3ZwR0kza3QtMlV3ekh5bV9CRmd4TTdSeVZBdmwyOXc1LVpHVi1kNUpBbnA0MDNBZjdVYUstM014elJnRC1mT1l0NnRzM3FnQmdSSl9WRGJqYkV4VFBkTS1oTjFQRTg3ZGcxVmNmZ2JTMHBjZkhvTEV5WlhmZHZWcGZRVEptQUtfb1lCXy1jYmhRNTdwQlpyLVdKdmtfUlNFbjUzbWtjMmNvSGwwYk5iTFN6dFdIMWxkTGRuOGprVnE2WDBuTmRObWtEOHR1RUlSNFFIS0VHRURMUXNIYnF6RDE2QnJ5TGZFOXhDc3ZiQkdSZm1MY2lCX3RwOTRWTXM2NE9ud2VDTXZKN2JVTXJ4cEVaRV8waHpPWVZFXy1IQkpSSk5ZcmlFUnZhcTZTa0tZZWU5cjZQTk9IeHNINHdIUzRKVnl2LUQ1bjdEX1UyYWh5RnprY0h6ZVlDaVZqM0Jham9zTTlrTjhMdHFtR0VWZE53UTZFVEw4U0M2YUZvY0Z1Ym85Tw?oc=5" target="_blank">Exclusive | Caltech Researchers Claim Radical Compression of High-Fidelity AI Models</a> <font color="#6f6f6f">WSJ</font>
Could not retrieve the full article text.
Read on Google News: LLM →Sign in to highlight and annotate this article
Conversation starters
Daily AI Digest
Get the top 5 AI stories delivered to your inbox every morning.
More about
modelresearch
Google - Gemma 4 now in Unsloth!
Google releases Gemma 4 with four new models: E2B, E4B, 26B-A4B, 31B. You can now run and train the Gemma 4 models in Unsloth. Guide / Blog: https://unsloth.ai/docs/models/gemma-4 The multimodal reasoning models are licensed under Apache 2.0. Run E2B and E4B on 6GB RAM, and on phones. Run 26B-A4B and 31B on ~18GB. GGUFs: https://huggingface.co/collections/unsloth/gemma-4 Updates Tool calls for smaller models are now more stable and don't cut off anymore Context length is now properly applied. Tool calls for all models are now +30% to +80% more accurate. Web search now actually gets web content and not just summaries Number of tool calls allowed are increased to 25 from 10 Tool calls now terminate much better, so looping / repetitions will be reduced More tool call healing and de-duplicatio
![[R] Is autoresearch really better than classic hyperparameter tuning?](https://d2xsxph8kpxj0f.cloudfront.net/310419663032563854/konzwo8nGf8Z4uZsMefwMr/default-img-robot-hand-JvPW6jsLFTCtkgtb97Kys5.webp)
[R] Is autoresearch really better than classic hyperparameter tuning?
We did experiments comparing Optuna autoresearch. Autoresearch converges faster, is more cost-efficient, and even generalizes better. Experiments were done on NanoChat: we let Claude define Optuna’s search space to align the priors between methods. Both optimization methods were run three times. Autoresearch is far more sample-efficient on average In 5 min training setting, LLM tokens cost as much as GPUs, but despite a 2× higher per-step cost, AutoResearch still comes out ahead across all cost budgets: What’s more, the solution found by autoresearch generalizes better than Optuna’s. We gave the best solutions more training time; the absolute score gap widens, and the statistical significance becomes stronger: An important contributor to autoresearch’s capability is that it searches direct
Knowledge Map
Connected Articles — Knowledge Graph
This article is connected to other articles through shared AI topics and tags.
Discussion
Sign in to join the discussion
No comments yet — be the first to share your thoughts!