#hyperparameter
What is a hyperparameter in AI?

A hyperparameter is a setting that decides how an AI learns. It isn’t worked out during training; people (or a tool that searches for settings) choose it before training starts.
What is a hyperparameter in AI?
A hyperparameter is a setting that decides how an AI learns, chosen before training by people (or by a tool that searches for settings). Here is how it differs from a parameter, what happens when you change the learning rate, batch size and number of epochs, grid search versus random search, why you choose on a validation set, and how big AIs are tuned, explained with pictures and a quick quiz.
naru.news
November 9, 2026 at 10:09 PM
Sweep Less, Steer More: Using Activation Steering Geometry for Reduced Hyperparameter Search
Read more: https://arxiv.org/html/2611.01496v1
November 6, 2026 at 5:42 PM
🔧 This head-to-head comparison highlights the crucial role of hyperparameter tuning in ML model performance.
November 5, 2026 at 7:39 PM
Optuna.jl - Hyperparameter optimization with Optuna in Julia — Julian Trommer, Lars Mikelsons

https://youtu.be/HeeTYUy3Cas
Optuna.jl - Hyperparameter optimization with Optuna in Julia | Trommer, Mikelsons
The Julia Programming Language
youtu.be
November 2, 2026 at 7:01 PM
My next newsletter, "Your hyperparameter search is probably bigger than it needs to be", is coming Monday. Subscribe to get it and stay in the loop on everything I'm creating.
https://tech.trainindata.com
November 6, 2026 at 8:04 AM
Kevin Dick, Katie Lonsway: ExaTune: Exhaustive Hyperparameter Landscape Exploration at Scale https://arxiv.org/abs/2611.03867 https://arxiv.org/pdf/2611.03867 https://arxiv.org/html/2611.03867
November 5, 2026 at 6:42 AM
Artem Chistyakov, Renat Sergazinov, Artem Babenko: Beyond Foundation Models: PFN Priors Improve Tabular Hyperparameter Optimization https://arxiv.org/abs/2611.05141 https://arxiv.org/pdf/2611.05141 https://arxiv.org/html/2611.05141
November 5, 2026 at 6:44 AM
The e-means project introduces a modern mini-batch optimization method for k-means clustering that uses exponential moving averages. It achieves significantly faster convergence and better loss than Lloyd’s algorithm, requiring no hyperparameter tuning.
E-means: 10x faster k-means at equal loss (199)
Modern optimization and scaling laws for k-means clustering
news.ycombinator.com
November 9, 2026 at 10:42 PM
Data-Efficient Scaling-Law Discovery for Recommendation Systems via Coupled Hyperparameter Scaling

Meta learns scaling laws for ranking models from few trial runs and picks configurations under a compute budget.

📝 arxiv.org/abs/2611.05643
Data-Efficient Scaling-Law Discovery for Recommendation Systems via Coupled Hyperparameter Scaling
Large-scale ranking and recommendation models of Web platforms benefit from increased compute much as large language models do, and their scaling behavior is broadly power-law in form. Yet ranking mod...
arxiv.org
November 5, 2026 at 9:44 PM
I practiced hyperparameter tuning by comparing different max_depth and n_estimators values. Testing combinations on validation data helped me see that bigger models aren't always better.

#MLZoomcamp #MachineLearning
November 2, 2026 at 8:24 PM
Tuning gradient boosting models without successive halving or Hyperband probably wastes a lot of compute.

Learn to speed up your search in my @udemy course 👇
Accelerate Hyperparameter Tuning with Multifidelity Models
Use successive halving in scikit-learn to allocate resources progressively and find strong configurations more efficient
www.udemy.com
November 6, 2026 at 5:03 PM
Kevin Dick, Katie Lonsway: ExaTune: Exhaustive Hyperparameter Landscape Exploration at Scale https://arxiv.org/abs/2611.03867 https://arxiv.org/pdf/2611.03867 https://arxiv.org/html/2611.03867
November 4, 2026 at 6:42 AM
Artem Chistyakov, Renat Sergazinov, Artem Babenko: Beyond Foundation Models: PFN Priors Improve Tabular Hyperparameter Optimization https://arxiv.org/abs/2611.05141 https://arxiv.org/pdf/2611.05141 https://arxiv.org/html/2611.05141
November 4, 2026 at 6:44 AM
XGBoost has over fifteen hyperparameters that can change how your model performs.

My updated course shows you which ones really matter.

Enroll here 👇
Master Hyperparameter Optimization for Tabular Learning
Master hyperparameter tuning for linear models, random forests, and gradient-boosting trees with grid & random search, Bayesian optimization, and multi-fidelity methods.
www.trainindata.com
November 3, 2026 at 11:03 AM
No evals, no chat template, and a base checkpoint Qwen2.5 doesn't officially ship — but an Apache-2.0 1B reasoning distill with every hyperparameter recorded is a tidy reproducibility artefact. Hard to see it earning a slot on local hardware until someone publishes numbers.
A 1B Reasoning Model With Its Recipe in the Name: OpenThoughts3 Qwen2.5 on Modelers.cn
Modelers.cn — Huawei's Ascend-focused AI model hub — has a new small reasoning model worth a look if you like your experiments transparent.…
aichina.news
November 9, 2026 at 3:59 PM
Detecting Hidden Outliers in Visual AI Datasets with Embeddings and UMAP
Your model's most dangerous vulnerability is rarely a sub-optimal hyperparameter configuration. It is hidden outliers lurking undetected inside your training and evaluation data. In production, vision models frequently fail on rare scenarios that were never surfaced during development: unusual sensor artifacts, unrepresented object variants, corrupted metadata, or bizarre edge-case interactions. Traditional statistical checks—like tracking image resolution, file size, or mean pixel values—fail to detect semantic and compositional anomalies. By leveraging foundation model embeddings, density-based anomaly algorithms like Local Outlier Factor (LOF), and dimensionality reduction with UMAP, you can systematically reveal hidden dataset structure and isolate rogue outliers before training begins. EMBEDDING-BASED OUTLIER DETECTION PIPELINE +-------------------------------------------------------------+ | Raw Image Dataset | | | | | v | | Foundation Model Embedding (CLIP / DINOv2 / SigLIP) | | | | | +-----------------------------+ | | | | | | v v | | Local Outlier Factor (LOF) UMAP 2D Projection | | [Quantitative Anomaly Score] [Visual Cluster Exploration] | | | | | | +-----------------------------+ | | v | | Visual Inspection & Triage in FiftyOne | +-------------------------------------------------------------+ ## The Three Classes of Visual Outliers When inspecting anomalies in visual datasets, outliers typically fall into three distinct technical categories: 1. **Quality and Sensor Anomalies:** Corrupted frames, extreme lens flare, severe compression blockiness, dropped video packets, or infrared sensor bleed. These represent data pipeline defects that should almost always be scrubbed or quarantined. 2. **Semantic and Content Anomalies:** Rare, valid physical scenarios that occur with low frequency: an overturned truck on a highway, an animal running across an industrial floor, or a worker wearing non-standard personal protective equipment. These are valuable operational edge cases that must be preserved and reinforced. 3. **Annotation and Formatting Bugs:** An image tagged with a label from an entirely different ontology, bounding boxes scaled incorrectly, or labels assigned to inverted coordinate axes. Identifying which category an outlier belongs to determines whether you prune the sample, fix its metadata, or curate more examples to support it. ## Extracting Dense Semantic Embeddings Pixel-level distances cannot distinguish between a dark cat and a black leather jacket. Foundation vision models trained via self-supervised learning (DINOv2) or contrastive language-image pretraining (CLIP, SigLIP) solve this by encoding high-level semantic, structural, and stylistic properties into dense feature vectors. import fiftyone as fo import fiftyone.brain as fob # Load dataset dataset = fo.load_dataset("industrial_inspection_v2") # Compute embeddings using a foundation vision backbone fob.compute_similarity( dataset, model="clip-vit-base32-torch", embeddings_field="clip_embeddings", brain_key="clip_sim" ) print("Computed dense embeddings across all dataset samples.") ## Density-Based Anomaly Scoring with Local Outlier Factor A common mistake in outlier detection is calculating global Euclidean or Mahalanobis distance from the dataset centroid. Visual datasets are inherently multimodal: images of outdoor scenes form one dense cluster, while indoor scenes form another with completely different local density. Local Outlier Factor (LOF) solves this by comparing the local density of an image's embedding to the density of its $k$-nearest neighbors: $$\text{LOF}_k(p) = \frac{\sum_{o \in N_k(p)} \frac{\text{lrd}(o)}{\text{lrd}(p)}}{|N_k(p)|}$$ Where $\text{lrd}(p)$ is the local reachability density of point $p$. An LOF score substantially greater than $1.0$ indicates that the sample resides in a sparse region relative to its neighbors, flagging it as an anomaly. from sklearn.neighbors import LocalOutlierFactor import numpy as np # Extract embeddings array from FiftyOne dataset embeddings = np.array(dataset.values("clip_embeddings")) # Fit Local Outlier Factor lof = LocalOutlierFactor(n_neighbors=20, contamination=0.02) outlier_labels = lof.fit_predict(embeddings) anomaly_scores = -lof.negative_outlier_factor_ # Store anomaly scores back onto the dataset dataset.set_values("outlier_score", anomaly_scores.tolist()) # Query the top 1% most severe anomalies outliers_view = dataset.sort_by("outlier_score", reverse=True).limit(50) print(f"Isolated top {len(outliers_view)} outlier candidates for inspection.") ## Visualizing Dataset Manifolds with UMAP Quantitative anomaly scores tell you _which_ images are unusual, but dimensionality reduction tells you _why_. Uniform Manifold Approximation and Projection (UMAP) preserves both local and global neighborhood structures when projecting high-dimensional embeddings down to a 2D plane: # Compute 2D UMAP visualization coordinates fob.compute_visualization( dataset, embeddings="clip_embeddings", method="umap", brain_key="umap_2d" ) # Launch FiftyOne interactive app to inspect clusters session = fo.launch_app(dataset) In the interactive 2D scatter plot: * **Tight, dense clusters** represent standard, well-represented operational scenarios. * **Isolated satellites and rogue points** floating outside major clusters pinpoint rare outliers, mislabeled samples, and corrupted images. Outlier Type | UMAP Geometry | Typical Root Cause | Action Plan ---|---|---|--- **Pipeline Defect** | Far off the manifold, isolated single point | Corrupted sensor frame, black frame | Quarantine and remove from training set **Annotation Error** | Sits inside Cluster A, but labeled as Class B | Human labeler typo or ambiguous definition | Correct ground truth annotation **Operational Edge Case** | Small cluster of 3–5 points detached from main body | Rare physical scenario in the real world | Preserve, balance, and collect companion cases ## Turning Anomaly Detection into Practice Running outlier detection during data ingestion prevents corrupted frames from skewing model weights and ensures that critical real-world edge cases receive explicit attention. To explore related evaluation workflows, review our guide on curating golden trajectories for red-teaming and analyzing vision datasets. To get hands-on experience running embedding searches, LOF audits, and UMAP clustering on real datasets, audit Harpreet Sahota's Coursera course: Hands-on Data Centric Visual AI. ## Frequently asked questions ### What makes visual outliers dangerous in machine learning datasets? Visual outliers can corrupt model decision boundaries, cause catastrophic gradients during training, or represent critical real-world edge cases that models fail to recognize in production. Detecting them early prevents both training instability and operational blind spots. ### Why are foundation model embeddings better than pixel metrics for outlier detection? Raw pixel comparisons only capture low-level color and brightness shifts. Foundation model embeddings (such as CLIP, DINOv2, or SigLIP) map images into a structured semantic space where distance reflects conceptual, compositional, and contextual similarity. ### How does Local Outlier Factor (LOF) differ from simple Euclidean distance? Global Euclidean distance assumes uniform density across the dataset. Local Outlier Factor compares the local density of an object to the local densities of its k-nearest neighbors, correctly identifying anomalies even in regions with variable cluster densities. ### Where can developers practice embedding-based curation workflows? Complete hands-on code examples and guided dataset curation labs are available in Harpreet Sahota's Coursera course, Hands-on Data Centric Visual AI. _This post first appeared as the original article. I'm Harpreet Sahota, Hacker-in-Residence at The Employable Data Scientist, where we help AI and developer-tool teams ship prototypes, evaluations, and technical content. I also host the Artists of Intelligence podcast. For new field notes by email, subscribe on Substack._
dev.to
November 9, 2026 at 2:39 PM
With a few lines of code, Optuna searches the space, prunes bad trials and plots your results.

Automate your hyperparameter tuning with my @udemy course 👇
Automate Hyperparameter Tuning with Optuna
Build framework-agnostic optimization workflows with advanced samplers, pruning, and automated model selection.
www.udemy.com
November 2, 2026 at 5:00 PM
New blog post: "Hyperparameter verification of StcE protein folds in Pedram et al., 2023"
Hyperparameter verification of StcE protein folds in Pedram et al., 2023
The rubber hits the road on ColabFold! I hope that's rubber I'm smelling — although it may be the computer. A replication attempt of a protein fold figure in K. Pedram et al (2023).
blog.chaoticgood.computer
November 3, 2026 at 4:02 AM
Model-agnostic 'Bayesian' optimization (for hyperparameter tuning) using conformalized surrogates in GPopt
https://thierrymoudiki.github.io/blog/2024/12/09/python/bayesconfoptim

#Python #DataScience #MachineLearning #rstats #Techtonique
October 31, 2026 at 2:06 PM
📚 New Arxiv Paper

Title: Distributed Grid Search for Hyperparameter Tuning
Authors: Constan\c{c}a De Herdeiro Cachim, Andrea Martin, Nicola Bastianello

Read more: https://arxiv.org/abs/2610.41537
November 2, 2026 at 8:02 AM
Constan\c{c}a De Herdeiro Cachim, Andrea Martin, Nicola Bastianello: Distributed Grid Search for Hyperparameter Tuning https://arxiv.org/abs/2610.41537 https://arxiv.org/pdf/2610.41537 https://arxiv.org/html/2610.41537
November 2, 2026 at 6:50 AM
If the paper actually merges RL with pretraining, the first thing I’d automate is the hyperparameter sweep — that’s where most of your weekend goes.
October 31, 2026 at 10:56 PM
The paper proposes fitting power laws to transfer hyperparameters with scale and to allocate compute with ensembling.

Source: arXiv cs.LG
Improving Data-Constrained Scaling with Hyperparameter Transfer and Ensembling
Abstract page for arXiv paper 2610.37842: Improving Data-Constrained Scaling with Hyperparameter Transfer and Ensembling
arxiv.org
October 30, 2026 at 7:48 AM
Researchers revealed an innovative approach to training large language models under data constraints, achieving a 14% drop in perplexity through hyperparameter transfer and ensembling, optimizing performance with limited data. https://arxiv.org/abs/2610.37842
Improving Data-Constrained Scaling with Hyperparameter Transfer and Ensembling
ArXiv link for Improving Data-Constrained Scaling with Hyperparameter Transfer and Ensembling
arxiv.org
October 30, 2026 at 8:30 PM