Machine Learning

Machine learning sits at the core of everything we cover at AI Trend Blend. This section gathers our research breakdowns, method explainers, and practical analyses across supervised, self-supervised, and generative learning, with a steady focus on the ideas that actually move results rather than the noise around them. You will find work spanning optimization, model architectures, training dynamics, and the theory that explains why modern systems behave the way they do, written for readers who want depth without filler.

Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifolds.

Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifolds

Bonet, Drumetz, and Courty from ENSAE, IMT Atlantique, and Universite Bretagne Sud extend the Sliced-Wasserstein distance to Cartan-Hadamard manifolds, covering hyperbolic spaces and symmetric positive definite matrices with both geodesic and horospherical projections, then prove theoretical guarantees and derive non-parametric…

Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifolds Read More »

Statistical Inference via Sketched StoSQP: Online Second-Order Methods for Constrained Optimization.

Statistical Inference via Sketched StoSQP: Online Second-Order Methods for Constrained Optimization

Sen Na at Georgia Tech and Michael Mahoney at UC Berkeley prove that a sketched, adaptive Stochastic SQP method achieves asymptotic normality for constrained nonlinear stochastic optimization — the first online estimator that handles equality constraints without ever computing a…

Statistical Inference via Sketched StoSQP: Online Second-Order Methods for Constrained Optimization Read More »

The ODE Method for Stochastic Approximation with Markovian Noise: Breaking the Deadly Triad in Reinforcement Learning.

The ODE Method for Stochastic Approximation with Markovian Noise: Breaking the Deadly Triad in Reinforcement Learning

A team from the University of Virginia and Scaled Foundations has extended the celebrated Borkar-Meyn theorem to handle Markovian noise, unlocking the first rigorous almost-sure convergence guarantees for GTD(λ) and ETD(λ) — the two principal algorithms for tackling the deadly…

The ODE Method for Stochastic Approximation with Markovian Noise: Breaking the Deadly Triad in Reinforcement Learning Read More »

Orthogonal Bases for Equivariant Graph Learning with Provable k-WL Expressive Power.

Orthogonal Bases for Equivariant Graph Learning with Provable k-WL Expressive Power

Jia He and Maggie X. Cheng from Illinois Institute of Technology have found a way to build GNNs with the same k-WL and k-FWL expressive power as the best known high-order networks — using a fraction of the parameters and…

Orthogonal Bases for Equivariant Graph Learning with Provable k-WL Expressive Power Read More »

How to Build Multi-Agent Systems with Claude Opus 4.7 & Gemini Flash 3.5 (2026).

How to Build Multi-Agent Systems with Claude Opus 4.7 & Gemini Flash 3.5 (2026)

You are building a research pipeline that needs to search the web, process a dozen PDFs, extract structured data from tables, and produce a cited written report. You set it up as a single Claude Opus 4.7 agent. The quality…

How to Build Multi-Agent Systems with Claude Opus 4.7 & Gemini Flash 3.5 (2026) Read More »

Claude vs ChatGPT 5: Which AI Wins for Agent Building? (2026).

Claude vs ChatGPT 5: Which AI Wins for Agent Building? (2026)

Your team has built on ChatGPT for two years. The new project is a customer facing agent with complex workflows, several tool integrations, and strict output constraints. Someone suggests evaluating Claude before you commit. Just before the architecture meeting, somebody…

Claude vs ChatGPT 5: Which AI Wins for Agent Building? (2026) Read More »