iCreatAI News
Back to main site
Skip to content
Only First party#Reasoning
Oct 22Thu
  1. Hugging Face Blog27

    Profiling TorchNeuron (Part 1): System-level profiling on AWS Trainium.

    This post walks through system-level profiling of inference on AWS Trainium using TorchNeuron, its open source native PyTorch backend, starting from scratch with no prior profiling experience. It shows how to configure torch.profiler with NeuronConfig and NeuronProfiler to capture a clean trace, read the key_averages() table to find operations consuming Neuron device time, and follow an operation through Neuron Explorer from framework dispatch to hardware execution. Using three RMSNorm implementations, it reports naive ops at 2,355 µs of Neuron time versus 403 µs for torch.rms_norm and 376 µs for naive plus torch.compile.

Oct 16Fri
  1. Microsoft Research58

    Proof-based general-purpose computing with Magnetar

    Microsoft Research introduces Magnetar, a zero-knowledge virtual machine that proves execution of RISC-V programs written in Rust, Go, or C, running 10 to 39 times faster on average than the fastest comparable zkVMs across 15 benchmarks and verifying proofs in about 12 milliseconds. Magnetar's security rests only on standard hash functions such as SHA-256 or SHA-3, requiring no elliptic curves, lattices, special-purpose hash functions, trusted setup, or unproven conjectures. It builds on more than a decade of Microsoft Research work including Spartan, Phalanx, Nova, Brakedown, Lasso, Jolt, and BinarySpartan.

Oct 14Wed
  1. Google DeepMind85

    Gemini 4 Argon for Robotics

    Google introduces Gemini 4 Argon, a general-purpose physical reasoning model that scores 87% on the Embodied Reasoning (ERQA) benchmark and is demonstrated across robot control, Real2Sim reconstruction, physical understanding, and research self-improvement workflows. The post shares representative prompts spanning Spot mobile manipulation with MuJoCo practice, zero-shot arm control, video world model steering, sim twin reconstruction from robot, human, and sketch inputs, hindsight labeling, value functions, and simulation-generated training data that raised real-world success rate from 56% to 75%. Argon is available via Google AI Studio, the Gemini API (gemini-4-argon), and Google Antigravity.

    Why it matters: It offers a detailed, prompt-level look at how a frontier model is being applied across the robotics stack, useful for teams evaluating embodied AI tooling.

  2. Google DeepMind92

    Gemini 4 Argon: Built to solve your hardest problems

    Google announced Gemini 4 Argon, a frontier model now available globally via the Gemini API in AI Studio and the Gemini platform, Google Antigravity, the Gemini app, and AI Mode in Search, priced at $2 per million input tokens and $10 per million output tokens. Google reports Argon ranked #1 on the Vals Index and cites internal and partner uses including a Chrome architectural refactor, a 2.85x inference speedup on Gemma 4 E2B, quantum computing and fusion research, rare disease analysis, enzyme design, and a robotics video-to-sim-to-real pipeline. Google also described safety work including jailbreak defenses, agent misalignment monitoring, and a 0.7% attack success rate on the Gray Swan indirect prompt injection benchmark.

    Why it matters: The post is a detailed launch announcement whose benchmark claims, pricing, and safety figures give readers a concrete picture of a major frontier model release.

Oct 1Thu
  1. Google DeepMind88

    Gemini 4 Argon: our next era of frontier intelligence

    Google announced Gemini 4 Argon, a frontier model rolling out first to trusted cyber defenders through its Fairwind Program, with an introductory price of $2 per million input tokens and $10 per million output tokens. Google reports state-of-the-art results on DeepSWE v1.1 (77.9%), the Vals Index, LVBench (91.7%), AutomationBench (51.3%), and a tie for first on CWE-bench v1 (68%), alongside internal uses such as C/C++ to Rust migrations and memory optimization. The model raises the output token limit to 1M and is being released in phases with safeguards against misuse, prompt injection, and misalignment before broader availability to paid API customers and Google AI Ultra subscribers.

    Why it matters: The piece is a detailed primary source on a frontier model's claimed benchmarks, pricing, staged release, and safety approach, useful for tracking how leading labs frame capability and rollout.

