Papers › A high-bias, low-variance introduction to Machine Learning for physicists

A high-bias, low-variance introduction to Machine Learning for physicists

23 Mar 2018arXiv:1803.08823archive 2025-07-28

Pankaj Mehta, Marin Bukov, Ching-Hao Wang, Alexandre G. R. Day, Clint Richardson, Charles K. Fisher, David J. Schwab

Machine Learning (ML) is one of the most exciting and dynamic areas of modern research and application. The purpose of this review is to provide an introduction to the core concepts and tools of machine learning in a manner easily understood and intuitive to physicists. The review begins by covering fundamental concepts in ML and modern statistics such as the bias-variance tradeoff, overfitting, regularization, generalization, and gradient descent before moving on to more advanced topics in both supervised and unsupervised learning. Topics covered in the review include ensemble models, deep learning and neural networks, clustering and data visualization, energy-based models (including MaxEnt models and Restricted Boltzmann Machines), and variational methods. Throughout, we emphasize the many natural connections between ML and statistical physics. A notable aspect of the review is the use of Python Jupyter notebooks to introduce modern ML/statistical packages to readers using physics-inspired datasets (the Ising Model and Monte-Carlo simulations of supersymmetric decays of proton-proton collisions). We conclude with an extended outlook discussing possible uses of machine learning for furthering our understanding of the physical world as well as open problems in ML where physicists may be able to contribute. (Notebooks are available at https://physics.bu.edu/~pankajm/MLnotebooks.html )

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1803.08823")

Code

Syntology Ran 2 of 14 code samples harvested from 2 repositories linked to this paper; 12 have no recorded run. Of those that ran: 2 ran · honoured contract.

By repository: official repository: 12 samples from 1 repository, 0 ran; community (archive-listed): 2 samples from 1 repository, 2 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

drckf/mlreview_notebooks officialmentioned in papermentioned on GitHubNOASSERTION report
alexandreday/fast_density_clustering officialmentioned in paperBSD-3-Clause report
HeuJulien/ML-P6-2020 mentioned on GitHub report
bhartl/generative-models mentioned on GitHubpytorch report
nealav/resources mentioned on GitHub report
pluflou/MLreviewNotebooks mentioned on GitHubNOASSERTION report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

14 samples harvested; 2 ran; 2 honoured the contract we drafted; 12 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

2ran · honoured contract
12unverified

Licence: 0 of the 14 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

assign_cluster alexandreday/fast_density_clustering/fdc/fdc.py official repository unverified BSD-3-Clause (permissive) · db3412e2a5b837e5 · report
build_dendrogram alexandreday/fast_density_clustering/fdc/hierarchy.py official repository unverified BSD-3-Clause (permissive) · 476322d456894b27 · report
check_cluster_stability alexandreday/fast_density_clustering/fdc/fdc.py official repository unverified BSD-3-Clause (permissive) · f89e6527245da3ea · report
compute_linkage_matrix alexandreday/fast_density_clustering/fdc/hierarchy.py official repository unverified BSD-3-Clause (permissive) · 694c8cdd97e029f8 · report
epanechnikov_kde_from_nn alexandreday/fast_density_clustering/fdc/density_estimation.py official repository unverified BSD-3-Clause (permissive) · 2dbbd2500f04c588 · report
index_greater alexandreday/fast_density_clustering/fdc/fdc.py official repository unverified BSD-3-Clause (permissive) · 3dd7095c447d224d · report
load_dataset alexandreday/fast_density_clustering/dev/fdc_explore.py official repository unverified BSD-3-Clause (permissive) · 4e3dcdb9ac7cc864 · report
load_datasets alexandreday/fast_density_clustering/benchmarks/benchmark_quality.py official repository unverified BSD-3-Clause (permissive) · 390c2f6cdaafd18b · report
measure_once alexandreday/fast_density_clustering/benchmarks/benchmark_sota_scaling.py official repository unverified BSD-3-Clause (permissive) · 00952f42e655d99e · report
most_common alexandreday/fast_density_clustering/fdc/classify.py official repository unverified BSD-3-Clause (permissive) · 2f5b553b69c63c9c · report
round_float alexandreday/fast_density_clustering/fdc/density_estimation.py official repository unverified BSD-3-Clause (permissive) · 736b84d0e71fb415 · report
run_benchmark alexandreday/fast_density_clustering/benchmarks/benchmark_rust_vs_python.py official repository unverified BSD-3-Clause (permissive) · 1b865279c9fa6b21 · report
first_moment bhartl/generative-models/gempy/maximum_entropy_model.py community (archive-listed) ran · honoured contract fingerprinted MIT (permissive) · 6dded5a29152ca36 · report
second_moment bhartl/generative-models/gempy/maximum_entropy_model.py community (archive-listed) ran · honoured contract fingerprinted MIT (permissive) · 32d26340eca2f3c8 · report

Tasks

BIG-bench Machine LearningClusteringData VisualizationVocal Bursts Intensity Prediction

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections