Towards Data Science By Ari Joury, PhD

I Pitted XGBoost Against Logistic Regression on 358 Matches. The Boring Model Won.

Read the original on Towards Data Science →

A concrete bias–variance lesson: why the smallest model had the best cross-validated fit, and how to know when to reach for the big hammer. The post I Pitted XGBoost Against Logistic Regression on 358 Matches.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at Towards Data Science.

Towards Data Science
Aug 20

The LLM Judge That Kept Agreeing With Itself

The article recounts a production incident where a large language model (LLM) was used to evaluate the outputs of another LLM, and the judging model consistently agreed with itself. It explores the implications of relying on one model to assess another’s work, highlighting the potential pitfalls of such an approach. The narrative offers lessons on the limits of trusting automated evaluation systems in real‑world deployments.

By Priyansh Bhardwaj
arXiv Machine Learning
Sep 22

EvoRank: LLM-Guided Evolution of Multi-Objective Learning-to-Rank Pipelines

EvoRank is an open autonomous ranking engineer that uses an LLM-guided evolutionary loop to automatically design complete Learning-to-Rank pipelines—including features, models, losses, and ensembles—for multi-objective e-commerce search. On the Expedia ICDM 2013 dataset, EvoRank converged within 50 iterations on interpretable pipelines that outperform an Optuna-tuned LambdaMART on 60k held-out queries and rank in the top 6 % of the original competition. The authors also introduce a headroom gate that predicts whether the evolutionary loop will be worthwhile before any LLM computation, and they release the system, auditing tools, and a catalog of failure modes to help teams apply the method to their own ranking stacks.

By Rayhan Patel, Shabaz Patel
Simon Willison
Sep 1

Claude Fable 5.1 made me a really nice animated pelican

The article discusses Anthropic’s Claude Fable 5.1 release, highlighting its claimed improvements in coding, knowledge work, and problem‑solving, particularly a 52.6% score on the new Terminal‑Bench‑Science 0.1 benchmark. The author examines the model’s performance on the pelican benchmark, noting that Fable 5.1’s five reasoning levels (low, medium, high, xhigh, max) sometimes skip reasoning entirely for certain prompts, as evidenced by token counts and cost metrics. The piece provides detailed transcript data for each reasoning level when generating an SVG of a pelican riding a bicycle.