Jul 29Wed
  1. Berkeley AI Research60

    From CUDA to MLX: How K-Search Brings Decades of Kernel Expertise to Apple Silicon

    IBM Research extended K-Search, an evolutionary LLM-driven kernel search framework from UC Berkeley Sky Lab, with a native MLX backend and a structured CUDA-to-MLX translation layer that maps CUDA primitives, constraints and optimization patterns onto Apple Silicon equivalents. On Apple Silicon the approach reached 0.97x the speed of the native MLX Attention kernel and up to a 20x prefill speedup over the community mlx-lm implementation on the Mamba SSM kernel, attributed largely to adding a parallel scan. The authors say the bottleneck was not the LLM's ability to write Metal code but the quality of context and constraints supplied to it.

    Why it matters: Describes a concrete method for transferring CUDA kernel expertise to non-NVIDIA hardware, with reported benchmark numbers and an open-source reproduction path.

Jul 26Sun
  1. Berkeley AI Research38

    Teaching LLMs to Update Beliefs for Efficient Long-Horizon Interaction

    The post introduces ABBEL, a framework that replaces full interaction history with periodically updated natural-language "belief states" and supervises their contents through belief grading, including an autoencoding-inspired reconstruction objective. On CollabBench collaborative coding, reconstruction-based belief grading roughly halved the gap to full-context models and trained in 50 steps instead of 100, while using fewer peak tokens; on Combination Lock and multi-objective QA, domain-knowledge grading and a peak belief length penalty further improved efficiency. The authors argue that isolating and supervising summaries addresses the performance cost of recursive summarization in long-horizon tasks.

May 8Fri
  1. Berkeley AI Research38

    Adaptive Parallel Reasoning: The Next Paradigm in Efficient Inference Scaling

    This post surveys parallel reasoning methods for LLMs, contrasting fixed approaches like self-consistency, Best-of-N, and tree search with adaptive parallel reasoning (APR), where the model itself decides when to parallelize, how many threads to spawn, and how to coordinate them. It describes fork-join inference designs, including engine-modifying KV cache stitching (Multiverse) versus client-side orchestration (ThreadWeaver), and covers training via SFT demonstrations and RL rewards based on critical-path efficiency gated by correctness. It closes with evaluation differences across Multiverse, ThreadWeaver, NPR, and Parallel-R1, plus open questions on stability and whether parallelization mainly helps as a training-time exploration scaffold.

Apr 20Mon
  1. Berkeley AI Research38

    Gradient-based Planning for World Models at Longer Horizons

    The post introduces GRASP (Gradient Relaxed Stochastic Planner), a gradient-based planner for learned world models that lifts trajectories into virtual states for parallel-in-time optimization, adds Gaussian noise to state iterates for exploration, and stops brittle state-input gradients through the model while retaining action gradients. It argues that long-horizon planning with modern world models is fragile due to ill-conditioned rollouts, non-greedy local minima, and adversarial-robustness-style sensitivity of state Jacobians, and reports Push-T results where GRASP outperforms CEM, GD, and LatCo at horizons from 40 to 80. The work is by Michael Psenka with Mike Rabbat, Aditi Krishnapriyan, Yann LeCun, and Amir Bar (arXiv 2602.00475).

Mar 13Fri
  1. Berkeley AI Research38

    Identifying Interactions at Scale for LLMs

    This blog post introduces SPEX and ProxySPEX, algorithms that use strategically selected ablations and sparse recovery from signal processing and coding theory to identify influential feature, data, and model-component interactions at scales far beyond prior methods, with ProxySPEX exploiting hierarchy to match SPEX using roughly 10x fewer ablations. The authors demonstrate the framework on sentiment analysis, a modified trolley problem with GPT-4o mini, CIFAR-10 data attribution with ResNet, and attention head pruning on MMLU, where a ProxySPEX-informed pruning strategy improved target-task performance. Code for both algorithms is available in the SHAP-IQ repository.