Tagged articles
overfitting
13 articles · Page 1 of 1
A study testing 50 models on forward and inverse kinematics tasks reveals that GPT-6 Astra, GPT-6.1 Sol, and Gemini Argon overfit to Franka Panda robot parameters, suggesting their robot capabilities come from specialized training data rather than emergent general intelligence.
Franka PandaGPT-6 Astraemergent abilities
0 likes · 9 min read

This article compiles the ten core questions from a Tencent algorithm interview, covering overfitting, regularization, generalization error, dropout, residual connections, attention, embeddings, BART vs BERT, instruction‑tuning data, LLM hallucination, and why GANs collapse more than diffusion models, with concise explanations and interview‑ready tips.
GANLLMRegularization
0 likes · 22 min read

This article explains what overfitting is, introduces dropout as a regularization technique, describes how dropout randomly deactivates neurons during training and rescales outputs during inference, discusses its limitations, and outlines why large language models may use alternative strategies.
AIDropoutRegularization
0 likes · 11 min read

The article reviews recent generative‑AI breakthroughs such as GPT‑5 and AI software engineers, explains that AI systems are deterministic rather than black boxes, and then teaches neural‑network fundamentals—including activation functions, back‑propagation, and a hands‑on MNIST digit‑recognition example with discussion of overfitting and regularization.
Gradient DescentMNISTactivation functions
0 likes · 17 min read

The study reveals that industrial deep click‑through‑rate models often overfit dramatically after the first training epoch—a “one‑epoch phenomenon” caused by the embedding‑plus‑MLP architecture, fast optimizers, and highly sparse features, with performance dropping sharply unless sparsity is reduced or training is limited to a single pass.
CTREmbeddingMLP
0 likes · 15 min read

This article explains machine learning fundamentals using a house‑location classification example, illustrating how decision trees create split points from features like elevation and price, grow recursively, achieve high training accuracy, and reveal overfitting when evaluated on unseen test data.
Classificationartificial intelligencedata visualization
0 likes · 11 min read


ITPUBDec 13, 2021 · Artificial Intelligence
This article explains how data augmentation can alleviate overfitting by artificially expanding limited training sets, outlines common transformation techniques for images, text, and audio, and discusses the method's benefits, practical applications, and inherent limitations for machine‑learning practitioners.
Computer VisionData Augmentationdeep learning
0 likes · 6 min read

This article explains how big data enhances machine learning by enabling finer-grained data characterization, improving confidence in statistical conclusions, and supporting smarter learning through multiple stages of model development, illustrated with concrete examples and a discussion of sample size dilemmas.
big datadata analysismachine learning
0 likes · 10 min read

The article presents a series of insightful diagrams that illustrate core machine‑learning concepts such as the relationship between training and test error, the dangers of under‑ and over‑fitting, Occam’s razor, feature interactions, discriminative versus generative models, loss functions, least‑squares geometry, and sparsity.
Loss Functionsbias‑variancefeature engineering
0 likes · 6 min read

Using a stroll conversation among Ant Financial AI team members, the article likens machine learning concepts such as overfitting, generalization, supervised and unsupervised learning, transfer learning, and model interpretability to human development stages, illustrating how both require diverse data, training, and evolving algorithms.
AI EducationGeneralizationhuman development
0 likes · 10 min read

Decision trees are tree-structured classifiers that split data using attributes chosen for maximal purity measured by Gini impurity or entropy, with algorithms like ID3 selecting splits by information gain, while overfitting is mitigated through constraints and pruning techniques such as REP, PEP, and CCP.
AlgorithmGini ImpurityID3
0 likes · 13 min read

This article presents a curated collection of insightful machine‑learning diagrams that illustrate key concepts such as test versus training error, under‑ and over‑fitting, Occam’s razor, feature interactions, irrelevant features, basis functions, discriminative versus generative models, loss functions, least‑squares geometry, and sparsity.
Loss FunctionsOccam's razorfeature selection
0 likes · 6 min read

This article presents a series of data‑science questions and expert answers covering overfitting, experimental design for user behavior, the distinction between tall and wide data, detecting chart junk, outlier detection methods, extreme‑value theory for rare events, recommendation‑engine fundamentals, and techniques for visualizing high‑dimensional data.
Experimental Designchart junkextreme value theory
0 likes · 18 min read
