diff --git a/.circleci/config.yml b/.circleci/config.yml
index 1f9a1a02e0f62..7a98f88b813ad 100644
--- a/.circleci/config.yml
+++ b/.circleci/config.yml
@@ -11,7 +11,7 @@ jobs:
           command: |
             source build_tools/shared.sh
             # Include pytest compatibility with mypy
-            pip install pytest ruff $(get_dep mypy min) $(get_dep black min) cython-lint
+            pip install pytest $(get_dep ruff min) $(get_dep mypy min) $(get_dep black min) cython-lint
       - run:
           name: linting
           command: ./build_tools/linting.sh
diff --git a/.codecov.yml b/.codecov.yml
index 54ce77b9c1b0e..f4ecd6e7d8fee 100644
--- a/.codecov.yml
+++ b/.codecov.yml
@@ -30,5 +30,4 @@ ignore:
 - "sklearn/_build_utils"
 - "sklearn/__check_build"
 - "sklearn/_min_dependencies.py"
-- "**/setup.py"
 - "**/conftest.py"
diff --git a/.coveragerc b/.coveragerc
index a8601458a0b07..31f9fa1b4ceae 100644
--- a/.coveragerc
+++ b/.coveragerc
@@ -6,4 +6,3 @@ omit =
     */sklearn/externals/*
     */sklearn/_build_utils/*
     */benchmarks/*
-    **/setup.py
diff --git a/.git-blame-ignore-revs b/.git-blame-ignore-revs
index 1c7043f0bd7ca..b261320543fa7 100644
--- a/.git-blame-ignore-revs
+++ b/.git-blame-ignore-revs
@@ -31,3 +31,6 @@ d4aad64b1eb2e42e76f49db2ccfbe4b4660d092b
 
 # PR 26649: Add isort and ruff rules
 42173fdb34b5aded79664e045cada719dfbe39dc
+
+# PR #28802: Update black to 24.3.0
+c4c546355667b070edd5c892b206aa4a97af9a0b
diff --git a/.github/dependabot.yml b/.github/dependabot.yml
new file mode 100644
index 0000000000000..7ac17eb0442ad
--- /dev/null
+++ b/.github/dependabot.yml
@@ -0,0 +1,21 @@
+version: 2
+updates:
+  # Maintain dependencies for GitHub Actions as recommended in SPEC8:
+  # https://github.com/scientific-python/specs/pull/325
+  # At the time of writing, release critical workflows such as
+  # pypa/gh-action-pypi-publish should use hash-based versioning for security
+  # reasons. This strategy may be generalized to all other github actions
+  # in the future.
+  - package-ecosystem: "github-actions"
+    directory: "/"
+    schedule:
+      interval: "monthly"
+    groups:
+      actions:
+        patterns:
+          - "*"
+    labels:
+      - "Build / CI"
+      - "dependencies"
+    reviewers:
+      - "scikit-learn/core-devs"
diff --git a/.github/workflows/artifact-redirector.yml b/.github/workflows/artifact-redirector.yml
index 3fdbc06fac386..690cacefda935 100644
--- a/.github/workflows/artifact-redirector.yml
+++ b/.github/workflows/artifact-redirector.yml
@@ -15,7 +15,7 @@ jobs:
     name: Run CircleCI artifacts redirector
     steps:
       - name: GitHub Action step
-        uses: larsoner/circleci-artifacts-redirector-action@master
+        uses: scientific-python/circleci-artifacts-redirector-action@v1
         with:
           repo-token: ${{ secrets.GITHUB_TOKEN }}
           api-token: ${{ secrets.CIRCLECI_TOKEN }}
diff --git a/.github/workflows/assign.yml b/.github/workflows/assign.yml
index fa3b6f95a5e95..a69b60ee0f0a0 100644
--- a/.github/workflows/assign.yml
+++ b/.github/workflows/assign.yml
@@ -19,8 +19,11 @@ jobs:
        && !github.event.issue.assignee
     steps:
       - run: |
+          # Using REST API directly because assigning through gh has some severe limitations. For more details, see
+          # https://github.com/scikit-learn/scikit-learn/issues/29395#issuecomment-2206776963
           echo "Assigning issue ${{ github.event.issue.number }} to ${{ github.event.comment.user.login }}"
-          gh issue edit $ISSUE --add-assignee ${{ github.event.comment.user.login }}
+          curl -H "Authorization: token $GH_TOKEN" -d '{"assignees": ["${{ github.event.comment.user.login }}"]}' \
+              https://api.github.com/repos/${{ github.repository }}/issues/${{ github.event.issue.number }}/assignees
           gh issue edit $ISSUE --remove-label "help wanted"
         env:
           GH_TOKEN: ${{ github.token }}
diff --git a/.github/workflows/check-changelog.yml b/.github/workflows/check-changelog.yml
index d5bfc8ef0f430..2c0792136a204 100644
--- a/.github/workflows/check-changelog.yml
+++ b/.github/workflows/check-changelog.yml
@@ -16,7 +16,7 @@ jobs:
         run: |
           echo "PR_NUMBER=${{ github.event.pull_request.number }}" >> $GITHUB_ENV
           echo "TAGGED_MILESTONE=${{ github.event.pull_request.milestone.title }}" >> $GITHUB_ENV
-      - uses: actions/checkout@v3
+      - uses: actions/checkout@v4
         with:
           fetch-depth: '0'
       - name: Check the changelog entry
diff --git a/.github/workflows/check-sdist.yml b/.github/workflows/check-sdist.yml
index c02af711bdb6c..81a13294bdd96 100644
--- a/.github/workflows/check-sdist.yml
+++ b/.github/workflows/check-sdist.yml
@@ -11,7 +11,7 @@ jobs:
 
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@v3
+      - uses: actions/checkout@v4
       - uses: actions/setup-python@v5
         with:
           python-version: '3.9'
diff --git a/.github/workflows/cuda-ci.yml b/.github/workflows/cuda-ci.yml
new file mode 100644
index 0000000000000..9124df6a57ad6
--- /dev/null
+++ b/.github/workflows/cuda-ci.yml
@@ -0,0 +1,45 @@
+name: CUDA GPU
+
+# Only run this workflow when a Pull Request is labeled with the
+# 'CUDA CI' label.
+on:
+  pull_request:
+    types:
+      - labeled
+
+jobs:
+  tests:
+    if: contains(github.event.pull_request.labels.*.name, 'CUDA CI')
+    runs-on:
+      group: cuda-gpu-runner-group
+    # Set this high enough so that the tests can comforatble run. We set a
+    # timeout to make abusing this workflow less attractive.
+    timeout-minutes: 20
+    name: Run Array API unit tests
+    steps:
+      - uses: actions/setup-python@v5
+        with:
+          # XXX: The 3.12.4 release of Python on GitHub Actions is corrupted:
+          # https://github.com/actions/setup-python/issues/886
+          python-version: '3.12.3'
+      - name: Checkout main repository
+        uses: actions/checkout@v4
+      - name: Cache conda environment
+        id: cache-conda
+        uses: actions/cache@v4
+        with:
+          path: ~/conda
+          key: ${{ runner.os }}-build-${{ hashFiles('build_tools/github/create_gpu_environment.sh') }}-${{ hashFiles('build_tools/github/pylatest_conda_forge_cuda_array-api_linux-64_conda.lock') }}
+      - name: Install miniforge
+        if: ${{ steps.cache-conda.outputs.cache-hit != 'true' }}
+        run: bash build_tools/github/create_gpu_environment.sh
+      - name: Install scikit-learn
+        run: |
+          source "${HOME}/conda/etc/profile.d/conda.sh"
+          conda activate sklearn
+          pip install --verbose --no-build-isolation --config-settings editable-verbose=true --editable .
+      - name: Run array API tests
+        run: |
+          source "${HOME}/conda/etc/profile.d/conda.sh"
+          conda activate sklearn
+          pytest -k 'array_api'
diff --git a/.github/workflows/cuda-label-remover.yml b/.github/workflows/cuda-label-remover.yml
new file mode 100644
index 0000000000000..f6a65a2c07d78
--- /dev/null
+++ b/.github/workflows/cuda-label-remover.yml
@@ -0,0 +1,23 @@
+name: Remove "CUDA CI" Label
+
+# This workflow removes the "CUDA CI" label that triggers the actual
+# CUDA CI. It is separate so that we can use the `pull_request_target`
+# trigger which has a API token with write access.
+on:
+  pull_request_target:
+    types:
+      - labeled
+
+# In order to remove the "CUDA CI" label we need to have write permissions for PRs
+permissions:
+  pull-requests: write
+
+jobs:
+  label-remover:
+    if: contains(github.event.pull_request.labels.*.name, 'CUDA CI')
+    name: Remove "CUDA CI" Label
+    runs-on: ubuntu-20.04
+    steps:
+      - uses: actions-ecosystem/action-remove-labels@v1
+        with:
+          labels: CUDA CI
diff --git a/.github/workflows/labeler-title-regex.yml b/.github/workflows/labeler-title-regex.yml
index 10195eca13a73..03de57d66ddb9 100644
--- a/.github/workflows/labeler-title-regex.yml
+++ b/.github/workflows/labeler-title-regex.yml
@@ -15,7 +15,7 @@ jobs:
   labeler:
     runs-on: ubuntu-20.04
     steps:
-    - uses: actions/checkout@v3
+    - uses: actions/checkout@v4
     - uses: actions/setup-python@v5
       with:
         python-version: '3.9'
diff --git a/.github/workflows/lint.yml b/.github/workflows/lint.yml
index fdc993c1b3fdd..e2de3bbde583b 100644
--- a/.github/workflows/lint.yml
+++ b/.github/workflows/lint.yml
@@ -20,7 +20,7 @@ jobs:
 
     steps:
       - name: Checkout code
-        uses: actions/checkout@v3
+        uses: actions/checkout@v4
         with:
           ref: ${{ github.event.pull_request.head.sha }}
 
@@ -33,7 +33,7 @@ jobs:
         run: |
           source build_tools/shared.sh
           # Include pytest compatibility with mypy
-          pip install pytest ruff $(get_dep mypy min) $(get_dep black min) cython-lint
+          pip install pytest $(get_dep ruff min) $(get_dep mypy min) $(get_dep black min) cython-lint
           # we save the versions of the linters to be used in the error message later.
           python -c "from importlib.metadata import version; print(f\"ruff={version('ruff')}\")" >> /tmp/versions.txt
           python -c "from importlib.metadata import version; print(f\"mypy={version('mypy')}\")" >> /tmp/versions.txt
@@ -52,7 +52,7 @@ jobs:
 
       - name: Upload Artifact
         if: always()
-        uses: actions/upload-artifact@v3
+        uses: actions/upload-artifact@v4
         with:
           name: lint-log
           path: |
@@ -72,7 +72,7 @@ jobs:
 
     steps:
       - name: Checkout code
-        uses: actions/checkout@v3
+        uses: actions/checkout@v4
 
       - name: Set up Python
         uses: actions/setup-python@v5
@@ -84,7 +84,7 @@ jobs:
 
       - name: Download artifact
         id: download-artifact
-        uses: actions/download-artifact@v3
+        uses: actions/download-artifact@v4
         with:
           name: lint-log
 
diff --git a/.github/workflows/publish_pypi.yml b/.github/workflows/publish_pypi.yml
index b8940ae133ad9..d21d3d4c4cfe8 100644
--- a/.github/workflows/publish_pypi.yml
+++ b/.github/workflows/publish_pypi.yml
@@ -18,7 +18,7 @@ jobs:
       # IMPORTANT: this permission is mandatory for trusted publishing
       id-token: write
     steps:
-    - uses: actions/checkout@v3
+    - uses: actions/checkout@v4
     - uses: actions/setup-python@v5
       with:
         python-version: '3.8'
@@ -39,10 +39,13 @@ jobs:
       run: |
         python build_tools/github/check_wheels.py
     - name: Publish package to TestPyPI
-      uses: pypa/gh-action-pypi-publish@v1.8.5
+      uses: pypa/gh-action-pypi-publish@ec4db0b4ddc65acdf4bff5fa45ac92d78b56bdf0 # v1.9.0
       with:
-        repository_url: https://test.pypi.org/legacy/
+        repository-url: https://test.pypi.org/legacy/
+        print-hash: true
       if: ${{ github.event.inputs.pypi_repo == 'testpypi' }}
     - name: Publish package to PyPI
-      uses: pypa/gh-action-pypi-publish@v1.8.5
+      uses: pypa/gh-action-pypi-publish@ec4db0b4ddc65acdf4bff5fa45ac92d78b56bdf0 # v1.9.0
       if: ${{ github.event.inputs.pypi_repo == 'pypi' }}
+      with:
+        print-hash: true
diff --git a/.github/workflows/update-lock-files.yml b/.github/workflows/update-lock-files.yml
index 50d62c85d00a6..4f149f58cac07 100644
--- a/.github/workflows/update-lock-files.yml
+++ b/.github/workflows/update-lock-files.yml
@@ -6,6 +6,10 @@ on:
   schedule:
     - cron: '0 5 * * 1'
 
+# In order to add the "CUDA CI" label we need to have write permissions for PRs
+permissions:
+  pull-requests: write
+
 jobs:
   update_lock_files:
     if: github.repository == 'scikit-learn/scikit-learn'
@@ -25,9 +29,8 @@ jobs:
           - name: cirrus-arm
             update_script_args: "--select-tag arm"
             additional_commit_message: "[cirrus arm]"
-          - name: pypy
-            update_script_args: "--select-tag pypy"
-            additional_commit_message: "[pypy]"
+          - name: array-api
+            update_script_args: "--select-tag cuda"
 
     steps:
       - uses: actions/checkout@v4
@@ -43,7 +46,7 @@ jobs:
 
       - name: Create Pull Request
         id: cpr
-        uses: peter-evans/create-pull-request@v5
+        uses: peter-evans/create-pull-request@v6
         with:
           token: ${{ secrets.BOT_GITHUB_TOKEN }}
           push-to-fork: scikit-learn-bot/scikit-learn
@@ -59,6 +62,14 @@ jobs:
             ### Note
             If the CI tasks fail, create a new branch based on this PR and add the required fixes to that branch.
 
+      # The CUDA workflow needs to be triggered explicitly as it uses an expensive runner
+      - name: Trigger additional tests
+        if: steps.cpr.outputs.pull-request-number != '' && matrix.name == 'array-api'
+        env:
+          GH_TOKEN: ${{ github.token }}
+        run: |
+          gh pr edit ${{steps.cpr.outputs.pull-request-number}} --add-label "CUDA CI"
+
       - name: Check Pull Request
         if: steps.cpr.outputs.pull-request-number != ''
         run: |
diff --git a/.github/workflows/update_tracking_issue.yml b/.github/workflows/update_tracking_issue.yml
index d4538fe6848d8..2039089654fea 100644
--- a/.github/workflows/update_tracking_issue.yml
+++ b/.github/workflows/update_tracking_issue.yml
@@ -26,7 +26,7 @@ jobs:
     runs-on: ubuntu-latest
     if: github.repository == 'scikit-learn/scikit-learn' && github.event_name == 'schedule'
     steps:
-      - uses: actions/checkout@v3
+      - uses: actions/checkout@v4
       - uses: actions/setup-python@v5
         with:
           python-version: '3.9'
diff --git a/.github/workflows/wheels.yml b/.github/workflows/wheels.yml
index 1c4255706972f..ea52057f70c66 100644
--- a/.github/workflows/wheels.yml
+++ b/.github/workflows/wheels.yml
@@ -32,7 +32,7 @@ jobs:
 
     steps:
       - name: Checkout scikit-learn
-        uses: actions/checkout@v3
+        uses: actions/checkout@v4
         with:
           ref: ${{ github.event.pull_request.head.sha }}
 
@@ -53,8 +53,6 @@ jobs:
       matrix:
         include:
           # Window 64 bit
-          # Note: windows-2019 is needed for older Python versions:
-          # https://github.com/scikit-learn/scikit-learn/issues/22530
           - os: windows-latest
             python: 39
             platform_id: win_amd64
@@ -88,18 +86,25 @@ jobs:
             python: 312
             platform_id: manylinux_x86_64
             manylinux_image: manylinux2014
+          - os: ubuntu-latest
+            python: 313t
+            platform_id: manylinux_x86_64
+            manylinux_image: manylinux2014
+            # TODO: remove next line when Python 3.13 is released
+            prerelease_pythons: True
+            free_threaded_support: True
 
           # MacOS x86_64
-          - os: macos-latest
+          - os: macos-12
             python: 39
             platform_id: macosx_x86_64
-          - os: macos-latest
+          - os: macos-12
             python: 310
             platform_id: macosx_x86_64
-          - os: macos-latest
+          - os: macos-12
             python: 311
             platform_id: macosx_x86_64
-          - os: macos-latest
+          - os: macos-12
             python: 312
             platform_id: macosx_x86_64
 
@@ -119,7 +124,7 @@ jobs:
 
     steps:
       - name: Checkout scikit-learn
-        uses: actions/checkout@v3
+        uses: actions/checkout@v4
 
       - name: Setup Python
         uses: actions/setup-python@v5
@@ -156,9 +161,9 @@ jobs:
 
       - name: Build and test wheels
         env:
-          CIBW_PRERELEASE_PYTHONS: ${{ matrix.prerelease }}
+          CIBW_PRERELEASE_PYTHONS: ${{ matrix.prerelease_pythons }}
+          CIBW_FREE_THREADED_SUPPORT: ${{ matrix.free_threaded_support }}
           CIBW_ENVIRONMENT: SKLEARN_SKIP_NETWORK_TESTS=1
-            SKLEARN_BUILD_PARALLEL=3
           CIBW_BUILD: cp${{ matrix.python }}-${{ matrix.platform_id }}
           CIBW_ARCHS: all
           CIBW_MANYLINUX_X86_64_IMAGE: ${{ matrix.manylinux_image }}
@@ -169,7 +174,8 @@ jobs:
           CIBW_CONFIG_SETTINGS_WINDOWS: "setup-args=--vsenv"
           CIBW_REPAIR_WHEEL_COMMAND_WINDOWS: bash build_tools/github/repair_windows_wheels.sh {wheel} {dest_dir}
           CIBW_BEFORE_TEST_WINDOWS: bash build_tools/github/build_minimal_windows_image.sh ${{ matrix.python }}
-          CIBW_TEST_REQUIRES: pytest pandas
+          CIBW_TEST_REQUIRES: pytest
+          CIBW_BEFORE_TEST: bash {project}/build_tools/wheels/cibw_before_test.sh
           CIBW_TEST_COMMAND: bash {project}/build_tools/wheels/test_wheels.sh
           CIBW_TEST_COMMAND_WINDOWS: bash {project}/build_tools/github/test_windows_wheels.sh ${{ matrix.python }}
           CIBW_BUILD_VERBOSITY: 1
@@ -177,8 +183,9 @@ jobs:
         run: bash build_tools/wheels/build_wheels.sh
 
       - name: Store artifacts
-        uses: actions/upload-artifact@v3
+        uses: actions/upload-artifact@v4
         with:
+          name: cibw-wheels-cp${{ matrix.python }}-${{ matrix.platform_id }}
           path: wheelhouse/*.whl
 
   update-tracker:
@@ -199,7 +206,7 @@ jobs:
 
     steps:
       - name: Checkout scikit-learn
-        uses: actions/checkout@v3
+        uses: actions/checkout@v4
 
       - name: Setup Python
         uses: actions/setup-python@v5
@@ -208,8 +215,6 @@ jobs:
 
       - name: Build source distribution
         run: bash build_tools/github/build_source.sh
-        env:
-          SKLEARN_BUILD_PARALLEL: 3
 
       - name: Test source distribution
         run: bash build_tools/github/test_source.sh
@@ -217,8 +222,9 @@ jobs:
           SKLEARN_SKIP_NETWORK_TESTS: 1
 
       - name: Store artifacts
-        uses: actions/upload-artifact@v3
+        uses: actions/upload-artifact@v4
         with:
+          name: cibw-sdist
           path: dist/*.tar.gz
 
   # Upload the wheels and the source distribution
@@ -232,12 +238,14 @@ jobs:
 
     steps:
       - name: Checkout scikit-learn
-        uses: actions/checkout@v3
+        uses: actions/checkout@v4
 
       - name: Download artifacts
-        uses: actions/download-artifact@v3
+        uses: actions/download-artifact@v4
         with:
+          pattern: cibw-*
           path: dist
+          merge-multiple: true
 
       - name: Setup Python
         uses: actions/setup-python@v5
@@ -247,6 +255,6 @@ jobs:
           # Secret variables need to be mapped to environment variables explicitly
           SCIKIT_LEARN_NIGHTLY_UPLOAD_TOKEN: ${{ secrets.SCIKIT_LEARN_NIGHTLY_UPLOAD_TOKEN }}
           SCIKIT_LEARN_STAGING_UPLOAD_TOKEN: ${{ secrets.SCIKIT_LEARN_STAGING_UPLOAD_TOKEN }}
-          ARTIFACTS_PATH: dist/artifact
+          ARTIFACTS_PATH: dist
         # Force a replacement if the remote file already exists
         run: bash build_tools/github/upload_anaconda.sh
diff --git a/.gitignore b/.gitignore
index 8a31fc8f542c4..61c89bcb96491 100644
--- a/.gitignore
+++ b/.gitignore
@@ -15,9 +15,13 @@ dist/
 MANIFEST
 doc/sg_execution_times.rst
 doc/_build/
+doc/api/*.rst
 doc/auto_examples/
+doc/css/*
+!doc/css/.gitkeep
 doc/modules/generated/
 doc/datasets/generated/
+doc/index.rst
 doc/min_dependency_table.rst
 doc/min_dependency_substitutions.rst
 *.pdf
@@ -55,6 +59,7 @@ examples/cluster/joblib
 reuters/
 benchmarks/bench_covertype_data/
 benchmarks/HIGGS.csv.gz
+bench_pca_solvers.csv
 
 *.prefs
 .pydevproject
diff --git a/.pre-commit-config.yaml b/.pre-commit-config.yaml
index 83840774441d5..abe14acc7778c 100644
--- a/.pre-commit-config.yaml
+++ b/.pre-commit-config.yaml
@@ -16,7 +16,7 @@ repos:
     hooks:
     -   id: black
 -   repo: https://github.com/pre-commit/mirrors-mypy
-    rev: v1.3.0
+    rev: v1.9.0
     hooks:
      -  id: mypy
         files: sklearn/
@@ -27,3 +27,10 @@ repos:
     # TODO: add the double-quote-cython-strings hook when it's usability has improved:
     # possibility to pass a directory and use it as a check instead of auto-formatter.
     -   id: cython-lint
+-   repo: https://github.com/pre-commit/mirrors-prettier
+    rev: v2.7.1
+    hooks:
+    -   id: prettier
+        files: ^doc/scss/|^doc/js/scripts/
+        exclude: ^doc/js/scripts/vendor/
+        types_or: ["scss", "javascript"]
diff --git a/Makefile b/Makefile
index 52374ba44ff79..66c7a6c0e93a4 100644
--- a/Makefile
+++ b/Makefile
@@ -1,70 +1,27 @@
 # simple makefile to simplify repetitive build env management tasks under posix
 
-# caution: testing won't work on windows, see README
-
 PYTHON ?= python
-CYTHON ?= cython
-PYTEST ?= pytest
-CTAGS ?= ctags
-
-# skip doctests on 32bit python
-BITS := $(shell python -c 'import struct; print(8 * struct.calcsize("P"))')
+DEFAULT_MESON_BUILD_DIR = build/cp$(shell python -c 'import sys; print(f"{sys.version_info.major}{sys.version_info.minor}")' )
 
-all: clean inplace test
+all:
+	@echo "Please use 'make <target>' where <target> is one of"
+	@echo "  dev                  build scikit-learn with Meson"
+	@echo "  clean                clean scikit-learn Meson build. Very rarely needed,"
+	@echo "                       since meson-python recompiles on import."
 
-clean-ctags:
-	rm -f tags
+.PHONY: all
 
-clean: clean-ctags
-	$(PYTHON) setup.py clean
-	rm -rf dist
-
-in: inplace # just a shortcut
-inplace:
-	$(PYTHON) setup.py build_ext -i
+dev: dev-meson
 
 dev-meson:
-	pip install --verbose --no-build-isolation --editable . --config-settings editable-verbose=true
+	pip install --verbose --no-build-isolation --editable . --check-build-dependencies --config-settings editable-verbose=true
+
+clean: clean-meson
 
 clean-meson:
 	pip uninstall -y scikit-learn
-
-test-code: in
-	$(PYTEST) --showlocals -v sklearn --durations=20
-test-sphinxext:
-	$(PYTEST) --showlocals -v doc/sphinxext/
-test-doc:
-ifeq ($(BITS),64)
-	$(PYTEST) $(shell find doc -name '*.rst' | sort)
-endif
-test-code-parallel: in
-	$(PYTEST) -n auto --showlocals -v sklearn --durations=20
-
-test-coverage:
-	rm -rf coverage .coverage
-	$(PYTEST) sklearn --showlocals -v --cov=sklearn --cov-report=html:coverage
-test-coverage-parallel:
-	rm -rf coverage .coverage .coverage.*
-	$(PYTEST) sklearn -n auto --showlocals -v --cov=sklearn --cov-report=html:coverage
-
-test: test-code test-sphinxext test-doc
-
-trailing-spaces:
-	find sklearn -name "*.py" -exec perl -pi -e 's/[ \t]*$$//' {} \;
-
-cython:
-	python setup.py build_src
-
-ctags:
-	# make tags for symbol based navigation in emacs and vim
-	# Install with: sudo apt-get install exuberant-ctags
-	$(CTAGS) --python-kinds=-i -R sklearn
-
-doc: inplace
-	$(MAKE) -C doc html
-
-doc-noplot: inplace
-	$(MAKE) -C doc html-noplot
-
-code-analysis:
-	build_tools/linting.sh
+	# It seems in some cases removing the folder avoids weird compilation
+	# errors (e.g. when switching from numpy>=2 to numpy<2). For some
+	# reason ninja clean -C $(DEFAULT_MESON_BUILD_DIR) is not
+	# enough.
+	rm -rf $(DEFAULT_MESON_BUILD_DIR)
diff --git a/README.rst b/README.rst
index 221855a6302e5..4ac297063c26e 100644
--- a/README.rst
+++ b/README.rst
@@ -1,42 +1,42 @@
 .. -*- mode: rst -*-
 
-|Azure|_ |CirrusCI|_ |Codecov|_ |CircleCI|_ |Nightly wheels|_ |Black|_ |PythonVersion|_ |PyPi|_ |DOI|_ |Benchmark|_
+|Azure| |CirrusCI| |Codecov| |CircleCI| |Nightly wheels| |Black| |PythonVersion| |PyPi| |DOI| |Benchmark|
 
 .. |Azure| image:: https://dev.azure.com/scikit-learn/scikit-learn/_apis/build/status/scikit-learn.scikit-learn?branchName=main
-.. _Azure: https://dev.azure.com/scikit-learn/scikit-learn/_build/latest?definitionId=1&branchName=main
+   :target: https://dev.azure.com/scikit-learn/scikit-learn/_build/latest?definitionId=1&branchName=main
 
 .. |CircleCI| image:: https://circleci.com/gh/scikit-learn/scikit-learn/tree/main.svg?style=shield
-.. _CircleCI: https://circleci.com/gh/scikit-learn/scikit-learn
+   :target: https://circleci.com/gh/scikit-learn/scikit-learn
 
 .. |CirrusCI| image:: https://img.shields.io/cirrus/github/scikit-learn/scikit-learn/main?label=Cirrus%20CI
-.. _CirrusCI: https://cirrus-ci.com/github/scikit-learn/scikit-learn/main
+   :target: https://cirrus-ci.com/github/scikit-learn/scikit-learn/main
 
 .. |Codecov| image:: https://codecov.io/gh/scikit-learn/scikit-learn/branch/main/graph/badge.svg?token=Pk8G9gg3y9
-.. _Codecov: https://codecov.io/gh/scikit-learn/scikit-learn
+   :target: https://codecov.io/gh/scikit-learn/scikit-learn
 
 .. |Nightly wheels| image:: https://github.com/scikit-learn/scikit-learn/workflows/Wheel%20builder/badge.svg?event=schedule
-.. _`Nightly wheels`: https://github.com/scikit-learn/scikit-learn/actions?query=workflow%3A%22Wheel+builder%22+event%3Aschedule
+   :target: https://github.com/scikit-learn/scikit-learn/actions?query=workflow%3A%22Wheel+builder%22+event%3Aschedule
 
 .. |PythonVersion| image:: https://img.shields.io/pypi/pyversions/scikit-learn.svg
-.. _PythonVersion: https://pypi.org/project/scikit-learn/
+   :target: https://pypi.org/project/scikit-learn/
 
 .. |PyPi| image:: https://img.shields.io/pypi/v/scikit-learn
-.. _PyPi: https://pypi.org/project/scikit-learn
+   :target: https://pypi.org/project/scikit-learn
 
 .. |Black| image:: https://img.shields.io/badge/code%20style-black-000000.svg
-.. _Black: https://github.com/psf/black
+   :target: https://github.com/psf/black
 
 .. |DOI| image:: https://zenodo.org/badge/21369/scikit-learn/scikit-learn.svg
-.. _DOI: https://zenodo.org/badge/latestdoi/21369/scikit-learn/scikit-learn
+   :target: https://zenodo.org/badge/latestdoi/21369/scikit-learn/scikit-learn
 
 .. |Benchmark| image:: https://img.shields.io/badge/Benchmarked%20by-asv-blue
-.. _`Benchmark`: https://scikit-learn.org/scikit-learn-benchmarks/
+   :target: https://scikit-learn.org/scikit-learn-benchmarks
 
 .. |PythonMinVersion| replace:: 3.9
 .. |NumPyMinVersion| replace:: 1.19.5
 .. |SciPyMinVersion| replace:: 1.6.0
 .. |JoblibMinVersion| replace:: 1.2.0
-.. |ThreadpoolctlMinVersion| replace:: 2.0.0
+.. |ThreadpoolctlMinVersion| replace:: 3.1.0
 .. |MatplotlibMinVersion| replace:: 3.3.4
 .. |Scikit-ImageMinVersion| replace:: 0.17.2
 .. |PandasMinVersion| replace:: 1.1.5
diff --git a/SECURITY.md b/SECURITY.md
index 18bb99ea3c15c..e2f56a54947e8 100644
--- a/SECURITY.md
+++ b/SECURITY.md
@@ -4,8 +4,8 @@
 
 | Version       | Supported          |
 | ------------- | ------------------ |
-| 1.4.2         | :white_check_mark: |
-| < 1.4.2       | :x:                |
+| 1.5.1         | :white_check_mark: |
+| < 1.5.1       | :x:                |
 
 ## Reporting a Vulnerability
 
diff --git a/asv_benchmarks/asv.conf.json b/asv_benchmarks/asv.conf.json
index 3392925d7a488..ba7b12011acec 100644
--- a/asv_benchmarks/asv.conf.json
+++ b/asv_benchmarks/asv.conf.json
@@ -23,11 +23,7 @@
     //
     // "install_command": ["python -mpip install {wheel_file}"],
     // "uninstall_command": ["return-code=any python -mpip uninstall -y {project}"],
-    // "build_command": [
-    //     "python setup.py build",
-    //     "PIP_NO_BUILD_ISOLATION=false python -mpip wheel --no-deps --no-index -w {build_cache_dir} {build_dir}"
-    // ],
-
+    // "build_command": ["python -m build --wheel -o {build_cache_dir} {build_dir}"],
     // List of branches to benchmark. If not provided, defaults to "master
     // (for git) or "default" (for mercurial).
     "branches": ["main"],
diff --git a/asv_benchmarks/benchmarks/linear_model.py b/asv_benchmarks/benchmarks/linear_model.py
index 7e7b9d33540c6..24153895611df 100644
--- a/asv_benchmarks/benchmarks/linear_model.py
+++ b/asv_benchmarks/benchmarks/linear_model.py
@@ -52,7 +52,6 @@ def make_estimator(self, params):
         estimator = LogisticRegression(
             solver=solver,
             penalty=penalty,
-            multi_class="multinomial",
             tol=0.01,
             n_jobs=n_jobs,
             random_state=0,
diff --git a/azure-pipelines.yml b/azure-pipelines.yml
index 9b0e8c2259f19..3887be64be4a9 100644
--- a/azure-pipelines.yml
+++ b/azure-pipelines.yml
@@ -35,7 +35,7 @@ jobs:
     - bash: |
         source build_tools/shared.sh
         # Include pytest compatibility with mypy
-        pip install pytest ruff $(get_dep mypy min) $(get_dep black min) cython-lint
+        pip install pytest $(get_dep ruff min) $(get_dep mypy min) $(get_dep black min) cython-lint
       displayName: Install linters
     - bash: |
         ./build_tools/linting.sh
@@ -62,63 +62,28 @@ jobs:
         SKLEARN_WARNINGS_AS_ERRORS: '1'
         CHECK_PYTEST_SOFT_DEPENDENCY: 'true'
 
-- template: build_tools/azure/posix-docker.yml
-  # Experimental CPython branch without the Global Interpreter Lock:
-  # https://github.com/colesbury/nogil/
-  #
-  # The nogil build relies on a dedicated PyPI-style index to install patched
-  # versions of NumPy, SciPy and Cython maintained by @colesbury and that
-  # include specific fixes to make them run correctly without relying on the GIL.
-  #
-  # The goal of this CI entry is to make sure that we do not introduce any
-  # dependency on the GIL in scikit-learn itself. An auxiliary goal is to early
-  # detect any regression in the patched build dependencies to report them
-  # upstream. The long-term goal is to be able to stop having to maintain
-  # multiprocessing based workaround / hacks in joblib / loky to make multi-CPU
-  # computing in scikit-learn efficient by default using regular threads.
-  #
-  # If this experimental entry becomes too unstable, feel free to disable it.
+- template: build_tools/azure/posix.yml
+  # CPython 3.13 free-threaded build
   parameters:
-    name: Linux_nogil
-    vmImage: ubuntu-20.04
+    name: Linux_free_threaded
+    vmImage: ubuntu-22.04
     dependsOn: [git_commit, linting]
     condition: |
       and(
         succeeded(),
         not(contains(dependencies['git_commit']['outputs']['commit.message'], '[ci skip]')),
         or(eq(variables['Build.Reason'], 'Schedule'),
-           contains(dependencies['git_commit']['outputs']['commit.message'], '[nogil]'
+           contains(dependencies['git_commit']['outputs']['commit.message'], '[free-threaded]'
           )
         )
       )
     matrix:
-      pylatest_pip_nogil:
-        DOCKER_CONTAINER: 'nogil/python'
-        DISTRIB: 'pip-nogil'
-        LOCK_FILE: './build_tools/azure/python_nogil_lock.txt'
+      pylatest_pip_free_threaded:
+        PYTHON_GIL: '0'
+        DISTRIB: 'pip-free-threaded'
+        LOCK_FILE: './build_tools/azure/cpython_free_threaded_lock.txt'
         COVERAGE: 'false'
 
-- template: build_tools/azure/posix-docker.yml
-  parameters:
-    name: Linux_Nightly_PyPy
-    vmImage: ubuntu-20.04
-    dependsOn: [linting, git_commit]
-    condition: |
-      and(
-        succeeded(),
-        not(contains(dependencies['git_commit']['outputs']['commit.message'], '[ci skip]')),
-        or(
-          eq(variables['Build.Reason'], 'Schedule'),
-          contains(dependencies['git_commit']['outputs']['commit.message'], '[pypy]')
-        )
-      )
-    matrix:
-      pypy3:
-        DOCKER_CONTAINER: 'condaforge/miniforge3:4.10.3-5'
-        DISTRIB: 'conda-pypy3'
-        LOCK_FILE: './build_tools/azure/pypy3_linux-64_conda.lock'
-
-
 - job: Linux_Nightly_Pyodide
   pool:
     vmImage: ubuntu-22.04
@@ -126,9 +91,9 @@ jobs:
     # Need to match Python version and Emscripten version for the correct
     # Pyodide version. For example, for Pyodide version 0.25.1, see
     # https://github.com/pyodide/pyodide/blob/0.25.1/Makefile.envs
-    PYODIDE_VERSION: '0.25.1'
-    EMSCRIPTEN_VERSION: '3.1.46'
-    PYTHON_VERSION: '3.11.3'
+    PYODIDE_VERSION: '0.26.0'
+    EMSCRIPTEN_VERSION: '3.1.58'
+    PYTHON_VERSION: '3.12.1'
 
   dependsOn: [git_commit, linting]
   condition: |
@@ -243,7 +208,6 @@ jobs:
         SKLEARN_ENABLE_DEBUG_CYTHON_DIRECTIVES: '1'
         SKLEARN_RUN_FLOAT32_TESTS: '1'
         SKLEARN_TESTS_GLOBAL_RANDOM_SEED: '2'  # non-default seed
-        BUILD_WITH_SETUPTOOLS: 'true'
       # Linux environment to test the latest available dependencies.
       # It runs tests requiring lightgbm, pandas and PyAMG.
       pylatest_pip_openblas_pandas:
@@ -271,7 +235,7 @@ jobs:
       )
     matrix:
       debian_atlas_32bit:
-        DOCKER_CONTAINER: 'i386/debian:11.2'
+        DOCKER_CONTAINER: 'i386/debian:12'
         DISTRIB: 'debian-32'
         COVERAGE: "true"
         LOCK_FILE: './build_tools/azure/debian_atlas_32bit_lock.txt'
@@ -282,7 +246,7 @@ jobs:
 - template: build_tools/azure/posix.yml
   parameters:
     name: macOS
-    vmImage: macOS-11
+    vmImage: macOS-12
     dependsOn: [linting, git_commit, Ubuntu_Jammy_Jellyfish]
     # Runs when dependencies succeeded or skipped
     condition: |
diff --git a/benchmarks/bench_covertype.py b/benchmarks/bench_covertype.py
index 5b8cdd588c8ee..243cce03a632f 100644
--- a/benchmarks/bench_covertype.py
+++ b/benchmarks/bench_covertype.py
@@ -41,9 +41,8 @@
 
 """
 
-# Author: Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#         Arnaud Joly <arnaud.v.joly@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import argparse
 import os
diff --git a/benchmarks/bench_isolation_forest_predict.py b/benchmarks/bench_isolation_forest_predict.py
new file mode 100644
index 0000000000000..f16e65cf19511
--- /dev/null
+++ b/benchmarks/bench_isolation_forest_predict.py
@@ -0,0 +1,213 @@
+"""
+==========================================
+IsolationForest prediction benchmark
+==========================================
+A test of IsolationForest on classical anomaly detection datasets.
+
+The benchmark is run as follows:
+1. The dataset is randomly split into a training set and a test set, both
+assumed to contain outliers.
+2. Isolation Forest is trained on the training set fixed at 1000 samples.
+3. The test samples are scored using the trained model at:
+    - 1000, 10000, 50000 samples
+    - 10, 100, 1000 features
+    - 0.01, 0.1, 0.5 contamination
+    - 1, 2, 3, 4 n_jobs
+
+We compare the prediction time at the very end.
+
+Here are instructions for running this benchmark to compare runtime against main branch:
+
+1. Build and run on a branch or main, e.g. for a branch named `pr`:
+
+```bash
+python bench_isolation_forest_predict.py bench ~/bench_results pr
+```
+
+2. Plotting to compare two branches `pr` and `main`:
+
+```bash
+python bench_isolation_forest_predict.py plot ~/bench_results pr main results_image.png
+```
+"""
+
+import argparse
+from collections import defaultdict
+from pathlib import Path
+from time import time
+
+import numpy as np
+import pandas as pd
+from joblib import parallel_config
+
+from sklearn.ensemble import IsolationForest
+
+print(__doc__)
+
+
+def get_data(
+    n_samples_train, n_samples_test, n_features, contamination=0.1, random_state=0
+):
+    """Function based on code from: https://scikit-learn.org/stable/
+    auto_examples/ensemble/plot_isolation_forest.html#sphx-glr-auto-
+    examples-ensemble-plot-isolation-forest-py
+    """
+    rng = np.random.RandomState(random_state)
+
+    X = 0.3 * rng.randn(n_samples_train, n_features)
+    X_train = np.r_[X + 2, X - 2]
+
+    X = 0.3 * rng.randn(n_samples_test, n_features)
+    X_test = np.r_[X + 2, X - 2]
+
+    n_outliers = int(np.floor(contamination * n_samples_test))
+    X_outliers = rng.uniform(low=-4, high=4, size=(n_outliers, n_features))
+
+    outlier_idx = rng.choice(np.arange(0, n_samples_test), n_outliers, replace=False)
+    X_test[outlier_idx, :] = X_outliers
+
+    return X_train, X_test
+
+
+def plot(args):
+    import matplotlib.pyplot as plt
+    import seaborn as sns
+
+    bench_results = Path(args.bench_results)
+    pr_name = args.pr_name
+    main_name = args.main_name
+    image_path = args.image_path
+
+    results_path = Path(bench_results)
+    pr_path = results_path / f"{pr_name}.csv"
+    main_path = results_path / f"{main_name}.csv"
+    image_path = results_path / image_path
+
+    df_pr = pd.read_csv(pr_path).assign(branch=pr_name)
+    df_main = pd.read_csv(main_path).assign(branch=main_name)
+
+    # Merge the two datasets on the common columns
+    merged_data = pd.merge(
+        df_pr,
+        df_main,
+        on=["n_samples_test", "n_jobs"],
+        suffixes=("_pr", "_main"),
+    )
+
+    # Set up the plotting grid
+    sns.set(style="whitegrid", context="notebook", font_scale=1.5)
+
+    # Create a figure with subplots
+    fig, axes = plt.subplots(1, 2, figsize=(18, 6), sharex=True, sharey=True)
+
+    # Plot predict time as a function of n_samples_test with different n_jobs
+    print(merged_data["n_jobs"].unique())
+    ax = axes[0]
+    sns.lineplot(
+        data=merged_data,
+        x="n_samples_test",
+        y="predict_time_pr",
+        hue="n_jobs",
+        style="n_jobs",
+        markers="o",
+        ax=ax,
+        legend="full",
+    )
+    ax.set_title(f"Predict Time vs. n_samples_test - {pr_name} branch")
+    ax.set_ylabel("Predict Time (Seconds)")
+    ax.set_xlabel("n_samples_test")
+
+    ax = axes[1]
+    sns.lineplot(
+        data=merged_data,
+        x="n_samples_test",
+        y="predict_time_main",
+        hue="n_jobs",
+        style="n_jobs",
+        markers="X",
+        dashes=True,
+        ax=ax,
+        legend=None,
+    )
+    ax.set_title(f"Predict Time vs. n_samples_test - {main_name} branch")
+    ax.set_ylabel("Predict Time")
+    ax.set_xlabel("n_samples_test")
+
+    # Adjust layout and display the plots
+    plt.tight_layout()
+    fig.savefig(image_path, bbox_inches="tight")
+    print(f"Saved image to {image_path}")
+
+
+def bench(args):
+    results_dir = Path(args.bench_results)
+    branch = args.branch
+    random_state = 1
+
+    results = defaultdict(list)
+
+    # Loop over all datasets for fitting and scoring the estimator:
+    n_samples_train = 1000
+    for n_samples_test in [
+        1000,
+        10000,
+        50000,
+    ]:
+        for n_features in [10, 100, 1000]:
+            for contamination in [0.01, 0.1, 0.5]:
+                for n_jobs in [1, 2, 3, 4]:
+                    X_train, X_test = get_data(
+                        n_samples_train,
+                        n_samples_test,
+                        n_features,
+                        contamination,
+                        random_state,
+                    )
+
+                    print("--- Fitting the IsolationForest estimator...")
+                    model = IsolationForest(n_jobs=-1, random_state=random_state)
+                    tstart = time()
+                    model.fit(X_train)
+                    fit_time = time() - tstart
+
+                    # clearcache
+                    for _ in range(1000):
+                        1 + 1
+                    with parallel_config("threading", n_jobs=n_jobs):
+                        tstart = time()
+                        model.decision_function(X_test)  # the lower, the more abnormal
+                        predict_time = time() - tstart
+
+                    results["predict_time"].append(predict_time)
+                    results["fit_time"].append(fit_time)
+                    results["n_samples_train"].append(n_samples_train)
+                    results["n_samples_test"].append(n_samples_test)
+                    results["n_features"].append(n_features)
+                    results["contamination"].append(contamination)
+                    results["n_jobs"].append(n_jobs)
+
+    df = pd.DataFrame(results)
+    df.to_csv(results_dir / f"{branch}.csv", index=False)
+
+
+if __name__ == "__main__":
+    parser = argparse.ArgumentParser()
+
+    # parse arguments for benchmarking
+    subparsers = parser.add_subparsers()
+    bench_parser = subparsers.add_parser("bench")
+    bench_parser.add_argument("bench_results")
+    bench_parser.add_argument("branch")
+    bench_parser.set_defaults(func=bench)
+
+    # parse arguments for plotting
+    plot_parser = subparsers.add_parser("plot")
+    plot_parser.add_argument("bench_results")
+    plot_parser.add_argument("pr_name")
+    plot_parser.add_argument("main_name")
+    plot_parser.add_argument("image_path")
+    plot_parser.set_defaults(func=plot)
+
+    # enable the parser and run the relevant function
+    args = parser.parse_args()
+    args.func(args)
diff --git a/benchmarks/bench_isotonic.py b/benchmarks/bench_isotonic.py
index 556c452fa3323..be2ff6548cb92 100644
--- a/benchmarks/bench_isotonic.py
+++ b/benchmarks/bench_isotonic.py
@@ -13,7 +13,7 @@
 
 import argparse
 import gc
-from datetime import datetime
+from timeit import default_timer
 
 import matplotlib.pyplot as plt
 import numpy as np
@@ -52,9 +52,9 @@ def bench_isotonic_regression(Y):
     """
     gc.collect()
 
-    tstart = datetime.now()
+    tstart = default_timer()
     isotonic_regression(Y)
-    return (datetime.now() - tstart).total_seconds()
+    return default_timer() - tstart
 
 
 if __name__ == "__main__":
diff --git a/benchmarks/bench_mnist.py b/benchmarks/bench_mnist.py
index a0c39ca9c5ea4..5745a6d1e3882 100644
--- a/benchmarks/bench_mnist.py
+++ b/benchmarks/bench_mnist.py
@@ -26,9 +26,8 @@
     dummy                         0.00s       0.01s       0.8973
 """
 
-# Author: Issam H. Laradji
-#         Arnaud Joly <arnaud.v.joly@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import argparse
 import os
@@ -84,10 +83,10 @@ def load_data(dtype=np.float32, order="F"):
     "ExtraTrees": ExtraTreesClassifier(),
     "RandomForest": RandomForestClassifier(),
     "Nystroem-SVM": make_pipeline(
-        Nystroem(gamma=0.015, n_components=1000), LinearSVC(C=100, dual="auto")
+        Nystroem(gamma=0.015, n_components=1000), LinearSVC(C=100)
     ),
     "SampledRBF-SVM": make_pipeline(
-        RBFSampler(gamma=0.015, n_components=1000), LinearSVC(C=100, dual="auto")
+        RBFSampler(gamma=0.015, n_components=1000), LinearSVC(C=100)
     ),
     "LogisticRegression-SAG": LogisticRegression(solver="sag", tol=1e-1, C=1e4),
     "LogisticRegression-SAGA": LogisticRegression(solver="saga", tol=1e-1, C=1e4),
diff --git a/benchmarks/bench_pca_solvers.py b/benchmarks/bench_pca_solvers.py
new file mode 100644
index 0000000000000..337af3a42e900
--- /dev/null
+++ b/benchmarks/bench_pca_solvers.py
@@ -0,0 +1,165 @@
+# %%
+#
+# This benchmark compares the speed of PCA solvers on datasets of different
+# sizes in order to determine the best solver to select by default via the
+# "auto" heuristic.
+#
+# Note: we do not control for the accuracy of the solvers: we assume that all
+# solvers yield transformed data with similar explained variance. This
+# assumption is generally true, except for the randomized solver that might
+# require more power iterations.
+#
+# We generate synthetic data with dimensions that are useful to plot:
+# - time vs n_samples for a fixed n_features and,
+# - time vs n_features for a fixed n_samples for a fixed n_features.
+import itertools
+from math import log10
+from time import perf_counter
+
+import matplotlib.pyplot as plt
+import numpy as np
+import pandas as pd
+
+from sklearn import config_context
+from sklearn.decomposition import PCA
+
+REF_DIMS = [100, 1000, 10_000]
+data_shapes = []
+for ref_dim in REF_DIMS:
+    data_shapes.extend([(ref_dim, 10**i) for i in range(1, 8 - int(log10(ref_dim)))])
+    data_shapes.extend(
+        [(ref_dim, 3 * 10**i) for i in range(1, 8 - int(log10(ref_dim)))]
+    )
+    data_shapes.extend([(10**i, ref_dim) for i in range(1, 8 - int(log10(ref_dim)))])
+    data_shapes.extend(
+        [(3 * 10**i, ref_dim) for i in range(1, 8 - int(log10(ref_dim)))]
+    )
+
+# Remove duplicates:
+data_shapes = sorted(set(data_shapes))
+
+print("Generating test datasets...")
+rng = np.random.default_rng(0)
+datasets = [rng.normal(size=shape) for shape in data_shapes]
+
+
+# %%
+def measure_one(data, n_components, solver, method_name="fit"):
+    print(
+        f"Benchmarking {solver=!r}, {n_components=}, {method_name=!r} on data with"
+        f" shape {data.shape}"
+    )
+    pca = PCA(n_components=n_components, svd_solver=solver, random_state=0)
+    timings = []
+    elapsed = 0
+    method = getattr(pca, method_name)
+    with config_context(assume_finite=True):
+        while elapsed < 0.5:
+            tic = perf_counter()
+            method(data)
+            duration = perf_counter() - tic
+            timings.append(duration)
+            elapsed += duration
+    return np.median(timings)
+
+
+SOLVERS = ["full", "covariance_eigh", "arpack", "randomized", "auto"]
+measurements = []
+for data, n_components, method_name in itertools.product(
+    datasets, [2, 50], ["fit", "fit_transform"]
+):
+    if n_components >= min(data.shape):
+        continue
+    for solver in SOLVERS:
+        if solver == "covariance_eigh" and data.shape[1] > 5000:
+            # Too much memory and too slow.
+            continue
+        if solver in ["arpack", "full"] and log10(data.size) > 7:
+            # Too slow, in particular for the full solver.
+            continue
+        time = measure_one(data, n_components, solver, method_name=method_name)
+        measurements.append(
+            {
+                "n_components": n_components,
+                "n_samples": data.shape[0],
+                "n_features": data.shape[1],
+                "time": time,
+                "solver": solver,
+                "method_name": method_name,
+            }
+        )
+measurements = pd.DataFrame(measurements)
+measurements.to_csv("bench_pca_solvers.csv", index=False)
+
+# %%
+all_method_names = measurements["method_name"].unique()
+all_n_components = measurements["n_components"].unique()
+
+for method_name in all_method_names:
+    fig, axes = plt.subplots(
+        figsize=(16, 16),
+        nrows=len(REF_DIMS),
+        ncols=len(all_n_components),
+        sharey=True,
+        constrained_layout=True,
+    )
+    fig.suptitle(f"Benchmarks for PCA.{method_name}, varying n_samples", fontsize=16)
+
+    for row_idx, ref_dim in enumerate(REF_DIMS):
+        for n_components, ax in zip(all_n_components, axes[row_idx]):
+            for solver in SOLVERS:
+                if solver == "auto":
+                    style_kwargs = dict(linewidth=2, color="black", style="--")
+                else:
+                    style_kwargs = dict(style="o-")
+                ax.set(
+                    title=f"n_components={n_components}, n_features={ref_dim}",
+                    ylabel="time (s)",
+                )
+                measurements.query(
+                    "n_components == @n_components and n_features == @ref_dim"
+                    " and solver == @solver and method_name == @method_name"
+                ).plot.line(
+                    x="n_samples",
+                    y="time",
+                    label=solver,
+                    logx=True,
+                    logy=True,
+                    ax=ax,
+                    **style_kwargs,
+                )
+# %%
+for method_name in all_method_names:
+    fig, axes = plt.subplots(
+        figsize=(16, 16),
+        nrows=len(REF_DIMS),
+        ncols=len(all_n_components),
+        sharey=True,
+    )
+    fig.suptitle(f"Benchmarks for PCA.{method_name}, varying n_features", fontsize=16)
+
+    for row_idx, ref_dim in enumerate(REF_DIMS):
+        for n_components, ax in zip(all_n_components, axes[row_idx]):
+            for solver in SOLVERS:
+                if solver == "auto":
+                    style_kwargs = dict(linewidth=2, color="black", style="--")
+                else:
+                    style_kwargs = dict(style="o-")
+                ax.set(
+                    title=f"n_components={n_components}, n_samples={ref_dim}",
+                    ylabel="time (s)",
+                )
+                measurements.query(
+                    "n_components == @n_components and n_samples == @ref_dim "
+                    " and solver == @solver and method_name == @method_name"
+                ).plot.line(
+                    x="n_features",
+                    y="time",
+                    label=solver,
+                    logx=True,
+                    logy=True,
+                    ax=ax,
+                    **style_kwargs,
+                )
+
+# %%
diff --git a/benchmarks/bench_plot_nmf.py b/benchmarks/bench_plot_nmf.py
index f05ede117191b..76d1a6de8286c 100644
--- a/benchmarks/bench_plot_nmf.py
+++ b/benchmarks/bench_plot_nmf.py
@@ -2,10 +2,8 @@
 Benchmarks of Non-Negative Matrix Factorization
 """
 
-# Authors: Tom Dupre la Tour (benchmark)
-#          Chih-Jen Linn (original projected gradient NMF implementation)
-#          Anthony Di Franco (projected gradient, Python and NumPy port)
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numbers
 import sys
diff --git a/benchmarks/bench_plot_parallel_pairwise.py b/benchmarks/bench_plot_parallel_pairwise.py
index ca12972f9be6c..a6eb6c04bffab 100644
--- a/benchmarks/bench_plot_parallel_pairwise.py
+++ b/benchmarks/bench_plot_parallel_pairwise.py
@@ -1,5 +1,5 @@
-# Author: Mathieu Blondel <mathieu@mblondel.org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import time
 
 import matplotlib.pyplot as plt
diff --git a/benchmarks/bench_plot_polynomial_kernel_approximation.py b/benchmarks/bench_plot_polynomial_kernel_approximation.py
index a80455e21c255..1e23e0a3c79ad 100644
--- a/benchmarks/bench_plot_polynomial_kernel_approximation.py
+++ b/benchmarks/bench_plot_polynomial_kernel_approximation.py
@@ -39,8 +39,8 @@
 
 """
 
-# Author: Daniel Lopez-Sanchez <lope@usal.es>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # Load data manipulation functions
 # Will use this for timing results
diff --git a/benchmarks/bench_rcv1_logreg_convergence.py b/benchmarks/bench_rcv1_logreg_convergence.py
index 166c6c2f5f9d1..27e730736a3de 100644
--- a/benchmarks/bench_rcv1_logreg_convergence.py
+++ b/benchmarks/bench_rcv1_logreg_convergence.py
@@ -1,7 +1,5 @@
-# Authors: Tom Dupre la Tour <tom.dupre-la-tour@m4x.org>
-#          Olivier Grisel <olivier.grisel@ensta.org>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import gc
 import time
diff --git a/benchmarks/bench_saga.py b/benchmarks/bench_saga.py
index c5b3e7728e2ec..97d4ba7b4b75b 100644
--- a/benchmarks/bench_saga.py
+++ b/benchmarks/bench_saga.py
@@ -20,6 +20,7 @@
 from sklearn.linear_model import LogisticRegression
 from sklearn.metrics import log_loss
 from sklearn.model_selection import train_test_split
+from sklearn.multiclass import OneVsRestClassifier
 from sklearn.preprocessing import LabelBinarizer, LabelEncoder
 from sklearn.utils.extmath import safe_sparse_dot, softmax
 from sklearn.utils.parallel import Parallel, delayed
@@ -95,7 +96,6 @@ def fit_single(
         else:
             lr = LogisticRegression(
                 solver=solver,
-                multi_class=multi_class,
                 C=C,
                 penalty=penalty,
                 fit_intercept=False,
@@ -103,6 +103,8 @@ def fit_single(
                 max_iter=this_max_iter,
                 random_state=42,
             )
+            if multi_class == "ovr":
+                lr = OneVsRestClassifier(lr)
 
         # Makes cpu cache even for all fit calls
         X_train.max()
@@ -118,8 +120,12 @@ def fit_single(
             except NotImplementedError:
                 # Lightning predict_proba is not implemented for n_classes > 2
                 y_pred = _predict_proba(lr, X)
+            if isinstance(lr, OneVsRestClassifier):
+                coef = np.concatenate([est.coef_ for est in lr.estimators_])
+            else:
+                coef = lr.coef_
             score = log_loss(y, y_pred, normalize=False) / n_samples
-            score += 0.5 * alpha * np.sum(lr.coef_**2) + beta * np.sum(np.abs(lr.coef_))
+            score += 0.5 * alpha * np.sum(coef**2) + beta * np.sum(np.abs(coef))
             scores.append(score)
         train_score, test_score = tuple(scores)
 
@@ -133,6 +139,7 @@ def fit_single(
 
 
 def _predict_proba(lr, X):
+    """Predict proba for lightning for n_classes >=3."""
     pred = safe_sparse_dot(X, lr.coef_.T)
     if hasattr(lr, "intercept_"):
         pred += lr.intercept_
diff --git a/benchmarks/bench_sgd_regression.py b/benchmarks/bench_sgd_regression.py
index 4b1b902795feb..bd00615e3d5f9 100644
--- a/benchmarks/bench_sgd_regression.py
+++ b/benchmarks/bench_sgd_regression.py
@@ -1,5 +1,5 @@
-# Author: Peter Prettenhofer <peter.prettenhofer@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import gc
 from time import time
diff --git a/benchmarks/bench_tsne_mnist.py b/benchmarks/bench_tsne_mnist.py
index 813fffcf29141..8649c7a46b629 100644
--- a/benchmarks/bench_tsne_mnist.py
+++ b/benchmarks/bench_tsne_mnist.py
@@ -5,7 +5,7 @@
 
 """
 
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import argparse
 import json
diff --git a/build_tools/azure/cpython_free_threaded_lock.txt b/build_tools/azure/cpython_free_threaded_lock.txt
new file mode 100644
index 0000000000000..91b5021b05b4b
--- /dev/null
+++ b/build_tools/azure/cpython_free_threaded_lock.txt
@@ -0,0 +1,35 @@
+#
+# This file is autogenerated by pip-compile with Python 3.13
+# by the following command:
+#
+#    pip-compile --output-file=/scikit-learn/build_tools/azure/cpython_free_threaded_lock.txt /scikit-learn/build_tools/azure/cpython_free_threaded_requirements.txt
+#
+execnet==2.1.1
+    # via pytest-xdist
+iniconfig==2.0.0
+    # via pytest
+joblib==1.4.2
+    # via -r /scikit-learn/build_tools/azure/cpython_free_threaded_requirements.txt
+meson==1.4.1
+    # via meson-python
+meson-python==0.16.0
+    # via -r /scikit-learn/build_tools/azure/cpython_free_threaded_requirements.txt
+ninja==1.11.1.1
+    # via -r /scikit-learn/build_tools/azure/cpython_free_threaded_requirements.txt
+packaging==24.0
+    # via
+    #   meson-python
+    #   pyproject-metadata
+    #   pytest
+pluggy==1.5.0
+    # via pytest
+pyproject-metadata==0.8.0
+    # via meson-python
+pytest==8.2.2
+    # via
+    #   -r /scikit-learn/build_tools/azure/cpython_free_threaded_requirements.txt
+    #   pytest-xdist
+pytest-xdist==3.6.1
+    # via -r /scikit-learn/build_tools/azure/cpython_free_threaded_requirements.txt
+threadpoolctl==3.5.0
+    # via -r /scikit-learn/build_tools/azure/cpython_free_threaded_requirements.txt
diff --git a/build_tools/azure/cpython_free_threaded_requirements.txt b/build_tools/azure/cpython_free_threaded_requirements.txt
new file mode 100644
index 0000000000000..bdcb169bac3ae
--- /dev/null
+++ b/build_tools/azure/cpython_free_threaded_requirements.txt
@@ -0,0 +1,14 @@
+# To generate cpython_free_threaded_lock.txt, use the following command:
+# docker run -v $PWD:/scikit-learn -it ubuntu bash -c 'export DEBIAN_FRONTEND=noninteractive; apt-get -yq update; apt-get install software-properties-common ccache -y; add-apt-repository --yes ppa:deadsnakes/nightly; apt-get update -y; apt-get install -y --no-install-recommends python3.13-dev python3.13-venv python3.13-nogil; python3.13t -m venv /venvs/myenv; source /venvs/myenv/bin/activate; pip install pip-tools; pip-compile /scikit-learn/build_tools/azure/cpython_free_threaded_requirements.txt -o /scikit-learn/build_tools/azure/cpython_free_threaded_lock.txt'
+
+# The reason behind it is that you need python-3.13t to generate the pip lock
+# file. For pure Python wheel this does not really matter. But when there are
+# cython, numpy and scipy releases that have a CPython 3.13 free-threaded
+# wheel, we can add them here and this is important that the Python 3.13
+# free-threaded wheel is picked up in the lock-file
+joblib
+threadpoolctl
+pytest
+pytest-xdist
+ninja
+meson-python
diff --git a/build_tools/azure/debian_atlas_32bit_lock.txt b/build_tools/azure/debian_atlas_32bit_lock.txt
index 40e0ff4e25cb8..2fd38ec1c8f81 100644
--- a/build_tools/azure/debian_atlas_32bit_lock.txt
+++ b/build_tools/azure/debian_atlas_32bit_lock.txt
@@ -6,7 +6,7 @@
 #
 attrs==23.2.0
     # via pytest
-coverage==7.4.4
+coverage==7.5.4
     # via pytest-cov
 cython==3.0.10
     # via -r build_tools/azure/debian_atlas_32bit_requirements.txt
@@ -14,21 +14,22 @@ iniconfig==2.0.0
     # via pytest
 joblib==1.2.0
     # via -r build_tools/azure/debian_atlas_32bit_requirements.txt
-meson==1.4.0
+meson==1.4.1
     # via meson-python
-meson-python==0.15.0
+meson-python==0.16.0
     # via -r build_tools/azure/debian_atlas_32bit_requirements.txt
 ninja==1.11.1.1
     # via -r build_tools/azure/debian_atlas_32bit_requirements.txt
-packaging==24.0
+packaging==24.1
     # via
+    #   meson-python
     #   pyproject-metadata
     #   pytest
-pluggy==1.4.0
+pluggy==1.5.0
     # via pytest
 py==1.11.0
     # via pytest
-pyproject-metadata==0.7.1
+pyproject-metadata==0.8.0
     # via meson-python
 pytest==7.1.2
     # via
@@ -36,7 +37,7 @@ pytest==7.1.2
     #   pytest-cov
 pytest-cov==2.9.0
     # via -r build_tools/azure/debian_atlas_32bit_requirements.txt
-threadpoolctl==2.2.0
+threadpoolctl==3.1.0
     # via -r build_tools/azure/debian_atlas_32bit_requirements.txt
 tomli==2.0.1
     # via
diff --git a/build_tools/azure/debian_atlas_32bit_requirements.txt b/build_tools/azure/debian_atlas_32bit_requirements.txt
index d1bc22529d4f4..615193a71fc6b 100644
--- a/build_tools/azure/debian_atlas_32bit_requirements.txt
+++ b/build_tools/azure/debian_atlas_32bit_requirements.txt
@@ -3,7 +3,7 @@
 # build_tools/update_environments_and_lock_files.py
 cython==3.0.10  # min
 joblib==1.2.0  # min
-threadpoolctl==2.2.0
+threadpoolctl==3.1.0
 pytest==7.1.2  # min
 pytest-cov==2.9.0  # min
 ninja
diff --git a/build_tools/azure/install.sh b/build_tools/azure/install.sh
index 3016361a6bfdc..73e732e35a05f 100755
--- a/build_tools/azure/install.sh
+++ b/build_tools/azure/install.sh
@@ -39,18 +39,23 @@ pre_python_environment_install() {
                 python3-matplotlib libatlas3-base libatlas-base-dev \
                 python3-virtualenv python3-pandas ccache git
 
-    elif [[ "$DISTRIB" == "conda-pypy3" ]]; then
-        # need compilers
-        apt-get -yq update
-        apt-get -yq install build-essential
+    # TODO for now we use CPython 3.13 from Ubuntu deadsnakes PPA. When CPython
+    # 3.13 is released (scheduled October 2024) we can use something more
+    # similar to other conda+pip based builds
+    elif [[ "$DISTRIB" == "pip-free-threaded" ]]; then
+        sudo apt-get -yq update
+        sudo apt-get install -yq ccache
+        sudo apt-get install -yq software-properties-common
+        sudo add-apt-repository --yes ppa:deadsnakes/nightly
+        sudo apt-get update -yq
+        sudo apt-get install -yq --no-install-recommends python3.13-dev python3.13-venv python3.13-nogil
     fi
-
 }
 
 check_packages_dev_version() {
     for package in $@; do
         package_version=$(python -c "import $package; print($package.__version__)")
-        if ! [[ $package_version =~ "dev" ]]; then
+        if [[ $package_version =~ "^[.0-9]+$" ]]; then
             echo "$package is not a development version: $package_version"
             exit 1
         fi
@@ -59,12 +64,7 @@ check_packages_dev_version() {
 
 python_environment_install_and_activate() {
     if [[ "$DISTRIB" == "conda"* ]]; then
-        # Install/update conda with the libmamba solver because the legacy
-        # solver can be slow at installing a specific version of conda-lock.
-        conda install -n base conda conda-libmamba-solver -y
-        conda config --set solver libmamba
-        conda install -c conda-forge "$(get_dep conda-lock min)" -y
-        conda-lock install --name $VIRTUALENV $LOCK_FILE
+        create_conda_environment_from_lock_file $VIRTUALENV $LOCK_FILE
         source activate $VIRTUALENV
 
     elif [[ "$DISTRIB" == "ubuntu" || "$DISTRIB" == "debian-32" ]]; then
@@ -72,31 +72,34 @@ python_environment_install_and_activate() {
         source $VIRTUALENV/bin/activate
         pip install -r "${LOCK_FILE}"
 
-    elif [[ "$DISTRIB" == "pip-nogil" ]]; then
-        python -m venv $VIRTUALENV
+    elif [[ "$DISTRIB" == "pip-free-threaded" ]]; then
+        python3.13t -m venv $VIRTUALENV
         source $VIRTUALENV/bin/activate
         pip install -r "${LOCK_FILE}"
+        # TODO you need pip>=24.1 to find free-threaded wheels. This may be
+        # removed when the underlying Ubuntu image has pip>=24.1.
+        pip install 'pip>=24.1'
+        # TODO When there are CPython 3.13 free-threaded wheels for numpy,
+        # scipy and cython move them to
+        # build_tools/azure/cpython_free_threaded_requirements.txt. For now we
+        # install them from scientific-python-nightly-wheels
+        dev_anaconda_url=https://pypi.anaconda.org/scientific-python-nightly-wheels/simple
+        dev_packages="numpy scipy Cython"
+        pip install --pre --upgrade --timeout=60 --extra-index $dev_anaconda_url $dev_packages
     fi
 
     if [[ "$DISTRIB" == "conda-pip-scipy-dev" ]]; then
         echo "Installing development dependency wheels"
         dev_anaconda_url=https://pypi.anaconda.org/scientific-python-nightly-wheels/simple
-        dev_packages="numpy scipy pandas"
+        dev_packages="numpy scipy pandas Cython"
         pip install --pre --upgrade --timeout=60 --extra-index $dev_anaconda_url $dev_packages
 
         check_packages_dev_version $dev_packages
 
-        echo "Installing Cython from latest sources"
-        pip install https://github.com/cython/cython/archive/master.zip
         echo "Installing joblib from latest sources"
         pip install https://github.com/joblib/joblib/archive/master.zip
         echo "Installing pillow from latest sources"
         pip install https://github.com/python-pillow/Pillow/archive/main.zip
-
-    elif [[ "$DISTRIB" == "pip-nogil" ]]; then
-        apt-get -yq update
-        apt-get install -yq ccache
-
     fi
 }
 
@@ -104,10 +107,6 @@ scikit_learn_install() {
     setup_ccache
     show_installed_libraries
 
-    # Set parallelism to 3 to overlap IO bound tasks with CPU bound tasks on CI
-    # workers with 2 cores when building the compiled extensions of scikit-learn.
-    export SKLEARN_BUILD_PARALLEL=3
-
     if [[ "$UNAMESTR" == "Darwin" && "$SKLEARN_TEST_NO_OPENMP" == "true" ]]; then
         # Without openmp, we use the system clang. Here we use /usr/bin/ar
         # instead because llvm-ar errors
@@ -126,9 +125,7 @@ scikit_learn_install() {
         export LDFLAGS="$LDFLAGS -Wl,--sysroot=/"
     fi
 
-    if [[ "$BUILD_WITH_SETUPTOOLS" == "true" ]]; then
-        python setup.py develop
-    elif [[ "$PIP_BUILD_ISOLATION" == "true" ]]; then
+    if [[ "$PIP_BUILD_ISOLATION" == "true" ]]; then
         # Check that pip can automatically build scikit-learn with the build
         # dependencies specified in pyproject.toml using an isolated build
         # environment:
diff --git a/build_tools/azure/pylatest_conda_forge_mkl_linux-64_conda.lock b/build_tools/azure/pylatest_conda_forge_mkl_linux-64_conda.lock
index 2782588a4bbc7..957622cc9fa50 100644
--- a/build_tools/azure/pylatest_conda_forge_mkl_linux-64_conda.lock
+++ b/build_tools/azure/pylatest_conda_forge_mkl_linux-64_conda.lock
@@ -1,66 +1,52 @@
 # Generated by conda-lock.
 # platform: linux-64
-# input_hash: 8c926fdb4279b181aa6ad88f79c862023c796ec1c3a5cff07cf2ea8dd3a05b0d
+# input_hash: 8a086d6ae339f1442cb02f643c8e4bc8c6eab83aa7c923d7021089b217bb7eaf
 @EXPLICIT
 https://conda.anaconda.org/conda-forge/linux-64/_libgcc_mutex-0.1-conda_forge.tar.bz2#d7c89558ba9fa0495403155b64376d81
-https://conda.anaconda.org/conda-forge/linux-64/ca-certificates-2024.2.2-hbcca054_0.conda#2f4327a1cbe7f022401b236e915a5fef
+https://conda.anaconda.org/conda-forge/linux-64/ca-certificates-2024.7.4-hbcca054_0.conda#23ab7665c5f63cfb9f1f6195256daac6
 https://conda.anaconda.org/conda-forge/noarch/font-ttf-dejavu-sans-mono-2.37-hab24e00_0.tar.bz2#0c96522c6bdaed4b1566d11387caaf45
 https://conda.anaconda.org/conda-forge/noarch/font-ttf-inconsolata-3.000-h77eed37_0.tar.bz2#34893075a5c9e55cdafac56607368fc6
 https://conda.anaconda.org/conda-forge/noarch/font-ttf-source-code-pro-2.038-h77eed37_0.tar.bz2#4d59c254e01d9cde7957100457e2d5fb
-https://conda.anaconda.org/conda-forge/noarch/font-ttf-ubuntu-0.83-h77eed37_1.conda#6185f640c43843e5ad6fd1c5372c3f80
-https://conda.anaconda.org/conda-forge/linux-64/ld_impl_linux-64-2.40-h41732ed_0.conda#7aca3059a1729aa76c597603f10b0dd3
-https://conda.anaconda.org/conda-forge/linux-64/libstdcxx-ng-13.2.0-h7e041cc_5.conda#f6f6600d18a4047b54f803cf708b868a
-https://conda.anaconda.org/conda-forge/linux-64/python_abi-3.11-4_cp311.conda#d786502c97404c94d7d58d258a445a65
+https://conda.anaconda.org/conda-forge/noarch/font-ttf-ubuntu-0.83-h77eed37_2.conda#cbbe59391138ea5ad3658c76912e147f
+https://conda.anaconda.org/conda-forge/linux-64/ld_impl_linux-64-2.40-hf3520f5_7.conda#b80f2f396ca2c28b8c14c437a4ed1e74
+https://conda.anaconda.org/conda-forge/linux-64/mkl-include-2023.2.0-h84fe81f_50496.conda#7af9fd0b2d7219f4a4200a34561340f6
+https://conda.anaconda.org/conda-forge/linux-64/python_abi-3.12-4_cp312.conda#dccc2d142812964fcc6abdc97b672dff
 https://conda.anaconda.org/conda-forge/noarch/tzdata-2024a-h0c530f3_0.conda#161081fc7cec0bfda0d86d7cb595f8d8
 https://conda.anaconda.org/conda-forge/noarch/fonts-conda-forge-1-0.tar.bz2#f766549260d6815b0c52253f1fb1bb29
 https://conda.anaconda.org/conda-forge/noarch/fonts-conda-ecosystem-1-0.tar.bz2#fee5683a3f04bd15cbd8318b096a27ab
 https://conda.anaconda.org/conda-forge/linux-64/_openmp_mutex-4.5-2_kmp_llvm.tar.bz2#562b26ba2e19059551a811e72ab7f793
-https://conda.anaconda.org/conda-forge/linux-64/libgcc-ng-13.2.0-h807b86a_5.conda#d4ff227c46917d3b4565302a2bbb276b
-https://conda.anaconda.org/conda-forge/linux-64/alsa-lib-1.2.11-hd590300_1.conda#0bb492cca54017ea314b809b1ee3a176
+https://conda.anaconda.org/conda-forge/linux-64/libgcc-ng-14.1.0-h77fa898_0.conda#ca0fad6a41ddaef54a153b78eccb5037
+https://conda.anaconda.org/conda-forge/linux-64/alsa-lib-1.2.12-h4ab18f5_0.conda#7ed427f0871fd41cb1d9c17727c17589
 https://conda.anaconda.org/conda-forge/linux-64/attr-2.5.1-h166bdaf_1.tar.bz2#d9c69a24ad678ffce24c6543a0176b00
-https://conda.anaconda.org/conda-forge/linux-64/aws-c-common-0.9.0-hd590300_0.conda#71b89db63b5b504e7afc8ad901172e1e
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-common-0.9.23-h4ab18f5_0.conda#94d61ae2b2b701008a9d52ce6bbead27
 https://conda.anaconda.org/conda-forge/linux-64/bzip2-1.0.8-hd590300_5.conda#69b8b6202a07720f448be700e300ccf4
 https://conda.anaconda.org/conda-forge/linux-64/c-ares-1.28.1-hd590300_0.conda#dcde58ff9a1f30b0037a2315d1846d1f
 https://conda.anaconda.org/conda-forge/linux-64/gettext-tools-0.22.5-h59595ed_2.conda#985f2f453fb72408d6b6f1be0f324033
-https://conda.anaconda.org/conda-forge/linux-64/gflags-2.2.2-he1b5a44_1004.tar.bz2#cddaf2c63ea4a5901cf09524c490ecdc
-https://conda.anaconda.org/conda-forge/linux-64/graphite2-1.3.13-h59595ed_1003.conda#f87c7b7c2cb45f323ffbce941c78ab7c
-https://conda.anaconda.org/conda-forge/linux-64/icu-73.2-h59595ed_0.conda#cc47e1facc155f91abd89b11e48e72ff
 https://conda.anaconda.org/conda-forge/linux-64/keyutils-1.6.1-h166bdaf_0.tar.bz2#30186d27e2c9fa62b45fb1476b7200e3
 https://conda.anaconda.org/conda-forge/linux-64/lame-3.100-h166bdaf_1003.tar.bz2#a8832b479f93521a9e7b5b743803be51
-https://conda.anaconda.org/conda-forge/linux-64/lerc-4.0.0-h27087fc_0.tar.bz2#76bbff344f0134279f225174e9064c8f
-https://conda.anaconda.org/conda-forge/linux-64/libabseil-20230125.3-cxx17_h59595ed_0.conda#d1db1b8be7c3a8983dcbbbfe4f0765de
-https://conda.anaconda.org/conda-forge/linux-64/libasprintf-0.22.5-h661eb56_2.conda#dd197c968bf9760bba0031888d431ede
-https://conda.anaconda.org/conda-forge/linux-64/libbrotlicommon-1.0.9-h166bdaf_9.conda#61641e239f96eae2b8492dc7e755828c
-https://conda.anaconda.org/conda-forge/linux-64/libcrc32c-1.1.2-h9c3ff4c_0.tar.bz2#c965a5aa0d5c1c37ffc62dff36e28400
+https://conda.anaconda.org/conda-forge/linux-64/libbrotlicommon-1.1.0-hd590300_1.conda#aec6c91c7371c26392a06708a73c70e5
 https://conda.anaconda.org/conda-forge/linux-64/libdeflate-1.20-hd590300_0.conda#8e88f9389f1165d7c0936fe40d9a9a79
 https://conda.anaconda.org/conda-forge/linux-64/libev-4.33-hd590300_2.conda#172bf1cd1ff8629f2b1179945ed45055
 https://conda.anaconda.org/conda-forge/linux-64/libexpat-2.6.2-h59595ed_0.conda#e7ba12deb7020dd080c6c70e7b6f6a3d
 https://conda.anaconda.org/conda-forge/linux-64/libffi-3.4.2-h7f98852_5.tar.bz2#d645c6d2ac96843a2bfaccd2d62b3ac3
 https://conda.anaconda.org/conda-forge/linux-64/libgettextpo-0.22.5-h59595ed_2.conda#172bcc51059416e7ce99e7b528cede83
-https://conda.anaconda.org/conda-forge/linux-64/libgfortran5-13.2.0-ha4646dd_5.conda#7a6bd7a12a4bd359e2afe6c0fa1acace
+https://conda.anaconda.org/conda-forge/linux-64/libgfortran5-14.1.0-hc5f4f2c_0.conda#6456c2620c990cd8dde2428a27ba0bc5
 https://conda.anaconda.org/conda-forge/linux-64/libiconv-1.17-hd590300_2.conda#d66573916ffcf376178462f1b61c941e
 https://conda.anaconda.org/conda-forge/linux-64/libjpeg-turbo-3.0.0-hd590300_1.conda#ea25936bb4080d843790b586850f82b8
 https://conda.anaconda.org/conda-forge/linux-64/libnsl-2.0.1-hd590300_0.conda#30fd6e37fe21f86f4bd26d6ee73eeec7
-https://conda.anaconda.org/conda-forge/linux-64/libnuma-2.0.18-hd590300_0.conda#8feeecae73aeef0a2985af46b5a2c1df
-https://conda.anaconda.org/conda-forge/linux-64/libogg-1.3.4-h7f98852_1.tar.bz2#6e8cc2173440d77708196c5b93771680
+https://conda.anaconda.org/conda-forge/linux-64/libogg-1.3.5-h4ab18f5_0.conda#601bfb4b3c6f0b844443bb81a56651e0
 https://conda.anaconda.org/conda-forge/linux-64/libopus-1.3.1-h7f98852_1.tar.bz2#15345e56d527b330e1cacbdf58676e8f
+https://conda.anaconda.org/conda-forge/linux-64/libstdcxx-ng-14.1.0-hc0a3c3a_0.conda#1cb187a157136398ddbaae90713e2498
 https://conda.anaconda.org/conda-forge/linux-64/libutf8proc-2.8.0-h166bdaf_0.tar.bz2#ede4266dc02e875fe1ea77b25dd43747
 https://conda.anaconda.org/conda-forge/linux-64/libuuid-2.38.1-h0b41bf4_0.conda#40b61aab5c7ba9ff276c41cfffe6b80b
-https://conda.anaconda.org/conda-forge/linux-64/libwebp-base-1.3.2-hd590300_0.conda#30de3fd9b3b602f7473f30e684eeea8c
+https://conda.anaconda.org/conda-forge/linux-64/libuv-1.48.0-hd590300_0.conda#7e8b914b1062dd4386e3de4d82a3ead6
+https://conda.anaconda.org/conda-forge/linux-64/libwebp-base-1.4.0-hd590300_0.conda#b26e8aa824079e1be0294e7152ca4559
 https://conda.anaconda.org/conda-forge/linux-64/libxcrypt-4.4.36-hd590300_1.conda#5aa797f8787fe7a17d1b0821485b5adc
-https://conda.anaconda.org/conda-forge/linux-64/libzlib-1.2.13-hd590300_5.conda#f36c115f1ee199da648e0597ec2047ad
-https://conda.anaconda.org/conda-forge/linux-64/lz4-c-1.9.4-hcb278e6_0.conda#318b08df404f9c9be5712aaa5a6f0bb0
-https://conda.anaconda.org/conda-forge/linux-64/mpg123-1.32.6-h59595ed_0.conda#9160cdeb523a1b20cf8d2a0bf821f45d
-https://conda.anaconda.org/conda-forge/linux-64/ncurses-6.4.20240210-h59595ed_0.conda#97da8860a0da5413c7c98a3b3838a645
-https://conda.anaconda.org/conda-forge/linux-64/ninja-1.11.1-h924138e_0.conda#73a4953a2d9c115bdc10ff30a52f675f
-https://conda.anaconda.org/conda-forge/linux-64/nspr-4.35-h27087fc_0.conda#da0ec11a6454ae19bff5b02ed881a2b1
-https://conda.anaconda.org/conda-forge/linux-64/openssl-3.2.1-hd590300_1.conda#9d731343cff6ee2e5a25c4a091bf8e2a
-https://conda.anaconda.org/conda-forge/linux-64/pixman-0.43.2-h59595ed_0.conda#71004cbf7924e19c02746ccde9fd7123
+https://conda.anaconda.org/conda-forge/linux-64/libzlib-1.3.1-h4ab18f5_1.conda#57d7dc60e9325e3de37ff8dffd18e814
+https://conda.anaconda.org/conda-forge/linux-64/ncurses-6.5-h59595ed_0.conda#fcea371545eda051b6deafb24889fc69
+https://conda.anaconda.org/conda-forge/linux-64/openssl-3.3.1-h4ab18f5_1.conda#b1e9d076f14e8d776213fd5047b4c3d9
 https://conda.anaconda.org/conda-forge/linux-64/pthread-stubs-0.4-h36c2ea0_1001.tar.bz2#22dad4df6e8630e8dff2428f6f6a7036
-https://conda.anaconda.org/conda-forge/linux-64/rdma-core-28.9-h59595ed_1.conda#aeffb7c06b5f65e55e6c637408dc4100
-https://conda.anaconda.org/conda-forge/linux-64/re2-2023.03.02-h8c504da_0.conda#206f8fa808748f6e90599c3368a1114e
 https://conda.anaconda.org/conda-forge/linux-64/sleef-3.5.1-h9b69904_2.tar.bz2#6e016cf4c525d04a7bd038cee53ad3fd
-https://conda.anaconda.org/conda-forge/linux-64/snappy-1.1.10-h9fff704_0.conda#e6d228cd0bb74a51dd18f5bfce0b4115
 https://conda.anaconda.org/conda-forge/linux-64/xorg-kbproto-1.0.7-h7f98852_1002.tar.bz2#4b230e8381279d76131116660f5a241a
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libice-1.1.1-hd590300_0.conda#b462a33c0be1421532f28bfe8f4a7514
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libxau-1.0.11-hd590300_0.conda#2c80dc38fface310c9bd81b17037fee5
@@ -70,152 +56,192 @@ https://conda.anaconda.org/conda-forge/linux-64/xorg-xextproto-7.3.0-h0b41bf4_10
 https://conda.anaconda.org/conda-forge/linux-64/xorg-xf86vidmodeproto-2.3.1-h7f98852_1002.tar.bz2#3ceea9668625c18f19530de98b15d5b0
 https://conda.anaconda.org/conda-forge/linux-64/xorg-xproto-7.0.31-h7f98852_1007.tar.bz2#b4a4381d54784606820704f7b5f05a15
 https://conda.anaconda.org/conda-forge/linux-64/xz-5.2.6-h166bdaf_0.tar.bz2#2161070d867d1b1204ea749c8eec4ef0
-https://conda.anaconda.org/conda-forge/linux-64/aws-c-cal-0.6.1-hc309b26_1.conda#cc09293a2c2b7fd77aff284f370c12c0
-https://conda.anaconda.org/conda-forge/linux-64/aws-c-compression-0.2.17-h4d4d85c_2.conda#9ca99452635fe03eb5fa937f5ae604b0
-https://conda.anaconda.org/conda-forge/linux-64/aws-c-sdkutils-0.1.12-h4d4d85c_1.conda#eba092fc6de212a01de0065f38fe8bbb
-https://conda.anaconda.org/conda-forge/linux-64/aws-checksums-0.1.17-h4d4d85c_1.conda#30f9df85ce23cd14faa9a4dfa50cca2b
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-cal-0.7.0-h816f305_0.conda#9024f0647bfac11e986bba79a2e5daaa
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-compression-0.2.18-he027950_7.conda#11e5cb0b426772974f6416545baee0ce
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-sdkutils-0.1.16-he027950_3.conda#adbf0c44ca88a3cded175cd809a106b6
+https://conda.anaconda.org/conda-forge/linux-64/aws-checksums-0.1.18-he027950_7.conda#95611b325a9728ed68b8f7eef2dd3feb
 https://conda.anaconda.org/conda-forge/linux-64/expat-2.6.2-h59595ed_0.conda#53fb86322bdb89496d7579fe3f02fd61
-https://conda.anaconda.org/conda-forge/linux-64/glog-0.6.0-h6f12383_0.tar.bz2#b31f3565cb84435407594e548a2fb7b2
-https://conda.anaconda.org/conda-forge/linux-64/libasprintf-devel-0.22.5-h661eb56_2.conda#02e41ab5834dcdcc8590cf29d9526f50
-https://conda.anaconda.org/conda-forge/linux-64/libbrotlidec-1.0.9-h166bdaf_9.conda#081aa22f4581c08e4372b0b6c2f8478e
-https://conda.anaconda.org/conda-forge/linux-64/libbrotlienc-1.0.9-h166bdaf_9.conda#1f0a03af852a9659ed2bf08f2f1704fd
+https://conda.anaconda.org/conda-forge/linux-64/gflags-2.2.2-he1b5a44_1004.tar.bz2#cddaf2c63ea4a5901cf09524c490ecdc
+https://conda.anaconda.org/conda-forge/linux-64/gmp-6.3.0-hac33072_2.conda#c94a5994ef49749880a8139cf9afcbe1
+https://conda.anaconda.org/conda-forge/linux-64/graphite2-1.3.13-h59595ed_1003.conda#f87c7b7c2cb45f323ffbce941c78ab7c
+https://conda.anaconda.org/conda-forge/linux-64/icu-73.2-h59595ed_0.conda#cc47e1facc155f91abd89b11e48e72ff
+https://conda.anaconda.org/conda-forge/linux-64/lerc-4.0.0-h27087fc_0.tar.bz2#76bbff344f0134279f225174e9064c8f
+https://conda.anaconda.org/conda-forge/linux-64/libabseil-20240116.2-cxx17_h59595ed_0.conda#682bdbe046a68f749769b492f3625c5c
+https://conda.anaconda.org/conda-forge/linux-64/libasprintf-0.22.5-h661eb56_2.conda#dd197c968bf9760bba0031888d431ede
+https://conda.anaconda.org/conda-forge/linux-64/libbrotlidec-1.1.0-hd590300_1.conda#f07002e225d7a60a694d42a7bf5ff53f
+https://conda.anaconda.org/conda-forge/linux-64/libbrotlienc-1.1.0-hd590300_1.conda#5fc11c6020d421960607d821310fcd4d
 https://conda.anaconda.org/conda-forge/linux-64/libcap-2.69-h0f662aa_0.conda#25cb5999faa414e5ccb2c1388f62d3d5
+https://conda.anaconda.org/conda-forge/linux-64/libcrc32c-1.1.2-h9c3ff4c_0.tar.bz2#c965a5aa0d5c1c37ffc62dff36e28400
 https://conda.anaconda.org/conda-forge/linux-64/libedit-3.1.20191231-he28a2e2_2.tar.bz2#4d331e44109e3f0e19b4cb8f9b82f3e1
 https://conda.anaconda.org/conda-forge/linux-64/libevent-2.1.12-hf998b51_1.conda#a1cfcc585f0c42bf8d5546bb1dfb668d
 https://conda.anaconda.org/conda-forge/linux-64/libgettextpo-devel-0.22.5-h59595ed_2.conda#b63d9b6da3653179a278077f0de20014
-https://conda.anaconda.org/conda-forge/linux-64/libgfortran-ng-13.2.0-h69a702a_5.conda#e73e9cfd1191783392131e6238bdb3e9
+https://conda.anaconda.org/conda-forge/linux-64/libgfortran-ng-14.1.0-h69a702a_0.conda#f4ca84fbd6d06b0a052fb2d5b96dde41
 https://conda.anaconda.org/conda-forge/linux-64/libnghttp2-1.58.0-h47da74e_1.conda#700ac6ea6d53d5510591c4344d5c989a
 https://conda.anaconda.org/conda-forge/linux-64/libpng-1.6.43-h2797004_0.conda#009981dd9cfcaa4dbfa25ffaed86bcae
-https://conda.anaconda.org/conda-forge/linux-64/libprotobuf-3.21.12-hfc55251_2.conda#e3a7d4ba09b8dc939b98fef55f539220
-https://conda.anaconda.org/conda-forge/linux-64/libsqlite-3.45.2-h2797004_0.conda#866983a220e27a80cb75e85cb30466a1
+https://conda.anaconda.org/conda-forge/linux-64/libsqlite-3.46.0-hde9e2c9_0.conda#18aa975d2094c34aef978060ae7da7d8
 https://conda.anaconda.org/conda-forge/linux-64/libssh2-1.11.0-h0841786_0.conda#1f5a58e686b13bcfde88b93f547d23fe
 https://conda.anaconda.org/conda-forge/linux-64/libvorbis-1.3.7-h9c3ff4c_0.tar.bz2#309dec04b70a3cc0f1e84a4013683bc0
-https://conda.anaconda.org/conda-forge/linux-64/libxcb-1.15-h0b41bf4_0.conda#33277193f5b92bad9fdd230eb700929c
-https://conda.anaconda.org/conda-forge/linux-64/libxml2-2.12.6-h232c23b_1.conda#6853448e9ca1cfd5f15382afd2a6d123
+https://conda.anaconda.org/conda-forge/linux-64/libxcb-1.16-hd590300_0.conda#151cba22b85a989c2d6ef9633ffee1e4
+https://conda.anaconda.org/conda-forge/linux-64/lz4-c-1.9.4-hcb278e6_0.conda#318b08df404f9c9be5712aaa5a6f0bb0
+https://conda.anaconda.org/conda-forge/linux-64/mpg123-1.32.6-h59595ed_0.conda#9160cdeb523a1b20cf8d2a0bf821f45d
 https://conda.anaconda.org/conda-forge/linux-64/mysql-common-8.3.0-hf1915f5_4.conda#784a4df6676c581ca624fbe460703a6d
-https://conda.anaconda.org/conda-forge/linux-64/pcre2-10.43-hcad00b1_0.conda#8292dea9e022d9610a11fce5e0896ed8
+https://conda.anaconda.org/conda-forge/linux-64/ninja-1.12.1-h297d8ca_0.conda#3aa1c7e292afeff25a0091ddd7c69b72
+https://conda.anaconda.org/conda-forge/linux-64/nspr-4.35-h27087fc_0.conda#da0ec11a6454ae19bff5b02ed881a2b1
+https://conda.anaconda.org/conda-forge/linux-64/pcre2-10.44-h0f59acf_0.conda#3914f7ac1761dce57102c72ca7c35d01
+https://conda.anaconda.org/conda-forge/linux-64/pixman-0.43.2-h59595ed_0.conda#71004cbf7924e19c02746ccde9fd7123
 https://conda.anaconda.org/conda-forge/linux-64/readline-8.2-h8228510_1.conda#47d31b792659ce70f470b5c82fdfb7a4
-https://conda.anaconda.org/conda-forge/linux-64/s2n-1.3.49-h06160fa_0.conda#1d78349eb26366ecc034a4afe70a8534
+https://conda.anaconda.org/conda-forge/linux-64/s2n-1.4.17-he19d79f_0.conda#e25ac9bf10f8e6aa67727b1cdbe762ef
+https://conda.anaconda.org/conda-forge/linux-64/snappy-1.2.1-ha2e4443_0.conda#6b7dcc7349efd123d493d2dbe85a045f
 https://conda.anaconda.org/conda-forge/linux-64/tk-8.6.13-noxft_h4845f30_101.conda#d453b98d9c83e71da0741bb0ff4d76bc
-https://conda.anaconda.org/conda-forge/linux-64/ucx-1.14.1-h64cca9d_5.conda#39aa3b356d10d7e5add0c540945a0944
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libsm-1.2.4-h7391055_0.conda#93ee23f12bc2e684548181256edd2cf6
-https://conda.anaconda.org/conda-forge/linux-64/zlib-1.2.13-hd590300_5.conda#68c34ec6149623be41a1933ab996a209
-https://conda.anaconda.org/conda-forge/linux-64/zstd-1.5.5-hfc55251_0.conda#04b88013080254850d6c01ed54810589
-https://conda.anaconda.org/conda-forge/linux-64/aws-c-io-0.13.32-he9a53bd_1.conda#8a24e5820f4a0ffd2ed9c4722cd5d7ca
-https://conda.anaconda.org/conda-forge/linux-64/brotli-bin-1.0.9-h166bdaf_9.conda#d47dee1856d9cb955b8076eeff304a5b
+https://conda.anaconda.org/conda-forge/linux-64/zlib-1.3.1-h4ab18f5_1.conda#9653f1bf3766164d0e65fa723cabbc54
+https://conda.anaconda.org/conda-forge/linux-64/zstd-1.5.6-ha6fb4c9_0.conda#4d056880988120e29d75bfff282e0f45
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-io-0.14.9-h37d6bf3_5.conda#2a651c0ba059f3da2449b4e03fddf9fb
+https://conda.anaconda.org/conda-forge/linux-64/brotli-bin-1.1.0-hd590300_1.conda#39f910d205726805a958da408ca194ba
 https://conda.anaconda.org/conda-forge/linux-64/freetype-2.12.1-h267a509_2.conda#9ae35c3d96db2c94ce0cef86efdfa2cb
-https://conda.anaconda.org/conda-forge/linux-64/gettext-0.22.5-h59595ed_2.conda#219ba82e95d7614cf7140d2a4afc0926
-https://conda.anaconda.org/conda-forge/linux-64/krb5-1.21.2-h659d440_0.conda#cd95826dbd331ed1be26bdf401432844
-https://conda.anaconda.org/conda-forge/linux-64/libglib-2.80.0-hf2295e7_3.conda#569d25ad54594080778abff56a611dc7
-https://conda.anaconda.org/conda-forge/linux-64/libgrpc-1.54.3-hb20ce57_0.conda#7af7c59ab24db007dfd82e0a3a343f66
+https://conda.anaconda.org/conda-forge/linux-64/glog-0.7.1-hbabe93e_0.conda#ff862eebdfeb2fd048ae9dc92510baca
+https://conda.anaconda.org/conda-forge/linux-64/krb5-1.21.3-h659f571_0.conda#3f43953b7d3fb3aaa1d0d0723d91e368
+https://conda.anaconda.org/conda-forge/linux-64/libasprintf-devel-0.22.5-h661eb56_2.conda#02e41ab5834dcdcc8590cf29d9526f50
+https://conda.anaconda.org/conda-forge/linux-64/libglib-2.80.3-h8a4344b_1.conda#6ea440297aacee4893f02ad759e6ffbc
 https://conda.anaconda.org/conda-forge/linux-64/libhiredis-1.0.2-h2cc385e_0.tar.bz2#b34907d3a81a3cd8095ee83d174c074a
-https://conda.anaconda.org/conda-forge/linux-64/libhwloc-2.9.3-default_h554bfaf_1009.conda#f36ddc11ca46958197a45effdd286e45
-https://conda.anaconda.org/conda-forge/linux-64/libllvm15-15.0.7-hb3ce162_4.conda#8a35df3cbc0c8b12cc8af9473ae75eef
-https://conda.anaconda.org/conda-forge/linux-64/libllvm18-18.1.3-h2448989_0.conda#927b6d6e80b2c0d4405a58b61ca248a3
-https://conda.anaconda.org/conda-forge/linux-64/libthrift-0.18.1-h8fd135c_2.conda#bbf65f7688512872f063810623b755dc
+https://conda.anaconda.org/conda-forge/linux-64/libprotobuf-4.25.3-h08a7969_0.conda#6945825cebd2aeb16af4c69d97c32c13
+https://conda.anaconda.org/conda-forge/linux-64/libre2-11-2023.09.01-h5a48ba9_2.conda#41c69fba59d495e8cf5ffda48a607e35
+https://conda.anaconda.org/conda-forge/linux-64/libthrift-0.19.0-hb90f79a_1.conda#8cdb7d41faa0260875ba92414c487e2d
 https://conda.anaconda.org/conda-forge/linux-64/libtiff-4.6.0-h1dd3fc0_3.conda#66f03896ffbe1a110ffda05c7a856504
-https://conda.anaconda.org/conda-forge/linux-64/llvm-openmp-18.1.2-h4dfa4b3_0.conda#0118c8a03e3dbbb6b348ef71e94ac7af
+https://conda.anaconda.org/conda-forge/linux-64/libxml2-2.12.7-hc051c1a_1.conda#340278ded8b0dc3a73f3660bbb0adbc6
+https://conda.anaconda.org/conda-forge/linux-64/llvm-openmp-18.1.8-hf5423f3_0.conda#322be9d39e030673e105b0abb320514e
+https://conda.anaconda.org/conda-forge/linux-64/mpfr-4.2.1-h9458935_1.conda#8083b20f566639c22f78bcd6ca35b276
 https://conda.anaconda.org/conda-forge/linux-64/mysql-libs-8.3.0-hca2cd23_4.conda#1b50eebe2a738a3146c154d2eceaa8b6
-https://conda.anaconda.org/conda-forge/linux-64/nss-3.98-h1d7d5a4_0.conda#54b56c2fdf973656b748e0378900ec13
-https://conda.anaconda.org/conda-forge/linux-64/orc-1.9.0-h2f23424_1.conda#9571eb3eb0f7fe8b59956a7786babbcd
-https://conda.anaconda.org/conda-forge/linux-64/python-3.11.8-hab00c5b_0_cpython.conda#2fdc314ee058eda0114738a9309d3683
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-0.4.0-hd590300_1.conda#9bfac7ccd94d54fd21a0501296d60424
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-keysyms-0.4.0-h8ee46fc_1.conda#632413adcd8bc16b515cab87a2932913
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-renderutil-0.3.9-hd590300_1.conda#e995b155d938b6779da6ace6c6b13816
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-wm-0.4.1-h8ee46fc_1.conda#90108a432fb5c6150ccfee3f03388656
-https://conda.anaconda.org/conda-forge/linux-64/xorg-libx11-1.8.9-h8ee46fc_0.conda#077b6e8ad6a3ddb741fce2496dd01bec
-https://conda.anaconda.org/conda-forge/noarch/array-api-compat-1.6-pyhd8ed1ab_0.conda#f04c36d7284243a7d982b4ef4982eb23
-https://conda.anaconda.org/conda-forge/linux-64/aws-c-event-stream-0.3.1-h2e3709c_4.conda#2cf21b1cbc1c096a28ffa2892257a2c1
-https://conda.anaconda.org/conda-forge/linux-64/aws-c-http-0.7.11-h00aa349_4.conda#cb932dff7328ff620ce8059c9968b095
-https://conda.anaconda.org/conda-forge/linux-64/brotli-1.0.9-h166bdaf_9.conda#4601544b4982ba1861fa9b9c607b2c06
-https://conda.anaconda.org/conda-forge/linux-64/ccache-4.9.1-h1fcd64f_0.conda#3620f564bcf28c3524951b6f64f5c5ac
-https://conda.anaconda.org/conda-forge/noarch/certifi-2024.2.2-pyhd8ed1ab_0.conda#0876280e409658fc6f9e75d035960333
+https://conda.anaconda.org/conda-forge/linux-64/nss-3.102-h593d115_0.conda#40e5e48c55a45621c4399ca9236406b7
+https://conda.anaconda.org/conda-forge/linux-64/python-3.12.4-h194c7f8_0_cpython.conda#d73490214f536cccb5819e9873048c92
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-0.4.1-hb711507_2.conda#8637c3e5821654d0edf97e2b0404b443
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-keysyms-0.4.1-hb711507_0.conda#ad748ccca349aec3e91743e08b5e2b50
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-renderutil-0.3.10-hb711507_0.conda#0e0cbe0564d03a99afd5fd7b362feecd
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-wm-0.4.2-hb711507_0.conda#608e0ef8256b81d04456e8d211eee3e8
+https://conda.anaconda.org/conda-forge/linux-64/xorg-libx11-1.8.9-hb711507_1.conda#4a6d410296d7e39f00bacdee7df046e9
+https://conda.anaconda.org/conda-forge/noarch/array-api-compat-1.7.1-pyhd8ed1ab_0.conda#8791d81c38f676a7c08c76546800bf70
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-event-stream-0.4.2-hb72ac1a_14.conda#64676cc50610171ec66083b82be93e52
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-http-0.8.2-had8cc17_4.conda#ccf5df89d5ac0e7812c1bd0023356248
+https://conda.anaconda.org/conda-forge/linux-64/brotli-1.1.0-hd590300_1.conda#f27a24d46e3ea7b70a1f98e50c62508f
+https://conda.anaconda.org/conda-forge/linux-64/ccache-4.10.1-h065aff2_0.conda#d6b48c138e0c8170a6fe9c136e063540
+https://conda.anaconda.org/conda-forge/noarch/certifi-2024.7.4-pyhd8ed1ab_0.conda#24e7fd6ca65997938fff9e5ab6f653e4
 https://conda.anaconda.org/conda-forge/noarch/colorama-0.4.6-pyhd8ed1ab_0.tar.bz2#3faab06a954c2a04039983f2c4a50d99
 https://conda.anaconda.org/conda-forge/noarch/cycler-0.12.1-pyhd8ed1ab_0.conda#5cd86562580f274031ede6aa6aa24441
-https://conda.anaconda.org/conda-forge/linux-64/cython-3.0.10-py311hb755f60_0.conda#f3a8a500a2e743ff92f418f0eaf9bf71
+https://conda.anaconda.org/conda-forge/linux-64/cython-3.0.10-py312h30efb56_0.conda#b119273bff37284cbcb9281c1e85e67d
 https://conda.anaconda.org/conda-forge/linux-64/dbus-1.13.6-h5008d03_3.tar.bz2#ecfff944ba3960ecb334b9a2663d708d
 https://conda.anaconda.org/conda-forge/noarch/exceptiongroup-1.2.0-pyhd8ed1ab_2.conda#8d652ea2ee8eaee02ed8dc820bc794aa
-https://conda.anaconda.org/conda-forge/noarch/execnet-2.1.0-pyhd8ed1ab_0.conda#7a4b32fbe5442e46841ec77695e36d96
+https://conda.anaconda.org/conda-forge/noarch/execnet-2.1.1-pyhd8ed1ab_0.conda#15dda3cdbf330abfe9f555d22f66db46
+https://conda.anaconda.org/conda-forge/noarch/filelock-3.15.4-pyhd8ed1ab_0.conda#0e7e4388e9d5283e22b35a9443bdbcc9
 https://conda.anaconda.org/conda-forge/linux-64/fontconfig-2.14.2-h14ed4e7_0.conda#0f69b688f52ff6da70bccb7ff7001d1d
-https://conda.anaconda.org/conda-forge/linux-64/glib-tools-2.80.0-hde27a5a_3.conda#d544517494d9008c0b1021213aec4084
+https://conda.anaconda.org/conda-forge/noarch/fsspec-2024.6.1-pyhff2d567_0.conda#996bf792cdb8c0ac38ff54b9fde56841
+https://conda.anaconda.org/conda-forge/linux-64/gettext-0.22.5-h59595ed_2.conda#219ba82e95d7614cf7140d2a4afc0926
+https://conda.anaconda.org/conda-forge/linux-64/glib-tools-2.80.3-h73ef956_1.conda#99701cdc9a25a333d15265d1d243b2dc
 https://conda.anaconda.org/conda-forge/noarch/iniconfig-2.0.0-pyhd8ed1ab_0.conda#f800d2da156d08e289b14e87e43c1ae5
-https://conda.anaconda.org/conda-forge/linux-64/kiwisolver-1.4.5-py311h9547e67_1.conda#2c65bdf442b0d37aad080c8a4e0d452f
+https://conda.anaconda.org/conda-forge/linux-64/kiwisolver-1.4.5-py312h8572e83_1.conda#c1e71f2bc05d8e8e033aefac2c490d05
 https://conda.anaconda.org/conda-forge/linux-64/lcms2-2.16-hb7c19ff_0.conda#51bb7010fc86f70eee639b4bb7a894f5
-https://conda.anaconda.org/conda-forge/linux-64/libclang-cpp15-15.0.7-default_h127d8a8_5.conda#d0a9633b53cdc319b8a1a532ae7822b8
-https://conda.anaconda.org/conda-forge/linux-64/libclang13-18.1.3-default_h5d6823c_0.conda#5fff487759736b275dc3e4a263cac666
 https://conda.anaconda.org/conda-forge/linux-64/libcups-2.3.3-h4637d8d_4.conda#d4529f4dff3057982a7617c7ac58fde3
-https://conda.anaconda.org/conda-forge/linux-64/libcurl-8.7.1-hca28451_0.conda#755c7f876815003337d2c61ff5d047e5
-https://conda.anaconda.org/conda-forge/linux-64/libflac-1.4.3-h59595ed_0.conda#ee48bf17cc83a00f59ca1494d5646869
-https://conda.anaconda.org/conda-forge/linux-64/libgpg-error-1.48-h71f35ed_0.conda#4d18d86916705d352d5f4adfb7f0edd3
-https://conda.anaconda.org/conda-forge/linux-64/libpq-16.2-h33b98f1_1.conda#9e49ec2a61d02623b379dc332eb6889d
+https://conda.anaconda.org/conda-forge/linux-64/libcurl-8.8.0-hca28451_1.conda#b8afb3e3cb3423cc445cf611ab95fdb0
+https://conda.anaconda.org/conda-forge/linux-64/libhwloc-2.11.0-default_h5622ce7_1000.conda#695ee1e435b873780efccc64362cda89
+https://conda.anaconda.org/conda-forge/linux-64/libllvm15-15.0.7-hb3ce162_4.conda#8a35df3cbc0c8b12cc8af9473ae75eef
+https://conda.anaconda.org/conda-forge/linux-64/libllvm18-18.1.8-hc9dba70_0.conda#f94ed0c5953c78dcca7adb953f4c5bfb
+https://conda.anaconda.org/conda-forge/linux-64/libpq-16.3-ha72fbe1_0.conda#bac737ae28b79cfbafd515258d97d29e
+https://conda.anaconda.org/conda-forge/linux-64/markupsafe-2.1.5-py312h98912ed_0.conda#6ff0b9582da2d4a74a1f9ae1f9ce2af6
+https://conda.anaconda.org/conda-forge/linux-64/mpc-1.3.1-hfe3b2da_0.conda#289c71e83dc0daa7d4c81f04180778ca
+https://conda.anaconda.org/conda-forge/noarch/mpmath-1.3.0-pyhd8ed1ab_0.conda#dbf6e2d89137da32fa6670f3bffc024e
 https://conda.anaconda.org/conda-forge/noarch/munkres-1.1.4-pyh9f0ad1d_0.tar.bz2#2ba8498c1018c1e9c61eb99b973dfe19
+https://conda.anaconda.org/conda-forge/noarch/networkx-3.3-pyhd8ed1ab_1.conda#d335fd5704b46f4efb89a6774e81aef0
 https://conda.anaconda.org/conda-forge/linux-64/openjpeg-2.5.2-h488ebb8_0.conda#7f2e286780f072ed750df46dc2631138
-https://conda.anaconda.org/conda-forge/noarch/packaging-24.0-pyhd8ed1ab_0.conda#248f521b64ce055e7feae3105e7abeb8
-https://conda.anaconda.org/conda-forge/noarch/pluggy-1.4.0-pyhd8ed1ab_0.conda#139e9feb65187e916162917bb2484976
+https://conda.anaconda.org/conda-forge/linux-64/orc-2.0.1-h17fec99_1.conda#3bf65f0d8e7322a1cfe8b670fa35ec81
+https://conda.anaconda.org/conda-forge/noarch/packaging-24.1-pyhd8ed1ab_0.conda#cbe1bb1f21567018ce595d9c2be0f0db
+https://conda.anaconda.org/conda-forge/noarch/pluggy-1.5.0-pyhd8ed1ab_0.conda#d3483c8fc2dc2cc3f5cf43e26d60cabf
 https://conda.anaconda.org/conda-forge/noarch/ply-3.11-pyhd8ed1ab_2.conda#18c6deb6f9602e32446398203c8f0e91
 https://conda.anaconda.org/conda-forge/noarch/pyparsing-3.1.2-pyhd8ed1ab_0.conda#b9a4dacf97241704529131a0dfc0494f
 https://conda.anaconda.org/conda-forge/noarch/python-tzdata-2024.1-pyhd8ed1ab_0.conda#98206ea9954216ee7540f0c773f2104d
 https://conda.anaconda.org/conda-forge/noarch/pytz-2024.1-pyhd8ed1ab_0.conda#3eeeeb9e4827ace8c0c1419c85d590ad
-https://conda.anaconda.org/conda-forge/noarch/setuptools-69.2.0-pyhd8ed1ab_0.conda#da214ecd521a720a9d521c68047682dc
+https://conda.anaconda.org/conda-forge/linux-64/re2-2023.09.01-h7f4b329_2.conda#8f70e36268dea8eb666ef14c29bd3cda
+https://conda.anaconda.org/conda-forge/noarch/setuptools-70.1.1-pyhd8ed1ab_0.conda#985e9e86e1b0fc75a74a9bfab9309ef7
 https://conda.anaconda.org/conda-forge/noarch/six-1.16.0-pyh6c4a22f_0.tar.bz2#e5f25f8dbc060e9a8d912e432202afc2
-https://conda.anaconda.org/conda-forge/linux-64/tbb-2021.11.0-h00ab1b0_1.conda#4531d2927578e7e254ff3bcf6457518c
-https://conda.anaconda.org/conda-forge/noarch/threadpoolctl-3.4.0-pyhc1e730c_0.conda#b296278eef667c673bf51de6535bad88
+https://conda.anaconda.org/conda-forge/noarch/threadpoolctl-3.5.0-pyhc1e730c_0.conda#df68d78237980a159bd7149f33c0e8fd
 https://conda.anaconda.org/conda-forge/noarch/toml-0.10.2-pyhd8ed1ab_0.tar.bz2#f832c45a477c78bebd107098db465095
 https://conda.anaconda.org/conda-forge/noarch/tomli-2.0.1-pyhd8ed1ab_0.tar.bz2#5844808ffab9ebdb694585b50ba02a96
-https://conda.anaconda.org/conda-forge/linux-64/tornado-6.4-py311h459d7ec_0.conda#cc7727006191b8f3630936b339a76cd0
-https://conda.anaconda.org/conda-forge/noarch/typing_extensions-4.11.0-pyha770c72_0.conda#6ef2fc37559256cf682d8b3375e89b80
+https://conda.anaconda.org/conda-forge/linux-64/tornado-6.4.1-py312h9a8786e_0.conda#fd9c83fde763b494f07acee1404c280e
+https://conda.anaconda.org/conda-forge/noarch/typing_extensions-4.12.2-pyha770c72_0.conda#ebe6952715e1d5eb567eeebf25250fa7
 https://conda.anaconda.org/conda-forge/noarch/wheel-0.43.0-pyhd8ed1ab_1.conda#0b5293a157c2b5cd513dd1b03d8d3aae
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-image-0.4.0-h8ee46fc_1.conda#9d7bcddf49cbf727730af10e71022c73
-https://conda.anaconda.org/conda-forge/linux-64/xkeyboard-config-2.41-hd590300_0.conda#81f740407b45e3f9047b3174fa94eb9e
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-image-0.4.0-hb711507_2.conda#a0901183f08b6c7107aab109733a3c91
+https://conda.anaconda.org/conda-forge/linux-64/xkeyboard-config-2.42-h4ab18f5_0.conda#b193af204da1bfb8c13882d131a14bd2
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libxext-1.3.4-h0b41bf4_2.conda#82b6df12252e6f32402b96dacc656fec
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libxrender-0.9.11-hd590300_0.conda#ed67c36f215b310412b2af935bf3e530
-https://conda.anaconda.org/conda-forge/linux-64/aws-c-auth-0.7.3-h28f7589_1.conda#97503d3e565004697f1651753aa95b9e
-https://conda.anaconda.org/conda-forge/linux-64/aws-c-mqtt-0.9.3-hb447be9_1.conda#c520669eb0be9269a5f0d8ef62531882
-https://conda.anaconda.org/conda-forge/linux-64/cairo-1.18.0-h3faef2a_0.conda#f907bb958910dc404647326ca80c263e
-https://conda.anaconda.org/conda-forge/linux-64/coverage-7.4.4-py311h459d7ec_0.conda#1aa22cb84e68841ec206ee066457bdf0
-https://conda.anaconda.org/conda-forge/linux-64/fonttools-4.51.0-py311h459d7ec_0.conda#17e1997cc17c571d5ad27bd0159f616c
-https://conda.anaconda.org/conda-forge/linux-64/glib-2.80.0-hf2295e7_3.conda#1ade62526144055f05c3eb45ebae3b5b
-https://conda.anaconda.org/conda-forge/noarch/joblib-1.3.2-pyhd8ed1ab_0.conda#4da50d410f553db77e62ab62ffaa1abc
-https://conda.anaconda.org/conda-forge/linux-64/libgcrypt-1.10.3-hd590300_0.conda#32d16ad533c59bb0a3c5ffaf16110829
-https://conda.anaconda.org/conda-forge/linux-64/libgoogle-cloud-2.12.0-hac9eb74_1.conda#0dee716254497604762957076ac76540
-https://conda.anaconda.org/conda-forge/linux-64/libsndfile-1.2.2-hc60ed4a_1.conda#ef1910918dd895516a769ed36b5b3a4e
-https://conda.anaconda.org/conda-forge/linux-64/libxkbcommon-1.7.0-h662e7e4_0.conda#b32c0da42b1f24a98577bb3d7fc0b995
-https://conda.anaconda.org/conda-forge/noarch/meson-1.4.0-pyhd8ed1ab_0.conda#52a0660cfa40b45bf254ecc3374cb2e0
-https://conda.anaconda.org/conda-forge/linux-64/mkl-2022.2.1-h84fe81f_16997.conda#a7ce56d5757f5b57e7daabe703ade5bb
-https://conda.anaconda.org/conda-forge/linux-64/pillow-10.3.0-py311h18e6fac_0.conda#6c520a9d36c9d7270988c7a6c360d6d4
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-auth-0.7.22-heee8711_7.conda#4f4ea05eaaaf001cad56fc4723caf208
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-mqtt-0.10.4-hb0abfc5_7.conda#b49afe12555befb53150e401d03264b3
+https://conda.anaconda.org/conda-forge/linux-64/azure-core-cpp-1.12.0-h830ed8b_0.conda#320d066f9cad598854f4af32c7c82931
+https://conda.anaconda.org/conda-forge/linux-64/cairo-1.18.0-hbb29018_2.conda#b6d90276c5aee9b4407dd94eb0cd40a8
+https://conda.anaconda.org/conda-forge/linux-64/coverage-7.5.4-py312h9a8786e_0.conda#b40224324679d1966a9fafbd602b28f3
+https://conda.anaconda.org/conda-forge/linux-64/fonttools-4.53.1-py312h41a817b_0.conda#da921c56bcf69a8b97216ecec0cc4015
+https://conda.anaconda.org/conda-forge/linux-64/glib-2.80.3-h8a4344b_1.conda#a3acc4920c9ca19cb6b295028d606477
+https://conda.anaconda.org/conda-forge/linux-64/gmpy2-2.1.5-py312h1d5cde6_1.conda#27abd7664bc87595bd98b6306b8393d1
+https://conda.anaconda.org/conda-forge/noarch/jinja2-3.1.4-pyhd8ed1ab_0.conda#7b86ecb7d3557821c649b3c31e3eb9f2
+https://conda.anaconda.org/conda-forge/noarch/joblib-1.4.2-pyhd8ed1ab_0.conda#25df261d4523d9f9783bcdb7208d872f
+https://conda.anaconda.org/conda-forge/linux-64/libclang-cpp15-15.0.7-default_h127d8a8_5.conda#d0a9633b53cdc319b8a1a532ae7822b8
+https://conda.anaconda.org/conda-forge/linux-64/libclang13-18.1.8-default_h6ae225f_0.conda#28ad2db5c14d2e23d7962b8389e2cc0b
+https://conda.anaconda.org/conda-forge/linux-64/libflac-1.4.3-h59595ed_0.conda#ee48bf17cc83a00f59ca1494d5646869
+https://conda.anaconda.org/conda-forge/linux-64/libgpg-error-1.50-h4f305b6_0.conda#0d7ff1a8e69565ca3add6925e18e708f
+https://conda.anaconda.org/conda-forge/linux-64/libgrpc-1.62.2-h15f2491_0.conda#8dabe607748cb3d7002ad73cd06f1325
+https://conda.anaconda.org/conda-forge/linux-64/libxkbcommon-1.7.0-h2c5496b_1.conda#e2eaefa4de2b7237af7c907b8bbc760a
+https://conda.anaconda.org/conda-forge/noarch/meson-1.4.1-pyhd8ed1ab_0.conda#714ca123839eeebb25d12b443067ea64
+https://conda.anaconda.org/conda-forge/linux-64/pillow-10.4.0-py312h287a98d_0.conda#59ea71eed98aee0bebbbdd3b118167c7
 https://conda.anaconda.org/conda-forge/noarch/pip-24.0-pyhd8ed1ab_0.conda#f586ac1e56c8638b64f9c8122a7b8a67
-https://conda.anaconda.org/conda-forge/noarch/pyproject-metadata-0.7.1-pyhd8ed1ab_0.conda#dcb27826ffc94d5f04e241322239983b
-https://conda.anaconda.org/conda-forge/noarch/pytest-7.4.4-pyhd8ed1ab_0.conda#a9d145de8c5f064b5fa68fb34725d9f4
+https://conda.anaconda.org/conda-forge/noarch/pyproject-metadata-0.8.0-pyhd8ed1ab_0.conda#573fe09d7bd0cd4bcc210d8369b5ca47
+https://conda.anaconda.org/conda-forge/noarch/pytest-8.2.2-pyhd8ed1ab_0.conda#0f3f49c22c7ef3a1195fa61dad3c43be
 https://conda.anaconda.org/conda-forge/noarch/python-dateutil-2.9.0-pyhd8ed1ab_0.conda#2cf4264fffb9e6eff6031c5b6884d61c
-https://conda.anaconda.org/conda-forge/linux-64/sip-6.7.12-py311hb755f60_0.conda#02336abab4cb5dd794010ef53c54bd09
-https://conda.anaconda.org/conda-forge/linux-64/aws-c-s3-0.3.14-hf3aad02_1.conda#a968ffa7e9fe0c257628033d393e512f
-https://conda.anaconda.org/conda-forge/linux-64/blas-1.0-mkl.tar.bz2#349aef876b1d8c9dccae01de20d5b385
-https://conda.anaconda.org/conda-forge/linux-64/gstreamer-1.24.1-h98fc4e7_1.conda#b04b5cdf3ba01430db27979250bc5a1d
-https://conda.anaconda.org/conda-forge/linux-64/harfbuzz-8.3.0-h3d44ed6_0.conda#5a6f6c00ef982a9bc83558d9ac8f64a0
-https://conda.anaconda.org/conda-forge/linux-64/libblas-3.9.0-16_linux64_mkl.tar.bz2#85f61af03fd291dae33150ffe89dc09a
-https://conda.anaconda.org/conda-forge/linux-64/libsystemd0-255-h3516f8a_1.conda#3366af27f0b593544a6cd453c7932ac5
-https://conda.anaconda.org/conda-forge/noarch/meson-python-0.15.0-pyh0c530f3_0.conda#3bc64565ca78ce3bb80248d09926d8f9
-https://conda.anaconda.org/conda-forge/linux-64/pyqt5-sip-12.12.2-py311hb755f60_5.conda#e4d262cc3600e70b505a6761d29f6207
+https://conda.anaconda.org/conda-forge/linux-64/sip-6.7.12-py312h30efb56_0.conda#32633871002ee9902f747d2236e0d122
+https://conda.anaconda.org/conda-forge/linux-64/tbb-2021.12.0-h434a139_2.conda#9e78ded802220ee1f67c908cb2ef188f
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-s3-0.6.0-h1f67ec3_0.conda#3db1e3d14496117a12851350eafe7c82
+https://conda.anaconda.org/conda-forge/linux-64/azure-identity-cpp-1.8.0-hdb0d106_1.conda#a297ffb4b505f51d0f58352c5c13971b
+https://conda.anaconda.org/conda-forge/linux-64/azure-storage-common-cpp-12.6.0-he3f277c_1.conda#8a10bb068b138dd473300b5fe34a1865
+https://conda.anaconda.org/conda-forge/linux-64/gstreamer-1.24.5-haf2f30d_0.conda#c5252c02592373fa8caf5a5327165a89
+https://conda.anaconda.org/conda-forge/linux-64/harfbuzz-8.5.0-hfac3d4d_0.conda#f5126317dd0ce0ba26945e411ecc6960
+https://conda.anaconda.org/conda-forge/linux-64/libgcrypt-1.11.0-h4ab18f5_0.conda#0a00e32cabe3e571c0611387e7bc2042
+https://conda.anaconda.org/conda-forge/linux-64/libgoogle-cloud-2.26.0-h26d7fe4_0.conda#7b9d4c93870fb2d644168071d4d76afb
+https://conda.anaconda.org/conda-forge/linux-64/libsndfile-1.2.2-hc60ed4a_1.conda#ef1910918dd895516a769ed36b5b3a4e
+https://conda.anaconda.org/conda-forge/noarch/meson-python-0.16.0-pyh0c530f3_0.conda#e16f0dbf502da873be9f9adb0dc52547
+https://conda.anaconda.org/conda-forge/linux-64/mkl-2023.2.0-h84fe81f_50496.conda#81d4a1a57d618adf0152db973d93b2ad
+https://conda.anaconda.org/conda-forge/linux-64/pyqt5-sip-12.12.2-py312h30efb56_5.conda#8a2a122dc4fe14d8cff38f1cf426381f
 https://conda.anaconda.org/conda-forge/noarch/pytest-cov-5.0.0-pyhd8ed1ab_0.conda#c54c0107057d67ddf077751339ec2c63
-https://conda.anaconda.org/conda-forge/noarch/pytest-xdist-3.5.0-pyhd8ed1ab_0.conda#d5f595da2daead898ca958ac62f0307b
-https://conda.anaconda.org/conda-forge/linux-64/aws-crt-cpp-0.21.0-hb942446_5.conda#07d92ed5403ad7b5c66ffd7d5b8f7e57
-https://conda.anaconda.org/conda-forge/linux-64/gst-plugins-base-1.24.1-hfa15dee_1.conda#a6dd2bbc684913e2bef0a54ce56fcbfb
-https://conda.anaconda.org/conda-forge/linux-64/libcblas-3.9.0-16_linux64_mkl.tar.bz2#361bf757b95488de76c4f123805742d3
-https://conda.anaconda.org/conda-forge/linux-64/liblapack-3.9.0-16_linux64_mkl.tar.bz2#a2f166748917d6d6e4707841ca1f519e
+https://conda.anaconda.org/conda-forge/noarch/pytest-xdist-3.6.1-pyhd8ed1ab_0.conda#b39568655c127a9c4a44d178ac99b6d0
+https://conda.anaconda.org/conda-forge/noarch/sympy-1.12.1-pypyh2585a3b_103.conda#4af9db19148140eb2ff3b2a93697063b
+https://conda.anaconda.org/conda-forge/linux-64/aws-crt-cpp-0.27.2-heffe44f_0.conda#6ee0af31304bca1d7406e41d30721db8
+https://conda.anaconda.org/conda-forge/linux-64/azure-storage-blobs-cpp-12.11.0-ha67cba7_1.conda#f03bba57b85a5b3ac443a871787fc429
+https://conda.anaconda.org/conda-forge/linux-64/gst-plugins-base-1.24.5-hbaaba92_0.conda#4a485842570569ba754863b2c083b346
+https://conda.anaconda.org/conda-forge/linux-64/libblas-3.9.0-20_linux64_mkl.conda#8bf521f6007b0b0eb91515a1165b5d85
+https://conda.anaconda.org/conda-forge/linux-64/libgoogle-cloud-storage-2.26.0-ha262f82_0.conda#89b53708fd67762b26c38c8ecc5d323d
+https://conda.anaconda.org/conda-forge/linux-64/libsystemd0-255-h3516f8a_1.conda#3366af27f0b593544a6cd453c7932ac5
+https://conda.anaconda.org/conda-forge/linux-64/mkl-devel-2023.2.0-ha770c72_50496.conda#3b4c50e31ff098b18a450e4f5f860adf
+https://conda.anaconda.org/conda-forge/linux-64/aws-sdk-cpp-1.11.329-habc23cd_8.conda#9d709ffcc4cfaa5ae35a740084188c5e
+https://conda.anaconda.org/conda-forge/linux-64/azure-storage-files-datalake-cpp-12.10.0-h29b5301_1.conda#bb35c23b178fc17b9e4458766f91da7f
+https://conda.anaconda.org/conda-forge/linux-64/libcblas-3.9.0-20_linux64_mkl.conda#7a2972758a03adc92d856072c71c9170
+https://conda.anaconda.org/conda-forge/linux-64/liblapack-3.9.0-20_linux64_mkl.conda#4db0cd03efcdab535f6f066aca4cddbb
 https://conda.anaconda.org/conda-forge/linux-64/pulseaudio-client-17.0-hb77b528_0.conda#07f45f1be1c25345faddb8db0de8039b
-https://conda.anaconda.org/conda-forge/linux-64/aws-sdk-cpp-1.10.57-h85b1a90_19.conda#0605d3d60857fc07bd6a11e878fe0f08
-https://conda.anaconda.org/conda-forge/linux-64/numpy-1.26.4-py311h64a7726_0.conda#a502d7aad449a1206efb366d6a12c52d
-https://conda.anaconda.org/conda-forge/linux-64/qt-main-5.15.8-hc9dc06e_21.conda#b325046180590c868ce0dbf267b82eb8
-https://conda.anaconda.org/conda-forge/noarch/array-api-strict-1.1.1-pyhd8ed1ab_0.conda#941bbcd64d1a7b44aeb497f468fc85b4
-https://conda.anaconda.org/conda-forge/linux-64/contourpy-1.2.1-py311h9547e67_0.conda#74ad0ae64f1ef565e27eda87fa749e84
-https://conda.anaconda.org/conda-forge/linux-64/libarrow-12.0.1-hb87d912_8_cpu.conda#3f3b11398fe79b578e3c44dd00a44e4a
-https://conda.anaconda.org/conda-forge/linux-64/pandas-2.2.1-py311h320fe9a_0.conda#aac8d7137fedc2fd5f8320bf50e4204c
-https://conda.anaconda.org/conda-forge/linux-64/polars-0.20.18-py311h78b473b_0.conda#10f68d86f397a539ef2749b057000c74
-https://conda.anaconda.org/conda-forge/linux-64/pyqt-5.15.9-py311hf0fb5b6_5.conda#ec7e45bc76d9d0b69a74a2075932b8e8
-https://conda.anaconda.org/conda-forge/linux-64/pytorch-1.13.1-cpu_py311h410fd25_1.conda#ddd2fadddf89e3dc3d541a2537fce010
-https://conda.anaconda.org/conda-forge/linux-64/scipy-1.13.0-py311h64a7726_0.conda#d443c70b4a05f50236c70b9c79beff64
-https://conda.anaconda.org/conda-forge/linux-64/matplotlib-base-3.8.3-py311h54ef318_0.conda#014c115be880802d2372ac6ed665f526
-https://conda.anaconda.org/conda-forge/linux-64/pyamg-5.1.0-py311h92ebd52_0.conda#2d415a805458e93fcf5551760fd2d287
-https://conda.anaconda.org/conda-forge/linux-64/pyarrow-12.0.1-py311h39c9aba_8_cpu.conda#587370a25bb2c50cce90909ce20d38b8
-https://conda.anaconda.org/conda-forge/linux-64/pytorch-cpu-1.13.1-cpu_py311hdb170b5_1.conda#a805d5f103e493f207613283d8acbbe1
-https://conda.anaconda.org/conda-forge/linux-64/matplotlib-3.8.3-py311h38be061_0.conda#0452c2cca94bdda38a16cf7b84edcd27
+https://conda.anaconda.org/conda-forge/linux-64/libarrow-16.1.0-h56e7afd_13_cpu.conda#f946bff9ab0922a79e5cd53a26546e89
+https://conda.anaconda.org/conda-forge/linux-64/liblapacke-3.9.0-20_linux64_mkl.conda#3dea5e9be386b963d7f4368966e238b3
+https://conda.anaconda.org/conda-forge/linux-64/libtorch-2.1.2-cpu_mkl_hff68eba_104.conda#a47f9e37a5e5006a0be7e845b3bb4b3e
+https://conda.anaconda.org/conda-forge/linux-64/numpy-1.26.4-py312heda63a1_0.conda#d8285bea2a350f63fab23bf460221f3f
+https://conda.anaconda.org/conda-forge/linux-64/qt-main-5.15.8-ha2b5568_22.conda#15de976572f24032540236006d6d0e9f
+https://conda.anaconda.org/conda-forge/noarch/array-api-strict-2.0.1-pyhd8ed1ab_0.conda#2c00d29e0e276f2d32dfe20e698b8eeb
+https://conda.anaconda.org/conda-forge/linux-64/blas-devel-3.9.0-20_linux64_mkl.conda#079d50df2338a3d47522d7e84c3dfbf6
+https://conda.anaconda.org/conda-forge/linux-64/contourpy-1.2.1-py312h8572e83_0.conda#12c6a831ef734f0b2dd4caff514cbb7f
+https://conda.anaconda.org/conda-forge/linux-64/libarrow-acero-16.1.0-he02047a_13_cpu.conda#af6fe29b2ff224505239ce660d13753c
+https://conda.anaconda.org/conda-forge/linux-64/libparquet-16.1.0-h9e5060d_13_cpu.conda#b7a3b2128388bda1338c6ff525e84726
+https://conda.anaconda.org/conda-forge/linux-64/pandas-2.2.2-py312h1d6d2e6_1.conda#ae00b61f3000d2284d1f2584d4dfafa8
+https://conda.anaconda.org/conda-forge/linux-64/polars-1.1.0-py312he319279_0.conda#097cadac45fd8c90ef7bbb8776733ec4
+https://conda.anaconda.org/conda-forge/linux-64/pyarrow-core-16.1.0-py312h70856f0_4_cpu.conda#6971b04df592bd625eebd5bfb1d9fc93
+https://conda.anaconda.org/conda-forge/linux-64/pyqt-5.15.9-py312h949fe66_5.conda#f6548a564e2d01b2a42020259503945b
+https://conda.anaconda.org/conda-forge/linux-64/pytorch-2.1.2-cpu_mkl_py312he7b903e_104.conda#a5cc49281c2e59c18bf0c75e23f3eabc
+https://conda.anaconda.org/conda-forge/linux-64/scipy-1.14.0-py312hc2bc53b_1.conda#eae80145f63aa04a02dda456d4883b46
+https://conda.anaconda.org/conda-forge/linux-64/blas-2.120-mkl.conda#9444330235a4828878cbe9c897ba0aa3
+https://conda.anaconda.org/conda-forge/linux-64/libarrow-dataset-16.1.0-he02047a_13_cpu.conda#79ff4667979272cc344c6bb16e64d354
+https://conda.anaconda.org/conda-forge/linux-64/matplotlib-base-3.8.4-py312h20ab3a6_2.conda#fbfe798f83f0d66410903ad8f40d5283
+https://conda.anaconda.org/conda-forge/linux-64/pyamg-5.2.1-py312h389efb2_0.conda#37038b979f8be9666d90a852879368fb
+https://conda.anaconda.org/conda-forge/linux-64/pytorch-cpu-2.1.2-cpu_mkl_py312he2922ba_104.conda#d258a5ab0b958cbdd0573f5ca2ef8895
+https://conda.anaconda.org/conda-forge/linux-64/libarrow-substrait-16.1.0-hc9a23c6_13_cpu.conda#4c29416218bcb470fad0b0b28ca932d5
+https://conda.anaconda.org/conda-forge/linux-64/matplotlib-3.8.4-py312h7900ff3_2.conda#ac26198045dff11c94202bb3e1bdc132
+https://conda.anaconda.org/conda-forge/linux-64/pyarrow-16.1.0-py312h9cebb41_4.conda#2097b6ae7186e10c9aab1228636b804f
diff --git a/build_tools/azure/pylatest_conda_forge_mkl_linux-64_environment.yml b/build_tools/azure/pylatest_conda_forge_mkl_linux-64_environment.yml
index 30686a983ab35..12fbd178dccb5 100644
--- a/build_tools/azure/pylatest_conda_forge_mkl_linux-64_environment.yml
+++ b/build_tools/azure/pylatest_conda_forge_mkl_linux-64_environment.yml
@@ -14,7 +14,7 @@ dependencies:
   - matplotlib
   - pandas
   - pyamg
-  - pytest<8
+  - pytest
   - pytest-xdist
   - pillow
   - pip
@@ -23,7 +23,7 @@ dependencies:
   - pytest-cov
   - coverage
   - ccache
-  - pytorch=1.13
+  - pytorch
   - pytorch-cpu
   - polars
   - pyarrow
diff --git a/build_tools/azure/pylatest_conda_forge_mkl_osx-64_conda.lock b/build_tools/azure/pylatest_conda_forge_mkl_osx-64_conda.lock
index 813b739ab0091..db356f06ef820 100644
--- a/build_tools/azure/pylatest_conda_forge_mkl_osx-64_conda.lock
+++ b/build_tools/azure/pylatest_conda_forge_mkl_osx-64_conda.lock
@@ -1,129 +1,129 @@
 # Generated by conda-lock.
 # platform: osx-64
-# input_hash: 05036df523e23d48cff7b6355ca081c5e5b41d8c5078cb9e1352f79e661d0549
+# input_hash: 134a56cb648e4588930416968ccdd27a7b83285f04712b032c6d07291b51b526
 @EXPLICIT
 https://conda.anaconda.org/conda-forge/osx-64/bzip2-1.0.8-h10d778d_5.conda#6097a6ca9ada32699b5fc4312dd6ef18
-https://conda.anaconda.org/conda-forge/osx-64/ca-certificates-2024.2.2-h8857fd0_0.conda#f2eacee8c33c43692f1ccfd33d0f50b1
+https://conda.anaconda.org/conda-forge/osx-64/ca-certificates-2024.7.4-h8857fd0_0.conda#7df874a4b05b2d2b82826190170eaa0f
 https://conda.anaconda.org/conda-forge/osx-64/icu-73.2-hf5e326d_0.conda#5cc301d759ec03f28328428e28f65591
 https://conda.anaconda.org/conda-forge/osx-64/libbrotlicommon-1.1.0-h0dc2134_1.conda#9e6c31441c9aa24e41ace40d6151aab6
-https://conda.anaconda.org/conda-forge/osx-64/libcxx-16.0.6-hd57cbcb_0.conda#7d6972792161077908b62971802f289a
 https://conda.anaconda.org/conda-forge/osx-64/libdeflate-1.20-h49d49c5_0.conda#d46104f6a896a0bc6a1d37b88b2edf5c
 https://conda.anaconda.org/conda-forge/osx-64/libexpat-2.6.2-h73e2aa4_0.conda#3d1d51c8f716d97c864d12f7af329526
 https://conda.anaconda.org/conda-forge/osx-64/libffi-3.4.2-h0d85af4_5.tar.bz2#ccb34fb14960ad8b125962d3d79b31a9
 https://conda.anaconda.org/conda-forge/noarch/libgfortran-devel_osx-64-12.3.0-h0b6f5ec_3.conda#39eeea5454333825d72202fae2d5e0b8
 https://conda.anaconda.org/conda-forge/osx-64/libiconv-1.17-hd75f5a5_2.conda#6c3628d047e151efba7cf08c5e54d1ca
 https://conda.anaconda.org/conda-forge/osx-64/libjpeg-turbo-3.0.0-h0dc2134_1.conda#72507f8e3961bc968af17435060b6dd6
-https://conda.anaconda.org/conda-forge/osx-64/libwebp-base-1.3.2-h0dc2134_0.conda#4e7e9d244e87d66c18d36894fd6a8ae5
-https://conda.anaconda.org/conda-forge/osx-64/libzlib-1.2.13-h8a1eda9_5.conda#4a3ad23f6e16f99c04e166767193d700
-https://conda.anaconda.org/conda-forge/osx-64/llvm-openmp-18.1.2-hb6ac08f_0.conda#e7f7e91cfabd8c7172c9ae405214dd68
+https://conda.anaconda.org/conda-forge/osx-64/libwebp-base-1.4.0-h10d778d_0.conda#b2c0047ea73819d992484faacbbe1c24
 https://conda.anaconda.org/conda-forge/osx-64/mkl-include-2023.2.0-h6bab518_50500.conda#835abb8ded5e26f23ea6996259c7972e
-https://conda.anaconda.org/conda-forge/osx-64/ncurses-6.4.20240210-h73e2aa4_0.conda#50f28c512e9ad78589e3eab34833f762
+https://conda.anaconda.org/conda-forge/osx-64/ncurses-6.5-h5846eda_0.conda#02a888433d165c99bf09784a7b14d900
 https://conda.anaconda.org/conda-forge/osx-64/pthread-stubs-0.4-hc929b4f_1001.tar.bz2#addd19059de62181cd11ae8f4ef26084
 https://conda.anaconda.org/conda-forge/osx-64/python_abi-3.12-4_cp312.conda#87201ac4314b911b74197e588cca3639
 https://conda.anaconda.org/conda-forge/noarch/tzdata-2024a-h0c530f3_0.conda#161081fc7cec0bfda0d86d7cb595f8d8
 https://conda.anaconda.org/conda-forge/osx-64/xorg-libxau-1.0.11-h0dc2134_0.conda#9566b4c29274125b0266d0177b5eb97b
 https://conda.anaconda.org/conda-forge/osx-64/xorg-libxdmcp-1.1.3-h35c211d_0.tar.bz2#86ac76d6bf1cbb9621943eb3bd9ae36e
 https://conda.anaconda.org/conda-forge/osx-64/xz-5.2.6-h775f41a_0.tar.bz2#a72f9d4ea13d55d745ff1ed594747f10
-https://conda.anaconda.org/conda-forge/osx-64/gmp-6.3.0-h73e2aa4_1.conda#92f8d748d95d97f92fc26cfac9bb5b6e
-https://conda.anaconda.org/conda-forge/osx-64/isl-0.26-imath32_h2e86a7b_101.conda#d06222822a9144918333346f145b68c6
-https://conda.anaconda.org/conda-forge/osx-64/lerc-4.0.0-hb486fe8_0.tar.bz2#f9d6a4c82889d5ecedec1d90eb673c55
 https://conda.anaconda.org/conda-forge/osx-64/libbrotlidec-1.1.0-h0dc2134_1.conda#9ee0bab91b2ca579e10353738be36063
 https://conda.anaconda.org/conda-forge/osx-64/libbrotlienc-1.1.0-h0dc2134_1.conda#8a421fe09c6187f0eb5e2338a8a8be6d
+https://conda.anaconda.org/conda-forge/osx-64/libcxx-17.0.6-heb59cac_3.conda#ef15f182e353155497e13726b915bfc4
+https://conda.anaconda.org/conda-forge/osx-64/libxcb-1.16-h0dc2134_0.conda#07e80289d4ba724f37b4b6f001f88fbe
+https://conda.anaconda.org/conda-forge/osx-64/libzlib-1.3.1-h87427d6_1.conda#b7575b5aa92108dcc9aaab0f05f2dbce
+https://conda.anaconda.org/conda-forge/osx-64/llvm-openmp-18.1.8-h15ab845_0.conda#2c3c6c8aaf8728f87326964a82fdc7d8
+https://conda.anaconda.org/conda-forge/osx-64/openssl-3.3.1-h87427d6_1.conda#d838ffe9ec3c6d971f110e04487466ff
+https://conda.anaconda.org/conda-forge/osx-64/readline-8.2-h9e318b2_1.conda#f17f77f2acf4d344734bda76829ce14e
+https://conda.anaconda.org/conda-forge/osx-64/brotli-bin-1.1.0-h0dc2134_1.conda#ece565c215adcc47fc1db4e651ee094b
+https://conda.anaconda.org/conda-forge/osx-64/gmp-6.3.0-hf036a51_2.conda#427101d13f19c4974552a4e5b072eef1
+https://conda.anaconda.org/conda-forge/osx-64/isl-0.26-imath32_h2e86a7b_101.conda#d06222822a9144918333346f145b68c6
+https://conda.anaconda.org/conda-forge/osx-64/lerc-4.0.0-hb486fe8_0.tar.bz2#f9d6a4c82889d5ecedec1d90eb673c55
 https://conda.anaconda.org/conda-forge/osx-64/libgfortran5-13.2.0-h2873a65_3.conda#e4fb4d23ec2870ff3c40d10afe305aec
 https://conda.anaconda.org/conda-forge/osx-64/libpng-1.6.43-h92b6c6a_0.conda#65dcddb15965c9de2c0365cb14910532
-https://conda.anaconda.org/conda-forge/osx-64/libsqlite-3.45.2-h92b6c6a_0.conda#086f56e13a96a6cfb1bf640505ae6b70
-https://conda.anaconda.org/conda-forge/osx-64/libxcb-1.15-hb7f2c08_0.conda#5513f57e0238c87c12dffedbcc9c1a4a
-https://conda.anaconda.org/conda-forge/osx-64/libxml2-2.12.6-hc0ae0f7_1.conda#bd85e0ca9e1ffaadc3b56079fd956035
-https://conda.anaconda.org/conda-forge/osx-64/ninja-1.11.1-hb8565cd_0.conda#49ad513efe39447aa51affd47e3aa68f
-https://conda.anaconda.org/conda-forge/osx-64/openssl-3.2.1-hd75f5a5_1.conda#570a6f04802df580be529f3a72d2bbf7
-https://conda.anaconda.org/conda-forge/osx-64/readline-8.2-h9e318b2_1.conda#f17f77f2acf4d344734bda76829ce14e
+https://conda.anaconda.org/conda-forge/osx-64/libsqlite-3.46.0-h1b8f9f3_0.conda#5dadfbc1a567fe6e475df4ce3148be09
+https://conda.anaconda.org/conda-forge/osx-64/libxml2-2.12.7-h3e169fe_1.conda#ddb63049aa7bd9f08f2cdc5a1c144d1a
+https://conda.anaconda.org/conda-forge/osx-64/ninja-1.12.1-h3c5361c_0.conda#a0ebabd021c8191aeb82793fe43cfdcb
+https://conda.anaconda.org/conda-forge/osx-64/sigtool-0.1.3-h88f4db0_0.tar.bz2#fbfb84b9de9a6939cb165c02c69b1865
 https://conda.anaconda.org/conda-forge/osx-64/tapi-1100.0.11-h9ce4665_0.tar.bz2#f9ff42ccf809a21ba6f8607f8de36108
 https://conda.anaconda.org/conda-forge/osx-64/tk-8.6.13-h1abcd95_1.conda#bf830ba5afc507c6232d4ef0fb1a882d
-https://conda.anaconda.org/conda-forge/osx-64/zlib-1.2.13-h8a1eda9_5.conda#75a8a98b1c4671c5d2897975731da42d
-https://conda.anaconda.org/conda-forge/osx-64/zstd-1.5.5-h829000d_0.conda#80abc41d0c48b82fe0f04e7f42f5cb7e
-https://conda.anaconda.org/conda-forge/osx-64/brotli-bin-1.1.0-h0dc2134_1.conda#ece565c215adcc47fc1db4e651ee094b
+https://conda.anaconda.org/conda-forge/osx-64/zlib-1.3.1-h87427d6_1.conda#3ac9ef8975965f9698dbedd2a4cc5894
+https://conda.anaconda.org/conda-forge/osx-64/zstd-1.5.6-h915ae27_0.conda#4cb2cd56f039b129bb0e491c1164167e
+https://conda.anaconda.org/conda-forge/osx-64/brotli-1.1.0-h0dc2134_1.conda#9272dd3b19c4e8212f8542cefd5c3d67
 https://conda.anaconda.org/conda-forge/osx-64/freetype-2.12.1-h60636b9_2.conda#25152fce119320c980e5470e64834b50
 https://conda.anaconda.org/conda-forge/osx-64/libgfortran-5.0.0-13_2_0_h97931a8_3.conda#0b6e23a012ee7a9a5f6b244f5a92c1d5
-https://conda.anaconda.org/conda-forge/osx-64/libhwloc-2.9.3-default_h24e0189_1009.conda#22fcbfd2a4cdf941b074a00b773b43dd
+https://conda.anaconda.org/conda-forge/osx-64/libhwloc-2.11.0-default_h456cccd_1000.conda#3e07b3953681279cc9cbc4d8b2723009
 https://conda.anaconda.org/conda-forge/osx-64/libllvm16-16.0.6-hbedff68_3.conda#8fd56c0adc07a37f93bd44aa61a97c90
 https://conda.anaconda.org/conda-forge/osx-64/libtiff-4.6.0-h129831d_3.conda#568593071d2e6cea7b5fc1f75bfa10ca
 https://conda.anaconda.org/conda-forge/osx-64/mpfr-4.2.1-h4f6b447_1.conda#b90df08f0deb2f58631447c1462c92a7
-https://conda.anaconda.org/conda-forge/osx-64/python-3.12.2-h9f0c242_0_cpython.conda#0179b8007ba008cf5bec11f3b3853902
-https://conda.anaconda.org/conda-forge/osx-64/sigtool-0.1.3-h88f4db0_0.tar.bz2#fbfb84b9de9a6939cb165c02c69b1865
-https://conda.anaconda.org/conda-forge/osx-64/brotli-1.1.0-h0dc2134_1.conda#9272dd3b19c4e8212f8542cefd5c3d67
-https://conda.anaconda.org/conda-forge/noarch/certifi-2024.2.2-pyhd8ed1ab_0.conda#0876280e409658fc6f9e75d035960333
+https://conda.anaconda.org/conda-forge/osx-64/python-3.12.4-h37a9e06_0_cpython.conda#94e2b77992f580ac6b7a4fc9b53018b3
+https://conda.anaconda.org/conda-forge/noarch/certifi-2024.6.2-pyhd8ed1ab_0.conda#8821ec1c8fcdc9e1d291d7b9f6e9968a
 https://conda.anaconda.org/conda-forge/noarch/colorama-0.4.6-pyhd8ed1ab_0.tar.bz2#3faab06a954c2a04039983f2c4a50d99
 https://conda.anaconda.org/conda-forge/noarch/cycler-0.12.1-pyhd8ed1ab_0.conda#5cd86562580f274031ede6aa6aa24441
 https://conda.anaconda.org/conda-forge/osx-64/cython-3.0.10-py312hede676d_0.conda#3008aa88f0dc67e7144734b16e331ee4
 https://conda.anaconda.org/conda-forge/noarch/exceptiongroup-1.2.0-pyhd8ed1ab_2.conda#8d652ea2ee8eaee02ed8dc820bc794aa
-https://conda.anaconda.org/conda-forge/noarch/execnet-2.1.0-pyhd8ed1ab_0.conda#7a4b32fbe5442e46841ec77695e36d96
+https://conda.anaconda.org/conda-forge/noarch/execnet-2.1.1-pyhd8ed1ab_0.conda#15dda3cdbf330abfe9f555d22f66db46
 https://conda.anaconda.org/conda-forge/noarch/iniconfig-2.0.0-pyhd8ed1ab_0.conda#f800d2da156d08e289b14e87e43c1ae5
 https://conda.anaconda.org/conda-forge/osx-64/kiwisolver-1.4.5-py312h49ebfd2_1.conda#21f174a5cfb5964069c374171a979157
 https://conda.anaconda.org/conda-forge/osx-64/lcms2-2.16-ha2f27b4_0.conda#1442db8f03517834843666c422238c9b
 https://conda.anaconda.org/conda-forge/osx-64/ld64_osx-64-711-ha20a434_0.conda#a8b41eb97c8a9d618243a79ba78fdc3c
-https://conda.anaconda.org/conda-forge/osx-64/libclang-cpp16-16.0.6-default_h7151d67_6.conda#7eaad118ab797d1427f8745c861d1925
+https://conda.anaconda.org/conda-forge/osx-64/libclang-cpp16-16.0.6-default_h0c94c6a_9.conda#1d2344f627433a89f189b8aeb503eaa6
 https://conda.anaconda.org/conda-forge/osx-64/libhiredis-1.0.2-h2beb688_0.tar.bz2#524282b2c46c9dedf051b3bc2ae05494
 https://conda.anaconda.org/conda-forge/osx-64/llvm-tools-16.0.6-hbedff68_3.conda#e9356b0807462e8f84c1384a8da539a5
 https://conda.anaconda.org/conda-forge/osx-64/mpc-1.3.1-h81bd1dd_0.conda#c752c0eb6c250919559172c011e5f65b
 https://conda.anaconda.org/conda-forge/noarch/munkres-1.1.4-pyh9f0ad1d_0.tar.bz2#2ba8498c1018c1e9c61eb99b973dfe19
 https://conda.anaconda.org/conda-forge/osx-64/openjpeg-2.5.2-h7310d3a_0.conda#05a14cc9d725dd74995927968d6547e3
-https://conda.anaconda.org/conda-forge/noarch/packaging-24.0-pyhd8ed1ab_0.conda#248f521b64ce055e7feae3105e7abeb8
-https://conda.anaconda.org/conda-forge/noarch/pluggy-1.4.0-pyhd8ed1ab_0.conda#139e9feb65187e916162917bb2484976
+https://conda.anaconda.org/conda-forge/noarch/packaging-24.1-pyhd8ed1ab_0.conda#cbe1bb1f21567018ce595d9c2be0f0db
+https://conda.anaconda.org/conda-forge/noarch/pluggy-1.5.0-pyhd8ed1ab_0.conda#d3483c8fc2dc2cc3f5cf43e26d60cabf
 https://conda.anaconda.org/conda-forge/noarch/pyparsing-3.1.2-pyhd8ed1ab_0.conda#b9a4dacf97241704529131a0dfc0494f
 https://conda.anaconda.org/conda-forge/noarch/python-tzdata-2024.1-pyhd8ed1ab_0.conda#98206ea9954216ee7540f0c773f2104d
 https://conda.anaconda.org/conda-forge/noarch/pytz-2024.1-pyhd8ed1ab_0.conda#3eeeeb9e4827ace8c0c1419c85d590ad
-https://conda.anaconda.org/conda-forge/noarch/setuptools-69.2.0-pyhd8ed1ab_0.conda#da214ecd521a720a9d521c68047682dc
+https://conda.anaconda.org/conda-forge/noarch/setuptools-70.1.1-pyhd8ed1ab_0.conda#985e9e86e1b0fc75a74a9bfab9309ef7
 https://conda.anaconda.org/conda-forge/noarch/six-1.16.0-pyh6c4a22f_0.tar.bz2#e5f25f8dbc060e9a8d912e432202afc2
-https://conda.anaconda.org/conda-forge/osx-64/tbb-2021.11.0-h7728843_1.conda#29e29beba9deb0ef66bee015c5bf3c14
-https://conda.anaconda.org/conda-forge/noarch/threadpoolctl-3.4.0-pyhc1e730c_0.conda#b296278eef667c673bf51de6535bad88
+https://conda.anaconda.org/conda-forge/osx-64/tbb-2021.12.0-h3c5361c_2.conda#9baedc6436ec835bca3aabf06e971687
+https://conda.anaconda.org/conda-forge/noarch/threadpoolctl-3.5.0-pyhc1e730c_0.conda#df68d78237980a159bd7149f33c0e8fd
 https://conda.anaconda.org/conda-forge/noarch/toml-0.10.2-pyhd8ed1ab_0.tar.bz2#f832c45a477c78bebd107098db465095
 https://conda.anaconda.org/conda-forge/noarch/tomli-2.0.1-pyhd8ed1ab_0.tar.bz2#5844808ffab9ebdb694585b50ba02a96
-https://conda.anaconda.org/conda-forge/osx-64/tornado-6.4-py312h41838bb_0.conda#2d2d1fde5800d45cb56218583156d23d
+https://conda.anaconda.org/conda-forge/osx-64/tornado-6.4.1-py312hbd25219_0.conda#5a40db69b327c71511248f8186965bd3
 https://conda.anaconda.org/conda-forge/noarch/wheel-0.43.0-pyhd8ed1ab_1.conda#0b5293a157c2b5cd513dd1b03d8d3aae
-https://conda.anaconda.org/conda-forge/osx-64/ccache-4.9.1-h41adc32_0.conda#45aaf96b67840bd98a928de8679098fa
+https://conda.anaconda.org/conda-forge/osx-64/ccache-4.10.1-hee5fd93_0.conda#09898bb80e196695cea9e07402cff215
 https://conda.anaconda.org/conda-forge/osx-64/cctools_osx-64-986-ha1c5b94_0.conda#a8951de2506df5649f5a3295fdfd9f2c
-https://conda.anaconda.org/conda-forge/osx-64/clang-16-16.0.6-default_h7151d67_6.conda#1c298568c30efe7d9369c7c15b748461
-https://conda.anaconda.org/conda-forge/osx-64/coverage-7.4.4-py312h41838bb_0.conda#b0e22bba5fbc3c8d02e25aeb33475fce
-https://conda.anaconda.org/conda-forge/osx-64/fonttools-4.51.0-py312h41838bb_0.conda#ebe40134b860cf704ddaf81f684f95a5
+https://conda.anaconda.org/conda-forge/osx-64/clang-16-16.0.6-default_h0c94c6a_9.conda#bdd24ee262fd1c08f6e0a8173140321d
+https://conda.anaconda.org/conda-forge/osx-64/coverage-7.5.4-py312hbd25219_0.conda#43835a5631d9118d18681fd4d0c2463f
+https://conda.anaconda.org/conda-forge/osx-64/fonttools-4.53.1-py312hbd25219_0.conda#56b85d2b2f034ed31feaaa0b90c37b7f
 https://conda.anaconda.org/conda-forge/osx-64/gfortran_impl_osx-64-12.3.0-hc328e78_3.conda#b3d751dc7073bbfdfa9d863e39b9685d
-https://conda.anaconda.org/conda-forge/noarch/joblib-1.3.2-pyhd8ed1ab_0.conda#4da50d410f553db77e62ab62ffaa1abc
+https://conda.anaconda.org/conda-forge/noarch/joblib-1.4.2-pyhd8ed1ab_0.conda#25df261d4523d9f9783bcdb7208d872f
 https://conda.anaconda.org/conda-forge/osx-64/ld64-711-ha02d983_0.conda#3ae4930ec076735cce481e906f5192e0
-https://conda.anaconda.org/conda-forge/noarch/meson-1.4.0-pyhd8ed1ab_0.conda#52a0660cfa40b45bf254ecc3374cb2e0
+https://conda.anaconda.org/conda-forge/noarch/meson-1.4.1-pyhd8ed1ab_0.conda#714ca123839eeebb25d12b443067ea64
 https://conda.anaconda.org/conda-forge/osx-64/mkl-2023.2.0-h54c2260_50500.conda#0a342ccdc79e4fcd359245ac51941e7b
-https://conda.anaconda.org/conda-forge/osx-64/pillow-10.3.0-py312h0c923fa_0.conda#6f0591ae972e9b815739da3392fbb3c3
+https://conda.anaconda.org/conda-forge/osx-64/pillow-10.4.0-py312hbd70edc_0.conda#8d55e92fa6380ac8c245f253b096fefd
 https://conda.anaconda.org/conda-forge/noarch/pip-24.0-pyhd8ed1ab_0.conda#f586ac1e56c8638b64f9c8122a7b8a67
-https://conda.anaconda.org/conda-forge/noarch/pyproject-metadata-0.7.1-pyhd8ed1ab_0.conda#dcb27826ffc94d5f04e241322239983b
-https://conda.anaconda.org/conda-forge/noarch/pytest-7.4.4-pyhd8ed1ab_0.conda#a9d145de8c5f064b5fa68fb34725d9f4
+https://conda.anaconda.org/conda-forge/noarch/pyproject-metadata-0.8.0-pyhd8ed1ab_0.conda#573fe09d7bd0cd4bcc210d8369b5ca47
+https://conda.anaconda.org/conda-forge/noarch/pytest-8.2.2-pyhd8ed1ab_0.conda#0f3f49c22c7ef3a1195fa61dad3c43be
 https://conda.anaconda.org/conda-forge/noarch/python-dateutil-2.9.0-pyhd8ed1ab_0.conda#2cf4264fffb9e6eff6031c5b6884d61c
 https://conda.anaconda.org/conda-forge/osx-64/cctools-986-h40f6528_0.conda#b7a2ca0062a6ee8bc4e83ec887bef942
-https://conda.anaconda.org/conda-forge/osx-64/clang-16.0.6-hdae98eb_6.conda#884e7b24306e4f21b7ee08dabadb2ecc
+https://conda.anaconda.org/conda-forge/osx-64/clang-16.0.6-default_h179603d_9.conda#1acf03a00abda70355ef2978cfce3e9b
 https://conda.anaconda.org/conda-forge/osx-64/libblas-3.9.0-20_osx64_mkl.conda#160fdc97a51d66d51dc782fb67d35205
-https://conda.anaconda.org/conda-forge/noarch/meson-python-0.15.0-pyh0c530f3_0.conda#3bc64565ca78ce3bb80248d09926d8f9
+https://conda.anaconda.org/conda-forge/noarch/meson-python-0.16.0-pyh0c530f3_0.conda#e16f0dbf502da873be9f9adb0dc52547
 https://conda.anaconda.org/conda-forge/osx-64/mkl-devel-2023.2.0-h694c41f_50500.conda#1b4d0235ef253a1e19459351badf4f9f
 https://conda.anaconda.org/conda-forge/noarch/pytest-cov-5.0.0-pyhd8ed1ab_0.conda#c54c0107057d67ddf077751339ec2c63
-https://conda.anaconda.org/conda-forge/noarch/pytest-xdist-3.5.0-pyhd8ed1ab_0.conda#d5f595da2daead898ca958ac62f0307b
-https://conda.anaconda.org/conda-forge/osx-64/clangxx-16.0.6-default_h7151d67_6.conda#cc8c007a529a7cfaa5d29d8599df3fe6
+https://conda.anaconda.org/conda-forge/noarch/pytest-xdist-3.6.1-pyhd8ed1ab_0.conda#b39568655c127a9c4a44d178ac99b6d0
+https://conda.anaconda.org/conda-forge/osx-64/clangxx-16.0.6-default_h179603d_9.conda#0cad937ac54668f5bd98ab7c6a76374c
 https://conda.anaconda.org/conda-forge/osx-64/libcblas-3.9.0-20_osx64_mkl.conda#51089a4865eb4aec2bc5c7468bd07f9f
 https://conda.anaconda.org/conda-forge/osx-64/liblapack-3.9.0-20_osx64_mkl.conda#58f08e12ad487fac4a08f90ff0b87aec
 https://conda.anaconda.org/conda-forge/noarch/compiler-rt_osx-64-16.0.6-ha38d28d_2.conda#7a46507edc35c6c8818db0adaf8d787f
 https://conda.anaconda.org/conda-forge/osx-64/liblapacke-3.9.0-20_osx64_mkl.conda#124ae8e384268a8da66f1d64114a1eda
-https://conda.anaconda.org/conda-forge/osx-64/numpy-1.26.4-py312he3a82b2_0.conda#96c61a21c4276613748dba069554846b
+https://conda.anaconda.org/conda-forge/osx-64/numpy-2.0.0-py312h8813227_0.conda#814dba0ed2de85d89e09a5b811024a86
 https://conda.anaconda.org/conda-forge/osx-64/blas-devel-3.9.0-20_osx64_mkl.conda#cc3260179093918b801e373c6e888e02
 https://conda.anaconda.org/conda-forge/osx-64/compiler-rt-16.0.6-ha38d28d_2.conda#3b9e8c5c63b8e86234f499490acd85c2
 https://conda.anaconda.org/conda-forge/osx-64/contourpy-1.2.1-py312h9230928_0.conda#079df34ce7c71259cfdd394645370891
-https://conda.anaconda.org/conda-forge/osx-64/pandas-2.2.1-py312h83c8a23_0.conda#c562e07382cdc3194c21b8eca06460ff
-https://conda.anaconda.org/conda-forge/osx-64/scipy-1.13.0-py312h8adb940_0.conda#818232a7807c76970172af9c7698ba4a
+https://conda.anaconda.org/conda-forge/osx-64/pandas-2.2.2-py312h1171441_1.conda#240737937f1f046b0e03ecc11ac4ec98
+https://conda.anaconda.org/conda-forge/osx-64/scipy-1.14.0-py312hb9702fa_1.conda#9899db3cf8965c3aecab3daf5227d3eb
 https://conda.anaconda.org/conda-forge/osx-64/blas-2.120-mkl.conda#b041a7677a412f3d925d8208936cb1e2
-https://conda.anaconda.org/conda-forge/osx-64/clang_impl_osx-64-16.0.6-h8787910_11.conda#ed9c90270c77481fc4cfccd0891d62a8
-https://conda.anaconda.org/conda-forge/osx-64/matplotlib-base-3.8.3-py312h1fe5000_0.conda#5f65fc4ce880d4c795e217d563a114ec
-https://conda.anaconda.org/conda-forge/osx-64/pyamg-5.1.0-py312h3db3e91_0.conda#c6d6248b99fc11b15c9becea581a1462
-https://conda.anaconda.org/conda-forge/osx-64/clang_osx-64-16.0.6-hb91bd55_11.conda#24123b15e9c0dad9c0d5fd9da0b4c7a9
-https://conda.anaconda.org/conda-forge/osx-64/matplotlib-3.8.3-py312hb401068_0.conda#7015bf84c9d39284c4746d814da2a0f1
-https://conda.anaconda.org/conda-forge/osx-64/c-compiler-1.7.0-h282daa2_0.conda#4652f33fe8d895f61177e2783b289377
-https://conda.anaconda.org/conda-forge/osx-64/clangxx_impl_osx-64-16.0.6-h6d92fbe_11.conda#a658c595675bde00373347b22a974810
+https://conda.anaconda.org/conda-forge/osx-64/clang_impl_osx-64-16.0.6-h8787910_16.conda#c50c939d1bf9785561220b2cfbb98cb9
+https://conda.anaconda.org/conda-forge/osx-64/matplotlib-base-3.8.4-py312hb6d62fa_2.conda#6c5cf505d118f4b58961191fd5e0d030
+https://conda.anaconda.org/conda-forge/osx-64/pyamg-5.2.1-py312h44e70fa_0.conda#a7c77239f0135d30cbba0164922aa861
+https://conda.anaconda.org/conda-forge/osx-64/clang_osx-64-16.0.6-hb91bd55_16.conda#b5dacba087761db21ba9eb69b2c1718b
+https://conda.anaconda.org/conda-forge/osx-64/matplotlib-3.8.4-py312hb401068_2.conda#456c057a3e2dcac3d02f4b9d25e277f5
+https://conda.anaconda.org/conda-forge/osx-64/c-compiler-1.7.0-h282daa2_1.conda#d27411cb82bc1b76b9f487da6ae97f1d
+https://conda.anaconda.org/conda-forge/osx-64/clangxx_impl_osx-64-16.0.6-h6d92fbe_16.conda#55fb2d5cbc9ec490347b1f797536fba8
 https://conda.anaconda.org/conda-forge/osx-64/gfortran_osx-64-12.3.0-h18f7dce_1.conda#436af2384c47aedb94af78a128e174f1
-https://conda.anaconda.org/conda-forge/osx-64/clangxx_osx-64-16.0.6-hb91bd55_11.conda#e49aad30263abdcb785e610981b7c2c7
+https://conda.anaconda.org/conda-forge/osx-64/clangxx_osx-64-16.0.6-hb91bd55_16.conda#5879c43528a2601d04d64c5f9fdf3033
 https://conda.anaconda.org/conda-forge/osx-64/gfortran-12.3.0-h2c809b3_1.conda#c48adbaa8944234b80ef287c37e329b0
-https://conda.anaconda.org/conda-forge/osx-64/cxx-compiler-1.7.0-h7728843_0.conda#8abaa2694c1fba2b6bd3753d00a60415
-https://conda.anaconda.org/conda-forge/osx-64/fortran-compiler-1.7.0-h6c2ab21_0.conda#2c11db8b46df0a547997116f0fd54b8e
-https://conda.anaconda.org/conda-forge/osx-64/compilers-1.7.0-h694c41f_0.conda#3576aa54986a3e2a5370e4232b35c036
+https://conda.anaconda.org/conda-forge/osx-64/cxx-compiler-1.7.0-h7728843_1.conda#e04cb15a20553b973dd068c2dc81d682
+https://conda.anaconda.org/conda-forge/osx-64/fortran-compiler-1.7.0-h6c2ab21_1.conda#48319058089f492d5059e04494b81ed9
+https://conda.anaconda.org/conda-forge/osx-64/compilers-1.7.0-h694c41f_1.conda#875e9b06186a41d55b96b9c1a52f15be
diff --git a/build_tools/azure/pylatest_conda_forge_mkl_osx-64_environment.yml b/build_tools/azure/pylatest_conda_forge_mkl_osx-64_environment.yml
index cfa1b7689a4ad..ad177e4ed391b 100644
--- a/build_tools/azure/pylatest_conda_forge_mkl_osx-64_environment.yml
+++ b/build_tools/azure/pylatest_conda_forge_mkl_osx-64_environment.yml
@@ -14,7 +14,7 @@ dependencies:
   - matplotlib
   - pandas
   - pyamg
-  - pytest<8
+  - pytest
   - pytest-xdist
   - pillow
   - pip
diff --git a/build_tools/azure/pylatest_conda_mkl_no_openmp_environment.yml b/build_tools/azure/pylatest_conda_mkl_no_openmp_environment.yml
index 9c46400c2d3c6..7e85b28b3f6c4 100644
--- a/build_tools/azure/pylatest_conda_mkl_no_openmp_environment.yml
+++ b/build_tools/azure/pylatest_conda_mkl_no_openmp_environment.yml
@@ -9,19 +9,19 @@ dependencies:
   - blas[build=mkl]
   - scipy<1.12
   - joblib
-  - threadpoolctl
   - matplotlib
   - pandas
   - pyamg
-  - pytest<8
+  - pytest
   - pytest-xdist
   - pillow
   - pip
   - ninja
-  - meson-python
   - pytest-cov
   - coverage
   - ccache
   - pip
   - pip:
     - cython
+    - threadpoolctl
+    - meson-python
diff --git a/build_tools/azure/pylatest_conda_mkl_no_openmp_osx-64_conda.lock b/build_tools/azure/pylatest_conda_mkl_no_openmp_osx-64_conda.lock
index aa946a23c4650..a5342c25efa97 100644
--- a/build_tools/azure/pylatest_conda_mkl_no_openmp_osx-64_conda.lock
+++ b/build_tools/azure/pylatest_conda_mkl_no_openmp_osx-64_conda.lock
@@ -1,86 +1,86 @@
 # Generated by conda-lock.
 # platform: osx-64
-# input_hash: d3fadab6d5d5d715660beb53286e2687b018b5195ef7ce47928bb79a96ee851b
+# input_hash: 197b213ba4980b3e95dcd438da09eb9b55e4bf5a4d8e6d3ddab29275aa22556a
 @EXPLICIT
 https://repo.anaconda.com/pkgs/main/osx-64/blas-1.0-mkl.conda#cb2c87e85ac8e0ceae776d26d4214c8a
-https://repo.anaconda.com/pkgs/main/osx-64/bzip2-1.0.8-h6c40b1e_5.conda#0f51dde96c82dcf58a788787fed4c5b9
+https://repo.anaconda.com/pkgs/main/osx-64/bzip2-1.0.8-h6c40b1e_6.conda#96224786021d0765ce05818fa3c59bdb
 https://repo.anaconda.com/pkgs/main/osx-64/ca-certificates-2024.3.11-hecd8cb5_0.conda#a2e29a11940c66baf9942912096fad5f
 https://repo.anaconda.com/pkgs/main/osx-64/jpeg-9e-h6c40b1e_1.conda#fc3e61fa41309946c9283fe8737d7f41
-https://repo.anaconda.com/pkgs/main/osx-64/libbrotlicommon-1.0.9-hca72f7f_7.conda#6c865b9e76fa2fad0c8ac32aa0f01f75
+https://repo.anaconda.com/pkgs/main/osx-64/libbrotlicommon-1.0.9-h6c40b1e_8.conda#8e86dfa34b08bc664b19e1499e5465b8
 https://repo.anaconda.com/pkgs/main/osx-64/libcxx-14.0.6-h9765a3e_0.conda#387757bb354ae9042370452cd0fb5627
 https://repo.anaconda.com/pkgs/main/osx-64/libdeflate-1.17-hb664fd8_1.conda#b6116b8db33ea6a5b5287dae70d4a913
-https://repo.anaconda.com/pkgs/main/osx-64/libffi-3.4.4-hecd8cb5_0.conda#c20b2687118c471b1d70067ef2b2703f
+https://repo.anaconda.com/pkgs/main/osx-64/libffi-3.4.4-hecd8cb5_1.conda#eb7f09ada4d95f1a26f483f1009d9286
 https://repo.anaconda.com/pkgs/main/osx-64/libwebp-base-1.3.2-h6c40b1e_0.conda#d8fd9f599dd4e012694e69d119016442
 https://repo.anaconda.com/pkgs/main/osx-64/llvm-openmp-14.0.6-h0dcd299_0.conda#b5804d32b87dc61ca94561ade33d5f2d
 https://repo.anaconda.com/pkgs/main/osx-64/ncurses-6.4-hcec6c5f_0.conda#0214d1ee980e217fabc695f1e40662aa
 https://repo.anaconda.com/pkgs/main/noarch/tzdata-2024a-h04d1e81_0.conda#452af53adae0a5b06eb5d05c707b2f25
-https://repo.anaconda.com/pkgs/main/osx-64/xz-5.4.6-h6c40b1e_0.conda#412bf13f273c0e086da65f86567cfe80
-https://repo.anaconda.com/pkgs/main/osx-64/zlib-1.2.13-h4dc903c_0.conda#d0202dd912bfb45d3422786531717882
+https://repo.anaconda.com/pkgs/main/osx-64/xz-5.4.6-h6c40b1e_1.conda#b40d69768d28133d8be1843def4f82f5
+https://repo.anaconda.com/pkgs/main/osx-64/zlib-1.2.13-h4b97444_1.conda#38e35f7c817fac0973034bfce6706ec2
 https://repo.anaconda.com/pkgs/main/osx-64/ccache-3.7.9-hf120daa_0.conda#a01515a32e721c51d631283f991bc8ea
-https://repo.anaconda.com/pkgs/main/osx-64/expat-2.5.0-hcec6c5f_0.conda#ce90fd42031d3c01944146f089a9130b
+https://repo.anaconda.com/pkgs/main/osx-64/expat-2.6.2-hcec6c5f_0.conda#c748234dd7e242784198ab038372cb0c
 https://repo.anaconda.com/pkgs/main/osx-64/intel-openmp-2023.1.0-ha357a0b_43548.conda#ba8a89ffe593eb88e4c01334753c40c3
 https://repo.anaconda.com/pkgs/main/osx-64/lerc-3.0-he9d5cce_0.conda#aec2c3dbef836849c9260f05be04f3db
-https://repo.anaconda.com/pkgs/main/osx-64/libbrotlidec-1.0.9-hca72f7f_7.conda#b85983951745cc666d9a1b42894210b2
-https://repo.anaconda.com/pkgs/main/osx-64/libbrotlienc-1.0.9-hca72f7f_7.conda#e306d7a1599202a7c95762443f110832
+https://repo.anaconda.com/pkgs/main/osx-64/libbrotlidec-1.0.9-h6c40b1e_8.conda#6338cd7779e614fc16d835990e627e04
+https://repo.anaconda.com/pkgs/main/osx-64/libbrotlienc-1.0.9-h6c40b1e_8.conda#2af01a7b3fdbed47ebe5c452c34e5c5d
 https://repo.anaconda.com/pkgs/main/osx-64/libgfortran5-11.3.0-h9dfd629_28.conda#1fa1a27ee100b1918c3021dbfa3895a3
 https://repo.anaconda.com/pkgs/main/osx-64/libpng-1.6.39-h6c40b1e_0.conda#a3c824835f53ad27aeb86d2b55e47804
-https://repo.anaconda.com/pkgs/main/osx-64/lz4-c-1.9.4-hcec6c5f_0.conda#44291e9e6920cfff30caf1299f48db38
+https://repo.anaconda.com/pkgs/main/osx-64/lz4-c-1.9.4-hcec6c5f_1.conda#aee0efbb45220e1985533dbff48551f8
 https://repo.anaconda.com/pkgs/main/osx-64/ninja-base-1.10.2-haf03e11_5.conda#c857c13129710a61395270656905c4a2
-https://repo.anaconda.com/pkgs/main/osx-64/openssl-3.0.13-hca72f7f_0.conda#08b109f010b97ce6cef211e235177175
+https://repo.anaconda.com/pkgs/main/osx-64/openssl-3.0.14-h46256e1_0.conda#d722280df65b3308e1b8b1b7777a3305
 https://repo.anaconda.com/pkgs/main/osx-64/readline-8.2-hca72f7f_0.conda#971667436260e523f6f7355fdfa238bf
 https://repo.anaconda.com/pkgs/main/osx-64/tbb-2021.8.0-ha357a0b_0.conda#fb48530a3eea681c11dafb95b3387c0f
-https://repo.anaconda.com/pkgs/main/osx-64/tk-8.6.12-h5d9f67b_0.conda#047f0af5486d19163e37fd7f8ae3d29f
-https://repo.anaconda.com/pkgs/main/osx-64/brotli-bin-1.0.9-hca72f7f_7.conda#110bdca1a20710820e61f7fa3047f737
+https://repo.anaconda.com/pkgs/main/osx-64/tk-8.6.14-h4d00af3_0.conda#a2c03940c2ae54614301ec82e6a98d75
+https://repo.anaconda.com/pkgs/main/osx-64/brotli-bin-1.0.9-h6c40b1e_8.conda#11053f9c6b8d8a8348d0c33450c23ce9
 https://repo.anaconda.com/pkgs/main/osx-64/freetype-2.12.1-hd8bbffd_0.conda#1f276af321375ee7fe8056843044fa76
 https://repo.anaconda.com/pkgs/main/osx-64/libgfortran-5.0.0-11_3_0_hecd8cb5_28.conda#2eb13b680803f1064e53873ae0aaafb3
 https://repo.anaconda.com/pkgs/main/osx-64/mkl-2023.1.0-h8e150cf_43560.conda#85d0f3431dd5c6ae44f8725fdd3d3e59
-https://repo.anaconda.com/pkgs/main/osx-64/sqlite-3.41.2-h6c40b1e_0.conda#6947a501943529c7536b7e4ba53802c1
-https://repo.anaconda.com/pkgs/main/osx-64/zstd-1.5.5-hc035e20_0.conda#5e0b7ddb1b7dc6b630e1f9a03499c19c
-https://repo.anaconda.com/pkgs/main/osx-64/brotli-1.0.9-hca72f7f_7.conda#68e54d12ec67591deb2ffd70348fb00f
+https://repo.anaconda.com/pkgs/main/osx-64/sqlite-3.45.3-h6c40b1e_0.conda#2edf909b937b3aad48322c9cb2e8f1a0
+https://repo.anaconda.com/pkgs/main/osx-64/zstd-1.5.5-hc035e20_2.conda#c033bf68c12f8c71fd916f000f3dc118
+https://repo.anaconda.com/pkgs/main/osx-64/brotli-1.0.9-h6c40b1e_8.conda#10f89677a3898d0113dc354adf643df3
 https://repo.anaconda.com/pkgs/main/osx-64/libtiff-4.5.1-hcec6c5f_0.conda#e127a800ffd9d300ed7d5e1b026944ec
-https://repo.anaconda.com/pkgs/main/osx-64/python-3.12.2-hd58486a_0.conda#21efba1355d32906d082aaff16698961
+https://repo.anaconda.com/pkgs/main/osx-64/python-3.12.4-hcd54a6c_1.conda#753d941593548d5e26518c51b3e3b10d
 https://repo.anaconda.com/pkgs/main/osx-64/coverage-7.2.2-py312h6c40b1e_0.conda#b6e4b9fba325047c07f3c9211ae91d1c
 https://repo.anaconda.com/pkgs/main/noarch/cycler-0.11.0-pyhd3eb1b0_0.conda#f5e365d2cdb66d547eb8c3ab93843aab
 https://repo.anaconda.com/pkgs/main/noarch/execnet-1.9.0-pyhd3eb1b0_0.conda#f895937671af67cebb8af617494b3513
 https://repo.anaconda.com/pkgs/main/noarch/iniconfig-1.1.1-pyhd3eb1b0_0.tar.bz2#e40edff2c5708f342cef43c7f280c507
-https://repo.anaconda.com/pkgs/main/osx-64/joblib-1.2.0-py312hecd8cb5_0.conda#aeeb33f85c1e6776700b67a4762d2e6d
+https://repo.anaconda.com/pkgs/main/osx-64/joblib-1.4.2-py312hecd8cb5_0.conda#8ab03dfa447b4e0bfa0bd3d25930f3b6
 https://repo.anaconda.com/pkgs/main/osx-64/kiwisolver-1.4.4-py312hcec6c5f_0.conda#2ba6561ddd1d05936fe74f5d118ce7dd
 https://repo.anaconda.com/pkgs/main/osx-64/lcms2-2.12-hf1fd2bf_0.conda#697aba7a3308226df7a93ccfeae16ffa
 https://repo.anaconda.com/pkgs/main/osx-64/mkl-service-2.4.0-py312h6c40b1e_1.conda#b1ef860be9043b35c5e8d9388b858514
-https://repo.anaconda.com/pkgs/main/noarch/munkres-1.1.4-py_0.conda#148362ba07f92abab76999a680c80084
 https://repo.anaconda.com/pkgs/main/osx-64/ninja-1.10.2-hecd8cb5_5.conda#a0043b325fb08db82477ae433668e684
-https://repo.anaconda.com/pkgs/main/osx-64/openjpeg-2.4.0-h66ea3da_0.conda#882833bd7befc5e60e6fba9c518c1b79
-https://repo.anaconda.com/pkgs/main/osx-64/packaging-23.2-py312hecd8cb5_0.conda#2b4e331c8f6df5d95a5dd3af37a34d89
+https://repo.anaconda.com/pkgs/main/osx-64/openjpeg-2.4.0-h7231236_1.conda#90f2c6bc7fe1384a4c1ba069a101ad9e
+https://repo.anaconda.com/pkgs/main/osx-64/packaging-24.1-py312hecd8cb5_0.conda#6130dafc4d26d55e93ceab460d2a72b5
 https://repo.anaconda.com/pkgs/main/osx-64/pluggy-1.0.0-py312hecd8cb5_1.conda#647fada22f1697691fdee90b52c99bcb
 https://repo.anaconda.com/pkgs/main/osx-64/pyparsing-3.0.9-py312hecd8cb5_0.conda#d85cf2b81c6d9326a57a6418e14db258
 https://repo.anaconda.com/pkgs/main/noarch/python-tzdata-2023.3-pyhd3eb1b0_0.conda#479c037de0186d114b9911158427624e
-https://repo.anaconda.com/pkgs/main/osx-64/pytz-2023.3.post1-py312hecd8cb5_0.conda#2636382c9a424f69cbc36b1c5dc1f2fc
-https://repo.anaconda.com/pkgs/main/osx-64/setuptools-68.2.2-py312hecd8cb5_0.conda#64235f0c451427d86808c70c1c31cb8b
+https://repo.anaconda.com/pkgs/main/osx-64/pytz-2024.1-py312hecd8cb5_0.conda#2b28ec0e0d07f5c0c701f75200b1e8b6
+https://repo.anaconda.com/pkgs/main/osx-64/setuptools-69.5.1-py312hecd8cb5_0.conda#5c7c7ef1e0762e3ca1f543d28310946f
 https://repo.anaconda.com/pkgs/main/noarch/six-1.16.0-pyhd3eb1b0_1.conda#34586824d411d36af2fa40e799c172d0
-https://repo.anaconda.com/pkgs/main/noarch/threadpoolctl-2.2.0-pyh0d69192_0.conda#bbfdbae4934150b902f97daaf287efe2
 https://repo.anaconda.com/pkgs/main/noarch/toml-0.10.2-pyhd3eb1b0_0.conda#cda05f5f6d8509529d1a2743288d197a
-https://repo.anaconda.com/pkgs/main/osx-64/tornado-6.3.3-py312h6c40b1e_0.conda#49173b5a36c9134865221f29d4a73fb6
-https://repo.anaconda.com/pkgs/main/osx-64/wheel-0.41.2-py312hecd8cb5_0.conda#e7aea266d81142e2bb0bbc2280e64526
-https://repo.anaconda.com/pkgs/main/noarch/fonttools-4.25.0-pyhd3eb1b0_0.conda#bb9c5b5a6d892fca5efe4bf0203b6a48
-https://repo.anaconda.com/pkgs/main/osx-64/meson-1.3.1-py312hecd8cb5_0.conda#43963a2b38becce4caa95434b8c96837
+https://repo.anaconda.com/pkgs/main/osx-64/tornado-6.4.1-py312h46256e1_0.conda#ff2efd781e1b1af38284aeda9d676d42
+https://repo.anaconda.com/pkgs/main/osx-64/unicodedata2-15.1.0-py312h6c40b1e_0.conda#65bd2cb787fc99662d9bb6e6520c5826
+https://repo.anaconda.com/pkgs/main/osx-64/wheel-0.43.0-py312hecd8cb5_0.conda#c0bdd5748b170523232e8ad1d667136c
+https://repo.anaconda.com/pkgs/main/osx-64/fonttools-4.51.0-py312h6c40b1e_0.conda#8f55fa86b73e8a7f4403503f9b7a9959
 https://repo.anaconda.com/pkgs/main/osx-64/numpy-base-1.26.4-py312h6f81483_0.conda#87f73efbf26ab2e2ea7c32481a71bd47
-https://repo.anaconda.com/pkgs/main/osx-64/pillow-10.2.0-py312h6c40b1e_0.conda#5a44bd28cf26fff2d6219e76a86db126
-https://repo.anaconda.com/pkgs/main/osx-64/pip-23.3.1-py312hecd8cb5_0.conda#efc3db40cac09f74bb480d28d3a0b260
-https://repo.anaconda.com/pkgs/main/osx-64/pyproject-metadata-0.7.1-py312hecd8cb5_0.conda#e91ce37477d24dcdf7e0a8b93c5e72fd
-https://repo.anaconda.com/pkgs/main/osx-64/pytest-7.4.0-py312hecd8cb5_0.conda#b816a2439ba9b87524aec74d58e55b0a
-https://repo.anaconda.com/pkgs/main/noarch/python-dateutil-2.8.2-pyhd3eb1b0_0.conda#211ee00320b08a1ac9fea6677649f6c9
-https://repo.anaconda.com/pkgs/main/osx-64/meson-python-0.15.0-py312h6c40b1e_0.conda#688ab56b9d8e5a2e3f018ca3ce34e061
+https://repo.anaconda.com/pkgs/main/osx-64/pillow-10.3.0-py312h6c40b1e_0.conda#fe883fa4247d35fe6de49f713529ca02
+https://repo.anaconda.com/pkgs/main/osx-64/pip-24.0-py312hecd8cb5_0.conda#7a8e0b1d3742ddf1c8aa97fbaa158039
+https://repo.anaconda.com/pkgs/main/osx-64/pytest-7.4.4-py312hecd8cb5_0.conda#d4dda983900b045cd27ae836cad670de
+https://repo.anaconda.com/pkgs/main/osx-64/python-dateutil-2.9.0post0-py312hecd8cb5_2.conda#1047dde28f78127dd9f6121e882926dd
 https://repo.anaconda.com/pkgs/main/osx-64/pytest-cov-4.1.0-py312hecd8cb5_1.conda#a33a24eb20359f464938e75b2f57e23a
 https://repo.anaconda.com/pkgs/main/osx-64/pytest-xdist-3.5.0-py312hecd8cb5_0.conda#d1ecfb3691cceecb1f16bcfdf0b67bb5
 https://repo.anaconda.com/pkgs/main/osx-64/bottleneck-1.3.7-py312h32608ca_0.conda#f96a01eba5ea542cf9c7cc8d77447627
 https://repo.anaconda.com/pkgs/main/osx-64/contourpy-1.2.0-py312ha357a0b_0.conda#57d384ad07152375b40a6293f79e3f0c
-https://repo.anaconda.com/pkgs/main/osx-64/matplotlib-3.8.0-py312hecd8cb5_0.conda#64ffa3462aace0fc2d5fa5bff15f63f6
-https://repo.anaconda.com/pkgs/main/osx-64/matplotlib-base-3.8.0-py312h7f12edd_0.conda#bda389e5a1ff69f763911cf90102893b
+https://repo.anaconda.com/pkgs/main/osx-64/matplotlib-3.8.4-py312hecd8cb5_0.conda#6886c230c2ec2f47621b5cca4c7d493a
+https://repo.anaconda.com/pkgs/main/osx-64/matplotlib-base-3.8.4-py312h7f12edd_0.conda#a4eee14a4dcaa89b306ca33d2d479fa4
 https://repo.anaconda.com/pkgs/main/osx-64/mkl_fft-1.3.8-py312h6c40b1e_0.conda#d59d01b940493f2b6a84aac922fd0c76
 https://repo.anaconda.com/pkgs/main/osx-64/mkl_random-1.2.4-py312ha357a0b_0.conda#c1ea9c8eee79a5af3399f3c31be0e9c6
 https://repo.anaconda.com/pkgs/main/osx-64/numpy-1.26.4-py312hac873b0_0.conda#3150bac1e382156f82a153229e1ebd06
 https://repo.anaconda.com/pkgs/main/osx-64/numexpr-2.8.7-py312hac873b0_0.conda#6303ba071636ef57fddf69eb6f440ec1
 https://repo.anaconda.com/pkgs/main/osx-64/scipy-1.11.4-py312h81688c2_0.conda#7d57b4c21a9261f97fa511e0940c5d93
-https://repo.anaconda.com/pkgs/main/osx-64/pandas-2.2.1-py312he282a81_0.conda#021b70a1e40efb75b89eb8ebdb347132
+https://repo.anaconda.com/pkgs/main/osx-64/pandas-2.2.2-py312h77d3abe_0.conda#463868c40d8ff98bec263f1fd57a8d97
 https://repo.anaconda.com/pkgs/main/osx-64/pyamg-4.2.3-py312h44cbcf4_0.conda#3bdc7be74087b3a5a83c520a74e1e8eb
 # pip cython @ https://files.pythonhosted.org/packages/d5/6d/06c08d75adb98cdf72af18801e193d22580cc86ca553610f430f18ea26b3/Cython-3.0.10-cp312-cp312-macosx_10_9_x86_64.whl#sha256=8f2864ab5fcd27a346f0b50f901ebeb8f60b25a60a575ccfd982e7f3e9674914
+# pip meson @ https://files.pythonhosted.org/packages/44/b2/d4433391a7c5e94a39b50ca7295a8ceba736e7c72c455752a60122f52453/meson-1.4.1-py3-none-any.whl#sha256=d5acc3abae2dad3c70ddcbd10acac92b78b144d34d43f40f5b8ac31dfd8a826a
+# pip threadpoolctl @ https://files.pythonhosted.org/packages/4b/2c/ffbf7a134b9ab11a67b0cf0726453cedd9c5043a4fe7a35d1cefa9a1bcfb/threadpoolctl-3.5.0-py3-none-any.whl#sha256=56c1e26c150397e58c4926da8eeee87533b1e32bef131bd4bf6a2f45f3185467
+# pip pyproject-metadata @ https://files.pythonhosted.org/packages/aa/5f/bb5970d3d04173b46c9037109f7f05fc8904ff5be073ee49bb6ff00301bc/pyproject_metadata-0.8.0-py3-none-any.whl#sha256=ad858d448e1d3a1fb408ac5bac9ea7743e7a8bbb472f2693aaa334d2db42f526
+# pip meson-python @ https://files.pythonhosted.org/packages/91/c0/104cb6244c83fe6bc3886f144cc433db0c0c78efac5dc00e409a5a08c87d/meson_python-0.16.0-py3-none-any.whl#sha256=842dc9f5dc29e55fc769ff1b6fe328412fe6c870220fc321060a1d2d395e69e8
diff --git a/build_tools/azure/pylatest_pip_openblas_pandas_environment.yml b/build_tools/azure/pylatest_pip_openblas_pandas_environment.yml
index 0f82886f4acb2..2d9ca394a6ac9 100644
--- a/build_tools/azure/pylatest_pip_openblas_pandas_environment.yml
+++ b/build_tools/azure/pylatest_pip_openblas_pandas_environment.yml
@@ -4,7 +4,7 @@
 channels:
   - defaults
 dependencies:
-  - python=3.9
+  - python=3.11
   - ccache
   - pip
   - pip:
@@ -16,7 +16,7 @@ dependencies:
     - matplotlib
     - pandas
     - pyamg
-    - pytest<8
+    - pytest
     - pytest-xdist
     - pillow
     - ninja
@@ -27,3 +27,5 @@ dependencies:
     - numpydoc
     - lightgbm
     - scikit-image
+    - array-api-compat
+    - array-api-strict
diff --git a/build_tools/azure/pylatest_pip_openblas_pandas_linux-64_conda.lock b/build_tools/azure/pylatest_pip_openblas_pandas_linux-64_conda.lock
index a27e427ff1e88..8145a497caa86 100644
--- a/build_tools/azure/pylatest_pip_openblas_pandas_linux-64_conda.lock
+++ b/build_tools/azure/pylatest_pip_openblas_pandas_linux-64_conda.lock
@@ -1,6 +1,6 @@
 # Generated by conda-lock.
 # platform: linux-64
-# input_hash: ec17ebe1c3fd0875fcc62f7df11f43ebdc905b745921603a574f023e92480fe0
+# input_hash: 11829a15aa51e3a3ad9479d8b5b953c0af47dd8e86d725e58d55cbcfe68c6d5e
 @EXPLICIT
 https://repo.anaconda.com/pkgs/main/linux-64/_libgcc_mutex-0.1-main.conda#c3473ff8bdb3d124ed5ff11ec380d6f9
 https://repo.anaconda.com/pkgs/main/linux-64/ca-certificates-2024.3.11-h06a4308_0.conda#08529eb3504712baabcbda266a19feb7
@@ -10,43 +10,46 @@ https://repo.anaconda.com/pkgs/main/linux-64/libgomp-11.2.0-h1234567_1.conda#b37
 https://repo.anaconda.com/pkgs/main/linux-64/libstdcxx-ng-11.2.0-h1234567_1.conda#57623d10a70e09e1d048c2b2b6f4e2dd
 https://repo.anaconda.com/pkgs/main/linux-64/_openmp_mutex-5.1-1_gnu.conda#71d281e9c2192cb3fa425655a8defb85
 https://repo.anaconda.com/pkgs/main/linux-64/libgcc-ng-11.2.0-h1234567_1.conda#a87728dabf3151fb9cfa990bd2eb0464
-https://repo.anaconda.com/pkgs/main/linux-64/libffi-3.4.4-h6a678d5_0.conda#06e288f9250abef59b9a367d151fc339
+https://repo.anaconda.com/pkgs/main/linux-64/bzip2-1.0.8-h5eee18b_6.conda#f21a3ff51c1b271977f53ce956a69297
+https://repo.anaconda.com/pkgs/main/linux-64/libffi-3.4.4-h6a678d5_1.conda#70646cc713f0c43926cfdcfe9b695fe0
+https://repo.anaconda.com/pkgs/main/linux-64/libuuid-1.41.5-h5eee18b_0.conda#4a6a2354414c9080327274aa514e5299
 https://repo.anaconda.com/pkgs/main/linux-64/ncurses-6.4-h6a678d5_0.conda#5558eec6e2191741a92f832ea826251c
-https://repo.anaconda.com/pkgs/main/linux-64/openssl-3.0.13-h7f8727e_0.conda#c73d46a4d666da0ae3dcd3fd8f805122
-https://repo.anaconda.com/pkgs/main/linux-64/xz-5.4.6-h5eee18b_0.conda#81a9916f581d4da15a3839216a487c66
-https://repo.anaconda.com/pkgs/main/linux-64/zlib-1.2.13-h5eee18b_0.conda#333e31fbfbb5057c92fa845ad6adef93
+https://repo.anaconda.com/pkgs/main/linux-64/openssl-3.0.14-h5eee18b_0.conda#37b6dad6aa49000a4230a9f0cad172f6
+https://repo.anaconda.com/pkgs/main/linux-64/xz-5.4.6-h5eee18b_1.conda#1562802f843297ee776a50b9329597ed
+https://repo.anaconda.com/pkgs/main/linux-64/zlib-1.2.13-h5eee18b_1.conda#92e42d8310108b0a440fb2e60b2b2a25
 https://repo.anaconda.com/pkgs/main/linux-64/ccache-3.7.9-hfe4627d_0.conda#bef6fc681c273bb7bd0c67d1a591365e
 https://repo.anaconda.com/pkgs/main/linux-64/readline-8.2-h5eee18b_0.conda#be42180685cce6e6b0329201d9f48efb
-https://repo.anaconda.com/pkgs/main/linux-64/tk-8.6.12-h1ccaba5_0.conda#fa10ff4aa631fa4aa090a6234d7770b9
-https://repo.anaconda.com/pkgs/main/linux-64/sqlite-3.41.2-h5eee18b_0.conda#c7086c9ceb6cfe1c4c729a774a2d88a5
-https://repo.anaconda.com/pkgs/main/linux-64/python-3.9.19-h955ad1f_0.conda#33cb019c40e3409df392c99e3c34f352
-https://repo.anaconda.com/pkgs/main/linux-64/setuptools-68.2.2-py39h06a4308_0.conda#5b42cae5548732ae5c167bb1066085de
-https://repo.anaconda.com/pkgs/main/linux-64/wheel-0.41.2-py39h06a4308_0.conda#ec1b8213c3585defaa6042ed2f95861d
-https://repo.anaconda.com/pkgs/main/linux-64/pip-23.3.1-py39h06a4308_0.conda#685007e3dae59d211620f19926577bd6
+https://repo.anaconda.com/pkgs/main/linux-64/tk-8.6.14-h39e8969_0.conda#78dbc5e3c69143ebc037fc5d5b22e597
+https://repo.anaconda.com/pkgs/main/linux-64/sqlite-3.45.3-h5eee18b_0.conda#acf93d6aceb74d6110e20b44cc45939e
+https://repo.anaconda.com/pkgs/main/linux-64/python-3.11.9-h955ad1f_0.conda#5668a8845dd35bbbc9663c8f217a2ab8
+https://repo.anaconda.com/pkgs/main/linux-64/setuptools-69.5.1-py311h06a4308_0.conda#0989470c81841dfcb22c7bbb40f543c5
+https://repo.anaconda.com/pkgs/main/linux-64/wheel-0.43.0-py311h06a4308_0.conda#ec915b5ff89bdbcea7ef943d9e296967
+https://repo.anaconda.com/pkgs/main/linux-64/pip-24.0-py311h06a4308_0.conda#84aef4db159f0daf63751d87d7d6ca56
 # pip alabaster @ https://files.pythonhosted.org/packages/32/34/d4e1c02d3bee589efb5dfa17f88ea08bdb3e3eac12bc475462aec52ed223/alabaster-0.7.16-py3-none-any.whl#sha256=b46733c07dce03ae4e150330b975c75737fa60f0a7c591b6c8bf4928a28e2c92
-# pip babel @ https://files.pythonhosted.org/packages/0d/35/4196b21041e29a42dc4f05866d0c94fa26c9da88ce12c38c2265e42c82fb/Babel-2.14.0-py3-none-any.whl#sha256=efb1a25b7118e67ce3a259bed20545c29cb68be8ad2c784c83689981b7a57287
-# pip certifi @ https://files.pythonhosted.org/packages/ba/06/a07f096c664aeb9f01624f858c3add0a4e913d6c96257acb4fce61e7de14/certifi-2024.2.2-py3-none-any.whl#sha256=dc383c07b76109f368f6106eee2b593b04a011ea4d55f652c6ca24a754d1cdd1
-# pip charset-normalizer @ https://files.pythonhosted.org/packages/98/69/5d8751b4b670d623aa7a47bef061d69c279e9f922f6705147983aa76c3ce/charset_normalizer-3.3.2-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=b261ccdec7821281dade748d088bb6e9b69e6d15b30652b74cbbac25e280b796
+# pip array-api-compat @ https://files.pythonhosted.org/packages/05/ae/2f11031bb9f819f6efaaa66b720b37928fbb0087161fcbae3465ae374a18/array_api_compat-1.7.1-py3-none-any.whl#sha256=6974f51775972f39edbca39e08f1c2e43c51401c093a0fea5ac7159875095d8a
+# pip babel @ https://files.pythonhosted.org/packages/27/45/377f7e32a5c93d94cd56542349b34efab5ca3f9e2fd5a68c5e93169aa32d/Babel-2.15.0-py3-none-any.whl#sha256=08706bdad8d0a3413266ab61bd6c34d0c28d6e1e7badf40a2cebe67644e2e1fb
+# pip certifi @ https://files.pythonhosted.org/packages/1c/d5/c84e1a17bf61d4df64ca866a1c9a913874b4e9bdc131ec689a0ad013fb36/certifi-2024.7.4-py3-none-any.whl#sha256=c198e21b1289c2ab85ee4e67bb4b4ef3ead0892059901a8d5b622f24a1101e90
+# pip charset-normalizer @ https://files.pythonhosted.org/packages/40/26/f35951c45070edc957ba40a5b1db3cf60a9dbb1b350c2d5bef03e01e61de/charset_normalizer-3.3.2-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=753f10e867343b4511128c6ed8c82f7bec3bd026875576dfd88483c5c73b2fd8
+# pip coverage @ https://files.pythonhosted.org/packages/1e/62/e33595d35c9fa7cbcca5df2c3745b595532ec94b68c49ca2877629c4aca1/coverage-7.5.4-cp311-cp311-manylinux_2_5_x86_64.manylinux1_x86_64.manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=ed550e7442f278af76d9d65af48069f1fb84c9f745ae249c1a183c1e9d1b025c
 # pip cycler @ https://files.pythonhosted.org/packages/e7/05/c19819d5e3d95294a6f5947fb9b9629efb316b96de511b418c53d245aae6/cycler-0.12.1-py3-none-any.whl#sha256=85cef7cff222d8644161529808465972e51340599459b8ac3ccbac5a854e0d30
-# pip cython @ https://files.pythonhosted.org/packages/a7/f5/3dde4d96076888ceaa981827b098274c2b45ddd4b20d75a8cfaa92b91eec/Cython-3.0.10-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=651a15a8534ebfb9b58cb0b87c269c70984b6f9c88bfe65e4f635f0e3f07dfcd
-# pip docutils @ https://files.pythonhosted.org/packages/26/87/f238c0670b94533ac0353a4e2a1a771a0cc73277b88bff23d3ae35a256c1/docutils-0.20.1-py3-none-any.whl#sha256=96f387a2c5562db4476f09f13bbab2192e764cac08ebbf3a34a95d9b1e4a59d6
-# pip exceptiongroup @ https://files.pythonhosted.org/packages/b8/9a/5028fd52db10e600f1c4674441b968cf2ea4959085bfb5b99fb1250e5f68/exceptiongroup-1.2.0-py3-none-any.whl#sha256=4bfd3996ac73b41e9b9628b04e079f193850720ea5945fc96a08633c66912f14
+# pip cython @ https://files.pythonhosted.org/packages/45/82/077c13035d6f45d8b8b74d67e9f73f2bfc54ef8d1f79572790f6f7d2b4f5/Cython-3.0.10-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=38d40fa1324ac47c04483d151f5e092406a147eac88a18aec789cf01c089c3f2
+# pip docutils @ https://files.pythonhosted.org/packages/8f/d7/9322c609343d929e75e7e5e6255e614fcc67572cfd083959cdef3b7aad79/docutils-0.21.2-py3-none-any.whl#sha256=dafca5b9e384f0e419294eb4d2ff9fa826435bf15f15b7bd45723e8ad76811b2
 # pip execnet @ https://files.pythonhosted.org/packages/43/09/2aea36ff60d16dd8879bdb2f5b3ee0ba8d08cbbdcdfe870e695ce3784385/execnet-2.1.1-py3-none-any.whl#sha256=26dee51f1b80cebd6d0ca8e74dd8745419761d3bef34163928cbebbdc4749fdc
-# pip fonttools @ https://files.pythonhosted.org/packages/8b/c6/636f008104908a93b80419f756be755bb91df4b8a0c88d5158bb52c82c3a/fonttools-4.51.0-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=0d145976194a5242fdd22df18a1b451481a88071feadf251221af110ca8f00ce
-# pip idna @ https://files.pythonhosted.org/packages/c2/e7/a82b05cf63a603df6e68d59ae6a68bf5064484a0718ea5033660af4b54a9/idna-3.6-py3-none-any.whl#sha256=c05567e9c24a6b9faaa835c4821bad0590fbb9d5779e7caa6e1cc4978e7eb24f
+# pip fonttools @ https://files.pythonhosted.org/packages/a4/22/0a0ad59d9367997fd74a00ad2e88d10559122e09f105e94d34c155aecc0a/fonttools-4.53.1-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=bee32ea8765e859670c4447b0817514ca79054463b6b79784b08a8df3a4d78e3
+# pip idna @ https://files.pythonhosted.org/packages/e5/3e/741d8c82801c347547f8a2a06aa57dbb1992be9e948df2ea0eda2c8b79e8/idna-3.7-py3-none-any.whl#sha256=82fee1fc78add43492d3a1898bfa6d8a904cc97d8427f683ed8e798d07761aa0
 # pip imagesize @ https://files.pythonhosted.org/packages/ff/62/85c4c919272577931d407be5ba5d71c20f0b616d31a0befe0ae45bb79abd/imagesize-1.4.1-py2.py3-none-any.whl#sha256=0d8d18d08f840c19d0ee7ca1fd82490fdc3729b7ac93f49870406ddde8ef8d8b
 # pip iniconfig @ https://files.pythonhosted.org/packages/ef/a6/62565a6e1cf69e10f5727360368e451d4b7f58beeac6173dc9db836a5b46/iniconfig-2.0.0-py3-none-any.whl#sha256=b6a85871a79d2e3b22d2d1b94ac2824226a63c6b741c88f7ae975f18b6778374
-# pip joblib @ https://files.pythonhosted.org/packages/10/40/d551139c85db202f1f384ba8bcf96aca2f329440a844f924c8a0040b6d02/joblib-1.3.2-py3-none-any.whl#sha256=ef4331c65f239985f3f2220ecc87db222f08fd22097a3dd5698f693875f8cbb9
-# pip kiwisolver @ https://files.pythonhosted.org/packages/c0/a8/841594f11d0b88d8aeb26991bc4dac38baa909dc58d0c4262a4f7893bcbf/kiwisolver-1.4.5-cp39-cp39-manylinux_2_12_x86_64.manylinux2010_x86_64.whl#sha256=6c3bd3cde54cafb87d74d8db50b909705c62b17c2099b8f2e25b461882e544ff
-# pip markupsafe @ https://files.pythonhosted.org/packages/5f/5a/360da85076688755ea0cceb92472923086993e86b5613bbae9fbc14136b0/MarkupSafe-2.1.5-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=17b950fccb810b3293638215058e432159d2b71005c74371d784862b7e4683f3
-# pip meson @ https://files.pythonhosted.org/packages/33/75/b1a37fa7b2dbca8c0dbb04d5cdd7e2720c8ef6febe41b4a74866350e041c/meson-1.4.0-py3-none-any.whl#sha256=476a458d51fcfa322a6bdc64da5138997c542d08e6b2e49b9fa68c46fd7c4475
-# pip networkx @ https://files.pythonhosted.org/packages/d5/f0/8fbc882ca80cf077f1b246c0e3c3465f7f415439bdea6b899f6b19f61f70/networkx-3.2.1-py3-none-any.whl#sha256=f18c69adc97877c42332c170849c96cefa91881c99a7cb3e95b7c659ebdc1ec2
+# pip joblib @ https://files.pythonhosted.org/packages/91/29/df4b9b42f2be0b623cbd5e2140cafcaa2bef0759a00b7b70104dcfe2fb51/joblib-1.4.2-py3-none-any.whl#sha256=06d478d5674cbc267e7496a410ee875abd68e4340feff4490bcb7afb88060ae6
+# pip kiwisolver @ https://files.pythonhosted.org/packages/17/ba/17a706b232308e65f57deeccae503c268292e6a091313f6ce833a23093ea/kiwisolver-1.4.5-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=040c1aebeda72197ef477a906782b5ab0d387642e93bda547336b8957c61022e
+# pip markupsafe @ https://files.pythonhosted.org/packages/97/18/c30da5e7a0e7f4603abfc6780574131221d9148f323752c2755d48abad30/MarkupSafe-2.1.5-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=b91c037585eba9095565a3556f611e3cbfaa42ca1e865f7b8015fe5c7336d5a5
+# pip meson @ https://files.pythonhosted.org/packages/44/b2/d4433391a7c5e94a39b50ca7295a8ceba736e7c72c455752a60122f52453/meson-1.4.1-py3-none-any.whl#sha256=d5acc3abae2dad3c70ddcbd10acac92b78b144d34d43f40f5b8ac31dfd8a826a
+# pip networkx @ https://files.pythonhosted.org/packages/38/e9/5f72929373e1a0e8d142a130f3f97e6ff920070f87f91c4e13e40e0fba5a/networkx-3.3-py3-none-any.whl#sha256=28575580c6ebdaf4505b22c6256a2b9de86b316dc63ba9e93abde3d78dfdbcf2
 # pip ninja @ https://files.pythonhosted.org/packages/6d/92/8d7aebd4430ab5ff65df2bfee6d5745f95c004284db2d8ca76dcbfd9de47/ninja-1.11.1.1-py2.py3-none-manylinux1_x86_64.manylinux_2_5_x86_64.whl#sha256=84502ec98f02a037a169c4b0d5d86075eaf6afc55e1879003d6cab51ced2ea4b
-# pip numpy @ https://files.pythonhosted.org/packages/54/30/c2a907b9443cf42b90c17ad10c1e8fa801975f01cb9764f3f8eb8aea638b/numpy-1.26.4-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=f870204a840a60da0b12273ef34f7051e98c3b5961b61b0c2c1be6dfd64fbcd3
-# pip packaging @ https://files.pythonhosted.org/packages/49/df/1fceb2f8900f8639e278b056416d49134fb8d84c5942ffaa01ad34782422/packaging-24.0-py3-none-any.whl#sha256=2ddfb553fdf02fb784c234c7ba6ccc288296ceabec964ad2eae3777778130bc5
-# pip pillow @ https://files.pythonhosted.org/packages/f5/6d/52e82352670e850f468de9e6bccced4202a09f58e7ea5ecdbf08283d85cb/pillow-10.3.0-cp39-cp39-manylinux_2_28_x86_64.whl#sha256=1dfc94946bc60ea375cc39cff0b8da6c7e5f8fcdc1d946beb8da5c216156ddd8
-# pip pluggy @ https://files.pythonhosted.org/packages/a5/5b/0cc789b59e8cc1bf288b38111d002d8c5917123194d45b29dcdac64723cc/pluggy-1.4.0-py3-none-any.whl#sha256=7db9f7b503d67d1c5b95f59773ebb58a8c1c288129a88665838012cfb07b8981
-# pip pygments @ https://files.pythonhosted.org/packages/97/9c/372fef8377a6e340b1704768d20daaded98bf13282b5327beb2e2fe2c7ef/pygments-2.17.2-py3-none-any.whl#sha256=b27c2826c47d0f3219f29554824c30c5e8945175d888647acd804ddd04af846c
+# pip numpy @ https://files.pythonhosted.org/packages/d1/27/2a7bd6855dc717aeec5f553073a3c426b9c816126555f8e616392eab856b/numpy-2.0.0-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=a7039a136017eaa92c1848152827e1424701532ca8e8967fe480fe1569dae581
+# pip packaging @ https://files.pythonhosted.org/packages/08/aa/cc0199a5f0ad350994d660967a8efb233fe0416e4639146c089643407ce6/packaging-24.1-py3-none-any.whl#sha256=5b8f2217dbdbd2f7f384c41c628544e6d52f2d0f53c6d0c3ea61aa5d1d7ff124
+# pip pillow @ https://files.pythonhosted.org/packages/ba/e5/8c68ff608a4203085158cff5cc2a3c534ec384536d9438c405ed6370d080/pillow-10.4.0-cp311-cp311-manylinux_2_28_x86_64.whl#sha256=76a911dfe51a36041f2e756b00f96ed84677cdeb75d25c767f296c1c1eda1319
+# pip pluggy @ https://files.pythonhosted.org/packages/88/5f/e351af9a41f866ac3f1fac4ca0613908d9a41741cfcf2228f4ad853b697d/pluggy-1.5.0-py3-none-any.whl#sha256=44e1ad92c8ca002de6377e165f3e0f1be63266ab4d554740532335b9d75ea669
+# pip pygments @ https://files.pythonhosted.org/packages/f7/3f/01c8b82017c199075f8f788d0d906b9ffbbc5a47dc9918a945e13d5a2bda/pygments-2.18.0-py3-none-any.whl#sha256=b8e6aca0523f3ab76fee51799c488e38782ac06eafcf95e7ba832985c8e7b13a
 # pip pyparsing @ https://files.pythonhosted.org/packages/9d/ea/6d76df31432a0e6fdf81681a895f009a4bb47b3c39036db3e1b528191d52/pyparsing-3.1.2-py3-none-any.whl#sha256=f9db75911801ed778fe61bb643079ff86601aca99fcae6345aa67292038fb742
 # pip pytz @ https://files.pythonhosted.org/packages/9c/3d/a121f284241f08268b21359bd425f7d4825cffc5ac5cd0e1b3d82ffd2b10/pytz-2024.1-py2.py3-none-any.whl#sha256=328171f4e3623139da4983451950b28e95ac706e13f3f2630a879749e7a8b319
 # pip six @ https://files.pythonhosted.org/packages/d9/5a/e7c31adbe875f2abbb91bd84cf2dc52d792b5a01506781dbcf25c91daf11/six-1.16.0-py2.py3-none-any.whl#sha256=8abb2f1d86890a2dfb989f9a77cfcfd3e47c2a354b01111771326f8aa26e0254
@@ -58,31 +61,27 @@ https://repo.anaconda.com/pkgs/main/linux-64/pip-23.3.1-py39h06a4308_0.conda#685
 # pip sphinxcontrib-qthelp @ https://files.pythonhosted.org/packages/80/b3/1beac14a88654d2e5120d0143b49be5ad450b86eb1963523d8dbdcc51eb2/sphinxcontrib_qthelp-1.0.7-py3-none-any.whl#sha256=e2ae3b5c492d58fcbd73281fbd27e34b8393ec34a073c792642cd8e529288182
 # pip sphinxcontrib-serializinghtml @ https://files.pythonhosted.org/packages/38/24/228bb903ea87b9e08ab33470e6102402a644127108c7117ac9c00d849f82/sphinxcontrib_serializinghtml-1.1.10-py3-none-any.whl#sha256=326369b8df80a7d2d8d7f99aa5ac577f51ea51556ed974e7716cfd4fca3f6cb7
 # pip tabulate @ https://files.pythonhosted.org/packages/40/44/4a5f08c96eb108af5cb50b41f76142f0afa346dfa99d5296fe7202a11854/tabulate-0.9.0-py3-none-any.whl#sha256=024ca478df22e9340661486f85298cff5f6dcdba14f3813e8830015b9ed1948f
-# pip threadpoolctl @ https://files.pythonhosted.org/packages/1e/84/ccd9b08653022b7785b6e3ee070ffb2825841e0dc119be22f0840b2b35cb/threadpoolctl-3.4.0-py3-none-any.whl#sha256=8f4c689a65b23e5ed825c8436a92b818aac005e0f3715f6a1664d7c7ee29d262
-# pip tomli @ https://files.pythonhosted.org/packages/97/75/10a9ebee3fd790d20926a90a2547f0bf78f371b2f13aa822c759680ca7b9/tomli-2.0.1-py3-none-any.whl#sha256=939de3e7a6161af0c887ef91b7d41a53e7c5a1ca976325f429cb46ea9bc30ecc
+# pip threadpoolctl @ https://files.pythonhosted.org/packages/4b/2c/ffbf7a134b9ab11a67b0cf0726453cedd9c5043a4fe7a35d1cefa9a1bcfb/threadpoolctl-3.5.0-py3-none-any.whl#sha256=56c1e26c150397e58c4926da8eeee87533b1e32bef131bd4bf6a2f45f3185467
 # pip tzdata @ https://files.pythonhosted.org/packages/65/58/f9c9e6be752e9fcb8b6a0ee9fb87e6e7a1f6bcab2cdc73f02bb7ba91ada0/tzdata-2024.1-py2.py3-none-any.whl#sha256=9068bc196136463f5245e51efda838afa15aaeca9903f49050dfa2679db4d252
-# pip urllib3 @ https://files.pythonhosted.org/packages/a2/73/a68704750a7679d0b6d3ad7aa8d4da8e14e151ae82e6fee774e6e0d05ec8/urllib3-2.2.1-py3-none-any.whl#sha256=450b20ec296a467077128bff42b73080516e71b56ff59a60a02bef2232c4fa9d
-# pip zipp @ https://files.pythonhosted.org/packages/c2/0a/ba9d0ee9536d3ef73a3448e931776e658b36f128d344e175bc32b092a8bf/zipp-3.18.1-py3-none-any.whl#sha256=206f5a15f2af3dbaee80769fb7dc6f249695e940acca08dfb2a4769fe61e538b
-# pip contourpy @ https://files.pythonhosted.org/packages/31/a2/2f12e3a6e45935ff694654b710961b03310b0e1ec997ee9f416d3c873f87/contourpy-1.2.1-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=e1d59258c3c67c865435d8fbeb35f8c59b8bef3d6f46c1f29f6123556af28445
-# pip coverage @ https://files.pythonhosted.org/packages/5b/ec/9bd500128995e9eec2ab50361ce8b853bab2b4839316ddcfd6a34f5bbfed/coverage-7.4.4-cp39-cp39-manylinux_2_5_x86_64.manylinux1_x86_64.manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=ff7687ca3d7028d8a5f0ebae95a6e4827c5616b31a4ee1192bdfde697db110d4
-# pip imageio @ https://files.pythonhosted.org/packages/02/25/66533a8390e3763cf8254dee143dbf8a830391ea60d2762512ba7f9ddfbe/imageio-2.34.0-py3-none-any.whl#sha256=08082bf47ccb54843d9c73fe9fc8f3a88c72452ab676b58aca74f36167e8ccba
-# pip importlib-metadata @ https://files.pythonhosted.org/packages/2d/0a/679461c511447ffaf176567d5c496d1de27cbe34a87df6677d7171b2fbd4/importlib_metadata-7.1.0-py3-none-any.whl#sha256=30962b96c0c223483ed6cc7280e7f0199feb01a0e40cfae4d4450fc6fab1f570
-# pip importlib-resources @ https://files.pythonhosted.org/packages/75/06/4df55e1b7b112d183f65db9503bff189e97179b256e1ea450a3c365241e0/importlib_resources-6.4.0-py3-none-any.whl#sha256=50d10f043df931902d4194ea07ec57960f66a80449ff867bfe782b4c486ba78c
-# pip jinja2 @ https://files.pythonhosted.org/packages/30/6d/6de6be2d02603ab56e72997708809e8a5b0fbfee080735109b40a3564843/Jinja2-3.1.3-py3-none-any.whl#sha256=7d6d50dd97d52cbc355597bd845fabfbac3f551e1f99619e39a35ce8c370b5fa
+# pip urllib3 @ https://files.pythonhosted.org/packages/ca/1c/89ffc63a9605b583d5df2be791a27bc1a42b7c32bab68d3c8f2f73a98cd4/urllib3-2.2.2-py3-none-any.whl#sha256=a448b2f64d686155468037e1ace9f2d2199776e17f0a46610480d311f73e3472
+# pip array-api-strict @ https://files.pythonhosted.org/packages/08/06/aba69bce257fd1cda0d1db616c12728af0f46878a5cc1923fcbb94201947/array_api_strict-2.0.1-py3-none-any.whl#sha256=f74cbf0d0c182fcb45c5ee7f28f9c7b77e6281610dfbbdd63be60b1a5a7872b3
+# pip contourpy @ https://files.pythonhosted.org/packages/ee/c0/9bd123d676eb61750e116a2cd915b06483fc406143cfc36c7f263f0f5368/contourpy-1.2.1-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=d4492d82b3bc7fbb7e3610747b159869468079fe149ec5c4d771fa1f614a14df
+# pip imageio @ https://files.pythonhosted.org/packages/3d/84/f1647217231f6cc46883e5d26e870cc3e1520d458ecd52d6df750810d53c/imageio-2.34.2-py3-none-any.whl#sha256=a0bb27ec9d5bab36a9f4835e51b21d2cb099e1f78451441f94687ff3404b79f8
+# pip jinja2 @ https://files.pythonhosted.org/packages/31/80/3a54838c3fb461f6fec263ebf3a3a41771bd05190238de3486aae8540c36/jinja2-3.1.4-py3-none-any.whl#sha256=bc5dd2abb727a5319567b7a813e6a2e7318c39f4f487cfe6c89c6f9c7d25197d
 # pip lazy-loader @ https://files.pythonhosted.org/packages/83/60/d497a310bde3f01cb805196ac61b7ad6dc5dcf8dce66634dc34364b20b4f/lazy_loader-0.4-py3-none-any.whl#sha256=342aa8e14d543a154047afb4ba8ef17f5563baad3fc610d7b15b213b0f119efc
-# pip pyproject-metadata @ https://files.pythonhosted.org/packages/c4/cb/4678dfd70cd2f2d8969e571cdc1bb1e9293c698f8d1cf428fadcf48d6e9f/pyproject_metadata-0.7.1-py3-none-any.whl#sha256=28691fbb36266a819ec56c9fa1ecaf36f879d6944dfde5411e87fc4ff793aa60
-# pip pytest @ https://files.pythonhosted.org/packages/51/ff/f6e8b8f39e08547faece4bd80f89d5a8de68a38b2d179cc1c4490ffa3286/pytest-7.4.4-py3-none-any.whl#sha256=b090cdf5ed60bf4c45261be03239c2c1c22df034fbffe691abe93cd80cea01d8
+# pip pyproject-metadata @ https://files.pythonhosted.org/packages/aa/5f/bb5970d3d04173b46c9037109f7f05fc8904ff5be073ee49bb6ff00301bc/pyproject_metadata-0.8.0-py3-none-any.whl#sha256=ad858d448e1d3a1fb408ac5bac9ea7743e7a8bbb472f2693aaa334d2db42f526
+# pip pytest @ https://files.pythonhosted.org/packages/4e/e7/81ebdd666d3bff6670d27349b5053605d83d55548e6bd5711f3b0ae7dd23/pytest-8.2.2-py3-none-any.whl#sha256=c434598117762e2bd304e526244f67bf66bbd7b5d6cf22138be51ff661980343
 # pip python-dateutil @ https://files.pythonhosted.org/packages/ec/57/56b9bcc3c9c6a792fcbaf139543cee77261f3651ca9da0c93f5c1221264b/python_dateutil-2.9.0.post0-py2.py3-none-any.whl#sha256=a8b2bc7bffae282281c8140a97d3aa9c14da0b136dfe83f850eea9a5f7470427
-# pip requests @ https://files.pythonhosted.org/packages/70/8e/0e2d847013cb52cd35b38c009bb167a1a26b2ce6cd6965bf26b47bc0bf44/requests-2.31.0-py3-none-any.whl#sha256=58cd2187c01e70e6e26505bca751777aa9f2ee0b7f4300988b709f44e013003f
-# pip scipy @ https://files.pythonhosted.org/packages/c6/ba/a778e6c0020d728c119b0379805a357135fe8c9bc87fdb7e0750ca11319f/scipy-1.13.0-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=28e286bf9ac422d6beb559bc61312c348ca9b0f0dae0d7c5afde7f722d6ea13d
-# pip tifffile @ https://files.pythonhosted.org/packages/cd/0b/33610b4d0d1bb83a6bfd20ed838f52e02a44e9b439116cd4f3d424e81a80/tifffile-2024.2.12-py3-none-any.whl#sha256=870998f82fbc94ff7c3528884c1b0ae54863504ff51dbebea431ac3fa8fb7c21
-# pip lightgbm @ https://files.pythonhosted.org/packages/ba/11/cb8b67f3cbdca05b59a032bb57963d4fe8c8d18c3870f30bed005b7f174d/lightgbm-4.3.0-py3-none-manylinux_2_28_x86_64.whl#sha256=104496a3404cb2452d3412cbddcfbfadbef9c372ea91e3a9b8794bcc5183bf07
-# pip matplotlib @ https://files.pythonhosted.org/packages/5e/2c/513395a63a9e1124a5648addbf73be23cc603f955af026b04416da98dc96/matplotlib-3.8.4-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=606e3b90897554c989b1e38a258c626d46c873523de432b1462f295db13de6f9
-# pip meson-python @ https://files.pythonhosted.org/packages/1f/60/b10b11ab470a690d5777310d6cfd1c9bdbbb0a1313a78c34a1e82e0b9d27/meson_python-0.15.0-py3-none-any.whl#sha256=3ae38253ff02b2e947a05e362a2eaf5a9a09d133c5666b4123399ee5fbf2e591
-# pip pandas @ https://files.pythonhosted.org/packages/1a/5e/71bb0eef0dc543f7516d9ddeca9ee8dc98207043784e3f7e6c08b4a6b3d9/pandas-2.2.1-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=f9d3558d263073ed95e46f4650becff0c5e1ffe0fc3a015de3c79283dfbdb3df
-# pip pyamg @ https://files.pythonhosted.org/packages/68/a9/aed9f557e7eb779d2cb4fa090663f8540979e0c04dadd16e9a0bdc9632c5/pyamg-5.1.0-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=5817d4567fb240dab4779bb1630bbb3035b3827731fcdaeb9ecc9c8814319995
+# pip requests @ https://files.pythonhosted.org/packages/f9/9b/335f9764261e915ed497fcdeb11df5dfd6f7bf257d4a6a2a686d80da4d54/requests-2.32.3-py3-none-any.whl#sha256=70761cfe03c773ceb22aa2f671b4757976145175cdfca038c02654d061d6dcc6
+# pip scipy @ https://files.pythonhosted.org/packages/89/bb/80c9c98d887c855710fd31fc5ae5574133e98203b3475b07579251803662/scipy-1.14.0-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=9e3154691b9f7ed73778d746da2df67a19d046a6c8087c8b385bc4cdb2cfca74
+# pip tifffile @ https://files.pythonhosted.org/packages/d2/d7/ca95f347442e82700f591f3608e336596ee607daecbcad6a7ebd16ff5de4/tifffile-2024.7.2-py3-none-any.whl#sha256=5a2ee608c9cc1f2e044d943dacebddc71d4827b6fad150ef4c644b7aefbe2d1a
+# pip lightgbm @ https://files.pythonhosted.org/packages/f2/3d/4f152cf694aec100ab63b4a5547f2dbfbea59ab39d9375c89bed9775e47d/lightgbm-4.4.0-py3-none-manylinux_2_28_x86_64.whl#sha256=8700b41f637717d36763a282d280b8d4722a87103030b7f0f373b96da0225022
+# pip matplotlib @ https://files.pythonhosted.org/packages/b8/63/cef838d92c1918ae28afd12b8aeaa9c104a0686cf6447aa0546f7c6dd1f0/matplotlib-3.9.1-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=ab38a4f3772523179b2f772103d8030215b318fef6360cb40558f585bf3d017f
+# pip meson-python @ https://files.pythonhosted.org/packages/91/c0/104cb6244c83fe6bc3886f144cc433db0c0c78efac5dc00e409a5a08c87d/meson_python-0.16.0-py3-none-any.whl#sha256=842dc9f5dc29e55fc769ff1b6fe328412fe6c870220fc321060a1d2d395e69e8
+# pip pandas @ https://files.pythonhosted.org/packages/fc/a5/4d82be566f069d7a9a702dcdf6f9106df0e0b042e738043c0cc7ddd7e3f6/pandas-2.2.2-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=6d2123dc9ad6a814bcdea0f099885276b31b24f7edf40f6cdbc0912672e22eee
+# pip pyamg @ https://files.pythonhosted.org/packages/d3/e8/6898b3b791f369605012e896ed903b6626f3bd1208c6a647d7219c070209/pyamg-5.2.1-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=679a5904eac3a4880288c8c0e6a29f110a2627ea15a443a4e9d5997c7dc5fab6
 # pip pytest-cov @ https://files.pythonhosted.org/packages/78/3a/af5b4fa5961d9a1e6237b530eb87dd04aea6eb83da09d2a4073d81b54ccf/pytest_cov-5.0.0-py3-none-any.whl#sha256=4f0764a1219df53214206bf1feea4633c3b558a2925c8b59f144f682861ce652
-# pip pytest-xdist @ https://files.pythonhosted.org/packages/50/37/125fe5ec459321e2d48a0c38672cfc2419ad87d580196fd894e5f25230b0/pytest_xdist-3.5.0-py3-none-any.whl#sha256=d075629c7e00b611df89f490a5063944bee7a4362a5ff11c7cc7824a03dfce24
-# pip scikit-image @ https://files.pythonhosted.org/packages/a3/7e/4cd853a855ac34b4ef3ef6a5c3d1c2e96eaca1154fc6be75db55ffa87393/scikit_image-0.22.0-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=3b7a6c89e8d6252332121b58f50e1625c35f7d6a85489c0b6b7ee4f5155d547a
-# pip sphinx @ https://files.pythonhosted.org/packages/b2/b6/8ed35256aa530a9d3da15d20bdc0ba888d5364441bb50a5a83ee7827affe/sphinx-7.2.6-py3-none-any.whl#sha256=1e09160a40b956dc623c910118fa636da93bd3ca0b9876a7b3df90f07d691560
+# pip pytest-xdist @ https://files.pythonhosted.org/packages/6d/82/1d96bf03ee4c0fdc3c0cbe61470070e659ca78dc0086fb88b66c185e2449/pytest_xdist-3.6.1-py3-none-any.whl#sha256=9ed4adfb68a016610848639bb7e02c9352d5d9f03d04809919e2dafc3be4cca7
+# pip scikit-image @ https://files.pythonhosted.org/packages/ad/96/138484302b8ec9a69cdf65e8d4ab47a640a3b1a8ea3c437e1da3e1a5a6b8/scikit_image-0.24.0-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=fa27b3a0dbad807b966b8db2d78da734cb812ca4787f7fbb143764800ce2fa9c
+# pip sphinx @ https://files.pythonhosted.org/packages/b4/fa/130c32ed94cf270e3d0b9ded16fb7b2c8fea86fa7263c29a696a30c1dde7/sphinx-7.3.7-py3-none-any.whl#sha256=413f75440be4cacf328f580b4274ada4565fb2187d696a84970c23f77b64d8c3
 # pip numpydoc @ https://files.pythonhosted.org/packages/f0/fa/dcfe0f65660661db757ee9ebd84e170ff98edd5d80235f62457d9088f85f/numpydoc-1.7.0-py3-none-any.whl#sha256=5a56419d931310d79a06cfc2a126d1558700feeb9b4f3d8dcae1a8134be829c9
diff --git a/build_tools/azure/pylatest_pip_scipy_dev_environment.yml b/build_tools/azure/pylatest_pip_scipy_dev_environment.yml
index 7d8e7a66d987e..01709b79e3720 100644
--- a/build_tools/azure/pylatest_pip_scipy_dev_environment.yml
+++ b/build_tools/azure/pylatest_pip_scipy_dev_environment.yml
@@ -9,7 +9,7 @@ dependencies:
   - pip
   - pip:
     - threadpoolctl
-    - pytest<8
+    - pytest
     - pytest-xdist
     - pip
     - ninja
diff --git a/build_tools/azure/pylatest_pip_scipy_dev_linux-64_conda.lock b/build_tools/azure/pylatest_pip_scipy_dev_linux-64_conda.lock
index cc8ed57c847f2..71d55df86a35d 100644
--- a/build_tools/azure/pylatest_pip_scipy_dev_linux-64_conda.lock
+++ b/build_tools/azure/pylatest_pip_scipy_dev_linux-64_conda.lock
@@ -1,6 +1,6 @@
 # Generated by conda-lock.
 # platform: linux-64
-# input_hash: 777413179f12c3f7972520657eb2c826ffd6ff4c15e5da73631696b7ef07c3f2
+# input_hash: 8a4a203136d97ff3b2c8657fce2dd2228215bfbf9c1cfbe271e401f934bdf1a7
 @EXPLICIT
 https://repo.anaconda.com/pkgs/main/linux-64/_libgcc_mutex-0.1-main.conda#c3473ff8bdb3d124ed5ff11ec380d6f9
 https://repo.anaconda.com/pkgs/main/linux-64/ca-certificates-2024.3.11-h06a4308_0.conda#08529eb3504712baabcbda266a19feb7
@@ -10,39 +10,39 @@ https://repo.anaconda.com/pkgs/main/linux-64/libgomp-11.2.0-h1234567_1.conda#b37
 https://repo.anaconda.com/pkgs/main/linux-64/libstdcxx-ng-11.2.0-h1234567_1.conda#57623d10a70e09e1d048c2b2b6f4e2dd
 https://repo.anaconda.com/pkgs/main/linux-64/_openmp_mutex-5.1-1_gnu.conda#71d281e9c2192cb3fa425655a8defb85
 https://repo.anaconda.com/pkgs/main/linux-64/libgcc-ng-11.2.0-h1234567_1.conda#a87728dabf3151fb9cfa990bd2eb0464
-https://repo.anaconda.com/pkgs/main/linux-64/bzip2-1.0.8-h5eee18b_5.conda#9c8dec113089c4aca7392c6a3864f505
-https://repo.anaconda.com/pkgs/main/linux-64/expat-2.5.0-h6a678d5_0.conda#9a21d99d49a0a556cf9590430dec8ec0
-https://repo.anaconda.com/pkgs/main/linux-64/libffi-3.4.4-h6a678d5_0.conda#06e288f9250abef59b9a367d151fc339
+https://repo.anaconda.com/pkgs/main/linux-64/bzip2-1.0.8-h5eee18b_6.conda#f21a3ff51c1b271977f53ce956a69297
+https://repo.anaconda.com/pkgs/main/linux-64/expat-2.6.2-h6a678d5_0.conda#55049db2772dae035f6b8a95f72b5970
+https://repo.anaconda.com/pkgs/main/linux-64/libffi-3.4.4-h6a678d5_1.conda#70646cc713f0c43926cfdcfe9b695fe0
 https://repo.anaconda.com/pkgs/main/linux-64/libuuid-1.41.5-h5eee18b_0.conda#4a6a2354414c9080327274aa514e5299
 https://repo.anaconda.com/pkgs/main/linux-64/ncurses-6.4-h6a678d5_0.conda#5558eec6e2191741a92f832ea826251c
-https://repo.anaconda.com/pkgs/main/linux-64/openssl-3.0.13-h7f8727e_0.conda#c73d46a4d666da0ae3dcd3fd8f805122
-https://repo.anaconda.com/pkgs/main/linux-64/xz-5.4.6-h5eee18b_0.conda#81a9916f581d4da15a3839216a487c66
-https://repo.anaconda.com/pkgs/main/linux-64/zlib-1.2.13-h5eee18b_0.conda#333e31fbfbb5057c92fa845ad6adef93
+https://repo.anaconda.com/pkgs/main/linux-64/openssl-3.0.14-h5eee18b_0.conda#37b6dad6aa49000a4230a9f0cad172f6
+https://repo.anaconda.com/pkgs/main/linux-64/xz-5.4.6-h5eee18b_1.conda#1562802f843297ee776a50b9329597ed
+https://repo.anaconda.com/pkgs/main/linux-64/zlib-1.2.13-h5eee18b_1.conda#92e42d8310108b0a440fb2e60b2b2a25
 https://repo.anaconda.com/pkgs/main/linux-64/ccache-3.7.9-hfe4627d_0.conda#bef6fc681c273bb7bd0c67d1a591365e
 https://repo.anaconda.com/pkgs/main/linux-64/readline-8.2-h5eee18b_0.conda#be42180685cce6e6b0329201d9f48efb
-https://repo.anaconda.com/pkgs/main/linux-64/tk-8.6.12-h1ccaba5_0.conda#fa10ff4aa631fa4aa090a6234d7770b9
-https://repo.anaconda.com/pkgs/main/linux-64/sqlite-3.41.2-h5eee18b_0.conda#c7086c9ceb6cfe1c4c729a774a2d88a5
-https://repo.anaconda.com/pkgs/main/linux-64/python-3.12.2-h996f2a0_0.conda#bc4748d0d26253c8499a3abeca289469
-https://repo.anaconda.com/pkgs/main/linux-64/setuptools-68.2.2-py312h06a4308_0.conda#83ba634cde4f30d9e0b88e4ac9716ca4
-https://repo.anaconda.com/pkgs/main/linux-64/wheel-0.41.2-py312h06a4308_0.conda#b2c4f82880d58d679f3982370d80c0e2
-https://repo.anaconda.com/pkgs/main/linux-64/pip-23.3.1-py312h06a4308_0.conda#e1d44bca4a257e84af33503233491107
+https://repo.anaconda.com/pkgs/main/linux-64/tk-8.6.14-h39e8969_0.conda#78dbc5e3c69143ebc037fc5d5b22e597
+https://repo.anaconda.com/pkgs/main/linux-64/sqlite-3.45.3-h5eee18b_0.conda#acf93d6aceb74d6110e20b44cc45939e
+https://repo.anaconda.com/pkgs/main/linux-64/python-3.12.4-h5148396_1.conda#7863dc035441267f7b617f080c933671
+https://repo.anaconda.com/pkgs/main/linux-64/setuptools-69.5.1-py312h06a4308_0.conda#ce85d9a864a73e0b12d31a97733c9fca
+https://repo.anaconda.com/pkgs/main/linux-64/wheel-0.43.0-py312h06a4308_0.conda#18d5f3b68a175c72576876db4afc9e9e
+https://repo.anaconda.com/pkgs/main/linux-64/pip-24.0-py312h06a4308_0.conda#6d9697bb8b9f3212be10b3b8e01a12b9
 # pip alabaster @ https://files.pythonhosted.org/packages/32/34/d4e1c02d3bee589efb5dfa17f88ea08bdb3e3eac12bc475462aec52ed223/alabaster-0.7.16-py3-none-any.whl#sha256=b46733c07dce03ae4e150330b975c75737fa60f0a7c591b6c8bf4928a28e2c92
-# pip babel @ https://files.pythonhosted.org/packages/0d/35/4196b21041e29a42dc4f05866d0c94fa26c9da88ce12c38c2265e42c82fb/Babel-2.14.0-py3-none-any.whl#sha256=efb1a25b7118e67ce3a259bed20545c29cb68be8ad2c784c83689981b7a57287
-# pip certifi @ https://files.pythonhosted.org/packages/ba/06/a07f096c664aeb9f01624f858c3add0a4e913d6c96257acb4fce61e7de14/certifi-2024.2.2-py3-none-any.whl#sha256=dc383c07b76109f368f6106eee2b593b04a011ea4d55f652c6ca24a754d1cdd1
+# pip babel @ https://files.pythonhosted.org/packages/27/45/377f7e32a5c93d94cd56542349b34efab5ca3f9e2fd5a68c5e93169aa32d/Babel-2.15.0-py3-none-any.whl#sha256=08706bdad8d0a3413266ab61bd6c34d0c28d6e1e7badf40a2cebe67644e2e1fb
+# pip certifi @ https://files.pythonhosted.org/packages/1c/d5/c84e1a17bf61d4df64ca866a1c9a913874b4e9bdc131ec689a0ad013fb36/certifi-2024.7.4-py3-none-any.whl#sha256=c198e21b1289c2ab85ee4e67bb4b4ef3ead0892059901a8d5b622f24a1101e90
 # pip charset-normalizer @ https://files.pythonhosted.org/packages/ee/fb/14d30eb4956408ee3ae09ad34299131fb383c47df355ddb428a7331cfa1e/charset_normalizer-3.3.2-cp312-cp312-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=90d558489962fd4918143277a773316e56c72da56ec7aa3dc3dbbe20fdfed15b
-# pip coverage @ https://files.pythonhosted.org/packages/98/79/185cb42910b6a2b2851980407c8445ac0da0750dff65e420e86f973c8396/coverage-7.4.4-cp312-cp312-manylinux_2_5_x86_64.manylinux1_x86_64.manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=ce4b94265ca988c3f8e479e741693d143026632672e3ff924f25fab50518dd51
-# pip docutils @ https://files.pythonhosted.org/packages/26/87/f238c0670b94533ac0353a4e2a1a771a0cc73277b88bff23d3ae35a256c1/docutils-0.20.1-py3-none-any.whl#sha256=96f387a2c5562db4476f09f13bbab2192e764cac08ebbf3a34a95d9b1e4a59d6
-# pip execnet @ https://files.pythonhosted.org/packages/67/14/6582043548cf796408c13454212c26acf781ead50561b6da246bdbc2bb14/execnet-2.1.0-py3-none-any.whl#sha256=ad174d7705410adc9359ba4822bad211d71cdbd59ff70304e1aa41d196b4b4d3
-# pip idna @ https://files.pythonhosted.org/packages/c2/e7/a82b05cf63a603df6e68d59ae6a68bf5064484a0718ea5033660af4b54a9/idna-3.6-py3-none-any.whl#sha256=c05567e9c24a6b9faaa835c4821bad0590fbb9d5779e7caa6e1cc4978e7eb24f
+# pip coverage @ https://files.pythonhosted.org/packages/88/52/7054710a881b09d295e93b9889ac204c241a6847a8c05555fc6e1d8799d5/coverage-7.5.4-cp312-cp312-manylinux_2_5_x86_64.manylinux1_x86_64.manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=5013ed890dc917cef2c9f765c4c6a8ae9df983cd60dbb635df8ed9f4ebc9f555
+# pip docutils @ https://files.pythonhosted.org/packages/8f/d7/9322c609343d929e75e7e5e6255e614fcc67572cfd083959cdef3b7aad79/docutils-0.21.2-py3-none-any.whl#sha256=dafca5b9e384f0e419294eb4d2ff9fa826435bf15f15b7bd45723e8ad76811b2
+# pip execnet @ https://files.pythonhosted.org/packages/43/09/2aea36ff60d16dd8879bdb2f5b3ee0ba8d08cbbdcdfe870e695ce3784385/execnet-2.1.1-py3-none-any.whl#sha256=26dee51f1b80cebd6d0ca8e74dd8745419761d3bef34163928cbebbdc4749fdc
+# pip idna @ https://files.pythonhosted.org/packages/e5/3e/741d8c82801c347547f8a2a06aa57dbb1992be9e948df2ea0eda2c8b79e8/idna-3.7-py3-none-any.whl#sha256=82fee1fc78add43492d3a1898bfa6d8a904cc97d8427f683ed8e798d07761aa0
 # pip imagesize @ https://files.pythonhosted.org/packages/ff/62/85c4c919272577931d407be5ba5d71c20f0b616d31a0befe0ae45bb79abd/imagesize-1.4.1-py2.py3-none-any.whl#sha256=0d8d18d08f840c19d0ee7ca1fd82490fdc3729b7ac93f49870406ddde8ef8d8b
 # pip iniconfig @ https://files.pythonhosted.org/packages/ef/a6/62565a6e1cf69e10f5727360368e451d4b7f58beeac6173dc9db836a5b46/iniconfig-2.0.0-py3-none-any.whl#sha256=b6a85871a79d2e3b22d2d1b94ac2824226a63c6b741c88f7ae975f18b6778374
 # pip markupsafe @ https://files.pythonhosted.org/packages/0a/0d/2454f072fae3b5a137c119abf15465d1771319dfe9e4acbb31722a0fff91/MarkupSafe-2.1.5-cp312-cp312-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=f5dfb42c4604dddc8e4305050aa6deb084540643ed5804d7455b5df8fe16f5e5
-# pip meson @ https://files.pythonhosted.org/packages/33/75/b1a37fa7b2dbca8c0dbb04d5cdd7e2720c8ef6febe41b4a74866350e041c/meson-1.4.0-py3-none-any.whl#sha256=476a458d51fcfa322a6bdc64da5138997c542d08e6b2e49b9fa68c46fd7c4475
+# pip meson @ https://files.pythonhosted.org/packages/44/b2/d4433391a7c5e94a39b50ca7295a8ceba736e7c72c455752a60122f52453/meson-1.4.1-py3-none-any.whl#sha256=d5acc3abae2dad3c70ddcbd10acac92b78b144d34d43f40f5b8ac31dfd8a826a
 # pip ninja @ https://files.pythonhosted.org/packages/6d/92/8d7aebd4430ab5ff65df2bfee6d5745f95c004284db2d8ca76dcbfd9de47/ninja-1.11.1.1-py2.py3-none-manylinux1_x86_64.manylinux_2_5_x86_64.whl#sha256=84502ec98f02a037a169c4b0d5d86075eaf6afc55e1879003d6cab51ced2ea4b
-# pip packaging @ https://files.pythonhosted.org/packages/49/df/1fceb2f8900f8639e278b056416d49134fb8d84c5942ffaa01ad34782422/packaging-24.0-py3-none-any.whl#sha256=2ddfb553fdf02fb784c234c7ba6ccc288296ceabec964ad2eae3777778130bc5
-# pip platformdirs @ https://files.pythonhosted.org/packages/55/72/4898c44ee9ea6f43396fbc23d9bfaf3d06e01b83698bdf2e4c919deceb7c/platformdirs-4.2.0-py3-none-any.whl#sha256=0614df2a2f37e1a662acbd8e2b25b92ccf8632929bc6d43467e17fe89c75e068
-# pip pluggy @ https://files.pythonhosted.org/packages/a5/5b/0cc789b59e8cc1bf288b38111d002d8c5917123194d45b29dcdac64723cc/pluggy-1.4.0-py3-none-any.whl#sha256=7db9f7b503d67d1c5b95f59773ebb58a8c1c288129a88665838012cfb07b8981
-# pip pygments @ https://files.pythonhosted.org/packages/97/9c/372fef8377a6e340b1704768d20daaded98bf13282b5327beb2e2fe2c7ef/pygments-2.17.2-py3-none-any.whl#sha256=b27c2826c47d0f3219f29554824c30c5e8945175d888647acd804ddd04af846c
+# pip packaging @ https://files.pythonhosted.org/packages/08/aa/cc0199a5f0ad350994d660967a8efb233fe0416e4639146c089643407ce6/packaging-24.1-py3-none-any.whl#sha256=5b8f2217dbdbd2f7f384c41c628544e6d52f2d0f53c6d0c3ea61aa5d1d7ff124
+# pip platformdirs @ https://files.pythonhosted.org/packages/68/13/2aa1f0e1364feb2c9ef45302f387ac0bd81484e9c9a4c5688a322fbdfd08/platformdirs-4.2.2-py3-none-any.whl#sha256=2d7a1657e36a80ea911db832a8a6ece5ee53d8de21edd5cc5879af6530b1bfee
+# pip pluggy @ https://files.pythonhosted.org/packages/88/5f/e351af9a41f866ac3f1fac4ca0613908d9a41741cfcf2228f4ad853b697d/pluggy-1.5.0-py3-none-any.whl#sha256=44e1ad92c8ca002de6377e165f3e0f1be63266ab4d554740532335b9d75ea669
+# pip pygments @ https://files.pythonhosted.org/packages/f7/3f/01c8b82017c199075f8f788d0d906b9ffbbc5a47dc9918a945e13d5a2bda/pygments-2.18.0-py3-none-any.whl#sha256=b8e6aca0523f3ab76fee51799c488e38782ac06eafcf95e7ba832985c8e7b13a
 # pip six @ https://files.pythonhosted.org/packages/d9/5a/e7c31adbe875f2abbb91bd84cf2dc52d792b5a01506781dbcf25c91daf11/six-1.16.0-py2.py3-none-any.whl#sha256=8abb2f1d86890a2dfb989f9a77cfcfd3e47c2a354b01111771326f8aa26e0254
 # pip snowballstemmer @ https://files.pythonhosted.org/packages/ed/dc/c02e01294f7265e63a7315fe086dd1df7dacb9f840a804da846b96d01b96/snowballstemmer-2.2.0-py2.py3-none-any.whl#sha256=c8e1716e83cc398ae16824e5572ae04e0d9fc2c6b985fb0f900f5f0c96ecba1a
 # pip sphinxcontrib-applehelp @ https://files.pythonhosted.org/packages/56/89/fea3fbf6785b388e6cb8a1beaf62f96e80b37311bdeed6e133388a732426/sphinxcontrib_applehelp-1.0.8-py3-none-any.whl#sha256=cb61eb0ec1b61f349e5cc36b2028e9e7ca765be05e49641c97241274753067b4
@@ -52,16 +52,16 @@ https://repo.anaconda.com/pkgs/main/linux-64/pip-23.3.1-py312h06a4308_0.conda#e1
 # pip sphinxcontrib-qthelp @ https://files.pythonhosted.org/packages/80/b3/1beac14a88654d2e5120d0143b49be5ad450b86eb1963523d8dbdcc51eb2/sphinxcontrib_qthelp-1.0.7-py3-none-any.whl#sha256=e2ae3b5c492d58fcbd73281fbd27e34b8393ec34a073c792642cd8e529288182
 # pip sphinxcontrib-serializinghtml @ https://files.pythonhosted.org/packages/38/24/228bb903ea87b9e08ab33470e6102402a644127108c7117ac9c00d849f82/sphinxcontrib_serializinghtml-1.1.10-py3-none-any.whl#sha256=326369b8df80a7d2d8d7f99aa5ac577f51ea51556ed974e7716cfd4fca3f6cb7
 # pip tabulate @ https://files.pythonhosted.org/packages/40/44/4a5f08c96eb108af5cb50b41f76142f0afa346dfa99d5296fe7202a11854/tabulate-0.9.0-py3-none-any.whl#sha256=024ca478df22e9340661486f85298cff5f6dcdba14f3813e8830015b9ed1948f
-# pip threadpoolctl @ https://files.pythonhosted.org/packages/1e/84/ccd9b08653022b7785b6e3ee070ffb2825841e0dc119be22f0840b2b35cb/threadpoolctl-3.4.0-py3-none-any.whl#sha256=8f4c689a65b23e5ed825c8436a92b818aac005e0f3715f6a1664d7c7ee29d262
-# pip urllib3 @ https://files.pythonhosted.org/packages/a2/73/a68704750a7679d0b6d3ad7aa8d4da8e14e151ae82e6fee774e6e0d05ec8/urllib3-2.2.1-py3-none-any.whl#sha256=450b20ec296a467077128bff42b73080516e71b56ff59a60a02bef2232c4fa9d
-# pip jinja2 @ https://files.pythonhosted.org/packages/30/6d/6de6be2d02603ab56e72997708809e8a5b0fbfee080735109b40a3564843/Jinja2-3.1.3-py3-none-any.whl#sha256=7d6d50dd97d52cbc355597bd845fabfbac3f551e1f99619e39a35ce8c370b5fa
-# pip pyproject-metadata @ https://files.pythonhosted.org/packages/c4/cb/4678dfd70cd2f2d8969e571cdc1bb1e9293c698f8d1cf428fadcf48d6e9f/pyproject_metadata-0.7.1-py3-none-any.whl#sha256=28691fbb36266a819ec56c9fa1ecaf36f879d6944dfde5411e87fc4ff793aa60
-# pip pytest @ https://files.pythonhosted.org/packages/51/ff/f6e8b8f39e08547faece4bd80f89d5a8de68a38b2d179cc1c4490ffa3286/pytest-7.4.4-py3-none-any.whl#sha256=b090cdf5ed60bf4c45261be03239c2c1c22df034fbffe691abe93cd80cea01d8
+# pip threadpoolctl @ https://files.pythonhosted.org/packages/4b/2c/ffbf7a134b9ab11a67b0cf0726453cedd9c5043a4fe7a35d1cefa9a1bcfb/threadpoolctl-3.5.0-py3-none-any.whl#sha256=56c1e26c150397e58c4926da8eeee87533b1e32bef131bd4bf6a2f45f3185467
+# pip urllib3 @ https://files.pythonhosted.org/packages/ca/1c/89ffc63a9605b583d5df2be791a27bc1a42b7c32bab68d3c8f2f73a98cd4/urllib3-2.2.2-py3-none-any.whl#sha256=a448b2f64d686155468037e1ace9f2d2199776e17f0a46610480d311f73e3472
+# pip jinja2 @ https://files.pythonhosted.org/packages/31/80/3a54838c3fb461f6fec263ebf3a3a41771bd05190238de3486aae8540c36/jinja2-3.1.4-py3-none-any.whl#sha256=bc5dd2abb727a5319567b7a813e6a2e7318c39f4f487cfe6c89c6f9c7d25197d
+# pip pyproject-metadata @ https://files.pythonhosted.org/packages/aa/5f/bb5970d3d04173b46c9037109f7f05fc8904ff5be073ee49bb6ff00301bc/pyproject_metadata-0.8.0-py3-none-any.whl#sha256=ad858d448e1d3a1fb408ac5bac9ea7743e7a8bbb472f2693aaa334d2db42f526
+# pip pytest @ https://files.pythonhosted.org/packages/4e/e7/81ebdd666d3bff6670d27349b5053605d83d55548e6bd5711f3b0ae7dd23/pytest-8.2.2-py3-none-any.whl#sha256=c434598117762e2bd304e526244f67bf66bbd7b5d6cf22138be51ff661980343
 # pip python-dateutil @ https://files.pythonhosted.org/packages/ec/57/56b9bcc3c9c6a792fcbaf139543cee77261f3651ca9da0c93f5c1221264b/python_dateutil-2.9.0.post0-py2.py3-none-any.whl#sha256=a8b2bc7bffae282281c8140a97d3aa9c14da0b136dfe83f850eea9a5f7470427
-# pip requests @ https://files.pythonhosted.org/packages/70/8e/0e2d847013cb52cd35b38c009bb167a1a26b2ce6cd6965bf26b47bc0bf44/requests-2.31.0-py3-none-any.whl#sha256=58cd2187c01e70e6e26505bca751777aa9f2ee0b7f4300988b709f44e013003f
-# pip meson-python @ https://files.pythonhosted.org/packages/1f/60/b10b11ab470a690d5777310d6cfd1c9bdbbb0a1313a78c34a1e82e0b9d27/meson_python-0.15.0-py3-none-any.whl#sha256=3ae38253ff02b2e947a05e362a2eaf5a9a09d133c5666b4123399ee5fbf2e591
-# pip pooch @ https://files.pythonhosted.org/packages/f4/72/8ae0f1ba4ce6a4f6d4d01a60a9fdf690fde188c45c1872b0b4ddb0607ace/pooch-1.8.1-py3-none-any.whl#sha256=6b56611ac320c239faece1ac51a60b25796792599ce5c0b1bb87bf01df55e0a9
+# pip requests @ https://files.pythonhosted.org/packages/f9/9b/335f9764261e915ed497fcdeb11df5dfd6f7bf257d4a6a2a686d80da4d54/requests-2.32.3-py3-none-any.whl#sha256=70761cfe03c773ceb22aa2f671b4757976145175cdfca038c02654d061d6dcc6
+# pip meson-python @ https://files.pythonhosted.org/packages/91/c0/104cb6244c83fe6bc3886f144cc433db0c0c78efac5dc00e409a5a08c87d/meson_python-0.16.0-py3-none-any.whl#sha256=842dc9f5dc29e55fc769ff1b6fe328412fe6c870220fc321060a1d2d395e69e8
+# pip pooch @ https://files.pythonhosted.org/packages/a8/87/77cc11c7a9ea9fd05503def69e3d18605852cd0d4b0d3b8f15bbeb3ef1d1/pooch-1.8.2-py3-none-any.whl#sha256=3529a57096f7198778a5ceefd5ac3ef0e4d06a6ddaf9fc2d609b806f25302c47
 # pip pytest-cov @ https://files.pythonhosted.org/packages/78/3a/af5b4fa5961d9a1e6237b530eb87dd04aea6eb83da09d2a4073d81b54ccf/pytest_cov-5.0.0-py3-none-any.whl#sha256=4f0764a1219df53214206bf1feea4633c3b558a2925c8b59f144f682861ce652
-# pip pytest-xdist @ https://files.pythonhosted.org/packages/50/37/125fe5ec459321e2d48a0c38672cfc2419ad87d580196fd894e5f25230b0/pytest_xdist-3.5.0-py3-none-any.whl#sha256=d075629c7e00b611df89f490a5063944bee7a4362a5ff11c7cc7824a03dfce24
-# pip sphinx @ https://files.pythonhosted.org/packages/b2/b6/8ed35256aa530a9d3da15d20bdc0ba888d5364441bb50a5a83ee7827affe/sphinx-7.2.6-py3-none-any.whl#sha256=1e09160a40b956dc623c910118fa636da93bd3ca0b9876a7b3df90f07d691560
+# pip pytest-xdist @ https://files.pythonhosted.org/packages/6d/82/1d96bf03ee4c0fdc3c0cbe61470070e659ca78dc0086fb88b66c185e2449/pytest_xdist-3.6.1-py3-none-any.whl#sha256=9ed4adfb68a016610848639bb7e02c9352d5d9f03d04809919e2dafc3be4cca7
+# pip sphinx @ https://files.pythonhosted.org/packages/b4/fa/130c32ed94cf270e3d0b9ded16fb7b2c8fea86fa7263c29a696a30c1dde7/sphinx-7.3.7-py3-none-any.whl#sha256=413f75440be4cacf328f580b4274ada4565fb2187d696a84970c23f77b64d8c3
 # pip numpydoc @ https://files.pythonhosted.org/packages/f0/fa/dcfe0f65660661db757ee9ebd84e170ff98edd5d80235f62457d9088f85f/numpydoc-1.7.0-py3-none-any.whl#sha256=5a56419d931310d79a06cfc2a126d1558700feeb9b4f3d8dcae1a8134be829c9
diff --git a/build_tools/azure/pymin_conda_defaults_openblas_environment.yml b/build_tools/azure/pymin_conda_defaults_openblas_environment.yml
index a422a0a539c53..83b0627ff296f 100644
--- a/build_tools/azure/pymin_conda_defaults_openblas_environment.yml
+++ b/build_tools/azure/pymin_conda_defaults_openblas_environment.yml
@@ -8,16 +8,18 @@ dependencies:
   - numpy=1.21
   - blas[build=openblas]
   - scipy=1.7
-  - joblib
-  - threadpoolctl=2.2.0
+  - cython=3.0.10  # min
+  - joblib=1.2.0  # min
   - matplotlib=3.3.4  # min
   - pyamg
-  - pytest<8
+  - pytest
   - pytest-xdist
   - pillow
+  - ninja
   - pytest-cov
   - coverage
   - ccache
   - pip
   - pip:
-    - cython==3.0.10  # min
+    - threadpoolctl==3.1.0  # min
+    - meson-python==0.16.0  # min
diff --git a/build_tools/azure/pymin_conda_defaults_openblas_linux-64_conda.lock b/build_tools/azure/pymin_conda_defaults_openblas_linux-64_conda.lock
index 4e64af1960718..95289022eccec 100644
--- a/build_tools/azure/pymin_conda_defaults_openblas_linux-64_conda.lock
+++ b/build_tools/azure/pymin_conda_defaults_openblas_linux-64_conda.lock
@@ -1,6 +1,6 @@
 # Generated by conda-lock.
 # platform: linux-64
-# input_hash: 3d6bcb087065974114c1567c8dccd947a7376a7503b3514d82904299b651692d
+# input_hash: e4db53ad2240ff5f57679dd93701c30b6712ac3a43ec04e18b74132f2948b4cd
 @EXPLICIT
 https://repo.anaconda.com/pkgs/main/linux-64/_libgcc_mutex-0.1-main.conda#c3473ff8bdb3d124ed5ff11ec380d6f9
 https://repo.anaconda.com/pkgs/main/linux-64/blas-1.0-openblas.conda#9ddfcaef10d79366c90128f5dc444be8
@@ -13,51 +13,53 @@ https://repo.anaconda.com/pkgs/main/linux-64/libgomp-11.2.0-h1234567_1.conda#b37
 https://repo.anaconda.com/pkgs/main/linux-64/libstdcxx-ng-11.2.0-h1234567_1.conda#57623d10a70e09e1d048c2b2b6f4e2dd
 https://repo.anaconda.com/pkgs/main/linux-64/_openmp_mutex-5.1-1_gnu.conda#71d281e9c2192cb3fa425655a8defb85
 https://repo.anaconda.com/pkgs/main/linux-64/libgcc-ng-11.2.0-h1234567_1.conda#a87728dabf3151fb9cfa990bd2eb0464
-https://repo.anaconda.com/pkgs/main/linux-64/bzip2-1.0.8-h5eee18b_5.conda#9c8dec113089c4aca7392c6a3864f505
-https://repo.anaconda.com/pkgs/main/linux-64/expat-2.5.0-h6a678d5_0.conda#9a21d99d49a0a556cf9590430dec8ec0
+https://repo.anaconda.com/pkgs/main/linux-64/bzip2-1.0.8-h5eee18b_6.conda#f21a3ff51c1b271977f53ce956a69297
+https://repo.anaconda.com/pkgs/main/linux-64/expat-2.6.2-h6a678d5_0.conda#55049db2772dae035f6b8a95f72b5970
 https://repo.anaconda.com/pkgs/main/linux-64/fftw-3.3.9-h5eee18b_2.conda#db1df41113accc18ec59a99f1631bfcd
 https://repo.anaconda.com/pkgs/main/linux-64/icu-73.1-h6a678d5_0.conda#6d09df641fc23f7d277a04dc7ea32dd4
 https://repo.anaconda.com/pkgs/main/linux-64/jpeg-9e-h5eee18b_1.conda#ac373800fda872108412d1ccfe3fa572
 https://repo.anaconda.com/pkgs/main/linux-64/lerc-3.0-h295c915_0.conda#b97309770412f10bed8d9448f6f98f87
 https://repo.anaconda.com/pkgs/main/linux-64/libdeflate-1.17-h5eee18b_1.conda#82831ef0b6c9595382d74e0c281f6742
-https://repo.anaconda.com/pkgs/main/linux-64/libffi-3.4.4-h6a678d5_0.conda#06e288f9250abef59b9a367d151fc339
-https://repo.anaconda.com/pkgs/main/linux-64/libiconv-1.16-h7f8727e_2.conda#80d4bc7d7e58b5f0be41d763f60994f5
+https://repo.anaconda.com/pkgs/main/linux-64/libffi-3.4.4-h6a678d5_1.conda#70646cc713f0c43926cfdcfe9b695fe0
+https://repo.anaconda.com/pkgs/main/linux-64/libiconv-1.16-h5eee18b_3.conda#197b1a0886a31fccab2167340528eebc
 https://repo.anaconda.com/pkgs/main/linux-64/libopenblas-0.3.21-h043d6bf_0.conda#7f7324dcc3c4761a14f3e4ac443235a7
 https://repo.anaconda.com/pkgs/main/linux-64/libuuid-1.41.5-h5eee18b_0.conda#4a6a2354414c9080327274aa514e5299
 https://repo.anaconda.com/pkgs/main/linux-64/libwebp-base-1.3.2-h5eee18b_0.conda#9179fc7baefa1e027f572edbc519d805
 https://repo.anaconda.com/pkgs/main/linux-64/libxcb-1.15-h7f8727e_0.conda#ada518dcadd6aaee9aae47ba9a671553
-https://repo.anaconda.com/pkgs/main/linux-64/lz4-c-1.9.4-h6a678d5_0.conda#53915e9402180a7f22ea619c41089520
+https://repo.anaconda.com/pkgs/main/linux-64/lz4-c-1.9.4-h6a678d5_1.conda#2ee58861f2b92b868ce761abb831819d
 https://repo.anaconda.com/pkgs/main/linux-64/ncurses-6.4-h6a678d5_0.conda#5558eec6e2191741a92f832ea826251c
-https://repo.anaconda.com/pkgs/main/linux-64/openssl-3.0.13-h7f8727e_0.conda#c73d46a4d666da0ae3dcd3fd8f805122
-https://repo.anaconda.com/pkgs/main/linux-64/xz-5.4.6-h5eee18b_0.conda#81a9916f581d4da15a3839216a487c66
-https://repo.anaconda.com/pkgs/main/linux-64/zlib-1.2.13-h5eee18b_0.conda#333e31fbfbb5057c92fa845ad6adef93
+https://repo.anaconda.com/pkgs/main/linux-64/ninja-base-1.10.2-hd09550d_5.conda#09dcbad622d58caaeefe46cd399f0a76
+https://repo.anaconda.com/pkgs/main/linux-64/openssl-3.0.14-h5eee18b_0.conda#37b6dad6aa49000a4230a9f0cad172f6
+https://repo.anaconda.com/pkgs/main/linux-64/xz-5.4.6-h5eee18b_1.conda#1562802f843297ee776a50b9329597ed
+https://repo.anaconda.com/pkgs/main/linux-64/zlib-1.2.13-h5eee18b_1.conda#92e42d8310108b0a440fb2e60b2b2a25
 https://repo.anaconda.com/pkgs/main/linux-64/ccache-3.7.9-hfe4627d_0.conda#bef6fc681c273bb7bd0c67d1a591365e
 https://repo.anaconda.com/pkgs/main/linux-64/libcups-2.4.2-h2d74bed_1.conda#3f265c2172a9e8c90a74037b6fa13685
 https://repo.anaconda.com/pkgs/main/linux-64/libedit-3.1.20230828-h5eee18b_0.conda#850eb5a9d2d7d3c66cce12e84406ca08
 https://repo.anaconda.com/pkgs/main/linux-64/libllvm14-14.0.6-hdb19cb5_3.conda#aefea2b45cf32f12b4f1ffaa70aa3201
 https://repo.anaconda.com/pkgs/main/linux-64/libpng-1.6.39-h5eee18b_0.conda#f6aee38184512eb05b06c2e94d39ab22
-https://repo.anaconda.com/pkgs/main/linux-64/libxml2-2.10.4-hf1b16e4_1.conda#e87849ce513f9968794f20bba620e6a4
-https://repo.anaconda.com/pkgs/main/linux-64/pcre2-10.42-hebb0a14_0.conda#fca6dea6ce1eddd0876a024f62c5097a
+https://repo.anaconda.com/pkgs/main/linux-64/libxml2-2.10.4-hfdd30dd_2.conda#ff7a0e3b92afb3c99b82c9f0ba8b5670
+https://repo.anaconda.com/pkgs/main/linux-64/pcre2-10.42-hebb0a14_1.conda#727e15c3cfa02b032da4eb0c1123e977
 https://repo.anaconda.com/pkgs/main/linux-64/readline-8.2-h5eee18b_0.conda#be42180685cce6e6b0329201d9f48efb
-https://repo.anaconda.com/pkgs/main/linux-64/tk-8.6.12-h1ccaba5_0.conda#fa10ff4aa631fa4aa090a6234d7770b9
-https://repo.anaconda.com/pkgs/main/linux-64/zstd-1.5.5-hc292b87_0.conda#0f59d57dc21f585f4c282d60dfb46505
+https://repo.anaconda.com/pkgs/main/linux-64/tk-8.6.14-h39e8969_0.conda#78dbc5e3c69143ebc037fc5d5b22e597
+https://repo.anaconda.com/pkgs/main/linux-64/zstd-1.5.5-hc292b87_2.conda#3b7fe809e5b429b4f90fe064842a2370
 https://repo.anaconda.com/pkgs/main/linux-64/freetype-2.12.1-h4a9f257_0.conda#bdc7b5952e9c5dca01bc2f4ccef2f974
 https://repo.anaconda.com/pkgs/main/linux-64/krb5-1.20.1-h143b758_1.conda#cf1accc86321fa25d6b978cc748039ae
 https://repo.anaconda.com/pkgs/main/linux-64/libclang13-14.0.6-default_he11475f_1.conda#44890feda1cf51639d9c94afbacce011
 https://repo.anaconda.com/pkgs/main/linux-64/libglib-2.78.4-hdc74915_0.conda#2f6d27741e931d5b6ba56e1a1312aaf0
 https://repo.anaconda.com/pkgs/main/linux-64/libtiff-4.5.1-h6a678d5_0.conda#235a671f74f0c4ecad9f9b3b107e3566
 https://repo.anaconda.com/pkgs/main/linux-64/libxkbcommon-1.0.1-h5eee18b_1.conda#888b2e8f1bbf21017c503826e2d24b50
-https://repo.anaconda.com/pkgs/main/linux-64/sqlite-3.41.2-h5eee18b_0.conda#c7086c9ceb6cfe1c4c729a774a2d88a5
+https://repo.anaconda.com/pkgs/main/linux-64/sqlite-3.45.3-h5eee18b_0.conda#acf93d6aceb74d6110e20b44cc45939e
 https://repo.anaconda.com/pkgs/main/linux-64/cyrus-sasl-2.1.28-h52b45da_1.conda#d634af1577e4008f9228ae96ce671c44
 https://repo.anaconda.com/pkgs/main/linux-64/fontconfig-2.14.1-h4c34cd2_2.conda#f0b472f5b544f8d57beb09ed4a2932e1
 https://repo.anaconda.com/pkgs/main/linux-64/glib-tools-2.78.4-h6a678d5_0.conda#3dbe6227cd59818dca9afb75ccb70708
 https://repo.anaconda.com/pkgs/main/linux-64/lcms2-2.12-h3be6417_0.conda#719db47afba9f6586eecb5eacac70bff
 https://repo.anaconda.com/pkgs/main/linux-64/libclang-14.0.6-default_hc6dbbc7_1.conda#8f12583c4027b2861cff470f6b8837c4
 https://repo.anaconda.com/pkgs/main/linux-64/libpq-12.17-hdbd6064_0.conda#6bed363e25859faff66bf546a11c10e8
-https://repo.anaconda.com/pkgs/main/linux-64/openjpeg-2.4.0-h3ad879b_0.conda#86baecb47ecaa7f7ff2657a1f03b90c9
-https://repo.anaconda.com/pkgs/main/linux-64/python-3.9.19-h955ad1f_0.conda#33cb019c40e3409df392c99e3c34f352
-https://repo.anaconda.com/pkgs/main/linux-64/certifi-2024.2.2-py39h06a4308_0.conda#2bc1db9166ecbb968f61252e6f08c2ce
+https://repo.anaconda.com/pkgs/main/linux-64/openjpeg-2.4.0-h9ca470c_1.conda#dfd4b36eb8ddaffeca0ab412de63c3e2
+https://repo.anaconda.com/pkgs/main/linux-64/python-3.9.19-h955ad1f_1.conda#4b453281859c293c9d577271f3b18a0d
+https://repo.anaconda.com/pkgs/main/linux-64/certifi-2024.7.4-py39h06a4308_0.conda#add87fa3b69a43e4e9ea1e619b267c4b
 https://repo.anaconda.com/pkgs/main/noarch/cycler-0.11.0-pyhd3eb1b0_0.conda#f5e365d2cdb66d547eb8c3ab93843aab
+https://repo.anaconda.com/pkgs/main/linux-64/cython-3.0.10-py39h5eee18b_0.conda#1419a658ed2b4d5c3ac1964f33143b64
 https://repo.anaconda.com/pkgs/main/linux-64/exceptiongroup-1.2.0-py39h06a4308_0.conda#960e2cb83ac5134df8e593a130aa11af
 https://repo.anaconda.com/pkgs/main/noarch/execnet-1.9.0-pyhd3eb1b0_0.conda#f895937671af67cebb8af617494b3513
 https://repo.anaconda.com/pkgs/main/linux-64/glib-2.78.4-h6a678d5_0.conda#045ff487547f7b2b7ff01648681b8ebe
@@ -65,27 +67,27 @@ https://repo.anaconda.com/pkgs/main/noarch/iniconfig-1.1.1-pyhd3eb1b0_0.tar.bz2#
 https://repo.anaconda.com/pkgs/main/linux-64/joblib-1.2.0-py39h06a4308_0.conda#ac1f5687d70aa1128cbecb26bc9e559d
 https://repo.anaconda.com/pkgs/main/linux-64/kiwisolver-1.4.4-py39h6a678d5_0.conda#3d57aedbfbd054ce57fb3c1e4448828c
 https://repo.anaconda.com/pkgs/main/linux-64/mysql-5.7.24-h721c034_2.conda#dfc19ca2466d275c4c1f73b62c57f37b
-https://repo.anaconda.com/pkgs/main/linux-64/numpy-base-1.21.6-py39h375b286_0.conda#4ceaa5d6e6307fe06961d555f78b266f
-https://repo.anaconda.com/pkgs/main/linux-64/packaging-23.2-py39h06a4308_0.conda#b3f88f45f31bde016e49be3e941e5272
-https://repo.anaconda.com/pkgs/main/linux-64/pillow-10.2.0-py39h5eee18b_0.conda#fca2a1c44d16ec4b8ba71759b4ba9ba4
+https://repo.anaconda.com/pkgs/main/linux-64/ninja-1.10.2-h06a4308_5.conda#6fc219bbc4c8dbb9060b5b7fe31ae83d
+https://repo.anaconda.com/pkgs/main/linux-64/numpy-base-1.21.6-py39h375b286_1.conda#0061d9193658774ab79fc85d143a94fc
+https://repo.anaconda.com/pkgs/main/linux-64/packaging-24.1-py39h06a4308_0.conda#e80d41ffc9450162ef10cbbb9b4ec7e9
+https://repo.anaconda.com/pkgs/main/linux-64/pillow-10.3.0-py39h5eee18b_0.conda#b346d6c71267c1553b6c18d3db5fdf6d
 https://repo.anaconda.com/pkgs/main/linux-64/pluggy-1.0.0-py39h06a4308_1.conda#fb4fed11ed43cf727dbd51883cc1d9fa
 https://repo.anaconda.com/pkgs/main/linux-64/ply-3.11-py39h06a4308_0.conda#6c89bf6d2fdf6d24126e34cb83fd10f1
 https://repo.anaconda.com/pkgs/main/linux-64/pyparsing-3.0.9-py39h06a4308_0.conda#3a0537468e59760404f63b4f04369828
 https://repo.anaconda.com/pkgs/main/linux-64/pyqt5-sip-12.13.0-py39h5eee18b_0.conda#256840c3841b52346ea5743be8490ede
-https://repo.anaconda.com/pkgs/main/linux-64/setuptools-68.2.2-py39h06a4308_0.conda#5b42cae5548732ae5c167bb1066085de
+https://repo.anaconda.com/pkgs/main/linux-64/setuptools-69.5.1-py39h06a4308_0.conda#3eb144d481b39c0fbbced789dd9b76b3
 https://repo.anaconda.com/pkgs/main/noarch/six-1.16.0-pyhd3eb1b0_1.conda#34586824d411d36af2fa40e799c172d0
-https://repo.anaconda.com/pkgs/main/noarch/threadpoolctl-2.2.0-pyh0d69192_0.conda#bbfdbae4934150b902f97daaf287efe2
 https://repo.anaconda.com/pkgs/main/noarch/toml-0.10.2-pyhd3eb1b0_0.conda#cda05f5f6d8509529d1a2743288d197a
 https://repo.anaconda.com/pkgs/main/linux-64/tomli-2.0.1-py39h06a4308_0.conda#b06dffe7ddca2645ed72f5116f0a087d
-https://repo.anaconda.com/pkgs/main/linux-64/tornado-6.3.3-py39h5eee18b_0.conda#9c4bd985bb8adcd12f47e790e95a9333
-https://repo.anaconda.com/pkgs/main/linux-64/wheel-0.41.2-py39h06a4308_0.conda#ec1b8213c3585defaa6042ed2f95861d
+https://repo.anaconda.com/pkgs/main/linux-64/tornado-6.4.1-py39h5eee18b_0.conda#ec35d759636a13f934dd1610082bdbd0
+https://repo.anaconda.com/pkgs/main/linux-64/wheel-0.43.0-py39h06a4308_0.conda#40bb60408c7433d767fd8c65b35bc4a0
 https://repo.anaconda.com/pkgs/main/linux-64/coverage-7.2.2-py39h5eee18b_0.conda#e9da151b7e1f56be2cb569c65949a1d2
 https://repo.anaconda.com/pkgs/main/linux-64/dbus-1.13.18-hb2f20db_0.conda#6a6a6f1391f807847404344489ef6cf4
 https://repo.anaconda.com/pkgs/main/linux-64/gstreamer-1.14.1-h5eee18b_1.conda#f2f26e6f869b5d87f41bd059fae47c3e
-https://repo.anaconda.com/pkgs/main/linux-64/numpy-1.21.6-py39hac523dd_0.conda#a03c1fe16cf2558bca3838062c334d7d
-https://repo.anaconda.com/pkgs/main/linux-64/pip-23.3.1-py39h06a4308_0.conda#685007e3dae59d211620f19926577bd6
-https://repo.anaconda.com/pkgs/main/linux-64/pytest-7.4.0-py39h06a4308_0.conda#99d92a7a39f7e615de84f8cc5606c49a
-https://repo.anaconda.com/pkgs/main/noarch/python-dateutil-2.8.2-pyhd3eb1b0_0.conda#211ee00320b08a1ac9fea6677649f6c9
+https://repo.anaconda.com/pkgs/main/linux-64/numpy-1.21.6-py39hac523dd_1.conda#f379f92039f666828a193fadd18c9819
+https://repo.anaconda.com/pkgs/main/linux-64/pip-24.0-py39h06a4308_0.conda#7f8ce3af15cfecd12e4dda8c5cef5fb7
+https://repo.anaconda.com/pkgs/main/linux-64/pytest-7.4.4-py39h06a4308_0.conda#05ff36245067ecb0b6796a4f31a81f1c
+https://repo.anaconda.com/pkgs/main/linux-64/python-dateutil-2.9.0post0-py39h06a4308_2.conda#d6566c6d6a0140e45f22787ae58ed6e8
 https://repo.anaconda.com/pkgs/main/linux-64/sip-6.7.12-py39h6a678d5_0.conda#6988a3e12fcacfedcac523c1e4c3167c
 https://repo.anaconda.com/pkgs/main/linux-64/gst-plugins-base-1.14.1-h6a678d5_1.conda#afd9cbe949d670d24cc0a007aaec1fe1
 https://repo.anaconda.com/pkgs/main/linux-64/matplotlib-base-3.3.4-py39h62a2d02_0.conda#dbab28222c740af8e21a3e5e2882c178
@@ -96,4 +98,7 @@ https://repo.anaconda.com/pkgs/main/linux-64/pyamg-4.2.3-py39h79cecc1_0.conda#af
 https://repo.anaconda.com/pkgs/main/linux-64/qt-main-5.15.2-h53bd1ea_10.conda#bd0c79e82df6323f638bdcb871891b61
 https://repo.anaconda.com/pkgs/main/linux-64/pyqt-5.15.10-py39h6a678d5_0.conda#52da5ff9b1144b078d2f41bab0b213f2
 https://repo.anaconda.com/pkgs/main/linux-64/matplotlib-3.3.4-py39h06a4308_0.conda#384fc5e01ebfcf30e7161119d3029b5a
-# pip cython @ https://files.pythonhosted.org/packages/a7/f5/3dde4d96076888ceaa981827b098274c2b45ddd4b20d75a8cfaa92b91eec/Cython-3.0.10-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=651a15a8534ebfb9b58cb0b87c269c70984b6f9c88bfe65e4f635f0e3f07dfcd
+# pip meson @ https://files.pythonhosted.org/packages/44/b2/d4433391a7c5e94a39b50ca7295a8ceba736e7c72c455752a60122f52453/meson-1.4.1-py3-none-any.whl#sha256=d5acc3abae2dad3c70ddcbd10acac92b78b144d34d43f40f5b8ac31dfd8a826a
+# pip threadpoolctl @ https://files.pythonhosted.org/packages/61/cf/6e354304bcb9c6413c4e02a747b600061c21d38ba51e7e544ac7bc66aecc/threadpoolctl-3.1.0-py3-none-any.whl#sha256=8b99adda265feb6773280df41eece7b2e6561b772d21ffd52e372f999024907b
+# pip pyproject-metadata @ https://files.pythonhosted.org/packages/aa/5f/bb5970d3d04173b46c9037109f7f05fc8904ff5be073ee49bb6ff00301bc/pyproject_metadata-0.8.0-py3-none-any.whl#sha256=ad858d448e1d3a1fb408ac5bac9ea7743e7a8bbb472f2693aaa334d2db42f526
+# pip meson-python @ https://files.pythonhosted.org/packages/91/c0/104cb6244c83fe6bc3886f144cc433db0c0c78efac5dc00e409a5a08c87d/meson_python-0.16.0-py3-none-any.whl#sha256=842dc9f5dc29e55fc769ff1b6fe328412fe6c870220fc321060a1d2d395e69e8
diff --git a/build_tools/azure/pymin_conda_forge_mkl_environment.yml b/build_tools/azure/pymin_conda_forge_mkl_environment.yml
index fbad1d5bd42a8..a219e4b3daa8f 100644
--- a/build_tools/azure/pymin_conda_forge_mkl_environment.yml
+++ b/build_tools/azure/pymin_conda_forge_mkl_environment.yml
@@ -12,7 +12,7 @@ dependencies:
   - joblib
   - threadpoolctl
   - matplotlib
-  - pytest<8
+  - pytest
   - pytest-xdist
   - pillow
   - pip
diff --git a/build_tools/azure/pymin_conda_forge_mkl_win-64_conda.lock b/build_tools/azure/pymin_conda_forge_mkl_win-64_conda.lock
index 504376f1972aa..512b3599d8701 100644
--- a/build_tools/azure/pymin_conda_forge_mkl_win-64_conda.lock
+++ b/build_tools/azure/pymin_conda_forge_mkl_win-64_conda.lock
@@ -1,22 +1,20 @@
 # Generated by conda-lock.
 # platform: win-64
-# input_hash: 4a5b218b482447b924e82b14fd1757d34558e8e3486d07feb57c6d50002e37c7
+# input_hash: 9b46e8490ff2c4c93104b20d3bffb2d04120288c8c8680bef8376ebd9d9b8eb3
 @EXPLICIT
-https://conda.anaconda.org/conda-forge/win-64/ca-certificates-2024.2.2-h56e8100_0.conda#63da060240ab8087b60d1357051ea7d6
-https://conda.anaconda.org/conda-forge/win-64/intel-openmp-2024.1.0-h57928b3_964.conda#30ebb9fd99666d8b8675fcee541a09f3
-https://conda.anaconda.org/conda-forge/win-64/libasprintf-0.22.5-h5728263_2.conda#75a6982b9ff0a8db0f53303527b07af8
+https://conda.anaconda.org/conda-forge/win-64/ca-certificates-2024.7.4-h56e8100_0.conda#9caa97c9504072cd060cf0a3142cc0ed
+https://conda.anaconda.org/conda-forge/win-64/intel-openmp-2024.2.0-h57928b3_979.conda#192b0028299eebbc8d88624764df61f5
 https://conda.anaconda.org/conda-forge/win-64/mkl-include-2024.1.0-h66d3029_692.conda#60233966dc7c0261c9a443120b43c477
 https://conda.anaconda.org/conda-forge/win-64/msys2-conda-epoch-20160418-1.tar.bz2#b0309b72560df66f71a9d5e34a5efdfa
 https://conda.anaconda.org/conda-forge/win-64/python_abi-3.9-4_cp39.conda#948b0d93d4ab1372d8fd45e1560afd47
 https://conda.anaconda.org/conda-forge/noarch/tzdata-2024a-h0c530f3_0.conda#161081fc7cec0bfda0d86d7cb595f8d8
 https://conda.anaconda.org/conda-forge/win-64/ucrt-10.0.22621.0-h57928b3_0.tar.bz2#72608f6cd3e5898229c3ea16deb1ac43
-https://conda.anaconda.org/conda-forge/win-64/libasprintf-devel-0.22.5-h5728263_2.conda#8377da2cc31200d7181d2e48d60e4c7b
 https://conda.anaconda.org/conda-forge/win-64/m2w64-gmp-6.1.0-2.tar.bz2#53a1c73e1e3d185516d7e3af177596d9
 https://conda.anaconda.org/conda-forge/win-64/m2w64-libwinpthread-git-5.0.0.4634.697f757-2.tar.bz2#774130a326dee16f1ceb05cc687ee4f0
-https://conda.anaconda.org/conda-forge/win-64/vc14_runtime-14.38.33130-h82b7239_18.conda#8be79fdd2725ddf7bbf8a27a4c1f79ba
+https://conda.anaconda.org/conda-forge/win-64/vc14_runtime-14.40.33810-ha82c5b3_20.conda#e39cc4c34c53654ec939558993d9dc5b
 https://conda.anaconda.org/conda-forge/win-64/m2w64-gcc-libs-core-5.3.0-7.tar.bz2#4289d80fb4d272f1f3b56cfe87ac90bd
-https://conda.anaconda.org/conda-forge/win-64/vc-14.3-hcf57466_18.conda#20e1e652a4c740fa719002a8449994a2
-https://conda.anaconda.org/conda-forge/win-64/vs2015_runtime-14.38.33130-hcb4865c_18.conda#10d42885e3ed84e575b454db30f1aa93
+https://conda.anaconda.org/conda-forge/win-64/vc-14.3-h8a93ad2_20.conda#8558f367e1d7700554f7cdb823c46faf
+https://conda.anaconda.org/conda-forge/win-64/vs2015_runtime-14.40.33810-h3bf8584_20.conda#c21f1b4a3a30bbc3ef35a50957578e0e
 https://conda.anaconda.org/conda-forge/win-64/bzip2-1.0.8-hcfcfb64_5.conda#26eb8ca6ea332b675e11704cce84a3be
 https://conda.anaconda.org/conda-forge/win-64/icu-73.2-h63175ca_0.conda#0f47d9e3192d9e09ae300da0d28e0f56
 https://conda.anaconda.org/conda-forge/win-64/lerc-4.0.0-h63175ca_0.tar.bz2#1900cb3cab5055833cfddb0ba233b074
@@ -25,100 +23,96 @@ https://conda.anaconda.org/conda-forge/win-64/libdeflate-1.20-hcfcfb64_0.conda#b
 https://conda.anaconda.org/conda-forge/win-64/libffi-3.4.2-h8ffe710_5.tar.bz2#2c96d1b6915b408893f9472569dee135
 https://conda.anaconda.org/conda-forge/win-64/libiconv-1.17-hcfcfb64_2.conda#e1eb10b1cca179f2baa3601e4efc8712
 https://conda.anaconda.org/conda-forge/win-64/libjpeg-turbo-3.0.0-hcfcfb64_1.conda#3f1b948619c45b1ca714d60c7389092c
-https://conda.anaconda.org/conda-forge/win-64/libogg-1.3.4-h8ffe710_1.tar.bz2#04286d905a0dcb7f7d4a12bdfe02516d
-https://conda.anaconda.org/conda-forge/win-64/libsqlite-3.45.2-hcfcfb64_0.conda#f95359f8dc5abf7da7776ece9ef10bc5
-https://conda.anaconda.org/conda-forge/win-64/libwebp-base-1.3.2-hcfcfb64_0.conda#dcde8820959e64378d4e06147ffecfdd
-https://conda.anaconda.org/conda-forge/win-64/libzlib-1.2.13-hcfcfb64_5.conda#5fdb9c6a113b6b6cb5e517fd972d5f41
+https://conda.anaconda.org/conda-forge/win-64/libogg-1.3.5-h2466b09_0.conda#44a4d173e62c5ed6d715f18ae7c46b7a
+https://conda.anaconda.org/conda-forge/win-64/libsqlite-3.46.0-h2466b09_0.conda#951b0a3a463932e17414cd9f047fa03d
+https://conda.anaconda.org/conda-forge/win-64/libwebp-base-1.4.0-hcfcfb64_0.conda#abd61d0ab127ec5cd68f62c2969e6f34
+https://conda.anaconda.org/conda-forge/win-64/libzlib-1.3.1-h2466b09_1.conda#d4483ca8afc57ddf1f6dded53b36c17f
 https://conda.anaconda.org/conda-forge/win-64/m2w64-gcc-libgfortran-5.3.0-6.tar.bz2#066552ac6b907ec6d72c0ddab29050dc
-https://conda.anaconda.org/conda-forge/win-64/ninja-1.11.1-h91493d7_0.conda#44a99ef26178ea98626ff8e027702795
-https://conda.anaconda.org/conda-forge/win-64/openssl-3.2.1-hcfcfb64_1.conda#958e0418e93e50c575bff70fbcaa12d8
+https://conda.anaconda.org/conda-forge/win-64/ninja-1.12.1-hc790b64_0.conda#a557dde55343e03c68cd7e29e7f87279
+https://conda.anaconda.org/conda-forge/win-64/openssl-3.3.1-h2466b09_1.conda#aa36aca82d1ffd26bee88ac7dc9e1ee3
 https://conda.anaconda.org/conda-forge/win-64/pthreads-win32-2.9.1-hfa6e2cd_3.tar.bz2#e2da8758d7d51ff6aa78a14dfb9dbed4
 https://conda.anaconda.org/conda-forge/win-64/tk-8.6.13-h5226925_1.conda#fc048363eb8f03cd1737600a5d08aafe
 https://conda.anaconda.org/conda-forge/win-64/xz-5.2.6-h8d14728_0.tar.bz2#515d77642eaa3639413c6b1bc3f94219
-https://conda.anaconda.org/conda-forge/win-64/krb5-1.21.2-heb0366b_0.conda#6e8b0f22b4eef3b3cb3849bb4c3d47f9
+https://conda.anaconda.org/conda-forge/win-64/krb5-1.21.3-hdf4eb48_0.conda#31aec030344e962fbd7dbbbbd68e60a9
 https://conda.anaconda.org/conda-forge/win-64/libbrotlidec-1.1.0-hcfcfb64_1.conda#19ce3e1dacc7912b3d6ff40690ba9ae0
 https://conda.anaconda.org/conda-forge/win-64/libbrotlienc-1.1.0-hcfcfb64_1.conda#71e890a0b361fd58743a13f77e1506b7
 https://conda.anaconda.org/conda-forge/win-64/libintl-0.22.5-h5728263_2.conda#aa622c938af057adc119f8b8eecada01
 https://conda.anaconda.org/conda-forge/win-64/libpng-1.6.43-h19919ed_0.conda#77e398acc32617a0384553aea29e866b
 https://conda.anaconda.org/conda-forge/win-64/libvorbis-1.3.7-h0e60522_0.tar.bz2#e1a22282de0169c93e4ffe6ce6acc212
-https://conda.anaconda.org/conda-forge/win-64/libxml2-2.12.6-hc3477c8_1.conda#eb9f59dd51f50f5aa369813fa63ba569
+https://conda.anaconda.org/conda-forge/win-64/libxml2-2.12.7-h283a6d9_1.conda#7ab2653cc21c44a1370ef3b409261b3d
 https://conda.anaconda.org/conda-forge/win-64/m2w64-gcc-libs-5.3.0-7.tar.bz2#fe759119b8b3bfa720b8762c6fdc35de
-https://conda.anaconda.org/conda-forge/win-64/pcre2-10.43-h17e33f8_0.conda#d0485b8aa2cedb141a7bd27b4efa4c9c
+https://conda.anaconda.org/conda-forge/win-64/pcre2-10.44-h3d7b363_0.conda#007d07ab5027e0bf49f6fa660a9f89a0
 https://conda.anaconda.org/conda-forge/win-64/python-3.9.19-h4de0772_0_cpython.conda#b6999bc275e0e6beae7b1c8ea0be1e85
-https://conda.anaconda.org/conda-forge/win-64/zstd-1.5.5-h12be248_0.conda#792bb5da68bf0a6cac6a6072ecb8dbeb
+https://conda.anaconda.org/conda-forge/win-64/zstd-1.5.6-h0ea2cb4_0.conda#9a17230f95733c04dc40a2b1e5491d74
 https://conda.anaconda.org/conda-forge/win-64/brotli-bin-1.1.0-hcfcfb64_1.conda#0105229d7c5fabaa840043a86c10ec64
-https://conda.anaconda.org/conda-forge/noarch/certifi-2024.2.2-pyhd8ed1ab_0.conda#0876280e409658fc6f9e75d035960333
+https://conda.anaconda.org/conda-forge/noarch/certifi-2024.6.2-pyhd8ed1ab_0.conda#8821ec1c8fcdc9e1d291d7b9f6e9968a
 https://conda.anaconda.org/conda-forge/noarch/colorama-0.4.6-pyhd8ed1ab_0.tar.bz2#3faab06a954c2a04039983f2c4a50d99
 https://conda.anaconda.org/conda-forge/noarch/cycler-0.12.1-pyhd8ed1ab_0.conda#5cd86562580f274031ede6aa6aa24441
 https://conda.anaconda.org/conda-forge/win-64/cython-3.0.10-py39h99910a6_0.conda#8ebc2fca8a6840d0694f37e698f4e59c
 https://conda.anaconda.org/conda-forge/noarch/exceptiongroup-1.2.0-pyhd8ed1ab_2.conda#8d652ea2ee8eaee02ed8dc820bc794aa
-https://conda.anaconda.org/conda-forge/noarch/execnet-2.1.0-pyhd8ed1ab_0.conda#7a4b32fbe5442e46841ec77695e36d96
+https://conda.anaconda.org/conda-forge/noarch/execnet-2.1.1-pyhd8ed1ab_0.conda#15dda3cdbf330abfe9f555d22f66db46
 https://conda.anaconda.org/conda-forge/win-64/freetype-2.12.1-hdaf720e_2.conda#3761b23693f768dc75a8fd0a73ca053f
-https://conda.anaconda.org/conda-forge/win-64/gettext-tools-0.22.5-h7d00a51_2.conda#ef1c3bb48c013099c4872640a5f2096c
 https://conda.anaconda.org/conda-forge/noarch/iniconfig-2.0.0-pyhd8ed1ab_0.conda#f800d2da156d08e289b14e87e43c1ae5
 https://conda.anaconda.org/conda-forge/win-64/kiwisolver-1.4.5-py39h1f6ef14_1.conda#4fc5bd0a7b535252028c647cc27d6c87
-https://conda.anaconda.org/conda-forge/win-64/libclang13-18.1.3-default_hf64faad_0.conda#9217c37b478ec601af909aafc954a6fc
-https://conda.anaconda.org/conda-forge/win-64/libgettextpo-0.22.5-h5728263_2.conda#f4c826b19bf1ccee2a63a2c685039728
-https://conda.anaconda.org/conda-forge/win-64/libglib-2.80.0-h39d0aa6_3.conda#6ed359e5ae622059d4d2306328314bf5
-https://conda.anaconda.org/conda-forge/win-64/libhwloc-2.9.3-default_haede6df_1009.conda#87da045f6d26ce9fe20ad76a18f6a18a
+https://conda.anaconda.org/conda-forge/win-64/libclang13-18.1.8-default_ha5278ca_0.conda#2f4204ba38a8654b132e5ae03287efb8
+https://conda.anaconda.org/conda-forge/win-64/libglib-2.80.3-h7025463_1.conda#53c80e0ed9a3905ca7047c03756a5caa
+https://conda.anaconda.org/conda-forge/win-64/libhwloc-2.11.0-default_h8125262_1000.conda#065e86390dcd9304259ad8b627f724bd
 https://conda.anaconda.org/conda-forge/win-64/libintl-devel-0.22.5-h5728263_2.conda#a2ad82fae23975e4ccbfab2847d31d48
 https://conda.anaconda.org/conda-forge/win-64/libtiff-4.6.0-hddb2be6_3.conda#6d1828c9039929e2f185c5fa9d133018
 https://conda.anaconda.org/conda-forge/noarch/munkres-1.1.4-pyh9f0ad1d_0.tar.bz2#2ba8498c1018c1e9c61eb99b973dfe19
-https://conda.anaconda.org/conda-forge/noarch/packaging-24.0-pyhd8ed1ab_0.conda#248f521b64ce055e7feae3105e7abeb8
-https://conda.anaconda.org/conda-forge/noarch/pluggy-1.4.0-pyhd8ed1ab_0.conda#139e9feb65187e916162917bb2484976
+https://conda.anaconda.org/conda-forge/noarch/packaging-24.1-pyhd8ed1ab_0.conda#cbe1bb1f21567018ce595d9c2be0f0db
+https://conda.anaconda.org/conda-forge/noarch/pluggy-1.5.0-pyhd8ed1ab_0.conda#d3483c8fc2dc2cc3f5cf43e26d60cabf
 https://conda.anaconda.org/conda-forge/noarch/ply-3.11-pyhd8ed1ab_2.conda#18c6deb6f9602e32446398203c8f0e91
 https://conda.anaconda.org/conda-forge/win-64/pthread-stubs-0.4-hcd874cb_1001.tar.bz2#a1f820480193ea83582b13249a7e7bd9
 https://conda.anaconda.org/conda-forge/noarch/pyparsing-3.1.2-pyhd8ed1ab_0.conda#b9a4dacf97241704529131a0dfc0494f
-https://conda.anaconda.org/conda-forge/noarch/setuptools-69.2.0-pyhd8ed1ab_0.conda#da214ecd521a720a9d521c68047682dc
+https://conda.anaconda.org/conda-forge/noarch/setuptools-70.1.1-pyhd8ed1ab_0.conda#985e9e86e1b0fc75a74a9bfab9309ef7
 https://conda.anaconda.org/conda-forge/noarch/six-1.16.0-pyh6c4a22f_0.tar.bz2#e5f25f8dbc060e9a8d912e432202afc2
-https://conda.anaconda.org/conda-forge/noarch/threadpoolctl-3.4.0-pyhc1e730c_0.conda#b296278eef667c673bf51de6535bad88
+https://conda.anaconda.org/conda-forge/noarch/threadpoolctl-3.5.0-pyhc1e730c_0.conda#df68d78237980a159bd7149f33c0e8fd
 https://conda.anaconda.org/conda-forge/noarch/toml-0.10.2-pyhd8ed1ab_0.tar.bz2#f832c45a477c78bebd107098db465095
 https://conda.anaconda.org/conda-forge/noarch/tomli-2.0.1-pyhd8ed1ab_0.tar.bz2#5844808ffab9ebdb694585b50ba02a96
-https://conda.anaconda.org/conda-forge/win-64/tornado-6.4-py39ha55989b_0.conda#d8f52e8e1d02f9a5901f9224e2ddf98f
+https://conda.anaconda.org/conda-forge/win-64/tornado-6.4.1-py39ha55e580_0.conda#7d1e87f3036af858ce7e248489c3faec
 https://conda.anaconda.org/conda-forge/win-64/unicodedata2-15.1.0-py39ha55989b_0.conda#20ec896e8d97f2ff8be1124e624dc8f2
 https://conda.anaconda.org/conda-forge/noarch/wheel-0.43.0-pyhd8ed1ab_1.conda#0b5293a157c2b5cd513dd1b03d8d3aae
 https://conda.anaconda.org/conda-forge/win-64/xorg-libxau-1.0.11-hcd874cb_0.conda#c46ba8712093cb0114404ae8a7582e1a
 https://conda.anaconda.org/conda-forge/win-64/xorg-libxdmcp-1.1.3-hcd874cb_0.tar.bz2#46878ebb6b9cbd8afcf8088d7ef00ece
-https://conda.anaconda.org/conda-forge/noarch/zipp-3.17.0-pyhd8ed1ab_0.conda#2e4d6bc0b14e10f895fc6791a7d9b26a
+https://conda.anaconda.org/conda-forge/noarch/zipp-3.19.2-pyhd8ed1ab_0.conda#49808e59df5535116f6878b2a820d6f4
 https://conda.anaconda.org/conda-forge/win-64/brotli-1.1.0-hcfcfb64_1.conda#f47f6db2528e38321fb00ae31674c133
-https://conda.anaconda.org/conda-forge/win-64/coverage-7.4.4-py39ha55989b_0.conda#ca4fca57e0e713af82c73a9e6c5b9716
-https://conda.anaconda.org/conda-forge/win-64/glib-tools-2.80.0-h0a98069_3.conda#baef876a13714d6b0c86b25b233d410c
+https://conda.anaconda.org/conda-forge/win-64/coverage-7.5.4-py39ha55e580_0.conda#1407b17a896e4d64913f72a99c607353
+https://conda.anaconda.org/conda-forge/win-64/glib-tools-2.80.3-h4394cf3_1.conda#12d270a5f8b8ae0a9536c1960f21e0aa
 https://conda.anaconda.org/conda-forge/noarch/importlib_resources-6.4.0-pyhd8ed1ab_0.conda#c5d3907ad8bd7bf557521a1833cf7e6d
-https://conda.anaconda.org/conda-forge/noarch/joblib-1.3.2-pyhd8ed1ab_0.conda#4da50d410f553db77e62ab62ffaa1abc
+https://conda.anaconda.org/conda-forge/noarch/joblib-1.4.2-pyhd8ed1ab_0.conda#25df261d4523d9f9783bcdb7208d872f
 https://conda.anaconda.org/conda-forge/win-64/lcms2-2.16-h67d730c_0.conda#d3592435917b62a8becff3a60db674f6
-https://conda.anaconda.org/conda-forge/win-64/libgettextpo-devel-0.22.5-h5728263_2.conda#6f42ec61abc6d52a4079800a640319c5
-https://conda.anaconda.org/conda-forge/win-64/libxcb-1.15-hcd874cb_0.conda#090d91b69396f14afef450c285f9758c
-https://conda.anaconda.org/conda-forge/noarch/meson-1.4.0-pyhd8ed1ab_0.conda#52a0660cfa40b45bf254ecc3374cb2e0
+https://conda.anaconda.org/conda-forge/win-64/libxcb-1.16-hcd874cb_0.conda#7c1217d3b075f195ab17370f2d550f5d
+https://conda.anaconda.org/conda-forge/noarch/meson-1.4.1-pyhd8ed1ab_0.conda#714ca123839eeebb25d12b443067ea64
 https://conda.anaconda.org/conda-forge/win-64/openjpeg-2.5.2-h3d672ee_0.conda#7e7099ad94ac3b599808950cec30ad4e
 https://conda.anaconda.org/conda-forge/noarch/pip-24.0-pyhd8ed1ab_0.conda#f586ac1e56c8638b64f9c8122a7b8a67
-https://conda.anaconda.org/conda-forge/noarch/pyproject-metadata-0.7.1-pyhd8ed1ab_0.conda#dcb27826ffc94d5f04e241322239983b
-https://conda.anaconda.org/conda-forge/noarch/pytest-7.4.4-pyhd8ed1ab_0.conda#a9d145de8c5f064b5fa68fb34725d9f4
+https://conda.anaconda.org/conda-forge/noarch/pyproject-metadata-0.8.0-pyhd8ed1ab_0.conda#573fe09d7bd0cd4bcc210d8369b5ca47
+https://conda.anaconda.org/conda-forge/noarch/pytest-8.2.2-pyhd8ed1ab_0.conda#0f3f49c22c7ef3a1195fa61dad3c43be
 https://conda.anaconda.org/conda-forge/noarch/python-dateutil-2.9.0-pyhd8ed1ab_0.conda#2cf4264fffb9e6eff6031c5b6884d61c
 https://conda.anaconda.org/conda-forge/win-64/sip-6.7.12-py39h99910a6_0.conda#0cc5774390ada632ed7975203057c91c
-https://conda.anaconda.org/conda-forge/win-64/tbb-2021.11.0-h91493d7_1.conda#21069f3ed16812f9f4f2700667b6ec86
-https://conda.anaconda.org/conda-forge/win-64/fonttools-4.51.0-py39ha55989b_0.conda#5d19302bab29e347116b743e793aa7d6
-https://conda.anaconda.org/conda-forge/win-64/gettext-0.22.5-h5728263_2.conda#da84216f88a8c89eb943c683ceb34d7d
-https://conda.anaconda.org/conda-forge/win-64/glib-2.80.0-h39d0aa6_3.conda#53b689f4e44aaa40923441920fc18114
+https://conda.anaconda.org/conda-forge/win-64/tbb-2021.12.0-hc790b64_2.conda#3d6620dda0ba48d457fb722adfad5963
+https://conda.anaconda.org/conda-forge/win-64/fonttools-4.53.1-py39ha55e580_0.conda#81bbae03542e491178a620a45ad0b474
+https://conda.anaconda.org/conda-forge/win-64/glib-2.80.3-h7025463_1.conda#13ce8fd2eb07f41c7108f7ad7bb0062e
 https://conda.anaconda.org/conda-forge/noarch/importlib-resources-6.4.0-pyhd8ed1ab_0.conda#dcbadab7a68738a028e195ab68ab2d2e
-https://conda.anaconda.org/conda-forge/noarch/meson-python-0.15.0-pyh0c530f3_0.conda#3bc64565ca78ce3bb80248d09926d8f9
+https://conda.anaconda.org/conda-forge/noarch/meson-python-0.16.0-pyh0c530f3_0.conda#e16f0dbf502da873be9f9adb0dc52547
 https://conda.anaconda.org/conda-forge/win-64/mkl-2024.1.0-h66d3029_692.conda#b43ec7ed045323edeff31e348eea8652
-https://conda.anaconda.org/conda-forge/win-64/pillow-10.3.0-py39h9ee4981_0.conda#6d69d57c41867acc162ef0205a8efaef
+https://conda.anaconda.org/conda-forge/win-64/pillow-10.4.0-py39hfa8c767_0.conda#7b24bccfb14f05019c8a488d4ee084a8
 https://conda.anaconda.org/conda-forge/win-64/pyqt5-sip-12.12.2-py39h99910a6_5.conda#dffbcea794c524c471772a5f697c2aea
 https://conda.anaconda.org/conda-forge/noarch/pytest-cov-5.0.0-pyhd8ed1ab_0.conda#c54c0107057d67ddf077751339ec2c63
-https://conda.anaconda.org/conda-forge/noarch/pytest-xdist-3.5.0-pyhd8ed1ab_0.conda#d5f595da2daead898ca958ac62f0307b
-https://conda.anaconda.org/conda-forge/win-64/gstreamer-1.24.1-hb4038d2_1.conda#8a6dfe53ad02a3b151e6383a950043ee
+https://conda.anaconda.org/conda-forge/noarch/pytest-xdist-3.6.1-pyhd8ed1ab_0.conda#b39568655c127a9c4a44d178ac99b6d0
+https://conda.anaconda.org/conda-forge/win-64/gstreamer-1.24.5-h5006eae_0.conda#5f5d9ef53cd63a2bf341091786d031e5
 https://conda.anaconda.org/conda-forge/win-64/libblas-3.9.0-22_win64_mkl.conda#65c56ecdeceffd6c32d3d54db7e02c6e
 https://conda.anaconda.org/conda-forge/win-64/mkl-devel-2024.1.0-h57928b3_692.conda#9b3d1d4916a56fd32460f6fe784dcb51
-https://conda.anaconda.org/conda-forge/win-64/gst-plugins-base-1.24.1-h001b923_1.conda#7900eb39e6203249accb52fb705a2fb0
+https://conda.anaconda.org/conda-forge/win-64/gst-plugins-base-1.24.5-hb0a98b8_0.conda#b770c056a4d17c9860ffa6464982db70
 https://conda.anaconda.org/conda-forge/win-64/libcblas-3.9.0-22_win64_mkl.conda#336c93ab102846c6131cf68e722a68f1
 https://conda.anaconda.org/conda-forge/win-64/liblapack-3.9.0-22_win64_mkl.conda#c752cc2af9f3d8d7b2fdebb915a33ef7
 https://conda.anaconda.org/conda-forge/win-64/liblapacke-3.9.0-22_win64_mkl.conda#db33ffa4bae1d2f6d5602afaa048bf6b
-https://conda.anaconda.org/conda-forge/win-64/numpy-1.26.4-py39hddb5d58_0.conda#6e30ff8f2d3f59f45347dfba8bc22a04
-https://conda.anaconda.org/conda-forge/win-64/qt-main-5.15.8-hcef0176_21.conda#76544d3dfeff8fd52250df168cb0005b
+https://conda.anaconda.org/conda-forge/win-64/numpy-2.0.0-py39h60232e0_0.conda#a0e44751d8bc67ef2932d832304872a9
+https://conda.anaconda.org/conda-forge/win-64/qt-main-5.15.8-h06adc49_22.conda#919650dc31edac6a17a99157aec4f87c
 https://conda.anaconda.org/conda-forge/win-64/blas-devel-3.9.0-22_win64_mkl.conda#adeb834f3b7b06f3d77cd90b7c9d08f0
 https://conda.anaconda.org/conda-forge/win-64/contourpy-1.2.1-py39h1f6ef14_0.conda#03e25c6bae87f4f9595337255b44b0fb
 https://conda.anaconda.org/conda-forge/win-64/pyqt-5.15.9-py39hb77abff_5.conda#5ed899124a51958336371ff01482b8fd
-https://conda.anaconda.org/conda-forge/win-64/scipy-1.13.0-py39hddb5d58_0.conda#cfe749056fb9ed9dbc096b5751becf34
+https://conda.anaconda.org/conda-forge/win-64/scipy-1.13.1-py39h1a10956_0.conda#9f8e571406af04d2f5fdcbecec704505
 https://conda.anaconda.org/conda-forge/win-64/blas-2.122-mkl.conda#aee642435696de144ddf91dc02101cf8
-https://conda.anaconda.org/conda-forge/win-64/matplotlib-base-3.8.3-py39hf19769e_0.conda#e7a42adb568586ff4035d7ef2d06c4b1
-https://conda.anaconda.org/conda-forge/win-64/matplotlib-3.8.3-py39hcbf5309_0.conda#a4b5946f68ecaed034fa849b8d639e63
+https://conda.anaconda.org/conda-forge/win-64/matplotlib-base-3.8.4-py39he1095e7_2.conda#5c813b5da86f186d8026b6de6429c212
+https://conda.anaconda.org/conda-forge/win-64/matplotlib-3.8.4-py39hcbf5309_2.conda#1ecee90b529cb69ec4e95add23323110
diff --git a/build_tools/azure/pymin_conda_forge_openblas_ubuntu_2204_environment.yml b/build_tools/azure/pymin_conda_forge_openblas_ubuntu_2204_environment.yml
index 855909a2c262a..38737e7c9c0b0 100644
--- a/build_tools/azure/pymin_conda_forge_openblas_ubuntu_2204_environment.yml
+++ b/build_tools/azure/pymin_conda_forge_openblas_ubuntu_2204_environment.yml
@@ -14,7 +14,7 @@ dependencies:
   - matplotlib
   - pandas
   - pyamg
-  - pytest<8
+  - pytest
   - pytest-xdist
   - pillow
   - pip
diff --git a/build_tools/azure/pymin_conda_forge_openblas_ubuntu_2204_linux-64_conda.lock b/build_tools/azure/pymin_conda_forge_openblas_ubuntu_2204_linux-64_conda.lock
index 0b492f9472b7c..b02022f415cf8 100644
--- a/build_tools/azure/pymin_conda_forge_openblas_ubuntu_2204_linux-64_conda.lock
+++ b/build_tools/azure/pymin_conda_forge_openblas_ubuntu_2204_linux-64_conda.lock
@@ -1,53 +1,44 @@
 # Generated by conda-lock.
 # platform: linux-64
-# input_hash: 10cb97dbddc53d186aedde20d0f8fe610a929d2ebcd3741c4eebdca4bac05de4
+# input_hash: be96a61e1a8c45c41b04e6e30fafbbf78e5b05202b348a702c726eced7c7df48
 @EXPLICIT
 https://conda.anaconda.org/conda-forge/linux-64/_libgcc_mutex-0.1-conda_forge.tar.bz2#d7c89558ba9fa0495403155b64376d81
-https://conda.anaconda.org/conda-forge/linux-64/ca-certificates-2024.2.2-hbcca054_0.conda#2f4327a1cbe7f022401b236e915a5fef
+https://conda.anaconda.org/conda-forge/linux-64/ca-certificates-2024.7.4-hbcca054_0.conda#23ab7665c5f63cfb9f1f6195256daac6
 https://conda.anaconda.org/conda-forge/noarch/font-ttf-dejavu-sans-mono-2.37-hab24e00_0.tar.bz2#0c96522c6bdaed4b1566d11387caaf45
 https://conda.anaconda.org/conda-forge/noarch/font-ttf-inconsolata-3.000-h77eed37_0.tar.bz2#34893075a5c9e55cdafac56607368fc6
 https://conda.anaconda.org/conda-forge/noarch/font-ttf-source-code-pro-2.038-h77eed37_0.tar.bz2#4d59c254e01d9cde7957100457e2d5fb
-https://conda.anaconda.org/conda-forge/noarch/font-ttf-ubuntu-0.83-h77eed37_1.conda#6185f640c43843e5ad6fd1c5372c3f80
-https://conda.anaconda.org/conda-forge/linux-64/ld_impl_linux-64-2.40-h41732ed_0.conda#7aca3059a1729aa76c597603f10b0dd3
-https://conda.anaconda.org/conda-forge/linux-64/libstdcxx-ng-13.2.0-h7e041cc_5.conda#f6f6600d18a4047b54f803cf708b868a
+https://conda.anaconda.org/conda-forge/noarch/font-ttf-ubuntu-0.83-h77eed37_2.conda#cbbe59391138ea5ad3658c76912e147f
+https://conda.anaconda.org/conda-forge/linux-64/ld_impl_linux-64-2.40-hf3520f5_7.conda#b80f2f396ca2c28b8c14c437a4ed1e74
 https://conda.anaconda.org/conda-forge/linux-64/python_abi-3.9-4_cp39.conda#bfe4b3259a8ac6cdf0037752904da6a7
 https://conda.anaconda.org/conda-forge/noarch/tzdata-2024a-h0c530f3_0.conda#161081fc7cec0bfda0d86d7cb595f8d8
 https://conda.anaconda.org/conda-forge/noarch/fonts-conda-forge-1-0.tar.bz2#f766549260d6815b0c52253f1fb1bb29
 https://conda.anaconda.org/conda-forge/noarch/fonts-conda-ecosystem-1-0.tar.bz2#fee5683a3f04bd15cbd8318b096a27ab
 https://conda.anaconda.org/conda-forge/linux-64/_openmp_mutex-4.5-2_kmp_llvm.tar.bz2#562b26ba2e19059551a811e72ab7f793
-https://conda.anaconda.org/conda-forge/linux-64/libgcc-ng-13.2.0-h807b86a_5.conda#d4ff227c46917d3b4565302a2bbb276b
-https://conda.anaconda.org/conda-forge/linux-64/alsa-lib-1.2.11-hd590300_1.conda#0bb492cca54017ea314b809b1ee3a176
+https://conda.anaconda.org/conda-forge/linux-64/libgcc-ng-14.1.0-h77fa898_0.conda#ca0fad6a41ddaef54a153b78eccb5037
+https://conda.anaconda.org/conda-forge/linux-64/alsa-lib-1.2.12-h4ab18f5_0.conda#7ed427f0871fd41cb1d9c17727c17589
 https://conda.anaconda.org/conda-forge/linux-64/attr-2.5.1-h166bdaf_1.tar.bz2#d9c69a24ad678ffce24c6543a0176b00
 https://conda.anaconda.org/conda-forge/linux-64/bzip2-1.0.8-hd590300_5.conda#69b8b6202a07720f448be700e300ccf4
 https://conda.anaconda.org/conda-forge/linux-64/gettext-tools-0.22.5-h59595ed_2.conda#985f2f453fb72408d6b6f1be0f324033
-https://conda.anaconda.org/conda-forge/linux-64/graphite2-1.3.13-h59595ed_1003.conda#f87c7b7c2cb45f323ffbce941c78ab7c
-https://conda.anaconda.org/conda-forge/linux-64/icu-73.2-h59595ed_0.conda#cc47e1facc155f91abd89b11e48e72ff
 https://conda.anaconda.org/conda-forge/linux-64/keyutils-1.6.1-h166bdaf_0.tar.bz2#30186d27e2c9fa62b45fb1476b7200e3
 https://conda.anaconda.org/conda-forge/linux-64/lame-3.100-h166bdaf_1003.tar.bz2#a8832b479f93521a9e7b5b743803be51
-https://conda.anaconda.org/conda-forge/linux-64/lerc-4.0.0-h27087fc_0.tar.bz2#76bbff344f0134279f225174e9064c8f
-https://conda.anaconda.org/conda-forge/linux-64/libasprintf-0.22.5-h661eb56_2.conda#dd197c968bf9760bba0031888d431ede
 https://conda.anaconda.org/conda-forge/linux-64/libbrotlicommon-1.1.0-hd590300_1.conda#aec6c91c7371c26392a06708a73c70e5
 https://conda.anaconda.org/conda-forge/linux-64/libdeflate-1.20-hd590300_0.conda#8e88f9389f1165d7c0936fe40d9a9a79
 https://conda.anaconda.org/conda-forge/linux-64/libexpat-2.6.2-h59595ed_0.conda#e7ba12deb7020dd080c6c70e7b6f6a3d
 https://conda.anaconda.org/conda-forge/linux-64/libffi-3.4.2-h7f98852_5.tar.bz2#d645c6d2ac96843a2bfaccd2d62b3ac3
 https://conda.anaconda.org/conda-forge/linux-64/libgettextpo-0.22.5-h59595ed_2.conda#172bcc51059416e7ce99e7b528cede83
-https://conda.anaconda.org/conda-forge/linux-64/libgfortran5-13.2.0-ha4646dd_5.conda#7a6bd7a12a4bd359e2afe6c0fa1acace
+https://conda.anaconda.org/conda-forge/linux-64/libgfortran5-14.1.0-hc5f4f2c_0.conda#6456c2620c990cd8dde2428a27ba0bc5
 https://conda.anaconda.org/conda-forge/linux-64/libiconv-1.17-hd590300_2.conda#d66573916ffcf376178462f1b61c941e
 https://conda.anaconda.org/conda-forge/linux-64/libjpeg-turbo-3.0.0-hd590300_1.conda#ea25936bb4080d843790b586850f82b8
 https://conda.anaconda.org/conda-forge/linux-64/libnsl-2.0.1-hd590300_0.conda#30fd6e37fe21f86f4bd26d6ee73eeec7
-https://conda.anaconda.org/conda-forge/linux-64/libogg-1.3.4-h7f98852_1.tar.bz2#6e8cc2173440d77708196c5b93771680
+https://conda.anaconda.org/conda-forge/linux-64/libogg-1.3.5-h4ab18f5_0.conda#601bfb4b3c6f0b844443bb81a56651e0
 https://conda.anaconda.org/conda-forge/linux-64/libopus-1.3.1-h7f98852_1.tar.bz2#15345e56d527b330e1cacbdf58676e8f
+https://conda.anaconda.org/conda-forge/linux-64/libstdcxx-ng-14.1.0-hc0a3c3a_0.conda#1cb187a157136398ddbaae90713e2498
 https://conda.anaconda.org/conda-forge/linux-64/libuuid-2.38.1-h0b41bf4_0.conda#40b61aab5c7ba9ff276c41cfffe6b80b
-https://conda.anaconda.org/conda-forge/linux-64/libwebp-base-1.3.2-hd590300_0.conda#30de3fd9b3b602f7473f30e684eeea8c
+https://conda.anaconda.org/conda-forge/linux-64/libwebp-base-1.4.0-hd590300_0.conda#b26e8aa824079e1be0294e7152ca4559
 https://conda.anaconda.org/conda-forge/linux-64/libxcrypt-4.4.36-hd590300_1.conda#5aa797f8787fe7a17d1b0821485b5adc
-https://conda.anaconda.org/conda-forge/linux-64/libzlib-1.2.13-hd590300_5.conda#f36c115f1ee199da648e0597ec2047ad
-https://conda.anaconda.org/conda-forge/linux-64/lz4-c-1.9.4-hcb278e6_0.conda#318b08df404f9c9be5712aaa5a6f0bb0
-https://conda.anaconda.org/conda-forge/linux-64/mpg123-1.32.6-h59595ed_0.conda#9160cdeb523a1b20cf8d2a0bf821f45d
-https://conda.anaconda.org/conda-forge/linux-64/ncurses-6.4.20240210-h59595ed_0.conda#97da8860a0da5413c7c98a3b3838a645
-https://conda.anaconda.org/conda-forge/linux-64/ninja-1.11.1-h924138e_0.conda#73a4953a2d9c115bdc10ff30a52f675f
-https://conda.anaconda.org/conda-forge/linux-64/nspr-4.35-h27087fc_0.conda#da0ec11a6454ae19bff5b02ed881a2b1
-https://conda.anaconda.org/conda-forge/linux-64/openssl-3.2.1-hd590300_1.conda#9d731343cff6ee2e5a25c4a091bf8e2a
-https://conda.anaconda.org/conda-forge/linux-64/pixman-0.43.2-h59595ed_0.conda#71004cbf7924e19c02746ccde9fd7123
+https://conda.anaconda.org/conda-forge/linux-64/libzlib-1.3.1-h4ab18f5_1.conda#57d7dc60e9325e3de37ff8dffd18e814
+https://conda.anaconda.org/conda-forge/linux-64/ncurses-6.5-h59595ed_0.conda#fcea371545eda051b6deafb24889fc69
+https://conda.anaconda.org/conda-forge/linux-64/openssl-3.3.1-h4ab18f5_1.conda#b1e9d076f14e8d776213fd5047b4c3d9
 https://conda.anaconda.org/conda-forge/linux-64/pthread-stubs-0.4-h36c2ea0_1001.tar.bz2#22dad4df6e8630e8dff2428f6f6a7036
 https://conda.anaconda.org/conda-forge/linux-64/xorg-kbproto-1.0.7-h7f98852_1002.tar.bz2#4b230e8381279d76131116660f5a241a
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libice-1.1.1-hd590300_0.conda#b462a33c0be1421532f28bfe8f4a7514
@@ -59,147 +50,162 @@ https://conda.anaconda.org/conda-forge/linux-64/xorg-xf86vidmodeproto-2.3.1-h7f9
 https://conda.anaconda.org/conda-forge/linux-64/xorg-xproto-7.0.31-h7f98852_1007.tar.bz2#b4a4381d54784606820704f7b5f05a15
 https://conda.anaconda.org/conda-forge/linux-64/xz-5.2.6-h166bdaf_0.tar.bz2#2161070d867d1b1204ea749c8eec4ef0
 https://conda.anaconda.org/conda-forge/linux-64/expat-2.6.2-h59595ed_0.conda#53fb86322bdb89496d7579fe3f02fd61
-https://conda.anaconda.org/conda-forge/linux-64/libasprintf-devel-0.22.5-h661eb56_2.conda#02e41ab5834dcdcc8590cf29d9526f50
+https://conda.anaconda.org/conda-forge/linux-64/graphite2-1.3.13-h59595ed_1003.conda#f87c7b7c2cb45f323ffbce941c78ab7c
+https://conda.anaconda.org/conda-forge/linux-64/icu-73.2-h59595ed_0.conda#cc47e1facc155f91abd89b11e48e72ff
+https://conda.anaconda.org/conda-forge/linux-64/lerc-4.0.0-h27087fc_0.tar.bz2#76bbff344f0134279f225174e9064c8f
+https://conda.anaconda.org/conda-forge/linux-64/libasprintf-0.22.5-h661eb56_2.conda#dd197c968bf9760bba0031888d431ede
 https://conda.anaconda.org/conda-forge/linux-64/libbrotlidec-1.1.0-hd590300_1.conda#f07002e225d7a60a694d42a7bf5ff53f
 https://conda.anaconda.org/conda-forge/linux-64/libbrotlienc-1.1.0-hd590300_1.conda#5fc11c6020d421960607d821310fcd4d
 https://conda.anaconda.org/conda-forge/linux-64/libcap-2.69-h0f662aa_0.conda#25cb5999faa414e5ccb2c1388f62d3d5
 https://conda.anaconda.org/conda-forge/linux-64/libedit-3.1.20191231-he28a2e2_2.tar.bz2#4d331e44109e3f0e19b4cb8f9b82f3e1
 https://conda.anaconda.org/conda-forge/linux-64/libevent-2.1.12-hf998b51_1.conda#a1cfcc585f0c42bf8d5546bb1dfb668d
 https://conda.anaconda.org/conda-forge/linux-64/libgettextpo-devel-0.22.5-h59595ed_2.conda#b63d9b6da3653179a278077f0de20014
-https://conda.anaconda.org/conda-forge/linux-64/libgfortran-ng-13.2.0-h69a702a_5.conda#e73e9cfd1191783392131e6238bdb3e9
+https://conda.anaconda.org/conda-forge/linux-64/libgfortran-ng-14.1.0-h69a702a_0.conda#f4ca84fbd6d06b0a052fb2d5b96dde41
 https://conda.anaconda.org/conda-forge/linux-64/libpng-1.6.43-h2797004_0.conda#009981dd9cfcaa4dbfa25ffaed86bcae
-https://conda.anaconda.org/conda-forge/linux-64/libsqlite-3.45.2-h2797004_0.conda#866983a220e27a80cb75e85cb30466a1
+https://conda.anaconda.org/conda-forge/linux-64/libsqlite-3.46.0-hde9e2c9_0.conda#18aa975d2094c34aef978060ae7da7d8
 https://conda.anaconda.org/conda-forge/linux-64/libvorbis-1.3.7-h9c3ff4c_0.tar.bz2#309dec04b70a3cc0f1e84a4013683bc0
-https://conda.anaconda.org/conda-forge/linux-64/libxcb-1.15-h0b41bf4_0.conda#33277193f5b92bad9fdd230eb700929c
-https://conda.anaconda.org/conda-forge/linux-64/libxml2-2.12.6-h232c23b_1.conda#6853448e9ca1cfd5f15382afd2a6d123
+https://conda.anaconda.org/conda-forge/linux-64/libxcb-1.16-hd590300_0.conda#151cba22b85a989c2d6ef9633ffee1e4
+https://conda.anaconda.org/conda-forge/linux-64/lz4-c-1.9.4-hcb278e6_0.conda#318b08df404f9c9be5712aaa5a6f0bb0
+https://conda.anaconda.org/conda-forge/linux-64/mpg123-1.32.6-h59595ed_0.conda#9160cdeb523a1b20cf8d2a0bf821f45d
 https://conda.anaconda.org/conda-forge/linux-64/mysql-common-8.3.0-hf1915f5_4.conda#784a4df6676c581ca624fbe460703a6d
-https://conda.anaconda.org/conda-forge/linux-64/pcre2-10.43-hcad00b1_0.conda#8292dea9e022d9610a11fce5e0896ed8
+https://conda.anaconda.org/conda-forge/linux-64/ninja-1.12.1-h297d8ca_0.conda#3aa1c7e292afeff25a0091ddd7c69b72
+https://conda.anaconda.org/conda-forge/linux-64/nspr-4.35-h27087fc_0.conda#da0ec11a6454ae19bff5b02ed881a2b1
+https://conda.anaconda.org/conda-forge/linux-64/pcre2-10.44-h0f59acf_0.conda#3914f7ac1761dce57102c72ca7c35d01
+https://conda.anaconda.org/conda-forge/linux-64/pixman-0.43.2-h59595ed_0.conda#71004cbf7924e19c02746ccde9fd7123
 https://conda.anaconda.org/conda-forge/linux-64/readline-8.2-h8228510_1.conda#47d31b792659ce70f470b5c82fdfb7a4
 https://conda.anaconda.org/conda-forge/linux-64/tk-8.6.13-noxft_h4845f30_101.conda#d453b98d9c83e71da0741bb0ff4d76bc
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libsm-1.2.4-h7391055_0.conda#93ee23f12bc2e684548181256edd2cf6
-https://conda.anaconda.org/conda-forge/linux-64/zlib-1.2.13-hd590300_5.conda#68c34ec6149623be41a1933ab996a209
-https://conda.anaconda.org/conda-forge/linux-64/zstd-1.5.5-hfc55251_0.conda#04b88013080254850d6c01ed54810589
+https://conda.anaconda.org/conda-forge/linux-64/zlib-1.3.1-h4ab18f5_1.conda#9653f1bf3766164d0e65fa723cabbc54
+https://conda.anaconda.org/conda-forge/linux-64/zstd-1.5.6-ha6fb4c9_0.conda#4d056880988120e29d75bfff282e0f45
 https://conda.anaconda.org/conda-forge/linux-64/brotli-bin-1.1.0-hd590300_1.conda#39f910d205726805a958da408ca194ba
 https://conda.anaconda.org/conda-forge/linux-64/freetype-2.12.1-h267a509_2.conda#9ae35c3d96db2c94ce0cef86efdfa2cb
-https://conda.anaconda.org/conda-forge/linux-64/gettext-0.22.5-h59595ed_2.conda#219ba82e95d7614cf7140d2a4afc0926
-https://conda.anaconda.org/conda-forge/linux-64/krb5-1.21.2-h659d440_0.conda#cd95826dbd331ed1be26bdf401432844
-https://conda.anaconda.org/conda-forge/linux-64/libglib-2.80.0-hf2295e7_3.conda#569d25ad54594080778abff56a611dc7
+https://conda.anaconda.org/conda-forge/linux-64/krb5-1.21.3-h659f571_0.conda#3f43953b7d3fb3aaa1d0d0723d91e368
+https://conda.anaconda.org/conda-forge/linux-64/libasprintf-devel-0.22.5-h661eb56_2.conda#02e41ab5834dcdcc8590cf29d9526f50
+https://conda.anaconda.org/conda-forge/linux-64/libglib-2.80.3-h8a4344b_1.conda#6ea440297aacee4893f02ad759e6ffbc
 https://conda.anaconda.org/conda-forge/linux-64/libhiredis-1.0.2-h2cc385e_0.tar.bz2#b34907d3a81a3cd8095ee83d174c074a
-https://conda.anaconda.org/conda-forge/linux-64/libllvm15-15.0.7-hb3ce162_4.conda#8a35df3cbc0c8b12cc8af9473ae75eef
-https://conda.anaconda.org/conda-forge/linux-64/libllvm18-18.1.3-h2448989_0.conda#927b6d6e80b2c0d4405a58b61ca248a3
 https://conda.anaconda.org/conda-forge/linux-64/libopenblas-0.3.27-pthreads_h413a1c8_0.conda#a356024784da6dfd4683dc5ecf45b155
 https://conda.anaconda.org/conda-forge/linux-64/libtiff-4.6.0-h1dd3fc0_3.conda#66f03896ffbe1a110ffda05c7a856504
-https://conda.anaconda.org/conda-forge/linux-64/llvm-openmp-18.1.2-h4dfa4b3_0.conda#0118c8a03e3dbbb6b348ef71e94ac7af
+https://conda.anaconda.org/conda-forge/linux-64/libxml2-2.12.7-hc051c1a_1.conda#340278ded8b0dc3a73f3660bbb0adbc6
+https://conda.anaconda.org/conda-forge/linux-64/llvm-openmp-18.1.8-hf5423f3_0.conda#322be9d39e030673e105b0abb320514e
 https://conda.anaconda.org/conda-forge/linux-64/mysql-libs-8.3.0-hca2cd23_4.conda#1b50eebe2a738a3146c154d2eceaa8b6
-https://conda.anaconda.org/conda-forge/linux-64/nss-3.98-h1d7d5a4_0.conda#54b56c2fdf973656b748e0378900ec13
+https://conda.anaconda.org/conda-forge/linux-64/nss-3.102-h593d115_0.conda#40e5e48c55a45621c4399ca9236406b7
 https://conda.anaconda.org/conda-forge/linux-64/python-3.9.19-h0755675_0_cpython.conda#d9ee3647fbd9e8595b8df759b2bbefb8
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-0.4.0-hd590300_1.conda#9bfac7ccd94d54fd21a0501296d60424
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-keysyms-0.4.0-h8ee46fc_1.conda#632413adcd8bc16b515cab87a2932913
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-renderutil-0.3.9-hd590300_1.conda#e995b155d938b6779da6ace6c6b13816
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-wm-0.4.1-h8ee46fc_1.conda#90108a432fb5c6150ccfee3f03388656
-https://conda.anaconda.org/conda-forge/linux-64/xorg-libx11-1.8.9-h8ee46fc_0.conda#077b6e8ad6a3ddb741fce2496dd01bec
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-0.4.1-hb711507_2.conda#8637c3e5821654d0edf97e2b0404b443
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-keysyms-0.4.1-hb711507_0.conda#ad748ccca349aec3e91743e08b5e2b50
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-renderutil-0.3.10-hb711507_0.conda#0e0cbe0564d03a99afd5fd7b362feecd
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-wm-0.4.2-hb711507_0.conda#608e0ef8256b81d04456e8d211eee3e8
+https://conda.anaconda.org/conda-forge/linux-64/xorg-libx11-1.8.9-hb711507_1.conda#4a6d410296d7e39f00bacdee7df046e9
 https://conda.anaconda.org/conda-forge/noarch/alabaster-0.7.16-pyhd8ed1ab_0.conda#def531a3ac77b7fb8c21d17bb5d0badb
 https://conda.anaconda.org/conda-forge/linux-64/brotli-1.1.0-hd590300_1.conda#f27a24d46e3ea7b70a1f98e50c62508f
 https://conda.anaconda.org/conda-forge/linux-64/brotli-python-1.1.0-py39h3d6467e_1.conda#c48418c8b35f1d59ae9ae1174812b40a
-https://conda.anaconda.org/conda-forge/linux-64/ccache-4.9.1-h1fcd64f_0.conda#3620f564bcf28c3524951b6f64f5c5ac
-https://conda.anaconda.org/conda-forge/noarch/certifi-2024.2.2-pyhd8ed1ab_0.conda#0876280e409658fc6f9e75d035960333
+https://conda.anaconda.org/conda-forge/linux-64/ccache-4.10.1-h065aff2_0.conda#d6b48c138e0c8170a6fe9c136e063540
+https://conda.anaconda.org/conda-forge/noarch/certifi-2024.6.2-pyhd8ed1ab_0.conda#8821ec1c8fcdc9e1d291d7b9f6e9968a
 https://conda.anaconda.org/conda-forge/noarch/charset-normalizer-3.3.2-pyhd8ed1ab_0.conda#7f4a9e3fcff3f6356ae99244a014da6a
 https://conda.anaconda.org/conda-forge/noarch/colorama-0.4.6-pyhd8ed1ab_0.tar.bz2#3faab06a954c2a04039983f2c4a50d99
 https://conda.anaconda.org/conda-forge/noarch/cycler-0.12.1-pyhd8ed1ab_0.conda#5cd86562580f274031ede6aa6aa24441
 https://conda.anaconda.org/conda-forge/linux-64/cython-3.0.10-py39h3d6467e_0.conda#76b5d215fb735a6dc43010ffbe78040e
 https://conda.anaconda.org/conda-forge/linux-64/dbus-1.13.6-h5008d03_3.tar.bz2#ecfff944ba3960ecb334b9a2663d708d
-https://conda.anaconda.org/conda-forge/linux-64/docutils-0.20.1-py39hf3d152e_3.conda#09a48956e1c155907fd0d626f3e80f2e
+https://conda.anaconda.org/conda-forge/noarch/docutils-0.21.2-pyhd8ed1ab_0.conda#e8cd5d629f65bdf0f3bb312cde14659e
 https://conda.anaconda.org/conda-forge/noarch/exceptiongroup-1.2.0-pyhd8ed1ab_2.conda#8d652ea2ee8eaee02ed8dc820bc794aa
-https://conda.anaconda.org/conda-forge/noarch/execnet-2.1.0-pyhd8ed1ab_0.conda#7a4b32fbe5442e46841ec77695e36d96
+https://conda.anaconda.org/conda-forge/noarch/execnet-2.1.1-pyhd8ed1ab_0.conda#15dda3cdbf330abfe9f555d22f66db46
 https://conda.anaconda.org/conda-forge/linux-64/fontconfig-2.14.2-h14ed4e7_0.conda#0f69b688f52ff6da70bccb7ff7001d1d
-https://conda.anaconda.org/conda-forge/linux-64/glib-tools-2.80.0-hde27a5a_3.conda#d544517494d9008c0b1021213aec4084
-https://conda.anaconda.org/conda-forge/noarch/idna-3.6-pyhd8ed1ab_0.conda#1a76f09108576397c41c0b0c5bd84134
+https://conda.anaconda.org/conda-forge/linux-64/gettext-0.22.5-h59595ed_2.conda#219ba82e95d7614cf7140d2a4afc0926
+https://conda.anaconda.org/conda-forge/linux-64/glib-tools-2.80.3-h73ef956_1.conda#99701cdc9a25a333d15265d1d243b2dc
+https://conda.anaconda.org/conda-forge/noarch/hpack-4.0.0-pyh9f0ad1d_0.tar.bz2#914d6646c4dbb1fd3ff539830a12fd71
+https://conda.anaconda.org/conda-forge/noarch/hyperframe-6.0.1-pyhd8ed1ab_0.tar.bz2#9f765cbfab6870c8435b9eefecd7a1f4
+https://conda.anaconda.org/conda-forge/noarch/idna-3.7-pyhd8ed1ab_0.conda#c0cc1420498b17414d8617d0b9f506ca
 https://conda.anaconda.org/conda-forge/noarch/imagesize-1.4.1-pyhd8ed1ab_0.tar.bz2#7de5386c8fea29e76b303f37dde4c352
 https://conda.anaconda.org/conda-forge/noarch/iniconfig-2.0.0-pyhd8ed1ab_0.conda#f800d2da156d08e289b14e87e43c1ae5
 https://conda.anaconda.org/conda-forge/linux-64/kiwisolver-1.4.5-py39h7633fee_1.conda#c9f74d717e5a2847a9f8b779c54130f2
 https://conda.anaconda.org/conda-forge/linux-64/lcms2-2.16-hb7c19ff_0.conda#51bb7010fc86f70eee639b4bb7a894f5
 https://conda.anaconda.org/conda-forge/linux-64/libblas-3.9.0-22_linux64_openblas.conda#1a2a0cd3153464fee6646f3dd6dad9b8
-https://conda.anaconda.org/conda-forge/linux-64/libclang-cpp15-15.0.7-default_h127d8a8_5.conda#d0a9633b53cdc319b8a1a532ae7822b8
-https://conda.anaconda.org/conda-forge/linux-64/libclang13-18.1.3-default_h5d6823c_0.conda#5fff487759736b275dc3e4a263cac666
 https://conda.anaconda.org/conda-forge/linux-64/libcups-2.3.3-h4637d8d_4.conda#d4529f4dff3057982a7617c7ac58fde3
-https://conda.anaconda.org/conda-forge/linux-64/libflac-1.4.3-h59595ed_0.conda#ee48bf17cc83a00f59ca1494d5646869
-https://conda.anaconda.org/conda-forge/linux-64/libgpg-error-1.48-h71f35ed_0.conda#4d18d86916705d352d5f4adfb7f0edd3
-https://conda.anaconda.org/conda-forge/linux-64/libpq-16.2-h33b98f1_1.conda#9e49ec2a61d02623b379dc332eb6889d
+https://conda.anaconda.org/conda-forge/linux-64/libllvm15-15.0.7-hb3ce162_4.conda#8a35df3cbc0c8b12cc8af9473ae75eef
+https://conda.anaconda.org/conda-forge/linux-64/libllvm18-18.1.8-hc9dba70_0.conda#f94ed0c5953c78dcca7adb953f4c5bfb
+https://conda.anaconda.org/conda-forge/linux-64/libpq-16.3-ha72fbe1_0.conda#bac737ae28b79cfbafd515258d97d29e
 https://conda.anaconda.org/conda-forge/linux-64/markupsafe-2.1.5-py39hd1e30aa_0.conda#9a9a22eb1f83c44953319ee3b027769f
 https://conda.anaconda.org/conda-forge/noarch/munkres-1.1.4-pyh9f0ad1d_0.tar.bz2#2ba8498c1018c1e9c61eb99b973dfe19
 https://conda.anaconda.org/conda-forge/linux-64/openblas-0.3.27-pthreads_h7a3da1a_0.conda#4b422ebe8fc6a5320d0c1c22e5a46032
 https://conda.anaconda.org/conda-forge/linux-64/openjpeg-2.5.2-h488ebb8_0.conda#7f2e286780f072ed750df46dc2631138
-https://conda.anaconda.org/conda-forge/noarch/packaging-24.0-pyhd8ed1ab_0.conda#248f521b64ce055e7feae3105e7abeb8
-https://conda.anaconda.org/conda-forge/noarch/pluggy-1.4.0-pyhd8ed1ab_0.conda#139e9feb65187e916162917bb2484976
+https://conda.anaconda.org/conda-forge/noarch/packaging-24.1-pyhd8ed1ab_0.conda#cbe1bb1f21567018ce595d9c2be0f0db
+https://conda.anaconda.org/conda-forge/noarch/pluggy-1.5.0-pyhd8ed1ab_0.conda#d3483c8fc2dc2cc3f5cf43e26d60cabf
 https://conda.anaconda.org/conda-forge/noarch/ply-3.11-pyhd8ed1ab_2.conda#18c6deb6f9602e32446398203c8f0e91
-https://conda.anaconda.org/conda-forge/noarch/pygments-2.17.2-pyhd8ed1ab_0.conda#140a7f159396547e9799aa98f9f0742e
+https://conda.anaconda.org/conda-forge/noarch/pycparser-2.22-pyhd8ed1ab_0.conda#844d9eb3b43095b031874477f7d70088
+https://conda.anaconda.org/conda-forge/noarch/pygments-2.18.0-pyhd8ed1ab_0.conda#b7f5c092b8f9800150d998a71b76d5a1
 https://conda.anaconda.org/conda-forge/noarch/pyparsing-3.1.2-pyhd8ed1ab_0.conda#b9a4dacf97241704529131a0dfc0494f
 https://conda.anaconda.org/conda-forge/noarch/pysocks-1.7.1-pyha2e5f31_6.tar.bz2#2a7de29fb590ca14b5243c4c812c8025
 https://conda.anaconda.org/conda-forge/noarch/python-tzdata-2024.1-pyhd8ed1ab_0.conda#98206ea9954216ee7540f0c773f2104d
 https://conda.anaconda.org/conda-forge/noarch/pytz-2024.1-pyhd8ed1ab_0.conda#3eeeeb9e4827ace8c0c1419c85d590ad
-https://conda.anaconda.org/conda-forge/noarch/setuptools-69.2.0-pyhd8ed1ab_0.conda#da214ecd521a720a9d521c68047682dc
+https://conda.anaconda.org/conda-forge/noarch/setuptools-70.1.1-pyhd8ed1ab_0.conda#985e9e86e1b0fc75a74a9bfab9309ef7
 https://conda.anaconda.org/conda-forge/noarch/six-1.16.0-pyh6c4a22f_0.tar.bz2#e5f25f8dbc060e9a8d912e432202afc2
 https://conda.anaconda.org/conda-forge/noarch/snowballstemmer-2.2.0-pyhd8ed1ab_0.tar.bz2#4d22a9315e78c6827f806065957d566e
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-jsmath-1.0.1-pyhd8ed1ab_0.conda#da1d979339e2714c30a8e806a33ec087
 https://conda.anaconda.org/conda-forge/noarch/tabulate-0.9.0-pyhd8ed1ab_1.tar.bz2#4759805cce2d914c38472f70bf4d8bcb
-https://conda.anaconda.org/conda-forge/noarch/threadpoolctl-3.4.0-pyhc1e730c_0.conda#b296278eef667c673bf51de6535bad88
+https://conda.anaconda.org/conda-forge/noarch/threadpoolctl-3.5.0-pyhc1e730c_0.conda#df68d78237980a159bd7149f33c0e8fd
 https://conda.anaconda.org/conda-forge/noarch/toml-0.10.2-pyhd8ed1ab_0.tar.bz2#f832c45a477c78bebd107098db465095
 https://conda.anaconda.org/conda-forge/noarch/tomli-2.0.1-pyhd8ed1ab_0.tar.bz2#5844808ffab9ebdb694585b50ba02a96
-https://conda.anaconda.org/conda-forge/linux-64/tornado-6.4-py39hd1e30aa_0.conda#1e865e9188204cdfb1fd2531780add88
+https://conda.anaconda.org/conda-forge/linux-64/tornado-6.4.1-py39hd3abc70_0.conda#c183e99f9320e5e2d0f9c43efcb3fb22
 https://conda.anaconda.org/conda-forge/linux-64/unicodedata2-15.1.0-py39hd1e30aa_0.conda#1da984bbb6e765743e13388ba7b7b2c8
 https://conda.anaconda.org/conda-forge/noarch/wheel-0.43.0-pyhd8ed1ab_1.conda#0b5293a157c2b5cd513dd1b03d8d3aae
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-image-0.4.0-h8ee46fc_1.conda#9d7bcddf49cbf727730af10e71022c73
-https://conda.anaconda.org/conda-forge/linux-64/xkeyboard-config-2.41-hd590300_0.conda#81f740407b45e3f9047b3174fa94eb9e
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-image-0.4.0-hb711507_2.conda#a0901183f08b6c7107aab109733a3c91
+https://conda.anaconda.org/conda-forge/linux-64/xkeyboard-config-2.42-h4ab18f5_0.conda#b193af204da1bfb8c13882d131a14bd2
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libxext-1.3.4-h0b41bf4_2.conda#82b6df12252e6f32402b96dacc656fec
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libxrender-0.9.11-hd590300_0.conda#ed67c36f215b310412b2af935bf3e530
-https://conda.anaconda.org/conda-forge/noarch/zipp-3.17.0-pyhd8ed1ab_0.conda#2e4d6bc0b14e10f895fc6791a7d9b26a
+https://conda.anaconda.org/conda-forge/noarch/zipp-3.19.2-pyhd8ed1ab_0.conda#49808e59df5535116f6878b2a820d6f4
 https://conda.anaconda.org/conda-forge/noarch/babel-2.14.0-pyhd8ed1ab_0.conda#9669586875baeced8fc30c0826c3270e
-https://conda.anaconda.org/conda-forge/linux-64/cairo-1.18.0-h3faef2a_0.conda#f907bb958910dc404647326ca80c263e
-https://conda.anaconda.org/conda-forge/linux-64/fonttools-4.51.0-py39hd1e30aa_0.conda#79f5dd8778873faa54e8f7b2729fe8a6
-https://conda.anaconda.org/conda-forge/linux-64/glib-2.80.0-hf2295e7_3.conda#1ade62526144055f05c3eb45ebae3b5b
-https://conda.anaconda.org/conda-forge/noarch/importlib-metadata-7.1.0-pyha770c72_0.conda#0896606848b2dc5cebdf111b6543aa04
+https://conda.anaconda.org/conda-forge/linux-64/cairo-1.18.0-hbb29018_2.conda#b6d90276c5aee9b4407dd94eb0cd40a8
+https://conda.anaconda.org/conda-forge/linux-64/cffi-1.16.0-py39h7a31438_0.conda#ac992767d7f8ed2cb27e71e78f0fb2d7
+https://conda.anaconda.org/conda-forge/linux-64/fonttools-4.53.1-py39hcd6043d_0.conda#297804eca6ea16a835a869699095de1c
+https://conda.anaconda.org/conda-forge/linux-64/glib-2.80.3-h8a4344b_1.conda#a3acc4920c9ca19cb6b295028d606477
+https://conda.anaconda.org/conda-forge/noarch/h2-4.1.0-pyhd8ed1ab_0.tar.bz2#b748fbf7060927a6e82df7cb5ee8f097
+https://conda.anaconda.org/conda-forge/noarch/importlib-metadata-8.0.0-pyha770c72_0.conda#3286556cdd99048d198f72c3f6f69103
 https://conda.anaconda.org/conda-forge/noarch/importlib_resources-6.4.0-pyhd8ed1ab_0.conda#c5d3907ad8bd7bf557521a1833cf7e6d
-https://conda.anaconda.org/conda-forge/noarch/jinja2-3.1.3-pyhd8ed1ab_0.conda#e7d8df6509ba635247ff9aea31134262
-https://conda.anaconda.org/conda-forge/noarch/joblib-1.3.2-pyhd8ed1ab_0.conda#4da50d410f553db77e62ab62ffaa1abc
+https://conda.anaconda.org/conda-forge/noarch/jinja2-3.1.4-pyhd8ed1ab_0.conda#7b86ecb7d3557821c649b3c31e3eb9f2
+https://conda.anaconda.org/conda-forge/noarch/joblib-1.4.2-pyhd8ed1ab_0.conda#25df261d4523d9f9783bcdb7208d872f
 https://conda.anaconda.org/conda-forge/linux-64/libcblas-3.9.0-22_linux64_openblas.conda#4b31699e0ec5de64d5896e580389c9a1
-https://conda.anaconda.org/conda-forge/linux-64/libgcrypt-1.10.3-hd590300_0.conda#32d16ad533c59bb0a3c5ffaf16110829
+https://conda.anaconda.org/conda-forge/linux-64/libclang-cpp15-15.0.7-default_h127d8a8_5.conda#d0a9633b53cdc319b8a1a532ae7822b8
+https://conda.anaconda.org/conda-forge/linux-64/libclang13-18.1.8-default_h6ae225f_0.conda#28ad2db5c14d2e23d7962b8389e2cc0b
+https://conda.anaconda.org/conda-forge/linux-64/libflac-1.4.3-h59595ed_0.conda#ee48bf17cc83a00f59ca1494d5646869
+https://conda.anaconda.org/conda-forge/linux-64/libgpg-error-1.50-h4f305b6_0.conda#0d7ff1a8e69565ca3add6925e18e708f
 https://conda.anaconda.org/conda-forge/linux-64/liblapack-3.9.0-22_linux64_openblas.conda#b083767b6c877e24ee597d93b87ab838
-https://conda.anaconda.org/conda-forge/linux-64/libsndfile-1.2.2-hc60ed4a_1.conda#ef1910918dd895516a769ed36b5b3a4e
-https://conda.anaconda.org/conda-forge/linux-64/libxkbcommon-1.7.0-h662e7e4_0.conda#b32c0da42b1f24a98577bb3d7fc0b995
-https://conda.anaconda.org/conda-forge/noarch/meson-1.4.0-pyhd8ed1ab_0.conda#52a0660cfa40b45bf254ecc3374cb2e0
-https://conda.anaconda.org/conda-forge/linux-64/pillow-10.3.0-py39h90c7501_0.conda#1e3b6af9592be71ce19f0a6aae05d97b
+https://conda.anaconda.org/conda-forge/linux-64/libxkbcommon-1.7.0-h2c5496b_1.conda#e2eaefa4de2b7237af7c907b8bbc760a
+https://conda.anaconda.org/conda-forge/noarch/meson-1.4.1-pyhd8ed1ab_0.conda#714ca123839eeebb25d12b443067ea64
+https://conda.anaconda.org/conda-forge/linux-64/pillow-10.4.0-py39h16a7006_0.conda#d9a6b19174a6cf5185296b16f781951f
 https://conda.anaconda.org/conda-forge/noarch/pip-24.0-pyhd8ed1ab_0.conda#f586ac1e56c8638b64f9c8122a7b8a67
-https://conda.anaconda.org/conda-forge/noarch/pyproject-metadata-0.7.1-pyhd8ed1ab_0.conda#dcb27826ffc94d5f04e241322239983b
-https://conda.anaconda.org/conda-forge/noarch/pytest-7.4.4-pyhd8ed1ab_0.conda#a9d145de8c5f064b5fa68fb34725d9f4
+https://conda.anaconda.org/conda-forge/noarch/pyproject-metadata-0.8.0-pyhd8ed1ab_0.conda#573fe09d7bd0cd4bcc210d8369b5ca47
+https://conda.anaconda.org/conda-forge/noarch/pytest-8.2.2-pyhd8ed1ab_0.conda#0f3f49c22c7ef3a1195fa61dad3c43be
 https://conda.anaconda.org/conda-forge/noarch/python-dateutil-2.9.0-pyhd8ed1ab_0.conda#2cf4264fffb9e6eff6031c5b6884d61c
 https://conda.anaconda.org/conda-forge/linux-64/sip-6.7.12-py39h3d6467e_0.conda#e667a3ab0df62c54e60e1843d2e6defb
-https://conda.anaconda.org/conda-forge/noarch/urllib3-2.2.1-pyhd8ed1ab_0.conda#08807a87fa7af10754d46f63b368e016
-https://conda.anaconda.org/conda-forge/linux-64/gstreamer-1.24.1-h98fc4e7_1.conda#b04b5cdf3ba01430db27979250bc5a1d
-https://conda.anaconda.org/conda-forge/linux-64/harfbuzz-8.3.0-h3d44ed6_0.conda#5a6f6c00ef982a9bc83558d9ac8f64a0
+https://conda.anaconda.org/conda-forge/linux-64/gstreamer-1.24.5-haf2f30d_0.conda#c5252c02592373fa8caf5a5327165a89
+https://conda.anaconda.org/conda-forge/linux-64/harfbuzz-8.5.0-hfac3d4d_0.conda#f5126317dd0ce0ba26945e411ecc6960
 https://conda.anaconda.org/conda-forge/noarch/importlib-resources-6.4.0-pyhd8ed1ab_0.conda#dcbadab7a68738a028e195ab68ab2d2e
+https://conda.anaconda.org/conda-forge/linux-64/libgcrypt-1.11.0-h4ab18f5_0.conda#0a00e32cabe3e571c0611387e7bc2042
 https://conda.anaconda.org/conda-forge/linux-64/liblapacke-3.9.0-22_linux64_openblas.conda#1fd156abd41a4992835952f6f4d951d0
-https://conda.anaconda.org/conda-forge/linux-64/libsystemd0-255-h3516f8a_1.conda#3366af27f0b593544a6cd453c7932ac5
-https://conda.anaconda.org/conda-forge/noarch/meson-python-0.15.0-pyh0c530f3_0.conda#3bc64565ca78ce3bb80248d09926d8f9
-https://conda.anaconda.org/conda-forge/linux-64/numpy-1.26.4-py39h474f0d3_0.conda#aa265f5697237aa13cc10f53fa8acc4f
+https://conda.anaconda.org/conda-forge/linux-64/libsndfile-1.2.2-hc60ed4a_1.conda#ef1910918dd895516a769ed36b5b3a4e
+https://conda.anaconda.org/conda-forge/noarch/meson-python-0.16.0-pyh0c530f3_0.conda#e16f0dbf502da873be9f9adb0dc52547
+https://conda.anaconda.org/conda-forge/linux-64/numpy-2.0.0-py39ha0965c0_0.conda#b411be2728ba5711fc9bcdb0efa2db71
 https://conda.anaconda.org/conda-forge/linux-64/pyqt5-sip-12.12.2-py39h3d6467e_5.conda#93aff412f3e49fdb43361c0215cbd72d
-https://conda.anaconda.org/conda-forge/noarch/pytest-xdist-3.5.0-pyhd8ed1ab_0.conda#d5f595da2daead898ca958ac62f0307b
-https://conda.anaconda.org/conda-forge/noarch/requests-2.31.0-pyhd8ed1ab_0.conda#a30144e4156cdbb236f99ebb49828f8b
+https://conda.anaconda.org/conda-forge/noarch/pytest-xdist-3.6.1-pyhd8ed1ab_0.conda#b39568655c127a9c4a44d178ac99b6d0
+https://conda.anaconda.org/conda-forge/linux-64/zstandard-0.22.0-py39h81c9582_1.conda#c1dd22d67b1f8cef888b64b688b71ffd
 https://conda.anaconda.org/conda-forge/linux-64/blas-devel-3.9.0-22_linux64_openblas.conda#63ddb593595c9cf5eb08d3de54d66df8
 https://conda.anaconda.org/conda-forge/linux-64/contourpy-1.2.1-py39h7633fee_0.conda#bdc188e59857d6efab332714e0d01d93
-https://conda.anaconda.org/conda-forge/linux-64/gst-plugins-base-1.24.1-hfa15dee_1.conda#a6dd2bbc684913e2bef0a54ce56fcbfb
-https://conda.anaconda.org/conda-forge/linux-64/pandas-2.2.1-py39hddac248_0.conda#85293a042c24a08e71b7608ee66b6134
-https://conda.anaconda.org/conda-forge/linux-64/pulseaudio-client-17.0-hb77b528_0.conda#07f45f1be1c25345faddb8db0de8039b
-https://conda.anaconda.org/conda-forge/linux-64/scipy-1.13.0-py39h474f0d3_0.conda#46ae0ecba9726ab4fa44c78fefa522cf
+https://conda.anaconda.org/conda-forge/linux-64/gst-plugins-base-1.24.5-hbaaba92_0.conda#4a485842570569ba754863b2c083b346
+https://conda.anaconda.org/conda-forge/linux-64/libsystemd0-255-h3516f8a_1.conda#3366af27f0b593544a6cd453c7932ac5
+https://conda.anaconda.org/conda-forge/linux-64/pandas-2.2.2-py39hfc16268_1.conda#8b23d2b425035a7468d17e6fe1d54124
+https://conda.anaconda.org/conda-forge/linux-64/scipy-1.13.1-py39haf93ffa_0.conda#492a2cd65862d16a4aaf535ae9ccb761
+https://conda.anaconda.org/conda-forge/noarch/urllib3-2.2.2-pyhd8ed1ab_1.conda#e804c43f58255e977093a2298e442bb8
 https://conda.anaconda.org/conda-forge/linux-64/blas-2.122-openblas.conda#5065468105542a8b23ea47bd8b6fa55f
-https://conda.anaconda.org/conda-forge/linux-64/matplotlib-base-3.8.3-py39he9076e7_0.conda#5456bdfe5809ebf5689eda6c808b686e
-https://conda.anaconda.org/conda-forge/linux-64/pyamg-5.1.0-py39hda80f44_0.conda#f225666c47726329201b604060f1436c
-https://conda.anaconda.org/conda-forge/linux-64/qt-main-5.15.8-hc9dc06e_21.conda#b325046180590c868ce0dbf267b82eb8
+https://conda.anaconda.org/conda-forge/linux-64/matplotlib-base-3.8.4-py39h10d1fc8_2.conda#c9fb6571b93b1dd490ea627af7344f36
+https://conda.anaconda.org/conda-forge/linux-64/pulseaudio-client-17.0-hb77b528_0.conda#07f45f1be1c25345faddb8db0de8039b
+https://conda.anaconda.org/conda-forge/linux-64/pyamg-5.2.1-py39h85c637f_0.conda#0bfaf33b7ebdbadc77bf9a67e281c0b1
+https://conda.anaconda.org/conda-forge/noarch/requests-2.32.3-pyhd8ed1ab_0.conda#5ede4753180c7a550a443c430dc8ab52
+https://conda.anaconda.org/conda-forge/linux-64/qt-main-5.15.8-ha2b5568_22.conda#15de976572f24032540236006d6d0e9f
 https://conda.anaconda.org/conda-forge/linux-64/pyqt-5.15.9-py39h52134e7_5.conda#e1f148e57d071b09187719df86f513c1
-https://conda.anaconda.org/conda-forge/linux-64/matplotlib-3.8.3-py39hf3d152e_0.conda#983f5b77540eb5aa00238e72ec9b1dfb
-https://conda.anaconda.org/conda-forge/noarch/numpydoc-1.7.0-pyhd8ed1ab_0.conda#1ad3afced398492586ca1bef70328be4
+https://conda.anaconda.org/conda-forge/linux-64/matplotlib-3.8.4-py39hf3d152e_2.conda#bd956c7563b6a6b27521b83623c74e22
+https://conda.anaconda.org/conda-forge/noarch/numpydoc-1.7.0-pyhd8ed1ab_1.conda#66798cbfdcb003d9fbccd92cd08eb3ac
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-applehelp-1.0.8-pyhd8ed1ab_0.conda#611a35a27914fac3aa37611a6fe40bb5
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-devhelp-1.0.6-pyhd8ed1ab_0.conda#d7e4954df0d3aea2eacc7835ad12671d
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-htmlhelp-2.0.5-pyhd8ed1ab_0.conda#7e1e7437273682ada2ed5e9e9714b140
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-qthelp-1.0.7-pyhd8ed1ab_0.conda#26acae54b06f178681bfb551760f5dd1
-https://conda.anaconda.org/conda-forge/noarch/sphinx-7.2.6-pyhd8ed1ab_0.conda#bbfd1120d1824d2d073bc65935f0e4c0
+https://conda.anaconda.org/conda-forge/noarch/sphinx-7.3.7-pyhd8ed1ab_0.conda#7b1465205e28d75d2c0e1a868ee00a67
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-serializinghtml-1.1.10-pyhd8ed1ab_0.conda#e507335cb4ca9cff4c3d0fa9cdab255e
diff --git a/build_tools/azure/pypy3_linux-64_conda.lock b/build_tools/azure/pypy3_linux-64_conda.lock
deleted file mode 100644
index 3f898e992efd9..0000000000000
--- a/build_tools/azure/pypy3_linux-64_conda.lock
+++ /dev/null
@@ -1,103 +0,0 @@
-# Generated by conda-lock.
-# platform: linux-64
-# input_hash: c4b15c5bfeffe4d558e4ece0c996e6cc04c00369326c72d19780ffc0209bd591
-@EXPLICIT
-https://conda.anaconda.org/conda-forge/linux-64/_libgcc_mutex-0.1-conda_forge.tar.bz2#d7c89558ba9fa0495403155b64376d81
-https://conda.anaconda.org/conda-forge/linux-64/ca-certificates-2024.2.2-hbcca054_0.conda#2f4327a1cbe7f022401b236e915a5fef
-https://conda.anaconda.org/conda-forge/linux-64/libstdcxx-ng-13.2.0-h7e041cc_5.conda#f6f6600d18a4047b54f803cf708b868a
-https://conda.anaconda.org/conda-forge/linux-64/python_abi-3.9-4_pypy39_pp73.conda#c1b2f29111681a4036ed21eaa3f44620
-https://conda.anaconda.org/conda-forge/noarch/tzdata-2024a-h0c530f3_0.conda#161081fc7cec0bfda0d86d7cb595f8d8
-https://conda.anaconda.org/conda-forge/linux-64/_openmp_mutex-4.5-2_kmp_llvm.tar.bz2#562b26ba2e19059551a811e72ab7f793
-https://conda.anaconda.org/conda-forge/linux-64/libgcc-ng-13.2.0-h807b86a_5.conda#d4ff227c46917d3b4565302a2bbb276b
-https://conda.anaconda.org/conda-forge/linux-64/bzip2-1.0.8-hd590300_5.conda#69b8b6202a07720f448be700e300ccf4
-https://conda.anaconda.org/conda-forge/linux-64/lerc-4.0.0-h27087fc_0.tar.bz2#76bbff344f0134279f225174e9064c8f
-https://conda.anaconda.org/conda-forge/linux-64/libbrotlicommon-1.1.0-hd590300_1.conda#aec6c91c7371c26392a06708a73c70e5
-https://conda.anaconda.org/conda-forge/linux-64/libdeflate-1.20-hd590300_0.conda#8e88f9389f1165d7c0936fe40d9a9a79
-https://conda.anaconda.org/conda-forge/linux-64/libexpat-2.6.2-h59595ed_0.conda#e7ba12deb7020dd080c6c70e7b6f6a3d
-https://conda.anaconda.org/conda-forge/linux-64/libffi-3.4.2-h7f98852_5.tar.bz2#d645c6d2ac96843a2bfaccd2d62b3ac3
-https://conda.anaconda.org/conda-forge/linux-64/libgfortran5-13.2.0-ha4646dd_5.conda#7a6bd7a12a4bd359e2afe6c0fa1acace
-https://conda.anaconda.org/conda-forge/linux-64/libjpeg-turbo-3.0.0-hd590300_1.conda#ea25936bb4080d843790b586850f82b8
-https://conda.anaconda.org/conda-forge/linux-64/libwebp-base-1.3.2-hd590300_0.conda#30de3fd9b3b602f7473f30e684eeea8c
-https://conda.anaconda.org/conda-forge/linux-64/libzlib-1.2.13-hd590300_5.conda#f36c115f1ee199da648e0597ec2047ad
-https://conda.anaconda.org/conda-forge/linux-64/ncurses-6.4.20240210-h59595ed_0.conda#97da8860a0da5413c7c98a3b3838a645
-https://conda.anaconda.org/conda-forge/linux-64/ninja-1.11.1-h924138e_0.conda#73a4953a2d9c115bdc10ff30a52f675f
-https://conda.anaconda.org/conda-forge/linux-64/openssl-3.2.1-hd590300_1.conda#9d731343cff6ee2e5a25c4a091bf8e2a
-https://conda.anaconda.org/conda-forge/linux-64/pthread-stubs-0.4-h36c2ea0_1001.tar.bz2#22dad4df6e8630e8dff2428f6f6a7036
-https://conda.anaconda.org/conda-forge/linux-64/xorg-kbproto-1.0.7-h7f98852_1002.tar.bz2#4b230e8381279d76131116660f5a241a
-https://conda.anaconda.org/conda-forge/linux-64/xorg-libxau-1.0.11-hd590300_0.conda#2c80dc38fface310c9bd81b17037fee5
-https://conda.anaconda.org/conda-forge/linux-64/xorg-libxdmcp-1.1.3-h7f98852_0.tar.bz2#be93aabceefa2fac576e971aef407908
-https://conda.anaconda.org/conda-forge/linux-64/xorg-xextproto-7.3.0-h0b41bf4_1003.conda#bce9f945da8ad2ae9b1d7165a64d0f87
-https://conda.anaconda.org/conda-forge/linux-64/xorg-xproto-7.0.31-h7f98852_1007.tar.bz2#b4a4381d54784606820704f7b5f05a15
-https://conda.anaconda.org/conda-forge/linux-64/xz-5.2.6-h166bdaf_0.tar.bz2#2161070d867d1b1204ea749c8eec4ef0
-https://conda.anaconda.org/conda-forge/linux-64/expat-2.6.2-h59595ed_0.conda#53fb86322bdb89496d7579fe3f02fd61
-https://conda.anaconda.org/conda-forge/linux-64/libbrotlidec-1.1.0-hd590300_1.conda#f07002e225d7a60a694d42a7bf5ff53f
-https://conda.anaconda.org/conda-forge/linux-64/libbrotlienc-1.1.0-hd590300_1.conda#5fc11c6020d421960607d821310fcd4d
-https://conda.anaconda.org/conda-forge/linux-64/libgfortran-ng-13.2.0-h69a702a_5.conda#e73e9cfd1191783392131e6238bdb3e9
-https://conda.anaconda.org/conda-forge/linux-64/libpng-1.6.43-h2797004_0.conda#009981dd9cfcaa4dbfa25ffaed86bcae
-https://conda.anaconda.org/conda-forge/linux-64/libsqlite-3.45.2-h2797004_0.conda#866983a220e27a80cb75e85cb30466a1
-https://conda.anaconda.org/conda-forge/linux-64/libxcb-1.15-h0b41bf4_0.conda#33277193f5b92bad9fdd230eb700929c
-https://conda.anaconda.org/conda-forge/linux-64/readline-8.2-h8228510_1.conda#47d31b792659ce70f470b5c82fdfb7a4
-https://conda.anaconda.org/conda-forge/linux-64/tk-8.6.13-noxft_h4845f30_101.conda#d453b98d9c83e71da0741bb0ff4d76bc
-https://conda.anaconda.org/conda-forge/linux-64/zlib-1.2.13-hd590300_5.conda#68c34ec6149623be41a1933ab996a209
-https://conda.anaconda.org/conda-forge/linux-64/zstd-1.5.5-hfc55251_0.conda#04b88013080254850d6c01ed54810589
-https://conda.anaconda.org/conda-forge/linux-64/brotli-bin-1.1.0-hd590300_1.conda#39f910d205726805a958da408ca194ba
-https://conda.anaconda.org/conda-forge/linux-64/freetype-2.12.1-h267a509_2.conda#9ae35c3d96db2c94ce0cef86efdfa2cb
-https://conda.anaconda.org/conda-forge/linux-64/gdbm-1.18-h0a1914f_2.tar.bz2#b77bc399b07a19c00fe12fdc95ee0297
-https://conda.anaconda.org/conda-forge/linux-64/libhiredis-1.0.2-h2cc385e_0.tar.bz2#b34907d3a81a3cd8095ee83d174c074a
-https://conda.anaconda.org/conda-forge/linux-64/libopenblas-0.3.27-pthreads_h413a1c8_0.conda#a356024784da6dfd4683dc5ecf45b155
-https://conda.anaconda.org/conda-forge/linux-64/libtiff-4.6.0-h1dd3fc0_3.conda#66f03896ffbe1a110ffda05c7a856504
-https://conda.anaconda.org/conda-forge/linux-64/llvm-openmp-18.1.2-h4dfa4b3_0.conda#0118c8a03e3dbbb6b348ef71e94ac7af
-https://conda.anaconda.org/conda-forge/linux-64/sqlite-3.45.2-h2c6b66d_0.conda#1423efca06ed343c1da0fc429bae0779
-https://conda.anaconda.org/conda-forge/linux-64/xorg-libx11-1.8.9-h8ee46fc_0.conda#077b6e8ad6a3ddb741fce2496dd01bec
-https://conda.anaconda.org/conda-forge/linux-64/brotli-1.1.0-hd590300_1.conda#f27a24d46e3ea7b70a1f98e50c62508f
-https://conda.anaconda.org/conda-forge/linux-64/ccache-4.9.1-h1fcd64f_0.conda#3620f564bcf28c3524951b6f64f5c5ac
-https://conda.anaconda.org/conda-forge/linux-64/lcms2-2.16-hb7c19ff_0.conda#51bb7010fc86f70eee639b4bb7a894f5
-https://conda.anaconda.org/conda-forge/linux-64/libblas-3.9.0-22_linux64_openblas.conda#1a2a0cd3153464fee6646f3dd6dad9b8
-https://conda.anaconda.org/conda-forge/linux-64/openblas-0.3.27-pthreads_h7a3da1a_0.conda#4b422ebe8fc6a5320d0c1c22e5a46032
-https://conda.anaconda.org/conda-forge/linux-64/openjpeg-2.5.2-h488ebb8_0.conda#7f2e286780f072ed750df46dc2631138
-https://conda.anaconda.org/conda-forge/linux-64/pypy3.9-7.3.15-h9557127_1.conda#0862f2ce457660f1060225d96d468237
-https://conda.anaconda.org/conda-forge/linux-64/libcblas-3.9.0-22_linux64_openblas.conda#4b31699e0ec5de64d5896e580389c9a1
-https://conda.anaconda.org/conda-forge/linux-64/liblapack-3.9.0-22_linux64_openblas.conda#b083767b6c877e24ee597d93b87ab838
-https://conda.anaconda.org/conda-forge/linux-64/python-3.9.18-1_73_pypy.conda#6e0143cd3dd940d3004cd857e37ccd81
-https://conda.anaconda.org/conda-forge/noarch/certifi-2024.2.2-pyhd8ed1ab_0.conda#0876280e409658fc6f9e75d035960333
-https://conda.anaconda.org/conda-forge/noarch/colorama-0.4.6-pyhd8ed1ab_0.tar.bz2#3faab06a954c2a04039983f2c4a50d99
-https://conda.anaconda.org/conda-forge/noarch/cycler-0.12.1-pyhd8ed1ab_0.conda#5cd86562580f274031ede6aa6aa24441
-https://conda.anaconda.org/conda-forge/linux-64/cython-3.0.10-py39hc10206b_0.conda#60c2d58b33a21c32f469e3f6a9eb7e4b
-https://conda.anaconda.org/conda-forge/noarch/exceptiongroup-1.2.0-pyhd8ed1ab_2.conda#8d652ea2ee8eaee02ed8dc820bc794aa
-https://conda.anaconda.org/conda-forge/noarch/execnet-2.1.0-pyhd8ed1ab_0.conda#7a4b32fbe5442e46841ec77695e36d96
-https://conda.anaconda.org/conda-forge/noarch/iniconfig-2.0.0-pyhd8ed1ab_0.conda#f800d2da156d08e289b14e87e43c1ae5
-https://conda.anaconda.org/conda-forge/linux-64/kiwisolver-1.4.5-py39ha90811c_1.conda#25edffabcb0760fc1821597c4ce920db
-https://conda.anaconda.org/conda-forge/linux-64/liblapacke-3.9.0-22_linux64_openblas.conda#1fd156abd41a4992835952f6f4d951d0
-https://conda.anaconda.org/conda-forge/noarch/munkres-1.1.4-pyh9f0ad1d_0.tar.bz2#2ba8498c1018c1e9c61eb99b973dfe19
-https://conda.anaconda.org/conda-forge/linux-64/numpy-1.26.4-py39h6dedee3_0.conda#557d64563e84ff21b14f586c7f662b7f
-https://conda.anaconda.org/conda-forge/noarch/packaging-24.0-pyhd8ed1ab_0.conda#248f521b64ce055e7feae3105e7abeb8
-https://conda.anaconda.org/conda-forge/linux-64/pillow-10.3.0-py39h90a76f3_0.conda#799e6519cfffe2784db27b1db2ef33f3
-https://conda.anaconda.org/conda-forge/noarch/pluggy-1.4.0-pyhd8ed1ab_0.conda#139e9feb65187e916162917bb2484976
-https://conda.anaconda.org/conda-forge/noarch/pyparsing-3.1.2-pyhd8ed1ab_0.conda#b9a4dacf97241704529131a0dfc0494f
-https://conda.anaconda.org/conda-forge/noarch/pypy-7.3.15-1_pypy39.conda#a418a6c16bd6f7ed56b92194214791a0
-https://conda.anaconda.org/conda-forge/noarch/setuptools-69.2.0-pyhd8ed1ab_0.conda#da214ecd521a720a9d521c68047682dc
-https://conda.anaconda.org/conda-forge/noarch/six-1.16.0-pyh6c4a22f_0.tar.bz2#e5f25f8dbc060e9a8d912e432202afc2
-https://conda.anaconda.org/conda-forge/noarch/threadpoolctl-3.4.0-pyhc1e730c_0.conda#b296278eef667c673bf51de6535bad88
-https://conda.anaconda.org/conda-forge/noarch/tomli-2.0.1-pyhd8ed1ab_0.tar.bz2#5844808ffab9ebdb694585b50ba02a96
-https://conda.anaconda.org/conda-forge/linux-64/tornado-6.4-py39hf860d4a_0.conda#e7fded713fb466e1e0670afce1761b47
-https://conda.anaconda.org/conda-forge/linux-64/unicodedata2-15.1.0-py39hf860d4a_0.conda#f699157518d28d00c87542b4ec1273be
-https://conda.anaconda.org/conda-forge/noarch/wheel-0.43.0-pyhd8ed1ab_1.conda#0b5293a157c2b5cd513dd1b03d8d3aae
-https://conda.anaconda.org/conda-forge/noarch/zipp-3.17.0-pyhd8ed1ab_0.conda#2e4d6bc0b14e10f895fc6791a7d9b26a
-https://conda.anaconda.org/conda-forge/linux-64/blas-devel-3.9.0-22_linux64_openblas.conda#63ddb593595c9cf5eb08d3de54d66df8
-https://conda.anaconda.org/conda-forge/linux-64/contourpy-1.2.1-py39ha90811c_0.conda#07ed14c8326da42356514bcbc0b04802
-https://conda.anaconda.org/conda-forge/linux-64/fonttools-4.51.0-py39hf860d4a_0.conda#63421b4dd7222fad555e34ec9af015a1
-https://conda.anaconda.org/conda-forge/noarch/importlib_resources-6.4.0-pyhd8ed1ab_0.conda#c5d3907ad8bd7bf557521a1833cf7e6d
-https://conda.anaconda.org/conda-forge/noarch/joblib-1.3.2-pyhd8ed1ab_0.conda#4da50d410f553db77e62ab62ffaa1abc
-https://conda.anaconda.org/conda-forge/noarch/meson-1.4.0-pyhd8ed1ab_0.conda#52a0660cfa40b45bf254ecc3374cb2e0
-https://conda.anaconda.org/conda-forge/noarch/pip-24.0-pyhd8ed1ab_0.conda#f586ac1e56c8638b64f9c8122a7b8a67
-https://conda.anaconda.org/conda-forge/noarch/pyproject-metadata-0.7.1-pyhd8ed1ab_0.conda#dcb27826ffc94d5f04e241322239983b
-https://conda.anaconda.org/conda-forge/noarch/pytest-7.4.4-pyhd8ed1ab_0.conda#a9d145de8c5f064b5fa68fb34725d9f4
-https://conda.anaconda.org/conda-forge/noarch/python-dateutil-2.9.0-pyhd8ed1ab_0.conda#2cf4264fffb9e6eff6031c5b6884d61c
-https://conda.anaconda.org/conda-forge/linux-64/scipy-1.12.0-py39h6dedee3_2.conda#6c5d74bac41838f4377dfd45085e1fec
-https://conda.anaconda.org/conda-forge/linux-64/blas-2.122-openblas.conda#5065468105542a8b23ea47bd8b6fa55f
-https://conda.anaconda.org/conda-forge/noarch/importlib-resources-6.4.0-pyhd8ed1ab_0.conda#dcbadab7a68738a028e195ab68ab2d2e
-https://conda.anaconda.org/conda-forge/noarch/meson-python-0.15.0-pyh0c530f3_0.conda#3bc64565ca78ce3bb80248d09926d8f9
-https://conda.anaconda.org/conda-forge/linux-64/pyamg-5.1.0-py39h5fd064f_0.conda#04676d2a49da3cb608af77e04b796ce1
-https://conda.anaconda.org/conda-forge/noarch/pytest-xdist-3.5.0-pyhd8ed1ab_0.conda#d5f595da2daead898ca958ac62f0307b
-https://conda.anaconda.org/conda-forge/linux-64/matplotlib-base-3.8.3-py39h4e7d633_0.conda#0b15e2f7764b1f64a5f4156ba20b090e
-https://conda.anaconda.org/conda-forge/linux-64/matplotlib-3.8.3-py39h4162558_0.conda#ccb335b71aedcf24c36b2546741fb5f8
diff --git a/build_tools/azure/python_nogil_lock.txt b/build_tools/azure/python_nogil_lock.txt
deleted file mode 100644
index 03cd4f2e0c346..0000000000000
--- a/build_tools/azure/python_nogil_lock.txt
+++ /dev/null
@@ -1,72 +0,0 @@
-#
-# This file is autogenerated by pip-compile with Python 3.9
-# by the following command:
-#
-#    pip-compile --output-file=/scikit-learn/build_tools/azure/python_nogil_lock.txt /scikit-learn/build_tools/azure/python_nogil_requirements.txt
-#
---index-url https://d1yxz45j0ypngg.cloudfront.net/
---extra-index-url https://pypi.org/simple
-
-contourpy==1.1.1
-    # via matplotlib
-cycler==0.12.1
-    # via matplotlib
-cython==3.0.10
-    # via -r /scikit-learn/build_tools/azure/python_nogil_requirements.txt
-exceptiongroup==1.2.0
-    # via pytest
-execnet==2.0.2
-    # via pytest-xdist
-fonttools==4.50.0
-    # via matplotlib
-iniconfig==2.0.0
-    # via pytest
-joblib==1.3.2
-    # via -r /scikit-learn/build_tools/azure/python_nogil_requirements.txt
-kiwisolver==1.4.4
-    # via matplotlib
-matplotlib==3.6.2
-    # via -r /scikit-learn/build_tools/azure/python_nogil_requirements.txt
-meson==1.4.0
-    # via meson-python
-meson-python==0.15.0
-    # via -r /scikit-learn/build_tools/azure/python_nogil_requirements.txt
-ninja==1.11.1.1
-    # via -r /scikit-learn/build_tools/azure/python_nogil_requirements.txt
-numpy==1.24.0
-    # via
-    #   -r /scikit-learn/build_tools/azure/python_nogil_requirements.txt
-    #   contourpy
-    #   matplotlib
-    #   scipy
-packaging==24.0
-    # via
-    #   matplotlib
-    #   pyproject-metadata
-    #   pytest
-pillow==9.5.0
-    # via matplotlib
-pluggy==1.4.0
-    # via pytest
-pyparsing==3.1.2
-    # via matplotlib
-pyproject-metadata==0.7.1
-    # via meson-python
-pytest==7.4.4
-    # via
-    #   -r /scikit-learn/build_tools/azure/python_nogil_requirements.txt
-    #   pytest-xdist
-pytest-xdist==3.5.0
-    # via -r /scikit-learn/build_tools/azure/python_nogil_requirements.txt
-python-dateutil==2.9.0.post0
-    # via matplotlib
-scipy==1.9.3
-    # via -r /scikit-learn/build_tools/azure/python_nogil_requirements.txt
-six==1.16.0
-    # via python-dateutil
-threadpoolctl==3.4.0
-    # via -r /scikit-learn/build_tools/azure/python_nogil_requirements.txt
-tomli==2.0.1
-    # via
-    #   meson-python
-    #   pytest
diff --git a/build_tools/azure/python_nogil_requirements.txt b/build_tools/azure/python_nogil_requirements.txt
deleted file mode 100644
index 2cebad9a03b25..0000000000000
--- a/build_tools/azure/python_nogil_requirements.txt
+++ /dev/null
@@ -1,20 +0,0 @@
-# To generate python_nogil_lock.txt, use the following command:
-# docker run -v $PWD:/scikit-learn -it nogil/python bash -c 'pip install pip-tools; pip-compile --upgrade /scikit-learn/build_tools/azure/python_nogil_requirements.txt -o /scikit-learn/build_tools/azure/python_nogil_lock.txt'
-#
-# The reason behind it is that you need python-nogil to generate the pip lock
-# file. Using pip-compile --index and --extra-index will not work, for example
-# the latest cython will be picked up from PyPI, rather than the one from the
-# python-nogil index
-matplotlib
-numpy
-scipy
-cython
-joblib
-threadpoolctl
-# TODO: somehow pytest 8 does not seem to work with meson editable
-# install. Exit code is 5, i.e. no test collected
-# This would be fixed by https://github.com/mesonbuild/meson-python/pull/569
-pytest<8
-pytest-xdist
-meson-python
-ninja
diff --git a/build_tools/azure/test_docs.sh b/build_tools/azure/test_docs.sh
index 61e855425786b..48ad2763edb36 100755
--- a/build_tools/azure/test_docs.sh
+++ b/build_tools/azure/test_docs.sh
@@ -1,11 +1,10 @@
 #!/bin/bash
 
-set -e
+set -ex
 
-if [[ "$DISTRIB" =~ ^conda.* ]]; then
-    source activate $VIRTUALENV
-elif [[ "$DISTRIB" == "ubuntu" || "$DISTRIB" == "pip-nogil" ]]; then
-    source $VIRTUALENV/bin/activate
-fi
+source build_tools/shared.sh
+activate_environment
 
-make test-doc
+# XXX: for some unknown reason python -m pytest fails here in the CI, can't
+# reproduce locally and not worth spending time on this
+pytest $(find doc -name '*.rst' | sort)
diff --git a/build_tools/azure/test_script.sh b/build_tools/azure/test_script.sh
index faf48e27efefb..9be7d582cdeaa 100755
--- a/build_tools/azure/test_script.sh
+++ b/build_tools/azure/test_script.sh
@@ -11,7 +11,10 @@ if [[ "$BUILD_REASON" == "Schedule" ]]; then
     # Enable global random seed randomization to discover seed-sensitive tests
     # only on nightly builds.
     # https://scikit-learn.org/stable/computing/parallelism.html#environment-variables
-    export SKLEARN_TESTS_GLOBAL_RANDOM_SEED="any"
+    export SKLEARN_TESTS_GLOBAL_RANDOM_SEED=$(($RANDOM % 100))
+    echo "To reproduce this test run, set the following environment variable:"
+    echo "    SKLEARN_TESTS_GLOBAL_RANDOM_SEED=$SKLEARN_TESTS_GLOBAL_RANDOM_SEED",
+    echo "See: https://scikit-learn.org/dev/computing/parallelism.html#sklearn-tests-global-random-seed"
 
     # Enable global dtype fixture for all nightly builds to discover
     # numerical-sensitive tests.
@@ -61,13 +64,6 @@ if [[ -n "$SELECTED_TESTS" ]]; then
 fi
 
 TEST_CMD="$TEST_CMD --pyargs sklearn"
-if [[ "$DISTRIB" == "conda-pypy3" ]]; then
-    # Run only common tests for PyPy. Running the full test suite uses too
-    # much memory and causes the test to time out sometimes. See
-    # https://github.com/scikit-learn/scikit-learn/issues/27662 for more
-    # details.
-    TEST_CMD="$TEST_CMD.tests.test_common"
-fi
 
 set -x
 eval "$TEST_CMD"
diff --git a/build_tools/azure/ubuntu_atlas_lock.txt b/build_tools/azure/ubuntu_atlas_lock.txt
index aa17f49e75936..3fa5995aafd1e 100644
--- a/build_tools/azure/ubuntu_atlas_lock.txt
+++ b/build_tools/azure/ubuntu_atlas_lock.txt
@@ -6,7 +6,7 @@
 #
 cython==3.0.10
     # via -r build_tools/azure/ubuntu_atlas_requirements.txt
-exceptiongroup==1.2.0
+exceptiongroup==1.2.1
     # via pytest
 execnet==2.1.1
     # via pytest-xdist
@@ -14,27 +14,28 @@ iniconfig==2.0.0
     # via pytest
 joblib==1.2.0
     # via -r build_tools/azure/ubuntu_atlas_requirements.txt
-meson==1.4.0
+meson==1.4.1
     # via meson-python
-meson-python==0.15.0
+meson-python==0.16.0
     # via -r build_tools/azure/ubuntu_atlas_requirements.txt
 ninja==1.11.1.1
     # via -r build_tools/azure/ubuntu_atlas_requirements.txt
-packaging==24.0
+packaging==24.1
     # via
+    #   meson-python
     #   pyproject-metadata
     #   pytest
-pluggy==1.4.0
+pluggy==1.5.0
     # via pytest
-pyproject-metadata==0.7.1
+pyproject-metadata==0.8.0
     # via meson-python
-pytest==7.4.4
+pytest==8.2.2
     # via
     #   -r build_tools/azure/ubuntu_atlas_requirements.txt
     #   pytest-xdist
-pytest-xdist==3.5.0
+pytest-xdist==3.6.1
     # via -r build_tools/azure/ubuntu_atlas_requirements.txt
-threadpoolctl==2.0.0
+threadpoolctl==3.1.0
     # via -r build_tools/azure/ubuntu_atlas_requirements.txt
 tomli==2.0.1
     # via
diff --git a/build_tools/azure/ubuntu_atlas_requirements.txt b/build_tools/azure/ubuntu_atlas_requirements.txt
index aab362dda0bf2..dfb0cfebc54d1 100644
--- a/build_tools/azure/ubuntu_atlas_requirements.txt
+++ b/build_tools/azure/ubuntu_atlas_requirements.txt
@@ -3,8 +3,8 @@
 # build_tools/update_environments_and_lock_files.py
 cython==3.0.10  # min
 joblib==1.2.0  # min
-threadpoolctl==2.0.0  # min
-pytest<8
+threadpoolctl==3.1.0  # min
+pytest
 pytest-xdist
 ninja
 meson-python
diff --git a/build_tools/circle/build_doc.sh b/build_tools/circle/build_doc.sh
index 35fee3ae50b65..5555468d88b18 100755
--- a/build_tools/circle/build_doc.sh
+++ b/build_tools/circle/build_doc.sh
@@ -159,27 +159,23 @@ if [[ `type -t deactivate` ]]; then
   deactivate
 fi
 
-MAMBAFORGE_PATH=$HOME/mambaforge
-# Install dependencies with mamba
-wget -q https://github.com/conda-forge/miniforge/releases/latest/download/Mambaforge-Linux-x86_64.sh \
-    -O mambaforge.sh
-chmod +x mambaforge.sh && ./mambaforge.sh -b -p $MAMBAFORGE_PATH
-export PATH="/usr/lib/ccache:$MAMBAFORGE_PATH/bin:$PATH"
-
+# Install Miniforge
+MINIFORGE_URL="https://github.com/conda-forge/miniforge/releases/latest/download/Miniforge3-Linux-x86_64.sh"
+curl -L --retry 10 $MINIFORGE_URL -o miniconda.sh
+MINIFORGE_PATH=$HOME/miniforge3
+bash ./miniconda.sh -b -p $MINIFORGE_PATH
+source $MINIFORGE_PATH/etc/profile.d/conda.sh
+conda activate
+
+export PATH="/usr/lib/ccache:$PATH"
 ccache -M 512M
 export CCACHE_COMPRESS=1
 
-# pin conda-lock to latest released version (needs manual update from time to time)
-mamba install "$(get_dep conda-lock min)" -y
-
-conda-lock install --log-level DEBUG --name $CONDA_ENV_NAME $LOCK_FILE
-source activate $CONDA_ENV_NAME
+create_conda_environment_from_lock_file $CONDA_ENV_NAME $LOCK_FILE
+conda activate $CONDA_ENV_NAME
 
 show_installed_libraries
 
-# Set parallelism to 3 to overlap IO bound tasks with CPU bound tasks on CI
-# workers with 2 cores when building the compiled extensions of scikit-learn.
-export SKLEARN_BUILD_PARALLEL=3
 pip install -e . --no-build-isolation
 
 echo "ccache build summary:"
@@ -190,17 +186,13 @@ export OMP_NUM_THREADS=1
 if [[ "$CIRCLE_BRANCH" =~ ^main$ && -z "$CI_PULL_REQUEST" ]]
 then
     # List available documentation versions if on main
-    python build_tools/circle/list_versions.py > doc/versions.rst
+    python build_tools/circle/list_versions.py --json doc/js/versions.json --rst doc/versions.rst
 fi
 
 
 # The pipefail is requested to propagate exit code
 set -o pipefail && cd doc && make $make_args 2>&1 | tee ~/log.txt
 
-# Insert the version warning for deployment
-find _build/html/stable -name "*.html" | xargs sed -i '/<\/body>/ i \
-\    <script src="https://scikit-learn.org/versionwarning.js"></script>'
-
 cd -
 set +o pipefail
 
@@ -244,7 +236,7 @@ then
     (
     echo '<html><body><ul>'
     echo "$affected" | sed 's|.*|<li><a href="&">&</a> [<a href="https://scikit-learn.org/dev/&">dev</a>, <a href="https://scikit-learn.org/stable/&">stable</a>]</li>|'
-    echo '</ul><p>General: <a href="index.html">Home</a> | <a href="modules/classes.html">API Reference</a> | <a href="auto_examples/index.html">Examples</a></p>'
+    echo '</ul><p>General: <a href="index.html">Home</a> | <a href="api/index.html">API Reference</a> | <a href="auto_examples/index.html">Examples</a></p>'
     echo '<strong>Sphinx Warnings in affected files</strong><ul>'
     echo "$warnings" | sed 's/\/home\/circleci\/project\//<li>/g'
     echo '</ul></body></html>'
diff --git a/build_tools/circle/doc_environment.yml b/build_tools/circle/doc_environment.yml
index 4df22341635a3..4f0e41927c784 100644
--- a/build_tools/circle/doc_environment.yml
+++ b/build_tools/circle/doc_environment.yml
@@ -11,10 +11,10 @@ dependencies:
   - cython
   - joblib
   - threadpoolctl
-  - matplotlib
+  - matplotlib<3.9
   - pandas
   - pyamg
-  - pytest<8
+  - pytest
   - pytest-xdist
   - pillow
   - pip
@@ -33,7 +33,11 @@ dependencies:
   - polars
   - pooch
   - sphinxext-opengraph
+  - sphinx-remove-toctrees
+  - sphinx-design
+  - pydata-sphinx-theme
   - pip
   - pip:
     - jupyterlite-sphinx
     - jupyterlite-pyodide-kernel
+    - sphinxcontrib-sass
diff --git a/build_tools/circle/doc_linux-64_conda.lock b/build_tools/circle/doc_linux-64_conda.lock
index 5a4b8f07a5f70..c541b03b87f5e 100644
--- a/build_tools/circle/doc_linux-64_conda.lock
+++ b/build_tools/circle/doc_linux-64_conda.lock
@@ -1,74 +1,57 @@
 # Generated by conda-lock.
 # platform: linux-64
-# input_hash: a4de2b553c76a22b14e7e280d371d037c33b6382232c86ae48cc695bbed65852
+# input_hash: 9a2a865e0d1dd470f9dab2a8b0fab036ee049da39187276fee78752b182d944d
 @EXPLICIT
 https://conda.anaconda.org/conda-forge/linux-64/_libgcc_mutex-0.1-conda_forge.tar.bz2#d7c89558ba9fa0495403155b64376d81
-https://conda.anaconda.org/conda-forge/linux-64/ca-certificates-2024.2.2-hbcca054_0.conda#2f4327a1cbe7f022401b236e915a5fef
+https://conda.anaconda.org/conda-forge/linux-64/ca-certificates-2024.7.4-hbcca054_0.conda#23ab7665c5f63cfb9f1f6195256daac6
 https://conda.anaconda.org/conda-forge/noarch/font-ttf-dejavu-sans-mono-2.37-hab24e00_0.tar.bz2#0c96522c6bdaed4b1566d11387caaf45
 https://conda.anaconda.org/conda-forge/noarch/font-ttf-inconsolata-3.000-h77eed37_0.tar.bz2#34893075a5c9e55cdafac56607368fc6
 https://conda.anaconda.org/conda-forge/noarch/font-ttf-source-code-pro-2.038-h77eed37_0.tar.bz2#4d59c254e01d9cde7957100457e2d5fb
-https://conda.anaconda.org/conda-forge/noarch/font-ttf-ubuntu-0.83-h77eed37_1.conda#6185f640c43843e5ad6fd1c5372c3f80
+https://conda.anaconda.org/conda-forge/noarch/font-ttf-ubuntu-0.83-h77eed37_2.conda#cbbe59391138ea5ad3658c76912e147f
 https://conda.anaconda.org/conda-forge/noarch/kernel-headers_linux-64-2.6.32-he073ed8_17.conda#d731b543793afc0433c4fd593e693fce
-https://conda.anaconda.org/conda-forge/linux-64/ld_impl_linux-64-2.40-h41732ed_0.conda#7aca3059a1729aa76c597603f10b0dd3
-https://conda.anaconda.org/conda-forge/noarch/libgcc-devel_linux-64-12.3.0-h8bca6fd_105.conda#e12ce6b051085b8f27e239f5e5f5bce5
-https://conda.anaconda.org/conda-forge/noarch/libstdcxx-devel_linux-64-12.3.0-h8bca6fd_105.conda#b3c6062c84a8e172555ee104ea6a01ab
-https://conda.anaconda.org/conda-forge/linux-64/libstdcxx-ng-13.2.0-h7e041cc_5.conda#f6f6600d18a4047b54f803cf708b868a
+https://conda.anaconda.org/conda-forge/linux-64/ld_impl_linux-64-2.40-hf3520f5_7.conda#b80f2f396ca2c28b8c14c437a4ed1e74
 https://conda.anaconda.org/conda-forge/linux-64/python_abi-3.9-4_cp39.conda#bfe4b3259a8ac6cdf0037752904da6a7
 https://conda.anaconda.org/conda-forge/noarch/tzdata-2024a-h0c530f3_0.conda#161081fc7cec0bfda0d86d7cb595f8d8
 https://conda.anaconda.org/conda-forge/noarch/fonts-conda-forge-1-0.tar.bz2#f766549260d6815b0c52253f1fb1bb29
-https://conda.anaconda.org/conda-forge/linux-64/libgomp-13.2.0-h807b86a_5.conda#d211c42b9ce49aee3734fdc828731689
+https://conda.anaconda.org/conda-forge/noarch/libgcc-devel_linux-64-12.3.0-h6b66f73_113.conda#7fc690ec9db2902e5ee90cebfdab31e7
+https://conda.anaconda.org/conda-forge/linux-64/libgomp-14.1.0-h77fa898_0.conda#ae061a5ed5f05818acdf9adab72c146d
+https://conda.anaconda.org/conda-forge/noarch/libstdcxx-devel_linux-64-12.3.0-h6b66f73_113.conda#3706e34877bd82d04cb1e9e9baeb2739
 https://conda.anaconda.org/conda-forge/noarch/sysroot_linux-64-2.12-he073ed8_17.conda#595db67e32b276298ff3d94d07d47fbf
-https://conda.anaconda.org/conda-forge/linux-64/binutils_impl_linux-64-2.40-hf600244_0.conda#33084421a8c0af6aef1b439707f7662a
+https://conda.anaconda.org/conda-forge/linux-64/binutils_impl_linux-64-2.40-ha1999f0_7.conda#3f840c7ed70a96b5ebde8044b2f36f32
 https://conda.anaconda.org/conda-forge/noarch/fonts-conda-ecosystem-1-0.tar.bz2#fee5683a3f04bd15cbd8318b096a27ab
-https://conda.anaconda.org/conda-forge/linux-64/binutils-2.40-hdd6e379_0.conda#ccc940fddbc3fcd3d79cd4c654c4b5c4
-https://conda.anaconda.org/conda-forge/linux-64/binutils_linux-64-2.40-hdade7a5_3.conda#2d9a60578bc28469d9aeef9aea5520c3
+https://conda.anaconda.org/conda-forge/linux-64/binutils-2.40-h4852527_7.conda#df53aa8418f8c289ae9b9665986034f8
+https://conda.anaconda.org/conda-forge/linux-64/binutils_linux-64-2.40-hb3c18ed_9.conda#bb3fb8553a669828501e80d13b6bd744
 https://conda.anaconda.org/conda-forge/linux-64/_openmp_mutex-4.5-2_kmp_llvm.tar.bz2#562b26ba2e19059551a811e72ab7f793
-https://conda.anaconda.org/conda-forge/linux-64/libgcc-ng-13.2.0-h807b86a_5.conda#d4ff227c46917d3b4565302a2bbb276b
-https://conda.anaconda.org/conda-forge/linux-64/alsa-lib-1.2.11-hd590300_1.conda#0bb492cca54017ea314b809b1ee3a176
-https://conda.anaconda.org/conda-forge/linux-64/aom-3.8.2-h59595ed_0.conda#625e1fed28a5139aed71b3a76117ef84
+https://conda.anaconda.org/conda-forge/linux-64/libgcc-ng-14.1.0-h77fa898_0.conda#ca0fad6a41ddaef54a153b78eccb5037
+https://conda.anaconda.org/conda-forge/linux-64/alsa-lib-1.2.12-h4ab18f5_0.conda#7ed427f0871fd41cb1d9c17727c17589
 https://conda.anaconda.org/conda-forge/linux-64/attr-2.5.1-h166bdaf_1.tar.bz2#d9c69a24ad678ffce24c6543a0176b00
 https://conda.anaconda.org/conda-forge/linux-64/bzip2-1.0.8-hd590300_5.conda#69b8b6202a07720f448be700e300ccf4
-https://conda.anaconda.org/conda-forge/linux-64/charls-2.4.2-h59595ed_0.conda#4336bd67920dd504cd8c6761d6a99645
 https://conda.anaconda.org/conda-forge/linux-64/dav1d-1.2.1-hd590300_0.conda#418c6ca5929a611cbd69204907a83995
 https://conda.anaconda.org/conda-forge/linux-64/gettext-tools-0.22.5-h59595ed_2.conda#985f2f453fb72408d6b6f1be0f324033
-https://conda.anaconda.org/conda-forge/linux-64/giflib-5.2.1-h0b41bf4_3.conda#96f3b11872ef6fad973eac856cd2624f
-https://conda.anaconda.org/conda-forge/linux-64/graphite2-1.3.13-h59595ed_1003.conda#f87c7b7c2cb45f323ffbce941c78ab7c
-https://conda.anaconda.org/conda-forge/linux-64/icu-73.2-h59595ed_0.conda#cc47e1facc155f91abd89b11e48e72ff
+https://conda.anaconda.org/conda-forge/linux-64/giflib-5.2.2-hd590300_0.conda#3bf7b9fd5a7136126e0234db4b87c8b6
 https://conda.anaconda.org/conda-forge/linux-64/jxrlib-1.1-hd590300_3.conda#5aeabe88534ea4169d4c49998f293d6c
 https://conda.anaconda.org/conda-forge/linux-64/keyutils-1.6.1-h166bdaf_0.tar.bz2#30186d27e2c9fa62b45fb1476b7200e3
 https://conda.anaconda.org/conda-forge/linux-64/lame-3.100-h166bdaf_1003.tar.bz2#a8832b479f93521a9e7b5b743803be51
-https://conda.anaconda.org/conda-forge/linux-64/lerc-4.0.0-h27087fc_0.tar.bz2#76bbff344f0134279f225174e9064c8f
-https://conda.anaconda.org/conda-forge/linux-64/libaec-1.1.3-h59595ed_0.conda#5e97e271911b8b2001a8b71860c32faa
-https://conda.anaconda.org/conda-forge/linux-64/libasprintf-0.22.5-h661eb56_2.conda#dd197c968bf9760bba0031888d431ede
 https://conda.anaconda.org/conda-forge/linux-64/libbrotlicommon-1.1.0-hd590300_1.conda#aec6c91c7371c26392a06708a73c70e5
 https://conda.anaconda.org/conda-forge/linux-64/libdeflate-1.20-hd590300_0.conda#8e88f9389f1165d7c0936fe40d9a9a79
 https://conda.anaconda.org/conda-forge/linux-64/libexpat-2.6.2-h59595ed_0.conda#e7ba12deb7020dd080c6c70e7b6f6a3d
 https://conda.anaconda.org/conda-forge/linux-64/libffi-3.4.2-h7f98852_5.tar.bz2#d645c6d2ac96843a2bfaccd2d62b3ac3
 https://conda.anaconda.org/conda-forge/linux-64/libgettextpo-0.22.5-h59595ed_2.conda#172bcc51059416e7ce99e7b528cede83
-https://conda.anaconda.org/conda-forge/linux-64/libgfortran5-13.2.0-ha4646dd_5.conda#7a6bd7a12a4bd359e2afe6c0fa1acace
-https://conda.anaconda.org/conda-forge/linux-64/libhwy-1.1.0-h00ab1b0_0.conda#88928158ccfe797eac29ef5e03f7d23d
+https://conda.anaconda.org/conda-forge/linux-64/libgfortran5-14.1.0-hc5f4f2c_0.conda#6456c2620c990cd8dde2428a27ba0bc5
 https://conda.anaconda.org/conda-forge/linux-64/libiconv-1.17-hd590300_2.conda#d66573916ffcf376178462f1b61c941e
 https://conda.anaconda.org/conda-forge/linux-64/libjpeg-turbo-3.0.0-hd590300_1.conda#ea25936bb4080d843790b586850f82b8
 https://conda.anaconda.org/conda-forge/linux-64/libnsl-2.0.1-hd590300_0.conda#30fd6e37fe21f86f4bd26d6ee73eeec7
-https://conda.anaconda.org/conda-forge/linux-64/libogg-1.3.4-h7f98852_1.tar.bz2#6e8cc2173440d77708196c5b93771680
+https://conda.anaconda.org/conda-forge/linux-64/libogg-1.3.5-h4ab18f5_0.conda#601bfb4b3c6f0b844443bb81a56651e0
 https://conda.anaconda.org/conda-forge/linux-64/libopus-1.3.1-h7f98852_1.tar.bz2#15345e56d527b330e1cacbdf58676e8f
-https://conda.anaconda.org/conda-forge/linux-64/libsanitizer-12.3.0-h0f45ef3_5.conda#11d1ceacff40054d5a74b12975d76f20
+https://conda.anaconda.org/conda-forge/linux-64/libstdcxx-ng-14.1.0-hc0a3c3a_0.conda#1cb187a157136398ddbaae90713e2498
 https://conda.anaconda.org/conda-forge/linux-64/libuuid-2.38.1-h0b41bf4_0.conda#40b61aab5c7ba9ff276c41cfffe6b80b
-https://conda.anaconda.org/conda-forge/linux-64/libwebp-base-1.3.2-hd590300_0.conda#30de3fd9b3b602f7473f30e684eeea8c
+https://conda.anaconda.org/conda-forge/linux-64/libwebp-base-1.4.0-hd590300_0.conda#b26e8aa824079e1be0294e7152ca4559
 https://conda.anaconda.org/conda-forge/linux-64/libxcrypt-4.4.36-hd590300_1.conda#5aa797f8787fe7a17d1b0821485b5adc
-https://conda.anaconda.org/conda-forge/linux-64/libzlib-1.2.13-hd590300_5.conda#f36c115f1ee199da648e0597ec2047ad
-https://conda.anaconda.org/conda-forge/linux-64/libzopfli-1.0.3-h9c3ff4c_0.tar.bz2#c66fe2d123249af7651ebde8984c51c2
-https://conda.anaconda.org/conda-forge/linux-64/lz4-c-1.9.4-hcb278e6_0.conda#318b08df404f9c9be5712aaa5a6f0bb0
-https://conda.anaconda.org/conda-forge/linux-64/mpg123-1.32.6-h59595ed_0.conda#9160cdeb523a1b20cf8d2a0bf821f45d
-https://conda.anaconda.org/conda-forge/linux-64/ncurses-6.4.20240210-h59595ed_0.conda#97da8860a0da5413c7c98a3b3838a645
-https://conda.anaconda.org/conda-forge/linux-64/ninja-1.11.1-h924138e_0.conda#73a4953a2d9c115bdc10ff30a52f675f
-https://conda.anaconda.org/conda-forge/linux-64/nspr-4.35-h27087fc_0.conda#da0ec11a6454ae19bff5b02ed881a2b1
-https://conda.anaconda.org/conda-forge/linux-64/openssl-3.2.1-hd590300_1.conda#9d731343cff6ee2e5a25c4a091bf8e2a
-https://conda.anaconda.org/conda-forge/linux-64/pixman-0.43.2-h59595ed_0.conda#71004cbf7924e19c02746ccde9fd7123
+https://conda.anaconda.org/conda-forge/linux-64/libzlib-1.3.1-h4ab18f5_1.conda#57d7dc60e9325e3de37ff8dffd18e814
+https://conda.anaconda.org/conda-forge/linux-64/ncurses-6.5-h59595ed_0.conda#fcea371545eda051b6deafb24889fc69
+https://conda.anaconda.org/conda-forge/linux-64/openssl-3.3.1-h4ab18f5_1.conda#b1e9d076f14e8d776213fd5047b4c3d9
 https://conda.anaconda.org/conda-forge/linux-64/pthread-stubs-0.4-h36c2ea0_1001.tar.bz2#22dad4df6e8630e8dff2428f6f6a7036
 https://conda.anaconda.org/conda-forge/linux-64/rav1e-0.6.6-he8a937b_2.conda#77d9955b4abddb811cb8ab1aa7d743e4
-https://conda.anaconda.org/conda-forge/linux-64/snappy-1.1.10-h9fff704_0.conda#e6d228cd0bb74a51dd18f5bfce0b4115
-https://conda.anaconda.org/conda-forge/linux-64/svt-av1-2.0.0-h59595ed_0.conda#207e01ffa0eb2d2efb83fb6f46365a21
 https://conda.anaconda.org/conda-forge/linux-64/xorg-kbproto-1.0.7-h7f98852_1002.tar.bz2#4b230e8381279d76131116660f5a241a
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libice-1.1.1-hd590300_0.conda#b462a33c0be1421532f28bfe8f4a7514
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libxau-1.0.11-hd590300_0.conda#2c80dc38fface310c9bd81b17037fee5
@@ -78,245 +61,272 @@ https://conda.anaconda.org/conda-forge/linux-64/xorg-xextproto-7.3.0-h0b41bf4_10
 https://conda.anaconda.org/conda-forge/linux-64/xorg-xf86vidmodeproto-2.3.1-h7f98852_1002.tar.bz2#3ceea9668625c18f19530de98b15d5b0
 https://conda.anaconda.org/conda-forge/linux-64/xorg-xproto-7.0.31-h7f98852_1007.tar.bz2#b4a4381d54784606820704f7b5f05a15
 https://conda.anaconda.org/conda-forge/linux-64/xz-5.2.6-h166bdaf_0.tar.bz2#2161070d867d1b1204ea749c8eec4ef0
-https://conda.anaconda.org/conda-forge/linux-64/zfp-1.0.1-h59595ed_0.conda#fd486bffbf0d6841cf1456a8f2e3a995
-https://conda.anaconda.org/conda-forge/linux-64/zlib-ng-2.0.7-h0b41bf4_0.conda#49e8329110001f04923fe7e864990b0c
+https://conda.anaconda.org/conda-forge/linux-64/aom-3.9.1-hac33072_0.conda#346722a0be40f6edc53f12640d301338
+https://conda.anaconda.org/conda-forge/linux-64/charls-2.4.2-h59595ed_0.conda#4336bd67920dd504cd8c6761d6a99645
 https://conda.anaconda.org/conda-forge/linux-64/expat-2.6.2-h59595ed_0.conda#53fb86322bdb89496d7579fe3f02fd61
-https://conda.anaconda.org/conda-forge/linux-64/gcc_impl_linux-64-12.3.0-he2b93b0_5.conda#e89827619e73df59496c708b94f6f3d5
-https://conda.anaconda.org/conda-forge/linux-64/libasprintf-devel-0.22.5-h661eb56_2.conda#02e41ab5834dcdcc8590cf29d9526f50
-https://conda.anaconda.org/conda-forge/linux-64/libavif16-1.0.4-hd9d6309_2.conda#a8c65cba5f77abc1f2e85ab9a0e614aa
+https://conda.anaconda.org/conda-forge/linux-64/graphite2-1.3.13-h59595ed_1003.conda#f87c7b7c2cb45f323ffbce941c78ab7c
+https://conda.anaconda.org/conda-forge/linux-64/icu-73.2-h59595ed_0.conda#cc47e1facc155f91abd89b11e48e72ff
+https://conda.anaconda.org/conda-forge/linux-64/lerc-4.0.0-h27087fc_0.tar.bz2#76bbff344f0134279f225174e9064c8f
+https://conda.anaconda.org/conda-forge/linux-64/libaec-1.1.3-h59595ed_0.conda#5e97e271911b8b2001a8b71860c32faa
+https://conda.anaconda.org/conda-forge/linux-64/libasprintf-0.22.5-h661eb56_2.conda#dd197c968bf9760bba0031888d431ede
 https://conda.anaconda.org/conda-forge/linux-64/libbrotlidec-1.1.0-hd590300_1.conda#f07002e225d7a60a694d42a7bf5ff53f
 https://conda.anaconda.org/conda-forge/linux-64/libbrotlienc-1.1.0-hd590300_1.conda#5fc11c6020d421960607d821310fcd4d
 https://conda.anaconda.org/conda-forge/linux-64/libcap-2.69-h0f662aa_0.conda#25cb5999faa414e5ccb2c1388f62d3d5
 https://conda.anaconda.org/conda-forge/linux-64/libedit-3.1.20191231-he28a2e2_2.tar.bz2#4d331e44109e3f0e19b4cb8f9b82f3e1
 https://conda.anaconda.org/conda-forge/linux-64/libevent-2.1.12-hf998b51_1.conda#a1cfcc585f0c42bf8d5546bb1dfb668d
 https://conda.anaconda.org/conda-forge/linux-64/libgettextpo-devel-0.22.5-h59595ed_2.conda#b63d9b6da3653179a278077f0de20014
-https://conda.anaconda.org/conda-forge/linux-64/libgfortran-ng-13.2.0-h69a702a_5.conda#e73e9cfd1191783392131e6238bdb3e9
+https://conda.anaconda.org/conda-forge/linux-64/libgfortran-ng-14.1.0-h69a702a_0.conda#f4ca84fbd6d06b0a052fb2d5b96dde41
+https://conda.anaconda.org/conda-forge/linux-64/libhwy-1.1.0-h00ab1b0_0.conda#88928158ccfe797eac29ef5e03f7d23d
 https://conda.anaconda.org/conda-forge/linux-64/libpng-1.6.43-h2797004_0.conda#009981dd9cfcaa4dbfa25ffaed86bcae
-https://conda.anaconda.org/conda-forge/linux-64/libsqlite-3.45.2-h2797004_0.conda#866983a220e27a80cb75e85cb30466a1
+https://conda.anaconda.org/conda-forge/linux-64/libsanitizer-12.3.0-hb8811af_13.conda#448dc960d50a75e8286b8427028ec56e
+https://conda.anaconda.org/conda-forge/linux-64/libsqlite-3.46.0-hde9e2c9_0.conda#18aa975d2094c34aef978060ae7da7d8
 https://conda.anaconda.org/conda-forge/linux-64/libvorbis-1.3.7-h9c3ff4c_0.tar.bz2#309dec04b70a3cc0f1e84a4013683bc0
-https://conda.anaconda.org/conda-forge/linux-64/libxcb-1.15-h0b41bf4_0.conda#33277193f5b92bad9fdd230eb700929c
-https://conda.anaconda.org/conda-forge/linux-64/libxml2-2.12.6-h232c23b_1.conda#6853448e9ca1cfd5f15382afd2a6d123
+https://conda.anaconda.org/conda-forge/linux-64/libxcb-1.16-hd590300_0.conda#151cba22b85a989c2d6ef9633ffee1e4
+https://conda.anaconda.org/conda-forge/linux-64/libzopfli-1.0.3-h9c3ff4c_0.tar.bz2#c66fe2d123249af7651ebde8984c51c2
+https://conda.anaconda.org/conda-forge/linux-64/lz4-c-1.9.4-hcb278e6_0.conda#318b08df404f9c9be5712aaa5a6f0bb0
+https://conda.anaconda.org/conda-forge/linux-64/mpg123-1.32.6-h59595ed_0.conda#9160cdeb523a1b20cf8d2a0bf821f45d
 https://conda.anaconda.org/conda-forge/linux-64/mysql-common-8.3.0-hf1915f5_4.conda#784a4df6676c581ca624fbe460703a6d
-https://conda.anaconda.org/conda-forge/linux-64/pcre2-10.43-hcad00b1_0.conda#8292dea9e022d9610a11fce5e0896ed8
+https://conda.anaconda.org/conda-forge/linux-64/ninja-1.12.1-h297d8ca_0.conda#3aa1c7e292afeff25a0091ddd7c69b72
+https://conda.anaconda.org/conda-forge/linux-64/nspr-4.35-h27087fc_0.conda#da0ec11a6454ae19bff5b02ed881a2b1
+https://conda.anaconda.org/conda-forge/linux-64/pcre2-10.44-h0f59acf_0.conda#3914f7ac1761dce57102c72ca7c35d01
+https://conda.anaconda.org/conda-forge/linux-64/pixman-0.43.2-h59595ed_0.conda#71004cbf7924e19c02746ccde9fd7123
 https://conda.anaconda.org/conda-forge/linux-64/readline-8.2-h8228510_1.conda#47d31b792659ce70f470b5c82fdfb7a4
+https://conda.anaconda.org/conda-forge/linux-64/snappy-1.2.1-ha2e4443_0.conda#6b7dcc7349efd123d493d2dbe85a045f
+https://conda.anaconda.org/conda-forge/linux-64/svt-av1-2.1.2-hac33072_0.conda#06c5dec4ebb47213b648a6c4dc8400d6
 https://conda.anaconda.org/conda-forge/linux-64/tk-8.6.13-noxft_h4845f30_101.conda#d453b98d9c83e71da0741bb0ff4d76bc
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libsm-1.2.4-h7391055_0.conda#93ee23f12bc2e684548181256edd2cf6
-https://conda.anaconda.org/conda-forge/linux-64/zlib-1.2.13-hd590300_5.conda#68c34ec6149623be41a1933ab996a209
-https://conda.anaconda.org/conda-forge/linux-64/zstd-1.5.5-hfc55251_0.conda#04b88013080254850d6c01ed54810589
-https://conda.anaconda.org/conda-forge/linux-64/blosc-1.21.5-h0f2a231_0.conda#009521b7ed97cca25f8f997f9e745976
+https://conda.anaconda.org/conda-forge/linux-64/zfp-1.0.1-hac33072_1.conda#df96b7266e49529d82de467b23977452
+https://conda.anaconda.org/conda-forge/linux-64/zlib-1.3.1-h4ab18f5_1.conda#9653f1bf3766164d0e65fa723cabbc54
+https://conda.anaconda.org/conda-forge/linux-64/zlib-ng-2.2.1-he02047a_0.conda#8fd1654184917db2cb74fc84cb4fff79
+https://conda.anaconda.org/conda-forge/linux-64/zstd-1.5.6-ha6fb4c9_0.conda#4d056880988120e29d75bfff282e0f45
+https://conda.anaconda.org/conda-forge/linux-64/blosc-1.21.6-hef167b5_0.conda#54fe76ab3d0189acaef95156874db7f9
 https://conda.anaconda.org/conda-forge/linux-64/brotli-bin-1.1.0-hd590300_1.conda#39f910d205726805a958da408ca194ba
-https://conda.anaconda.org/conda-forge/linux-64/c-blosc2-2.14.3-hb4ffafa_0.conda#0673d3714f294406ee458962a212c455
+https://conda.anaconda.org/conda-forge/linux-64/c-blosc2-2.15.0-h6d6b9e4_1.conda#0dbd746357ef08ceb6c732c391e6a98c
 https://conda.anaconda.org/conda-forge/linux-64/freetype-2.12.1-h267a509_2.conda#9ae35c3d96db2c94ce0cef86efdfa2cb
-https://conda.anaconda.org/conda-forge/linux-64/gcc-12.3.0-h95e488c_3.conda#413e326f8a01d041ffbfbb51cea46a93
-https://conda.anaconda.org/conda-forge/linux-64/gcc_linux-64-12.3.0-h6477408_3.conda#7a53f84c45bdf4656ba27b9e9ed68b3d
-https://conda.anaconda.org/conda-forge/linux-64/gettext-0.22.5-h59595ed_2.conda#219ba82e95d7614cf7140d2a4afc0926
-https://conda.anaconda.org/conda-forge/linux-64/gfortran_impl_linux-64-12.3.0-hfcedea8_5.conda#4d72ee7c82f8a9b2ecef4fcefa9acd19
-https://conda.anaconda.org/conda-forge/linux-64/gxx_impl_linux-64-12.3.0-he2b93b0_5.conda#cddba8fd94e52012abea1caad722b9c2
-https://conda.anaconda.org/conda-forge/linux-64/krb5-1.21.2-h659d440_0.conda#cd95826dbd331ed1be26bdf401432844
-https://conda.anaconda.org/conda-forge/linux-64/libglib-2.80.0-hf2295e7_3.conda#569d25ad54594080778abff56a611dc7
-https://conda.anaconda.org/conda-forge/linux-64/libjxl-0.10.1-hcae5a98_1.conda#ca9532696d031f78d1dc245c413823d4
-https://conda.anaconda.org/conda-forge/linux-64/libllvm15-15.0.7-hb3ce162_4.conda#8a35df3cbc0c8b12cc8af9473ae75eef
-https://conda.anaconda.org/conda-forge/linux-64/libllvm18-18.1.3-h2448989_0.conda#927b6d6e80b2c0d4405a58b61ca248a3
+https://conda.anaconda.org/conda-forge/linux-64/gcc_impl_linux-64-12.3.0-h58ffeeb_13.conda#93325fff774c4cc8dcc8c65039cb4646
+https://conda.anaconda.org/conda-forge/linux-64/krb5-1.21.3-h659f571_0.conda#3f43953b7d3fb3aaa1d0d0723d91e368
+https://conda.anaconda.org/conda-forge/linux-64/libasprintf-devel-0.22.5-h661eb56_2.conda#02e41ab5834dcdcc8590cf29d9526f50
+https://conda.anaconda.org/conda-forge/linux-64/libavif16-1.0.4-h9b56c87_5.conda#fc2577679cbe608fa0e17d049d1733d0
+https://conda.anaconda.org/conda-forge/linux-64/libglib-2.80.3-h8a4344b_1.conda#6ea440297aacee4893f02ad759e6ffbc
+https://conda.anaconda.org/conda-forge/linux-64/libjxl-0.10.2-hcae5a98_0.conda#901db891e1e21afd8524cd636a8c8e3b
 https://conda.anaconda.org/conda-forge/linux-64/libopenblas-0.3.27-pthreads_h413a1c8_0.conda#a356024784da6dfd4683dc5ecf45b155
 https://conda.anaconda.org/conda-forge/linux-64/libtiff-4.6.0-h1dd3fc0_3.conda#66f03896ffbe1a110ffda05c7a856504
-https://conda.anaconda.org/conda-forge/linux-64/llvm-openmp-18.1.2-h4dfa4b3_0.conda#0118c8a03e3dbbb6b348ef71e94ac7af
+https://conda.anaconda.org/conda-forge/linux-64/libxml2-2.12.7-hc051c1a_1.conda#340278ded8b0dc3a73f3660bbb0adbc6
+https://conda.anaconda.org/conda-forge/linux-64/llvm-openmp-18.1.8-hf5423f3_0.conda#322be9d39e030673e105b0abb320514e
 https://conda.anaconda.org/conda-forge/linux-64/mysql-libs-8.3.0-hca2cd23_4.conda#1b50eebe2a738a3146c154d2eceaa8b6
-https://conda.anaconda.org/conda-forge/linux-64/nss-3.98-h1d7d5a4_0.conda#54b56c2fdf973656b748e0378900ec13
+https://conda.anaconda.org/conda-forge/linux-64/nss-3.102-h593d115_0.conda#40e5e48c55a45621c4399ca9236406b7
 https://conda.anaconda.org/conda-forge/linux-64/python-3.9.19-h0755675_0_cpython.conda#d9ee3647fbd9e8595b8df759b2bbefb8
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-0.4.0-hd590300_1.conda#9bfac7ccd94d54fd21a0501296d60424
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-keysyms-0.4.0-h8ee46fc_1.conda#632413adcd8bc16b515cab87a2932913
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-renderutil-0.3.9-hd590300_1.conda#e995b155d938b6779da6ace6c6b13816
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-wm-0.4.1-h8ee46fc_1.conda#90108a432fb5c6150ccfee3f03388656
-https://conda.anaconda.org/conda-forge/linux-64/xorg-libx11-1.8.9-h8ee46fc_0.conda#077b6e8ad6a3ddb741fce2496dd01bec
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-0.4.1-hb711507_2.conda#8637c3e5821654d0edf97e2b0404b443
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-keysyms-0.4.1-hb711507_0.conda#ad748ccca349aec3e91743e08b5e2b50
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-renderutil-0.3.10-hb711507_0.conda#0e0cbe0564d03a99afd5fd7b362feecd
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-wm-0.4.2-hb711507_0.conda#608e0ef8256b81d04456e8d211eee3e8
+https://conda.anaconda.org/conda-forge/linux-64/xorg-libx11-1.8.9-hb711507_1.conda#4a6d410296d7e39f00bacdee7df046e9
 https://conda.anaconda.org/conda-forge/noarch/alabaster-0.7.16-pyhd8ed1ab_0.conda#def531a3ac77b7fb8c21d17bb5d0badb
 https://conda.anaconda.org/conda-forge/linux-64/brotli-1.1.0-hd590300_1.conda#f27a24d46e3ea7b70a1f98e50c62508f
 https://conda.anaconda.org/conda-forge/linux-64/brotli-python-1.1.0-py39h3d6467e_1.conda#c48418c8b35f1d59ae9ae1174812b40a
-https://conda.anaconda.org/conda-forge/linux-64/c-compiler-1.7.0-hd590300_0.conda#fad1d0a651bf929c6c16fbf1f6ccfa7c
-https://conda.anaconda.org/conda-forge/noarch/certifi-2024.2.2-pyhd8ed1ab_0.conda#0876280e409658fc6f9e75d035960333
+https://conda.anaconda.org/conda-forge/noarch/certifi-2024.6.2-pyhd8ed1ab_0.conda#8821ec1c8fcdc9e1d291d7b9f6e9968a
 https://conda.anaconda.org/conda-forge/noarch/charset-normalizer-3.3.2-pyhd8ed1ab_0.conda#7f4a9e3fcff3f6356ae99244a014da6a
 https://conda.anaconda.org/conda-forge/noarch/colorama-0.4.6-pyhd8ed1ab_0.tar.bz2#3faab06a954c2a04039983f2c4a50d99
 https://conda.anaconda.org/conda-forge/noarch/cycler-0.12.1-pyhd8ed1ab_0.conda#5cd86562580f274031ede6aa6aa24441
 https://conda.anaconda.org/conda-forge/linux-64/cython-3.0.10-py39h3d6467e_0.conda#76b5d215fb735a6dc43010ffbe78040e
 https://conda.anaconda.org/conda-forge/linux-64/dbus-1.13.6-h5008d03_3.tar.bz2#ecfff944ba3960ecb334b9a2663d708d
-https://conda.anaconda.org/conda-forge/linux-64/docutils-0.20.1-py39hf3d152e_3.conda#09a48956e1c155907fd0d626f3e80f2e
+https://conda.anaconda.org/conda-forge/noarch/docutils-0.21.2-pyhd8ed1ab_0.conda#e8cd5d629f65bdf0f3bb312cde14659e
 https://conda.anaconda.org/conda-forge/noarch/exceptiongroup-1.2.0-pyhd8ed1ab_2.conda#8d652ea2ee8eaee02ed8dc820bc794aa
-https://conda.anaconda.org/conda-forge/noarch/execnet-2.1.0-pyhd8ed1ab_0.conda#7a4b32fbe5442e46841ec77695e36d96
+https://conda.anaconda.org/conda-forge/noarch/execnet-2.1.1-pyhd8ed1ab_0.conda#15dda3cdbf330abfe9f555d22f66db46
 https://conda.anaconda.org/conda-forge/linux-64/fontconfig-2.14.2-h14ed4e7_0.conda#0f69b688f52ff6da70bccb7ff7001d1d
-https://conda.anaconda.org/conda-forge/linux-64/gfortran-12.3.0-h7389182_3.conda#6b0b27394cf439d0540f949190556860
-https://conda.anaconda.org/conda-forge/linux-64/gfortran_linux-64-12.3.0-h617cb40_3.conda#3a9e5b8a6f651ff14e74d896d8f04ab6
-https://conda.anaconda.org/conda-forge/linux-64/glib-tools-2.80.0-hde27a5a_3.conda#d544517494d9008c0b1021213aec4084
-https://conda.anaconda.org/conda-forge/linux-64/gxx-12.3.0-h95e488c_3.conda#8c50a4d15a8d4812af563a684d598910
-https://conda.anaconda.org/conda-forge/linux-64/gxx_linux-64-12.3.0-h4a1b8e8_3.conda#9ec22c7c544f4a4f6d660f0a3b0fd15c
-https://conda.anaconda.org/conda-forge/noarch/idna-3.6-pyhd8ed1ab_0.conda#1a76f09108576397c41c0b0c5bd84134
+https://conda.anaconda.org/conda-forge/linux-64/gcc-12.3.0-h915e2ae_13.conda#e42d156a1e3dd5651c89d7606b5a4a45
+https://conda.anaconda.org/conda-forge/linux-64/gcc_linux-64-12.3.0-h9528a6a_9.conda#954881ce9897d01c7c2031fb93ed366b
+https://conda.anaconda.org/conda-forge/linux-64/gettext-0.22.5-h59595ed_2.conda#219ba82e95d7614cf7140d2a4afc0926
+https://conda.anaconda.org/conda-forge/linux-64/gfortran_impl_linux-64-12.3.0-h8f2110c_13.conda#96471c6bcf708822422bd9f78dbecc3b
+https://conda.anaconda.org/conda-forge/linux-64/glib-tools-2.80.3-h73ef956_1.conda#99701cdc9a25a333d15265d1d243b2dc
+https://conda.anaconda.org/conda-forge/linux-64/gxx_impl_linux-64-12.3.0-h2a574ab_13.conda#bb4fe41bc0584a3f6d3026634170c330
+https://conda.anaconda.org/conda-forge/noarch/hpack-4.0.0-pyh9f0ad1d_0.tar.bz2#914d6646c4dbb1fd3ff539830a12fd71
+https://conda.anaconda.org/conda-forge/noarch/hyperframe-6.0.1-pyhd8ed1ab_0.tar.bz2#9f765cbfab6870c8435b9eefecd7a1f4
+https://conda.anaconda.org/conda-forge/noarch/idna-3.7-pyhd8ed1ab_0.conda#c0cc1420498b17414d8617d0b9f506ca
 https://conda.anaconda.org/conda-forge/noarch/imagesize-1.4.1-pyhd8ed1ab_0.tar.bz2#7de5386c8fea29e76b303f37dde4c352
 https://conda.anaconda.org/conda-forge/noarch/iniconfig-2.0.0-pyhd8ed1ab_0.conda#f800d2da156d08e289b14e87e43c1ae5
 https://conda.anaconda.org/conda-forge/linux-64/kiwisolver-1.4.5-py39h7633fee_1.conda#c9f74d717e5a2847a9f8b779c54130f2
 https://conda.anaconda.org/conda-forge/linux-64/lcms2-2.16-hb7c19ff_0.conda#51bb7010fc86f70eee639b4bb7a894f5
 https://conda.anaconda.org/conda-forge/linux-64/libblas-3.9.0-22_linux64_openblas.conda#1a2a0cd3153464fee6646f3dd6dad9b8
-https://conda.anaconda.org/conda-forge/linux-64/libclang-cpp15-15.0.7-default_h127d8a8_5.conda#d0a9633b53cdc319b8a1a532ae7822b8
-https://conda.anaconda.org/conda-forge/linux-64/libclang13-18.1.3-default_h5d6823c_0.conda#5fff487759736b275dc3e4a263cac666
 https://conda.anaconda.org/conda-forge/linux-64/libcups-2.3.3-h4637d8d_4.conda#d4529f4dff3057982a7617c7ac58fde3
-https://conda.anaconda.org/conda-forge/linux-64/libflac-1.4.3-h59595ed_0.conda#ee48bf17cc83a00f59ca1494d5646869
-https://conda.anaconda.org/conda-forge/linux-64/libgpg-error-1.48-h71f35ed_0.conda#4d18d86916705d352d5f4adfb7f0edd3
-https://conda.anaconda.org/conda-forge/linux-64/libpq-16.2-h33b98f1_1.conda#9e49ec2a61d02623b379dc332eb6889d
+https://conda.anaconda.org/conda-forge/linux-64/libllvm15-15.0.7-hb3ce162_4.conda#8a35df3cbc0c8b12cc8af9473ae75eef
+https://conda.anaconda.org/conda-forge/linux-64/libllvm18-18.1.8-hc9dba70_0.conda#f94ed0c5953c78dcca7adb953f4c5bfb
+https://conda.anaconda.org/conda-forge/linux-64/libpq-16.3-ha72fbe1_0.conda#bac737ae28b79cfbafd515258d97d29e
 https://conda.anaconda.org/conda-forge/linux-64/markupsafe-2.1.5-py39hd1e30aa_0.conda#9a9a22eb1f83c44953319ee3b027769f
 https://conda.anaconda.org/conda-forge/noarch/munkres-1.1.4-pyh9f0ad1d_0.tar.bz2#2ba8498c1018c1e9c61eb99b973dfe19
 https://conda.anaconda.org/conda-forge/noarch/networkx-3.2.1-pyhd8ed1ab_0.conda#425fce3b531bed6ec3c74fab3e5f0a1c
 https://conda.anaconda.org/conda-forge/linux-64/openblas-0.3.27-pthreads_h7a3da1a_0.conda#4b422ebe8fc6a5320d0c1c22e5a46032
 https://conda.anaconda.org/conda-forge/linux-64/openjpeg-2.5.2-h488ebb8_0.conda#7f2e286780f072ed750df46dc2631138
-https://conda.anaconda.org/conda-forge/noarch/packaging-24.0-pyhd8ed1ab_0.conda#248f521b64ce055e7feae3105e7abeb8
-https://conda.anaconda.org/conda-forge/noarch/platformdirs-4.2.0-pyhd8ed1ab_0.conda#a0bc3eec34b0fab84be6b2da94e98e20
-https://conda.anaconda.org/conda-forge/noarch/pluggy-1.4.0-pyhd8ed1ab_0.conda#139e9feb65187e916162917bb2484976
+https://conda.anaconda.org/conda-forge/noarch/packaging-24.1-pyhd8ed1ab_0.conda#cbe1bb1f21567018ce595d9c2be0f0db
+https://conda.anaconda.org/conda-forge/noarch/platformdirs-4.2.2-pyhd8ed1ab_0.conda#6f6cf28bf8e021933869bae3f84b8fc9
+https://conda.anaconda.org/conda-forge/noarch/pluggy-1.5.0-pyhd8ed1ab_0.conda#d3483c8fc2dc2cc3f5cf43e26d60cabf
 https://conda.anaconda.org/conda-forge/noarch/ply-3.11-pyhd8ed1ab_2.conda#18c6deb6f9602e32446398203c8f0e91
-https://conda.anaconda.org/conda-forge/linux-64/psutil-5.9.8-py39hd1e30aa_0.conda#ec86403fde8793ac1c36f8afa3d15902
-https://conda.anaconda.org/conda-forge/noarch/pygments-2.17.2-pyhd8ed1ab_0.conda#140a7f159396547e9799aa98f9f0742e
+https://conda.anaconda.org/conda-forge/linux-64/psutil-6.0.0-py39hd3abc70_0.conda#984987a2ef8c931691ad0d7fbb8ef3ca
+https://conda.anaconda.org/conda-forge/noarch/pycparser-2.22-pyhd8ed1ab_0.conda#844d9eb3b43095b031874477f7d70088
+https://conda.anaconda.org/conda-forge/noarch/pygments-2.18.0-pyhd8ed1ab_0.conda#b7f5c092b8f9800150d998a71b76d5a1
 https://conda.anaconda.org/conda-forge/noarch/pyparsing-3.1.2-pyhd8ed1ab_0.conda#b9a4dacf97241704529131a0dfc0494f
 https://conda.anaconda.org/conda-forge/noarch/pysocks-1.7.1-pyha2e5f31_6.tar.bz2#2a7de29fb590ca14b5243c4c812c8025
 https://conda.anaconda.org/conda-forge/noarch/python-tzdata-2024.1-pyhd8ed1ab_0.conda#98206ea9954216ee7540f0c773f2104d
 https://conda.anaconda.org/conda-forge/noarch/pytz-2024.1-pyhd8ed1ab_0.conda#3eeeeb9e4827ace8c0c1419c85d590ad
-https://conda.anaconda.org/conda-forge/noarch/setuptools-69.2.0-pyhd8ed1ab_0.conda#da214ecd521a720a9d521c68047682dc
+https://conda.anaconda.org/conda-forge/noarch/setuptools-70.1.1-pyhd8ed1ab_0.conda#985e9e86e1b0fc75a74a9bfab9309ef7
 https://conda.anaconda.org/conda-forge/noarch/six-1.16.0-pyh6c4a22f_0.tar.bz2#e5f25f8dbc060e9a8d912e432202afc2
 https://conda.anaconda.org/conda-forge/noarch/snowballstemmer-2.2.0-pyhd8ed1ab_0.tar.bz2#4d22a9315e78c6827f806065957d566e
+https://conda.anaconda.org/conda-forge/noarch/soupsieve-2.5-pyhd8ed1ab_1.conda#3f144b2c34f8cb5a9abd9ed23a39c561
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-jsmath-1.0.1-pyhd8ed1ab_0.conda#da1d979339e2714c30a8e806a33ec087
 https://conda.anaconda.org/conda-forge/noarch/tabulate-0.9.0-pyhd8ed1ab_1.tar.bz2#4759805cce2d914c38472f70bf4d8bcb
-https://conda.anaconda.org/conda-forge/noarch/tenacity-8.2.3-pyhd8ed1ab_0.conda#1482e77f87c6a702a7e05ef22c9b197b
-https://conda.anaconda.org/conda-forge/noarch/threadpoolctl-3.4.0-pyhc1e730c_0.conda#b296278eef667c673bf51de6535bad88
+https://conda.anaconda.org/conda-forge/noarch/tenacity-8.5.0-pyhd8ed1ab_0.conda#354cbc1244395cabbaec2617906d3a27
+https://conda.anaconda.org/conda-forge/noarch/threadpoolctl-3.5.0-pyhc1e730c_0.conda#df68d78237980a159bd7149f33c0e8fd
 https://conda.anaconda.org/conda-forge/noarch/toml-0.10.2-pyhd8ed1ab_0.tar.bz2#f832c45a477c78bebd107098db465095
 https://conda.anaconda.org/conda-forge/noarch/tomli-2.0.1-pyhd8ed1ab_0.tar.bz2#5844808ffab9ebdb694585b50ba02a96
-https://conda.anaconda.org/conda-forge/linux-64/tornado-6.4-py39hd1e30aa_0.conda#1e865e9188204cdfb1fd2531780add88
-https://conda.anaconda.org/conda-forge/noarch/typing_extensions-4.11.0-pyha770c72_0.conda#6ef2fc37559256cf682d8b3375e89b80
+https://conda.anaconda.org/conda-forge/linux-64/tornado-6.4.1-py39hd3abc70_0.conda#c183e99f9320e5e2d0f9c43efcb3fb22
+https://conda.anaconda.org/conda-forge/noarch/typing_extensions-4.12.2-pyha770c72_0.conda#ebe6952715e1d5eb567eeebf25250fa7
 https://conda.anaconda.org/conda-forge/linux-64/unicodedata2-15.1.0-py39hd1e30aa_0.conda#1da984bbb6e765743e13388ba7b7b2c8
 https://conda.anaconda.org/conda-forge/noarch/wheel-0.43.0-pyhd8ed1ab_1.conda#0b5293a157c2b5cd513dd1b03d8d3aae
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-image-0.4.0-h8ee46fc_1.conda#9d7bcddf49cbf727730af10e71022c73
-https://conda.anaconda.org/conda-forge/linux-64/xkeyboard-config-2.41-hd590300_0.conda#81f740407b45e3f9047b3174fa94eb9e
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-image-0.4.0-hb711507_2.conda#a0901183f08b6c7107aab109733a3c91
+https://conda.anaconda.org/conda-forge/linux-64/xkeyboard-config-2.42-h4ab18f5_0.conda#b193af204da1bfb8c13882d131a14bd2
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libxext-1.3.4-h0b41bf4_2.conda#82b6df12252e6f32402b96dacc656fec
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libxrender-0.9.11-hd590300_0.conda#ed67c36f215b310412b2af935bf3e530
-https://conda.anaconda.org/conda-forge/noarch/zipp-3.17.0-pyhd8ed1ab_0.conda#2e4d6bc0b14e10f895fc6791a7d9b26a
+https://conda.anaconda.org/conda-forge/noarch/zipp-3.19.2-pyhd8ed1ab_0.conda#49808e59df5535116f6878b2a820d6f4
+https://conda.anaconda.org/conda-forge/noarch/accessible-pygments-0.0.5-pyhd8ed1ab_0.conda#1bb1ef9806a9a20872434f58b3e7fc1a
 https://conda.anaconda.org/conda-forge/noarch/babel-2.14.0-pyhd8ed1ab_0.conda#9669586875baeced8fc30c0826c3270e
+https://conda.anaconda.org/conda-forge/noarch/beautifulsoup4-4.12.3-pyha770c72_0.conda#332493000404d8411859539a5a630865
 https://conda.anaconda.org/conda-forge/linux-64/brunsli-0.1-h9c3ff4c_0.tar.bz2#c1ac6229d0bfd14f8354ff9ad2a26cad
-https://conda.anaconda.org/conda-forge/linux-64/cairo-1.18.0-h3faef2a_0.conda#f907bb958910dc404647326ca80c263e
-https://conda.anaconda.org/conda-forge/linux-64/cxx-compiler-1.7.0-h00ab1b0_0.conda#b4537c98cb59f8725b0e1e65816b4a28
-https://conda.anaconda.org/conda-forge/linux-64/fonttools-4.51.0-py39hd1e30aa_0.conda#79f5dd8778873faa54e8f7b2729fe8a6
-https://conda.anaconda.org/conda-forge/linux-64/fortran-compiler-1.7.0-heb67821_0.conda#7ef7c0f111dad1c8006504a0f1ccd820
-https://conda.anaconda.org/conda-forge/linux-64/glib-2.80.0-hf2295e7_3.conda#1ade62526144055f05c3eb45ebae3b5b
-https://conda.anaconda.org/conda-forge/noarch/importlib-metadata-7.1.0-pyha770c72_0.conda#0896606848b2dc5cebdf111b6543aa04
+https://conda.anaconda.org/conda-forge/linux-64/c-compiler-1.7.0-hd590300_1.conda#e9dffe1056994133616378309f932d77
+https://conda.anaconda.org/conda-forge/linux-64/cairo-1.18.0-hbb29018_2.conda#b6d90276c5aee9b4407dd94eb0cd40a8
+https://conda.anaconda.org/conda-forge/linux-64/cffi-1.16.0-py39h7a31438_0.conda#ac992767d7f8ed2cb27e71e78f0fb2d7
+https://conda.anaconda.org/conda-forge/linux-64/fonttools-4.53.1-py39hcd6043d_0.conda#297804eca6ea16a835a869699095de1c
+https://conda.anaconda.org/conda-forge/linux-64/gfortran-12.3.0-h915e2ae_13.conda#da3ce6140908b41fb8fb205104b54ae6
+https://conda.anaconda.org/conda-forge/linux-64/gfortran_linux-64-12.3.0-h5877db1_9.conda#d77e515e624f3edb33ac89997322b5a8
+https://conda.anaconda.org/conda-forge/linux-64/glib-2.80.3-h8a4344b_1.conda#a3acc4920c9ca19cb6b295028d606477
+https://conda.anaconda.org/conda-forge/linux-64/gxx-12.3.0-h915e2ae_13.conda#c3a3cf9cf544bd621a18add719056529
+https://conda.anaconda.org/conda-forge/linux-64/gxx_linux-64-12.3.0-ha28b414_9.conda#26155c2e3afafee809654f86f434c234
+https://conda.anaconda.org/conda-forge/noarch/h2-4.1.0-pyhd8ed1ab_0.tar.bz2#b748fbf7060927a6e82df7cb5ee8f097
+https://conda.anaconda.org/conda-forge/noarch/importlib-metadata-8.0.0-pyha770c72_0.conda#3286556cdd99048d198f72c3f6f69103
 https://conda.anaconda.org/conda-forge/noarch/importlib_resources-6.4.0-pyhd8ed1ab_0.conda#c5d3907ad8bd7bf557521a1833cf7e6d
-https://conda.anaconda.org/conda-forge/noarch/jinja2-3.1.3-pyhd8ed1ab_0.conda#e7d8df6509ba635247ff9aea31134262
-https://conda.anaconda.org/conda-forge/noarch/joblib-1.3.2-pyhd8ed1ab_0.conda#4da50d410f553db77e62ab62ffaa1abc
+https://conda.anaconda.org/conda-forge/noarch/jinja2-3.1.4-pyhd8ed1ab_0.conda#7b86ecb7d3557821c649b3c31e3eb9f2
+https://conda.anaconda.org/conda-forge/noarch/joblib-1.4.2-pyhd8ed1ab_0.conda#25df261d4523d9f9783bcdb7208d872f
 https://conda.anaconda.org/conda-forge/linux-64/libcblas-3.9.0-22_linux64_openblas.conda#4b31699e0ec5de64d5896e580389c9a1
-https://conda.anaconda.org/conda-forge/linux-64/libgcrypt-1.10.3-hd590300_0.conda#32d16ad533c59bb0a3c5ffaf16110829
+https://conda.anaconda.org/conda-forge/linux-64/libclang-cpp15-15.0.7-default_h127d8a8_5.conda#d0a9633b53cdc319b8a1a532ae7822b8
+https://conda.anaconda.org/conda-forge/linux-64/libclang13-18.1.8-default_h6ae225f_0.conda#28ad2db5c14d2e23d7962b8389e2cc0b
+https://conda.anaconda.org/conda-forge/linux-64/libflac-1.4.3-h59595ed_0.conda#ee48bf17cc83a00f59ca1494d5646869
+https://conda.anaconda.org/conda-forge/linux-64/libgpg-error-1.50-h4f305b6_0.conda#0d7ff1a8e69565ca3add6925e18e708f
 https://conda.anaconda.org/conda-forge/linux-64/liblapack-3.9.0-22_linux64_openblas.conda#b083767b6c877e24ee597d93b87ab838
-https://conda.anaconda.org/conda-forge/linux-64/libsndfile-1.2.2-hc60ed4a_1.conda#ef1910918dd895516a769ed36b5b3a4e
-https://conda.anaconda.org/conda-forge/linux-64/libxkbcommon-1.7.0-h662e7e4_0.conda#b32c0da42b1f24a98577bb3d7fc0b995
+https://conda.anaconda.org/conda-forge/linux-64/libxkbcommon-1.7.0-h2c5496b_1.conda#e2eaefa4de2b7237af7c907b8bbc760a
 https://conda.anaconda.org/conda-forge/noarch/memory_profiler-0.61.0-pyhd8ed1ab_0.tar.bz2#8b45f9f2b2f7a98b0ec179c8991a4a9b
-https://conda.anaconda.org/conda-forge/noarch/meson-1.4.0-pyhd8ed1ab_0.conda#52a0660cfa40b45bf254ecc3374cb2e0
-https://conda.anaconda.org/conda-forge/linux-64/pillow-10.3.0-py39h90c7501_0.conda#1e3b6af9592be71ce19f0a6aae05d97b
+https://conda.anaconda.org/conda-forge/noarch/meson-1.4.1-pyhd8ed1ab_0.conda#714ca123839eeebb25d12b443067ea64
+https://conda.anaconda.org/conda-forge/linux-64/pillow-10.4.0-py39h16a7006_0.conda#d9a6b19174a6cf5185296b16f781951f
 https://conda.anaconda.org/conda-forge/noarch/pip-24.0-pyhd8ed1ab_0.conda#f586ac1e56c8638b64f9c8122a7b8a67
-https://conda.anaconda.org/conda-forge/noarch/plotly-5.19.0-pyhd8ed1ab_0.conda#669cd7065794633b9e64e6a9612ec700
-https://conda.anaconda.org/conda-forge/noarch/pyproject-metadata-0.7.1-pyhd8ed1ab_0.conda#dcb27826ffc94d5f04e241322239983b
-https://conda.anaconda.org/conda-forge/noarch/pytest-7.4.4-pyhd8ed1ab_0.conda#a9d145de8c5f064b5fa68fb34725d9f4
+https://conda.anaconda.org/conda-forge/noarch/plotly-5.22.0-pyhd8ed1ab_0.conda#5b409a5f738e7d76c2b426eddb7e9956
+https://conda.anaconda.org/conda-forge/noarch/pyproject-metadata-0.8.0-pyhd8ed1ab_0.conda#573fe09d7bd0cd4bcc210d8369b5ca47
+https://conda.anaconda.org/conda-forge/noarch/pytest-8.2.2-pyhd8ed1ab_0.conda#0f3f49c22c7ef3a1195fa61dad3c43be
 https://conda.anaconda.org/conda-forge/noarch/python-dateutil-2.9.0-pyhd8ed1ab_0.conda#2cf4264fffb9e6eff6031c5b6884d61c
 https://conda.anaconda.org/conda-forge/linux-64/sip-6.7.12-py39h3d6467e_0.conda#e667a3ab0df62c54e60e1843d2e6defb
-https://conda.anaconda.org/conda-forge/noarch/urllib3-2.2.1-pyhd8ed1ab_0.conda#08807a87fa7af10754d46f63b368e016
-https://conda.anaconda.org/conda-forge/linux-64/compilers-1.7.0-ha770c72_0.conda#81458b3aed8ab8711951ec3c0c04e097
-https://conda.anaconda.org/conda-forge/linux-64/gstreamer-1.24.1-h98fc4e7_1.conda#b04b5cdf3ba01430db27979250bc5a1d
-https://conda.anaconda.org/conda-forge/linux-64/harfbuzz-8.3.0-h3d44ed6_0.conda#5a6f6c00ef982a9bc83558d9ac8f64a0
+https://conda.anaconda.org/conda-forge/linux-64/cxx-compiler-1.7.0-h00ab1b0_1.conda#28de2e073db9ca9b72858bee9fb6f571
+https://conda.anaconda.org/conda-forge/linux-64/fortran-compiler-1.7.0-heb67821_1.conda#cf4b0e7c4c78bb0662aed9b27c414a3c
+https://conda.anaconda.org/conda-forge/linux-64/gstreamer-1.24.5-haf2f30d_0.conda#c5252c02592373fa8caf5a5327165a89
+https://conda.anaconda.org/conda-forge/linux-64/harfbuzz-8.5.0-hfac3d4d_0.conda#f5126317dd0ce0ba26945e411ecc6960
 https://conda.anaconda.org/conda-forge/noarch/importlib-resources-6.4.0-pyhd8ed1ab_0.conda#dcbadab7a68738a028e195ab68ab2d2e
 https://conda.anaconda.org/conda-forge/noarch/lazy_loader-0.4-pyhd8ed1ab_0.conda#a284ff318fbdb0dd83928275b4b6087c
+https://conda.anaconda.org/conda-forge/linux-64/libgcrypt-1.11.0-h4ab18f5_0.conda#0a00e32cabe3e571c0611387e7bc2042
 https://conda.anaconda.org/conda-forge/linux-64/liblapacke-3.9.0-22_linux64_openblas.conda#1fd156abd41a4992835952f6f4d951d0
-https://conda.anaconda.org/conda-forge/linux-64/libsystemd0-255-h3516f8a_1.conda#3366af27f0b593544a6cd453c7932ac5
-https://conda.anaconda.org/conda-forge/noarch/meson-python-0.15.0-pyh0c530f3_0.conda#3bc64565ca78ce3bb80248d09926d8f9
-https://conda.anaconda.org/conda-forge/linux-64/numpy-1.26.4-py39h474f0d3_0.conda#aa265f5697237aa13cc10f53fa8acc4f
+https://conda.anaconda.org/conda-forge/linux-64/libsndfile-1.2.2-hc60ed4a_1.conda#ef1910918dd895516a769ed36b5b3a4e
+https://conda.anaconda.org/conda-forge/noarch/meson-python-0.16.0-pyh0c530f3_0.conda#e16f0dbf502da873be9f9adb0dc52547
+https://conda.anaconda.org/conda-forge/linux-64/numpy-2.0.0-py39ha0965c0_0.conda#b411be2728ba5711fc9bcdb0efa2db71
 https://conda.anaconda.org/conda-forge/linux-64/pyqt5-sip-12.12.2-py39h3d6467e_5.conda#93aff412f3e49fdb43361c0215cbd72d
-https://conda.anaconda.org/conda-forge/noarch/pytest-xdist-3.5.0-pyhd8ed1ab_0.conda#d5f595da2daead898ca958ac62f0307b
-https://conda.anaconda.org/conda-forge/noarch/requests-2.31.0-pyhd8ed1ab_0.conda#a30144e4156cdbb236f99ebb49828f8b
+https://conda.anaconda.org/conda-forge/noarch/pytest-xdist-3.6.1-pyhd8ed1ab_0.conda#b39568655c127a9c4a44d178ac99b6d0
+https://conda.anaconda.org/conda-forge/linux-64/zstandard-0.22.0-py39h81c9582_1.conda#c1dd22d67b1f8cef888b64b688b71ffd
 https://conda.anaconda.org/conda-forge/linux-64/blas-devel-3.9.0-22_linux64_openblas.conda#63ddb593595c9cf5eb08d3de54d66df8
+https://conda.anaconda.org/conda-forge/linux-64/compilers-1.7.0-ha770c72_1.conda#d8d07866ac3b5b6937213c89a1874f08
 https://conda.anaconda.org/conda-forge/linux-64/contourpy-1.2.1-py39h7633fee_0.conda#bdc188e59857d6efab332714e0d01d93
-https://conda.anaconda.org/conda-forge/linux-64/gst-plugins-base-1.24.1-hfa15dee_1.conda#a6dd2bbc684913e2bef0a54ce56fcbfb
-https://conda.anaconda.org/conda-forge/linux-64/imagecodecs-2024.1.1-py39h426505d_3.conda#91109406c37fc9c1477d7861614aefa5
-https://conda.anaconda.org/conda-forge/noarch/imageio-2.34.0-pyh4b66e23_0.conda#b8853659d596f967c661f544dd89ede7
-https://conda.anaconda.org/conda-forge/linux-64/pandas-2.2.1-py39hddac248_0.conda#85293a042c24a08e71b7608ee66b6134
+https://conda.anaconda.org/conda-forge/linux-64/gst-plugins-base-1.24.5-hbaaba92_0.conda#4a485842570569ba754863b2c083b346
+https://conda.anaconda.org/conda-forge/linux-64/imagecodecs-2024.6.1-py39h34cef29_2.conda#d3ee926e63ebd5b44ebc984dff020305
+https://conda.anaconda.org/conda-forge/noarch/imageio-2.34.2-pyh12aca89_0.conda#97ad994fae55dce96bd397054b32e41a
+https://conda.anaconda.org/conda-forge/linux-64/libsystemd0-255-h3516f8a_1.conda#3366af27f0b593544a6cd453c7932ac5
+https://conda.anaconda.org/conda-forge/linux-64/pandas-2.2.2-py39hfc16268_1.conda#8b23d2b425035a7468d17e6fe1d54124
 https://conda.anaconda.org/conda-forge/noarch/patsy-0.5.6-pyhd8ed1ab_0.conda#a5b55d1cb110cdcedc748b5c3e16e687
-https://conda.anaconda.org/conda-forge/linux-64/polars-0.20.18-py39h87fa3cb_0.conda#1620dcc1eb23e9591e1620390f6bdec2
-https://conda.anaconda.org/conda-forge/noarch/pooch-1.8.1-pyhd8ed1ab_0.conda#d15917f33140f8d2ac9ca44db7ec8a25
-https://conda.anaconda.org/conda-forge/linux-64/pulseaudio-client-17.0-hb77b528_0.conda#07f45f1be1c25345faddb8db0de8039b
-https://conda.anaconda.org/conda-forge/linux-64/pywavelets-1.4.1-py39h44dd56e_1.conda#d037c20e3da2e85f03ebd20ad480c359
-https://conda.anaconda.org/conda-forge/linux-64/scipy-1.13.0-py39h474f0d3_0.conda#46ae0ecba9726ab4fa44c78fefa522cf
+https://conda.anaconda.org/conda-forge/linux-64/polars-1.1.0-py39hb5f13dd_0.conda#61a75ef5fe438c5c08c154cf6a085586
+https://conda.anaconda.org/conda-forge/linux-64/pywavelets-1.6.0-py39hd92a3bb_0.conda#32e26e16f60c568b17a82e3033a4d309
+https://conda.anaconda.org/conda-forge/linux-64/scipy-1.13.1-py39haf93ffa_0.conda#492a2cd65862d16a4aaf535ae9ccb761
+https://conda.anaconda.org/conda-forge/noarch/urllib3-2.2.2-pyhd8ed1ab_1.conda#e804c43f58255e977093a2298e442bb8
 https://conda.anaconda.org/conda-forge/linux-64/blas-2.122-openblas.conda#5065468105542a8b23ea47bd8b6fa55f
-https://conda.anaconda.org/conda-forge/linux-64/matplotlib-base-3.8.3-py39he9076e7_0.conda#5456bdfe5809ebf5689eda6c808b686e
-https://conda.anaconda.org/conda-forge/linux-64/pyamg-5.1.0-py39hda80f44_0.conda#f225666c47726329201b604060f1436c
-https://conda.anaconda.org/conda-forge/linux-64/qt-main-5.15.8-hc9dc06e_21.conda#b325046180590c868ce0dbf267b82eb8
-https://conda.anaconda.org/conda-forge/linux-64/statsmodels-0.14.1-py39h44dd56e_0.conda#dc565186b972bd87e49b9c35390ddd8c
-https://conda.anaconda.org/conda-forge/noarch/tifffile-2024.2.12-pyhd8ed1ab_0.conda#d5c8bef52be4e70c48b1400eec3eecc8
+https://conda.anaconda.org/conda-forge/linux-64/matplotlib-base-3.8.4-py39h10d1fc8_2.conda#c9fb6571b93b1dd490ea627af7344f36
+https://conda.anaconda.org/conda-forge/linux-64/pulseaudio-client-17.0-hb77b528_0.conda#07f45f1be1c25345faddb8db0de8039b
+https://conda.anaconda.org/conda-forge/linux-64/pyamg-5.2.1-py39h85c637f_0.conda#0bfaf33b7ebdbadc77bf9a67e281c0b1
+https://conda.anaconda.org/conda-forge/noarch/requests-2.32.3-pyhd8ed1ab_0.conda#5ede4753180c7a550a443c430dc8ab52
+https://conda.anaconda.org/conda-forge/linux-64/statsmodels-0.14.2-py39hd92a3bb_0.conda#2f6c03d60e71f13d92d511b06193f007
+https://conda.anaconda.org/conda-forge/noarch/tifffile-2024.6.18-pyhd8ed1ab_0.conda#7c3077529bfe3b86f9425d526d73bd24
+https://conda.anaconda.org/conda-forge/noarch/pooch-1.8.2-pyhd8ed1ab_0.conda#8dab97d8a9616e07d779782995710aed
+https://conda.anaconda.org/conda-forge/linux-64/qt-main-5.15.8-ha2b5568_22.conda#15de976572f24032540236006d6d0e9f
+https://conda.anaconda.org/conda-forge/linux-64/scikit-image-0.24.0-py39hfc16268_1.conda#e44bdf0eaeb6c48211541ee7fadc9f2f
+https://conda.anaconda.org/conda-forge/noarch/seaborn-base-0.13.2-pyhd8ed1ab_2.conda#b713b116feaf98acdba93ad4d7f90ca1
 https://conda.anaconda.org/conda-forge/linux-64/pyqt-5.15.9-py39h52134e7_5.conda#e1f148e57d071b09187719df86f513c1
-https://conda.anaconda.org/conda-forge/linux-64/scikit-image-0.22.0-py39hddac248_2.conda#8d502a4d2cbe5a45ff35ca8af8cbec0a
-https://conda.anaconda.org/conda-forge/noarch/seaborn-base-0.13.2-pyhd8ed1ab_0.conda#0918a9201e824211cdf444dbf8d55752
-https://conda.anaconda.org/conda-forge/linux-64/matplotlib-3.8.3-py39hf3d152e_0.conda#983f5b77540eb5aa00238e72ec9b1dfb
-https://conda.anaconda.org/conda-forge/noarch/seaborn-0.13.2-hd8ed1ab_0.conda#fd31ebf5867914de597f9961c478e482
-https://conda.anaconda.org/conda-forge/noarch/numpydoc-1.7.0-pyhd8ed1ab_0.conda#1ad3afced398492586ca1bef70328be4
+https://conda.anaconda.org/conda-forge/noarch/seaborn-0.13.2-hd8ed1ab_2.conda#a79d8797f62715255308d92d3a91ef2e
+https://conda.anaconda.org/conda-forge/linux-64/matplotlib-3.8.4-py39hf3d152e_2.conda#bd956c7563b6a6b27521b83623c74e22
+https://conda.anaconda.org/conda-forge/noarch/numpydoc-1.7.0-pyhd8ed1ab_1.conda#66798cbfdcb003d9fbccd92cd08eb3ac
+https://conda.anaconda.org/conda-forge/noarch/pydata-sphinx-theme-0.15.4-pyhd8ed1ab_0.conda#c7c50dd5192caa58a05e6a4248a27acb
 https://conda.anaconda.org/conda-forge/noarch/sphinx-copybutton-0.5.2-pyhd8ed1ab_0.conda#ac832cc43adc79118cf6e23f1f9b8995
-https://conda.anaconda.org/conda-forge/noarch/sphinx-gallery-0.15.0-pyhd8ed1ab_0.conda#1a49ca9515ef9a96edff2eea06143dc6
+https://conda.anaconda.org/conda-forge/noarch/sphinx-design-0.6.0-pyhd8ed1ab_0.conda#b04f3c04e4f7939c6207dc0c0355f468
+https://conda.anaconda.org/conda-forge/noarch/sphinx-gallery-0.16.0-pyhd8ed1ab_0.conda#add28691ee89e875b190eda07929d5d4
 https://conda.anaconda.org/conda-forge/noarch/sphinx-prompt-1.4.0-pyhd8ed1ab_0.tar.bz2#88ee91e8679603f2a5bd036d52919cc2
+https://conda.anaconda.org/conda-forge/noarch/sphinx-remove-toctrees-1.0.0.post1-pyhd8ed1ab_0.conda#6dee8412218288a17f99f2cfffab334d
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-applehelp-1.0.8-pyhd8ed1ab_0.conda#611a35a27914fac3aa37611a6fe40bb5
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-devhelp-1.0.6-pyhd8ed1ab_0.conda#d7e4954df0d3aea2eacc7835ad12671d
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-htmlhelp-2.0.5-pyhd8ed1ab_0.conda#7e1e7437273682ada2ed5e9e9714b140
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-qthelp-1.0.7-pyhd8ed1ab_0.conda#26acae54b06f178681bfb551760f5dd1
-https://conda.anaconda.org/conda-forge/noarch/sphinx-7.2.6-pyhd8ed1ab_0.conda#bbfd1120d1824d2d073bc65935f0e4c0
+https://conda.anaconda.org/conda-forge/noarch/sphinx-7.3.7-pyhd8ed1ab_0.conda#7b1465205e28d75d2c0e1a868ee00a67
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-serializinghtml-1.1.10-pyhd8ed1ab_0.conda#e507335cb4ca9cff4c3d0fa9cdab255e
 https://conda.anaconda.org/conda-forge/noarch/sphinxext-opengraph-0.9.1-pyhd8ed1ab_0.conda#286283e05a1eff606f55e7cd70f6d7f7
 # pip attrs @ https://files.pythonhosted.org/packages/e0/44/827b2a91a5816512fcaf3cc4ebc465ccd5d598c45cefa6703fcf4a79018f/attrs-23.2.0-py3-none-any.whl#sha256=99b87a485a5820b23b879f04c2305b44b951b502fd64be915879d77a7e8fc6f1
 # pip cloudpickle @ https://files.pythonhosted.org/packages/96/43/dae06432d0c4b1dc9e9149ad37b4ca8384cf6eb7700cd9215b177b914f0a/cloudpickle-3.0.0-py3-none-any.whl#sha256=246ee7d0c295602a036e86369c77fecda4ab17b506496730f2f576d9016fd9c7
 # pip defusedxml @ https://files.pythonhosted.org/packages/07/6c/aa3f2f849e01cb6a001cd8554a88d4c77c5c1a31c95bdf1cf9301e6d9ef4/defusedxml-0.7.1-py2.py3-none-any.whl#sha256=a352e7e428770286cc899e2542b6cdaedb2b4953ff269a210103ec58f6198a61
-# pip fastjsonschema @ https://files.pythonhosted.org/packages/9c/b9/79691036d4a8f9857e74d1728b23f34f583b81350a27492edda58d5604e1/fastjsonschema-2.19.1-py3-none-any.whl#sha256=3672b47bc94178c9f23dbb654bf47440155d4db9df5f7bc47643315f9c405cd0
+# pip fastjsonschema @ https://files.pythonhosted.org/packages/6d/ca/086311cdfc017ec964b2436fe0c98c1f4efcb7e4c328956a22456e497655/fastjsonschema-2.20.0-py3-none-any.whl#sha256=5875f0b0fa7a0043a91e93a9b8f793bcbbba9691e7fd83dca95c28ba26d21f0a
 # pip fqdn @ https://files.pythonhosted.org/packages/cf/58/8acf1b3e91c58313ce5cb67df61001fc9dcd21be4fadb76c1a2d540e09ed/fqdn-1.5.1-py3-none-any.whl#sha256=3a179af3761e4df6eb2e026ff9e1a3033d3587bf980a0b1b2e1e5d08d7358014
-# pip json5 @ https://files.pythonhosted.org/packages/26/2f/f93ccd68858c0005445fbdad053417b7eaab87aaf31bd2b506a9005d0dfd/json5-0.9.24-py3-none-any.whl#sha256=4ca101fd5c7cb47960c055ef8f4d0e31e15a7c6c48c3b6f1473fc83b6c462a13
-# pip jsonpointer @ https://files.pythonhosted.org/packages/12/f6/0232cc0c617e195f06f810534d00b74d2f348fe71b2118009ad8ad31f878/jsonpointer-2.4-py2.py3-none-any.whl#sha256=15d51bba20eea3165644553647711d150376234112651b4f1811022aecad7d7a
+# pip json5 @ https://files.pythonhosted.org/packages/8a/3c/4f8791ee53ab9eeb0b022205aa79387119a74cc9429582ce04098e6fc540/json5-0.9.25-py3-none-any.whl#sha256=34ed7d834b1341a86987ed52f3f76cd8ee184394906b6e22a1e0deb9ab294e8f
+# pip jsonpointer @ https://files.pythonhosted.org/packages/71/92/5e77f98553e9e75130c78900d000368476aed74276eb8ae8796f65f00918/jsonpointer-3.0.0-py2.py3-none-any.whl#sha256=13e088adc14fca8b6aa8177c044e12701e6ad4b28ff10e65f2267a90109c9942
 # pip jupyterlab-pygments @ https://files.pythonhosted.org/packages/b1/dd/ead9d8ea85bf202d90cc513b533f9c363121c7792674f78e0d8a854b63b4/jupyterlab_pygments-0.3.0-py3-none-any.whl#sha256=841a89020971da1d8693f1a99997aefc5dc424bb1b251fd6322462a1b8842780
+# pip libsass @ https://files.pythonhosted.org/packages/fd/5a/eb5b62641df0459a3291fc206cf5bd669c0feed7814dded8edef4ade8512/libsass-0.23.0-cp38-abi3-manylinux_2_5_x86_64.manylinux1_x86_64.whl#sha256=4a218406d605f325d234e4678bd57126a66a88841cb95bee2caeafdc6f138306
 # pip mistune @ https://files.pythonhosted.org/packages/f0/74/c95adcdf032956d9ef6c89a9b8a5152bf73915f8c633f3e3d88d06bd699c/mistune-3.0.2-py3-none-any.whl#sha256=71481854c30fdbc938963d3605b72501f5c10a9320ecd412c121c163a1c7d205
 # pip overrides @ https://files.pythonhosted.org/packages/2c/ab/fc8290c6a4c722e5514d80f62b2dc4c4df1a68a41d1364e625c35990fcf3/overrides-7.7.0-py3-none-any.whl#sha256=c7ed9d062f78b8e4c1a7b70bd8796b35ead4d9f510227ef9c5dc7626c60d7e49
 # pip pandocfilters @ https://files.pythonhosted.org/packages/ef/af/4fbc8cab944db5d21b7e2a5b8e9211a03a79852b1157e2c102fcc61ac440/pandocfilters-1.5.1-py2.py3-none-any.whl#sha256=93be382804a9cdb0a7267585f157e5d1731bbe5545a85b268d6f5fe6232de2bc
-# pip pkginfo @ https://files.pythonhosted.org/packages/56/09/054aea9b7534a15ad38a363a2bd974c20646ab1582a387a95b8df1bfea1c/pkginfo-1.10.0-py3-none-any.whl#sha256=889a6da2ed7ffc58ab5b900d888ddce90bce912f2d2de1dc1c26f4cb9fe65097
+# pip pkginfo @ https://files.pythonhosted.org/packages/c0/38/d617739840a2f576e400f03fea0a75703f93cc274002635b4b998bbb9de4/pkginfo-1.11.1-py3-none-any.whl#sha256=bfa76a714fdfc18a045fcd684dbfc3816b603d9d075febef17cb6582bea29573
 # pip prometheus-client @ https://files.pythonhosted.org/packages/c7/98/745b810d822103adca2df8decd4c0bbe839ba7ad3511af3f0d09692fc0f0/prometheus_client-0.20.0-py3-none-any.whl#sha256=cde524a85bce83ca359cc837f28b8c0db5cac7aa653a588fd7e84ba061c329e7
 # pip ptyprocess @ https://files.pythonhosted.org/packages/22/a6/858897256d0deac81a172289110f31629fc4cee19b6f01283303e18c8db3/ptyprocess-0.7.0-py2.py3-none-any.whl#sha256=4b41f3967fce3af57cc7e94b888626c18bf37a083e3651ca8feeb66d492fef35
-# pip pycparser @ https://files.pythonhosted.org/packages/13/a3/a812df4e2dd5696d1f351d58b8fe16a405b234ad2886a0dab9183fb78109/pycparser-2.22-py3-none-any.whl#sha256=c3702b6d3dd8c7abc1afa565d7e63d53a1d0bd86cdc24edd75470f4de499cfcc
 # pip python-json-logger @ https://files.pythonhosted.org/packages/35/a6/145655273568ee78a581e734cf35beb9e33a370b29c5d3c8fee3744de29f/python_json_logger-2.0.7-py3-none-any.whl#sha256=f380b826a991ebbe3de4d897aeec42760035ac760345e57b812938dc8b35e2bd
 # pip pyyaml @ https://files.pythonhosted.org/packages/7d/39/472f2554a0f1e825bd7c5afc11c817cd7a2f3657460f7159f691fbb37c51/PyYAML-6.0.1-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=bc1bf2925a1ecd43da378f4db9e4f799775d6367bdb94671027b73b393a7c42c
 # pip rfc3986-validator @ https://files.pythonhosted.org/packages/9e/51/17023c0f8f1869d8806b979a2bffa3f861f26a3f1a66b094288323fba52f/rfc3986_validator-0.1.1-py2.py3-none-any.whl#sha256=2f235c432ef459970b4306369336b9d5dbdda31b510ca1e327636e01f528bfa9
-# pip rpds-py @ https://files.pythonhosted.org/packages/fd/ea/92231b62681961812e9fbd8ef9be7137856784406bf6a384976bb7b46472/rpds_py-0.18.0-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=ddc2f4dfd396c7bfa18e6ce371cba60e4cf9d2e5cdb71376aa2da264605b60b9
+# pip rpds-py @ https://files.pythonhosted.org/packages/97/b1/12238bd8cdf3cef71e85188af133399bfde1bddf319007361cc869d6f6a7/rpds_py-0.18.1-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=e4c39ad2f512b4041343ea3c7894339e4ca7839ac38ca83d68a832fc8b3748ab
 # pip send2trash @ https://files.pythonhosted.org/packages/40/b0/4562db6223154aa4e22f939003cb92514c79f3d4dccca3444253fd17f902/Send2Trash-1.8.3-py3-none-any.whl#sha256=0c31227e0bd08961c7665474a3d1ef7193929fedda4233843689baa056be46c9
 # pip sniffio @ https://files.pythonhosted.org/packages/e9/44/75a9c9421471a6c4805dbf2356f7c181a29c1879239abab1ea2cc8f38b40/sniffio-1.3.1-py3-none-any.whl#sha256=2f6da418d1f1e0fddd844478f41680e794e6051915791a034ff65e5f100525a2
-# pip soupsieve @ https://files.pythonhosted.org/packages/4c/f3/038b302fdfbe3be7da016777069f26ceefe11a681055ea1f7817546508e3/soupsieve-2.5-py3-none-any.whl#sha256=eaa337ff55a1579b6549dc679565eac1e3d000563bcb1c8ab0d0fefbc0c2cdc7
-# pip traitlets @ https://files.pythonhosted.org/packages/7c/c4/366a09036c07f46eb8c9b2af39c97f502ef24f11f2a6e4d763655d9f2708/traitlets-5.14.2-py3-none-any.whl#sha256=fcdf85684a772ddeba87db2f398ce00b40ff550d1528c03c14dbf6a02003cd80
+# pip traitlets @ https://files.pythonhosted.org/packages/00/c0/8f5d070730d7836adc9c9b6408dec68c6ced86b304a9b26a14df072a6e8c/traitlets-5.14.3-py3-none-any.whl#sha256=b74e89e397b1ed28cc831db7aea759ba6640cb3de13090ca145426688ff1ac4f
 # pip types-python-dateutil @ https://files.pythonhosted.org/packages/c7/1b/af4f4c4f3f7339a4b7eb3c0ab13416db98f8ac09de3399129ee5fdfa282b/types_python_dateutil-2.9.0.20240316-py3-none-any.whl#sha256=6b8cb66d960771ce5ff974e9dd45e38facb81718cc1e208b10b1baccbfdbee3b
 # pip uri-template @ https://files.pythonhosted.org/packages/e7/00/3fca040d7cf8a32776d3d81a00c8ee7457e00f80c649f1e4a863c8321ae9/uri_template-1.3.0-py3-none-any.whl#sha256=a44a133ea12d44a0c0f06d7d42a52d71282e77e2f937d8abd5655b8d56fc1363
-# pip webcolors @ https://files.pythonhosted.org/packages/d5/e1/3e9013159b4cbb71df9bd7611cbf90dc2c621c8aeeb677fc41dad72f2261/webcolors-1.13-py3-none-any.whl#sha256=29bc7e8752c0a1bd4a1f03c14d6e6a72e93d82193738fa860cbff59d0fcc11bf
+# pip webcolors @ https://files.pythonhosted.org/packages/3b/45/0c30e10a2ac52606476394e4ba11cf3b12ba5823e7fbb9167f80eee6000a/webcolors-24.6.0-py3-none-any.whl#sha256=8cf5bc7e28defd1d48b9e83d5fc30741328305a8195c29a8e668fa45586568a1
 # pip webencodings @ https://files.pythonhosted.org/packages/f4/24/2a3e3df732393fed8b3ebf2ec078f05546de641fe1b667ee316ec1dcf3b7/webencodings-0.5.1-py2.py3-none-any.whl#sha256=a0af1213f3c2226497a97e2b3aa01a7e4bee4f403f95be16fc9acd2947514a78
-# pip websocket-client @ https://files.pythonhosted.org/packages/1e/70/1e88138a9afbed1d37093b85f0bebc3011623c4f47c166431599fe9d6c93/websocket_client-1.7.0-py3-none-any.whl#sha256=f4c3d22fec12a2461427a29957ff07d35098ee2d976d3ba244e688b8b4057588
-# pip anyio @ https://files.pythonhosted.org/packages/14/fd/2f20c40b45e4fb4324834aea24bd4afdf1143390242c0b33774da0e2e34f/anyio-4.3.0-py3-none-any.whl#sha256=048e05d0f6caeed70d731f3db756d35dcc1f35747c8c403364a8332c630441b8
+# pip websocket-client @ https://files.pythonhosted.org/packages/5a/84/44687a29792a70e111c5c477230a72c4b957d88d16141199bf9acb7537a3/websocket_client-1.8.0-py3-none-any.whl#sha256=17b44cc997f5c498e809b22cdf2d9c7a9e71c02c8cc2b6c56e7c2d1239bfa526
+# pip anyio @ https://files.pythonhosted.org/packages/7b/a2/10639a79341f6c019dedc95bd48a4928eed9f1d1197f4c04f546fc7ae0ff/anyio-4.4.0-py3-none-any.whl#sha256=c1b2d8f46a8a812513012e1107cb0e68c17159a7a594208005a57dc776e1bdc7
+# pip argon2-cffi-bindings @ https://files.pythonhosted.org/packages/ec/f7/378254e6dd7ae6f31fe40c8649eea7d4832a42243acaf0f1fff9083b2bed/argon2_cffi_bindings-21.2.0-cp36-abi3-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=b746dba803a79238e925d9046a63aa26bf86ab2a2fe74ce6b009a1c3f5c8f2ae
 # pip arrow @ https://files.pythonhosted.org/packages/f8/ed/e97229a566617f2ae958a6b13e7cc0f585470eac730a73e9e82c32a3cdd2/arrow-1.3.0-py3-none-any.whl#sha256=c728b120ebc00eb84e01882a6f5e7927a53960aa990ce7dd2b10f39005a67f80
-# pip beautifulsoup4 @ https://files.pythonhosted.org/packages/b1/fe/e8c672695b37eecc5cbf43e1d0638d88d66ba3a44c4d321c796f4e59167f/beautifulsoup4-4.12.3-py3-none-any.whl#sha256=b80878c9f40111313e55da8ba20bdba06d8fa3969fc68304167741bbf9e082ed
 # pip bleach @ https://files.pythonhosted.org/packages/ea/63/da7237f805089ecc28a3f36bca6a21c31fcbc2eb380f3b8f1be3312abd14/bleach-6.1.0-py3-none-any.whl#sha256=3225f354cfc436b9789c66c4ee030194bee0568fbf9cbdad3bc8b5c26c5f12b6
-# pip cffi @ https://files.pythonhosted.org/packages/ea/ac/e9e77bc385729035143e54cc8c4785bd480eaca9df17565963556b0b7a93/cffi-1.16.0-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=8f8e709127c6c77446a8c0a8c8bf3c8ee706a06cd44b1e827c3e6a2ee6b8c098
 # pip doit @ https://files.pythonhosted.org/packages/44/83/a2960d2c975836daa629a73995134fd86520c101412578c57da3d2aa71ee/doit-0.36.0-py3-none-any.whl#sha256=ebc285f6666871b5300091c26eafdff3de968a6bd60ea35dd1e3fc6f2e32479a
 # pip jupyter-core @ https://files.pythonhosted.org/packages/c9/fb/108ecd1fe961941959ad0ee4e12ee7b8b1477247f30b1fdfd83ceaf017f0/jupyter_core-5.7.2-py3-none-any.whl#sha256=4f7315d2f6b4bcf2e3e7cb6e46772eba760ae459cd1f59d29eb57b0a01bd7409
-# pip referencing @ https://files.pythonhosted.org/packages/42/8e/ae1de7b12223986e949bdb886c004de7c304b6fa94de5b87c926c1099656/referencing-0.34.0-py3-none-any.whl#sha256=d53ae300ceddd3169f1ffa9caf2cb7b769e92657e4fafb23d34b93679116dfd4
+# pip pyzmq @ https://files.pythonhosted.org/packages/64/b8/1c181c13e118cabccfd25bd3e169e44958c649180b0d78b798a66899e08b/pyzmq-26.0.3-cp39-cp39-manylinux_2_12_x86_64.manylinux2010_x86_64.whl#sha256=b3cd31f859b662ac5d7f4226ec7d8bd60384fa037fc02aee6ff0b53ba29a3ba8
+# pip referencing @ https://files.pythonhosted.org/packages/b7/59/2056f61236782a2c86b33906c025d4f4a0b17be0161b63b70fd9e8775d36/referencing-0.35.1-py3-none-any.whl#sha256=eda6d3234d62814d1c64e305c1331c9a3a6132da475ab6382eaa997b21ee75de
 # pip rfc3339-validator @ https://files.pythonhosted.org/packages/7b/44/4e421b96b67b2daff264473f7465db72fbdf36a07e05494f50300cc7b0c6/rfc3339_validator-0.1.4-py2.py3-none-any.whl#sha256=24f6ec1eda14ef823da9e36ec7113124b39c04d50a4d3d3a3c2859577e7791fa
+# pip sphinxcontrib-sass @ https://files.pythonhosted.org/packages/2e/87/7c2eb08e3ca1d6baae32c0a5e005330fe1cec93a36aa085e714c3b3a3c7d/sphinxcontrib_sass-0.3.4-py2.py3-none-any.whl#sha256=a0c79a44ae8b8935c02dc340ebe40c9e002c839331201c899dc93708970c355a
 # pip terminado @ https://files.pythonhosted.org/packages/6a/9e/2064975477fdc887e47ad42157e214526dcad8f317a948dee17e1659a62f/terminado-0.18.1-py3-none-any.whl#sha256=a4468e1b37bb318f8a86514f65814e1afc977cf29b3992a4500d9dd305dcceb0
-# pip tinycss2 @ https://files.pythonhosted.org/packages/da/99/fd23634d6962c2791fb8cb6ccae1f05dcbfc39bce36bba8b1c9a8d92eae8/tinycss2-1.2.1-py3-none-any.whl#sha256=2b80a96d41e7c3914b8cda8bc7f705a4d9c49275616e886103dd839dfc847847
-# pip argon2-cffi-bindings @ https://files.pythonhosted.org/packages/ec/f7/378254e6dd7ae6f31fe40c8649eea7d4832a42243acaf0f1fff9083b2bed/argon2_cffi_bindings-21.2.0-cp36-abi3-manylinux_2_17_x86_64.manylinux2014_x86_64.whl#sha256=b746dba803a79238e925d9046a63aa26bf86ab2a2fe74ce6b009a1c3f5c8f2ae
+# pip tinycss2 @ https://files.pythonhosted.org/packages/2c/4d/0db5b8a613d2a59bbc29bc5bb44a2f8070eb9ceab11c50d477502a8a0092/tinycss2-1.3.0-py3-none-any.whl#sha256=54a8dbdffb334d536851be0226030e9505965bb2f30f21a4a82c55fb2a80fae7
+# pip argon2-cffi @ https://files.pythonhosted.org/packages/a4/6a/e8a041599e78b6b3752da48000b14c8d1e8a04ded09c88c714ba047f34f5/argon2_cffi-23.1.0-py3-none-any.whl#sha256=c670642b78ba29641818ab2e68bd4e6a78ba53b7eff7b4c3815ae16abf91c7ea
 # pip isoduration @ https://files.pythonhosted.org/packages/7b/55/e5326141505c5d5e34c5e0935d2908a74e4561eca44108fbfb9c13d2911a/isoduration-20.11.0-py3-none-any.whl#sha256=b2904c2a4228c3d44f409c8ae8e2370eb21a26f7ac2ec5446df141dde3452042
 # pip jsonschema-specifications @ https://files.pythonhosted.org/packages/ee/07/44bd408781594c4d0a027666ef27fab1e441b109dc3b76b4f836f8fd04fe/jsonschema_specifications-2023.12.1-py3-none-any.whl#sha256=87e4fdf3a94858b8a2ba2778d9ba57d8a9cafca7c7489c46ba0d30a8bc6a9c3c
+# pip jupyter-client @ https://files.pythonhosted.org/packages/cf/d3/c4bb02580bc0db807edb9a29b2d0c56031be1ef0d804336deb2699a470f6/jupyter_client-8.6.2-py3-none-any.whl#sha256=50cbc5c66fd1b8f65ecb66bc490ab73217993632809b6e505687de18e9dea39f
 # pip jupyter-server-terminals @ https://files.pythonhosted.org/packages/07/2d/2b32cdbe8d2a602f697a649798554e4f072115438e92249624e532e8aca6/jupyter_server_terminals-0.5.3-py3-none-any.whl#sha256=41ee0d7dc0ebf2809c668e0fc726dfaf258fcd3e769568996ca731b6194ae9aa
 # pip jupyterlite-core @ https://files.pythonhosted.org/packages/05/d2/1d59d9a70d684b1eb3eb3a0b80a36b4e1d691e94af5d53aee56b1ad5240b/jupyterlite_core-0.3.0-py3-none-any.whl#sha256=247cc34ae6fedda41b15ce4778997164508b2039bc92480665cadfe955193467
-# pip pyzmq @ https://files.pythonhosted.org/packages/76/8b/6fca99e22c6316917de32b17be299dea431544209d619da16b6d9ec85c83/pyzmq-25.1.2-cp39-cp39-manylinux_2_12_x86_64.manylinux2010_x86_64.whl#sha256=c0b5ca88a8928147b7b1e2dfa09f3b6c256bc1135a1338536cbc9ea13d3b7add
-# pip argon2-cffi @ https://files.pythonhosted.org/packages/a4/6a/e8a041599e78b6b3752da48000b14c8d1e8a04ded09c88c714ba047f34f5/argon2_cffi-23.1.0-py3-none-any.whl#sha256=c670642b78ba29641818ab2e68bd4e6a78ba53b7eff7b4c3815ae16abf91c7ea
-# pip jsonschema @ https://files.pythonhosted.org/packages/39/9d/b035d024c62c85f2e2d4806a59ca7b8520307f34e0932fbc8cc75fe7b2d9/jsonschema-4.21.1-py3-none-any.whl#sha256=7996507afae316306f9e2290407761157c6f78002dcf7419acb99822143d1c6f
-# pip jupyter-client @ https://files.pythonhosted.org/packages/75/6d/d7b55b9c1ac802ab066b3e5015e90faab1fffbbd67a2af498ffc6cc81c97/jupyter_client-8.6.1-py3-none-any.whl#sha256=3b7bd22f058434e3b9a7ea4b1500ed47de2713872288c0d511d19926f99b459f
-# pip jupyterlite-pyodide-kernel @ https://files.pythonhosted.org/packages/83/bf/749279904094015d5cb7e030dd7a111f8b013b9f1809d954d04ebe0c1197/jupyterlite_pyodide_kernel-0.3.1-py3-none-any.whl#sha256=ac9d9dd95adcced57d465a7b298f220d8785845c017ad3abf2a3677ff02631c6
+# pip jsonschema @ https://files.pythonhosted.org/packages/c8/2f/324fab4be6fe37fb7b521546e8a557e6cf08c1c1b3d0b4839a00f589d9ef/jsonschema-4.22.0-py3-none-any.whl#sha256=ff4cfd6b1367a40e7bc6411caec72effadd3db0bbe5017de188f2d6108335802
+# pip jupyterlite-pyodide-kernel @ https://files.pythonhosted.org/packages/42/ce/87fadd7eaa01caaa564d3345025b983f72b4200abc82245068bd2664fb56/jupyterlite_pyodide_kernel-0.3.2-py3-none-any.whl#sha256=ae600571fa755b6fd7a2633a171de3fe490f2b1264bef32cdd7e8c34c95cd5ff
 # pip jupyter-events @ https://files.pythonhosted.org/packages/a5/94/059180ea70a9a326e1815176b2370da56376da347a796f8c4f0b830208ef/jupyter_events-0.10.0-py3-none-any.whl#sha256=4b72130875e59d57716d327ea70d3ebc3af1944d3717e5a498b8a06c6c159960
 # pip nbformat @ https://files.pythonhosted.org/packages/a9/82/0340caa499416c78e5d8f5f05947ae4bc3cba53c9f038ab6e9ed964e22f1/nbformat-5.10.4-py3-none-any.whl#sha256=3b48d6c8fbca4b299bf3982ea7db1af21580e4fec269ad087b9e81588891200b
 # pip nbclient @ https://files.pythonhosted.org/packages/66/e8/00517a23d3eeaed0513e718fbc94aab26eaa1758f5690fc8578839791c79/nbclient-0.10.0-py3-none-any.whl#sha256=f13e3529332a1f1f81d82a53210322476a168bb7090a0289c795fe9cc11c9d3f
-# pip nbconvert @ https://files.pythonhosted.org/packages/23/8a/8d67cbd984739247e4b205c1143e2f71b25b4f71e180fe70f7cb2cf02633/nbconvert-7.16.3-py3-none-any.whl#sha256=ddeff14beeeedf3dd0bc506623e41e4507e551736de59df69a91f86700292b3b
-# pip jupyter-server @ https://files.pythonhosted.org/packages/95/85/483b8e09a897d1bc2194646d30d4ce6ae166106e91ecbd11d6b6d9ccfc36/jupyter_server-2.13.0-py3-none-any.whl#sha256=77b2b49c3831fbbfbdb5048cef4350d12946191f833a24e5f83e5f8f4803e97b
-# pip jupyterlab-server @ https://files.pythonhosted.org/packages/6a/c9/b270a875916b18f137bb30ecd05031a2f05c95d47a8e8fbd3f805a72f593/jupyterlab_server-2.26.0-py3-none-any.whl#sha256=54622cbd330526a385ee0c1fdccdff3a1e7219bf3e864a335284a1270a1973df
-# pip jupyterlite-sphinx @ https://files.pythonhosted.org/packages/38/c9/5f1142c005cf8d75830b10029e53f074324bc85cfca1f1d0f22a207b771c/jupyterlite_sphinx-0.9.3-py3-none-any.whl#sha256=be6332d16490ea2fa90b78187a2c5e1c357195966a25741d60b1790346571041
+# pip nbconvert @ https://files.pythonhosted.org/packages/b8/bb/bb5b6a515d1584aa2fd89965b11db6632e4bdc69495a52374bcc36e56cfa/nbconvert-7.16.4-py3-none-any.whl#sha256=05873c620fe520b6322bf8a5ad562692343fe3452abda5765c7a34b7d1aa3eb3
+# pip jupyter-server @ https://files.pythonhosted.org/packages/26/f5/be75c159deda5b54e15cf54029915ad28337fcfef402d671566c45f9e61f/jupyter_server-2.14.1-py3-none-any.whl#sha256=16f7177c3a4ea8fe37784e2d31271981a812f0b2874af17339031dc3510cc2a5
+# pip jupyterlab-server @ https://files.pythonhosted.org/packages/cb/46/d5ffd7c0f63db4e9f0982c3d58efeea10fc5f47e79fb328431df78843772/jupyterlab_server-2.27.2-py3-none-any.whl#sha256=54aa2d64fd86383b5438d9f0c032f043c4d8c0264b8af9f60bd061157466ea43
+# pip jupyterlite-sphinx @ https://files.pythonhosted.org/packages/71/2c/bd797dc46a7281d43444c79ff312d4f8d27d41a0de05f48cad81c7939966/jupyterlite_sphinx-0.15.0-py3-none-any.whl#sha256=344d1f9ee5a20b141a4a4139874eae30a68216f0c995d03ea2e3b3e9d29c4cd5
diff --git a/build_tools/circle/doc_min_dependencies_environment.yml b/build_tools/circle/doc_min_dependencies_environment.yml
index 298a60e8ec4ff..e27c3a700fdad 100644
--- a/build_tools/circle/doc_min_dependencies_environment.yml
+++ b/build_tools/circle/doc_min_dependencies_environment.yml
@@ -14,7 +14,7 @@ dependencies:
   - matplotlib=3.3.4  # min
   - pandas=1.1.5  # min
   - pyamg
-  - pytest<8
+  - pytest
   - pytest-xdist
   - pillow
   - pip
@@ -24,14 +24,18 @@ dependencies:
   - seaborn
   - memory_profiler
   - compilers
-  - sphinx=6.0.0  # min
-  - sphinx-gallery=0.15.0  # min
+  - sphinx=7.3.7  # min
+  - sphinx-gallery=0.16.0  # min
   - sphinx-copybutton=0.5.2  # min
   - numpydoc=1.2.0  # min
-  - sphinx-prompt=1.3.0  # min
+  - sphinx-prompt=1.4.0  # min
   - plotly=5.14.0  # min
-  - polars=0.19.12  # min
-  - pooch
+  - polars=0.20.23  # min
+  - pooch=1.6.0  # min
+  - sphinx-remove-toctrees=1.0.0.post1  # min
+  - sphinx-design=0.5.0  # min
+  - pydata-sphinx-theme=0.15.3  # min
   - pip
   - pip:
-    - sphinxext-opengraph==0.4.2  # min
+    - sphinxext-opengraph==0.9.1  # min
+    - sphinxcontrib-sass==0.3.4  # min
diff --git a/build_tools/circle/doc_min_dependencies_linux-64_conda.lock b/build_tools/circle/doc_min_dependencies_linux-64_conda.lock
index 8d65d424bc3b1..7e1e34d47bd1c 100644
--- a/build_tools/circle/doc_min_dependencies_linux-64_conda.lock
+++ b/build_tools/circle/doc_min_dependencies_linux-64_conda.lock
@@ -1,63 +1,58 @@
 # Generated by conda-lock.
 # platform: linux-64
-# input_hash: ccbcfb88676b9c5585cb85ec6b62ee679937e2d63c4abcdefc6e79e58539f5a3
+# input_hash: 433b1585e49151feaef8c61dcbd44b6b72bc2e4c7741317e6b0795a0106fa0cf
 @EXPLICIT
 https://conda.anaconda.org/conda-forge/linux-64/_libgcc_mutex-0.1-conda_forge.tar.bz2#d7c89558ba9fa0495403155b64376d81
-https://conda.anaconda.org/conda-forge/linux-64/ca-certificates-2024.2.2-hbcca054_0.conda#2f4327a1cbe7f022401b236e915a5fef
+https://conda.anaconda.org/conda-forge/linux-64/ca-certificates-2024.7.4-hbcca054_0.conda#23ab7665c5f63cfb9f1f6195256daac6
 https://conda.anaconda.org/conda-forge/noarch/font-ttf-dejavu-sans-mono-2.37-hab24e00_0.tar.bz2#0c96522c6bdaed4b1566d11387caaf45
 https://conda.anaconda.org/conda-forge/noarch/font-ttf-inconsolata-3.000-h77eed37_0.tar.bz2#34893075a5c9e55cdafac56607368fc6
 https://conda.anaconda.org/conda-forge/noarch/font-ttf-source-code-pro-2.038-h77eed37_0.tar.bz2#4d59c254e01d9cde7957100457e2d5fb
-https://conda.anaconda.org/conda-forge/noarch/font-ttf-ubuntu-0.83-h77eed37_1.conda#6185f640c43843e5ad6fd1c5372c3f80
+https://conda.anaconda.org/conda-forge/noarch/font-ttf-ubuntu-0.83-h77eed37_2.conda#cbbe59391138ea5ad3658c76912e147f
 https://conda.anaconda.org/conda-forge/noarch/kernel-headers_linux-64-2.6.32-he073ed8_17.conda#d731b543793afc0433c4fd593e693fce
-https://conda.anaconda.org/conda-forge/linux-64/ld_impl_linux-64-2.40-h41732ed_0.conda#7aca3059a1729aa76c597603f10b0dd3
-https://conda.anaconda.org/conda-forge/noarch/libgcc-devel_linux-64-12.3.0-h8bca6fd_105.conda#e12ce6b051085b8f27e239f5e5f5bce5
-https://conda.anaconda.org/conda-forge/noarch/libstdcxx-devel_linux-64-12.3.0-h8bca6fd_105.conda#b3c6062c84a8e172555ee104ea6a01ab
-https://conda.anaconda.org/conda-forge/linux-64/libstdcxx-ng-13.2.0-h7e041cc_5.conda#f6f6600d18a4047b54f803cf708b868a
-https://conda.anaconda.org/conda-forge/linux-64/mkl-include-2024.1.0-ha957f24_691.conda#bdcce3a990987f46e24418be09ef2b45
+https://conda.anaconda.org/conda-forge/linux-64/ld_impl_linux-64-2.40-hf3520f5_7.conda#b80f2f396ca2c28b8c14c437a4ed1e74
+https://conda.anaconda.org/conda-forge/linux-64/mkl-include-2024.1.0-ha957f24_693.conda#249c91c2186d236c6d180342241db2ec
 https://conda.anaconda.org/conda-forge/linux-64/python_abi-3.9-4_cp39.conda#bfe4b3259a8ac6cdf0037752904da6a7
 https://conda.anaconda.org/conda-forge/noarch/tzdata-2024a-h0c530f3_0.conda#161081fc7cec0bfda0d86d7cb595f8d8
 https://conda.anaconda.org/conda-forge/noarch/fonts-conda-forge-1-0.tar.bz2#f766549260d6815b0c52253f1fb1bb29
-https://conda.anaconda.org/conda-forge/linux-64/libgomp-13.2.0-h807b86a_5.conda#d211c42b9ce49aee3734fdc828731689
+https://conda.anaconda.org/conda-forge/noarch/libgcc-devel_linux-64-12.3.0-h6b66f73_113.conda#7fc690ec9db2902e5ee90cebfdab31e7
+https://conda.anaconda.org/conda-forge/linux-64/libgomp-14.1.0-h77fa898_0.conda#ae061a5ed5f05818acdf9adab72c146d
+https://conda.anaconda.org/conda-forge/noarch/libstdcxx-devel_linux-64-12.3.0-h6b66f73_113.conda#3706e34877bd82d04cb1e9e9baeb2739
 https://conda.anaconda.org/conda-forge/noarch/sysroot_linux-64-2.12-he073ed8_17.conda#595db67e32b276298ff3d94d07d47fbf
-https://conda.anaconda.org/conda-forge/linux-64/binutils_impl_linux-64-2.40-hf600244_0.conda#33084421a8c0af6aef1b439707f7662a
+https://conda.anaconda.org/conda-forge/linux-64/binutils_impl_linux-64-2.40-ha1999f0_7.conda#3f840c7ed70a96b5ebde8044b2f36f32
 https://conda.anaconda.org/conda-forge/noarch/fonts-conda-ecosystem-1-0.tar.bz2#fee5683a3f04bd15cbd8318b096a27ab
-https://conda.anaconda.org/conda-forge/linux-64/binutils-2.40-hdd6e379_0.conda#ccc940fddbc3fcd3d79cd4c654c4b5c4
-https://conda.anaconda.org/conda-forge/linux-64/binutils_linux-64-2.40-hdade7a5_3.conda#2d9a60578bc28469d9aeef9aea5520c3
+https://conda.anaconda.org/conda-forge/linux-64/binutils-2.40-h4852527_7.conda#df53aa8418f8c289ae9b9665986034f8
+https://conda.anaconda.org/conda-forge/linux-64/binutils_linux-64-2.40-hb3c18ed_9.conda#bb3fb8553a669828501e80d13b6bd744
 https://conda.anaconda.org/conda-forge/linux-64/_openmp_mutex-4.5-2_kmp_llvm.tar.bz2#562b26ba2e19059551a811e72ab7f793
-https://conda.anaconda.org/conda-forge/linux-64/libgcc-ng-13.2.0-h807b86a_5.conda#d4ff227c46917d3b4565302a2bbb276b
-https://conda.anaconda.org/conda-forge/linux-64/alsa-lib-1.2.11-hd590300_1.conda#0bb492cca54017ea314b809b1ee3a176
+https://conda.anaconda.org/conda-forge/linux-64/libgcc-ng-14.1.0-h77fa898_0.conda#ca0fad6a41ddaef54a153b78eccb5037
+https://conda.anaconda.org/conda-forge/linux-64/alsa-lib-1.2.12-h4ab18f5_0.conda#7ed427f0871fd41cb1d9c17727c17589
 https://conda.anaconda.org/conda-forge/linux-64/attr-2.5.1-h166bdaf_1.tar.bz2#d9c69a24ad678ffce24c6543a0176b00
 https://conda.anaconda.org/conda-forge/linux-64/bzip2-1.0.8-hd590300_5.conda#69b8b6202a07720f448be700e300ccf4
+https://conda.anaconda.org/conda-forge/linux-64/dav1d-1.2.1-hd590300_0.conda#418c6ca5929a611cbd69204907a83995
 https://conda.anaconda.org/conda-forge/linux-64/gettext-tools-0.22.5-h59595ed_2.conda#985f2f453fb72408d6b6f1be0f324033
-https://conda.anaconda.org/conda-forge/linux-64/graphite2-1.3.13-h59595ed_1003.conda#f87c7b7c2cb45f323ffbce941c78ab7c
-https://conda.anaconda.org/conda-forge/linux-64/icu-73.2-h59595ed_0.conda#cc47e1facc155f91abd89b11e48e72ff
+https://conda.anaconda.org/conda-forge/linux-64/giflib-5.2.2-hd590300_0.conda#3bf7b9fd5a7136126e0234db4b87c8b6
+https://conda.anaconda.org/conda-forge/linux-64/jxrlib-1.1-hd590300_3.conda#5aeabe88534ea4169d4c49998f293d6c
 https://conda.anaconda.org/conda-forge/linux-64/keyutils-1.6.1-h166bdaf_0.tar.bz2#30186d27e2c9fa62b45fb1476b7200e3
 https://conda.anaconda.org/conda-forge/linux-64/lame-3.100-h166bdaf_1003.tar.bz2#a8832b479f93521a9e7b5b743803be51
-https://conda.anaconda.org/conda-forge/linux-64/lerc-4.0.0-h27087fc_0.tar.bz2#76bbff344f0134279f225174e9064c8f
-https://conda.anaconda.org/conda-forge/linux-64/libasprintf-0.22.5-h661eb56_2.conda#dd197c968bf9760bba0031888d431ede
+https://conda.anaconda.org/conda-forge/linux-64/libbrotlicommon-1.1.0-hd590300_1.conda#aec6c91c7371c26392a06708a73c70e5
 https://conda.anaconda.org/conda-forge/linux-64/libdeflate-1.20-hd590300_0.conda#8e88f9389f1165d7c0936fe40d9a9a79
 https://conda.anaconda.org/conda-forge/linux-64/libexpat-2.6.2-h59595ed_0.conda#e7ba12deb7020dd080c6c70e7b6f6a3d
 https://conda.anaconda.org/conda-forge/linux-64/libffi-3.4.2-h7f98852_5.tar.bz2#d645c6d2ac96843a2bfaccd2d62b3ac3
 https://conda.anaconda.org/conda-forge/linux-64/libgettextpo-0.22.5-h59595ed_2.conda#172bcc51059416e7ce99e7b528cede83
-https://conda.anaconda.org/conda-forge/linux-64/libgfortran5-13.2.0-ha4646dd_5.conda#7a6bd7a12a4bd359e2afe6c0fa1acace
+https://conda.anaconda.org/conda-forge/linux-64/libgfortran5-14.1.0-hc5f4f2c_0.conda#6456c2620c990cd8dde2428a27ba0bc5
 https://conda.anaconda.org/conda-forge/linux-64/libiconv-1.17-hd590300_2.conda#d66573916ffcf376178462f1b61c941e
 https://conda.anaconda.org/conda-forge/linux-64/libjpeg-turbo-3.0.0-hd590300_1.conda#ea25936bb4080d843790b586850f82b8
 https://conda.anaconda.org/conda-forge/linux-64/libnsl-2.0.1-hd590300_0.conda#30fd6e37fe21f86f4bd26d6ee73eeec7
-https://conda.anaconda.org/conda-forge/linux-64/libogg-1.3.4-h7f98852_1.tar.bz2#6e8cc2173440d77708196c5b93771680
+https://conda.anaconda.org/conda-forge/linux-64/libogg-1.3.5-h4ab18f5_0.conda#601bfb4b3c6f0b844443bb81a56651e0
 https://conda.anaconda.org/conda-forge/linux-64/libopus-1.3.1-h7f98852_1.tar.bz2#15345e56d527b330e1cacbdf58676e8f
-https://conda.anaconda.org/conda-forge/linux-64/libsanitizer-12.3.0-h0f45ef3_5.conda#11d1ceacff40054d5a74b12975d76f20
+https://conda.anaconda.org/conda-forge/linux-64/libstdcxx-ng-14.1.0-hc0a3c3a_0.conda#1cb187a157136398ddbaae90713e2498
 https://conda.anaconda.org/conda-forge/linux-64/libuuid-2.38.1-h0b41bf4_0.conda#40b61aab5c7ba9ff276c41cfffe6b80b
-https://conda.anaconda.org/conda-forge/linux-64/libwebp-base-1.3.2-hd590300_0.conda#30de3fd9b3b602f7473f30e684eeea8c
+https://conda.anaconda.org/conda-forge/linux-64/libwebp-base-1.4.0-hd590300_0.conda#b26e8aa824079e1be0294e7152ca4559
 https://conda.anaconda.org/conda-forge/linux-64/libxcrypt-4.4.36-hd590300_1.conda#5aa797f8787fe7a17d1b0821485b5adc
-https://conda.anaconda.org/conda-forge/linux-64/libzlib-1.2.13-hd590300_5.conda#f36c115f1ee199da648e0597ec2047ad
-https://conda.anaconda.org/conda-forge/linux-64/lz4-c-1.9.4-hcb278e6_0.conda#318b08df404f9c9be5712aaa5a6f0bb0
-https://conda.anaconda.org/conda-forge/linux-64/mpg123-1.32.6-h59595ed_0.conda#9160cdeb523a1b20cf8d2a0bf821f45d
-https://conda.anaconda.org/conda-forge/linux-64/ncurses-6.4.20240210-h59595ed_0.conda#97da8860a0da5413c7c98a3b3838a645
-https://conda.anaconda.org/conda-forge/linux-64/ninja-1.11.1-h924138e_0.conda#73a4953a2d9c115bdc10ff30a52f675f
-https://conda.anaconda.org/conda-forge/linux-64/nspr-4.35-h27087fc_0.conda#da0ec11a6454ae19bff5b02ed881a2b1
-https://conda.anaconda.org/conda-forge/linux-64/openssl-3.2.1-hd590300_1.conda#9d731343cff6ee2e5a25c4a091bf8e2a
-https://conda.anaconda.org/conda-forge/linux-64/pixman-0.43.2-h59595ed_0.conda#71004cbf7924e19c02746ccde9fd7123
+https://conda.anaconda.org/conda-forge/linux-64/libzlib-1.3.1-h4ab18f5_1.conda#57d7dc60e9325e3de37ff8dffd18e814
+https://conda.anaconda.org/conda-forge/linux-64/ncurses-6.5-h59595ed_0.conda#fcea371545eda051b6deafb24889fc69
+https://conda.anaconda.org/conda-forge/linux-64/openssl-3.3.1-h4ab18f5_1.conda#b1e9d076f14e8d776213fd5047b4c3d9
 https://conda.anaconda.org/conda-forge/linux-64/pthread-stubs-0.4-h36c2ea0_1001.tar.bz2#22dad4df6e8630e8dff2428f6f6a7036
+https://conda.anaconda.org/conda-forge/linux-64/rav1e-0.6.6-he8a937b_2.conda#77d9955b4abddb811cb8ab1aa7d743e4
 https://conda.anaconda.org/conda-forge/linux-64/xorg-kbproto-1.0.7-h7f98852_1002.tar.bz2#4b230e8381279d76131116660f5a241a
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libice-1.1.1-hd590300_0.conda#b462a33c0be1421532f28bfe8f4a7514
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libxau-1.0.11-hd590300_0.conda#2c80dc38fface310c9bd81b17037fee5
@@ -68,51 +63,70 @@ https://conda.anaconda.org/conda-forge/linux-64/xorg-xf86vidmodeproto-2.3.1-h7f9
 https://conda.anaconda.org/conda-forge/linux-64/xorg-xproto-7.0.31-h7f98852_1007.tar.bz2#b4a4381d54784606820704f7b5f05a15
 https://conda.anaconda.org/conda-forge/linux-64/xz-5.2.6-h166bdaf_0.tar.bz2#2161070d867d1b1204ea749c8eec4ef0
 https://conda.anaconda.org/conda-forge/linux-64/yaml-0.2.5-h7f98852_2.tar.bz2#4cb3ad778ec2d5a7acbdf254eb1c42ae
+https://conda.anaconda.org/conda-forge/linux-64/aom-3.9.1-hac33072_0.conda#346722a0be40f6edc53f12640d301338
+https://conda.anaconda.org/conda-forge/linux-64/charls-2.4.2-h59595ed_0.conda#4336bd67920dd504cd8c6761d6a99645
 https://conda.anaconda.org/conda-forge/linux-64/expat-2.6.2-h59595ed_0.conda#53fb86322bdb89496d7579fe3f02fd61
-https://conda.anaconda.org/conda-forge/linux-64/gcc_impl_linux-64-12.3.0-he2b93b0_5.conda#e89827619e73df59496c708b94f6f3d5
-https://conda.anaconda.org/conda-forge/linux-64/libasprintf-devel-0.22.5-h661eb56_2.conda#02e41ab5834dcdcc8590cf29d9526f50
+https://conda.anaconda.org/conda-forge/linux-64/graphite2-1.3.13-h59595ed_1003.conda#f87c7b7c2cb45f323ffbce941c78ab7c
+https://conda.anaconda.org/conda-forge/linux-64/icu-73.2-h59595ed_0.conda#cc47e1facc155f91abd89b11e48e72ff
+https://conda.anaconda.org/conda-forge/linux-64/lerc-4.0.0-h27087fc_0.tar.bz2#76bbff344f0134279f225174e9064c8f
+https://conda.anaconda.org/conda-forge/linux-64/libaec-1.1.3-h59595ed_0.conda#5e97e271911b8b2001a8b71860c32faa
+https://conda.anaconda.org/conda-forge/linux-64/libasprintf-0.22.5-h661eb56_2.conda#dd197c968bf9760bba0031888d431ede
+https://conda.anaconda.org/conda-forge/linux-64/libbrotlidec-1.1.0-hd590300_1.conda#f07002e225d7a60a694d42a7bf5ff53f
+https://conda.anaconda.org/conda-forge/linux-64/libbrotlienc-1.1.0-hd590300_1.conda#5fc11c6020d421960607d821310fcd4d
 https://conda.anaconda.org/conda-forge/linux-64/libcap-2.69-h0f662aa_0.conda#25cb5999faa414e5ccb2c1388f62d3d5
 https://conda.anaconda.org/conda-forge/linux-64/libedit-3.1.20191231-he28a2e2_2.tar.bz2#4d331e44109e3f0e19b4cb8f9b82f3e1
 https://conda.anaconda.org/conda-forge/linux-64/libevent-2.1.12-hf998b51_1.conda#a1cfcc585f0c42bf8d5546bb1dfb668d
 https://conda.anaconda.org/conda-forge/linux-64/libgettextpo-devel-0.22.5-h59595ed_2.conda#b63d9b6da3653179a278077f0de20014
-https://conda.anaconda.org/conda-forge/linux-64/libgfortran-ng-13.2.0-h69a702a_5.conda#e73e9cfd1191783392131e6238bdb3e9
+https://conda.anaconda.org/conda-forge/linux-64/libgfortran-ng-14.1.0-h69a702a_0.conda#f4ca84fbd6d06b0a052fb2d5b96dde41
+https://conda.anaconda.org/conda-forge/linux-64/libhwy-1.1.0-h00ab1b0_0.conda#88928158ccfe797eac29ef5e03f7d23d
 https://conda.anaconda.org/conda-forge/linux-64/libpng-1.6.43-h2797004_0.conda#009981dd9cfcaa4dbfa25ffaed86bcae
-https://conda.anaconda.org/conda-forge/linux-64/libsqlite-3.45.2-h2797004_0.conda#866983a220e27a80cb75e85cb30466a1
+https://conda.anaconda.org/conda-forge/linux-64/libsanitizer-12.3.0-hb8811af_13.conda#448dc960d50a75e8286b8427028ec56e
+https://conda.anaconda.org/conda-forge/linux-64/libsqlite-3.46.0-hde9e2c9_0.conda#18aa975d2094c34aef978060ae7da7d8
 https://conda.anaconda.org/conda-forge/linux-64/libvorbis-1.3.7-h9c3ff4c_0.tar.bz2#309dec04b70a3cc0f1e84a4013683bc0
-https://conda.anaconda.org/conda-forge/linux-64/libxcb-1.15-h0b41bf4_0.conda#33277193f5b92bad9fdd230eb700929c
-https://conda.anaconda.org/conda-forge/linux-64/libxml2-2.12.6-h232c23b_1.conda#6853448e9ca1cfd5f15382afd2a6d123
+https://conda.anaconda.org/conda-forge/linux-64/libxcb-1.16-hd590300_0.conda#151cba22b85a989c2d6ef9633ffee1e4
+https://conda.anaconda.org/conda-forge/linux-64/libzopfli-1.0.3-h9c3ff4c_0.tar.bz2#c66fe2d123249af7651ebde8984c51c2
+https://conda.anaconda.org/conda-forge/linux-64/lz4-c-1.9.4-hcb278e6_0.conda#318b08df404f9c9be5712aaa5a6f0bb0
+https://conda.anaconda.org/conda-forge/linux-64/mpg123-1.32.6-h59595ed_0.conda#9160cdeb523a1b20cf8d2a0bf821f45d
 https://conda.anaconda.org/conda-forge/linux-64/mysql-common-8.3.0-hf1915f5_4.conda#784a4df6676c581ca624fbe460703a6d
-https://conda.anaconda.org/conda-forge/linux-64/pcre2-10.43-hcad00b1_0.conda#8292dea9e022d9610a11fce5e0896ed8
+https://conda.anaconda.org/conda-forge/linux-64/ninja-1.12.1-h297d8ca_0.conda#3aa1c7e292afeff25a0091ddd7c69b72
+https://conda.anaconda.org/conda-forge/linux-64/nspr-4.35-h27087fc_0.conda#da0ec11a6454ae19bff5b02ed881a2b1
+https://conda.anaconda.org/conda-forge/linux-64/pcre2-10.44-h0f59acf_0.conda#3914f7ac1761dce57102c72ca7c35d01
+https://conda.anaconda.org/conda-forge/linux-64/pixman-0.43.2-h59595ed_0.conda#71004cbf7924e19c02746ccde9fd7123
 https://conda.anaconda.org/conda-forge/linux-64/readline-8.2-h8228510_1.conda#47d31b792659ce70f470b5c82fdfb7a4
+https://conda.anaconda.org/conda-forge/linux-64/snappy-1.2.1-ha2e4443_0.conda#6b7dcc7349efd123d493d2dbe85a045f
+https://conda.anaconda.org/conda-forge/linux-64/svt-av1-2.1.2-hac33072_0.conda#06c5dec4ebb47213b648a6c4dc8400d6
 https://conda.anaconda.org/conda-forge/linux-64/tk-8.6.13-noxft_h4845f30_101.conda#d453b98d9c83e71da0741bb0ff4d76bc
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libsm-1.2.4-h7391055_0.conda#93ee23f12bc2e684548181256edd2cf6
-https://conda.anaconda.org/conda-forge/linux-64/zlib-1.2.13-hd590300_5.conda#68c34ec6149623be41a1933ab996a209
-https://conda.anaconda.org/conda-forge/linux-64/zstd-1.5.5-hfc55251_0.conda#04b88013080254850d6c01ed54810589
+https://conda.anaconda.org/conda-forge/linux-64/zfp-1.0.1-hac33072_1.conda#df96b7266e49529d82de467b23977452
+https://conda.anaconda.org/conda-forge/linux-64/zlib-1.3.1-h4ab18f5_1.conda#9653f1bf3766164d0e65fa723cabbc54
+https://conda.anaconda.org/conda-forge/linux-64/zlib-ng-2.2.1-he02047a_0.conda#8fd1654184917db2cb74fc84cb4fff79
+https://conda.anaconda.org/conda-forge/linux-64/zstd-1.5.6-ha6fb4c9_0.conda#4d056880988120e29d75bfff282e0f45
+https://conda.anaconda.org/conda-forge/linux-64/blosc-1.21.6-hef167b5_0.conda#54fe76ab3d0189acaef95156874db7f9
+https://conda.anaconda.org/conda-forge/linux-64/brotli-bin-1.1.0-hd590300_1.conda#39f910d205726805a958da408ca194ba
+https://conda.anaconda.org/conda-forge/linux-64/c-blosc2-2.15.0-h6d6b9e4_1.conda#0dbd746357ef08ceb6c732c391e6a98c
 https://conda.anaconda.org/conda-forge/linux-64/freetype-2.12.1-h267a509_2.conda#9ae35c3d96db2c94ce0cef86efdfa2cb
-https://conda.anaconda.org/conda-forge/linux-64/gcc-12.3.0-h95e488c_3.conda#413e326f8a01d041ffbfbb51cea46a93
-https://conda.anaconda.org/conda-forge/linux-64/gcc_linux-64-12.3.0-h6477408_3.conda#7a53f84c45bdf4656ba27b9e9ed68b3d
-https://conda.anaconda.org/conda-forge/linux-64/gettext-0.22.5-h59595ed_2.conda#219ba82e95d7614cf7140d2a4afc0926
-https://conda.anaconda.org/conda-forge/linux-64/gfortran_impl_linux-64-12.3.0-hfcedea8_5.conda#4d72ee7c82f8a9b2ecef4fcefa9acd19
-https://conda.anaconda.org/conda-forge/linux-64/gxx_impl_linux-64-12.3.0-he2b93b0_5.conda#cddba8fd94e52012abea1caad722b9c2
-https://conda.anaconda.org/conda-forge/linux-64/krb5-1.21.2-h659d440_0.conda#cd95826dbd331ed1be26bdf401432844
-https://conda.anaconda.org/conda-forge/linux-64/libglib-2.80.0-hf2295e7_3.conda#569d25ad54594080778abff56a611dc7
-https://conda.anaconda.org/conda-forge/linux-64/libhwloc-2.9.3-default_h554bfaf_1009.conda#f36ddc11ca46958197a45effdd286e45
-https://conda.anaconda.org/conda-forge/linux-64/libllvm15-15.0.7-hb3ce162_4.conda#8a35df3cbc0c8b12cc8af9473ae75eef
-https://conda.anaconda.org/conda-forge/linux-64/libllvm18-18.1.3-h2448989_0.conda#927b6d6e80b2c0d4405a58b61ca248a3
+https://conda.anaconda.org/conda-forge/linux-64/gcc_impl_linux-64-12.3.0-h58ffeeb_13.conda#93325fff774c4cc8dcc8c65039cb4646
+https://conda.anaconda.org/conda-forge/linux-64/krb5-1.21.3-h659f571_0.conda#3f43953b7d3fb3aaa1d0d0723d91e368
+https://conda.anaconda.org/conda-forge/linux-64/libasprintf-devel-0.22.5-h661eb56_2.conda#02e41ab5834dcdcc8590cf29d9526f50
+https://conda.anaconda.org/conda-forge/linux-64/libavif16-1.0.4-h9b56c87_5.conda#fc2577679cbe608fa0e17d049d1733d0
+https://conda.anaconda.org/conda-forge/linux-64/libglib-2.80.3-h8a4344b_1.conda#6ea440297aacee4893f02ad759e6ffbc
+https://conda.anaconda.org/conda-forge/linux-64/libjxl-0.10.2-hcae5a98_0.conda#901db891e1e21afd8524cd636a8c8e3b
 https://conda.anaconda.org/conda-forge/linux-64/libtiff-4.6.0-h1dd3fc0_3.conda#66f03896ffbe1a110ffda05c7a856504
-https://conda.anaconda.org/conda-forge/linux-64/llvm-openmp-18.1.2-h4dfa4b3_0.conda#0118c8a03e3dbbb6b348ef71e94ac7af
+https://conda.anaconda.org/conda-forge/linux-64/libxml2-2.12.7-hc051c1a_1.conda#340278ded8b0dc3a73f3660bbb0adbc6
+https://conda.anaconda.org/conda-forge/linux-64/llvm-openmp-18.1.8-hf5423f3_0.conda#322be9d39e030673e105b0abb320514e
 https://conda.anaconda.org/conda-forge/linux-64/mysql-libs-8.3.0-hca2cd23_4.conda#1b50eebe2a738a3146c154d2eceaa8b6
-https://conda.anaconda.org/conda-forge/linux-64/nss-3.98-h1d7d5a4_0.conda#54b56c2fdf973656b748e0378900ec13
+https://conda.anaconda.org/conda-forge/linux-64/nss-3.102-h593d115_0.conda#40e5e48c55a45621c4399ca9236406b7
 https://conda.anaconda.org/conda-forge/linux-64/python-3.9.19-h0755675_0_cpython.conda#d9ee3647fbd9e8595b8df759b2bbefb8
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-0.4.0-hd590300_1.conda#9bfac7ccd94d54fd21a0501296d60424
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-keysyms-0.4.0-h8ee46fc_1.conda#632413adcd8bc16b515cab87a2932913
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-renderutil-0.3.9-hd590300_1.conda#e995b155d938b6779da6ace6c6b13816
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-wm-0.4.1-h8ee46fc_1.conda#90108a432fb5c6150ccfee3f03388656
-https://conda.anaconda.org/conda-forge/linux-64/xorg-libx11-1.8.9-h8ee46fc_0.conda#077b6e8ad6a3ddb741fce2496dd01bec
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-0.4.1-hb711507_2.conda#8637c3e5821654d0edf97e2b0404b443
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-keysyms-0.4.1-hb711507_0.conda#ad748ccca349aec3e91743e08b5e2b50
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-renderutil-0.3.10-hb711507_0.conda#0e0cbe0564d03a99afd5fd7b362feecd
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-wm-0.4.2-hb711507_0.conda#608e0ef8256b81d04456e8d211eee3e8
+https://conda.anaconda.org/conda-forge/linux-64/xorg-libx11-1.8.9-hb711507_1.conda#4a6d410296d7e39f00bacdee7df046e9
 https://conda.anaconda.org/conda-forge/noarch/alabaster-0.7.16-pyhd8ed1ab_0.conda#def531a3ac77b7fb8c21d17bb5d0badb
+https://conda.anaconda.org/conda-forge/noarch/appdirs-1.4.4-pyh9f0ad1d_0.tar.bz2#5f095bc6454094e96f146491fd03633b
+https://conda.anaconda.org/conda-forge/linux-64/brotli-1.1.0-hd590300_1.conda#f27a24d46e3ea7b70a1f98e50c62508f
 https://conda.anaconda.org/conda-forge/linux-64/brotli-python-1.1.0-py39h3d6467e_1.conda#c48418c8b35f1d59ae9ae1174812b40a
-https://conda.anaconda.org/conda-forge/linux-64/c-compiler-1.7.0-hd590300_0.conda#fad1d0a651bf929c6c16fbf1f6ccfa7c
-https://conda.anaconda.org/conda-forge/noarch/certifi-2024.2.2-pyhd8ed1ab_0.conda#0876280e409658fc6f9e75d035960333
+https://conda.anaconda.org/conda-forge/noarch/certifi-2024.6.2-pyhd8ed1ab_0.conda#8821ec1c8fcdc9e1d291d7b9f6e9968a
 https://conda.anaconda.org/conda-forge/noarch/charset-normalizer-3.3.2-pyhd8ed1ab_0.conda#7f4a9e3fcff3f6356ae99244a014da6a
 https://conda.anaconda.org/conda-forge/noarch/click-8.1.7-unix_pyh707e725_0.conda#f3ad426304898027fc619827ff428eca
 https://conda.anaconda.org/conda-forge/noarch/cloudpickle-3.0.0-pyhd8ed1ab_0.conda#753d29fe41bb881e4b9c004f0abf973f
@@ -120,37 +134,39 @@ https://conda.anaconda.org/conda-forge/noarch/colorama-0.4.6-pyhd8ed1ab_0.tar.bz
 https://conda.anaconda.org/conda-forge/noarch/cycler-0.12.1-pyhd8ed1ab_0.conda#5cd86562580f274031ede6aa6aa24441
 https://conda.anaconda.org/conda-forge/linux-64/cython-3.0.10-py39h3d6467e_0.conda#76b5d215fb735a6dc43010ffbe78040e
 https://conda.anaconda.org/conda-forge/linux-64/dbus-1.13.6-h5008d03_3.tar.bz2#ecfff944ba3960ecb334b9a2663d708d
-https://conda.anaconda.org/conda-forge/linux-64/docutils-0.19-py39hf3d152e_1.tar.bz2#adb733ec2ee669f6d010758d054da60f
+https://conda.anaconda.org/conda-forge/noarch/docutils-0.21.2-pyhd8ed1ab_0.conda#e8cd5d629f65bdf0f3bb312cde14659e
 https://conda.anaconda.org/conda-forge/noarch/exceptiongroup-1.2.0-pyhd8ed1ab_2.conda#8d652ea2ee8eaee02ed8dc820bc794aa
-https://conda.anaconda.org/conda-forge/noarch/execnet-2.1.0-pyhd8ed1ab_0.conda#7a4b32fbe5442e46841ec77695e36d96
+https://conda.anaconda.org/conda-forge/noarch/execnet-2.1.1-pyhd8ed1ab_0.conda#15dda3cdbf330abfe9f555d22f66db46
 https://conda.anaconda.org/conda-forge/linux-64/fontconfig-2.14.2-h14ed4e7_0.conda#0f69b688f52ff6da70bccb7ff7001d1d
-https://conda.anaconda.org/conda-forge/noarch/fsspec-2024.3.1-pyhca7485f_0.conda#b7f0662ef2c9d4404f0af9eef5ed2fde
-https://conda.anaconda.org/conda-forge/linux-64/gfortran-12.3.0-h7389182_3.conda#6b0b27394cf439d0540f949190556860
-https://conda.anaconda.org/conda-forge/linux-64/gfortran_linux-64-12.3.0-h617cb40_3.conda#3a9e5b8a6f651ff14e74d896d8f04ab6
-https://conda.anaconda.org/conda-forge/linux-64/glib-tools-2.80.0-hde27a5a_3.conda#d544517494d9008c0b1021213aec4084
-https://conda.anaconda.org/conda-forge/linux-64/gxx-12.3.0-h95e488c_3.conda#8c50a4d15a8d4812af563a684d598910
-https://conda.anaconda.org/conda-forge/linux-64/gxx_linux-64-12.3.0-h4a1b8e8_3.conda#9ec22c7c544f4a4f6d660f0a3b0fd15c
-https://conda.anaconda.org/conda-forge/noarch/idna-3.6-pyhd8ed1ab_0.conda#1a76f09108576397c41c0b0c5bd84134
+https://conda.anaconda.org/conda-forge/noarch/fsspec-2024.6.1-pyhff2d567_0.conda#996bf792cdb8c0ac38ff54b9fde56841
+https://conda.anaconda.org/conda-forge/linux-64/gcc-12.3.0-h915e2ae_13.conda#e42d156a1e3dd5651c89d7606b5a4a45
+https://conda.anaconda.org/conda-forge/linux-64/gcc_linux-64-12.3.0-h9528a6a_9.conda#954881ce9897d01c7c2031fb93ed366b
+https://conda.anaconda.org/conda-forge/linux-64/gettext-0.22.5-h59595ed_2.conda#219ba82e95d7614cf7140d2a4afc0926
+https://conda.anaconda.org/conda-forge/linux-64/gfortran_impl_linux-64-12.3.0-h8f2110c_13.conda#96471c6bcf708822422bd9f78dbecc3b
+https://conda.anaconda.org/conda-forge/linux-64/glib-tools-2.80.3-h73ef956_1.conda#99701cdc9a25a333d15265d1d243b2dc
+https://conda.anaconda.org/conda-forge/linux-64/gxx_impl_linux-64-12.3.0-h2a574ab_13.conda#bb4fe41bc0584a3f6d3026634170c330
+https://conda.anaconda.org/conda-forge/noarch/hpack-4.0.0-pyh9f0ad1d_0.tar.bz2#914d6646c4dbb1fd3ff539830a12fd71
+https://conda.anaconda.org/conda-forge/noarch/hyperframe-6.0.1-pyhd8ed1ab_0.tar.bz2#9f765cbfab6870c8435b9eefecd7a1f4
+https://conda.anaconda.org/conda-forge/noarch/idna-3.7-pyhd8ed1ab_0.conda#c0cc1420498b17414d8617d0b9f506ca
 https://conda.anaconda.org/conda-forge/noarch/imagesize-1.4.1-pyhd8ed1ab_0.tar.bz2#7de5386c8fea29e76b303f37dde4c352
 https://conda.anaconda.org/conda-forge/noarch/iniconfig-2.0.0-pyhd8ed1ab_0.conda#f800d2da156d08e289b14e87e43c1ae5
 https://conda.anaconda.org/conda-forge/linux-64/kiwisolver-1.4.5-py39h7633fee_1.conda#c9f74d717e5a2847a9f8b779c54130f2
 https://conda.anaconda.org/conda-forge/linux-64/lcms2-2.16-hb7c19ff_0.conda#51bb7010fc86f70eee639b4bb7a894f5
-https://conda.anaconda.org/conda-forge/linux-64/libclang-cpp15-15.0.7-default_h127d8a8_5.conda#d0a9633b53cdc319b8a1a532ae7822b8
-https://conda.anaconda.org/conda-forge/linux-64/libclang13-18.1.3-default_h5d6823c_0.conda#5fff487759736b275dc3e4a263cac666
 https://conda.anaconda.org/conda-forge/linux-64/libcups-2.3.3-h4637d8d_4.conda#d4529f4dff3057982a7617c7ac58fde3
-https://conda.anaconda.org/conda-forge/linux-64/libflac-1.4.3-h59595ed_0.conda#ee48bf17cc83a00f59ca1494d5646869
-https://conda.anaconda.org/conda-forge/linux-64/libgpg-error-1.48-h71f35ed_0.conda#4d18d86916705d352d5f4adfb7f0edd3
-https://conda.anaconda.org/conda-forge/linux-64/libpq-16.2-h33b98f1_1.conda#9e49ec2a61d02623b379dc332eb6889d
+https://conda.anaconda.org/conda-forge/linux-64/libhwloc-2.11.0-default_h5622ce7_1000.conda#695ee1e435b873780efccc64362cda89
+https://conda.anaconda.org/conda-forge/linux-64/libllvm15-15.0.7-hb3ce162_4.conda#8a35df3cbc0c8b12cc8af9473ae75eef
+https://conda.anaconda.org/conda-forge/linux-64/libllvm18-18.1.8-hc9dba70_0.conda#f94ed0c5953c78dcca7adb953f4c5bfb
+https://conda.anaconda.org/conda-forge/linux-64/libpq-16.3-ha72fbe1_0.conda#bac737ae28b79cfbafd515258d97d29e
 https://conda.anaconda.org/conda-forge/noarch/locket-1.0.0-pyhd8ed1ab_0.tar.bz2#91e27ef3d05cc772ce627e51cff111c4
 https://conda.anaconda.org/conda-forge/linux-64/markupsafe-2.1.5-py39hd1e30aa_0.conda#9a9a22eb1f83c44953319ee3b027769f
 https://conda.anaconda.org/conda-forge/noarch/networkx-3.2-pyhd8ed1ab_0.conda#cec8cc498664cc00a070676aa89e69a7
 https://conda.anaconda.org/conda-forge/linux-64/openjpeg-2.5.2-h488ebb8_0.conda#7f2e286780f072ed750df46dc2631138
-https://conda.anaconda.org/conda-forge/noarch/packaging-24.0-pyhd8ed1ab_0.conda#248f521b64ce055e7feae3105e7abeb8
-https://conda.anaconda.org/conda-forge/noarch/platformdirs-4.2.0-pyhd8ed1ab_0.conda#a0bc3eec34b0fab84be6b2da94e98e20
-https://conda.anaconda.org/conda-forge/noarch/pluggy-1.4.0-pyhd8ed1ab_0.conda#139e9feb65187e916162917bb2484976
+https://conda.anaconda.org/conda-forge/noarch/packaging-24.1-pyhd8ed1ab_0.conda#cbe1bb1f21567018ce595d9c2be0f0db
+https://conda.anaconda.org/conda-forge/noarch/pluggy-1.5.0-pyhd8ed1ab_0.conda#d3483c8fc2dc2cc3f5cf43e26d60cabf
 https://conda.anaconda.org/conda-forge/noarch/ply-3.11-pyhd8ed1ab_2.conda#18c6deb6f9602e32446398203c8f0e91
-https://conda.anaconda.org/conda-forge/linux-64/psutil-5.9.8-py39hd1e30aa_0.conda#ec86403fde8793ac1c36f8afa3d15902
-https://conda.anaconda.org/conda-forge/noarch/pygments-2.17.2-pyhd8ed1ab_0.conda#140a7f159396547e9799aa98f9f0742e
+https://conda.anaconda.org/conda-forge/linux-64/psutil-6.0.0-py39hd3abc70_0.conda#984987a2ef8c931691ad0d7fbb8ef3ca
+https://conda.anaconda.org/conda-forge/noarch/pycparser-2.22-pyhd8ed1ab_0.conda#844d9eb3b43095b031874477f7d70088
+https://conda.anaconda.org/conda-forge/noarch/pygments-2.18.0-pyhd8ed1ab_0.conda#b7f5c092b8f9800150d998a71b76d5a1
 https://conda.anaconda.org/conda-forge/noarch/pyparsing-3.1.2-pyhd8ed1ab_0.conda#b9a4dacf97241704529131a0dfc0494f
 https://conda.anaconda.org/conda-forge/noarch/pysocks-1.7.1-pyha2e5f31_6.tar.bz2#2a7de29fb590ca14b5243c4c812c8025
 https://conda.anaconda.org/conda-forge/noarch/pytz-2024.1-pyhd8ed1ab_0.conda#3eeeeb9e4827ace8c0c1419c85d590ad
@@ -158,91 +174,112 @@ https://conda.anaconda.org/conda-forge/linux-64/pyyaml-6.0.1-py39hd1e30aa_1.cond
 https://conda.anaconda.org/conda-forge/linux-64/setuptools-59.8.0-py39hf3d152e_1.tar.bz2#4252d0c211566a9f65149ba7f6e87aa4
 https://conda.anaconda.org/conda-forge/noarch/six-1.16.0-pyh6c4a22f_0.tar.bz2#e5f25f8dbc060e9a8d912e432202afc2
 https://conda.anaconda.org/conda-forge/noarch/snowballstemmer-2.2.0-pyhd8ed1ab_0.tar.bz2#4d22a9315e78c6827f806065957d566e
+https://conda.anaconda.org/conda-forge/noarch/soupsieve-2.5-pyhd8ed1ab_1.conda#3f144b2c34f8cb5a9abd9ed23a39c561
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-jsmath-1.0.1-pyhd8ed1ab_0.conda#da1d979339e2714c30a8e806a33ec087
-https://conda.anaconda.org/conda-forge/linux-64/tbb-2021.11.0-h00ab1b0_1.conda#4531d2927578e7e254ff3bcf6457518c
-https://conda.anaconda.org/conda-forge/noarch/tenacity-8.2.3-pyhd8ed1ab_0.conda#1482e77f87c6a702a7e05ef22c9b197b
-https://conda.anaconda.org/conda-forge/noarch/threadpoolctl-3.4.0-pyhc1e730c_0.conda#b296278eef667c673bf51de6535bad88
+https://conda.anaconda.org/conda-forge/noarch/tenacity-8.5.0-pyhd8ed1ab_0.conda#354cbc1244395cabbaec2617906d3a27
+https://conda.anaconda.org/conda-forge/noarch/threadpoolctl-3.5.0-pyhc1e730c_0.conda#df68d78237980a159bd7149f33c0e8fd
 https://conda.anaconda.org/conda-forge/noarch/toml-0.10.2-pyhd8ed1ab_0.tar.bz2#f832c45a477c78bebd107098db465095
 https://conda.anaconda.org/conda-forge/noarch/tomli-2.0.1-pyhd8ed1ab_0.tar.bz2#5844808ffab9ebdb694585b50ba02a96
 https://conda.anaconda.org/conda-forge/noarch/toolz-0.12.1-pyhd8ed1ab_0.conda#2fcb582444635e2c402e8569bb94e039
-https://conda.anaconda.org/conda-forge/linux-64/tornado-6.4-py39hd1e30aa_0.conda#1e865e9188204cdfb1fd2531780add88
-https://conda.anaconda.org/conda-forge/noarch/typing_extensions-4.11.0-pyha770c72_0.conda#6ef2fc37559256cf682d8b3375e89b80
+https://conda.anaconda.org/conda-forge/linux-64/tornado-6.4.1-py39hd3abc70_0.conda#c183e99f9320e5e2d0f9c43efcb3fb22
+https://conda.anaconda.org/conda-forge/noarch/typing_extensions-4.12.2-pyha770c72_0.conda#ebe6952715e1d5eb567eeebf25250fa7
 https://conda.anaconda.org/conda-forge/noarch/wheel-0.43.0-pyhd8ed1ab_1.conda#0b5293a157c2b5cd513dd1b03d8d3aae
-https://conda.anaconda.org/conda-forge/linux-64/xcb-util-image-0.4.0-h8ee46fc_1.conda#9d7bcddf49cbf727730af10e71022c73
-https://conda.anaconda.org/conda-forge/linux-64/xkeyboard-config-2.41-hd590300_0.conda#81f740407b45e3f9047b3174fa94eb9e
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-image-0.4.0-hb711507_2.conda#a0901183f08b6c7107aab109733a3c91
+https://conda.anaconda.org/conda-forge/linux-64/xkeyboard-config-2.42-h4ab18f5_0.conda#b193af204da1bfb8c13882d131a14bd2
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libxext-1.3.4-h0b41bf4_2.conda#82b6df12252e6f32402b96dacc656fec
 https://conda.anaconda.org/conda-forge/linux-64/xorg-libxrender-0.9.11-hd590300_0.conda#ed67c36f215b310412b2af935bf3e530
-https://conda.anaconda.org/conda-forge/noarch/zipp-3.17.0-pyhd8ed1ab_0.conda#2e4d6bc0b14e10f895fc6791a7d9b26a
+https://conda.anaconda.org/conda-forge/noarch/zipp-3.19.2-pyhd8ed1ab_0.conda#49808e59df5535116f6878b2a820d6f4
+https://conda.anaconda.org/conda-forge/noarch/accessible-pygments-0.0.5-pyhd8ed1ab_0.conda#1bb1ef9806a9a20872434f58b3e7fc1a
 https://conda.anaconda.org/conda-forge/noarch/babel-2.14.0-pyhd8ed1ab_0.conda#9669586875baeced8fc30c0826c3270e
-https://conda.anaconda.org/conda-forge/linux-64/cairo-1.18.0-h3faef2a_0.conda#f907bb958910dc404647326ca80c263e
-https://conda.anaconda.org/conda-forge/linux-64/cxx-compiler-1.7.0-h00ab1b0_0.conda#b4537c98cb59f8725b0e1e65816b4a28
+https://conda.anaconda.org/conda-forge/noarch/beautifulsoup4-4.12.3-pyha770c72_0.conda#332493000404d8411859539a5a630865
+https://conda.anaconda.org/conda-forge/linux-64/brunsli-0.1-h9c3ff4c_0.tar.bz2#c1ac6229d0bfd14f8354ff9ad2a26cad
+https://conda.anaconda.org/conda-forge/linux-64/c-compiler-1.7.0-hd590300_1.conda#e9dffe1056994133616378309f932d77
+https://conda.anaconda.org/conda-forge/linux-64/cairo-1.18.0-hbb29018_2.conda#b6d90276c5aee9b4407dd94eb0cd40a8
+https://conda.anaconda.org/conda-forge/linux-64/cffi-1.16.0-py39h7a31438_0.conda#ac992767d7f8ed2cb27e71e78f0fb2d7
 https://conda.anaconda.org/conda-forge/linux-64/cytoolz-0.12.3-py39hd1e30aa_0.conda#dc0fb8e157c7caba4c98f1e1f9d2e5f4
-https://conda.anaconda.org/conda-forge/linux-64/fortran-compiler-1.7.0-heb67821_0.conda#7ef7c0f111dad1c8006504a0f1ccd820
-https://conda.anaconda.org/conda-forge/linux-64/glib-2.80.0-hf2295e7_3.conda#1ade62526144055f05c3eb45ebae3b5b
-https://conda.anaconda.org/conda-forge/noarch/importlib-metadata-7.1.0-pyha770c72_0.conda#0896606848b2dc5cebdf111b6543aa04
-https://conda.anaconda.org/conda-forge/noarch/jinja2-3.1.3-pyhd8ed1ab_0.conda#e7d8df6509ba635247ff9aea31134262
-https://conda.anaconda.org/conda-forge/noarch/joblib-1.3.2-pyhd8ed1ab_0.conda#4da50d410f553db77e62ab62ffaa1abc
-https://conda.anaconda.org/conda-forge/linux-64/libgcrypt-1.10.3-hd590300_0.conda#32d16ad533c59bb0a3c5ffaf16110829
-https://conda.anaconda.org/conda-forge/linux-64/libsndfile-1.2.2-hc60ed4a_1.conda#ef1910918dd895516a769ed36b5b3a4e
-https://conda.anaconda.org/conda-forge/linux-64/libxkbcommon-1.7.0-h662e7e4_0.conda#b32c0da42b1f24a98577bb3d7fc0b995
+https://conda.anaconda.org/conda-forge/linux-64/gfortran-12.3.0-h915e2ae_13.conda#da3ce6140908b41fb8fb205104b54ae6
+https://conda.anaconda.org/conda-forge/linux-64/gfortran_linux-64-12.3.0-h5877db1_9.conda#d77e515e624f3edb33ac89997322b5a8
+https://conda.anaconda.org/conda-forge/linux-64/glib-2.80.3-h8a4344b_1.conda#a3acc4920c9ca19cb6b295028d606477
+https://conda.anaconda.org/conda-forge/linux-64/gxx-12.3.0-h915e2ae_13.conda#c3a3cf9cf544bd621a18add719056529
+https://conda.anaconda.org/conda-forge/linux-64/gxx_linux-64-12.3.0-ha28b414_9.conda#26155c2e3afafee809654f86f434c234
+https://conda.anaconda.org/conda-forge/noarch/h2-4.1.0-pyhd8ed1ab_0.tar.bz2#b748fbf7060927a6e82df7cb5ee8f097
+https://conda.anaconda.org/conda-forge/noarch/importlib-metadata-8.0.0-pyha770c72_0.conda#3286556cdd99048d198f72c3f6f69103
+https://conda.anaconda.org/conda-forge/noarch/jinja2-3.1.4-pyhd8ed1ab_0.conda#7b86ecb7d3557821c649b3c31e3eb9f2
+https://conda.anaconda.org/conda-forge/noarch/joblib-1.4.2-pyhd8ed1ab_0.conda#25df261d4523d9f9783bcdb7208d872f
+https://conda.anaconda.org/conda-forge/linux-64/libclang-cpp15-15.0.7-default_h127d8a8_5.conda#d0a9633b53cdc319b8a1a532ae7822b8
+https://conda.anaconda.org/conda-forge/linux-64/libclang13-18.1.8-default_h6ae225f_0.conda#28ad2db5c14d2e23d7962b8389e2cc0b
+https://conda.anaconda.org/conda-forge/linux-64/libflac-1.4.3-h59595ed_0.conda#ee48bf17cc83a00f59ca1494d5646869
+https://conda.anaconda.org/conda-forge/linux-64/libgpg-error-1.50-h4f305b6_0.conda#0d7ff1a8e69565ca3add6925e18e708f
+https://conda.anaconda.org/conda-forge/linux-64/libxkbcommon-1.7.0-h2c5496b_1.conda#e2eaefa4de2b7237af7c907b8bbc760a
 https://conda.anaconda.org/conda-forge/noarch/memory_profiler-0.61.0-pyhd8ed1ab_0.tar.bz2#8b45f9f2b2f7a98b0ec179c8991a4a9b
-https://conda.anaconda.org/conda-forge/noarch/meson-1.4.0-pyhd8ed1ab_0.conda#52a0660cfa40b45bf254ecc3374cb2e0
-https://conda.anaconda.org/conda-forge/linux-64/mkl-2024.1.0-ha957f24_691.conda#1647aafdfa7320bd4668af5aaad692ea
-https://conda.anaconda.org/conda-forge/noarch/partd-1.4.1-pyhd8ed1ab_0.conda#acf4b7c0bcd5fa3b0e05801c4d2accd6
-https://conda.anaconda.org/conda-forge/linux-64/pillow-10.3.0-py39h90c7501_0.conda#1e3b6af9592be71ce19f0a6aae05d97b
+https://conda.anaconda.org/conda-forge/noarch/meson-1.4.1-pyhd8ed1ab_0.conda#714ca123839eeebb25d12b443067ea64
+https://conda.anaconda.org/conda-forge/noarch/partd-1.4.2-pyhd8ed1ab_0.conda#0badf9c54e24cecfb0ad2f99d680c163
+https://conda.anaconda.org/conda-forge/linux-64/pillow-10.4.0-py39h16a7006_0.conda#d9a6b19174a6cf5185296b16f781951f
 https://conda.anaconda.org/conda-forge/noarch/pip-24.0-pyhd8ed1ab_0.conda#f586ac1e56c8638b64f9c8122a7b8a67
 https://conda.anaconda.org/conda-forge/noarch/plotly-5.14.0-pyhd8ed1ab_0.conda#6a7bcc42ef58dd6cf3da9333ea102433
-https://conda.anaconda.org/conda-forge/noarch/pyproject-metadata-0.7.1-pyhd8ed1ab_0.conda#dcb27826ffc94d5f04e241322239983b
-https://conda.anaconda.org/conda-forge/noarch/pytest-7.4.4-pyhd8ed1ab_0.conda#a9d145de8c5f064b5fa68fb34725d9f4
+https://conda.anaconda.org/conda-forge/noarch/pyproject-metadata-0.8.0-pyhd8ed1ab_0.conda#573fe09d7bd0cd4bcc210d8369b5ca47
+https://conda.anaconda.org/conda-forge/noarch/pytest-8.2.2-pyhd8ed1ab_0.conda#0f3f49c22c7ef3a1195fa61dad3c43be
 https://conda.anaconda.org/conda-forge/noarch/python-dateutil-2.9.0-pyhd8ed1ab_0.conda#2cf4264fffb9e6eff6031c5b6884d61c
 https://conda.anaconda.org/conda-forge/linux-64/sip-6.7.12-py39h3d6467e_0.conda#e667a3ab0df62c54e60e1843d2e6defb
-https://conda.anaconda.org/conda-forge/noarch/urllib3-2.2.1-pyhd8ed1ab_0.conda#08807a87fa7af10754d46f63b368e016
-https://conda.anaconda.org/conda-forge/linux-64/compilers-1.7.0-ha770c72_0.conda#81458b3aed8ab8711951ec3c0c04e097
-https://conda.anaconda.org/conda-forge/linux-64/gstreamer-1.24.1-h98fc4e7_1.conda#b04b5cdf3ba01430db27979250bc5a1d
-https://conda.anaconda.org/conda-forge/linux-64/harfbuzz-8.3.0-h3d44ed6_0.conda#5a6f6c00ef982a9bc83558d9ac8f64a0
-https://conda.anaconda.org/conda-forge/noarch/importlib_metadata-7.1.0-hd8ed1ab_0.conda#6ef2b72d291b39e479d7694efa2b2b98
+https://conda.anaconda.org/conda-forge/linux-64/tbb-2021.12.0-h434a139_2.conda#9e78ded802220ee1f67c908cb2ef188f
+https://conda.anaconda.org/conda-forge/linux-64/cxx-compiler-1.7.0-h00ab1b0_1.conda#28de2e073db9ca9b72858bee9fb6f571
+https://conda.anaconda.org/conda-forge/linux-64/fortran-compiler-1.7.0-heb67821_1.conda#cf4b0e7c4c78bb0662aed9b27c414a3c
+https://conda.anaconda.org/conda-forge/linux-64/gstreamer-1.24.5-haf2f30d_0.conda#c5252c02592373fa8caf5a5327165a89
+https://conda.anaconda.org/conda-forge/linux-64/harfbuzz-8.5.0-hfac3d4d_0.conda#f5126317dd0ce0ba26945e411ecc6960
+https://conda.anaconda.org/conda-forge/noarch/importlib_metadata-8.0.0-hd8ed1ab_0.conda#5f8c8ebbe6413a7838cf6ecf14d5d31b
+https://conda.anaconda.org/conda-forge/linux-64/libgcrypt-1.11.0-h4ab18f5_0.conda#0a00e32cabe3e571c0611387e7bc2042
+https://conda.anaconda.org/conda-forge/linux-64/libsndfile-1.2.2-hc60ed4a_1.conda#ef1910918dd895516a769ed36b5b3a4e
+https://conda.anaconda.org/conda-forge/noarch/meson-python-0.16.0-pyh0c530f3_0.conda#e16f0dbf502da873be9f9adb0dc52547
+https://conda.anaconda.org/conda-forge/linux-64/mkl-2024.1.0-ha957f24_693.conda#ff0f4abf6f94e36a918f1ef4dbeb9769
+https://conda.anaconda.org/conda-forge/linux-64/pyqt5-sip-12.12.2-py39h3d6467e_5.conda#93aff412f3e49fdb43361c0215cbd72d
+https://conda.anaconda.org/conda-forge/noarch/pytest-xdist-3.6.1-pyhd8ed1ab_0.conda#b39568655c127a9c4a44d178ac99b6d0
+https://conda.anaconda.org/conda-forge/linux-64/zstandard-0.22.0-py39h81c9582_1.conda#c1dd22d67b1f8cef888b64b688b71ffd
+https://conda.anaconda.org/conda-forge/linux-64/compilers-1.7.0-ha770c72_1.conda#d8d07866ac3b5b6937213c89a1874f08
+https://conda.anaconda.org/conda-forge/noarch/dask-core-2024.7.0-pyhd8ed1ab_0.conda#755e47653ae38f5c50f1435af756e844
+https://conda.anaconda.org/conda-forge/linux-64/gst-plugins-base-1.24.5-hbaaba92_0.conda#4a485842570569ba754863b2c083b346
 https://conda.anaconda.org/conda-forge/linux-64/libblas-3.9.0-22_linux64_mkl.conda#eb6deb4ba6f92ea3f31c09cb8b764738
 https://conda.anaconda.org/conda-forge/linux-64/libsystemd0-255-h3516f8a_1.conda#3366af27f0b593544a6cd453c7932ac5
-https://conda.anaconda.org/conda-forge/noarch/meson-python-0.15.0-pyh0c530f3_0.conda#3bc64565ca78ce3bb80248d09926d8f9
-https://conda.anaconda.org/conda-forge/linux-64/mkl-devel-2024.1.0-ha770c72_691.conda#25e4569ad4dd6a38c294a0510a60c014
-https://conda.anaconda.org/conda-forge/linux-64/pyqt5-sip-12.12.2-py39h3d6467e_5.conda#93aff412f3e49fdb43361c0215cbd72d
-https://conda.anaconda.org/conda-forge/noarch/pytest-xdist-3.5.0-pyhd8ed1ab_0.conda#d5f595da2daead898ca958ac62f0307b
-https://conda.anaconda.org/conda-forge/noarch/requests-2.31.0-pyhd8ed1ab_0.conda#a30144e4156cdbb236f99ebb49828f8b
-https://conda.anaconda.org/conda-forge/noarch/dask-core-2024.4.1-pyhd8ed1ab_0.conda#52387f00fee8dcd5cf75f8886025293f
-https://conda.anaconda.org/conda-forge/linux-64/gst-plugins-base-1.24.1-hfa15dee_1.conda#a6dd2bbc684913e2bef0a54ce56fcbfb
+https://conda.anaconda.org/conda-forge/linux-64/mkl-devel-2024.1.0-ha770c72_693.conda#7f422e2cf549a3fb920c95288393870d
+https://conda.anaconda.org/conda-forge/noarch/urllib3-2.2.2-pyhd8ed1ab_1.conda#e804c43f58255e977093a2298e442bb8
 https://conda.anaconda.org/conda-forge/linux-64/libcblas-3.9.0-22_linux64_mkl.conda#d6f942423116553f068b2f2d93ffea2e
 https://conda.anaconda.org/conda-forge/linux-64/liblapack-3.9.0-22_linux64_mkl.conda#4edf2e7ce63920e4f539d12e32fb478e
-https://conda.anaconda.org/conda-forge/noarch/pooch-1.8.1-pyhd8ed1ab_0.conda#d15917f33140f8d2ac9ca44db7ec8a25
 https://conda.anaconda.org/conda-forge/linux-64/pulseaudio-client-17.0-hb77b528_0.conda#07f45f1be1c25345faddb8db0de8039b
+https://conda.anaconda.org/conda-forge/noarch/requests-2.32.3-pyhd8ed1ab_0.conda#5ede4753180c7a550a443c430dc8ab52
 https://conda.anaconda.org/conda-forge/linux-64/liblapacke-3.9.0-22_linux64_mkl.conda#aa0a5a70e1c957d5911e76ac98e471e1
 https://conda.anaconda.org/conda-forge/linux-64/numpy-1.19.5-py39hd249d9e_3.tar.bz2#0cf333996ebdeeba8d1c8c1c0ee9eff9
-https://conda.anaconda.org/conda-forge/linux-64/qt-main-5.15.8-hc9dc06e_21.conda#b325046180590c868ce0dbf267b82eb8
+https://conda.anaconda.org/conda-forge/noarch/pooch-1.6.0-pyhd8ed1ab_0.tar.bz2#6429e1d1091c51f626b5dcfdd38bf429
+https://conda.anaconda.org/conda-forge/linux-64/qt-main-5.15.8-ha2b5568_22.conda#15de976572f24032540236006d6d0e9f
 https://conda.anaconda.org/conda-forge/linux-64/blas-devel-3.9.0-22_linux64_mkl.conda#3cb0e51433c88d2f4cdfb50c5c08a683
-https://conda.anaconda.org/conda-forge/linux-64/imagecodecs-lite-2019.12.3-py39hd257fcd_5.tar.bz2#32dba66d6abc2b4b5b019c9e54307312
-https://conda.anaconda.org/conda-forge/noarch/imageio-2.34.0-pyh4b66e23_0.conda#b8853659d596f967c661f544dd89ede7
+https://conda.anaconda.org/conda-forge/linux-64/imagecodecs-2024.6.1-py39h34cef29_2.conda#d3ee926e63ebd5b44ebc984dff020305
+https://conda.anaconda.org/conda-forge/noarch/imageio-2.34.2-pyh12aca89_0.conda#97ad994fae55dce96bd397054b32e41a
 https://conda.anaconda.org/conda-forge/linux-64/matplotlib-base-3.3.4-py39h2fa2bec_0.tar.bz2#9ec0b2186fab9121c54f4844f93ee5b7
 https://conda.anaconda.org/conda-forge/linux-64/pandas-1.1.5-py39hde0f152_0.tar.bz2#79fc4b5b3a865b90dd3701cecf1ad33c
 https://conda.anaconda.org/conda-forge/noarch/patsy-0.5.6-pyhd8ed1ab_0.conda#a5b55d1cb110cdcedc748b5c3e16e687
-https://conda.anaconda.org/conda-forge/linux-64/polars-0.19.12-py39h90d8ae4_0.conda#191828961c95f8d59fa2b86a590f9905
+https://conda.anaconda.org/conda-forge/linux-64/polars-0.20.23-py39ha963410_0.conda#4871f09d653e979d598d2d4cd5fa868d
 https://conda.anaconda.org/conda-forge/linux-64/pyqt-5.15.9-py39h52134e7_5.conda#e1f148e57d071b09187719df86f513c1
-https://conda.anaconda.org/conda-forge/linux-64/pywavelets-1.3.0-py39hd257fcd_1.tar.bz2#c4b698994b2d8d2e659ae02202e6abe4
+https://conda.anaconda.org/conda-forge/linux-64/pywavelets-1.6.0-py39hd92a3bb_0.conda#32e26e16f60c568b17a82e3033a4d309
 https://conda.anaconda.org/conda-forge/linux-64/scipy-1.6.0-py39hee8e79c_0.tar.bz2#3afcb78281836e61351a2924f3230060
 https://conda.anaconda.org/conda-forge/linux-64/blas-2.122-mkl.conda#ead856637ff8a7feba572e2cf23b453b
 https://conda.anaconda.org/conda-forge/linux-64/matplotlib-3.3.4-py39hf3d152e_0.tar.bz2#cbaec993375a908bbe506dc7328d747c
 https://conda.anaconda.org/conda-forge/linux-64/pyamg-4.2.3-py39hac2352c_1.tar.bz2#6fb0628d6195d8b6caa2422d09296399
 https://conda.anaconda.org/conda-forge/noarch/seaborn-base-0.12.2-pyhd8ed1ab_0.conda#cf88f3a1c11536bc3c10c14ad00ccc42
 https://conda.anaconda.org/conda-forge/linux-64/statsmodels-0.13.2-py39hd257fcd_0.tar.bz2#bd7cdadf70e34a19333c3aacc40206e8
-https://conda.anaconda.org/conda-forge/noarch/tifffile-2020.6.3-py_0.tar.bz2#1fb771bb25b2eecbc73abf5143fa35bd
+https://conda.anaconda.org/conda-forge/noarch/tifffile-2024.6.18-pyhd8ed1ab_0.conda#7c3077529bfe3b86f9425d526d73bd24
 https://conda.anaconda.org/conda-forge/linux-64/scikit-image-0.17.2-py39hde0f152_4.tar.bz2#2a58a7e382317b03f023b2fddf40f8a1
 https://conda.anaconda.org/conda-forge/noarch/seaborn-0.12.2-hd8ed1ab_0.conda#50847a47c07812f88581081c620f5160
 https://conda.anaconda.org/conda-forge/noarch/numpydoc-1.2-pyhd8ed1ab_0.tar.bz2#025ad7ca2c7f65007ab6b6f5d93a56eb
+https://conda.anaconda.org/conda-forge/noarch/pydata-sphinx-theme-0.15.3-pyhd8ed1ab_0.conda#55e445f4fcb07f2471fb0e1102d36488
 https://conda.anaconda.org/conda-forge/noarch/sphinx-copybutton-0.5.2-pyhd8ed1ab_0.conda#ac832cc43adc79118cf6e23f1f9b8995
-https://conda.anaconda.org/conda-forge/noarch/sphinx-gallery-0.15.0-pyhd8ed1ab_0.conda#1a49ca9515ef9a96edff2eea06143dc6
-https://conda.anaconda.org/conda-forge/noarch/sphinx-prompt-1.3.0-py_0.tar.bz2#9363002e2a134a287af4e32ff0f26cdc
+https://conda.anaconda.org/conda-forge/noarch/sphinx-design-0.5.0-pyhd8ed1ab_0.conda#264b3c697fa9cdade87eb0abe4440d54
+https://conda.anaconda.org/conda-forge/noarch/sphinx-gallery-0.16.0-pyhd8ed1ab_0.conda#add28691ee89e875b190eda07929d5d4
+https://conda.anaconda.org/conda-forge/noarch/sphinx-prompt-1.4.0-pyhd8ed1ab_0.tar.bz2#88ee91e8679603f2a5bd036d52919cc2
+https://conda.anaconda.org/conda-forge/noarch/sphinx-remove-toctrees-1.0.0.post1-pyhd8ed1ab_0.conda#6dee8412218288a17f99f2cfffab334d
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-applehelp-1.0.8-pyhd8ed1ab_0.conda#611a35a27914fac3aa37611a6fe40bb5
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-devhelp-1.0.6-pyhd8ed1ab_0.conda#d7e4954df0d3aea2eacc7835ad12671d
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-htmlhelp-2.0.5-pyhd8ed1ab_0.conda#7e1e7437273682ada2ed5e9e9714b140
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-qthelp-1.0.7-pyhd8ed1ab_0.conda#26acae54b06f178681bfb551760f5dd1
-https://conda.anaconda.org/conda-forge/noarch/sphinx-6.0.0-pyhd8ed1ab_2.conda#ac1d3b55da1669ee3a56973054fd7efb
+https://conda.anaconda.org/conda-forge/noarch/sphinx-7.3.7-pyhd8ed1ab_0.conda#7b1465205e28d75d2c0e1a868ee00a67
 https://conda.anaconda.org/conda-forge/noarch/sphinxcontrib-serializinghtml-1.1.10-pyhd8ed1ab_0.conda#e507335cb4ca9cff4c3d0fa9cdab255e
-# pip sphinxext-opengraph @ https://files.pythonhosted.org/packages/50/ac/c105ed3e0a00b14b28c0aa630935af858fd8a32affeff19574b16e2c6ae8/sphinxext_opengraph-0.4.2-py3-none-any.whl#sha256=a51f2604f9a5b6c0d25d3a88e694d5c02e20812dc0e482adf96c8628f9109357
+# pip libsass @ https://files.pythonhosted.org/packages/fd/5a/eb5b62641df0459a3291fc206cf5bd669c0feed7814dded8edef4ade8512/libsass-0.23.0-cp38-abi3-manylinux_2_5_x86_64.manylinux1_x86_64.whl#sha256=4a218406d605f325d234e4678bd57126a66a88841cb95bee2caeafdc6f138306
+# pip sphinxcontrib-sass @ https://files.pythonhosted.org/packages/2e/87/7c2eb08e3ca1d6baae32c0a5e005330fe1cec93a36aa085e714c3b3a3c7d/sphinxcontrib_sass-0.3.4-py2.py3-none-any.whl#sha256=a0c79a44ae8b8935c02dc340ebe40c9e002c839331201c899dc93708970c355a
+# pip sphinxext-opengraph @ https://files.pythonhosted.org/packages/92/0a/970b80b4fa1feeb6deb6f2e22d4cb14e388b27b315a1afdb9db930ff91a4/sphinxext_opengraph-0.9.1-py3-none-any.whl#sha256=b3b230cc6a5b5189139df937f0d9c7b23c7c204493b22646273687969dcb760e
diff --git a/build_tools/circle/list_versions.py b/build_tools/circle/list_versions.py
index 345e08b4bece4..e1f8d54b84ec5 100755
--- a/build_tools/circle/list_versions.py
+++ b/build_tools/circle/list_versions.py
@@ -1,6 +1,11 @@
 #!/usr/bin/env python3
 
-# List all available versions of the documentation
+# Write the available versions page (--rst) and the version switcher JSON (--json).
+# Version switcher see:
+# https://pydata-sphinx-theme.readthedocs.io/en/stable/user_guide/version-dropdown.html
+# https://pydata-sphinx-theme.readthedocs.io/en/stable/user_guide/announcements.html#announcement-banners
+
+import argparse
 import json
 import re
 import sys
@@ -52,14 +57,19 @@ def get_file_size(version):
             return human_readable_data_quantity(path_details["size"], 1000)
 
 
-print(":orphan:")
-print()
-heading = "Available documentation for Scikit-learn"
-print(heading)
-print("=" * len(heading))
-print()
-print("Web-based documentation is available for versions listed below:")
-print()
+parser = argparse.ArgumentParser()
+parser.add_argument("--rst", type=str, required=True)
+parser.add_argument("--json", type=str, required=True)
+args = parser.parse_args()
+
+heading = "Available documentation for scikit-learn"
+json_content = []
+rst_content = [
+    ":orphan:\n",
+    heading,
+    "=" * len(heading) + "\n",
+    "Web-based documentation is available for versions listed below:\n",
+]
 
 ROOT_URL = (
     "https://api.github.com/repos/scikit-learn/scikit-learn.github.io/contents/"  # noqa
@@ -93,8 +103,9 @@ def get_file_size(version):
 
 # Output in order: dev, stable, decreasing other version
 seen = set()
-for name in NAMED_DIRS + sorted(
-    (k for k in dirs if k[:1].isdigit()), key=parse_version, reverse=True
+for i, name in enumerate(
+    NAMED_DIRS
+    + sorted((k for k in dirs if k[:1].isdigit()), key=parse_version, reverse=True)
 ):
     version_num, file_size = dirs[name]
     if version_num in seen:
@@ -102,17 +113,32 @@ def get_file_size(version):
         continue
     else:
         seen.add(version_num)
-    name_display = "" if name[:1].isdigit() else " (%s)" % name
-    path = "https://scikit-learn.org/%s/" % name
-    out = "* `Scikit-learn %s%s documentation <%s>`_" % (
-        version_num,
-        name_display,
-        path,
-    )
+
+    full_name = f"{version_num}" if name[:1].isdigit() else f"{version_num} ({name})"
+    path = f"https://scikit-learn.org/{name}/"
+
+    # Update JSON for the version switcher; only keep the 8 latest versions to avoid
+    # overloading the version switcher dropdown
+    if i < 8:
+        info = {"name": full_name, "version": version_num, "url": path}
+        if name == "stable":
+            info["preferred"] = True
+        json_content.append(info)
+
+    # Printout for the historical version page
+    out = f"* `scikit-learn {full_name} documentation <{path}>`_"
     if file_size is not None:
         file_extension = get_file_extension(version_num)
         out += (
             f" (`{file_extension.upper()} {file_size} <{path}/"
             f"_downloads/scikit-learn-docs.{file_extension}>`_)"
         )
-    print(out)
+    rst_content.append(out)
+
+with open(args.rst, "w", encoding="utf-8") as f:
+    f.write("\n".join(rst_content) + "\n")
+print(f"Written {args.rst}")
+
+with open(args.json, "w", encoding="utf-8") as f:
+    json.dump(json_content, f, indent=2)
+print(f"Written {args.json}")
diff --git a/build_tools/cirrus/arm_tests.yml b/build_tools/cirrus/arm_tests.yml
index 09874e081b460..6c5fa26020f35 100644
--- a/build_tools/cirrus/arm_tests.yml
+++ b/build_tools/cirrus/arm_tests.yml
@@ -10,7 +10,7 @@ linux_aarch64_test_task:
     CONDA_ENV_NAME: testenv
     LOCK_FILE: build_tools/cirrus/pymin_conda_forge_linux-aarch64_conda.lock
     CONDA_PKGS_DIRS: /root/.conda/pkgs
-    HOME: /  # $HOME is not defined in image and is required to install mambaforge
+    HOME: /  # $HOME is not defined in image and is required to install Miniforge
     # Upload tokens have been encrypted via the CirrusCI interface:
     # https://cirrus-ci.org/guide/writing-tasks/#encrypted-variables
     # See `maint_tools/update_tracking_issue.py` for details on the permissions the token requires.
diff --git a/build_tools/cirrus/arm_wheel.yml b/build_tools/cirrus/arm_wheel.yml
index c3dfcfbc53ad9..aad1770188335 100644
--- a/build_tools/cirrus/arm_wheel.yml
+++ b/build_tools/cirrus/arm_wheel.yml
@@ -8,7 +8,6 @@ linux_arm64_wheel_task:
     memory: 4G
   env:
     CIBW_ENVIRONMENT: SKLEARN_SKIP_NETWORK_TESTS=1
-                      SKLEARN_BUILD_PARALLEL=5
     CIBW_TEST_COMMAND: bash {project}/build_tools/wheels/test_wheels.sh
     CIBW_TEST_REQUIRES: pytest pandas threadpoolctl pytest-xdist
     CIBW_BUILD_VERBOSITY: 1
diff --git a/build_tools/cirrus/build_test_arm.sh b/build_tools/cirrus/build_test_arm.sh
index 551dc3689e010..b406a1673a13a 100755
--- a/build_tools/cirrus/build_test_arm.sh
+++ b/build_tools/cirrus/build_test_arm.sh
@@ -22,28 +22,21 @@ setup_ccache() {
     ccache -M 0
 }
 
-MAMBAFORGE_URL="https://github.com/conda-forge/miniforge/releases/latest/download/Mambaforge-Linux-aarch64.sh"
-
-# Install Mambaforge
-curl -L --retry 10 $MAMBAFORGE_URL -o mambaforge.sh
-MAMBAFORGE_PATH=$HOME/mambaforge
-bash ./mambaforge.sh -b -p $MAMBAFORGE_PATH
-export PATH=$MAMBAFORGE_PATH/bin:$PATH
-mamba init --all --verbose
-mamba update --yes mamba
-mamba update --yes conda
-mamba install "$(get_dep conda-lock min)" -y
-conda-lock install --name $CONDA_ENV_NAME $LOCK_FILE
-source activate $CONDA_ENV_NAME
+# Install Miniforge
+MINIFORGE_URL="https://github.com/conda-forge/miniforge/releases/latest/download/Miniforge3-Linux-aarch64.sh"
+curl -L --retry 10 $MINIFORGE_URL -o miniconda.sh
+MINIFORGE_PATH=$HOME/miniforge3
+bash ./miniconda.sh -b -p $MINIFORGE_PATH
+source $MINIFORGE_PATH/etc/profile.d/conda.sh
+conda activate
+
+create_conda_environment_from_lock_file $CONDA_ENV_NAME $LOCK_FILE
+conda activate $CONDA_ENV_NAME
 
 setup_ccache
 
 python --version
 
-# Set parallelism to $N_CORES + 1 to overlap IO bound tasks with CPU bound tasks on CI
-# workers with $N_CORES cores when building the compiled extensions of scikit-learn.
-export SKLEARN_BUILD_PARALLEL=$(($N_CORES + 1))
-
 # Disable the build isolation and build in the tree so that the same folder can be
 # cached between CI runs.
 pip install --verbose --no-build-isolation .
diff --git a/build_tools/cirrus/pymin_conda_forge_environment.yml b/build_tools/cirrus/pymin_conda_forge_environment.yml
index 684c4636daad4..e41cc7f610ac0 100644
--- a/build_tools/cirrus/pymin_conda_forge_environment.yml
+++ b/build_tools/cirrus/pymin_conda_forge_environment.yml
@@ -12,7 +12,7 @@ dependencies:
   - joblib
   - threadpoolctl
   - matplotlib
-  - pytest<8
+  - pytest
   - pytest-xdist
   - pillow
   - pip
diff --git a/build_tools/cirrus/pymin_conda_forge_linux-aarch64_conda.lock b/build_tools/cirrus/pymin_conda_forge_linux-aarch64_conda.lock
index a61ce7f58b8bf..5de3fa818fd24 100644
--- a/build_tools/cirrus/pymin_conda_forge_linux-aarch64_conda.lock
+++ b/build_tools/cirrus/pymin_conda_forge_linux-aarch64_conda.lock
@@ -1,57 +1,57 @@
 # Generated by conda-lock.
 # platform: linux-aarch64
-# input_hash: 80459c6003cbcd22780a22a62ed5cc116e951d5c2c14602af1281434263b9138
+# input_hash: 2d8c526ab7c0c2f0ca509bfec3f035e5bd33b8096f194f0747f167c8aff66383
 @EXPLICIT
-https://conda.anaconda.org/conda-forge/linux-aarch64/ca-certificates-2024.2.2-hcefe29a_0.conda#57c226edb90c4e973b9b7503537dd339
-https://conda.anaconda.org/conda-forge/linux-aarch64/ld_impl_linux-aarch64-2.40-h2d8c526_0.conda#16246d69e945d0b1969a6099e7c5d457
-https://conda.anaconda.org/conda-forge/linux-aarch64/libstdcxx-ng-13.2.0-h9a76618_5.conda#1b79d37dce0fad96bdf3de03925f43b4
+https://conda.anaconda.org/conda-forge/linux-aarch64/ca-certificates-2024.7.4-hcefe29a_0.conda#c4c784a1336d72fff54f6b207f3dd75f
+https://conda.anaconda.org/conda-forge/linux-aarch64/ld_impl_linux-aarch64-2.40-h9fc2d93_7.conda#1b0feef706f4d03eff0b76626ead64fc
 https://conda.anaconda.org/conda-forge/linux-aarch64/python_abi-3.9-4_cp39.conda#c191905a08694e4a5cb1238e90233878
 https://conda.anaconda.org/conda-forge/noarch/tzdata-2024a-h0c530f3_0.conda#161081fc7cec0bfda0d86d7cb595f8d8
 https://conda.anaconda.org/conda-forge/linux-aarch64/_openmp_mutex-4.5-2_kmp_llvm.tar.bz2#98a1185182fec3c434069fa74e6473d6
-https://conda.anaconda.org/conda-forge/linux-aarch64/libgcc-ng-13.2.0-hf8544c7_5.conda#dee934e640275d9e74e7bbd455f25162
+https://conda.anaconda.org/conda-forge/linux-aarch64/libgcc-ng-14.1.0-he277a41_0.conda#47ecd1292a3fd78b616640b35dd9632c
 https://conda.anaconda.org/conda-forge/linux-aarch64/bzip2-1.0.8-h31becfc_5.conda#a64e35f01e0b7a2a152eca87d33b9c87
-https://conda.anaconda.org/conda-forge/linux-aarch64/lerc-4.0.0-h4de3ea5_0.tar.bz2#1a0ffc65e03ce81559dbcb0695ad1476
 https://conda.anaconda.org/conda-forge/linux-aarch64/libbrotlicommon-1.1.0-h31becfc_1.conda#1b219fd801eddb7a94df5bd001053ad9
 https://conda.anaconda.org/conda-forge/linux-aarch64/libdeflate-1.20-h31becfc_0.conda#018592a3d691662f451f89d0de474a20
 https://conda.anaconda.org/conda-forge/linux-aarch64/libffi-3.4.2-h3557bc0_5.tar.bz2#dddd85f4d52121fab0a8b099c5e06501
-https://conda.anaconda.org/conda-forge/linux-aarch64/libgfortran5-13.2.0-h582850c_5.conda#547486aac825d236de3beecb927b389c
+https://conda.anaconda.org/conda-forge/linux-aarch64/libgfortran5-14.1.0-h9420597_0.conda#b907b29b964b8ebd7be215e47a659179
 https://conda.anaconda.org/conda-forge/linux-aarch64/libjpeg-turbo-3.0.0-h31becfc_1.conda#ed24e702928be089d9ba3f05618515c6
 https://conda.anaconda.org/conda-forge/linux-aarch64/libnsl-2.0.1-h31becfc_0.conda#c14f32510f694e3185704d89967ec422
+https://conda.anaconda.org/conda-forge/linux-aarch64/libstdcxx-ng-14.1.0-h3f4de04_0.conda#2f84852b723ac4389eb188db695526bb
 https://conda.anaconda.org/conda-forge/linux-aarch64/libuuid-2.38.1-hb4cce97_0.conda#000e30b09db0b7c775b21695dff30969
-https://conda.anaconda.org/conda-forge/linux-aarch64/libwebp-base-1.3.2-h31becfc_0.conda#1490de434d2a2c06a98af27641a2ffff
+https://conda.anaconda.org/conda-forge/linux-aarch64/libwebp-base-1.4.0-h31becfc_0.conda#5fd7ab3e5f382c70607fbac6335e6e19
 https://conda.anaconda.org/conda-forge/linux-aarch64/libxcrypt-4.4.36-h31becfc_1.conda#b4df5d7d4b63579d081fd3a4cf99740e
-https://conda.anaconda.org/conda-forge/linux-aarch64/libzlib-1.2.13-h31becfc_5.conda#b213aa87eea9491ef7b129179322e955
-https://conda.anaconda.org/conda-forge/linux-aarch64/ncurses-6.4.20240210-h0425590_0.conda#c1a1612ddaee95c83abfa0b2ec858626
-https://conda.anaconda.org/conda-forge/linux-aarch64/ninja-1.11.1-hdd96247_0.conda#58f4c67113cda9171e3c03d3e62731e1
-https://conda.anaconda.org/conda-forge/linux-aarch64/openssl-3.2.1-h31becfc_1.conda#e95eb18d256edc72058e0dc9be5338a0
+https://conda.anaconda.org/conda-forge/linux-aarch64/libzlib-1.3.1-h68df207_1.conda#b13fb82f88902e34dd0638cd7d378c21
+https://conda.anaconda.org/conda-forge/linux-aarch64/ncurses-6.5-h0425590_0.conda#38362af7bfac0efef69675acee564458
+https://conda.anaconda.org/conda-forge/linux-aarch64/openssl-3.3.1-h68df207_1.conda#8349df397000d7a7acb514d97879fe09
 https://conda.anaconda.org/conda-forge/linux-aarch64/pthread-stubs-0.4-hb9de7d4_1001.tar.bz2#d0183ec6ce0b5aaa3486df25fa5f0ded
 https://conda.anaconda.org/conda-forge/linux-aarch64/xorg-libxau-1.0.11-h31becfc_0.conda#13de34f69cb73165dbe08c1e9148bedb
 https://conda.anaconda.org/conda-forge/linux-aarch64/xorg-libxdmcp-1.1.3-h3557bc0_0.tar.bz2#a6c9016ae1ca5c47a3603ed4cd65fedd
 https://conda.anaconda.org/conda-forge/linux-aarch64/xz-5.2.6-h9cdd2b7_0.tar.bz2#83baad393a31d59c20b63ba4da6592df
+https://conda.anaconda.org/conda-forge/linux-aarch64/lerc-4.0.0-h4de3ea5_0.tar.bz2#1a0ffc65e03ce81559dbcb0695ad1476
 https://conda.anaconda.org/conda-forge/linux-aarch64/libbrotlidec-1.1.0-h31becfc_1.conda#8db7cff89510bec0b863a0a8ee6a7bce
 https://conda.anaconda.org/conda-forge/linux-aarch64/libbrotlienc-1.1.0-h31becfc_1.conda#ad3d3a826b5848d99936e4466ebbaa26
-https://conda.anaconda.org/conda-forge/linux-aarch64/libgfortran-ng-13.2.0-he9431aa_5.conda#fab7c6a8c84492e18cbe578820e97a56
+https://conda.anaconda.org/conda-forge/linux-aarch64/libgfortran-ng-14.1.0-he9431aa_0.conda#a50ae662c1e7f26f0f2c99e31d1bf614
 https://conda.anaconda.org/conda-forge/linux-aarch64/libpng-1.6.43-h194ca79_0.conda#1123e504d9254dd9494267ab9aba95f0
-https://conda.anaconda.org/conda-forge/linux-aarch64/libsqlite-3.45.2-h194ca79_0.conda#bf4c96a21fbfc6a6ef6a7781a534a4e0
-https://conda.anaconda.org/conda-forge/linux-aarch64/libxcb-1.15-h2a766a3_0.conda#eb3d8c8170e3d03f2564ed2024aa00c8
+https://conda.anaconda.org/conda-forge/linux-aarch64/libsqlite-3.46.0-hf51ef55_0.conda#a8ae63fd6fb7d007f74ef3df95e5edf3
+https://conda.anaconda.org/conda-forge/linux-aarch64/libxcb-1.16-h7935292_0.conda#93c0136e9cba96657339dfe25fba4da7
+https://conda.anaconda.org/conda-forge/linux-aarch64/ninja-1.12.1-h70be974_0.conda#216635cea46498d8045c7cf0f03eaf72
 https://conda.anaconda.org/conda-forge/linux-aarch64/readline-8.2-h8fc344f_1.conda#105eb1e16bf83bfb2eb380a48032b655
 https://conda.anaconda.org/conda-forge/linux-aarch64/tk-8.6.13-h194ca79_0.conda#f75105e0585851f818e0009dd1dde4dc
-https://conda.anaconda.org/conda-forge/linux-aarch64/zstd-1.5.5-h4c53e97_0.conda#b74eb9dbb5c3c15cb3cee7cbdf198c75
+https://conda.anaconda.org/conda-forge/linux-aarch64/zstd-1.5.6-h02f22dd_0.conda#be8d5f8cf21aed237b8b182ea86b3dd6
 https://conda.anaconda.org/conda-forge/linux-aarch64/brotli-bin-1.1.0-h31becfc_1.conda#9e4a13596ab651ea8d77aae023d0ce3f
 https://conda.anaconda.org/conda-forge/linux-aarch64/freetype-2.12.1-hf0a5ef3_2.conda#a5ab74c5bd158c3d5532b66d8d83d907
 https://conda.anaconda.org/conda-forge/linux-aarch64/libhiredis-1.0.2-h05efe27_0.tar.bz2#a87f068744fd20334cd41489eb163bee
 https://conda.anaconda.org/conda-forge/linux-aarch64/libopenblas-0.3.27-pthreads_h5a5ec62_0.conda#ffecca8f4f31cd50b92c0e6e6bfe4416
 https://conda.anaconda.org/conda-forge/linux-aarch64/libtiff-4.6.0-hf980d43_3.conda#b6f3abf5726ae33094bee238b4eb492f
-https://conda.anaconda.org/conda-forge/linux-aarch64/llvm-openmp-18.1.2-h8b0cb96_0.conda#8fb9ee33e1a87b5f114ac5c7397386f4
+https://conda.anaconda.org/conda-forge/linux-aarch64/llvm-openmp-18.1.8-hb063fc5_0.conda#f0cf07feda9ed87092833cd8fca012f5
 https://conda.anaconda.org/conda-forge/linux-aarch64/python-3.9.19-h4ac3b42_0_cpython.conda#1501507cd9451472ec8900d587ce872f
 https://conda.anaconda.org/conda-forge/linux-aarch64/brotli-1.1.0-h31becfc_1.conda#e41f5862ac746428407f3fd44d2ed01f
-https://conda.anaconda.org/conda-forge/linux-aarch64/ccache-4.9.1-h6552966_0.conda#758b202f61f6bbfd2c6adf0fde043276
-https://conda.anaconda.org/conda-forge/noarch/certifi-2024.2.2-pyhd8ed1ab_0.conda#0876280e409658fc6f9e75d035960333
+https://conda.anaconda.org/conda-forge/linux-aarch64/ccache-4.10.1-ha3bccff_0.conda#7cd24a038d2727b5e6377975237a6cfa
+https://conda.anaconda.org/conda-forge/noarch/certifi-2024.6.2-pyhd8ed1ab_0.conda#8821ec1c8fcdc9e1d291d7b9f6e9968a
 https://conda.anaconda.org/conda-forge/noarch/colorama-0.4.6-pyhd8ed1ab_0.tar.bz2#3faab06a954c2a04039983f2c4a50d99
 https://conda.anaconda.org/conda-forge/noarch/cycler-0.12.1-pyhd8ed1ab_0.conda#5cd86562580f274031ede6aa6aa24441
 https://conda.anaconda.org/conda-forge/linux-aarch64/cython-3.0.10-py39h387a81e_0.conda#0e917a89f77c978d152099357bd75b22
 https://conda.anaconda.org/conda-forge/noarch/exceptiongroup-1.2.0-pyhd8ed1ab_2.conda#8d652ea2ee8eaee02ed8dc820bc794aa
-https://conda.anaconda.org/conda-forge/noarch/execnet-2.1.0-pyhd8ed1ab_0.conda#7a4b32fbe5442e46841ec77695e36d96
+https://conda.anaconda.org/conda-forge/noarch/execnet-2.1.1-pyhd8ed1ab_0.conda#15dda3cdbf330abfe9f555d22f66db46
 https://conda.anaconda.org/conda-forge/noarch/iniconfig-2.0.0-pyhd8ed1ab_0.conda#f800d2da156d08e289b14e87e43c1ae5
 https://conda.anaconda.org/conda-forge/linux-aarch64/kiwisolver-1.4.5-py39had2cf8c_1.conda#ddb99610f7b950fdd5ff2aff19136363
 https://conda.anaconda.org/conda-forge/linux-aarch64/lcms2-2.16-h922389a_0.conda#ffdd8267a04c515e7ce69c727b051414
@@ -59,36 +59,36 @@ https://conda.anaconda.org/conda-forge/linux-aarch64/libblas-3.9.0-22_linuxaarch
 https://conda.anaconda.org/conda-forge/noarch/munkres-1.1.4-pyh9f0ad1d_0.tar.bz2#2ba8498c1018c1e9c61eb99b973dfe19
 https://conda.anaconda.org/conda-forge/linux-aarch64/openblas-0.3.27-pthreads_h339cbfa_0.conda#cb06c34a3056f59e9e244c20836add8a
 https://conda.anaconda.org/conda-forge/linux-aarch64/openjpeg-2.5.2-h0d9d63b_0.conda#fd2898519e839d5ceb778343f39a3176
-https://conda.anaconda.org/conda-forge/noarch/packaging-24.0-pyhd8ed1ab_0.conda#248f521b64ce055e7feae3105e7abeb8
-https://conda.anaconda.org/conda-forge/noarch/pluggy-1.4.0-pyhd8ed1ab_0.conda#139e9feb65187e916162917bb2484976
+https://conda.anaconda.org/conda-forge/noarch/packaging-24.1-pyhd8ed1ab_0.conda#cbe1bb1f21567018ce595d9c2be0f0db
+https://conda.anaconda.org/conda-forge/noarch/pluggy-1.5.0-pyhd8ed1ab_0.conda#d3483c8fc2dc2cc3f5cf43e26d60cabf
 https://conda.anaconda.org/conda-forge/noarch/pyparsing-3.1.2-pyhd8ed1ab_0.conda#b9a4dacf97241704529131a0dfc0494f
-https://conda.anaconda.org/conda-forge/noarch/setuptools-69.2.0-pyhd8ed1ab_0.conda#da214ecd521a720a9d521c68047682dc
+https://conda.anaconda.org/conda-forge/noarch/setuptools-70.1.1-pyhd8ed1ab_0.conda#985e9e86e1b0fc75a74a9bfab9309ef7
 https://conda.anaconda.org/conda-forge/noarch/six-1.16.0-pyh6c4a22f_0.tar.bz2#e5f25f8dbc060e9a8d912e432202afc2
-https://conda.anaconda.org/conda-forge/noarch/threadpoolctl-3.4.0-pyhc1e730c_0.conda#b296278eef667c673bf51de6535bad88
+https://conda.anaconda.org/conda-forge/noarch/threadpoolctl-3.5.0-pyhc1e730c_0.conda#df68d78237980a159bd7149f33c0e8fd
 https://conda.anaconda.org/conda-forge/noarch/tomli-2.0.1-pyhd8ed1ab_0.tar.bz2#5844808ffab9ebdb694585b50ba02a96
-https://conda.anaconda.org/conda-forge/linux-aarch64/tornado-6.4-py39h7cc1d5f_0.conda#2c06a653ebfa389c18aea2d8f338df3b
+https://conda.anaconda.org/conda-forge/linux-aarch64/tornado-6.4.1-py39ha3e8b56_0.conda#60ad0fcecca6af49fe5888a408618d8a
 https://conda.anaconda.org/conda-forge/linux-aarch64/unicodedata2-15.1.0-py39h898b7ef_0.conda#8c072c9329aeea97a46005625267a851
 https://conda.anaconda.org/conda-forge/noarch/wheel-0.43.0-pyhd8ed1ab_1.conda#0b5293a157c2b5cd513dd1b03d8d3aae
-https://conda.anaconda.org/conda-forge/noarch/zipp-3.17.0-pyhd8ed1ab_0.conda#2e4d6bc0b14e10f895fc6791a7d9b26a
-https://conda.anaconda.org/conda-forge/linux-aarch64/fonttools-4.51.0-py39h898b7ef_0.conda#7b6a069c66a729454fb4c534ed145dcd
+https://conda.anaconda.org/conda-forge/noarch/zipp-3.19.2-pyhd8ed1ab_0.conda#49808e59df5535116f6878b2a820d6f4
+https://conda.anaconda.org/conda-forge/linux-aarch64/fonttools-4.53.1-py39he257ee7_0.conda#e30df3a3431af304f87bbd0cd07d5674
 https://conda.anaconda.org/conda-forge/noarch/importlib_resources-6.4.0-pyhd8ed1ab_0.conda#c5d3907ad8bd7bf557521a1833cf7e6d
-https://conda.anaconda.org/conda-forge/noarch/joblib-1.3.2-pyhd8ed1ab_0.conda#4da50d410f553db77e62ab62ffaa1abc
+https://conda.anaconda.org/conda-forge/noarch/joblib-1.4.2-pyhd8ed1ab_0.conda#25df261d4523d9f9783bcdb7208d872f
 https://conda.anaconda.org/conda-forge/linux-aarch64/libcblas-3.9.0-22_linuxaarch64_openblas.conda#fbe7fe553f2cc78a0311e009b26f180d
 https://conda.anaconda.org/conda-forge/linux-aarch64/liblapack-3.9.0-22_linuxaarch64_openblas.conda#8c709d281609792c39b1d5c0241f90f1
-https://conda.anaconda.org/conda-forge/noarch/meson-1.4.0-pyhd8ed1ab_0.conda#52a0660cfa40b45bf254ecc3374cb2e0
-https://conda.anaconda.org/conda-forge/linux-aarch64/pillow-10.3.0-py39h71661b1_0.conda#dae548b7b537d7ef796d1d4c38a55319
+https://conda.anaconda.org/conda-forge/noarch/meson-1.4.1-pyhd8ed1ab_0.conda#714ca123839eeebb25d12b443067ea64
+https://conda.anaconda.org/conda-forge/linux-aarch64/pillow-10.4.0-py39h4a8821f_0.conda#318861157594972acc05a8715d3018a8
 https://conda.anaconda.org/conda-forge/noarch/pip-24.0-pyhd8ed1ab_0.conda#f586ac1e56c8638b64f9c8122a7b8a67
-https://conda.anaconda.org/conda-forge/noarch/pyproject-metadata-0.7.1-pyhd8ed1ab_0.conda#dcb27826ffc94d5f04e241322239983b
-https://conda.anaconda.org/conda-forge/noarch/pytest-7.4.4-pyhd8ed1ab_0.conda#a9d145de8c5f064b5fa68fb34725d9f4
+https://conda.anaconda.org/conda-forge/noarch/pyproject-metadata-0.8.0-pyhd8ed1ab_0.conda#573fe09d7bd0cd4bcc210d8369b5ca47
+https://conda.anaconda.org/conda-forge/noarch/pytest-8.2.2-pyhd8ed1ab_0.conda#0f3f49c22c7ef3a1195fa61dad3c43be
 https://conda.anaconda.org/conda-forge/noarch/python-dateutil-2.9.0-pyhd8ed1ab_0.conda#2cf4264fffb9e6eff6031c5b6884d61c
 https://conda.anaconda.org/conda-forge/noarch/importlib-resources-6.4.0-pyhd8ed1ab_0.conda#dcbadab7a68738a028e195ab68ab2d2e
 https://conda.anaconda.org/conda-forge/linux-aarch64/liblapacke-3.9.0-22_linuxaarch64_openblas.conda#5acf669e0be669f30f4b813d2ecda7b8
-https://conda.anaconda.org/conda-forge/noarch/meson-python-0.15.0-pyh0c530f3_0.conda#3bc64565ca78ce3bb80248d09926d8f9
-https://conda.anaconda.org/conda-forge/linux-aarch64/numpy-1.26.4-py39h91c28bb_0.conda#d88e195f11a9f27e649aea408b54cb48
-https://conda.anaconda.org/conda-forge/noarch/pytest-xdist-3.5.0-pyhd8ed1ab_0.conda#d5f595da2daead898ca958ac62f0307b
+https://conda.anaconda.org/conda-forge/noarch/meson-python-0.16.0-pyh0c530f3_0.conda#e16f0dbf502da873be9f9adb0dc52547
+https://conda.anaconda.org/conda-forge/linux-aarch64/numpy-2.0.0-py39hcdcdb6f_0.conda#8ba5676e972e45d1c0d947f169c6e914
+https://conda.anaconda.org/conda-forge/noarch/pytest-xdist-3.6.1-pyhd8ed1ab_0.conda#b39568655c127a9c4a44d178ac99b6d0
 https://conda.anaconda.org/conda-forge/linux-aarch64/blas-devel-3.9.0-22_linuxaarch64_openblas.conda#a5b77b6c6807661afd716f33e85814b3
 https://conda.anaconda.org/conda-forge/linux-aarch64/contourpy-1.2.1-py39hd16970a_0.conda#66b9718539ecdd38876b0176c315bcad
-https://conda.anaconda.org/conda-forge/linux-aarch64/scipy-1.13.0-py39h91c28bb_0.conda#2b6f1ed053a61c2447304e4b810fc397
+https://conda.anaconda.org/conda-forge/linux-aarch64/scipy-1.13.1-py39hb921187_0.conda#1aac9080de661e03d286f18fb71e5240
 https://conda.anaconda.org/conda-forge/linux-aarch64/blas-2.122-openblas.conda#65bc48b3bc85f8eeeab54311443a83aa
-https://conda.anaconda.org/conda-forge/linux-aarch64/matplotlib-base-3.8.3-py39h8e43113_0.conda#4feab7c7c4593a67027ab198a90dd86a
-https://conda.anaconda.org/conda-forge/linux-aarch64/matplotlib-3.8.3-py39ha65689a_0.conda#a50d805f24faf1a16c494bea4451e3b4
+https://conda.anaconda.org/conda-forge/linux-aarch64/matplotlib-base-3.8.4-py39hf44f4b6_2.conda#fadf734d38ed608c9f0b5c91fe79cfb4
+https://conda.anaconda.org/conda-forge/linux-aarch64/matplotlib-3.8.4-py39ha65689a_2.conda#c0472e3c4b3f007de6d643317c30963b
diff --git a/build_tools/generate_authors_table.py b/build_tools/generate_authors_table.py
index 28bb267b6f721..483dc3739506e 100644
--- a/build_tools/generate_authors_table.py
+++ b/build_tools/generate_authors_table.py
@@ -214,11 +214,13 @@ def generate_list(contributors):
         documentation_team,
     ) = get_contributors()
 
-    with open(REPO_FOLDER / "doc" / "authors.rst", "w+", encoding="utf-8") as rst_file:
+    with open(
+        REPO_FOLDER / "doc" / "maintainers.rst", "w+", encoding="utf-8"
+    ) as rst_file:
         rst_file.write(generate_table(core_devs))
 
     with open(
-        REPO_FOLDER / "doc" / "authors_emeritus.rst", "w+", encoding="utf-8"
+        REPO_FOLDER / "doc" / "maintainers_emeritus.rst", "w+", encoding="utf-8"
     ) as rst_file:
         rst_file.write(generate_list(emeritus))
 
diff --git a/build_tools/get_comment.py b/build_tools/get_comment.py
index b91e7383e96ea..b357c68f23e3e 100644
--- a/build_tools/get_comment.py
+++ b/build_tools/get_comment.py
@@ -116,10 +116,10 @@ def get_message(log_file, repo, pr_number, sha, run_id, details, versions):
         end="Problems detected by ruff",
         title="`ruff`",
         message=(
-            "`ruff` detected issues. Please run `ruff --fix --output-format=full .` "
-            "locally, fix the remaining issues, and push the changes. "
-            "Here you can see the detected issues. Note that the installed "
-            f"`ruff` version is `ruff={versions['ruff']}`."
+            "`ruff` detected issues. Please run "
+            "`ruff check --fix --output-format=full .` locally, fix the remaining "
+            "issues, and push the changes. Here you can see the detected issues. Note "
+            f"that the installed `ruff` version is `ruff={versions['ruff']}`."
         ),
         details=details,
     )
diff --git a/build_tools/github/build_source.sh b/build_tools/github/build_source.sh
index a4d9c7bd05387..ec53284012fa4 100755
--- a/build_tools/github/build_source.sh
+++ b/build_tools/github/build_source.sh
@@ -11,10 +11,10 @@ python -m venv build_env
 source build_env/bin/activate
 
 python -m pip install numpy scipy cython
-python -m pip install twine
+python -m pip install twine build
 
 cd scikit-learn/scikit-learn
-python setup.py sdist
+python -m build --sdist
 
 # Check whether the source distribution will render correctly
 twine check dist/*.tar.gz
diff --git a/build_tools/github/check_build_trigger.sh b/build_tools/github/check_build_trigger.sh
index 3a38924aa23a7..e3a02c4834c34 100755
--- a/build_tools/github/check_build_trigger.sh
+++ b/build_tools/github/check_build_trigger.sh
@@ -7,6 +7,7 @@ COMMIT_MSG=$(git log --no-merges -1 --oneline)
 
 # The commit marker "[cd build]" or "[cd build gh]" will trigger the build when required
 if [[ "$GITHUB_EVENT_NAME" == schedule ||
+      "$GITHUB_EVENT_NAME" == workflow_dispatch ||
       "$COMMIT_MSG" =~ \[cd\ build\] ||
       "$COMMIT_MSG" =~ \[cd\ build\ gh\] ]]; then
     echo "build=true" >> $GITHUB_OUTPUT
diff --git a/build_tools/github/create_gpu_environment.sh b/build_tools/github/create_gpu_environment.sh
new file mode 100755
index 0000000000000..87b12848d9303
--- /dev/null
+++ b/build_tools/github/create_gpu_environment.sh
@@ -0,0 +1,17 @@
+#!/bin/bash
+
+set -e
+set -x
+
+curl -L -O "https://github.com/conda-forge/miniforge/releases/latest/download/Miniforge3-$(uname)-$(uname -m).sh"
+bash Miniforge3-$(uname)-$(uname -m).sh -b -p "${HOME}/conda"
+source "${HOME}/conda/etc/profile.d/conda.sh"
+
+
+# defines the get_dep and show_installed_libraries functions
+source build_tools/shared.sh
+conda activate base
+
+CONDA_ENV_NAME=sklearn
+LOCK_FILE=build_tools/github/pylatest_conda_forge_cuda_array-api_linux-64_conda.lock
+create_conda_environment_from_lock_file $CONDA_ENV_NAME $LOCK_FILE
diff --git a/build_tools/github/pylatest_conda_forge_cuda_array-api_linux-64_conda.lock b/build_tools/github/pylatest_conda_forge_cuda_array-api_linux-64_conda.lock
new file mode 100644
index 0000000000000..91e3fae1b21ad
--- /dev/null
+++ b/build_tools/github/pylatest_conda_forge_cuda_array-api_linux-64_conda.lock
@@ -0,0 +1,268 @@
+# Generated by conda-lock.
+# platform: linux-64
+# input_hash: 7044e24fc9243a244c265e4b8c44e1304a8f55cd0cfa2d036ead6f92921d624e
+@EXPLICIT
+https://conda.anaconda.org/conda-forge/linux-64/_libgcc_mutex-0.1-conda_forge.tar.bz2#d7c89558ba9fa0495403155b64376d81
+https://conda.anaconda.org/conda-forge/linux-64/ca-certificates-2024.6.2-hbcca054_0.conda#847c3c2905cc467cea52c24f9cfa8080
+https://conda.anaconda.org/conda-forge/noarch/cuda-version-12.1-h1d6eff3_3.conda#913018efd4acd03c48f15cb60d2bbf97
+https://conda.anaconda.org/conda-forge/noarch/font-ttf-dejavu-sans-mono-2.37-hab24e00_0.tar.bz2#0c96522c6bdaed4b1566d11387caaf45
+https://conda.anaconda.org/conda-forge/noarch/font-ttf-inconsolata-3.000-h77eed37_0.tar.bz2#34893075a5c9e55cdafac56607368fc6
+https://conda.anaconda.org/conda-forge/noarch/font-ttf-source-code-pro-2.038-h77eed37_0.tar.bz2#4d59c254e01d9cde7957100457e2d5fb
+https://conda.anaconda.org/conda-forge/noarch/font-ttf-ubuntu-0.83-h77eed37_2.conda#cbbe59391138ea5ad3658c76912e147f
+https://conda.anaconda.org/conda-forge/linux-64/ld_impl_linux-64-2.40-hf3520f5_7.conda#b80f2f396ca2c28b8c14c437a4ed1e74
+https://conda.anaconda.org/nvidia/linux-64/libcublas-12.1.0.26-0.tar.bz2#74f872929a02e01ef746a064fa46a80c
+https://conda.anaconda.org/nvidia/linux-64/libcufft-11.0.2.4-0.tar.bz2#b53f7ea28a363eb6d218bcbffb9d26aa
+https://conda.anaconda.org/nvidia/linux-64/libcusolver-11.4.4.55-0.tar.bz2#2d2fe4a7af91ec8a1eee7f1f0cf7b050
+https://conda.anaconda.org/nvidia/linux-64/libcusparse-12.0.2.55-0.tar.bz2#c295ea64ea0654af0cbe833431de6daa
+https://conda.anaconda.org/nvidia/linux-64/libnpp-12.0.2.50-0.tar.bz2#072e390c1e0e4909bdd7508dd6af1474
+https://conda.anaconda.org/nvidia/linux-64/libnvjpeg-12.1.1.14-0.tar.bz2#4dea93d43adfd03388b31f2ae9892558
+https://conda.anaconda.org/conda-forge/linux-64/mkl-include-2022.1.0-h84fe81f_915.tar.bz2#2dcd1acca05c11410d4494d7fc7dfa2a
+https://conda.anaconda.org/conda-forge/linux-64/python_abi-3.12-4_cp312.conda#dccc2d142812964fcc6abdc97b672dff
+https://conda.anaconda.org/pytorch/noarch/pytorch-mutex-1.0-cuda.tar.bz2#a948316e36fb5b11223b3fcfa93f8358
+https://conda.anaconda.org/conda-forge/noarch/tzdata-2024a-h0c530f3_0.conda#161081fc7cec0bfda0d86d7cb595f8d8
+https://conda.anaconda.org/conda-forge/noarch/cuda-cudart_linux-64-12.1.105-h59595ed_0.conda#f8229a887df2311217d1528cc205073b
+https://conda.anaconda.org/conda-forge/noarch/fonts-conda-forge-1-0.tar.bz2#f766549260d6815b0c52253f1fb1bb29
+https://conda.anaconda.org/conda-forge/noarch/fonts-conda-ecosystem-1-0.tar.bz2#fee5683a3f04bd15cbd8318b096a27ab
+https://conda.anaconda.org/conda-forge/linux-64/_openmp_mutex-4.5-2_kmp_llvm.tar.bz2#562b26ba2e19059551a811e72ab7f793
+https://conda.anaconda.org/conda-forge/linux-64/libgcc-ng-13.2.0-h77fa898_13.conda#9358cdd61ef0d600d2a0dde2d53b006c
+https://conda.anaconda.org/conda-forge/linux-64/alsa-lib-1.2.12-h4ab18f5_0.conda#7ed427f0871fd41cb1d9c17727c17589
+https://conda.anaconda.org/conda-forge/linux-64/attr-2.5.1-h166bdaf_1.tar.bz2#d9c69a24ad678ffce24c6543a0176b00
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-common-0.9.19-h4ab18f5_0.conda#c6dedd5eab2236f4abb59ade9fb7fd44
+https://conda.anaconda.org/conda-forge/linux-64/bzip2-1.0.8-hd590300_5.conda#69b8b6202a07720f448be700e300ccf4
+https://conda.anaconda.org/conda-forge/linux-64/c-ares-1.28.1-hd590300_0.conda#dcde58ff9a1f30b0037a2315d1846d1f
+https://conda.anaconda.org/conda-forge/linux-64/gettext-tools-0.22.5-h59595ed_2.conda#985f2f453fb72408d6b6f1be0f324033
+https://conda.anaconda.org/conda-forge/linux-64/keyutils-1.6.1-h166bdaf_0.tar.bz2#30186d27e2c9fa62b45fb1476b7200e3
+https://conda.anaconda.org/conda-forge/linux-64/lame-3.100-h166bdaf_1003.tar.bz2#a8832b479f93521a9e7b5b743803be51
+https://conda.anaconda.org/conda-forge/linux-64/libbrotlicommon-1.1.0-hd590300_1.conda#aec6c91c7371c26392a06708a73c70e5
+https://conda.anaconda.org/conda-forge/linux-64/libdeflate-1.20-hd590300_0.conda#8e88f9389f1165d7c0936fe40d9a9a79
+https://conda.anaconda.org/conda-forge/linux-64/libev-4.33-hd590300_2.conda#172bf1cd1ff8629f2b1179945ed45055
+https://conda.anaconda.org/conda-forge/linux-64/libexpat-2.6.2-h59595ed_0.conda#e7ba12deb7020dd080c6c70e7b6f6a3d
+https://conda.anaconda.org/conda-forge/linux-64/libffi-3.4.2-h7f98852_5.tar.bz2#d645c6d2ac96843a2bfaccd2d62b3ac3
+https://conda.anaconda.org/conda-forge/linux-64/libgettextpo-0.22.5-h59595ed_2.conda#172bcc51059416e7ce99e7b528cede83
+https://conda.anaconda.org/conda-forge/linux-64/libgfortran5-13.2.0-h3d2ce59_13.conda#1e380198685bc1e993bbbc4b579f5916
+https://conda.anaconda.org/conda-forge/linux-64/libiconv-1.17-hd590300_2.conda#d66573916ffcf376178462f1b61c941e
+https://conda.anaconda.org/conda-forge/linux-64/libjpeg-turbo-3.0.0-hd590300_1.conda#ea25936bb4080d843790b586850f82b8
+https://conda.anaconda.org/conda-forge/linux-64/libnsl-2.0.1-hd590300_0.conda#30fd6e37fe21f86f4bd26d6ee73eeec7
+https://conda.anaconda.org/conda-forge/linux-64/libogg-1.3.4-h7f98852_1.tar.bz2#6e8cc2173440d77708196c5b93771680
+https://conda.anaconda.org/conda-forge/linux-64/libopus-1.3.1-h7f98852_1.tar.bz2#15345e56d527b330e1cacbdf58676e8f
+https://conda.anaconda.org/conda-forge/linux-64/libstdcxx-ng-13.2.0-hc0a3c3a_13.conda#1053882642ed5bbc799e1e866ff86826
+https://conda.anaconda.org/conda-forge/linux-64/libutf8proc-2.8.0-h166bdaf_0.tar.bz2#ede4266dc02e875fe1ea77b25dd43747
+https://conda.anaconda.org/conda-forge/linux-64/libuuid-2.38.1-h0b41bf4_0.conda#40b61aab5c7ba9ff276c41cfffe6b80b
+https://conda.anaconda.org/conda-forge/linux-64/libwebp-base-1.4.0-hd590300_0.conda#b26e8aa824079e1be0294e7152ca4559
+https://conda.anaconda.org/conda-forge/linux-64/libxcrypt-4.4.36-hd590300_1.conda#5aa797f8787fe7a17d1b0821485b5adc
+https://conda.anaconda.org/conda-forge/linux-64/libzlib-1.3.1-h4ab18f5_1.conda#57d7dc60e9325e3de37ff8dffd18e814
+https://conda.anaconda.org/conda-forge/linux-64/ncurses-6.5-h59595ed_0.conda#fcea371545eda051b6deafb24889fc69
+https://conda.anaconda.org/conda-forge/linux-64/ocl-icd-2.3.2-hd590300_1.conda#c66f837ac65e4d1cdeb80e2a1d5fcc3d
+https://conda.anaconda.org/conda-forge/linux-64/openssl-3.3.1-h4ab18f5_0.conda#a41fa0e391cc9e0d6b78ac69ca047a6c
+https://conda.anaconda.org/conda-forge/linux-64/pthread-stubs-0.4-h36c2ea0_1001.tar.bz2#22dad4df6e8630e8dff2428f6f6a7036
+https://conda.anaconda.org/conda-forge/linux-64/xorg-kbproto-1.0.7-h7f98852_1002.tar.bz2#4b230e8381279d76131116660f5a241a
+https://conda.anaconda.org/conda-forge/linux-64/xorg-libice-1.1.1-hd590300_0.conda#b462a33c0be1421532f28bfe8f4a7514
+https://conda.anaconda.org/conda-forge/linux-64/xorg-libxau-1.0.11-hd590300_0.conda#2c80dc38fface310c9bd81b17037fee5
+https://conda.anaconda.org/conda-forge/linux-64/xorg-libxdmcp-1.1.3-h7f98852_0.tar.bz2#be93aabceefa2fac576e971aef407908
+https://conda.anaconda.org/conda-forge/linux-64/xorg-renderproto-0.11.1-h7f98852_1002.tar.bz2#06feff3d2634e3097ce2fe681474b534
+https://conda.anaconda.org/conda-forge/linux-64/xorg-xextproto-7.3.0-h0b41bf4_1003.conda#bce9f945da8ad2ae9b1d7165a64d0f87
+https://conda.anaconda.org/conda-forge/linux-64/xorg-xf86vidmodeproto-2.3.1-h7f98852_1002.tar.bz2#3ceea9668625c18f19530de98b15d5b0
+https://conda.anaconda.org/conda-forge/linux-64/xorg-xproto-7.0.31-h7f98852_1007.tar.bz2#b4a4381d54784606820704f7b5f05a15
+https://conda.anaconda.org/conda-forge/linux-64/xz-5.2.6-h166bdaf_0.tar.bz2#2161070d867d1b1204ea749c8eec4ef0
+https://conda.anaconda.org/conda-forge/linux-64/yaml-0.2.5-h7f98852_2.tar.bz2#4cb3ad778ec2d5a7acbdf254eb1c42ae
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-cal-0.6.15-h88a6e22_0.conda#50eabf107100f8f929bc3246ea63fa08
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-compression-0.2.18-h83b837d_6.conda#3e572eacd0ce99a59e1bb9c260ad5b20
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-sdkutils-0.1.16-h83b837d_2.conda#f40c698b4ea90f7fedd187c6639c818b
+https://conda.anaconda.org/conda-forge/linux-64/aws-checksums-0.1.18-h83b837d_6.conda#7995cb937bdac5913c8904fed6b3729d
+https://conda.anaconda.org/conda-forge/linux-64/cuda-cudart-12.1.105-hd3aeb46_0.conda#e2ab3aeff4d18c82b3e7025a2ec3cecc
+https://conda.anaconda.org/conda-forge/linux-64/cuda-cupti-12.1.105-h59595ed_0.conda#37400196a2a9d83a1a79ed763189ce32
+https://conda.anaconda.org/conda-forge/linux-64/cuda-nvrtc-12.1.105-hd3aeb46_0.conda#361041b17b31f25e60ac43127f52bd3a
+https://conda.anaconda.org/conda-forge/linux-64/cuda-nvtx-12.1.105-h59595ed_0.conda#a8e1192335156d6e0a8972794cd1da49
+https://conda.anaconda.org/conda-forge/linux-64/cuda-opencl-12.1.105-h59595ed_0.conda#f2589b459bbf72de590aea9383a2568a
+https://conda.anaconda.org/conda-forge/linux-64/expat-2.6.2-h59595ed_0.conda#53fb86322bdb89496d7579fe3f02fd61
+https://conda.anaconda.org/conda-forge/linux-64/gflags-2.2.2-he1b5a44_1004.tar.bz2#cddaf2c63ea4a5901cf09524c490ecdc
+https://conda.anaconda.org/conda-forge/linux-64/gmp-6.3.0-hac33072_2.conda#c94a5994ef49749880a8139cf9afcbe1
+https://conda.anaconda.org/conda-forge/linux-64/graphite2-1.3.13-h59595ed_1003.conda#f87c7b7c2cb45f323ffbce941c78ab7c
+https://conda.anaconda.org/conda-forge/linux-64/icu-73.2-h59595ed_0.conda#cc47e1facc155f91abd89b11e48e72ff
+https://conda.anaconda.org/conda-forge/linux-64/lerc-4.0.0-h27087fc_0.tar.bz2#76bbff344f0134279f225174e9064c8f
+https://conda.anaconda.org/conda-forge/linux-64/libabseil-20240116.2-cxx17_h59595ed_0.conda#682bdbe046a68f749769b492f3625c5c
+https://conda.anaconda.org/conda-forge/linux-64/libasprintf-0.22.5-h661eb56_2.conda#dd197c968bf9760bba0031888d431ede
+https://conda.anaconda.org/conda-forge/linux-64/libbrotlidec-1.1.0-hd590300_1.conda#f07002e225d7a60a694d42a7bf5ff53f
+https://conda.anaconda.org/conda-forge/linux-64/libbrotlienc-1.1.0-hd590300_1.conda#5fc11c6020d421960607d821310fcd4d
+https://conda.anaconda.org/conda-forge/linux-64/libcap-2.69-h0f662aa_0.conda#25cb5999faa414e5ccb2c1388f62d3d5
+https://conda.anaconda.org/conda-forge/linux-64/libcrc32c-1.1.2-h9c3ff4c_0.tar.bz2#c965a5aa0d5c1c37ffc62dff36e28400
+https://conda.anaconda.org/conda-forge/linux-64/libcufile-1.6.1.9-hd3aeb46_0.conda#9a58d214028c01750eaa2cd07386150d
+https://conda.anaconda.org/conda-forge/linux-64/libcurand-10.3.2.106-hd3aeb46_0.conda#1bd892b578e3bfb7fb482c943ed3d904
+https://conda.anaconda.org/conda-forge/linux-64/libedit-3.1.20191231-he28a2e2_2.tar.bz2#4d331e44109e3f0e19b4cb8f9b82f3e1
+https://conda.anaconda.org/conda-forge/linux-64/libevent-2.1.12-hf998b51_1.conda#a1cfcc585f0c42bf8d5546bb1dfb668d
+https://conda.anaconda.org/conda-forge/linux-64/libgettextpo-devel-0.22.5-h59595ed_2.conda#b63d9b6da3653179a278077f0de20014
+https://conda.anaconda.org/conda-forge/linux-64/libgfortran-ng-13.2.0-h69a702a_13.conda#516e66b26eea14e7e322fe99e88e0f02
+https://conda.anaconda.org/conda-forge/linux-64/libnghttp2-1.58.0-h47da74e_1.conda#700ac6ea6d53d5510591c4344d5c989a
+https://conda.anaconda.org/conda-forge/linux-64/libnvjitlink-12.1.105-hd3aeb46_0.conda#ed70b41cca6446cab43b0069bf17bd9c
+https://conda.anaconda.org/conda-forge/linux-64/libpng-1.6.43-h2797004_0.conda#009981dd9cfcaa4dbfa25ffaed86bcae
+https://conda.anaconda.org/conda-forge/linux-64/libsqlite-3.46.0-hde9e2c9_0.conda#18aa975d2094c34aef978060ae7da7d8
+https://conda.anaconda.org/conda-forge/linux-64/libssh2-1.11.0-h0841786_0.conda#1f5a58e686b13bcfde88b93f547d23fe
+https://conda.anaconda.org/conda-forge/linux-64/libvorbis-1.3.7-h9c3ff4c_0.tar.bz2#309dec04b70a3cc0f1e84a4013683bc0
+https://conda.anaconda.org/conda-forge/linux-64/libxcb-1.16-hd590300_0.conda#151cba22b85a989c2d6ef9633ffee1e4
+https://conda.anaconda.org/conda-forge/linux-64/llvm-openmp-15.0.7-h0cdce71_0.conda#589c9a3575a050b583241c3d688ad9aa
+https://conda.anaconda.org/conda-forge/linux-64/lz4-c-1.9.4-hcb278e6_0.conda#318b08df404f9c9be5712aaa5a6f0bb0
+https://conda.anaconda.org/conda-forge/linux-64/mpg123-1.32.6-h59595ed_0.conda#9160cdeb523a1b20cf8d2a0bf821f45d
+https://conda.anaconda.org/conda-forge/linux-64/mysql-common-8.3.0-hf1915f5_4.conda#784a4df6676c581ca624fbe460703a6d
+https://conda.anaconda.org/conda-forge/linux-64/ninja-1.12.1-h297d8ca_0.conda#3aa1c7e292afeff25a0091ddd7c69b72
+https://conda.anaconda.org/conda-forge/linux-64/nspr-4.35-h27087fc_0.conda#da0ec11a6454ae19bff5b02ed881a2b1
+https://conda.anaconda.org/conda-forge/linux-64/pcre2-10.44-h0f59acf_0.conda#3914f7ac1761dce57102c72ca7c35d01
+https://conda.anaconda.org/conda-forge/linux-64/pixman-0.43.2-h59595ed_0.conda#71004cbf7924e19c02746ccde9fd7123
+https://conda.anaconda.org/conda-forge/linux-64/readline-8.2-h8228510_1.conda#47d31b792659ce70f470b5c82fdfb7a4
+https://conda.anaconda.org/conda-forge/linux-64/s2n-1.4.16-he19d79f_0.conda#de1cf82e46578faf7de8c23efe5d7be4
+https://conda.anaconda.org/conda-forge/linux-64/snappy-1.2.0-hdb0a2a9_1.conda#843bbb8ace1d64ac50d64639ff38b014
+https://conda.anaconda.org/conda-forge/linux-64/tk-8.6.13-noxft_h4845f30_101.conda#d453b98d9c83e71da0741bb0ff4d76bc
+https://conda.anaconda.org/conda-forge/linux-64/xorg-libsm-1.2.4-h7391055_0.conda#93ee23f12bc2e684548181256edd2cf6
+https://conda.anaconda.org/conda-forge/linux-64/zlib-1.3.1-h4ab18f5_1.conda#9653f1bf3766164d0e65fa723cabbc54
+https://conda.anaconda.org/conda-forge/linux-64/zstd-1.5.6-ha6fb4c9_0.conda#4d056880988120e29d75bfff282e0f45
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-io-0.14.9-h2d549f9_2.conda#5a828631479163d88e419fd6841139c4
+https://conda.anaconda.org/conda-forge/linux-64/brotli-bin-1.1.0-hd590300_1.conda#39f910d205726805a958da408ca194ba
+https://conda.anaconda.org/nvidia/linux-64/cuda-libraries-12.1.0-0.tar.bz2#8c08238819848e471a6213db526dbf15
+https://conda.anaconda.org/conda-forge/linux-64/freetype-2.12.1-h267a509_2.conda#9ae35c3d96db2c94ce0cef86efdfa2cb
+https://conda.anaconda.org/conda-forge/linux-64/glog-0.7.1-hbabe93e_0.conda#ff862eebdfeb2fd048ae9dc92510baca
+https://conda.anaconda.org/conda-forge/linux-64/krb5-1.21.2-h659d440_0.conda#cd95826dbd331ed1be26bdf401432844
+https://conda.anaconda.org/conda-forge/linux-64/libasprintf-devel-0.22.5-h661eb56_2.conda#02e41ab5834dcdcc8590cf29d9526f50
+https://conda.anaconda.org/conda-forge/linux-64/libglib-2.80.2-h8a4344b_1.conda#9c406bb3d4dac2b358873e6462496d09
+https://conda.anaconda.org/conda-forge/linux-64/libhiredis-1.0.2-h2cc385e_0.tar.bz2#b34907d3a81a3cd8095ee83d174c074a
+https://conda.anaconda.org/conda-forge/linux-64/libprotobuf-4.25.3-h08a7969_0.conda#6945825cebd2aeb16af4c69d97c32c13
+https://conda.anaconda.org/conda-forge/linux-64/libre2-11-2023.09.01-h5a48ba9_2.conda#41c69fba59d495e8cf5ffda48a607e35
+https://conda.anaconda.org/conda-forge/linux-64/libthrift-0.19.0-hb90f79a_1.conda#8cdb7d41faa0260875ba92414c487e2d
+https://conda.anaconda.org/conda-forge/linux-64/libtiff-4.6.0-h1dd3fc0_3.conda#66f03896ffbe1a110ffda05c7a856504
+https://conda.anaconda.org/conda-forge/linux-64/libxml2-2.12.7-hc051c1a_1.conda#340278ded8b0dc3a73f3660bbb0adbc6
+https://conda.anaconda.org/conda-forge/linux-64/mpfr-4.2.1-h9458935_1.conda#8083b20f566639c22f78bcd6ca35b276
+https://conda.anaconda.org/conda-forge/linux-64/mysql-libs-8.3.0-hca2cd23_4.conda#1b50eebe2a738a3146c154d2eceaa8b6
+https://conda.anaconda.org/conda-forge/linux-64/nss-3.101-h593d115_0.conda#b24ab6abea1bdc28d646336a03d15392
+https://conda.anaconda.org/conda-forge/linux-64/python-3.12.4-h194c7f8_0_cpython.conda#d73490214f536cccb5819e9873048c92
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-0.4.1-hb711507_2.conda#8637c3e5821654d0edf97e2b0404b443
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-keysyms-0.4.1-hb711507_0.conda#ad748ccca349aec3e91743e08b5e2b50
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-renderutil-0.3.10-hb711507_0.conda#0e0cbe0564d03a99afd5fd7b362feecd
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-wm-0.4.2-hb711507_0.conda#608e0ef8256b81d04456e8d211eee3e8
+https://conda.anaconda.org/conda-forge/linux-64/xorg-libx11-1.8.9-hb711507_1.conda#4a6d410296d7e39f00bacdee7df046e9
+https://conda.anaconda.org/conda-forge/noarch/array-api-compat-1.7.1-pyhd8ed1ab_0.conda#8791d81c38f676a7c08c76546800bf70
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-event-stream-0.4.2-h0cbf018_13.conda#15351eccac4eda2b5fd38bbbdae78bdf
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-http-0.8.2-h360477d_2.conda#a820cb648906f7f30076c66dd46b1790
+https://conda.anaconda.org/conda-forge/linux-64/brotli-1.1.0-hd590300_1.conda#f27a24d46e3ea7b70a1f98e50c62508f
+https://conda.anaconda.org/conda-forge/linux-64/ccache-4.9.1-h1fcd64f_0.conda#3620f564bcf28c3524951b6f64f5c5ac
+https://conda.anaconda.org/conda-forge/noarch/certifi-2024.6.2-pyhd8ed1ab_0.conda#8821ec1c8fcdc9e1d291d7b9f6e9968a
+https://conda.anaconda.org/conda-forge/noarch/colorama-0.4.6-pyhd8ed1ab_0.tar.bz2#3faab06a954c2a04039983f2c4a50d99
+https://conda.anaconda.org/nvidia/linux-64/cuda-runtime-12.1.0-0.tar.bz2#95e8c2f09ec28cce7cdecd6200b5d26e
+https://conda.anaconda.org/conda-forge/noarch/cycler-0.12.1-pyhd8ed1ab_0.conda#5cd86562580f274031ede6aa6aa24441
+https://conda.anaconda.org/conda-forge/linux-64/cython-3.0.10-py312h30efb56_0.conda#b119273bff37284cbcb9281c1e85e67d
+https://conda.anaconda.org/conda-forge/linux-64/dbus-1.13.6-h5008d03_3.tar.bz2#ecfff944ba3960ecb334b9a2663d708d
+https://conda.anaconda.org/conda-forge/noarch/exceptiongroup-1.2.0-pyhd8ed1ab_2.conda#8d652ea2ee8eaee02ed8dc820bc794aa
+https://conda.anaconda.org/conda-forge/noarch/execnet-2.1.1-pyhd8ed1ab_0.conda#15dda3cdbf330abfe9f555d22f66db46
+https://conda.anaconda.org/conda-forge/linux-64/fastrlock-0.8.2-py312h30efb56_2.conda#7065ec5a4909f925e305b77e505b0aec
+https://conda.anaconda.org/conda-forge/noarch/filelock-3.15.4-pyhd8ed1ab_0.conda#0e7e4388e9d5283e22b35a9443bdbcc9
+https://conda.anaconda.org/conda-forge/linux-64/fontconfig-2.14.2-h14ed4e7_0.conda#0f69b688f52ff6da70bccb7ff7001d1d
+https://conda.anaconda.org/conda-forge/linux-64/gettext-0.22.5-h59595ed_2.conda#219ba82e95d7614cf7140d2a4afc0926
+https://conda.anaconda.org/conda-forge/linux-64/glib-tools-2.80.2-h73ef956_1.conda#1daf2cc7054ff71b9a05485f2562cbb4
+https://conda.anaconda.org/conda-forge/noarch/iniconfig-2.0.0-pyhd8ed1ab_0.conda#f800d2da156d08e289b14e87e43c1ae5
+https://conda.anaconda.org/conda-forge/linux-64/kiwisolver-1.4.5-py312h8572e83_1.conda#c1e71f2bc05d8e8e033aefac2c490d05
+https://conda.anaconda.org/conda-forge/linux-64/lcms2-2.16-hb7c19ff_0.conda#51bb7010fc86f70eee639b4bb7a894f5
+https://conda.anaconda.org/conda-forge/linux-64/libcups-2.3.3-h4637d8d_4.conda#d4529f4dff3057982a7617c7ac58fde3
+https://conda.anaconda.org/conda-forge/linux-64/libcurl-8.8.0-hca28451_0.conda#f21c27f076a07907e70c49bb57bd0f20
+https://conda.anaconda.org/conda-forge/linux-64/libhwloc-2.10.0-default_h5622ce7_1001.conda#fc2d5b79c2d3f8568fbab31db7ae02f3
+https://conda.anaconda.org/conda-forge/linux-64/libllvm15-15.0.7-hb3ce162_4.conda#8a35df3cbc0c8b12cc8af9473ae75eef
+https://conda.anaconda.org/conda-forge/linux-64/libllvm18-18.1.8-hc9dba70_0.conda#f94ed0c5953c78dcca7adb953f4c5bfb
+https://conda.anaconda.org/conda-forge/linux-64/libpq-16.3-ha72fbe1_0.conda#bac737ae28b79cfbafd515258d97d29e
+https://conda.anaconda.org/conda-forge/linux-64/markupsafe-2.1.5-py312h98912ed_0.conda#6ff0b9582da2d4a74a1f9ae1f9ce2af6
+https://conda.anaconda.org/conda-forge/linux-64/mpc-1.3.1-hfe3b2da_0.conda#289c71e83dc0daa7d4c81f04180778ca
+https://conda.anaconda.org/conda-forge/noarch/mpmath-1.3.0-pyhd8ed1ab_0.conda#dbf6e2d89137da32fa6670f3bffc024e
+https://conda.anaconda.org/conda-forge/noarch/munkres-1.1.4-pyh9f0ad1d_0.tar.bz2#2ba8498c1018c1e9c61eb99b973dfe19
+https://conda.anaconda.org/conda-forge/noarch/networkx-3.3-pyhd8ed1ab_1.conda#d335fd5704b46f4efb89a6774e81aef0
+https://conda.anaconda.org/conda-forge/linux-64/openjpeg-2.5.2-h488ebb8_0.conda#7f2e286780f072ed750df46dc2631138
+https://conda.anaconda.org/conda-forge/linux-64/orc-2.0.1-h17fec99_1.conda#3bf65f0d8e7322a1cfe8b670fa35ec81
+https://conda.anaconda.org/conda-forge/noarch/packaging-24.1-pyhd8ed1ab_0.conda#cbe1bb1f21567018ce595d9c2be0f0db
+https://conda.anaconda.org/conda-forge/noarch/pluggy-1.5.0-pyhd8ed1ab_0.conda#d3483c8fc2dc2cc3f5cf43e26d60cabf
+https://conda.anaconda.org/conda-forge/noarch/ply-3.11-pyhd8ed1ab_2.conda#18c6deb6f9602e32446398203c8f0e91
+https://conda.anaconda.org/conda-forge/noarch/pyparsing-3.1.2-pyhd8ed1ab_0.conda#b9a4dacf97241704529131a0dfc0494f
+https://conda.anaconda.org/conda-forge/noarch/python-tzdata-2024.1-pyhd8ed1ab_0.conda#98206ea9954216ee7540f0c773f2104d
+https://conda.anaconda.org/conda-forge/noarch/pytz-2024.1-pyhd8ed1ab_0.conda#3eeeeb9e4827ace8c0c1419c85d590ad
+https://conda.anaconda.org/conda-forge/linux-64/pyyaml-6.0.1-py312h98912ed_1.conda#e3fd78d8d490af1d84763b9fe3f2e552
+https://conda.anaconda.org/conda-forge/linux-64/re2-2023.09.01-h7f4b329_2.conda#8f70e36268dea8eb666ef14c29bd3cda
+https://conda.anaconda.org/conda-forge/noarch/setuptools-70.1.0-pyhd8ed1ab_0.conda#258e66f95f814d51ada2a1fe9274039b
+https://conda.anaconda.org/conda-forge/noarch/six-1.16.0-pyh6c4a22f_0.tar.bz2#e5f25f8dbc060e9a8d912e432202afc2
+https://conda.anaconda.org/conda-forge/noarch/threadpoolctl-3.5.0-pyhc1e730c_0.conda#df68d78237980a159bd7149f33c0e8fd
+https://conda.anaconda.org/conda-forge/noarch/toml-0.10.2-pyhd8ed1ab_0.tar.bz2#f832c45a477c78bebd107098db465095
+https://conda.anaconda.org/conda-forge/noarch/tomli-2.0.1-pyhd8ed1ab_0.tar.bz2#5844808ffab9ebdb694585b50ba02a96
+https://conda.anaconda.org/conda-forge/linux-64/tornado-6.4.1-py312h9a8786e_0.conda#fd9c83fde763b494f07acee1404c280e
+https://conda.anaconda.org/conda-forge/noarch/typing_extensions-4.12.2-pyha770c72_0.conda#ebe6952715e1d5eb567eeebf25250fa7
+https://conda.anaconda.org/conda-forge/noarch/wheel-0.43.0-pyhd8ed1ab_1.conda#0b5293a157c2b5cd513dd1b03d8d3aae
+https://conda.anaconda.org/conda-forge/linux-64/xcb-util-image-0.4.0-hb711507_2.conda#a0901183f08b6c7107aab109733a3c91
+https://conda.anaconda.org/conda-forge/linux-64/xkeyboard-config-2.42-h4ab18f5_0.conda#b193af204da1bfb8c13882d131a14bd2
+https://conda.anaconda.org/conda-forge/linux-64/xorg-libxext-1.3.4-h0b41bf4_2.conda#82b6df12252e6f32402b96dacc656fec
+https://conda.anaconda.org/conda-forge/linux-64/xorg-libxrender-0.9.11-hd590300_0.conda#ed67c36f215b310412b2af935bf3e530
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-auth-0.7.22-h9137712_5.conda#ea86de440f848596543ff58030e5272d
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-mqtt-0.10.4-hf85b563_6.conda#845ddce9934691f5c34ad13d7313ba29
+https://conda.anaconda.org/conda-forge/linux-64/azure-core-cpp-1.12.0-h830ed8b_0.conda#320d066f9cad598854f4af32c7c82931
+https://conda.anaconda.org/conda-forge/linux-64/cairo-1.18.0-hbb29018_2.conda#b6d90276c5aee9b4407dd94eb0cd40a8
+https://conda.anaconda.org/conda-forge/linux-64/coverage-7.5.4-py312h9a8786e_0.conda#b40224324679d1966a9fafbd602b28f3
+https://conda.anaconda.org/conda-forge/linux-64/fonttools-4.53.0-py312h9a8786e_0.conda#8490346e9d5efd7a6869582aa0c95b25
+https://conda.anaconda.org/conda-forge/linux-64/glib-2.80.2-h8a4344b_1.conda#dad336abc079b9a38dc10087231619cd
+https://conda.anaconda.org/conda-forge/linux-64/gmpy2-2.1.5-py312h1d5cde6_1.conda#27abd7664bc87595bd98b6306b8393d1
+https://conda.anaconda.org/conda-forge/noarch/jinja2-3.1.4-pyhd8ed1ab_0.conda#7b86ecb7d3557821c649b3c31e3eb9f2
+https://conda.anaconda.org/conda-forge/noarch/joblib-1.4.2-pyhd8ed1ab_0.conda#25df261d4523d9f9783bcdb7208d872f
+https://conda.anaconda.org/conda-forge/linux-64/libclang-cpp15-15.0.7-default_h127d8a8_5.conda#d0a9633b53cdc319b8a1a532ae7822b8
+https://conda.anaconda.org/conda-forge/linux-64/libclang13-18.1.8-default_h6ae225f_0.conda#28ad2db5c14d2e23d7962b8389e2cc0b
+https://conda.anaconda.org/conda-forge/linux-64/libflac-1.4.3-h59595ed_0.conda#ee48bf17cc83a00f59ca1494d5646869
+https://conda.anaconda.org/conda-forge/linux-64/libgpg-error-1.49-h4f305b6_0.conda#dfcfd72c7a430d3616763ecfbefe4ca9
+https://conda.anaconda.org/conda-forge/linux-64/libgrpc-1.62.2-h15f2491_0.conda#8dabe607748cb3d7002ad73cd06f1325
+https://conda.anaconda.org/conda-forge/linux-64/libxkbcommon-1.7.0-h2c5496b_1.conda#e2eaefa4de2b7237af7c907b8bbc760a
+https://conda.anaconda.org/conda-forge/noarch/meson-1.4.1-pyhd8ed1ab_0.conda#714ca123839eeebb25d12b443067ea64
+https://conda.anaconda.org/conda-forge/linux-64/pillow-10.3.0-py312h287a98d_1.conda#b1325cda3f250f9f842180607054e6ed
+https://conda.anaconda.org/conda-forge/noarch/pip-24.0-pyhd8ed1ab_0.conda#f586ac1e56c8638b64f9c8122a7b8a67
+https://conda.anaconda.org/conda-forge/noarch/pyproject-metadata-0.8.0-pyhd8ed1ab_0.conda#573fe09d7bd0cd4bcc210d8369b5ca47
+https://conda.anaconda.org/conda-forge/noarch/pytest-8.2.2-pyhd8ed1ab_0.conda#0f3f49c22c7ef3a1195fa61dad3c43be
+https://conda.anaconda.org/conda-forge/noarch/python-dateutil-2.9.0-pyhd8ed1ab_0.conda#2cf4264fffb9e6eff6031c5b6884d61c
+https://conda.anaconda.org/pytorch/linux-64/pytorch-cuda-12.1-ha16c6d3_5.tar.bz2#ffc0937cf6ba3ffb299b0c256accc53f
+https://conda.anaconda.org/conda-forge/linux-64/sip-6.7.12-py312h30efb56_0.conda#32633871002ee9902f747d2236e0d122
+https://conda.anaconda.org/conda-forge/linux-64/tbb-2021.12.0-h297d8ca_1.conda#3ff978d8994f591818a506640c6a7071
+https://conda.anaconda.org/conda-forge/linux-64/aws-c-s3-0.5.10-h679ed35_3.conda#8cb40f80d08389f6aaf68cf86581ed02
+https://conda.anaconda.org/conda-forge/linux-64/azure-identity-cpp-1.8.0-hdb0d106_1.conda#a297ffb4b505f51d0f58352c5c13971b
+https://conda.anaconda.org/conda-forge/linux-64/azure-storage-common-cpp-12.6.0-he3f277c_1.conda#8a10bb068b138dd473300b5fe34a1865
+https://conda.anaconda.org/conda-forge/linux-64/gstreamer-1.24.5-haf2f30d_0.conda#c5252c02592373fa8caf5a5327165a89
+https://conda.anaconda.org/conda-forge/linux-64/harfbuzz-8.5.0-hfac3d4d_0.conda#f5126317dd0ce0ba26945e411ecc6960
+https://conda.anaconda.org/conda-forge/linux-64/libgcrypt-1.10.3-hd590300_0.conda#32d16ad533c59bb0a3c5ffaf16110829
+https://conda.anaconda.org/conda-forge/linux-64/libgoogle-cloud-2.25.0-h2736e30_0.conda#1bbc13a65b92eafde06dbdf0ef3658cd
+https://conda.anaconda.org/conda-forge/linux-64/libsndfile-1.2.2-hc60ed4a_1.conda#ef1910918dd895516a769ed36b5b3a4e
+https://conda.anaconda.org/conda-forge/noarch/meson-python-0.16.0-pyh0c530f3_0.conda#e16f0dbf502da873be9f9adb0dc52547
+https://conda.anaconda.org/conda-forge/linux-64/mkl-2022.1.0-h84fe81f_915.tar.bz2#b9c8f925797a93dbff45e1626b025a6b
+https://conda.anaconda.org/conda-forge/linux-64/pyqt5-sip-12.12.2-py312h30efb56_5.conda#8a2a122dc4fe14d8cff38f1cf426381f
+https://conda.anaconda.org/conda-forge/noarch/pytest-cov-5.0.0-pyhd8ed1ab_0.conda#c54c0107057d67ddf077751339ec2c63
+https://conda.anaconda.org/conda-forge/noarch/pytest-xdist-3.6.1-pyhd8ed1ab_0.conda#b39568655c127a9c4a44d178ac99b6d0
+https://conda.anaconda.org/conda-forge/noarch/sympy-1.12.1-pypyh2585a3b_103.conda#4af9db19148140eb2ff3b2a93697063b
+https://conda.anaconda.org/conda-forge/linux-64/aws-crt-cpp-0.26.12-h8bc9c4d_0.conda#ec9824a9e18425707af48d21820970f1
+https://conda.anaconda.org/conda-forge/linux-64/azure-storage-blobs-cpp-12.11.0-ha67cba7_1.conda#f03bba57b85a5b3ac443a871787fc429
+https://conda.anaconda.org/conda-forge/linux-64/gst-plugins-base-1.24.5-hbaaba92_0.conda#4a485842570569ba754863b2c083b346
+https://conda.anaconda.org/conda-forge/linux-64/libblas-3.9.0-16_linux64_mkl.tar.bz2#85f61af03fd291dae33150ffe89dc09a
+https://conda.anaconda.org/conda-forge/linux-64/libgoogle-cloud-storage-2.25.0-h3d9a0c8_0.conda#5e3f7cfcfd74065847da8f8598ff81d3
+https://conda.anaconda.org/conda-forge/linux-64/libsystemd0-255-h3516f8a_1.conda#3366af27f0b593544a6cd453c7932ac5
+https://conda.anaconda.org/conda-forge/linux-64/mkl-devel-2022.1.0-ha770c72_916.tar.bz2#69ba49e445f87aea2cba343a71a35ca2
+https://conda.anaconda.org/conda-forge/linux-64/aws-sdk-cpp-1.11.329-hf74b5d1_5.conda#3d82493d6b434cc47fc9302f3cc11a09
+https://conda.anaconda.org/conda-forge/linux-64/azure-storage-files-datalake-cpp-12.10.0-h29b5301_1.conda#bb35c23b178fc17b9e4458766f91da7f
+https://conda.anaconda.org/conda-forge/linux-64/libcblas-3.9.0-16_linux64_mkl.tar.bz2#361bf757b95488de76c4f123805742d3
+https://conda.anaconda.org/conda-forge/linux-64/liblapack-3.9.0-16_linux64_mkl.tar.bz2#a2f166748917d6d6e4707841ca1f519e
+https://conda.anaconda.org/conda-forge/linux-64/pulseaudio-client-17.0-hb77b528_0.conda#07f45f1be1c25345faddb8db0de8039b
+https://conda.anaconda.org/conda-forge/linux-64/libarrow-16.1.0-h4a673ee_10_cpu.conda#c737ba625b762cc4cbe7c68d27e8d2e1
+https://conda.anaconda.org/conda-forge/linux-64/liblapacke-3.9.0-16_linux64_mkl.tar.bz2#44ccc4d4dca6a8d57fa17442bc64b5a1
+https://conda.anaconda.org/conda-forge/linux-64/numpy-1.26.4-py312heda63a1_0.conda#d8285bea2a350f63fab23bf460221f3f
+https://conda.anaconda.org/conda-forge/linux-64/qt-main-5.15.8-ha2b5568_22.conda#15de976572f24032540236006d6d0e9f
+https://conda.anaconda.org/conda-forge/noarch/array-api-strict-1.1.1-pyhd8ed1ab_0.conda#941bbcd64d1a7b44aeb497f468fc85b4
+https://conda.anaconda.org/conda-forge/linux-64/blas-devel-3.9.0-16_linux64_mkl.tar.bz2#3f92c1c9e1c0e183462c5071aa02cae1
+https://conda.anaconda.org/conda-forge/linux-64/contourpy-1.2.1-py312h8572e83_0.conda#12c6a831ef734f0b2dd4caff514cbb7f
+https://conda.anaconda.org/conda-forge/linux-64/cupy-core-13.2.0-py312hd074ebb_0.conda#75e3cec7a83b84e6955b908b9cd97cb6
+https://conda.anaconda.org/conda-forge/linux-64/libarrow-acero-16.1.0-hac33072_10_cpu.conda#1283e2eecd89d1e06c33d004451a4a9e
+https://conda.anaconda.org/conda-forge/linux-64/libparquet-16.1.0-h6a7eafb_10_cpu.conda#a65776bbdae47c8b725f77dbed54c5d2
+https://conda.anaconda.org/conda-forge/linux-64/pandas-2.2.2-py312h1d6d2e6_1.conda#ae00b61f3000d2284d1f2584d4dfafa8
+https://conda.anaconda.org/conda-forge/linux-64/polars-0.20.31-py312hc7f843c_0.conda#c37ecb115967f1056ec360708913fdf1
+https://conda.anaconda.org/conda-forge/linux-64/pyarrow-core-16.1.0-py312h70856f0_3_cpu.conda#7f93c5a99083e2a26a301db64f44acb8
+https://conda.anaconda.org/conda-forge/linux-64/pyqt-5.15.9-py312h949fe66_5.conda#f6548a564e2d01b2a42020259503945b
+https://conda.anaconda.org/conda-forge/linux-64/scipy-1.13.1-py312hc2bc53b_0.conda#864b2399a9c998e17d1a9a4e0c601285
+https://conda.anaconda.org/conda-forge/linux-64/blas-2.116-mkl.tar.bz2#c196a26abf6b4f132c88828ab7c2231c
+https://conda.anaconda.org/conda-forge/linux-64/cupy-13.2.0-py312had87585_0.conda#ce0020d5af7542d12dc022b34613dad3
+https://conda.anaconda.org/conda-forge/linux-64/libarrow-dataset-16.1.0-hac33072_10_cpu.conda#49d2f8911e30844309aaf1fe221f0d66
+https://conda.anaconda.org/conda-forge/linux-64/matplotlib-base-3.8.4-py312h20ab3a6_2.conda#fbfe798f83f0d66410903ad8f40d5283
+https://conda.anaconda.org/conda-forge/linux-64/pyamg-5.1.0-py312h389efb2_1.conda#323587ece55d7578e88b37fb43e91ac6
+https://conda.anaconda.org/conda-forge/linux-64/libarrow-substrait-16.1.0-h7e0c224_10_cpu.conda#d3aa33ea25ffdc1147134b202c84158d
+https://conda.anaconda.org/conda-forge/linux-64/matplotlib-3.8.4-py312h7900ff3_2.conda#ac26198045dff11c94202bb3e1bdc132
+https://conda.anaconda.org/pytorch/linux-64/pytorch-2.3.1-py3.12_cuda12.1_cudnn8.9.2_0.tar.bz2#8806dd010a45f7eb4af40a24ff99de47
+https://conda.anaconda.org/conda-forge/linux-64/pyarrow-16.1.0-py312h9cebb41_3.conda#185d19647c3f7ddbdad8331911042763
diff --git a/build_tools/azure/pypy3_environment.yml b/build_tools/github/pylatest_conda_forge_cuda_array-api_linux-64_environment.yml
similarity index 63%
rename from build_tools/azure/pypy3_environment.yml
rename to build_tools/github/pylatest_conda_forge_cuda_array-api_linux-64_environment.yml
index 285f1b0d51d17..e2ffb1429aa1d 100644
--- a/build_tools/azure/pypy3_environment.yml
+++ b/build_tools/github/pylatest_conda_forge_cuda_array-api_linux-64_environment.yml
@@ -3,20 +3,32 @@
 # build_tools/update_environments_and_lock_files.py
 channels:
   - conda-forge
+  - pytorch
+  - nvidia
 dependencies:
-  - pypy
-  - python=3.9
+  - python
   - numpy
-  - blas[build=openblas]
+  - blas
   - scipy
   - cython
   - joblib
   - threadpoolctl
   - matplotlib
+  - pandas
   - pyamg
-  - pytest<8
+  - pytest
   - pytest-xdist
+  - pillow
   - pip
   - ninja
   - meson-python
+  - pytest-cov
+  - coverage
   - ccache
+  - pytorch::pytorch
+  - pytorch-cuda
+  - polars
+  - pyarrow
+  - cupy
+  - array-api-compat
+  - array-api-strict
diff --git a/build_tools/github/repair_windows_wheels.sh b/build_tools/github/repair_windows_wheels.sh
index cdd0c0c79d8c4..8f51a34d4039b 100755
--- a/build_tools/github/repair_windows_wheels.sh
+++ b/build_tools/github/repair_windows_wheels.sh
@@ -8,6 +8,7 @@ DEST_DIR=$2
 
 # By default, the Windows wheels are not repaired.
 # In this case, we need to vendor VCRUNTIME140.dll
+pip install wheel
 wheel unpack "$WHEEL"
 WHEEL_DIRNAME=$(ls -d scikit_learn-*)
 python build_tools/github/vendor.py "$WHEEL_DIRNAME"
diff --git a/build_tools/github/upload_anaconda.sh b/build_tools/github/upload_anaconda.sh
index 5054b32a53c61..42e06f17c5c47 100755
--- a/build_tools/github/upload_anaconda.sh
+++ b/build_tools/github/upload_anaconda.sh
@@ -4,7 +4,9 @@ set -e
 set -x
 
 # Note: build_wheels.sh has the same branch (only for NumPy 2.0 transition)
-if [[ "$GITHUB_EVENT_NAME" == "schedule" || "$CIRRUS_CRON" == "nightly" ]]; then
+if [[ "$GITHUB_EVENT_NAME" == "schedule" \
+        || "$GITHUB_EVENT_NAME" == "workflow_dispatch" \
+        || "$CIRRUS_CRON" == "nightly" ]]; then
     ANACONDA_ORG="scientific-python-nightly-wheels"
     ANACONDA_TOKEN="$SCIKIT_LEARN_NIGHTLY_UPLOAD_TOKEN"
 else
diff --git a/build_tools/linting.sh b/build_tools/linting.sh
index 58fef42b4dc45..aefabfae7b3f5 100755
--- a/build_tools/linting.sh
+++ b/build_tools/linting.sh
@@ -89,7 +89,7 @@ else
 fi
 
 # Check for joblib.delayed and joblib.Parallel imports
-
+# TODO(1.7): remove ":!sklearn/utils/_joblib.py"
 echo -e "### Checking for joblib imports ###\n"
 joblib_status=0
 joblib_delayed_import="$(git grep -l -A 10 -E "joblib import.+delayed" -- "*.py" ":!sklearn/utils/_joblib.py" ":!sklearn/utils/parallel.py")"
diff --git a/build_tools/shared.sh b/build_tools/shared.sh
index 4866c149d506f..cb5242239d7cf 100644
--- a/build_tools/shared.sh
+++ b/build_tools/shared.sh
@@ -29,7 +29,23 @@ show_installed_libraries(){
 activate_environment() {
     if [[ "$DISTRIB" =~ ^conda.* ]]; then
         source activate $VIRTUALENV
-    elif [[ "$DISTRIB" == "ubuntu" || "$DISTRIB" == "debian-32" || "$DISTRIB" == "pip-nogil" ]]; then
+    elif [[ "$DISTRIB" == "ubuntu" || "$DISTRIB" == "debian-32" || "$DISTRIB" == "pip-free-threaded" ]]; then
         source $VIRTUALENV/bin/activate
     fi
 }
+
+create_conda_environment_from_lock_file() {
+    ENV_NAME=$1
+    LOCK_FILE=$2
+    # Because we are using lock-files with the "explicit" format, conda can
+    # install them directly, provided the lock-file does not contain pip solved
+    # packages. For more details, see
+    # https://conda.github.io/conda-lock/output/#explicit-lockfile
+    lock_file_has_pip_packages=$(grep -q files.pythonhosted.org $LOCK_FILE && echo "true" || echo "false")
+    if [[ "$lock_file_has_pip_packages" == "false" ]]; then
+        conda create --name $ENV_NAME --file $LOCK_FILE
+    else
+        conda install "$(get_dep conda-lock min)" -y
+        conda-lock install --name $ENV_NAME $LOCK_FILE
+    fi
+}
diff --git a/build_tools/update_environments_and_lock_files.py b/build_tools/update_environments_and_lock_files.py
index fd77cfd3c0721..68a593f65e495 100644
--- a/build_tools/update_environments_and_lock_files.py
+++ b/build_tools/update_environments_and_lock_files.py
@@ -82,12 +82,7 @@
 
 docstring_test_dependencies = ["sphinx", "numpydoc"]
 
-default_package_constraints = {
-    # TODO: somehow pytest 8 does not seem to work with meson editable
-    # install. Exit code is 5, i.e. no test collected
-    # This would be fixed by https://github.com/mesonbuild/meson-python/pull/569
-    "pytest": "<8",
-}
+default_package_constraints = {}
 
 
 def remove_from(alist, to_remove):
@@ -95,13 +90,33 @@ def remove_from(alist, to_remove):
 
 
 build_metadata_list = [
+    {
+        "name": "pylatest_conda_forge_cuda_array-api_linux-64",
+        "type": "conda",
+        "tag": "cuda",
+        "folder": "build_tools/github",
+        "platform": "linux-64",
+        "channels": ["conda-forge", "pytorch", "nvidia"],
+        "conda_dependencies": common_dependencies
+        + [
+            "ccache",
+            # Make sure pytorch comes from the pytorch channel and not conda-forge
+            "pytorch::pytorch",
+            "pytorch-cuda",
+            "polars",
+            "pyarrow",
+            "cupy",
+            "array-api-compat",
+            "array-api-strict",
+        ],
+    },
     {
         "name": "pylatest_conda_forge_mkl_linux-64",
         "type": "conda",
         "tag": "main-ci",
         "folder": "build_tools/azure",
         "platform": "linux-64",
-        "channel": "conda-forge",
+        "channels": ["conda-forge"],
         "conda_dependencies": common_dependencies
         + [
             "ccache",
@@ -114,7 +129,6 @@ def remove_from(alist, to_remove):
         ],
         "package_constraints": {
             "blas": "[build=mkl]",
-            "pytorch": "1.13",
         },
     },
     {
@@ -123,7 +137,7 @@ def remove_from(alist, to_remove):
         "tag": "main-ci",
         "folder": "build_tools/azure",
         "platform": "osx-64",
-        "channel": "conda-forge",
+        "channels": ["conda-forge"],
         "conda_dependencies": common_dependencies
         + [
             "ccache",
@@ -140,8 +154,11 @@ def remove_from(alist, to_remove):
         "tag": "main-ci",
         "folder": "build_tools/azure",
         "platform": "osx-64",
-        "channel": "defaults",
-        "conda_dependencies": remove_from(common_dependencies, ["cython"]) + ["ccache"],
+        "channels": ["defaults"],
+        "conda_dependencies": remove_from(
+            common_dependencies, ["cython", "threadpoolctl", "meson-python"]
+        )
+        + ["ccache"],
         "package_constraints": {
             "blas": "[build=mkl]",
             # scipy 1.12.x crashes on this platform (https://github.com/scipy/scipy/pull/20086)
@@ -149,9 +166,9 @@ def remove_from(alist, to_remove):
             # channel.
             "scipy": "<1.12",
         },
-        # TODO: put cython back to conda dependencies when required version is
-        # available on the main channel
-        "pip_dependencies": ["cython"],
+        # TODO: put cython, threadpoolctl and meson-python back to conda
+        # dependencies when required version is available on the main channel
+        "pip_dependencies": ["cython", "threadpoolctl", "meson-python"],
     },
     {
         "name": "pymin_conda_defaults_openblas",
@@ -159,9 +176,10 @@ def remove_from(alist, to_remove):
         "tag": "main-ci",
         "folder": "build_tools/azure",
         "platform": "linux-64",
-        "channel": "defaults",
+        "channels": ["defaults"],
         "conda_dependencies": remove_from(
-            common_dependencies, ["pandas", "cython", "pip", "ninja", "meson-python"]
+            common_dependencies,
+            ["pandas", "threadpoolctl", "pip", "meson-python"],
         )
         + ["ccache"],
         "package_constraints": {
@@ -170,12 +188,14 @@ def remove_from(alist, to_remove):
             "numpy": "1.21",  # the min version is not available on the defaults channel
             "scipy": "1.7",  # the min version has some low level crashes
             "matplotlib": "min",
-            "threadpoolctl": "2.2.0",
             "cython": "min",
+            "joblib": "min",
+            "threadpoolctl": "min",
+            "meson-python": "min",
         },
-        # TODO: put cython back to conda dependencies when required version is
-        # available on the main channel
-        "pip_dependencies": ["cython"],
+        # TODO: put pip dependencies back to conda dependencies when required
+        # version is available on the defaults channel.
+        "pip_dependencies": ["threadpoolctl", "meson-python"],
     },
     {
         "name": "pymin_conda_forge_openblas_ubuntu_2204",
@@ -183,7 +203,7 @@ def remove_from(alist, to_remove):
         "tag": "main-ci",
         "folder": "build_tools/azure",
         "platform": "linux-64",
-        "channel": "conda-forge",
+        "channels": ["conda-forge"],
         "conda_dependencies": (
             common_dependencies_without_coverage
             + docstring_test_dependencies
@@ -200,15 +220,21 @@ def remove_from(alist, to_remove):
         "tag": "main-ci",
         "folder": "build_tools/azure",
         "platform": "linux-64",
-        "channel": "defaults",
+        "channels": ["defaults"],
         "conda_dependencies": ["python", "ccache"],
         "pip_dependencies": (
             remove_from(common_dependencies, ["python", "blas", "pip"])
             + docstring_test_dependencies
+            # Test with some optional dependencies
             + ["lightgbm", "scikit-image"]
+            # Test array API on CPU without PyTorch
+            + ["array-api-compat", "array-api-strict"]
         ),
         "package_constraints": {
-            "python": "3.9",
+            # XXX: we would like to use the latest Python version, but for now using
+            # Python 3.12 makes the CI much slower so we use Python 3.11. See
+            # https://github.com/scikit-learn/scikit-learn/pull/29444#issuecomment-2219550662.
+            "python": "3.11",
         },
     },
     {
@@ -217,7 +243,7 @@ def remove_from(alist, to_remove):
         "tag": "scipy-dev",
         "folder": "build_tools/azure",
         "platform": "linux-64",
-        "channel": "defaults",
+        "channels": ["defaults"],
         "conda_dependencies": ["python", "ccache"],
         "pip_dependencies": (
             remove_from(
@@ -245,32 +271,13 @@ def remove_from(alist, to_remove):
             + ["python-dateutil"]
         ),
     },
-    {
-        "name": "pypy3",
-        "type": "conda",
-        "tag": "pypy",
-        "folder": "build_tools/azure",
-        "platform": "linux-64",
-        "channel": "conda-forge",
-        "conda_dependencies": (
-            ["pypy", "python"]
-            + remove_from(
-                common_dependencies_without_coverage, ["python", "pandas", "pillow"]
-            )
-            + ["ccache"]
-        ),
-        "package_constraints": {
-            "blas": "[build=openblas]",
-            "python": "3.9",
-        },
-    },
     {
         "name": "pymin_conda_forge_mkl",
         "type": "conda",
         "tag": "main-ci",
         "folder": "build_tools/azure",
         "platform": "win-64",
-        "channel": "conda-forge",
+        "channels": ["conda-forge"],
         "conda_dependencies": remove_from(common_dependencies, ["pandas", "pyamg"])
         + [
             "wheel",
@@ -287,7 +294,7 @@ def remove_from(alist, to_remove):
         "tag": "main-ci",
         "folder": "build_tools/circle",
         "platform": "linux-64",
-        "channel": "conda-forge",
+        "channels": ["conda-forge"],
         "conda_dependencies": common_dependencies_without_coverage
         + [
             "scikit-image",
@@ -302,8 +309,14 @@ def remove_from(alist, to_remove):
             "plotly",
             "polars",
             "pooch",
+            "sphinx-remove-toctrees",
+            "sphinx-design",
+            "pydata-sphinx-theme",
+        ],
+        "pip_dependencies": [
+            "sphinxext-opengraph",
+            "sphinxcontrib-sass",
         ],
-        "pip_dependencies": ["sphinxext-opengraph"],
         "package_constraints": {
             "python": "3.9",
             "numpy": "min",
@@ -320,6 +333,11 @@ def remove_from(alist, to_remove):
             "sphinxext-opengraph": "min",
             "plotly": "min",
             "polars": "min",
+            "pooch": "min",
+            "sphinx-design": "min",
+            "sphinxcontrib-sass": "min",
+            "sphinx-remove-toctrees": "min",
+            "pydata-sphinx-theme": "min",
         },
     },
     {
@@ -328,7 +346,7 @@ def remove_from(alist, to_remove):
         "tag": "main-ci",
         "folder": "build_tools/circle",
         "platform": "linux-64",
-        "channel": "conda-forge",
+        "channels": ["conda-forge"],
         "conda_dependencies": common_dependencies_without_coverage
         + [
             "scikit-image",
@@ -344,10 +362,24 @@ def remove_from(alist, to_remove):
             "polars",
             "pooch",
             "sphinxext-opengraph",
+            "sphinx-remove-toctrees",
+            "sphinx-design",
+            "pydata-sphinx-theme",
+        ],
+        "pip_dependencies": [
+            "jupyterlite-sphinx",
+            "jupyterlite-pyodide-kernel",
+            "sphinxcontrib-sass",
         ],
-        "pip_dependencies": ["jupyterlite-sphinx", "jupyterlite-pyodide-kernel"],
         "package_constraints": {
             "python": "3.9",
+            # TODO: this needs to be adapted when matplotlib 3.11 is out. In
+            # the meantime, this avoids a warning in matplotlib 3.9 boxplot
+            # labels has been renamed to tick_labels. Possible options:
+            # - bump minimum matplotlib supported versions to 3.9 at one point
+            # - complicate the example code to do the right thing depending on
+            #   maplotlib version
+            "matplotlib": "<3.9",
         },
     },
     {
@@ -356,7 +388,7 @@ def remove_from(alist, to_remove):
         "tag": "arm",
         "folder": "build_tools/cirrus",
         "platform": "linux-aarch64",
-        "channel": "conda-forge",
+        "channels": ["conda-forge"],
         "conda_dependencies": remove_from(
             common_dependencies_without_coverage, ["pandas", "pyamg"]
         )
@@ -381,7 +413,7 @@ def remove_from(alist, to_remove):
         ],
         "package_constraints": {
             "joblib": "min",
-            "threadpoolctl": "2.2.0",
+            "threadpoolctl": "3.1.0",
             "pytest": "min",
             "pytest-cov": "min",
             # no pytest-xdist because it causes issue on 32bit
@@ -421,7 +453,7 @@ def execute_command(command_list):
     )
 
     out, err = proc.communicate()
-    out, err = out.decode(), err.decode()
+    out, err = out.decode(errors="replace"), err.decode(errors="replace")
 
     if proc.returncode != 0:
         command_str = " ".join(command_list)
@@ -473,7 +505,9 @@ def get_conda_environment_content(build_metadata):
 # following script to centralize the configuration for CI builds:
 # build_tools/update_environments_and_lock_files.py
 channels:
-  - {{ build_metadata['channel'] }}
+  {% for channel in build_metadata['channels'] %}
+  - {{ channel }}
+  {% endfor %}
 dependencies:
   {% for conda_dep in build_metadata['conda_dependencies'] %}
   - {{ conda_dep | get_package_with_constraint(build_metadata) }}
@@ -721,6 +755,7 @@ def main(select_build, skip_build, select_tag, verbose, very_verbose):
     filtered_conda_build_metadata_list = [
         each for each in filtered_build_metadata_list if each["type"] == "conda"
     ]
+
     if filtered_conda_build_metadata_list:
         logger.info("# Writing conda environments")
         write_all_conda_environments(filtered_conda_build_metadata_list)
diff --git a/build_tools/wheels/build_wheels.sh b/build_tools/wheels/build_wheels.sh
index d2df4e3936829..d4c76d7cf28a3 100755
--- a/build_tools/wheels/build_wheels.sh
+++ b/build_tools/wheels/build_wheels.sh
@@ -50,7 +50,9 @@ if [[ $(uname) == "Darwin" ]]; then
 fi
 
 
-if [[ "$GITHUB_EVENT_NAME" == "schedule" || "$CIRRUS_CRON" == "nightly" ]]; then
+if [[ "$GITHUB_EVENT_NAME" == "schedule" \
+        || "$GITHUB_EVENT_NAME" == "workflow_dispatch" \
+        || "$CIRRUS_CRON" == "nightly" ]]; then
     # Nightly build:  See also `../github/upload_anaconda.sh` (same branching).
     # To help with NumPy 2.0 transition, ensure that we use the NumPy 2.0
     # nightlies.  This lives on the edge and opts-in to all pre-releases.
@@ -59,6 +61,13 @@ if [[ "$GITHUB_EVENT_NAME" == "schedule" || "$CIRRUS_CRON" == "nightly" ]]; then
     export CIBW_BUILD_FRONTEND='pip; args: --pre --extra-index-url "https://pypi.anaconda.org/scientific-python-nightly-wheels/simple"'
 fi
 
+if [[ "$CIBW_FREE_THREADED_SUPPORT" =~ [tT]rue ]]; then
+    # Numpy, scipy, Cython only have free-threaded wheels on scientific-python-nightly-wheels
+    # TODO: remove this after CPython 3.13 is released (scheduled October 2024)
+    # and our dependencies have free-threaded wheels on PyPI
+    export CIBW_BUILD_FRONTEND='pip; args: --pre --extra-index-url "https://pypi.anaconda.org/scientific-python-nightly-wheels/simple"'
+fi
+
 # The version of the built dependencies are specified
 # in the pyproject.toml file, while the tests are run
 # against the most recent version of the dependencies
diff --git a/build_tools/wheels/cibw_before_test.sh b/build_tools/wheels/cibw_before_test.sh
new file mode 100755
index 0000000000000..b2a0a82428702
--- /dev/null
+++ b/build_tools/wheels/cibw_before_test.sh
@@ -0,0 +1,15 @@
+#!/bin/bash
+
+set -e
+set -x
+
+FREE_THREADED_BUILD="$(python -c"import sysconfig; print(bool(sysconfig.get_config_var('Py_GIL_DISABLED')))")"
+if [[ $FREE_THREADED_BUILD == "True" ]]; then
+    # TODO: remove when numpy and scipy have releases with free-threaded wheels
+    python -m pip install --pre --extra-index https://pypi.anaconda.org/scientific-python-nightly-wheels/simple numpy scipy
+else
+    # There is no pandas free-threaded wheel at the time of writing, so we only
+    # install pandas in other builds
+    # TODO: adapt when there is a pandas free-threaded wheel
+    python -m pip install pandas
+fi
diff --git a/build_tools/wheels/test_wheels.sh b/build_tools/wheels/test_wheels.sh
index e8cdf4b3ea8a2..da2c458c52903 100755
--- a/build_tools/wheels/test_wheels.sh
+++ b/build_tools/wheels/test_wheels.sh
@@ -6,6 +6,14 @@ set -x
 python -c "import joblib; print(f'Number of cores (physical): \
 {joblib.cpu_count()} ({joblib.cpu_count(only_physical_cores=True)})')"
 
+FREE_THREADED_BUILD="$(python -c"import sysconfig; print(bool(sysconfig.get_config_var('Py_GIL_DISABLED')))")"
+if [[ $FREE_THREADED_BUILD == "True" ]]; then
+    # TODO: delete when importing numpy no longer enables the GIL
+    # setting to zero ensures the GIL is disabled while running the
+    # tests under free-threaded python
+    export PYTHON_GIL=0
+fi
+
 # Test that there are no links to system libraries in the
 # threadpoolctl output section of the show_versions output:
 python -c "import sklearn; sklearn.show_versions()"
diff --git a/doc/Makefile b/doc/Makefile
index 44f02585f6205..f84d3c78b8051 100644
--- a/doc/Makefile
+++ b/doc/Makefile
@@ -47,9 +47,17 @@ help:
 
 clean:
 	-rm -rf $(BUILDDIR)/*
+	@echo "Removed $(BUILDDIR)/*"
 	-rm -rf auto_examples/
+	@echo "Removed auto_examples/"
 	-rm -rf generated/*
+	@echo "Removed generated/"
 	-rm -rf modules/generated/
+	@echo "Removed modules/generated/"
+	-rm -rf css/styles/
+	@echo "Removed css/styles/"
+	-rm -rf api/*.rst
+	@echo "Removed api/*.rst"
 
 # Default to SPHINX_NUMJOBS=1 for full documentation build. Using
 # SPHINX_NUMJOBS!=1 may actually slow down the build, or cause weird issues in
diff --git a/doc/about.rst b/doc/about.rst
index 2a689646c1abb..7d2039fb890be 100644
--- a/doc/about.rst
+++ b/doc/about.rst
@@ -13,8 +13,10 @@ this project as part of his thesis.
 In 2010 Fabian Pedregosa, Gael Varoquaux, Alexandre Gramfort and Vincent
 Michel of INRIA took leadership of the project and made the first public
 release, February the 1st 2010. Since then, several releases have appeared
-following a ~ 3-month cycle, and a thriving international community has
-been leading the development.
+following an approximately 3-month cycle, and a thriving international
+community has been leading the development. As a result, INRIA holds the
+copyright over the work done by people who were employed by INRIA at the
+time of the contribution.
 
 Governance
 ----------
@@ -22,32 +24,48 @@ Governance
 The decision making process and governance structure of scikit-learn is laid
 out in the :ref:`governance document <governance>`.
 
-Authors
--------
+.. The "author" anchors below is there to ensure that old html links (in
+   the form of "about.html#author" still work)
+
+.. _authors:
+
+The people behind scikit-learn
+------------------------------
+
+Scikit-learn is a community project, developed by a large group of
+people, all across the world. A few teams, listed below, have central
+roles, however a more complete list of contributors can be found `on
+github
+<https://github.com/scikit-learn/scikit-learn/graphs/contributors>`__.
 
-The following people are currently core contributors to scikit-learn's development
-and maintenance:
+Maintainers Team
+................
 
-.. include:: authors.rst
+The following people are currently maintainers, in charge of
+consolidating scikit-learn's development and maintenance:
 
-Please do not email the authors directly to ask for assistance or report issues.
-Instead, please see `What's the best way to ask questions about scikit-learn
-<https://scikit-learn.org/stable/faq.html#what-s-the-best-way-to-get-help-on-scikit-learn-usage>`_
-in the FAQ.
+.. include:: maintainers.rst
+
+.. note::
+
+  Please do not email the authors directly to ask for assistance or report issues.
+  Instead, please see `What's the best way to ask questions about scikit-learn
+  <https://scikit-learn.org/stable/faq.html#what-s-the-best-way-to-get-help-on-scikit-learn-usage>`_
+  in the FAQ.
 
 .. seealso::
 
-   :ref:`How you can contribute to the project <contributing>`
+  How you can :ref:`contribute to the project <contributing>`.
 
 Documentation Team
-------------------
+..................
 
 The following people help with documenting the project:
 
 .. include:: documentation_team.rst
 
 Contributor Experience Team
----------------------------
+...........................
 
 The following people are active contributors who also help with
 :ref:`triaging issues <bug_triaging>`, PRs, and general
@@ -56,24 +74,23 @@ maintenance:
 .. include:: contributor_experience_team.rst
 
 Communication Team
-------------------
+..................
 
 The following people help with :ref:`communication around scikit-learn
 <communication_team>`.
 
 .. include:: communication_team.rst
 
-
 Emeritus Core Developers
-------------------------
+........................
 
 The following people have been active contributors in the past, but are no
 longer active in the project:
 
-.. include:: authors_emeritus.rst
+.. include:: maintainers_emeritus.rst
 
 Emeritus Communication Team
----------------------------
+...........................
 
 The following people have been active in the communication team in the
 past, but no longer have communication responsibilities:
@@ -81,7 +98,7 @@ past, but no longer have communication responsibilities:
 .. include:: communication_team_emeritus.rst
 
 Emeritus Contributor Experience Team
-------------------------------------
+....................................
 
 The following people have been active in the contributor experience team in the
 past:
@@ -143,462 +160,303 @@ High quality PNG and SVG logos are available in the `doc/logos/
 source directory.
 
 .. image:: images/scikit-learn-logo-notext.png
-   :align: center
+  :align: center
 
 Funding
 -------
-Scikit-Learn is a community driven project, however institutional and private
+
+Scikit-learn is a community driven project, however institutional and private
 grants help to assure its sustainability.
 
 The project would like to thank the following funders.
 
 ...................................
 
+.. div:: sk-text-image-grid-small
 
-.. raw:: html
-
-   <div class="sk-sponsor-div">
-   <div class="sk-sponsor-div-box">
-
-`:probabl. <https://probabl.ai>`_ funds Adrin Jalali, Arturo Amor,
-François Goupil, Guillaume Lemaitre, Jérémie du Boisberranger, Olivier Grisel, and
-Stefanie Senger.
+  .. div:: text-box
 
-.. raw:: html
-
-   </div>
+    `:probabl. <https://probabl.ai>`_ employs Adrin Jalali, Arturo Amor,
+    François Goupil, Guillaume Lemaitre, Jérémie du Boisberranger, Loïc Estève,
+    Olivier Grisel, and Stefanie Senger.
 
-   <div class="sk-sponsor-div-box">
+  .. div:: image-box
 
-.. image:: images/probabl.png
-   :width: 75pt
-   :align: center
-   :target: https://probabl.ai
-
-.. raw:: html
-
-   </div>
-   </div>
+    .. image:: images/probabl.png
+      :target: https://probabl.ai
 
 ..........
 
-.. raw:: html
-
-   <div class="sk-sponsor-div">
-   <div class="sk-sponsor-div-box">
-
-The `Members <https://scikit-learn.fondation-inria.fr/en/home/#sponsors>`_ of
-the `Scikit-Learn Consortium at Inria Foundation
-<https://scikit-learn.fondation-inria.fr/en/home/>`_ help at maintaining and
-improving the project through their financial support.
-
-.. raw:: html
-
-   </div>
-
 .. |chanel| image:: images/chanel.png
-   :width: 55pt
-   :target: https://www.chanel.com
+  :target: https://www.chanel.com
 
 .. |axa| image:: images/axa.png
-   :width: 40pt
-   :target: https://www.axa.fr/
+  :target: https://www.axa.fr/
 
 .. |bnp| image:: images/bnp.png
-   :width: 120pt
-   :target: https://www.bnpparibascardif.com/
+  :target: https://www.bnpparibascardif.com/
 
 .. |dataiku| image:: images/dataiku.png
-   :width: 55pt
-   :target: https://www.dataiku.com/
-
-.. |hf| image:: images/huggingface_logo-noborder.png
-   :width: 55pt
-   :target: https://huggingface.co
+  :target: https://www.dataiku.com/
 
 .. |nvidia| image:: images/nvidia.png
-   :width: 55pt
-   :target: https://www.nvidia.com
+  :target: https://www.nvidia.com
 
 .. |inria| image:: images/inria-logo.jpg
-   :width: 75pt
-   :target: https://www.inria.fr
-
+  :target: https://www.inria.fr
 
 .. raw:: html
 
-   <div class="sk-sponsor-div-box">
-
-.. table::
-   :class: sk-sponsor-table
-
-   +----------+-----------+
-   |       |chanel|       |
-   +----------+-----------+
-   |                      |
-   +----------+-----------+
-   |  |axa|   |    |bnp|  |
-   +----------+-----------+
-   |                      |
-   +----------+-----------+
-   | |nvidia| |    |hf|   |
-   +----------+-----------+
-   |                      |
-   +----------+-----------+
-   |       |dataiku|      |
-   +----------+-----------+
-   |                      |
-   +----------+-----------+
-   |        |inria|       |
-   +----------+-----------+
+  <style>
+    table.image-subtable tr {
+      border-color: transparent;
+    }
 
-.. raw:: html
-
-   </div>
-   </div>
-
-..........
+    table.image-subtable td {
+      width: 50%;
+      vertical-align: middle;
+      text-align: center;
+    }
 
-.. raw:: html
+    table.image-subtable td img {
+      max-height: 40px !important;
+      max-width: 90% !important;
+    }
+  </style>
 
-   <div class="sk-sponsor-div">
-   <div class="sk-sponsor-div-box">
+.. div:: sk-text-image-grid-small
 
-`NVidia <https://nvidia.com>`_ funds Tim Head since 2022
-and is part of the scikit-learn consortium at Inria.
+  .. div:: text-box
 
-.. raw:: html
+    The `Members <https://scikit-learn.fondation-inria.fr/en/home/#sponsors>`_ of
+    the `Scikit-learn Consortium at Inria Foundation
+    <https://scikit-learn.fondation-inria.fr/en/home/>`_ help at maintaining and
+    improving the project through their financial support.
 
-   </div>
+  .. div:: image-box
 
-   <div class="sk-sponsor-div-box">
+    .. table::
+      :class: image-subtable
 
-.. image:: images/nvidia.png
-   :width: 55pt
-   :align: center
-   :target: https://nvidia.com
+      +----------+-----------+
+      |       |chanel|       |
+      +----------+-----------+
+      |  |axa|   |    |bnp|  |
+      +----------+-----------+
+      |       |nvidia|       |
+      +----------+-----------+
+      |       |dataiku|      |
+      +----------+-----------+
+      |        |inria|       |
+      +----------+-----------+
 
-.. raw:: html
+..........
 
-   </div>
-   </div>
+.. div:: sk-text-image-grid-small
 
-..........
+  .. div:: text-box
 
-.. raw:: html
+    `NVidia <https://nvidia.com>`_ funds Tim Head since 2022
+    and is part of the scikit-learn consortium at Inria.
 
-   <div class="sk-sponsor-div">
-   <div class="sk-sponsor-div-box">
+  .. div:: image-box
 
-`Microsoft <https://microsoft.com/>`_ funds Andreas Müller since 2020.
+    .. image:: images/nvidia.png
+      :target: https://nvidia.com
 
-.. raw:: html
+..........
 
-   </div>
+.. div:: sk-text-image-grid-small
 
-   <div class="sk-sponsor-div-box">
+  .. div:: text-box
 
-.. image:: images/microsoft.png
-   :width: 100pt
-   :align: center
-   :target: https://www.microsoft.com/
+    `Microsoft <https://microsoft.com/>`_ funds Andreas Müller since 2020.
 
-.. raw:: html
+  .. div:: image-box
 
-   </div>
-   </div>
+    .. image:: images/microsoft.png
+      :target: https://microsoft.com
 
 ...........
 
-.. raw:: html
+.. div:: sk-text-image-grid-small
 
-   <div class="sk-sponsor-div">
-   <div class="sk-sponsor-div-box">
+  .. div:: text-box
 
-`Quansight Labs <https://labs.quansight.org>`_ funds Lucy Liu since 2022.
+    `Quansight Labs <https://labs.quansight.org>`_ funds Lucy Liu since 2022.
 
-.. raw:: html
+  .. div:: image-box
 
-   </div>
+    .. image:: images/quansight-labs.png
+      :target: https://labs.quansight.org
 
-   <div class="sk-sponsor-div-box">
+...........
 
-.. image:: images/quansight-labs.png
-   :width: 100pt
-   :align: center
-   :target: https://labs.quansight.org
+.. div:: sk-text-image-grid-small
 
-.. raw:: html
+  .. div:: text-box
 
-   </div>
-   </div>
+    `Tidelift <https://tidelift.com/>`_ supports the project via their service
+    agreement.
 
-Past Sponsors
-.............
+  .. div:: image-box
 
-.. raw:: html
+    .. image:: images/Tidelift-logo-on-light.svg
+      :target: https://tidelift.com/
 
-   <div class="sk-sponsor-div">
-   <div class="sk-sponsor-div-box">
+...........
 
-`Quansight Labs <https://labs.quansight.org>`_ funded Meekail Zain in 2022 and 2023 and,
-funded Thomas J. Fan from 2021 to 2023.
 
-.. raw:: html
+Past Sponsors
+.............
 
-   </div>
+.. div:: sk-text-image-grid-small
 
-   <div class="sk-sponsor-div-box">
+  .. div:: text-box
 
-.. image:: images/quansight-labs.png
-   :width: 100pt
-   :align: center
-   :target: https://labs.quansight.org
+    `Quansight Labs <https://labs.quansight.org>`_ funded Meekail Zain in 2022 and 2023,
+    and funded Thomas J. Fan from 2021 to 2023.
 
-.. raw:: html
+  .. div:: image-box
 
-   </div>
-   </div>
+    .. image:: images/quansight-labs.png
+      :target: https://labs.quansight.org
 
 ...........
 
-.. raw:: html
-
-   <div class="sk-sponsor-div">
-   <div class="sk-sponsor-div-box">
+.. div:: sk-text-image-grid-small
 
-`Columbia University <https://columbia.edu/>`_ funded Andreas Müller
-(2016-2020).
+  .. div:: text-box
 
-.. raw:: html
+    `Columbia University <https://columbia.edu/>`_ funded Andreas Müller
+    (2016-2020).
 
-   </div>
+  .. div:: image-box
 
-   <div class="sk-sponsor-div-box">
-
-.. image:: images/columbia.png
-   :width: 50pt
-   :align: center
-   :target: https://www.columbia.edu/
-
-.. raw:: html
-
-   </div>
-   </div>
+    .. image:: images/columbia.png
+      :target: https://columbia.edu
 
 ........
 
-.. raw:: html
-
-   <div class="sk-sponsor-div">
-   <div class="sk-sponsor-div-box">
-
-`The University of Sydney <https://sydney.edu.au/>`_ funded Joel Nothman
-(2017-2021).
+.. div:: sk-text-image-grid-small
 
-.. raw:: html
-
-   </div>
+  .. div:: text-box
 
-   <div class="sk-sponsor-div-box">
+    `The University of Sydney <https://sydney.edu.au/>`_ funded Joel Nothman
+    (2017-2021).
 
-.. image:: images/sydney-primary.jpeg
-   :width: 100pt
-   :align: center
-   :target: https://sydney.edu.au/
-
-.. raw:: html
+  .. div:: image-box
 
-   </div>
-   </div>
+    .. image:: images/sydney-primary.jpeg
+      :target: https://sydney.edu.au/
 
 ...........
 
-.. raw:: html
-
-   <div class="sk-sponsor-div">
-   <div class="sk-sponsor-div-box">
-
-Andreas Müller received a grant to improve scikit-learn from the
-`Alfred P. Sloan Foundation <https://sloan.org>`_ .
-This grant supported the position of Nicolas Hug and Thomas J. Fan.
-
-.. raw:: html
-
-   </div>
+.. div:: sk-text-image-grid-small
 
-   <div class="sk-sponsor-div-box">
+  .. div:: text-box
 
-.. image:: images/sloan_banner.png
-   :width: 100pt
-   :align: center
-   :target: https://sloan.org/
+    Andreas Müller received a grant to improve scikit-learn from the
+    `Alfred P. Sloan Foundation <https://sloan.org>`_ .
+    This grant supported the position of Nicolas Hug and Thomas J. Fan.
 
-.. raw:: html
+  .. div:: image-box
 
-   </div>
-   </div>
+    .. image:: images/sloan_banner.png
+      :target: https://sloan.org/
 
 .............
 
-.. raw:: html
-
-   <div class="sk-sponsor-div">
-   <div class="sk-sponsor-div-box">
-
-`INRIA <https://www.inria.fr>`_ actively supports this project. It has
-provided funding for Fabian Pedregosa (2010-2012), Jaques Grobler
-(2012-2013) and Olivier Grisel (2013-2017) to work on this project
-full-time. It also hosts coding sprints and other events.
+.. div:: sk-text-image-grid-small
 
-.. raw:: html
+  .. div:: text-box
 
-   </div>
+    `INRIA <https://www.inria.fr>`_ actively supports this project. It has
+    provided funding for Fabian Pedregosa (2010-2012), Jaques Grobler
+    (2012-2013) and Olivier Grisel (2013-2017) to work on this project
+    full-time. It also hosts coding sprints and other events.
 
-   <div class="sk-sponsor-div-box">
+  .. div:: image-box
 
-.. image:: images/inria-logo.jpg
-   :width: 100pt
-   :align: center
-   :target: https://www.inria.fr
-
-.. raw:: html
-
-   </div>
-   </div>
+    .. image:: images/inria-logo.jpg
+      :target: https://www.inria.fr
 
 .....................
 
-.. raw:: html
-
-   <div class="sk-sponsor-div">
-   <div class="sk-sponsor-div-box">
+.. div:: sk-text-image-grid-small
 
-`Paris-Saclay Center for Data Science
-<http://www.datascience-paris-saclay.fr/>`_
-funded one year for a developer to work on the project full-time
-(2014-2015), 50% of the time of Guillaume Lemaitre (2016-2017) and 50% of the
-time of Joris van den Bossche (2017-2018).
+  .. div:: text-box
 
-.. raw:: html
-
-   </div>
-   <div class="sk-sponsor-div-box">
+    `Paris-Saclay Center for Data Science <http://www.datascience-paris-saclay.fr/>`_
+    funded one year for a developer to work on the project full-time (2014-2015), 50%
+    of the time of Guillaume Lemaitre (2016-2017) and 50% of the time of Joris van den
+    Bossche (2017-2018).
 
-.. image:: images/cds-logo.png
-   :width: 100pt
-   :align: center
-   :target: http://www.datascience-paris-saclay.fr/
-
-.. raw:: html
+  .. div:: image-box
 
-   </div>
-   </div>
+    .. image:: images/cds-logo.png
+      :target: http://www.datascience-paris-saclay.fr/
 
 ..........................
 
-.. raw:: html
-
-   <div class="sk-sponsor-div">
-   <div class="sk-sponsor-div-box">
+.. div:: sk-text-image-grid-small
 
-`NYU Moore-Sloan Data Science Environment <https://cds.nyu.edu/mooresloan/>`_
-funded Andreas Mueller (2014-2016) to work on this project. The Moore-Sloan
-Data Science Environment also funds several students to work on the project
-part-time.
+  .. div:: text-box
 
-.. raw:: html
+    `NYU Moore-Sloan Data Science Environment <https://cds.nyu.edu/mooresloan/>`_
+    funded Andreas Mueller (2014-2016) to work on this project. The Moore-Sloan
+    Data Science Environment also funds several students to work on the project
+    part-time.
 
-   </div>
-   <div class="sk-sponsor-div-box">
+  .. div:: image-box
 
-.. image:: images/nyu_short_color.png
-   :width: 100pt
-   :align: center
-   :target: https://cds.nyu.edu/mooresloan/
-
-.. raw:: html
-
-   </div>
-   </div>
+    .. image:: images/nyu_short_color.png
+      :target: https://cds.nyu.edu/mooresloan/
 
 ........................
 
-.. raw:: html
-
-   <div class="sk-sponsor-div">
-   <div class="sk-sponsor-div-box">
-
-`Télécom Paristech <https://www.telecom-paristech.fr/>`_ funded Manoj Kumar
-(2014), Tom Dupré la Tour (2015), Raghav RV (2015-2017), Thierry Guillemot
-(2016-2017) and Albert Thomas (2017) to work on scikit-learn.
-
-.. raw:: html
+.. div:: sk-text-image-grid-small
 
-   </div>
-   <div class="sk-sponsor-div-box">
+  .. div:: text-box
 
-.. image:: images/telecom.png
-   :width: 50pt
-   :align: center
-   :target: https://www.telecom-paristech.fr/
+    `Télécom Paristech <https://www.telecom-paristech.fr/>`_ funded Manoj Kumar
+    (2014), Tom Dupré la Tour (2015), Raghav RV (2015-2017), Thierry Guillemot
+    (2016-2017) and Albert Thomas (2017) to work on scikit-learn.
 
-.. raw:: html
+  .. div:: image-box
 
-   </div>
-   </div>
+    .. image:: images/telecom.png
+      :target: https://www.telecom-paristech.fr/
 
 .....................
 
-.. raw:: html
-
-   <div class="sk-sponsor-div">
-   <div class="sk-sponsor-div-box">
-
-`The Labex DigiCosme <https://digicosme.lri.fr>`_ funded Nicolas Goix
-(2015-2016), Tom Dupré la Tour (2015-2016 and 2017-2018), Mathurin Massias
-(2018-2019) to work part time on scikit-learn during their PhDs. It also
-funded a scikit-learn coding sprint in 2015.
+.. div:: sk-text-image-grid-small
 
-.. raw:: html
-
-   </div>
-   <div class="sk-sponsor-div-box">
+  .. div:: text-box
 
-.. image:: images/digicosme.png
-   :width: 100pt
-   :align: center
-   :target: https://digicosme.lri.fr
+    `The Labex DigiCosme <https://digicosme.lri.fr>`_ funded Nicolas Goix
+    (2015-2016), Tom Dupré la Tour (2015-2016 and 2017-2018), Mathurin Massias
+    (2018-2019) to work part time on scikit-learn during their PhDs. It also
+    funded a scikit-learn coding sprint in 2015.
 
-.. raw:: html
+  .. div:: image-box
 
-   </div>
-   </div>
+    .. image:: images/digicosme.png
+      :target: https://digicosme.lri.fr
 
 .....................
 
-.. raw:: html
-
-   <div class="sk-sponsor-div">
-   <div class="sk-sponsor-div-box">
-
-`The Chan-Zuckerberg Initiative <https://chanzuckerberg.com/>`_ funded Nicolas
-Hug to work full-time on scikit-learn in 2020.
+.. div:: sk-text-image-grid-small
 
-.. raw:: html
+  .. div:: text-box
 
-   </div>
-   <div class="sk-sponsor-div-box">
+    `The Chan-Zuckerberg Initiative <https://chanzuckerberg.com/>`_ funded Nicolas
+    Hug to work full-time on scikit-learn in 2020.
 
-.. image:: images/czi_logo.svg
-   :width: 100pt
-   :align: center
-   :target: https://chanzuckerberg.com
+  .. div:: image-box
 
-.. raw:: html
-
-   </div>
-   </div>
+    .. image:: images/czi_logo.svg
+      :target: https://chanzuckerberg.com
 
 ......................
 
@@ -609,9 +467,9 @@ program.
 
 - 2007 - David Cournapeau
 - 2011 - `Vlad Niculae`_
-- 2012 - `Vlad Niculae`_, Immanuel Bayer.
+- 2012 - `Vlad Niculae`_, Immanuel Bayer
 - 2013 - Kemal Eren, Nicolas Trésegnie
-- 2014 - Hamzeh Alsalhi, Issam Laradji, Maheshakya Wijewardena, Manoj Kumar.
+- 2014 - Hamzeh Alsalhi, Issam Laradji, Maheshakya Wijewardena, Manoj Kumar
 - 2015 - `Raghav RV <https://github.com/raghavrv>`_, Wei Xue
 - 2016 - `Nelson Liu <http://nelsonliu.me>`_, `YenChen Lin <https://yenchenlin.me/>`_
 
@@ -630,86 +488,110 @@ The following organizations funded the scikit-learn consortium at Inria in
 the past:
 
 .. |msn| image:: images/microsoft.png
-   :width: 100pt
-   :target: https://www.microsoft.com/
+  :target: https://www.microsoft.com/
 
 .. |bcg| image:: images/bcg.png
-   :width: 100pt
-   :target: https://www.bcg.com/beyond-consulting/bcg-gamma/default.aspx
+  :target: https://www.bcg.com/beyond-consulting/bcg-gamma/default.aspx
 
 .. |fujitsu| image:: images/fujitsu.png
-   :width: 100pt
-   :target: https://www.fujitsu.com/global/
+  :target: https://www.fujitsu.com/global/
 
 .. |aphp| image:: images/logo_APHP_text.png
-   :width: 150pt
-   :target: https://aphp.fr/
+  :target: https://aphp.fr/
 
+.. |hf| image:: images/huggingface_logo-noborder.png
+  :target: https://huggingface.co
 
-|bcg| |msn| |fujitsu| |aphp|
+.. raw:: html
 
+  <style>
+    div.image-subgrid img {
+      max-height: 50px;
+      max-width: 90%;
+    }
+  </style>
 
-Sprints
--------
+.. grid:: 2 2 4 4
+  :class-row: image-subgrid
+  :gutter: 1
 
-The International 2019 Paris sprint was kindly hosted by `AXA <https://www.axa.fr/>`_.
-Also some participants could attend thanks to the support of the `Alfred P.
-Sloan Foundation <https://sloan.org>`_, the `Python Software
-Foundation <https://www.python.org/psf/>`_ (PSF) and the `DATAIA Institute
-<https://dataia.eu/en>`_.
+  .. grid-item::
+    :class: sd-text-center
+    :child-align: center
 
-.....................
+    |msn|
+
+  .. grid-item::
+    :class: sd-text-center
+    :child-align: center
+
+    |bcg|
+
+  .. grid-item::
+    :class: sd-text-center
+    :child-align: center
 
-The 2013 International Paris Sprint was made possible thanks to the support of
-`Télécom Paristech <https://www.telecom-paristech.fr/>`_, `tinyclues
-<https://www.tinyclues.com/>`_, the `French Python Association
-<https://www.afpy.org/>`_ and the `Fonds de la Recherche Scientifique
-<https://www.frs-fnrs.be>`_.
+    |fujitsu|
 
-..............
+  .. grid-item::
+    :class: sd-text-center
+    :child-align: center
 
-The 2011 International Granada sprint was made possible thanks to the support
-of the `PSF <https://www.python.org/psf/>`_ and `tinyclues
-<https://www.tinyclues.com/>`_.
+    |aphp|
+
+  .. grid-item::
+    :class: sd-text-center
+    :child-align: center
+
+    |hf|
+
+Coding Sprints
+--------------
+
+The scikit-learn project has a long history of `open source coding sprints
+<https://blog.scikit-learn.org/events/sprints-value/>`_ with over 50 sprint
+events from 2010 to present day. There are scores of sponsors who contributed
+to costs which include venue, food, travel, developer time and more. See
+`scikit-learn sprints <https://blog.scikit-learn.org/sprints/>`_ for a full
+list of events.
 
 Donating to the project
-.......................
+-----------------------
 
 If you are interested in donating to the project or to one of our code-sprints,
 please donate via the `NumFOCUS Donations Page
 <https://numfocus.org/donate-to-scikit-learn>`_.
 
-.. raw :: html
-
-   <div style="text-align: center;">
-   <a class="btn btn-warning btn-big sk-donate-btn mb-1" href="https://numfocus.org/donate-to-scikit-learn">Help us, <strong>donate!</strong></a>
-   </div>
-   </br>
+.. raw:: html
 
-All donations will be handled by `NumFOCUS
-<https://numfocus.org/>`_, a non-profit-organization which is
-managed by a board of `Scipy community members
-<https://numfocus.org/board.html>`_. NumFOCUS's mission is to foster
-scientific computing software, in particular in Python. As a fiscal home
-of scikit-learn, it ensures that money is available when needed to keep
-the project funded and available while in compliance with tax regulations.
+  <p class="text-center">
+    <a class="btn sk-btn-orange mb-1" href="https://numfocus.org/donate-to-scikit-learn">
+      Help us, <strong>donate!</strong>
+    </a>
+  </p>
 
-The received donations for the scikit-learn project mostly will go towards
-covering travel-expenses for code sprints, as well as towards the organization
-budget of the project [#f1]_.
+All donations will be handled by `NumFOCUS <https://numfocus.org/>`_, a non-profit
+organization which is managed by a board of `Scipy community members
+<https://numfocus.org/board.html>`_. NumFOCUS's mission is to foster scientific
+computing software, in particular in Python. As a fiscal home of scikit-learn, it
+ensures that money is available when needed to keep the project funded and available
+while in compliance with tax regulations.
 
+The received donations for the scikit-learn project mostly will go towards covering
+travel-expenses for code sprints, as well as towards the organization budget of the
+project [#f1]_.
 
 .. rubric:: Notes
 
 .. [#f1] Regarding the organization budget, in particular, we might use some of
-         the donated funds to pay for other project expenses such as DNS,
-         hosting or continuous integration services.
+  the donated funds to pay for other project expenses such as DNS,
+  hosting or continuous integration services.
+
 
 Infrastructure support
 ----------------------
 
-- We would also like to thank `Microsoft Azure
-  <https://azure.microsoft.com/en-us/>`_, `Cirrus Cl <https://cirrus-ci.org>`_,
-  `CircleCl <https://circleci.com/>`_ for free CPU time on their Continuous
-  Integration servers, and `Anaconda Inc. <https://www.anaconda.com>`_ for the
-  storage they provide for our staging and nightly builds.
+We would also like to thank `Microsoft Azure <https://azure.microsoft.com/en-us/>`_,
+`Cirrus Cl <https://cirrus-ci.org>`_, `CircleCl <https://circleci.com/>`_ for free CPU
+time on their Continuous Integration servers, and `Anaconda Inc. <https://www.anaconda.com>`_
+for the storage they provide for our staging and nightly builds.
diff --git a/doc/api/deprecated.rst.template b/doc/api/deprecated.rst.template
new file mode 100644
index 0000000000000..a48f0180f76ed
--- /dev/null
+++ b/doc/api/deprecated.rst.template
@@ -0,0 +1,24 @@
+:html_theme.sidebar_secondary.remove:
+
+.. _api_depr_ref:
+
+Recently Deprecated
+===================
+
+.. currentmodule:: sklearn
+
+{% for ver, objs in DEPRECATED_API_REFERENCE %}
+.. _api_depr_ref-{{ ver|replace(".", "-") }}:
+
+.. rubric:: To be removed in {{ ver }}
+
+.. autosummary::
+  :nosignatures:
+  :toctree: ../modules/generated/
+  :template: base.rst
+
+{% for obj in objs %}
+  {{ obj }}
+{%- endfor %}
+
+{% endfor %}
diff --git a/doc/api/index.rst.template b/doc/api/index.rst.template
new file mode 100644
index 0000000000000..a9f3209d350de
--- /dev/null
+++ b/doc/api/index.rst.template
@@ -0,0 +1,77 @@
+:html_theme.sidebar_secondary.remove:
+
+.. _api_ref:
+
+=============
+API Reference
+=============
+
+This is the class and function reference of scikit-learn. Please refer to the
+:ref:`full user guide <user_guide>` for further details, as the raw specifications of
+classes and functions may not be enough to give full guidelines on their uses. For
+reference on concepts repeated across the API, see :ref:`glossary`.
+
+.. toctree::
+  :maxdepth: 2
+  :hidden:
+
+{% for module, _ in API_REFERENCE %}
+  {{ module }}
+{%- endfor %}
+{%- if DEPRECATED_API_REFERENCE %}
+  deprecated
+{%- endif %}
+
+.. list-table::
+  :header-rows: 1
+  :class: apisearch-table
+
+  * - Object
+    - Description
+
+{% for module, module_info in API_REFERENCE %}
+{% for section in module_info["sections"] %}
+{% for obj in section["autosummary"] %}
+{% set parts = obj.rsplit(".", 1) %}
+{% if parts|length > 1 %}
+{% set full_module = module + "." + parts[0] %}
+{% else %}
+{% set full_module = module %}
+{% endif %}
+  * - :obj:`~{{ module }}.{{ obj }}`
+
+    - .. div:: sk-apisearch-desc
+
+        .. currentmodule:: {{ full_module }}
+
+        .. autoshortsummary:: {{ module }}.{{ obj }}
+
+        .. div:: caption
+
+          :mod:`{{ full_module }}`
+{% endfor %}
+{% endfor %}
+{% endfor %}
+
+{% for ver, objs in DEPRECATED_API_REFERENCE %}
+{% for obj in objs %}
+{% set parts = obj.rsplit(".", 1) %}
+{% if parts|length > 1 %}
+{% set full_module = "sklearn." + parts[0] %}
+{% else %}
+{% set full_module = "sklearn" %}
+{% endif %}
+  * - :obj:`~sklearn.{{ obj }}`
+
+    - .. div:: sk-apisearch-desc
+
+        .. currentmodule:: {{ full_module }}
+
+        .. autoshortsummary:: sklearn.{{ obj }}
+
+        .. div:: caption
+
+          :mod:`{{ full_module }}`
+          :bdg-ref-danger-line:`Deprecated in version {{ ver }} <api_depr_ref-{{ ver|replace(".", "-") }}>`
+{% endfor %}
+{% endfor %}
diff --git a/doc/api/module.rst.template b/doc/api/module.rst.template
new file mode 100644
index 0000000000000..1980f27aad158
--- /dev/null
+++ b/doc/api/module.rst.template
@@ -0,0 +1,46 @@
+:html_theme.sidebar_secondary.remove:
+
+{% if module == "sklearn" -%}
+{%- set module_hook = "sklearn" -%}
+{%- elif module.startswith("sklearn.") -%}
+{%- set module_hook = module[8:] -%}
+{%- else -%}
+{%- set module_hook = None -%}
+{%- endif -%}
+
+{% if module_hook %}
+.. _{{ module_hook }}_ref:
+{% endif %}
+
+{{ module }}
+{{ "=" * module|length }}
+
+.. automodule:: {{ module }}
+
+{% if module_info["description"] %}
+{{ module_info["description"] }}
+{% endif %}
+
+{% for section in module_info["sections"] %}
+{% if section["title"] and module_hook %}
+.. _{{ module_hook }}_ref-{{ section["title"]|lower|replace(" ", "-") }}:
+{% endif %}
+
+{% if section["title"] %}
+{{ section["title"] }}
+{{ "-" * section["title"]|length }}
+{% endif %}
+
+{% if section["description"] %}
+{{ section["description"] }}
+{% endif %}
+
+.. autosummary::
+  :nosignatures:
+  :toctree: ../modules/generated/
+  :template: base.rst
+
+{% for obj in section["autosummary"] %}
+  {{ obj }}
+{%- endfor %}
+{% endfor %}
diff --git a/doc/api_reference.py b/doc/api_reference.py
new file mode 100644
index 0000000000000..39eac12c1c6cf
--- /dev/null
+++ b/doc/api_reference.py
@@ -0,0 +1,1335 @@
+"""Configuration for the API reference documentation."""
+
+
+def _get_guide(*refs, is_developer=False):
+    """Get the rst to refer to user/developer guide.
+
+    `refs` is several references that can be used in the :ref:`...` directive.
+    """
+    if len(refs) == 1:
+        ref_desc = f":ref:`{refs[0]}` section"
+    elif len(refs) == 2:
+        ref_desc = f":ref:`{refs[0]}` and :ref:`{refs[1]}` sections"
+    else:
+        ref_desc = ", ".join(f":ref:`{ref}`" for ref in refs[:-1])
+        ref_desc += f", and :ref:`{refs[-1]}` sections"
+
+    guide_name = "Developer" if is_developer else "User"
+    return f"**{guide_name} guide.** See the {ref_desc} for further details."
+
+
+def _get_submodule(module_name, submodule_name):
+    """Get the submodule docstring and automatically add the hook.
+
+    `module_name` is e.g. `sklearn.feature_extraction`, and `submodule_name` is e.g.
+    `image`, so we get the docstring and hook for `sklearn.feature_extraction.image`
+    submodule. `module_name` is used to reset the current module because autosummary
+    automatically changes the current module.
+    """
+    lines = [
+        f".. automodule:: {module_name}.{submodule_name}",
+        f".. currentmodule:: {module_name}",
+    ]
+    return "\n\n".join(lines)
+
+
+"""
+CONFIGURING API_REFERENCE
+=========================
+
+API_REFERENCE maps each module name to a dictionary that consists of the following
+components:
+
+short_summary (required)
+    The text to be printed on the index page; it has nothing to do the API reference
+    page of each module.
+description (required, `None` if not needed)
+    The additional description for the module to be placed under the module
+    docstring, before the sections start.
+sections (required)
+    A list of sections, each of which consists of:
+    - title (required, `None` if not needed): the section title, commonly it should
+      not be `None` except for the first section of a module,
+    - description (optional): the optional additional description for the section,
+    - autosummary (required): an autosummary block, assuming current module is the
+      current module name.
+
+Essentially, the rendered page would look like the following:
+
+|---------------------------------------------------------------------------------|
+|     {{ module_name }}                                                           |
+|     =================                                                           |
+|     {{ module_docstring }}                                                      |
+|     {{ description }}                                                           |
+|                                                                                 |
+|     {{ section_title_1 }}   <-------------- Optional if one wants the first     |
+|     ---------------------                   section to directly follow          |
+|     {{ section_description_1 }}             without a second-level heading.     |
+|     {{ section_autosummary_1 }}                                                 |
+|                                                                                 |
+|     {{ section_title_2 }}                                                       |
+|     ---------------------                                                       |
+|     {{ section_description_2 }}                                                 |
+|     {{ section_autosummary_2 }}                                                 |
+|                                                                                 |
+|     More sections...                                                            |
+|---------------------------------------------------------------------------------|
+
+Hooks will be automatically generated for each module and each section. For a module,
+e.g., `sklearn.feature_extraction`, the hook would be `feature_extraction_ref`; for a
+section, e.g., "From text" under `sklearn.feature_extraction`, the hook would be
+`feature_extraction_ref-from-text`. However, note that a better way is to refer using
+the :mod: directive, e.g., :mod:`sklearn.feature_extraction` for the module and
+:mod:`sklearn.feature_extraction.text` for the section. Only in case that a section
+is not a particular submodule does the hook become useful, e.g., the "Loaders" section
+under `sklearn.datasets`.
+"""
+
+API_REFERENCE = {
+    "sklearn": {
+        "short_summary": "Settings and information tools.",
+        "description": None,
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "config_context",
+                    "get_config",
+                    "set_config",
+                    "show_versions",
+                ],
+            },
+        ],
+    },
+    "sklearn.base": {
+        "short_summary": "Base classes and utility functions.",
+        "description": None,
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "BaseEstimator",
+                    "BiclusterMixin",
+                    "ClassNamePrefixFeaturesOutMixin",
+                    "ClassifierMixin",
+                    "ClusterMixin",
+                    "DensityMixin",
+                    "MetaEstimatorMixin",
+                    "OneToOneFeatureMixin",
+                    "OutlierMixin",
+                    "RegressorMixin",
+                    "TransformerMixin",
+                    "clone",
+                    "is_classifier",
+                    "is_clusterer",
+                    "is_regressor",
+                ],
+            }
+        ],
+    },
+    "sklearn.calibration": {
+        "short_summary": "Probability calibration.",
+        "description": _get_guide("calibration"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": ["CalibratedClassifierCV", "calibration_curve"],
+            },
+            {
+                "title": "Visualization",
+                "autosummary": ["CalibrationDisplay"],
+            },
+        ],
+    },
+    "sklearn.cluster": {
+        "short_summary": "Clustering.",
+        "description": _get_guide("clustering", "biclustering"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "AffinityPropagation",
+                    "AgglomerativeClustering",
+                    "Birch",
+                    "BisectingKMeans",
+                    "DBSCAN",
+                    "FeatureAgglomeration",
+                    "HDBSCAN",
+                    "KMeans",
+                    "MeanShift",
+                    "MiniBatchKMeans",
+                    "OPTICS",
+                    "SpectralBiclustering",
+                    "SpectralClustering",
+                    "SpectralCoclustering",
+                    "affinity_propagation",
+                    "cluster_optics_dbscan",
+                    "cluster_optics_xi",
+                    "compute_optics_graph",
+                    "dbscan",
+                    "estimate_bandwidth",
+                    "k_means",
+                    "kmeans_plusplus",
+                    "mean_shift",
+                    "spectral_clustering",
+                    "ward_tree",
+                ],
+            },
+        ],
+    },
+    "sklearn.compose": {
+        "short_summary": "Composite estimators.",
+        "description": _get_guide("combining_estimators"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "ColumnTransformer",
+                    "TransformedTargetRegressor",
+                    "make_column_selector",
+                    "make_column_transformer",
+                ],
+            },
+        ],
+    },
+    "sklearn.covariance": {
+        "short_summary": "Covariance estimation.",
+        "description": _get_guide("covariance"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "EllipticEnvelope",
+                    "EmpiricalCovariance",
+                    "GraphicalLasso",
+                    "GraphicalLassoCV",
+                    "LedoitWolf",
+                    "MinCovDet",
+                    "OAS",
+                    "ShrunkCovariance",
+                    "empirical_covariance",
+                    "graphical_lasso",
+                    "ledoit_wolf",
+                    "ledoit_wolf_shrinkage",
+                    "oas",
+                    "shrunk_covariance",
+                ],
+            },
+        ],
+    },
+    "sklearn.cross_decomposition": {
+        "short_summary": "Cross decomposition.",
+        "description": _get_guide("cross_decomposition"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": ["CCA", "PLSCanonical", "PLSRegression", "PLSSVD"],
+            },
+        ],
+    },
+    "sklearn.datasets": {
+        "short_summary": "Datasets.",
+        "description": _get_guide("datasets"),
+        "sections": [
+            {
+                "title": "Loaders",
+                "autosummary": [
+                    "clear_data_home",
+                    "dump_svmlight_file",
+                    "fetch_20newsgroups",
+                    "fetch_20newsgroups_vectorized",
+                    "fetch_california_housing",
+                    "fetch_covtype",
+                    "fetch_kddcup99",
+                    "fetch_lfw_pairs",
+                    "fetch_lfw_people",
+                    "fetch_olivetti_faces",
+                    "fetch_openml",
+                    "fetch_rcv1",
+                    "fetch_species_distributions",
+                    "get_data_home",
+                    "load_breast_cancer",
+                    "load_diabetes",
+                    "load_digits",
+                    "load_files",
+                    "load_iris",
+                    "load_linnerud",
+                    "load_sample_image",
+                    "load_sample_images",
+                    "load_svmlight_file",
+                    "load_svmlight_files",
+                    "load_wine",
+                ],
+            },
+            {
+                "title": "Sample generators",
+                "autosummary": [
+                    "make_biclusters",
+                    "make_blobs",
+                    "make_checkerboard",
+                    "make_circles",
+                    "make_classification",
+                    "make_friedman1",
+                    "make_friedman2",
+                    "make_friedman3",
+                    "make_gaussian_quantiles",
+                    "make_hastie_10_2",
+                    "make_low_rank_matrix",
+                    "make_moons",
+                    "make_multilabel_classification",
+                    "make_regression",
+                    "make_s_curve",
+                    "make_sparse_coded_signal",
+                    "make_sparse_spd_matrix",
+                    "make_sparse_uncorrelated",
+                    "make_spd_matrix",
+                    "make_swiss_roll",
+                ],
+            },
+        ],
+    },
+    "sklearn.decomposition": {
+        "short_summary": "Matrix decomposition.",
+        "description": _get_guide("decompositions"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "DictionaryLearning",
+                    "FactorAnalysis",
+                    "FastICA",
+                    "IncrementalPCA",
+                    "KernelPCA",
+                    "LatentDirichletAllocation",
+                    "MiniBatchDictionaryLearning",
+                    "MiniBatchNMF",
+                    "MiniBatchSparsePCA",
+                    "NMF",
+                    "PCA",
+                    "SparseCoder",
+                    "SparsePCA",
+                    "TruncatedSVD",
+                    "dict_learning",
+                    "dict_learning_online",
+                    "fastica",
+                    "non_negative_factorization",
+                    "sparse_encode",
+                ],
+            },
+        ],
+    },
+    "sklearn.discriminant_analysis": {
+        "short_summary": "Discriminant analysis.",
+        "description": _get_guide("lda_qda"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "LinearDiscriminantAnalysis",
+                    "QuadraticDiscriminantAnalysis",
+                ],
+            },
+        ],
+    },
+    "sklearn.dummy": {
+        "short_summary": "Dummy estimators.",
+        "description": _get_guide("model_evaluation"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": ["DummyClassifier", "DummyRegressor"],
+            },
+        ],
+    },
+    "sklearn.ensemble": {
+        "short_summary": "Ensemble methods.",
+        "description": _get_guide("ensemble"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "AdaBoostClassifier",
+                    "AdaBoostRegressor",
+                    "BaggingClassifier",
+                    "BaggingRegressor",
+                    "ExtraTreesClassifier",
+                    "ExtraTreesRegressor",
+                    "GradientBoostingClassifier",
+                    "GradientBoostingRegressor",
+                    "HistGradientBoostingClassifier",
+                    "HistGradientBoostingRegressor",
+                    "IsolationForest",
+                    "RandomForestClassifier",
+                    "RandomForestRegressor",
+                    "RandomTreesEmbedding",
+                    "StackingClassifier",
+                    "StackingRegressor",
+                    "VotingClassifier",
+                    "VotingRegressor",
+                ],
+            },
+        ],
+    },
+    "sklearn.exceptions": {
+        "short_summary": "Exceptions and warnings.",
+        "description": None,
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "ConvergenceWarning",
+                    "DataConversionWarning",
+                    "DataDimensionalityWarning",
+                    "EfficiencyWarning",
+                    "FitFailedWarning",
+                    "InconsistentVersionWarning",
+                    "NotFittedError",
+                    "UndefinedMetricWarning",
+                ],
+            },
+        ],
+    },
+    "sklearn.experimental": {
+        "short_summary": "Experimental tools.",
+        "description": None,
+        "sections": [
+            {
+                "title": None,
+                "autosummary": ["enable_halving_search_cv", "enable_iterative_imputer"],
+            },
+        ],
+    },
+    "sklearn.feature_extraction": {
+        "short_summary": "Feature extraction.",
+        "description": _get_guide("feature_extraction"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": ["DictVectorizer", "FeatureHasher"],
+            },
+            {
+                "title": "From images",
+                "description": _get_submodule("sklearn.feature_extraction", "image"),
+                "autosummary": [
+                    "image.PatchExtractor",
+                    "image.extract_patches_2d",
+                    "image.grid_to_graph",
+                    "image.img_to_graph",
+                    "image.reconstruct_from_patches_2d",
+                ],
+            },
+            {
+                "title": "From text",
+                "description": _get_submodule("sklearn.feature_extraction", "text"),
+                "autosummary": [
+                    "text.CountVectorizer",
+                    "text.HashingVectorizer",
+                    "text.TfidfTransformer",
+                    "text.TfidfVectorizer",
+                ],
+            },
+        ],
+    },
+    "sklearn.feature_selection": {
+        "short_summary": "Feature selection.",
+        "description": _get_guide("feature_selection"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "GenericUnivariateSelect",
+                    "RFE",
+                    "RFECV",
+                    "SelectFdr",
+                    "SelectFpr",
+                    "SelectFromModel",
+                    "SelectFwe",
+                    "SelectKBest",
+                    "SelectPercentile",
+                    "SelectorMixin",
+                    "SequentialFeatureSelector",
+                    "VarianceThreshold",
+                    "chi2",
+                    "f_classif",
+                    "f_regression",
+                    "mutual_info_classif",
+                    "mutual_info_regression",
+                    "r_regression",
+                ],
+            },
+        ],
+    },
+    "sklearn.gaussian_process": {
+        "short_summary": "Gaussian processes.",
+        "description": _get_guide("gaussian_process"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "GaussianProcessClassifier",
+                    "GaussianProcessRegressor",
+                ],
+            },
+            {
+                "title": "Kernels",
+                "description": _get_submodule("sklearn.gaussian_process", "kernels"),
+                "autosummary": [
+                    "kernels.CompoundKernel",
+                    "kernels.ConstantKernel",
+                    "kernels.DotProduct",
+                    "kernels.ExpSineSquared",
+                    "kernels.Exponentiation",
+                    "kernels.Hyperparameter",
+                    "kernels.Kernel",
+                    "kernels.Matern",
+                    "kernels.PairwiseKernel",
+                    "kernels.Product",
+                    "kernels.RBF",
+                    "kernels.RationalQuadratic",
+                    "kernels.Sum",
+                    "kernels.WhiteKernel",
+                ],
+            },
+        ],
+    },
+    "sklearn.impute": {
+        "short_summary": "Imputation.",
+        "description": _get_guide("impute"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "IterativeImputer",
+                    "KNNImputer",
+                    "MissingIndicator",
+                    "SimpleImputer",
+                ],
+            },
+        ],
+    },
+    "sklearn.inspection": {
+        "short_summary": "Inspection.",
+        "description": _get_guide("inspection"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": ["partial_dependence", "permutation_importance"],
+            },
+            {
+                "title": "Plotting",
+                "autosummary": ["DecisionBoundaryDisplay", "PartialDependenceDisplay"],
+            },
+        ],
+    },
+    "sklearn.isotonic": {
+        "short_summary": "Isotonic regression.",
+        "description": _get_guide("isotonic"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "IsotonicRegression",
+                    "check_increasing",
+                    "isotonic_regression",
+                ],
+            },
+        ],
+    },
+    "sklearn.kernel_approximation": {
+        "short_summary": "Isotonic regression.",
+        "description": _get_guide("kernel_approximation"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "AdditiveChi2Sampler",
+                    "Nystroem",
+                    "PolynomialCountSketch",
+                    "RBFSampler",
+                    "SkewedChi2Sampler",
+                ],
+            },
+        ],
+    },
+    "sklearn.kernel_ridge": {
+        "short_summary": "Kernel ridge regression.",
+        "description": _get_guide("kernel_ridge"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": ["KernelRidge"],
+            },
+        ],
+    },
+    "sklearn.linear_model": {
+        "short_summary": "Generalized linear models.",
+        "description": (
+            _get_guide("linear_model")
+            + "\n\nThe following subsections are only rough guidelines: the same "
+            "estimator can fall into multiple categories, depending on its parameters."
+        ),
+        "sections": [
+            {
+                "title": "Linear classifiers",
+                "autosummary": [
+                    "LogisticRegression",
+                    "LogisticRegressionCV",
+                    "PassiveAggressiveClassifier",
+                    "Perceptron",
+                    "RidgeClassifier",
+                    "RidgeClassifierCV",
+                    "SGDClassifier",
+                    "SGDOneClassSVM",
+                ],
+            },
+            {
+                "title": "Classical linear regressors",
+                "autosummary": ["LinearRegression", "Ridge", "RidgeCV", "SGDRegressor"],
+            },
+            {
+                "title": "Regressors with variable selection",
+                "description": (
+                    "The following estimators have built-in variable selection fitting "
+                    "procedures, but any estimator using a L1 or elastic-net penalty "
+                    "also performs variable selection: typically "
+                    ":class:`~linear_model.SGDRegressor` or "
+                    ":class:`~sklearn.linear_model.SGDClassifier` with an appropriate "
+                    "penalty."
+                ),
+                "autosummary": [
+                    "ElasticNet",
+                    "ElasticNetCV",
+                    "Lars",
+                    "LarsCV",
+                    "Lasso",
+                    "LassoCV",
+                    "LassoLars",
+                    "LassoLarsCV",
+                    "LassoLarsIC",
+                    "OrthogonalMatchingPursuit",
+                    "OrthogonalMatchingPursuitCV",
+                ],
+            },
+            {
+                "title": "Bayesian regressors",
+                "autosummary": ["ARDRegression", "BayesianRidge"],
+            },
+            {
+                "title": "Multi-task linear regressors with variable selection",
+                "description": (
+                    "These estimators fit multiple regression problems (or tasks)"
+                    " jointly, while inducing sparse coefficients. While the inferred"
+                    " coefficients may differ between the tasks, they are constrained"
+                    " to agree on the features that are selected (non-zero"
+                    " coefficients)."
+                ),
+                "autosummary": [
+                    "MultiTaskElasticNet",
+                    "MultiTaskElasticNetCV",
+                    "MultiTaskLasso",
+                    "MultiTaskLassoCV",
+                ],
+            },
+            {
+                "title": "Outlier-robust regressors",
+                "description": (
+                    "Any estimator using the Huber loss would also be robust to "
+                    "outliers, e.g., :class:`~linear_model.SGDRegressor` with "
+                    "``loss='huber'``."
+                ),
+                "autosummary": [
+                    "HuberRegressor",
+                    "QuantileRegressor",
+                    "RANSACRegressor",
+                    "TheilSenRegressor",
+                ],
+            },
+            {
+                "title": "Generalized linear models (GLM) for regression",
+                "description": (
+                    "These models allow for response variables to have error "
+                    "distributions other than a normal distribution."
+                ),
+                "autosummary": [
+                    "GammaRegressor",
+                    "PoissonRegressor",
+                    "TweedieRegressor",
+                ],
+            },
+            {
+                "title": "Miscellaneous",
+                "autosummary": [
+                    "PassiveAggressiveRegressor",
+                    "enet_path",
+                    "lars_path",
+                    "lars_path_gram",
+                    "lasso_path",
+                    "orthogonal_mp",
+                    "orthogonal_mp_gram",
+                    "ridge_regression",
+                ],
+            },
+        ],
+    },
+    "sklearn.manifold": {
+        "short_summary": "Manifold learning.",
+        "description": _get_guide("manifold"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "Isomap",
+                    "LocallyLinearEmbedding",
+                    "MDS",
+                    "SpectralEmbedding",
+                    "TSNE",
+                    "locally_linear_embedding",
+                    "smacof",
+                    "spectral_embedding",
+                    "trustworthiness",
+                ],
+            },
+        ],
+    },
+    "sklearn.metrics": {
+        "short_summary": "Metrics.",
+        "description": _get_guide("model_evaluation", "metrics"),
+        "sections": [
+            {
+                "title": "Model selection interface",
+                "description": _get_guide("scoring_parameter"),
+                "autosummary": [
+                    "check_scoring",
+                    "get_scorer",
+                    "get_scorer_names",
+                    "make_scorer",
+                ],
+            },
+            {
+                "title": "Classification metrics",
+                "description": _get_guide("classification_metrics"),
+                "autosummary": [
+                    "accuracy_score",
+                    "auc",
+                    "average_precision_score",
+                    "balanced_accuracy_score",
+                    "brier_score_loss",
+                    "class_likelihood_ratios",
+                    "classification_report",
+                    "cohen_kappa_score",
+                    "confusion_matrix",
+                    "d2_log_loss_score",
+                    "dcg_score",
+                    "det_curve",
+                    "f1_score",
+                    "fbeta_score",
+                    "hamming_loss",
+                    "hinge_loss",
+                    "jaccard_score",
+                    "log_loss",
+                    "matthews_corrcoef",
+                    "multilabel_confusion_matrix",
+                    "ndcg_score",
+                    "precision_recall_curve",
+                    "precision_recall_fscore_support",
+                    "precision_score",
+                    "recall_score",
+                    "roc_auc_score",
+                    "roc_curve",
+                    "top_k_accuracy_score",
+                    "zero_one_loss",
+                ],
+            },
+            {
+                "title": "Regression metrics",
+                "description": _get_guide("regression_metrics"),
+                "autosummary": [
+                    "d2_absolute_error_score",
+                    "d2_pinball_score",
+                    "d2_tweedie_score",
+                    "explained_variance_score",
+                    "max_error",
+                    "mean_absolute_error",
+                    "mean_absolute_percentage_error",
+                    "mean_gamma_deviance",
+                    "mean_pinball_loss",
+                    "mean_poisson_deviance",
+                    "mean_squared_error",
+                    "mean_squared_log_error",
+                    "mean_tweedie_deviance",
+                    "median_absolute_error",
+                    "r2_score",
+                    "root_mean_squared_error",
+                    "root_mean_squared_log_error",
+                ],
+            },
+            {
+                "title": "Multilabel ranking metrics",
+                "description": _get_guide("multilabel_ranking_metrics"),
+                "autosummary": [
+                    "coverage_error",
+                    "label_ranking_average_precision_score",
+                    "label_ranking_loss",
+                ],
+            },
+            {
+                "title": "Clustering metrics",
+                "description": (
+                    _get_submodule("sklearn.metrics", "cluster")
+                    + "\n\n"
+                    + _get_guide("clustering_evaluation")
+                ),
+                "autosummary": [
+                    "adjusted_mutual_info_score",
+                    "adjusted_rand_score",
+                    "calinski_harabasz_score",
+                    "cluster.contingency_matrix",
+                    "cluster.pair_confusion_matrix",
+                    "completeness_score",
+                    "davies_bouldin_score",
+                    "fowlkes_mallows_score",
+                    "homogeneity_completeness_v_measure",
+                    "homogeneity_score",
+                    "mutual_info_score",
+                    "normalized_mutual_info_score",
+                    "rand_score",
+                    "silhouette_samples",
+                    "silhouette_score",
+                    "v_measure_score",
+                ],
+            },
+            {
+                "title": "Biclustering metrics",
+                "description": _get_guide("biclustering_evaluation"),
+                "autosummary": ["consensus_score"],
+            },
+            {
+                "title": "Distance metrics",
+                "autosummary": ["DistanceMetric"],
+            },
+            {
+                "title": "Pairwise metrics",
+                "description": (
+                    _get_submodule("sklearn.metrics", "pairwise")
+                    + "\n\n"
+                    + _get_guide("metrics")
+                ),
+                "autosummary": [
+                    "pairwise.additive_chi2_kernel",
+                    "pairwise.chi2_kernel",
+                    "pairwise.cosine_distances",
+                    "pairwise.cosine_similarity",
+                    "pairwise.distance_metrics",
+                    "pairwise.euclidean_distances",
+                    "pairwise.haversine_distances",
+                    "pairwise.kernel_metrics",
+                    "pairwise.laplacian_kernel",
+                    "pairwise.linear_kernel",
+                    "pairwise.manhattan_distances",
+                    "pairwise.nan_euclidean_distances",
+                    "pairwise.paired_cosine_distances",
+                    "pairwise.paired_distances",
+                    "pairwise.paired_euclidean_distances",
+                    "pairwise.paired_manhattan_distances",
+                    "pairwise.pairwise_kernels",
+                    "pairwise.polynomial_kernel",
+                    "pairwise.rbf_kernel",
+                    "pairwise.sigmoid_kernel",
+                    "pairwise_distances",
+                    "pairwise_distances_argmin",
+                    "pairwise_distances_argmin_min",
+                    "pairwise_distances_chunked",
+                ],
+            },
+            {
+                "title": "Plotting",
+                "description": _get_guide("visualizations"),
+                "autosummary": [
+                    "ConfusionMatrixDisplay",
+                    "DetCurveDisplay",
+                    "PrecisionRecallDisplay",
+                    "PredictionErrorDisplay",
+                    "RocCurveDisplay",
+                ],
+            },
+        ],
+    },
+    "sklearn.mixture": {
+        "short_summary": "Gaussian mixture models.",
+        "description": _get_guide("mixture"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": ["BayesianGaussianMixture", "GaussianMixture"],
+            },
+        ],
+    },
+    "sklearn.model_selection": {
+        "short_summary": "Model selection.",
+        "description": _get_guide("cross_validation", "grid_search", "learning_curve"),
+        "sections": [
+            {
+                "title": "Splitters",
+                "autosummary": [
+                    "GroupKFold",
+                    "GroupShuffleSplit",
+                    "KFold",
+                    "LeaveOneGroupOut",
+                    "LeaveOneOut",
+                    "LeavePGroupsOut",
+                    "LeavePOut",
+                    "PredefinedSplit",
+                    "RepeatedKFold",
+                    "RepeatedStratifiedKFold",
+                    "ShuffleSplit",
+                    "StratifiedGroupKFold",
+                    "StratifiedKFold",
+                    "StratifiedShuffleSplit",
+                    "TimeSeriesSplit",
+                    "check_cv",
+                    "train_test_split",
+                ],
+            },
+            {
+                "title": "Hyper-parameter optimizers",
+                "autosummary": [
+                    "GridSearchCV",
+                    "HalvingGridSearchCV",
+                    "HalvingRandomSearchCV",
+                    "ParameterGrid",
+                    "ParameterSampler",
+                    "RandomizedSearchCV",
+                ],
+            },
+            {
+                "title": "Post-fit model tuning",
+                "autosummary": [
+                    "FixedThresholdClassifier",
+                    "TunedThresholdClassifierCV",
+                ],
+            },
+            {
+                "title": "Model validation",
+                "autosummary": [
+                    "cross_val_predict",
+                    "cross_val_score",
+                    "cross_validate",
+                    "learning_curve",
+                    "permutation_test_score",
+                    "validation_curve",
+                ],
+            },
+            {
+                "title": "Visualization",
+                "autosummary": ["LearningCurveDisplay", "ValidationCurveDisplay"],
+            },
+        ],
+    },
+    "sklearn.multiclass": {
+        "short_summary": "Multiclass classification.",
+        "description": _get_guide("multiclass_classification"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "OneVsOneClassifier",
+                    "OneVsRestClassifier",
+                    "OutputCodeClassifier",
+                ],
+            },
+        ],
+    },
+    "sklearn.multioutput": {
+        "short_summary": "Multioutput regression and classification.",
+        "description": _get_guide(
+            "multilabel_classification",
+            "multiclass_multioutput_classification",
+            "multioutput_regression",
+        ),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "ClassifierChain",
+                    "MultiOutputClassifier",
+                    "MultiOutputRegressor",
+                    "RegressorChain",
+                ],
+            },
+        ],
+    },
+    "sklearn.naive_bayes": {
+        "short_summary": "Naive Bayes.",
+        "description": _get_guide("naive_bayes"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "BernoulliNB",
+                    "CategoricalNB",
+                    "ComplementNB",
+                    "GaussianNB",
+                    "MultinomialNB",
+                ],
+            },
+        ],
+    },
+    "sklearn.neighbors": {
+        "short_summary": "Nearest neighbors.",
+        "description": _get_guide("neighbors"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "BallTree",
+                    "KDTree",
+                    "KNeighborsClassifier",
+                    "KNeighborsRegressor",
+                    "KNeighborsTransformer",
+                    "KernelDensity",
+                    "LocalOutlierFactor",
+                    "NearestCentroid",
+                    "NearestNeighbors",
+                    "NeighborhoodComponentsAnalysis",
+                    "RadiusNeighborsClassifier",
+                    "RadiusNeighborsRegressor",
+                    "RadiusNeighborsTransformer",
+                    "kneighbors_graph",
+                    "radius_neighbors_graph",
+                    "sort_graph_by_row_values",
+                ],
+            },
+        ],
+    },
+    "sklearn.neural_network": {
+        "short_summary": "Neural network models.",
+        "description": _get_guide(
+            "neural_networks_supervised", "neural_networks_unsupervised"
+        ),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": ["BernoulliRBM", "MLPClassifier", "MLPRegressor"],
+            },
+        ],
+    },
+    "sklearn.pipeline": {
+        "short_summary": "Pipeline.",
+        "description": _get_guide("combining_estimators"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "FeatureUnion",
+                    "Pipeline",
+                    "make_pipeline",
+                    "make_union",
+                ],
+            },
+        ],
+    },
+    "sklearn.preprocessing": {
+        "short_summary": "Preprocessing and normalization.",
+        "description": _get_guide("preprocessing"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "Binarizer",
+                    "FunctionTransformer",
+                    "KBinsDiscretizer",
+                    "KernelCenterer",
+                    "LabelBinarizer",
+                    "LabelEncoder",
+                    "MaxAbsScaler",
+                    "MinMaxScaler",
+                    "MultiLabelBinarizer",
+                    "Normalizer",
+                    "OneHotEncoder",
+                    "OrdinalEncoder",
+                    "PolynomialFeatures",
+                    "PowerTransformer",
+                    "QuantileTransformer",
+                    "RobustScaler",
+                    "SplineTransformer",
+                    "StandardScaler",
+                    "TargetEncoder",
+                    "add_dummy_feature",
+                    "binarize",
+                    "label_binarize",
+                    "maxabs_scale",
+                    "minmax_scale",
+                    "normalize",
+                    "power_transform",
+                    "quantile_transform",
+                    "robust_scale",
+                    "scale",
+                ],
+            },
+        ],
+    },
+    "sklearn.random_projection": {
+        "short_summary": "Random projection.",
+        "description": _get_guide("random_projection"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "GaussianRandomProjection",
+                    "SparseRandomProjection",
+                    "johnson_lindenstrauss_min_dim",
+                ],
+            },
+        ],
+    },
+    "sklearn.semi_supervised": {
+        "short_summary": "Semi-supervised learning.",
+        "description": _get_guide("semi_supervised"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "LabelPropagation",
+                    "LabelSpreading",
+                    "SelfTrainingClassifier",
+                ],
+            },
+        ],
+    },
+    "sklearn.svm": {
+        "short_summary": "Support vector machines.",
+        "description": _get_guide("svm"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "LinearSVC",
+                    "LinearSVR",
+                    "NuSVC",
+                    "NuSVR",
+                    "OneClassSVM",
+                    "SVC",
+                    "SVR",
+                    "l1_min_c",
+                ],
+            },
+        ],
+    },
+    "sklearn.tree": {
+        "short_summary": "Decision trees.",
+        "description": _get_guide("tree"),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "DecisionTreeClassifier",
+                    "DecisionTreeRegressor",
+                    "ExtraTreeClassifier",
+                    "ExtraTreeRegressor",
+                ],
+            },
+            {
+                "title": "Exporting",
+                "autosummary": ["export_graphviz", "export_text"],
+            },
+            {
+                "title": "Plotting",
+                "autosummary": ["plot_tree"],
+            },
+        ],
+    },
+    "sklearn.utils": {
+        "short_summary": "Utilities.",
+        "description": _get_guide("developers-utils", is_developer=True),
+        "sections": [
+            {
+                "title": None,
+                "autosummary": [
+                    "Bunch",
+                    "_safe_indexing",
+                    "as_float_array",
+                    "assert_all_finite",
+                    "deprecated",
+                    "estimator_html_repr",
+                    "gen_batches",
+                    "gen_even_slices",
+                    "indexable",
+                    "murmurhash3_32",
+                    "resample",
+                    "safe_mask",
+                    "safe_sqr",
+                    "shuffle",
+                ],
+            },
+            {
+                "title": "Input and parameter validation",
+                "description": _get_submodule("sklearn.utils", "validation"),
+                "autosummary": [
+                    "check_X_y",
+                    "check_array",
+                    "check_consistent_length",
+                    "check_random_state",
+                    "check_scalar",
+                    "validation.check_is_fitted",
+                    "validation.check_memory",
+                    "validation.check_symmetric",
+                    "validation.column_or_1d",
+                    "validation.has_fit_parameter",
+                ],
+            },
+            {
+                "title": "Meta-estimators",
+                "description": _get_submodule("sklearn.utils", "metaestimators"),
+                "autosummary": ["metaestimators.available_if"],
+            },
+            {
+                "title": "Weight handling based on class labels",
+                "description": _get_submodule("sklearn.utils", "class_weight"),
+                "autosummary": [
+                    "class_weight.compute_class_weight",
+                    "class_weight.compute_sample_weight",
+                ],
+            },
+            {
+                "title": "Dealing with multiclass target in classifiers",
+                "description": _get_submodule("sklearn.utils", "multiclass"),
+                "autosummary": [
+                    "multiclass.is_multilabel",
+                    "multiclass.type_of_target",
+                    "multiclass.unique_labels",
+                ],
+            },
+            {
+                "title": "Optimal mathematical operations",
+                "description": _get_submodule("sklearn.utils", "extmath"),
+                "autosummary": [
+                    "extmath.density",
+                    "extmath.fast_logdet",
+                    "extmath.randomized_range_finder",
+                    "extmath.randomized_svd",
+                    "extmath.safe_sparse_dot",
+                    "extmath.weighted_mode",
+                ],
+            },
+            {
+                "title": "Working with sparse matrices and arrays",
+                "description": _get_submodule("sklearn.utils", "sparsefuncs"),
+                "autosummary": [
+                    "sparsefuncs.incr_mean_variance_axis",
+                    "sparsefuncs.inplace_column_scale",
+                    "sparsefuncs.inplace_csr_column_scale",
+                    "sparsefuncs.inplace_row_scale",
+                    "sparsefuncs.inplace_swap_column",
+                    "sparsefuncs.inplace_swap_row",
+                    "sparsefuncs.mean_variance_axis",
+                ],
+            },
+            {
+                "title": None,
+                "description": _get_submodule("sklearn.utils", "sparsefuncs_fast"),
+                "autosummary": [
+                    "sparsefuncs_fast.inplace_csr_row_normalize_l1",
+                    "sparsefuncs_fast.inplace_csr_row_normalize_l2",
+                ],
+            },
+            {
+                "title": "Working with graphs",
+                "description": _get_submodule("sklearn.utils", "graph"),
+                "autosummary": ["graph.single_source_shortest_path_length"],
+            },
+            {
+                "title": "Random sampling",
+                "description": _get_submodule("sklearn.utils", "random"),
+                "autosummary": ["random.sample_without_replacement"],
+            },
+            {
+                "title": "Auxiliary functions that operate on arrays",
+                "description": _get_submodule("sklearn.utils", "arrayfuncs"),
+                "autosummary": ["arrayfuncs.min_pos"],
+            },
+            {
+                "title": "Metadata routing",
+                "description": (
+                    _get_submodule("sklearn.utils", "metadata_routing")
+                    + "\n\n"
+                    + _get_guide("metadata_routing")
+                ),
+                "autosummary": [
+                    "metadata_routing.MetadataRequest",
+                    "metadata_routing.MetadataRouter",
+                    "metadata_routing.MethodMapping",
+                    "metadata_routing.get_routing_for_object",
+                    "metadata_routing.process_routing",
+                ],
+            },
+            {
+                "title": "Discovering scikit-learn objects",
+                "description": _get_submodule("sklearn.utils", "discovery"),
+                "autosummary": [
+                    "discovery.all_displays",
+                    "discovery.all_estimators",
+                    "discovery.all_functions",
+                ],
+            },
+            {
+                "title": "API compatibility checkers",
+                "description": _get_submodule("sklearn.utils", "estimator_checks"),
+                "autosummary": [
+                    "estimator_checks.check_estimator",
+                    "estimator_checks.parametrize_with_checks",
+                ],
+            },
+            {
+                "title": "Parallel computing",
+                "description": _get_submodule("sklearn.utils", "parallel"),
+                "autosummary": [
+                    "parallel.Parallel",
+                    "parallel.delayed",
+                ],
+            },
+        ],
+    },
+}
+
+
+"""
+CONFIGURING DEPRECATED_API_REFERENCE
+====================================
+
+DEPRECATED_API_REFERENCE maps each deprecation target version to a corresponding
+autosummary block. It will be placed at the bottom of the API index page under the
+"Recently deprecated" section. Essentially, the rendered section would look like the
+following:
+
+|------------------------------------------|
+|     To be removed in {{ version_1 }}     |
+|     --------------------------------     |
+|     {{ autosummary_1 }}                  |
+|                                          |
+|     To be removed in {{ version_2 }}     |
+|     --------------------------------     |
+|     {{ autosummary_2 }}                  |
+|                                          |
+|     More versions...                     |
+|------------------------------------------|
+
+Note that the autosummary here assumes that the current module is `sklearn`, i.e., if
+`sklearn.utils.Memory` is deprecated, one should put `utils.Memory` in the "entries"
+slot of the autosummary block.
+
+Example:
+
+DEPRECATED_API_REFERENCE = {
+    "0.24": [
+        "model_selection.fit_grid_point",
+        "utils.safe_indexing",
+    ],
+}
+"""
+
+DEPRECATED_API_REFERENCE = {
+    "1.7": [
+        "utils.parallel_backend",
+        "utils.register_parallel_backend",
+    ]
+}  # type: ignore
diff --git a/doc/common_pitfalls.rst b/doc/common_pitfalls.rst
index 41eb16665a612..c16385943f9ad 100644
--- a/doc/common_pitfalls.rst
+++ b/doc/common_pitfalls.rst
@@ -1,9 +1,3 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
-.. include:: includes/big_toc_css.rst
-
 .. _common_pitfalls:
 
 =========================================
@@ -414,43 +408,40 @@ it will allow the estimator RNG to vary for each fold.
     illustration purpose: what matters is what we pass to the
     :class:`~sklearn.ensemble.RandomForestClassifier` estimator.
 
-|details-start|
-**Cloning**
-|details-split|
+.. dropdown:: Cloning
 
-Another subtle side effect of passing `RandomState` instances is how
-:func:`~sklearn.base.clone` will work::
+    Another subtle side effect of passing `RandomState` instances is how
+    :func:`~sklearn.base.clone` will work::
 
-    >>> from sklearn import clone
-    >>> from sklearn.ensemble import RandomForestClassifier
-    >>> import numpy as np
+        >>> from sklearn import clone
+        >>> from sklearn.ensemble import RandomForestClassifier
+        >>> import numpy as np
+
+        >>> rng = np.random.RandomState(0)
+        >>> a = RandomForestClassifier(random_state=rng)
+        >>> b = clone(a)
+
+    Since a `RandomState` instance was passed to `a`, `a` and `b` are not clones
+    in the strict sense, but rather clones in the statistical sense: `a` and `b`
+    will still be different models, even when calling `fit(X, y)` on the same
+    data. Moreover, `a` and `b` will influence each-other since they share the
+    same internal RNG: calling `a.fit` will consume `b`'s RNG, and calling
+    `b.fit` will consume `a`'s RNG, since they are the same. This bit is true for
+    any estimators that share a `random_state` parameter; it is not specific to
+    clones.
+
+    If an integer were passed, `a` and `b` would be exact clones and they would not
+    influence each other.
+
+    .. warning::
+        Even though :func:`~sklearn.base.clone` is rarely used in user code, it is
+        called pervasively throughout scikit-learn codebase: in particular, most
+        meta-estimators that accept non-fitted estimators call
+        :func:`~sklearn.base.clone` internally
+        (:class:`~sklearn.model_selection.GridSearchCV`,
+        :class:`~sklearn.ensemble.StackingClassifier`,
+        :class:`~sklearn.calibration.CalibratedClassifierCV`, etc.).
 
-    >>> rng = np.random.RandomState(0)
-    >>> a = RandomForestClassifier(random_state=rng)
-    >>> b = clone(a)
-
-Since a `RandomState` instance was passed to `a`, `a` and `b` are not clones
-in the strict sense, but rather clones in the statistical sense: `a` and `b`
-will still be different models, even when calling `fit(X, y)` on the same
-data. Moreover, `a` and `b` will influence each-other since they share the
-same internal RNG: calling `a.fit` will consume `b`'s RNG, and calling
-`b.fit` will consume `a`'s RNG, since they are the same. This bit is true for
-any estimators that share a `random_state` parameter; it is not specific to
-clones.
-
-If an integer were passed, `a` and `b` would be exact clones and they would not
-influence each other.
-
-.. warning::
-    Even though :func:`~sklearn.base.clone` is rarely used in user code, it is
-    called pervasively throughout scikit-learn codebase: in particular, most
-    meta-estimators that accept non-fitted estimators call
-    :func:`~sklearn.base.clone` internally
-    (:class:`~sklearn.model_selection.GridSearchCV`,
-    :class:`~sklearn.ensemble.StackingClassifier`,
-    :class:`~sklearn.calibration.CalibratedClassifierCV`, etc.).
-
-|details-end|
 
 CV splitters
 ............
diff --git a/doc/computing.rst b/doc/computing.rst
index 6732b754918b0..9f166432006b2 100644
--- a/doc/computing.rst
+++ b/doc/computing.rst
@@ -1,13 +1,7 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
 ============================
 Computing with scikit-learn
 ============================
 
-.. include:: includes/big_toc_css.rst
-
 .. toctree::
     :maxdepth: 2
 
diff --git a/doc/computing/computational_performance.rst b/doc/computing/computational_performance.rst
index d6864689502c2..a7b6d3a37001e 100644
--- a/doc/computing/computational_performance.rst
+++ b/doc/computing/computational_performance.rst
@@ -1,7 +1,3 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
 .. _computational_performance:
 
 .. currentmodule:: sklearn
diff --git a/doc/computing/parallelism.rst b/doc/computing/parallelism.rst
index 53cef5603c5be..e43cb6c30cf9c 100644
--- a/doc/computing/parallelism.rst
+++ b/doc/computing/parallelism.rst
@@ -1,7 +1,3 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
 Parallelism, resource management, and configuration
 ===================================================
 
@@ -236,14 +232,12 @@ the `global_random_seed`` fixture.
 All tests that use this fixture accept the contract that they should
 deterministically pass for any seed value from 0 to 99 included.
 
-If the `SKLEARN_TESTS_GLOBAL_RANDOM_SEED` environment variable is set to
-`"any"` (which should be the case on nightly builds on the CI), the fixture
-will choose an arbitrary seed in the above range (based on the BUILD_NUMBER or
-the current day) and all fixtured tests will run for that specific seed. The
-goal is to ensure that, over time, our CI will run all tests with different
-seeds while keeping the test duration of a single run of the full test suite
-limited. This will check that the assertions of tests written to use this
-fixture are not dependent on a specific seed value.
+In nightly CI builds, the `SKLEARN_TESTS_GLOBAL_RANDOM_SEED` environment
+variable is drawn randomly in the above range and all fixtured tests will run
+for that specific seed. The goal is to ensure that, over time, our CI will run
+all tests with different seeds while keeping the test duration of a single run
+of the full test suite limited. This will check that the assertions of tests
+written to use this fixture are not dependent on a specific seed value.
 
 The range of admissible seed values is limited to [0, 99] because it is often
 not possible to write a test that can work for any possible seed and we want to
@@ -254,8 +248,6 @@ Valid values for `SKLEARN_TESTS_GLOBAL_RANDOM_SEED`:
 - `SKLEARN_TESTS_GLOBAL_RANDOM_SEED="42"`: run tests with a fixed seed of 42
 - `SKLEARN_TESTS_GLOBAL_RANDOM_SEED="40-42"`: run the tests with all seeds
   between 40 and 42 included
-- `SKLEARN_TESTS_GLOBAL_RANDOM_SEED="any"`: run the tests with an arbitrary
-  seed selected between 0 and 99 included
 - `SKLEARN_TESTS_GLOBAL_RANDOM_SEED="all"`: run the tests with all seeds
   between 0 and 99 included. This can take a long time: only use for individual
   tests, not the full test suite!
diff --git a/doc/computing/scaling_strategies.rst b/doc/computing/scaling_strategies.rst
index 143643131b0e8..286a1e79d0a8c 100644
--- a/doc/computing/scaling_strategies.rst
+++ b/doc/computing/scaling_strategies.rst
@@ -1,7 +1,3 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
 .. _scaling_strategies:
 
 Strategies to scale computationally: bigger data
diff --git a/doc/conf.py b/doc/conf.py
index 9d77fc68d0f71..9923a24260267 100644
--- a/doc/conf.py
+++ b/doc/conf.py
@@ -15,7 +15,6 @@
 import sys
 import warnings
 from datetime import datetime
-from io import StringIO
 from pathlib import Path
 
 from sklearn.externals._packaging.version import parse
@@ -25,8 +24,10 @@
 # directory, add these directories to sys.path here. If the directory
 # is relative to the documentation root, use os.path.abspath to make it
 # absolute, like shown here.
+sys.path.insert(0, os.path.abspath("."))
 sys.path.insert(0, os.path.abspath("sphinxext"))
 
+import jinja2
 import sphinx_gallery
 from github_link import make_linkcode_resolve
 from sphinx_gallery.notebook import add_code_cell, add_markdown_cell
@@ -56,14 +57,21 @@
     "sphinx.ext.intersphinx",
     "sphinx.ext.imgconverter",
     "sphinx_gallery.gen_gallery",
-    "sphinx_issues",
-    "add_toctree_functions",
     "sphinx-prompt",
     "sphinx_copybutton",
     "sphinxext.opengraph",
-    "doi_role",
-    "allow_nan_estimators",
     "matplotlib.sphinxext.plot_directive",
+    "sphinxcontrib.sass",
+    "sphinx_remove_toctrees",
+    "sphinx_design",
+    # See sphinxext/
+    "allow_nan_estimators",
+    "autoshortsummary",
+    "doi_role",
+    "dropdown_anchors",
+    "move_gallery_links",
+    "override_pst_pagetoc",
+    "sphinx_issues",
 ]
 
 # Specify how to identify the prompt when copying code snippets
@@ -96,8 +104,12 @@
 plot_html_show_formats = False
 plot_html_show_source_link = False
 
-# this is needed for some reason...
-# see https://github.com/numpy/numpydoc/issues/69
+# We do not need the table of class members because `sphinxext/override_pst_pagetoc.py`
+# will show them in the secondary sidebar
+numpydoc_show_class_members = False
+numpydoc_show_inherited_class_members = False
+
+# We want in-page toc of class members instead of a separate page for each entry
 numpydoc_class_members_toctree = False
 
 
@@ -111,8 +123,6 @@
     extensions.append("sphinx.ext.mathjax")
     mathjax_path = "https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"
 
-autodoc_default_options = {"members": True, "inherited-members": True}
-
 # Add any paths that contain templates here, relative to this directory.
 templates_path = ["templates"]
 
@@ -123,10 +133,10 @@
 source_suffix = ".rst"
 
 # The encoding of source files.
-# source_encoding = 'utf-8'
+source_encoding = "utf-8"
 
 # The main toctree document.
-root_doc = "contents"
+root_doc = "index"
 
 # General information about the project.
 project = "scikit-learn"
@@ -160,7 +170,12 @@
 
 # List of patterns, relative to source directory, that match files and
 # directories to ignore when looking for source files.
-exclude_patterns = ["_build", "templates", "includes", "themes"]
+exclude_patterns = [
+    "_build",
+    "templates",
+    "includes",
+    "**/sg_execution_times.rst",
+]
 
 # The reST default role (used for this markup: `text`) to use for all
 # documents.
@@ -177,9 +192,6 @@
 # output. They are ignored by default.
 # show_authors = False
 
-# The name of the Pygments (syntax highlighting) style to use.
-pygments_style = "sphinx"
-
 # A list of ignored prefixes for module index sorting.
 # modindex_common_prefix = []
 
@@ -188,21 +200,89 @@
 
 # The theme to use for HTML and HTML Help pages.  Major themes that come with
 # Sphinx are currently 'default' and 'sphinxdoc'.
-html_theme = "scikit-learn-modern"
+html_theme = "pydata_sphinx_theme"
 
 # Theme options are theme-specific and customize the look and feel of a theme
 # further.  For a list of options available for each theme, see the
 # documentation.
 html_theme_options = {
-    "legacy_google_analytics": True,
-    "analytics": True,
-    "mathjax_path": mathjax_path,
-    "link_to_live_contributing_page": not parsed_version.is_devrelease,
+    # -- General configuration ------------------------------------------------
+    "sidebar_includehidden": True,
+    "use_edit_page_button": True,
+    "external_links": [],
+    "icon_links_label": "Icon Links",
+    "icon_links": [
+        {
+            "name": "GitHub",
+            "url": "https://github.com/scikit-learn/scikit-learn",
+            "icon": "fa-brands fa-square-github",
+            "type": "fontawesome",
+        },
+    ],
+    "analytics": {
+        "plausible_analytics_domain": "scikit-learn.org",
+        "plausible_analytics_url": "https://views.scientific-python.org/js/script.js",
+    },
+    # If "prev-next" is included in article_footer_items, then setting show_prev_next
+    # to True would repeat prev and next links. See
+    # https://github.com/pydata/pydata-sphinx-theme/blob/b731dc230bc26a3d1d1bb039c56c977a9b3d25d8/src/pydata_sphinx_theme/theme/pydata_sphinx_theme/layout.html#L118-L129
+    "show_prev_next": False,
+    "search_bar_text": "Search the docs ...",
+    "navigation_with_keys": False,
+    "collapse_navigation": False,
+    "navigation_depth": 2,
+    "show_nav_level": 1,
+    "show_toc_level": 1,
+    "navbar_align": "left",
+    "header_links_before_dropdown": 5,
+    "header_dropdown_text": "More",
+    # The switcher requires a JSON file with the list of documentation versions, which
+    # is generated by the script `build_tools/circle/list_versions.py` and placed under
+    # the `js/` static directory; it will then be copied to the `_static` directory in
+    # the built documentation
+    "switcher": {
+        "json_url": "https://scikit-learn.org/dev/_static/versions.json",
+        "version_match": release,
+    },
+    # check_switcher may be set to False if docbuild pipeline fails. See
+    # https://pydata-sphinx-theme.readthedocs.io/en/stable/user_guide/version-dropdown.html#configure-switcher-json-url
+    "check_switcher": True,
+    "pygments_light_style": "tango",
+    "pygments_dark_style": "monokai",
+    "logo": {
+        "alt_text": "scikit-learn homepage",
+        "image_relative": "logos/scikit-learn-logo-small.png",
+        "image_light": "logos/scikit-learn-logo-small.png",
+        "image_dark": "logos/scikit-learn-logo-small.png",
+    },
+    "surface_warnings": True,
+    # -- Template placement in theme layouts ----------------------------------
+    "navbar_start": ["navbar-logo"],
+    # Note that the alignment of navbar_center is controlled by navbar_align
+    "navbar_center": ["navbar-nav"],
+    "navbar_end": ["theme-switcher", "navbar-icon-links", "version-switcher"],
+    # navbar_persistent is persistent right (even when on mobiles)
+    "navbar_persistent": ["search-button"],
+    "article_header_start": ["breadcrumbs"],
+    "article_header_end": [],
+    "article_footer_items": ["prev-next"],
+    "content_footer_items": [],
+    # Use html_sidebars that map page patterns to list of sidebar templates
+    "primary_sidebar_end": [],
+    "footer_start": ["copyright"],
+    "footer_center": [],
+    "footer_end": [],
+    # When specified as a dictionary, the keys should follow glob-style patterns, as in
+    # https://www.sphinx-doc.org/en/master/usage/configuration.html#confval-exclude_patterns
+    # In particular, "**" specifies the default for all pages
+    # Use :html_theme.sidebar_secondary.remove: for file-wide removal
+    "secondary_sidebar_items": {"**": ["page-toc", "sourcelink"]},
+    "show_version_warning_banner": True,
+    "announcement": None,
 }
 
 # Add any paths that contain custom themes here, relative to this directory.
-html_theme_path = ["themes"]
-
+# html_theme_path = ["themes"]
 
 # The name for this set of Sphinx documents.  If None, it defaults to
 # "<project> v<release> documentation".
@@ -211,10 +291,6 @@
 # A shorter title for the navigation bar.  Default is the same as html_title.
 html_short_title = "scikit-learn"
 
-# The name of an image file (relative to this directory) to place at the top
-# of the sidebar.
-html_logo = "logos/scikit-learn-logo-small.png"
-
 # The name of an image file (within the static path) to use as favicon of the
 # docs.  This file should be a Windows icon file (.ico) being 16x16 or 32x32
 # pixels large.
@@ -223,19 +299,77 @@
 # Add any paths that contain custom static files (such as style sheets) here,
 # relative to this directory. They are copied after the builtin static files,
 # so a file named "default.css" will overwrite the builtin "default.css".
-html_static_path = ["images"]
+html_static_path = ["images", "css", "js"]
 
 # If not '', a 'Last updated on:' timestamp is inserted at every page bottom,
 # using the given strftime format.
 # html_last_updated_fmt = '%b %d, %Y'
 
 # Custom sidebar templates, maps document names to template names.
-# html_sidebars = {}
+# Workaround for removing the left sidebar on pages without TOC
+# A better solution would be to follow the merge of:
+# https://github.com/pydata/pydata-sphinx-theme/pull/1682
+html_sidebars = {
+    "install": [],
+    "getting_started": [],
+    "glossary": [],
+    "faq": [],
+    "support": [],
+    "related_projects": [],
+    "roadmap": [],
+    "governance": [],
+    "about": [],
+}
 
 # Additional templates that should be rendered to pages, maps page names to
 # template names.
 html_additional_pages = {"index": "index.html"}
 
+# Additional files to copy
+# html_extra_path = []
+
+# Additional JS files
+html_js_files = [
+    "scripts/dropdown.js",
+    "scripts/version-switcher.js",
+]
+
+# Compile scss files into css files using sphinxcontrib-sass
+sass_src_dir, sass_out_dir = "scss", "css/styles"
+sass_targets = {
+    f"{file.stem}.scss": f"{file.stem}.css"
+    for file in Path(sass_src_dir).glob("*.scss")
+}
+
+# Additional CSS files, should be subset of the values of `sass_targets`
+html_css_files = ["styles/colors.css", "styles/custom.css"]
+
+
+def add_js_css_files(app, pagename, templatename, context, doctree):
+    """Load additional JS and CSS files only for certain pages.
+
+    Note that `html_js_files` and `html_css_files` are included in all pages and
+    should be used for the ones that are used by multiple pages. All page-specific
+    JS and CSS files should be added here instead.
+    """
+    if pagename == "api/index":
+        # External: jQuery and DataTables
+        app.add_js_file("https://code.jquery.com/jquery-3.7.0.js")
+        app.add_js_file("https://cdn.datatables.net/2.0.0/js/dataTables.min.js")
+        app.add_css_file(
+            "https://cdn.datatables.net/2.0.0/css/dataTables.dataTables.min.css"
+        )
+        # Internal: API search intialization and styling
+        app.add_js_file("scripts/api-search.js")
+        app.add_css_file("styles/api-search.css")
+    elif pagename == "index":
+        app.add_css_file("styles/index.css")
+    elif pagename == "install":
+        app.add_css_file("styles/install.css")
+    elif pagename.startswith("modules/generated/"):
+        app.add_css_file("styles/api.css")
+
+
 # If false, no module index is generated.
 html_domain_indices = False
 
@@ -285,6 +419,9 @@
 # redirects dictionary maps from old links to new links
 redirects = {
     "documentation": "index",
+    "contents": "index",
+    "preface": "index",
+    "modules/classes": "api/index",
     "auto_examples/feature_selection/plot_permutation_test_for_classification": (
         "auto_examples/model_selection/plot_permutation_tests_for_classification"
     ),
@@ -301,6 +438,7 @@
     "auto_examples/decomposition/plot_beta_divergence": (
         "auto_examples/applications/plot_topics_extraction_with_nmf_lda"
     ),
+    "auto_examples/svm/plot_svm_nonlinear": "auto_examples/svm/plot_svm_kernels",
     "auto_examples/ensemble/plot_adaboost_hastie_10_2": (
         "auto_examples/ensemble/plot_adaboost_multiclass"
     ),
@@ -310,36 +448,15 @@
     "auto_examples/exercises/plot_cv_digits.py": (
         "auto_examples/model_selection/plot_nested_cross_validation_iris.py"
     ),
+    "tutorial/machine_learning_map/index.html": "machine_learning_map/index.html",
 }
 html_context["redirects"] = redirects
 for old_link in redirects:
     html_additional_pages[old_link] = "redirects.html"
 
-# Not showing the search summary makes the search page load faster.
-html_show_search_summary = True
-
-
-# The "summary-anchor" IDs will be overwritten via JavaScript to be unique.
-# See `doc/theme/scikit-learn-modern/static/js/details-permalink.js`.
-rst_prolog = """
-.. |details-start| raw:: html
-
-    <details id="summary-anchor">
-    <summary class="btn btn-light">
-
-.. |details-split| raw:: html
-
-    <span class="tooltiptext">Click for more details</span>
-    <a class="headerlink" href="#summary-anchor" title="Permalink to this heading">¶</a>
-    </summary>
-    <div class="card">
+# See https://github.com/scikit-learn/scikit-learn/pull/22550
+html_context["is_devrelease"] = parsed_version.is_devrelease
 
-.. |details-end| raw:: html
-
-    </div>
-    </details>
-
-"""
 
 # -- Options for LaTeX output ------------------------------------------------
 latex_elements = {
@@ -527,14 +644,16 @@ def reset_sklearn_config(gallery_conf, fname):
     sklearn.set_config(**default_global_config)
 
 
+sg_examples_dir = "../examples"
+sg_gallery_dir = "auto_examples"
 sphinx_gallery_conf = {
     "doc_module": "sklearn",
     "backreferences_dir": os.path.join("modules", "generated"),
     "show_memory": False,
     "reference_url": {"sklearn": None},
-    "examples_dirs": ["../examples"],
-    "gallery_dirs": ["auto_examples"],
-    "subsection_order": SubSectionTitleOrder("../examples"),
+    "examples_dirs": [sg_examples_dir],
+    "gallery_dirs": [sg_gallery_dir],
+    "subsection_order": SubSectionTitleOrder(sg_examples_dir),
     "within_subsection_order": SKExampleTitleSortKey,
     "binder": {
         "org": "scikit-learn",
@@ -548,7 +667,7 @@ def reset_sklearn_config(gallery_conf, fname):
     "inspect_global_variables": False,
     "remove_config_comments": True,
     "plot_gallery": "True",
-    "recommender": {"enable": True, "n_examples": 5, "min_df": 12},
+    "recommender": {"enable": True, "n_examples": 4, "min_df": 12},
     "reset_modules": ("matplotlib", "seaborn", reset_sklearn_config),
 }
 if with_jupyterlite:
@@ -556,6 +675,26 @@ def reset_sklearn_config(gallery_conf, fname):
         "notebook_modification_function": notebook_modification_function
     }
 
+# Secondary sidebar configuration for pages generated by sphinx-gallery
+
+# For the index page of the gallery and each nested section, we hide the secondary
+# sidebar by specifying an empty list (no components), because there is no meaningful
+# in-page toc for these pages, and they are generated so "sourcelink" is not useful
+# either.
+
+# For each example page we keep default ["page-toc", "sourcelink"] specified by the
+# "**" key. "page-toc" is wanted for these pages. "sourcelink" is also necessary since
+# otherwise the secondary sidebar will degenerate when "page-toc" is empty, and the
+# script `sphinxext/move_gallery_links.py` will fail (it assumes the existence of the
+# secondary sidebar). The script will remove "sourcelink" in the end.
+
+html_theme_options["secondary_sidebar_items"][f"{sg_gallery_dir}/index"] = []
+for sub_sg_dir in (Path(".") / sg_examples_dir).iterdir():
+    if sub_sg_dir.is_dir():
+        html_theme_options["secondary_sidebar_items"][
+            f"{sg_gallery_dir}/{sub_sg_dir.name}/index"
+        ] = []
+
 
 # The following dictionary contains the information used to create the
 # thumbnails for the front page of the scikit-learn home page.
@@ -605,73 +744,6 @@ def filter_search_index(app, exception):
         f.write(searchindex_text)
 
 
-def generate_min_dependency_table(app):
-    """Generate min dependency table for docs."""
-    from sklearn._min_dependencies import dependent_packages
-
-    # get length of header
-    package_header_len = max(len(package) for package in dependent_packages) + 4
-    version_header_len = len("Minimum Version") + 4
-    tags_header_len = max(len(tags) for _, tags in dependent_packages.values()) + 4
-
-    output = StringIO()
-    output.write(
-        " ".join(
-            ["=" * package_header_len, "=" * version_header_len, "=" * tags_header_len]
-        )
-    )
-    output.write("\n")
-    dependency_title = "Dependency"
-    version_title = "Minimum Version"
-    tags_title = "Purpose"
-
-    output.write(
-        f"{dependency_title:<{package_header_len}} "
-        f"{version_title:<{version_header_len}} "
-        f"{tags_title}\n"
-    )
-
-    output.write(
-        " ".join(
-            ["=" * package_header_len, "=" * version_header_len, "=" * tags_header_len]
-        )
-    )
-    output.write("\n")
-
-    for package, (version, tags) in dependent_packages.items():
-        output.write(
-            f"{package:<{package_header_len}} {version:<{version_header_len}} {tags}\n"
-        )
-
-    output.write(
-        " ".join(
-            ["=" * package_header_len, "=" * version_header_len, "=" * tags_header_len]
-        )
-    )
-    output.write("\n")
-    output = output.getvalue()
-
-    with (Path(".") / "min_dependency_table.rst").open("w") as f:
-        f.write(output)
-
-
-def generate_min_dependency_substitutions(app):
-    """Generate min dependency substitutions for docs."""
-    from sklearn._min_dependencies import dependent_packages
-
-    output = StringIO()
-
-    for package, (version, _) in dependent_packages.items():
-        package = package.capitalize()
-        output.write(f".. |{package}MinVersion| replace:: {version}")
-        output.write("\n")
-
-    output = output.getvalue()
-
-    with (Path(".") / "min_dependency_substitutions.rst").open("w") as f:
-        f.write(output)
-
-
 # Config for sphinx_issues
 
 # we use the issues path for PRs since the issues URL will forward
@@ -687,10 +759,11 @@ def setup(app):
     # do not run the examples when using linkcheck by using a small priority
     # (default priority is 500 and sphinx-gallery using builder-inited event too)
     app.connect("builder-inited", disable_plot_gallery_for_linkcheck, priority=50)
-    app.connect("builder-inited", generate_min_dependency_table)
-    app.connect("builder-inited", generate_min_dependency_substitutions)
 
-    # to hide/show the prompt in code examples:
+    # triggered just before the HTML for an individual page is created
+    app.connect("html-page-context", add_js_css_files)
+
+    # to hide/show the prompt in code examples
     app.connect("build-finished", make_carousel_thumbs)
     app.connect("build-finished", filter_search_index)
 
@@ -795,6 +868,10 @@ def setup(app):
     "consistently-create-same-random-numpy-array/5837352#comment6712034_5837352",
 ]
 
+# Config for sphinx-remove-toctrees
+
+remove_from_toctrees = ["metadata_routing.rst"]
+
 # Use a browser-like user agent to avoid some "403 Client Error: Forbidden for
 # url" errors. This is taken from the variable navigator.userAgent inside a
 # browser console.
@@ -812,3 +889,78 @@ def setup(app):
     linkcheck_request_headers = {
         "https://github.com/": {"Authorization": f"token {github_token}"},
     }
+
+
+# -- Convert .rst.template files to .rst ---------------------------------------
+
+from api_reference import API_REFERENCE, DEPRECATED_API_REFERENCE
+
+from sklearn._min_dependencies import dependent_packages
+
+# If development build, link to local page in the top navbar; otherwise link to the
+# development version; see https://github.com/scikit-learn/scikit-learn/pull/22550
+if parsed_version.is_devrelease:
+    development_link = "developers/index"
+else:
+    development_link = "https://scikit-learn.org/dev/developers/index.html"
+
+# Define the templates and target files for conversion
+# Each entry is in the format (template name, file name, kwargs for rendering)
+rst_templates = [
+    ("index", "index", {"development_link": development_link}),
+    (
+        "min_dependency_table",
+        "min_dependency_table",
+        {"dependent_packages": dependent_packages},
+    ),
+    (
+        "min_dependency_substitutions",
+        "min_dependency_substitutions",
+        {"dependent_packages": dependent_packages},
+    ),
+    (
+        "api/index",
+        "api/index",
+        {
+            "API_REFERENCE": sorted(API_REFERENCE.items(), key=lambda x: x[0]),
+            "DEPRECATED_API_REFERENCE": sorted(
+                DEPRECATED_API_REFERENCE.items(), key=lambda x: x[0], reverse=True
+            ),
+        },
+    ),
+]
+
+# Convert each module API reference page
+for module in API_REFERENCE:
+    rst_templates.append(
+        (
+            "api/module",
+            f"api/{module}",
+            {"module": module, "module_info": API_REFERENCE[module]},
+        )
+    )
+
+# Convert the deprecated API reference page (if there exists any)
+if DEPRECATED_API_REFERENCE:
+    rst_templates.append(
+        (
+            "api/deprecated",
+            "api/deprecated",
+            {
+                "DEPRECATED_API_REFERENCE": sorted(
+                    DEPRECATED_API_REFERENCE.items(), key=lambda x: x[0], reverse=True
+                )
+            },
+        )
+    )
+
+for rst_template_name, rst_target_name, kwargs in rst_templates:
+    # Read the corresponding template file into jinja2
+    with (Path(".") / f"{rst_template_name}.rst.template").open(
+        "r", encoding="utf-8"
+    ) as f:
+        t = jinja2.Template(f.read())
+
+    # Render the template and write to the target
+    with (Path(".") / f"{rst_target_name}.rst").open("w", encoding="utf-8") as f:
+        f.write(t.render(**kwargs))
diff --git a/doc/conftest.py b/doc/conftest.py
index d66148ccc553f..f2c0eaa490665 100644
--- a/doc/conftest.py
+++ b/doc/conftest.py
@@ -10,7 +10,7 @@
 from sklearn.datasets._base import _pkl_filepath
 from sklearn.datasets._twenty_newsgroups import CACHE_NAME
 from sklearn.utils._testing import SkipTest, check_skip_network
-from sklearn.utils.fixes import _IS_PYPY, np_base_version, parse_version
+from sklearn.utils.fixes import np_base_version, parse_version, sp_version
 
 
 def setup_labeled_faces():
@@ -34,8 +34,6 @@ def setup_twenty_newsgroups():
 
 
 def setup_working_with_text_data():
-    if _IS_PYPY and os.environ.get("CI", None):
-        raise SkipTest("Skipping too slow test with PyPy on CI")
     check_skip_network()
     cache_path = _pkl_filepath(get_data_home(), CACHE_NAME)
     if not exists(cache_path):
@@ -128,10 +126,6 @@ def pytest_runtest_setup(item):
         setup_rcv1()
     elif fname.endswith("datasets/twenty_newsgroups.rst") or is_index:
         setup_twenty_newsgroups()
-    elif (
-        fname.endswith("tutorial/text_analytics/working_with_text_data.rst") or is_index
-    ):
-        setup_working_with_text_data()
     elif fname.endswith("modules/compose.rst") or is_index:
         setup_compose()
     elif fname.endswith("datasets/loading_other_datasets.rst"):
@@ -148,8 +142,6 @@ def pytest_runtest_setup(item):
     rst_files_requiring_matplotlib = [
         "modules/partial_dependence.rst",
         "modules/tree.rst",
-        "tutorial/statistical_inference/settings.rst",
-        "tutorial/statistical_inference/supervised_learning.rst",
     ]
     for each in rst_files_requiring_matplotlib:
         if fname.endswith(each):
@@ -185,6 +177,10 @@ def pytest_collection_modifyitems(config, items):
         reason = "Due to NEP 51 numpy scalar repr has changed in numpy 2"
         skip_doctests = True
 
+    if sp_version < parse_version("1.14"):
+        reason = "Scipy sparse matrix repr has changed in scipy 1.14"
+        skip_doctests = True
+
     # Normally doctest has the entire module's scope. Here we set globs to an empty dict
     # to remove the module's scope:
     # https://docs.python.org/3/library/doctest.html#what-s-the-execution-context
diff --git a/doc/contents.rst b/doc/contents.rst
deleted file mode 100644
index a28634621d558..0000000000000
--- a/doc/contents.rst
+++ /dev/null
@@ -1,24 +0,0 @@
-.. include:: includes/big_toc_css.rst
-.. include:: tune_toc.rst
-
-.. Places global toc into the sidebar
-
-:globalsidebartoc: True
-
-=================
-Table Of Contents
-=================
-
-.. Define an order for the Table of Contents:
-
-.. toctree::
-    :maxdepth: 2
-
-    preface
-    tutorial/index
-    getting_started
-    user_guide
-    glossary
-    auto_examples/index
-    modules/classes
-    developers/index
diff --git a/doc/css/.gitkeep b/doc/css/.gitkeep
new file mode 100644
index 0000000000000..e69de29bb2d1d
diff --git a/doc/data_transforms.rst b/doc/data_transforms.rst
index 084214cb094f5..536539ec97007 100644
--- a/doc/data_transforms.rst
+++ b/doc/data_transforms.rst
@@ -1,9 +1,3 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
-.. include:: includes/big_toc_css.rst
-
 .. _data-transforms:
 
 Dataset transformations
diff --git a/doc/datasets.rst b/doc/datasets.rst
index b9484a02ce84c..d381e4152990d 100644
--- a/doc/datasets.rst
+++ b/doc/datasets.rst
@@ -1,9 +1,3 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
-.. include:: includes/big_toc_css.rst
-
 .. _datasets:
 
 =========================
@@ -12,12 +6,9 @@ Dataset loading utilities
 
 .. currentmodule:: sklearn.datasets
 
-The ``sklearn.datasets`` package embeds some small toy datasets
-as introduced in the :ref:`Getting Started <loading_example_dataset>` section.
-
-This package also features helpers to fetch larger datasets commonly
-used by the machine learning community to benchmark algorithms on data
-that comes from the 'real world'.
+The ``sklearn.datasets`` package embeds some small toy datasets and provides helpers
+to fetch larger datasets commonly used by the machine learning community to benchmark
+algorithms on data that comes from the 'real world'.
 
 To evaluate the impact of the scale of the dataset (``n_samples`` and
 ``n_features``) while controlling the statistical properties of the data
diff --git a/doc/datasets/loading_other_datasets.rst b/doc/datasets/loading_other_datasets.rst
index fdd7fd1666cce..004aa66c001e5 100644
--- a/doc/datasets/loading_other_datasets.rst
+++ b/doc/datasets/loading_other_datasets.rst
@@ -1,7 +1,3 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
 .. _loading_other_datasets:
 
 Loading other datasets
@@ -37,9 +33,9 @@ and pipelines on 2D data.
   if you plan to use ``matplotlib.pyplpt.imshow``, don't forget to scale to the range
   0 - 1 as done in the following example.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_cluster_plot_color_quantization.py`
+* :ref:`sphx_glr_auto_examples_cluster_plot_color_quantization.py`
 
 .. _libsvm_loader:
 
@@ -72,11 +68,10 @@ features::
   ...     "/path/to/test_dataset.txt", n_features=X_train.shape[1])
   ...                                                         # doctest: +SKIP
 
-.. topic:: Related links:
-
- _`Public datasets in svmlight / libsvm format`: https://www.csie.ntu.edu.tw/~cjlin/libsvmtools/datasets
+.. rubric:: Related links
 
- _`Faster API-compatible implementation`: https://github.com/mblondel/svmlight-loader
+- `Public datasets in svmlight / libsvm format`: https://www.csie.ntu.edu.tw/~cjlin/libsvmtools/datasets
+- `Faster API-compatible implementation`: https://github.com/mblondel/svmlight-loader
 
 ..
     For doctests:
@@ -219,11 +214,11 @@ identifies the dataset::
   '969'
 
 
-.. topic:: References:
+.. rubric:: References
 
- * :arxiv:`Vanschoren, van Rijn, Bischl and Torgo. "OpenML: networked science in
-   machine learning" ACM SIGKDD Explorations Newsletter, 15(2), 49-60, 2014.
-   <1407.7722>`
+* :arxiv:`Vanschoren, van Rijn, Bischl and Torgo. "OpenML: networked science in
+  machine learning" ACM SIGKDD Explorations Newsletter, 15(2), 49-60, 2014.
+  <1407.7722>`
 
 .. _openml_parser:
 
diff --git a/doc/datasets/real_world.rst b/doc/datasets/real_world.rst
index 78b09e6f722b0..f05d475b0db78 100644
--- a/doc/datasets/real_world.rst
+++ b/doc/datasets/real_world.rst
@@ -1,7 +1,3 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
 .. _real_world_datasets:
 
 Real world datasets
diff --git a/doc/datasets/sample_generators.rst b/doc/datasets/sample_generators.rst
index 7dc123f08424c..5b8264c2a22b5 100644
--- a/doc/datasets/sample_generators.rst
+++ b/doc/datasets/sample_generators.rst
@@ -1,7 +1,3 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
 .. _sample_generators:
 
 Generated datasets
diff --git a/doc/datasets/toy_dataset.rst b/doc/datasets/toy_dataset.rst
index 65fd20abd361d..d7edecddd3510 100644
--- a/doc/datasets/toy_dataset.rst
+++ b/doc/datasets/toy_dataset.rst
@@ -1,7 +1,3 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
 .. _toy_datasets:
 
 Toy datasets
diff --git a/doc/developers/advanced_installation.rst b/doc/developers/advanced_installation.rst
index ed25d30601e45..bad6ccf9039ad 100644
--- a/doc/developers/advanced_installation.rst
+++ b/doc/developers/advanced_installation.rst
@@ -58,9 +58,9 @@ feature, code or documentation improvement).
    If you plan on submitting a pull-request, you should clone from your fork
    instead.
 
-#. Install a recent version of Python (3.9 is recommended at the time of writing)
-   for instance using Miniforge3_. Miniforge provides a conda-based distribution
-   of Python and the most popular scientific libraries.
+#. Install a recent version of Python (3.9 or later at the time of writing) for
+   instance using Miniforge3_. Miniforge provides a conda-based distribution of
+   Python and the most popular scientific libraries.
 
    If you installed Python with conda, we recommend to create a dedicated
    `conda environment`_ with all the build dependencies of scikit-learn
@@ -68,7 +68,7 @@ feature, code or documentation improvement).
 
    .. prompt:: bash $
 
-     conda create -n sklearn-env -c conda-forge python=3.9 numpy scipy cython meson-python ninja
+     conda create -n sklearn-env -c conda-forge python numpy scipy cython meson-python ninja
 
    It is not always necessary but it is safer to open a new prompt before
    activating the newly created conda environment.
@@ -99,6 +99,7 @@ feature, code or documentation improvement).
 
      pip install --editable . \
         --verbose --no-build-isolation \
+        --check-build-dependencies \
         --config-settings editable-verbose=true
 
 #. Check that the installed scikit-learn has a version number ending with
@@ -480,44 +481,3 @@ the base system and these steps will not be necessary.
 .. _virtualenv: https://docs.python.org/3/tutorial/venv.html
 .. _conda environment: https://docs.conda.io/projects/conda/en/latest/user-guide/tasks/manage-environments.html
 .. _Miniforge3: https://github.com/conda-forge/miniforge#miniforge3
-
-Alternative compilers
-=====================
-
-The following command will build scikit-learn using your default C/C++ compiler.
-
-.. prompt:: bash $
-
-    pip install --editable . \
-        --verbose --no-build-isolation \
-        --config-settings editable-verbose=true
-
-If you want to build scikit-learn with another compiler handled by ``setuptools``,
-use the following command:
-
-.. prompt:: bash $
-
-    python setup.py build_ext --compiler=<compiler> -i build_clib --compiler=<compiler>
-
-To see the list of available compilers run:
-
-.. prompt:: bash $
-
-    python setup.py build_ext --help-compiler
-
-If your compiler is not listed here, you can specify it through some environment
-variables (does not work on windows). This `section
-<https://setuptools.pypa.io/en/stable/userguide/ext_modules.html#compiler-and-linker-options>`_
-of the setuptools documentation explains in details which environment variables
-are used by ``setuptools``, and at which stage of the compilation, to set the
-compiler and linker options.
-
-When setting these environment variables, it is advised to first check their
-``sysconfig`` counterparts variables and adapt them to your compiler. For instance::
-
-    import sysconfig
-    print(sysconfig.get_config_var('CC'))
-    print(sysconfig.get_config_var('LDFLAGS'))
-
-In addition, since Scikit-learn uses OpenMP, you need to include the appropriate OpenMP
-flag of your compiler into the ``CFLAGS`` and ``CPPFLAGS`` environment variables.
diff --git a/doc/developers/contributing.rst b/doc/developers/contributing.rst
index 9f43d8ed52c38..ede9d44e44240 100644
--- a/doc/developers/contributing.rst
+++ b/doc/developers/contributing.rst
@@ -7,12 +7,9 @@ Contributing
 .. currentmodule:: sklearn
 
 This project is a community effort, and everyone is welcome to
-contribute.
-
-The project is hosted on https://github.com/scikit-learn/scikit-learn
-
+contribute. It is hosted on https://github.com/scikit-learn/scikit-learn.
 The decision making process and governance structure of scikit-learn is laid
-out in the governance document: :ref:`governance`.
+out in :ref:`governance`.
 
 Scikit-learn is somewhat :ref:`selective <selectiveness>` when it comes to
 adding new algorithms, and the best way to contribute and to help the project
@@ -70,10 +67,12 @@ link to it from your website, or simply star to say "I use it":
 
 .. raw:: html
 
-   <a class="github-button" href="https://github.com/scikit-learn/scikit-learn"
-   data-icon="octicon-star" data-size="large" data-show-count="true" aria-label="Star
-   scikit-learn/scikit-learn on GitHub">Star</a>
-   <script async defer src="https://buttons.github.io/buttons.js"></script>
+  <p>
+    <object
+      data="https://img.shields.io/github/stars/scikit-learn/scikit-learn?style=for-the-badge&logo=github"
+      type="image/svg+xml">
+    </object>
+  </p>
 
 In case a contribution/issue involves changes to the API principles
 or changes to dependencies or supported versions, it must be backed by a
@@ -82,31 +81,36 @@ or changes to dependencies or supported versions, it must be backed by a
 using the `SLEP template <https://scikit-learn-enhancement-proposals.readthedocs.io/en/latest/slep_template.html>`_
 and follows the decision-making process outlined in :ref:`governance`.
 
-|details-start|
-**Contributing to related projects**
-|details-split|
+.. dropdown:: Contributing to related projects
+
+  Scikit-learn thrives in an ecosystem of several related projects, which also
+  may have relevant issues to work on, including smaller projects such as:
 
-   Scikit-learn thrives in an ecosystem of several related projects, which also
-   may have relevant issues to work on, including smaller projects such as:
+  * `scikit-learn-contrib <https://github.com/search?q=org%3Ascikit-learn-contrib+is%3Aissue+is%3Aopen+sort%3Aupdated-desc&type=Issues>`__
+  * `joblib <https://github.com/joblib/joblib/issues>`__
+  * `sphinx-gallery <https://github.com/sphinx-gallery/sphinx-gallery/issues>`__
+  * `numpydoc <https://github.com/numpy/numpydoc/issues>`__
+  * `liac-arff <https://github.com/renatopp/liac-arff/issues>`__
 
-   * `scikit-learn-contrib <https://github.com/search?q=org%3Ascikit-learn-contrib+is%3Aissue+is%3Aopen+sort%3Aupdated-desc&type=Issues>`__
-   * `joblib <https://github.com/joblib/joblib/issues>`__
-   * `sphinx-gallery <https://github.com/sphinx-gallery/sphinx-gallery/issues>`__
-   * `numpydoc <https://github.com/numpy/numpydoc/issues>`__
-   * `liac-arff <https://github.com/renatopp/liac-arff/issues>`__
+  and larger projects:
 
-   and larger projects:
+  * `numpy <https://github.com/numpy/numpy/issues>`__
+  * `scipy <https://github.com/scipy/scipy/issues>`__
+  * `matplotlib <https://github.com/matplotlib/matplotlib/issues>`__
+  * and so on.
 
-   * `numpy <https://github.com/numpy/numpy/issues>`__
-   * `scipy <https://github.com/scipy/scipy/issues>`__
-   * `matplotlib <https://github.com/matplotlib/matplotlib/issues>`__
-   * and so on.
+  Look for issues marked "help wanted" or similar. Helping these projects may help
+  scikit-learn too. See also :ref:`related_projects`.
 
-   Look for issues marked "help wanted" or similar.
-   Helping these projects may help Scikit-learn too.
-   See also :ref:`related_projects`.
+Automated Contributions Policy
+==============================
+
+Please refrain from submitting issues or pull requests generated by
+fully-automated tools. Maintainers reserve the right, at their sole discretion,
+to close such submissions and to block any account responsible for them.
 
-|details-end|
+Ideally, contributions should follow from a human-to-human discussion in the
+form of an issue.
 
 Submitting a bug report or a feature request
 ============================================
@@ -139,17 +143,15 @@ following rules before submitting:
 How to make a good bug report
 -----------------------------
 
-When you submit an issue to `Github
+When you submit an issue to `GitHub
 <https://github.com/scikit-learn/scikit-learn/issues>`__, please do your best to
 follow these guidelines! This will make it a lot easier to provide you with good
 feedback:
 
 - The ideal bug report contains a :ref:`short reproducible code snippet
-  <minimal_reproducer>`, this way
-  anyone can try to reproduce the bug easily (see `this
-  <https://stackoverflow.com/help/mcve>`_ for more details). If your snippet is
-  longer than around 50 lines, please link to a `gist
-  <https://gist.github.com>`_ or a github repo.
+  <minimal_reproducer>`, this way anyone can try to reproduce the bug easily. If your
+  snippet is longer than around 50 lines, please link to a `Gist
+  <https://gist.github.com>`_ or a GitHub repo.
 
 - If not feasible to include a reproducible snippet, please be specific about
   what **estimators and/or functions are involved and the shape of the data**.
@@ -158,18 +160,18 @@ feedback:
 
 - Please include your **operating system type and version number**, as well as
   your **Python, scikit-learn, numpy, and scipy versions**. This information
-  can be found by running the following code snippet::
+  can be found by running:
+
+  .. prompt:: bash
 
-    >>> import sklearn
-    >>> sklearn.show_versions()  # doctest: +SKIP
+    python -c "import sklearn; sklearn.show_versions()"
 
 - Please ensure all **code snippets and error messages are formatted in
   appropriate code blocks**.  See `Creating and highlighting code blocks
   <https://help.github.com/articles/creating-and-highlighting-code-blocks>`_
   for more details.
 
-If you want to help curate issues, read :ref:`the following
-<bug_triaging>`.
+If you want to help curate issues, read about :ref:`bug_triaging`.
 
 Contributing code
 =================
@@ -189,6 +191,16 @@ Contributing code
   so far. In order to claim an issue for yourself, please comment exactly
   ``/take`` on it for the CI to automatically assign the issue to you.
 
+To maintain the quality of the codebase and ease the review process, any
+contribution must conform to the project's :ref:`coding guidelines
+<coding-guidelines>`, in particular:
+
+- Don't modify unrelated lines to keep the PR focused on the scope stated in its
+  description or issue.
+- Only write inline comments that add value and avoid stating the obvious: explain
+  the "why" rather than the "what".
+- **Most importantly**: Do not contribute code that you don't understand.
+
 Video resources
 ---------------
 These videos are step-by-step introductions on how to contribute to
@@ -245,7 +257,7 @@ how to set up your git repository:
 3. Clone your fork of the scikit-learn repo from your GitHub account to your
    local disk:
 
-   .. prompt:: bash $
+   .. prompt:: bash
 
       git clone git@github.com:YourLogin/scikit-learn.git  # add --depth 1 if your connection is slow
       cd scikit-learn
@@ -255,7 +267,7 @@ how to set up your git repository:
 
 5. Install the development dependencies:
 
-   .. prompt:: bash $
+   .. prompt:: bash
 
         pip install pytest pytest-cov ruff mypy numpydoc black==24.3.0
 
@@ -265,12 +277,14 @@ how to set up your git repository:
    scikit-learn repository, which you can use to keep your repository
    synchronized with the latest changes:
 
-   .. prompt:: bash $
+   .. prompt:: bash
 
         git remote add upstream git@github.com:scikit-learn/scikit-learn.git
 
 7. Check that the `upstream` and `origin` remote aliases are configured correctly
-   by running `git remote -v` which should display::
+   by running `git remote -v` which should display:
+
+   .. code-block:: text
 
         origin	git@github.com:YourLogin/scikit-learn.git (fetch)
         origin	git@github.com:YourLogin/scikit-learn.git (push)
@@ -286,7 +300,7 @@ The next steps now describe the process of modifying code and submitting a PR:
 8. Synchronize your ``main`` branch with the ``upstream/main`` branch,
    more details on `GitHub Docs <https://docs.github.com/en/github/collaborating-with-issues-and-pull-requests/syncing-a-fork>`_:
 
-   .. prompt:: bash $
+   .. prompt:: bash
 
         git checkout main
         git fetch upstream
@@ -294,7 +308,7 @@ The next steps now describe the process of modifying code and submitting a PR:
 
 9. Create a feature branch to hold your development changes:
 
-   .. prompt:: bash $
+   .. prompt:: bash
 
         git checkout -b my_feature
 
@@ -304,7 +318,7 @@ The next steps now describe the process of modifying code and submitting a PR:
 10. (**Optional**) Install `pre-commit <https://pre-commit.com/#install>`_ to
     run code style checks before each commit:
 
-    .. prompt:: bash $
+    .. prompt:: bash
 
           pip install pre-commit
           pre-commit install
@@ -316,7 +330,7 @@ The next steps now describe the process of modifying code and submitting a PR:
     do the version control. When you're done editing, add changed files using
     ``git add`` and then ``git commit``:
 
-    .. prompt:: bash $
+    .. prompt:: bash
 
         git add modified_files
         git commit
@@ -324,7 +338,7 @@ The next steps now describe the process of modifying code and submitting a PR:
     to record your changes in Git, then push the changes to your GitHub
     account with:
 
-    .. prompt:: bash $
+    .. prompt:: bash
 
        git push -u origin my_feature
 
@@ -337,7 +351,7 @@ The next steps now describe the process of modifying code and submitting a PR:
 It is often helpful to keep your local feature branch synchronized with the
 latest changes of the main scikit-learn repository:
 
-.. prompt:: bash $
+.. prompt:: bash
 
     git fetch upstream
     git merge upstream/main
@@ -347,7 +361,7 @@ Subsequently, you might need to solve the conflicts. You can refer to the
 line
 <https://help.github.com/articles/resolving-a-merge-conflict-using-the-command-line/>`_.
 
-.. topic:: Learning git:
+.. topic:: Learning Git
 
     The `Git documentation <https://git-scm.com/documentation>`_ and
     http://try.github.io are excellent resources to get started with git,
@@ -359,19 +373,18 @@ Pull request checklist
 ----------------------
 
 Before a PR can be merged, it needs to be approved by two core developers.
-Please prefix the title of your pull request with ``[MRG]`` if the
-contribution is complete and should be subjected to a detailed review. An
-incomplete contribution -- where you expect to do more work before receiving
-a full review -- should be prefixed ``[WIP]`` (to indicate a work in
-progress) and changed to ``[MRG]`` when it matures. WIPs may be useful to:
+An incomplete contribution -- where you expect to do more work before receiving
+a full review -- should be marked as a `draft pull request
+<https://docs.github.com/en/pull-requests/collaborating-with-pull-requests/proposing-changes-to-your-work-with-pull-requests/changing-the-stage-of-a-pull-request>`__
+and changed to "ready for review" when it matures. Draft PRs may be useful to:
 indicate you are working on something to avoid duplicated work, request
-broad review of functionality or API, or seek collaborators. WIPs often
+broad review of functionality or API, or seek collaborators. Draft PRs often
 benefit from the inclusion of a `task list
 <https://github.com/blog/1375-task-lists-in-gfm-issues-pulls-comments>`_ in
 the PR description.
 
 In order to ease the reviewing process, we recommend that your contribution
-complies with the following rules before marking a PR as ``[MRG]``. The
+complies with the following rules before marking a PR as "ready for review". The
 **bolded** ones are especially important:
 
 1. **Give your pull request a helpful title** that summarizes what your
@@ -418,13 +431,11 @@ complies with the following rules before marking a PR as ``[MRG]``. The
    non-regression tests should fail for the code base in the ``main`` branch
    and pass for the PR code.
 
-
 5. Follow the :ref:`coding-guidelines`.
 
-
-6. When applicable, use the validation tools and scripts in the
-   ``sklearn.utils`` submodule.  A list of utility routines available
-   for developers can be found in the :ref:`developers-utils` page.
+6. When applicable, use the validation tools and scripts in the :mod:`sklearn.utils`
+   module. A list of utility routines available for developers can be found in the
+   :ref:`developers-utils` page.
 
 7. Often pull requests resolve one or more other issues (or pull requests).
    If merging your pull request means that some other issues/PRs should
@@ -433,61 +444,59 @@ complies with the following rules before marking a PR as ``[MRG]``. The
    (e.g., ``Fixes #1234``; multiple issues/PRs are allowed as long as each
    one is preceded by a keyword). Upon merging, those issues/PRs will
    automatically be closed by GitHub. If your pull request is simply
-   related to some other issues/PRs, create a link to them without using
-   the keywords (e.g., ``See also #1234``).
+   related to some other issues/PRs, or it only partially resolves the target
+   issue, create a link to them without using the keywords (e.g., ``Towards #1234``).
 
 8. PRs should often substantiate the change, through benchmarks of
-    performance and efficiency (see :ref:`monitoring_performances`) or through
-    examples of usage. Examples also illustrate the features and intricacies of
-    the library to users. Have a look at other examples in the `examples/
-    <https://github.com/scikit-learn/scikit-learn/tree/main/examples>`_
-    directory for reference. Examples should demonstrate why the new
-    functionality is useful in practice and, if possible, compare it to other
-    methods available in scikit-learn.
+   performance and efficiency (see :ref:`monitoring_performances`) or through
+   examples of usage. Examples also illustrate the features and intricacies of
+   the library to users. Have a look at other examples in the `examples/
+   <https://github.com/scikit-learn/scikit-learn/tree/main/examples>`_
+   directory for reference. Examples should demonstrate why the new
+   functionality is useful in practice and, if possible, compare it to other
+   methods available in scikit-learn.
 
 9. New features have some maintenance overhead. We expect PR authors
-    to take part in the maintenance for the code they submit, at least
-    initially. New features need to be illustrated with narrative
-    documentation in the user guide, with small code snippets.
-    If relevant, please also add references in the literature, with PDF links
-    when possible.
+   to take part in the maintenance for the code they submit, at least
+   initially. New features need to be illustrated with narrative
+   documentation in the user guide, with small code snippets.
+   If relevant, please also add references in the literature, with PDF links
+   when possible.
 
 10. The user guide should also include expected time and space complexity
     of the algorithm and scalability, e.g. "this algorithm can scale to a
     large number of samples > 100000, but does not scale in dimensionality:
-    n_features is expected to be lower than 100".
+    `n_features` is expected to be lower than 100".
 
 You can also check our :ref:`code_review` to get an idea of what reviewers
 will expect.
 
 You can check for common programming errors with the following tools:
 
-* Code with a good unittest coverage (at least 80%, better 100%), check
-  with:
+* Code with a good unit test coverage (at least 80%, better 100%), check with:
 
-  .. prompt:: bash $
+  .. prompt:: bash
 
     pip install pytest pytest-cov
-    pytest --cov sklearn path/to/tests_for_package
+    pytest --cov sklearn path/to/tests
 
-  see also :ref:`testing_coverage`
+  See also :ref:`testing_coverage`.
 
-  Run static analysis with `mypy`:
+* Run static analysis with `mypy`:
 
-  .. prompt:: bash $
+  .. prompt:: bash
 
       mypy sklearn
 
-  must not produce new errors in your pull request. Using `# type: ignore`
+  This must not produce new errors in your pull request. Using `# type: ignore`
   annotation can be a workaround for a few cases that are not supported by
   mypy, in particular,
 
-  - when importing C or Cython modules
-  - on properties with decorators
+  - when importing C or Cython modules,
+  - on properties with decorators.
 
 Bonus points for contributions that include a performance analysis with
 a benchmark script and profiling output (see :ref:`monitoring_performances`).
-
 Also check out the :ref:`performance-howto` guide for more details on
 profiling and Cython optimizations.
 
@@ -498,7 +507,7 @@ profiling and Cython optimizations.
   on all new contributions will get the overall code base quality in the
   right direction.
 
-.. note::
+.. seealso::
 
    For two very well documented and more detailed guides on development
    workflow, please pay a visit to the `Scipy Development Workflow
@@ -529,8 +538,7 @@ Commit Message Marker  Action Taken by CI
 [cd build cirrus]      CD is run only for Cirrus CI
 [lint skip]            Azure pipeline skips linting
 [scipy-dev]            Build & test with our dependencies (numpy, scipy, etc.) development builds
-[nogil]                Build & test with the nogil experimental branches of CPython, Cython, NumPy, SciPy, ...
-[pypy]                 Build & test with PyPy
+[free-threaded]        Build & test with CPython 3.13 free-threaded
 [pyodide]              Build & test with Pyodide
 [azure parallel]       Run Azure CI jobs in parallel
 [cirrus arm]           Run Cirrus CI ARM test
@@ -550,9 +558,7 @@ Stalled pull requests
 
 As contributing a feature can be a lengthy process, some
 pull requests appear inactive but unfinished. In such a case, taking
-them over is a great service for the project.
-
-A good etiquette to take over is:
+them over is a great service for the project. A good etiquette to take over is:
 
 * **Determine if a PR is stalled**
 
@@ -619,33 +625,32 @@ the contributor become familiar with the contribution workflow, and for the core
 devs to become acquainted with the contributor; besides which, we frequently
 underestimate how easy an issue is to solve!
 
-.. topic:: good first issue tag
+- **Good first issue tag**
 
-    A great way to start contributing to scikit-learn is to pick an item from
-    the list of `good first issues
-    <https://github.com/scikit-learn/scikit-learn/labels/good%20first%20issue>`_
-    in the issue tracker. Resolving these issues allow you to start contributing
-    to the project without much prior knowledge. If you have already contributed
-    to scikit-learn, you should look at Easy issues instead.
+  A great way to start contributing to scikit-learn is to pick an item from
+  the list of `good first issues
+  <https://github.com/scikit-learn/scikit-learn/labels/good%20first%20issue>`_
+  in the issue tracker. Resolving these issues allow you to start contributing
+  to the project without much prior knowledge. If you have already contributed
+  to scikit-learn, you should look at Easy issues instead.
 
-.. topic:: Easy tag
+- **Easy tag**
 
-    If you have already contributed to scikit-learn, another great way to contribute
-    to scikit-learn is to pick an item from the list of `Easy issues
-    <https://github.com/scikit-learn/scikit-learn/labels/Easy>`_ in the issue
-    tracker. Your assistance in this area will be greatly appreciated by the
-    more experienced developers as it helps free up their time to concentrate on
-    other issues.
+  If you have already contributed to scikit-learn, another great way to contribute
+  to scikit-learn is to pick an item from the list of `Easy issues
+  <https://github.com/scikit-learn/scikit-learn/labels/Easy>`_ in the issue
+  tracker. Your assistance in this area will be greatly appreciated by the
+  more experienced developers as it helps free up their time to concentrate on
+  other issues.
 
-.. topic:: help wanted tag
+- **Help wanted tag**
 
-    We often use the help wanted tag to mark issues regardless of difficulty. Additionally,
-    we use the help wanted tag to mark Pull Requests which have been abandoned
-    by their original contributor and are available for someone to pick up where the original
-    contributor left off. The list of issues with the help wanted tag can be found
-    `here <https://github.com/scikit-learn/scikit-learn/labels/help%20wanted>`_.
-
-    Note that not all issues which need contributors will have this tag.
+  We often use the help wanted tag to mark issues regardless of difficulty.
+  Additionally, we use the help wanted tag to mark Pull Requests which have been
+  abandoned by their original contributor and are available for someone to pick up where
+  the original contributor left off. The list of issues with the help wanted tag can be
+  found `here <https://github.com/scikit-learn/scikit-learn/labels/help%20wanted>`_.
+  Note that not all issues which need contributors will have this tag.
 
 .. _contribute_documentation:
 
@@ -654,244 +659,236 @@ Documentation
 
 We are glad to accept any sort of documentation:
 
-* **function/method/class docstrings** (also known as "API documentation") -
-  these describe what the object does and details any parameters, attributes and
-  methods. Docstrings live alongside the code in
-  `sklearn/ <https://github.com/scikit-learn/scikit-learn/tree/main/sklearn>`_.
-* **user guide** - these provide more detailed information about the algorithms
+* **Function/method/class docstrings:** Also known as "API documentation", these
+  describe what the object does and details any parameters, attributes and
+  methods. Docstrings live alongside the code in `sklearn/
+  <https://github.com/scikit-learn/scikit-learn/tree/main/sklearn>`_, and are generated
+  generated according to `doc/api_reference.py
+  <https://github.com/scikit-learn/scikit-learn/blob/main/doc/api_reference.py>`_. To
+  add, update, remove, or deprecate a public API that is listed in :ref:`api_ref`, this
+  is the place to look at.
+* **User guide:** These provide more detailed information about the algorithms
   implemented in scikit-learn and generally live in the root
   `doc/ <https://github.com/scikit-learn/scikit-learn/tree/main/doc>`_ directory
   and
   `doc/modules/ <https://github.com/scikit-learn/scikit-learn/tree/main/doc/modules>`_.
-* **tutorials** - these introduce various statistical learning and machine learning
-  concepts and are located in
-  `doc/tutorial <https://github.com/scikit-learn/scikit-learn/tree/main/doc/tutorial>`_.
-* **examples** - these provide full code examples that may demonstrate the use
+* **Examples:** These provide full code examples that may demonstrate the use
   of scikit-learn modules, compare different algorithms or discuss their
-  interpretation etc. Examples live in
-  `examples/ <https://github.com/scikit-learn/scikit-learn/tree/main/examples>`_
-* **other reStructuredText documents** - provide various other
-  useful information (e.g., the :ref:`contributing` guide) and live in
+  interpretation, etc. Examples live in
+  `examples/ <https://github.com/scikit-learn/scikit-learn/tree/main/examples>`_.
+* **Other reStructuredText documents:** These provide various other useful information
+  (e.g., the :ref:`contributing` guide) and live in
   `doc/ <https://github.com/scikit-learn/scikit-learn/tree/main/doc>`_.
 
-|details-start|
-**Guidelines for writing docstrings**
-|details-split|
 
-* When documenting the parameters and attributes, here is a list of some
-  well-formatted examples::
+.. dropdown:: Guidelines for writing docstrings
 
-    n_clusters : int, default=3
-        The number of clusters detected by the algorithm.
+  * When documenting the parameters and attributes, here is a list of some
+    well-formatted examples
 
-    some_param : {'hello', 'goodbye'}, bool or int, default=True
-        The parameter description goes here, which can be either a string
-        literal (either `hello` or `goodbye`), a bool, or an int. The default
-        value is True.
+    .. code-block:: text
 
-    array_parameter : {array-like, sparse matrix} of shape (n_samples, n_features) or (n_samples,)
-        This parameter accepts data in either of the mentioned forms, with one
-        of the mentioned shapes. The default value is
-        `np.ones(shape=(n_samples,))`.
+      n_clusters : int, default=3
+          The number of clusters detected by the algorithm.
 
-    list_param : list of int
+      some_param : {"hello", "goodbye"}, bool or int, default=True
+          The parameter description goes here, which can be either a string
+          literal (either `hello` or `goodbye`), a bool, or an int. The default
+          value is True.
 
-    typed_ndarray : ndarray of shape (n_samples,), dtype=np.int32
+      array_parameter : {array-like, sparse matrix} of shape (n_samples, n_features) \
+          or (n_samples,)
+          This parameter accepts data in either of the mentioned forms, with one
+          of the mentioned shapes. The default value is `np.ones(shape=(n_samples,))`.
 
-    sample_weight : array-like of shape (n_samples,), default=None
+      list_param : list of int
 
-    multioutput_array : ndarray of shape (n_samples, n_classes) or list of such arrays
+      typed_ndarray : ndarray of shape (n_samples,), dtype=np.int32
 
-  In general have the following in mind:
+      sample_weight : array-like of shape (n_samples,), default=None
 
-  * Use Python basic types. (``bool`` instead of ``boolean``)
-  * Use parenthesis for defining shapes: ``array-like of shape (n_samples,)``
-    or ``array-like of shape (n_samples, n_features)``
-  * For strings with multiple options, use brackets: ``input: {'log',
-    'squared', 'multinomial'}``
-  * 1D or 2D data can be a subset of ``{array-like, ndarray, sparse matrix,
-    dataframe}``. Note that ``array-like`` can also be a ``list``, while
-    ``ndarray`` is explicitly only a ``numpy.ndarray``.
-  * Specify ``dataframe`` when "frame-like" features are being used, such as
-    the column names.
-  * When specifying the data type of a list, use ``of`` as a delimiter: ``list
-    of int``. When the parameter supports arrays giving details about the
-    shape and/or data type and a list of such arrays, you can use one of
-    ``array-like of shape (n_samples,) or list of such arrays``.
-  * When specifying the dtype of an ndarray, use e.g. ``dtype=np.int32`` after
-    defining the shape: ``ndarray of shape (n_samples,), dtype=np.int32``. You
-    can specify multiple dtype as a set: ``array-like of shape (n_samples,),
-    dtype={np.float64, np.float32}``. If one wants to mention arbitrary
-    precision, use `integral` and `floating` rather than the Python dtype
-    `int` and `float`. When both `int` and `floating` are supported, there is
-    no need to specify the dtype.
-  * When the default is ``None``, ``None`` only needs to be specified at the
-    end with ``default=None``. Be sure to include in the docstring, what it
-    means for the parameter or attribute to be ``None``.
+      multioutput_array : ndarray of shape (n_samples, n_classes) or list of such arrays
 
-* Add "See Also" in docstrings for related classes/functions.
+    In general have the following in mind:
 
-* "See Also" in docstrings should be one line per reference, with a colon and an
-  explanation, for example::
+    * Use Python basic types. (``bool`` instead of ``boolean``)
+    * Use parenthesis for defining shapes: ``array-like of shape (n_samples,)``
+      or ``array-like of shape (n_samples, n_features)``
+    * For strings with multiple options, use brackets: ``input: {'log',
+      'squared', 'multinomial'}``
+    * 1D or 2D data can be a subset of ``{array-like, ndarray, sparse matrix,
+      dataframe}``. Note that ``array-like`` can also be a ``list``, while
+      ``ndarray`` is explicitly only a ``numpy.ndarray``.
+    * Specify ``dataframe`` when "frame-like" features are being used, such as
+      the column names.
+    * When specifying the data type of a list, use ``of`` as a delimiter: ``list
+      of int``. When the parameter supports arrays giving details about the
+      shape and/or data type and a list of such arrays, you can use one of
+      ``array-like of shape (n_samples,) or list of such arrays``.
+    * When specifying the dtype of an ndarray, use e.g. ``dtype=np.int32`` after
+      defining the shape: ``ndarray of shape (n_samples,), dtype=np.int32``. You
+      can specify multiple dtype as a set: ``array-like of shape (n_samples,),
+      dtype={np.float64, np.float32}``. If one wants to mention arbitrary
+      precision, use `integral` and `floating` rather than the Python dtype
+      `int` and `float`. When both `int` and `floating` are supported, there is
+      no need to specify the dtype.
+    * When the default is ``None``, ``None`` only needs to be specified at the
+      end with ``default=None``. Be sure to include in the docstring, what it
+      means for the parameter or attribute to be ``None``.
 
-    See Also
-    --------
-    SelectKBest : Select features based on the k highest scores.
-    SelectFpr : Select features based on a false positive rate test.
+  * Add "See Also" in docstrings for related classes/functions.
 
-* Add one or two snippets of code in "Example" section to show how it can be used.
+  * "See Also" in docstrings should be one line per reference, with a colon and an
+    explanation, for example:
 
-|details-end|
+    .. code-block:: text
 
-|details-start|
-**Guidelines for writing the user guide and other reStructuredText documents**
-|details-split|
+      See Also
+      --------
+      SelectKBest : Select features based on the k highest scores.
+      SelectFpr : Select features based on a false positive rate test.
 
-It is important to keep a good compromise between mathematical and algorithmic
-details, and give intuition to the reader on what the algorithm does.
+  * Add one or two snippets of code in "Example" section to show how it can be used.
 
-* Begin with a concise, hand-waving explanation of what the algorithm/code does on
-  the data.
 
-* Highlight the usefulness of the feature and its recommended application.
-  Consider including the algorithm's complexity
-  (:math:`O\left(g\left(n\right)\right)`) if available, as "rules of thumb" can
-  be very machine-dependent. Only if those complexities are not available, then
-  rules of thumb may be provided instead.
+.. dropdown:: Guidelines for writing the user guide and other reStructuredText documents
 
-* Incorporate a relevant figure (generated from an example) to provide intuitions.
+  It is important to keep a good compromise between mathematical and algorithmic
+  details, and give intuition to the reader on what the algorithm does.
 
-* Include one or two short code examples to demonstrate the feature's usage.
+  * Begin with a concise, hand-waving explanation of what the algorithm/code does on
+    the data.
 
-* Introduce any necessary mathematical equations, followed by references. By
-  deferring the mathematical aspects, the documentation becomes more accessible
-  to users primarily interested in understanding the feature's practical
-  implications rather than its underlying mechanics.
+  * Highlight the usefulness of the feature and its recommended application.
+    Consider including the algorithm's complexity
+    (:math:`O\left(g\left(n\right)\right)`) if available, as "rules of thumb" can
+    be very machine-dependent. Only if those complexities are not available, then
+    rules of thumb may be provided instead.
 
-* When editing reStructuredText (``.rst``) files, try to keep line length under
-  88 characters when possible (exceptions include links and tables).
+  * Incorporate a relevant figure (generated from an example) to provide intuitions.
 
-* In scikit-learn reStructuredText files both single and double backticks
-  surrounding text will render as inline literal (often used for code, e.g.,
-  `list`). This is due to specific configurations we have set. Single
-  backticks should be used nowadays.
+  * Include one or two short code examples to demonstrate the feature's usage.
 
-* Too much information makes it difficult for users to access the content they
-  are interested in. Use dropdowns to factorize it by using the following
-  syntax::
+  * Introduce any necessary mathematical equations, followed by references. By
+    deferring the mathematical aspects, the documentation becomes more accessible
+    to users primarily interested in understanding the feature's practical
+    implications rather than its underlying mechanics.
 
-    |details-start|
-    **Dropdown title**
-    |details-split|
+  * When editing reStructuredText (``.rst``) files, try to keep line length under
+    88 characters when possible (exceptions include links and tables).
 
-    Dropdown content.
+  * In scikit-learn reStructuredText files both single and double backticks
+    surrounding text will render as inline literal (often used for code, e.g.,
+    `list`). This is due to specific configurations we have set. Single
+    backticks should be used nowadays.
 
-    |details-end|
+  * Too much information makes it difficult for users to access the content they
+    are interested in. Use dropdowns to factorize it by using the following syntax
 
-  The snippet above will result in the following dropdown:
+    .. code-block:: rst
 
-  |details-start|
-  **Dropdown title**
-  |details-split|
+      .. dropdown:: Dropdown title
 
-  Dropdown content.
+        Dropdown content.
 
-  |details-end|
+    The snippet above will result in the following dropdown:
 
-* Information that can be hidden by default using dropdowns is:
+    .. dropdown:: Dropdown title
 
-  * low hierarchy sections such as `References`, `Properties`, etc. (see for
-    instance the subsections in :ref:`det_curve`);
+      Dropdown content.
 
-  * in-depth mathematical details;
+  * Information that can be hidden by default using dropdowns is:
 
-  * narrative that is use-case specific;
+    * low hierarchy sections such as `References`, `Properties`, etc. (see for
+      instance the subsections in :ref:`det_curve`);
 
-  * in general, narrative that may only interest users that want to go beyond
-    the pragmatics of a given tool.
+    * in-depth mathematical details;
 
-* Do not use dropdowns for the low level section `Examples`, as it should stay
-  visible to all users. Make sure that the `Examples` section comes right after
-  the main discussion with the least possible folded section in-between.
+    * narrative that is use-case specific;
 
-* Be aware that dropdowns break cross-references. If that makes sense, hide the
-  reference along with the text mentioning it. Else, do not use dropdown.
+    * in general, narrative that may only interest users that want to go beyond
+      the pragmatics of a given tool.
 
-|details-end|
+  * Do not use dropdowns for the low level section `Examples`, as it should stay
+    visible to all users. Make sure that the `Examples` section comes right after
+    the main discussion with the least possible folded section in-between.
 
+  * Be aware that dropdowns break cross-references. If that makes sense, hide the
+    reference along with the text mentioning it. Else, do not use dropdown.
 
-|details-start|
-**Guidelines for writing references**
-|details-split|
 
-* When bibliographic references are available with `arxiv <https://arxiv.org/>`_
-  or `Digital Object Identifier <https://www.doi.org/>`_ identification numbers,
-  use the sphinx directives `:arxiv:` or `:doi:`. For example, see references in
-  :ref:`Spectral Clustering Graphs <spectral_clustering_graph>`.
+.. dropdown:: Guidelines for writing references
 
-* For "References" in docstrings, see the Silhouette Coefficient
-  (:func:`sklearn.metrics.silhouette_score`).
+  * When bibliographic references are available with `arxiv <https://arxiv.org/>`_
+    or `Digital Object Identifier <https://www.doi.org/>`_ identification numbers,
+    use the sphinx directives `:arxiv:` or `:doi:`. For example, see references in
+    :ref:`Spectral Clustering Graphs <spectral_clustering_graph>`.
 
-* To cross-reference to other pages in the scikit-learn documentation use the
-  reStructuredText cross-referencing syntax:
+  * For the "References" section in docstrings, see
+    :func:`sklearn.metrics.silhouette_score` as an example.
 
-  * Section - to link to an arbitrary section in the documentation, use
-    reference labels (see `Sphinx docs
-    <https://www.sphinx-doc.org/en/master/usage/restructuredtext/roles.html#ref-role>`_).
-    For example:
+  * To cross-reference to other pages in the scikit-learn documentation use the
+    reStructuredText cross-referencing syntax:
 
-    .. code-block:: rst
+    * **Section:** to link to an arbitrary section in the documentation, use
+      reference labels (see `Sphinx docs
+      <https://www.sphinx-doc.org/en/master/usage/restructuredtext/roles.html#ref-role>`_).
+      For example:
 
-        .. _my-section:
+      .. code-block:: rst
 
-        My section
-        ----------
+          .. _my-section:
 
-        This is the text of the section.
+          My section
+          ----------
 
-        To refer to itself use :ref:`my-section`.
+          This is the text of the section.
 
-    You should not modify existing sphinx reference labels as this would break
-    existing cross references and external links pointing to specific sections
-    in the scikit-learn documentation.
+          To refer to itself use :ref:`my-section`.
 
-  * Glossary - linking to a term in the :ref:`glossary`:
+      You should not modify existing sphinx reference labels as this would break
+      existing cross references and external links pointing to specific sections
+      in the scikit-learn documentation.
 
-    .. code-block:: rst
+    * **Glossary:** linking to a term in the :ref:`glossary`:
 
-        :term:`cross_validation`
+      .. code-block:: rst
 
-  * Function - to link to the documentation of a function, use the full import
-    path to the function:
+          :term:`cross_validation`
 
-    .. code-block:: rst
+    * **Function:** to link to the documentation of a function, use the full import
+      path to the function:
 
-        :func:`~sklearn.model_selection.cross_val_score`
+      .. code-block:: rst
 
-    However, if there is a `.. currentmodule::` directive above you in the document,
-    you will only need to use the path to the function succeeding the current
-    module specified. For example:
+          :func:`~sklearn.model_selection.cross_val_score`
 
-    .. code-block:: rst
+      However, if there is a `.. currentmodule::` directive above you in the document,
+      you will only need to use the path to the function succeeding the current
+      module specified. For example:
 
-        .. currentmodule:: sklearn.model_selection
+      .. code-block:: rst
 
-        :func:`cross_val_score`
+          .. currentmodule:: sklearn.model_selection
 
-  * Class - to link to documentation of a class, use the full import path to the
-    class, unless there is a 'currentmodule' directive in the document above
-    (see above):
+          :func:`cross_val_score`
 
-    .. code-block:: rst
+    * **Class:** to link to documentation of a class, use the full import path to the
+      class, unless there is a `.. currentmodule::` directive in the document above
+      (see above):
 
-        :class:`~sklearn.preprocessing.StandardScaler`
+      .. code-block:: rst
 
-|details-end|
+          :class:`~sklearn.preprocessing.StandardScaler`
 
 You can edit the documentation using any text editor, and then generate the
 HTML output by following :ref:`building_documentation`. The resulting HTML files
-will be placed in ``_build/html/stable`` and are viewable in a web browser, for
-instance by opening the local ``_build/html/stable/index.html`` file.
+will be placed in ``_build/html/`` and are viewable in a web browser, for instance by
+opening the local ``_build/html/index.html`` file or by running a local server
+
+.. prompt:: bash
+
+  python -m http.server -d _build/html
 
 
 .. _building_documentation:
@@ -902,30 +899,31 @@ Building the documentation
 **Before submitting a pull request check if your modifications have introduced
 new sphinx warnings by building the documentation locally and try to fix them.**
 
-First, make sure you have :ref:`properly installed <install_bleeding_edge>`
-the development version.
+First, make sure you have :ref:`properly installed <install_bleeding_edge>` the
+development version. On top of that, building the documentation requires installing some
+additional packages:
 
 ..
     packaging is not needed once setuptools starts shipping packaging>=17.0
 
-Building the documentation requires installing some additional packages:
-
-.. prompt:: bash $
+.. prompt:: bash
 
     pip install sphinx sphinx-gallery numpydoc matplotlib Pillow pandas \
                 polars scikit-image packaging seaborn sphinx-prompt \
-                sphinxext-opengraph sphinx-copybutton plotly pooch
+                sphinxext-opengraph sphinx-copybutton plotly pooch \
+                pydata-sphinx-theme sphinxcontrib-sass sphinx-design \
+                sphinx-remove-toctrees
 
 To build the documentation, you need to be in the ``doc`` folder:
 
-.. prompt:: bash $
+.. prompt:: bash
 
     cd doc
 
 In the vast majority of cases, you only need to generate the full web site,
 without the example gallery:
 
-.. prompt:: bash $
+.. prompt:: bash
 
     make
 
@@ -934,29 +932,27 @@ and are viewable in a web browser, for instance by opening the local
 ``_build/html/stable/index.html`` file.
 To also generate the example gallery you can use:
 
-.. prompt:: bash $
+.. prompt:: bash
 
     make html
 
-This will run all the examples, which takes a while. If you only want to
-generate a few examples, you can use:
+This will run all the examples, which takes a while. If you only want to generate a few
+examples, which is particularly useful if you are modifying only a few examples, you can
+use:
 
-.. prompt:: bash $
+.. prompt:: bash
 
     EXAMPLES_PATTERN=your_regex_goes_here make html
 
-This is particularly useful if you are modifying a few examples.
-
-Set the environment variable `NO_MATHJAX=1` if you intend to view
-the documentation in an offline setting.
-
-To build the PDF manual, run:
+Set the environment variable `NO_MATHJAX=1` if you intend to view the documentation in
+an offline setting. To build the PDF manual, run:
 
-.. prompt:: bash $
+.. prompt:: bash
 
     make latexpdf
 
-.. warning:: **Sphinx version**
+.. admonition:: Sphinx version
+   :class: warning
 
    While we do our best to have the documentation build under as many
    versions of Sphinx as possible, the different versions tend to
@@ -997,45 +993,36 @@ subpackages. For a more detailed `pytest` workflow, please refer to the
 
 We expect code coverage of new features to be at least around 90%.
 
-|details-start|
-**Writing matplotlib related tests**
-|details-split|
+.. dropdown:: Writing matplotlib-related tests
 
-Test fixtures ensure that a set of tests will be executing with the appropriate
-initialization and cleanup. The scikit-learn test suite implements a fixture
-which can be used with ``matplotlib``.
+  Test fixtures ensure that a set of tests will be executing with the appropriate
+  initialization and cleanup. The scikit-learn test suite implements a ``pyplot``
+  fixture which can be used with ``matplotlib``.
 
-``pyplot``
-    The ``pyplot`` fixture should be used when a test function is dealing with
-    ``matplotlib``. ``matplotlib`` is a soft dependency and is not required.
-    This fixture is in charge of skipping the tests if ``matplotlib`` is not
-    installed. In addition, figures created during the tests will be
-    automatically closed once the test function has been executed.
+  The ``pyplot`` fixture should be used when a test function is dealing with
+  ``matplotlib``. ``matplotlib`` is a soft dependency and is not required.
+  This fixture is in charge of skipping the tests if ``matplotlib`` is not
+  installed. In addition, figures created during the tests will be
+  automatically closed once the test function has been executed.
 
-To use this fixture in a test function, one needs to pass it as an
-argument::
+  To use this fixture in a test function, one needs to pass it as an
+  argument::
 
-    def test_requiring_mpl_fixture(pyplot):
-        # you can now safely use matplotlib
+      def test_requiring_mpl_fixture(pyplot):
+          # you can now safely use matplotlib
 
-|details-end|
+.. dropdown:: Workflow to improve test coverage
 
-|details-start|
-**Workflow to improve test coverage**
-|details-split|
+  To test code coverage, you need to install the `coverage
+  <https://pypi.org/project/coverage/>`_ package in addition to `pytest`.
 
-To test code coverage, you need to install the `coverage
-<https://pypi.org/project/coverage/>`_ package in addition to pytest.
+  1. Run `pytest --cov sklearn /path/to/tests`. The output lists for each file the line
+     numbers that are not tested.
 
-1. Run 'make test-coverage'. The output lists for each file the line
-    numbers that are not tested.
+  2. Find a low hanging fruit, looking at which lines are not tested,
+     write or adapt a test specifically for these lines.
 
-2. Find a low hanging fruit, looking at which lines are not tested,
-    write or adapt a test specifically for these lines.
-
-3. Loop.
-
-|details-end|
+  3. Loop.
 
 .. _monitoring_performances:
 
@@ -1049,8 +1036,9 @@ When proposing changes to the existing code base, it's important to make sure
 that they don't introduce performance regressions. Scikit-learn uses
 `asv benchmarks <https://github.com/airspeed-velocity/asv>`_ to monitor the
 performance of a selection of common estimators and functions. You can view
-these benchmarks on the `scikit-learn benchmark page <https://scikit-learn.org/scikit-learn-benchmarks>`_.
-The corresponding benchmark suite can be found in the `scikit-learn/asv_benchmarks` directory.
+these benchmarks on the `scikit-learn benchmark page
+<https://scikit-learn.org/scikit-learn-benchmarks>`_.
+The corresponding benchmark suite can be found in the `asv_benchmarks/` directory.
 
 To use all features of asv, you will need either `conda` or `virtualenv`. For
 more details please check the `asv installation webpage
@@ -1058,20 +1046,20 @@ more details please check the `asv installation webpage
 
 First of all you need to install the development version of asv:
 
-.. prompt:: bash $
+.. prompt:: bash
 
     pip install git+https://github.com/airspeed-velocity/asv
 
 and change your directory to `asv_benchmarks/`:
 
-.. prompt:: bash $
+.. prompt:: bash
 
-  cd asv_benchmarks/
+  cd asv_benchmarks
 
 The benchmark suite is configured to run against your local clone of
 scikit-learn. Make sure it is up to date:
 
-.. prompt:: bash $
+.. prompt:: bash
 
   git fetch upstream
 
@@ -1079,20 +1067,20 @@ In the benchmark suite, the benchmarks are organized following the same
 structure as scikit-learn. For example, you can compare the performance of a
 specific estimator between ``upstream/main`` and the branch you are working on:
 
-.. prompt:: bash $
+.. prompt:: bash
 
   asv continuous -b LogisticRegression upstream/main HEAD
 
 The command uses conda by default for creating the benchmark environments. If
 you want to use virtualenv instead, use the `-E` flag:
 
-.. prompt:: bash $
+.. prompt:: bash
 
   asv continuous -E virtualenv -b LogisticRegression upstream/main HEAD
 
 You can also specify a whole module to benchmark:
 
-.. prompt:: bash $
+.. prompt:: bash
 
   asv continuous -b linear_model upstream/main HEAD
 
@@ -1102,7 +1090,7 @@ the `-f` flag.
 
 To run the full benchmark suite, simply remove the `-b` flag :
 
-.. prompt:: bash $
+.. prompt:: bash
 
   asv continuous upstream/main HEAD
 
@@ -1112,14 +1100,14 @@ expression for a more complex subset of benchmarks to run.
 To run the benchmarks without comparing to another branch, use the `run`
 command:
 
-.. prompt:: bash $
+.. prompt:: bash
 
   asv run -b linear_model HEAD^!
 
 You can also run the benchmark suite using the version of scikit-learn already
 installed in your current Python environment:
 
-.. prompt:: bash $
+.. prompt:: bash
 
   asv run --python=same
 
@@ -1128,20 +1116,20 @@ avoid creating a new environment each time you run the benchmarks. By default
 the results are not saved when using an existing installation. To save the
 results you must specify a commit hash:
 
-.. prompt:: bash $
+.. prompt:: bash
 
   asv run --python=same --set-commit-hash=<commit hash>
 
 Benchmarks are saved and organized by machine, environment and commit. To see
 the list of all saved benchmarks:
 
-.. prompt:: bash $
+.. prompt:: bash
 
   asv show
 
 and to see the report of a specific run:
 
-.. prompt:: bash $
+.. prompt:: bash
 
   asv show <commit hash>
 
@@ -1164,11 +1152,11 @@ All issues and pull requests on the
 `GitHub issue tracker <https://github.com/scikit-learn/scikit-learn/issues>`_
 should have (at least) one of the following tags:
 
-:Bug / Crash:
+:Bug:
     Something is happening that clearly shouldn't happen.
     Wrong results as well as unexpected errors from estimators go here.
 
-:Cleanup / Enhancement:
+:Enhancement:
     Improving performance, usability, consistency.
 
 :Documentation:
@@ -1179,7 +1167,7 @@ should have (at least) one of the following tags:
 
 There are four other tags to help new contributors:
 
-:good first issue:
+:Good first issue:
     This issue is ideal for a first contribution to scikit-learn. Ask for help
     if the formulation is unclear. If you have already contributed to
     scikit-learn, look at Easy issues instead.
@@ -1191,7 +1179,7 @@ There are four other tags to help new contributors:
     Might need some knowledge of machine learning or the package,
     but is still approachable for someone new to the project.
 
-:help wanted:
+:Help wanted:
     This tag marks an issue which currently lacks a contributor or a
     PR that needs another contributor to take over the work. These
     issues can range in difficulty, and may not be approachable
@@ -1208,12 +1196,15 @@ Maintaining backwards compatibility
 Deprecation
 -----------
 
-If any publicly accessible method, function, attribute or parameter
-is renamed, we still support the old one for two releases and issue
-a deprecation warning when it is called/passed/accessed.
-E.g., if the function ``zero_one`` is renamed to ``zero_one_loss``,
-we add the decorator ``deprecated`` (from ``sklearn.utils``)
-to ``zero_one`` and call ``zero_one_loss`` from that function::
+If any publicly accessible class, function, method, attribute or parameter is renamed,
+we still support the old one for two releases and issue a deprecation warning when it is
+called, passed, or accessed.
+
+.. rubric:: Deprecating a class or a function
+
+Suppose the function ``zero_one`` is renamed to ``zero_one_loss``, we add the decorator
+:class:`utils.deprecated` to ``zero_one`` and call ``zero_one_loss`` from that
+function::
 
     from ..utils import deprecated
 
@@ -1221,36 +1212,47 @@ to ``zero_one`` and call ``zero_one_loss`` from that function::
         # actual implementation
         pass
 
-    @deprecated("Function 'zero_one' was renamed to 'zero_one_loss' "
-                "in version 0.13 and will be removed in release 0.15. "
-                "Default behavior is changed from 'normalize=False' to "
-                "'normalize=True'")
+    @deprecated(
+        "Function `zero_one` was renamed to `zero_one_loss` in 0.13 and will be "
+        "removed in 0.15. Default behavior is changed from `normalize=False` to "
+        "`normalize=True`"
+    )
     def zero_one(y_true, y_pred, normalize=False):
         return zero_one_loss(y_true, y_pred, normalize)
 
-If an attribute is to be deprecated,
-use the decorator ``deprecated`` on a property. Please note that the
-``deprecated`` decorator should be placed before the ``property``
-decorator for the docstrings to be rendered properly.
-E.g., renaming an attribute ``labels_`` to ``classes_`` can be done as::
+One also needs to move ``zero_one`` from ``API_REFERENCE`` to
+``DEPRECATED_API_REFERENCE`` and add ``zero_one_loss`` to ``API_REFERENCE`` in the
+``doc/api_reference.py`` file to reflect the changes in :ref:`api_ref`.
+
+.. rubric:: Deprecating an attribute or a method
 
-    @deprecated("Attribute `labels_` was deprecated in version 0.13 and "
-                "will be removed in 0.15. Use `classes_` instead")
+If an attribute or a method is to be deprecated, use the decorator
+:class:`~utils.deprecated` on the property. Please note that the
+:class:`~utils.deprecated` decorator should be placed before the ``property`` decorator
+if there is one, so that the docstrings can be rendered properly. For instance, renaming
+an attribute ``labels_`` to ``classes_`` can be done as::
+
+    @deprecated(
+        "Attribute `labels_` was deprecated in 0.13 and will be removed in 0.15. Use "
+        "`classes_` instead"
+    )
     @property
     def labels_(self):
         return self.classes_
 
-If a parameter has to be deprecated, a ``FutureWarning`` warning
-must be raised too.
-In the following example, k is deprecated and renamed to n_clusters::
+.. rubric:: Deprecating a parameter
+
+If a parameter has to be deprecated, a ``FutureWarning`` warning must be raised
+manually. In the following example, ``k`` is deprecated and renamed to n_clusters::
 
     import warnings
 
-    def example_function(n_clusters=8, k='deprecated'):
-        if k != 'deprecated':
-            warnings.warn("'k' was renamed to n_clusters in version 0.13 and "
-                          "will be removed in 0.15.",
-                          FutureWarning)
+    def example_function(n_clusters=8, k="deprecated"):
+        if k != "deprecated":
+            warnings.warn(
+                "`k` was renamed to `n_clusters` in 0.13 and will be removed in 0.15",
+                FutureWarning,
+            )
             n_clusters = k
 
 When the change is in a class, we validate and raise warning in ``fit``::
@@ -1263,10 +1265,11 @@ When the change is in a class, we validate and raise warning in ``fit``::
           self.k = k
 
       def fit(self, X, y):
-          if self.k != 'deprecated':
-              warnings.warn("'k' was renamed to n_clusters in version 0.13 and "
-                            "will be removed in 0.15.",
-                            FutureWarning)
+          if self.k != "deprecated":
+              warnings.warn(
+                  "`k` was renamed to `n_clusters` in 0.13 and will be removed in 0.15.",
+                  FutureWarning,
+              )
               self._n_clusters = self.k
           else:
               self._n_clusters = self.n_clusters
@@ -1280,9 +1283,14 @@ adapt their code to the new behaviour. For example, if the deprecation happened
 in version 0.18-dev, the message should say it happened in version 0.18
 and the old behavior will be removed in version 0.20.
 
+The warning message should also include a brief explanation of the change and point
+users to an alternative.
+
 In addition, a deprecation note should be added in the docstring, recalling the
 same information as the deprecation warning as explained above. Use the
-``.. deprecated::`` directive::
+``.. deprecated::`` directive:
+
+.. code-block:: rst
 
   .. deprecated:: 0.13
      ``k`` was renamed to ``n_clusters`` in version 0.13 and will be removed
@@ -1298,7 +1306,7 @@ Change the default value of a parameter
 ---------------------------------------
 
 If the default value of a parameter needs to be changed, please replace the
-default value with a specific value (e.g., ``warn``) and raise
+default value with a specific value (e.g., ``"warn"``) and raise
 ``FutureWarning`` when users are using the default value. The following
 example assumes that the current version is 0.20 and that we change the
 default value of ``n_clusters`` from 5 (old default for 0.20) to 10
@@ -1306,10 +1314,12 @@ default value of ``n_clusters`` from 5 (old default for 0.20) to 10
 
     import warnings
 
-    def example_function(n_clusters='warn'):
-        if n_clusters == 'warn':
-            warnings.warn("The default value of n_clusters will change from "
-                          "5 to 10 in 0.22.", FutureWarning)
+    def example_function(n_clusters="warn"):
+        if n_clusters == "warn":
+            warnings.warn(
+                "The default value of `n_clusters` will change from 5 to 10 in 0.22.",
+                FutureWarning,
+            )
             n_clusters = 5
 
 When the change is in a class, we validate and raise warning in ``fit``::
@@ -1317,22 +1327,26 @@ When the change is in a class, we validate and raise warning in ``fit``::
   import warnings
 
   class ExampleEstimator:
-      def __init__(self, n_clusters='warn'):
+      def __init__(self, n_clusters="warn"):
           self.n_clusters = n_clusters
 
       def fit(self, X, y):
-          if self.n_clusters == 'warn':
-            warnings.warn("The default value of n_clusters will change from "
-                          "5 to 10 in 0.22.", FutureWarning)
-            self._n_clusters = 5
+          if self.n_clusters == "warn":
+              warnings.warn(
+                  "The default value of `n_clusters` will change from 5 to 10 in 0.22.",
+                  FutureWarning,
+              )
+              self._n_clusters = 5
 
 Similar to deprecations, the warning message should always give both the
 version in which the change happened and the version in which the old behavior
 will be removed.
 
 The parameter description in the docstring needs to be updated accordingly by adding
-a `versionchanged` directive with the old and new default value, pointing to the
-version when the change will be effective::
+a ``versionchanged`` directive with the old and new default value, pointing to the
+version when the change will be effective:
+
+.. code-block:: rst
 
     .. versionchanged:: 0.22
        The default value for `n_clusters` will change from 5 to 10 in version 0.22.
@@ -1342,12 +1356,11 @@ not in other cases. The warning should be caught in all other tests
 (using e.g., ``@pytest.mark.filterwarnings``), and there should be no warning
 in the examples.
 
-.. currentmodule:: sklearn
-
 .. _code_review:
 
 Code Review Guidelines
 ======================
+
 Reviewing code contributed to the project as PRs is a crucial component of
 scikit-learn development. We encourage anyone to start reviewing code of other
 developers. The code review process is often highly educational for everybody
@@ -1365,95 +1378,87 @@ up this process by providing your feedback.
   retraction. Regarding docs: typos, grammar issues and disambiguations are
   better addressed immediately.
 
-|details-start|
-**Important aspects to be covered in any code review**
-|details-split|
+.. dropdown:: Important aspects to be covered in any code review
 
-Here are a few important aspects that need to be covered in any code review,
-from high-level questions to a more detailed check-list.
+  Here are a few important aspects that need to be covered in any code review,
+  from high-level questions to a more detailed check-list.
 
-- Do we want this in the library? Is it likely to be used? Do you, as
-  a scikit-learn user, like the change and intend to use it? Is it in
-  the scope of scikit-learn? Will the cost of maintaining a new
-  feature be worth its benefits?
+  - Do we want this in the library? Is it likely to be used? Do you, as
+    a scikit-learn user, like the change and intend to use it? Is it in
+    the scope of scikit-learn? Will the cost of maintaining a new
+    feature be worth its benefits?
 
-- Is the code consistent with the API of scikit-learn? Are public
-  functions/classes/parameters well named and intuitively designed?
+  - Is the code consistent with the API of scikit-learn? Are public
+    functions/classes/parameters well named and intuitively designed?
 
-- Are all public functions/classes and their parameters, return types, and
-  stored attributes named according to scikit-learn conventions and documented clearly?
+  - Are all public functions/classes and their parameters, return types, and
+    stored attributes named according to scikit-learn conventions and documented clearly?
 
-- Is any new functionality described in the user-guide and illustrated with examples?
+  - Is any new functionality described in the user-guide and illustrated with examples?
 
-- Is every public function/class tested? Are a reasonable set of
-  parameters, their values, value types, and combinations tested? Do
-  the tests validate that the code is correct, i.e. doing what the
-  documentation says it does? If the change is a bug-fix, is a
-  non-regression test included? Look at `this
-  <https://jeffknupp.com/blog/2013/12/09/improve-your-python-understanding-unit-testing>`__
-  to get started with testing in Python.
+  - Is every public function/class tested? Are a reasonable set of
+    parameters, their values, value types, and combinations tested? Do
+    the tests validate that the code is correct, i.e. doing what the
+    documentation says it does? If the change is a bug-fix, is a
+    non-regression test included? Look at `this
+    <https://jeffknupp.com/blog/2013/12/09/improve-your-python-understanding-unit-testing>`__
+    to get started with testing in Python.
 
-- Do the tests pass in the continuous integration build? If
-  appropriate, help the contributor understand why tests failed.
+  - Do the tests pass in the continuous integration build? If
+    appropriate, help the contributor understand why tests failed.
 
-- Do the tests cover every line of code (see the coverage report in the build
-  log)? If not, are the lines missing coverage good exceptions?
+  - Do the tests cover every line of code (see the coverage report in the build
+    log)? If not, are the lines missing coverage good exceptions?
 
-- Is the code easy to read and low on redundancy? Should variable names be
-  improved for clarity or consistency? Should comments be added? Should comments
-  be removed as unhelpful or extraneous?
+  - Is the code easy to read and low on redundancy? Should variable names be
+    improved for clarity or consistency? Should comments be added? Should comments
+    be removed as unhelpful or extraneous?
 
-- Could the code easily be rewritten to run much more efficiently for
-  relevant settings?
+  - Could the code easily be rewritten to run much more efficiently for
+    relevant settings?
 
-- Is the code backwards compatible with previous versions? (or is a
-  deprecation cycle necessary?)
+  - Is the code backwards compatible with previous versions? (or is a
+    deprecation cycle necessary?)
 
-- Will the new code add any dependencies on other libraries? (this is
-  unlikely to be accepted)
+  - Will the new code add any dependencies on other libraries? (this is
+    unlikely to be accepted)
 
-- Does the documentation render properly (see the
-  :ref:`contribute_documentation` section for more details), and are the plots
-  instructive?
+  - Does the documentation render properly (see the
+    :ref:`contribute_documentation` section for more details), and are the plots
+    instructive?
 
-:ref:`saved_replies` includes some frequent comments that reviewers may make.
-
-|details-end|
+  :ref:`saved_replies` includes some frequent comments that reviewers may make.
 
 .. _communication:
 
-|details-start|
-**Communication Guidelines**
-|details-split|
-
-Reviewing open pull requests (PRs) helps move the project forward. It is a
-great way to get familiar with the codebase and should motivate the
-contributor to keep involved in the project. [1]_
+.. dropdown:: Communication Guidelines
 
-- Every PR, good or bad, is an act of generosity. Opening with a positive
-  comment will help the author feel rewarded, and your subsequent remarks may
-  be heard more clearly. You may feel good also.
-- Begin if possible with the large issues, so the author knows they've been
-  understood. Resist the temptation to immediately go line by line, or to open
-  with small pervasive issues.
-- Do not let perfect be the enemy of the good. If you find yourself making
-  many small suggestions that don't fall into the :ref:`code_review`, consider
-  the following approaches:
+  Reviewing open pull requests (PRs) helps move the project forward. It is a
+  great way to get familiar with the codebase and should motivate the
+  contributor to keep involved in the project. [1]_
 
-  - refrain from submitting these;
-  - prefix them as "Nit" so that the contributor knows it's OK not to address;
-  - follow up in a subsequent PR, out of courtesy, you may want to let the
-    original contributor know.
+  - Every PR, good or bad, is an act of generosity. Opening with a positive
+    comment will help the author feel rewarded, and your subsequent remarks may
+    be heard more clearly. You may feel good also.
+  - Begin if possible with the large issues, so the author knows they've been
+    understood. Resist the temptation to immediately go line by line, or to open
+    with small pervasive issues.
+  - Do not let perfect be the enemy of the good. If you find yourself making
+    many small suggestions that don't fall into the :ref:`code_review`, consider
+    the following approaches:
 
-- Do not rush, take the time to make your comments clear and justify your
-  suggestions.
-- You are the face of the project. Bad days occur to everyone, in that
-  occasion you deserve a break: try to take your time and stay offline.
+    - refrain from submitting these;
+    - prefix them as "Nit" so that the contributor knows it's OK not to address;
+    - follow up in a subsequent PR, out of courtesy, you may want to let the
+      original contributor know.
 
-.. [1] Adapted from the numpy `communication guidelines
-       <https://numpy.org/devdocs/dev/reviewer_guidelines.html#communication-guidelines>`_.
+  - Do not rush, take the time to make your comments clear and justify your
+    suggestions.
+  - You are the face of the project. Bad days occur to everyone, in that
+    occasion you deserve a break: try to take your time and stay offline.
 
-|details-end|
+  .. [1] Adapted from the numpy `communication guidelines
+        <https://numpy.org/devdocs/dev/reviewer_guidelines.html#communication-guidelines>`_.
 
 Reading the existing code base
 ==============================
@@ -1474,9 +1479,9 @@ make this task easier and faster (in no particular order).
   relevant, and which are not. In scikit-learn **a lot** of input checking
   is performed, especially at the beginning of the :term:`fit` methods.
   Sometimes, only a very small portion of the code is doing the actual job.
-  For example looking at the ``fit()`` method of
+  For example looking at the :meth:`~linear_model.LinearRegression.fit` method of
   :class:`~linear_model.LinearRegression`, what you're looking for
-  might just be the call the ``scipy.linalg.lstsq``, but it is buried into
+  might just be the call the :func:`scipy.linalg.lstsq`, but it is buried into
   multiple lines of input checking and the handling of different kinds of
   parameters.
 - Due to the use of `Inheritance
@@ -1506,7 +1511,7 @@ make this task easier and faster (in no particular order).
     IDE goes a long way towards digesting the code base. Being able to quickly
     jump (or *peek*) to a function/class/attribute definition helps a lot.
     So does being able to quickly see where a given name is used in a file.
-  - `git <https://git-scm.com/book/en>`_ also has some built-in killer
+  - `Git <https://git-scm.com/book/en>`_ also has some built-in killer
     features. It is often useful to understand how a file changed over time,
     using e.g. ``git blame`` (`manual
     <https://git-scm.com/docs/git-blame>`_). This can also be done directly
@@ -1518,7 +1523,7 @@ make this task easier and faster (in no particular order).
 - Configure `git blame` to ignore the commit that migrated the code style to
   `black`.
 
-  .. prompt:: bash $
+  .. prompt:: bash
 
       git config blame.ignoreRevsFile .git-blame-ignore-revs
 
diff --git a/doc/developers/cython.rst b/doc/developers/cython.rst
index e98501879d50e..20cafd243f85b 100644
--- a/doc/developers/cython.rst
+++ b/doc/developers/cython.rst
@@ -97,8 +97,6 @@ Tips for performance
 
 * Inline methods and function when it makes sense
 
-* Make sure your Cython compilation units `use NumPy recent C API <https://github.com/scikit-learn/scikit-learn/blob/62a017efa047e9581ae7df8bbaa62cf4c0544ee4/setup.py#L64-L70>`_.
-
 * In doubt, read the generated C or C++ code if you can: "The fewer C instructions and indirections
   for a line of Cython code, the better" is a good rule of thumb.
 
@@ -141,3 +139,16 @@ must be ``cimported`` from this module and not from the OpenMP library directly:
 
 The parallel loop, `prange`, is already protected by cython and can be used directly
 from `cython.parallel`.
+
+Types
+~~~~~
+
+Cython code requires to use explicit types. This is one of the reasons you get a
+performance boost. In order to avoid code duplication, we have a central place
+for the most used types in
+`sklearn/utils/_typedefs.pyd <https://github.com/scikit-learn/scikit-learn/blob/main/sklearn/utils/_typedefs.pyd>`_.
+Ideally you start by having a look there and `cimport` types you need, for example
+
+.. code-block:: cython
+
+    from sklear.utils._typedefs cimport float32, float64
diff --git a/doc/developers/develop.rst b/doc/developers/develop.rst
index f22c217203ac2..97cb156da5812 100644
--- a/doc/developers/develop.rst
+++ b/doc/developers/develop.rst
@@ -54,7 +54,7 @@ multiple interfaces):
 
 :Transformer:
 
-    For modifying the data in a supervised or unsupervised way (e.g. by adding, changing, 
+    For modifying the data in a supervised or unsupervised way (e.g. by adding, changing,
     or removing columns, but not by adding or removing rows). Implements::
 
       new_data = transformer.transform(data)
@@ -282,12 +282,16 @@ the correct interface more easily.
     in the scikit-learn-contrib
     `project template <https://github.com/scikit-learn-contrib/project-template/blob/master/skltemplate/_template.py>`__.
 
+    It is particularly important to notice that mixins should be "on the left" while
+    the ``BaseEstimator`` should be "on the right" in the inheritance list for proper
+    MRO.
+
       >>> import numpy as np
       >>> from sklearn.base import BaseEstimator, ClassifierMixin
       >>> from sklearn.utils.validation import check_X_y, check_array, check_is_fitted
       >>> from sklearn.utils.multiclass import unique_labels
       >>> from sklearn.metrics import euclidean_distances
-      >>> class TemplateClassifier(BaseEstimator, ClassifierMixin):
+      >>> class TemplateClassifier(ClassifierMixin, BaseEstimator):
       ...
       ...     def __init__(self, demo_param='demo'):
       ...         self.demo_param = demo_param
@@ -349,7 +353,7 @@ The parameter `deep` will control whether or not the parameters of the
     subestimator__intercept_scaling -> 1
     subestimator__l1_ratio -> None
     subestimator__max_iter -> 100
-    subestimator__multi_class -> auto
+    subestimator__multi_class -> deprecated
     subestimator__n_jobs -> None
     subestimator__penalty -> l2
     subestimator__random_state -> None
diff --git a/doc/developers/index.rst b/doc/developers/index.rst
index c2cc35928cbf9..cca77b6a015c9 100644
--- a/doc/developers/index.rst
+++ b/doc/developers/index.rst
@@ -1,16 +1,9 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
 .. _developers_guide:
 
 =================
 Developer's Guide
 =================
 
-.. include:: ../includes/big_toc_css.rst
-.. include:: ../tune_toc.rst
-
 .. toctree::
 
    contributing
diff --git a/doc/developers/maintainer.rst b/doc/developers/maintainer.rst
index e82a7993997b2..c38da4c68dcd1 100644
--- a/doc/developers/maintainer.rst
+++ b/doc/developers/maintainer.rst
@@ -1,6 +1,5 @@
-Maintainer / core-developer information
-========================================
-
+Maintainer/Core-Developer Information
+======================================
 
 Releasing
 ---------
@@ -105,14 +104,13 @@ in the description of the Pull Request to track progress.
 This PR will be used to push commits related to the release as explained in
 :ref:`making_a_release`.
 
-You can also create a second PR from main and targeting main to increment
-the ``__version__`` variable in `sklearn/__init__.py` to increment the dev
-version. This means while we're in the release candidate period, the latest
-stable is two versions behind the main branch, instead of one. In this PR
-targeting main you should also include a new file for the matching version
-under the ``doc/whats_new/`` folder so PRs that target the next version can
-contribute their changelog entries to this file in parallel to the release
-process.
+You can also create a second PR from main and targeting main to increment the
+``__version__`` variable in `sklearn/__init__.py` to increment the dev version.
+This means while we're in the release candidate period, the latest stable is
+two versions behind the main branch, instead of one. In this PR targeting main
+you should also include a new file for the matching version under the
+``doc/whats_new/`` folder so PRs that target the next version can contribute
+their changelog entries to this file in parallel to the release process.
 
 Minor version release (also known as bug-fix release)
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
@@ -212,8 +210,8 @@ Making a release
      the old entries (two years or three releases are typically good
      enough) and to update the on-going development entry.
 
-2. On the branch for releasing, update the version number in
-   ``sklearn/__init__.py``, the ``__version__``.
+2. On the branch for releasing, update the version number in ``sklearn/__init__.py``,
+   the ``__version__`` variable.
 
    For major releases, please add a 0 at the end: `0.99.0` instead of `0.99`.
 
diff --git a/doc/developers/performance.rst b/doc/developers/performance.rst
index 42687945a2bba..1565570bcdb28 100644
--- a/doc/developers/performance.rst
+++ b/doc/developers/performance.rst
@@ -72,20 +72,6 @@ following:
    parallelism** that is amenable to **multi-processing** by using the
    ``joblib.Parallel`` class.
 
-When using Cython, use either
-
-.. prompt:: bash $
-
-  python setup.py build_ext -i
-  python setup.py install
-
-to generate C files. You are responsible for adding .c/.cpp extensions along
-with build parameters in each submodule ``setup.py``.
-
-C/C++ generated files are embedded in distributed stable packages. The goal is
-to make it possible to install scikit-learn stable version
-on any machine with Python, Numpy, Scipy and C/C++ compiler.
-
 .. _profiling-python-code:
 
 Profiling Python code
diff --git a/doc/developers/tips.rst b/doc/developers/tips.rst
index 3dbc35cec68d0..1c6ea5ba6f6f4 100644
--- a/doc/developers/tips.rst
+++ b/doc/developers/tips.rst
@@ -242,6 +242,57 @@ PR: Don't change unrelated
 
     Please do not change unrelated lines. It makes your contribution harder to review and may introduce merge conflicts to other pull requests.
 
+.. _debugging_ci_issues:
+
+Debugging CI issues
+-------------------
+
+CI issues may arise for a variety of reasons, so this is by no means a
+comprehensive guide, but rather a list of useful tips and tricks.
+
+Using a lock-file to get an environment close to the CI
++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+
+`conda-lock` can be used to create a conda environment with the exact same
+conda and pip packages as on the CI. For example, the following command will
+create a conda environment named `scikit-learn-doc` that is similar to the CI:
+
+.. prompt:: bash $
+
+    conda-lock install -n scikit-learn-doc build_tools/circle/doc_linux-64_conda.lock
+
+.. note::
+
+    It only works if you have the same OS as the CI build (check `platform:` in
+    the lock-file). For example, the previous command will only work if you are
+    on a Linux machine. Also this may not allow you to reproduce some of the
+    issues that are more tied to the particularities of the CI environment, for
+    example CPU architecture reported by OpenBLAS in `sklearn.show_versions()`.
+
+If you don't have the same OS as the CI build you can still create a conda
+environment from the right environment yaml file, although it won't be as close
+as the CI environment as using the associated lock-file. For example for the
+doc build:
+
+.. prompt:: bash $
+
+    conda env create -n scikit-learn-doc -f build_tools/circle/doc_environment.yml -y
+
+This may not give you exactly the same package versions as in the CI for a
+variety of reasons, for example:
+
+- some packages may have had new releases between the time the lock files were
+  last updated in the `main` branch and the time you run the `conda create`
+  command. You can always try to look at the version in the lock-file and
+  specify the versions by hand for some specific packages that you think would
+  help reproducing the issue.
+- different packages may be installed by default depending on the OS. For
+  example, the default BLAS library when installing numpy is OpenBLAS on Linux
+  and MKL on Windows.
+
+Also the problem may be OS specific so the only way to be able to reproduce
+would be to have the same OS as the CI build.
+
 .. highlight:: default
 
 Debugging memory errors in Cython with valgrind
diff --git a/doc/dispatching.rst b/doc/dispatching.rst
index d42fdcc86f9e8..101e493ee96b7 100644
--- a/doc/dispatching.rst
+++ b/doc/dispatching.rst
@@ -1,9 +1,3 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
-.. include:: includes/big_toc_css.rst
-
 ===========
 Dispatching
 ===========
diff --git a/doc/faq.rst b/doc/faq.rst
index 8ddf0c4c238f6..4026c997c9425 100644
--- a/doc/faq.rst
+++ b/doc/faq.rst
@@ -1,3 +1,32 @@
+.. raw:: html
+
+  <style>
+    /* h3 headings on this page are the questions; make them rubric-like */
+    h3 {
+      font-size: 1rem;
+      font-weight: bold;
+      padding-bottom: 0.2rem;
+      margin: 2rem 0 1.15rem 0;
+      border-bottom: 1px solid var(--pst-color-border);
+    }
+
+    /* Increase top margin for first question in each section */
+    h2 + section > h3 {
+      margin-top: 2.5rem;
+    }
+
+    /* Make the headerlinks a bit more visible */
+    h3 > a.headerlink {
+      font-size: 0.9rem;
+    }
+
+    /* Remove the backlink decoration on the titles */
+    h2 > a.toc-backref,
+    h3 > a.toc-backref {
+      text-decoration: none;
+    }
+  </style>
+
 .. _faq:
 
 ==========================
@@ -9,8 +38,9 @@ Frequently Asked Questions
 Here we try to give some answers to questions that regularly pop up on the mailing list.
 
 .. contents:: Table of Contents
-   :local:
-   :depth: 2
+  :local:
+  :depth: 2
+
 
 About the project
 -----------------
@@ -32,13 +62,10 @@ Apart from scikit-learn, another popular one is `scikit-image <https://scikit-im
 Do you support PyPy?
 ^^^^^^^^^^^^^^^^^^^^
 
-scikit-learn is regularly tested and maintained to work with
-`PyPy <https://pypy.org/>`_ (an alternative Python implementation with
-a built-in just-in-time compiler).
-
-Note however that this support is still considered experimental and specific
-components might behave slightly differently. Please refer to the test
-suite of the specific module of interest for more details.
+Due to limited maintainer resources and small number of users, using
+scikit-learn with `PyPy <https://pypy.org/>`_ (an alternative Python
+implementation with a built-in just-in-time compiler) is not officially
+supported.
 
 How can I obtain permission to use the images in scikit-learn for my work?
 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
@@ -323,12 +350,14 @@ Using scikit-learn
 
 What's the best way to get help on scikit-learn usage?
 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
-**For general machine learning questions**, please use
-`Cross Validated <https://stats.stackexchange.com/>`_ with the ``[machine-learning]`` tag.
 
-**For scikit-learn usage questions**, please use `Stack Overflow <https://stackoverflow.com/questions/tagged/scikit-learn>`_
-with the ``[scikit-learn]`` and ``[python]`` tags. You can alternatively use the `mailing list
-<https://mail.python.org/mailman/listinfo/scikit-learn>`_.
+* General machine learning questions: use `Cross Validated
+  <https://stats.stackexchange.com/>`_ with the ``[machine-learning]`` tag.
+
+* scikit-learn usage questions: use `Stack Overflow
+  <https://stackoverflow.com/questions/tagged/scikit-learn>`_ with the
+  ``[scikit-learn]`` and ``[python]`` tags. You can alternatively use the `mailing list
+  <https://mail.python.org/mailman/listinfo/scikit-learn>`_.
 
 Please make sure to include a minimal reproduction code snippet (ideally shorter
 than 10 lines) that highlights your problem on a toy dataset (for instance from
diff --git a/doc/getting_started.rst b/doc/getting_started.rst
index cd4d953db1b8a..14e0178f0826b 100644
--- a/doc/getting_started.rst
+++ b/doc/getting_started.rst
@@ -53,6 +53,8 @@ new data. You don't need to re-train the estimator::
   >>> clf.predict([[4, 5, 6], [14, 15, 16]])  # predict classes of new data
   array([0, 1])
 
+You can check :ref:`ml_map` on how to choose the right model for your use case.
+
 Transformers and pre-processors
 -------------------------------
 
@@ -227,6 +229,3 @@ provide. You can also find an exhaustive list of the public API in the
 
 You can also look at our numerous :ref:`examples <general_examples>` that
 illustrate the use of ``scikit-learn`` in many different contexts.
-
-The :ref:`tutorials <tutorial_menu>` also contain additional learning
-resources.
diff --git a/doc/governance.rst b/doc/governance.rst
index 33afd7dde8ddb..d6b07afe4eeb4 100644
--- a/doc/governance.rst
+++ b/doc/governance.rst
@@ -58,56 +58,47 @@ members and recant their rights until they become active again. The list of
 members, active and emeritus (with dates at which they became active) is public
 on the scikit-learn website.
 
-The following teams form the core contributors group.
-
-
-Contributor Experience Team
-~~~~~~~~~~~~~~~~~~~~~~~~~~~
-
-The contributor experience team improves the experience of contributors by
-helping with the triage of issues and pull requests, as well as noticing any
-repeating patterns where people might struggle, and to help with improving
-those aspects of the project.
-
-To this end, they have the required permissions on github to label and close
-issues. :ref:`Their work <bug_triaging>` is crucial to improve the
-communication in the project and limit the crowding of the issue tracker.
-
-.. _communication_team:
-
-Communication team
-~~~~~~~~~~~~~~~~~~
-
-Members of the communication team help with outreach and communication
-for scikit-learn. The goal of the team is to develop public awareness of
-scikit-learn, of its features and usage, as well as branding.
-
-For this, they can operate the scikit-learn accounts on various social networks
-and produce materials. They also have the required rights to our blog
-repository and other relevant accounts and platforms.
-
-Documentation team
-~~~~~~~~~~~~~~~~~~
-
-Members of the documentation team engage with the documentation of the project
-among other things. They might also be involved in other aspects of the
-project, but their reviews on documentation contributions are considered
-authoritative, and can merge such contributions.
-
-To this end, they have permissions to merge pull requests in scikit-learn's
-repository.
-
-Maintainers
-~~~~~~~~~~~
-
-Maintainers are community members who have shown that they are dedicated to the
-continued development of the project through ongoing engagement with the
-community. They have shown they can be trusted to maintain scikit-learn with
-care. Being a maintainer allows contributors to more easily carry on with their
-project related activities by giving them direct access to the project's
-repository. Maintainers are expected to review code contributions, merge
-approved pull requests, cast votes for and against merging a pull-request,
-and to be involved in deciding major changes to the API.
+The following teams form the core contributors group:
+
+* **Contributor Experience Team**
+  The contributor experience team improves the experience of contributors by
+  helping with the triage of issues and pull requests, as well as noticing any
+  repeating patterns where people might struggle, and to help with improving
+  those aspects of the project.
+
+  To this end, they have the required permissions on github to label and close
+  issues. :ref:`Their work <bug_triaging>` is crucial to improve the
+  communication in the project and limit the crowding of the issue tracker.
+
+  .. _communication_team:
+
+* **Communication Team**
+  Members of the communication team help with outreach and communication
+  for scikit-learn. The goal of the team is to develop public awareness of
+  scikit-learn, of its features and usage, as well as branding.
+
+  For this, they can operate the scikit-learn accounts on various social networks
+  and produce materials. They also have the required rights to our blog
+  repository and other relevant accounts and platforms.
+
+* **Documentation Team**
+  Members of the documentation team engage with the documentation of the project
+  among other things. They might also be involved in other aspects of the
+  project, but their reviews on documentation contributions are considered
+  authoritative, and can merge such contributions.
+
+  To this end, they have permissions to merge pull requests in scikit-learn's
+  repository.
+
+* **Maintainers Team**
+  Maintainers are community members who have shown that they are dedicated to the
+  continued development of the project through ongoing engagement with the
+  community. They have shown they can be trusted to maintain scikit-learn with
+  care. Being a maintainer allows contributors to more easily carry on with their
+  project related activities by giving them direct access to the project's
+  repository. Maintainers are expected to review code contributions, merge
+  approved pull requests, cast votes for and against merging a pull-request,
+  and to be involved in deciding major changes to the API.
 
 Technical Committee
 -------------------
diff --git a/doc/images/Tidelift-logo-on-light.svg b/doc/images/Tidelift-logo-on-light.svg
new file mode 100644
index 0000000000000..af12d68417235
--- /dev/null
+++ b/doc/images/Tidelift-logo-on-light.svg
@@ -0,0 +1,33 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!-- Generator: Adobe Illustrator 21.1.0, SVG Export Plug-In . SVG Version: 6.00 Build 0)  -->
+<svg version="1.1" id="Artwork" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" x="0px" y="0px"
+	 viewBox="0 0 190.1 33" style="enable-background:new 0 0 190.1 33;" xml:space="preserve">
+<style type="text/css">
+	.st0{fill:#4B5168;}
+	.st1{fill:#F6914D;}
+</style>
+<g>
+	<path class="st0" d="M33.4,27.7V5.3c0-2.3,0-2.3,2.4-2.3c2.4,0,2.4,0,2.4,2.3v22.4c0,2.3,0,2.3-2.4,2.3
+		C33.4,29.9,33.4,29.9,33.4,27.7z"/>
+	<path class="st0" d="M45,26.4V6.6c0-3.6,0-3.6,3.6-3.6h5.8c7.8,0,12.5,3.9,13,10.2c0.2,2.2,0.2,3.4,0,5.5
+		c-0.5,6.3-5.3,11.2-13,11.2h-5.8C45,29.9,45,29.9,45,26.4z M54.3,25.4c5.3,0,8-3,8.3-7.1c0.1-1.8,0.1-2.8,0-4.6
+		c-0.3-4.2-3-6.1-8.3-6.1h-4.5v17.8H54.3z"/>
+	<path class="st0" d="M73.8,26.4V6.6c0-3.6,0-3.6,3.6-3.6h13.5c2.3,0,2.3,0,2.3,2.2c0,2.2,0,2.2-2.3,2.2H78.6v6.9h11
+		c2.2,0,2.2,0,2.2,2.1c0,2.1,0,2.1-2.2,2.1h-11v6.9h12.3c2.3,0,2.3,0,2.3,2.2c0,2.3,0,2.3-2.3,2.3H77.4
+		C73.8,29.9,73.8,29.9,73.8,26.4z"/>
+	<path class="st0" d="M100,26.4v-21c0-2.3,0-2.3,2.4-2.3c2.4,0,2.4,0,2.4,2.3v20.2h11.9c2.4,0,2.4,0,2.4,2.2c0,2.2,0,2.2-2.4,2.2
+		h-13.1C100,29.9,100,29.9,100,26.4z"/>
+	<path class="st0" d="M125.8,27.7V5.3c0-2.3,0-2.3,2.4-2.3c2.4,0,2.4,0,2.4,2.3v22.4c0,2.3,0,2.3-2.4,2.3
+		C125.8,29.9,125.8,29.9,125.8,27.7z"/>
+	<path class="st0" d="M137.4,27.7V6.6c0-3.6,0-3.6,3.6-3.6h13.5c2.3,0,2.3,0,2.3,2.2c0,2.2,0,2.2-2.3,2.2h-12.2v7.2h11.3
+		c2.3,0,2.3,0,2.3,2.2c0,2.2,0,2.2-2.3,2.2h-11.3v8.6c0,2.3,0,2.3-2.4,2.3S137.4,29.9,137.4,27.7z"/>
+	<path class="st0" d="M24.2,3.1H5.5c-2.4,0-2.4,0-2.4,2.2c0,2.2,0,2.2,2.4,2.2h7v4.7v3.2l4.8-3.7v-1.1V7.5h7c2.4,0,2.4,0,2.4-2.2
+		C26.6,3.1,26.6,3.1,24.2,3.1z"/>
+	<path class="st1" d="M12.5,20v7.6c0,2.3,0,2.3,2.4,2.3c2.4,0,2.4,0,2.4-2.3V16.3L12.5,20z"/>
+	<g>
+		<path class="st0" d="M165.9,3.1h18.7c2.4,0,2.4,0,2.4,2.2c0,2.2,0,2.2-2.4,2.2h-7v4.7v3.2l-4.8-3.7v-1.1V7.5h-7
+			c-2.4,0-2.4,0-2.4-2.2C163.5,3.1,163.5,3.1,165.9,3.1z"/>
+		<path class="st1" d="M177.6,20v7.6c0,2.3,0,2.3-2.4,2.3c-2.4,0-2.4,0-2.4-2.3V16.3L177.6,20z"/>
+	</g>
+</g>
+</svg>
diff --git a/doc/images/ml_map.README.rst b/doc/images/ml_map.README.rst
new file mode 100644
index 0000000000000..8d82c175dad58
--- /dev/null
+++ b/doc/images/ml_map.README.rst
@@ -0,0 +1,20 @@
+The scikit-learn machine learning cheat sheet was originally created by Andreas Mueller:
+https://peekaboo-vision.blogspot.de/2013/01/machine-learning-cheat-sheet-for-scikit.html
+
+The current version of the chart is located at `doc/images/ml_map.svg` in SVG+XML
+format, created using [draw.io](https://draw.io/). To edit the chart, open the file in
+draw.io, make changes, and save. This should update the chart in-place. Another option
+would be to re-export the chart as SVG and replace the existing file. The options used
+for exporting the chart are:
+
+- Zoom: 100%
+- Border width: 15
+- Size: Diagram
+- Transparent Background: False
+- Appearance: Light
+
+Each node in the chart that contains an estimator should have a link, where the root
+directory is at `../../`. Note that after updating or re-exporting the SVG, the links
+may be prefixed with e.g. `https://app.diagrams.net/`. Remember to check and remove
+them, for instance by replacing all occurrences of `https://app.diagrams.net/../../`
+with `../../`.
diff --git a/doc/images/ml_map.png b/doc/images/ml_map.png
deleted file mode 100644
index 73ebd9c05fcc4..0000000000000
Binary files a/doc/images/ml_map.png and /dev/null differ
diff --git a/doc/images/ml_map.svg b/doc/images/ml_map.svg
new file mode 100644
index 0000000000000..7c587cef011b9
--- /dev/null
+++ b/doc/images/ml_map.svg
@@ -0,0 +1,4 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!-- Do not edit this file with editors other than draw.io -->
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
+<svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" version="1.1" width="1423px" height="772px" viewBox="-0.5 -0.5 1423 772" content="&lt;mxfile host=&quot;app.diagrams.net&quot; modified=&quot;2024-05-28T03:47:38.813Z&quot; agent=&quot;Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/125.0.0.0 Safari/537.36 Edg/125.0.0.0&quot; etag=&quot;TB4U6ksWt8jliiA0dJdg&quot; scale=&quot;1&quot; border=&quot;15&quot; version=&quot;24.4.2&quot; type=&quot;device&quot;&gt;&#10;  &lt;diagram name=&quot;第 1 页&quot; id=&quot;prGmxGi5H6ogpCY3go2q&quot;&gt;&#10;    &lt;mxGraphModel dx=&quot;3143&quot; dy=&quot;2358&quot; grid=&quot;1&quot; gridSize=&quot;10&quot; guides=&quot;1&quot; tooltips=&quot;1&quot; connect=&quot;1&quot; arrows=&quot;1&quot; fold=&quot;1&quot; page=&quot;1&quot; pageScale=&quot;1&quot; pageWidth=&quot;827&quot; pageHeight=&quot;1169&quot; math=&quot;0&quot; shadow=&quot;0&quot;&gt;&#10;      &lt;root&gt;&#10;        &lt;mxCell id=&quot;0&quot; /&gt;&#10;        &lt;mxCell id=&quot;1&quot; parent=&quot;0&quot; /&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-45&quot; value=&quot;&quot; style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=3;strokeColor=#B3B3B3;fillColor=#FFFFCC;fillStyle=auto;shadow=0;glass=0;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;490&quot; y=&quot;380&quot; width=&quot;530&quot; height=&quot;250&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-26&quot; value=&quot;&quot; style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=3;strokeColor=#B3B3B3;fillColor=#CCE5FF;fillStyle=auto;shadow=0;glass=0;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;480&quot; y=&quot;60&quot; width=&quot;540&quot; height=&quot;290&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-13&quot; value=&quot;&quot; style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=3;strokeColor=#B3B3B3;fillColor=#E5CCFF;fillStyle=auto;shadow=0;glass=0;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-370&quot; y=&quot;320&quot; width=&quot;560&quot; height=&quot;290&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-66&quot; value=&quot;&quot; style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=3;strokeColor=#B3B3B3;fillColor=#FFCCCC;fillStyle=auto;shadow=0;glass=0;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-370&quot; y=&quot;-30&quot; width=&quot;560&quot; height=&quot;310&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;p-bOygNmazyrNX3Cmdq1-1&quot; value=&quot;&amp;lt;font style=&amp;quot;font-size: 20px;&amp;quot;&amp;gt;&amp;lt;b&amp;gt;START&amp;lt;/b&amp;gt;&amp;lt;/font&amp;gt;&quot; style=&quot;ellipse;whiteSpace=wrap;html=1;fontSize=16;fontFamily=Georgia;labelBorderColor=none;strokeWidth=5;gradientColor=none;fillColor=#FFE6CC;strokeColor=#FF9933;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;410&quot; y=&quot;-30&quot; width=&quot;80&quot; height=&quot;70&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;p-bOygNmazyrNX3Cmdq1-2&quot; value=&quot;&amp;amp;gt;50&amp;lt;div&amp;gt;&amp;lt;span style=&amp;quot;font-size: 10px; background-color: initial;&amp;quot;&amp;gt;samples&amp;lt;/span&amp;gt;&amp;lt;/div&amp;gt;&quot; style=&quot;ellipse;whiteSpace=wrap;html=1;fontSize=16;fontFamily=Georgia;labelBorderColor=none;strokeWidth=5;gradientColor=none;fillColor=#CCE5FF;strokeColor=#3399FF;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;330&quot; y=&quot;80&quot; width=&quot;80&quot; height=&quot;70&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-1&quot; value=&quot;&amp;lt;font style=&amp;quot;font-size: 10px;&amp;quot;&amp;gt;get&amp;lt;/font&amp;gt;&amp;lt;div&amp;gt;more&amp;lt;/div&amp;gt;&amp;lt;div&amp;gt;data&amp;lt;/div&amp;gt;&quot; style=&quot;ellipse;whiteSpace=wrap;html=1;fontSize=16;fontFamily=Georgia;labelBorderColor=none;strokeWidth=5;gradientColor=none;fillColor=#CCE5FF;strokeColor=#3399FF;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;220&quot; y=&quot;10&quot; width=&quot;80&quot; height=&quot;70&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-5&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=1;entryY=1;entryDx=0;entryDy=0;exitX=0;exitY=0;exitDx=0;exitDy=0;strokeColor=#FF3333;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;p-bOygNmazyrNX3Cmdq1-2&quot; target=&quot;lidfMP7FeTC4yG16FXWw-1&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;270&quot; y=&quot;250&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;320&quot; y=&quot;200&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-6&quot; value=&quot;NO&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#FF3333;fontSize=12;fontStyle=1&quot; parent=&quot;lidfMP7FeTC4yG16FXWw-5&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-7&quot; value=&quot;&amp;lt;font style=&amp;quot;font-size: 10px;&amp;quot;&amp;gt;predicting a&amp;lt;/font&amp;gt;&amp;lt;div&amp;gt;category&amp;lt;/div&amp;gt;&quot; style=&quot;ellipse;whiteSpace=wrap;html=1;fontSize=16;fontFamily=Georgia;labelBorderColor=none;strokeWidth=5;gradientColor=none;fillColor=#CCE5FF;strokeColor=#3399FF;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;300&quot; y=&quot;190&quot; width=&quot;80&quot; height=&quot;70&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-8&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0.5;entryY=0;entryDx=0;entryDy=0;exitX=0.5;exitY=1;exitDx=0;exitDy=0;strokeColor=#009900;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;p-bOygNmazyrNX3Cmdq1-2&quot; target=&quot;lidfMP7FeTC4yG16FXWw-7&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;452&quot; y=&quot;190&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;398&quot; y=&quot;155&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-9&quot; value=&quot;YES&quot; style=&quot;edgeLabel;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#009900;fontSize=12;fontStyle=1;html=1;labelBorderColor=none;textShadow=0;&quot; parent=&quot;lidfMP7FeTC4yG16FXWw-8&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-10&quot; value=&quot;&amp;lt;div&amp;gt;&amp;lt;span style=&amp;quot;font-size: 10px;&amp;quot;&amp;gt;do you have&amp;lt;/span&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;div&amp;gt;labeled&amp;lt;/div&amp;gt;&amp;lt;div&amp;gt;data&amp;lt;/div&amp;gt;&quot; style=&quot;ellipse;whiteSpace=wrap;html=1;fontSize=16;fontFamily=Georgia;labelBorderColor=none;strokeWidth=5;gradientColor=none;fillColor=#CCE5FF;strokeColor=#3399FF;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;210&quot; y=&quot;280&quot; width=&quot;80&quot; height=&quot;70&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-11&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=1;entryY=0;entryDx=0;entryDy=0;exitX=0;exitY=1;exitDx=0;exitDy=0;strokeColor=#009900;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;lidfMP7FeTC4yG16FXWw-7&quot; target=&quot;lidfMP7FeTC4yG16FXWw-10&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;452&quot; y=&quot;240&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;412&quot; y=&quot;280&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-12&quot; value=&quot;YES&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#009900;fontSize=12;fontStyle=1&quot; parent=&quot;lidfMP7FeTC4yG16FXWw-11&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-13&quot; value=&quot;&amp;lt;div&amp;gt;&amp;lt;span style=&amp;quot;font-size: 10px;&amp;quot;&amp;gt;predicting a&amp;lt;/span&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;div&amp;gt;quantity&amp;lt;/div&amp;gt;&quot; style=&quot;ellipse;whiteSpace=wrap;html=1;fontSize=16;fontFamily=Georgia;labelBorderColor=none;strokeWidth=5;gradientColor=none;fillColor=#CCE5FF;strokeColor=#3399FF;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;374&quot; y=&quot;290&quot; width=&quot;80&quot; height=&quot;70&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-14&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0;entryY=0;entryDx=0;entryDy=0;exitX=1;exitY=1;exitDx=0;exitDy=0;strokeColor=#FF3333;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;lidfMP7FeTC4yG16FXWw-7&quot; target=&quot;lidfMP7FeTC4yG16FXWw-13&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;452&quot; y=&quot;190&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;398&quot; y=&quot;155&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-15&quot; value=&quot;NO&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#FF3333;fontSize=12;fontStyle=1&quot; parent=&quot;lidfMP7FeTC4yG16FXWw-14&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-17&quot; value=&quot;&amp;lt;div&amp;gt;&amp;lt;span style=&amp;quot;font-size: 10px;&amp;quot;&amp;gt;just&amp;lt;/span&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;div&amp;gt;looking&amp;lt;/div&amp;gt;&quot; style=&quot;ellipse;whiteSpace=wrap;html=1;fontSize=16;fontFamily=Georgia;labelBorderColor=none;strokeWidth=5;gradientColor=none;fillColor=#CCE5FF;strokeColor=#3399FF;verticalAlign=middle;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;330&quot; y=&quot;400&quot; width=&quot;80&quot; height=&quot;70&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-18&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=1;entryY=0;entryDx=0;entryDy=0;exitX=0.5;exitY=1;exitDx=0;exitDy=0;strokeColor=#FF3333;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;lidfMP7FeTC4yG16FXWw-13&quot; target=&quot;lidfMP7FeTC4yG16FXWw-17&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;384&quot; y=&quot;340&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;395&quot; y=&quot;380&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-19&quot; value=&quot;NO&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#FF3333;fontSize=12;fontStyle=1&quot; parent=&quot;lidfMP7FeTC4yG16FXWw-18&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-21&quot; value=&quot;&amp;lt;div&amp;gt;&amp;lt;span style=&amp;quot;font-size: 10px;&amp;quot;&amp;gt;predicting&amp;lt;/span&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;div&amp;gt;structure&amp;lt;/div&amp;gt;&quot; style=&quot;ellipse;whiteSpace=wrap;html=1;fontSize=16;fontFamily=Georgia;labelBorderColor=none;strokeWidth=5;gradientColor=none;fillColor=#CCE5FF;strokeColor=#3399FF;verticalAlign=middle;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;334&quot; y=&quot;510&quot; width=&quot;80&quot; height=&quot;70&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-22&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;exitX=0.5;exitY=1;exitDx=0;exitDy=0;strokeColor=#FF3333;strokeWidth=3;endFill=1;endSize=5;startSize=0;entryX=0.5;entryY=0;entryDx=0;entryDy=0;&quot; parent=&quot;1&quot; source=&quot;lidfMP7FeTC4yG16FXWw-17&quot; target=&quot;lidfMP7FeTC4yG16FXWw-21&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;395&quot; y=&quot;430&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;380&quot; y=&quot;570&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-23&quot; value=&quot;NO&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#FF3333;fontSize=12;fontStyle=1&quot; parent=&quot;lidfMP7FeTC4yG16FXWw-22&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-24&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0.5;entryY=0;entryDx=0;entryDy=0;exitX=0;exitY=1;exitDx=0;exitDy=0;strokeColor=#FF9933;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;p-bOygNmazyrNX3Cmdq1-1&quot; target=&quot;p-bOygNmazyrNX3Cmdq1-2&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;331&quot; y=&quot;141&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;279&quot; y=&quot;104&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-26&quot; value=&quot;&amp;lt;div&amp;gt;&amp;lt;span style=&amp;quot;background-color: initial;&amp;quot;&amp;gt;tough&amp;lt;/span&amp;gt;&amp;lt;br&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;div&amp;gt;&amp;lt;span style=&amp;quot;background-color: initial;&amp;quot;&amp;gt;luck&amp;lt;/span&amp;gt;&amp;lt;/div&amp;gt;&quot; style=&quot;ellipse;whiteSpace=wrap;html=1;fontSize=16;fontFamily=Georgia;labelBorderColor=none;strokeWidth=5;gradientColor=none;fillColor=#CCE5FF;strokeColor=#3399FF;verticalAlign=middle;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;200&quot; y=&quot;500&quot; width=&quot;80&quot; height=&quot;70&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-27&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=1;entryY=0.5;entryDx=0;entryDy=0;exitX=0;exitY=0.5;exitDx=0;exitDy=0;strokeColor=#FF9933;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;lidfMP7FeTC4yG16FXWw-21&quot; target=&quot;lidfMP7FeTC4yG16FXWw-26&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;562&quot; y=&quot;120&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;508&quot; y=&quot;190&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-28&quot; value=&quot;&amp;lt;font style=&amp;quot;font-size: 16px;&amp;quot;&amp;gt;&amp;amp;lt;100K&amp;lt;/font&amp;gt;&amp;lt;div style=&amp;quot;&amp;quot;&amp;gt;&amp;lt;span style=&amp;quot;&amp;quot;&amp;gt;&amp;lt;font style=&amp;quot;font-size: 10px;&amp;quot;&amp;gt;samples&amp;lt;/font&amp;gt;&amp;lt;/span&amp;gt;&amp;lt;/div&amp;gt;&quot; style=&quot;ellipse;whiteSpace=wrap;html=1;fontSize=16;fontFamily=Georgia;labelBorderColor=none;strokeWidth=5;gradientColor=none;fillColor=#CCE5FF;strokeColor=#3399FF;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;90&quot; y=&quot;170&quot; width=&quot;80&quot; height=&quot;70&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-29&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=1;entryY=1;entryDx=0;entryDy=0;exitX=0;exitY=0;exitDx=0;exitDy=0;strokeColor=#009900;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;lidfMP7FeTC4yG16FXWw-10&quot; target=&quot;lidfMP7FeTC4yG16FXWw-28&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;356&quot; y=&quot;330&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;300&quot; y=&quot;345&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-30&quot; value=&quot;YES&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#009900;fontSize=12;fontStyle=1;labelBackgroundColor=default;&quot; parent=&quot;lidfMP7FeTC4yG16FXWw-29&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;SGD&amp;lt;div&amp;gt;Classifier&amp;lt;/div&amp;gt;&quot; link=&quot;../../modules/sgd.html#classification&quot; id=&quot;lidfMP7FeTC4yG16FXWw-33&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;50&quot; y=&quot;60&quot; width=&quot;80&quot; height=&quot;50&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-34&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0.75;entryY=1;entryDx=0;entryDy=0;exitX=0.5;exitY=0;exitDx=0;exitDy=0;strokeColor=#FF3333;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;lidfMP7FeTC4yG16FXWw-28&quot; target=&quot;lidfMP7FeTC4yG16FXWw-33&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;382&quot; y=&quot;170&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;358&quot; y=&quot;130&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-35&quot; value=&quot;NO&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#FF3333;fontSize=12;fontStyle=1;labelBackgroundColor=#FFCCCC;&quot; parent=&quot;lidfMP7FeTC4yG16FXWw-34&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;Linear&amp;lt;div&amp;gt;SVC&amp;lt;/div&amp;gt;&quot; link=&quot;../../modules/svm.html#classification&quot; id=&quot;lidfMP7FeTC4yG16FXWw-36&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;-30&quot; y=&quot;210&quot; width=&quot;60&quot; height=&quot;50&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-38&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=1;entryY=0.5;entryDx=0;entryDy=0;exitX=0;exitY=0.5;exitDx=0;exitDy=0;strokeColor=#009900;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;lidfMP7FeTC4yG16FXWw-28&quot; target=&quot;lidfMP7FeTC4yG16FXWw-36&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;162&quot; y=&quot;300&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;140&quot; y=&quot;250&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-39&quot; value=&quot;YES&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#009900;fontSize=12;fontStyle=1;labelBackgroundColor=#FFCCCC;&quot; parent=&quot;lidfMP7FeTC4yG16FXWw-38&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-42&quot; value=&quot;&amp;lt;div&amp;gt;&amp;lt;span style=&amp;quot;background-color: initial;&amp;quot;&amp;gt;text&amp;lt;/span&amp;gt;&amp;lt;br&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;div&amp;gt;data&amp;lt;/div&amp;gt;&quot; style=&quot;ellipse;whiteSpace=wrap;html=1;fontSize=16;fontFamily=Georgia;labelBorderColor=none;strokeWidth=5;gradientColor=none;fillColor=#CCE5FF;strokeColor=#3399FF;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-190&quot; y=&quot;170&quot; width=&quot;80&quot; height=&quot;70&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-43&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=1;entryY=0.5;entryDx=0;entryDy=0;exitX=0;exitY=0.25;exitDx=0;exitDy=0;strokeColor=#FF9933;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;lidfMP7FeTC4yG16FXWw-36&quot; target=&quot;lidfMP7FeTC4yG16FXWw-42&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;492&quot; y=&quot;100&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;438&quot; y=&quot;170&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-44&quot; value=&quot;&amp;lt;span style=&amp;quot;color: rgb(77, 81, 86); font-family: &amp;amp;quot;Google Sans&amp;amp;quot;, arial, sans-serif; font-size: 16px; font-weight: 400; text-align: start; text-wrap: wrap;&amp;quot;&amp;gt;😭&amp;lt;/span&amp;gt;&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontColor=#CC6600;fontStyle=1;fontSize=12;labelPosition=center;verticalLabelPosition=middle;labelBackgroundColor=#FFCCCC;&quot; parent=&quot;lidfMP7FeTC4yG16FXWw-43&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1306&quot; y=&quot;3&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;-1&quot; as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;Kernel&amp;lt;div&amp;gt;Approximation&amp;lt;/div&amp;gt;&quot; link=&quot;../../modules/kernel_approximation.html&quot; id=&quot;lidfMP7FeTC4yG16FXWw-46&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;-130&quot; width=&quot;120&quot; height=&quot;50&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-47&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=1;entryY=0.75;entryDx=0;entryDy=0;exitX=0;exitY=0.25;exitDx=0;exitDy=0;strokeColor=#FF9933;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;lidfMP7FeTC4yG16FXWw-33&quot; target=&quot;lidfMP7FeTC4yG16FXWw-46&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;-30&quot; y=&quot;213&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;-140&quot; y=&quot;195&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-48&quot; value=&quot;&amp;lt;span style=&amp;quot;color: rgb(77, 81, 86); font-family: &amp;amp;quot;Google Sans&amp;amp;quot;, arial, sans-serif; font-size: 16px; font-weight: 400; text-align: start; text-wrap: wrap;&amp;quot;&amp;gt;😭&amp;lt;/span&amp;gt;&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontColor=#CC6600;fontStyle=1;fontSize=12;labelPosition=center;verticalLabelPosition=middle;labelBackgroundColor=#FFCCCC;&quot; parent=&quot;lidfMP7FeTC4yG16FXWw-47&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1306&quot; y=&quot;3&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;-1&quot; as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;KNeighbors&amp;lt;div&amp;gt;Classifier&amp;lt;/div&amp;gt;&quot; link=&quot;../../modules/neighbors.html&quot; id=&quot;lidfMP7FeTC4yG16FXWw-49&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;-170&quot; y=&quot;80&quot; width=&quot;100&quot; height=&quot;50&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-50&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0.25;entryY=1;entryDx=0;entryDy=0;exitX=0.5;exitY=0;exitDx=0;exitDy=0;strokeColor=#FF3333;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;lidfMP7FeTC4yG16FXWw-42&quot; target=&quot;lidfMP7FeTC4yG16FXWw-49&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;140&quot; y=&quot;180&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;120&quot; y=&quot;120&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-51&quot; value=&quot;NO&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#FF3333;fontSize=12;fontStyle=1;labelBackgroundColor=#FFCCCC;&quot; parent=&quot;lidfMP7FeTC4yG16FXWw-50&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;SVC&quot; link=&quot;../../modules/svm.html#classification&quot; id=&quot;lidfMP7FeTC4yG16FXWw-52&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;-328.51&quot; y=&quot;55&quot; width=&quot;90&quot; height=&quot;30&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;UserObject label=&quot;Ensemble&amp;lt;div&amp;gt;Classifiers&amp;lt;/div&amp;gt;&quot; link=&quot;../../modules/ensemble.html&quot; id=&quot;lidfMP7FeTC4yG16FXWw-54&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;-328.51&quot; y=&quot;85&quot; width=&quot;90&quot; height=&quot;50&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-56&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=1;entryY=0.25;entryDx=0;entryDy=0;exitX=0;exitY=0.5;exitDx=0;exitDy=0;strokeColor=#FF9933;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;lidfMP7FeTC4yG16FXWw-49&quot; target=&quot;lidfMP7FeTC4yG16FXWw-54&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;-20&quot; y=&quot;233&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;-90&quot; y=&quot;225&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-57&quot; value=&quot;&amp;lt;span style=&amp;quot;color: rgb(77, 81, 86); font-family: &amp;amp;quot;Google Sans&amp;amp;quot;, arial, sans-serif; font-size: 16px; font-weight: 400; text-align: start; text-wrap: wrap;&amp;quot;&amp;gt;😭&amp;lt;/span&amp;gt;&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontColor=#CC6600;fontStyle=1;fontSize=12;labelPosition=center;verticalLabelPosition=middle;labelBackgroundColor=#FFCCCC;&quot; parent=&quot;lidfMP7FeTC4yG16FXWw-56&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1306&quot; y=&quot;3&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;-1&quot; as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;Naive&amp;lt;div&amp;gt;Bayes&amp;lt;/div&amp;gt;&quot; link=&quot;../../modules/naive_bayes.html&quot; id=&quot;lidfMP7FeTC4yG16FXWw-58&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;-313.51&quot; y=&quot;170&quot; width=&quot;60&quot; height=&quot;50&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-60&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=1;entryY=0.5;entryDx=0;entryDy=0;exitX=0;exitY=0.5;exitDx=0;exitDy=0;strokeColor=#009900;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;lidfMP7FeTC4yG16FXWw-42&quot; target=&quot;lidfMP7FeTC4yG16FXWw-58&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;100&quot; y=&quot;215&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;40&quot; y=&quot;233&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-61&quot; value=&quot;YES&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#009900;fontSize=12;fontStyle=1;labelBackgroundColor=#FFCCCC;&quot; parent=&quot;lidfMP7FeTC4yG16FXWw-60&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;lidfMP7FeTC4yG16FXWw-62&quot; value=&quot;&amp;lt;span style=&amp;quot;font-size: 24px;&amp;quot;&amp;gt;&amp;lt;font face=&amp;quot;Georgia&amp;quot; style=&amp;quot;font-size: 24px;&amp;quot;&amp;gt;classification&amp;lt;/font&amp;gt;&amp;lt;/span&amp;gt;&quot; style=&quot;text;html=1;align=center;verticalAlign=middle;whiteSpace=wrap;rounded=0;fontSize=24;fontStyle=1&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-350&quot; y=&quot;-10&quot; width=&quot;170&quot; height=&quot;40&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-10&quot; value=&quot;&amp;lt;div style=&amp;quot;font-size: 12px;&amp;quot;&amp;gt;&amp;lt;font style=&amp;quot;font-size: 12px;&amp;quot;&amp;gt;&amp;lt;span style=&amp;quot;background-color: initial; font-size: 12px;&amp;quot;&amp;gt;number of&amp;lt;/span&amp;gt;&amp;lt;br style=&amp;quot;font-size: 12px;&amp;quot;&amp;gt;&amp;lt;/font&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;div style=&amp;quot;font-size: 12px;&amp;quot;&amp;gt;&amp;lt;font style=&amp;quot;font-size: 12px;&amp;quot;&amp;gt;categories&amp;lt;/font&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;div style=&amp;quot;font-size: 12px;&amp;quot;&amp;gt;&amp;lt;font style=&amp;quot;font-size: 12px;&amp;quot;&amp;gt;known&amp;lt;/font&amp;gt;&amp;lt;/div&amp;gt;&quot; style=&quot;ellipse;whiteSpace=wrap;html=1;fontSize=12;fontFamily=Georgia;labelBorderColor=none;strokeWidth=5;gradientColor=none;fillColor=#CCE5FF;strokeColor=#3399FF;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry y=&quot;360&quot; width=&quot;80&quot; height=&quot;70&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-11&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=1;entryY=0;entryDx=0;entryDy=0;exitX=0;exitY=0.5;exitDx=0;exitDy=0;strokeColor=#FF3333;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;lidfMP7FeTC4yG16FXWw-10&quot; target=&quot;ZhISbIufsCQTaueA5Ebt-10&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;395&quot; y=&quot;430&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;370&quot; y=&quot;470&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-12&quot; value=&quot;NO&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#FF3333;fontSize=12;fontStyle=1;labelBackgroundColor=#E5CCFF;&quot; parent=&quot;ZhISbIufsCQTaueA5Ebt-11&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-14&quot; value=&quot;&amp;lt;font style=&amp;quot;font-size: 16px;&amp;quot;&amp;gt;&amp;amp;lt;10K&amp;lt;/font&amp;gt;&amp;lt;div style=&amp;quot;&amp;quot;&amp;gt;&amp;lt;span style=&amp;quot;&amp;quot;&amp;gt;&amp;lt;font style=&amp;quot;font-size: 10px;&amp;quot;&amp;gt;samples&amp;lt;/font&amp;gt;&amp;lt;/span&amp;gt;&amp;lt;/div&amp;gt;&quot; style=&quot;ellipse;whiteSpace=wrap;html=1;fontSize=16;fontFamily=Georgia;labelBorderColor=none;strokeWidth=5;gradientColor=none;fillColor=#CCE5FF;strokeColor=#3399FF;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;70&quot; y=&quot;460&quot; width=&quot;80&quot; height=&quot;70&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-15&quot; value=&quot;&amp;lt;font style=&amp;quot;font-size: 16px;&amp;quot;&amp;gt;&amp;amp;lt;10K&amp;lt;/font&amp;gt;&amp;lt;div style=&amp;quot;&amp;quot;&amp;gt;&amp;lt;span style=&amp;quot;&amp;quot;&amp;gt;&amp;lt;font style=&amp;quot;font-size: 10px;&amp;quot;&amp;gt;samples&amp;lt;/font&amp;gt;&amp;lt;/span&amp;gt;&amp;lt;/div&amp;gt;&quot; style=&quot;ellipse;whiteSpace=wrap;html=1;fontSize=16;fontFamily=Georgia;labelBorderColor=none;strokeWidth=5;gradientColor=none;fillColor=#CCE5FF;strokeColor=#3399FF;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-140&quot; y=&quot;410&quot; width=&quot;80&quot; height=&quot;70&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-16&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0;entryY=0;entryDx=0;entryDy=0;exitX=1;exitY=0.5;exitDx=0;exitDy=0;strokeColor=#FF3333;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;ZhISbIufsCQTaueA5Ebt-14&quot; target=&quot;lidfMP7FeTC4yG16FXWw-26&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;370&quot; y=&quot;540&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;395&quot; y=&quot;600&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-17&quot; value=&quot;NO&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#FF3333;fontSize=12;fontStyle=1;labelBackgroundColor=#E5CCFF;&quot; parent=&quot;ZhISbIufsCQTaueA5Ebt-16&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-18&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0;entryY=0;entryDx=0;entryDy=0;exitX=1;exitY=1;exitDx=0;exitDy=0;strokeColor=#FF3333;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;ZhISbIufsCQTaueA5Ebt-10&quot; target=&quot;ZhISbIufsCQTaueA5Ebt-14&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;120&quot; y=&quot;550&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;202&quot; y=&quot;620&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-19&quot; value=&quot;NO&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#FF3333;fontSize=12;fontStyle=1;labelBackgroundColor=#E5CCFF;&quot; parent=&quot;ZhISbIufsCQTaueA5Ebt-18&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-20&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=1;entryY=0;entryDx=0;entryDy=0;exitX=0;exitY=0.5;exitDx=0;exitDy=0;strokeColor=#009900;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;ZhISbIufsCQTaueA5Ebt-10&quot; target=&quot;ZhISbIufsCQTaueA5Ebt-15&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;355&quot; y=&quot;330&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;300&quot; y=&quot;345&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-21&quot; value=&quot;YES&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#009900;fontSize=12;fontStyle=1;labelBackgroundColor=#E5CCFF;&quot; parent=&quot;ZhISbIufsCQTaueA5Ebt-20&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;MeanShift&quot; link=&quot;../../modules/clustering.html#mean-shift&quot; id=&quot;ZhISbIufsCQTaueA5Ebt-22&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;-60&quot; y=&quot;530&quot; width=&quot;90&quot; height=&quot;30&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;UserObject label=&quot;VBGMM&quot; link=&quot;../../modules/mixture.html#bgmm&quot; id=&quot;ZhISbIufsCQTaueA5Ebt-23&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;-60&quot; y=&quot;560&quot; width=&quot;90&quot; height=&quot;30&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-24&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=1;entryY=0.75;entryDx=0;entryDy=0;exitX=0;exitY=1;exitDx=0;exitDy=0;strokeColor=#009900;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;ZhISbIufsCQTaueA5Ebt-14&quot; target=&quot;ZhISbIufsCQTaueA5Ebt-22&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;10&quot; y=&quot;405&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;-61&quot; y=&quot;430&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-25&quot; value=&quot;YES&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#009900;fontSize=12;fontStyle=1;labelBackgroundColor=#E5CCFF;&quot; parent=&quot;ZhISbIufsCQTaueA5Ebt-24&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;MiniBatch&amp;lt;div&amp;gt;KMeans&amp;lt;/div&amp;gt;&quot; link=&quot;../../modules/clustering.html#mini-batch-k-means&quot; id=&quot;ZhISbIufsCQTaueA5Ebt-26&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;-195&quot; y=&quot;520&quot; width=&quot;90&quot; height=&quot;50&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-27&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0.5;entryY=0;entryDx=0;entryDy=0;exitX=0;exitY=1;exitDx=0;exitDy=0;strokeColor=#FF3333;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;ZhISbIufsCQTaueA5Ebt-15&quot; target=&quot;ZhISbIufsCQTaueA5Ebt-26&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;79&quot; y=&quot;430&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;91&quot; y=&quot;480&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-28&quot; value=&quot;NO&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#FF3333;fontSize=12;fontStyle=1;labelBackgroundColor=#E5CCFF;&quot; parent=&quot;ZhISbIufsCQTaueA5Ebt-27&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-29&quot; value=&quot;&amp;lt;span style=&amp;quot;font-size: 24px;&amp;quot;&amp;gt;&amp;lt;font face=&amp;quot;Georgia&amp;quot; style=&amp;quot;font-size: 24px;&amp;quot;&amp;gt;clustering&amp;lt;/font&amp;gt;&amp;lt;/span&amp;gt;&quot; style=&quot;text;html=1;align=center;verticalAlign=middle;whiteSpace=wrap;rounded=0;fontSize=24;fontStyle=1&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-347.02&quot; y=&quot;480&quot; width=&quot;138.51&quot; height=&quot;40&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;KMeans&quot; link=&quot;../../modules/clustering.html#k-means&quot; id=&quot;ZhISbIufsCQTaueA5Ebt-30&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;-208.51&quot; y=&quot;340&quot; width=&quot;78.51&quot; height=&quot;30&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-31&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0.75;entryY=1;entryDx=0;entryDy=0;exitX=0;exitY=0;exitDx=0;exitDy=0;strokeColor=#009900;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;ZhISbIufsCQTaueA5Ebt-15&quot; target=&quot;ZhISbIufsCQTaueA5Ebt-30&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;10&quot; y=&quot;405&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;-61&quot; y=&quot;430&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-32&quot; value=&quot;YES&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#009900;fontSize=12;fontStyle=1;labelBackgroundColor=#E5CCFF;&quot; parent=&quot;ZhISbIufsCQTaueA5Ebt-31&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;&amp;lt;div&amp;gt;Spectral&amp;lt;/div&amp;gt;&amp;lt;div&amp;gt;Clustering&amp;lt;/div&amp;gt;&quot; link=&quot;../../modules/clustering.html#spectral-clustering&quot; id=&quot;ZhISbIufsCQTaueA5Ebt-33&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;-350&quot; y=&quot;380&quot; width=&quot;90&quot; height=&quot;50&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;UserObject label=&quot;GMM&quot; link=&quot;../../modules/mixture.html&quot; id=&quot;ZhISbIufsCQTaueA5Ebt-34&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;-350&quot; y=&quot;430&quot; width=&quot;90&quot; height=&quot;30&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-35&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=1;entryY=0.25;entryDx=0;entryDy=0;exitX=0;exitY=0.75;exitDx=0;exitDy=0;strokeColor=#FF9933;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;ZhISbIufsCQTaueA5Ebt-30&quot; target=&quot;ZhISbIufsCQTaueA5Ebt-33&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;-20&quot; y=&quot;233&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;-100&quot; y=&quot;215&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ZhISbIufsCQTaueA5Ebt-36&quot; value=&quot;&amp;lt;span style=&amp;quot;color: rgb(77, 81, 86); font-family: &amp;amp;quot;Google Sans&amp;amp;quot;, arial, sans-serif; font-size: 16px; font-weight: 400; text-align: start; text-wrap: wrap;&amp;quot;&amp;gt;😭&amp;lt;/span&amp;gt;&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontColor=#CC6600;fontStyle=1;fontSize=12;labelPosition=center;verticalLabelPosition=middle;labelBackgroundColor=#E5CCFF;&quot; parent=&quot;ZhISbIufsCQTaueA5Ebt-35&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1306&quot; y=&quot;3&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;-1&quot; as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-1&quot; value=&quot;&amp;lt;font style=&amp;quot;font-size: 16px;&amp;quot;&amp;gt;&amp;amp;lt;100K&amp;lt;/font&amp;gt;&amp;lt;div style=&amp;quot;&amp;quot;&amp;gt;&amp;lt;span style=&amp;quot;&amp;quot;&amp;gt;&amp;lt;font style=&amp;quot;font-size: 10px;&amp;quot;&amp;gt;samples&amp;lt;/font&amp;gt;&amp;lt;/span&amp;gt;&amp;lt;/div&amp;gt;&quot; style=&quot;ellipse;whiteSpace=wrap;html=1;fontSize=16;fontFamily=Georgia;labelBorderColor=none;strokeWidth=5;gradientColor=none;fillColor=#CCE5FF;strokeColor=#3399FF;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;500&quot; y=&quot;210&quot; width=&quot;80&quot; height=&quot;70&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-2&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0;entryY=0.5;entryDx=0;entryDy=0;exitX=1;exitY=0;exitDx=0;exitDy=0;strokeColor=#009900;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;lidfMP7FeTC4yG16FXWw-13&quot; target=&quot;ke5fKqay8JjYpE_cKGV5-1&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;350&quot; y=&quot;210&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;384&quot; y=&quot;260&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-3&quot; value=&quot;YES&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#009900;fontSize=12;fontStyle=1&quot; parent=&quot;ke5fKqay8JjYpE_cKGV5-2&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-5&quot; value=&quot;&amp;lt;div style=&amp;quot;font-size: 12px;&amp;quot;&amp;gt;few features&amp;lt;/div&amp;gt;&amp;lt;div style=&amp;quot;font-size: 12px;&amp;quot;&amp;gt;should be&amp;lt;/div&amp;gt;&amp;lt;div style=&amp;quot;font-size: 12px;&amp;quot;&amp;gt;important&amp;lt;/div&amp;gt;&quot; style=&quot;ellipse;whiteSpace=wrap;html=1;fontSize=12;fontFamily=Georgia;labelBorderColor=none;strokeWidth=5;gradientColor=none;fillColor=#CCE5FF;strokeColor=#3399FF;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;650&quot; y=&quot;220&quot; width=&quot;80&quot; height=&quot;70&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-6&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0;entryY=0.5;entryDx=0;entryDy=0;exitX=1;exitY=0.5;exitDx=0;exitDy=0;strokeColor=#009900;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;ke5fKqay8JjYpE_cKGV5-1&quot; target=&quot;ke5fKqay8JjYpE_cKGV5-5&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;424&quot; y=&quot;315&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;522&quot; y=&quot;280&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-7&quot; value=&quot;YES&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#009900;fontSize=12;fontStyle=1;labelBackgroundColor=#CCE5FF;&quot; parent=&quot;ke5fKqay8JjYpE_cKGV5-6&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;&amp;lt;div&amp;gt;SGD&amp;lt;/div&amp;gt;&amp;lt;div&amp;gt;Regressor&amp;lt;/div&amp;gt;&quot; link=&quot;../../modules/sgd.html#regression&quot; id=&quot;ke5fKqay8JjYpE_cKGV5-8&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;590&quot; y=&quot;135&quot; width=&quot;90&quot; height=&quot;50&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-9&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0.25;entryY=1;entryDx=0;entryDy=0;exitX=1;exitY=0;exitDx=0;exitDy=0;strokeColor=#FF3333;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;ke5fKqay8JjYpE_cKGV5-1&quot; target=&quot;ke5fKqay8JjYpE_cKGV5-8&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;384&quot; y=&quot;350&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;396&quot; y=&quot;400&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-10&quot; value=&quot;NO&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#FF3333;fontSize=12;fontStyle=1;labelBackgroundColor=#CCE5FF;&quot; parent=&quot;ke5fKqay8JjYpE_cKGV5-9&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;Lasso&quot; link=&quot;../../modules/linear_model.html#lasso&quot; id=&quot;ke5fKqay8JjYpE_cKGV5-13&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;720&quot; y=&quot;105&quot; width=&quot;90&quot; height=&quot;30&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;UserObject label=&quot;ElasticNet&quot; link=&quot;../../modules/linear_model.html#elastic-net&quot; id=&quot;ke5fKqay8JjYpE_cKGV5-14&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;720&quot; y=&quot;135&quot; width=&quot;90&quot; height=&quot;30&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-15&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0.25;entryY=1;entryDx=0;entryDy=0;exitX=1;exitY=0;exitDx=0;exitDy=0;strokeColor=#009900;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;ke5fKqay8JjYpE_cKGV5-5&quot; target=&quot;ke5fKqay8JjYpE_cKGV5-14&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;590&quot; y=&quot;255&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;660&quot; y=&quot;265&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-16&quot; value=&quot;YES&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#009900;fontSize=12;fontStyle=1;labelBackgroundColor=#CCE5FF;&quot; parent=&quot;ke5fKqay8JjYpE_cKGV5-15&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;RidgeRegression&quot; link=&quot;../../modules/linear_model.html#ridge-regression&quot; id=&quot;ke5fKqay8JjYpE_cKGV5-17&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;790&quot; y=&quot;270&quot; width=&quot;140&quot; height=&quot;30&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;UserObject label=&quot;SVR&amp;lt;font style=&amp;quot;font-size: 12px;&amp;quot;&amp;gt;(kernel=&amp;quot;linear&amp;quot;)&amp;lt;/font&amp;gt;&quot; link=&quot;../../modules/svm.html#regression&quot; id=&quot;ke5fKqay8JjYpE_cKGV5-18&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;790&quot; y=&quot;300&quot; width=&quot;140&quot; height=&quot;30&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-19&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0;entryY=0.5;entryDx=0;entryDy=0;exitX=1;exitY=0.5;exitDx=0;exitDy=0;strokeColor=#FF3333;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;ke5fKqay8JjYpE_cKGV5-5&quot; target=&quot;ke5fKqay8JjYpE_cKGV5-17&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;578&quot; y=&quot;230&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;613&quot; y=&quot;180&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-20&quot; value=&quot;NO&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#FF3333;fontSize=12;fontStyle=1;labelBackgroundColor=#CCE5FF;&quot; parent=&quot;ke5fKqay8JjYpE_cKGV5-19&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;SVR&amp;lt;font style=&amp;quot;font-size: 12px;&amp;quot;&amp;gt;(kernel=&amp;quot;rbf&amp;quot;)&amp;lt;/font&amp;gt;&quot; link=&quot;../../modules/svm.html#regression&quot; id=&quot;ke5fKqay8JjYpE_cKGV5-21&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;880&quot; y=&quot;130&quot; width=&quot;120&quot; height=&quot;30&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;UserObject label=&quot;Ensemble&amp;lt;div&amp;gt;Regressors&amp;lt;/div&amp;gt;&quot; link=&quot;../../modules/ensemble.html&quot; id=&quot;ke5fKqay8JjYpE_cKGV5-23&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;880&quot; y=&quot;160&quot; width=&quot;120&quot; height=&quot;50&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-24&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0.25;entryY=1;entryDx=0;entryDy=0;exitX=0.75;exitY=0;exitDx=0;exitDy=0;strokeColor=#FF9933;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;ke5fKqay8JjYpE_cKGV5-17&quot; target=&quot;ke5fKqay8JjYpE_cKGV5-23&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;990&quot; y=&quot;255&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;930&quot; y=&quot;220&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-25&quot; value=&quot;&amp;lt;span style=&amp;quot;color: rgb(77, 81, 86); font-family: &amp;amp;quot;Google Sans&amp;amp;quot;, arial, sans-serif; font-size: 16px; font-weight: 400; text-align: start; text-wrap: wrap;&amp;quot;&amp;gt;😭&amp;lt;/span&amp;gt;&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontColor=#CC6600;fontStyle=1;fontSize=12;labelPosition=center;verticalLabelPosition=middle;labelBackgroundColor=#CCE5FF;&quot; parent=&quot;ke5fKqay8JjYpE_cKGV5-24&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1306&quot; y=&quot;3&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;-1&quot; as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-27&quot; value=&quot;&amp;lt;span style=&amp;quot;font-size: 24px;&amp;quot;&amp;gt;&amp;lt;font face=&amp;quot;Georgia&amp;quot; style=&amp;quot;font-size: 24px;&amp;quot;&amp;gt;regression&amp;lt;/font&amp;gt;&amp;lt;/span&amp;gt;&quot; style=&quot;text;html=1;align=center;verticalAlign=middle;whiteSpace=wrap;rounded=0;fontSize=24;fontStyle=1&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;500&quot; y=&quot;80&quot; width=&quot;140&quot; height=&quot;40&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;&amp;lt;div&amp;gt;&amp;lt;span style=&amp;quot;background-color: initial;&amp;quot;&amp;gt;Ramdomized&amp;lt;/span&amp;gt;&amp;lt;br&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;div&amp;gt;&amp;lt;span style=&amp;quot;background-color: initial;&amp;quot;&amp;gt;PCA&amp;lt;/span&amp;gt;&amp;lt;/div&amp;gt;&quot; link=&quot;../../modules/decomposition.html#principal-component-analysis-pca&quot; id=&quot;ke5fKqay8JjYpE_cKGV5-28&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;515&quot; y=&quot;410&quot; width=&quot;110&quot; height=&quot;50&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-29&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0;entryY=0.5;entryDx=0;entryDy=0;exitX=1;exitY=0.5;exitDx=0;exitDy=0;strokeColor=#009900;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;lidfMP7FeTC4yG16FXWw-17&quot; target=&quot;ke5fKqay8JjYpE_cKGV5-28&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;424&quot; y=&quot;295&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;521&quot; y=&quot;260&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-30&quot; value=&quot;YES&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#009900;fontSize=12;fontStyle=1&quot; parent=&quot;ke5fKqay8JjYpE_cKGV5-29&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-31&quot; value=&quot;&amp;lt;font style=&amp;quot;font-size: 16px;&amp;quot;&amp;gt;&amp;amp;lt;10K&amp;lt;/font&amp;gt;&amp;lt;div style=&amp;quot;&amp;quot;&amp;gt;&amp;lt;span style=&amp;quot;&amp;quot;&amp;gt;&amp;lt;font style=&amp;quot;font-size: 10px;&amp;quot;&amp;gt;samples&amp;lt;/font&amp;gt;&amp;lt;/span&amp;gt;&amp;lt;/div&amp;gt;&quot; style=&quot;ellipse;whiteSpace=wrap;html=1;fontSize=16;fontFamily=Georgia;labelBorderColor=none;strokeWidth=5;gradientColor=none;fillColor=#CCE5FF;strokeColor=#3399FF;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;515&quot; y=&quot;520&quot; width=&quot;80&quot; height=&quot;70&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-32&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0.5;entryY=0;entryDx=0;entryDy=0;exitX=0.5;exitY=1;exitDx=0;exitDy=0;strokeColor=#FF9933;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;ke5fKqay8JjYpE_cKGV5-28&quot; target=&quot;ke5fKqay8JjYpE_cKGV5-31&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;541&quot; y=&quot;490&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;490&quot; y=&quot;520&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-33&quot; value=&quot;&amp;lt;span style=&amp;quot;color: rgb(77, 81, 86); font-family: &amp;amp;quot;Google Sans&amp;amp;quot;, arial, sans-serif; font-size: 16px; font-weight: 400; text-align: start; text-wrap: wrap;&amp;quot;&amp;gt;😭&amp;lt;/span&amp;gt;&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontColor=#CC6600;fontStyle=1;fontSize=12;labelPosition=center;verticalLabelPosition=middle;labelBackgroundColor=#FFFFCC;&quot; parent=&quot;ke5fKqay8JjYpE_cKGV5-32&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1306&quot; y=&quot;3&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;-1&quot; as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;Kernel&amp;lt;div&amp;gt;Approximation&amp;lt;/div&amp;gt;&quot; link=&quot;../../modules/kernel_approximation.html&quot; id=&quot;ke5fKqay8JjYpE_cKGV5-34&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;670&quot; y=&quot;550&quot; width=&quot;120&quot; height=&quot;50&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-35&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;exitX=1;exitY=0.5;exitDx=0;exitDy=0;strokeColor=#FF3333;strokeWidth=3;endFill=1;endSize=5;startSize=0;entryX=0;entryY=0.25;entryDx=0;entryDy=0;&quot; parent=&quot;1&quot; source=&quot;ke5fKqay8JjYpE_cKGV5-31&quot; target=&quot;ke5fKqay8JjYpE_cKGV5-34&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;415&quot; y=&quot;530&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;429&quot; y=&quot;570&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-36&quot; value=&quot;NO&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#FF3333;fontSize=12;fontStyle=1;labelBackgroundColor=#FFFFCC;&quot; parent=&quot;ke5fKqay8JjYpE_cKGV5-35&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;IsoMap&quot; link=&quot;../../modules/manifold.html#isomap&quot; id=&quot;ke5fKqay8JjYpE_cKGV5-37&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;680&quot; y=&quot;430&quot; width=&quot;100&quot; height=&quot;30&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;UserObject label=&quot;&amp;lt;div&amp;gt;Spectral&amp;lt;/div&amp;gt;&amp;lt;div&amp;gt;Embedding&amp;lt;/div&amp;gt;&quot; link=&quot;../../modules/manifold.html#spectral-embedding&quot; id=&quot;ke5fKqay8JjYpE_cKGV5-38&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;680&quot; y=&quot;460&quot; width=&quot;100&quot; height=&quot;50&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-39&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0;entryY=0.75;entryDx=0;entryDy=0;exitX=1;exitY=0;exitDx=0;exitDy=0;strokeColor=#009900;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;ke5fKqay8JjYpE_cKGV5-31&quot; target=&quot;ke5fKqay8JjYpE_cKGV5-38&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;410&quot; y=&quot;495&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;525&quot; y=&quot;458&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-40&quot; value=&quot;YES&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontFamily=Georgia;fontColor=#009900;fontSize=12;fontStyle=1;labelBackgroundColor=#FFFFCC;&quot; parent=&quot;ke5fKqay8JjYpE_cKGV5-39&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1867&quot; y=&quot;2&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;LLE&quot; link=&quot;../../modules/manifold.html#locally-linear-embedding&quot; id=&quot;ke5fKqay8JjYpE_cKGV5-41&quot;&gt;&#10;          &lt;mxCell style=&quot;rounded=1;whiteSpace=wrap;html=1;strokeWidth=5;strokeColor=#00CC66;fillColor=#CCFFE6;fontFamily=Georgia;fontSize=16;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;860&quot; y=&quot;490&quot; width=&quot;50&quot; height=&quot;30&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-42&quot; value=&quot;&quot; style=&quot;endArrow=block;html=1;rounded=0;entryX=0;entryY=0.5;entryDx=0;entryDy=0;exitX=1;exitY=0.5;exitDx=0;exitDy=0;strokeColor=#FF9933;strokeWidth=3;endFill=1;endSize=5;startSize=0;&quot; parent=&quot;1&quot; source=&quot;ke5fKqay8JjYpE_cKGV5-38&quot; target=&quot;ke5fKqay8JjYpE_cKGV5-41&quot; edge=&quot;1&quot;&gt;&#10;          &lt;mxGeometry width=&quot;50&quot; height=&quot;50&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;580&quot; y=&quot;470&quot; as=&quot;sourcePoint&quot; /&gt;&#10;            &lt;mxPoint x=&quot;565&quot; y=&quot;530&quot; as=&quot;targetPoint&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-43&quot; value=&quot;&amp;lt;span style=&amp;quot;color: rgb(77, 81, 86); font-family: &amp;amp;quot;Google Sans&amp;amp;quot;, arial, sans-serif; font-size: 16px; font-weight: 400; text-align: start; text-wrap: wrap;&amp;quot;&amp;gt;😭&amp;lt;/span&amp;gt;&quot; style=&quot;edgeLabel;html=1;align=center;verticalAlign=middle;resizable=0;points=[];fontColor=#CC6600;fontStyle=1;fontSize=12;labelPosition=center;verticalLabelPosition=middle;labelBackgroundColor=#FFFFCC;&quot; parent=&quot;ke5fKqay8JjYpE_cKGV5-42&quot; vertex=&quot;1&quot; connectable=&quot;0&quot;&gt;&#10;          &lt;mxGeometry x=&quot;-0.1306&quot; y=&quot;3&quot; relative=&quot;1&quot; as=&quot;geometry&quot;&gt;&#10;            &lt;mxPoint x=&quot;-1&quot; as=&quot;offset&quot; /&gt;&#10;          &lt;/mxGeometry&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-44&quot; value=&quot;&amp;lt;span style=&amp;quot;font-size: 24px;&amp;quot;&amp;gt;&amp;lt;font face=&amp;quot;Georgia&amp;quot; style=&amp;quot;font-size: 24px;&amp;quot;&amp;gt;dimensionality&amp;lt;/font&amp;gt;&amp;lt;/span&amp;gt;&amp;lt;div&amp;gt;&amp;lt;span style=&amp;quot;font-size: 24px;&amp;quot;&amp;gt;&amp;lt;font face=&amp;quot;Georgia&amp;quot; style=&amp;quot;font-size: 24px;&amp;quot;&amp;gt;reduction&amp;lt;/font&amp;gt;&amp;lt;/span&amp;gt;&amp;lt;/div&amp;gt;&quot; style=&quot;text;html=1;align=center;verticalAlign=middle;whiteSpace=wrap;rounded=0;fontSize=24;fontStyle=1&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;810&quot; y=&quot;542&quot; width=&quot;210&quot; height=&quot;65&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;        &lt;UserObject label=&quot;&quot; id=&quot;ke5fKqay8JjYpE_cKGV5-47&quot;&gt;&#10;          &lt;mxCell style=&quot;shape=image;verticalLabelPosition=bottom;labelBackgroundColor=default;verticalAlign=top;aspect=fixed;imageAspect=0;image=data:image/svg+xml,<svg xmlns="http://www.w3.org/2000/svg" width="1251" viewBox="0 0 1251 675" height="675"><path fill="#f89939" d="m959.940063 573.065979c152.410401-152.40155 177.740967-374.157013 56.573914-495.315063-121.148987-121.144471-342.895386-95.818482-495.296936 56.573974-152.40155 152.397125-108.314972 443.556091-56.564972 495.315003 41.818482 41.818542 342.895538 95.818542 495.287994-56.573914z"/><path fill="#3499cd" d="m334.575043 352.849548c-88.415985-88.416046-217.089035-103.135528-287.401535-32.827575-70.294476 70.299041-55.597481 198.98999 32.836487 287.392578 88.434036 88.442993 257.377548 62.860473 287.383529 32.827453 24.281983-24.241455 55.624481-198.967468-32.818481-287.392456z"/><g fill="#010101"><path d="m639.643494 535.711487c-15.619507 14.377502-29.322022 24.988525-41.09845 31.805969-11.77655 6.840088-23.008545 10.255493-33.696045 10.255493-12.293945 0-22.212036-4.765503-29.731445-14.300903-7.53302-9.544556-11.286011-22.342529-11.286011-38.443543 0-24.12445 5.228943-53.086486 15.686951-86.854461 10.440063-33.795044 23.152527-64.935089 38.083496-93.424561l43.780456-16.208954c1.37262-.459106 2.416565-.692962 3.109558-.692962 3.321045 0 6.065979 2.447876 8.172059 7.321411 2.128417 4.896057 3.199462 11.474945 3.199462 19.746002 0 23.440582-5.395507 46.134064-16.208923 68.080505-10.809082 21.955475-27.693054 45.386963-50.670044 70.321534-.922546 11.951904-1.381531 20.159912-1.381531 24.646484 0 10.003418 1.835999 17.918945 5.512513 23.782471 3.680969 5.872497 8.55896 8.788574 14.651977 8.788574 6.214478 0 12.81604-2.223145 19.827026-6.705139 6.997559-4.490906 17.685059-13.787964 32.044434-27.931458v19.813538zm-66.005982-67.378479c14.589051-16.222534 26.4375-34.416016 35.509461-54.544495 9.072082-20.137512 13.603576-37.458008 13.603576-51.97055 0-4.230011-.625549-7.667908-1.881042-10.250916-1.264527-2.587555-2.884461-3.888061-4.833008-3.888061-4.234436 0-10.421936 10.583953-18.526489 31.75653-8.104492 21.16803-16.060547 50.805024-23.872498 88.897492z"/><path d="m768.577576 535.711487c-14.589051 14.377502-27.684021 24.988525-39.294007 31.805969-11.610046 6.840088-24.40802 10.255493-38.43457 10.255493-15.628418 0-28.237427-4.999511-37.844971-14.984985-9.589416-10.012512-14.377441-23.156983-14.377441-39.478516 0-24.353943 8.4375-46.390472 25.348511-66.095947 16.875-19.714569 35.612976-29.565063 56.178039-29.565063 10.6875 0 19.237488 2.767608 25.681519 8.279998 6.434936 5.521576 9.652405 12.753083 9.652405 21.717072 0 23.791443-25.27649 43.083038-75.833924 57.910461 4.589966 22.396607 16.595947 33.610474 36.018006 33.610474 7.586853 0 14.818481-2.038513 21.707885-6.106506 6.907471-4.085938 17.298096-13.148926 31.203064-27.157471v19.809021zm-90.315064-31.878052c29.407532-8.279999 44.12262-23.552917 44.12262-45.845947 0-11.02948-4.027588-16.541992-12.06012-16.541992-7.586975 0-14.818481 5.764526-21.708008 17.325012-6.911926 11.542541-10.354492 26.554504-10.354492 45.062927z"/><path d="m952.654419 535.711487c-18.386963 17.464538-31.545044 28.853943-39.464905 34.146057-7.929138 5.282898-15.511597 7.919922-22.756531 7.919922-18.157531 0-26.712036-16.024536-25.681518-48.087036-11.488526 16.42511-22.095032 28.548095-31.805969 36.378051-9.702027 7.812012-19.723511 11.708985-30.078125 11.708985-10.097901 0-18.683899-4.729492-25.762391-14.210938-7.078613-9.481506-10.593017-21.109558-10.593017-34.91101 0-17.226014 4.729492-33.660035 14.201904-49.297577 9.49054-15.628449 21.640625-28.255463 36.459107-37.907929 14.818481-9.652588 27.931518-14.485473 39.293945-14.485473 14.368469 0 24.426086 6.610473 30.172485 19.817993l35.226013-19.467102h9.666016l-15.214538 50.494537c-7.811951 25.402435-11.731507 42.813019-11.731507 52.231476 0 9.877502 3.496582 14.818481 10.512024 14.818481 4.463989 0 9.404968-2.380432 14.80957-7.154968 5.404419-4.774536 12.97345-12.041992 22.738404-21.807007v19.813538zm-126.166443 9.490539c11.488403 0 22.31543-9.791992 32.503479-29.380615 10.170044-19.597412 15.250549-37.678406 15.250549-54.220398 0-6.426025-1.449096-11.461487-4.306518-15.075012-2.884583-3.631531-6.731995-5.431519-11.547058-5.431519-11.497437 0-22.396424 9.765076-32.66095 29.303956-10.282532 19.539062-15.434998 37.521057-15.434998 53.937133 0 6.214417 1.53003 11.240906 4.571961 15.092896 3.041992 3.852051 6.903015 5.773559 11.623535 5.773559z"/><path d="m1081.412964 535.711487c-28.844971 28.264526-51.083985 42.40802-66.708008 42.40802-7.015442 0-12.9375-2.96106-17.752563-8.860596-4.814881-5.921875-7.240357-13.25238-7.240357-21.991455 0-16.200012 8.684937-37.907898 26.032471-65.146454-8.509583 4.369538-17.806458 7.402436-27.922547 9.130463-7.470031 13.787964-19.19696 28.615539-35.162963 44.455505h-3.955506v-15.493469c8.954956-9.305969 17.059448-19.30957 24.299988-29.99707-9.895569-4.369416-14.827454-10.862885-14.827454-19.46698 0-8.860474 3.005982-18.30597 9.053955-28.372437 6.03003-10.044006 14.328003-15.065979 24.907532-15.065979 8.963928 0 13.436951 4.580872 13.436951 13.778931 0 7.240539-2.583008 17.577026-7.762512 31.027588 19.071045-2.074524 35.734558-16.654602 49.990539-43.780518l15.678101-.693115-16.029053 44.12262c-6.660034 18.616455-10.970947 31.297424-12.919556 38.011444-1.948608 6.714019-2.934082 12.672027-2.934082 17.833587 0 4.832886 1.125 8.693848 3.357056 11.546875 2.241089 2.893555 5.265015 4.315552 9.053955 4.315552 4.130982 0 8.104614-1.412964 11.893555-4.212036 3.789062-2.839539 12.293945-10.615479 25.515014-23.368408v19.817932z"/><path d="m1250.676025 535.711487c-26.541015 28.053039-49.306518 42.065979-68.255981 42.065979-7.699463 0-13.905029-2.700073-18.616455-8.104492-4.720581-5.395508-7.074097-12.631531-7.074097-21.708008 0-12.294007 5.0625-31.085938 15.178589-56.353424 5.395508-13.563019 8.104492-22.194031 8.104492-25.857025 0-3.681092-1.448974-5.521576-4.306518-5.521576-1.606568 0-3.744019.810089-6.380982 2.407501-2.425537 1.606506-5.238037 3.865539-8.455566 6.732025-2.866455 2.636993-6.093018 5.854462-9.652466 9.63446-3.109497 3.244538-6.44397 6.916596-9.985596 11.038514l-9.665893 11.214019c-4.243408 5.166047-6.889527 10.61554-7.920044 16.366456-1.732544 9.765075-2.875488 18.738037-3.456055 26.905517-.350952 6.075012-.517456 14.283081-.517456 24.646607l-38.092407 8.945861c-1.255493-15.511413-1.899048-27.062866-1.899048-34.636413 0-18.499451 2.155518-36.026917 6.470947-52.569031 4.306519-16.559998 11.223145-35.162994 20.767456-55.853943l42.048096-8.095581c-8.842407 23.791596-14.642944 42.511597-17.401489 56.17804 18.845947-21.023987 33.786011-35.577027 44.860473-43.69043 11.056519-8.104614 20.902466-12.136597 29.506592-12.136597 5.845337 0 10.7323 2.205109 14.625 6.619568 3.910401 4.418945 5.85437 9.967468 5.85437 16.600464 0 11.020508-4.940918 29.17804-14.80957 54.468018-6.785889 17.343017-10.178955 28.597534-10.178955 33.795044 0 6.916442 2.821655 10.372497 8.4646 10.372497 8.401489 0 22.009399-11.092529 40.787963-33.268555z"/></g><path fill="none" d="m692.743469 295.258514h1013.589051v377.766022h-1013.589051z"/><text y="370" x="688" font-size="103.85775" font-family="Helvetica" fill="#fff">scikit</text><path fill="none" d="m1015.055969 620.905518h1464.444031v193.333557h-1464.444031z"/></svg>;&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;            &lt;mxGeometry x=&quot;780&quot; y=&quot;-110&quot; width=&quot;166.92&quot; height=&quot;90&quot; as=&quot;geometry&quot; /&gt;&#10;          &lt;/mxCell&gt;&#10;        &lt;/UserObject&gt;&#10;        &lt;mxCell id=&quot;ke5fKqay8JjYpE_cKGV5-48&quot; value=&quot;&amp;lt;span style=&amp;quot;font-size: 32px;&amp;quot;&amp;gt;&amp;lt;font face=&amp;quot;Georgia&amp;quot; style=&amp;quot;font-size: 32px;&amp;quot;&amp;gt;scikit-learn&amp;lt;/font&amp;gt;&amp;lt;/span&amp;gt;&amp;lt;div style=&amp;quot;font-size: 32px;&amp;quot;&amp;gt;&amp;lt;span style=&amp;quot;font-size: 32px;&amp;quot;&amp;gt;&amp;lt;font face=&amp;quot;Georgia&amp;quot; style=&amp;quot;font-size: 32px;&amp;quot;&amp;gt;algorithm cheat sheet&amp;lt;/font&amp;gt;&amp;lt;/span&amp;gt;&amp;lt;/div&amp;gt;&quot; style=&quot;text;html=1;align=left;verticalAlign=middle;whiteSpace=wrap;rounded=0;fontSize=32;fontStyle=1&quot; parent=&quot;1&quot; vertex=&quot;1&quot;&gt;&#10;          &lt;mxGeometry x=&quot;567.5&quot; y=&quot;-60&quot; width=&quot;375&quot; height=&quot;90&quot; as=&quot;geometry&quot; /&gt;&#10;        &lt;/mxCell&gt;&#10;      &lt;/root&gt;&#10;    &lt;/mxGraphModel&gt;&#10;  &lt;/diagram&gt;&#10;&lt;/mxfile&gt;&#10;"><defs/><g><g><rect x="876" y="505" width="530" height="250" rx="37.5" ry="37.5" fill="#ffffcc" stroke="#b3b3b3" stroke-width="3" pointer-events="all"/></g><g><rect x="866" y="185" width="540" height="290" rx="43.5" ry="43.5" fill="#cce5ff" stroke="#b3b3b3" stroke-width="3" pointer-events="all"/></g><g><rect x="16" y="445" width="560" height="290" rx="43.5" ry="43.5" fill="#e5ccff" stroke="#b3b3b3" stroke-width="3" pointer-events="all"/></g><g><rect x="16" y="95" width="560" height="310" rx="46.5" ry="46.5" fill="#ffcccc" stroke="#b3b3b3" stroke-width="3" pointer-events="all"/></g><g><ellipse cx="836" cy="130" rx="40" ry="35" fill="#ffe6cc" stroke="#ff9933" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 130px; margin-left: 797px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><font style="font-size: 20px;"><b>START</b></font></div></div></div></foreignObject><text x="836" y="135" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">START</text></switch></g></g><g><ellipse cx="756" cy="240" rx="40" ry="35" fill="#cce5ff" stroke="#3399ff" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 240px; margin-left: 717px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">&gt;50<div><span style="font-size: 10px; background-color: initial;">samples</span></div></div></div></div></foreignObject><text x="756" y="245" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">&gt;50...</text></switch></g></g><g><ellipse cx="646" cy="170" rx="40" ry="35" fill="#cce5ff" stroke="#3399ff" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 170px; margin-left: 607px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><font style="font-size: 10px;">get</font><div>more</div><div>data</div></div></div></div></foreignObject><text x="646" y="175" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">get...</text></switch></g></g><g><path d="M 727.03 215.86 L 685.44 198.51" fill="none" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 678.06 195.43 L 686.98 194.82 L 683.9 202.2 Z" fill="#ff3333" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 210px; margin-left: 707px;"><div data-drawio-colors="color: #FF3333; background-color: rgb(255, 255, 255); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(255, 51, 51); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 255, 255); white-space: nowrap;">NO</div></div></div></foreignObject><text x="707" y="214" fill="#FF3333" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">NO</text></switch></g></g><g><ellipse cx="726" cy="350" rx="40" ry="35" fill="#cce5ff" stroke="#3399ff" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 350px; margin-left: 687px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><font style="font-size: 10px;">predicting a</font><div>category</div></div></div></div></foreignObject><text x="726" y="355" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">predicting...</text></switch></g></g><g><path d="M 756 275 L 732.81 305.92" fill="none" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 728.01 312.32 L 729.61 303.52 L 736.01 308.32 Z" fill="#009900" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 293px; margin-left: 747px;"><div data-drawio-colors="color: #009900; background-color: rgb(255, 255, 255); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(0, 153, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 255, 255); white-space: nowrap;">YES</div></div></div></foreignObject><text x="747" y="297" fill="#009900" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">YES</text></switch></g></g><g><ellipse cx="636" cy="440" rx="40" ry="35" fill="#cce5ff" stroke="#3399ff" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 440px; margin-left: 597px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><div><span style="font-size: 10px;">do you have</span></div><div>labeled</div><div>data</div></div></div></div></foreignObject><text x="636" y="445" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">do you hav...</text></switch></g></g><g><path d="M 697.03 374.14 L 671.88 406.86" fill="none" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 667.01 413.2 L 668.71 404.42 L 675.06 409.3 Z" fill="#009900" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 394px; margin-left: 686px;"><div data-drawio-colors="color: #009900; background-color: rgb(255, 255, 255); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(0, 153, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 255, 255); white-space: nowrap;">YES</div></div></div></foreignObject><text x="686" y="398" fill="#009900" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">YES</text></switch></g></g><g><ellipse cx="800" cy="450" rx="40" ry="35" fill="#cce5ff" stroke="#3399ff" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 450px; margin-left: 761px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><div><span style="font-size: 10px;">predicting a</span></div><div>quantity</div></div></div></div></foreignObject><text x="800" y="455" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">predicting...</text></switch></g></g><g><path d="M 754.97 374.14 L 767.67 415.02" fill="none" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 770.04 422.66 L 763.85 416.21 L 771.49 413.83 Z" fill="#ff3333" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 396px; margin-left: 765px;"><div data-drawio-colors="color: #FF3333; background-color: rgb(255, 255, 255); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(255, 51, 51); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 255, 255); white-space: nowrap;">NO</div></div></div></foreignObject><text x="765" y="399" fill="#FF3333" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">NO</text></switch></g></g><g><ellipse cx="756" cy="560" rx="40" ry="35" fill="#cce5ff" stroke="#3399ff" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 560px; margin-left: 717px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><div><span style="font-size: 10px;">just</span></div><div>looking</div></div></div></div></foreignObject><text x="756" y="565" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">just...</text></switch></g></g><g><path d="M 800 485 L 788.18 524.97" fill="none" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 785.92 532.65 L 784.35 523.84 L 792.02 526.11 Z" fill="#ff3333" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 508px; margin-left: 797px;"><div data-drawio-colors="color: #FF3333; background-color: rgb(255, 255, 255); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(255, 51, 51); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 255, 255); white-space: nowrap;">NO</div></div></div></foreignObject><text x="797" y="512" fill="#FF3333" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">NO</text></switch></g></g><g><ellipse cx="760" cy="670" rx="40" ry="35" fill="#cce5ff" stroke="#3399ff" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 670px; margin-left: 721px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><div><span style="font-size: 10px;">predicting</span></div><div>structure</div></div></div></div></foreignObject><text x="760" y="675" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">predicting...</text></switch></g></g><g><path d="M 756 595 L 758.87 623.7" fill="none" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 759.67 631.66 L 754.89 624.1 L 762.85 623.3 Z" fill="#ff3333" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 611px; margin-left: 761px;"><div data-drawio-colors="color: #FF3333; background-color: rgb(255, 255, 255); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(255, 51, 51); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 255, 255); white-space: nowrap;">NO</div></div></div></foreignObject><text x="761" y="615" fill="#FF3333" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">NO</text></switch></g></g><g><path d="M 807.03 154.14 L 764.04 196.99" fill="none" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 758.38 202.63 L 761.22 194.15 L 766.87 199.82 Z" fill="#ff9933" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><ellipse cx="626" cy="660" rx="40" ry="35" fill="#cce5ff" stroke="#3399ff" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 660px; margin-left: 587px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><div><span style="background-color: initial;">tough</span><br /></div><div><span style="background-color: initial;">luck</span></div></div></div></div></foreignObject><text x="626" y="665" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">tough...</text></switch></g></g><g><path d="M 720 670 L 677.16 662.07" fill="none" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 669.3 660.61 L 677.89 658.13 L 676.44 666 Z" fill="#ff9933" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><ellipse cx="516" cy="330" rx="40" ry="35" fill="#cce5ff" stroke="#3399ff" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 330px; margin-left: 477px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><font style="font-size: 16px;">&lt;100K</font><div style=""><span style=""><font style="font-size: 10px;">samples</font></span></div></div></div></div></foreignObject><text x="516" y="335" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">&lt;100K...</text></switch></g></g><g><path d="M 607.03 415.86 L 553.02 362.14" fill="none" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 547.34 356.5 L 555.84 359.31 L 550.2 364.98 Z" fill="#009900" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 393px; margin-left: 582px;"><div data-drawio-colors="color: #009900; background-color: rgb(255, 255, 255); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(0, 153, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 255, 255); white-space: nowrap;">YES</div></div></div></foreignObject><text x="582" y="397" fill="#009900" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">YES</text></switch></g></g><a xlink:href="../../modules/sgd.html#classification"><g><rect x="436" y="185" width="80" height="50" rx="7.5" ry="7.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 210px; margin-left: 437px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">SGD<div>Classifier</div></div></div></div></foreignObject><text x="476" y="215" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">SGD...</text></switch></g></g></a><g><path d="M 516 295 L 499.59 245.77" fill="none" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 497.06 238.18 L 503.39 244.51 L 495.8 247.04 Z" fill="#ff3333" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 271px; margin-left: 507px;"><div data-drawio-colors="color: #FF3333; background-color: #FFCCCC; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(255, 51, 51); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 204, 204); white-space: nowrap;">NO</div></div></div></foreignObject><text x="507" y="275" fill="#FF3333" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">NO</text></switch></g></g><a xlink:href="../../modules/svm.html#classification"><g><rect x="356" y="335" width="60" height="50" rx="7.5" ry="7.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 58px; height: 1px; padding-top: 360px; margin-left: 357px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">Linear<div>SVC</div></div></div></div></foreignObject><text x="386" y="365" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">Linear...</text></switch></g></g></a><g><path d="M 476 330 L 426.16 354.92" fill="none" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 419 358.5 L 424.37 351.34 L 427.94 358.5 Z" fill="#009900" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 345px; margin-left: 454px;"><div data-drawio-colors="color: #009900; background-color: #FFCCCC; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(0, 153, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 204, 204); white-space: nowrap;">YES</div></div></div></foreignObject><text x="454" y="348" fill="#009900" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">YES</text></switch></g></g><g><ellipse cx="236" cy="330" rx="40" ry="35" fill="#cce5ff" stroke="#3399ff" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 330px; margin-left: 197px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><div><span style="background-color: initial;">text</span><br /></div><div>data</div></div></div></div></foreignObject><text x="236" y="335" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">text...</text></switch></g></g><g><path d="M 356 347.5 L 287.09 332.43" fill="none" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 279.28 330.72 L 287.95 328.52 L 286.24 336.33 Z" fill="#ff9933" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 344px; margin-left: 321px;"><div data-drawio-colors="color: #CC6600; background-color: #FFCCCC; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Helvetica; color: rgb(204, 102, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 204, 204); white-space: nowrap;"><span style="color: rgb(77, 81, 86); font-family: &quot;Google Sans&quot;, arial, sans-serif; font-size: 16px; font-weight: 400; text-align: start; text-wrap: wrap;">😭</span></div></div></div></foreignObject><text x="321" y="348" fill="#CC6600" font-family="Helvetica" font-size="12px" text-anchor="middle" font-weight="bold">😭</text></switch></g></g><a xlink:href="../../modules/kernel_approximation.html"><g><rect x="256" y="125" width="120" height="50" rx="7.5" ry="7.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 118px; height: 1px; padding-top: 150px; margin-left: 257px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">Kernel<div>Approximation</div></div></div></div></foreignObject><text x="316" y="155" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">Kernel...</text></switch></g></g></a><g><path d="M 436 197.5 L 385.81 168.22" fill="none" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 378.9 164.19 L 387.82 164.77 L 383.79 171.68 Z" fill="#ff9933" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 186px; margin-left: 408px;"><div data-drawio-colors="color: #CC6600; background-color: #FFCCCC; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Helvetica; color: rgb(204, 102, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 204, 204); white-space: nowrap;"><span style="color: rgb(77, 81, 86); font-family: &quot;Google Sans&quot;, arial, sans-serif; font-size: 16px; font-weight: 400; text-align: start; text-wrap: wrap;">😭</span></div></div></div></foreignObject><text x="408" y="189" fill="#CC6600" font-family="Helvetica" font-size="12px" text-anchor="middle" font-weight="bold">😭</text></switch></g></g><a xlink:href="../../modules/neighbors.html"><g><rect x="216" y="205" width="100" height="50" rx="7.5" ry="7.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 98px; height: 1px; padding-top: 230px; margin-left: 217px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">KNeighbors<div>Classifier</div></div></div></div></foreignObject><text x="266" y="235" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">KNeighbors...</text></switch></g></g></a><g><path d="M 236 295 L 239.59 266.27" fill="none" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 240.58 258.33 L 243.56 266.76 L 235.62 265.77 Z" fill="#ff3333" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 280px; margin-left: 237px;"><div data-drawio-colors="color: #FF3333; background-color: #FFCCCC; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(255, 51, 51); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 204, 204); white-space: nowrap;">NO</div></div></div></foreignObject><text x="237" y="284" fill="#FF3333" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">NO</text></switch></g></g><a xlink:href="../../modules/svm.html#classification"><g><rect x="57.49" y="180" width="90" height="30" rx="4.5" ry="4.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 88px; height: 1px; padding-top: 195px; margin-left: 58px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">SVC</div></div></div></foreignObject><text x="102" y="200" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">SVC</text></switch></g></g></a><a xlink:href="../../modules/ensemble.html"><g><rect x="57.49" y="210" width="90" height="50" rx="7.5" ry="7.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 88px; height: 1px; padding-top: 235px; margin-left: 58px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">Ensemble<div>Classifiers</div></div></div></div></foreignObject><text x="102" y="240" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">Ensemble...</text></switch></g></g></a><g><path d="M 216 230 L 158.78 223.74" fill="none" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 150.82 222.86 L 159.21 219.76 L 158.34 227.71 Z" fill="#ff9933" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 231px; margin-left: 187px;"><div data-drawio-colors="color: #CC6600; background-color: #FFCCCC; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Helvetica; color: rgb(204, 102, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 204, 204); white-space: nowrap;"><span style="color: rgb(77, 81, 86); font-family: &quot;Google Sans&quot;, arial, sans-serif; font-size: 16px; font-weight: 400; text-align: start; text-wrap: wrap;">😭</span></div></div></div></foreignObject><text x="187" y="235" fill="#CC6600" font-family="Helvetica" font-size="12px" text-anchor="middle" font-weight="bold">😭</text></switch></g></g><a xlink:href="../../modules/naive_bayes.html"><g><rect x="72.49" y="295" width="60" height="50" rx="7.5" ry="7.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 58px; height: 1px; padding-top: 320px; margin-left: 73px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">Naive<div>Bayes</div></div></div></div></foreignObject><text x="102" y="325" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">Naive...</text></switch></g></g></a><g><path d="M 196 330 L 143.71 321.77" fill="none" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 135.8 320.52 L 144.33 317.81 L 143.08 325.72 Z" fill="#009900" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 329px; margin-left: 170px;"><div data-drawio-colors="color: #009900; background-color: #FFCCCC; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(0, 153, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 204, 204); white-space: nowrap;">YES</div></div></div></foreignObject><text x="170" y="333" fill="#009900" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">YES</text></switch></g></g><g><rect x="36" y="115" width="170" height="40" fill="none" stroke="none" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 168px; height: 1px; padding-top: 135px; margin-left: 37px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 24px; font-family: Helvetica; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; font-weight: bold; white-space: normal; overflow-wrap: normal;"><span style="font-size: 24px;"><font style="font-size: 24px;" face="Georgia">classification</font></span></div></div></div></foreignObject><text x="121" y="142" fill="rgb(0, 0, 0)" font-family="Helvetica" font-size="24px" text-anchor="middle" font-weight="bold">classification</text></switch></g></g><g><ellipse cx="426" cy="520" rx="40" ry="35" fill="#cce5ff" stroke="#3399ff" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 520px; margin-left: 387px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><div style="font-size: 12px;"><font style="font-size: 12px;"><span style="background-color: initial; font-size: 12px;">number of</span><br style="font-size: 12px;" /></font></div><div style="font-size: 12px;"><font style="font-size: 12px;">categories</font></div><div style="font-size: 12px;"><font style="font-size: 12px;">known</font></div></div></div></div></foreignObject><text x="426" y="524" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="12px" text-anchor="middle">number of...</text></switch></g></g><g><path d="M 596 440 L 465.52 491.68" fill="none" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 458.08 494.63 L 464.05 487.96 L 466.99 495.4 Z" fill="#ff3333" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 466px; margin-left: 540px;"><div data-drawio-colors="color: #FF3333; background-color: #E5CCFF; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(255, 51, 51); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(229, 204, 255); white-space: nowrap;">NO</div></div></div></foreignObject><text x="540" y="469" fill="#FF3333" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">NO</text></switch></g></g><g><ellipse cx="496" cy="620" rx="40" ry="35" fill="#cce5ff" stroke="#3399ff" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 620px; margin-left: 457px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><font style="font-size: 16px;">&lt;10K</font><div style=""><span style=""><font style="font-size: 10px;">samples</font></span></div></div></div></div></foreignObject><text x="496" y="625" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">&lt;10K...</text></switch></g></g><g><ellipse cx="286" cy="570" rx="40" ry="35" fill="#cce5ff" stroke="#3399ff" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 570px; margin-left: 247px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><font style="font-size: 16px;">&lt;10K</font><div style=""><span style=""><font style="font-size: 10px;">samples</font></span></div></div></div></div></foreignObject><text x="286" y="575" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">&lt;10K...</text></switch></g></g><g><path d="M 536 620 L 586.05 633.01" fill="none" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 593.79 635.02 L 585.04 636.88 L 587.05 629.13 Z" fill="#ff3333" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 626px; margin-left: 563px;"><div data-drawio-colors="color: #FF3333; background-color: #E5CCFF; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(255, 51, 51); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(229, 204, 255); white-space: nowrap;">NO</div></div></div></foreignObject><text x="563" y="629" fill="#FF3333" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">NO</text></switch></g></g><g><path d="M 454.97 544.14 L 464.45 584.81" fill="none" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 466.27 592.6 L 460.56 585.71 L 468.35 583.9 Z" fill="#ff3333" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 566px; margin-left: 463px;"><div data-drawio-colors="color: #FF3333; background-color: #E5CCFF; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(255, 51, 51); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(229, 204, 255); white-space: nowrap;">NO</div></div></div></foreignObject><text x="463" y="570" fill="#FF3333" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">NO</text></switch></g></g><g><path d="M 386 520 L 325.63 541.98" fill="none" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 318.12 544.71 L 324.27 538.22 L 327 545.74 Z" fill="#009900" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 534px; margin-left: 359px;"><div data-drawio-colors="color: #009900; background-color: #E5CCFF; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(0, 153, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(229, 204, 255); white-space: nowrap;">YES</div></div></div></foreignObject><text x="359" y="537" fill="#009900" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">YES</text></switch></g></g><a xlink:href="../../modules/clustering.html#mean-shift"><g><rect x="326" y="655" width="90" height="30" rx="4.5" ry="4.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 88px; height: 1px; padding-top: 670px; margin-left: 327px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">MeanShift</div></div></div></foreignObject><text x="371" y="675" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">MeanShift</text></switch></g></g></a><a xlink:href="../../modules/mixture.html#bgmm"><g><rect x="326" y="685" width="90" height="30" rx="4.5" ry="4.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 88px; height: 1px; padding-top: 700px; margin-left: 327px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">VBGMM</div></div></div></foreignObject><text x="371" y="705" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">VBGMM</text></switch></g></g></a><g><path d="M 467.03 644.14 L 425.5 671.29" fill="none" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 418.81 675.66 L 423.31 667.94 L 427.69 674.64 Z" fill="#009900" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 660px; margin-left: 449px;"><div data-drawio-colors="color: #009900; background-color: #E5CCFF; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(0, 153, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(229, 204, 255); white-space: nowrap;">YES</div></div></div></foreignObject><text x="449" y="664" fill="#009900" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">YES</text></switch></g></g><a xlink:href="../../modules/clustering.html#mini-batch-k-means"><g><rect x="191" y="645" width="90" height="50" rx="7.5" ry="7.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 88px; height: 1px; padding-top: 670px; margin-left: 192px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">MiniBatch<div>KMeans</div></div></div></div></foreignObject><text x="236" y="675" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">MiniBatch...</text></switch></g></g></a><g><path d="M 257.03 594.14 L 240.34 634.51" fill="none" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 237.28 641.9 L 236.64 632.98 L 244.04 636.04 Z" fill="#ff3333" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 617px; margin-left: 252px;"><div data-drawio-colors="color: #FF3333; background-color: #E5CCFF; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(255, 51, 51); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(229, 204, 255); white-space: nowrap;">NO</div></div></div></foreignObject><text x="252" y="620" fill="#FF3333" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">NO</text></switch></g></g><g><rect x="38.98" y="605" width="138.51" height="40" fill="none" stroke="none" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 137px; height: 1px; padding-top: 625px; margin-left: 40px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 24px; font-family: Helvetica; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; font-weight: bold; white-space: normal; overflow-wrap: normal;"><span style="font-size: 24px;"><font style="font-size: 24px;" face="Georgia">clustering</font></span></div></div></div></foreignObject><text x="108" y="632" fill="rgb(0, 0, 0)" font-family="Helvetica" font-size="24px" text-anchor="middle" font-weight="bold">clustering</text></switch></g></g><a xlink:href="../../modules/clustering.html#k-means"><g><rect x="177.49" y="465" width="78.51" height="30" rx="4.5" ry="4.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 77px; height: 1px; padding-top: 480px; margin-left: 178px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">KMeans</div></div></div></foreignObject><text x="217" y="485" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">KMeans</text></switch></g></g></a><g><path d="M 257.03 545.86 L 240.65 505.52" fill="none" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 237.63 498.11 L 244.35 504.01 L 236.94 507.02 Z" fill="#009900" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 527px; margin-left: 248px;"><div data-drawio-colors="color: #009900; background-color: #E5CCFF; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(0, 153, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(229, 204, 255); white-space: nowrap;">YES</div></div></div></foreignObject><text x="248" y="531" fill="#009900" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">YES</text></switch></g></g><a xlink:href="../../modules/clustering.html#spectral-clustering"><g><rect x="36" y="505" width="90" height="50" rx="7.5" ry="7.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 88px; height: 1px; padding-top: 530px; margin-left: 37px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><div>Spectral</div><div>Clustering</div></div></div></div></foreignObject><text x="81" y="535" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">Spectral...</text></switch></g></g></a><a xlink:href="../../modules/mixture.html"><g><rect x="36" y="555" width="90" height="30" rx="4.5" ry="4.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 88px; height: 1px; padding-top: 570px; margin-left: 37px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">GMM</div></div></div></foreignObject><text x="81" y="575" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">GMM</text></switch></g></g></a><g><path d="M 177.49 487.5 L 135.81 511.78" fill="none" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 128.9 515.81 L 133.8 508.33 L 137.82 515.24 Z" fill="#ff9933" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 505px; margin-left: 156px;"><div data-drawio-colors="color: #CC6600; background-color: #E5CCFF; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Helvetica; color: rgb(204, 102, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(229, 204, 255); white-space: nowrap;"><span style="color: rgb(77, 81, 86); font-family: &quot;Google Sans&quot;, arial, sans-serif; font-size: 16px; font-weight: 400; text-align: start; text-wrap: wrap;">😭</span></div></div></div></foreignObject><text x="156" y="508" fill="#CC6600" font-family="Helvetica" font-size="12px" text-anchor="middle" font-weight="bold">😭</text></switch></g></g><g><ellipse cx="926" cy="370" rx="40" ry="35" fill="#cce5ff" stroke="#3399ff" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 370px; margin-left: 887px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><font style="font-size: 16px;">&lt;100K</font><div style=""><span style=""><font style="font-size: 10px;">samples</font></span></div></div></div></div></foreignObject><text x="926" y="375" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">&lt;100K...</text></switch></g></g><g><path d="M 828.97 425.86 L 877.89 377.94" fill="none" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 883.6 372.35 L 880.69 380.8 L 875.09 375.09 Z" fill="#009900" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 402px; margin-left: 852px;"><div data-drawio-colors="color: #009900; background-color: rgb(255, 255, 255); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(0, 153, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 255, 255); white-space: nowrap;">YES</div></div></div></foreignObject><text x="852" y="406" fill="#009900" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">YES</text></switch></g></g><g><ellipse cx="1076" cy="380" rx="40" ry="35" fill="#cce5ff" stroke="#3399ff" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 380px; margin-left: 1037px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><div style="font-size: 12px;">few features</div><div style="font-size: 12px;">should be</div><div style="font-size: 12px;">important</div></div></div></div></foreignObject><text x="1076" y="384" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="12px" text-anchor="middle">few features...</text></switch></g></g><g><path d="M 966 370 L 1024.76 378.39" fill="none" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 1032.68 379.53 L 1024.19 382.35 L 1025.33 374.43 Z" fill="#009900" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 373px; margin-left: 996px;"><div data-drawio-colors="color: #009900; background-color: #CCE5FF; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(0, 153, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(204, 229, 255); white-space: nowrap;">YES</div></div></div></foreignObject><text x="996" y="377" fill="#009900" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">YES</text></switch></g></g><a xlink:href="../../modules/sgd.html#regression"><g><rect x="976" y="260" width="90" height="50" rx="7.5" ry="7.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 88px; height: 1px; padding-top: 285px; margin-left: 977px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><div>SGD</div><div>Regressor</div></div></div></div></foreignObject><text x="1021" y="290" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">SGD...</text></switch></g></g></a><g><path d="M 954.97 345.86 L 989.74 317.22" fill="none" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 995.91 312.13 L 992.28 320.31 L 987.19 314.13 Z" fill="#ff3333" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 331px; margin-left: 972px;"><div data-drawio-colors="color: #FF3333; background-color: #CCE5FF; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(255, 51, 51); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(204, 229, 255); white-space: nowrap;">NO</div></div></div></foreignObject><text x="972" y="335" fill="#FF3333" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">NO</text></switch></g></g><a xlink:href="../../modules/linear_model.html#lasso"><g><rect x="1106" y="230" width="90" height="30" rx="4.5" ry="4.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 88px; height: 1px; padding-top: 245px; margin-left: 1107px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">Lasso</div></div></div></foreignObject><text x="1151" y="250" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">Lasso</text></switch></g></g></a><a xlink:href="../../modules/linear_model.html#elastic-net"><g><rect x="1106" y="260" width="90" height="30" rx="4.5" ry="4.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 88px; height: 1px; padding-top: 275px; margin-left: 1107px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">ElasticNet</div></div></div></foreignObject><text x="1151" y="280" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">ElasticNet</text></switch></g></g></a><g><path d="M 1104.97 355.86 L 1124.68 300.69" fill="none" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 1127.37 293.16 L 1128.45 302.04 L 1120.91 299.35 Z" fill="#009900" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 329px; margin-left: 1114px;"><div data-drawio-colors="color: #009900; background-color: #CCE5FF; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(0, 153, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(204, 229, 255); white-space: nowrap;">YES</div></div></div></foreignObject><text x="1114" y="333" fill="#009900" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">YES</text></switch></g></g><a xlink:href="../../modules/linear_model.html#ridge-regression"><g><rect x="1176" y="395" width="140" height="30" rx="4.5" ry="4.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 138px; height: 1px; padding-top: 410px; margin-left: 1177px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">RidgeRegression</div></div></div></foreignObject><text x="1246" y="415" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">RidgeRegression</text></switch></g></g></a><a xlink:href="../../modules/svm.html#regression"><g><rect x="1176" y="425" width="140" height="30" rx="4.5" ry="4.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 138px; height: 1px; padding-top: 440px; margin-left: 1177px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">SVR<font style="font-size: 12px;">(kernel="linear")</font></div></div></div></foreignObject><text x="1246" y="445" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">SVR(kernel="linea...</text></switch></g></g></a><g><path d="M 1116 380 L 1165.84 404.92" fill="none" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 1173 408.5 L 1164.06 408.5 L 1167.63 401.34 Z" fill="#ff3333" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 391px; margin-left: 1142px;"><div data-drawio-colors="color: #FF3333; background-color: #CCE5FF; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(255, 51, 51); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(204, 229, 255); white-space: nowrap;">NO</div></div></div></foreignObject><text x="1142" y="395" fill="#FF3333" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">NO</text></switch></g></g><a xlink:href="../../modules/svm.html#regression"><g><rect x="1266" y="255" width="120" height="30" rx="4.5" ry="4.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 118px; height: 1px; padding-top: 270px; margin-left: 1267px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">SVR<font style="font-size: 12px;">(kernel="rbf")</font></div></div></div></foreignObject><text x="1326" y="275" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">SVR(kernel="rbf...</text></switch></g></g></a><a xlink:href="../../modules/ensemble.html"><g><rect x="1266" y="285" width="120" height="50" rx="7.5" ry="7.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 118px; height: 1px; padding-top: 310px; margin-left: 1267px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">Ensemble<div>Regressors</div></div></div></div></foreignObject><text x="1326" y="315" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">Ensemble...</text></switch></g></g></a><g><path d="M 1281 395 L 1293.25 346.01" fill="none" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 1295.19 338.25 L 1297.13 346.99 L 1289.37 345.04 Z" fill="#ff9933" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 370px; margin-left: 1285px;"><div data-drawio-colors="color: #CC6600; background-color: #CCE5FF; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Helvetica; color: rgb(204, 102, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(204, 229, 255); white-space: nowrap;"><span style="color: rgb(77, 81, 86); font-family: &quot;Google Sans&quot;, arial, sans-serif; font-size: 16px; font-weight: 400; text-align: start; text-wrap: wrap;">😭</span></div></div></div></foreignObject><text x="1285" y="373" fill="#CC6600" font-family="Helvetica" font-size="12px" text-anchor="middle" font-weight="bold">😭</text></switch></g></g><g><rect x="886" y="205" width="140" height="40" fill="none" stroke="none" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 138px; height: 1px; padding-top: 225px; margin-left: 887px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 24px; font-family: Helvetica; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; font-weight: bold; white-space: normal; overflow-wrap: normal;"><span style="font-size: 24px;"><font style="font-size: 24px;" face="Georgia">regression</font></span></div></div></div></foreignObject><text x="956" y="232" fill="rgb(0, 0, 0)" font-family="Helvetica" font-size="24px" text-anchor="middle" font-weight="bold">regression</text></switch></g></g><a xlink:href="../../modules/decomposition.html#principal-component-analysis-pca"><g><rect x="901" y="535" width="110" height="50" rx="7.5" ry="7.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 108px; height: 1px; padding-top: 560px; margin-left: 902px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><div><span style="background-color: initial;">Ramdomized</span><br /></div><div><span style="background-color: initial;">PCA</span></div></div></div></div></foreignObject><text x="956" y="565" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">Ramdomized...</text></switch></g></g></a><g><path d="M 796 560 L 889.65 560" fill="none" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 897.65 560 L 889.65 564 L 889.65 556 Z" fill="#009900" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 559px; margin-left: 839px;"><div data-drawio-colors="color: #009900; background-color: rgb(255, 255, 255); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(0, 153, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 255, 255); white-space: nowrap;">YES</div></div></div></foreignObject><text x="839" y="563" fill="#009900" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">YES</text></switch></g></g><g><ellipse cx="941" cy="680" rx="40" ry="35" fill="#cce5ff" stroke="#3399ff" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 78px; height: 1px; padding-top: 680px; margin-left: 902px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><font style="font-size: 16px;">&lt;10K</font><div style=""><span style=""><font style="font-size: 10px;">samples</font></span></div></div></div></div></foreignObject><text x="941" y="685" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">&lt;10K...</text></switch></g></g><g><path d="M 956 585 L 943.75 633.99" fill="none" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 941.81 641.75 L 939.87 633.01 L 947.63 634.96 Z" fill="#ff9933" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 613px; margin-left: 953px;"><div data-drawio-colors="color: #CC6600; background-color: #FFFFCC; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Helvetica; color: rgb(204, 102, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 255, 204); white-space: nowrap;"><span style="color: rgb(77, 81, 86); font-family: &quot;Google Sans&quot;, arial, sans-serif; font-size: 16px; font-weight: 400; text-align: start; text-wrap: wrap;">😭</span></div></div></div></foreignObject><text x="953" y="616" fill="#CC6600" font-family="Helvetica" font-size="12px" text-anchor="middle" font-weight="bold">😭</text></switch></g></g><a xlink:href="../../modules/kernel_approximation.html"><g><rect x="1056" y="675" width="120" height="50" rx="7.5" ry="7.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 118px; height: 1px; padding-top: 700px; margin-left: 1057px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">Kernel<div>Approximation</div></div></div></div></foreignObject><text x="1116" y="705" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">Kernel...</text></switch></g></g></a><g><path d="M 981 680 L 1044.7 686.37" fill="none" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 1052.66 687.17 L 1044.3 690.35 L 1045.1 682.39 Z" fill="#ff3333" stroke="#ff3333" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 682px; margin-left: 1013px;"><div data-drawio-colors="color: #FF3333; background-color: #FFFFCC; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(255, 51, 51); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 255, 204); white-space: nowrap;">NO</div></div></div></foreignObject><text x="1013" y="686" fill="#FF3333" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">NO</text></switch></g></g><a xlink:href="../../modules/manifold.html#isomap"><g><rect x="1066" y="555" width="100" height="30" rx="4.5" ry="4.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 98px; height: 1px; padding-top: 570px; margin-left: 1067px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">IsoMap</div></div></div></foreignObject><text x="1116" y="575" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">IsoMap</text></switch></g></g></a><a xlink:href="../../modules/manifold.html#spectral-embedding"><g><rect x="1066" y="585" width="100" height="50" rx="7.5" ry="7.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 98px; height: 1px; padding-top: 610px; margin-left: 1067px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;"><div>Spectral</div><div>Embedding</div></div></div></div></foreignObject><text x="1116" y="615" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">Spectral...</text></switch></g></g></a><g><path d="M 969.97 655.86 L 1055.27 626.23" fill="none" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 1062.83 623.6 L 1056.59 630 L 1053.96 622.45 Z" fill="#009900" stroke="#009900" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 641px; margin-left: 1010px;"><div data-drawio-colors="color: #009900; background-color: #FFFFCC; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Georgia; color: rgb(0, 153, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 255, 204); white-space: nowrap;">YES</div></div></div></foreignObject><text x="1010" y="645" fill="#009900" font-family="Georgia" font-size="12px" text-anchor="middle" font-weight="bold">YES</text></switch></g></g><a xlink:href="../../modules/manifold.html#locally-linear-embedding"><g><rect x="1246" y="615" width="50" height="30" rx="4.5" ry="4.5" fill="#ccffe6" stroke="#00cc66" stroke-width="5" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 48px; height: 1px; padding-top: 630px; margin-left: 1247px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 16px; font-family: Georgia; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; white-space: normal; overflow-wrap: normal;">LLE</div></div></div></foreignObject><text x="1271" y="635" fill="rgb(0, 0, 0)" font-family="Georgia" font-size="16px" text-anchor="middle">LLE</text></switch></g></g></a><g><path d="M 1166 610 L 1234.99 627.25" fill="none" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="stroke"/><path d="M 1242.75 629.19 L 1234.01 631.13 L 1235.96 623.37 Z" fill="#ff9933" stroke="#ff9933" stroke-width="3" stroke-miterlimit="10" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 1px; height: 1px; padding-top: 617px; margin-left: 1201px;"><div data-drawio-colors="color: #CC6600; background-color: #FFFFCC; " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 12px; font-family: Helvetica; color: rgb(204, 102, 0); line-height: 1.2; pointer-events: all; font-weight: bold; background-color: rgb(255, 255, 204); white-space: nowrap;"><span style="color: rgb(77, 81, 86); font-family: &quot;Google Sans&quot;, arial, sans-serif; font-size: 16px; font-weight: 400; text-align: start; text-wrap: wrap;">😭</span></div></div></div></foreignObject><text x="1201" y="620" fill="#CC6600" font-family="Helvetica" font-size="12px" text-anchor="middle" font-weight="bold">😭</text></switch></g></g><g><rect x="1196" y="667" width="210" height="65" fill="none" stroke="none" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe center; width: 208px; height: 1px; padding-top: 700px; margin-left: 1197px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: center;"><div style="display: inline-block; font-size: 24px; font-family: Helvetica; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; font-weight: bold; white-space: normal; overflow-wrap: normal;"><span style="font-size: 24px;"><font style="font-size: 24px;" face="Georgia">dimensionality</font></span><div><span style="font-size: 24px;"><font style="font-size: 24px;" face="Georgia">reduction</font></span></div></div></div></div></foreignObject><text x="1301" y="707" fill="rgb(0, 0, 0)" font-family="Helvetica" font-size="24px" text-anchor="middle" font-weight="bold">dimensionality...</text></switch></g></g><g><image x="1165.5" y="14.5" width="166.92" height="90" xlink:href="data:image/svg+xml;base64,<svg xmlns="http://www.w3.org/2000/svg" width="1251" viewBox="0 0 1251 675" height="675"><path fill="#f89939" d="m959.940063 573.065979c152.410401-152.40155 177.740967-374.157013 56.573914-495.315063-121.148987-121.144471-342.895386-95.818482-495.296936 56.573974-152.40155 152.397125-108.314972 443.556091-56.564972 495.315003 41.818482 41.818542 342.895538 95.818542 495.287994-56.573914z"/><path fill="#3499cd" d="m334.575043 352.849548c-88.415985-88.416046-217.089035-103.135528-287.401535-32.827575-70.294476 70.299041-55.597481 198.98999 32.836487 287.392578 88.434036 88.442993 257.377548 62.860473 287.383529 32.827453 24.281983-24.241455 55.624481-198.967468-32.818481-287.392456z"/><g fill="#010101"><path d="m639.643494 535.711487c-15.619507 14.377502-29.322022 24.988525-41.09845 31.805969-11.77655 6.840088-23.008545 10.255493-33.696045 10.255493-12.293945 0-22.212036-4.765503-29.731445-14.300903-7.53302-9.544556-11.286011-22.342529-11.286011-38.443543 0-24.12445 5.228943-53.086486 15.686951-86.854461 10.440063-33.795044 23.152527-64.935089 38.083496-93.424561l43.780456-16.208954c1.37262-.459106 2.416565-.692962 3.109558-.692962 3.321045 0 6.065979 2.447876 8.172059 7.321411 2.128417 4.896057 3.199462 11.474945 3.199462 19.746002 0 23.440582-5.395507 46.134064-16.208923 68.080505-10.809082 21.955475-27.693054 45.386963-50.670044 70.321534-.922546 11.951904-1.381531 20.159912-1.381531 24.646484 0 10.003418 1.835999 17.918945 5.512513 23.782471 3.680969 5.872497 8.55896 8.788574 14.651977 8.788574 6.214478 0 12.81604-2.223145 19.827026-6.705139 6.997559-4.490906 17.685059-13.787964 32.044434-27.931458v19.813538zm-66.005982-67.378479c14.589051-16.222534 26.4375-34.416016 35.509461-54.544495 9.072082-20.137512 13.603576-37.458008 13.603576-51.97055 0-4.230011-.625549-7.667908-1.881042-10.250916-1.264527-2.587555-2.884461-3.888061-4.833008-3.888061-4.234436 0-10.421936 10.583953-18.526489 31.75653-8.104492 21.16803-16.060547 50.805024-23.872498 88.897492z"/><path d="m768.577576 535.711487c-14.589051 14.377502-27.684021 24.988525-39.294007 31.805969-11.610046 6.840088-24.40802 10.255493-38.43457 10.255493-15.628418 0-28.237427-4.999511-37.844971-14.984985-9.589416-10.012512-14.377441-23.156983-14.377441-39.478516 0-24.353943 8.4375-46.390472 25.348511-66.095947 16.875-19.714569 35.612976-29.565063 56.178039-29.565063 10.6875 0 19.237488 2.767608 25.681519 8.279998 6.434936 5.521576 9.652405 12.753083 9.652405 21.717072 0 23.791443-25.27649 43.083038-75.833924 57.910461 4.589966 22.396607 16.595947 33.610474 36.018006 33.610474 7.586853 0 14.818481-2.038513 21.707885-6.106506 6.907471-4.085938 17.298096-13.148926 31.203064-27.157471v19.809021zm-90.315064-31.878052c29.407532-8.279999 44.12262-23.552917 44.12262-45.845947 0-11.02948-4.027588-16.541992-12.06012-16.541992-7.586975 0-14.818481 5.764526-21.708008 17.325012-6.911926 11.542541-10.354492 26.554504-10.354492 45.062927z"/><path d="m952.654419 535.711487c-18.386963 17.464538-31.545044 28.853943-39.464905 34.146057-7.929138 5.282898-15.511597 7.919922-22.756531 7.919922-18.157531 0-26.712036-16.024536-25.681518-48.087036-11.488526 16.42511-22.095032 28.548095-31.805969 36.378051-9.702027 7.812012-19.723511 11.708985-30.078125 11.708985-10.097901 0-18.683899-4.729492-25.762391-14.210938-7.078613-9.481506-10.593017-21.109558-10.593017-34.91101 0-17.226014 4.729492-33.660035 14.201904-49.297577 9.49054-15.628449 21.640625-28.255463 36.459107-37.907929 14.818481-9.652588 27.931518-14.485473 39.293945-14.485473 14.368469 0 24.426086 6.610473 30.172485 19.817993l35.226013-19.467102h9.666016l-15.214538 50.494537c-7.811951 25.402435-11.731507 42.813019-11.731507 52.231476 0 9.877502 3.496582 14.818481 10.512024 14.818481 4.463989 0 9.404968-2.380432 14.80957-7.154968 5.404419-4.774536 12.97345-12.041992 22.738404-21.807007v19.813538zm-126.166443 9.490539c11.488403 0 22.31543-9.791992 32.503479-29.380615 10.170044-19.597412 15.250549-37.678406 15.250549-54.220398 0-6.426025-1.449096-11.461487-4.306518-15.075012-2.884583-3.631531-6.731995-5.431519-11.547058-5.431519-11.497437 0-22.396424 9.765076-32.66095 29.303956-10.282532 19.539062-15.434998 37.521057-15.434998 53.937133 0 6.214417 1.53003 11.240906 4.571961 15.092896 3.041992 3.852051 6.903015 5.773559 11.623535 5.773559z"/><path d="m1081.412964 535.711487c-28.844971 28.264526-51.083985 42.40802-66.708008 42.40802-7.015442 0-12.9375-2.96106-17.752563-8.860596-4.814881-5.921875-7.240357-13.25238-7.240357-21.991455 0-16.200012 8.684937-37.907898 26.032471-65.146454-8.509583 4.369538-17.806458 7.402436-27.922547 9.130463-7.470031 13.787964-19.19696 28.615539-35.162963 44.455505h-3.955506v-15.493469c8.954956-9.305969 17.059448-19.30957 24.299988-29.99707-9.895569-4.369416-14.827454-10.862885-14.827454-19.46698 0-8.860474 3.005982-18.30597 9.053955-28.372437 6.03003-10.044006 14.328003-15.065979 24.907532-15.065979 8.963928 0 13.436951 4.580872 13.436951 13.778931 0 7.240539-2.583008 17.577026-7.762512 31.027588 19.071045-2.074524 35.734558-16.654602 49.990539-43.780518l15.678101-.693115-16.029053 44.12262c-6.660034 18.616455-10.970947 31.297424-12.919556 38.011444-1.948608 6.714019-2.934082 12.672027-2.934082 17.833587 0 4.832886 1.125 8.693848 3.357056 11.546875 2.241089 2.893555 5.265015 4.315552 9.053955 4.315552 4.130982 0 8.104614-1.412964 11.893555-4.212036 3.789062-2.839539 12.293945-10.615479 25.515014-23.368408v19.817932z"/><path d="m1250.676025 535.711487c-26.541015 28.053039-49.306518 42.065979-68.255981 42.065979-7.699463 0-13.905029-2.700073-18.616455-8.104492-4.720581-5.395508-7.074097-12.631531-7.074097-21.708008 0-12.294007 5.0625-31.085938 15.178589-56.353424 5.395508-13.563019 8.104492-22.194031 8.104492-25.857025 0-3.681092-1.448974-5.521576-4.306518-5.521576-1.606568 0-3.744019.810089-6.380982 2.407501-2.425537 1.606506-5.238037 3.865539-8.455566 6.732025-2.866455 2.636993-6.093018 5.854462-9.652466 9.63446-3.109497 3.244538-6.44397 6.916596-9.985596 11.038514l-9.665893 11.214019c-4.243408 5.166047-6.889527 10.61554-7.920044 16.366456-1.732544 9.765075-2.875488 18.738037-3.456055 26.905517-.350952 6.075012-.517456 14.283081-.517456 24.646607l-38.092407 8.945861c-1.255493-15.511413-1.899048-27.062866-1.899048-34.636413 0-18.499451 2.155518-36.026917 6.470947-52.569031 4.306519-16.559998 11.223145-35.162994 20.767456-55.853943l42.048096-8.095581c-8.842407 23.791596-14.642944 42.511597-17.401489 56.17804 18.845947-21.023987 33.786011-35.577027 44.860473-43.69043 11.056519-8.104614 20.902466-12.136597 29.506592-12.136597 5.845337 0 10.7323 2.205109 14.625 6.619568 3.910401 4.418945 5.85437 9.967468 5.85437 16.600464 0 11.020508-4.940918 29.17804-14.80957 54.468018-6.785889 17.343017-10.178955 28.597534-10.178955 33.795044 0 6.916442 2.821655 10.372497 8.4646 10.372497 8.401489 0 22.009399-11.092529 40.787963-33.268555z"/></g><path fill="none" d="m692.743469 295.258514h1013.589051v377.766022h-1013.589051z"/><text y="370" x="688" font-size="103.85775" font-family="Helvetica" fill="#fff">scikit</text><path fill="none" d="m1015.055969 620.905518h1464.444031v193.333557h-1464.444031z"/></svg>" preserveAspectRatio="none"/></g><g><rect x="953.5" y="65" width="375" height="90" fill="none" stroke="none" pointer-events="all"/></g><g><g transform="translate(-0.5 -0.5)"><switch><foreignObject pointer-events="none" width="100%" height="100%" requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility" style="overflow: visible; text-align: left;"><div xmlns="http://www.w3.org/1999/xhtml" style="display: flex; align-items: unsafe center; justify-content: unsafe flex-start; width: 373px; height: 1px; padding-top: 110px; margin-left: 956px;"><div data-drawio-colors="color: rgb(0, 0, 0); " style="box-sizing: border-box; font-size: 0px; text-align: left;"><div style="display: inline-block; font-size: 32px; font-family: Helvetica; color: rgb(0, 0, 0); line-height: 1.2; pointer-events: all; font-weight: bold; white-space: normal; overflow-wrap: normal;"><span style="font-size: 32px;"><font style="font-size: 32px;" face="Georgia">scikit-learn</font></span><div style="font-size: 32px;"><span style="font-size: 32px;"><font style="font-size: 32px;" face="Georgia">algorithm cheat sheet</font></span></div></div></div></div></foreignObject><text x="956" y="120" fill="rgb(0, 0, 0)" font-family="Helvetica" font-size="32px" font-weight="bold">scikit-learn...</text></switch></g></g></g><switch><g requiredFeatures="http://www.w3.org/TR/SVG11/feature#Extensibility"/><a transform="translate(0,-5)" xlink:href="https://www.drawio.com/doc/faq/svg-export-text-problems" target="_blank"><text text-anchor="middle" font-size="10px" x="50%" y="100%">Text is not SVG - cannot display</text></a></switch></svg>
diff --git a/doc/includes/big_toc_css.rst b/doc/includes/big_toc_css.rst
deleted file mode 100644
index a8ba83e99c5b8..0000000000000
--- a/doc/includes/big_toc_css.rst
+++ /dev/null
@@ -1,40 +0,0 @@
-..  
-    File to ..include in a document with a big table of content, to give
-    it 'style'
-
-.. raw:: html
-
-  <style type="text/css">
-    div.body div.toctree-wrapper ul {
-        padding-left: 0;
-    }
-
-    div.body li.toctree-l1 {
-        padding: 0 0 0.5em 0;
-        list-style-type: none;
-        font-size: 150%;
-        font-weight: bold;
-    }
-
-    div.body li.toctree-l2 {
-        font-size: 70%;
-        list-style-type: square;
-        font-weight: normal;
-        margin-left: 40px;
-    }
-
-    div.body li.toctree-l3 {
-        font-size: 85%;
-        list-style-type: circle;
-        font-weight: normal;
-        margin-left: 40px;
-    }
-
-    div.body li.toctree-l4 {
-        margin-left: 40px;
-    }
- 
-  </style>
-
-
-
diff --git a/doc/includes/bigger_toc_css.rst b/doc/includes/bigger_toc_css.rst
deleted file mode 100644
index d866bd145d883..0000000000000
--- a/doc/includes/bigger_toc_css.rst
+++ /dev/null
@@ -1,60 +0,0 @@
-..  
-    File to ..include in a document with a very big table of content, to 
-    give it 'style'
-
-.. raw:: html
-
-  <style type="text/css">
-    div.bodywrapper blockquote {
-        margin: 0 ;
-    }
-
-    div.toctree-wrapper ul {
-	margin: 0 ;
-	padding-left: 0px ;
-    }
-
-    li.toctree-l1 {
-        padding: 0 ;
-        list-style-type: none;
-        font-size: 150% ;
-	font-family: Arial, sans-serif;
-	background-color: #BED4EB;
-	font-weight: normal;
-	color: #212224;
-	margin-left : 0;
-	font-weight: bold;
-        }
-
-    li.toctree-l1 a {
-        padding: 0 0 0 10px ;
-    }
- 
-    li.toctree-l2 {
-        padding: 0.25em 0 0.25em 0 ;
-        list-style-type: none;
-	background-color: #FFFFFF;
-        font-size: 90% ;
-	font-weight: bold;
-        }
-
-    li.toctree-l2 ul {
-	padding-left: 40px ;
-    }
-
-    li.toctree-l3 {
-        font-size: 70% ;
-        list-style-type: none;
-	font-weight: normal;
-        }
-
-    li.toctree-l4 {
-        font-size: 85% ;
-        list-style-type: none;
-	font-weight: normal;
-        }
- 
-  </style>
-
-
-
diff --git a/doc/index.rst.template b/doc/index.rst.template
new file mode 100644
index 0000000000000..f1f1f49836515
--- /dev/null
+++ b/doc/index.rst.template
@@ -0,0 +1,24 @@
+.. title:: Index
+
+.. Define the overall structure, that affects the prev-next buttons and the order
+   of the sections in the top navbar.
+
+.. toctree::
+   :hidden:
+   :maxdepth: 2
+
+   Install <install>
+   user_guide
+   API <api/index>
+   auto_examples/index
+   Community <https://blog.scikit-learn.org/>
+   getting_started
+   whats_new
+   Glossary <glossary>
+   Development <{{ development_link }}>
+   FAQ <faq>
+   support
+   related_projects
+   roadmap
+   Governance <governance>
+   about
diff --git a/doc/inspection.rst b/doc/inspection.rst
index 57c1cfc3275e8..95d121ec10d7d 100644
--- a/doc/inspection.rst
+++ b/doc/inspection.rst
@@ -1,9 +1,3 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
-.. include:: includes/big_toc_css.rst
-
 .. _inspection:
 
 Inspection
@@ -21,9 +15,9 @@ predictions from a model and what affects them. This can be used to
 evaluate assumptions and biases of a model, design a better model, or
 to diagnose issues with model performance.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-   * :ref:`sphx_glr_auto_examples_inspection_plot_linear_model_coefficient_interpretation.py`
+* :ref:`sphx_glr_auto_examples_inspection_plot_linear_model_coefficient_interpretation.py`
 
 .. toctree::
 
diff --git a/doc/install.rst b/doc/install.rst
index c4a3548016021..3d11b506473ee 100644
--- a/doc/install.rst
+++ b/doc/install.rst
@@ -6,21 +6,21 @@ Installing scikit-learn
 
 There are different ways to install scikit-learn:
 
-  * :ref:`Install the latest official release <install_official_release>`. This
-    is the best approach for most users. It will provide a stable version
-    and pre-built packages are available for most platforms.
+* :ref:`Install the latest official release <install_official_release>`. This
+  is the best approach for most users. It will provide a stable version
+  and pre-built packages are available for most platforms.
 
-  * Install the version of scikit-learn provided by your
-    :ref:`operating system or Python distribution <install_by_distribution>`.
-    This is a quick option for those who have operating systems or Python
-    distributions that distribute scikit-learn.
-    It might not provide the latest release version.
+* Install the version of scikit-learn provided by your
+  :ref:`operating system or Python distribution <install_by_distribution>`.
+  This is a quick option for those who have operating systems or Python
+  distributions that distribute scikit-learn.
+  It might not provide the latest release version.
 
-  * :ref:`Building the package from source
-    <install_bleeding_edge>`. This is best for users who want the
-    latest-and-greatest features and aren't afraid of running
-    brand-new code. This is also needed for users who wish to contribute to the
-    project.
+* :ref:`Building the package from source
+  <install_bleeding_edge>`. This is best for users who want the
+  latest-and-greatest features and aren't afraid of running
+  brand-new code. This is also needed for users who wish to contribute to the
+  project.
 
 
 .. _install_official_release:
@@ -28,117 +28,141 @@ There are different ways to install scikit-learn:
 Installing the latest release
 =============================
 
-.. This quickstart installation is a hack of the awesome
-   https://spacy.io/usage/#quickstart page.
-   See the original javascript implementation
-   https://github.com/ines/quickstart
-
-
-.. raw:: html
-
-  <div class="install">
-       <strong>Operating System</strong>
-          <input type="radio" name="os" id="quickstart-win" checked>
-          <label for="quickstart-win">Windows</label>
-          <input type="radio" name="os" id="quickstart-mac">
-          <label for="quickstart-mac">macOS</label>
-          <input type="radio" name="os" id="quickstart-lin">
-          <label for="quickstart-lin">Linux</label><br />
-       <strong>Packager</strong>
-          <input type="radio" name="packager" id="quickstart-pip" checked>
-          <label for="quickstart-pip">pip</label>
-          <input type="radio" name="packager" id="quickstart-conda">
-          <label for="quickstart-conda">conda</label><br />
-          <input type="checkbox" name="config" id="quickstart-venv">
-          <label for="quickstart-venv"></label>
-       </span>
-
-.. raw:: html
-
-       <div>
-         <span class="sk-expandable" data-packager="pip" data-os="windows">Install the 64bit version of Python 3, for instance from <a href="https://www.python.org/">https://www.python.org</a>.</span
-         ><span class="sk-expandable" data-packager="pip" data-os="mac">Install Python 3 using <a href="https://brew.sh/">homebrew</a> (<code>brew install python</code>) or by manually installing the package from <a href="https://www.python.org">https://www.python.org</a>.</span
-         ><span class="sk-expandable" data-packager="pip" data-os="linux">Install python3 and python3-pip using the package manager of the Linux Distribution.</span
-         ><span class="sk-expandable" data-packager="conda"
-            >Install conda using the <a href="https://docs.conda.io/projects/conda/en/latest/user-guide/install/">Anaconda or miniconda</a>
-             installers or the <a href="https://github.com/conda-forge/miniforge#miniforge">miniforge</a> installers
-             (no administrator permission required for any of those).</span>
-       </div>
-
-Then run:
-
-.. raw:: html
-
-  <div class="highlight">
-    <pre class="sk-expandable" data-packager="pip" data-os="linux" data-venv="no"
-    ><span>pip3 install -U scikit-learn</span></pre>
-
-    <pre class="sk-expandable" data-packager="pip" data-os="windows" data-venv="no"
-    ><span>pip install -U scikit-learn</span></pre>
-
-    <pre class="sk-expandable" data-packager="pip" data-os="mac" data-venv="no"
-    ><span>pip install -U scikit-learn</span></pre>
-
-    <pre class="sk-expandable" data-packager="pip" data-os="linux" data-venv=""
-    ><span>python3 -m venv sklearn-venv</span>
-  <span>source sklearn-venv/bin/activate</span>
-  <span>pip3 install -U scikit-learn</span></pre>
-
-    <pre class="sk-expandable" data-packager="pip" data-os="windows" data-venv=""
-    ><span>python -m venv sklearn-venv</span>
-  <span>sklearn-venv\Scripts\activate</span>
-  <span>pip install -U scikit-learn</span></pre>
-
-    <pre class="sk-expandable" data-packager="pip" data-os="mac" data-venv=""
-    ><span>python -m venv sklearn-venv</span>
-  <span>source sklearn-venv/bin/activate</span>
-  <span>pip install -U scikit-learn</span></pre>
-
-    <pre class="sk-expandable" data-packager="conda"
-    ><span>conda create -n sklearn-env -c conda-forge scikit-learn</span>
-  <span>conda activate sklearn-env</span></pre>
-  </div>
-
-In order to check your installation you can use
-
-.. raw:: html
-
-  <div class="highlight">
-    <pre class="sk-expandable" data-packager="pip" data-os="linux" data-venv="no"
-    ><span>python3 -m pip show scikit-learn  # to see which version and where scikit-learn is installed</span>
-  <span>python3 -m pip freeze  # to see all packages installed in the active virtualenv</span>
-  <span>python3 -c "import sklearn; sklearn.show_versions()"</span></pre>
-
-    <pre class="sk-expandable" data-packager="pip" data-os="windows" data-venv="no"
-    ><span>python -m pip show scikit-learn  # to see which version and where scikit-learn is installed</span>
-  <span>python -m pip freeze  # to see all packages installed in the active virtualenv</span>
-  <span>python -c "import sklearn; sklearn.show_versions()"</span></pre>
-
-    <pre class="sk-expandable" data-packager="pip" data-os="mac" data-venv="no"
-    ><span>python -m pip show scikit-learn  # to see which version and where scikit-learn is installed</span>
-  <span>python -m pip freeze  # to see all packages installed in the active virtualenv</span>
-  <span>python -c "import sklearn; sklearn.show_versions()"</span></pre>
-
-    <pre class="sk-expandable" data-packager="pip" data-venv=""
-    ><span>python -m pip show scikit-learn  # to see which version and where scikit-learn is installed</span>
-  <span>python -m pip freeze  # to see all packages installed in the active virtualenv</span>
-  <span>python -c "import sklearn; sklearn.show_versions()"</span></pre>
-
-    <pre class="sk-expandable" data-packager="conda"
-    ><span>conda list scikit-learn  # to see which scikit-learn version is installed</span>
-  <span>conda list  # to see all packages installed in the active conda environment</span>
-  <span>python -c "import sklearn; sklearn.show_versions()"</span></pre>
-  </div>
-
-Note that in order to avoid potential conflicts with other packages it is
-strongly recommended to use a `virtual environment (venv)
-<https://docs.python.org/3/tutorial/venv.html>`_ or a `conda environment
-<https://docs.conda.io/projects/conda/en/latest/user-guide/tasks/manage-environments.html>`_.
-
-Using such an isolated environment makes it possible to install a specific
-version of scikit-learn with pip or conda and its dependencies independently of
-any previously installed Python packages. In particular under Linux is it
-discouraged to install pip packages alongside the packages managed by the
+.. `scss/install.scss` overrides some default sphinx-design styling for the tabs
+
+.. div:: install-instructions
+
+  .. tab-set::
+    :class: tabs-os
+
+    .. tab-item:: Windows
+      :class-label: tab-4
+
+      .. tab-set::
+        :class: tabs-package-manager
+
+        .. tab-item:: pip
+          :class-label: tab-6
+          :sync: package-manager-pip
+
+          Install the 64-bit version of Python 3, for instance from the
+          `official website <https://www.python.org/downloads/windows/>`__.
+
+          Now create a `virtual environment (venv)
+          <https://docs.python.org/3/tutorial/venv.html>`_ and install scikit-learn.
+          Note that the virtual environment is optional but strongly recommended, in
+          order to avoid potential conflicts with other packages.
+
+          .. prompt:: powershell
+
+            python -m venv sklearn-env
+            sklearn-env\Scripts\activate  # activate
+            pip install -U scikit-learn
+
+          In order to check your installation, you can use:
+
+          .. prompt:: powershell
+
+            python -m pip show scikit-learn  # show scikit-learn version and location
+            python -m pip freeze             # show all installed packages in the environment
+            python -c "import sklearn; sklearn.show_versions()"
+
+        .. tab-item:: conda
+          :class-label: tab-6
+          :sync: package-manager-conda
+
+          .. include:: ./install_instructions_conda.rst
+
+    .. tab-item:: MacOS
+      :class-label: tab-4
+
+      .. tab-set::
+        :class: tabs-package-manager
+
+        .. tab-item:: pip
+          :class-label: tab-6
+          :sync: package-manager-pip
+
+          Install Python 3 using `homebrew <https://brew.sh/>`_ (`brew install python`)
+          or by manually installing the package from the `official website
+          <https://www.python.org/downloads/macos/>`__.
+
+          Now create a `virtual environment (venv)
+          <https://docs.python.org/3/tutorial/venv.html>`_ and install scikit-learn.
+          Note that the virtual environment is optional but strongly recommended, in
+          order to avoid potential conflicts with other packges.
+
+          .. prompt:: bash
+
+            python -m venv sklearn-env
+            source sklearn-env/bin/activate  # activate
+            pip install -U scikit-learn
+
+          In order to check your installation, you can use:
+
+          .. prompt:: bash
+
+            python -m pip show scikit-learn  # show scikit-learn version and location
+            python -m pip freeze             # show all installed packages in the environment
+            python -c "import sklearn; sklearn.show_versions()"
+
+        .. tab-item:: conda
+          :class-label: tab-6
+          :sync: package-manager-conda
+
+          .. include:: ./install_instructions_conda.rst
+
+    .. tab-item:: Linux
+      :class-label: tab-4
+
+      .. tab-set::
+        :class: tabs-package-manager
+
+        .. tab-item:: pip
+          :class-label: tab-6
+          :sync: package-manager-pip
+
+          Python 3 is usually installed by default on most Linux distributions. To
+          check if you have it installed, try:
+
+          .. prompt:: bash
+
+            python3 --version
+            pip3 --version
+
+          If you don't have Python 3 installed, please install `python3` and
+          `python3-pip` from your distribution's package manager.
+
+          Now create a `virtual environment (venv)
+          <https://docs.python.org/3/tutorial/venv.html>`_ and install scikit-learn.
+          Note that the virtual environment is optional but strongly recommended, in
+          order to avoid potential conflicts with other packages.
+
+          .. prompt:: bash
+
+            python3 -m venv sklearn-env
+            source sklearn-env/bin/activate  # activate
+            pip3 install -U scikit-learn
+
+          In order to check your installation, you can use:
+
+          .. prompt:: bash
+
+            python3 -m pip show scikit-learn  # show scikit-learn version and location
+            python3 -m pip freeze             # show all installed packages in the environment
+            python3 -c "import sklearn; sklearn.show_versions()"
+
+        .. tab-item:: conda
+          :class-label: tab-6
+          :sync: package-manager-conda
+
+          .. include:: ./install_instructions_conda.rst
+
+
+Using an isolated environment such as pip venv or conda makes it possible to
+install a specific version of scikit-learn with pip or conda and its dependencies
+independently of any previously installed Python packages. In particular under Linux
+it is discouraged to install pip packages alongside the packages managed by the
 package manager of the distribution (apt, dnf, pacman...).
 
 Note that you should always remember to activate the environment of your choice
@@ -150,11 +174,10 @@ and NumPy and SciPy are not recompiled from source, which can happen when using
 particular configurations of operating system and hardware (such as Linux on
 a Raspberry Pi).
 
-
-Scikit-learn plotting capabilities (i.e., functions start with "plot\_"
-and classes end with "Display") require Matplotlib. The examples require
+Scikit-learn plotting capabilities (i.e., functions starting with `plot\_`
+and classes ending with `Display`) require Matplotlib. The examples require
 Matplotlib and some examples require scikit-image, pandas, or seaborn. The
-minimum version of Scikit-learn dependencies are listed below along with its
+minimum version of scikit-learn dependencies are listed below along with its
 purpose.
 
 .. include:: min_dependency_table.rst
@@ -164,10 +187,10 @@ purpose.
     Scikit-learn 0.20 was the last version to support Python 2.7 and Python 3.4.
     Scikit-learn 0.21 supported Python 3.5-3.7.
     Scikit-learn 0.22 supported Python 3.5-3.8.
-    Scikit-learn 0.23 - 0.24 require Python 3.6 or newer.
+    Scikit-learn 0.23-0.24 required Python 3.6 or newer.
     Scikit-learn 1.0 supported Python 3.7-3.10.
-    Scikit-learn 1.1 and later requires Python 3.8 or newer.
-
+    Scikit-learn 1.1, 1.2 and 1.3 support Python 3.8-3.12
+    Scikit-learn 1.4 requires Python 3.9 or newer.
 
 .. _install_by_distribution:
 
@@ -192,7 +215,7 @@ Alpine Linux's package is provided through the `official repositories
 ``py3-scikit-learn`` for Python.
 It can be installed by typing the following command:
 
-.. prompt:: bash $
+.. prompt:: bash
 
   sudo apk add py3-scikit-learn
 
@@ -205,7 +228,7 @@ Arch Linux's package is provided through the `official repositories
 ``python-scikit-learn`` for Python.
 It can be installed by typing the following command:
 
-.. prompt:: bash $
+.. prompt:: bash
 
   sudo pacman -S python-scikit-learn
 
@@ -220,7 +243,7 @@ Note that scikit-learn requires Python 3, hence the need to use the `python3-`
 suffixed package names.
 Packages can be installed using ``apt-get``:
 
-.. prompt:: bash $
+.. prompt:: bash
 
   sudo apt-get install python3-sklearn python3-sklearn-lib python3-sklearn-doc
 
@@ -232,7 +255,7 @@ The Fedora package is called ``python3-scikit-learn`` for the python 3 version,
 the only one available in Fedora.
 It can be installed using ``dnf``:
 
-.. prompt:: bash $
+.. prompt:: bash
 
   sudo dnf install python3-scikit-learn
 
@@ -240,10 +263,8 @@ It can be installed using ``dnf``:
 NetBSD
 ------
 
-scikit-learn is available via `pkgsrc-wip
-<http://pkgsrc-wip.sourceforge.net/>`_:
-
-    https://pkgsrc.se/math/py-scikit-learn
+scikit-learn is available via `pkgsrc-wip <http://pkgsrc-wip.sourceforge.net/>`_:
+https://pkgsrc.se/math/py-scikit-learn
 
 
 MacPorts for Mac OSX
@@ -254,7 +275,7 @@ where ``XY`` denotes the Python version.
 It can be installed by typing the following
 command:
 
-.. prompt:: bash $
+.. prompt:: bash
 
   sudo port install py39-scikit-learn
 
@@ -276,7 +297,7 @@ Intel Extension for Scikit-learn
 Intel maintains an optimized x86_64 package, available in PyPI (via `pip`),
 and in the `main`, `conda-forge` and `intel` conda channels:
 
-.. prompt:: bash $
+.. prompt:: bash
 
   conda install scikit-learn-intelex
 
@@ -302,7 +323,7 @@ with `scikit-learn-intelex`, please report the issue on their
 
 
 WinPython for Windows
------------------------
+---------------------
 
 The `WinPython <https://winpython.github.io/>`_ project distributes
 scikit-learn as an additional plugin.
@@ -311,6 +332,10 @@ scikit-learn as an additional plugin.
 Troubleshooting
 ===============
 
+If you encounter unexpected failures when installing scikit-learn, you may submit
+an issue to the `issue tracker <https://github.com/scikit-learn/scikit-learn/issues>`_.
+Before that, please also make sure to check the following common issues.
+
 .. _windows_longpath:
 
 Error caused by file path length limit on Windows
@@ -340,6 +365,6 @@ using the ``regedit`` tool:
 
 #. Reinstall scikit-learn (ignoring the previous broken installation):
 
-.. prompt:: bash $
+   .. prompt:: powershell
 
-    pip install --exists-action=i scikit-learn
+      pip install --exists-action=i scikit-learn
diff --git a/doc/install_instructions_conda.rst b/doc/install_instructions_conda.rst
new file mode 100644
index 0000000000000..284a6925eeba9
--- /dev/null
+++ b/doc/install_instructions_conda.rst
@@ -0,0 +1,17 @@
+Install conda using the `Anaconda or miniconda installers
+<https://docs.conda.io/projects/conda/en/latest/user-guide/install/>`__ or the
+`miniforge installers <https://github.com/conda-forge/miniforge#miniforge>`__ (no
+administrator permission required for any of those). Then run:
+
+.. prompt:: bash
+
+  conda create -n sklearn-env -c conda-forge scikit-learn
+  conda activate sklearn-env
+
+In order to check your installation, you can use:
+
+.. prompt:: bash
+
+  conda list scikit-learn  # show scikit-learn version and location
+  conda list               # show all installed packages in the environment
+  python -c "import sklearn; sklearn.show_versions()"
diff --git a/doc/js/scripts/api-search.js b/doc/js/scripts/api-search.js
new file mode 100644
index 0000000000000..2148e0c429aaa
--- /dev/null
+++ b/doc/js/scripts/api-search.js
@@ -0,0 +1,12 @@
+/**
+ * This script is for initializing the search table on the API index page. See
+ * DataTables documentation for more information: https://datatables.net/
+ */
+
+document.addEventListener("DOMContentLoaded", function () {
+  new DataTable("table.apisearch-table", {
+    order: [], // Keep original order
+    lengthMenu: [10, 25, 50, 100, { label: "All", value: -1 }],
+    pageLength: -1, // Show all entries by default
+  });
+});
diff --git a/doc/js/scripts/dropdown.js b/doc/js/scripts/dropdown.js
new file mode 100644
index 0000000000000..ec2e6d9419a28
--- /dev/null
+++ b/doc/js/scripts/dropdown.js
@@ -0,0 +1,61 @@
+/**
+ * This script is used to add the functionality of collapsing/expanding all dropdowns
+ * on the page to the sphinx-design dropdowns. This is because some browsers cannot
+ * search into collapsed <details> (such as Firefox).
+ *
+ * The reason why the buttons are added to the page with JS (dynamic) instead of with
+ * sphinx (static) is that the button will not work without JS activated, so we do not
+ * want them to show up in that case.
+ */
+
+function addToggleAllButtons() {
+  // Get all sphinx-design dropdowns
+  const allDropdowns = document.querySelectorAll("details.sd-dropdown");
+
+  function collapseAll() {
+    // Function to collapse all dropdowns on the page
+    console.log("[SK] Collapsing all dropdowns...");
+    allDropdowns.forEach((dropdown) => {
+      dropdown.removeAttribute("open");
+    });
+  }
+
+  function expandAll() {
+    // Function to expand all dropdowns on the page
+    console.log("[SK] Expanding all dropdowns...");
+    allDropdowns.forEach((dropdown) => {
+      dropdown.setAttribute("open", "");
+    });
+  }
+
+  const buttonConfigs = new Map([
+    ["up", { desc: "Collapse", action: collapseAll }],
+    ["down", { desc: "Expand", action: expandAll }],
+  ]);
+
+  allDropdowns.forEach((dropdown) => {
+    // Get the summary element of the dropdown, where we will place the buttons
+    const summaryTitle = dropdown.querySelector("summary.sd-summary-title");
+    for (const [direction, config] of buttonConfigs) {
+      // Button with icon inside
+      var newButton = document.createElement("button");
+      var newIcon = document.createElement("i");
+      newIcon.classList.add("fa-solid", `fa-angles-${direction}`);
+      newButton.appendChild(newIcon);
+      // Class for styling; `sd-summary-up/down` is implemented by sphinx-design;
+      // `sk-toggle-all` is implemented by us
+      newButton.classList.add(`sd-summary-${direction}`, `sk-toggle-all`);
+      // Bootstrap tooltip configurations
+      newButton.setAttribute("data-bs-toggle", "tooltip");
+      newButton.setAttribute("data-bs-placement", "top");
+      newButton.setAttribute("data-bs-offset", "0,10");
+      newButton.setAttribute("data-bs-title", `${config.desc} all dropdowns`);
+      // Assign the collapse/expand action to the button
+      newButton.onclick = config.action;
+      // Append the button to the summary element
+      summaryTitle.appendChild(newButton);
+    }
+  });
+}
+
+document.addEventListener("DOMContentLoaded", addToggleAllButtons);
diff --git a/doc/js/scripts/vendor/svg-pan-zoom.min.js b/doc/js/scripts/vendor/svg-pan-zoom.min.js
new file mode 100644
index 0000000000000..bde44a689bfe1
--- /dev/null
+++ b/doc/js/scripts/vendor/svg-pan-zoom.min.js
@@ -0,0 +1,31 @@
+/**
+ * svg-pan-zoom v3.6.2
+ *
+ * https://github.com/bumbu/svg-pan-zoom
+ *
+ * Copyright 2009-2010 Andrea Leofreddi <a.leofreddi@vleo.net>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without modification,
+ * are permitted provided that the following conditions are met:
+ *
+ * * Redistributions of source code must retain the above copyright notice, this
+ *   list of conditions and the following disclaimer.
+ *
+ * * Redistributions in binary form must reproduce the above copyright notice, this
+ *   list of conditions and the following disclaimer in the documentation and/or
+ *   other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+ * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+ * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+ * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ */
+!function s(r,a,l){function u(e,t){if(!a[e]){if(!r[e]){var o="function"==typeof require&&require;if(!t&&o)return o(e,!0);if(h)return h(e,!0);var n=new Error("Cannot find module '"+e+"'");throw n.code="MODULE_NOT_FOUND",n}var i=a[e]={exports:{}};r[e][0].call(i.exports,function(t){return u(r[e][1][t]||t)},i,i.exports,s,r,a,l)}return a[e].exports}for(var h="function"==typeof require&&require,t=0;t<l.length;t++)u(l[t]);return u}({1:[function(t,e,o){var s=t("./svg-utilities");e.exports={enable:function(t){var e=t.svg.querySelector("defs");if(e||(e=document.createElementNS(s.svgNS,"defs"),t.svg.appendChild(e)),!e.querySelector("style#svg-pan-zoom-controls-styles")){var o=document.createElementNS(s.svgNS,"style");o.setAttribute("id","svg-pan-zoom-controls-styles"),o.setAttribute("type","text/css"),o.textContent=".svg-pan-zoom-control { cursor: pointer; fill: black; fill-opacity: 0.333; } .svg-pan-zoom-control:hover { fill-opacity: 0.8; } .svg-pan-zoom-control-background { fill: white; fill-opacity: 0.5; } .svg-pan-zoom-control-background { fill-opacity: 0.8; }",e.appendChild(o)}var n=document.createElementNS(s.svgNS,"g");n.setAttribute("id","svg-pan-zoom-controls"),n.setAttribute("transform","translate("+(t.width-70)+" "+(t.height-76)+") scale(0.75)"),n.setAttribute("class","svg-pan-zoom-control"),n.appendChild(this._createZoomIn(t)),n.appendChild(this._createZoomReset(t)),n.appendChild(this._createZoomOut(t)),t.svg.appendChild(n),t.controlIcons=n},_createZoomIn:function(t){var e=document.createElementNS(s.svgNS,"g");e.setAttribute("id","svg-pan-zoom-zoom-in"),e.setAttribute("transform","translate(30.5 5) scale(0.015)"),e.setAttribute("class","svg-pan-zoom-control"),e.addEventListener("click",function(){t.getPublicInstance().zoomIn()},!1),e.addEventListener("touchstart",function(){t.getPublicInstance().zoomIn()},!1);var o=document.createElementNS(s.svgNS,"rect");o.setAttribute("x","0"),o.setAttribute("y","0"),o.setAttribute("width","1500"),o.setAttribute("height","1400"),o.setAttribute("class","svg-pan-zoom-control-background"),e.appendChild(o);var n=document.createElementNS(s.svgNS,"path");return n.setAttribute("d","M1280 576v128q0 26 -19 45t-45 19h-320v320q0 26 -19 45t-45 19h-128q-26 0 -45 -19t-19 -45v-320h-320q-26 0 -45 -19t-19 -45v-128q0 -26 19 -45t45 -19h320v-320q0 -26 19 -45t45 -19h128q26 0 45 19t19 45v320h320q26 0 45 19t19 45zM1536 1120v-960 q0 -119 -84.5 -203.5t-203.5 -84.5h-960q-119 0 -203.5 84.5t-84.5 203.5v960q0 119 84.5 203.5t203.5 84.5h960q119 0 203.5 -84.5t84.5 -203.5z"),n.setAttribute("class","svg-pan-zoom-control-element"),e.appendChild(n),e},_createZoomReset:function(t){var e=document.createElementNS(s.svgNS,"g");e.setAttribute("id","svg-pan-zoom-reset-pan-zoom"),e.setAttribute("transform","translate(5 35) scale(0.4)"),e.setAttribute("class","svg-pan-zoom-control"),e.addEventListener("click",function(){t.getPublicInstance().reset()},!1),e.addEventListener("touchstart",function(){t.getPublicInstance().reset()},!1);var o=document.createElementNS(s.svgNS,"rect");o.setAttribute("x","2"),o.setAttribute("y","2"),o.setAttribute("width","182"),o.setAttribute("height","58"),o.setAttribute("class","svg-pan-zoom-control-background"),e.appendChild(o);var n=document.createElementNS(s.svgNS,"path");n.setAttribute("d","M33.051,20.632c-0.742-0.406-1.854-0.609-3.338-0.609h-7.969v9.281h7.769c1.543,0,2.701-0.188,3.473-0.562c1.365-0.656,2.048-1.953,2.048-3.891C35.032,22.757,34.372,21.351,33.051,20.632z"),n.setAttribute("class","svg-pan-zoom-control-element"),e.appendChild(n);var i=document.createElementNS(s.svgNS,"path");return i.setAttribute("d","M170.231,0.5H15.847C7.102,0.5,0.5,5.708,0.5,11.84v38.861C0.5,56.833,7.102,61.5,15.847,61.5h154.384c8.745,0,15.269-4.667,15.269-10.798V11.84C185.5,5.708,178.976,0.5,170.231,0.5z M42.837,48.569h-7.969c-0.219-0.766-0.375-1.383-0.469-1.852c-0.188-0.969-0.289-1.961-0.305-2.977l-0.047-3.211c-0.03-2.203-0.41-3.672-1.142-4.406c-0.732-0.734-2.103-1.102-4.113-1.102h-7.05v13.547h-7.055V14.022h16.524c2.361,0.047,4.178,0.344,5.45,0.891c1.272,0.547,2.351,1.352,3.234,2.414c0.731,0.875,1.31,1.844,1.737,2.906s0.64,2.273,0.64,3.633c0,1.641-0.414,3.254-1.242,4.84s-2.195,2.707-4.102,3.363c1.594,0.641,2.723,1.551,3.387,2.73s0.996,2.98,0.996,5.402v2.32c0,1.578,0.063,2.648,0.19,3.211c0.19,0.891,0.635,1.547,1.333,1.969V48.569z M75.579,48.569h-26.18V14.022h25.336v6.117H56.454v7.336h16.781v6H56.454v8.883h19.125V48.569z M104.497,46.331c-2.44,2.086-5.887,3.129-10.34,3.129c-4.548,0-8.125-1.027-10.731-3.082s-3.909-4.879-3.909-8.473h6.891c0.224,1.578,0.662,2.758,1.316,3.539c1.196,1.422,3.246,2.133,6.15,2.133c1.739,0,3.151-0.188,4.236-0.562c2.058-0.719,3.087-2.055,3.087-4.008c0-1.141-0.504-2.023-1.512-2.648c-1.008-0.609-2.607-1.148-4.796-1.617l-3.74-0.82c-3.676-0.812-6.201-1.695-7.576-2.648c-2.328-1.594-3.492-4.086-3.492-7.477c0-3.094,1.139-5.664,3.417-7.711s5.623-3.07,10.036-3.07c3.685,0,6.829,0.965,9.431,2.895c2.602,1.93,3.966,4.73,4.093,8.402h-6.938c-0.128-2.078-1.057-3.555-2.787-4.43c-1.154-0.578-2.587-0.867-4.301-0.867c-1.907,0-3.428,0.375-4.565,1.125c-1.138,0.75-1.706,1.797-1.706,3.141c0,1.234,0.561,2.156,1.682,2.766c0.721,0.406,2.25,0.883,4.589,1.43l6.063,1.43c2.657,0.625,4.648,1.461,5.975,2.508c2.059,1.625,3.089,3.977,3.089,7.055C108.157,41.624,106.937,44.245,104.497,46.331z M139.61,48.569h-26.18V14.022h25.336v6.117h-18.281v7.336h16.781v6h-16.781v8.883h19.125V48.569z M170.337,20.14h-10.336v28.43h-7.266V20.14h-10.383v-6.117h27.984V20.14z"),i.setAttribute("class","svg-pan-zoom-control-element"),e.appendChild(i),e},_createZoomOut:function(t){var e=document.createElementNS(s.svgNS,"g");e.setAttribute("id","svg-pan-zoom-zoom-out"),e.setAttribute("transform","translate(30.5 70) scale(0.015)"),e.setAttribute("class","svg-pan-zoom-control"),e.addEventListener("click",function(){t.getPublicInstance().zoomOut()},!1),e.addEventListener("touchstart",function(){t.getPublicInstance().zoomOut()},!1);var o=document.createElementNS(s.svgNS,"rect");o.setAttribute("x","0"),o.setAttribute("y","0"),o.setAttribute("width","1500"),o.setAttribute("height","1400"),o.setAttribute("class","svg-pan-zoom-control-background"),e.appendChild(o);var n=document.createElementNS(s.svgNS,"path");return n.setAttribute("d","M1280 576v128q0 26 -19 45t-45 19h-896q-26 0 -45 -19t-19 -45v-128q0 -26 19 -45t45 -19h896q26 0 45 19t19 45zM1536 1120v-960q0 -119 -84.5 -203.5t-203.5 -84.5h-960q-119 0 -203.5 84.5t-84.5 203.5v960q0 119 84.5 203.5t203.5 84.5h960q119 0 203.5 -84.5 t84.5 -203.5z"),n.setAttribute("class","svg-pan-zoom-control-element"),e.appendChild(n),e},disable:function(t){t.controlIcons&&(t.controlIcons.parentNode.removeChild(t.controlIcons),t.controlIcons=null)}}},{"./svg-utilities":5}],2:[function(t,e,o){function n(t,e){this.init(t,e)}var i=t("./svg-utilities"),r=t("./utilities");n.prototype.init=function(t,e){this.viewport=t,this.options=e,this.originalState={zoom:1,x:0,y:0},this.activeState={zoom:1,x:0,y:0},this.updateCTMCached=r.proxy(this.updateCTM,this),this.requestAnimationFrame=r.createRequestAnimationFrame(this.options.refreshRate),this.viewBox={x:0,y:0,width:0,height:0},this.cacheViewBox();var o=this.processCTM();this.setCTM(o),this.updateCTM()},n.prototype.cacheViewBox=function(){var t=this.options.svg.getAttribute("viewBox");if(t){var e=t.split(/[\s\,]/).filter(function(t){return t}).map(parseFloat);this.viewBox.x=e[0],this.viewBox.y=e[1],this.viewBox.width=e[2],this.viewBox.height=e[3];var o=Math.min(this.options.width/this.viewBox.width,this.options.height/this.viewBox.height);this.activeState.zoom=o,this.activeState.x=(this.options.width-this.viewBox.width*o)/2,this.activeState.y=(this.options.height-this.viewBox.height*o)/2,this.updateCTMOnNextFrame(),this.options.svg.removeAttribute("viewBox")}else this.simpleViewBoxCache()},n.prototype.simpleViewBoxCache=function(){var t=this.viewport.getBBox();this.viewBox.x=t.x,this.viewBox.y=t.y,this.viewBox.width=t.width,this.viewBox.height=t.height},n.prototype.getViewBox=function(){return r.extend({},this.viewBox)},n.prototype.processCTM=function(){var t,e=this.getCTM();(this.options.fit||this.options.contain)&&(t=this.options.fit?Math.min(this.options.width/this.viewBox.width,this.options.height/this.viewBox.height):Math.max(this.options.width/this.viewBox.width,this.options.height/this.viewBox.height),e.a=t,e.d=t,e.e=-this.viewBox.x*t,e.f=-this.viewBox.y*t);if(this.options.center){var o=.5*(this.options.width-(this.viewBox.width+2*this.viewBox.x)*e.a),n=.5*(this.options.height-(this.viewBox.height+2*this.viewBox.y)*e.a);e.e=o,e.f=n}return this.originalState.zoom=e.a,this.originalState.x=e.e,this.originalState.y=e.f,e},n.prototype.getOriginalState=function(){return r.extend({},this.originalState)},n.prototype.getState=function(){return r.extend({},this.activeState)},n.prototype.getZoom=function(){return this.activeState.zoom},n.prototype.getRelativeZoom=function(){return this.activeState.zoom/this.originalState.zoom},n.prototype.computeRelativeZoom=function(t){return t/this.originalState.zoom},n.prototype.getPan=function(){return{x:this.activeState.x,y:this.activeState.y}},n.prototype.getCTM=function(){var t=this.options.svg.createSVGMatrix();return t.a=this.activeState.zoom,t.b=0,t.c=0,t.d=this.activeState.zoom,t.e=this.activeState.x,t.f=this.activeState.y,t},n.prototype.setCTM=function(t){var e=this.isZoomDifferent(t),o=this.isPanDifferent(t);if(e||o){if(e&&(!1===this.options.beforeZoom(this.getRelativeZoom(),this.computeRelativeZoom(t.a))?(t.a=t.d=this.activeState.zoom,e=!1):(this.updateCache(t),this.options.onZoom(this.getRelativeZoom()))),o){var n=this.options.beforePan(this.getPan(),{x:t.e,y:t.f}),i=!1,s=!1;!1===n?(t.e=this.getPan().x,t.f=this.getPan().y,i=s=!0):r.isObject(n)&&(!1===n.x?(t.e=this.getPan().x,i=!0):r.isNumber(n.x)&&(t.e=n.x),!1===n.y?(t.f=this.getPan().y,s=!0):r.isNumber(n.y)&&(t.f=n.y)),i&&s||!this.isPanDifferent(t)?o=!1:(this.updateCache(t),this.options.onPan(this.getPan()))}(e||o)&&this.updateCTMOnNextFrame()}},n.prototype.isZoomDifferent=function(t){return this.activeState.zoom!==t.a},n.prototype.isPanDifferent=function(t){return this.activeState.x!==t.e||this.activeState.y!==t.f},n.prototype.updateCache=function(t){this.activeState.zoom=t.a,this.activeState.x=t.e,this.activeState.y=t.f},n.prototype.pendingUpdate=!1,n.prototype.updateCTMOnNextFrame=function(){this.pendingUpdate||(this.pendingUpdate=!0,this.requestAnimationFrame.call(window,this.updateCTMCached))},n.prototype.updateCTM=function(){var t=this.getCTM();i.setCTM(this.viewport,t,this.defs),this.pendingUpdate=!1,this.options.onUpdatedCTM&&this.options.onUpdatedCTM(t)},e.exports=function(t,e){return new n(t,e)}},{"./svg-utilities":5,"./utilities":7}],3:[function(t,e,o){var n,i=t("./svg-pan-zoom.js");n=window,document,"function"==typeof define&&define.amd?define("svg-pan-zoom",function(){return i}):void 0!==e&&e.exports&&(e.exports=i,n.svgPanZoom=i)},{"./svg-pan-zoom.js":4}],4:[function(t,e,o){function i(t,e){this.init(t,e)}var n=t("./uniwheel"),s=t("./control-icons"),r=t("./utilities"),a=t("./svg-utilities"),l=t("./shadow-viewport"),u={viewportSelector:".svg-pan-zoom_viewport",panEnabled:!0,controlIconsEnabled:!1,zoomEnabled:!0,dblClickZoomEnabled:!0,mouseWheelZoomEnabled:!0,preventMouseEventsDefault:!0,zoomScaleSensitivity:.1,minZoom:.5,maxZoom:10,fit:!0,contain:!1,center:!0,refreshRate:"auto",beforeZoom:null,onZoom:null,beforePan:null,onPan:null,customEventsHandler:null,eventsListenerElement:null,onUpdatedCTM:null},h={passive:!0};i.prototype.init=function(t,e){var o=this;this.svg=t,this.defs=t.querySelector("defs"),a.setupSvgAttributes(this.svg),this.options=r.extend(r.extend({},u),e),this.state="none";var n=a.getBoundingClientRectNormalized(t);this.width=n.width,this.height=n.height,this.viewport=l(a.getOrCreateViewport(this.svg,this.options.viewportSelector),{svg:this.svg,width:this.width,height:this.height,fit:this.options.fit,contain:this.options.contain,center:this.options.center,refreshRate:this.options.refreshRate,beforeZoom:function(t,e){if(o.viewport&&o.options.beforeZoom)return o.options.beforeZoom(t,e)},onZoom:function(t){if(o.viewport&&o.options.onZoom)return o.options.onZoom(t)},beforePan:function(t,e){if(o.viewport&&o.options.beforePan)return o.options.beforePan(t,e)},onPan:function(t){if(o.viewport&&o.options.onPan)return o.options.onPan(t)},onUpdatedCTM:function(t){if(o.viewport&&o.options.onUpdatedCTM)return o.options.onUpdatedCTM(t)}});var i=this.getPublicInstance();i.setBeforeZoom(this.options.beforeZoom),i.setOnZoom(this.options.onZoom),i.setBeforePan(this.options.beforePan),i.setOnPan(this.options.onPan),i.setOnUpdatedCTM(this.options.onUpdatedCTM),this.options.controlIconsEnabled&&s.enable(this),this.lastMouseWheelEventTime=Date.now(),this.setupHandlers()},i.prototype.setupHandlers=function(){var o=this,n=null;if(this.eventListeners={mousedown:function(t){var e=o.handleMouseDown(t,n);return n=t,e},touchstart:function(t){var e=o.handleMouseDown(t,n);return n=t,e},mouseup:function(t){return o.handleMouseUp(t)},touchend:function(t){return o.handleMouseUp(t)},mousemove:function(t){return o.handleMouseMove(t)},touchmove:function(t){return o.handleMouseMove(t)},mouseleave:function(t){return o.handleMouseUp(t)},touchleave:function(t){return o.handleMouseUp(t)},touchcancel:function(t){return o.handleMouseUp(t)}},null!=this.options.customEventsHandler){this.options.customEventsHandler.init({svgElement:this.svg,eventsListenerElement:this.options.eventsListenerElement,instance:this.getPublicInstance()});var t=this.options.customEventsHandler.haltEventListeners;if(t&&t.length)for(var e=t.length-1;0<=e;e--)this.eventListeners.hasOwnProperty(t[e])&&delete this.eventListeners[t[e]]}for(var i in this.eventListeners)(this.options.eventsListenerElement||this.svg).addEventListener(i,this.eventListeners[i],!this.options.preventMouseEventsDefault&&h);this.options.mouseWheelZoomEnabled&&(this.options.mouseWheelZoomEnabled=!1,this.enableMouseWheelZoom())},i.prototype.enableMouseWheelZoom=function(){if(!this.options.mouseWheelZoomEnabled){var e=this;this.wheelListener=function(t){return e.handleMouseWheel(t)};var t=!this.options.preventMouseEventsDefault;n.on(this.options.eventsListenerElement||this.svg,this.wheelListener,t),this.options.mouseWheelZoomEnabled=!0}},i.prototype.disableMouseWheelZoom=function(){if(this.options.mouseWheelZoomEnabled){var t=!this.options.preventMouseEventsDefault;n.off(this.options.eventsListenerElement||this.svg,this.wheelListener,t),this.options.mouseWheelZoomEnabled=!1}},i.prototype.handleMouseWheel=function(t){if(this.options.zoomEnabled&&"none"===this.state){this.options.preventMouseEventsDefault&&(t.preventDefault?t.preventDefault():t.returnValue=!1);var e=t.deltaY||1,o=Date.now()-this.lastMouseWheelEventTime,n=3+Math.max(0,30-o);this.lastMouseWheelEventTime=Date.now(),"deltaMode"in t&&0===t.deltaMode&&t.wheelDelta&&(e=0===t.deltaY?0:Math.abs(t.wheelDelta)/t.deltaY),e=-.3<e&&e<.3?e:(0<e?1:-1)*Math.log(Math.abs(e)+10)/n;var i=this.svg.getScreenCTM().inverse(),s=a.getEventPoint(t,this.svg).matrixTransform(i),r=Math.pow(1+this.options.zoomScaleSensitivity,-1*e);this.zoomAtPoint(r,s)}},i.prototype.zoomAtPoint=function(t,e,o){var n=this.viewport.getOriginalState();o?(t=Math.max(this.options.minZoom*n.zoom,Math.min(this.options.maxZoom*n.zoom,t)),t/=this.getZoom()):this.getZoom()*t<this.options.minZoom*n.zoom?t=this.options.minZoom*n.zoom/this.getZoom():this.getZoom()*t>this.options.maxZoom*n.zoom&&(t=this.options.maxZoom*n.zoom/this.getZoom());var i=this.viewport.getCTM(),s=e.matrixTransform(i.inverse()),r=this.svg.createSVGMatrix().translate(s.x,s.y).scale(t).translate(-s.x,-s.y),a=i.multiply(r);a.a!==i.a&&this.viewport.setCTM(a)},i.prototype.zoom=function(t,e){this.zoomAtPoint(t,a.getSvgCenterPoint(this.svg,this.width,this.height),e)},i.prototype.publicZoom=function(t,e){e&&(t=this.computeFromRelativeZoom(t)),this.zoom(t,e)},i.prototype.publicZoomAtPoint=function(t,e,o){if(o&&(t=this.computeFromRelativeZoom(t)),"SVGPoint"!==r.getType(e)){if(!("x"in e&&"y"in e))throw new Error("Given point is invalid");e=a.createSVGPoint(this.svg,e.x,e.y)}this.zoomAtPoint(t,e,o)},i.prototype.getZoom=function(){return this.viewport.getZoom()},i.prototype.getRelativeZoom=function(){return this.viewport.getRelativeZoom()},i.prototype.computeFromRelativeZoom=function(t){return t*this.viewport.getOriginalState().zoom},i.prototype.resetZoom=function(){var t=this.viewport.getOriginalState();this.zoom(t.zoom,!0)},i.prototype.resetPan=function(){this.pan(this.viewport.getOriginalState())},i.prototype.reset=function(){this.resetZoom(),this.resetPan()},i.prototype.handleDblClick=function(t){var e;if((this.options.preventMouseEventsDefault&&(t.preventDefault?t.preventDefault():t.returnValue=!1),this.options.controlIconsEnabled)&&-1<(t.target.getAttribute("class")||"").indexOf("svg-pan-zoom-control"))return!1;e=t.shiftKey?1/(2*(1+this.options.zoomScaleSensitivity)):2*(1+this.options.zoomScaleSensitivity);var o=a.getEventPoint(t,this.svg).matrixTransform(this.svg.getScreenCTM().inverse());this.zoomAtPoint(e,o)},i.prototype.handleMouseDown=function(t,e){this.options.preventMouseEventsDefault&&(t.preventDefault?t.preventDefault():t.returnValue=!1),r.mouseAndTouchNormalize(t,this.svg),this.options.dblClickZoomEnabled&&r.isDblClick(t,e)?this.handleDblClick(t):(this.state="pan",this.firstEventCTM=this.viewport.getCTM(),this.stateOrigin=a.getEventPoint(t,this.svg).matrixTransform(this.firstEventCTM.inverse()))},i.prototype.handleMouseMove=function(t){if(this.options.preventMouseEventsDefault&&(t.preventDefault?t.preventDefault():t.returnValue=!1),"pan"===this.state&&this.options.panEnabled){var e=a.getEventPoint(t,this.svg).matrixTransform(this.firstEventCTM.inverse()),o=this.firstEventCTM.translate(e.x-this.stateOrigin.x,e.y-this.stateOrigin.y);this.viewport.setCTM(o)}},i.prototype.handleMouseUp=function(t){this.options.preventMouseEventsDefault&&(t.preventDefault?t.preventDefault():t.returnValue=!1),"pan"===this.state&&(this.state="none")},i.prototype.fit=function(){var t=this.viewport.getViewBox(),e=Math.min(this.width/t.width,this.height/t.height);this.zoom(e,!0)},i.prototype.contain=function(){var t=this.viewport.getViewBox(),e=Math.max(this.width/t.width,this.height/t.height);this.zoom(e,!0)},i.prototype.center=function(){var t=this.viewport.getViewBox(),e=.5*(this.width-(t.width+2*t.x)*this.getZoom()),o=.5*(this.height-(t.height+2*t.y)*this.getZoom());this.getPublicInstance().pan({x:e,y:o})},i.prototype.updateBBox=function(){this.viewport.simpleViewBoxCache()},i.prototype.pan=function(t){var e=this.viewport.getCTM();e.e=t.x,e.f=t.y,this.viewport.setCTM(e)},i.prototype.panBy=function(t){var e=this.viewport.getCTM();e.e+=t.x,e.f+=t.y,this.viewport.setCTM(e)},i.prototype.getPan=function(){var t=this.viewport.getState();return{x:t.x,y:t.y}},i.prototype.resize=function(){var t=a.getBoundingClientRectNormalized(this.svg);this.width=t.width,this.height=t.height;var e=this.viewport;e.options.width=this.width,e.options.height=this.height,e.processCTM(),this.options.controlIconsEnabled&&(this.getPublicInstance().disableControlIcons(),this.getPublicInstance().enableControlIcons())},i.prototype.destroy=function(){var e=this;for(var t in this.beforeZoom=null,this.onZoom=null,this.beforePan=null,this.onPan=null,(this.onUpdatedCTM=null)!=this.options.customEventsHandler&&this.options.customEventsHandler.destroy({svgElement:this.svg,eventsListenerElement:this.options.eventsListenerElement,instance:this.getPublicInstance()}),this.eventListeners)(this.options.eventsListenerElement||this.svg).removeEventListener(t,this.eventListeners[t],!this.options.preventMouseEventsDefault&&h);this.disableMouseWheelZoom(),this.getPublicInstance().disableControlIcons(),this.reset(),c=c.filter(function(t){return t.svg!==e.svg}),delete this.options,delete this.viewport,delete this.publicInstance,delete this.pi,this.getPublicInstance=function(){return null}},i.prototype.getPublicInstance=function(){var o=this;return this.publicInstance||(this.publicInstance=this.pi={enablePan:function(){return o.options.panEnabled=!0,o.pi},disablePan:function(){return o.options.panEnabled=!1,o.pi},isPanEnabled:function(){return!!o.options.panEnabled},pan:function(t){return o.pan(t),o.pi},panBy:function(t){return o.panBy(t),o.pi},getPan:function(){return o.getPan()},setBeforePan:function(t){return o.options.beforePan=null===t?null:r.proxy(t,o.publicInstance),o.pi},setOnPan:function(t){return o.options.onPan=null===t?null:r.proxy(t,o.publicInstance),o.pi},enableZoom:function(){return o.options.zoomEnabled=!0,o.pi},disableZoom:function(){return o.options.zoomEnabled=!1,o.pi},isZoomEnabled:function(){return!!o.options.zoomEnabled},enableControlIcons:function(){return o.options.controlIconsEnabled||(o.options.controlIconsEnabled=!0,s.enable(o)),o.pi},disableControlIcons:function(){return o.options.controlIconsEnabled&&(o.options.controlIconsEnabled=!1,s.disable(o)),o.pi},isControlIconsEnabled:function(){return!!o.options.controlIconsEnabled},enableDblClickZoom:function(){return o.options.dblClickZoomEnabled=!0,o.pi},disableDblClickZoom:function(){return o.options.dblClickZoomEnabled=!1,o.pi},isDblClickZoomEnabled:function(){return!!o.options.dblClickZoomEnabled},enableMouseWheelZoom:function(){return o.enableMouseWheelZoom(),o.pi},disableMouseWheelZoom:function(){return o.disableMouseWheelZoom(),o.pi},isMouseWheelZoomEnabled:function(){return!!o.options.mouseWheelZoomEnabled},setZoomScaleSensitivity:function(t){return o.options.zoomScaleSensitivity=t,o.pi},setMinZoom:function(t){return o.options.minZoom=t,o.pi},setMaxZoom:function(t){return o.options.maxZoom=t,o.pi},setBeforeZoom:function(t){return o.options.beforeZoom=null===t?null:r.proxy(t,o.publicInstance),o.pi},setOnZoom:function(t){return o.options.onZoom=null===t?null:r.proxy(t,o.publicInstance),o.pi},zoom:function(t){return o.publicZoom(t,!0),o.pi},zoomBy:function(t){return o.publicZoom(t,!1),o.pi},zoomAtPoint:function(t,e){return o.publicZoomAtPoint(t,e,!0),o.pi},zoomAtPointBy:function(t,e){return o.publicZoomAtPoint(t,e,!1),o.pi},zoomIn:function(){return this.zoomBy(1+o.options.zoomScaleSensitivity),o.pi},zoomOut:function(){return this.zoomBy(1/(1+o.options.zoomScaleSensitivity)),o.pi},getZoom:function(){return o.getRelativeZoom()},setOnUpdatedCTM:function(t){return o.options.onUpdatedCTM=null===t?null:r.proxy(t,o.publicInstance),o.pi},resetZoom:function(){return o.resetZoom(),o.pi},resetPan:function(){return o.resetPan(),o.pi},reset:function(){return o.reset(),o.pi},fit:function(){return o.fit(),o.pi},contain:function(){return o.contain(),o.pi},center:function(){return o.center(),o.pi},updateBBox:function(){return o.updateBBox(),o.pi},resize:function(){return o.resize(),o.pi},getSizes:function(){return{width:o.width,height:o.height,realZoom:o.getZoom(),viewBox:o.viewport.getViewBox()}},destroy:function(){return o.destroy(),o.pi}}),this.publicInstance};var c=[];e.exports=function(t,e){var o=r.getSvg(t);if(null===o)return null;for(var n=c.length-1;0<=n;n--)if(c[n].svg===o)return c[n].instance.getPublicInstance();return c.push({svg:o,instance:new i(o,e)}),c[c.length-1].instance.getPublicInstance()}},{"./control-icons":1,"./shadow-viewport":2,"./svg-utilities":5,"./uniwheel":6,"./utilities":7}],5:[function(t,e,o){var l=t("./utilities"),s="unknown";document.documentMode&&(s="ie"),e.exports={svgNS:"http://www.w3.org/2000/svg",xmlNS:"http://www.w3.org/XML/1998/namespace",xmlnsNS:"http://www.w3.org/2000/xmlns/",xlinkNS:"http://www.w3.org/1999/xlink",evNS:"http://www.w3.org/2001/xml-events",getBoundingClientRectNormalized:function(t){if(t.clientWidth&&t.clientHeight)return{width:t.clientWidth,height:t.clientHeight};if(t.getBoundingClientRect())return t.getBoundingClientRect();throw new Error("Cannot get BoundingClientRect for SVG.")},getOrCreateViewport:function(t,e){var o=null;if(!(o=l.isElement(e)?e:t.querySelector(e))){var n=Array.prototype.slice.call(t.childNodes||t.children).filter(function(t){return"defs"!==t.nodeName&&"#text"!==t.nodeName});1===n.length&&"g"===n[0].nodeName&&null===n[0].getAttribute("transform")&&(o=n[0])}if(!o){var i="viewport-"+(new Date).toISOString().replace(/\D/g,"");(o=document.createElementNS(this.svgNS,"g")).setAttribute("id",i);var s=t.childNodes||t.children;if(s&&0<s.length)for(var r=s.length;0<r;r--)"defs"!==s[s.length-r].nodeName&&o.appendChild(s[s.length-r]);t.appendChild(o)}var a=[];return o.getAttribute("class")&&(a=o.getAttribute("class").split(" ")),~a.indexOf("svg-pan-zoom_viewport")||(a.push("svg-pan-zoom_viewport"),o.setAttribute("class",a.join(" "))),o},setupSvgAttributes:function(t){if(t.setAttribute("xmlns",this.svgNS),t.setAttributeNS(this.xmlnsNS,"xmlns:xlink",this.xlinkNS),t.setAttributeNS(this.xmlnsNS,"xmlns:ev",this.evNS),null!==t.parentNode){var e=t.getAttribute("style")||"";-1===e.toLowerCase().indexOf("overflow")&&t.setAttribute("style","overflow: hidden; "+e)}},internetExplorerRedisplayInterval:300,refreshDefsGlobal:l.throttle(function(){for(var t=document.querySelectorAll("defs"),e=t.length,o=0;o<e;o++){var n=t[o];n.parentNode.insertBefore(n,n)}},this?this.internetExplorerRedisplayInterval:null),setCTM:function(t,e,o){var n=this,i="matrix("+e.a+","+e.b+","+e.c+","+e.d+","+e.e+","+e.f+")";t.setAttributeNS(null,"transform",i),"transform"in t.style?t.style.transform=i:"-ms-transform"in t.style?t.style["-ms-transform"]=i:"-webkit-transform"in t.style&&(t.style["-webkit-transform"]=i),"ie"===s&&o&&(o.parentNode.insertBefore(o,o),window.setTimeout(function(){n.refreshDefsGlobal()},n.internetExplorerRedisplayInterval))},getEventPoint:function(t,e){var o=e.createSVGPoint();return l.mouseAndTouchNormalize(t,e),o.x=t.clientX,o.y=t.clientY,o},getSvgCenterPoint:function(t,e,o){return this.createSVGPoint(t,e/2,o/2)},createSVGPoint:function(t,e,o){var n=t.createSVGPoint();return n.x=e,n.y=o,n}}},{"./utilities":7}],6:[function(t,e,o){function s(t,o){function e(t){var e={originalEvent:t=t||window.event,target:t.target||t.srcElement,type:"wheel",deltaMode:"MozMousePixelScroll"==t.type?0:1,deltaX:0,delatZ:0,preventDefault:function(){t.preventDefault?t.preventDefault():t.returnValue=!1}};return"mousewheel"==l?(e.deltaY=-.025*t.wheelDelta,t.wheelDeltaX&&(e.deltaX=-.025*t.wheelDeltaX)):e.deltaY=t.detail,o(e)}return h.push({element:t,fn:e}),e}function n(t,e,o,n){var i;i="wheel"===l?o:s(t,o),t[r](u+e,i,n?c:p)}function i(t,e,o,n){var i;i="wheel"===l?o:function(t){for(var e=0;e<h.length;e++)if(h[e].element===t)return h[e].fn;return function(){}}(t),t[a](u+e,i,n?c:p),function(t){for(var e=0;e<h.length;e++)if(h[e].element===t)return h.splice(e,1)}(t)}var r,a,l,u,h,c,p;e.exports=(h=[],p={passive:!(c={passive:!(u="")})},window.addEventListener?(r="addEventListener",a="removeEventListener"):(r="attachEvent",a="detachEvent",u="on"),l="onwheel"in document.createElement("div")?"wheel":void 0!==document.onmousewheel?"mousewheel":"DOMMouseScroll",{on:function(t,e,o){n(t,l,e,o),"DOMMouseScroll"==l&&n(t,"MozMousePixelScroll",e,o)},off:function(t,e,o){i(t,l,e,o),"DOMMouseScroll"==l&&i(t,"MozMousePixelScroll",e,o)}})},{}],7:[function(t,e,o){function n(e){return function(t){window.setTimeout(t,e)}}e.exports={extend:function(t,e){for(var o in t=t||{},e)this.isObject(e[o])?t[o]=this.extend(t[o],e[o]):t[o]=e[o];return t},isElement:function(t){return t instanceof HTMLElement||t instanceof SVGElement||t instanceof SVGSVGElement||t&&"object"==typeof t&&null!==t&&1===t.nodeType&&"string"==typeof t.nodeName},isObject:function(t){return"[object Object]"===Object.prototype.toString.call(t)},isNumber:function(t){return!isNaN(parseFloat(t))&&isFinite(t)},getSvg:function(t){var e,o;if(this.isElement(t))e=t;else{if(!("string"==typeof t||t instanceof String))throw new Error("Provided selector is not an HTML object nor String");if(!(e=document.querySelector(t)))throw new Error("Provided selector did not find any elements. Selector: "+t)}if("svg"===e.tagName.toLowerCase())o=e;else if("object"===e.tagName.toLowerCase())o=e.contentDocument.documentElement;else{if("embed"!==e.tagName.toLowerCase())throw"img"===e.tagName.toLowerCase()?new Error('Cannot script an SVG in an "img" element. Please use an "object" element or an in-line SVG.'):new Error("Cannot get SVG.");o=e.getSVGDocument().documentElement}return o},proxy:function(t,e){return function(){return t.apply(e,arguments)}},getType:function(t){return Object.prototype.toString.apply(t).replace(/^\[object\s/,"").replace(/\]$/,"")},mouseAndTouchNormalize:function(t,e){if(void 0===t.clientX||null===t.clientX)if(t.clientX=0,void(t.clientY=0)!==t.touches&&t.touches.length){if(void 0!==t.touches[0].clientX)t.clientX=t.touches[0].clientX,t.clientY=t.touches[0].clientY;else if(void 0!==t.touches[0].pageX){var o=e.getBoundingClientRect();t.clientX=t.touches[0].pageX-o.left,t.clientY=t.touches[0].pageY-o.top}}else void 0!==t.originalEvent&&void 0!==t.originalEvent.clientX&&(t.clientX=t.originalEvent.clientX,t.clientY=t.originalEvent.clientY)},isDblClick:function(t,e){if(2===t.detail)return!0;if(null==e)return!1;var o=t.timeStamp-e.timeStamp,n=Math.sqrt(Math.pow(t.clientX-e.clientX,2)+Math.pow(t.clientY-e.clientY,2));return o<250&&n<10},now:Date.now||function(){return(new Date).getTime()},throttle:function(o,n,i){var s,r,a,l=this,u=null,h=0;i=i||{};function c(){h=!1===i.leading?0:l.now(),u=null,a=o.apply(s,r),u||(s=r=null)}return function(){var t=l.now();h||!1!==i.leading||(h=t);var e=n-(t-h);return s=this,r=arguments,e<=0||n<e?(clearTimeout(u),u=null,h=t,a=o.apply(s,r),u||(s=r=null)):u||!1===i.trailing||(u=setTimeout(c,e)),a}},createRequestAnimationFrame:function(t){var e=null;return"auto"!==t&&t<60&&1<t&&(e=Math.floor(1e3/t)),null===e?window.requestAnimationFrame||n(33):n(e)}}},{}]},{},[3]);
diff --git a/doc/js/scripts/version-switcher.js b/doc/js/scripts/version-switcher.js
new file mode 100644
index 0000000000000..c88c45b16ee93
--- /dev/null
+++ b/doc/js/scripts/version-switcher.js
@@ -0,0 +1,40 @@
+/**
+ * Adds the link to available documentation page as the last entry in the version
+ * switcher dropdown. Since other entries in the dropdown are also added dynamically,
+ * we only add the link when the user clicks on some version switcher button to make
+ * sure that this entry is the last one.
+ */
+
+function addVersionSwitcherAvailDocsLink() {
+  var availDocsLinkAdded = false;
+
+  // There can be multiple version switcher buttons because there is at least one for
+  // laptop size and one for mobile size (in the sidebar)
+  document
+    .querySelectorAll(".version-switcher__button")
+    .forEach(function (btn) {
+      btn.addEventListener("click", function () {
+        if (!availDocsLinkAdded) {
+          // All version switcher dropdowns are updated once any button is clicked
+          document
+            .querySelectorAll(".version-switcher__menu")
+            .forEach(function (menu) {
+              var availDocsLink = document.createElement("a");
+              availDocsLink.setAttribute(
+                "href",
+                "https://scikit-learn.org/dev/versions.html"
+              );
+              availDocsLink.innerHTML = "More";
+              // We use the same class as the last entry to be safe
+              availDocsLink.className = menu.lastChild.className;
+              availDocsLink.classList.add("sk-avail-docs-link");
+              menu.appendChild(availDocsLink);
+            });
+          // Set the flag so we do not add again
+          availDocsLinkAdded = true;
+        }
+      });
+    });
+}
+
+document.addEventListener("DOMContentLoaded", addVersionSwitcherAvailDocsLink);
diff --git a/doc/jupyter-lite.json b/doc/jupyter-lite.json
index e582ad81eb541..65ec9ca3006dc 100644
--- a/doc/jupyter-lite.json
+++ b/doc/jupyter-lite.json
@@ -3,7 +3,7 @@
   "jupyter-config-data": {
     "litePluginSettings": {
       "@jupyterlite/pyodide-kernel-extension:kernel": {
-        "pyodideUrl": "https://cdn.jsdelivr.net/pyodide/v0.25.0/full/pyodide.js"
+        "pyodideUrl": "https://cdn.jsdelivr.net/pyodide/v0.26.0/full/pyodide.js"
       }
     }
   }
diff --git a/doc/machine_learning_map.rst b/doc/machine_learning_map.rst
new file mode 100644
index 0000000000000..a03bb963cb046
--- /dev/null
+++ b/doc/machine_learning_map.rst
@@ -0,0 +1,76 @@
+:html_theme.sidebar_secondary.remove:
+
+.. _ml_map:
+
+Choosing the right estimator
+============================
+
+Often the hardest part of solving a machine learning problem can be finding the right
+estimator for the job. Different estimators are better suited for different types of
+data and different problems.
+
+The flowchart below is designed to give users a bit of a rough guide on how to approach
+problems with regard to which estimators to try on your data. Click on any estimator in
+the chart below to see its documentation. The 😭 emoji is to be read as "if this
+estimator does not achieve the desired outcome, then follow the arrow and try the next
+one". Use scroll wheel to zoom in and out, and click and drag to pan around. You can
+also download the chart: :download:`ml_map.svg <images/ml_map.svg>`.
+
+.. raw:: html
+
+  <style>
+    #sk-ml-map {
+      height: 80vh;
+      margin: 1.5rem 0;
+    }
+
+    #sk-ml-map svg {
+      height: 100%;
+      width: 100%;
+      border: 2px solid var(--pst-color-border);
+      border-radius: 0.5rem;
+    }
+
+    html[data-theme="dark"] #sk-ml-map svg {
+      filter: invert(90%) hue-rotate(180deg);
+    }
+  </style>
+
+  <script src="_static/scripts/vendor/svg-pan-zoom.min.js"></script>
+  <script>
+    document.addEventListener("DOMContentLoaded", function () {
+      const beforePan = function (oldPan, newPan) {
+        const gutterWidth = 100, gutterHeight = 100;
+        const sizes = this.getSizes();
+
+        // Compute pan limits
+        const leftLimit = -((sizes.viewBox.x + sizes.viewBox.width) * sizes.realZoom) + gutterWidth;
+        const rightLimit = sizes.width - gutterWidth - (sizes.viewBox.x * sizes.realZoom);
+        const topLimit = -((sizes.viewBox.y + sizes.viewBox.height) * sizes.realZoom) + gutterHeight;
+        const bottomLimit = sizes.height - gutterHeight - (sizes.viewBox.y * sizes.realZoom);
+
+        return {
+          x: Math.max(leftLimit, Math.min(rightLimit, newPan.x)),
+          y: Math.max(topLimit, Math.min(bottomLimit, newPan.y))
+        };
+      };
+
+      // Limit the pan
+      svgPanZoom("#sk-ml-map svg", {
+        zoomEnabled: true,
+        controlIconsEnabled: true,
+        fit: 1,
+        center: 1,
+        beforePan: beforePan,
+      });
+    });
+  </script>
+
+  <div id="sk-ml-map">
+
+.. raw:: html
+  :file: images/ml_map.svg
+
+.. raw:: html
+
+  </div>
diff --git a/doc/authors.rst b/doc/maintainers.rst
similarity index 100%
rename from doc/authors.rst
rename to doc/maintainers.rst
diff --git a/doc/authors_emeritus.rst b/doc/maintainers_emeritus.rst
similarity index 100%
rename from doc/authors_emeritus.rst
rename to doc/maintainers_emeritus.rst
diff --git a/doc/make.bat b/doc/make.bat
index b7e269a6a7836..2a32bcb678f62 100644
--- a/doc/make.bat
+++ b/doc/make.bat
@@ -29,8 +29,30 @@ if "%1" == "help" (
 )
 
 if "%1" == "clean" (
-	for /d %%i in (%BUILDDIR%\*) do rmdir /q /s %%i
-	del /q /s %BUILDDIR%\*
+	if exist %BUILDDIR%\ (
+		for /d %%i in (%BUILDDIR%\*) do rmdir /q /s "%%i"
+		del /q /s %BUILDDIR%\*
+		echo. Removed %BUILDDIR%\*
+	)
+	if exist auto_examples\ (
+		rmdir /q /s auto_examples
+		echo. Removed auto_examples\
+	)
+	if exist generated\ (
+		for /d %%i in (generated\*) do rmdir /q /s "%%i"
+		del /q /s generated\*
+		echo. Removed generated\*
+	)
+	if exist modules\generated\ (
+		rmdir /q /s modules\generated
+		echo. Removed modules\generated\
+	)
+	if exist css\styles\ (
+		rmdir /q /s css\styles
+		echo. Removed css\styles\
+	)
+	for %%i in (api\*.rst) do del /q "%%i"
+	echo. Removed api\*.rst
 	goto end
 )
 
@@ -46,6 +68,7 @@ if "%1" == "html-noplot" (
 	%SPHINXBUILD% -D plot_gallery=0 -b html %ALLSPHINXOPTS% %BUILDDIR%/html
 	echo.
 	echo.Build finished. The HTML pages are in %BUILDDIR%/html
+	goto end
 )
 
 if "%1" == "dirhtml" (
diff --git a/doc/metadata_routing.rst b/doc/metadata_routing.rst
index d319b311dddd7..31dae6813bda5 100644
--- a/doc/metadata_routing.rst
+++ b/doc/metadata_routing.rst
@@ -276,7 +276,10 @@ Meta-estimators and functions supporting metadata routing:
 
 - :class:`sklearn.calibration.CalibratedClassifierCV`
 - :class:`sklearn.compose.ColumnTransformer`
+- :class:`sklearn.compose.TransformedTargetRegressor`
 - :class:`sklearn.covariance.GraphicalLassoCV`
+- :class:`sklearn.ensemble.StackingClassifier`
+- :class:`sklearn.ensemble.StackingRegressor`
 - :class:`sklearn.ensemble.VotingClassifier`
 - :class:`sklearn.ensemble.VotingRegressor`
 - :class:`sklearn.ensemble.BaggingClassifier`
@@ -290,6 +293,7 @@ Meta-estimators and functions supporting metadata routing:
 - :class:`sklearn.linear_model.LogisticRegressionCV`
 - :class:`sklearn.linear_model.MultiTaskElasticNetCV`
 - :class:`sklearn.linear_model.MultiTaskLassoCV`
+- :class:`sklearn.linear_model.OrthogonalMatchingPursuitCV`
 - :class:`sklearn.linear_model.RANSACRegressor`
 - :class:`sklearn.linear_model.RidgeClassifierCV`
 - :class:`sklearn.linear_model.RidgeCV`
@@ -297,33 +301,27 @@ Meta-estimators and functions supporting metadata routing:
 - :class:`sklearn.model_selection.HalvingGridSearchCV`
 - :class:`sklearn.model_selection.HalvingRandomSearchCV`
 - :class:`sklearn.model_selection.RandomizedSearchCV`
+- :class:`sklearn.model_selection.permutation_test_score`
 - :func:`sklearn.model_selection.cross_validate`
 - :func:`sklearn.model_selection.cross_val_score`
 - :func:`sklearn.model_selection.cross_val_predict`
+- :class:`sklearn.model_selection.learning_curve`
+- :class:`sklearn.model_selection.validation_curve`
 - :class:`sklearn.multiclass.OneVsOneClassifier`
 - :class:`sklearn.multiclass.OneVsRestClassifier`
 - :class:`sklearn.multiclass.OutputCodeClassifier`
 - :class:`sklearn.multioutput.ClassifierChain`
 - :class:`sklearn.multioutput.MultiOutputClassifier`
 - :class:`sklearn.multioutput.MultiOutputRegressor`
-- :class:`sklearn.linear_model.OrthogonalMatchingPursuitCV`
 - :class:`sklearn.multioutput.RegressorChain`
 - :class:`sklearn.pipeline.FeatureUnion`
 - :class:`sklearn.pipeline.Pipeline`
+- :class:`sklearn.semi_supervised.SelfTrainingClassifier`
 
 Meta-estimators and tools not supporting metadata routing yet:
 
-- :class:`sklearn.compose.TransformedTargetRegressor`
 - :class:`sklearn.ensemble.AdaBoostClassifier`
 - :class:`sklearn.ensemble.AdaBoostRegressor`
-- :class:`sklearn.ensemble.StackingClassifier`
-- :class:`sklearn.ensemble.StackingRegressor`
 - :class:`sklearn.feature_selection.RFE`
 - :class:`sklearn.feature_selection.RFECV`
 - :class:`sklearn.feature_selection.SequentialFeatureSelector`
-- :class:`sklearn.impute.IterativeImputer`
-- :class:`sklearn.linear_model.RANSACRegressor`
-- :class:`sklearn.model_selection.learning_curve`
-- :class:`sklearn.model_selection.permutation_test_score`
-- :class:`sklearn.model_selection.validation_curve`
-- :class:`sklearn.semi_supervised.SelfTrainingClassifier`
diff --git a/doc/min_dependency_substitutions.rst.template b/doc/min_dependency_substitutions.rst.template
new file mode 100644
index 0000000000000..946de84902b3b
--- /dev/null
+++ b/doc/min_dependency_substitutions.rst.template
@@ -0,0 +1,3 @@
+{% for package, (version, _) in dependent_packages.items() -%}
+.. |{{ package|capitalize }}MinVersion| replace:: {{ version }}
+{% endfor %}
diff --git a/doc/min_dependency_table.rst.template b/doc/min_dependency_table.rst.template
new file mode 100644
index 0000000000000..fbe58633e913a
--- /dev/null
+++ b/doc/min_dependency_table.rst.template
@@ -0,0 +1,13 @@
+.. list-table::
+  :header-rows: 1
+
+  * - Dependency
+    - Minimum Version
+    - Purpose
+
+  {% for package, (version, tags) in dependent_packages.items() -%}
+  * - {{ package }}
+    - {{ version }}
+    - {{ tags }}
+
+  {% endfor %}
diff --git a/doc/model_persistence.rst b/doc/model_persistence.rst
index 0f775c774465a..cd5347d302123 100644
--- a/doc/model_persistence.rst
+++ b/doc/model_persistence.rst
@@ -1,183 +1,353 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
-.. _model_persistence:
-
-=================
-Model persistence
-=================
-
-After training a scikit-learn model, it is desirable to have a way to persist
-the model for future use without having to retrain. The following sections give
-you some hints on how to persist a scikit-learn model.
-
-Python specific serialization
------------------------------
-
-It is possible to save a model in scikit-learn by using Python's built-in
-persistence model, namely `pickle
-<https://docs.python.org/3/library/pickle.html>`_::
-
-  >>> from sklearn import svm
-  >>> from sklearn import datasets
-  >>> clf = svm.SVC()
-  >>> X, y= datasets.load_iris(return_X_y=True)
-  >>> clf.fit(X, y)
-  SVC()
-
-  >>> import pickle
-  >>> s = pickle.dumps(clf)
-  >>> clf2 = pickle.loads(s)
-  >>> clf2.predict(X[0:1])
-  array([0])
-  >>> y[0]
-  0
-
-In the specific case of scikit-learn, it may be better to use joblib's
-replacement of pickle (``dump`` & ``load``), which is more efficient on
-objects that carry large numpy arrays internally as is often the case for
-fitted scikit-learn estimators, but can only pickle to the disk and not to a
-string::
-
-  >>> from joblib import dump, load
-  >>> dump(clf, 'filename.joblib') # doctest: +SKIP
-
-Later you can load back the pickled model (possibly in another Python process)
-with::
-
-  >>> clf = load('filename.joblib') # doctest:+SKIP
-
-.. note::
-
-   ``dump`` and ``load`` functions also accept file-like object
-   instead of filenames. More information on data persistence with Joblib is
-   available `here
-   <https://joblib.readthedocs.io/en/latest/persistence.html>`_.
-
-|details-start|
-**InconsistentVersionWarning**
-|details-split|
-
-When an estimator is unpickled with a scikit-learn version that is inconsistent
-with the version the estimator was pickled with, a
-:class:`~sklearn.exceptions.InconsistentVersionWarning` is raised. This warning
-can be caught to obtain the original version the estimator was pickled with::
-
-  from sklearn.exceptions import InconsistentVersionWarning
-  warnings.simplefilter("error", InconsistentVersionWarning)
-
-  try:
-      est = pickle.loads("model_from_prevision_version.pickle")
-  except InconsistentVersionWarning as w:
-      print(w.original_sklearn_version)
-
-|details-end|
-
-.. _persistence_limitations:
-
-Security & maintainability limitations
-......................................
-
-pickle (and joblib by extension), has some issues regarding maintainability
-and security. Because of this,
-
-* Never unpickle untrusted data as it could lead to malicious code being
-  executed upon loading.
-* While models saved using one version of scikit-learn might load in
-  other versions, this is entirely unsupported and inadvisable. It should
-  also be kept in mind that operations performed on such data could give
-  different and unexpected results.
-
-In order to rebuild a similar model with future versions of scikit-learn,
-additional metadata should be saved along the pickled model:
-
-* The training data, e.g. a reference to an immutable snapshot
-* The python source code used to generate the model
-* The versions of scikit-learn and its dependencies
-* The cross validation score obtained on the training data
-
-This should make it possible to check that the cross-validation score is in the
-same range as before.
-
-Aside for a few exceptions, pickled models should be portable across
-architectures assuming the same versions of dependencies and Python are used.
-If you encounter an estimator that is not portable please open an issue on
-GitHub. Pickled models are often deployed in production using containers, like
-Docker, in order to freeze the environment and dependencies.
-
-If you want to know more about these issues and explore other possible
-serialization methods, please refer to this
-`talk by Alex Gaynor
-<https://pyvideo.org/video/2566/pickles-are-for-delis-not-software>`_.
-
-
-A more secure format: `skops`
-.............................
-
-`skops <https://skops.readthedocs.io/en/stable/>`__ provides a more secure
-format via the :mod:`skops.io` module. It avoids using :mod:`pickle` and only
-loads files which have types and references to functions which are trusted
-either by default or by the user.
-
-|details-start|
-**Using skops**
-|details-split|
-
-The API is very similar to ``pickle``, and
-you can persist your models as explain in the `docs
-<https://skops.readthedocs.io/en/stable/persistence.html>`__ using
-:func:`skops.io.dump` and :func:`skops.io.dumps`::
-
-    import skops.io as sio
-    obj = sio.dumps(clf)
-
-And you can load them back using :func:`skops.io.load` and
-:func:`skops.io.loads`. However, you need to specify the types which are
-trusted by you. You can get existing unknown types in a dumped object / file
-using :func:`skops.io.get_untrusted_types`, and after checking its contents,
-pass it to the load function::
-
-    unknown_types = sio.get_untrusted_types(data=obj)
-    clf = sio.loads(obj, trusted=unknown_types)
-
-If you trust the source of the file / object, you can pass ``trusted=True``::
-
-    clf = sio.loads(obj, trusted=True)
-
-Please report issues and feature requests related to this format on the `skops
-issue tracker <https://github.com/skops-dev/skops/issues>`__.
-
-|details-end|
-
-Interoperable formats
----------------------
-
-For reproducibility and quality control needs, when different architectures
-and environments should be taken into account, exporting the model in
-`Open Neural Network
-Exchange <https://onnx.ai/>`_ format or `Predictive Model Markup Language
-(PMML) <https://dmg.org/pmml/v4-4-1/GeneralStructure.html>`_ format
-might be a better approach than using `pickle` alone.
-These are helpful where you may want to use your model for prediction in a
-different environment from where the model was trained.
-
-ONNX is a binary serialization of the model. It has been developed to improve
-the usability of the interoperable representation of data models.
-It aims to facilitate the conversion of the data
-models between different machine learning frameworks, and to improve their
-portability on different computing architectures. More details are available
-from the `ONNX tutorial <https://onnx.ai/get-started.html>`_.
-To convert scikit-learn model to ONNX a specific tool `sklearn-onnx
-<http://onnx.ai/sklearn-onnx/>`_ has been developed.
-
-PMML is an implementation of the `XML
-<https://en.wikipedia.org/wiki/XML>`_ document standard
-defined to represent data models together with the data used to generate them.
-Being human and machine readable,
-PMML is a good option for model validation on different platforms and
-long term archiving. On the other hand, as XML in general, its verbosity does
-not help in production when performance is critical.
-To convert scikit-learn model to PMML you can use for example `sklearn2pmml
-<https://github.com/jpmml/sklearn2pmml>`_ distributed under the Affero GPLv3
-license.
+.. _model_persistence:
+
+=================
+Model persistence
+=================
+
+After training a scikit-learn model, it is desirable to have a way to persist
+the model for future use without having to retrain. Based on your use-case,
+there are a few different ways to persist a scikit-learn model, and here we
+help you decide which one suits you best. In order to make a decision, you need
+to answer the following questions:
+
+1. Do you need the Python object after persistence, or do you only need to
+   persist in order to serve the model and get predictions out of it?
+
+If you only need to serve the model and no further investigation on the Python
+object itself is required, then :ref:`ONNX <onnx_persistence>` might be the
+best fit for you. Note that not all models are supported by ONNX.
+
+In case ONNX is not suitable for your use-case, the next question is:
+
+2. Do you absolutely trust the source of the model, or are there any security
+   concerns regarding where the persisted model comes from?
+
+If you have security concerns, then you should consider using :ref:`skops.io
+<skops_persistence>` which gives you back the Python object, but unlike
+`pickle` based persistence solutions, loading the persisted model doesn't
+automatically allow arbitrary code execution. Note that this requires manual
+investigation of the persisted file, which :mod:`skops.io` allows you to do.
+
+The other solutions assume you absolutely trust the source of the file to be
+loaded, as they are all susceptible to arbitrary code execution upon loading
+the persisted file since they all use the pickle protocol under the hood.
+
+3. Do you care about the performance of loading the model, and sharing it
+   between processes where a memory mapped object on disk is beneficial?
+
+If yes, then you can consider using :ref:`joblib <pickle_persistence>`. If this
+is not a major concern for you, then you can use the built-in :mod:`pickle`
+module.
+
+4. Did you try :mod:`pickle` or :mod:`joblib` and found that the model cannot
+   be persisted? It can happen for instance when you have user defined
+   functions in your model.
+
+If yes, then you can use `cloudpickle`_ which can serialize certain objects
+which cannot be serialized by :mod:`pickle` or :mod:`joblib`.
+
+
+Workflow Overview
+-----------------
+
+In a typical workflow, the first step is to train the model using scikit-learn
+and scikit-learn compatible libraries. Note that support for scikit-learn and
+third party estimators varies across the different persistence methods.
+
+Train and Persist the Model
+...........................
+
+Creating an appropriate model depends on your use-case. As an example, here we
+train a :class:`sklearn.ensemble.HistGradientBoostingClassifier` on the iris
+dataset::
+
+  >>> from sklearn import ensemble
+  >>> from sklearn import datasets
+  >>> clf = ensemble.HistGradientBoostingClassifier()
+  >>> X, y = datasets.load_iris(return_X_y=True)
+  >>> clf.fit(X, y)
+  HistGradientBoostingClassifier()
+
+Once the model is trained, you can persist it using your desired method, and
+then you can load the model in a separate environment and get predictions from
+it given input data. Here there are two major paths depending on how you
+persist and plan to serve the model:
+
+- :ref:`ONNX <onnx_persistence>`: You need an `ONNX` runtime and an environment
+  with appropriate dependencies installed to load the model and use the runtime
+  to get predictions. This environment can be minimal and does not necessarily
+  even require Python to be installed to load the model and compute
+  predictions. Also note that `onnxruntime` typically requires much less RAM
+  than Python to to compute predictions from small models.
+
+- :mod:`skops.io`, :mod:`pickle`, :mod:`joblib`, `cloudpickle`_: You need a
+  Python environment with the appropriate dependencies installed to load the
+  model and get predictions from it. This environment should have the same
+  **packages** and the same **versions** as the environment where the model was
+  trained. Note that none of these methods support loading a model trained with
+  a different version of scikit-learn, and possibly different versions of other
+  dependencies such as `numpy` and `scipy`. Another concern would be running
+  the persisted model on a different hardware, and in most cases you should be
+  able to load your persisted model on a different hardware.
+
+
+.. _onnx_persistence:
+
+ONNX
+----
+
+`ONNX`, or `Open Neural Network Exchange <https://onnx.ai/>`__ format is best
+suitable in use-cases where one needs to persist the model and then use the
+persisted artifact to get predictions without the need to load the Python
+object itself. It is also useful in cases where the serving environment needs
+to be lean and minimal, since the `ONNX` runtime does not require `python`.
+
+`ONNX` is a binary serialization of the model. It has been developed to improve
+the usability of the interoperable representation of data models. It aims to
+facilitate the conversion of the data models between different machine learning
+frameworks, and to improve their portability on different computing
+architectures. More details are available from the `ONNX tutorial
+<https://onnx.ai/get-started.html>`__. To convert scikit-learn model to `ONNX`
+`sklearn-onnx <http://onnx.ai/sklearn-onnx/>`__ has been developed. However,
+not all scikit-learn models are supported, and it is limited to the core
+scikit-learn and does not support most third party estimators. One can write a
+custom converter for third party or custom estimators, but the documentation to
+do that is sparse and it might be challenging to do so.
+
+.. dropdown:: Using ONNX
+
+  To convert the model to `ONNX` format, you need to give the converter some
+  information about the input as well, about which you can read more `here
+  <http://onnx.ai/sklearn-onnx/index.html>`__::
+
+      from skl2onnx import to_onnx
+      onx = to_onnx(clf, X[:1].astype(numpy.float32), target_opset=12)
+      with open("filename.onnx", "wb") as f:
+          f.write(onx.SerializeToString())
+
+  You can load the model in Python and use the `ONNX` runtime to get
+  predictions::
+
+      from onnxruntime import InferenceSession
+      with open("filename.onnx", "rb") as f:
+          onx = f.read()
+      sess = InferenceSession(onx, providers=["CPUExecutionProvider"])
+      pred_ort = sess.run(None, {"X": X_test.astype(numpy.float32)})[0]
+
+.. _skops_persistence:
+
+`skops.io`
+----------
+
+:mod:`skops.io` avoids using :mod:`pickle` and only loads files which have types
+and references to functions which are trusted either by default or by the user.
+Therefore it provides a more secure format than :mod:`pickle`, :mod:`joblib`,
+and `cloudpickle`_.
+
+
+.. dropdown:: Using skops
+
+  The API is very similar to :mod:`pickle`, and you can persist your models as
+  explained in the `documentation
+  <https://skops.readthedocs.io/en/stable/persistence.html>`__ using
+  :func:`skops.io.dump` and :func:`skops.io.dumps`::
+
+      import skops.io as sio
+      obj = sio.dump(clf, "filename.skops")
+
+  And you can load them back using :func:`skops.io.load` and
+  :func:`skops.io.loads`. However, you need to specify the types which are
+  trusted by you. You can get existing unknown types in a dumped object / file
+  using :func:`skops.io.get_untrusted_types`, and after checking its contents,
+  pass it to the load function::
+
+      unknown_types = sio.get_untrusted_types(file="filename.skops")
+      # investigate the contents of unknown_types, and only load if you trust
+      # everything you see.
+      clf = sio.load("filename.skops", trusted=unknown_types)
+
+  Please report issues and feature requests related to this format on the `skops
+  issue tracker <https://github.com/skops-dev/skops/issues>`__.
+
+
+.. _pickle_persistence:
+
+`pickle`, `joblib`, and `cloudpickle`
+-------------------------------------
+
+These three modules / packages, use the `pickle` protocol under the hood, but
+come with slight variations:
+
+- :mod:`pickle` is a module from the Python Standard Library. It can serialize
+  and  deserialize any Python object, including custom Python classes and
+  objects.
+- :mod:`joblib` is more efficient than `pickle` when working with large machine
+  learning models or large numpy arrays.
+- `cloudpickle`_ can serialize certain objects which cannot be serialized by
+  :mod:`pickle` or :mod:`joblib`, such as user defined functions and lambda
+  functions. This can happen for instance, when using a
+  :class:`~sklearn.preprocessing.FunctionTransformer` and using a custom
+  function to transform the data.
+
+.. dropdown:: Using `pickle`, `joblib`, or `cloudpickle`
+
+  Depending on your use-case, you can choose one of these three methods to
+  persist and load your scikit-learn model, and they all follow the same API::
+
+      # Here you can replace pickle with joblib or cloudpickle
+      from pickle import dump
+      with open("filename.pkl", "wb") as f:
+          dump(clf, f, protocol=5)
+
+  Using `protocol=5` is recommended to reduce memory usage and make it faster to
+  store and load any large NumPy array stored as a fitted attribute in the model.
+  You can alternatively pass `protocol=pickle.HIGHEST_PROTOCOL` which is
+  equivalent to `protocol=5` in Python 3.8 and later (at the time of writing).
+
+  And later when needed, you can load the same object from the persisted file::
+
+      # Here you can replace pickle with joblib or cloudpickle
+      from pickle import load
+      with open("filename.pkl", "rb") as f:
+          clf = load(f)
+
+.. _persistence_limitations:
+
+Security & Maintainability Limitations
+--------------------------------------
+
+:mod:`pickle` (and :mod:`joblib` and :mod:`clouldpickle` by extension), has
+many documented security vulnerabilities by design and should only be used if
+the artifact, i.e. the pickle-file, is coming from a trusted and verified
+source. You should never load a pickle file from an untrusted source, similarly
+to how you should never execute code from an untrusted source.
+
+Also note that arbitrary computations can be represented using the `ONNX`
+format, and it is therefore recommended to serve models using `ONNX` in a
+sandboxed environment to safeguard against computational and memory exploits.
+
+Also note that there are no supported ways to load a model trained with a
+different version of scikit-learn. While using :mod:`skops.io`, :mod:`joblib`,
+:mod:`pickle`, or `cloudpickle`_, models saved using one version of
+scikit-learn might load in other versions, however, this is entirely
+unsupported and inadvisable. It should also be kept in mind that operations
+performed on such data could give different and unexpected results, or even
+crash your Python process.
+
+In order to rebuild a similar model with future versions of scikit-learn,
+additional metadata should be saved along the pickled model:
+
+* The training data, e.g. a reference to an immutable snapshot
+* The Python source code used to generate the model
+* The versions of scikit-learn and its dependencies
+* The cross validation score obtained on the training data
+
+This should make it possible to check that the cross-validation score is in the
+same range as before.
+
+Aside for a few exceptions, persisted models should be portable across
+operating systems and hardware architectures assuming the same versions of
+dependencies and Python are used. If you encounter an estimator that is not
+portable, please open an issue on GitHub. Persisted models are often deployed
+in production using containers like Docker, in order to freeze the environment
+and dependencies.
+
+If you want to know more about these issues, please refer to these talks:
+
+- `Adrin Jalali: Let's exploit pickle, and skops to the rescue! | PyData
+  Amsterdam 2023 <https://www.youtube.com/watch?v=9w_H5OSTO9A>`__.
+- `Alex Gaynor: Pickles are for Delis, not Software - PyCon 2014
+  <https://pyvideo.org/video/2566/pickles-are-for-delis-not-software>`__.
+
+
+.. _serving_environment:
+
+Replicating the training environment in production
+..................................................
+
+If the versions of the dependencies used may differ from training to
+production, it may result in unexpected behaviour and errors while using the
+trained model. To prevent such situations it is recommended to use the same
+dependencies and versions in both the training and production environment.
+These transitive dependencies can be pinned with the help of package management
+tools like `pip`, `mamba`, `conda`, `poetry`, `conda-lock`, `pixi`, etc.
+
+It is not always possible to load an model trained with older versions of the
+scikit-learn library and its dependencies in an updated software environment.
+Instead, you might need to retrain the model with the new versions of the all
+the libraries. So when training a model, it is important to record the training
+recipe (e.g. a Python script) and training set information, and metadata about
+all the dependencies to be able to automatically reconstruct the same training
+environment for the updated software.
+
+.. dropdown:: InconsistentVersionWarning
+
+  When an estimator is loaded with a scikit-learn version that is inconsistent
+  with the version the estimator was pickled with, a
+  :class:`~sklearn.exceptions.InconsistentVersionWarning` is raised. This warning
+  can be caught to obtain the original version the estimator was pickled with::
+
+    from sklearn.exceptions import InconsistentVersionWarning
+    warnings.simplefilter("error", InconsistentVersionWarning)
+
+    try:
+        with open("model_from_prevision_version.pickle", "rb") as f:
+            est = pickle.load(f)
+    except InconsistentVersionWarning as w:
+        print(w.original_sklearn_version)
+
+
+Serving the model artifact
+..........................
+
+The last step after training a scikit-learn model is serving the model.
+Once the trained model is successfully loaded, it can be served to manage
+different prediction requests. This can involve deploying the model as a
+web service using containerization, or other model deployment strategies,
+according to the specifications.
+
+
+Summarizing the key points
+--------------------------
+
+Based on the different approaches for model persistence, the key points for
+each approach can be summarized as follows:
+
+* `ONNX`: It provides a uniform format for persisting any machine learning or
+  deep learning model (other than scikit-learn) and is useful for model
+  inference (predictions). It can however, result in compatibility issues with
+  different frameworks.
+* :mod:`skops.io`: Trained scikit-learn models can be easily shared and put
+  into production using :mod:`skops.io`. It is more secure compared to
+  alternate approaches based on :mod:`pickle` because it does not load
+  arbitrary code unless explicitly asked for by the user. Such code needs to be
+  packaged and importable in the target Python environment.
+* :mod:`joblib`: Efficient memory mapping techniques make it faster when using
+  the same persisted model in multiple Python processes when using
+  `mmap_mode="r"`. It also gives easy shortcuts to compress and decompress the
+  persisted object without the need for extra code. However, it may trigger the
+  execution of malicious code when loading a model from an untrusted source as
+  any other pickle-based persistence mechanism.
+* :mod:`pickle`: It is native to Python and most Python objects can be
+  serialized and deserialized using :mod:`pickle`, including custom Python
+  classes and functions as long as they are defined in a package that can be
+  imported in the target environment. While :mod:`pickle` can be used to easily
+  save and load scikit-learn models, it may trigger the execution of malicious
+  code while loading a model from an untrusted source. :mod:`pickle` can also
+  be very efficient memorywise if the model was persisted with `protocol=5` but
+  it does not support memory mapping.
+* `cloudpickle`_: It has comparable loading efficiency as :mod:`pickle` and
+  :mod:`joblib` (without memory mapping), but offers additional flexibility to
+  serialize custom Python code such as lambda expressions and interactively
+  defined functions and classes. It might be a last resort to persist pipelines
+  with custom Python components such as a
+  :class:`sklearn.preprocessing.FunctionTransformer` that wraps a function
+  defined in the training script itself or more generally outside of any
+  importable Python package. Note that `cloudpickle`_ offers no forward
+  compatibility guarantees and you might need the same version of
+  `cloudpickle`_ to load the persisted model along with the same version of all
+  the libraries used to define the model. As the other pickle-based persistence
+  mechanisms, it may trigger the execution of malicious code while loading
+  a model from an untrusted source.
+
+.. _cloudpickle: https://github.com/cloudpipe/cloudpickle
diff --git a/doc/model_selection.rst b/doc/model_selection.rst
index 25cd2b655ccc5..b78c9ff4c3aa8 100644
--- a/doc/model_selection.rst
+++ b/doc/model_selection.rst
@@ -1,9 +1,3 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
-.. include:: includes/big_toc_css.rst
-
 .. _model_selection:
 
 Model selection and evaluation
@@ -14,5 +8,6 @@ Model selection and evaluation
 
     modules/cross_validation
     modules/grid_search
+    modules/classification_threshold
     modules/model_evaluation
     modules/learning_curve
diff --git a/doc/modules/array_api.rst b/doc/modules/array_api.rst
index 6037d644d3f7d..53411f87a5305 100644
--- a/doc/modules/array_api.rst
+++ b/doc/modules/array_api.rst
@@ -1,7 +1,3 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
 .. _array_api:
 
 ================================
@@ -95,16 +91,43 @@ Estimators
 
 - :class:`decomposition.PCA` (with `svd_solver="full"`,
   `svd_solver="randomized"` and `power_iteration_normalizer="QR"`)
+- :class:`linear_model.Ridge` (with `solver="svd"`)
 - :class:`discriminant_analysis.LinearDiscriminantAnalysis` (with `solver="svd"`)
 - :class:`preprocessing.KernelCenterer`
 - :class:`preprocessing.MaxAbsScaler`
 - :class:`preprocessing.MinMaxScaler`
 - :class:`preprocessing.Normalizer`
 
+Meta-estimators
+---------------
+
+Meta-estimators that accept Array API inputs conditioned on the fact that the
+base estimator also does:
+
+- :class:`model_selection.GridSearchCV`
+- :class:`model_selection.RandomizedSearchCV`
+- :class:`model_selection.HalvingGridSearchCV`
+- :class:`model_selection.HalvingRandomSearchCV`
+
 Metrics
 -------
 
+- :func:`sklearn.metrics.cluster.entropy`
 - :func:`sklearn.metrics.accuracy_score`
+- :func:`sklearn.metrics.d2_tweedie_score`
+- :func:`sklearn.metrics.max_error`
+- :func:`sklearn.metrics.mean_absolute_error`
+- :func:`sklearn.metrics.mean_absolute_percentage_error`
+- :func:`sklearn.metrics.mean_gamma_deviance`
+- :func:`sklearn.metrics.mean_squared_error`
+- :func:`sklearn.metrics.mean_tweedie_deviance`
+- :func:`sklearn.metrics.pairwise.additive_chi2_kernel`
+- :func:`sklearn.metrics.pairwise.chi2_kernel`
+- :func:`sklearn.metrics.pairwise.cosine_similarity`
+- :func:`sklearn.metrics.pairwise.cosine_distances`
+- :func:`sklearn.metrics.pairwise.euclidean_distances` (see :ref:`device_support_for_float64`)
+- :func:`sklearn.metrics.pairwise.paired_cosine_distances`
+- :func:`sklearn.metrics.pairwise.rbf_kernel` (see :ref:`device_support_for_float64`)
 - :func:`sklearn.metrics.r2_score`
 - :func:`sklearn.metrics.zero_one_loss`
 
@@ -153,6 +176,8 @@ automatically skipped. Therefore it's important to run the tests with the
     pip install array-api-compat  # and other libraries as needed
     pytest -k "array_api" -v
 
+.. _mps_support:
+
 Note on MPS device support
 --------------------------
 
@@ -172,3 +197,17 @@ To enable the MPS support in PyTorch, set the environment variable
 
 At the time of writing all scikit-learn tests should pass, however, the
 computational speed is not necessarily better than with the CPU device.
+
+.. _device_support_for_float64:
+
+Note on device support for ``float64``
+--------------------------------------
+
+Certain operations within scikit-learn will automatically perform operations
+on floating-point values with `float64` precision to prevent overflows and ensure
+correctness (e.g., :func:`metrics.pairwise.euclidean_distances`). However,
+certain combinations of array namespaces and devices, such as `PyTorch on MPS`
+(see :ref:`mps_support`) do not support the `float64` data type. In these cases,
+scikit-learn will revert to using the `float32` data type instead. This can result in
+different behavior (typically numerically unstable results) compared to not using array
+API dispatching or using a device with `float64` support.
diff --git a/doc/modules/biclustering.rst b/doc/modules/biclustering.rst
index 2189e85e0f0ef..4370c56f63e9d 100644
--- a/doc/modules/biclustering.rst
+++ b/doc/modules/biclustering.rst
@@ -147,21 +147,21 @@ Then the rows of :math:`Z` are clustered using :ref:`k-means
 and the remaining ``n_columns`` labels provide the column partitioning.
 
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_bicluster_plot_spectral_coclustering.py`: A simple example
-   showing how to generate a data matrix with biclusters and apply
-   this method to it.
+* :ref:`sphx_glr_auto_examples_bicluster_plot_spectral_coclustering.py`: A simple example
+  showing how to generate a data matrix with biclusters and apply
+  this method to it.
 
- * :ref:`sphx_glr_auto_examples_bicluster_plot_bicluster_newsgroups.py`: An example of finding
-   biclusters in the twenty newsgroup dataset.
+* :ref:`sphx_glr_auto_examples_bicluster_plot_bicluster_newsgroups.py`: An example of finding
+  biclusters in the twenty newsgroup dataset.
 
 
-.. topic:: References:
+.. rubric:: References
 
- * Dhillon, Inderjit S, 2001. :doi:`Co-clustering documents and words using
-   bipartite spectral graph partitioning
-   <10.1145/502512.502550>`
+* Dhillon, Inderjit S, 2001. :doi:`Co-clustering documents and words using
+  bipartite spectral graph partitioning
+  <10.1145/502512.502550>`
 
 
 .. _spectral_biclustering:
@@ -234,17 +234,17 @@ Similarly, projecting the columns to :math:`A^{\top} * U` and
 clustering this :math:`n \times q` matrix yields the column labels.
 
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_bicluster_plot_spectral_biclustering.py`: a simple example
-   showing how to generate a checkerboard matrix and bicluster it.
+* :ref:`sphx_glr_auto_examples_bicluster_plot_spectral_biclustering.py`: a simple example
+  showing how to generate a checkerboard matrix and bicluster it.
 
 
-.. topic:: References:
+.. rubric:: References
 
- * Kluger, Yuval, et. al., 2003. :doi:`Spectral biclustering of microarray
-   data: coclustering genes and conditions
-   <10.1101/gr.648603>`
+* Kluger, Yuval, et. al., 2003. :doi:`Spectral biclustering of microarray
+  data: coclustering genes and conditions
+  <10.1101/gr.648603>`
 
 
 .. _biclustering_evaluation:
@@ -288,7 +288,8 @@ available:
 
 2. Assign biclusters from one set to another in a one-to-one fashion
    to maximize the sum of their similarities. This step is performed
-   using the Hungarian algorithm.
+   using :func:`scipy.optimize.linear_sum_assignment`, which uses a 
+   modified Jonker-Volgenant algorithm.
 
 3. The final sum of similarities is divided by the size of the larger
    set.
@@ -298,8 +299,8 @@ are totally dissimilar. The maximum score, 1, occurs when both sets
 are identical.
 
 
-.. topic:: References:
+.. rubric:: References
 
- * Hochreiter, Bodenhofer, et. al., 2010. `FABIA: factor analysis
-   for bicluster acquisition
-   <https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2881408/>`__.
+* Hochreiter, Bodenhofer, et. al., 2010. `FABIA: factor analysis
+  for bicluster acquisition
+  <https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2881408/>`__.
\ No newline at end of file
diff --git a/doc/modules/calibration.rst b/doc/modules/calibration.rst
index c0a6edb837b2f..a2bfa152d2b26 100644
--- a/doc/modules/calibration.rst
+++ b/doc/modules/calibration.rst
@@ -262,51 +262,51 @@ probabilities, the calibrated probabilities for each class
 are predicted separately. As those probabilities do not necessarily sum to
 one, a postprocessing is performed to normalize them.
 
-.. topic:: Examples:
-
-   * :ref:`sphx_glr_auto_examples_calibration_plot_calibration_curve.py`
-   * :ref:`sphx_glr_auto_examples_calibration_plot_calibration_multiclass.py`
-   * :ref:`sphx_glr_auto_examples_calibration_plot_calibration.py`
-   * :ref:`sphx_glr_auto_examples_calibration_plot_compare_calibration.py`
-
-.. topic:: References:
-
-    .. [1] Allan H. Murphy (1973).
-           :doi:`"A New Vector Partition of the Probability Score"
-           <10.1175/1520-0450(1973)012%3C0595:ANVPOT%3E2.0.CO;2>`
-           Journal of Applied Meteorology and Climatology
-
-    .. [2] `On the combination of forecast probabilities for
-           consecutive precipitation periods.
-           <https://journals.ametsoc.org/waf/article/5/4/640/40179>`_
-           Wea. Forecasting, 5, 640–650., Wilks, D. S., 1990a
-
-    .. [3] `Predicting Good Probabilities with Supervised Learning
-           <https://www.cs.cornell.edu/~alexn/papers/calibration.icml05.crc.rev3.pdf>`_,
-           A. Niculescu-Mizil & R. Caruana, ICML 2005
-
-
-    .. [4] `Probabilistic Outputs for Support Vector Machines and Comparisons
-           to Regularized Likelihood Methods.
-           <https://www.cs.colorado.edu/~mozer/Teaching/syllabi/6622/papers/Platt1999.pdf>`_
-           J. Platt, (1999)
-
-    .. [5] `Transforming Classifier Scores into Accurate Multiclass
-           Probability Estimates.
-           <https://dl.acm.org/doi/pdf/10.1145/775047.775151>`_
-           B. Zadrozny & C. Elkan, (KDD 2002)
-
-    .. [6] `Predicting accurate probabilities with a ranking loss.
-           <https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4180410/>`_
-           Menon AK, Jiang XJ, Vembu S, Elkan C, Ohno-Machado L.
-           Proc Int Conf Mach Learn. 2012;2012:703-710
-
-    .. [7] `Beyond sigmoids: How to obtain well-calibrated probabilities from
-           binary classifiers with beta calibration
-           <https://projecteuclid.org/euclid.ejs/1513306867>`_
-           Kull, M., Silva Filho, T. M., & Flach, P. (2017).
-
-    .. [8] Mario V. Wüthrich, Michael Merz (2023).
-           :doi:`"Statistical Foundations of Actuarial Learning and its Applications"
-           <10.1007/978-3-031-12409-9>`
-           Springer Actuarial
+.. rubric:: Examples
+
+* :ref:`sphx_glr_auto_examples_calibration_plot_calibration_curve.py`
+* :ref:`sphx_glr_auto_examples_calibration_plot_calibration_multiclass.py`
+* :ref:`sphx_glr_auto_examples_calibration_plot_calibration.py`
+* :ref:`sphx_glr_auto_examples_calibration_plot_compare_calibration.py`
+
+.. rubric:: References
+
+.. [1] Allan H. Murphy (1973).
+       :doi:`"A New Vector Partition of the Probability Score"
+       <10.1175/1520-0450(1973)012%3C0595:ANVPOT%3E2.0.CO;2>`
+       Journal of Applied Meteorology and Climatology
+
+.. [2] `On the combination of forecast probabilities for
+       consecutive precipitation periods.
+       <https://journals.ametsoc.org/waf/article/5/4/640/40179>`_
+       Wea. Forecasting, 5, 640–650., Wilks, D. S., 1990a
+
+.. [3] `Predicting Good Probabilities with Supervised Learning
+       <https://www.cs.cornell.edu/~alexn/papers/calibration.icml05.crc.rev3.pdf>`_,
+       A. Niculescu-Mizil & R. Caruana, ICML 2005
+
+
+.. [4] `Probabilistic Outputs for Support Vector Machines and Comparisons
+       to Regularized Likelihood Methods.
+       <https://www.cs.colorado.edu/~mozer/Teaching/syllabi/6622/papers/Platt1999.pdf>`_
+       J. Platt, (1999)
+
+.. [5] `Transforming Classifier Scores into Accurate Multiclass
+       Probability Estimates.
+       <https://dl.acm.org/doi/pdf/10.1145/775047.775151>`_
+       B. Zadrozny & C. Elkan, (KDD 2002)
+
+.. [6] `Predicting accurate probabilities with a ranking loss.
+       <https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4180410/>`_
+       Menon AK, Jiang XJ, Vembu S, Elkan C, Ohno-Machado L.
+       Proc Int Conf Mach Learn. 2012;2012:703-710
+
+.. [7] `Beyond sigmoids: How to obtain well-calibrated probabilities from
+       binary classifiers with beta calibration
+       <https://projecteuclid.org/euclid.ejs/1513306867>`_
+       Kull, M., Silva Filho, T. M., & Flach, P. (2017).
+
+.. [8] Mario V. Wüthrich, Michael Merz (2023).
+       :doi:`"Statistical Foundations of Actuarial Learning and its Applications"
+       <10.1007/978-3-031-12409-9>`
+       Springer Actuarial
diff --git a/doc/modules/classes.rst b/doc/modules/classes.rst
deleted file mode 100644
index 55336389f93d5..0000000000000
--- a/doc/modules/classes.rst
+++ /dev/null
@@ -1,1904 +0,0 @@
-.. _api_ref:
-
-=============
-API Reference
-=============
-
-This is the class and function reference of scikit-learn. Please refer to
-the :ref:`full user guide <user_guide>` for further details, as the class and
-function raw specifications may not be enough to give full guidelines on their
-uses.
-For reference on concepts repeated across the API, see :ref:`glossary`.
-
-:mod:`sklearn`: Settings and information tools
-==============================================
-
-.. automodule:: sklearn
-    :no-members:
-    :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   config_context
-   get_config
-   set_config
-   show_versions
-
-:mod:`sklearn.base`: Base classes and utility functions
-=======================================================
-
-.. automodule:: sklearn.base
-    :no-members:
-    :no-inherited-members:
-
-Base classes
-------------
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :nosignatures:
-   :toctree: generated/
-   :template: class.rst
-
-   base.BaseEstimator
-   base.BiclusterMixin
-   base.ClassifierMixin
-   base.ClusterMixin
-   base.DensityMixin
-   base.RegressorMixin
-   base.TransformerMixin
-   base.MetaEstimatorMixin
-   base.OneToOneFeatureMixin
-   base.OutlierMixin
-   base.ClassNamePrefixFeaturesOutMixin
-   feature_selection.SelectorMixin
-
-Functions
----------
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   base.clone
-   base.is_classifier
-   base.is_regressor
-
-.. _calibration_ref:
-
-:mod:`sklearn.calibration`: Probability Calibration
-===================================================
-
-.. automodule:: sklearn.calibration
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`calibration` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   calibration.CalibratedClassifierCV
-
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   calibration.calibration_curve
-
-.. _cluster_ref:
-
-:mod:`sklearn.cluster`: Clustering
-==================================
-
-.. automodule:: sklearn.cluster
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`clustering` and :ref:`biclustering` sections for
-further details.
-
-Classes
--------
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   cluster.AffinityPropagation
-   cluster.AgglomerativeClustering
-   cluster.Birch
-   cluster.DBSCAN
-   cluster.HDBSCAN
-   cluster.FeatureAgglomeration
-   cluster.KMeans
-   cluster.BisectingKMeans
-   cluster.MiniBatchKMeans
-   cluster.MeanShift
-   cluster.OPTICS
-   cluster.SpectralClustering
-   cluster.SpectralBiclustering
-   cluster.SpectralCoclustering
-
-Functions
----------
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   cluster.affinity_propagation
-   cluster.cluster_optics_dbscan
-   cluster.cluster_optics_xi
-   cluster.compute_optics_graph
-   cluster.dbscan
-   cluster.estimate_bandwidth
-   cluster.k_means
-   cluster.kmeans_plusplus
-   cluster.mean_shift
-   cluster.spectral_clustering
-   cluster.ward_tree
-
-.. _compose_ref:
-
-:mod:`sklearn.compose`: Composite Estimators
-============================================
-
-.. automodule:: sklearn.compose
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`combining_estimators` section for further
-details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-    :toctree: generated/
-    :template: class.rst
-
-    compose.ColumnTransformer
-    compose.TransformedTargetRegressor
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   compose.make_column_transformer
-   compose.make_column_selector
-
-.. _covariance_ref:
-
-:mod:`sklearn.covariance`: Covariance Estimators
-================================================
-
-.. automodule:: sklearn.covariance
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`covariance` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   covariance.EmpiricalCovariance
-   covariance.EllipticEnvelope
-   covariance.GraphicalLasso
-   covariance.GraphicalLassoCV
-   covariance.LedoitWolf
-   covariance.MinCovDet
-   covariance.OAS
-   covariance.ShrunkCovariance
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   covariance.empirical_covariance
-   covariance.graphical_lasso
-   covariance.ledoit_wolf
-   covariance.ledoit_wolf_shrinkage
-   covariance.oas
-   covariance.shrunk_covariance
-
-.. _cross_decomposition_ref:
-
-:mod:`sklearn.cross_decomposition`: Cross decomposition
-=======================================================
-
-.. automodule:: sklearn.cross_decomposition
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`cross_decomposition` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   cross_decomposition.CCA
-   cross_decomposition.PLSCanonical
-   cross_decomposition.PLSRegression
-   cross_decomposition.PLSSVD
-
-.. _datasets_ref:
-
-:mod:`sklearn.datasets`: Datasets
-=================================
-
-.. automodule:: sklearn.datasets
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`datasets` section for further details.
-
-Loaders
--------
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   datasets.clear_data_home
-   datasets.dump_svmlight_file
-   datasets.fetch_20newsgroups
-   datasets.fetch_20newsgroups_vectorized
-   datasets.fetch_california_housing
-   datasets.fetch_covtype
-   datasets.fetch_kddcup99
-   datasets.fetch_lfw_pairs
-   datasets.fetch_lfw_people
-   datasets.fetch_olivetti_faces
-   datasets.fetch_openml
-   datasets.fetch_rcv1
-   datasets.fetch_species_distributions
-   datasets.get_data_home
-   datasets.load_breast_cancer
-   datasets.load_diabetes
-   datasets.load_digits
-   datasets.load_files
-   datasets.load_iris
-   datasets.load_linnerud
-   datasets.load_sample_image
-   datasets.load_sample_images
-   datasets.load_svmlight_file
-   datasets.load_svmlight_files
-   datasets.load_wine
-
-Samples generator
------------------
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   datasets.make_biclusters
-   datasets.make_blobs
-   datasets.make_checkerboard
-   datasets.make_circles
-   datasets.make_classification
-   datasets.make_friedman1
-   datasets.make_friedman2
-   datasets.make_friedman3
-   datasets.make_gaussian_quantiles
-   datasets.make_hastie_10_2
-   datasets.make_low_rank_matrix
-   datasets.make_moons
-   datasets.make_multilabel_classification
-   datasets.make_regression
-   datasets.make_s_curve
-   datasets.make_sparse_coded_signal
-   datasets.make_sparse_spd_matrix
-   datasets.make_sparse_uncorrelated
-   datasets.make_spd_matrix
-   datasets.make_swiss_roll
-
-
-.. _decomposition_ref:
-
-:mod:`sklearn.decomposition`: Matrix Decomposition
-==================================================
-
-.. automodule:: sklearn.decomposition
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`decompositions` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   decomposition.DictionaryLearning
-   decomposition.FactorAnalysis
-   decomposition.FastICA
-   decomposition.IncrementalPCA
-   decomposition.KernelPCA
-   decomposition.LatentDirichletAllocation
-   decomposition.MiniBatchDictionaryLearning
-   decomposition.MiniBatchSparsePCA
-   decomposition.NMF
-   decomposition.MiniBatchNMF
-   decomposition.PCA
-   decomposition.SparsePCA
-   decomposition.SparseCoder
-   decomposition.TruncatedSVD
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   decomposition.dict_learning
-   decomposition.dict_learning_online
-   decomposition.fastica
-   decomposition.non_negative_factorization
-   decomposition.sparse_encode
-
-.. _lda_ref:
-
-:mod:`sklearn.discriminant_analysis`: Discriminant Analysis
-===========================================================
-
-.. automodule:: sklearn.discriminant_analysis
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`lda_qda` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   discriminant_analysis.LinearDiscriminantAnalysis
-   discriminant_analysis.QuadraticDiscriminantAnalysis
-
-.. _dummy_ref:
-
-:mod:`sklearn.dummy`: Dummy estimators
-======================================
-
-.. automodule:: sklearn.dummy
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`model_evaluation` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   dummy.DummyClassifier
-   dummy.DummyRegressor
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-.. _ensemble_ref:
-
-:mod:`sklearn.ensemble`: Ensemble Methods
-=========================================
-
-.. automodule:: sklearn.ensemble
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`ensemble` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   ensemble.AdaBoostClassifier
-   ensemble.AdaBoostRegressor
-   ensemble.BaggingClassifier
-   ensemble.BaggingRegressor
-   ensemble.ExtraTreesClassifier
-   ensemble.ExtraTreesRegressor
-   ensemble.GradientBoostingClassifier
-   ensemble.GradientBoostingRegressor
-   ensemble.IsolationForest
-   ensemble.RandomForestClassifier
-   ensemble.RandomForestRegressor
-   ensemble.RandomTreesEmbedding
-   ensemble.StackingClassifier
-   ensemble.StackingRegressor
-   ensemble.VotingClassifier
-   ensemble.VotingRegressor
-   ensemble.HistGradientBoostingRegressor
-   ensemble.HistGradientBoostingClassifier
-
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-
-.. _exceptions_ref:
-
-:mod:`sklearn.exceptions`: Exceptions and warnings
-==================================================
-
-.. automodule:: sklearn.exceptions
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   exceptions.ConvergenceWarning
-   exceptions.DataConversionWarning
-   exceptions.DataDimensionalityWarning
-   exceptions.EfficiencyWarning
-   exceptions.FitFailedWarning
-   exceptions.InconsistentVersionWarning
-   exceptions.NotFittedError
-   exceptions.UndefinedMetricWarning
-
-
-:mod:`sklearn.experimental`: Experimental
-=========================================
-
-.. automodule:: sklearn.experimental
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-
-   experimental.enable_iterative_imputer
-   experimental.enable_halving_search_cv
-
-
-.. _feature_extraction_ref:
-
-:mod:`sklearn.feature_extraction`: Feature Extraction
-=====================================================
-
-.. automodule:: sklearn.feature_extraction
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`feature_extraction` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   feature_extraction.DictVectorizer
-   feature_extraction.FeatureHasher
-
-From images
------------
-
-.. automodule:: sklearn.feature_extraction.image
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   feature_extraction.image.extract_patches_2d
-   feature_extraction.image.grid_to_graph
-   feature_extraction.image.img_to_graph
-   feature_extraction.image.reconstruct_from_patches_2d
-
-   :template: class.rst
-
-   feature_extraction.image.PatchExtractor
-
-.. _text_feature_extraction_ref:
-
-From text
----------
-
-.. automodule:: sklearn.feature_extraction.text
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   feature_extraction.text.CountVectorizer
-   feature_extraction.text.HashingVectorizer
-   feature_extraction.text.TfidfTransformer
-   feature_extraction.text.TfidfVectorizer
-
-
-.. _feature_selection_ref:
-
-:mod:`sklearn.feature_selection`: Feature Selection
-===================================================
-
-.. automodule:: sklearn.feature_selection
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`feature_selection` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   feature_selection.GenericUnivariateSelect
-   feature_selection.SelectPercentile
-   feature_selection.SelectKBest
-   feature_selection.SelectFpr
-   feature_selection.SelectFdr
-   feature_selection.SelectFromModel
-   feature_selection.SelectFwe
-   feature_selection.SequentialFeatureSelector
-   feature_selection.RFE
-   feature_selection.RFECV
-   feature_selection.VarianceThreshold
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   feature_selection.chi2
-   feature_selection.f_classif
-   feature_selection.f_regression
-   feature_selection.r_regression
-   feature_selection.mutual_info_classif
-   feature_selection.mutual_info_regression
-
-
-.. _gaussian_process_ref:
-
-:mod:`sklearn.gaussian_process`: Gaussian Processes
-===================================================
-
-.. automodule:: sklearn.gaussian_process
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`gaussian_process` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-  :toctree: generated/
-  :template: class.rst
-
-  gaussian_process.GaussianProcessClassifier
-  gaussian_process.GaussianProcessRegressor
-
-Kernels
--------
-
-.. automodule:: sklearn.gaussian_process.kernels
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-  :toctree: generated/
-  :template: class_with_call.rst
-
-  gaussian_process.kernels.CompoundKernel
-  gaussian_process.kernels.ConstantKernel
-  gaussian_process.kernels.DotProduct
-  gaussian_process.kernels.ExpSineSquared
-  gaussian_process.kernels.Exponentiation
-  gaussian_process.kernels.Hyperparameter
-  gaussian_process.kernels.Kernel
-  gaussian_process.kernels.Matern
-  gaussian_process.kernels.PairwiseKernel
-  gaussian_process.kernels.Product
-  gaussian_process.kernels.RBF
-  gaussian_process.kernels.RationalQuadratic
-  gaussian_process.kernels.Sum
-  gaussian_process.kernels.WhiteKernel
-
-
-.. _impute_ref:
-
-:mod:`sklearn.impute`: Impute
-=============================
-
-.. automodule:: sklearn.impute
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`Impute` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   impute.SimpleImputer
-   impute.IterativeImputer
-   impute.MissingIndicator
-   impute.KNNImputer
-
-
-.. _inspection_ref:
-
-:mod:`sklearn.inspection`: Inspection
-=====================================
-
-.. automodule:: sklearn.inspection
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   inspection.partial_dependence
-   inspection.permutation_importance
-
-Plotting
---------
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: display_only_from_estimator.rst
-
-   inspection.DecisionBoundaryDisplay
-   inspection.PartialDependenceDisplay
-
-.. _isotonic_ref:
-
-:mod:`sklearn.isotonic`: Isotonic regression
-============================================
-
-.. automodule:: sklearn.isotonic
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`isotonic` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   isotonic.IsotonicRegression
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   isotonic.check_increasing
-   isotonic.isotonic_regression
-
-
-.. _kernel_approximation_ref:
-
-:mod:`sklearn.kernel_approximation`: Kernel Approximation
-=========================================================
-
-.. automodule:: sklearn.kernel_approximation
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`kernel_approximation` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   kernel_approximation.AdditiveChi2Sampler
-   kernel_approximation.Nystroem
-   kernel_approximation.PolynomialCountSketch
-   kernel_approximation.RBFSampler
-   kernel_approximation.SkewedChi2Sampler
-
-.. _kernel_ridge_ref:
-
-:mod:`sklearn.kernel_ridge`: Kernel Ridge Regression
-====================================================
-
-.. automodule:: sklearn.kernel_ridge
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`kernel_ridge` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   kernel_ridge.KernelRidge
-
-.. _linear_model_ref:
-
-:mod:`sklearn.linear_model`: Linear Models
-==========================================
-
-.. automodule:: sklearn.linear_model
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`linear_model` section for further details.
-
-The following subsections are only rough guidelines: the same estimator can
-fall into multiple categories, depending on its parameters.
-
-.. currentmodule:: sklearn
-
-Linear classifiers
-------------------
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   linear_model.LogisticRegression
-   linear_model.LogisticRegressionCV
-   linear_model.PassiveAggressiveClassifier
-   linear_model.Perceptron
-   linear_model.RidgeClassifier
-   linear_model.RidgeClassifierCV
-   linear_model.SGDClassifier
-   linear_model.SGDOneClassSVM
-
-Classical linear regressors
----------------------------
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   linear_model.LinearRegression
-   linear_model.Ridge
-   linear_model.RidgeCV
-   linear_model.SGDRegressor
-
-Regressors with variable selection
-----------------------------------
-
-The following estimators have built-in variable selection fitting
-procedures, but any estimator using a L1 or elastic-net penalty also
-performs variable selection: typically :class:`~linear_model.SGDRegressor`
-or :class:`~sklearn.linear_model.SGDClassifier` with an appropriate penalty.
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   linear_model.ElasticNet
-   linear_model.ElasticNetCV
-   linear_model.Lars
-   linear_model.LarsCV
-   linear_model.Lasso
-   linear_model.LassoCV
-   linear_model.LassoLars
-   linear_model.LassoLarsCV
-   linear_model.LassoLarsIC
-   linear_model.OrthogonalMatchingPursuit
-   linear_model.OrthogonalMatchingPursuitCV
-
-Bayesian regressors
--------------------
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   linear_model.ARDRegression
-   linear_model.BayesianRidge
-
-Multi-task linear regressors with variable selection
-----------------------------------------------------
-
-These estimators fit multiple regression problems (or tasks) jointly, while
-inducing sparse coefficients. While the inferred coefficients may differ
-between the tasks, they are constrained to agree on the features that are
-selected (non-zero coefficients).
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   linear_model.MultiTaskElasticNet
-   linear_model.MultiTaskElasticNetCV
-   linear_model.MultiTaskLasso
-   linear_model.MultiTaskLassoCV
-
-Outlier-robust regressors
--------------------------
-
-Any estimator using the Huber loss would also be robust to outliers, e.g.
-:class:`~linear_model.SGDRegressor` with ``loss='huber'``.
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   linear_model.HuberRegressor
-   linear_model.QuantileRegressor
-   linear_model.RANSACRegressor
-   linear_model.TheilSenRegressor
-
-Generalized linear models (GLM) for regression
-----------------------------------------------
-
-These models allow for response variables to have error distributions other
-than a normal distribution:
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   linear_model.PoissonRegressor
-   linear_model.TweedieRegressor
-   linear_model.GammaRegressor
-
-
-Miscellaneous
--------------
-
-.. autosummary::
-   :toctree: generated/
-   :template: classes.rst
-
-   linear_model.PassiveAggressiveRegressor
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   linear_model.enet_path
-   linear_model.lars_path
-   linear_model.lars_path_gram
-   linear_model.lasso_path
-   linear_model.orthogonal_mp
-   linear_model.orthogonal_mp_gram
-   linear_model.ridge_regression
-
-
-.. _manifold_ref:
-
-:mod:`sklearn.manifold`: Manifold Learning
-==========================================
-
-.. automodule:: sklearn.manifold
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`manifold` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-    :toctree: generated
-    :template: class.rst
-
-    manifold.Isomap
-    manifold.LocallyLinearEmbedding
-    manifold.MDS
-    manifold.SpectralEmbedding
-    manifold.TSNE
-
-.. autosummary::
-    :toctree: generated
-    :template: function.rst
-
-    manifold.locally_linear_embedding
-    manifold.smacof
-    manifold.spectral_embedding
-    manifold.trustworthiness
-
-
-.. _metrics_ref:
-
-:mod:`sklearn.metrics`: Metrics
-===============================
-
-See the :ref:`model_evaluation` section and the :ref:`metrics` section of the
-user guide for further details.
-
-.. automodule:: sklearn.metrics
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-Model Selection Interface
--------------------------
-See the :ref:`scoring_parameter` section of the user guide for further
-details.
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   metrics.check_scoring
-   metrics.get_scorer
-   metrics.get_scorer_names
-   metrics.make_scorer
-
-Classification metrics
-----------------------
-
-See the :ref:`classification_metrics` section of the user guide for further
-details.
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   metrics.accuracy_score
-   metrics.auc
-   metrics.average_precision_score
-   metrics.balanced_accuracy_score
-   metrics.brier_score_loss
-   metrics.class_likelihood_ratios
-   metrics.classification_report
-   metrics.cohen_kappa_score
-   metrics.confusion_matrix
-   metrics.dcg_score
-   metrics.det_curve
-   metrics.f1_score
-   metrics.fbeta_score
-   metrics.hamming_loss
-   metrics.hinge_loss
-   metrics.jaccard_score
-   metrics.log_loss
-   metrics.matthews_corrcoef
-   metrics.multilabel_confusion_matrix
-   metrics.ndcg_score
-   metrics.precision_recall_curve
-   metrics.precision_recall_fscore_support
-   metrics.precision_score
-   metrics.recall_score
-   metrics.roc_auc_score
-   metrics.roc_curve
-   metrics.top_k_accuracy_score
-   metrics.zero_one_loss
-
-Regression metrics
-------------------
-
-See the :ref:`regression_metrics` section of the user guide for further
-details.
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   metrics.explained_variance_score
-   metrics.max_error
-   metrics.mean_absolute_error
-   metrics.mean_squared_error
-   metrics.mean_squared_log_error
-   metrics.median_absolute_error
-   metrics.mean_absolute_percentage_error
-   metrics.r2_score
-   metrics.root_mean_squared_log_error
-   metrics.root_mean_squared_error
-   metrics.mean_poisson_deviance
-   metrics.mean_gamma_deviance
-   metrics.mean_tweedie_deviance
-   metrics.d2_tweedie_score
-   metrics.mean_pinball_loss
-   metrics.d2_pinball_score
-   metrics.d2_absolute_error_score
-
-Multilabel ranking metrics
---------------------------
-See the :ref:`multilabel_ranking_metrics` section of the user guide for further
-details.
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   metrics.coverage_error
-   metrics.label_ranking_average_precision_score
-   metrics.label_ranking_loss
-
-
-Clustering metrics
-------------------
-
-See the :ref:`clustering_evaluation` section of the user guide for further
-details.
-
-.. automodule:: sklearn.metrics.cluster
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   metrics.adjusted_mutual_info_score
-   metrics.adjusted_rand_score
-   metrics.calinski_harabasz_score
-   metrics.davies_bouldin_score
-   metrics.completeness_score
-   metrics.cluster.contingency_matrix
-   metrics.cluster.pair_confusion_matrix
-   metrics.fowlkes_mallows_score
-   metrics.homogeneity_completeness_v_measure
-   metrics.homogeneity_score
-   metrics.mutual_info_score
-   metrics.normalized_mutual_info_score
-   metrics.rand_score
-   metrics.silhouette_score
-   metrics.silhouette_samples
-   metrics.v_measure_score
-
-Biclustering metrics
---------------------
-
-See the :ref:`biclustering_evaluation` section of the user guide for
-further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   metrics.consensus_score
-
-Distance metrics
-----------------
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   metrics.DistanceMetric
-
-Pairwise metrics
-----------------
-
-See the :ref:`metrics` section of the user guide for further details.
-
-.. automodule:: sklearn.metrics.pairwise
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   metrics.pairwise.additive_chi2_kernel
-   metrics.pairwise.chi2_kernel
-   metrics.pairwise.cosine_similarity
-   metrics.pairwise.cosine_distances
-   metrics.pairwise.distance_metrics
-   metrics.pairwise.euclidean_distances
-   metrics.pairwise.haversine_distances
-   metrics.pairwise.kernel_metrics
-   metrics.pairwise.laplacian_kernel
-   metrics.pairwise.linear_kernel
-   metrics.pairwise.manhattan_distances
-   metrics.pairwise.nan_euclidean_distances
-   metrics.pairwise.pairwise_kernels
-   metrics.pairwise.polynomial_kernel
-   metrics.pairwise.rbf_kernel
-   metrics.pairwise.sigmoid_kernel
-   metrics.pairwise.paired_euclidean_distances
-   metrics.pairwise.paired_manhattan_distances
-   metrics.pairwise.paired_cosine_distances
-   metrics.pairwise.paired_distances
-   metrics.pairwise_distances
-   metrics.pairwise_distances_argmin
-   metrics.pairwise_distances_argmin_min
-   metrics.pairwise_distances_chunked
-
-
-Plotting
---------
-
-See the :ref:`visualizations` section of the user guide for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: display_all_class_methods.rst
-
-   metrics.ConfusionMatrixDisplay
-   metrics.DetCurveDisplay
-   metrics.PrecisionRecallDisplay
-   metrics.PredictionErrorDisplay
-   metrics.RocCurveDisplay
-   calibration.CalibrationDisplay
-
-.. _mixture_ref:
-
-:mod:`sklearn.mixture`: Gaussian Mixture Models
-===============================================
-
-.. automodule:: sklearn.mixture
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`mixture` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   mixture.BayesianGaussianMixture
-   mixture.GaussianMixture
-
-.. _modelselection_ref:
-
-:mod:`sklearn.model_selection`: Model Selection
-===============================================
-
-.. automodule:: sklearn.model_selection
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`cross_validation`, :ref:`grid_search` and
-:ref:`learning_curve` sections for further details.
-
-Splitter Classes
-----------------
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   model_selection.GroupKFold
-   model_selection.GroupShuffleSplit
-   model_selection.KFold
-   model_selection.LeaveOneGroupOut
-   model_selection.LeavePGroupsOut
-   model_selection.LeaveOneOut
-   model_selection.LeavePOut
-   model_selection.PredefinedSplit
-   model_selection.RepeatedKFold
-   model_selection.RepeatedStratifiedKFold
-   model_selection.ShuffleSplit
-   model_selection.StratifiedKFold
-   model_selection.StratifiedShuffleSplit
-   model_selection.StratifiedGroupKFold
-   model_selection.TimeSeriesSplit
-
-Splitter Functions
-------------------
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   model_selection.check_cv
-   model_selection.train_test_split
-
-.. _hyper_parameter_optimizers:
-
-Hyper-parameter optimizers
---------------------------
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   model_selection.GridSearchCV
-   model_selection.HalvingGridSearchCV
-   model_selection.ParameterGrid
-   model_selection.ParameterSampler
-   model_selection.RandomizedSearchCV
-   model_selection.HalvingRandomSearchCV
-
-
-Model validation
-----------------
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   model_selection.cross_validate
-   model_selection.cross_val_predict
-   model_selection.cross_val_score
-   model_selection.learning_curve
-   model_selection.permutation_test_score
-   model_selection.validation_curve
-
-Visualization
--------------
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: display_only_from_estimator.rst
-
-   model_selection.LearningCurveDisplay
-   model_selection.ValidationCurveDisplay
-
-.. _multiclass_ref:
-
-:mod:`sklearn.multiclass`: Multiclass classification
-====================================================
-
-.. automodule:: sklearn.multiclass
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`multiclass_classification` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-    :toctree: generated/
-    :template: class.rst
-
-    multiclass.OneVsRestClassifier
-    multiclass.OneVsOneClassifier
-    multiclass.OutputCodeClassifier
-
-.. _multioutput_ref:
-
-:mod:`sklearn.multioutput`: Multioutput regression and classification
-=====================================================================
-
-.. automodule:: sklearn.multioutput
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`multilabel_classification`,
-:ref:`multiclass_multioutput_classification`, and
-:ref:`multioutput_regression` sections for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-    :toctree: generated
-    :template: class.rst
-
-    multioutput.ClassifierChain
-    multioutput.MultiOutputRegressor
-    multioutput.MultiOutputClassifier
-    multioutput.RegressorChain
-
-.. _naive_bayes_ref:
-
-:mod:`sklearn.naive_bayes`: Naive Bayes
-=======================================
-
-.. automodule:: sklearn.naive_bayes
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`naive_bayes` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   naive_bayes.BernoulliNB
-   naive_bayes.CategoricalNB
-   naive_bayes.ComplementNB
-   naive_bayes.GaussianNB
-   naive_bayes.MultinomialNB
-
-
-.. _neighbors_ref:
-
-:mod:`sklearn.neighbors`: Nearest Neighbors
-===========================================
-
-.. automodule:: sklearn.neighbors
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`neighbors` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   neighbors.BallTree
-   neighbors.KDTree
-   neighbors.KernelDensity
-   neighbors.KNeighborsClassifier
-   neighbors.KNeighborsRegressor
-   neighbors.KNeighborsTransformer
-   neighbors.LocalOutlierFactor
-   neighbors.RadiusNeighborsClassifier
-   neighbors.RadiusNeighborsRegressor
-   neighbors.RadiusNeighborsTransformer
-   neighbors.NearestCentroid
-   neighbors.NearestNeighbors
-   neighbors.NeighborhoodComponentsAnalysis
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   neighbors.kneighbors_graph
-   neighbors.radius_neighbors_graph
-   neighbors.sort_graph_by_row_values
-
-.. _neural_network_ref:
-
-:mod:`sklearn.neural_network`: Neural network models
-====================================================
-
-.. automodule:: sklearn.neural_network
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`neural_networks_supervised` and :ref:`neural_networks_unsupervised` sections for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   neural_network.BernoulliRBM
-   neural_network.MLPClassifier
-   neural_network.MLPRegressor
-
-.. _pipeline_ref:
-
-:mod:`sklearn.pipeline`: Pipeline
-=================================
-
-.. automodule:: sklearn.pipeline
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`combining_estimators` section for further
-details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   pipeline.FeatureUnion
-   pipeline.Pipeline
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   pipeline.make_pipeline
-   pipeline.make_union
-
-.. _preprocessing_ref:
-
-:mod:`sklearn.preprocessing`: Preprocessing and Normalization
-=============================================================
-
-.. automodule:: sklearn.preprocessing
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`preprocessing` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   preprocessing.Binarizer
-   preprocessing.FunctionTransformer
-   preprocessing.KBinsDiscretizer
-   preprocessing.KernelCenterer
-   preprocessing.LabelBinarizer
-   preprocessing.LabelEncoder
-   preprocessing.MultiLabelBinarizer
-   preprocessing.MaxAbsScaler
-   preprocessing.MinMaxScaler
-   preprocessing.Normalizer
-   preprocessing.OneHotEncoder
-   preprocessing.OrdinalEncoder
-   preprocessing.PolynomialFeatures
-   preprocessing.PowerTransformer
-   preprocessing.QuantileTransformer
-   preprocessing.RobustScaler
-   preprocessing.SplineTransformer
-   preprocessing.StandardScaler
-   preprocessing.TargetEncoder
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   preprocessing.add_dummy_feature
-   preprocessing.binarize
-   preprocessing.label_binarize
-   preprocessing.maxabs_scale
-   preprocessing.minmax_scale
-   preprocessing.normalize
-   preprocessing.quantile_transform
-   preprocessing.robust_scale
-   preprocessing.scale
-   preprocessing.power_transform
-
-
-.. _random_projection_ref:
-
-:mod:`sklearn.random_projection`: Random projection
-===================================================
-
-.. automodule:: sklearn.random_projection
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`random_projection` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   random_projection.GaussianRandomProjection
-   random_projection.SparseRandomProjection
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   random_projection.johnson_lindenstrauss_min_dim
-
-
-.. _semi_supervised_ref:
-
-:mod:`sklearn.semi_supervised`: Semi-Supervised Learning
-========================================================
-
-.. automodule:: sklearn.semi_supervised
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`semi_supervised` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   semi_supervised.LabelPropagation
-   semi_supervised.LabelSpreading
-   semi_supervised.SelfTrainingClassifier
-
-
-.. _svm_ref:
-
-:mod:`sklearn.svm`: Support Vector Machines
-===========================================
-
-.. automodule:: sklearn.svm
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`svm` section for further details.
-
-Estimators
-----------
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   svm.LinearSVC
-   svm.LinearSVR
-   svm.NuSVC
-   svm.NuSVR
-   svm.OneClassSVM
-   svm.SVC
-   svm.SVR
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   svm.l1_min_c
-
-.. _tree_ref:
-
-:mod:`sklearn.tree`: Decision Trees
-===================================
-
-.. automodule:: sklearn.tree
-   :no-members:
-   :no-inherited-members:
-
-**User guide:** See the :ref:`tree` section for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   tree.DecisionTreeClassifier
-   tree.DecisionTreeRegressor
-   tree.ExtraTreeClassifier
-   tree.ExtraTreeRegressor
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   tree.export_graphviz
-   tree.export_text
-
-Plotting
---------
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   tree.plot_tree
-
-.. _utils_ref:
-
-:mod:`sklearn.utils`: Utilities
-===============================
-
-.. automodule:: sklearn.utils
-   :no-members:
-   :no-inherited-members:
-
-**Developer guide:** See the :ref:`developers-utils` page for further details.
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   utils.Bunch
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   utils.as_float_array
-   utils.assert_all_finite
-   utils.deprecated
-   utils.estimator_html_repr
-   utils.gen_batches
-   utils.gen_even_slices
-   utils.indexable
-   utils.murmurhash3_32
-   utils.resample
-   utils._safe_indexing
-   utils.safe_mask
-   utils.safe_sqr
-   utils.shuffle
-
-Input and parameter validation
-------------------------------
-
-.. automodule:: sklearn.utils.validation
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   utils.check_X_y
-   utils.check_array
-   utils.check_scalar
-   utils.check_consistent_length
-   utils.check_random_state
-   utils.validation.check_is_fitted
-   utils.validation.check_memory
-   utils.validation.check_symmetric
-   utils.validation.column_or_1d
-   utils.validation.has_fit_parameter
-
-Utilities used in meta-estimators
----------------------------------
-
-.. automodule:: sklearn.utils.metaestimators
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   utils.metaestimators.available_if
-
-Utilities to handle weights based on class labels
--------------------------------------------------
-
-.. automodule:: sklearn.utils.class_weight
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   utils.class_weight.compute_class_weight
-   utils.class_weight.compute_sample_weight
-
-Utilities to deal with multiclass target in classifiers
--------------------------------------------------------
-
-.. automodule:: sklearn.utils.multiclass
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   utils.multiclass.type_of_target
-   utils.multiclass.is_multilabel
-   utils.multiclass.unique_labels
-
-Utilities for optimal mathematical operations
----------------------------------------------
-
-.. automodule:: sklearn.utils.extmath
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   utils.extmath.safe_sparse_dot
-   utils.extmath.randomized_range_finder
-   utils.extmath.randomized_svd
-   utils.extmath.fast_logdet
-   utils.extmath.density
-   utils.extmath.weighted_mode
-
-Utilities to work with sparse matrices and arrays
--------------------------------------------------
-
-.. automodule:: sklearn.utils.sparsefuncs
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   utils.sparsefuncs.incr_mean_variance_axis
-   utils.sparsefuncs.inplace_column_scale
-   utils.sparsefuncs.inplace_row_scale
-   utils.sparsefuncs.inplace_swap_row
-   utils.sparsefuncs.inplace_swap_column
-   utils.sparsefuncs.mean_variance_axis
-   utils.sparsefuncs.inplace_csr_column_scale
-
-.. automodule:: sklearn.utils.sparsefuncs_fast
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   utils.sparsefuncs_fast.inplace_csr_row_normalize_l1
-   utils.sparsefuncs_fast.inplace_csr_row_normalize_l2
-
-Utilities to work with graphs
------------------------------
-
-.. automodule:: sklearn.utils.graph
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   utils.graph.single_source_shortest_path_length
-
-Utilities for random sampling
------------------------------
-
-.. automodule:: sklearn.utils.random
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   utils.random.sample_without_replacement
-
-
-Utilities to operate on arrays
-------------------------------
-
-.. automodule:: sklearn.utils.arrayfuncs
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   utils.arrayfuncs.min_pos
-
-Metadata routing
-----------------
-
-.. automodule:: sklearn.utils.metadata_routing
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   utils.metadata_routing.get_routing_for_object
-   utils.metadata_routing.process_routing
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   utils.metadata_routing.MetadataRouter
-   utils.metadata_routing.MetadataRequest
-   utils.metadata_routing.MethodMapping
-
-Scikit-learn object discovery
------------------------------
-
-.. automodule:: sklearn.utils.discovery
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   utils.discovery.all_estimators
-   utils.discovery.all_displays
-   utils.discovery.all_functions
-
-Scikit-learn compatibility checker
-----------------------------------
-
-.. automodule:: sklearn.utils.estimator_checks
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   utils.estimator_checks.check_estimator
-   utils.estimator_checks.parametrize_with_checks
-
-Utilities for parallel computing
---------------------------------
-
-.. automodule:: sklearn.utils.parallel
-   :no-members:
-   :no-inherited-members:
-
-.. currentmodule:: sklearn
-
-.. autosummary::
-   :toctree: generated/
-   :template: function.rst
-
-   utils.parallel.delayed
-   utils.parallel_backend
-   utils.register_parallel_backend
-
-.. autosummary::
-   :toctree: generated/
-   :template: class.rst
-
-   utils.parallel.Parallel
-
-
-Recently deprecated
-===================
diff --git a/doc/modules/classification_threshold.rst b/doc/modules/classification_threshold.rst
new file mode 100644
index 0000000000000..236c0736f7d23
--- /dev/null
+++ b/doc/modules/classification_threshold.rst
@@ -0,0 +1,157 @@
+.. currentmodule:: sklearn.model_selection
+
+.. _TunedThresholdClassifierCV:
+
+==================================================
+Tuning the decision threshold for class prediction
+==================================================
+
+Classification is best divided into two parts:
+
+* the statistical problem of learning a model to predict, ideally, class probabilities;
+* the decision problem to take concrete action based on those probability predictions.
+
+Let's take a straightforward example related to weather forecasting: the first point is
+related to answering "what is the chance that it will rain tomorrow?" while the second
+point is related to answering "should I take an umbrella tomorrow?".
+
+When it comes to the scikit-learn API, the first point is addressed providing scores
+using :term:`predict_proba` or :term:`decision_function`. The former returns conditional
+probability estimates :math:`P(y|X)` for each class, while the latter returns a decision
+score for each class.
+
+The decision corresponding to the labels are obtained with :term:`predict`. In binary
+classification, a decision rule or action is then defined by thresholding the scores,
+leading to the prediction of a single class label for each sample. For binary
+classification in scikit-learn, class labels predictions are obtained by hard-coded
+cut-off rules: a positive class is predicted when the conditional probability
+:math:`P(y|X)` is greater than 0.5 (obtained with :term:`predict_proba`) or if the
+decision score is greater than 0 (obtained with :term:`decision_function`).
+
+Here, we show an example that illustrates the relation between conditional
+probability estimates :math:`P(y|X)` and class labels::
+
+    >>> from sklearn.datasets import make_classification
+    >>> from sklearn.tree import DecisionTreeClassifier
+    >>> X, y = make_classification(random_state=0)
+    >>> classifier = DecisionTreeClassifier(max_depth=2, random_state=0).fit(X, y)
+    >>> classifier.predict_proba(X[:4])
+    array([[0.94     , 0.06     ],
+           [0.94     , 0.06     ],
+           [0.0416..., 0.9583...],
+           [0.0416..., 0.9583...]])
+    >>> classifier.predict(X[:4])
+    array([0, 0, 1, 1])
+
+While these hard-coded rules might at first seem reasonable as default behavior, they
+are most certainly not ideal for most use cases. Let's illustrate with an example.
+
+Consider a scenario where a predictive model is being deployed to assist
+physicians in detecting tumors. In this setting, physicians will most likely be
+interested in identifying all patients with cancer and not missing anyone with cancer so
+that they can provide them with the right treatment. In other words, physicians
+prioritize achieving a high recall rate. This emphasis on recall comes, of course, with
+the trade-off of potentially more false-positive predictions, reducing the precision of
+the model. That is a risk physicians are willing to take because the cost of a missed
+cancer is much higher than the cost of further diagnostic tests. Consequently, when it
+comes to deciding whether to classify a patient as having cancer or not, it may be more
+beneficial to classify them as positive for cancer when the conditional probability
+estimate is much lower than 0.5.
+
+Post-tuning the decision threshold
+==================================
+
+One solution to address the problem stated in the introduction is to tune the decision
+threshold of the classifier once the model has been trained. The
+:class:`~sklearn.model_selection.TunedThresholdClassifierCV` tunes this threshold using
+an internal cross-validation. The optimum threshold is chosen to maximize a given
+metric.
+
+The following image illustrates the tuning of the decision threshold for a gradient
+boosting classifier. While the vanilla and tuned classifiers provide the same
+:term:`predict_proba` outputs and thus the same Receiver Operating Characteristic (ROC)
+and Precision-Recall curves, the class label predictions differ because of the tuned
+decision threshold. The vanilla classifier predicts the class of interest for a
+conditional probability greater than 0.5 while the tuned classifier predicts the class
+of interest for a very low probability (around 0.02). This decision threshold optimizes
+a utility metric defined by the business (in this case an insurance company).
+
+.. figure:: ../auto_examples/model_selection/images/sphx_glr_plot_cost_sensitive_learning_002.png
+   :target: ../auto_examples/model_selection/plot_cost_sensitive_learning.html
+   :align: center
+
+Options to tune the decision threshold
+--------------------------------------
+
+The decision threshold can be tuned through different strategies controlled by the
+parameter `scoring`.
+
+One way to tune the threshold is by maximizing a pre-defined scikit-learn metric. These
+metrics can be found by calling the function :func:`~sklearn.metrics.get_scorer_names`.
+By default, the balanced accuracy is the metric used but be aware that one should choose
+a meaningful metric for their use case.
+
+.. note::
+
+    It is important to notice that these metrics come with default parameters, notably
+    the label of the class of interest (i.e. `pos_label`). Thus, if this label is not
+    the right one for your application, you need to define a scorer and pass the right
+    `pos_label` (and additional parameters) using the
+    :func:`~sklearn.metrics.make_scorer`. Refer to :ref:`scoring` to get
+    information to define your own scoring function. For instance, we show how to pass
+    the information to the scorer that the label of interest is `0` when maximizing the
+    :func:`~sklearn.metrics.f1_score`::
+
+        >>> from sklearn.linear_model import LogisticRegression
+        >>> from sklearn.model_selection import TunedThresholdClassifierCV
+        >>> from sklearn.metrics import make_scorer, f1_score
+        >>> X, y = make_classification(
+        ...   n_samples=1_000, weights=[0.1, 0.9], random_state=0)
+        >>> pos_label = 0
+        >>> scorer = make_scorer(f1_score, pos_label=pos_label)
+        >>> base_model = LogisticRegression()
+        >>> model = TunedThresholdClassifierCV(base_model, scoring=scorer)
+        >>> scorer(model.fit(X, y), X, y)
+        0.88...
+        >>> # compare it with the internal score found by cross-validation
+        >>> model.best_score_
+        0.86...
+
+Important notes regarding the internal cross-validation
+-------------------------------------------------------
+
+By default :class:`~sklearn.model_selection.TunedThresholdClassifierCV` uses a 5-fold
+stratified cross-validation to tune the decision threshold. The parameter `cv` allows to
+control the cross-validation strategy. It is possible to bypass cross-validation by
+setting `cv="prefit"` and providing a fitted classifier. In this case, the decision
+threshold is tuned on the data provided to the `fit` method.
+
+However, you should be extremely careful when using this option. You should never use
+the same data for training the classifier and tuning the decision threshold due to the
+risk of overfitting. Refer to the following example section for more details (cf.
+:ref:`TunedThresholdClassifierCV_no_cv`). If you have limited resources, consider using
+a float number for `cv` to limit to an internal single train-test split.
+
+The option `cv="prefit"` should only be used when the provided classifier was already
+trained, and you just want to find the best decision threshold using a new validation
+set.
+
+.. _FixedThresholdClassifier:
+
+Manually setting the decision threshold
+---------------------------------------
+
+The previous sections discussed strategies to find an optimal decision threshold. It is
+also possible to manually set the decision threshold using the class
+:class:`~sklearn.model_selection.FixedThresholdClassifier`. In case that you don't want
+to refit the model when calling `fit`, you can set the parameter `prefit=True`.
+
+Examples
+--------
+
+- See the example entitled
+  :ref:`sphx_glr_auto_examples_model_selection_plot_tuned_decision_threshold.py`,
+  to get insights on the post-tuning of the decision threshold.
+- See the example entitled
+  :ref:`sphx_glr_auto_examples_model_selection_plot_cost_sensitive_learning.py`,
+  to learn about cost-sensitive learning and decision threshold tuning.
diff --git a/doc/modules/clustering.rst b/doc/modules/clustering.rst
index 1d9fa51b6c834..b72b8f5ed0312 100644
--- a/doc/modules/clustering.rst
+++ b/doc/modules/clustering.rst
@@ -241,13 +241,13 @@ K-means can be used for vector quantization. This is achieved using the
 performing vector quantization on an image refer to
 :ref:`sphx_glr_auto_examples_cluster_plot_color_quantization.py`.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_cluster_plot_cluster_iris.py`: Example usage of
-   :class:`KMeans` using the iris dataset
+* :ref:`sphx_glr_auto_examples_cluster_plot_cluster_iris.py`: Example usage of
+  :class:`KMeans` using the iris dataset
 
- * :ref:`sphx_glr_auto_examples_text_plot_document_clustering.py`: Document clustering
-   using :class:`KMeans` and :class:`MiniBatchKMeans` based on sparse data
+* :ref:`sphx_glr_auto_examples_text_plot_document_clustering.py`: Document clustering
+  using :class:`KMeans` and :class:`MiniBatchKMeans` based on sparse data
 
 Low-level parallelism
 ---------------------
@@ -257,24 +257,20 @@ chunks of data (256 samples) are processed in parallel, which in addition
 yields a low memory footprint. For more details on how to control the number of
 threads, please refer to our :ref:`parallelism` notes.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_cluster_plot_kmeans_assumptions.py`: Demonstrating
-    when k-means performs intuitively and when it does not
-  * :ref:`sphx_glr_auto_examples_cluster_plot_kmeans_digits.py`: Clustering
-    handwritten digits
+* :ref:`sphx_glr_auto_examples_cluster_plot_kmeans_assumptions.py`: Demonstrating when
+  k-means performs intuitively and when it does not
+* :ref:`sphx_glr_auto_examples_cluster_plot_kmeans_digits.py`: Clustering handwritten digits
 
+.. dropdown:: References
 
-|details-start|
-**References**
-|details-split|
+  * `"k-means++: The advantages of careful seeding"
+    <http://ilpubs.stanford.edu:8090/778/1/2006-13.pdf>`_
+    Arthur, David, and Sergei Vassilvitskii,
+    *Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete
+    algorithms*, Society for Industrial and Applied Mathematics (2007)
 
-* `"k-means++: The advantages of careful seeding"
-  <http://ilpubs.stanford.edu:8090/778/1/2006-13.pdf>`_ Arthur, David, and
-  Sergei Vassilvitskii, *Proceedings of the eighteenth annual ACM-SIAM symposium
-  on Discrete algorithms*, Society for Industrial and Applied Mathematics (2007)
-
-|details-end|
 
 .. _mini_batch_kmeans:
 
@@ -310,24 +306,22 @@ small, as shown in the example and cited reference.
    :scale: 100
 
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_cluster_plot_mini_batch_kmeans.py`: Comparison of
-   :class:`KMeans` and :class:`MiniBatchKMeans`
+* :ref:`sphx_glr_auto_examples_cluster_plot_mini_batch_kmeans.py`: Comparison of
+  :class:`KMeans` and :class:`MiniBatchKMeans`
 
- * :ref:`sphx_glr_auto_examples_text_plot_document_clustering.py`: Document clustering
-   using :class:`KMeans` and :class:`MiniBatchKMeans` based on sparse data
+* :ref:`sphx_glr_auto_examples_text_plot_document_clustering.py`: Document clustering
+  using :class:`KMeans` and :class:`MiniBatchKMeans` based on sparse data
 
-|details-start|
-**References**
-|details-split|
+* :ref:`sphx_glr_auto_examples_cluster_plot_dict_face_patches.py`
 
-* `"Web Scale K-Means clustering"
-  <https://www.eecs.tufts.edu/~dsculley/papers/fastkmeans.pdf>`_
-  D. Sculley, *Proceedings of the 19th international conference on World
-  wide web* (2010)
+.. dropdown:: References
 
-|details-end|
+  * `"Web Scale K-Means clustering"
+    <https://www.eecs.tufts.edu/~dsculley/papers/fastkmeans.pdf>`_
+    D. Sculley, *Proceedings of the 19th international conference on World
+    wide web* (2010)
 
 .. _affinity_propagation:
 
@@ -364,55 +358,50 @@ convergence. Further, the memory complexity is of the order
 sparse similarity matrix is used. This makes Affinity Propagation most
 appropriate for small to medium sized datasets.
 
-|details-start|
-**Algorithm description**
-|details-split|
-
-The messages sent between points belong to one of two categories. The first is
-the responsibility :math:`r(i, k)`, which is the accumulated evidence that
-sample :math:`k` should be the exemplar for sample :math:`i`. The second is the
-availability :math:`a(i, k)` which is the accumulated evidence that sample
-:math:`i` should choose sample :math:`k` to be its exemplar, and considers the
-values for all other samples that :math:`k` should be an exemplar. In this way,
-exemplars are chosen by samples if they are (1) similar enough to many samples
-and (2) chosen by many samples to be representative of themselves.
+.. dropdown:: Algorithm description
 
-More formally, the responsibility of a sample :math:`k` to be the exemplar of
-sample :math:`i` is given by:
+  The messages sent between points belong to one of two categories. The first is
+  the responsibility :math:`r(i, k)`, which is the accumulated evidence that
+  sample :math:`k` should be the exemplar for sample :math:`i`. The second is the
+  availability :math:`a(i, k)` which is the accumulated evidence that sample
+  :math:`i` should choose sample :math:`k` to be its exemplar, and considers the
+  values for all other samples that :math:`k` should be an exemplar. In this way,
+  exemplars are chosen by samples if they are (1) similar enough to many samples
+  and (2) chosen by many samples to be representative of themselves.
 
-.. math::
+  More formally, the responsibility of a sample :math:`k` to be the exemplar of
+  sample :math:`i` is given by:
 
-    r(i, k) \leftarrow s(i, k) - max [ a(i, k') + s(i, k') \forall k' \neq k ]
+  .. math::
 
-Where :math:`s(i, k)` is the similarity between samples :math:`i` and :math:`k`.
-The availability of sample :math:`k` to be the exemplar of sample :math:`i` is
-given by:
-
-.. math::
+      r(i, k) \leftarrow s(i, k) - max [ a(i, k') + s(i, k') \forall k' \neq k ]
 
-    a(i, k) \leftarrow min [0, r(k, k) + \sum_{i'~s.t.~i' \notin \{i, k\}}{r(i',
-    k)}]
+  Where :math:`s(i, k)` is the similarity between samples :math:`i` and :math:`k`.
+  The availability of sample :math:`k` to be the exemplar of sample :math:`i` is
+  given by:
 
-To begin with, all values for :math:`r` and :math:`a` are set to zero, and the
-calculation of each iterates until convergence. As discussed above, in order to
-avoid numerical oscillations when updating the messages, the damping factor
-:math:`\lambda` is introduced to iteration process:
+  .. math::
 
-.. math:: r_{t+1}(i, k) = \lambda\cdot r_{t}(i, k) + (1-\lambda)\cdot r_{t+1}(i, k)
-.. math:: a_{t+1}(i, k) = \lambda\cdot a_{t}(i, k) + (1-\lambda)\cdot a_{t+1}(i, k)
+      a(i, k) \leftarrow min [0, r(k, k) + \sum_{i'~s.t.~i' \notin \{i, k\}}{r(i',
+      k)}]
 
-where :math:`t` indicates the iteration times.
+  To begin with, all values for :math:`r` and :math:`a` are set to zero, and the
+  calculation of each iterates until convergence. As discussed above, in order to
+  avoid numerical oscillations when updating the messages, the damping factor
+  :math:`\lambda` is introduced to iteration process:
 
-|details-end|
+  .. math:: r_{t+1}(i, k) = \lambda\cdot r_{t}(i, k) + (1-\lambda)\cdot r_{t+1}(i, k)
+  .. math:: a_{t+1}(i, k) = \lambda\cdot a_{t}(i, k) + (1-\lambda)\cdot a_{t+1}(i, k)
 
+  where :math:`t` indicates the iteration times.
 
-.. topic:: Examples:
 
-  * :ref:`sphx_glr_auto_examples_cluster_plot_affinity_propagation.py`: Affinity
-    Propagation on a synthetic 2D datasets with 3 classes.
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_applications_plot_stock_market.py` Affinity
-    Propagation on Financial time series to find groups of companies
+* :ref:`sphx_glr_auto_examples_cluster_plot_affinity_propagation.py`: Affinity
+  Propagation on a synthetic 2D datasets with 3 classes
+* :ref:`sphx_glr_auto_examples_applications_plot_stock_market.py` Affinity Propagation
+  on financial time series to find groups of companies
 
 
 .. _mean_shift:
@@ -425,43 +414,40 @@ for centroids to be the mean of the points within a given region. These
 candidates are then filtered in a post-processing stage to eliminate
 near-duplicates to form the final set of centroids.
 
-|details-start|
-**Mathematical details**
-|details-split|
+.. dropdown:: Mathematical details
 
-The position of centroid candidates is iteratively adjusted using a technique
-called hill climbing, which finds local maxima of the estimated probability
-density. Given a candidate centroid :math:`x` for iteration :math:`t`, the
-candidate is updated according to the following equation:
+  The position of centroid candidates is iteratively adjusted using a technique
+  called hill climbing, which finds local maxima of the estimated probability
+  density. Given a candidate centroid :math:`x` for iteration :math:`t`, the
+  candidate is updated according to the following equation:
 
-.. math::
+  .. math::
 
-    x^{t+1} = x^t + m(x^t)
+      x^{t+1} = x^t + m(x^t)
 
-Where :math:`m` is the *mean shift* vector that is computed for each centroid
-that points towards a region of the maximum increase in the density of points.
-To compute :math:`m` we define :math:`N(x)` as the neighborhood of samples
-within a given distance around :math:`x`. Then :math:`m` is computed using the
-following equation, effectively updating a centroid to be the mean of the
-samples within its neighborhood:
+  Where :math:`m` is the *mean shift* vector that is computed for each centroid
+  that points towards a region of the maximum increase in the density of points.
+  To compute :math:`m` we define :math:`N(x)` as the neighborhood of samples
+  within a given distance around :math:`x`. Then :math:`m` is computed using the
+  following equation, effectively updating a centroid to be the mean of the
+  samples within its neighborhood:
 
-.. math::
+  .. math::
 
-    m(x) = \frac{1}{|N(x)|} \sum_{x_j \in N(x)}x_j - x
+      m(x) = \frac{1}{|N(x)|} \sum_{x_j \in N(x)}x_j - x
 
-In general, the equation for :math:`m` depends on a kernel used for density
-estimation. The generic formula is:
+  In general, the equation for :math:`m` depends on a kernel used for density
+  estimation. The generic formula is:
 
-.. math::
+  .. math::
 
-    m(x) = \frac{\sum_{x_j \in N(x)}K(x_j - x)x_j}{\sum_{x_j \in N(x)}K(x_j -
-    x)} - x
+      m(x) = \frac{\sum_{x_j \in N(x)}K(x_j - x)x_j}{\sum_{x_j \in N(x)}K(x_j -
+      x)} - x
 
-In our implementation, :math:`K(x)` is equal to 1 if :math:`x` is small enough
-and is equal to 0 otherwise. Effectively :math:`K(y - x)` indicates whether
-:math:`y` is in the neighborhood of :math:`x`.
+  In our implementation, :math:`K(x)` is equal to 1 if :math:`x` is small enough
+  and is equal to 0 otherwise. Effectively :math:`K(y - x)` indicates whether
+  :math:`y` is in the neighborhood of :math:`x`.
 
-|details-end|
 
 The algorithm automatically sets the number of clusters, instead of relying on a
 parameter ``bandwidth``, which dictates the size of the region to search through.
@@ -483,21 +469,17 @@ given sample.
    :scale: 50
 
 
-.. topic:: Examples:
-
-  * :ref:`sphx_glr_auto_examples_cluster_plot_mean_shift.py`: Mean Shift
-    clustering on a synthetic 2D datasets with 3 classes.
+.. rubric:: Examples
 
+* :ref:`sphx_glr_auto_examples_cluster_plot_mean_shift.py`: Mean Shift clustering
+  on a synthetic 2D datasets with 3 classes.
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
-* :doi:`"Mean shift: A robust approach toward feature space analysis"
-  <10.1109/34.1000236>` D. Comaniciu and P. Meer, *IEEE Transactions on Pattern
-  Analysis and Machine Intelligence* (2002)
+  * :doi:`"Mean shift: A robust approach toward feature space analysis"
+    <10.1109/34.1000236>` D. Comaniciu and P. Meer, *IEEE Transactions on Pattern
+    Analysis and Machine Intelligence* (2002)
 
-|details-end|
 
 .. _spectral_clustering:
 
@@ -547,13 +529,13 @@ computed using a function of a gradient of the image.
 
     See the examples for such an application.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_cluster_plot_segmentation_toy.py`: Segmenting
-    objects from a noisy background using spectral clustering.
+* :ref:`sphx_glr_auto_examples_cluster_plot_segmentation_toy.py`: Segmenting objects
+  from a noisy background using spectral clustering.
+* :ref:`sphx_glr_auto_examples_cluster_plot_coin_segmentation.py`: Spectral clustering
+  to split the image of coins in regions.
 
-  * :ref:`sphx_glr_auto_examples_cluster_plot_coin_segmentation.py`: Spectral
-    clustering to split the image of coins in regions.
 
 .. |coin_kmeans| image:: ../auto_examples/cluster/images/sphx_glr_plot_coin_segmentation_001.png
   :target: ../auto_examples/cluster/plot_coin_segmentation.html
@@ -588,18 +570,15 @@ below.
 |coin_kmeans|                          |coin_discretize|                  |coin_cluster_qr|
 ================================  ================================  ================================
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
-* `"Multiclass spectral clustering"
-  <https://people.eecs.berkeley.edu/~jordan/courses/281B-spring04/readings/yu-shi.pdf>`_
-  Stella X. Yu, Jianbo Shi, 2003
+  * `"Multiclass spectral clustering"
+    <https://people.eecs.berkeley.edu/~jordan/courses/281B-spring04/readings/yu-shi.pdf>`_
+    Stella X. Yu, Jianbo Shi, 2003
 
-* :doi:`"Simple, direct, and efficient multi-way spectral clustering"<10.1093/imaiai/iay008>`
-  Anil Damle, Victor Minden, Lexing Ying, 2019
+  * :doi:`"Simple, direct, and efficient multi-way spectral clustering"<10.1093/imaiai/iay008>`
+    Anil Damle, Victor Minden, Lexing Ying, 2019
 
-|details-end|
 
 .. _spectral_clustering_graph:
 
@@ -615,28 +594,25 @@ graph, and SpectralClustering is initialized with `affinity='precomputed'`::
     ...                         assign_labels='discretize')
     >>> sc.fit_predict(adjacency_matrix)  # doctest: +SKIP
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
-* :doi:`"A Tutorial on Spectral Clustering" <10.1007/s11222-007-9033-z>` Ulrike
-  von Luxburg, 2007
+  * :doi:`"A Tutorial on Spectral Clustering" <10.1007/s11222-007-9033-z>` Ulrike
+    von Luxburg, 2007
 
-* :doi:`"Normalized cuts and image segmentation" <10.1109/34.868688>` Jianbo
-  Shi, Jitendra Malik, 2000
+  * :doi:`"Normalized cuts and image segmentation" <10.1109/34.868688>` Jianbo
+    Shi, Jitendra Malik, 2000
 
-* `"A Random Walks View of Spectral Segmentation"
-  <https://citeseerx.ist.psu.edu/doc_view/pid/84a86a69315e994cfd1e0c7debb86d62d7bd1f44>`_
-  Marina Meila, Jianbo Shi, 2001
+  * `"A Random Walks View of Spectral Segmentation"
+    <https://citeseerx.ist.psu.edu/doc_view/pid/84a86a69315e994cfd1e0c7debb86d62d7bd1f44>`_
+    Marina Meila, Jianbo Shi, 2001
 
-* `"On Spectral Clustering: Analysis and an algorithm"
-  <https://citeseerx.ist.psu.edu/doc_view/pid/796c5d6336fc52aa84db575fb821c78918b65f58>`_
-  Andrew Y. Ng, Michael I. Jordan, Yair Weiss, 2001
+  * `"On Spectral Clustering: Analysis and an algorithm"
+    <https://citeseerx.ist.psu.edu/doc_view/pid/796c5d6336fc52aa84db575fb821c78918b65f58>`_
+    Andrew Y. Ng, Michael I. Jordan, Yair Weiss, 2001
 
-* :arxiv:`"Preconditioned Spectral Clustering for Stochastic Block Partition
-  Streaming Graph Challenge" <1708.07481>` David Zhuzhunashvili, Andrew Knyazev
+  * :arxiv:`"Preconditioned Spectral Clustering for Stochastic Block Partition
+    Streaming Graph Challenge" <1708.07481>` David Zhuzhunashvili, Andrew Knyazev
 
-|details-end|
 
 .. _hierarchical_clustering:
 
@@ -697,10 +673,13 @@ while not robust to noisy data, can be computed very efficiently and can
 therefore be useful to provide hierarchical clustering of larger datasets.
 Single linkage can also perform well on non-globular data.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_cluster_plot_digits_linkage.py`: exploration of
-    the different linkage strategies in a real dataset.
+* :ref:`sphx_glr_auto_examples_cluster_plot_digits_linkage.py`: exploration of the
+  different linkage strategies in a real dataset.
+
+  * :ref:`sphx_glr_auto_examples_cluster_plot_linkage_comparison.py`: exploration of
+    the different linkage strategies in toy datasets.
 
 
 Visualization of cluster hierarchy
@@ -714,6 +693,10 @@ of the data, though more so in the case of small sample sizes.
     :target: ../auto_examples/cluster/plot_agglomerative_dendrogram.html
     :scale: 42
 
+.. rubric:: Examples
+
+* :ref:`sphx_glr_auto_examples_cluster_plot_agglomerative_dendrogram.py`
+
 
 Adding connectivity constraints
 -------------------------------
@@ -781,20 +764,20 @@ enable only merging of neighboring pixels on an image, as in the
     :target: ../auto_examples/cluster/plot_agglomerative_clustering.html
     :scale: 38
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_cluster_plot_coin_ward_segmentation.py`: Ward
-    clustering to split the image of coins in regions.
+* :ref:`sphx_glr_auto_examples_cluster_plot_coin_ward_segmentation.py`: Ward
+  clustering to split the image of coins in regions.
 
-  * :ref:`sphx_glr_auto_examples_cluster_plot_ward_structured_vs_unstructured.py`: Example
-    of Ward algorithm on a swiss-roll, comparison of structured approaches
-    versus unstructured approaches.
+* :ref:`sphx_glr_auto_examples_cluster_plot_ward_structured_vs_unstructured.py`: Example
+  of Ward algorithm on a swiss-roll, comparison of structured approaches
+  versus unstructured approaches.
 
-  * :ref:`sphx_glr_auto_examples_cluster_plot_feature_agglomeration_vs_univariate_selection.py`: Example
-    of dimensionality reduction with feature agglomeration based on Ward
-    hierarchical clustering.
+* :ref:`sphx_glr_auto_examples_cluster_plot_feature_agglomeration_vs_univariate_selection.py`: Example
+  of dimensionality reduction with feature agglomeration based on Ward
+  hierarchical clustering.
 
-  * :ref:`sphx_glr_auto_examples_cluster_plot_agglomerative_clustering.py`
+* :ref:`sphx_glr_auto_examples_cluster_plot_agglomerative_clustering.py`
 
 
 Varying the metric
@@ -828,9 +811,9 @@ each class.
     :target: ../auto_examples/cluster/plot_agglomerative_clustering_metrics.html
     :scale: 32
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_cluster_plot_agglomerative_clustering_metrics.py`
+* :ref:`sphx_glr_auto_examples_cluster_plot_agglomerative_clustering_metrics.py`
 
 
 Bisecting K-Means
@@ -874,26 +857,23 @@ Difference between Bisecting K-Means and regular K-Means can be seen on example
 While the regular K-Means algorithm tends to create non-related clusters,
 clusters from Bisecting K-Means are well ordered and create quite a visible hierarchy.
 
-|details-start|
-**References**
-|details-split|
-
-* `"A Comparison of Document Clustering Techniques"
-  <http://www.philippe-fournier-viger.com/spmf/bisectingkmeans.pdf>`_ Michael
-  Steinbach, George Karypis and Vipin Kumar, Department of Computer Science and
-  Egineering, University of Minnesota (June 2000)
-* `"Performance Analysis of K-Means and Bisecting K-Means Algorithms in Weblog
-  Data"
-  <https://ijeter.everscience.org/Manuscripts/Volume-4/Issue-8/Vol-4-issue-8-M-23.pdf>`_
-  K.Abirami and Dr.P.Mayilvahanan, International Journal of Emerging
-  Technologies in Engineering Research (IJETER) Volume 4, Issue 8, (August 2016)
-* `"Bisecting K-means Algorithm Based on K-valued Self-determining and
-  Clustering Center Optimization"
-  <http://www.jcomputers.us/vol13/jcp1306-01.pdf>`_ Jian Di, Xinyue Gou School
-  of Control and Computer Engineering,North China Electric Power University,
-  Baoding, Hebei, China (August 2017)
-
-|details-end|
+.. dropdown:: References
+
+  * `"A Comparison of Document Clustering Techniques"
+    <http://www.philippe-fournier-viger.com/spmf/bisectingkmeans.pdf>`_ Michael
+    Steinbach, George Karypis and Vipin Kumar, Department of Computer Science and
+    Egineering, University of Minnesota (June 2000)
+  * `"Performance Analysis of K-Means and Bisecting K-Means Algorithms in Weblog
+    Data"
+    <https://ijeter.everscience.org/Manuscripts/Volume-4/Issue-8/Vol-4-issue-8-M-23.pdf>`_
+    K.Abirami and Dr.P.Mayilvahanan, International Journal of Emerging
+    Technologies in Engineering Research (IJETER) Volume 4, Issue 8, (August 2016)
+  * `"Bisecting K-means Algorithm Based on K-valued Self-determining and
+    Clustering Center Optimization"
+    <http://www.jcomputers.us/vol13/jcp1306-01.pdf>`_ Jian Di, Xinyue Gou School
+    of Control and Computer Engineering,North China Electric Power University,
+    Baoding, Hebei, China (August 2017)
+
 
 .. _dbscan:
 
@@ -947,79 +927,68 @@ samples that are still part of a cluster. Moreover, the outliers are indicated
 by black points below.
 
 .. |dbscan_results| image:: ../auto_examples/cluster/images/sphx_glr_plot_dbscan_002.png
-        :target: ../auto_examples/cluster/plot_dbscan.html
-        :scale: 50
+    :target: ../auto_examples/cluster/plot_dbscan.html
+    :scale: 50
 
 .. centered:: |dbscan_results|
 
-.. topic:: Examples:
-
-    * :ref:`sphx_glr_auto_examples_cluster_plot_dbscan.py`
-
-|details-start|
-**Implementation**
-|details-split|
+.. rubric:: Examples
 
-The DBSCAN algorithm is deterministic, always generating the same clusters when
-given the same data in the same order.  However, the results can differ when
-data is provided in a different order. First, even though the core samples will
-always be assigned to the same clusters, the labels of those clusters will
-depend on the order in which those samples are encountered in the data. Second
-and more importantly, the clusters to which non-core samples are assigned can
-differ depending on the data order.  This would happen when a non-core sample
-has a distance lower than ``eps`` to two core samples in different clusters. By
-the triangular inequality, those two core samples must be more distant than
-``eps`` from each other, or they would be in the same cluster. The non-core
-sample is assigned to whichever cluster is generated first in a pass through the
-data, and so the results will depend on the data ordering.
+* :ref:`sphx_glr_auto_examples_cluster_plot_dbscan.py`
 
-The current implementation uses ball trees and kd-trees to determine the
-neighborhood of points, which avoids calculating the full distance matrix (as
-was done in scikit-learn versions before 0.14). The possibility to use custom
-metrics is retained; for details, see :class:`NearestNeighbors`.
+.. dropdown:: Implementation
 
-|details-end|
+  The DBSCAN algorithm is deterministic, always generating the same clusters when
+  given the same data in the same order.  However, the results can differ when
+  data is provided in a different order. First, even though the core samples will
+  always be assigned to the same clusters, the labels of those clusters will
+  depend on the order in which those samples are encountered in the data. Second
+  and more importantly, the clusters to which non-core samples are assigned can
+  differ depending on the data order.  This would happen when a non-core sample
+  has a distance lower than ``eps`` to two core samples in different clusters. By
+  the triangular inequality, those two core samples must be more distant than
+  ``eps`` from each other, or they would be in the same cluster. The non-core
+  sample is assigned to whichever cluster is generated first in a pass through the
+  data, and so the results will depend on the data ordering.
 
-|details-start|
-**Memory consumption for large sample sizes**
-|details-split|
+  The current implementation uses ball trees and kd-trees to determine the
+  neighborhood of points, which avoids calculating the full distance matrix (as
+  was done in scikit-learn versions before 0.14). The possibility to use custom
+  metrics is retained; for details, see :class:`NearestNeighbors`.
 
-This implementation is by default not memory efficient because it constructs a
-full pairwise similarity matrix in the case where kd-trees or ball-trees cannot
-be used (e.g., with sparse matrices). This matrix will consume :math:`n^2`
-floats. A couple of mechanisms for getting around this are:
+.. dropdown:: Memory consumption for large sample sizes
 
-- Use :ref:`OPTICS <optics>` clustering in conjunction with the `extract_dbscan`
-  method. OPTICS clustering also calculates the full pairwise matrix, but only
-  keeps one row in memory at a time (memory complexity n).
+  This implementation is by default not memory efficient because it constructs a
+  full pairwise similarity matrix in the case where kd-trees or ball-trees cannot
+  be used (e.g., with sparse matrices). This matrix will consume :math:`n^2`
+  floats. A couple of mechanisms for getting around this are:
 
-- A sparse radius neighborhood graph (where missing entries are presumed to be
-  out of eps) can be precomputed in a memory-efficient way and dbscan can be run
-  over this with ``metric='precomputed'``.  See
-  :meth:`sklearn.neighbors.NearestNeighbors.radius_neighbors_graph`.
+  - Use :ref:`OPTICS <optics>` clustering in conjunction with the `extract_dbscan`
+    method. OPTICS clustering also calculates the full pairwise matrix, but only
+    keeps one row in memory at a time (memory complexity n).
 
-- The dataset can be compressed, either by removing exact duplicates if these
-  occur in your data, or by using BIRCH. Then you only have a relatively small
-  number of representatives for a large number of points. You can then provide a
-  ``sample_weight`` when fitting DBSCAN.
+  - A sparse radius neighborhood graph (where missing entries are presumed to be
+    out of eps) can be precomputed in a memory-efficient way and dbscan can be run
+    over this with ``metric='precomputed'``.  See
+    :meth:`sklearn.neighbors.NearestNeighbors.radius_neighbors_graph`.
 
-|details-end|
+  - The dataset can be compressed, either by removing exact duplicates if these
+    occur in your data, or by using BIRCH. Then you only have a relatively small
+    number of representatives for a large number of points. You can then provide a
+    ``sample_weight`` when fitting DBSCAN.
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
 * `A Density-Based Algorithm for Discovering Clusters in Large Spatial
   Databases with Noise <https://www.aaai.org/Papers/KDD/1996/KDD96-037.pdf>`_
   Ester, M., H. P. Kriegel, J. Sander, and X. Xu, In Proceedings of the 2nd
   International Conference on Knowledge Discovery and Data Mining, Portland, OR,
-  AAAI Press, pp. 226–231. 1996
+  AAAI Press, pp. 226-231. 1996
 
 * :doi:`DBSCAN revisited, revisited: why and how you should (still) use DBSCAN.
   <10.1145/3068335>` Schubert, E., Sander, J., Ester, M., Kriegel, H. P., & Xu,
   X. (2017). In ACM Transactions on Database Systems (TODS), 42(3), 19.
 
-|details-end|
 
 .. _hdbscan:
 
@@ -1039,10 +1008,10 @@ scales by building an alternative representation of the clustering problem.
   This implementation is adapted from the original implementation of HDBSCAN,
   `scikit-learn-contrib/hdbscan <https://github.com/scikit-learn-contrib/hdbscan>`_ based on [LJ2017]_.
 
-.. topic:: Examples:
+.. rubric:: Examples
+
+* :ref:`sphx_glr_auto_examples_cluster_plot_hdbscan.py`
 
-    * :ref:`sphx_glr_auto_examples_cluster_plot_hdbscan.py`
-  
 Mutual Reachability Graph
 -------------------------
 
@@ -1102,11 +1071,11 @@ it relies solely on the choice of `min_samples`, which tends to be a more robust
 hyperparameter.
 
 .. |hdbscan_ground_truth| image:: ../auto_examples/cluster/images/sphx_glr_plot_hdbscan_005.png
-        :target: ../auto_examples/cluster/plot_hdbscan.html
-        :scale: 75
+    :target: ../auto_examples/cluster/plot_hdbscan.html
+    :scale: 75
 .. |hdbscan_results| image:: ../auto_examples/cluster/images/sphx_glr_plot_hdbscan_007.png
-        :target: ../auto_examples/cluster/plot_hdbscan.html
-        :scale: 75
+    :target: ../auto_examples/cluster/plot_hdbscan.html
+    :scale: 75
 
 .. centered:: |hdbscan_ground_truth|
 .. centered:: |hdbscan_results|
@@ -1117,19 +1086,19 @@ than `minimum_cluster_size` many samples are considered noise. In practice, one
 can set `minimum_cluster_size = min_samples` to couple the parameters and
 simplify the hyperparameter space.
 
-.. topic:: References:
+.. rubric:: References
 
- .. [CM2013] Campello, R.J.G.B., Moulavi, D., Sander, J. (2013). Density-Based
-   Clustering Based on Hierarchical Density Estimates. In: Pei, J., Tseng, V.S.,
-   Cao, L., Motoda, H., Xu, G. (eds) Advances in Knowledge Discovery and Data
-   Mining. PAKDD 2013. Lecture Notes in Computer Science(), vol 7819. Springer,
-   Berlin, Heidelberg. :doi:`Density-Based Clustering Based on Hierarchical
-   Density Estimates <10.1007/978-3-642-37456-2_14>`
+.. [CM2013] Campello, R.J.G.B., Moulavi, D., Sander, J. (2013). Density-Based
+  Clustering Based on Hierarchical Density Estimates. In: Pei, J., Tseng, V.S.,
+  Cao, L., Motoda, H., Xu, G. (eds) Advances in Knowledge Discovery and Data
+  Mining. PAKDD 2013. Lecture Notes in Computer Science(), vol 7819. Springer,
+  Berlin, Heidelberg. :doi:`Density-Based Clustering Based on Hierarchical
+  Density Estimates <10.1007/978-3-642-37456-2_14>`
 
- .. [LJ2017] L. McInnes and J. Healy, (2017). Accelerated Hierarchical Density
-   Based Clustering. In: IEEE International Conference on Data Mining Workshops
-   (ICDMW), 2017, pp. 33-42. :doi:`Accelerated Hierarchical Density Based
-   Clustering <10.1109/ICDMW.2017.12>`
+.. [LJ2017] L. McInnes and J. Healy, (2017). Accelerated Hierarchical Density
+  Based Clustering. In: IEEE International Conference on Data Mining Workshops
+  (ICDMW), 2017, pp. 33-42. :doi:`Accelerated Hierarchical Density Based
+  Clustering <10.1109/ICDMW.2017.12>`
 
 .. _optics:
 
@@ -1175,58 +1144,48 @@ the linear segment clusters of the reachability plot. Note that the blue and
 red clusters are adjacent in the reachability plot, and can be hierarchically
 represented as children of a larger parent cluster.
 
-.. topic:: Examples:
-
-  * :ref:`sphx_glr_auto_examples_cluster_plot_optics.py`
+.. rubric:: Examples
 
+* :ref:`sphx_glr_auto_examples_cluster_plot_optics.py`
 
-|details-start|
-**Comparison with DBSCAN**
-|details-split|
 
-The results from OPTICS ``cluster_optics_dbscan`` method and DBSCAN are very
-similar, but not always identical; specifically, labeling of periphery and noise
-points. This is in part because the first samples of each dense area processed
-by OPTICS have a large reachability value while being close to other points in
-their area, and will thus sometimes be marked as noise rather than periphery.
-This affects adjacent points when they are considered as candidates for being
-marked as either periphery or noise.
+.. dropdown:: Comparison with DBSCAN
 
-Note that for any single value of ``eps``, DBSCAN will tend to have a shorter
-run time than OPTICS; however, for repeated runs at varying ``eps`` values, a
-single run of OPTICS may require less cumulative runtime than DBSCAN. It is also
-important to note that OPTICS' output is close to DBSCAN's only if ``eps`` and
-``max_eps`` are close.
+  The results from OPTICS ``cluster_optics_dbscan`` method and DBSCAN are very
+  similar, but not always identical; specifically, labeling of periphery and noise
+  points. This is in part because the first samples of each dense area processed
+  by OPTICS have a large reachability value while being close to other points in
+  their area, and will thus sometimes be marked as noise rather than periphery.
+  This affects adjacent points when they are considered as candidates for being
+  marked as either periphery or noise.
 
-|details-end|
+  Note that for any single value of ``eps``, DBSCAN will tend to have a shorter
+  run time than OPTICS; however, for repeated runs at varying ``eps`` values, a
+  single run of OPTICS may require less cumulative runtime than DBSCAN. It is also
+  important to note that OPTICS' output is close to DBSCAN's only if ``eps`` and
+  ``max_eps`` are close.
 
-|details-start|
-**Computational Complexity**
-|details-split|
+.. dropdown:: Computational Complexity
 
-Spatial indexing trees are used to avoid calculating the full distance matrix,
-and allow for efficient memory usage on large sets of samples. Different
-distance metrics can be supplied via the ``metric`` keyword.
+  Spatial indexing trees are used to avoid calculating the full distance matrix,
+  and allow for efficient memory usage on large sets of samples. Different
+  distance metrics can be supplied via the ``metric`` keyword.
 
-For large datasets, similar (but not identical) results can be obtained via
-:class:`HDBSCAN`. The HDBSCAN implementation is multithreaded, and has better
-algorithmic runtime complexity than OPTICS, at the cost of worse memory scaling.
-For extremely large datasets that exhaust system memory using HDBSCAN, OPTICS
-will maintain :math:`n` (as opposed to :math:`n^2`) memory scaling; however,
-tuning of the ``max_eps`` parameter will likely need to be used to give a
-solution in a reasonable amount of wall time.
+  For large datasets, similar (but not identical) results can be obtained via
+  :class:`HDBSCAN`. The HDBSCAN implementation is multithreaded, and has better
+  algorithmic runtime complexity than OPTICS, at the cost of worse memory scaling.
+  For extremely large datasets that exhaust system memory using HDBSCAN, OPTICS
+  will maintain :math:`n` (as opposed to :math:`n^2`) memory scaling; however,
+  tuning of the ``max_eps`` parameter will likely need to be used to give a
+  solution in a reasonable amount of wall time.
 
-|details-end|
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
-* "OPTICS: ordering points to identify the clustering structure." Ankerst,
-  Mihael, Markus M. Breunig, Hans-Peter Kriegel, and Jörg Sander. In ACM Sigmod
-  Record, vol. 28, no. 2, pp. 49-60. ACM, 1999.
+  * "OPTICS: ordering points to identify the clustering structure." Ankerst,
+    Mihael, Markus M. Breunig, Hans-Peter Kriegel, and Jörg Sander. In ACM Sigmod
+    Record, vol. 28, no. 2, pp. 49-60. ACM, 1999.
 
-|details-end|
 
 .. _birch:
 
@@ -1262,75 +1221,60 @@ If ``n_clusters`` is set to None, the subclusters from the leaves are directly
 read off, otherwise a global clustering step labels these subclusters into global
 clusters (labels) and the samples are mapped to the global label of the nearest subcluster.
 
-|details-start|
-**Algorithm description**
-|details-split|
-
-- A new sample is inserted into the root of the CF Tree which is a CF Node. It
-  is then merged with the subcluster of the root, that has the smallest radius
-  after merging, constrained by the threshold and branching factor conditions.
-  If the subcluster has any child node, then this is done repeatedly till it
-  reaches a leaf. After finding the nearest subcluster in the leaf, the
-  properties of this subcluster and the parent subclusters are recursively
-  updated.
-
-- If the radius of the subcluster obtained by merging the new sample and the
-  nearest subcluster is greater than the square of the threshold and if the
-  number of subclusters is greater than the branching factor, then a space is
-  temporarily allocated to this new sample. The two farthest subclusters are
-  taken and the subclusters are divided into two groups on the basis of the
-  distance between these subclusters.
-
-- If this split node has a parent subcluster and there is room for a new
-  subcluster, then the parent is split into two. If there is no room, then this
-  node is again split into two and the process is continued recursively, till it
-  reaches the root.
-
-|details-end|
-
-|details-start|
-**BIRCH or MiniBatchKMeans?**
-|details-split|
-
-- BIRCH does not scale very well to high dimensional data. As a rule of thumb if
-  ``n_features`` is greater than twenty, it is generally better to use MiniBatchKMeans.
-- If the number of instances of data needs to be reduced, or if one wants a
-  large number of subclusters either as a preprocessing step or otherwise,
-  BIRCH is more useful than MiniBatchKMeans.
-
-.. image:: ../auto_examples/cluster/images/sphx_glr_plot_birch_vs_minibatchkmeans_001.png
+.. dropdown:: Algorithm description
+
+  - A new sample is inserted into the root of the CF Tree which is a CF Node. It
+    is then merged with the subcluster of the root, that has the smallest radius
+    after merging, constrained by the threshold and branching factor conditions.
+    If the subcluster has any child node, then this is done repeatedly till it
+    reaches a leaf. After finding the nearest subcluster in the leaf, the
+    properties of this subcluster and the parent subclusters are recursively
+    updated.
+
+  - If the radius of the subcluster obtained by merging the new sample and the
+    nearest subcluster is greater than the square of the threshold and if the
+    number of subclusters is greater than the branching factor, then a space is
+    temporarily allocated to this new sample. The two farthest subclusters are
+    taken and the subclusters are divided into two groups on the basis of the
+    distance between these subclusters.
+
+  - If this split node has a parent subcluster and there is room for a new
+    subcluster, then the parent is split into two. If there is no room, then this
+    node is again split into two and the process is continued recursively, till it
+    reaches the root.
+
+.. dropdown:: BIRCH or MiniBatchKMeans?
+
+  - BIRCH does not scale very well to high dimensional data. As a rule of thumb if
+    ``n_features`` is greater than twenty, it is generally better to use MiniBatchKMeans.
+  - If the number of instances of data needs to be reduced, or if one wants a
+    large number of subclusters either as a preprocessing step or otherwise,
+    BIRCH is more useful than MiniBatchKMeans.
+
+  .. image:: ../auto_examples/cluster/images/sphx_glr_plot_birch_vs_minibatchkmeans_001.png
     :target: ../auto_examples/cluster/plot_birch_vs_minibatchkmeans.html
 
-|details-end|
-
-|details-start|
-**How to use partial_fit?**
-|details-split|
+.. dropdown:: How to use partial_fit?
 
-To avoid the computation of global clustering, for every call of ``partial_fit``
-the user is advised
+  To avoid the computation of global clustering, for every call of ``partial_fit``
+  the user is advised:
 
-1. To set ``n_clusters=None`` initially
-2. Train all data by multiple calls to partial_fit.
-3. Set ``n_clusters`` to a required value using
-   ``brc.set_params(n_clusters=n_clusters)``.
-4. Call ``partial_fit`` finally with no arguments, i.e. ``brc.partial_fit()``
-   which performs the global clustering.
+  1. To set ``n_clusters=None`` initially.
+  2. Train all data by multiple calls to partial_fit.
+  3. Set ``n_clusters`` to a required value using
+     ``brc.set_params(n_clusters=n_clusters)``.
+  4. Call ``partial_fit`` finally with no arguments, i.e. ``brc.partial_fit()``
+     which performs the global clustering.
 
-|details-end|
+.. dropdown:: References
 
-|details-start|
-**References**
-|details-split|
+  * Tian Zhang, Raghu Ramakrishnan, Maron Livny BIRCH: An efficient data
+    clustering method for large databases.
+    https://www.cs.sfu.ca/CourseCentral/459/han/papers/zhang96.pdf
 
-* Tian Zhang, Raghu Ramakrishnan, Maron Livny BIRCH: An efficient data
-  clustering method for large databases.
-  https://www.cs.sfu.ca/CourseCentral/459/han/papers/zhang96.pdf
+  * Roberto Perdisci JBirch - Java implementation of BIRCH clustering algorithm
+    https://code.google.com/archive/p/jbirch
 
-* Roberto Perdisci JBirch - Java implementation of BIRCH clustering algorithm
-  https://code.google.com/archive/p/jbirch
-
-|details-end|
 
 
 .. _clustering_evaluation:
@@ -1426,7 +1370,7 @@ will not necessarily be close to zero.::
   - **Bounded range**: Lower values indicate different labelings, similar
     clusterings have a high (adjusted or unadjusted) Rand index, 1.0 is the
     perfect match score. The score range is [0, 1] for the unadjusted Rand index
-    and [-1, 1] for the adjusted Rand index.
+    and [-0.5, 1] for the adjusted Rand index.
 
   - **No assumption is made on the cluster structure**: The (adjusted or
     unadjusted) Rand index can be used to compare all kinds of clustering
@@ -1453,64 +1397,55 @@ will not necessarily be close to zero.::
     ground truth clustering resulting in a high proportion of pair labels that
     agree, which leads subsequently to a high score.
 
-.. topic:: Examples:
-
-  * :ref:`sphx_glr_auto_examples_cluster_plot_adjusted_for_chance_measures.py`:
-    Analysis of the impact of the dataset size on the value of clustering measures
-    for random assignments.
+.. rubric:: Examples
 
+* :ref:`sphx_glr_auto_examples_cluster_plot_adjusted_for_chance_measures.py`:
+  Analysis of the impact of the dataset size on the value of
+  clustering measures for random assignments.
 
-|details-start|
-**Mathematical formulation**
-|details-split|
+.. dropdown:: Mathematical formulation
 
-If C is a ground truth class assignment and K the clustering, let us define
-:math:`a` and :math:`b` as:
+  If C is a ground truth class assignment and K the clustering, let us define
+  :math:`a` and :math:`b` as:
 
-- :math:`a`, the number of pairs of elements that are in the same set in C and
-  in the same set in K
+  - :math:`a`, the number of pairs of elements that are in the same set in C and
+    in the same set in K
 
-- :math:`b`, the number of pairs of elements that are in different sets in C and
-  in different sets in K
+  - :math:`b`, the number of pairs of elements that are in different sets in C and
+    in different sets in K
 
-The unadjusted Rand index is then given by:
+  The unadjusted Rand index is then given by:
 
-.. math:: \text{RI} = \frac{a + b}{C_2^{n_{samples}}}
+  .. math:: \text{RI} = \frac{a + b}{C_2^{n_{samples}}}
 
-where :math:`C_2^{n_{samples}}` is the total number of possible pairs in the
-dataset. It does not matter if the calculation is performed on ordered pairs or
-unordered pairs as long as the calculation is performed consistently.
+  where :math:`C_2^{n_{samples}}` is the total number of possible pairs in the
+  dataset. It does not matter if the calculation is performed on ordered pairs or
+  unordered pairs as long as the calculation is performed consistently.
 
-However, the Rand index does not guarantee that random label assignments will
-get a value close to zero (esp. if the number of clusters is in the same order
-of magnitude as the number of samples).
+  However, the Rand index does not guarantee that random label assignments will
+  get a value close to zero (esp. if the number of clusters is in the same order
+  of magnitude as the number of samples).
 
-To counter this effect we can discount the expected RI :math:`E[\text{RI}]` of
-random labelings by defining the adjusted Rand index as follows:
+  To counter this effect we can discount the expected RI :math:`E[\text{RI}]` of
+  random labelings by defining the adjusted Rand index as follows:
 
-.. math:: \text{ARI} = \frac{\text{RI} - E[\text{RI}]}{\max(\text{RI}) - E[\text{RI}]}
+  .. math:: \text{ARI} = \frac{\text{RI} - E[\text{RI}]}{\max(\text{RI}) - E[\text{RI}]}
 
-|details-end|
+.. dropdown:: References
 
-|details-start|
-**References**
-|details-split|
+  * `Comparing Partitions
+    <https://link.springer.com/article/10.1007%2FBF01908075>`_ L. Hubert and P.
+    Arabie, Journal of Classification 1985
 
-* `Comparing Partitions
-  <https://link.springer.com/article/10.1007%2FBF01908075>`_ L. Hubert and P.
-  Arabie, Journal of Classification 1985
+  * `Properties of the Hubert-Arabie adjusted Rand index
+    <https://psycnet.apa.org/record/2004-17801-007>`_ D. Steinley, Psychological
+    Methods 2004
 
-* `Properties of the Hubert-Arabie adjusted Rand index
-  <https://psycnet.apa.org/record/2004-17801-007>`_ D. Steinley, Psychological
-  Methods 2004
+  * `Wikipedia entry for the Rand index
+    <https://en.wikipedia.org/wiki/Rand_index#Adjusted_Rand_index>`_
 
-* `Wikipedia entry for the Rand index
-  <https://en.wikipedia.org/wiki/Rand_index>`_
+  * :doi:`Minimum adjusted Rand index for two clusterings of a given size, 2022, J. E. Chacón and A. I. Rastrojo <10.1007/s11634-022-00491-w>`
 
-* `Wikipedia entry for the adjusted Rand index
-  <https://en.wikipedia.org/wiki/Rand_index#Adjusted_Rand_index>`_
-
-|details-end|
 
 .. _mutual_info_score:
 
@@ -1591,80 +1526,77 @@ Bad (e.g. independent labelings) have non-positive scores::
 
   - NMI and MI are not adjusted against chance.
 
-.. topic:: Examples:
-
-  * :ref:`sphx_glr_auto_examples_cluster_plot_adjusted_for_chance_measures.py`: Analysis
-    of the impact of the dataset size on the value of clustering measures for
-    random assignments. This example also includes the Adjusted Rand Index.
+.. rubric:: Examples
 
+* :ref:`sphx_glr_auto_examples_cluster_plot_adjusted_for_chance_measures.py`: Analysis
+  of the impact of the dataset size on the value of clustering measures for random
+  assignments. This example also includes the Adjusted Rand Index.
 
-|details-start|
-**Mathematical formulation**
-|details-split|
+.. dropdown:: Mathematical formulation
 
-Assume two label assignments (of the same N objects), :math:`U` and :math:`V`.
-Their entropy is the amount of uncertainty for a partition set, defined by:
+  Assume two label assignments (of the same N objects), :math:`U` and :math:`V`.
+  Their entropy is the amount of uncertainty for a partition set, defined by:
 
-.. math:: H(U) = - \sum_{i=1}^{|U|}P(i)\log(P(i))
+  .. math:: H(U) = - \sum_{i=1}^{|U|}P(i)\log(P(i))
 
-where :math:`P(i) = |U_i| / N` is the probability that an object picked at
-random from :math:`U` falls into class :math:`U_i`. Likewise for :math:`V`:
+  where :math:`P(i) = |U_i| / N` is the probability that an object picked at
+  random from :math:`U` falls into class :math:`U_i`. Likewise for :math:`V`:
 
-.. math:: H(V) = - \sum_{j=1}^{|V|}P'(j)\log(P'(j))
+  .. math:: H(V) = - \sum_{j=1}^{|V|}P'(j)\log(P'(j))
 
-With :math:`P'(j) = |V_j| / N`. The mutual information (MI) between :math:`U`
-and :math:`V` is calculated by:
+  With :math:`P'(j) = |V_j| / N`. The mutual information (MI) between :math:`U`
+  and :math:`V` is calculated by:
 
-.. math:: \text{MI}(U, V) = \sum_{i=1}^{|U|}\sum_{j=1}^{|V|}P(i, j)\log\left(\frac{P(i,j)}{P(i)P'(j)}\right)
+  .. math:: \text{MI}(U, V) = \sum_{i=1}^{|U|}\sum_{j=1}^{|V|}P(i, j)\log\left(\frac{P(i,j)}{P(i)P'(j)}\right)
 
-where :math:`P(i, j) = |U_i \cap V_j| / N` is the probability that an object
-picked at random falls into both classes :math:`U_i` and :math:`V_j`.
+  where :math:`P(i, j) = |U_i \cap V_j| / N` is the probability that an object
+  picked at random falls into both classes :math:`U_i` and :math:`V_j`.
 
-It also can be expressed in set cardinality formulation:
+  It also can be expressed in set cardinality formulation:
 
-.. math:: \text{MI}(U, V) = \sum_{i=1}^{|U|} \sum_{j=1}^{|V|} \frac{|U_i \cap V_j|}{N}\log\left(\frac{N|U_i \cap V_j|}{|U_i||V_j|}\right)
+  .. math:: \text{MI}(U, V) = \sum_{i=1}^{|U|} \sum_{j=1}^{|V|} \frac{|U_i \cap V_j|}{N}\log\left(\frac{N|U_i \cap V_j|}{|U_i||V_j|}\right)
 
-The normalized mutual information is defined as
+  The normalized mutual information is defined as
 
-.. math:: \text{NMI}(U, V) = \frac{\text{MI}(U, V)}{\text{mean}(H(U), H(V))}
+  .. math:: \text{NMI}(U, V) = \frac{\text{MI}(U, V)}{\text{mean}(H(U), H(V))}
 
-This value of the mutual information and also the normalized variant is not
-adjusted for chance and will tend to increase as the number of different labels
-(clusters) increases, regardless of the actual amount of "mutual information"
-between the label assignments.
+  This value of the mutual information and also the normalized variant is not
+  adjusted for chance and will tend to increase as the number of different labels
+  (clusters) increases, regardless of the actual amount of "mutual information"
+  between the label assignments.
 
-The expected value for the mutual information can be calculated using the
-following equation [VEB2009]_. In this equation, :math:`a_i = |U_i|` (the number
-of elements in :math:`U_i`) and :math:`b_j = |V_j|` (the number of elements in
-:math:`V_j`).
+  The expected value for the mutual information can be calculated using the
+  following equation [VEB2009]_. In this equation, :math:`a_i = |U_i|` (the number
+  of elements in :math:`U_i`) and :math:`b_j = |V_j|` (the number of elements in
+  :math:`V_j`).
 
-.. math:: E[\text{MI}(U,V)]=\sum_{i=1}^{|U|} \sum_{j=1}^{|V|} \sum_{n_{ij}=(a_i+b_j-N)^+
-  }^{\min(a_i, b_j)} \frac{n_{ij}}{N}\log \left( \frac{ N.n_{ij}}{a_i b_j}\right)
-  \frac{a_i!b_j!(N-a_i)!(N-b_j)!}{N!n_{ij}!(a_i-n_{ij})!(b_j-n_{ij})!
-  (N-a_i-b_j+n_{ij})!}
+  .. math:: E[\text{MI}(U,V)]=\sum_{i=1}^{|U|} \sum_{j=1}^{|V|} \sum_{n_{ij}=(a_i+b_j-N)^+
+    }^{\min(a_i, b_j)} \frac{n_{ij}}{N}\log \left( \frac{ N.n_{ij}}{a_i b_j}\right)
+    \frac{a_i!b_j!(N-a_i)!(N-b_j)!}{N!n_{ij}!(a_i-n_{ij})!(b_j-n_{ij})!
+    (N-a_i-b_j+n_{ij})!}
 
-Using the expected value, the adjusted mutual information can then be calculated
-using a similar form to that of the adjusted Rand index:
+  Using the expected value, the adjusted mutual information can then be calculated
+  using a similar form to that of the adjusted Rand index:
 
-.. math:: \text{AMI} = \frac{\text{MI} - E[\text{MI}]}{\text{mean}(H(U), H(V)) - E[\text{MI}]}
+  .. math:: \text{AMI} = \frac{\text{MI} - E[\text{MI}]}{\text{mean}(H(U), H(V)) - E[\text{MI}]}
 
-For normalized mutual information and adjusted mutual information, the
-normalizing value is typically some *generalized* mean of the entropies of each
-clustering. Various generalized means exist, and no firm rules exist for
-preferring one over the others.  The decision is largely a field-by-field basis;
-for instance, in community detection, the arithmetic mean is most common. Each
-normalizing method provides "qualitatively similar behaviours" [YAT2016]_. In
-our implementation, this is controlled by the ``average_method`` parameter.
+  For normalized mutual information and adjusted mutual information, the
+  normalizing value is typically some *generalized* mean of the entropies of each
+  clustering. Various generalized means exist, and no firm rules exist for
+  preferring one over the others.  The decision is largely a field-by-field basis;
+  for instance, in community detection, the arithmetic mean is most common. Each
+  normalizing method provides "qualitatively similar behaviours" [YAT2016]_. In
+  our implementation, this is controlled by the ``average_method`` parameter.
 
-Vinh et al. (2010) named variants of NMI and AMI by their averaging method
-[VEB2010]_. Their 'sqrt' and 'sum' averages are the geometric and arithmetic
-means; we use these more broadly common names.
+  Vinh et al. (2010) named variants of NMI and AMI by their averaging method
+  [VEB2010]_. Their 'sqrt' and 'sum' averages are the geometric and arithmetic
+  means; we use these more broadly common names.
 
-.. topic:: References:
+  .. rubric:: References
 
-  * Strehl, Alexander, and Joydeep Ghosh (2002). "Cluster ensembles – a
+  * Strehl, Alexander, and Joydeep Ghosh (2002). "Cluster ensembles - a
     knowledge reuse framework for combining multiple partitions". Journal of
-    Machine Learning Research 3: 583–617. `doi:10.1162/153244303321897735
+    Machine Learning Research 3: 583-617. `doi:10.1162/153244303321897735
     <http://strehl.com/download/strehl-jmlr02.pdf>`_.
 
   * `Wikipedia entry for the (normalized) Mutual Information
@@ -1689,7 +1621,6 @@ means; we use these more broadly common names.
     Reports 6: 30750. `doi:10.1038/srep30750
     <https://www.nature.com/articles/srep30750>`_.
 
-|details-end|
 
 .. _homogeneity_completeness:
 
@@ -1807,57 +1738,53 @@ homogeneous but not complete::
     almost never available in practice or requires manual assignment by human
     annotators (as in the supervised learning setting).
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_cluster_plot_adjusted_for_chance_measures.py`: Analysis
-    of the impact of the dataset size on the value of clustering measures for
-    random assignments.
+* :ref:`sphx_glr_auto_examples_cluster_plot_adjusted_for_chance_measures.py`: Analysis
+  of the impact of the dataset size on the value of clustering measures for
+  random assignments.
 
+.. dropdown:: Mathematical formulation
 
-|details-start|
-**Mathematical formulation**
-|details-split|
+  Homogeneity and completeness scores are formally given by:
 
-Homogeneity and completeness scores are formally given by:
+  .. math:: h = 1 - \frac{H(C|K)}{H(C)}
 
-.. math:: h = 1 - \frac{H(C|K)}{H(C)}
+  .. math:: c = 1 - \frac{H(K|C)}{H(K)}
 
-.. math:: c = 1 - \frac{H(K|C)}{H(K)}
+  where :math:`H(C|K)` is the **conditional entropy of the classes given the
+  cluster assignments** and is given by:
 
-where :math:`H(C|K)` is the **conditional entropy of the classes given the
-cluster assignments** and is given by:
+  .. math:: H(C|K) = - \sum_{c=1}^{|C|} \sum_{k=1}^{|K|} \frac{n_{c,k}}{n}
+            \cdot \log\left(\frac{n_{c,k}}{n_k}\right)
 
-.. math:: H(C|K) = - \sum_{c=1}^{|C|} \sum_{k=1}^{|K|} \frac{n_{c,k}}{n}
-          \cdot \log\left(\frac{n_{c,k}}{n_k}\right)
+  and :math:`H(C)` is the **entropy of the classes** and is given by:
 
-and :math:`H(C)` is the **entropy of the classes** and is given by:
+  .. math:: H(C) = - \sum_{c=1}^{|C|} \frac{n_c}{n} \cdot \log\left(\frac{n_c}{n}\right)
 
-.. math:: H(C) = - \sum_{c=1}^{|C|} \frac{n_c}{n} \cdot \log\left(\frac{n_c}{n}\right)
+  with :math:`n` the total number of samples, :math:`n_c` and :math:`n_k` the
+  number of samples respectively belonging to class :math:`c` and cluster
+  :math:`k`, and finally :math:`n_{c,k}` the number of samples from class
+  :math:`c` assigned to cluster :math:`k`.
 
-with :math:`n` the total number of samples, :math:`n_c` and :math:`n_k` the
-number of samples respectively belonging to class :math:`c` and cluster
-:math:`k`, and finally :math:`n_{c,k}` the number of samples from class
-:math:`c` assigned to cluster :math:`k`.
+  The **conditional entropy of clusters given class** :math:`H(K|C)` and the
+  **entropy of clusters** :math:`H(K)` are defined in a symmetric manner.
 
-The **conditional entropy of clusters given class** :math:`H(K|C)` and the
-**entropy of clusters** :math:`H(K)` are defined in a symmetric manner.
+  Rosenberg and Hirschberg further define **V-measure** as the **harmonic mean of
+  homogeneity and completeness**:
 
-Rosenberg and Hirschberg further define **V-measure** as the **harmonic mean of
-homogeneity and completeness**:
+  .. math:: v = 2 \cdot \frac{h \cdot c}{h + c}
 
-.. math:: v = 2 \cdot \frac{h \cdot c}{h + c}
+.. rubric:: References
 
-|details-end|
+* `V-Measure: A conditional entropy-based external cluster evaluation measure
+  <https://aclweb.org/anthology/D/D07/D07-1043.pdf>`_ Andrew Rosenberg and Julia
+  Hirschberg, 2007
 
-.. topic:: References:
+.. [B2011] `Identification and Characterization of Events in Social Media
+  <http://www.cs.columbia.edu/~hila/hila-thesis-distributed.pdf>`_, Hila
+  Becker, PhD Thesis.
 
- * `V-Measure: A conditional entropy-based external cluster evaluation measure
-   <https://aclweb.org/anthology/D/D07/D07-1043.pdf>`_ Andrew Rosenberg and Julia
-   Hirschberg, 2007
-
- .. [B2011] `Identification and Characterization of Events in Social Media
-   <http://www.cs.columbia.edu/~hila/hila-thesis-distributed.pdf>`_, Hila
-   Becker, PhD Thesis.
 
 .. _fowlkes_mallows_scores:
 
@@ -1934,19 +1861,15 @@ Bad (e.g. independent labelings) have zero scores::
     manual assignment by human annotators (as in the supervised learning
     setting).
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
-* E. B. Fowkles and C. L. Mallows, 1983. "A method for comparing two
-  hierarchical clusterings". Journal of the American Statistical
-  Association.
-  https://www.tandfonline.com/doi/abs/10.1080/01621459.1983.10478008
+  * E. B. Fowkles and C. L. Mallows, 1983. "A method for comparing two
+    hierarchical clusterings". Journal of the American Statistical Association.
+    https://www.tandfonline.com/doi/abs/10.1080/01621459.1983.10478008
 
-* `Wikipedia entry for the Fowlkes-Mallows Index
-  <https://en.wikipedia.org/wiki/Fowlkes-Mallows_index>`_
+  * `Wikipedia entry for the Fowlkes-Mallows Index
+    <https://en.wikipedia.org/wiki/Fowlkes-Mallows_index>`_
 
-|details-end|
 
 .. _silhouette_coefficient:
 
@@ -1990,7 +1913,6 @@ cluster analysis.
   >>> metrics.silhouette_score(X, labels, metric='euclidean')
   0.55...
 
-
 .. topic:: Advantages:
 
   - The score is bounded between -1 for incorrect clustering and +1 for highly
@@ -2005,23 +1927,18 @@ cluster analysis.
     other concepts of clusters, such as density based clusters like those
     obtained through DBSCAN.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_cluster_plot_kmeans_silhouette_analysis.py` : In
-    this example the silhouette analysis is used to choose an optimal value for
-    n_clusters.
+* :ref:`sphx_glr_auto_examples_cluster_plot_kmeans_silhouette_analysis.py` : In
+  this example the silhouette analysis is used to choose an optimal value for
+  n_clusters.
 
+.. dropdown:: References
 
-|details-start|
-**References**
-|details-split|
+  * Peter J. Rousseeuw (1987). :doi:`"Silhouettes: a Graphical Aid to the
+    Interpretation and Validation of Cluster Analysis"<10.1016/0377-0427(87)90125-7>`.
+    Computational and Applied Mathematics 20: 53-65.
 
-* Peter J. Rousseeuw (1987). :doi:`"Silhouettes: a Graphical Aid to the
-  Interpretation and Validation of Cluster
-  Analysis"<10.1016/0377-0427(87)90125-7>` . Computational and Applied
-  Mathematics 20: 53–65.
-
-|details-end|
 
 .. _calinski_harabasz_index:
 
@@ -2067,42 +1984,35 @@ cluster analysis:
     other concepts of clusters, such as density based clusters like those
     obtained through DBSCAN.
 
-|details-start|
-**Mathematical formulation**
-|details-split|
-
-For a set of data :math:`E` of size :math:`n_E` which has been clustered into
-:math:`k` clusters, the Calinski-Harabasz score :math:`s` is defined as the
-ratio of the between-clusters dispersion mean and the within-cluster
-dispersion:
+.. dropdown:: Mathematical formulation
 
-.. math::
-  s = \frac{\mathrm{tr}(B_k)}{\mathrm{tr}(W_k)} \times \frac{n_E - k}{k - 1}
+  For a set of data :math:`E` of size :math:`n_E` which has been clustered into
+  :math:`k` clusters, the Calinski-Harabasz score :math:`s` is defined as the
+  ratio of the between-clusters dispersion mean and the within-cluster
+  dispersion:
 
-where :math:`\mathrm{tr}(B_k)` is trace of the between group dispersion matrix
-and :math:`\mathrm{tr}(W_k)` is the trace of the within-cluster dispersion
-matrix defined by:
+  .. math::
+    s = \frac{\mathrm{tr}(B_k)}{\mathrm{tr}(W_k)} \times \frac{n_E - k}{k - 1}
 
-.. math:: W_k = \sum_{q=1}^k \sum_{x \in C_q} (x - c_q) (x - c_q)^T
+  where :math:`\mathrm{tr}(B_k)` is trace of the between group dispersion matrix
+  and :math:`\mathrm{tr}(W_k)` is the trace of the within-cluster dispersion
+  matrix defined by:
 
-.. math:: B_k = \sum_{q=1}^k n_q (c_q - c_E) (c_q - c_E)^T
+  .. math:: W_k = \sum_{q=1}^k \sum_{x \in C_q} (x - c_q) (x - c_q)^T
 
-with :math:`C_q` the set of points in cluster :math:`q`, :math:`c_q` the
-center of cluster :math:`q`, :math:`c_E` the center of :math:`E`, and
-:math:`n_q` the number of points in cluster :math:`q`.
+  .. math:: B_k = \sum_{q=1}^k n_q (c_q - c_E) (c_q - c_E)^T
 
-|details-end|
+  with :math:`C_q` the set of points in cluster :math:`q`, :math:`c_q` the
+  center of cluster :math:`q`, :math:`c_E` the center of :math:`E`, and
+  :math:`n_q` the number of points in cluster :math:`q`.
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
-* Caliński, T., & Harabasz, J. (1974). `"A Dendrite Method for Cluster Analysis"
-  <https://www.researchgate.net/publication/233096619_A_Dendrite_Method_for_Cluster_Analysis>`_.
-  :doi:`Communications in Statistics-theory and Methods 3: 1-27
-  <10.1080/03610927408827101>`.
+  * Caliński, T., & Harabasz, J. (1974). `"A Dendrite Method for Cluster Analysis"
+    <https://www.researchgate.net/publication/233096619_A_Dendrite_Method_for_Cluster_Analysis>`_.
+    :doi:`Communications in Statistics-theory and Methods 3: 1-27
+    <10.1080/03610927408827101>`.
 
-|details-end|
 
 .. _davies-bouldin_index:
 
@@ -2149,49 +2059,41 @@ cluster analysis as follows:
   - The usage of centroid distance limits the distance metric to Euclidean
     space.
 
+.. dropdown:: Mathematical formulation
 
-|details-start|
-**Mathematical formulation**
-|details-split|
+  The index is defined as the average similarity between each cluster :math:`C_i`
+  for :math:`i=1, ..., k` and its most similar one :math:`C_j`. In the context of
+  this index, similarity is defined as a measure :math:`R_{ij}` that trades off:
 
-The index is defined as the average similarity between each cluster :math:`C_i`
-for :math:`i=1, ..., k` and its most similar one :math:`C_j`. In the context of
-this index, similarity is defined as a measure :math:`R_{ij}` that trades off:
+  - :math:`s_i`, the average distance between each point of cluster :math:`i` and
+    the centroid of that cluster -- also know as cluster diameter.
+  - :math:`d_{ij}`, the distance between cluster centroids :math:`i` and
+    :math:`j`.
 
-- :math:`s_i`, the average distance between each point of cluster :math:`i` and
-  the centroid of that cluster -- also know as cluster diameter.
-- :math:`d_{ij}`, the distance between cluster centroids :math:`i` and
-  :math:`j`.
+  A simple choice to construct :math:`R_{ij}` so that it is nonnegative and
+  symmetric is:
 
-A simple choice to construct :math:`R_{ij}` so that it is nonnegative and
-symmetric is:
+  .. math::
+    R_{ij} = \frac{s_i + s_j}{d_{ij}}
 
-.. math::
-  R_{ij} = \frac{s_i + s_j}{d_{ij}}
+  Then the Davies-Bouldin index is defined as:
 
-Then the Davies-Bouldin index is defined as:
+  .. math::
+    DB = \frac{1}{k} \sum_{i=1}^k \max_{i \neq j} R_{ij}
 
-.. math::
-  DB = \frac{1}{k} \sum_{i=1}^k \max_{i \neq j} R_{ij}
+.. dropdown:: References
 
-|details-end|
+  * Davies, David L.; Bouldin, Donald W. (1979). :doi:`"A Cluster Separation
+    Measure" <10.1109/TPAMI.1979.4766909>` IEEE Transactions on Pattern Analysis
+    and Machine Intelligence. PAMI-1 (2): 224-227.
 
-|details-start|
-**References**
-|details-split|
+  * Halkidi, Maria; Batistakis, Yannis; Vazirgiannis, Michalis (2001). :doi:`"On
+    Clustering Validation Techniques" <10.1023/A:1012801612483>` Journal of
+    Intelligent Information Systems, 17(2-3), 107-145.
 
-* Davies, David L.; Bouldin, Donald W. (1979). :doi:`"A Cluster Separation
-  Measure" <10.1109/TPAMI.1979.4766909>` IEEE Transactions on Pattern Analysis
-  and Machine Intelligence. PAMI-1 (2): 224-227.
+  * `Wikipedia entry for Davies-Bouldin index
+    <https://en.wikipedia.org/wiki/Davies-Bouldin_index>`_.
 
-* Halkidi, Maria; Batistakis, Yannis; Vazirgiannis, Michalis (2001). :doi:`"On
-  Clustering Validation Techniques" <10.1023/A:1012801612483>` Journal of
-  Intelligent Information Systems, 17(2-3), 107-145.
-
-* `Wikipedia entry for Davies-Bouldin index
-  <https://en.wikipedia.org/wiki/Davies–Bouldin_index>`_.
-
-|details-end|
 
 .. _contingency_matrix:
 
@@ -2241,15 +2143,11 @@ of classes.
   - It doesn't give a single metric to use as an objective for clustering
     optimisation.
 
+.. dropdown:: References
 
-|details-start|
-**References**
-|details-split|
+  * `Wikipedia entry for contingency matrix
+    <https://en.wikipedia.org/wiki/Contingency_table>`_
 
-* `Wikipedia entry for contingency matrix
-  <https://en.wikipedia.org/wiki/Contingency_table>`_
-
-|details-end|
 
 .. _pair_confusion_matrix:
 
@@ -2327,11 +2225,7 @@ diagonal entries::
    array([[ 0,  0],
           [12,  0]])
 
-|details-start|
-**References**
-|details-split|
-
- * :doi:`"Comparing Partitions" <10.1007/BF01908075>` L. Hubert and P. Arabie,
-   Journal of Classification 1985
+.. dropdown:: References
 
-|details-end|
+  * :doi:`"Comparing Partitions" <10.1007/BF01908075>` L. Hubert and P. Arabie,
+    Journal of Classification 1985
diff --git a/doc/modules/compose.rst b/doc/modules/compose.rst
index 0047ec7d8a2f0..655ea551e0375 100644
--- a/doc/modules/compose.rst
+++ b/doc/modules/compose.rst
@@ -79,20 +79,16 @@ is an estimator object::
     >>> pipe
     Pipeline(steps=[('reduce_dim', PCA()), ('clf', SVC())])
 
-|details-start|
-**Shorthand version using :func:`make_pipeline`**
-|details-split|
+.. dropdown:: Shorthand version using :func:`make_pipeline`
 
-The utility function :func:`make_pipeline` is a shorthand
-for constructing pipelines;
-it takes a variable number of estimators and returns a pipeline,
-filling in the names automatically::
+  The utility function :func:`make_pipeline` is a shorthand
+  for constructing pipelines;
+  it takes a variable number of estimators and returns a pipeline,
+  filling in the names automatically::
 
-    >>> from sklearn.pipeline import make_pipeline
-    >>> make_pipeline(PCA(), SVC())
-    Pipeline(steps=[('pca', PCA()), ('svc', SVC())])
-
-|details-end|
+      >>> from sklearn.pipeline import make_pipeline
+      >>> make_pipeline(PCA(), SVC())
+      Pipeline(steps=[('pca', PCA()), ('svc', SVC())])
 
 Access pipeline steps
 .....................
@@ -108,27 +104,23 @@ permitted). This is convenient for performing only some of the transformations
     >>> pipe[-1:]
     Pipeline(steps=[('clf', SVC())])
 
-|details-start|
-**Accessing a step by name or position**
-|details-split|
-
-A specific step can also be accessed by index or name by indexing (with ``[idx]``) the
-pipeline::
+.. dropdown:: Accessing a step by name or position
 
-    >>> pipe.steps[0]
-    ('reduce_dim', PCA())
-    >>> pipe[0]
-    PCA()
-    >>> pipe['reduce_dim']
-    PCA()
+  A specific step can also be accessed by index or name by indexing (with ``[idx]``) the
+  pipeline::
 
-`Pipeline`'s `named_steps` attribute allows accessing steps by name with tab
-completion in interactive environments::
+      >>> pipe.steps[0]
+      ('reduce_dim', PCA())
+      >>> pipe[0]
+      PCA()
+      >>> pipe['reduce_dim']
+      PCA()
 
-    >>> pipe.named_steps.reduce_dim is pipe['reduce_dim']
-    True
+  `Pipeline`'s `named_steps` attribute allows accessing steps by name with tab
+  completion in interactive environments::
 
-|details-end|
+      >>> pipe.named_steps.reduce_dim is pipe['reduce_dim']
+      True
 
 Tracking feature names in a pipeline
 ....................................
@@ -149,17 +141,13 @@ pipeline slicing to get the feature names going into each step::
     >>> pipe[:-1].get_feature_names_out()
     array(['x2', 'x3'], ...)
 
-|details-start|
-**Customize feature names**
-|details-split|
-
-You can also provide custom feature names for the input data using
-``get_feature_names_out``::
+.. dropdown:: Customize feature names
 
-    >>> pipe[:-1].get_feature_names_out(iris.feature_names)
-    array(['petal length (cm)', 'petal width (cm)'], ...)
+  You can also provide custom feature names for the input data using
+  ``get_feature_names_out``::
 
-|details-end|
+      >>> pipe[:-1].get_feature_names_out(iris.feature_names)
+      array(['petal length (cm)', 'petal width (cm)'], ...)
 
 .. _pipeline_nested_parameters:
 
@@ -175,40 +163,37 @@ syntax::
     >>> pipe.set_params(clf__C=10)
     Pipeline(steps=[('reduce_dim', PCA()), ('clf', SVC(C=10))])
 
-|details-start|
-**When does it matter?**
-|details-split|
+.. dropdown:: When does it matter?
 
-This is particularly important for doing grid searches::
+  This is particularly important for doing grid searches::
 
-    >>> from sklearn.model_selection import GridSearchCV
-    >>> param_grid = dict(reduce_dim__n_components=[2, 5, 10],
-    ...                   clf__C=[0.1, 10, 100])
-    >>> grid_search = GridSearchCV(pipe, param_grid=param_grid)
+      >>> from sklearn.model_selection import GridSearchCV
+      >>> param_grid = dict(reduce_dim__n_components=[2, 5, 10],
+      ...                   clf__C=[0.1, 10, 100])
+      >>> grid_search = GridSearchCV(pipe, param_grid=param_grid)
 
-Individual steps may also be replaced as parameters, and non-final steps may be
-ignored by setting them to ``'passthrough'``::
+  Individual steps may also be replaced as parameters, and non-final steps may be
+  ignored by setting them to ``'passthrough'``::
 
-    >>> param_grid = dict(reduce_dim=['passthrough', PCA(5), PCA(10)],
-    ...                   clf=[SVC(), LogisticRegression()],
-    ...                   clf__C=[0.1, 10, 100])
-    >>> grid_search = GridSearchCV(pipe, param_grid=param_grid)
+      >>> param_grid = dict(reduce_dim=['passthrough', PCA(5), PCA(10)],
+      ...                   clf=[SVC(), LogisticRegression()],
+      ...                   clf__C=[0.1, 10, 100])
+      >>> grid_search = GridSearchCV(pipe, param_grid=param_grid)
 
-.. topic:: See Also:
+  .. seealso::
 
- * :ref:`composite_grid_search`
+    * :ref:`composite_grid_search`
 
-|details-end|
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_feature_selection_plot_feature_selection_pipeline.py`
- * :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_text_feature_extraction.py`
- * :ref:`sphx_glr_auto_examples_compose_plot_digits_pipe.py`
- * :ref:`sphx_glr_auto_examples_miscellaneous_plot_kernel_approximation.py`
- * :ref:`sphx_glr_auto_examples_svm_plot_svm_anova.py`
- * :ref:`sphx_glr_auto_examples_compose_plot_compare_reduction.py`
- * :ref:`sphx_glr_auto_examples_miscellaneous_plot_pipeline_display.py`
+* :ref:`sphx_glr_auto_examples_feature_selection_plot_feature_selection_pipeline.py`
+* :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_text_feature_extraction.py`
+* :ref:`sphx_glr_auto_examples_compose_plot_digits_pipe.py`
+* :ref:`sphx_glr_auto_examples_miscellaneous_plot_kernel_approximation.py`
+* :ref:`sphx_glr_auto_examples_svm_plot_svm_anova.py`
+* :ref:`sphx_glr_auto_examples_compose_plot_compare_reduction.py`
+* :ref:`sphx_glr_auto_examples_miscellaneous_plot_pipeline_display.py`
 
 
 .. _pipeline_cache:
@@ -245,53 +230,49 @@ object::
     >>> # Clear the cache directory when you don't need it anymore
     >>> rmtree(cachedir)
 
-|details-start|
-**Warning: Side effect of caching transformers**
-|details-split|
-
-Using a :class:`Pipeline` without cache enabled, it is possible to
-inspect the original instance such as::
-
-    >>> from sklearn.datasets import load_digits
-    >>> X_digits, y_digits = load_digits(return_X_y=True)
-    >>> pca1 = PCA()
-    >>> svm1 = SVC()
-    >>> pipe = Pipeline([('reduce_dim', pca1), ('clf', svm1)])
-    >>> pipe.fit(X_digits, y_digits)
-    Pipeline(steps=[('reduce_dim', PCA()), ('clf', SVC())])
-    >>> # The pca instance can be inspected directly
-    >>> print(pca1.components_)
-        [[-1.77484909e-19  ... 4.07058917e-18]]
-
-
-Enabling caching triggers a clone of the transformers before fitting.
-Therefore, the transformer instance given to the pipeline cannot be
-inspected directly.
-In following example, accessing the :class:`~sklearn.decomposition.PCA`
-instance ``pca2`` will raise an ``AttributeError`` since ``pca2`` will be an
-unfitted transformer.
-Instead, use the attribute ``named_steps`` to inspect estimators within
-the pipeline::
-
-    >>> cachedir = mkdtemp()
-    >>> pca2 = PCA()
-    >>> svm2 = SVC()
-    >>> cached_pipe = Pipeline([('reduce_dim', pca2), ('clf', svm2)],
-    ...                        memory=cachedir)
-    >>> cached_pipe.fit(X_digits, y_digits)
-    Pipeline(memory=...,
-             steps=[('reduce_dim', PCA()), ('clf', SVC())])
-    >>> print(cached_pipe.named_steps['reduce_dim'].components_)
-        [[-1.77484909e-19  ... 4.07058917e-18]]
-    >>> # Remove the cache directory
-    >>> rmtree(cachedir)
-
-
-|details-end|
-
-.. topic:: Examples:
-
- * :ref:`sphx_glr_auto_examples_compose_plot_compare_reduction.py`
+.. dropdown:: Side effect of caching transformers
+  :color: warning
+
+  Using a :class:`Pipeline` without cache enabled, it is possible to
+  inspect the original instance such as::
+
+      >>> from sklearn.datasets import load_digits
+      >>> X_digits, y_digits = load_digits(return_X_y=True)
+      >>> pca1 = PCA(n_components=10)
+      >>> svm1 = SVC()
+      >>> pipe = Pipeline([('reduce_dim', pca1), ('clf', svm1)])
+      >>> pipe.fit(X_digits, y_digits)
+      Pipeline(steps=[('reduce_dim', PCA(n_components=10)), ('clf', SVC())])
+      >>> # The pca instance can be inspected directly
+      >>> pca1.components_.shape
+      (10, 64)
+
+  Enabling caching triggers a clone of the transformers before fitting.
+  Therefore, the transformer instance given to the pipeline cannot be
+  inspected directly.
+  In following example, accessing the :class:`~sklearn.decomposition.PCA`
+  instance ``pca2`` will raise an ``AttributeError`` since ``pca2`` will be an
+  unfitted transformer.
+  Instead, use the attribute ``named_steps`` to inspect estimators within
+  the pipeline::
+
+      >>> cachedir = mkdtemp()
+      >>> pca2 = PCA(n_components=10)
+      >>> svm2 = SVC()
+      >>> cached_pipe = Pipeline([('reduce_dim', pca2), ('clf', svm2)],
+      ...                        memory=cachedir)
+      >>> cached_pipe.fit(X_digits, y_digits)
+      Pipeline(memory=...,
+               steps=[('reduce_dim', PCA(n_components=10)), ('clf', SVC())])
+      >>> cached_pipe.named_steps['reduce_dim'].components_.shape
+      (10, 64)
+      >>> # Remove the cache directory
+      >>> rmtree(cachedir)
+
+
+.. rubric:: Examples
+
+* :ref:`sphx_glr_auto_examples_compose_plot_compare_reduction.py`
 
 .. _transformed_target_regressor:
 
@@ -364,9 +345,9 @@ each other. However, it is possible to bypass this checking by setting
    pair of functions ``func`` and ``inverse_func``. However, setting both
    options will raise an error.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_compose_plot_transformed_target.py`
+* :ref:`sphx_glr_auto_examples_compose_plot_transformed_target.py`
 
 
 .. _feature_union:
@@ -428,9 +409,9 @@ and ignored by setting to ``'drop'``::
     FeatureUnion(transformer_list=[('linear_pca', PCA()),
                                    ('kernel_pca', 'drop')])
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_compose_plot_feature_union.py`
+* :ref:`sphx_glr_auto_examples_compose_plot_feature_union.py`
 
 
 .. _column_transformer:
@@ -623,7 +604,7 @@ As an alternative, the HTML can be written to a file using
    >>> with open('my_estimator.html', 'w') as f:  # doctest: +SKIP
    ...     f.write(estimator_html_repr(clf))
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_compose_plot_column_transformer.py`
- * :ref:`sphx_glr_auto_examples_compose_plot_column_transformer_mixed_types.py`
+* :ref:`sphx_glr_auto_examples_compose_plot_column_transformer.py`
+* :ref:`sphx_glr_auto_examples_compose_plot_column_transformer_mixed_types.py`
diff --git a/doc/modules/covariance.rst b/doc/modules/covariance.rst
index 50927f9a677f6..847e489c87333 100644
--- a/doc/modules/covariance.rst
+++ b/doc/modules/covariance.rst
@@ -40,11 +40,10 @@ on whether the data are centered, so one may want to use the
 same mean vector as the training set. If not, both should be centered
 by the user, and ``assume_centered=True`` should be used.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-   * See :ref:`sphx_glr_auto_examples_covariance_plot_covariance_estimation.py` for
-     an example on how to fit an :class:`EmpiricalCovariance` object
-     to data.
+* See :ref:`sphx_glr_auto_examples_covariance_plot_covariance_estimation.py` for
+  an example on how to fit an :class:`EmpiricalCovariance` object to data.
 
 
 .. _shrunk_covariance:
@@ -84,11 +83,10 @@ Tr}\hat{\Sigma}}{p}\rm Id`.
 Choosing the amount of shrinkage, :math:`\alpha` amounts to setting a
 bias/variance trade-off, and is discussed below.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-   * See :ref:`sphx_glr_auto_examples_covariance_plot_covariance_estimation.py` for
-     an example on how to fit a :class:`ShrunkCovariance` object
-     to data.
+* See :ref:`sphx_glr_auto_examples_covariance_plot_covariance_estimation.py` for
+  an example on how to fit a :class:`ShrunkCovariance` object to data.
 
 
 Ledoit-Wolf shrinkage
@@ -121,18 +119,18 @@ fitting a :class:`LedoitWolf` object to the same sample.
     Since the population covariance is already a multiple of the identity
     matrix, the Ledoit-Wolf solution is indeed a reasonable estimate.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-   * See :ref:`sphx_glr_auto_examples_covariance_plot_covariance_estimation.py` for
-     an example on how to fit a :class:`LedoitWolf` object to data and
-     for visualizing the performances of the Ledoit-Wolf estimator in
-     terms of likelihood.
+* See :ref:`sphx_glr_auto_examples_covariance_plot_covariance_estimation.py` for
+  an example on how to fit a :class:`LedoitWolf` object to data and
+  for visualizing the performances of the Ledoit-Wolf estimator in
+  terms of likelihood.
 
-.. topic:: References:
+.. rubric:: References
 
-    .. [1] O. Ledoit and M. Wolf, "A Well-Conditioned Estimator for Large-Dimensional
-           Covariance Matrices", Journal of Multivariate Analysis, Volume 88, Issue 2,
-           February 2004, pages 365-411.
+.. [1] O. Ledoit and M. Wolf, "A Well-Conditioned Estimator for Large-Dimensional
+       Covariance Matrices", Journal of Multivariate Analysis, Volume 88, Issue 2,
+       February 2004, pages 365-411.
 
 .. _oracle_approximating_shrinkage:
 
@@ -158,22 +156,21 @@ object to the same sample.
    Bias-variance trade-off when setting the shrinkage: comparing the
    choices of Ledoit-Wolf and OAS estimators
 
-.. topic:: References:
+.. rubric:: References
 
-    .. [2] :arxiv:`"Shrinkage algorithms for MMSE covariance estimation.",
-           Chen, Y., Wiesel, A., Eldar, Y. C., & Hero, A. O.
-           IEEE Transactions on Signal Processing, 58(10), 5016-5029, 2010.
-           <0907.4698>`
+.. [2] :arxiv:`"Shrinkage algorithms for MMSE covariance estimation.",
+       Chen, Y., Wiesel, A., Eldar, Y. C., & Hero, A. O.
+       IEEE Transactions on Signal Processing, 58(10), 5016-5029, 2010.
+       <0907.4698>`
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-   * See :ref:`sphx_glr_auto_examples_covariance_plot_covariance_estimation.py` for
-     an example on how to fit an :class:`OAS` object
-     to data.
+* See :ref:`sphx_glr_auto_examples_covariance_plot_covariance_estimation.py` for
+  an example on how to fit an :class:`OAS` object to data.
 
-   * See :ref:`sphx_glr_auto_examples_covariance_plot_lw_vs_oas.py` to visualize the
-     Mean Squared Error difference between a :class:`LedoitWolf` and
-     an :class:`OAS` estimator of the covariance.
+* See :ref:`sphx_glr_auto_examples_covariance_plot_lw_vs_oas.py` to visualize the
+  Mean Squared Error difference between a :class:`LedoitWolf` and
+  an :class:`OAS` estimator of the covariance.
 
 
 .. figure:: ../auto_examples/covariance/images/sphx_glr_plot_lw_vs_oas_001.png
@@ -254,20 +251,20 @@ problem is the GLasso algorithm, from the Friedman 2008 Biostatistics
 paper. It is the same algorithm as in the R ``glasso`` package.
 
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-   * :ref:`sphx_glr_auto_examples_covariance_plot_sparse_cov.py`: example on synthetic
-     data showing some recovery of a structure, and comparing to other
-     covariance estimators.
+* :ref:`sphx_glr_auto_examples_covariance_plot_sparse_cov.py`: example on synthetic
+  data showing some recovery of a structure, and comparing to other
+  covariance estimators.
 
-   * :ref:`sphx_glr_auto_examples_applications_plot_stock_market.py`: example on real
-     stock market data, finding which symbols are most linked.
+* :ref:`sphx_glr_auto_examples_applications_plot_stock_market.py`: example on real
+  stock market data, finding which symbols are most linked.
 
-.. topic:: References:
+.. rubric:: References
 
-   * Friedman et al, `"Sparse inverse covariance estimation with the
-     graphical lasso" <https://biostatistics.oxfordjournals.org/content/9/3/432.short>`_,
-     Biostatistics 9, pp 432, 2008
+* Friedman et al, `"Sparse inverse covariance estimation with the
+  graphical lasso" <https://biostatistics.oxfordjournals.org/content/9/3/432.short>`_,
+  Biostatistics 9, pp 432, 2008
 
 .. _robust_covariance:
 
@@ -313,24 +310,24 @@ the same time.
 Raw estimates can be accessed as ``raw_location_`` and ``raw_covariance_``
 attributes of a :class:`MinCovDet` robust covariance estimator object.
 
-.. topic:: References:
+.. rubric:: References
 
-    .. [3] P. J. Rousseeuw. Least median of squares regression.
-           J. Am Stat Ass, 79:871, 1984.
-    .. [4] A Fast Algorithm for the Minimum Covariance Determinant Estimator,
-           1999, American Statistical Association and the American Society
-           for Quality, TECHNOMETRICS.
+.. [3] P. J. Rousseeuw. Least median of squares regression.
+       J. Am Stat Ass, 79:871, 1984.
+.. [4] A Fast Algorithm for the Minimum Covariance Determinant Estimator,
+       1999, American Statistical Association and the American Society
+       for Quality, TECHNOMETRICS.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-   * See :ref:`sphx_glr_auto_examples_covariance_plot_robust_vs_empirical_covariance.py` for
-     an example on how to fit a :class:`MinCovDet` object to data and see how
-     the estimate remains accurate despite the presence of outliers.
+* See :ref:`sphx_glr_auto_examples_covariance_plot_robust_vs_empirical_covariance.py` for
+  an example on how to fit a :class:`MinCovDet` object to data and see how
+  the estimate remains accurate despite the presence of outliers.
 
-   * See :ref:`sphx_glr_auto_examples_covariance_plot_mahalanobis_distances.py` to
-     visualize the difference between :class:`EmpiricalCovariance` and
-     :class:`MinCovDet` covariance estimators in terms of Mahalanobis distance
-     (so we get a better estimate of the precision matrix too).
+* See :ref:`sphx_glr_auto_examples_covariance_plot_mahalanobis_distances.py` to
+  visualize the difference between :class:`EmpiricalCovariance` and
+  :class:`MinCovDet` covariance estimators in terms of Mahalanobis distance
+  (so we get a better estimate of the precision matrix too).
 
 .. |robust_vs_emp| image:: ../auto_examples/covariance/images/sphx_glr_plot_robust_vs_empirical_covariance_001.png
    :target: ../auto_examples/covariance/plot_robust_vs_empirical_covariance.html
diff --git a/doc/modules/cross_decomposition.rst b/doc/modules/cross_decomposition.rst
index 8f8d217f87144..2d630de699c7a 100644
--- a/doc/modules/cross_decomposition.rst
+++ b/doc/modules/cross_decomposition.rst
@@ -92,42 +92,35 @@ Step *a)* may be performed in two ways: either by computing the whole SVD of
 values, or by directly computing the singular vectors using the power method (cf section 11.3 in [1]_),
 which corresponds to the `'nipals'` option of the `algorithm` parameter.
 
-|details-start|
-**Transforming data**
-|details-split|
+.. dropdown:: Transforming data
 
-To transform :math:`X` into :math:`\bar{X}`, we need to find a projection
-matrix :math:`P` such that :math:`\bar{X} = XP`. We know that for the
-training data, :math:`\Xi = XP`, and :math:`X = \Xi \Gamma^T`. Setting
-:math:`P = U(\Gamma^T U)^{-1}` where :math:`U` is the matrix with the
-:math:`u_k` in the columns, we have :math:`XP = X U(\Gamma^T U)^{-1} = \Xi
-(\Gamma^T U) (\Gamma^T U)^{-1} = \Xi` as desired. The rotation matrix
-:math:`P` can be accessed from the `x_rotations_` attribute.
+  To transform :math:`X` into :math:`\bar{X}`, we need to find a projection
+  matrix :math:`P` such that :math:`\bar{X} = XP`. We know that for the
+  training data, :math:`\Xi = XP`, and :math:`X = \Xi \Gamma^T`. Setting
+  :math:`P = U(\Gamma^T U)^{-1}` where :math:`U` is the matrix with the
+  :math:`u_k` in the columns, we have :math:`XP = X U(\Gamma^T U)^{-1} = \Xi
+  (\Gamma^T U) (\Gamma^T U)^{-1} = \Xi` as desired. The rotation matrix
+  :math:`P` can be accessed from the `x_rotations_` attribute.
 
-Similarly, :math:`Y` can be transformed using the rotation matrix
-:math:`V(\Delta^T V)^{-1}`, accessed via the `y_rotations_` attribute.
-|details-end|
+  Similarly, :math:`Y` can be transformed using the rotation matrix
+  :math:`V(\Delta^T V)^{-1}`, accessed via the `y_rotations_` attribute.
 
-|details-start|
-**Predicting the targets Y**
-|details-split|
+.. dropdown:: Predicting the targets `Y`
 
-To predict the targets of some data :math:`X`, we are looking for a
-coefficient matrix :math:`\beta \in R^{d \times t}` such that :math:`Y =
-X\beta`.
+  To predict the targets of some data :math:`X`, we are looking for a
+  coefficient matrix :math:`\beta \in R^{d \times t}` such that :math:`Y =
+  X\beta`.
 
-The idea is to try to predict the transformed targets :math:`\Omega` as a
-function of the transformed samples :math:`\Xi`, by computing :math:`\alpha
-\in \mathbb{R}` such that :math:`\Omega = \alpha \Xi`.
+  The idea is to try to predict the transformed targets :math:`\Omega` as a
+  function of the transformed samples :math:`\Xi`, by computing :math:`\alpha
+  \in \mathbb{R}` such that :math:`\Omega = \alpha \Xi`.
 
-Then, we have :math:`Y = \Omega \Delta^T = \alpha \Xi \Delta^T`, and since
-:math:`\Xi` is the transformed training data we have that :math:`Y = X \alpha
-P \Delta^T`, and as a result the coefficient matrix :math:`\beta = \alpha P
-\Delta^T`.
+  Then, we have :math:`Y = \Omega \Delta^T = \alpha \Xi \Delta^T`, and since
+  :math:`\Xi` is the transformed training data we have that :math:`Y = X \alpha
+  P \Delta^T`, and as a result the coefficient matrix :math:`\beta = \alpha P
+  \Delta^T`.
 
-:math:`\beta` can be accessed through the `coef_` attribute.
-
-|details-end|
+  :math:`\beta` can be accessed through the `coef_` attribute.
 
 PLSSVD
 ------
@@ -184,18 +177,13 @@ Since :class:`CCA` involves the inversion of :math:`X_k^TX_k` and
 :math:`Y_k^TY_k`, this estimator can be unstable if the number of features or
 targets is greater than the number of samples.
 
-|details-start|
-**Reference**
-|details-split|
-
-   .. [1] `A survey of Partial Least Squares (PLS) methods, with emphasis on
-      the two-block case
-      <https://stat.uw.edu/sites/default/files/files/reports/2000/tr371.pdf>`_
-      JA Wegelin
+.. rubric:: References
 
-|details-end|
+.. [1] `A survey of Partial Least Squares (PLS) methods, with emphasis on the two-block
+  case <https://stat.uw.edu/sites/default/files/files/reports/2000/tr371.pdf>`_,
+  JA Wegelin
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_cross_decomposition_plot_compare_cross_decomposition.py`
-    * :ref:`sphx_glr_auto_examples_cross_decomposition_plot_pcr_vs_pls.py`
+* :ref:`sphx_glr_auto_examples_cross_decomposition_plot_compare_cross_decomposition.py`
+* :ref:`sphx_glr_auto_examples_cross_decomposition_plot_pcr_vs_pls.py`
diff --git a/doc/modules/cross_validation.rst b/doc/modules/cross_validation.rst
index 34f14fe6846a2..defcd91a6008a 100644
--- a/doc/modules/cross_validation.rst
+++ b/doc/modules/cross_validation.rst
@@ -170,36 +170,33 @@ indices, for example::
   >>> cross_val_score(clf, X, y, cv=custom_cv)
   array([1.        , 0.973...])
 
-|details-start|
-**Data transformation with held out data**
-|details-split|
+.. dropdown:: Data transformation with held-out data
 
-    Just as it is important to test a predictor on data held-out from
-    training, preprocessing (such as standardization, feature selection, etc.)
-    and similar :ref:`data transformations <data-transforms>` similarly should
-    be learnt from a training set and applied to held-out data for prediction::
+  Just as it is important to test a predictor on data held-out from
+  training, preprocessing (such as standardization, feature selection, etc.)
+  and similar :ref:`data transformations <data-transforms>` similarly should
+  be learnt from a training set and applied to held-out data for prediction::
 
-      >>> from sklearn import preprocessing
-      >>> X_train, X_test, y_train, y_test = train_test_split(
-      ...     X, y, test_size=0.4, random_state=0)
-      >>> scaler = preprocessing.StandardScaler().fit(X_train)
-      >>> X_train_transformed = scaler.transform(X_train)
-      >>> clf = svm.SVC(C=1).fit(X_train_transformed, y_train)
-      >>> X_test_transformed = scaler.transform(X_test)
-      >>> clf.score(X_test_transformed, y_test)
-      0.9333...
+    >>> from sklearn import preprocessing
+    >>> X_train, X_test, y_train, y_test = train_test_split(
+    ...     X, y, test_size=0.4, random_state=0)
+    >>> scaler = preprocessing.StandardScaler().fit(X_train)
+    >>> X_train_transformed = scaler.transform(X_train)
+    >>> clf = svm.SVC(C=1).fit(X_train_transformed, y_train)
+    >>> X_test_transformed = scaler.transform(X_test)
+    >>> clf.score(X_test_transformed, y_test)
+    0.9333...
 
-    A :class:`Pipeline <sklearn.pipeline.Pipeline>` makes it easier to compose
-    estimators, providing this behavior under cross-validation::
+  A :class:`Pipeline <sklearn.pipeline.Pipeline>` makes it easier to compose
+  estimators, providing this behavior under cross-validation::
 
-      >>> from sklearn.pipeline import make_pipeline
-      >>> clf = make_pipeline(preprocessing.StandardScaler(), svm.SVC(C=1))
-      >>> cross_val_score(clf, X, y, cv=cv)
-      array([0.977..., 0.933..., 0.955..., 0.933..., 0.977...])
+    >>> from sklearn.pipeline import make_pipeline
+    >>> clf = make_pipeline(preprocessing.StandardScaler(), svm.SVC(C=1))
+    >>> cross_val_score(clf, X, y, cv=cv)
+    array([0.977..., 0.933..., 0.955..., 0.933..., 0.977...])
 
-    See :ref:`combining_estimators`.
+  See :ref:`combining_estimators`.
 
-|details-end|
 
 .. _multimetric_cross_validation:
 
@@ -294,14 +291,14 @@ The function :func:`cross_val_predict` is appropriate for:
 The available cross validation iterators are introduced in the following
 section.
 
-.. topic:: Examples
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_model_selection_plot_roc_crossval.py`,
-    * :ref:`sphx_glr_auto_examples_feature_selection_plot_rfe_with_cross_validation.py`,
-    * :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_digits.py`,
-    * :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_text_feature_extraction.py`,
-    * :ref:`sphx_glr_auto_examples_model_selection_plot_cv_predict.py`,
-    * :ref:`sphx_glr_auto_examples_model_selection_plot_nested_cross_validation_iris.py`.
+* :ref:`sphx_glr_auto_examples_model_selection_plot_roc_crossval.py`,
+* :ref:`sphx_glr_auto_examples_feature_selection_plot_rfe_with_cross_validation.py`,
+* :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_digits.py`,
+* :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_text_feature_extraction.py`,
+* :ref:`sphx_glr_auto_examples_model_selection_plot_cv_predict.py`,
+* :ref:`sphx_glr_auto_examples_model_selection_plot_nested_cross_validation_iris.py`.
 
 Cross validation iterators
 ==========================
@@ -442,23 +439,19 @@ then 5- or 10- fold cross validation can overestimate the generalization error.
 As a general rule, most authors, and empirical evidence, suggest that 5- or 10-
 fold cross validation should be preferred to LOO.
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
- * `<http://www.faqs.org/faqs/ai-faq/neural-nets/part3/section-12.html>`_;
- * T. Hastie, R. Tibshirani, J. Friedman,  `The Elements of Statistical Learning
-   <https://web.stanford.edu/~hastie/ElemStatLearn/>`_, Springer 2009
- * L. Breiman, P. Spector `Submodel selection and evaluation in regression: The X-random case
-   <https://digitalassets.lib.berkeley.edu/sdtr/ucb/text/197.pdf>`_, International Statistical Review 1992;
- * R. Kohavi, `A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection
-   <https://www.ijcai.org/Proceedings/95-2/Papers/016.pdf>`_, Intl. Jnt. Conf. AI
- * R. Bharat Rao, G. Fung, R. Rosales, `On the Dangers of Cross-Validation. An Experimental Evaluation
-   <https://people.csail.mit.edu/romer/papers/CrossVal_SDM08.pdf>`_, SIAM 2008;
- * G. James, D. Witten, T. Hastie, R Tibshirani, `An Introduction to
-   Statistical Learning <https://www.statlearning.com>`_, Springer 2013.
-
-|details-end|
+  * `<http://www.faqs.org/faqs/ai-faq/neural-nets/part3/section-12.html>`_;
+  * T. Hastie, R. Tibshirani, J. Friedman,  `The Elements of Statistical Learning
+    <https://web.stanford.edu/~hastie/ElemStatLearn/>`_, Springer 2009
+  * L. Breiman, P. Spector `Submodel selection and evaluation in regression: The X-random case
+    <https://digitalassets.lib.berkeley.edu/sdtr/ucb/text/197.pdf>`_, International Statistical Review 1992;
+  * R. Kohavi, `A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection
+    <https://www.ijcai.org/Proceedings/95-2/Papers/016.pdf>`_, Intl. Jnt. Conf. AI
+  * R. Bharat Rao, G. Fung, R. Rosales, `On the Dangers of Cross-Validation. An Experimental Evaluation
+    <https://people.csail.mit.edu/romer/papers/CrossVal_SDM08.pdf>`_, SIAM 2008;
+  * G. James, D. Witten, T. Hastie, R Tibshirani, `An Introduction to
+    Statistical Learning <https://www.statlearning.com>`_, Springer 2013.
 
 .. _leave_p_out:
 
@@ -700,30 +693,27 @@ Example::
   [ 0  1  4  5  6  7  8  9 11 12 13 14] [ 2  3 10 15 16 17]
   [ 1  2  3  8  9 10 12 13 14 15 16 17] [ 0  4  5  6  7 11]
 
-|details-start|
-**Implementation notes**
-|details-split|
+.. dropdown:: Implementation notes
 
-- With the current implementation full shuffle is not possible in most
-  scenarios. When shuffle=True, the following happens:
+  - With the current implementation full shuffle is not possible in most
+    scenarios. When shuffle=True, the following happens:
 
-  1. All groups are shuffled.
-  2. Groups are sorted by standard deviation of classes using stable sort.
-  3. Sorted groups are iterated over and assigned to folds.
+    1. All groups are shuffled.
+    2. Groups are sorted by standard deviation of classes using stable sort.
+    3. Sorted groups are iterated over and assigned to folds.
 
-  That means that only groups with the same standard deviation of class
-  distribution will be shuffled, which might be useful when each group has only
-  a single class.
-- The algorithm greedily assigns each group to one of n_splits test sets,
-  choosing the test set that minimises the variance in class distribution
-  across test sets. Group assignment proceeds from groups with highest to
-  lowest variance in class frequency, i.e. large groups peaked on one or few
-  classes are assigned first.
-- This split is suboptimal in a sense that it might produce imbalanced splits
-  even if perfect stratification is possible. If you have relatively close
-  distribution of classes in each group, using :class:`GroupKFold` is better.
+    That means that only groups with the same standard deviation of class
+    distribution will be shuffled, which might be useful when each group has only
+    a single class.
+  - The algorithm greedily assigns each group to one of n_splits test sets,
+    choosing the test set that minimises the variance in class distribution
+    across test sets. Group assignment proceeds from groups with highest to
+    lowest variance in class frequency, i.e. large groups peaked on one or few
+    classes are assigned first.
+  - This split is suboptimal in a sense that it might produce imbalanced splits
+    even if perfect stratification is possible. If you have relatively close
+    distribution of classes in each group, using :class:`GroupKFold` is better.
 
-|details-end|
 
 Here is a visualization of cross-validation behavior for uneven groups:
 
@@ -999,16 +989,12 @@ using brute force and internally fits ``(n_permutations + 1) * n_cv`` models.
 It is therefore only tractable with small datasets for which fitting an
 individual model is very fast.
 
-.. topic:: Examples
-
-    * :ref:`sphx_glr_auto_examples_model_selection_plot_permutation_tests_for_classification.py`
+.. rubric:: Examples
 
-|details-start|
-**References**
-|details-split|
+* :ref:`sphx_glr_auto_examples_model_selection_plot_permutation_tests_for_classification.py`
 
- * Ojala and Garriga. `Permutation Tests for Studying Classifier Performance
-   <http://www.jmlr.org/papers/volume11/ojala10a/ojala10a.pdf>`_.
-   J. Mach. Learn. Res. 2010.
+.. dropdown:: References
 
-|details-end|
+  * Ojala and Garriga. `Permutation Tests for Studying Classifier Performance
+    <http://www.jmlr.org/papers/volume11/ojala10a/ojala10a.pdf>`_.
+    J. Mach. Learn. Res. 2010.
diff --git a/doc/modules/decomposition.rst b/doc/modules/decomposition.rst
index e8241a92cfc3b..926a4482f1428 100644
--- a/doc/modules/decomposition.rst
+++ b/doc/modules/decomposition.rst
@@ -51,11 +51,11 @@ data based on the amount of variance it explains. As such it implements a
     :scale: 75%
 
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_decomposition_plot_pca_iris.py`
-    * :ref:`sphx_glr_auto_examples_decomposition_plot_pca_vs_lda.py`
-    * :ref:`sphx_glr_auto_examples_decomposition_plot_pca_vs_fa_model_selection.py`
+* :ref:`sphx_glr_auto_examples_decomposition_plot_pca_iris.py`
+* :ref:`sphx_glr_auto_examples_decomposition_plot_pca_vs_lda.py`
+* :ref:`sphx_glr_auto_examples_decomposition_plot_pca_vs_fa_model_selection.py`
 
 
 .. _IncrementalPCA:
@@ -97,9 +97,9 @@ input data for each feature before applying the SVD.
     :scale: 75%
 
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_decomposition_plot_incremental_pca.py`
+* :ref:`sphx_glr_auto_examples_decomposition_plot_incremental_pca.py`
 
 
 .. _RandomizedPCA:
@@ -160,20 +160,20 @@ Note: the implementation of ``inverse_transform`` in :class:`PCA` with
 ``transform`` even when ``whiten=False`` (default).
 
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_applications_plot_face_recognition.py`
-    * :ref:`sphx_glr_auto_examples_decomposition_plot_faces_decomposition.py`
+* :ref:`sphx_glr_auto_examples_applications_plot_face_recognition.py`
+* :ref:`sphx_glr_auto_examples_decomposition_plot_faces_decomposition.py`
 
-.. topic:: References:
+.. rubric:: References
 
-    * Algorithm 4.3 in
-      :arxiv:`"Finding structure with randomness: Stochastic algorithms for
-      constructing approximate matrix decompositions" <0909.4061>`
-      Halko, et al., 2009
+* Algorithm 4.3 in
+  :arxiv:`"Finding structure with randomness: Stochastic algorithms for
+  constructing approximate matrix decompositions" <0909.4061>`
+  Halko, et al., 2009
 
-    * :arxiv:`"An implementation of a randomized algorithm for principal component
-      analysis" <1412.3510>` A. Szlam et al. 2014
+* :arxiv:`"An implementation of a randomized algorithm for principal component
+  analysis" <1412.3510>` A. Szlam et al. 2014
 
 .. _SparsePCA:
 
@@ -248,18 +248,18 @@ factorization, while larger values shrink many coefficients to zero.
   the algorithm is online along the features direction, not the samples
   direction.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-   * :ref:`sphx_glr_auto_examples_decomposition_plot_faces_decomposition.py`
+* :ref:`sphx_glr_auto_examples_decomposition_plot_faces_decomposition.py`
 
-.. topic:: References:
+.. rubric:: References
 
-  .. [Mrl09] `"Online Dictionary Learning for Sparse Coding"
-     <https://www.di.ens.fr/sierra/pdfs/icml09.pdf>`_
-     J. Mairal, F. Bach, J. Ponce, G. Sapiro, 2009
-  .. [Jen09] `"Structured Sparse Principal Component Analysis"
-     <https://www.di.ens.fr/~fbach/sspca_AISTATS2010.pdf>`_
-     R. Jenatton, G. Obozinski, F. Bach, 2009
+.. [Mrl09] `"Online Dictionary Learning for Sparse Coding"
+   <https://www.di.ens.fr/sierra/pdfs/icml09.pdf>`_
+   J. Mairal, F. Bach, J. Ponce, G. Sapiro, 2009
+.. [Jen09] `"Structured Sparse Principal Component Analysis"
+   <https://www.di.ens.fr/~fbach/sspca_AISTATS2010.pdf>`_
+   R. Jenatton, G. Obozinski, F. Bach, 2009
 
 
 .. _kernel_PCA:
@@ -288,22 +288,23 @@ prediction (kernel dependency estimation). :class:`KernelPCA` supports both
     :meth:`KernelPCA.inverse_transform` is an approximation. See the example
     linked below for more details.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_decomposition_plot_kernel_pca.py`
+* :ref:`sphx_glr_auto_examples_decomposition_plot_kernel_pca.py`
+* :ref:`sphx_glr_auto_examples_applications_plot_digits_denoising.py`
 
-.. topic:: References:
+.. rubric:: References
 
-    .. [Scholkopf1997] Schölkopf, Bernhard, Alexander Smola, and Klaus-Robert Müller.
-       `"Kernel principal component analysis."
-       <https://people.eecs.berkeley.edu/~wainwrig/stat241b/scholkopf_kernel.pdf>`_
-       International conference on artificial neural networks.
-       Springer, Berlin, Heidelberg, 1997.
+.. [Scholkopf1997] Schölkopf, Bernhard, Alexander Smola, and Klaus-Robert Müller.
+   `"Kernel principal component analysis."
+   <https://people.eecs.berkeley.edu/~wainwrig/stat241b/scholkopf_kernel.pdf>`_
+   International conference on artificial neural networks.
+   Springer, Berlin, Heidelberg, 1997.
 
-    .. [Bakir2003] Bakır, Gökhan H., Jason Weston, and Bernhard Schölkopf.
-       `"Learning to find pre-images."
-       <https://papers.nips.cc/paper/2003/file/ac1ad983e08ad3304a97e147f522747e-Paper.pdf>`_
-       Advances in neural information processing systems 16 (2003): 449-456.
+.. [Bakir2003] Bakır, Gökhan H., Jason Weston, and Bernhard Schölkopf.
+   `"Learning to find pre-images."
+   <https://papers.nips.cc/paper/2003/file/ac1ad983e08ad3304a97e147f522747e-Paper.pdf>`_
+   Advances in neural information processing systems 16 (2003): 449-456.
 
 .. _kPCA_Solvers:
 
@@ -321,36 +322,33 @@ is much smaller than its size. This is a situation where approximate
 eigensolvers can provide speedup with very low precision loss.
 
 
-|details-start|
-**Eigensolvers**
-|details-split|
+.. dropdown:: Eigensolvers
 
-The optional parameter ``eigen_solver='randomized'`` can be used to
-*significantly* reduce the computation time when the number of requested
-``n_components`` is small compared with the number of samples. It relies on
-randomized decomposition methods to find an approximate solution in a shorter
-time.
+    The optional parameter ``eigen_solver='randomized'`` can be used to
+    *significantly* reduce the computation time when the number of requested
+    ``n_components`` is small compared with the number of samples. It relies on
+    randomized decomposition methods to find an approximate solution in a shorter
+    time.
 
-The time complexity of the randomized :class:`KernelPCA` is
-:math:`O(n_{\mathrm{samples}}^2 \cdot n_{\mathrm{components}})`
-instead of :math:`O(n_{\mathrm{samples}}^3)` for the exact method
-implemented with ``eigen_solver='dense'``.
+    The time complexity of the randomized :class:`KernelPCA` is
+    :math:`O(n_{\mathrm{samples}}^2 \cdot n_{\mathrm{components}})`
+    instead of :math:`O(n_{\mathrm{samples}}^3)` for the exact method
+    implemented with ``eigen_solver='dense'``.
 
-The memory footprint of randomized :class:`KernelPCA` is also proportional to
-:math:`2 \cdot n_{\mathrm{samples}} \cdot n_{\mathrm{components}}` instead of
-:math:`n_{\mathrm{samples}}^2` for the exact method.
+    The memory footprint of randomized :class:`KernelPCA` is also proportional to
+    :math:`2 \cdot n_{\mathrm{samples}} \cdot n_{\mathrm{components}}` instead of
+    :math:`n_{\mathrm{samples}}^2` for the exact method.
 
-Note: this technique is the same as in :ref:`RandomizedPCA`.
+    Note: this technique is the same as in :ref:`RandomizedPCA`.
 
-In addition to the above two solvers, ``eigen_solver='arpack'`` can be used as
-an alternate way to get an approximate decomposition. In practice, this method
-only provides reasonable execution times when the number of components to find
-is extremely small. It is enabled by default when the desired number of
-components is less than 10 (strict) and the number of samples is more than 200
-(strict). See :class:`KernelPCA` for details.
+    In addition to the above two solvers, ``eigen_solver='arpack'`` can be used as
+    an alternate way to get an approximate decomposition. In practice, this method
+    only provides reasonable execution times when the number of components to find
+    is extremely small. It is enabled by default when the desired number of
+    components is less than 10 (strict) and the number of samples is more than 200
+    (strict). See :class:`KernelPCA` for details.
 
-
-.. topic:: References:
+    .. rubric:: References
 
     * *dense* solver:
       `scipy.linalg.eigh documentation
@@ -372,8 +370,6 @@ components is less than 10 (strict) and the number of samples is more than 200
       <https://docs.scipy.org/doc/scipy/reference/generated/scipy.sparse.linalg.eigsh.html>`_
       R. B. Lehoucq, D. C. Sorensen, and C. Yang, (1998)
 
-|details-end|
-
 
 .. _LSA:
 
@@ -390,72 +386,67 @@ When the columnwise (per-feature) means of :math:`X`
 are subtracted from the feature values,
 truncated SVD on the resulting matrix is equivalent to PCA.
 
-|details-start|
-**About truncated SVD and latent semantic analysis (LSA)**
-|details-split|
-
-When truncated SVD is applied to term-document matrices
-(as returned by :class:`~sklearn.feature_extraction.text.CountVectorizer` or
-:class:`~sklearn.feature_extraction.text.TfidfVectorizer`),
-this transformation is known as
-`latent semantic analysis <https://nlp.stanford.edu/IR-book/pdf/18lsi.pdf>`_
-(LSA), because it transforms such matrices
-to a "semantic" space of low dimensionality.
-In particular, LSA is known to combat the effects of synonymy and polysemy
-(both of which roughly mean there are multiple meanings per word),
-which cause term-document matrices to be overly sparse
-and exhibit poor similarity under measures such as cosine similarity.
+.. dropdown:: About truncated SVD and latent semantic analysis (LSA)
 
-.. note::
-    LSA is also known as latent semantic indexing, LSI,
-    though strictly that refers to its use in persistent indexes
-    for information retrieval purposes.
+    When truncated SVD is applied to term-document matrices
+    (as returned by :class:`~sklearn.feature_extraction.text.CountVectorizer` or
+    :class:`~sklearn.feature_extraction.text.TfidfVectorizer`),
+    this transformation is known as
+    `latent semantic analysis <https://nlp.stanford.edu/IR-book/pdf/18lsi.pdf>`_
+    (LSA), because it transforms such matrices
+    to a "semantic" space of low dimensionality.
+    In particular, LSA is known to combat the effects of synonymy and polysemy
+    (both of which roughly mean there are multiple meanings per word),
+    which cause term-document matrices to be overly sparse
+    and exhibit poor similarity under measures such as cosine similarity.
 
-Mathematically, truncated SVD applied to training samples :math:`X`
-produces a low-rank approximation :math:`X`:
-
-.. math::
-    X \approx X_k = U_k \Sigma_k V_k^\top
+    .. note::
+        LSA is also known as latent semantic indexing, LSI,
+        though strictly that refers to its use in persistent indexes
+        for information retrieval purposes.
 
-After this operation, :math:`U_k \Sigma_k`
-is the transformed training set with :math:`k` features
-(called ``n_components`` in the API).
+    Mathematically, truncated SVD applied to training samples :math:`X`
+    produces a low-rank approximation :math:`X`:
 
-To also transform a test set :math:`X`, we multiply it with :math:`V_k`:
+    .. math::
+        X \approx X_k = U_k \Sigma_k V_k^\top
 
-.. math::
-    X' = X V_k
+    After this operation, :math:`U_k \Sigma_k`
+    is the transformed training set with :math:`k` features
+    (called ``n_components`` in the API).
 
-.. note::
-    Most treatments of LSA in the natural language processing (NLP)
-    and information retrieval (IR) literature
-    swap the axes of the matrix :math:`X` so that it has shape
-    ``n_features`` × ``n_samples``.
-    We present LSA in a different way that matches the scikit-learn API better,
-    but the singular values found are the same.
+    To also transform a test set :math:`X`, we multiply it with :math:`V_k`:
 
+    .. math::
+        X' = X V_k
 
-While the :class:`TruncatedSVD` transformer
-works with any feature matrix,
-using it on tf–idf matrices is recommended over raw frequency counts
-in an LSA/document processing setting.
-In particular, sublinear scaling and inverse document frequency
-should be turned on (``sublinear_tf=True, use_idf=True``)
-to bring the feature values closer to a Gaussian distribution,
-compensating for LSA's erroneous assumptions about textual data.
+    .. note::
+        Most treatments of LSA in the natural language processing (NLP)
+        and information retrieval (IR) literature
+        swap the axes of the matrix :math:`X` so that it has shape
+        ``(n_features, n_samples)``.
+        We present LSA in a different way that matches the scikit-learn API better,
+        but the singular values found are the same.
 
-|details-end|
+    While the :class:`TruncatedSVD` transformer
+    works with any feature matrix,
+    using it on tf-idf matrices is recommended over raw frequency counts
+    in an LSA/document processing setting.
+    In particular, sublinear scaling and inverse document frequency
+    should be turned on (``sublinear_tf=True, use_idf=True``)
+    to bring the feature values closer to a Gaussian distribution,
+    compensating for LSA's erroneous assumptions about textual data.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-   * :ref:`sphx_glr_auto_examples_text_plot_document_clustering.py`
+* :ref:`sphx_glr_auto_examples_text_plot_document_clustering.py`
 
-.. topic:: References:
+.. rubric:: References
 
-  * Christopher D. Manning, Prabhakar Raghavan and Hinrich Schütze (2008),
-    *Introduction to Information Retrieval*, Cambridge University Press,
-    chapter 18: `Matrix decompositions & latent semantic indexing
-    <https://nlp.stanford.edu/IR-book/pdf/18lsi.pdf>`_
+* Christopher D. Manning, Prabhakar Raghavan and Hinrich Schütze (2008),
+  *Introduction to Information Retrieval*, Cambridge University Press,
+  chapter 18: `Matrix decompositions & latent semantic indexing
+  <https://nlp.stanford.edu/IR-book/pdf/18lsi.pdf>`_
 
 
 
@@ -509,9 +500,9 @@ the split code is filled with the negative part of the code vector, only with
 a positive sign. Therefore, the split_code is non-negative.
 
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_decomposition_plot_sparse_coding.py`
+* :ref:`sphx_glr_auto_examples_decomposition_plot_sparse_coding.py`
 
 
 Generic dictionary learning
@@ -591,16 +582,16 @@ extracted from part of the image of a raccoon face looks like.
     :scale: 50%
 
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_decomposition_plot_image_denoising.py`
+* :ref:`sphx_glr_auto_examples_decomposition_plot_image_denoising.py`
 
 
-.. topic:: References:
+.. rubric:: References
 
-  * `"Online dictionary learning for sparse coding"
-    <https://www.di.ens.fr/sierra/pdfs/icml09.pdf>`_
-    J. Mairal, F. Bach, J. Ponce, G. Sapiro, 2009
+* `"Online dictionary learning for sparse coding"
+  <https://www.di.ens.fr/sierra/pdfs/icml09.pdf>`_
+  J. Mairal, F. Bach, J. Ponce, G. Sapiro, 2009
 
 .. _MiniBatchDictionaryLearning:
 
@@ -731,10 +722,10 @@ Varimax rotation maximizes the sum of the variances of the squared loadings,
 i.e., it tends to produce sparser factors, which are influenced by only a few
 features each (the "simple structure"). See e.g., the first example below.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_decomposition_plot_varimax_fa.py`
-    * :ref:`sphx_glr_auto_examples_decomposition_plot_pca_vs_fa_model_selection.py`
+* :ref:`sphx_glr_auto_examples_decomposition_plot_varimax_fa.py`
+* :ref:`sphx_glr_auto_examples_decomposition_plot_pca_vs_fa_model_selection.py`
 
 
 .. _ICA:
@@ -773,11 +764,11 @@ components with some sparsity:
 
 .. centered:: |pca_img4| |ica_img4|
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_decomposition_plot_ica_blind_source_separation.py`
-    * :ref:`sphx_glr_auto_examples_decomposition_plot_ica_vs_pca.py`
-    * :ref:`sphx_glr_auto_examples_decomposition_plot_faces_decomposition.py`
+* :ref:`sphx_glr_auto_examples_decomposition_plot_ica_blind_source_separation.py`
+* :ref:`sphx_glr_auto_examples_decomposition_plot_ica_vs_pca.py`
+* :ref:`sphx_glr_auto_examples_decomposition_plot_faces_decomposition.py`
 
 
 .. _NMF:
@@ -900,24 +891,20 @@ Note that this definition is not valid if :math:`\beta \in (0; 1)`, yet it can
 be continuously extended to the definitions of :math:`d_{KL}` and :math:`d_{IS}`
 respectively.
 
-|details-start|
-**NMF implemented solvers**
-|details-split|
-
-:class:`NMF` implements two solvers, using Coordinate Descent ('cd') [5]_, and
-Multiplicative Update ('mu') [6]_. The 'mu' solver can optimize every
-beta-divergence, including of course the Frobenius norm (:math:`\beta=2`), the
-(generalized) Kullback-Leibler divergence (:math:`\beta=1`) and the
-Itakura-Saito divergence (:math:`\beta=0`). Note that for
-:math:`\beta \in (1; 2)`, the 'mu' solver is significantly faster than for other
-values of :math:`\beta`. Note also that with a negative (or 0, i.e.
-'itakura-saito') :math:`\beta`, the input matrix cannot contain zero values.
+.. dropdown:: NMF implemented solvers
 
-The 'cd' solver can only optimize the Frobenius norm. Due to the
-underlying non-convexity of NMF, the different solvers may converge to
-different minima, even when optimizing the same distance function.
+    :class:`NMF` implements two solvers, using Coordinate Descent ('cd') [5]_, and
+    Multiplicative Update ('mu') [6]_. The 'mu' solver can optimize every
+    beta-divergence, including of course the Frobenius norm (:math:`\beta=2`), the
+    (generalized) Kullback-Leibler divergence (:math:`\beta=1`) and the
+    Itakura-Saito divergence (:math:`\beta=0`). Note that for
+    :math:`\beta \in (1; 2)`, the 'mu' solver is significantly faster than for other
+    values of :math:`\beta`. Note also that with a negative (or 0, i.e.
+    'itakura-saito') :math:`\beta`, the input matrix cannot contain zero values.
 
-|details-end|
+    The 'cd' solver can only optimize the Frobenius norm. Due to the
+    underlying non-convexity of NMF, the different solvers may converge to
+    different minima, even when optimizing the same distance function.
 
 NMF is best used with the ``fit_transform`` method, which returns the matrix W.
 The matrix H is stored into the fitted model in the ``components_`` attribute;
@@ -935,10 +922,10 @@ stored components::
 
 
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_decomposition_plot_faces_decomposition.py`
-    * :ref:`sphx_glr_auto_examples_applications_plot_topics_extraction_with_nmf_lda.py`
+* :ref:`sphx_glr_auto_examples_decomposition_plot_faces_decomposition.py`
+* :ref:`sphx_glr_auto_examples_applications_plot_topics_extraction_with_nmf_lda.py`
 
 .. _MiniBatchNMF:
 
@@ -963,33 +950,33 @@ The estimator also implements ``partial_fit``, which updates ``H`` by iterating
 only once over a mini-batch. This can be used for online learning when the data
 is not readily available from the start, or when the data does not fit into memory.
 
-.. topic:: References:
+.. rubric:: References
 
-    .. [1] `"Learning the parts of objects by non-negative matrix factorization"
-      <http://www.cs.columbia.edu/~blei/fogm/2020F/readings/LeeSeung1999.pdf>`_
-      D. Lee, S. Seung, 1999
+.. [1] `"Learning the parts of objects by non-negative matrix factorization"
+  <http://www.cs.columbia.edu/~blei/fogm/2020F/readings/LeeSeung1999.pdf>`_
+  D. Lee, S. Seung, 1999
 
-    .. [2] `"Non-negative Matrix Factorization with Sparseness Constraints"
-      <https://www.jmlr.org/papers/volume5/hoyer04a/hoyer04a.pdf>`_
-      P. Hoyer, 2004
+.. [2] `"Non-negative Matrix Factorization with Sparseness Constraints"
+  <https://www.jmlr.org/papers/volume5/hoyer04a/hoyer04a.pdf>`_
+  P. Hoyer, 2004
 
-    .. [4] `"SVD based initialization: A head start for nonnegative
-      matrix factorization"
-      <https://www.boutsidis.org/Boutsidis_PRE_08.pdf>`_
-      C. Boutsidis, E. Gallopoulos, 2008
+.. [4] `"SVD based initialization: A head start for nonnegative
+  matrix factorization"
+  <https://www.boutsidis.org/Boutsidis_PRE_08.pdf>`_
+  C. Boutsidis, E. Gallopoulos, 2008
 
-    .. [5] `"Fast local algorithms for large scale nonnegative matrix and tensor
-      factorizations."
-      <https://www.researchgate.net/profile/Anh-Huy-Phan/publication/220241471_Fast_Local_Algorithms_for_Large_Scale_Nonnegative_Matrix_and_Tensor_Factorizations>`_
-      A. Cichocki, A. Phan, 2009
+.. [5] `"Fast local algorithms for large scale nonnegative matrix and tensor
+  factorizations."
+  <https://www.researchgate.net/profile/Anh-Huy-Phan/publication/220241471_Fast_Local_Algorithms_for_Large_Scale_Nonnegative_Matrix_and_Tensor_Factorizations>`_
+  A. Cichocki, A. Phan, 2009
 
-    .. [6] :arxiv:`"Algorithms for nonnegative matrix factorization with
-           the beta-divergence" <1010.1763>`
-           C. Fevotte, J. Idier, 2011
+.. [6] :arxiv:`"Algorithms for nonnegative matrix factorization with
+  the beta-divergence" <1010.1763>`
+  C. Fevotte, J. Idier, 2011
 
-    .. [7] :arxiv:`"Online algorithms for nonnegative matrix factorization with the
-       Itakura-Saito divergence" <1106.4198>`
-       A. Lefevre, F. Bach, C. Fevotte, 2011
+.. [7] :arxiv:`"Online algorithms for nonnegative matrix factorization with the
+  Itakura-Saito divergence" <1106.4198>`
+  A. Lefevre, F. Bach, C. Fevotte, 2011
 
 .. _LatentDirichletAllocation:
 
@@ -1021,51 +1008,48 @@ of topics in the corpus and the distribution of words in the documents.
 The goal of LDA is to use the observed words to infer the hidden topic
 structure.
 
-|details-start|
-**Details on modeling text corpora**
-|details-split|
+.. dropdown:: Details on modeling text corpora
 
-When modeling text corpora, the model assumes the following generative process
-for a corpus with :math:`D` documents and :math:`K` topics, with :math:`K`
-corresponding to `n_components` in the API:
+    When modeling text corpora, the model assumes the following generative process
+    for a corpus with :math:`D` documents and :math:`K` topics, with :math:`K`
+    corresponding to `n_components` in the API:
 
-1. For each topic :math:`k \in K`, draw :math:`\beta_k \sim
-   \mathrm{Dirichlet}(\eta)`. This provides a distribution over the words,
-   i.e. the probability of a word appearing in topic :math:`k`.
-   :math:`\eta` corresponds to `topic_word_prior`.
+    1. For each topic :math:`k \in K`, draw :math:`\beta_k \sim
+       \mathrm{Dirichlet}(\eta)`. This provides a distribution over the words,
+       i.e. the probability of a word appearing in topic :math:`k`.
+       :math:`\eta` corresponds to `topic_word_prior`.
 
-2. For each document :math:`d \in D`, draw the topic proportions
-   :math:`\theta_d \sim \mathrm{Dirichlet}(\alpha)`. :math:`\alpha`
-   corresponds to `doc_topic_prior`.
+    2. For each document :math:`d \in D`, draw the topic proportions
+       :math:`\theta_d \sim \mathrm{Dirichlet}(\alpha)`. :math:`\alpha`
+       corresponds to `doc_topic_prior`.
 
-3. For each word :math:`i` in document :math:`d`:
+    3. For each word :math:`i` in document :math:`d`:
 
-   a. Draw the topic assignment :math:`z_{di} \sim \mathrm{Multinomial}
-      (\theta_d)`
-   b. Draw the observed word :math:`w_{ij} \sim \mathrm{Multinomial}
-      (\beta_{z_{di}})`
+       a. Draw the topic assignment :math:`z_{di} \sim \mathrm{Multinomial}
+          (\theta_d)`
+       b. Draw the observed word :math:`w_{ij} \sim \mathrm{Multinomial}
+          (\beta_{z_{di}})`
 
-For parameter estimation, the posterior distribution is:
+    For parameter estimation, the posterior distribution is:
 
-.. math::
-  p(z, \theta, \beta |w, \alpha, \eta) =
-    \frac{p(z, \theta, \beta|\alpha, \eta)}{p(w|\alpha, \eta)}
+    .. math::
+        p(z, \theta, \beta |w, \alpha, \eta) =
+        \frac{p(z, \theta, \beta|\alpha, \eta)}{p(w|\alpha, \eta)}
 
-Since the posterior is intractable, variational Bayesian method
-uses a simpler distribution :math:`q(z,\theta,\beta | \lambda, \phi, \gamma)`
-to approximate it, and those variational parameters :math:`\lambda`,
-:math:`\phi`, :math:`\gamma` are optimized to maximize the Evidence
-Lower Bound (ELBO):
+    Since the posterior is intractable, variational Bayesian method
+    uses a simpler distribution :math:`q(z,\theta,\beta | \lambda, \phi, \gamma)`
+    to approximate it, and those variational parameters :math:`\lambda`,
+    :math:`\phi`, :math:`\gamma` are optimized to maximize the Evidence
+    Lower Bound (ELBO):
 
-.. math::
-  \log\: P(w | \alpha, \eta) \geq L(w,\phi,\gamma,\lambda) \overset{\triangle}{=}
-    E_{q}[\log\:p(w,z,\theta,\beta|\alpha,\eta)] - E_{q}[\log\:q(z, \theta, \beta)]
+    .. math::
+        \log\: P(w | \alpha, \eta) \geq L(w,\phi,\gamma,\lambda) \overset{\triangle}{=}
+        E_{q}[\log\:p(w,z,\theta,\beta|\alpha,\eta)] - E_{q}[\log\:q(z, \theta, \beta)]
 
-Maximizing ELBO is equivalent to minimizing the Kullback-Leibler(KL) divergence
-between :math:`q(z,\theta,\beta)` and the true posterior
-:math:`p(z, \theta, \beta |w, \alpha, \eta)`.
+    Maximizing ELBO is equivalent to minimizing the Kullback-Leibler(KL) divergence
+    between :math:`q(z,\theta,\beta)` and the true posterior
+    :math:`p(z, \theta, \beta |w, \alpha, \eta)`.
 
-|details-end|
 
 :class:`LatentDirichletAllocation` implements the online variational Bayes
 algorithm and supports both online and batch update methods.
@@ -1087,27 +1071,27 @@ can be calculated from ``transform`` method.
 :class:`LatentDirichletAllocation` also implements ``partial_fit`` method. This is used
 when data can be fetched sequentially.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_applications_plot_topics_extraction_with_nmf_lda.py`
+* :ref:`sphx_glr_auto_examples_applications_plot_topics_extraction_with_nmf_lda.py`
 
-.. topic:: References:
+.. rubric:: References
 
-    * `"Latent Dirichlet Allocation"
-      <https://www.jmlr.org/papers/volume3/blei03a/blei03a.pdf>`_
-      D. Blei, A. Ng, M. Jordan, 2003
+* `"Latent Dirichlet Allocation"
+  <https://www.jmlr.org/papers/volume3/blei03a/blei03a.pdf>`_
+  D. Blei, A. Ng, M. Jordan, 2003
 
-    * `"Online Learning for Latent Dirichlet Allocation”
-      <https://papers.nips.cc/paper/3902-online-learning-for-latent-dirichlet-allocation.pdf>`_
-      M. Hoffman, D. Blei, F. Bach, 2010
+* `"Online Learning for Latent Dirichlet Allocation”
+  <https://papers.nips.cc/paper/3902-online-learning-for-latent-dirichlet-allocation.pdf>`_
+  M. Hoffman, D. Blei, F. Bach, 2010
 
-    * `"Stochastic Variational Inference"
-      <https://www.cs.columbia.edu/~blei/papers/HoffmanBleiWangPaisley2013.pdf>`_
-      M. Hoffman, D. Blei, C. Wang, J. Paisley, 2013
+* `"Stochastic Variational Inference"
+  <https://www.cs.columbia.edu/~blei/papers/HoffmanBleiWangPaisley2013.pdf>`_
+  M. Hoffman, D. Blei, C. Wang, J. Paisley, 2013
 
-    * `"The varimax criterion for analytic rotation in factor analysis"
-      <https://link.springer.com/article/10.1007%2FBF02289233>`_
-      H. F. Kaiser, 1958
+* `"The varimax criterion for analytic rotation in factor analysis"
+  <https://link.springer.com/article/10.1007%2FBF02289233>`_
+  H. F. Kaiser, 1958
 
 See also :ref:`nca_dim_reduction` for dimensionality reduction with
 Neighborhood Components Analysis.
diff --git a/doc/modules/density.rst b/doc/modules/density.rst
index 5a9b456010aa3..39264f226185d 100644
--- a/doc/modules/density.rst
+++ b/doc/modules/density.rst
@@ -113,37 +113,34 @@ forms, which are shown in the following figure:
 
 .. centered:: |kde_kernels|
 
-|details-start|
-**kernels' mathematical expressions**
-|details-split|
+.. dropdown:: Kernels' mathematical expressions
 
-The form of these kernels is as follows:
+  The form of these kernels is as follows:
 
-* Gaussian kernel (``kernel = 'gaussian'``)
+  * Gaussian kernel (``kernel = 'gaussian'``)
 
-  :math:`K(x; h) \propto \exp(- \frac{x^2}{2h^2} )`
+    :math:`K(x; h) \propto \exp(- \frac{x^2}{2h^2} )`
 
-* Tophat kernel (``kernel = 'tophat'``)
+  * Tophat kernel (``kernel = 'tophat'``)
 
-  :math:`K(x; h) \propto 1` if :math:`x < h`
+    :math:`K(x; h) \propto 1` if :math:`x < h`
 
-* Epanechnikov kernel (``kernel = 'epanechnikov'``)
+  * Epanechnikov kernel (``kernel = 'epanechnikov'``)
 
-  :math:`K(x; h) \propto 1 - \frac{x^2}{h^2}`
+    :math:`K(x; h) \propto 1 - \frac{x^2}{h^2}`
 
-* Exponential kernel (``kernel = 'exponential'``)
+  * Exponential kernel (``kernel = 'exponential'``)
 
-  :math:`K(x; h) \propto \exp(-x/h)`
+    :math:`K(x; h) \propto \exp(-x/h)`
 
-* Linear kernel (``kernel = 'linear'``)
+  * Linear kernel (``kernel = 'linear'``)
 
-  :math:`K(x; h) \propto 1 - x/h` if :math:`x < h`
+    :math:`K(x; h) \propto 1 - x/h` if :math:`x < h`
 
-* Cosine kernel (``kernel = 'cosine'``)
+  * Cosine kernel (``kernel = 'cosine'``)
 
-  :math:`K(x; h) \propto \cos(\frac{\pi x}{2h})` if :math:`x < h`
+    :math:`K(x; h) \propto \cos(\frac{\pi x}{2h})` if :math:`x < h`
 
-|details-end|
 
 The kernel density estimator can be used with any of the valid distance
 metrics (see :class:`~sklearn.metrics.DistanceMetric` for a list of
@@ -177,14 +174,14 @@ on a PCA projection of the data:
 The "new" data consists of linear combinations of the input data, with weights
 probabilistically drawn given the KDE model.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_neighbors_plot_kde_1d.py`: computation of simple kernel
-    density estimates in one dimension.
+* :ref:`sphx_glr_auto_examples_neighbors_plot_kde_1d.py`: computation of simple kernel
+  density estimates in one dimension.
 
-  * :ref:`sphx_glr_auto_examples_neighbors_plot_digits_kde_sampling.py`: an example of using
-    Kernel Density estimation to learn a generative model of the hand-written
-    digits data, and drawing new samples from this model.
+* :ref:`sphx_glr_auto_examples_neighbors_plot_digits_kde_sampling.py`: an example of using
+  Kernel Density estimation to learn a generative model of the hand-written
+  digits data, and drawing new samples from this model.
 
-  * :ref:`sphx_glr_auto_examples_neighbors_plot_species_kde.py`: an example of Kernel Density
-    estimation using the Haversine distance metric to visualize geospatial data
+* :ref:`sphx_glr_auto_examples_neighbors_plot_species_kde.py`: an example of Kernel Density
+  estimation using the Haversine distance metric to visualize geospatial data
diff --git a/doc/modules/ensemble.rst b/doc/modules/ensemble.rst
index 4237d023973f7..08c831431d197 100644
--- a/doc/modules/ensemble.rst
+++ b/doc/modules/ensemble.rst
@@ -18,10 +18,6 @@ trees, in averaging methods such as :ref:`Bagging methods <bagging>`,
 :ref:`model stacking <stacking>`, or :ref:`Voting <voting_classifier>`, or in
 boosting, as :ref:`AdaBoost <adaboost>`.
 
-.. contents::
-    :local:
-    :depth: 1
-
 .. _gradient_boosting:
 
 Gradient-boosted trees
@@ -78,10 +74,10 @@ estimators is slightly different, and some of the features from
 :class:`GradientBoostingClassifier` and :class:`GradientBoostingRegressor`
 are not yet supported, for instance some loss functions.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_inspection_plot_partial_dependence.py`
-  * :ref:`sphx_glr_auto_examples_ensemble_plot_forest_hist_grad_boosting_comparison.py`
+* :ref:`sphx_glr_auto_examples_inspection_plot_partial_dependence.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_forest_hist_grad_boosting_comparison.py`
 
 Usage
 ^^^^^
@@ -126,43 +122,40 @@ in [XGBoost]_):
 
     \mathcal{L}(\phi) =  \sum_i l(\hat{y}_i, y_i) + \frac12 \sum_k \lambda ||w_k||^2
 
-|details-start|
-**Details on l2 regularization**:
-|details-split|
-
-It is important to notice that the loss term :math:`l(\hat{y}_i, y_i)` describes
-only half of the actual loss function except for the pinball loss and absolute
-error.
-
-The index :math:`k` refers to the k-th tree in the ensemble of trees. In the
-case of regression and binary classification, gradient boosting models grow one
-tree per iteration, then :math:`k` runs up to `max_iter`. In the case of
-multiclass classification problems, the maximal value of the index :math:`k` is
-`n_classes` :math:`\times` `max_iter`.
-
-If :math:`T_k` denotes the number of leaves in the k-th tree, then :math:`w_k`
-is a vector of length :math:`T_k`, which contains the leaf values of the form `w
-= -sum_gradient / (sum_hessian + l2_regularization)` (see equation (5) in
-[XGBoost]_).
-
-The leaf values :math:`w_k` are derived by dividing the sum of the gradients of
-the loss function by the combined sum of hessians. Adding the regularization to
-the denominator penalizes the leaves with small hessians (flat regions),
-resulting in smaller updates. Those :math:`w_k` values contribute then to the
-model's prediction for a given input that ends up in the corresponding leaf. The
-final prediction is the sum of the base prediction and the contributions from
-each tree. The result of that sum is then transformed by the inverse link
-function depending on the choice of the loss function (see
-:ref:`gradient_boosting_formulation`).
-
-Notice that the original paper [XGBoost]_ introduces a term :math:`\gamma\sum_k
-T_k` that penalizes the number of leaves (making it a smooth version of
-`max_leaf_nodes`) not presented here as it is not implemented in scikit-learn;
-whereas :math:`\lambda` penalizes the magnitude of the individual tree
-predictions before being rescaled by the learning rate, see
-:ref:`gradient_boosting_shrinkage`.
-
-|details-end|
+.. dropdown:: Details on l2 regularization
+
+  It is important to notice that the loss term :math:`l(\hat{y}_i, y_i)` describes
+  only half of the actual loss function except for the pinball loss and absolute
+  error.
+
+  The index :math:`k` refers to the k-th tree in the ensemble of trees. In the
+  case of regression and binary classification, gradient boosting models grow one
+  tree per iteration, then :math:`k` runs up to `max_iter`. In the case of
+  multiclass classification problems, the maximal value of the index :math:`k` is
+  `n_classes` :math:`\times` `max_iter`.
+
+  If :math:`T_k` denotes the number of leaves in the k-th tree, then :math:`w_k`
+  is a vector of length :math:`T_k`, which contains the leaf values of the form `w
+  = -sum_gradient / (sum_hessian + l2_regularization)` (see equation (5) in
+  [XGBoost]_).
+
+  The leaf values :math:`w_k` are derived by dividing the sum of the gradients of
+  the loss function by the combined sum of hessians. Adding the regularization to
+  the denominator penalizes the leaves with small hessians (flat regions),
+  resulting in smaller updates. Those :math:`w_k` values contribute then to the
+  model's prediction for a given input that ends up in the corresponding leaf. The
+  final prediction is the sum of the base prediction and the contributions from
+  each tree. The result of that sum is then transformed by the inverse link
+  function depending on the choice of the loss function (see
+  :ref:`gradient_boosting_formulation`).
+
+  Notice that the original paper [XGBoost]_ introduces a term :math:`\gamma\sum_k
+  T_k` that penalizes the number of leaves (making it a smooth version of
+  `max_leaf_nodes`) not presented here as it is not implemented in scikit-learn;
+  whereas :math:`\lambda` penalizes the magnitude of the individual tree
+  predictions before being rescaled by the learning rate, see
+  :ref:`gradient_boosting_shrinkage`.
+
 
 Note that **early-stopping is enabled by default if the number of samples is
 larger than 10,000**. The early-stopping behaviour is controlled via the
@@ -213,9 +206,9 @@ If no missing values were encountered for a given feature during training,
 then samples with missing values are mapped to whichever child has the most
 samples.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_ensemble_plot_hgbt_regression.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_hgbt_regression.py`
 
 .. _sw_hgbdt:
 
@@ -302,30 +295,25 @@ the most samples (just like for continuous features). When predicting,
 categories that were not seen during fit time will be treated as missing
 values.
 
-|details-start|
-**Split finding with categorical features**:
-|details-split|
+.. dropdown:: Split finding with categorical features
 
-The canonical way of considering
-categorical splits in a tree is to consider
-all of the :math:`2^{K - 1} - 1` partitions, where :math:`K` is the number of
-categories. This can quickly become prohibitive when :math:`K` is large.
-Fortunately, since gradient boosting trees are always regression trees (even
-for classification problems), there exist a faster strategy that can yield
-equivalent splits. First, the categories of a feature are sorted according to
-the variance of the target, for each category `k`. Once the categories are
-sorted, one can consider *continuous partitions*, i.e. treat the categories
-as if they were ordered continuous values (see Fisher [Fisher1958]_ for a
-formal proof). As a result, only :math:`K - 1` splits need to be considered
-instead of :math:`2^{K - 1} - 1`. The initial sorting is a
-:math:`\mathcal{O}(K \log(K))` operation, leading to a total complexity of
-:math:`\mathcal{O}(K \log(K) + K)`, instead of :math:`\mathcal{O}(2^K)`.
+  The canonical way of considering categorical splits in a tree is to consider
+  all of the :math:`2^{K - 1} - 1` partitions, where :math:`K` is the number of
+  categories. This can quickly become prohibitive when :math:`K` is large.
+  Fortunately, since gradient boosting trees are always regression trees (even
+  for classification problems), there exist a faster strategy that can yield
+  equivalent splits. First, the categories of a feature are sorted according to
+  the variance of the target, for each category `k`. Once the categories are
+  sorted, one can consider *continuous partitions*, i.e. treat the categories
+  as if they were ordered continuous values (see Fisher [Fisher1958]_ for a
+  formal proof). As a result, only :math:`K - 1` splits need to be considered
+  instead of :math:`2^{K - 1} - 1`. The initial sorting is a
+  :math:`\mathcal{O}(K \log(K))` operation, leading to a total complexity of
+  :math:`\mathcal{O}(K \log(K) + K)`, instead of :math:`\mathcal{O}(2^K)`.
 
-|details-end|
+.. rubric:: Examples
 
-.. topic:: Examples:
-
-  * :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_categorical.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_categorical.py`
 
 .. _monotonic_cst_gbdt:
 
@@ -378,10 +366,10 @@ Also, monotonic constraints are not supported for multiclass classification.
     Since categories are unordered quantities, it is not possible to enforce
     monotonic constraints on categorical features.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_ensemble_plot_monotonic_constraints.py`
-  * :ref:`sphx_glr_auto_examples_ensemble_plot_hgbt_regression.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_monotonic_constraints.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_hgbt_regression.py`
 
 .. _interaction_cst_hgbt:
 
@@ -414,16 +402,16 @@ Note that features not listed in ``interaction_cst`` are automatically
 assigned an interaction group for themselves. With again 3 features, this
 means that ``[{0}]`` is equivalent to ``[{0}, {1, 2}]``.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_inspection_plot_partial_dependence.py`
+* :ref:`sphx_glr_auto_examples_inspection_plot_partial_dependence.py`
 
-.. topic:: References
+.. rubric:: References
 
-  .. [Mayer2022] M. Mayer, S.C. Bourassa, M. Hoesli, and D.F. Scognamiglio.
-     2022. :doi:`Machine Learning Applications to Land and Structure Valuation
-     <10.3390/jrfm15050193>`.
-     Journal of Risk and Financial Management 15, no. 5: 193
+.. [Mayer2022] M. Mayer, S.C. Bourassa, M. Hoesli, and D.F. Scognamiglio.
+    2022. :doi:`Machine Learning Applications to Land and Structure Valuation
+    <10.3390/jrfm15050193>`.
+    Journal of Risk and Financial Management 15, no. 5: 193
 
 Low-level parallelism
 ^^^^^^^^^^^^^^^^^^^^^
@@ -479,18 +467,18 @@ Finally, many parts of the implementation of
 :class:`HistGradientBoostingClassifier` and
 :class:`HistGradientBoostingRegressor` are parallelized.
 
-.. topic:: References
+.. rubric:: References
 
-  .. [XGBoost] Tianqi Chen, Carlos Guestrin, :arxiv:`"XGBoost: A Scalable Tree
-     Boosting System" <1603.02754>`
+.. [XGBoost] Tianqi Chen, Carlos Guestrin, :arxiv:`"XGBoost: A Scalable Tree
+   Boosting System" <1603.02754>`
 
-  .. [LightGBM] Ke et. al. `"LightGBM: A Highly Efficient Gradient
-     BoostingDecision Tree" <https://papers.nips.cc/paper/
-     6907-lightgbm-a-highly-efficient-gradient-boosting-decision-tree>`_
+.. [LightGBM] Ke et. al. `"LightGBM: A Highly Efficient Gradient
+   BoostingDecision Tree" <https://papers.nips.cc/paper/
+   6907-lightgbm-a-highly-efficient-gradient-boosting-decision-tree>`_
 
-  .. [Fisher1958] Fisher, W.D. (1958). `"On Grouping for Maximum Homogeneity"
-     <http://csiss.ncgia.ucsb.edu/SPACE/workshops/2004/SAC/files/fisher.pdf>`_
-     Journal of the American Statistical Association, 53, 789-798.
+.. [Fisher1958] Fisher, W.D. (1958). `"On Grouping for Maximum Homogeneity"
+   <http://csiss.ncgia.ucsb.edu/SPACE/workshops/2004/SAC/files/fisher.pdf>`_
+   Journal of the American Statistical Association, 53, 789-798.
 
 
 
@@ -501,96 +489,88 @@ The usage and the parameters of :class:`GradientBoostingClassifier` and
 :class:`GradientBoostingRegressor` are described below. The 2 most important
 parameters of these estimators are `n_estimators` and `learning_rate`.
 
-|details-start|
-**Classification**
-|details-split|
-
-:class:`GradientBoostingClassifier` supports both binary and multi-class
-classification.
-The following example shows how to fit a gradient boosting classifier
-with 100 decision stumps as weak learners::
-
-    >>> from sklearn.datasets import make_hastie_10_2
-    >>> from sklearn.ensemble import GradientBoostingClassifier
-
-    >>> X, y = make_hastie_10_2(random_state=0)
-    >>> X_train, X_test = X[:2000], X[2000:]
-    >>> y_train, y_test = y[:2000], y[2000:]
-
-    >>> clf = GradientBoostingClassifier(n_estimators=100, learning_rate=1.0,
-    ...     max_depth=1, random_state=0).fit(X_train, y_train)
-    >>> clf.score(X_test, y_test)
-    0.913...
-
-The number of weak learners (i.e. regression trees) is controlled by the
-parameter ``n_estimators``; :ref:`The size of each tree
-<gradient_boosting_tree_size>` can be controlled either by setting the tree
-depth via ``max_depth`` or by setting the number of leaf nodes via
-``max_leaf_nodes``. The ``learning_rate`` is a hyper-parameter in the range
-(0.0, 1.0] that controls overfitting via :ref:`shrinkage
-<gradient_boosting_shrinkage>` .
-
-.. note::
-
-   Classification with more than 2 classes requires the induction
-   of ``n_classes`` regression trees at each iteration,
-   thus, the total number of induced trees equals
-   ``n_classes * n_estimators``. For datasets with a large number
-   of classes we strongly recommend to use
-   :class:`HistGradientBoostingClassifier` as an alternative to
-   :class:`GradientBoostingClassifier` .
-
-|details-end|
-
-|details-start|
-**Regression**
-|details-split|
-
-:class:`GradientBoostingRegressor` supports a number of
-:ref:`different loss functions <gradient_boosting_loss>`
-for regression which can be specified via the argument
-``loss``; the default loss function for regression is squared error
-(``'squared_error'``).
-
-::
-
-    >>> import numpy as np
-    >>> from sklearn.metrics import mean_squared_error
-    >>> from sklearn.datasets import make_friedman1
-    >>> from sklearn.ensemble import GradientBoostingRegressor
-
-    >>> X, y = make_friedman1(n_samples=1200, random_state=0, noise=1.0)
-    >>> X_train, X_test = X[:200], X[200:]
-    >>> y_train, y_test = y[:200], y[200:]
-    >>> est = GradientBoostingRegressor(
-    ...     n_estimators=100, learning_rate=0.1, max_depth=1, random_state=0,
-    ...     loss='squared_error'
-    ... ).fit(X_train, y_train)
-    >>> mean_squared_error(y_test, est.predict(X_test))
-    5.00...
-
-The figure below shows the results of applying :class:`GradientBoostingRegressor`
-with least squares loss and 500 base learners to the diabetes dataset
-(:func:`sklearn.datasets.load_diabetes`).
-The plot shows the train and test error at each iteration.
-The train error at each iteration is stored in the
-`train_score_` attribute of the gradient boosting model.
-The test error at each iterations can be obtained
-via the :meth:`~GradientBoostingRegressor.staged_predict` method which returns a
-generator that yields the predictions at each stage. Plots like these can be used
-to determine the optimal number of trees (i.e. ``n_estimators``) by early stopping.
-
-.. figure:: ../auto_examples/ensemble/images/sphx_glr_plot_gradient_boosting_regression_001.png
-   :target: ../auto_examples/ensemble/plot_gradient_boosting_regression.html
-   :align: center
-   :scale: 75
-
-|details-end|
+.. dropdown:: Classification
+
+  :class:`GradientBoostingClassifier` supports both binary and multi-class
+  classification.
+  The following example shows how to fit a gradient boosting classifier
+  with 100 decision stumps as weak learners::
+
+      >>> from sklearn.datasets import make_hastie_10_2
+      >>> from sklearn.ensemble import GradientBoostingClassifier
+
+      >>> X, y = make_hastie_10_2(random_state=0)
+      >>> X_train, X_test = X[:2000], X[2000:]
+      >>> y_train, y_test = y[:2000], y[2000:]
+
+      >>> clf = GradientBoostingClassifier(n_estimators=100, learning_rate=1.0,
+      ...     max_depth=1, random_state=0).fit(X_train, y_train)
+      >>> clf.score(X_test, y_test)
+      0.913...
+
+  The number of weak learners (i.e. regression trees) is controlled by the
+  parameter ``n_estimators``; :ref:`The size of each tree
+  <gradient_boosting_tree_size>` can be controlled either by setting the tree
+  depth via ``max_depth`` or by setting the number of leaf nodes via
+  ``max_leaf_nodes``. The ``learning_rate`` is a hyper-parameter in the range
+  (0.0, 1.0] that controls overfitting via :ref:`shrinkage
+  <gradient_boosting_shrinkage>` .
+
+  .. note::
+
+    Classification with more than 2 classes requires the induction
+    of ``n_classes`` regression trees at each iteration,
+    thus, the total number of induced trees equals
+    ``n_classes * n_estimators``. For datasets with a large number
+    of classes we strongly recommend to use
+    :class:`HistGradientBoostingClassifier` as an alternative to
+    :class:`GradientBoostingClassifier` .
+
+.. dropdown:: Regression
+
+  :class:`GradientBoostingRegressor` supports a number of
+  :ref:`different loss functions <gradient_boosting_loss>`
+  for regression which can be specified via the argument
+  ``loss``; the default loss function for regression is squared error
+  (``'squared_error'``).
+
+  ::
+
+      >>> import numpy as np
+      >>> from sklearn.metrics import mean_squared_error
+      >>> from sklearn.datasets import make_friedman1
+      >>> from sklearn.ensemble import GradientBoostingRegressor
+
+      >>> X, y = make_friedman1(n_samples=1200, random_state=0, noise=1.0)
+      >>> X_train, X_test = X[:200], X[200:]
+      >>> y_train, y_test = y[:200], y[200:]
+      >>> est = GradientBoostingRegressor(
+      ...     n_estimators=100, learning_rate=0.1, max_depth=1, random_state=0,
+      ...     loss='squared_error'
+      ... ).fit(X_train, y_train)
+      >>> mean_squared_error(y_test, est.predict(X_test))
+      5.00...
+
+  The figure below shows the results of applying :class:`GradientBoostingRegressor`
+  with least squares loss and 500 base learners to the diabetes dataset
+  (:func:`sklearn.datasets.load_diabetes`).
+  The plot shows the train and test error at each iteration.
+  The train error at each iteration is stored in the
+  `train_score_` attribute of the gradient boosting model.
+  The test error at each iterations can be obtained
+  via the :meth:`~GradientBoostingRegressor.staged_predict` method which returns a
+  generator that yields the predictions at each stage. Plots like these can be used
+  to determine the optimal number of trees (i.e. ``n_estimators``) by early stopping.
+
+  .. figure:: ../auto_examples/ensemble/images/sphx_glr_plot_gradient_boosting_regression_001.png
+    :target: ../auto_examples/ensemble/plot_gradient_boosting_regression.html
+    :align: center
+    :scale: 75
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_regression.py`
- * :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_oob.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_regression.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_oob.py`
 
 .. _gradient_boosting_warm_start:
 
@@ -603,7 +583,22 @@ fitted model.
 
 ::
 
-  >>> _ = est.set_params(n_estimators=200, warm_start=True)  # set warm_start and new nr of trees
+  >>> import numpy as np
+  >>> from sklearn.metrics import mean_squared_error
+  >>> from sklearn.datasets import make_friedman1
+  >>> from sklearn.ensemble import GradientBoostingRegressor
+
+  >>> X, y = make_friedman1(n_samples=1200, random_state=0, noise=1.0)
+  >>> X_train, X_test = X[:200], X[200:]
+  >>> y_train, y_test = y[:200], y[200:]
+  >>> est = GradientBoostingRegressor(
+  ...     n_estimators=100, learning_rate=0.1, max_depth=1, random_state=0,
+  ...     loss='squared_error'
+  ... )
+  >>> est = est.fit(X_train, y_train)  # fit with 100 trees
+  >>> mean_squared_error(y_test, est.predict(X_test))
+  5.00...
+  >>> _ = est.set_params(n_estimators=200, warm_start=True)  # set warm_start and increase num of trees
   >>> _ = est.fit(X_train, y_train) # fit additional 100 trees to est
   >>> mean_squared_error(y_test, est.predict(X_test))
   3.84...
@@ -645,116 +640,108 @@ Mathematical formulation
 We first present GBRT for regression, and then detail the classification
 case.
 
-|details-start|
-**Regression**
-|details-split|
+.. dropdown:: Regression
 
-GBRT regressors are additive models whose prediction :math:`\hat{y}_i` for a
-given input :math:`x_i` is of the following form:
+  GBRT regressors are additive models whose prediction :math:`\hat{y}_i` for a
+  given input :math:`x_i` is of the following form:
 
-.. math::
-
-  \hat{y}_i = F_M(x_i) = \sum_{m=1}^{M} h_m(x_i)
+  .. math::
 
-where the :math:`h_m` are estimators called *weak learners* in the context
-of boosting. Gradient Tree Boosting uses :ref:`decision tree regressors
-<tree>` of fixed size as weak learners. The constant M corresponds to the
-`n_estimators` parameter.
+    \hat{y}_i = F_M(x_i) = \sum_{m=1}^{M} h_m(x_i)
 
-Similar to other boosting algorithms, a GBRT is built in a greedy fashion:
+  where the :math:`h_m` are estimators called *weak learners* in the context
+  of boosting. Gradient Tree Boosting uses :ref:`decision tree regressors
+  <tree>` of fixed size as weak learners. The constant M corresponds to the
+  `n_estimators` parameter.
 
-.. math::
+  Similar to other boosting algorithms, a GBRT is built in a greedy fashion:
 
-  F_m(x) = F_{m-1}(x) + h_m(x),
-
-where the newly added tree :math:`h_m` is fitted in order to minimize a sum
-of losses :math:`L_m`, given the previous ensemble :math:`F_{m-1}`:
+  .. math::
 
-.. math::
+    F_m(x) = F_{m-1}(x) + h_m(x),
 
-  h_m =  \arg\min_{h} L_m = \arg\min_{h} \sum_{i=1}^{n}
-  l(y_i, F_{m-1}(x_i) + h(x_i)),
+  where the newly added tree :math:`h_m` is fitted in order to minimize a sum
+  of losses :math:`L_m`, given the previous ensemble :math:`F_{m-1}`:
 
-where :math:`l(y_i, F(x_i))` is defined by the `loss` parameter, detailed
-in the next section.
+  .. math::
 
-By default, the initial model :math:`F_{0}` is chosen as the constant that
-minimizes the loss: for a least-squares loss, this is the empirical mean of
-the target values. The initial model can also be specified via the ``init``
-argument.
+    h_m =  \arg\min_{h} L_m = \arg\min_{h} \sum_{i=1}^{n}
+    l(y_i, F_{m-1}(x_i) + h(x_i)),
 
-Using a first-order Taylor approximation, the value of :math:`l` can be
-approximated as follows:
+  where :math:`l(y_i, F(x_i))` is defined by the `loss` parameter, detailed
+  in the next section.
 
-.. math::
+  By default, the initial model :math:`F_{0}` is chosen as the constant that
+  minimizes the loss: for a least-squares loss, this is the empirical mean of
+  the target values. The initial model can also be specified via the ``init``
+  argument.
 
-  l(y_i, F_{m-1}(x_i) + h_m(x_i)) \approx
-  l(y_i, F_{m-1}(x_i))
-  + h_m(x_i)
-  \left[ \frac{\partial l(y_i, F(x_i))}{\partial F(x_i)} \right]_{F=F_{m - 1}}.
+  Using a first-order Taylor approximation, the value of :math:`l` can be
+  approximated as follows:
 
-.. note::
+  .. math::
 
-  Briefly, a first-order Taylor approximation says that
-  :math:`l(z) \approx l(a) + (z - a) \frac{\partial l}{\partial z}(a)`.
-  Here, :math:`z` corresponds to :math:`F_{m - 1}(x_i) + h_m(x_i)`, and
-  :math:`a` corresponds to :math:`F_{m-1}(x_i)`
+    l(y_i, F_{m-1}(x_i) + h_m(x_i)) \approx
+    l(y_i, F_{m-1}(x_i))
+    + h_m(x_i)
+    \left[ \frac{\partial l(y_i, F(x_i))}{\partial F(x_i)} \right]_{F=F_{m - 1}}.
 
-The quantity :math:`\left[ \frac{\partial l(y_i, F(x_i))}{\partial F(x_i)}
-\right]_{F=F_{m - 1}}` is the derivative of the loss with respect to its
-second parameter, evaluated at :math:`F_{m-1}(x)`. It is easy to compute for
-any given :math:`F_{m - 1}(x_i)` in a closed form since the loss is
-differentiable. We will denote it by :math:`g_i`.
+  .. note::
 
-Removing the constant terms, we have:
+    Briefly, a first-order Taylor approximation says that
+    :math:`l(z) \approx l(a) + (z - a) \frac{\partial l}{\partial z}(a)`.
+    Here, :math:`z` corresponds to :math:`F_{m - 1}(x_i) + h_m(x_i)`, and
+    :math:`a` corresponds to :math:`F_{m-1}(x_i)`
 
-.. math::
+  The quantity :math:`\left[ \frac{\partial l(y_i, F(x_i))}{\partial F(x_i)}
+  \right]_{F=F_{m - 1}}` is the derivative of the loss with respect to its
+  second parameter, evaluated at :math:`F_{m-1}(x)`. It is easy to compute for
+  any given :math:`F_{m - 1}(x_i)` in a closed form since the loss is
+  differentiable. We will denote it by :math:`g_i`.
 
-  h_m \approx \arg\min_{h} \sum_{i=1}^{n} h(x_i) g_i
+  Removing the constant terms, we have:
 
-This is minimized if :math:`h(x_i)` is fitted to predict a value that is
-proportional to the negative gradient :math:`-g_i`. Therefore, at each
-iteration, **the estimator** :math:`h_m` **is fitted to predict the negative
-gradients of the samples**. The gradients are updated at each iteration.
-This can be considered as some kind of gradient descent in a functional
-space.
+  .. math::
 
-.. note::
+    h_m \approx \arg\min_{h} \sum_{i=1}^{n} h(x_i) g_i
 
-  For some losses, e.g. ``'absolute_error'`` where the gradients
-  are :math:`\pm 1`, the values predicted by a fitted :math:`h_m` are not
-  accurate enough: the tree can only output integer values. As a result, the
-  leaves values of the tree :math:`h_m` are modified once the tree is
-  fitted, such that the leaves values minimize the loss :math:`L_m`. The
-  update is loss-dependent: for the absolute error loss, the value of
-  a leaf is updated to the median of the samples in that leaf.
+  This is minimized if :math:`h(x_i)` is fitted to predict a value that is
+  proportional to the negative gradient :math:`-g_i`. Therefore, at each
+  iteration, **the estimator** :math:`h_m` **is fitted to predict the negative
+  gradients of the samples**. The gradients are updated at each iteration.
+  This can be considered as some kind of gradient descent in a functional
+  space.
 
-|details-end|
+  .. note::
 
-|details-start|
-**Classification**
-|details-split|
+    For some losses, e.g. ``'absolute_error'`` where the gradients
+    are :math:`\pm 1`, the values predicted by a fitted :math:`h_m` are not
+    accurate enough: the tree can only output integer values. As a result, the
+    leaves values of the tree :math:`h_m` are modified once the tree is
+    fitted, such that the leaves values minimize the loss :math:`L_m`. The
+    update is loss-dependent: for the absolute error loss, the value of
+    a leaf is updated to the median of the samples in that leaf.
 
-Gradient boosting for classification is very similar to the regression case.
-However, the sum of the trees :math:`F_M(x_i) = \sum_m h_m(x_i)` is not
-homogeneous to a prediction: it cannot be a class, since the trees predict
-continuous values.
+.. dropdown:: Classification
 
-The mapping from the value :math:`F_M(x_i)` to a class or a probability is
-loss-dependent. For the log-loss, the probability that
-:math:`x_i` belongs to the positive class is modeled as :math:`p(y_i = 1 |
-x_i) = \sigma(F_M(x_i))` where :math:`\sigma` is the sigmoid or expit function.
+  Gradient boosting for classification is very similar to the regression case.
+  However, the sum of the trees :math:`F_M(x_i) = \sum_m h_m(x_i)` is not
+  homogeneous to a prediction: it cannot be a class, since the trees predict
+  continuous values.
 
-For multiclass classification, K trees (for K classes) are built at each of
-the :math:`M` iterations. The probability that :math:`x_i` belongs to class
-k is modeled as a softmax of the :math:`F_{M,k}(x_i)` values.
+  The mapping from the value :math:`F_M(x_i)` to a class or a probability is
+  loss-dependent. For the log-loss, the probability that
+  :math:`x_i` belongs to the positive class is modeled as :math:`p(y_i = 1 |
+  x_i) = \sigma(F_M(x_i))` where :math:`\sigma` is the sigmoid or expit function.
 
-Note that even for a classification task, the :math:`h_m` sub-estimator is
-still a regressor, not a classifier. This is because the sub-estimators are
-trained to predict (negative) *gradients*, which are always continuous
-quantities.
+  For multiclass classification, K trees (for K classes) are built at each of
+  the :math:`M` iterations. The probability that :math:`x_i` belongs to class
+  k is modeled as a softmax of the :math:`F_{M,k}(x_i)` values.
 
-|details-end|
+  Note that even for a classification task, the :math:`h_m` sub-estimator is
+  still a regressor, not a classifier. This is because the sub-estimators are
+  trained to predict (negative) *gradients*, which are always continuous
+  quantities.
 
 .. _gradient_boosting_loss:
 
@@ -764,9 +751,7 @@ Loss Functions
 The following loss functions are supported and can be specified using
 the parameter ``loss``:
 
-|details-start|
-**Regression**
-|details-split|
+.. dropdown:: Regression
 
   * Squared error (``'squared_error'``): The natural choice for regression
     due to its superior computational properties. The initial model is
@@ -783,12 +768,7 @@ the parameter ``loss``:
     can be used to create prediction intervals
     (see :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_quantile.py`).
 
-|details-end|
-
-
-|details-start|
-**Classification**
-|details-split|
+.. dropdown:: Classification
 
   * Binary log-loss (``'log-loss'``): The binomial
     negative log-likelihood loss function for binary classification. It provides
@@ -806,8 +786,6 @@ the parameter ``loss``:
     examples than ``'log-loss'``; can only be used for binary
     classification.
 
-|details-end|
-
 .. _gradient_boosting_shrinkage:
 
 Shrinkage via learning rate
@@ -874,11 +852,11 @@ the optimal number of iterations. OOB estimates are usually very pessimistic thu
 we recommend to use cross-validation instead and only use OOB if cross-validation
 is too time consuming.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_regularization.py`
- * :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_oob.py`
- * :ref:`sphx_glr_auto_examples_ensemble_plot_ensemble_oob.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_regularization.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_oob.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_ensemble_oob.py`
 
 Interpretation with feature importance
 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
@@ -921,22 +899,22 @@ Note that this computation of feature importance is based on entropy, and it
 is distinct from :func:`sklearn.inspection.permutation_importance` which is
 based on permutation of the features.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_regression.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_regression.py`
 
-.. topic:: References
+.. rubric:: References
 
-  .. [Friedman2001] Friedman, J.H. (2001). :doi:`Greedy function approximation: A gradient
-      boosting machine <10.1214/aos/1013203451>`.
-      Annals of Statistics, 29, 1189-1232.
+.. [Friedman2001] Friedman, J.H. (2001). :doi:`Greedy function approximation: A gradient
+   boosting machine <10.1214/aos/1013203451>`.
+   Annals of Statistics, 29, 1189-1232.
 
-  .. [Friedman2002] Friedman, J.H. (2002). `Stochastic gradient boosting.
-     <https://statweb.stanford.edu/~jhf/ftp/stobst.pdf>`_.
-     Computational Statistics & Data Analysis, 38, 367-378.
+.. [Friedman2002] Friedman, J.H. (2002). `Stochastic gradient boosting.
+   <https://statweb.stanford.edu/~jhf/ftp/stobst.pdf>`_.
+   Computational Statistics & Data Analysis, 38, 367-378.
 
-  .. [R2007] G. Ridgeway (2006). `Generalized Boosted Models: A guide to the gbm
-     package <https://cran.r-project.org/web/packages/gbm/vignettes/gbm.pdf>`_
+.. [R2007] G. Ridgeway (2006). `Generalized Boosted Models: A guide to the gbm
+   package <https://cran.r-project.org/web/packages/gbm/vignettes/gbm.pdf>`_
 
 .. _forest:
 
@@ -1020,9 +998,9 @@ characteristics of the dataset and the modeling task. It's a good idea
 to try both models and compare their performance and computational efficiency
 on your specific problem to determine which model is the best fit.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_ensemble_plot_forest_hist_grad_boosting_comparison.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_forest_hist_grad_boosting_comparison.py`
 
 Extremely Randomized Trees
 --------------------------
@@ -1119,20 +1097,20 @@ fast). Significant speedup can still be achieved though when building
 a large number of trees, or when building a single tree requires a fair
 amount of time (e.g., on large datasets).
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_ensemble_plot_forest_iris.py`
- * :ref:`sphx_glr_auto_examples_ensemble_plot_forest_importances_faces.py`
- * :ref:`sphx_glr_auto_examples_miscellaneous_plot_multioutput_face_completion.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_forest_iris.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_forest_importances_faces.py`
+* :ref:`sphx_glr_auto_examples_miscellaneous_plot_multioutput_face_completion.py`
 
-.. topic:: References
+.. rubric:: References
 
- .. [B2001] L. Breiman, "Random Forests", Machine Learning, 45(1), 5-32, 2001.
+.. [B2001] L. Breiman, "Random Forests", Machine Learning, 45(1), 5-32, 2001.
 
- .. [B1998] L. Breiman, "Arcing Classifiers", Annals of Statistics 1998.
+.. [B1998] L. Breiman, "Arcing Classifiers", Annals of Statistics 1998.
 
- * P. Geurts, D. Ernst., and L. Wehenkel, "Extremely randomized
-   trees", Machine Learning, 63(1), 3-42, 2006.
+* P. Geurts, D. Ernst., and L. Wehenkel, "Extremely randomized
+  trees", Machine Learning, 63(1), 3-42, 2006.
 
 .. _random_forest_feature_importance:
 
@@ -1184,16 +1162,16 @@ In practice those estimates are stored as an attribute named
 the value, the more important is the contribution of the matching feature
 to the prediction function.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_ensemble_plot_forest_importances_faces.py`
- * :ref:`sphx_glr_auto_examples_ensemble_plot_forest_importances.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_forest_importances_faces.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_forest_importances.py`
 
-.. topic:: References
+.. rubric:: References
 
- .. [L2014] G. Louppe, :arxiv:`"Understanding Random Forests: From Theory to
-    Practice" <1407.7502>`,
-    PhD Thesis, U. of Liege, 2014.
+.. [L2014] G. Louppe, :arxiv:`"Understanding Random Forests: From Theory to
+   Practice" <1407.7502>`,
+   PhD Thesis, U. of Liege, 2014.
 
 .. _random_trees_embedding:
 
@@ -1216,15 +1194,15 @@ As neighboring data points are more likely to lie within the same leaf of a
 tree, the transformation performs an implicit, non-parametric density
 estimation.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_ensemble_plot_random_forest_embedding.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_random_forest_embedding.py`
 
- * :ref:`sphx_glr_auto_examples_manifold_plot_lle_digits.py` compares non-linear
-   dimensionality reduction techniques on handwritten digits.
+* :ref:`sphx_glr_auto_examples_manifold_plot_lle_digits.py` compares non-linear
+  dimensionality reduction techniques on handwritten digits.
 
- * :ref:`sphx_glr_auto_examples_ensemble_plot_feature_transformation.py` compares
-   supervised and unsupervised tree based feature transformations.
+* :ref:`sphx_glr_auto_examples_ensemble_plot_feature_transformation.py` compares
+  supervised and unsupervised tree based feature transformations.
 
 .. seealso::
 
@@ -1232,6 +1210,43 @@ estimation.
    representations of feature space, also these approaches focus also on
    dimensionality reduction.
 
+.. _tree_ensemble_warm_start:
+
+Fitting additional trees
+------------------------
+
+RandomForest, Extra-Trees and :class:`RandomTreesEmbedding` estimators all support
+``warm_start=True`` which allows you to add more trees to an already fitted model.
+
+::
+
+  >>> from sklearn.datasets import make_classification
+  >>> from sklearn.ensemble import RandomForestClassifier
+
+  >>> X, y = make_classification(n_samples=100, random_state=1)
+  >>> clf = RandomForestClassifier(n_estimators=10)
+  >>> clf = clf.fit(X, y)  # fit with 10 trees
+  >>> len(clf.estimators_)
+  10
+  >>> # set warm_start and increase num of estimators
+  >>> _ = clf.set_params(n_estimators=20, warm_start=True)
+  >>> _ = clf.fit(X, y) # fit additional 10 trees
+  >>> len(clf.estimators_)
+  20
+
+When ``random_state`` is also set, the internal random state is also preserved
+between ``fit`` calls. This means that training a model once with ``n`` estimators is
+the same as building the model iteratively via multiple ``fit`` calls, where the
+final number of estimators is equal to ``n``.
+
+::
+
+  >>> clf = RandomForestClassifier(n_estimators=20)  # set `n_estimators` to 10 + 10
+  >>> _ = clf.fit(X, y)  # fit `estimators_` will be the same as `clf` above
+
+Note that this differs from the usual behavior of :term:`random_state` in that it does
+*not* result in the same result across different calls.
+
 .. _bagging:
 
 Bagging meta-estimator
@@ -1283,24 +1298,23 @@ subsets of 50% of the samples and 50% of the features.
     >>> bagging = BaggingClassifier(KNeighborsClassifier(),
     ...                             max_samples=0.5, max_features=0.5)
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_ensemble_plot_bias_variance.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_bias_variance.py`
 
-.. topic:: References
+.. rubric:: References
 
-  .. [B1999] L. Breiman, "Pasting small votes for classification in large
-         databases and on-line", Machine Learning, 36(1), 85-103, 1999.
+.. [B1999] L. Breiman, "Pasting small votes for classification in large
+   databases and on-line", Machine Learning, 36(1), 85-103, 1999.
 
-  .. [B1996] L. Breiman, "Bagging predictors", Machine Learning, 24(2),
-         123-140, 1996.
+.. [B1996] L. Breiman, "Bagging predictors", Machine Learning, 24(2),
+   123-140, 1996.
 
-  .. [H1998] T. Ho, "The random subspace method for constructing decision
-         forests", Pattern Analysis and Machine Intelligence, 20(8), 832-844,
-         1998.
+.. [H1998] T. Ho, "The random subspace method for constructing decision
+   forests", Pattern Analysis and Machine Intelligence, 20(8), 832-844, 1998.
 
-  .. [LG2012] G. Louppe and P. Geurts, "Ensembles on Random Patches",
-         Machine Learning and Knowledge Discovery in Databases, 346-361, 2012.
+.. [LG2012] G. Louppe and P. Geurts, "Ensembles on Random Patches",
+   Machine Learning and Knowledge Discovery in Databases, 346-361, 2012.
 
 
 
@@ -1455,29 +1469,25 @@ Optionally, weights can be provided for the individual classifiers::
    ...     voting='soft', weights=[2,5,1]
    ... )
 
-|details-start|
-**Using the `VotingClassifier` with `GridSearchCV`**
-|details-split|
+.. dropdown:: Using the :class:`VotingClassifier` with :class:`~sklearn.model_selection.GridSearchCV`
 
-The :class:`VotingClassifier` can also be used together with
-:class:`~sklearn.model_selection.GridSearchCV` in order to tune the
-hyperparameters of the individual estimators::
+  The :class:`VotingClassifier` can also be used together with
+  :class:`~sklearn.model_selection.GridSearchCV` in order to tune the
+  hyperparameters of the individual estimators::
 
-   >>> from sklearn.model_selection import GridSearchCV
-   >>> clf1 = LogisticRegression(random_state=1)
-   >>> clf2 = RandomForestClassifier(random_state=1)
-   >>> clf3 = GaussianNB()
-   >>> eclf = VotingClassifier(
-   ...     estimators=[('lr', clf1), ('rf', clf2), ('gnb', clf3)],
-   ...     voting='soft'
-   ... )
-
-   >>> params = {'lr__C': [1.0, 100.0], 'rf__n_estimators': [20, 200]}
+    >>> from sklearn.model_selection import GridSearchCV
+    >>> clf1 = LogisticRegression(random_state=1)
+    >>> clf2 = RandomForestClassifier(random_state=1)
+    >>> clf3 = GaussianNB()
+    >>> eclf = VotingClassifier(
+    ...     estimators=[('lr', clf1), ('rf', clf2), ('gnb', clf3)],
+    ...     voting='soft'
+    ... )
 
-   >>> grid = GridSearchCV(estimator=eclf, param_grid=params, cv=5)
-   >>> grid = grid.fit(iris.data, iris.target)
+    >>> params = {'lr__C': [1.0, 100.0], 'rf__n_estimators': [20, 200]}
 
-|details-end|
+    >>> grid = GridSearchCV(estimator=eclf, param_grid=params, cv=5)
+    >>> grid = grid.fit(iris.data, iris.target)
 
 .. _voting_regressor:
 
@@ -1515,9 +1525,9 @@ The following example shows how to fit the VotingRegressor::
     :align: center
     :scale: 75%
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_ensemble_plot_voting_regressor.py`
+* :ref:`sphx_glr_auto_examples_ensemble_plot_voting_regressor.py`
 
 .. _stacking:
 
@@ -1581,8 +1591,8 @@ availability, tested in the order of preference: `predict_proba`,
 `decision_function` and `predict`.
 
 A :class:`StackingRegressor` and :class:`StackingClassifier` can be used as
-any other regressor or classifier, exposing a `predict`, `predict_proba`, and
-`decision_function` methods, e.g.::
+any other regressor or classifier, exposing a `predict`, `predict_proba`, or
+`decision_function` method, e.g.::
 
    >>> y_pred = reg.predict(X_test)
    >>> from sklearn.metrics import r2_score
@@ -1636,10 +1646,10 @@ computationally expensive.
     ...       .format(multi_layer_regressor.score(X_test, y_test)))
     R2 score: 0.53
 
-.. topic:: References
+.. rubric:: References
 
-   .. [W1992] Wolpert, David H. "Stacked generalization." Neural networks 5.2
-      (1992): 241-259.
+.. [W1992] Wolpert, David H. "Stacked generalization." Neural networks 5.2
+   (1992): 241-259.
 
 
 
@@ -1705,27 +1715,26 @@ The main parameters to tune to obtain good results are ``n_estimators`` and
 the complexity of the base estimators (e.g., its depth ``max_depth`` or
 minimum required number of samples to consider a split ``min_samples_split``).
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_ensemble_plot_adaboost_multiclass.py` shows the performance
-   of AdaBoost on a multi-class problem.
+* :ref:`sphx_glr_auto_examples_ensemble_plot_adaboost_multiclass.py` shows the performance
+  of AdaBoost on a multi-class problem.
 
- * :ref:`sphx_glr_auto_examples_ensemble_plot_adaboost_twoclass.py` shows the decision boundary
-   and decision function values for a non-linearly separable two-class problem
-   using AdaBoost-SAMME.
+* :ref:`sphx_glr_auto_examples_ensemble_plot_adaboost_twoclass.py` shows the decision boundary
+  and decision function values for a non-linearly separable two-class problem
+  using AdaBoost-SAMME.
 
- * :ref:`sphx_glr_auto_examples_ensemble_plot_adaboost_regression.py` demonstrates regression
-   with the AdaBoost.R2 algorithm.
+* :ref:`sphx_glr_auto_examples_ensemble_plot_adaboost_regression.py` demonstrates regression
+  with the AdaBoost.R2 algorithm.
 
-.. topic:: References
+.. rubric:: References
 
- .. [FS1995] Y. Freund, and R. Schapire, "A Decision-Theoretic Generalization of
-             On-Line Learning and an Application to Boosting", 1997.
+.. [FS1995] Y. Freund, and R. Schapire, "A Decision-Theoretic Generalization of
+   On-Line Learning and an Application to Boosting", 1997.
 
- .. [ZZRH2009] J. Zhu, H. Zou, S. Rosset, T. Hastie. "Multi-class AdaBoost",
-               2009.
+.. [ZZRH2009] J. Zhu, H. Zou, S. Rosset, T. Hastie. "Multi-class AdaBoost", 2009.
 
- .. [D1997] H. Drucker. "Improving Regressors using Boosting Techniques", 1997.
+.. [D1997] H. Drucker. "Improving Regressors using Boosting Techniques", 1997.
 
- .. [HTF] T. Hastie, R. Tibshirani and J. Friedman, "Elements of
-              Statistical Learning Ed. 2", Springer, 2009.
+.. [HTF] T. Hastie, R. Tibshirani and J. Friedman, "Elements of Statistical Learning
+   Ed. 2", Springer, 2009.
diff --git a/doc/modules/feature_extraction.rst b/doc/modules/feature_extraction.rst
index 7ac538a89849b..2dd670891b434 100644
--- a/doc/modules/feature_extraction.rst
+++ b/doc/modules/feature_extraction.rst
@@ -106,8 +106,8 @@ suitable for feeding into a classifier (maybe after being piped into a
   >>> vec = DictVectorizer()
   >>> pos_vectorized = vec.fit_transform(pos_window)
   >>> pos_vectorized
-  <1x6 sparse matrix of type '<... 'numpy.float64'>'
-      with 6 stored elements in Compressed Sparse ... format>
+  <Compressed Sparse...dtype 'float64'
+    with 6 stored elements and shape (1, 6)>
   >>> pos_vectorized.toarray()
   array([[1., 1., 1., 1., 1., 1.]])
   >>> vec.get_feature_names_out()
@@ -206,35 +206,32 @@ Note the use of a generator comprehension,
 which introduces laziness into the feature extraction:
 tokens are only processed on demand from the hasher.
 
-|details-start|
-**Implementation details**
-|details-split|
+.. dropdown:: Implementation details
 
-:class:`FeatureHasher` uses the signed 32-bit variant of MurmurHash3.
-As a result (and because of limitations in ``scipy.sparse``),
-the maximum number of features supported is currently :math:`2^{31} - 1`.
+  :class:`FeatureHasher` uses the signed 32-bit variant of MurmurHash3.
+  As a result (and because of limitations in ``scipy.sparse``),
+  the maximum number of features supported is currently :math:`2^{31} - 1`.
 
-The original formulation of the hashing trick by Weinberger et al.
-used two separate hash functions :math:`h` and :math:`\xi`
-to determine the column index and sign of a feature, respectively.
-The present implementation works under the assumption
-that the sign bit of MurmurHash3 is independent of its other bits.
+  The original formulation of the hashing trick by Weinberger et al.
+  used two separate hash functions :math:`h` and :math:`\xi`
+  to determine the column index and sign of a feature, respectively.
+  The present implementation works under the assumption
+  that the sign bit of MurmurHash3 is independent of its other bits.
 
-Since a simple modulo is used to transform the hash function to a column index,
-it is advisable to use a power of two as the ``n_features`` parameter;
-otherwise the features will not be mapped evenly to the columns.
+  Since a simple modulo is used to transform the hash function to a column index,
+  it is advisable to use a power of two as the ``n_features`` parameter;
+  otherwise the features will not be mapped evenly to the columns.
 
-.. topic:: References:
+  .. rubric:: References
 
   * `MurmurHash3 <https://github.com/aappleby/smhasher>`_.
 
-|details-end|
 
-.. topic:: References:
+.. rubric:: References
 
- * Kilian Weinberger, Anirban Dasgupta, John Langford, Alex Smola and
-   Josh Attenberg (2009). `Feature hashing for large scale multitask learning
-   <https://alex.smola.org/papers/2009/Weinbergeretal09.pdf>`_. Proc. ICML.
+* Kilian Weinberger, Anirban Dasgupta, John Langford, Alex Smola and
+  Josh Attenberg (2009). `Feature hashing for large scale multitask learning
+  <https://alex.smola.org/papers/2009/Weinbergeretal09.pdf>`_. Proc. ICML.
 
 .. _text_feature_extraction:
 
@@ -310,7 +307,7 @@ counting in a single class::
 
 This model has many parameters, however the default values are quite
 reasonable (please see  the :ref:`reference documentation
-<text_feature_extraction_ref>` for the details)::
+<feature_extraction_ref-from-text>` for the details)::
 
   >>> vectorizer = CountVectorizer()
   >>> vectorizer
@@ -327,8 +324,8 @@ corpus of text documents::
   ... ]
   >>> X = vectorizer.fit_transform(corpus)
   >>> X
-  <4x9 sparse matrix of type '<... 'numpy.int64'>'
-      with 19 stored elements in Compressed Sparse ... format>
+  <Compressed Sparse...dtype 'int64'
+    with 19 stored elements and shape (4, 9)>
 
 The default configuration tokenizes the string by extracting words of
 at least 2 letters. The specific function that does this step can be
@@ -422,12 +419,12 @@ tokenizer, so if *we've* is in ``stop_words``, but *ve* is not, *ve* will
 be retained from *we've* in transformed text.  Our vectorizers will try to
 identify and warn about some kinds of inconsistencies.
 
-.. topic:: References
+.. rubric:: References
 
-    .. [NQY18] J. Nothman, H. Qin and R. Yurchak (2018).
-               `"Stop Word Lists in Free Open-source Software Packages"
-               <https://aclweb.org/anthology/W18-2502>`__.
-               In *Proc. Workshop for NLP Open Source Software*.
+.. [NQY18] J. Nothman, H. Qin and R. Yurchak (2018).
+   `"Stop Word Lists in Free Open-source Software Packages"
+   <https://aclweb.org/anthology/W18-2502>`__.
+   In *Proc. Workshop for NLP Open Source Software*.
 
 
 .. _tfidf:
@@ -492,132 +489,126 @@ class::
   TfidfTransformer(smooth_idf=False)
 
 Again please see the :ref:`reference documentation
-<text_feature_extraction_ref>` for the details on all the parameters.
-
-|details-start|
-**Numeric example of a tf-idf matrix**
-|details-split|
-
-Let's take an example with the following counts. The first term is present
-100% of the time hence not very interesting. The two other features only
-in less than 50% of the time hence probably more representative of the
-content of the documents::
-
-  >>> counts = [[3, 0, 1],
-  ...           [2, 0, 0],
-  ...           [3, 0, 0],
-  ...           [4, 0, 0],
-  ...           [3, 2, 0],
-  ...           [3, 0, 2]]
-  ...
-  >>> tfidf = transformer.fit_transform(counts)
-  >>> tfidf
-  <6x3 sparse matrix of type '<... 'numpy.float64'>'
-      with 9 stored elements in Compressed Sparse ... format>
+<feature_extraction_ref-from-text>` for the details on all the parameters.
 
-  >>> tfidf.toarray()
-  array([[0.81940995, 0.        , 0.57320793],
-         [1.        , 0.        , 0.        ],
-         [1.        , 0.        , 0.        ],
-         [1.        , 0.        , 0.        ],
-         [0.47330339, 0.88089948, 0.        ],
-         [0.58149261, 0.        , 0.81355169]])
+.. dropdown:: Numeric example of a tf-idf matrix
 
-Each row is normalized to have unit Euclidean norm:
+  Let's take an example with the following counts. The first term is present
+  100% of the time hence not very interesting. The two other features only
+  in less than 50% of the time hence probably more representative of the
+  content of the documents::
 
-:math:`v_{norm} = \frac{v}{||v||_2} = \frac{v}{\sqrt{v{_1}^2 +
-v{_2}^2 + \dots + v{_n}^2}}`
+    >>> counts = [[3, 0, 1],
+    ...           [2, 0, 0],
+    ...           [3, 0, 0],
+    ...           [4, 0, 0],
+    ...           [3, 2, 0],
+    ...           [3, 0, 2]]
+    ...
+    >>> tfidf = transformer.fit_transform(counts)
+    >>> tfidf
+    <Compressed Sparse...dtype 'float64'
+      with 9 stored elements and shape (6, 3)>
 
-For example, we can compute the tf-idf of the first term in the first
-document in the `counts` array as follows:
+    >>> tfidf.toarray()
+    array([[0.81940995, 0.        , 0.57320793],
+          [1.        , 0.        , 0.        ],
+          [1.        , 0.        , 0.        ],
+          [1.        , 0.        , 0.        ],
+          [0.47330339, 0.88089948, 0.        ],
+          [0.58149261, 0.        , 0.81355169]])
 
-:math:`n = 6`
+  Each row is normalized to have unit Euclidean norm:
 
-:math:`\text{df}(t)_{\text{term1}} = 6`
+  :math:`v_{norm} = \frac{v}{||v||_2} = \frac{v}{\sqrt{v{_1}^2 +
+  v{_2}^2 + \dots + v{_n}^2}}`
 
-:math:`\text{idf}(t)_{\text{term1}} =
-\log \frac{n}{\text{df}(t)} + 1 = \log(1)+1 = 1`
+  For example, we can compute the tf-idf of the first term in the first
+  document in the `counts` array as follows:
 
-:math:`\text{tf-idf}_{\text{term1}} = \text{tf} \times \text{idf} = 3 \times 1 = 3`
+  :math:`n = 6`
 
-Now, if we repeat this computation for the remaining 2 terms in the document,
-we get
+  :math:`\text{df}(t)_{\text{term1}} = 6`
 
-:math:`\text{tf-idf}_{\text{term2}} = 0 \times (\log(6/1)+1) = 0`
+  :math:`\text{idf}(t)_{\text{term1}} =
+  \log \frac{n}{\text{df}(t)} + 1 = \log(1)+1 = 1`
 
-:math:`\text{tf-idf}_{\text{term3}} = 1 \times (\log(6/2)+1) \approx 2.0986`
+  :math:`\text{tf-idf}_{\text{term1}} = \text{tf} \times \text{idf} = 3 \times 1 = 3`
 
-and the vector of raw tf-idfs:
+  Now, if we repeat this computation for the remaining 2 terms in the document,
+  we get
 
-:math:`\text{tf-idf}_{\text{raw}} = [3, 0, 2.0986].`
+  :math:`\text{tf-idf}_{\text{term2}} = 0 \times (\log(6/1)+1) = 0`
 
+  :math:`\text{tf-idf}_{\text{term3}} = 1 \times (\log(6/2)+1) \approx 2.0986`
 
-Then, applying the Euclidean (L2) norm, we obtain the following tf-idfs
-for document 1:
+  and the vector of raw tf-idfs:
 
-:math:`\frac{[3, 0, 2.0986]}{\sqrt{\big(3^2 + 0^2 + 2.0986^2\big)}}
-= [ 0.819,  0,  0.573].`
+  :math:`\text{tf-idf}_{\text{raw}} = [3, 0, 2.0986].`
 
-Furthermore, the default parameter ``smooth_idf=True`` adds "1" to the numerator
-and  denominator as if an extra document was seen containing every term in the
-collection exactly once, which prevents zero divisions:
 
-:math:`\text{idf}(t) = \log{\frac{1 + n}{1+\text{df}(t)}} + 1`
+  Then, applying the Euclidean (L2) norm, we obtain the following tf-idfs
+  for document 1:
 
-Using this modification, the tf-idf of the third term in document 1 changes to
-1.8473:
+  :math:`\frac{[3, 0, 2.0986]}{\sqrt{\big(3^2 + 0^2 + 2.0986^2\big)}}
+  = [ 0.819,  0,  0.573].`
 
-:math:`\text{tf-idf}_{\text{term3}} = 1 \times \log(7/3)+1 \approx 1.8473`
+  Furthermore, the default parameter ``smooth_idf=True`` adds "1" to the numerator
+  and  denominator as if an extra document was seen containing every term in the
+  collection exactly once, which prevents zero divisions:
 
-And the L2-normalized tf-idf changes to
+  :math:`\text{idf}(t) = \log{\frac{1 + n}{1+\text{df}(t)}} + 1`
 
-:math:`\frac{[3, 0, 1.8473]}{\sqrt{\big(3^2 + 0^2 + 1.8473^2\big)}}
-= [0.8515, 0, 0.5243]`::
+  Using this modification, the tf-idf of the third term in document 1 changes to
+  1.8473:
 
-  >>> transformer = TfidfTransformer()
-  >>> transformer.fit_transform(counts).toarray()
-  array([[0.85151335, 0.        , 0.52433293],
-         [1.        , 0.        , 0.        ],
-         [1.        , 0.        , 0.        ],
-         [1.        , 0.        , 0.        ],
-         [0.55422893, 0.83236428, 0.        ],
-         [0.63035731, 0.        , 0.77630514]])
+  :math:`\text{tf-idf}_{\text{term3}} = 1 \times \log(7/3)+1 \approx 1.8473`
 
-The weights of each
-feature computed by the ``fit`` method call are stored in a model
-attribute::
+  And the L2-normalized tf-idf changes to
 
-  >>> transformer.idf_
-  array([1. ..., 2.25..., 1.84...])
+  :math:`\frac{[3, 0, 1.8473]}{\sqrt{\big(3^2 + 0^2 + 1.8473^2\big)}}
+  = [0.8515, 0, 0.5243]`::
 
+    >>> transformer = TfidfTransformer()
+    >>> transformer.fit_transform(counts).toarray()
+    array([[0.85151335, 0.        , 0.52433293],
+          [1.        , 0.        , 0.        ],
+          [1.        , 0.        , 0.        ],
+          [1.        , 0.        , 0.        ],
+          [0.55422893, 0.83236428, 0.        ],
+          [0.63035731, 0.        , 0.77630514]])
 
+  The weights of each
+  feature computed by the ``fit`` method call are stored in a model
+  attribute::
 
+    >>> transformer.idf_
+    array([1. ..., 2.25..., 1.84...])
 
-As tf–idf is very often used for text features, there is also another
-class called :class:`TfidfVectorizer` that combines all the options of
-:class:`CountVectorizer` and :class:`TfidfTransformer` in a single model::
+  As tf-idf is very often used for text features, there is also another
+  class called :class:`TfidfVectorizer` that combines all the options of
+  :class:`CountVectorizer` and :class:`TfidfTransformer` in a single model::
 
-  >>> from sklearn.feature_extraction.text import TfidfVectorizer
-  >>> vectorizer = TfidfVectorizer()
-  >>> vectorizer.fit_transform(corpus)
-  <4x9 sparse matrix of type '<... 'numpy.float64'>'
-      with 19 stored elements in Compressed Sparse ... format>
+    >>> from sklearn.feature_extraction.text import TfidfVectorizer
+    >>> vectorizer = TfidfVectorizer()
+    >>> vectorizer.fit_transform(corpus)
+    <Compressed Sparse...dtype 'float64'
+      with 19 stored elements and shape (4, 9)>
 
-While the tf–idf normalization is often very useful, there might
-be cases where the binary occurrence markers might offer better
-features. This can be achieved by using the ``binary`` parameter
-of :class:`CountVectorizer`. In particular, some estimators such as
-:ref:`bernoulli_naive_bayes` explicitly model discrete boolean random
-variables. Also, very short texts are likely to have noisy tf–idf values
-while the binary occurrence info is more stable.
+  While the tf-idf normalization is often very useful, there might
+  be cases where the binary occurrence markers might offer better
+  features. This can be achieved by using the ``binary`` parameter
+  of :class:`CountVectorizer`. In particular, some estimators such as
+  :ref:`bernoulli_naive_bayes` explicitly model discrete boolean random
+  variables. Also, very short texts are likely to have noisy tf-idf values
+  while the binary occurrence info is more stable.
 
-As usual the best way to adjust the feature extraction parameters
-is to use a cross-validated grid search, for instance by pipelining the
-feature extractor with a classifier:
+  As usual the best way to adjust the feature extraction parameters
+  is to use a cross-validated grid search, for instance by pipelining the
+  feature extractor with a classifier:
 
-* :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_text_feature_extraction.py`
+  * :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_text_feature_extraction.py`
 
-|details-end|
 
 Decoding text files
 -------------------
@@ -646,64 +637,60 @@ or ``"replace"``. See the documentation for the Python function
 ``bytes.decode`` for more details
 (type ``help(bytes.decode)`` at the Python prompt).
 
-|details-start|
-**Troubleshooting decoding text**
-|details-split|
-
-If you are having trouble decoding text, here are some things to try:
-
-- Find out what the actual encoding of the text is. The file might come
-  with a header or README that tells you the encoding, or there might be some
-  standard encoding you can assume based on where the text comes from.
-
-- You may be able to find out what kind of encoding it is in general
-  using the UNIX command ``file``. The Python ``chardet`` module comes with
-  a script called ``chardetect.py`` that will guess the specific encoding,
-  though you cannot rely on its guess being correct.
-
-- You could try UTF-8 and disregard the errors. You can decode byte
-  strings with ``bytes.decode(errors='replace')`` to replace all
-  decoding errors with a meaningless character, or set
-  ``decode_error='replace'`` in the vectorizer. This may damage the
-  usefulness of your features.
-
-- Real text may come from a variety of sources that may have used different
-  encodings, or even be sloppily decoded in a different encoding than the
-  one it was encoded with. This is common in text retrieved from the Web.
-  The Python package `ftfy`_ can automatically sort out some classes of
-  decoding errors, so you could try decoding the unknown text as ``latin-1``
-  and then using ``ftfy`` to fix errors.
-
-- If the text is in a mish-mash of encodings that is simply too hard to sort
-  out (which is the case for the 20 Newsgroups dataset), you can fall back on
-  a simple single-byte encoding such as ``latin-1``. Some text may display
-  incorrectly, but at least the same sequence of bytes will always represent
-  the same feature.
-
-For example, the following snippet uses ``chardet``
-(not shipped with scikit-learn, must be installed separately)
-to figure out the encoding of three texts.
-It then vectorizes the texts and prints the learned vocabulary.
-The output is not shown here.
-
-  >>> import chardet    # doctest: +SKIP
-  >>> text1 = b"Sei mir gegr\xc3\xbc\xc3\x9ft mein Sauerkraut"
-  >>> text2 = b"holdselig sind deine Ger\xfcche"
-  >>> text3 = b"\xff\xfeA\x00u\x00f\x00 \x00F\x00l\x00\xfc\x00g\x00e\x00l\x00n\x00 \x00d\x00e\x00s\x00 \x00G\x00e\x00s\x00a\x00n\x00g\x00e\x00s\x00,\x00 \x00H\x00e\x00r\x00z\x00l\x00i\x00e\x00b\x00c\x00h\x00e\x00n\x00,\x00 \x00t\x00r\x00a\x00g\x00 \x00i\x00c\x00h\x00 \x00d\x00i\x00c\x00h\x00 \x00f\x00o\x00r\x00t\x00"
-  >>> decoded = [x.decode(chardet.detect(x)['encoding'])
-  ...            for x in (text1, text2, text3)]        # doctest: +SKIP
-  >>> v = CountVectorizer().fit(decoded).vocabulary_    # doctest: +SKIP
-  >>> for term in v: print(v)                           # doctest: +SKIP
-
-(Depending on the version of ``chardet``, it might get the first one wrong.)
-
-For an introduction to Unicode and character encodings in general,
-see Joel Spolsky's `Absolute Minimum Every Software Developer Must Know
-About Unicode <https://www.joelonsoftware.com/articles/Unicode.html>`_.
-
-.. _`ftfy`: https://github.com/LuminosoInsight/python-ftfy
-
-|details-end|
+.. dropdown:: Troubleshooting decoding text
+
+  If you are having trouble decoding text, here are some things to try:
+
+  - Find out what the actual encoding of the text is. The file might come
+    with a header or README that tells you the encoding, or there might be some
+    standard encoding you can assume based on where the text comes from.
+
+  - You may be able to find out what kind of encoding it is in general
+    using the UNIX command ``file``. The Python ``chardet`` module comes with
+    a script called ``chardetect.py`` that will guess the specific encoding,
+    though you cannot rely on its guess being correct.
+
+  - You could try UTF-8 and disregard the errors. You can decode byte
+    strings with ``bytes.decode(errors='replace')`` to replace all
+    decoding errors with a meaningless character, or set
+    ``decode_error='replace'`` in the vectorizer. This may damage the
+    usefulness of your features.
+
+  - Real text may come from a variety of sources that may have used different
+    encodings, or even be sloppily decoded in a different encoding than the
+    one it was encoded with. This is common in text retrieved from the Web.
+    The Python package `ftfy <https://github.com/LuminosoInsight/python-ftfy>`__
+    can automatically sort out some classes of
+    decoding errors, so you could try decoding the unknown text as ``latin-1``
+    and then using ``ftfy`` to fix errors.
+
+  - If the text is in a mish-mash of encodings that is simply too hard to sort
+    out (which is the case for the 20 Newsgroups dataset), you can fall back on
+    a simple single-byte encoding such as ``latin-1``. Some text may display
+    incorrectly, but at least the same sequence of bytes will always represent
+    the same feature.
+
+  For example, the following snippet uses ``chardet``
+  (not shipped with scikit-learn, must be installed separately)
+  to figure out the encoding of three texts.
+  It then vectorizes the texts and prints the learned vocabulary.
+  The output is not shown here.
+
+    >>> import chardet    # doctest: +SKIP
+    >>> text1 = b"Sei mir gegr\xc3\xbc\xc3\x9ft mein Sauerkraut"
+    >>> text2 = b"holdselig sind deine Ger\xfcche"
+    >>> text3 = b"\xff\xfeA\x00u\x00f\x00 \x00F\x00l\x00\xfc\x00g\x00e\x00l\x00n\x00 \x00d\x00e\x00s\x00 \x00G\x00e\x00s\x00a\x00n\x00g\x00e\x00s\x00,\x00 \x00H\x00e\x00r\x00z\x00l\x00i\x00e\x00b\x00c\x00h\x00e\x00n\x00,\x00 \x00t\x00r\x00a\x00g\x00 \x00i\x00c\x00h\x00 \x00d\x00i\x00c\x00h\x00 \x00f\x00o\x00r\x00t\x00"
+    >>> decoded = [x.decode(chardet.detect(x)['encoding'])
+    ...            for x in (text1, text2, text3)]        # doctest: +SKIP
+    >>> v = CountVectorizer().fit(decoded).vocabulary_    # doctest: +SKIP
+    >>> for term in v: print(v)                           # doctest: +SKIP
+
+  (Depending on the version of ``chardet``, it might get the first one wrong.)
+
+  For an introduction to Unicode and character encodings in general,
+  see Joel Spolsky's `Absolute Minimum Every Software Developer Must Know
+  About Unicode <https://www.joelonsoftware.com/articles/Unicode.html>`_.
+
 
 Applications and examples
 -------------------------
@@ -768,15 +755,16 @@ span across words::
 
   >>> ngram_vectorizer = CountVectorizer(analyzer='char_wb', ngram_range=(5, 5))
   >>> ngram_vectorizer.fit_transform(['jumpy fox'])
-  <1x4 sparse matrix of type '<... 'numpy.int64'>'
-     with 4 stored elements in Compressed Sparse ... format>
+  <Compressed Sparse...dtype 'int64'
+    with 4 stored elements and shape (1, 4)>
+
   >>> ngram_vectorizer.get_feature_names_out()
   array([' fox ', ' jump', 'jumpy', 'umpy '], ...)
 
   >>> ngram_vectorizer = CountVectorizer(analyzer='char', ngram_range=(5, 5))
   >>> ngram_vectorizer.fit_transform(['jumpy fox'])
-  <1x5 sparse matrix of type '<... 'numpy.int64'>'
-      with 5 stored elements in Compressed Sparse ... format>
+  <Compressed Sparse...dtype 'int64'
+    with 5 stored elements and shape (1, 5)>
   >>> ngram_vectorizer.get_feature_names_out()
   array(['jumpy', 'mpy f', 'py fo', 'umpy ', 'y fox'], ...)
 
@@ -842,8 +830,8 @@ meaning that you don't have to call ``fit`` on it::
   >>> from sklearn.feature_extraction.text import HashingVectorizer
   >>> hv = HashingVectorizer(n_features=10)
   >>> hv.transform(corpus)
-  <4x10 sparse matrix of type '<... 'numpy.float64'>'
-      with 16 stored elements in Compressed Sparse ... format>
+  <Compressed Sparse...dtype 'float64'
+    with 16 stored elements and shape (4, 10)>
 
 You can see that 16 non-zero feature tokens were extracted in the vector
 output: this is less than the 19 non-zeros extracted previously by the
@@ -866,8 +854,8 @@ Let's try again with the default setting::
 
   >>> hv = HashingVectorizer()
   >>> hv.transform(corpus)
-  <4x1048576 sparse matrix of type '<... 'numpy.float64'>'
-      with 19 stored elements in Compressed Sparse ... format>
+  <Compressed Sparse...dtype 'float64'
+    with 19 stored elements and shape (4, 1048576)>
 
 We no longer get the collisions, but this comes at the expense of a much larger
 dimensionality of the output space.
@@ -884,28 +872,25 @@ The :class:`HashingVectorizer` also comes with the following limitations:
   model. A :class:`TfidfTransformer` can be appended to it in a pipeline if
   required.
 
-|details-start|
-**Performing out-of-core scaling with HashingVectorizer**
-|details-split|
+.. dropdown:: Performing out-of-core scaling with HashingVectorizer
 
-An interesting development of using a :class:`HashingVectorizer` is the ability
-to perform `out-of-core`_ scaling. This means that we can learn from data that
-does not fit into the computer's main memory.
+  An interesting development of using a :class:`HashingVectorizer` is the ability
+  to perform `out-of-core`_ scaling. This means that we can learn from data that
+  does not fit into the computer's main memory.
 
-.. _out-of-core: https://en.wikipedia.org/wiki/Out-of-core_algorithm
+  .. _out-of-core: https://en.wikipedia.org/wiki/Out-of-core_algorithm
 
-A strategy to implement out-of-core scaling is to stream data to the estimator
-in mini-batches. Each mini-batch is vectorized using :class:`HashingVectorizer`
-so as to guarantee that the input space of the estimator has always the same
-dimensionality. The amount of memory used at any time is thus bounded by the
-size of a mini-batch. Although there is no limit to the amount of data that can
-be ingested using such an approach, from a practical point of view the learning
-time is often limited by the CPU time one wants to spend on the task.
+  A strategy to implement out-of-core scaling is to stream data to the estimator
+  in mini-batches. Each mini-batch is vectorized using :class:`HashingVectorizer`
+  so as to guarantee that the input space of the estimator has always the same
+  dimensionality. The amount of memory used at any time is thus bounded by the
+  size of a mini-batch. Although there is no limit to the amount of data that can
+  be ingested using such an approach, from a practical point of view the learning
+  time is often limited by the CPU time one wants to spend on the task.
 
-For a full-fledged example of out-of-core scaling in a text classification
-task see :ref:`sphx_glr_auto_examples_applications_plot_out_of_core_classification.py`.
+  For a full-fledged example of out-of-core scaling in a text classification
+  task see :ref:`sphx_glr_auto_examples_applications_plot_out_of_core_classification.py`.
 
-|details-end|
 
 Customizing the vectorizer classes
 ----------------------------------
@@ -945,65 +930,58 @@ parameters it is possible to derive from the class and override the
 ``build_preprocessor``, ``build_tokenizer`` and ``build_analyzer``
 factory methods instead of passing custom functions.
 
-|details-start|
-**Tips and tricks**
-|details-split|
-
-Some tips and tricks:
-
-* If documents are pre-tokenized by an external package, then store them in
-  files (or strings) with the tokens separated by whitespace and pass
-  ``analyzer=str.split``
-* Fancy token-level analysis such as stemming, lemmatizing, compound
-  splitting, filtering based on part-of-speech, etc. are not included in the
-  scikit-learn codebase, but can be added by customizing either the
-  tokenizer or the analyzer.
-  Here's a ``CountVectorizer`` with a tokenizer and lemmatizer using
-  `NLTK <https://www.nltk.org/>`_::
-
-      >>> from nltk import word_tokenize          # doctest: +SKIP
-      >>> from nltk.stem import WordNetLemmatizer # doctest: +SKIP
-      >>> class LemmaTokenizer:
-      ...     def __init__(self):
-      ...         self.wnl = WordNetLemmatizer()
-      ...     def __call__(self, doc):
-      ...         return [self.wnl.lemmatize(t) for t in word_tokenize(doc)]
-      ...
-      >>> vect = CountVectorizer(tokenizer=LemmaTokenizer())  # doctest: +SKIP
-
-  (Note that this will not filter out punctuation.)
-
-
-  The following example will, for instance, transform some British spelling
-  to American spelling::
-
-      >>> import re
-      >>> def to_british(tokens):
-      ...     for t in tokens:
-      ...         t = re.sub(r"(...)our$", r"\1or", t)
-      ...         t = re.sub(r"([bt])re$", r"\1er", t)
-      ...         t = re.sub(r"([iy])s(e$|ing|ation)", r"\1z\2", t)
-      ...         t = re.sub(r"ogue$", "og", t)
-      ...         yield t
-      ...
-      >>> class CustomVectorizer(CountVectorizer):
-      ...     def build_tokenizer(self):
-      ...         tokenize = super().build_tokenizer()
-      ...         return lambda doc: list(to_british(tokenize(doc)))
-      ...
-      >>> print(CustomVectorizer().build_analyzer()(u"color colour"))
-      [...'color', ...'color']
-
-  for other styles of preprocessing; examples include stemming, lemmatization,
-  or normalizing numerical tokens, with the latter illustrated in:
-
-  * :ref:`sphx_glr_auto_examples_bicluster_plot_bicluster_newsgroups.py`
-
-
-Customizing the vectorizer can also be useful when handling Asian languages
-that do not use an explicit word separator such as whitespace.
-
-|details-end|
+.. dropdown:: Tips and tricks
+  :color: success
+
+  * If documents are pre-tokenized by an external package, then store them in
+    files (or strings) with the tokens separated by whitespace and pass
+    ``analyzer=str.split``
+  * Fancy token-level analysis such as stemming, lemmatizing, compound
+    splitting, filtering based on part-of-speech, etc. are not included in the
+    scikit-learn codebase, but can be added by customizing either the
+    tokenizer or the analyzer.
+    Here's a ``CountVectorizer`` with a tokenizer and lemmatizer using
+    `NLTK <https://www.nltk.org/>`_::
+
+        >>> from nltk import word_tokenize          # doctest: +SKIP
+        >>> from nltk.stem import WordNetLemmatizer # doctest: +SKIP
+        >>> class LemmaTokenizer:
+        ...     def __init__(self):
+        ...         self.wnl = WordNetLemmatizer()
+        ...     def __call__(self, doc):
+        ...         return [self.wnl.lemmatize(t) for t in word_tokenize(doc)]
+        ...
+        >>> vect = CountVectorizer(tokenizer=LemmaTokenizer())  # doctest: +SKIP
+
+    (Note that this will not filter out punctuation.)
+
+    The following example will, for instance, transform some British spelling
+    to American spelling::
+
+        >>> import re
+        >>> def to_british(tokens):
+        ...     for t in tokens:
+        ...         t = re.sub(r"(...)our$", r"\1or", t)
+        ...         t = re.sub(r"([bt])re$", r"\1er", t)
+        ...         t = re.sub(r"([iy])s(e$|ing|ation)", r"\1z\2", t)
+        ...         t = re.sub(r"ogue$", "og", t)
+        ...         yield t
+        ...
+        >>> class CustomVectorizer(CountVectorizer):
+        ...     def build_tokenizer(self):
+        ...         tokenize = super().build_tokenizer()
+        ...         return lambda doc: list(to_british(tokenize(doc)))
+        ...
+        >>> print(CustomVectorizer().build_analyzer()(u"color colour"))
+        [...'color', ...'color']
+
+    for other styles of preprocessing; examples include stemming, lemmatization,
+    or normalizing numerical tokens, with the latter illustrated in:
+
+    * :ref:`sphx_glr_auto_examples_bicluster_plot_bicluster_newsgroups.py`
+
+  Customizing the vectorizer can also be useful when handling Asian languages
+  that do not use an explicit word separator such as whitespace.
 
 .. _image_feature_extraction:
 
diff --git a/doc/modules/feature_selection.rst b/doc/modules/feature_selection.rst
index 1ae950acdfbb6..6746f2f65da00 100644
--- a/doc/modules/feature_selection.rst
+++ b/doc/modules/feature_selection.rst
@@ -114,11 +114,11 @@ applied to non-negative features, such as frequencies.
     feature selection as well. One needs to provide a `score_func` where `y=None`.
     The `score_func` should use internally `X` to compute the scores.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_feature_selection_plot_feature_selection.py`
+* :ref:`sphx_glr_auto_examples_feature_selection_plot_feature_selection.py`
 
-    * :ref:`sphx_glr_auto_examples_feature_selection_plot_f_test_vs_mi.py`
+* :ref:`sphx_glr_auto_examples_feature_selection_plot_f_test_vs_mi.py`
 
 .. _rfe:
 
@@ -144,14 +144,14 @@ of selected features and aggregated together. Finally, the scores are averaged
 across folds and the number of features selected is set to the number of
 features that maximize the cross-validation score.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_feature_selection_plot_rfe_digits.py`: A recursive feature elimination example
-      showing the relevance of pixels in a digit classification task.
+* :ref:`sphx_glr_auto_examples_feature_selection_plot_rfe_digits.py`: A recursive feature elimination example
+  showing the relevance of pixels in a digit classification task.
 
-    * :ref:`sphx_glr_auto_examples_feature_selection_plot_rfe_with_cross_validation.py`: A recursive feature
-      elimination example with automatic tuning of the number of features
-      selected with cross-validation.
+* :ref:`sphx_glr_auto_examples_feature_selection_plot_rfe_with_cross_validation.py`: A recursive feature
+  elimination example with automatic tuning of the number of features
+  selected with cross-validation.
 
 .. _select_from_model:
 
@@ -171,9 +171,9 @@ Available heuristics are "mean", "median" and float multiples of these like
 
 For examples on how it is to be used refer to the sections below.
 
-.. topic:: Examples
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_feature_selection_plot_select_from_model_diabetes.py`
+* :ref:`sphx_glr_auto_examples_feature_selection_plot_select_from_model_diabetes.py`
 
 .. _l1_feature_selection:
 
@@ -207,42 +207,39 @@ With SVMs and logistic-regression, the parameter C controls the sparsity:
 the smaller C the fewer features selected. With Lasso, the higher the
 alpha parameter, the fewer features selected.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_linear_model_plot_lasso_dense_vs_sparse_data.py`.
+* :ref:`sphx_glr_auto_examples_linear_model_plot_lasso_dense_vs_sparse_data.py`.
 
 .. _compressive_sensing:
 
-|details-start|
-**L1-recovery and compressive sensing**
-|details-split|
-
-For a good choice of alpha, the :ref:`lasso` can fully recover the
-exact set of non-zero variables using only few observations, provided
-certain specific conditions are met. In particular, the number of
-samples should be "sufficiently large", or L1 models will perform at
-random, where "sufficiently large" depends on the number of non-zero
-coefficients, the logarithm of the number of features, the amount of
-noise, the smallest absolute value of non-zero coefficients, and the
-structure of the design matrix X. In addition, the design matrix must
-display certain specific properties, such as not being too correlated.
-
-There is no general rule to select an alpha parameter for recovery of
-non-zero coefficients. It can by set by cross-validation
-(:class:`~sklearn.linear_model.LassoCV` or
-:class:`~sklearn.linear_model.LassoLarsCV`), though this may lead to
-under-penalized models: including a small number of non-relevant variables
-is not detrimental to prediction score. BIC
-(:class:`~sklearn.linear_model.LassoLarsIC`) tends, on the opposite, to set
-high values of alpha.
-
-.. topic:: Reference
-
-   Richard G. Baraniuk "Compressive Sensing", IEEE Signal
-   Processing Magazine [120] July 2007
-   http://users.isr.ist.utl.pt/~aguiar/CS_notes.pdf
-
-|details-end|
+.. dropdown:: L1-recovery and compressive sensing
+
+  For a good choice of alpha, the :ref:`lasso` can fully recover the
+  exact set of non-zero variables using only few observations, provided
+  certain specific conditions are met. In particular, the number of
+  samples should be "sufficiently large", or L1 models will perform at
+  random, where "sufficiently large" depends on the number of non-zero
+  coefficients, the logarithm of the number of features, the amount of
+  noise, the smallest absolute value of non-zero coefficients, and the
+  structure of the design matrix X. In addition, the design matrix must
+  display certain specific properties, such as not being too correlated.
+
+  There is no general rule to select an alpha parameter for recovery of
+  non-zero coefficients. It can by set by cross-validation
+  (:class:`~sklearn.linear_model.LassoCV` or
+  :class:`~sklearn.linear_model.LassoLarsCV`), though this may lead to
+  under-penalized models: including a small number of non-relevant variables
+  is not detrimental to prediction score. BIC
+  (:class:`~sklearn.linear_model.LassoLarsIC`) tends, on the opposite, to set
+  high values of alpha.
+
+  .. rubric:: References
+
+  Richard G. Baraniuk "Compressive Sensing", IEEE Signal
+  Processing Magazine [120] July 2007
+  http://users.isr.ist.utl.pt/~aguiar/CS_notes.pdf
+
 
 Tree-based feature selection
 ----------------------------
@@ -268,14 +265,13 @@ meta-transformer)::
   >>> X_new.shape               # doctest: +SKIP
   (150, 2)
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_ensemble_plot_forest_importances.py`: example on
-      synthetic data showing the recovery of the actually meaningful
-      features.
+* :ref:`sphx_glr_auto_examples_ensemble_plot_forest_importances.py`: example on
+  synthetic data showing the recovery of the actually meaningful features.
 
-    * :ref:`sphx_glr_auto_examples_ensemble_plot_forest_importances_faces.py`: example
-      on face recognition data.
+* :ref:`sphx_glr_auto_examples_ensemble_plot_forest_importances_faces.py`: example
+  on face recognition data.
 
 .. _sequential_feature_selection:
 
@@ -299,38 +295,35 @@ instead of starting with no features and greedily adding features, we start
 with *all* the features and greedily *remove* features from the set. The
 `direction` parameter controls whether forward or backward SFS is used.
 
-|details-start|
-**Detail on Sequential Feature Selection**
-|details-split|
-
-In general, forward and backward selection do not yield equivalent results.
-Also, one may be much faster than the other depending on the requested number
-of selected features: if we have 10 features and ask for 7 selected features,
-forward selection would need to perform 7 iterations while backward selection
-would only need to perform 3.
-
-SFS differs from :class:`~sklearn.feature_selection.RFE` and
-:class:`~sklearn.feature_selection.SelectFromModel` in that it does not
-require the underlying model to expose a `coef_` or `feature_importances_`
-attribute. It may however be slower considering that more models need to be
-evaluated, compared to the other approaches. For example in backward
-selection, the iteration going from `m` features to `m - 1` features using k-fold
-cross-validation requires fitting `m * k` models, while
-:class:`~sklearn.feature_selection.RFE` would require only a single fit, and
-:class:`~sklearn.feature_selection.SelectFromModel` always just does a single
-fit and requires no iterations.
-
-.. topic:: Reference
-
-   .. [sfs] Ferri et al, `Comparative study of techniques for
+.. dropdown:: Details on Sequential Feature Selection
+
+  In general, forward and backward selection do not yield equivalent results.
+  Also, one may be much faster than the other depending on the requested number
+  of selected features: if we have 10 features and ask for 7 selected features,
+  forward selection would need to perform 7 iterations while backward selection
+  would only need to perform 3.
+
+  SFS differs from :class:`~sklearn.feature_selection.RFE` and
+  :class:`~sklearn.feature_selection.SelectFromModel` in that it does not
+  require the underlying model to expose a `coef_` or `feature_importances_`
+  attribute. It may however be slower considering that more models need to be
+  evaluated, compared to the other approaches. For example in backward
+  selection, the iteration going from `m` features to `m - 1` features using k-fold
+  cross-validation requires fitting `m * k` models, while
+  :class:`~sklearn.feature_selection.RFE` would require only a single fit, and
+  :class:`~sklearn.feature_selection.SelectFromModel` always just does a single
+  fit and requires no iterations.
+
+  .. rubric:: References
+
+  .. [sfs] Ferri et al, `Comparative study of techniques for
       large-scale feature selection
       <https://citeseerx.ist.psu.edu/doc_view/pid/5fedabbb3957bbb442802e012d829ee0629a01b6>`_.
 
-|details-end|
 
-.. topic:: Examples
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_feature_selection_plot_select_from_model_diabetes.py`
+* :ref:`sphx_glr_auto_examples_feature_selection_plot_select_from_model_diabetes.py`
 
 Feature selection as part of a pipeline
 =======================================
@@ -340,7 +333,7 @@ the actual learning. The recommended way to do this in scikit-learn is
 to use a :class:`~pipeline.Pipeline`::
 
   clf = Pipeline([
-    ('feature_selection', SelectFromModel(LinearSVC(dual="auto", penalty="l1"))),
+    ('feature_selection', SelectFromModel(LinearSVC(penalty="l1"))),
     ('classification', RandomForestClassifier())
   ])
   clf.fit(X, y)
diff --git a/doc/modules/gaussian_process.rst b/doc/modules/gaussian_process.rst
index 58e56a557ed73..fb87120205f96 100644
--- a/doc/modules/gaussian_process.rst
+++ b/doc/modules/gaussian_process.rst
@@ -88,12 +88,12 @@ the API of standard scikit-learn estimators, :class:`GaussianProcessRegressor`:
   externally for other ways of selecting hyperparameters, e.g., via
   Markov chain Monte Carlo.
 
-.. topic:: Examples
+.. rubric:: Examples
 
-   * :ref:`sphx_glr_auto_examples_gaussian_process_plot_gpr_noisy_targets.py`
-   * :ref:`sphx_glr_auto_examples_gaussian_process_plot_gpr_noisy.py`
-   * :ref:`sphx_glr_auto_examples_gaussian_process_plot_compare_gpr_krr.py`
-   * :ref:`sphx_glr_auto_examples_gaussian_process_plot_gpr_co2.py`
+* :ref:`sphx_glr_auto_examples_gaussian_process_plot_gpr_noisy_targets.py`
+* :ref:`sphx_glr_auto_examples_gaussian_process_plot_gpr_noisy.py`
+* :ref:`sphx_glr_auto_examples_gaussian_process_plot_compare_gpr_krr.py`
+* :ref:`sphx_glr_auto_examples_gaussian_process_plot_gpr_co2.py`
 
 .. _gpc:
 
@@ -239,93 +239,88 @@ also invariant to rotations in the input space. For more details, we refer to
 Chapter 4 of [RW2006]_. For guidance on how to best combine different kernels,
 we refer to [Duv2014]_.
 
-|details-start|
-**Gaussian Process Kernel API**
-|details-split|
-
-The main usage of a :class:`Kernel` is to compute the GP's covariance between
-datapoints. For this, the method ``__call__`` of the kernel can be called. This
-method can either be used to compute the "auto-covariance" of all pairs of
-datapoints in a 2d array X, or the "cross-covariance" of all combinations
-of datapoints of a 2d array X with datapoints in a 2d array Y. The following
-identity holds true for all kernels k (except for the :class:`WhiteKernel`):
-``k(X) == K(X, Y=X)``
-
-If only the diagonal of the auto-covariance is being used, the method ``diag()``
-of a kernel can be called, which is more computationally efficient than the
-equivalent call to ``__call__``: ``np.diag(k(X, X)) == k.diag(X)``
-
-Kernels are parameterized by a vector :math:`\theta` of hyperparameters. These
-hyperparameters can for instance control length-scales or periodicity of a
-kernel (see below). All kernels support computing analytic gradients
-of the kernel's auto-covariance with respect to :math:`log(\theta)` via setting
-``eval_gradient=True`` in the ``__call__`` method.
-That is, a ``(len(X), len(X), len(theta))`` array is returned where the entry
-``[i, j, l]`` contains :math:`\frac{\partial k_\theta(x_i, x_j)}{\partial log(\theta_l)}`.
-This gradient is used by the Gaussian process (both regressor and classifier)
-in computing the gradient of the log-marginal-likelihood, which in turn is used
-to determine the value of :math:`\theta`, which maximizes the log-marginal-likelihood,
-via gradient ascent. For each hyperparameter, the initial value and the
-bounds need to be specified when creating an instance of the kernel. The
-current value of :math:`\theta` can be get and set via the property
-``theta`` of the kernel object. Moreover, the bounds of the hyperparameters can be
-accessed by the property ``bounds`` of the kernel. Note that both properties
-(theta and bounds) return log-transformed values of the internally used values
-since those are typically more amenable to gradient-based optimization.
-The specification of each hyperparameter is stored in the form of an instance of
-:class:`Hyperparameter` in the respective kernel. Note that a kernel using a
-hyperparameter with name "x" must have the attributes self.x and self.x_bounds.
-
-The abstract base class for all kernels is :class:`Kernel`. Kernel implements a
-similar interface as :class:`~sklearn.base.BaseEstimator`, providing the
-methods ``get_params()``, ``set_params()``, and ``clone()``. This allows
-setting kernel values also via meta-estimators such as
-:class:`~sklearn.pipeline.Pipeline` or
-:class:`~sklearn.model_selection.GridSearchCV`. Note that due to the nested
-structure of kernels (by applying kernel operators, see below), the names of
-kernel parameters might become relatively complicated. In general, for a binary
-kernel operator, parameters of the left operand are prefixed with ``k1__`` and
-parameters of the right operand with ``k2__``. An additional convenience method
-is ``clone_with_theta(theta)``, which returns a cloned version of the kernel
-but with the hyperparameters set to ``theta``. An illustrative example:
-
-    >>> from sklearn.gaussian_process.kernels import ConstantKernel, RBF
-    >>> kernel = ConstantKernel(constant_value=1.0, constant_value_bounds=(0.0, 10.0)) * RBF(length_scale=0.5, length_scale_bounds=(0.0, 10.0)) + RBF(length_scale=2.0, length_scale_bounds=(0.0, 10.0))
-    >>> for hyperparameter in kernel.hyperparameters: print(hyperparameter)
-    Hyperparameter(name='k1__k1__constant_value', value_type='numeric', bounds=array([[ 0., 10.]]), n_elements=1, fixed=False)
-    Hyperparameter(name='k1__k2__length_scale', value_type='numeric', bounds=array([[ 0., 10.]]), n_elements=1, fixed=False)
-    Hyperparameter(name='k2__length_scale', value_type='numeric', bounds=array([[ 0., 10.]]), n_elements=1, fixed=False)
-    >>> params = kernel.get_params()
-    >>> for key in sorted(params): print("%s : %s" % (key, params[key]))
-    k1 : 1**2 * RBF(length_scale=0.5)
-    k1__k1 : 1**2
-    k1__k1__constant_value : 1.0
-    k1__k1__constant_value_bounds : (0.0, 10.0)
-    k1__k2 : RBF(length_scale=0.5)
-    k1__k2__length_scale : 0.5
-    k1__k2__length_scale_bounds : (0.0, 10.0)
-    k2 : RBF(length_scale=2)
-    k2__length_scale : 2.0
-    k2__length_scale_bounds : (0.0, 10.0)
-    >>> print(kernel.theta)  # Note: log-transformed
-    [ 0.         -0.69314718  0.69314718]
-    >>> print(kernel.bounds)  # Note: log-transformed
-    [[      -inf 2.30258509]
-     [      -inf 2.30258509]
-     [      -inf 2.30258509]]
-
-
-All Gaussian process kernels are interoperable with :mod:`sklearn.metrics.pairwise`
-and vice versa: instances of subclasses of :class:`Kernel` can be passed as
-``metric`` to ``pairwise_kernels`` from :mod:`sklearn.metrics.pairwise`. Moreover,
-kernel functions from pairwise can be used as GP kernels by using the wrapper
-class :class:`PairwiseKernel`. The only caveat is that the gradient of
-the hyperparameters is not analytic but numeric and all those kernels support
-only isotropic distances. The parameter ``gamma`` is considered to be a
-hyperparameter and may be optimized. The other kernel parameters are set
-directly at initialization and are kept fixed.
-
-|details-end|
+.. dropdown:: Gaussian Process Kernel API
+
+   The main usage of a :class:`Kernel` is to compute the GP's covariance between
+   datapoints. For this, the method ``__call__`` of the kernel can be called. This
+   method can either be used to compute the "auto-covariance" of all pairs of
+   datapoints in a 2d array X, or the "cross-covariance" of all combinations
+   of datapoints of a 2d array X with datapoints in a 2d array Y. The following
+   identity holds true for all kernels k (except for the :class:`WhiteKernel`):
+   ``k(X) == K(X, Y=X)``
+
+   If only the diagonal of the auto-covariance is being used, the method ``diag()``
+   of a kernel can be called, which is more computationally efficient than the
+   equivalent call to ``__call__``: ``np.diag(k(X, X)) == k.diag(X)``
+
+   Kernels are parameterized by a vector :math:`\theta` of hyperparameters. These
+   hyperparameters can for instance control length-scales or periodicity of a
+   kernel (see below). All kernels support computing analytic gradients
+   of the kernel's auto-covariance with respect to :math:`log(\theta)` via setting
+   ``eval_gradient=True`` in the ``__call__`` method.
+   That is, a ``(len(X), len(X), len(theta))`` array is returned where the entry
+   ``[i, j, l]`` contains :math:`\frac{\partial k_\theta(x_i, x_j)}{\partial log(\theta_l)}`.
+   This gradient is used by the Gaussian process (both regressor and classifier)
+   in computing the gradient of the log-marginal-likelihood, which in turn is used
+   to determine the value of :math:`\theta`, which maximizes the log-marginal-likelihood,
+   via gradient ascent. For each hyperparameter, the initial value and the
+   bounds need to be specified when creating an instance of the kernel. The
+   current value of :math:`\theta` can be get and set via the property
+   ``theta`` of the kernel object. Moreover, the bounds of the hyperparameters can be
+   accessed by the property ``bounds`` of the kernel. Note that both properties
+   (theta and bounds) return log-transformed values of the internally used values
+   since those are typically more amenable to gradient-based optimization.
+   The specification of each hyperparameter is stored in the form of an instance of
+   :class:`Hyperparameter` in the respective kernel. Note that a kernel using a
+   hyperparameter with name "x" must have the attributes self.x and self.x_bounds.
+
+   The abstract base class for all kernels is :class:`Kernel`. Kernel implements a
+   similar interface as :class:`~sklearn.base.BaseEstimator`, providing the
+   methods ``get_params()``, ``set_params()``, and ``clone()``. This allows
+   setting kernel values also via meta-estimators such as
+   :class:`~sklearn.pipeline.Pipeline` or
+   :class:`~sklearn.model_selection.GridSearchCV`. Note that due to the nested
+   structure of kernels (by applying kernel operators, see below), the names of
+   kernel parameters might become relatively complicated. In general, for a binary
+   kernel operator, parameters of the left operand are prefixed with ``k1__`` and
+   parameters of the right operand with ``k2__``. An additional convenience method
+   is ``clone_with_theta(theta)``, which returns a cloned version of the kernel
+   but with the hyperparameters set to ``theta``. An illustrative example:
+
+      >>> from sklearn.gaussian_process.kernels import ConstantKernel, RBF
+      >>> kernel = ConstantKernel(constant_value=1.0, constant_value_bounds=(0.0, 10.0)) * RBF(length_scale=0.5, length_scale_bounds=(0.0, 10.0)) + RBF(length_scale=2.0, length_scale_bounds=(0.0, 10.0))
+      >>> for hyperparameter in kernel.hyperparameters: print(hyperparameter)
+      Hyperparameter(name='k1__k1__constant_value', value_type='numeric', bounds=array([[ 0., 10.]]), n_elements=1, fixed=False)
+      Hyperparameter(name='k1__k2__length_scale', value_type='numeric', bounds=array([[ 0., 10.]]), n_elements=1, fixed=False)
+      Hyperparameter(name='k2__length_scale', value_type='numeric', bounds=array([[ 0., 10.]]), n_elements=1, fixed=False)
+      >>> params = kernel.get_params()
+      >>> for key in sorted(params): print("%s : %s" % (key, params[key]))
+      k1 : 1**2 * RBF(length_scale=0.5)
+      k1__k1 : 1**2
+      k1__k1__constant_value : 1.0
+      k1__k1__constant_value_bounds : (0.0, 10.0)
+      k1__k2 : RBF(length_scale=0.5)
+      k1__k2__length_scale : 0.5
+      k1__k2__length_scale_bounds : (0.0, 10.0)
+      k2 : RBF(length_scale=2)
+      k2__length_scale : 2.0
+      k2__length_scale_bounds : (0.0, 10.0)
+      >>> print(kernel.theta)  # Note: log-transformed
+      [ 0.         -0.69314718  0.69314718]
+      >>> print(kernel.bounds)  # Note: log-transformed
+      [[      -inf 2.30258509]
+      [      -inf 2.30258509]
+      [      -inf 2.30258509]]
+
+   All Gaussian process kernels are interoperable with :mod:`sklearn.metrics.pairwise`
+   and vice versa: instances of subclasses of :class:`Kernel` can be passed as
+   ``metric`` to ``pairwise_kernels`` from :mod:`sklearn.metrics.pairwise`. Moreover,
+   kernel functions from pairwise can be used as GP kernels by using the wrapper
+   class :class:`PairwiseKernel`. The only caveat is that the gradient of
+   the hyperparameters is not analytic but numeric and all those kernels support
+   only isotropic distances. The parameter ``gamma`` is considered to be a
+   hyperparameter and may be optimized. The other kernel parameters are set
+   directly at initialization and are kept fixed.
 
 Basic kernels
 -------------
@@ -388,42 +383,38 @@ The :class:`Matern` kernel is a stationary kernel and a generalization of the
 :class:`RBF` kernel. It has an additional parameter :math:`\nu` which controls
 the smoothness of the resulting function. It is parameterized by a length-scale parameter :math:`l>0`, which can either be a scalar (isotropic variant of the kernel) or a vector with the same number of dimensions as the inputs :math:`x` (anisotropic variant of the kernel).
 
-|details-start|
-**Mathematical implementation of Matérn kernel**
-|details-split|
+.. dropdown:: Mathematical implementation of Matérn kernel
 
-The kernel is given by:
-
-.. math::
+   The kernel is given by:
 
-    k(x_i, x_j) = \frac{1}{\Gamma(\nu)2^{\nu-1}}\Bigg(\frac{\sqrt{2\nu}}{l} d(x_i , x_j )\Bigg)^\nu K_\nu\Bigg(\frac{\sqrt{2\nu}}{l} d(x_i , x_j )\Bigg),
+   .. math::
 
-where :math:`d(\cdot,\cdot)` is the Euclidean distance, :math:`K_\nu(\cdot)` is a modified Bessel function and :math:`\Gamma(\cdot)` is the gamma function.
-As :math:`\nu\rightarrow\infty`, the Matérn kernel converges to the RBF kernel.
-When :math:`\nu = 1/2`, the Matérn kernel becomes identical to the absolute
-exponential kernel, i.e.,
+      k(x_i, x_j) = \frac{1}{\Gamma(\nu)2^{\nu-1}}\Bigg(\frac{\sqrt{2\nu}}{l} d(x_i , x_j )\Bigg)^\nu K_\nu\Bigg(\frac{\sqrt{2\nu}}{l} d(x_i , x_j )\Bigg),
 
-.. math::
-    k(x_i, x_j) = \exp \Bigg(- \frac{1}{l} d(x_i , x_j ) \Bigg) \quad \quad \nu= \tfrac{1}{2}
+   where :math:`d(\cdot,\cdot)` is the Euclidean distance, :math:`K_\nu(\cdot)` is a modified Bessel function and :math:`\Gamma(\cdot)` is the gamma function.
+   As :math:`\nu\rightarrow\infty`, the Matérn kernel converges to the RBF kernel.
+   When :math:`\nu = 1/2`, the Matérn kernel becomes identical to the absolute
+   exponential kernel, i.e.,
 
-In particular, :math:`\nu = 3/2`:
+   .. math::
+      k(x_i, x_j) = \exp \Bigg(- \frac{1}{l} d(x_i , x_j ) \Bigg) \quad \quad \nu= \tfrac{1}{2}
 
-.. math::
-    k(x_i, x_j) =  \Bigg(1 + \frac{\sqrt{3}}{l} d(x_i , x_j )\Bigg) \exp \Bigg(-\frac{\sqrt{3}}{l} d(x_i , x_j ) \Bigg) \quad \quad \nu= \tfrac{3}{2}
+   In particular, :math:`\nu = 3/2`:
 
-and :math:`\nu = 5/2`:
+   .. math::
+      k(x_i, x_j) =  \Bigg(1 + \frac{\sqrt{3}}{l} d(x_i , x_j )\Bigg) \exp \Bigg(-\frac{\sqrt{3}}{l} d(x_i , x_j ) \Bigg) \quad \quad \nu= \tfrac{3}{2}
 
-.. math::
-    k(x_i, x_j) = \Bigg(1 + \frac{\sqrt{5}}{l} d(x_i , x_j ) +\frac{5}{3l} d(x_i , x_j )^2 \Bigg) \exp \Bigg(-\frac{\sqrt{5}}{l} d(x_i , x_j ) \Bigg) \quad \quad \nu= \tfrac{5}{2}
+   and :math:`\nu = 5/2`:
 
-are popular choices for learning functions that are not infinitely
-differentiable (as assumed by the RBF kernel) but at least once (:math:`\nu =
-3/2`) or twice differentiable (:math:`\nu = 5/2`).
+   .. math::
+      k(x_i, x_j) = \Bigg(1 + \frac{\sqrt{5}}{l} d(x_i , x_j ) +\frac{5}{3l} d(x_i , x_j )^2 \Bigg) \exp \Bigg(-\frac{\sqrt{5}}{l} d(x_i , x_j ) \Bigg) \quad \quad \nu= \tfrac{5}{2}
 
-The flexibility of controlling the smoothness of the learned function via :math:`\nu`
-allows adapting to the properties of the true underlying functional relation.
+   are popular choices for learning functions that are not infinitely
+   differentiable (as assumed by the RBF kernel) but at least once (:math:`\nu =
+   3/2`) or twice differentiable (:math:`\nu = 5/2`).
 
-|details-end|
+   The flexibility of controlling the smoothness of the learned function via :math:`\nu`
+   allows adapting to the properties of the true underlying functional relation.
 
 The prior and posterior of a GP resulting from a Matérn kernel are shown in
 the following figure:
diff --git a/doc/modules/grid_search.rst b/doc/modules/grid_search.rst
index 01c5a5c72ee52..12ee76d8e4d39 100644
--- a/doc/modules/grid_search.rst
+++ b/doc/modules/grid_search.rst
@@ -72,35 +72,35 @@ evaluated and the best combination is retained.
 
 .. currentmodule:: sklearn.model_selection
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    - See :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_digits.py` for an example of
-      Grid Search computation on the digits dataset.
+- See :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_digits.py` for an example of
+  Grid Search computation on the digits dataset.
 
-    - See :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_text_feature_extraction.py` for an example
-      of Grid Search coupling parameters from a text documents feature
-      extractor (n-gram count vectorizer and TF-IDF transformer) with a
-      classifier (here a linear SVM trained with SGD with either elastic
-      net or L2 penalty) using a :class:`~sklearn.pipeline.Pipeline` instance.
+- See :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_text_feature_extraction.py` for an example
+  of Grid Search coupling parameters from a text documents feature
+  extractor (n-gram count vectorizer and TF-IDF transformer) with a
+  classifier (here a linear SVM trained with SGD with either elastic
+  net or L2 penalty) using a :class:`~sklearn.pipeline.Pipeline` instance.
 
-    - See :ref:`sphx_glr_auto_examples_model_selection_plot_nested_cross_validation_iris.py`
-      for an example of Grid Search within a cross validation loop on the iris
-      dataset. This is the best practice for evaluating the performance of a
-      model with grid search.
+- See :ref:`sphx_glr_auto_examples_model_selection_plot_nested_cross_validation_iris.py`
+  for an example of Grid Search within a cross validation loop on the iris
+  dataset. This is the best practice for evaluating the performance of a
+  model with grid search.
 
-    - See :ref:`sphx_glr_auto_examples_model_selection_plot_multi_metric_evaluation.py`
-      for an example of :class:`GridSearchCV` being used to evaluate multiple
-      metrics simultaneously.
+- See :ref:`sphx_glr_auto_examples_model_selection_plot_multi_metric_evaluation.py`
+  for an example of :class:`GridSearchCV` being used to evaluate multiple
+  metrics simultaneously.
 
-    - See :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_refit_callable.py`
-      for an example of using ``refit=callable`` interface in
-      :class:`GridSearchCV`. The example shows how this interface adds certain
-      amount of flexibility in identifying the "best" estimator. This interface
-      can also be used in multiple metrics evaluation.
+- See :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_refit_callable.py`
+  for an example of using ``refit=callable`` interface in
+  :class:`GridSearchCV`. The example shows how this interface adds certain
+  amount of flexibility in identifying the "best" estimator. This interface
+  can also be used in multiple metrics evaluation.
 
-    - See :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_stats.py`
-      for an example of how to do a statistical comparison on the outputs of
-      :class:`GridSearchCV`.
+- See :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_stats.py`
+  for an example of how to do a statistical comparison on the outputs of
+  :class:`GridSearchCV`.
 
 .. _randomized_parameter_search:
 
@@ -161,16 +161,16 @@ variable that is log-uniformly distributed between ``1e0`` and ``1e3``::
    'kernel': ['rbf'],
    'class_weight':['balanced', None]}
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_model_selection_plot_randomized_search.py` compares the usage and efficiency
-      of randomized search and grid search.
+* :ref:`sphx_glr_auto_examples_model_selection_plot_randomized_search.py` compares the usage and efficiency
+  of randomized search and grid search.
 
-.. topic:: References:
+.. rubric:: References
 
-    * Bergstra, J. and Bengio, Y.,
-      Random search for hyper-parameter optimization,
-      The Journal of Machine Learning Research (2012)
+* Bergstra, J. and Bengio, Y.,
+  Random search for hyper-parameter optimization,
+  The Journal of Machine Learning Research (2012)
 
 .. _successive_halving_user_guide:
 
@@ -222,10 +222,10 @@ need to explicitly import ``enable_halving_search_cv``::
   >>> from sklearn.model_selection import HalvingGridSearchCV
   >>> from sklearn.model_selection import HalvingRandomSearchCV
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_model_selection_plot_successive_halving_heatmap.py`
-    * :ref:`sphx_glr_auto_examples_model_selection_plot_successive_halving_iterations.py`
+* :ref:`sphx_glr_auto_examples_model_selection_plot_successive_halving_heatmap.py`
+* :ref:`sphx_glr_auto_examples_model_selection_plot_successive_halving_iterations.py`
 
 Choosing ``min_resources`` and the number of candidates
 -------------------------------------------------------
@@ -528,15 +528,16 @@ In the example above, the best parameter combination is ``{'criterion':
 since it has reached the last iteration (3) with the highest score:
 0.96.
 
-.. topic:: References:
+.. rubric:: References
 
-    .. [1] K. Jamieson, A. Talwalkar,
-       `Non-stochastic Best Arm Identification and Hyperparameter
-       Optimization <http://proceedings.mlr.press/v51/jamieson16.html>`_, in
-       proc. of Machine Learning Research, 2016.
-    .. [2] L. Li, K. Jamieson, G. DeSalvo, A. Rostamizadeh, A. Talwalkar,
-       :arxiv:`Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization
-       <1603.06560>`, in Machine Learning Research 18, 2018.
+.. [1] K. Jamieson, A. Talwalkar,
+   `Non-stochastic Best Arm Identification and Hyperparameter
+   Optimization <http://proceedings.mlr.press/v51/jamieson16.html>`_, in
+   proc. of Machine Learning Research, 2016.
+
+.. [2] L. Li, K. Jamieson, G. DeSalvo, A. Rostamizadeh, A. Talwalkar,
+   :arxiv:`Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization
+   <1603.06560>`, in Machine Learning Research 18, 2018.
 
 .. _grid_search_tips:
 
diff --git a/doc/modules/impute.rst b/doc/modules/impute.rst
index f5879cbffc0a5..1431f26132338 100644
--- a/doc/modules/impute.rst
+++ b/doc/modules/impute.rst
@@ -224,13 +224,13 @@ neighbors of samples with missing values::
 
 For another example on usage, see :ref:`sphx_glr_auto_examples_impute_plot_missing_values.py`.
 
-.. topic:: References
+.. rubric:: References
 
-  .. [OL2001] `Olga Troyanskaya, Michael Cantor, Gavin Sherlock, Pat Brown,
-      Trevor Hastie, Robert Tibshirani, David Botstein and Russ B. Altman,
-      Missing value estimation methods for DNA microarrays, BIOINFORMATICS
-      Vol. 17 no. 6, 2001 Pages 520-525.
-      <https://academic.oup.com/bioinformatics/article/17/6/520/272365>`_
+.. [OL2001] `Olga Troyanskaya, Michael Cantor, Gavin Sherlock, Pat Brown,
+    Trevor Hastie, Robert Tibshirani, David Botstein and Russ B. Altman,
+    Missing value estimation methods for DNA microarrays, BIOINFORMATICS
+    Vol. 17 no. 6, 2001 Pages 520-525.
+    <https://academic.oup.com/bioinformatics/article/17/6/520/272365>`_
 
 Keeping the number of features constant
 =======================================
diff --git a/doc/modules/isotonic.rst b/doc/modules/isotonic.rst
index 6cfdc1669de5d..50fbdb24e72c7 100644
--- a/doc/modules/isotonic.rst
+++ b/doc/modules/isotonic.rst
@@ -32,6 +32,6 @@ thus form a function that is piecewise linear:
    :target: ../auto_examples/miscellaneous/plot_isotonic_regression.html
    :align: center
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_miscellaneous_plot_isotonic_regression.py`
+* :ref:`sphx_glr_auto_examples_miscellaneous_plot_isotonic_regression.py`
diff --git a/doc/modules/kernel_approximation.rst b/doc/modules/kernel_approximation.rst
index 0c67c36178e3b..305c3cc6601fb 100644
--- a/doc/modules/kernel_approximation.rst
+++ b/doc/modules/kernel_approximation.rst
@@ -88,12 +88,12 @@ function or a precomputed kernel matrix. The number of samples used - which is
 also the dimensionality of the features computed - is given by the parameter
 ``n_components``.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * See the example entitled
-      :ref:`sphx_glr_auto_examples_applications_plot_cyclical_feature_engineering.py`,
-      that shows an efficient machine learning pipeline that uses a
-      :class:`Nystroem` kernel.
+* See the example entitled
+  :ref:`sphx_glr_auto_examples_applications_plot_cyclical_feature_engineering.py`,
+  that shows an efficient machine learning pipeline that uses a
+  :class:`Nystroem` kernel.
 
 .. _rbf_kernel_approx:
 
@@ -143,9 +143,9 @@ use of larger feature spaces more efficient.
 
     Comparing an exact RBF kernel (left) with the approximation (right)
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_miscellaneous_plot_kernel_approximation.py`
+* :ref:`sphx_glr_auto_examples_miscellaneous_plot_kernel_approximation.py`
 
 .. _additive_chi_kernel_approx:
 
@@ -241,9 +241,9 @@ In addition, this method can transform samples in
 time, where :math:`n_{\text{components}}` is the desired output dimension,
 determined by ``n_components``.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_kernel_approximation_plot_scalable_poly_kernels.py`
+* :ref:`sphx_glr_auto_examples_kernel_approximation_plot_scalable_poly_kernels.py`
 
 .. _tensor_sketch_kernel_approx:
 
@@ -283,29 +283,29 @@ The classes in this submodule allow to approximate the embedding
 or store training examples.
 
 
-.. topic:: References:
-
-    .. [WS2001] `"Using the Nyström method to speed up kernel machines"
-      <https://papers.nips.cc/paper_files/paper/2000/hash/19de10adbaa1b2ee13f77f679fa1483a-Abstract.html>`_
-      Williams, C.K.I.; Seeger, M. - 2001.
-    .. [RR2007] `"Random features for large-scale kernel machines"
-      <https://papers.nips.cc/paper/2007/hash/013a006f03dbc5392effeb8f18fda755-Abstract.html>`_
-      Rahimi, A. and Recht, B. - Advances in neural information processing 2007,
-    .. [LS2010] `"Random Fourier approximations for skewed multiplicative histogram kernels"
-      <https://www.researchgate.net/publication/221114584_Random_Fourier_Approximations_for_Skewed_Multiplicative_Histogram_Kernels>`_
-      Li, F., Ionescu, C., and Sminchisescu, C.
-      - Pattern Recognition,  DAGM 2010, Lecture Notes in Computer Science.
-    .. [VZ2010] `"Efficient additive kernels via explicit feature maps"
-      <https://www.robots.ox.ac.uk/~vgg/publications/2011/Vedaldi11/vedaldi11.pdf>`_
-      Vedaldi, A. and Zisserman, A. - Computer Vision and Pattern Recognition 2010
-    .. [VVZ2010] `"Generalized RBF feature maps for Efficient Detection"
-      <https://www.robots.ox.ac.uk/~vgg/publications/2010/Sreekanth10/sreekanth10.pdf>`_
-      Vempati, S. and Vedaldi, A. and Zisserman, A. and Jawahar, CV - 2010
-    .. [PP2013] :doi:`"Fast and scalable polynomial kernels via explicit feature maps"
-      <10.1145/2487575.2487591>`
-      Pham, N., & Pagh, R. - 2013
-    .. [CCF2002] `"Finding frequent items in data streams"
-      <https://www.cs.princeton.edu/courses/archive/spring04/cos598B/bib/CharikarCF.pdf>`_
-      Charikar, M., Chen, K., & Farach-Colton - 2002
-    .. [WIKICS] `"Wikipedia: Count sketch"
-      <https://en.wikipedia.org/wiki/Count_sketch>`_
+.. rubric:: References
+
+.. [WS2001] `"Using the Nyström method to speed up kernel machines"
+  <https://papers.nips.cc/paper_files/paper/2000/hash/19de10adbaa1b2ee13f77f679fa1483a-Abstract.html>`_
+  Williams, C.K.I.; Seeger, M. - 2001.
+.. [RR2007] `"Random features for large-scale kernel machines"
+  <https://papers.nips.cc/paper/2007/hash/013a006f03dbc5392effeb8f18fda755-Abstract.html>`_
+  Rahimi, A. and Recht, B. - Advances in neural information processing 2007,
+.. [LS2010] `"Random Fourier approximations for skewed multiplicative histogram kernels"
+  <https://www.researchgate.net/publication/221114584_Random_Fourier_Approximations_for_Skewed_Multiplicative_Histogram_Kernels>`_
+  Li, F., Ionescu, C., and Sminchisescu, C.
+  - Pattern Recognition,  DAGM 2010, Lecture Notes in Computer Science.
+.. [VZ2010] `"Efficient additive kernels via explicit feature maps"
+  <https://www.robots.ox.ac.uk/~vgg/publications/2011/Vedaldi11/vedaldi11.pdf>`_
+  Vedaldi, A. and Zisserman, A. - Computer Vision and Pattern Recognition 2010
+.. [VVZ2010] `"Generalized RBF feature maps for Efficient Detection"
+  <https://www.robots.ox.ac.uk/~vgg/publications/2010/Sreekanth10/sreekanth10.pdf>`_
+  Vempati, S. and Vedaldi, A. and Zisserman, A. and Jawahar, CV - 2010
+.. [PP2013] :doi:`"Fast and scalable polynomial kernels via explicit feature maps"
+  <10.1145/2487575.2487591>`
+  Pham, N., & Pagh, R. - 2013
+.. [CCF2002] `"Finding frequent items in data streams"
+  <https://www.cs.princeton.edu/courses/archive/spring04/cos598B/bib/CharikarCF.pdf>`_
+  Charikar, M., Chen, K., & Farach-Colton - 2002
+.. [WIKICS] `"Wikipedia: Count sketch"
+  <https://en.wikipedia.org/wiki/Count_sketch>`_
diff --git a/doc/modules/kernel_ridge.rst b/doc/modules/kernel_ridge.rst
index 5d25ce71f5ea1..fcc19a49628c4 100644
--- a/doc/modules/kernel_ridge.rst
+++ b/doc/modules/kernel_ridge.rst
@@ -55,11 +55,11 @@ dense model.
    :target: ../auto_examples/miscellaneous/plot_kernel_ridge_regression.html
    :align: center
 
-.. topic:: Examples
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_miscellaneous_plot_kernel_ridge_regression.py`
+* :ref:`sphx_glr_auto_examples_miscellaneous_plot_kernel_ridge_regression.py`
 
-.. topic:: References:
+.. rubric:: References
 
-    .. [M2012] "Machine Learning: A Probabilistic Perspective"
-      Murphy, K. P. - chapter 14.4.3, pp. 492-493, The MIT Press, 2012
+.. [M2012] "Machine Learning: A Probabilistic Perspective"
+   Murphy, K. P. - chapter 14.4.3, pp. 492-493, The MIT Press, 2012
diff --git a/doc/modules/lda_qda.rst b/doc/modules/lda_qda.rst
index 850a848fe3f73..0d264ec662a9f 100644
--- a/doc/modules/lda_qda.rst
+++ b/doc/modules/lda_qda.rst
@@ -29,10 +29,10 @@ Discriminant Analysis can only learn linear boundaries, while Quadratic
 Discriminant Analysis can learn quadratic boundaries and is therefore more
 flexible.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    :ref:`sphx_glr_auto_examples_classification_plot_lda_qda.py`: Comparison of LDA and QDA
-    on synthetic data.
+* :ref:`sphx_glr_auto_examples_classification_plot_lda_qda.py`: Comparison of LDA and
+  QDA on synthetic data.
 
 Dimensionality reduction using Linear Discriminant Analysis
 ===========================================================
@@ -49,10 +49,10 @@ This is implemented in the `transform` method. The desired dimensionality can
 be set using the ``n_components`` parameter. This parameter has no influence
 on the `fit` and `predict` methods.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    :ref:`sphx_glr_auto_examples_decomposition_plot_pca_vs_lda.py`: Comparison of LDA and PCA
-    for dimensionality reduction of the Iris dataset
+* :ref:`sphx_glr_auto_examples_decomposition_plot_pca_vs_lda.py`: Comparison of LDA and
+  PCA for dimensionality reduction of the Iris dataset
 
 .. _lda_qda_math:
 
@@ -194,7 +194,7 @@ Oracle Approximating Shrinkage estimator :class:`sklearn.covariance.OAS`
 yields a smaller Mean Squared Error than the one given by Ledoit and Wolf's
 formula used with shrinkage="auto". In LDA, the data are assumed to be gaussian
 conditionally to the class. If these assumptions hold, using LDA with
-the OAS estimator of covariance will yield a better classification 
+the OAS estimator of covariance will yield a better classification
 accuracy than if Ledoit and Wolf or the empirical covariance estimator is used.
 
 The covariance estimator can be chosen using with the ``covariance_estimator``
@@ -210,10 +210,10 @@ class. A covariance estimator should have a :term:`fit` method and a
 
 .. centered:: |shrinkage|
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    :ref:`sphx_glr_auto_examples_classification_plot_lda.py`: Comparison of LDA classifiers
-    with Empirical, Ledoit Wolf and OAS covariance estimator.
+* :ref:`sphx_glr_auto_examples_classification_plot_lda.py`: Comparison of LDA classifiers
+  with Empirical, Ledoit Wolf and OAS covariance estimator.
 
 Estimation algorithms
 =====================
@@ -253,13 +253,13 @@ transform, and it supports shrinkage. However, the 'eigen' solver needs to
 compute the covariance matrix, so it might not be suitable for situations with
 a high number of features.
 
-.. topic:: References:
+.. rubric:: References
 
-   .. [1] "The Elements of Statistical Learning", Hastie T., Tibshirani R.,
-      Friedman J., Section 4.3, p.106-119, 2008.
+.. [1] "The Elements of Statistical Learning", Hastie T., Tibshirani R.,
+    Friedman J., Section 4.3, p.106-119, 2008.
 
-   .. [2] Ledoit O, Wolf M. Honey, I Shrunk the Sample Covariance Matrix.
-      The Journal of Portfolio Management 30(4), 110-119, 2004.
+.. [2] Ledoit O, Wolf M. Honey, I Shrunk the Sample Covariance Matrix.
+    The Journal of Portfolio Management 30(4), 110-119, 2004.
 
-   .. [3] R. O. Duda, P. E. Hart, D. G. Stork. Pattern Classification
-      (Second Edition), section 2.6.2.
+.. [3] R. O. Duda, P. E. Hart, D. G. Stork. Pattern Classification
+    (Second Edition), section 2.6.2.
diff --git a/doc/modules/learning_curve.rst b/doc/modules/learning_curve.rst
index 3d458a1a67416..f5af5a748500a 100644
--- a/doc/modules/learning_curve.rst
+++ b/doc/modules/learning_curve.rst
@@ -39,11 +39,11 @@ easy to see whether the estimator suffers from bias or variance. However, in
 high-dimensional spaces, models can become very difficult to visualize. For
 this reason, it is often helpful to use the tools described below.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-   * :ref:`sphx_glr_auto_examples_model_selection_plot_underfitting_overfitting.py`
-   * :ref:`sphx_glr_auto_examples_model_selection_plot_validation_curve.py`
-   * :ref:`sphx_glr_auto_examples_model_selection_plot_learning_curve.py`
+* :ref:`sphx_glr_auto_examples_model_selection_plot_underfitting_overfitting.py`
+* :ref:`sphx_glr_auto_examples_model_selection_plot_validation_curve.py`
+* :ref:`sphx_glr_auto_examples_model_selection_plot_learning_curve.py`
 
 
 .. _validation_curve:
diff --git a/doc/modules/linear_model.rst b/doc/modules/linear_model.rst
index b92a8c2a01019..d06101adabdb5 100644
--- a/doc/modules/linear_model.rst
+++ b/doc/modules/linear_model.rst
@@ -57,9 +57,9 @@ to random errors in the observed target, producing a large
 variance. This situation of *multicollinearity* can arise, for
 example, when data are collected without an experimental design.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-   * :ref:`sphx_glr_auto_examples_linear_model_plot_ols.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_ols.py`
 
 Non-Negative Least Squares
 --------------------------
@@ -71,9 +71,9 @@ quantities (e.g., frequency counts or prices of goods).
 parameter: when set to `True` `Non-Negative Least Squares
 <https://en.wikipedia.org/wiki/Non-negative_least_squares>`_ are then applied.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-   * :ref:`sphx_glr_auto_examples_linear_model_plot_nnls.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_nnls.py`
 
 Ordinary Least Squares Complexity
 ---------------------------------
@@ -172,11 +172,11 @@ Machines
 <https://en.wikipedia.org/wiki/Least-squares_support-vector_machine>`_ with
 a linear kernel.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_ridge_path.py`
-  * :ref:`sphx_glr_auto_examples_text_plot_document_classification_20newsgroups.py`
-  * :ref:`sphx_glr_auto_examples_inspection_plot_linear_model_coefficient_interpretation.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_ridge_path.py`
+* :ref:`sphx_glr_auto_examples_text_plot_document_classification_20newsgroups.py`
+* :ref:`sphx_glr_auto_examples_inspection_plot_linear_model_coefficient_interpretation.py`
 
 Ridge Complexity
 ----------------
@@ -216,13 +216,11 @@ cross-validation with :class:`~sklearn.model_selection.GridSearchCV`, for
 example `cv=10` for 10-fold cross-validation, rather than Leave-One-Out
 Cross-Validation.
 
-.. topic:: References:
-
+.. dropdown:: References
 
   .. [RL2007] "Notes on Regularized Least Squares", Rifkin & Lippert (`technical report
     <http://cbcl.mit.edu/publications/ps/MIT-CSAIL-TR-2007-025.pdf>`_,
-    `course slides
-    <https://www.mit.edu/~9.520/spring07/Classes/rlsslides.pdf>`_).
+    `course slides <https://www.mit.edu/~9.520/spring07/Classes/rlsslides.pdf>`_).
 
 .. _lasso:
 
@@ -262,11 +260,11 @@ for another implementation::
 The function :func:`lasso_path` is useful for lower-level tasks, as it
 computes the coefficients along the full path of possible values.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_lasso_and_elasticnet.py`
-  * :ref:`sphx_glr_auto_examples_applications_plot_tomography_l1_reconstruction.py`
-  * :ref:`sphx_glr_auto_examples_inspection_plot_linear_model_coefficient_interpretation.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_lasso_and_elasticnet.py`
+* :ref:`sphx_glr_auto_examples_applications_plot_tomography_l1_reconstruction.py`
+* :ref:`sphx_glr_auto_examples_inspection_plot_linear_model_coefficient_interpretation.py`
 
 
 .. note:: **Feature selection with Lasso**
@@ -275,23 +273,19 @@ computes the coefficients along the full path of possible values.
       thus be used to perform feature selection, as detailed in
       :ref:`l1_feature_selection`.
 
-|details-start|
-**References**
-|details-split|
-
-The following two references explain the iterations
-used in the coordinate descent solver of scikit-learn, as well as
-the duality gap computation used for convergence control.
+.. dropdown:: References
 
-* "Regularization Path For Generalized linear Models by Coordinate Descent",
-  Friedman, Hastie & Tibshirani, J Stat Softw, 2010 (`Paper
-  <https://www.jstatsoft.org/article/view/v033i01/v33i01.pdf>`__).
-* "An Interior-Point Method for Large-Scale L1-Regularized Least Squares,"
-  S. J. Kim, K. Koh, M. Lustig, S. Boyd and D. Gorinevsky,
-  in IEEE Journal of Selected Topics in Signal Processing, 2007
-  (`Paper <https://web.stanford.edu/~boyd/papers/pdf/l1_ls.pdf>`__)
+  The following two references explain the iterations
+  used in the coordinate descent solver of scikit-learn, as well as
+  the duality gap computation used for convergence control.
 
-|details-end|
+  * "Regularization Path For Generalized linear Models by Coordinate Descent",
+    Friedman, Hastie & Tibshirani, J Stat Softw, 2010 (`Paper
+    <https://www.jstatsoft.org/article/view/v033i01/v33i01.pdf>`__).
+  * "An Interior-Point Method for Large-Scale L1-Regularized Least Squares,"
+    S. J. Kim, K. Koh, M. Lustig, S. Boyd and D. Gorinevsky,
+    in IEEE Journal of Selected Topics in Signal Processing, 2007
+    (`Paper <https://web.stanford.edu/~boyd/papers/pdf/l1_ls.pdf>`__)
 
 Setting regularization parameter
 --------------------------------
@@ -348,10 +342,10 @@ the problem is badly conditioned (e.g. more features than samples).
     :align: center
     :scale: 50%
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_lasso_model_selection.py`
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_lasso_lars_ic.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_lasso_model_selection.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_lasso_lars_ic.py`
 
 .. _aic_bic:
 
@@ -362,59 +356,57 @@ The definition of AIC (and thus BIC) might differ in the literature. In this
 section, we give more information regarding the criterion computed in
 scikit-learn.
 
-|details-start|
-**Mathematical details**
-|details-split|
+.. dropdown:: Mathematical details
 
-The AIC criterion is defined as:
+  The AIC criterion is defined as:
 
-.. math::
-    AIC = -2 \log(\hat{L}) + 2 d
+  .. math::
+      AIC = -2 \log(\hat{L}) + 2 d
 
-where :math:`\hat{L}` is the maximum likelihood of the model and
-:math:`d` is the number of parameters (as well referred to as degrees of
-freedom in the previous section).
+  where :math:`\hat{L}` is the maximum likelihood of the model and
+  :math:`d` is the number of parameters (as well referred to as degrees of
+  freedom in the previous section).
 
-The definition of BIC replace the constant :math:`2` by :math:`\log(N)`:
+  The definition of BIC replace the constant :math:`2` by :math:`\log(N)`:
 
-.. math::
-    BIC = -2 \log(\hat{L}) + \log(N) d
+  .. math::
+      BIC = -2 \log(\hat{L}) + \log(N) d
 
-where :math:`N` is the number of samples.
+  where :math:`N` is the number of samples.
 
-For a linear Gaussian model, the maximum log-likelihood is defined as:
+  For a linear Gaussian model, the maximum log-likelihood is defined as:
 
-.. math::
-    \log(\hat{L}) = - \frac{n}{2} \log(2 \pi) - \frac{n}{2} \ln(\sigma^2) - \frac{\sum_{i=1}^{n} (y_i - \hat{y}_i)^2}{2\sigma^2}
+  .. math::
+      \log(\hat{L}) = - \frac{n}{2} \log(2 \pi) - \frac{n}{2} \ln(\sigma^2) - \frac{\sum_{i=1}^{n} (y_i - \hat{y}_i)^2}{2\sigma^2}
 
-where :math:`\sigma^2` is an estimate of the noise variance,
-:math:`y_i` and :math:`\hat{y}_i` are respectively the true and predicted
-targets, and :math:`n` is the number of samples.
+  where :math:`\sigma^2` is an estimate of the noise variance,
+  :math:`y_i` and :math:`\hat{y}_i` are respectively the true and predicted
+  targets, and :math:`n` is the number of samples.
 
-Plugging the maximum log-likelihood in the AIC formula yields:
+  Plugging the maximum log-likelihood in the AIC formula yields:
 
-.. math::
-    AIC = n \log(2 \pi \sigma^2) + \frac{\sum_{i=1}^{n} (y_i - \hat{y}_i)^2}{\sigma^2} + 2 d
+  .. math::
+      AIC = n \log(2 \pi \sigma^2) + \frac{\sum_{i=1}^{n} (y_i - \hat{y}_i)^2}{\sigma^2} + 2 d
 
-The first term of the above expression is sometimes discarded since it is a
-constant when :math:`\sigma^2` is provided. In addition,
-it is sometimes stated that the AIC is equivalent to the :math:`C_p` statistic
-[12]_. In a strict sense, however, it is equivalent only up to some constant
-and a multiplicative factor.
+  The first term of the above expression is sometimes discarded since it is a
+  constant when :math:`\sigma^2` is provided. In addition,
+  it is sometimes stated that the AIC is equivalent to the :math:`C_p` statistic
+  [12]_. In a strict sense, however, it is equivalent only up to some constant
+  and a multiplicative factor.
 
-At last, we mentioned above that :math:`\sigma^2` is an estimate of the
-noise variance. In :class:`LassoLarsIC` when the parameter `noise_variance` is
-not provided (default), the noise variance is estimated via the unbiased
-estimator [13]_ defined as:
+  At last, we mentioned above that :math:`\sigma^2` is an estimate of the
+  noise variance. In :class:`LassoLarsIC` when the parameter `noise_variance` is
+  not provided (default), the noise variance is estimated via the unbiased
+  estimator [13]_ defined as:
 
-.. math::
-    \sigma^2 = \frac{\sum_{i=1}^{n} (y_i - \hat{y}_i)^2}{n - p}
+  .. math::
+      \sigma^2 = \frac{\sum_{i=1}^{n} (y_i - \hat{y}_i)^2}{n - p}
 
-where :math:`p` is the number of features and :math:`\hat{y}_i` is the
-predicted target using an ordinary least squares regression. Note, that this
-formula is valid only when `n_samples > n_features`.
+  where :math:`p` is the number of features and :math:`\hat{y}_i` is the
+  predicted target using an ordinary least squares regression. Note, that this
+  formula is valid only when `n_samples > n_features`.
 
-.. topic:: References:
+  .. rubric:: References
 
   .. [12] :arxiv:`Zou, Hui, Trevor Hastie, and Robert Tibshirani.
           "On the degrees of freedom of the lasso."
@@ -426,8 +418,6 @@ formula is valid only when `n_samples > n_features`.
           Neural computation 15.7 (2003): 1691-1714.
           <10.1162/089976603321891864>`
 
-|details-end|
-
 Comparison with the regularization parameter of SVM
 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
 
@@ -463,33 +453,29 @@ the MultiTaskLasso are full columns.
 
 .. centered:: Fitting a time-series model, imposing that any active feature be active at all times.
 
-.. topic:: Examples:
-
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_multi_task_lasso_support.py`
+.. rubric:: Examples
 
+* :ref:`sphx_glr_auto_examples_linear_model_plot_multi_task_lasso_support.py`
 
-|details-start|
-**Mathematical details**
-|details-split|
 
-Mathematically, it consists of a linear model trained with a mixed
-:math:`\ell_1` :math:`\ell_2`-norm for regularization.
-The objective function to minimize is:
+.. dropdown:: Mathematical details
 
-.. math::  \min_{W} { \frac{1}{2n_{\text{samples}}} ||X W - Y||_{\text{Fro}} ^ 2 + \alpha ||W||_{21}}
+  Mathematically, it consists of a linear model trained with a mixed
+  :math:`\ell_1` :math:`\ell_2`-norm for regularization.
+  The objective function to minimize is:
 
-where :math:`\text{Fro}` indicates the Frobenius norm
+  .. math::  \min_{W} { \frac{1}{2n_{\text{samples}}} ||X W - Y||_{\text{Fro}} ^ 2 + \alpha ||W||_{21}}
 
-.. math:: ||A||_{\text{Fro}} = \sqrt{\sum_{ij} a_{ij}^2}
+  where :math:`\text{Fro}` indicates the Frobenius norm
 
-and :math:`\ell_1` :math:`\ell_2` reads
+  .. math:: ||A||_{\text{Fro}} = \sqrt{\sum_{ij} a_{ij}^2}
 
-.. math:: ||A||_{2 1} = \sum_i \sqrt{\sum_j a_{ij}^2}.
+  and :math:`\ell_1` :math:`\ell_2` reads
 
-The implementation in the class :class:`MultiTaskLasso` uses
-coordinate descent as the algorithm to fit the coefficients.
+  .. math:: ||A||_{2 1} = \sum_i \sqrt{\sum_j a_{ij}^2}.
 
-|details-end|
+  The implementation in the class :class:`MultiTaskLasso` uses
+  coordinate descent as the algorithm to fit the coefficients.
 
 .. _elastic_net:
 
@@ -526,28 +512,25 @@ The objective function to minimize is in this case
 The class :class:`ElasticNetCV` can be used to set the parameters
 ``alpha`` (:math:`\alpha`) and ``l1_ratio`` (:math:`\rho`) by cross-validation.
 
-.. topic:: Examples:
-
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_lasso_and_elasticnet.py`
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_lasso_coordinate_descent_path.py`
+.. rubric:: Examples
 
-|details-start|
-**References**
-|details-split|
+* :ref:`sphx_glr_auto_examples_linear_model_plot_lasso_and_elasticnet.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_lasso_coordinate_descent_path.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_elastic_net_precomputed_gram_matrix_with_weighted_samples.py`
 
-The following two references explain the iterations
-used in the coordinate descent solver of scikit-learn, as well as
-the duality gap computation used for convergence control.
+.. dropdown:: References
 
-* "Regularization Path For Generalized linear Models by Coordinate Descent",
-  Friedman, Hastie & Tibshirani, J Stat Softw, 2010 (`Paper
-  <https://www.jstatsoft.org/article/view/v033i01/v33i01.pdf>`__).
-* "An Interior-Point Method for Large-Scale L1-Regularized Least Squares,"
-  S. J. Kim, K. Koh, M. Lustig, S. Boyd and D. Gorinevsky,
-  in IEEE Journal of Selected Topics in Signal Processing, 2007
-  (`Paper <https://web.stanford.edu/~boyd/papers/pdf/l1_ls.pdf>`__)
+  The following two references explain the iterations
+  used in the coordinate descent solver of scikit-learn, as well as
+  the duality gap computation used for convergence control.
 
-|details-end|
+  * "Regularization Path For Generalized linear Models by Coordinate Descent",
+    Friedman, Hastie & Tibshirani, J Stat Softw, 2010 (`Paper
+    <https://www.jstatsoft.org/article/view/v033i01/v33i01.pdf>`__).
+  * "An Interior-Point Method for Large-Scale L1-Regularized Least Squares,"
+    S. J. Kim, K. Koh, M. Lustig, S. Boyd and D. Gorinevsky,
+    in IEEE Journal of Selected Topics in Signal Processing, 2007
+    (`Paper <https://web.stanford.edu/~boyd/papers/pdf/l1_ls.pdf>`__)
 
 .. _multi_task_elastic_net:
 
@@ -640,37 +623,33 @@ function of the norm of its coefficients.
    >>> reg.coef_
    array([0.6..., 0.        ])
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_linear_model_plot_lasso_lars.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_lasso_lars.py`
 
 The Lars algorithm provides the full path of the coefficients along
 the regularization parameter almost for free, thus a common operation
 is to retrieve the path with one of the functions :func:`lars_path`
 or :func:`lars_path_gram`.
 
-|details-start|
-**Mathematical formulation**
-|details-split|
+.. dropdown:: Mathematical formulation
 
-The algorithm is similar to forward stepwise regression, but instead
-of including features at each step, the estimated coefficients are
-increased in a direction equiangular to each one's correlations with
-the residual.
+  The algorithm is similar to forward stepwise regression, but instead
+  of including features at each step, the estimated coefficients are
+  increased in a direction equiangular to each one's correlations with
+  the residual.
 
-Instead of giving a vector result, the LARS solution consists of a
-curve denoting the solution for each value of the :math:`\ell_1` norm of the
-parameter vector. The full coefficients path is stored in the array
-``coef_path_`` of shape `(n_features, max_features + 1)`. The first
-column is always zero.
+  Instead of giving a vector result, the LARS solution consists of a
+  curve denoting the solution for each value of the :math:`\ell_1` norm of the
+  parameter vector. The full coefficients path is stored in the array
+  ``coef_path_`` of shape `(n_features, max_features + 1)`. The first
+  column is always zero.
 
-.. topic:: References:
+  .. rubric:: References
 
- * Original Algorithm is detailed in the paper `Least Angle Regression
-   <https://www-stat.stanford.edu/~hastie/Papers/LARS/LeastAngle_2002.pdf>`_
-   by Hastie et al.
-
-|details-end|
+  * Original Algorithm is detailed in the paper `Least Angle Regression
+    <https://www-stat.stanford.edu/~hastie/Papers/LARS/LeastAngle_2002.pdf>`_
+    by Hastie et al.
 
 .. _omp:
 
@@ -701,21 +680,17 @@ residual is recomputed using an orthogonal projection on the space of the
 previously chosen dictionary elements.
 
 
-.. topic:: Examples:
-
- * :ref:`sphx_glr_auto_examples_linear_model_plot_omp.py`
+.. rubric:: Examples
 
-|details-start|
-**References**
-|details-split|
+* :ref:`sphx_glr_auto_examples_linear_model_plot_omp.py`
 
-* https://www.cs.technion.ac.il/~ronrubin/Publications/KSVD-OMP-v2.pdf
+.. dropdown:: References
 
-* `Matching pursuits with time-frequency dictionaries
-  <https://www.di.ens.fr/~mallat/papiers/MallatPursuit93.pdf>`_,
-  S. G. Mallat, Z. Zhang,
+  * https://www.cs.technion.ac.il/~ronrubin/Publications/KSVD-OMP-v2.pdf
 
-|details-end|
+  * `Matching pursuits with time-frequency dictionaries
+    <https://www.di.ens.fr/~mallat/papiers/MallatPursuit93.pdf>`_,
+    S. G. Mallat, Z. Zhang,
 
 .. _bayesian_regression:
 
@@ -754,17 +729,13 @@ The disadvantages of Bayesian regression include:
 
 - Inference of the model can be time consuming.
 
-|details-start|
-**References**
-|details-split|
-
-* A good introduction to Bayesian methods is given in C. Bishop: Pattern
-  Recognition and Machine learning
+.. dropdown:: References
 
-* Original Algorithm is detailed in the  book `Bayesian learning for neural
-  networks` by Radford M. Neal
+  * A good introduction to Bayesian methods is given in C. Bishop: Pattern
+    Recognition and Machine learning
 
-|details-end|
+  * Original Algorithm is detailed in the  book `Bayesian learning for neural
+    networks` by Radford M. Neal
 
 .. _bayesian_ridge_regression:
 
@@ -821,21 +792,17 @@ Due to the Bayesian framework, the weights found are slightly different to the
 ones found by :ref:`ordinary_least_squares`. However, Bayesian Ridge Regression
 is more robust to ill-posed problems.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_linear_model_plot_bayesian_ridge_curvefit.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_bayesian_ridge_curvefit.py`
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
-* Section 3.3 in Christopher M. Bishop: Pattern Recognition and Machine Learning, 2006
+  * Section 3.3 in Christopher M. Bishop: Pattern Recognition and Machine Learning, 2006
 
-* David J. C. MacKay, `Bayesian Interpolation <https://citeseerx.ist.psu.edu/doc_view/pid/b14c7cc3686e82ba40653c6dff178356a33e5e2c>`_, 1992.
+  * David J. C. MacKay, `Bayesian Interpolation <https://citeseerx.ist.psu.edu/doc_view/pid/b14c7cc3686e82ba40653c6dff178356a33e5e2c>`_, 1992.
 
-* Michael E. Tipping, `Sparse Bayesian Learning and the Relevance Vector Machine <https://www.jmlr.org/papers/volume1/tipping01a/tipping01a.pdf>`_, 2001.
-
-|details-end|
+  * Michael E. Tipping, `Sparse Bayesian Learning and the Relevance Vector Machine <https://www.jmlr.org/papers/volume1/tipping01a/tipping01a.pdf>`_, 2001.
 
 .. _automatic_relevance_determination:
 
@@ -867,20 +834,20 @@ ARD is also known in the literature as *Sparse Bayesian Learning* and *Relevance
 Vector Machine* [3]_ [4]_. For a worked-out comparison between ARD and `Bayesian
 Ridge Regression`_, see the example below.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_ard.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_ard.py`
 
 
-.. topic:: References:
+.. rubric:: References
 
-  .. [1] Christopher M. Bishop: Pattern Recognition and Machine Learning, Chapter 7.2.1
+.. [1] Christopher M. Bishop: Pattern Recognition and Machine Learning, Chapter 7.2.1
 
-  .. [2] David Wipf and Srikantan Nagarajan: `A New View of Automatic Relevance Determination <https://papers.nips.cc/paper/3372-a-new-view-of-automatic-relevance-determination.pdf>`_
+.. [2] David Wipf and Srikantan Nagarajan: `A New View of Automatic Relevance Determination <https://papers.nips.cc/paper/3372-a-new-view-of-automatic-relevance-determination.pdf>`_
 
-  .. [3] Michael E. Tipping: `Sparse Bayesian Learning and the Relevance Vector Machine <https://www.jmlr.org/papers/volume1/tipping01a/tipping01a.pdf>`_
+.. [3] Michael E. Tipping: `Sparse Bayesian Learning and the Relevance Vector Machine <https://www.jmlr.org/papers/volume1/tipping01a/tipping01a.pdf>`_
 
-  .. [4] Tristan Fletcher: `Relevance Vector Machines Explained <https://citeseerx.ist.psu.edu/doc_view/pid/3dc9d625404fdfef6eaccc3babddefe4c176abd4>`_
+.. [4] Tristan Fletcher: `Relevance Vector Machines Explained <https://citeseerx.ist.psu.edu/doc_view/pid/3dc9d625404fdfef6eaccc3babddefe4c176abd4>`_
 
 .. _Logistic_regression:
 
@@ -917,17 +884,13 @@ regularization.
     implemented in scikit-learn, so it expects a categorical target, making
     the Logistic Regression a classifier.
 
-.. topic:: Examples
-
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_logistic_l1_l2_sparsity.py`
-
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_logistic_path.py`
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_logistic_multinomial.py`
-
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_sparse_logistic_regression_20newsgroups.py`
-
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_sparse_logistic_regression_mnist.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_logistic_l1_l2_sparsity.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_logistic_path.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_logistic_multinomial.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_sparse_logistic_regression_20newsgroups.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_sparse_logistic_regression_mnist.py`
 
 Binary Case
 -----------
@@ -999,47 +962,43 @@ logistic regression, see also `log-linear model
    especially important when using regularization. The choice of overparameterization can be
    detrimental for unpenalized models since then the solution may not be unique, as shown in [16]_.
 
-|details-start|
-**Mathematical details**
-|details-split|
+.. dropdown:: Mathematical details
 
-Let :math:`y_i \in {1, \ldots, K}` be the label (ordinal) encoded target variable for observation :math:`i`.
-Instead of a single coefficient vector, we now have
-a matrix of coefficients :math:`W` where each row vector :math:`W_k` corresponds to class
-:math:`k`. We aim at predicting the class probabilities :math:`P(y_i=k|X_i)` via
-:meth:`~sklearn.linear_model.LogisticRegression.predict_proba` as:
+  Let :math:`y_i \in {1, \ldots, K}` be the label (ordinal) encoded target variable for observation :math:`i`.
+  Instead of a single coefficient vector, we now have
+  a matrix of coefficients :math:`W` where each row vector :math:`W_k` corresponds to class
+  :math:`k`. We aim at predicting the class probabilities :math:`P(y_i=k|X_i)` via
+  :meth:`~sklearn.linear_model.LogisticRegression.predict_proba` as:
 
-.. math:: \hat{p}_k(X_i) = \frac{\exp(X_i W_k + W_{0, k})}{\sum_{l=0}^{K-1} \exp(X_i W_l + W_{0, l})}.
+  .. math:: \hat{p}_k(X_i) = \frac{\exp(X_i W_k + W_{0, k})}{\sum_{l=0}^{K-1} \exp(X_i W_l + W_{0, l})}.
 
-The objective for the optimization becomes
+  The objective for the optimization becomes
 
-.. math::
-  \min_W -\frac{1}{S}\sum_{i=1}^n \sum_{k=0}^{K-1} s_{ik} [y_i = k] \log(\hat{p}_k(X_i))
-  + \frac{r(W)}{S C}\,.
+  .. math::
+    \min_W -\frac{1}{S}\sum_{i=1}^n \sum_{k=0}^{K-1} s_{ik} [y_i = k] \log(\hat{p}_k(X_i))
+    + \frac{r(W)}{S C}\,,
 
-Where :math:`[P]` represents the Iverson bracket which evaluates to :math:`0`
-if :math:`P` is false, otherwise it evaluates to :math:`1`.
+  where :math:`[P]` represents the Iverson bracket which evaluates to :math:`0`
+  if :math:`P` is false, otherwise it evaluates to :math:`1`.
 
-Again, :math:`s_{ik}` are the weights assigned by the user (multiplication of sample
-weights and class weights) with their sum :math:`S = \sum_{i=1}^n \sum_{k=0}^{K-1} s_{ik}`.
+  Again, :math:`s_{ik}` are the weights assigned by the user (multiplication of sample
+  weights and class weights) with their sum :math:`S = \sum_{i=1}^n \sum_{k=0}^{K-1} s_{ik}`.
 
-We currently provide four choices
-for the regularization term :math:`r(W)` via the `penalty` argument, where :math:`m`
-is the number of features:
+  We currently provide four choices
+  for the regularization term :math:`r(W)` via the `penalty` argument, where :math:`m`
+  is the number of features:
 
-+----------------+----------------------------------------------------------------------------------+
-| penalty        | :math:`r(W)`                                                                     |
-+================+==================================================================================+
-| `None`         | :math:`0`                                                                        |
-+----------------+----------------------------------------------------------------------------------+
-| :math:`\ell_1` | :math:`\|W\|_{1,1} = \sum_{i=1}^m\sum_{j=1}^{K}|W_{i,j}|`                        |
-+----------------+----------------------------------------------------------------------------------+
-| :math:`\ell_2` | :math:`\frac{1}{2}\|W\|_F^2 = \frac{1}{2}\sum_{i=1}^m\sum_{j=1}^{K} W_{i,j}^2`   |
-+----------------+----------------------------------------------------------------------------------+
-| `ElasticNet`   | :math:`\frac{1 - \rho}{2}\|W\|_F^2 + \rho \|W\|_{1,1}`                           |
-+----------------+----------------------------------------------------------------------------------+
-
-|details-end|
+  +----------------+----------------------------------------------------------------------------------+
+  | penalty        | :math:`r(W)`                                                                     |
+  +================+==================================================================================+
+  | `None`         | :math:`0`                                                                        |
+  +----------------+----------------------------------------------------------------------------------+
+  | :math:`\ell_1` | :math:`\|W\|_{1,1} = \sum_{i=1}^m\sum_{j=1}^{K}|W_{i,j}|`                        |
+  +----------------+----------------------------------------------------------------------------------+
+  | :math:`\ell_2` | :math:`\frac{1}{2}\|W\|_F^2 = \frac{1}{2}\sum_{i=1}^m\sum_{j=1}^{K} W_{i,j}^2`   |
+  +----------------+----------------------------------------------------------------------------------+
+  | `ElasticNet`   | :math:`\frac{1 - \rho}{2}\|W\|_F^2 + \rho \|W\|_{1,1}`                           |
+  +----------------+----------------------------------------------------------------------------------+
 
 Solvers
 -------
@@ -1047,24 +1006,24 @@ Solvers
 The solvers implemented in the class :class:`LogisticRegression`
 are "lbfgs", "liblinear", "newton-cg", "newton-cholesky", "sag" and "saga":
 
-The following table summarizes the penalties supported by each solver:
+The following table summarizes the penalties and multinomial multiclass supported by each solver:
 
 +------------------------------+-----------------+-------------+-----------------+-----------------------+-----------+------------+
 |                              |                       **Solvers**                                                                |
 +------------------------------+-------------+-----------------+-----------------+-----------------------+-----------+------------+
 | **Penalties**                | **'lbfgs'** | **'liblinear'** | **'newton-cg'** | **'newton-cholesky'** | **'sag'** | **'saga'** |
 +------------------------------+-------------+-----------------+-----------------+-----------------------+-----------+------------+
-| Multinomial + L2 penalty     |     yes     |       no        |       yes       |     no                |    yes    |    yes     |
+| L2 penalty                   |     yes     |       no        |       yes       |     no                |    yes    |    yes     |
 +------------------------------+-------------+-----------------+-----------------+-----------------------+-----------+------------+
-| OVR + L2 penalty             |     yes     |       yes       |       yes       |     yes               |    yes    |    yes     |
+| L1 penalty                   |     no      |       yes       |       no        |     no                |    no     |    yes     |
 +------------------------------+-------------+-----------------+-----------------+-----------------------+-----------+------------+
-| Multinomial + L1 penalty     |     no      |       no        |       no        |     no                |    no     |    yes     |
+| Elastic-Net (L1 + L2)        |     no      |       no        |       no        |     no                |    no     |    yes     |
 +------------------------------+-------------+-----------------+-----------------+-----------------------+-----------+------------+
-| OVR + L1 penalty             |     no      |       yes       |       no        |     no                |    no     |    yes     |
+| No penalty ('none')          |     yes     |       no        |       yes       |     yes               |    yes    |    yes     |
 +------------------------------+-------------+-----------------+-----------------+-----------------------+-----------+------------+
-| Elastic-Net                  |     no      |       no        |       no        |     no                |    no     |    yes     |
+| **Multiclass support**       |                                                                                                  |
 +------------------------------+-------------+-----------------+-----------------+-----------------------+-----------+------------+
-| No penalty ('none')          |     yes     |       no        |       yes       |     yes               |    yes    |    yes     |
+| multinomial multiclass       |     yes     |       no        |       yes       |     no                |    yes    |    yes     |
 +------------------------------+-------------+-----------------+-----------------+-----------------------+-----------+------------+
 | **Behaviors**                |                                                                                                  |
 +------------------------------+-------------+-----------------+-----------------+-----------------------+-----------+------------+
@@ -1096,56 +1055,54 @@ with ``fit_intercept=False`` and having many samples with ``decision_function``
 zero, is likely to be a underfit, bad model and you are advised to set
 ``fit_intercept=True`` and increase the ``intercept_scaling``.
 
-|details-start|
-**Solvers' details**
-|details-split|
-
-* The solver "liblinear" uses a coordinate descent (CD) algorithm, and relies
-  on the excellent C++ `LIBLINEAR library
-  <https://www.csie.ntu.edu.tw/~cjlin/liblinear/>`_, which is shipped with
-  scikit-learn. However, the CD algorithm implemented in liblinear cannot learn
-  a true multinomial (multiclass) model; instead, the optimization problem is
-  decomposed in a "one-vs-rest" fashion so separate binary classifiers are
-  trained for all classes. This happens under the hood, so
-  :class:`LogisticRegression` instances using this solver behave as multiclass
-  classifiers. For :math:`\ell_1` regularization :func:`sklearn.svm.l1_min_c` allows to
-  calculate the lower bound for C in order to get a non "null" (all feature
-  weights to zero) model.
-
-* The "lbfgs", "newton-cg" and "sag" solvers only support :math:`\ell_2`
-  regularization or no regularization, and are found to converge faster for some
-  high-dimensional data. Setting `multi_class` to "multinomial" with these solvers
-  learns a true multinomial logistic regression model [5]_, which means that its
-  probability estimates should be better calibrated than the default "one-vs-rest"
-  setting.
-
-* The "sag" solver uses Stochastic Average Gradient descent [6]_. It is faster
-  than other solvers for large datasets, when both the number of samples and the
-  number of features are large.
-
-* The "saga" solver [7]_ is a variant of "sag" that also supports the
-  non-smooth `penalty="l1"`. This is therefore the solver of choice for sparse
-  multinomial logistic regression. It is also the only solver that supports
-  `penalty="elasticnet"`.
-
-* The "lbfgs" is an optimization algorithm that approximates the
-  Broyden–Fletcher–Goldfarb–Shanno algorithm [8]_, which belongs to
-  quasi-Newton methods. As such, it can deal with a wide range of different training
-  data and is therefore the default solver. Its performance, however, suffers on poorly
-  scaled datasets and on datasets with one-hot encoded categorical features with rare
-  categories.
-
-* The "newton-cholesky" solver is an exact Newton solver that calculates the hessian
-  matrix and solves the resulting linear system. It is a very good choice for
-  `n_samples` >> `n_features`, but has a few shortcomings: Only :math:`\ell_2`
-  regularization is supported. Furthermore, because the hessian matrix is explicitly
-  computed, the memory usage has a quadratic dependency on `n_features` as well as on
-  `n_classes`. As a consequence, only the one-vs-rest scheme is implemented for the
-  multiclass case.
-
-For a comparison of some of these solvers, see [9]_.
-
-.. topic:: References:
+.. dropdown:: Solvers' details
+
+  * The solver "liblinear" uses a coordinate descent (CD) algorithm, and relies
+    on the excellent C++ `LIBLINEAR library
+    <https://www.csie.ntu.edu.tw/~cjlin/liblinear/>`_, which is shipped with
+    scikit-learn. However, the CD algorithm implemented in liblinear cannot learn
+    a true multinomial (multiclass) model; instead, the optimization problem is
+    decomposed in a "one-vs-rest" fashion so separate binary classifiers are
+    trained for all classes. This happens under the hood, so
+    :class:`LogisticRegression` instances using this solver behave as multiclass
+    classifiers. For :math:`\ell_1` regularization :func:`sklearn.svm.l1_min_c` allows to
+    calculate the lower bound for C in order to get a non "null" (all feature
+    weights to zero) model.
+
+  * The "lbfgs", "newton-cg" and "sag" solvers only support :math:`\ell_2`
+    regularization or no regularization, and are found to converge faster for some
+    high-dimensional data. Setting `multi_class` to "multinomial" with these solvers
+    learns a true multinomial logistic regression model [5]_, which means that its
+    probability estimates should be better calibrated than the default "one-vs-rest"
+    setting.
+
+  * The "sag" solver uses Stochastic Average Gradient descent [6]_. It is faster
+    than other solvers for large datasets, when both the number of samples and the
+    number of features are large.
+
+  * The "saga" solver [7]_ is a variant of "sag" that also supports the
+    non-smooth `penalty="l1"`. This is therefore the solver of choice for sparse
+    multinomial logistic regression. It is also the only solver that supports
+    `penalty="elasticnet"`.
+
+  * The "lbfgs" is an optimization algorithm that approximates the
+    Broyden–Fletcher–Goldfarb–Shanno algorithm [8]_, which belongs to
+    quasi-Newton methods. As such, it can deal with a wide range of different training
+    data and is therefore the default solver. Its performance, however, suffers on poorly
+    scaled datasets and on datasets with one-hot encoded categorical features with rare
+    categories.
+
+  * The "newton-cholesky" solver is an exact Newton solver that calculates the hessian
+    matrix and solves the resulting linear system. It is a very good choice for
+    `n_samples` >> `n_features`, but has a few shortcomings: Only :math:`\ell_2`
+    regularization is supported. Furthermore, because the hessian matrix is explicitly
+    computed, the memory usage has a quadratic dependency on `n_features` as well as on
+    `n_classes`. As a consequence, only the one-vs-rest scheme is implemented for the
+    multiclass case.
+
+  For a comparison of some of these solvers, see [9]_.
+
+  .. rubric:: References
 
   .. [5] Christopher M. Bishop: Pattern Recognition and Machine Learning, Chapter 4.3.4
 
@@ -1164,8 +1121,6 @@ For a comparison of some of these solvers, see [9]_.
       "A Blockwise Descent Algorithm for Group-penalized Multiresponse and
       Multinomial Regression." <1311.6529>`
 
-|details-end|
-
 
 .. note:: **Feature selection with sparse logistic regression**
 
@@ -1262,38 +1217,34 @@ The choice of the distribution depends on the problem at hand:
   used for multiclass classification.
 
 
-|details-start|
-**Examples of use cases**
-|details-split|
-
-* Agriculture / weather modeling:  number of rain events per year (Poisson),
-  amount of rainfall per event (Gamma), total rainfall per year (Tweedie /
-  Compound Poisson Gamma).
-* Risk modeling / insurance policy pricing:  number of claim events /
-  policyholder per year (Poisson), cost per event (Gamma), total cost per
-  policyholder per year (Tweedie / Compound Poisson Gamma).
-* Credit Default: probability that a loan can't be paid back (Bernoulli).
-* Fraud Detection: probability that a financial transaction like a cash transfer
-  is a fraudulent transaction (Bernoulli).
-* Predictive maintenance: number of production interruption events per year
-  (Poisson), duration of interruption (Gamma), total interruption time per year
-  (Tweedie / Compound Poisson Gamma).
-* Medical Drug Testing: probability of curing a patient in a set of trials or
-  probability that a patient will experience side effects (Bernoulli).
-* News Classification: classification of news articles into three categories
-  namely Business News, Politics and Entertainment news (Categorical).
+.. dropdown:: Examples of use cases
 
-|details-end|
+  * Agriculture / weather modeling:  number of rain events per year (Poisson),
+    amount of rainfall per event (Gamma), total rainfall per year (Tweedie /
+    Compound Poisson Gamma).
+  * Risk modeling / insurance policy pricing:  number of claim events /
+    policyholder per year (Poisson), cost per event (Gamma), total cost per
+    policyholder per year (Tweedie / Compound Poisson Gamma).
+  * Credit Default: probability that a loan can't be paid back (Bernoulli).
+  * Fraud Detection: probability that a financial transaction like a cash transfer
+    is a fraudulent transaction (Bernoulli).
+  * Predictive maintenance: number of production interruption events per year
+    (Poisson), duration of interruption (Gamma), total interruption time per year
+    (Tweedie / Compound Poisson Gamma).
+  * Medical Drug Testing: probability of curing a patient in a set of trials or
+    probability that a patient will experience side effects (Bernoulli).
+  * News Classification: classification of news articles into three categories
+    namely Business News, Politics and Entertainment news (Categorical).
 
-.. topic:: References:
+.. rubric:: References
 
-  .. [10] McCullagh, Peter; Nelder, John (1989). Generalized Linear Models,
-      Second Edition. Boca Raton: Chapman and Hall/CRC. ISBN 0-412-31760-5.
+.. [10] McCullagh, Peter; Nelder, John (1989). Generalized Linear Models,
+    Second Edition. Boca Raton: Chapman and Hall/CRC. ISBN 0-412-31760-5.
 
-  .. [11] Jørgensen, B. (1992). The theory of exponential dispersion models
-      and analysis of deviance. Monografias de matemática, no. 51.  See also
-      `Exponential dispersion model.
-      <https://en.wikipedia.org/wiki/Exponential_dispersion_model>`_
+.. [11] Jørgensen, B. (1992). The theory of exponential dispersion models
+    and analysis of deviance. Monografias de matemática, no. 51.  See also
+    `Exponential dispersion model.
+    <https://en.wikipedia.org/wiki/Exponential_dispersion_model>`_
 
 Usage
 -----
@@ -1327,37 +1278,33 @@ Usage example::
     -0.7638...
 
 
-.. topic:: Examples
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_poisson_regression_non_normal_loss.py`
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_tweedie_regression_insurance_claims.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_poisson_regression_non_normal_loss.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_tweedie_regression_insurance_claims.py`
 
-|details-start|
-**Practical considerations**
-|details-split|
+.. dropdown:: Practical considerations
 
-The feature matrix `X` should be standardized before fitting. This ensures
-that the penalty treats features equally.
+  The feature matrix `X` should be standardized before fitting. This ensures
+  that the penalty treats features equally.
 
-Since the linear predictor :math:`Xw` can be negative and Poisson,
-Gamma and Inverse Gaussian distributions don't support negative values, it
-is necessary to apply an inverse link function that guarantees the
-non-negativeness. For example with `link='log'`, the inverse link function
-becomes :math:`h(Xw)=\exp(Xw)`.
+  Since the linear predictor :math:`Xw` can be negative and Poisson,
+  Gamma and Inverse Gaussian distributions don't support negative values, it
+  is necessary to apply an inverse link function that guarantees the
+  non-negativeness. For example with `link='log'`, the inverse link function
+  becomes :math:`h(Xw)=\exp(Xw)`.
 
-If you want to model a relative frequency, i.e. counts per exposure (time,
-volume, ...) you can do so by using a Poisson distribution and passing
-:math:`y=\frac{\mathrm{counts}}{\mathrm{exposure}}` as target values
-together with :math:`\mathrm{exposure}` as sample weights. For a concrete
-example see e.g.
-:ref:`sphx_glr_auto_examples_linear_model_plot_tweedie_regression_insurance_claims.py`.
+  If you want to model a relative frequency, i.e. counts per exposure (time,
+  volume, ...) you can do so by using a Poisson distribution and passing
+  :math:`y=\frac{\mathrm{counts}}{\mathrm{exposure}}` as target values
+  together with :math:`\mathrm{exposure}` as sample weights. For a concrete
+  example see e.g.
+  :ref:`sphx_glr_auto_examples_linear_model_plot_tweedie_regression_insurance_claims.py`.
 
-When performing cross-validation for the `power` parameter of
-`TweedieRegressor`, it is advisable to specify an explicit `scoring` function,
-because the default scorer :meth:`TweedieRegressor.score` is a function of
-`power` itself.
-
-|details-end|
+  When performing cross-validation for the `power` parameter of
+  `TweedieRegressor`, it is advisable to specify an explicit `scoring` function,
+  because the default scorer :meth:`TweedieRegressor.score` is a function of
+  `power` itself.
 
 Stochastic Gradient Descent - SGD
 =================================
@@ -1415,15 +1362,11 @@ For classification, :class:`PassiveAggressiveClassifier` can be used with
 ``loss='epsilon_insensitive'`` (PA-I) or
 ``loss='squared_epsilon_insensitive'`` (PA-II).
 
-|details-start|
-**References**
-|details-split|
-
-* `"Online Passive-Aggressive Algorithms"
-  <http://jmlr.csail.mit.edu/papers/volume7/crammer06a/crammer06a.pdf>`_
-  K. Crammer, O. Dekel, J. Keshat, S. Shalev-Shwartz, Y. Singer - JMLR 7 (2006)
+.. dropdown:: References
 
-|details-end|
+  * `"Online Passive-Aggressive Algorithms"
+    <http://jmlr.csail.mit.edu/papers/volume7/crammer06a/crammer06a.pdf>`_
+    K. Crammer, O. Dekel, J. Keshat, S. Shalev-Shwartz, Y. Singer - JMLR 7 (2006)
 
 Robustness regression: outliers and modeling errors
 =====================================================
@@ -1533,56 +1476,48 @@ estimated only from the determined inliers.
    :align: center
    :scale: 50%
 
-.. topic:: Examples
-
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_ransac.py`
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_robust_fit.py`
-
-|details-start|
-**Details of the algorithm**
-|details-split|
-
-Each iteration performs the following steps:
-
-1. Select ``min_samples`` random samples from the original data and check
-   whether the set of data is valid (see ``is_data_valid``).
-2. Fit a model to the random subset (``estimator.fit``) and check
-   whether the estimated model is valid (see ``is_model_valid``).
-3. Classify all data as inliers or outliers by calculating the residuals
-   to the estimated model (``estimator.predict(X) - y``) - all data
-   samples with absolute residuals smaller than or equal to the
-   ``residual_threshold`` are considered as inliers.
-4. Save fitted model as best model if number of inlier samples is
-   maximal. In case the current estimated model has the same number of
-   inliers, it is only considered as the best model if it has better score.
-
-These steps are performed either a maximum number of times (``max_trials``) or
-until one of the special stop criteria are met (see ``stop_n_inliers`` and
-``stop_score``). The final model is estimated using all inlier samples (consensus
-set) of the previously determined best model.
-
-The ``is_data_valid`` and ``is_model_valid`` functions allow to identify and reject
-degenerate combinations of random sub-samples. If the estimated model is not
-needed for identifying degenerate cases, ``is_data_valid`` should be used as it
-is called prior to fitting the model and thus leading to better computational
-performance.
-
-|details-end|
-
-|details-start|
-**References**
-|details-split|
-
-* https://en.wikipedia.org/wiki/RANSAC
-* `"Random Sample Consensus: A Paradigm for Model Fitting with Applications to
-  Image Analysis and Automated Cartography"
-  <https://www.cs.ait.ac.th/~mdailey/cvreadings/Fischler-RANSAC.pdf>`_
-  Martin A. Fischler and Robert C. Bolles - SRI International (1981)
-* `"Performance Evaluation of RANSAC Family"
-  <http://www.bmva.org/bmvc/2009/Papers/Paper355/Paper355.pdf>`_
-  Sunglok Choi, Taemin Kim and Wonpil Yu - BMVC (2009)
-
-|details-end|
+.. rubric:: Examples
+
+* :ref:`sphx_glr_auto_examples_linear_model_plot_ransac.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_robust_fit.py`
+
+.. dropdown:: Details of the algorithm
+
+  Each iteration performs the following steps:
+
+  1. Select ``min_samples`` random samples from the original data and check
+     whether the set of data is valid (see ``is_data_valid``).
+  2. Fit a model to the random subset (``estimator.fit``) and check
+     whether the estimated model is valid (see ``is_model_valid``).
+  3. Classify all data as inliers or outliers by calculating the residuals
+     to the estimated model (``estimator.predict(X) - y``) - all data
+     samples with absolute residuals smaller than or equal to the
+     ``residual_threshold`` are considered as inliers.
+  4. Save fitted model as best model if number of inlier samples is
+     maximal. In case the current estimated model has the same number of
+     inliers, it is only considered as the best model if it has better score.
+
+  These steps are performed either a maximum number of times (``max_trials``) or
+  until one of the special stop criteria are met (see ``stop_n_inliers`` and
+  ``stop_score``). The final model is estimated using all inlier samples (consensus
+  set) of the previously determined best model.
+
+  The ``is_data_valid`` and ``is_model_valid`` functions allow to identify and reject
+  degenerate combinations of random sub-samples. If the estimated model is not
+  needed for identifying degenerate cases, ``is_data_valid`` should be used as it
+  is called prior to fitting the model and thus leading to better computational
+  performance.
+
+.. dropdown:: References
+
+  * https://en.wikipedia.org/wiki/RANSAC
+  * `"Random Sample Consensus: A Paradigm for Model Fitting with Applications to
+    Image Analysis and Automated Cartography"
+    <https://www.cs.ait.ac.th/~mdailey/cvreadings/Fischler-RANSAC.pdf>`_
+    Martin A. Fischler and Robert C. Bolles - SRI International (1981)
+  * `"Performance Evaluation of RANSAC Family"
+    <http://www.bmva.org/bmvc/2009/Papers/Paper355/Paper355.pdf>`_
+    Sunglok Choi, Taemin Kim and Wonpil Yu - BMVC (2009)
 
 .. _theil_sen_regression:
 
@@ -1595,47 +1530,45 @@ that the robustness of the estimator decreases quickly with the dimensionality
 of the problem. It loses its robustness properties and becomes no
 better than an ordinary least squares in high dimension.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_theilsen.py`
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_robust_fit.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_theilsen.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_robust_fit.py`
 
 
-|details-start|
-**Theoretical considerations**
-|details-split|
+.. dropdown:: Theoretical considerations
 
-:class:`TheilSenRegressor` is comparable to the :ref:`Ordinary Least Squares
-(OLS) <ordinary_least_squares>` in terms of asymptotic efficiency and as an
-unbiased estimator. In contrast to OLS, Theil-Sen is a non-parametric
-method which means it makes no assumption about the underlying
-distribution of the data. Since Theil-Sen is a median-based estimator, it
-is more robust against corrupted data aka outliers. In univariate
-setting, Theil-Sen has a breakdown point of about 29.3% in case of a
-simple linear regression which means that it can tolerate arbitrary
-corrupted data of up to 29.3%.
+  :class:`TheilSenRegressor` is comparable to the :ref:`Ordinary Least Squares
+  (OLS) <ordinary_least_squares>` in terms of asymptotic efficiency and as an
+  unbiased estimator. In contrast to OLS, Theil-Sen is a non-parametric
+  method which means it makes no assumption about the underlying
+  distribution of the data. Since Theil-Sen is a median-based estimator, it
+  is more robust against corrupted data aka outliers. In univariate
+  setting, Theil-Sen has a breakdown point of about 29.3% in case of a
+  simple linear regression which means that it can tolerate arbitrary
+  corrupted data of up to 29.3%.
 
-.. figure:: ../auto_examples/linear_model/images/sphx_glr_plot_theilsen_001.png
-   :target: ../auto_examples/linear_model/plot_theilsen.html
-   :align: center
-   :scale: 50%
+  .. figure:: ../auto_examples/linear_model/images/sphx_glr_plot_theilsen_001.png
+    :target: ../auto_examples/linear_model/plot_theilsen.html
+    :align: center
+    :scale: 50%
 
-The implementation of :class:`TheilSenRegressor` in scikit-learn follows a
-generalization to a multivariate linear regression model [#f1]_ using the
-spatial median which is a generalization of the median to multiple
-dimensions [#f2]_.
+  The implementation of :class:`TheilSenRegressor` in scikit-learn follows a
+  generalization to a multivariate linear regression model [#f1]_ using the
+  spatial median which is a generalization of the median to multiple
+  dimensions [#f2]_.
 
-In terms of time and space complexity, Theil-Sen scales according to
+  In terms of time and space complexity, Theil-Sen scales according to
 
-.. math::
-    \binom{n_{\text{samples}}}{n_{\text{subsamples}}}
+  .. math::
+      \binom{n_{\text{samples}}}{n_{\text{subsamples}}}
 
-which makes it infeasible to be applied exhaustively to problems with a
-large number of samples and features. Therefore, the magnitude of a
-subpopulation can be chosen to limit the time and space complexity by
-considering only a random subset of all possible combinations.
+  which makes it infeasible to be applied exhaustively to problems with a
+  large number of samples and features. Therefore, the magnitude of a
+  subpopulation can be chosen to limit the time and space complexity by
+  considering only a random subset of all possible combinations.
 
-.. topic:: References:
+  .. rubric:: References
 
   .. [#f1] Xin Dang, Hanxiang Peng, Xueqin Wang and Heping Zhang: `Theil-Sen Estimators in a Multiple Linear Regression Model. <http://home.olemiss.edu/~xdang/papers/MTSE.pdf>`_
 
@@ -1643,8 +1576,6 @@ considering only a random subset of all possible combinations.
 
   Also see the `Wikipedia page <https://en.wikipedia.org/wiki/Theil%E2%80%93Sen_estimator>`_
 
-|details-end|
-
 
 .. _huber_regression:
 
@@ -1663,39 +1594,35 @@ but gives a lesser weight to them.
    :align: center
    :scale: 50%
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_huber_vs_ridge.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_huber_vs_ridge.py`
 
-|details-start|
-**Mathematical details**
-|details-split|
+.. dropdown:: Mathematical details
 
-The loss function that :class:`HuberRegressor` minimizes is given by
+  The loss function that :class:`HuberRegressor` minimizes is given by
 
-.. math::
+  .. math::
 
-  \min_{w, \sigma} {\sum_{i=1}^n\left(\sigma + H_{\epsilon}\left(\frac{X_{i}w - y_{i}}{\sigma}\right)\sigma\right) + \alpha {||w||_2}^2}
+    \min_{w, \sigma} {\sum_{i=1}^n\left(\sigma + H_{\epsilon}\left(\frac{X_{i}w - y_{i}}{\sigma}\right)\sigma\right) + \alpha {||w||_2}^2}
 
-where
+  where
 
-.. math::
+  .. math::
 
-  H_{\epsilon}(z) = \begin{cases}
-        z^2, & \text {if } |z| < \epsilon, \\
-        2\epsilon|z| - \epsilon^2, & \text{otherwise}
-  \end{cases}
+    H_{\epsilon}(z) = \begin{cases}
+          z^2, & \text {if } |z| < \epsilon, \\
+          2\epsilon|z| - \epsilon^2, & \text{otherwise}
+    \end{cases}
 
-It is advised to set the parameter ``epsilon`` to 1.35 to achieve 95%
-statistical efficiency.
+  It is advised to set the parameter ``epsilon`` to 1.35 to achieve 95%
+  statistical efficiency.
 
-.. topic:: References:
+  .. rubric:: References
 
   * Peter J. Huber, Elvezio M. Ronchetti: Robust Statistics, Concomitant scale
     estimates, pg 172
 
-|details-end|
-
 The :class:`HuberRegressor` differs from using :class:`SGDRegressor` with loss set to `huber`
 in the following ways.
 
@@ -1745,59 +1672,51 @@ Most implementations of quantile regression are based on linear programming
 problem. The current implementation is based on
 :func:`scipy.optimize.linprog`.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_linear_model_plot_quantile_regression.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_quantile_regression.py`
 
-|details-start|
-**Mathematical details**
-|details-split|
+.. dropdown:: Mathematical details
 
-As a linear model, the :class:`QuantileRegressor` gives linear predictions
-:math:`\hat{y}(w, X) = Xw` for the :math:`q`-th quantile, :math:`q \in (0, 1)`.
-The weights or coefficients :math:`w` are then found by the following
-minimization problem:
+  As a linear model, the :class:`QuantileRegressor` gives linear predictions
+  :math:`\hat{y}(w, X) = Xw` for the :math:`q`-th quantile, :math:`q \in (0, 1)`.
+  The weights or coefficients :math:`w` are then found by the following
+  minimization problem:
 
-.. math::
-    \min_{w} {\frac{1}{n_{\text{samples}}}
-    \sum_i PB_q(y_i - X_i w) + \alpha ||w||_1}.
+  .. math::
+      \min_{w} {\frac{1}{n_{\text{samples}}}
+      \sum_i PB_q(y_i - X_i w) + \alpha ||w||_1}.
 
-This consists of the pinball loss (also known as linear loss),
-see also :class:`~sklearn.metrics.mean_pinball_loss`,
+  This consists of the pinball loss (also known as linear loss),
+  see also :class:`~sklearn.metrics.mean_pinball_loss`,
 
-.. math::
-    PB_q(t) = q \max(t, 0) + (1 - q) \max(-t, 0) =
-    \begin{cases}
-        q t, & t > 0, \\
-        0,    & t = 0, \\
-        (q-1) t, & t < 0
-    \end{cases}
-
-and the L1 penalty controlled by parameter ``alpha``, similar to
-:class:`Lasso`.
+  .. math::
+      PB_q(t) = q \max(t, 0) + (1 - q) \max(-t, 0) =
+      \begin{cases}
+          q t, & t > 0, \\
+          0,    & t = 0, \\
+          (q-1) t, & t < 0
+      \end{cases}
 
-As the pinball loss is only linear in the residuals, quantile regression is
-much more robust to outliers than squared error based estimation of the mean.
-Somewhat in between is the :class:`HuberRegressor`.
+  and the L1 penalty controlled by parameter ``alpha``, similar to
+  :class:`Lasso`.
 
-|details-end|
+  As the pinball loss is only linear in the residuals, quantile regression is
+  much more robust to outliers than squared error based estimation of the mean.
+  Somewhat in between is the :class:`HuberRegressor`.
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
-* Koenker, R., & Bassett Jr, G. (1978). `Regression quantiles.
-  <https://gib.people.uic.edu/RQ.pdf>`_
-  Econometrica: journal of the Econometric Society, 33-50.
+  * Koenker, R., & Bassett Jr, G. (1978). `Regression quantiles.
+    <https://gib.people.uic.edu/RQ.pdf>`_
+    Econometrica: journal of the Econometric Society, 33-50.
 
-* Portnoy, S., & Koenker, R. (1997). :doi:`The Gaussian hare and the Laplacian
-  tortoise: computability of squared-error versus absolute-error estimators.
-  Statistical Science, 12, 279-300 <10.1214/ss/1030037960>`.
+  * Portnoy, S., & Koenker, R. (1997). :doi:`The Gaussian hare and the Laplacian
+    tortoise: computability of squared-error versus absolute-error estimators.
+    Statistical Science, 12, 279-300 <10.1214/ss/1030037960>`.
 
-* Koenker, R. (2005). :doi:`Quantile Regression <10.1017/CBO9780511754098>`.
-  Cambridge University Press.
-
-|details-end|
+  * Koenker, R. (2005). :doi:`Quantile Regression <10.1017/CBO9780511754098>`.
+    Cambridge University Press.
 
 
 .. _polynomial_regression:
@@ -1812,38 +1731,34 @@ on nonlinear functions of the data.  This approach maintains the generally
 fast performance of linear methods, while allowing them to fit a much wider
 range of data.
 
-|details-start|
-**Mathematical details**
-|details-split|
-
-For example, a simple linear regression can be extended by constructing
-**polynomial features** from the coefficients.  In the standard linear
-regression case, you might have a model that looks like this for
-two-dimensional data:
+.. dropdown:: Mathematical details
 
-.. math::    \hat{y}(w, x) = w_0 + w_1 x_1 + w_2 x_2
+  For example, a simple linear regression can be extended by constructing
+  **polynomial features** from the coefficients.  In the standard linear
+  regression case, you might have a model that looks like this for
+  two-dimensional data:
 
-If we want to fit a paraboloid to the data instead of a plane, we can combine
-the features in second-order polynomials, so that the model looks like this:
+  .. math::    \hat{y}(w, x) = w_0 + w_1 x_1 + w_2 x_2
 
-.. math::    \hat{y}(w, x) = w_0 + w_1 x_1 + w_2 x_2 + w_3 x_1 x_2 + w_4 x_1^2 + w_5 x_2^2
+  If we want to fit a paraboloid to the data instead of a plane, we can combine
+  the features in second-order polynomials, so that the model looks like this:
 
-The (sometimes surprising) observation is that this is *still a linear model*:
-to see this, imagine creating a new set of features
+  .. math::    \hat{y}(w, x) = w_0 + w_1 x_1 + w_2 x_2 + w_3 x_1 x_2 + w_4 x_1^2 + w_5 x_2^2
 
-.. math::  z = [x_1, x_2, x_1 x_2, x_1^2, x_2^2]
+  The (sometimes surprising) observation is that this is *still a linear model*:
+  to see this, imagine creating a new set of features
 
-With this re-labeling of the data, our problem can be written
+  .. math::  z = [x_1, x_2, x_1 x_2, x_1^2, x_2^2]
 
-.. math::    \hat{y}(w, z) = w_0 + w_1 z_1 + w_2 z_2 + w_3 z_3 + w_4 z_4 + w_5 z_5
+  With this re-labeling of the data, our problem can be written
 
-We see that the resulting *polynomial regression* is in the same class of
-linear models we considered above (i.e. the model is linear in :math:`w`)
-and can be solved by the same techniques.  By considering linear fits within
-a higher-dimensional space built with these basis functions, the model has the
-flexibility to fit a much broader range of data.
+  .. math::    \hat{y}(w, z) = w_0 + w_1 z_1 + w_2 z_2 + w_3 z_3 + w_4 z_4 + w_5 z_5
 
-|details-end|
+  We see that the resulting *polynomial regression* is in the same class of
+  linear models we considered above (i.e. the model is linear in :math:`w`)
+  and can be solved by the same techniques.  By considering linear fits within
+  a higher-dimensional space built with these basis functions, the model has the
+  flexibility to fit a much broader range of data.
 
 Here is an example of applying this idea to one-dimensional data, using
 polynomial features of varying degrees:
diff --git a/doc/modules/manifold.rst b/doc/modules/manifold.rst
index 7cc6776e37daa..785fba3097edf 100644
--- a/doc/modules/manifold.rst
+++ b/doc/modules/manifold.rst
@@ -102,13 +102,13 @@ unsupervised: it learns the high-dimensional structure of the data
 from the data itself, without the use of predetermined classifications.
 
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * See :ref:`sphx_glr_auto_examples_manifold_plot_lle_digits.py` for an example of
-      dimensionality reduction on handwritten digits.
+* See :ref:`sphx_glr_auto_examples_manifold_plot_lle_digits.py` for an example of
+  dimensionality reduction on handwritten digits.
 
-    * See :ref:`sphx_glr_auto_examples_manifold_plot_compare_methods.py` for an example of
-      dimensionality reduction on a toy "S-curve" dataset.
+* See :ref:`sphx_glr_auto_examples_manifold_plot_compare_methods.py` for an example of
+  dimensionality reduction on a toy "S-curve" dataset.
 
 The manifold learning implementations available in scikit-learn are
 summarized below
@@ -130,47 +130,43 @@ distances between all points.  Isomap can be performed with the object
    :align: center
    :scale: 50
 
-|details-start|
-**Complexity**
-|details-split|
+.. dropdown:: Complexity
 
-The Isomap algorithm comprises three stages:
+  The Isomap algorithm comprises three stages:
 
-1. **Nearest neighbor search.**  Isomap uses
-   :class:`~sklearn.neighbors.BallTree` for efficient neighbor search.
-   The cost is approximately :math:`O[D \log(k) N \log(N)]`, for :math:`k`
-   nearest neighbors of :math:`N` points in :math:`D` dimensions.
+  1. **Nearest neighbor search.**  Isomap uses
+     :class:`~sklearn.neighbors.BallTree` for efficient neighbor search.
+     The cost is approximately :math:`O[D \log(k) N \log(N)]`, for :math:`k`
+     nearest neighbors of :math:`N` points in :math:`D` dimensions.
 
-2. **Shortest-path graph search.**  The most efficient known algorithms
-   for this are *Dijkstra's Algorithm*, which is approximately
-   :math:`O[N^2(k + \log(N))]`, or the *Floyd-Warshall algorithm*, which
-   is :math:`O[N^3]`.  The algorithm can be selected by the user with
-   the ``path_method`` keyword of ``Isomap``.  If unspecified, the code
-   attempts to choose the best algorithm for the input data.
+  2. **Shortest-path graph search.**  The most efficient known algorithms
+     for this are *Dijkstra's Algorithm*, which is approximately
+     :math:`O[N^2(k + \log(N))]`, or the *Floyd-Warshall algorithm*, which
+     is :math:`O[N^3]`.  The algorithm can be selected by the user with
+     the ``path_method`` keyword of ``Isomap``.  If unspecified, the code
+     attempts to choose the best algorithm for the input data.
 
-3. **Partial eigenvalue decomposition.**  The embedding is encoded in the
-   eigenvectors corresponding to the :math:`d` largest eigenvalues of the
-   :math:`N \times N` isomap kernel.  For a dense solver, the cost is
-   approximately :math:`O[d N^2]`.  This cost can often be improved using
-   the ``ARPACK`` solver.  The eigensolver can be specified by the user
-   with the ``eigen_solver`` keyword of ``Isomap``.  If unspecified, the
-   code attempts to choose the best algorithm for the input data.
+  3. **Partial eigenvalue decomposition.**  The embedding is encoded in the
+     eigenvectors corresponding to the :math:`d` largest eigenvalues of the
+     :math:`N \times N` isomap kernel.  For a dense solver, the cost is
+     approximately :math:`O[d N^2]`.  This cost can often be improved using
+     the ``ARPACK`` solver.  The eigensolver can be specified by the user
+     with the ``eigen_solver`` keyword of ``Isomap``.  If unspecified, the
+     code attempts to choose the best algorithm for the input data.
 
-The overall complexity of Isomap is
-:math:`O[D \log(k) N \log(N)] + O[N^2(k + \log(N))] + O[d N^2]`.
+  The overall complexity of Isomap is
+  :math:`O[D \log(k) N \log(N)] + O[N^2(k + \log(N))] + O[d N^2]`.
 
-* :math:`N` : number of training data points
-* :math:`D` : input dimension
-* :math:`k` : number of nearest neighbors
-* :math:`d` : output dimension
+  * :math:`N` : number of training data points
+  * :math:`D` : input dimension
+  * :math:`k` : number of nearest neighbors
+  * :math:`d` : output dimension
 
-|details-end|
+.. rubric:: References
 
-.. topic:: References:
-
-   * `"A global geometric framework for nonlinear dimensionality reduction"
-     <http://science.sciencemag.org/content/290/5500/2319.full>`_
-     Tenenbaum, J.B.; De Silva, V.; & Langford, J.C.  Science 290 (5500)
+* `"A global geometric framework for nonlinear dimensionality reduction"
+  <http://science.sciencemag.org/content/290/5500/2319.full>`_
+  Tenenbaum, J.B.; De Silva, V.; & Langford, J.C.  Science 290 (5500)
 
 .. _locally_linear_embedding:
 
@@ -191,36 +187,32 @@ Locally linear embedding can be performed with function
    :align: center
    :scale: 50
 
-|details-start|
-**Complexity**
-|details-split|
-
-The standard LLE algorithm comprises three stages:
+.. dropdown:: Complexity
 
-1. **Nearest Neighbors Search**.  See discussion under Isomap above.
+  The standard LLE algorithm comprises three stages:
 
-2. **Weight Matrix Construction**. :math:`O[D N k^3]`.
-   The construction of the LLE weight matrix involves the solution of a
-   :math:`k \times k` linear equation for each of the :math:`N` local
-   neighborhoods
+  1. **Nearest Neighbors Search**.  See discussion under Isomap above.
 
-3. **Partial Eigenvalue Decomposition**. See discussion under Isomap above.
+  2. **Weight Matrix Construction**. :math:`O[D N k^3]`.
+     The construction of the LLE weight matrix involves the solution of a
+     :math:`k \times k` linear equation for each of the :math:`N` local
+     neighborhoods.
 
-The overall complexity of standard LLE is
-:math:`O[D \log(k) N \log(N)] + O[D N k^3] + O[d N^2]`.
+  3. **Partial Eigenvalue Decomposition**. See discussion under Isomap above.
 
-* :math:`N` : number of training data points
-* :math:`D` : input dimension
-* :math:`k` : number of nearest neighbors
-* :math:`d` : output dimension
+  The overall complexity of standard LLE is
+  :math:`O[D \log(k) N \log(N)] + O[D N k^3] + O[d N^2]`.
 
-|details-end|
+  * :math:`N` : number of training data points
+  * :math:`D` : input dimension
+  * :math:`k` : number of nearest neighbors
+  * :math:`d` : output dimension
 
-.. topic:: References:
+.. rubric:: References
 
-   * `"Nonlinear dimensionality reduction by locally linear embedding"
-     <http://www.sciencemag.org/content/290/5500/2323.full>`_
-     Roweis, S. & Saul, L.  Science 290:2323 (2000)
+* `"Nonlinear dimensionality reduction by locally linear embedding"
+  <http://www.sciencemag.org/content/290/5500/2323.full>`_
+  Roweis, S. & Saul, L.  Science 290:2323 (2000)
 
 
 Modified Locally Linear Embedding
@@ -248,38 +240,34 @@ It requires ``n_neighbors > n_components``.
    :align: center
    :scale: 50
 
-|details-start|
-**Complexity**
-|details-split|
-
-The MLLE algorithm comprises three stages:
+.. dropdown:: Complexity
 
-1. **Nearest Neighbors Search**.  Same as standard LLE
+  The MLLE algorithm comprises three stages:
 
-2. **Weight Matrix Construction**. Approximately
-   :math:`O[D N k^3] + O[N (k-D) k^2]`.  The first term is exactly equivalent
-   to that of standard LLE.  The second term has to do with constructing the
-   weight matrix from multiple weights.  In practice, the added cost of
-   constructing the MLLE weight matrix is relatively small compared to the
-   cost of stages 1 and 3.
+  1. **Nearest Neighbors Search**.  Same as standard LLE
 
-3. **Partial Eigenvalue Decomposition**. Same as standard LLE
+  2. **Weight Matrix Construction**. Approximately
+     :math:`O[D N k^3] + O[N (k-D) k^2]`.  The first term is exactly equivalent
+     to that of standard LLE.  The second term has to do with constructing the
+     weight matrix from multiple weights.  In practice, the added cost of
+     constructing the MLLE weight matrix is relatively small compared to the
+     cost of stages 1 and 3.
 
-The overall complexity of MLLE is
-:math:`O[D \log(k) N \log(N)] + O[D N k^3] + O[N (k-D) k^2] + O[d N^2]`.
+  3. **Partial Eigenvalue Decomposition**. Same as standard LLE
 
-* :math:`N` : number of training data points
-* :math:`D` : input dimension
-* :math:`k` : number of nearest neighbors
-* :math:`d` : output dimension
+  The overall complexity of MLLE is
+  :math:`O[D \log(k) N \log(N)] + O[D N k^3] + O[N (k-D) k^2] + O[d N^2]`.
 
-|details-end|
+  * :math:`N` : number of training data points
+  * :math:`D` : input dimension
+  * :math:`k` : number of nearest neighbors
+  * :math:`d` : output dimension
 
-.. topic:: References:
+.. rubric:: References
 
-   * `"MLLE: Modified Locally Linear Embedding Using Multiple Weights"
-     <https://citeseerx.ist.psu.edu/doc_view/pid/0b060fdbd92cbcc66b383bcaa9ba5e5e624d7ee3>`_
-     Zhang, Z. & Wang, J.
+* `"MLLE: Modified Locally Linear Embedding Using Multiple Weights"
+  <https://citeseerx.ist.psu.edu/doc_view/pid/0b060fdbd92cbcc66b383bcaa9ba5e5e624d7ee3>`_
+  Zhang, Z. & Wang, J.
 
 
 Hessian Eigenmapping
@@ -301,36 +289,32 @@ It requires ``n_neighbors > n_components * (n_components + 3) / 2``.
    :align: center
    :scale: 50
 
-|details-start|
-**Complexity**
-|details-split|
+.. dropdown:: Complexity
 
 The HLLE algorithm comprises three stages:
 
-1. **Nearest Neighbors Search**.  Same as standard LLE
+  1. **Nearest Neighbors Search**.  Same as standard LLE
 
-2. **Weight Matrix Construction**. Approximately
-   :math:`O[D N k^3] + O[N d^6]`.  The first term reflects a similar
-   cost to that of standard LLE.  The second term comes from a QR
-   decomposition of the local hessian estimator.
+  2. **Weight Matrix Construction**. Approximately
+     :math:`O[D N k^3] + O[N d^6]`.  The first term reflects a similar
+     cost to that of standard LLE.  The second term comes from a QR
+     decomposition of the local hessian estimator.
 
-3. **Partial Eigenvalue Decomposition**. Same as standard LLE
+  3. **Partial Eigenvalue Decomposition**. Same as standard LLE
 
-The overall complexity of standard HLLE is
-:math:`O[D \log(k) N \log(N)] + O[D N k^3] + O[N d^6] + O[d N^2]`.
+  The overall complexity of standard HLLE is
+  :math:`O[D \log(k) N \log(N)] + O[D N k^3] + O[N d^6] + O[d N^2]`.
 
-* :math:`N` : number of training data points
-* :math:`D` : input dimension
-* :math:`k` : number of nearest neighbors
-* :math:`d` : output dimension
+  * :math:`N` : number of training data points
+  * :math:`D` : input dimension
+  * :math:`k` : number of nearest neighbors
+  * :math:`d` : output dimension
 
-|details-end|
+.. rubric:: References
 
-.. topic:: References:
-
-   * `"Hessian Eigenmaps: Locally linear embedding techniques for
-     high-dimensional data" <http://www.pnas.org/content/100/10/5591>`_
-     Donoho, D. & Grimes, C. Proc Natl Acad Sci USA. 100:5591 (2003)
+* `"Hessian Eigenmaps: Locally linear embedding techniques for
+  high-dimensional data" <http://www.pnas.org/content/100/10/5591>`_
+  Donoho, D. & Grimes, C. Proc Natl Acad Sci USA. 100:5591 (2003)
 
 .. _spectral_embedding:
 
@@ -348,38 +332,34 @@ preserving local distances. Spectral embedding can be  performed with the
 function :func:`spectral_embedding` or its object-oriented counterpart
 :class:`SpectralEmbedding`.
 
-|details-start|
-**Complexity**
-|details-split|
-
-The Spectral Embedding (Laplacian Eigenmaps) algorithm comprises three stages:
+.. dropdown:: Complexity
 
-1. **Weighted Graph Construction**. Transform the raw input data into
-   graph representation using affinity (adjacency) matrix representation.
+  The Spectral Embedding (Laplacian Eigenmaps) algorithm comprises three stages:
 
-2. **Graph Laplacian Construction**. unnormalized Graph Laplacian
-   is constructed as :math:`L = D - A` for and normalized one as
-   :math:`L = D^{-\frac{1}{2}} (D - A) D^{-\frac{1}{2}}`.
+  1. **Weighted Graph Construction**. Transform the raw input data into
+     graph representation using affinity (adjacency) matrix representation.
 
-3. **Partial Eigenvalue Decomposition**. Eigenvalue decomposition is
-   done on graph Laplacian
+  2. **Graph Laplacian Construction**. unnormalized Graph Laplacian
+     is constructed as :math:`L = D - A` for and normalized one as
+     :math:`L = D^{-\frac{1}{2}} (D - A) D^{-\frac{1}{2}}`.
 
-The overall complexity of spectral embedding is
-:math:`O[D \log(k) N \log(N)] + O[D N k^3] + O[d N^2]`.
+  3. **Partial Eigenvalue Decomposition**. Eigenvalue decomposition is
+     done on graph Laplacian.
 
-* :math:`N` : number of training data points
-* :math:`D` : input dimension
-* :math:`k` : number of nearest neighbors
-* :math:`d` : output dimension
+  The overall complexity of spectral embedding is
+  :math:`O[D \log(k) N \log(N)] + O[D N k^3] + O[d N^2]`.
 
-|details-end|
+  * :math:`N` : number of training data points
+  * :math:`D` : input dimension
+  * :math:`k` : number of nearest neighbors
+  * :math:`d` : output dimension
 
-.. topic:: References:
+.. rubric:: References
 
-   * `"Laplacian Eigenmaps for Dimensionality Reduction
-     and Data Representation"
-     <https://web.cse.ohio-state.edu/~mbelkin/papers/LEM_NC_03.pdf>`_
-     M. Belkin, P. Niyogi, Neural Computation, June 2003; 15 (6):1373-1396
+* `"Laplacian Eigenmaps for Dimensionality Reduction
+  and Data Representation"
+  <https://web.cse.ohio-state.edu/~mbelkin/papers/LEM_NC_03.pdf>`_
+  M. Belkin, P. Niyogi, Neural Computation, June 2003; 15 (6):1373-1396
 
 
 Local Tangent Space Alignment
@@ -399,36 +379,32 @@ tangent spaces to learn the embedding.  LTSA can be performed with function
    :align: center
    :scale: 50
 
-|details-start|
-**Complexity**
-|details-split|
+.. dropdown:: Complexity
 
-The LTSA algorithm comprises three stages:
+  The LTSA algorithm comprises three stages:
 
-1. **Nearest Neighbors Search**.  Same as standard LLE
+  1. **Nearest Neighbors Search**.  Same as standard LLE
 
-2. **Weight Matrix Construction**. Approximately
-   :math:`O[D N k^3] + O[k^2 d]`.  The first term reflects a similar
-   cost to that of standard LLE.
+  2. **Weight Matrix Construction**. Approximately
+     :math:`O[D N k^3] + O[k^2 d]`.  The first term reflects a similar
+     cost to that of standard LLE.
 
-3. **Partial Eigenvalue Decomposition**. Same as standard LLE
+  3. **Partial Eigenvalue Decomposition**. Same as standard LLE
 
-The overall complexity of standard LTSA is
-:math:`O[D \log(k) N \log(N)] + O[D N k^3] + O[k^2 d] + O[d N^2]`.
+  The overall complexity of standard LTSA is
+  :math:`O[D \log(k) N \log(N)] + O[D N k^3] + O[k^2 d] + O[d N^2]`.
 
-* :math:`N` : number of training data points
-* :math:`D` : input dimension
-* :math:`k` : number of nearest neighbors
-* :math:`d` : output dimension
+  * :math:`N` : number of training data points
+  * :math:`D` : input dimension
+  * :math:`k` : number of nearest neighbors
+  * :math:`d` : output dimension
 
-|details-end|
+.. rubric:: References
 
-.. topic:: References:
-
-   * :arxiv:`"Principal manifolds and nonlinear dimensionality reduction via
-     tangent space alignment"
-     <cs/0212008>`
-     Zhang, Z. & Zha, H. Journal of Shanghai Univ. 8:406 (2004)
+* :arxiv:`"Principal manifolds and nonlinear dimensionality reduction via
+  tangent space alignment"
+  <cs/0212008>`
+  Zhang, Z. & Zha, H. Journal of Shanghai Univ. 8:406 (2004)
 
 .. _multidimensional_scaling:
 
@@ -467,67 +443,59 @@ the similarities chosen in some optimal ways. The objective, called the
 stress, is then defined by :math:`\sum_{i < j} d_{ij}(X) - \hat{d}_{ij}(X)`
 
 
-|details-start|
-**Metric MDS**
-|details-split|
-
-The simplest metric :class:`MDS` model, called *absolute MDS*, disparities are defined by
-:math:`\hat{d}_{ij} = S_{ij}`. With absolute MDS, the value :math:`S_{ij}`
-should then correspond exactly to the distance between point :math:`i` and
-:math:`j` in the embedding point.
+.. dropdown:: Metric MDS
 
-Most commonly, disparities are set to :math:`\hat{d}_{ij} = b S_{ij}`.
+  The simplest metric :class:`MDS` model, called *absolute MDS*, disparities are defined by
+  :math:`\hat{d}_{ij} = S_{ij}`. With absolute MDS, the value :math:`S_{ij}`
+  should then correspond exactly to the distance between point :math:`i` and
+  :math:`j` in the embedding point.
 
-|details-end|
+  Most commonly, disparities are set to :math:`\hat{d}_{ij} = b S_{ij}`.
 
-|details-start|
-**Nonmetric MDS**
-|details-split|
+.. dropdown:: Nonmetric MDS
 
-Non metric :class:`MDS` focuses on the ordination of the data. If
-:math:`S_{ij} > S_{jk}`, then the embedding should enforce :math:`d_{ij} <
-d_{jk}`. For this reason, we discuss it in terms of dissimilarities
-(:math:`\delta_{ij}`) instead of similarities (:math:`S_{ij}`). Note that
-dissimilarities can easily be obtained from similarities through a simple
-transform, e.g. :math:`\delta_{ij}=c_1-c_2 S_{ij}` for some real constants
-:math:`c_1, c_2`. A simple algorithm to enforce proper ordination is to use a
-monotonic regression of :math:`d_{ij}` on :math:`\delta_{ij}`, yielding
-disparities :math:`\hat{d}_{ij}` in the same order as :math:`\delta_{ij}`.
+  Non metric :class:`MDS` focuses on the ordination of the data. If
+  :math:`S_{ij} > S_{jk}`, then the embedding should enforce :math:`d_{ij} <
+  d_{jk}`. For this reason, we discuss it in terms of dissimilarities
+  (:math:`\delta_{ij}`) instead of similarities (:math:`S_{ij}`). Note that
+  dissimilarities can easily be obtained from similarities through a simple
+  transform, e.g. :math:`\delta_{ij}=c_1-c_2 S_{ij}` for some real constants
+  :math:`c_1, c_2`. A simple algorithm to enforce proper ordination is to use a
+  monotonic regression of :math:`d_{ij}` on :math:`\delta_{ij}`, yielding
+  disparities :math:`\hat{d}_{ij}` in the same order as :math:`\delta_{ij}`.
 
-A trivial solution to this problem is to set all the points on the origin. In
-order to avoid that, the disparities :math:`\hat{d}_{ij}` are normalized. Note
-that since we only care about relative ordering, our objective should be
-invariant to simple translation and scaling, however the stress used in metric
-MDS is sensitive to scaling. To address this, non-metric MDS may use a
-normalized stress, known as Stress-1 defined as
+  A trivial solution to this problem is to set all the points on the origin. In
+  order to avoid that, the disparities :math:`\hat{d}_{ij}` are normalized. Note
+  that since we only care about relative ordering, our objective should be
+  invariant to simple translation and scaling, however the stress used in metric
+  MDS is sensitive to scaling. To address this, non-metric MDS may use a
+  normalized stress, known as Stress-1 defined as
 
-.. math::
-    \sqrt{\frac{\sum_{i < j} (d_{ij} - \hat{d}_{ij})^2}{\sum_{i < j} d_{ij}^2}}.
+  .. math::
+      \sqrt{\frac{\sum_{i < j} (d_{ij} - \hat{d}_{ij})^2}{\sum_{i < j} d_{ij}^2}}.
 
-The use of normalized Stress-1 can be enabled by setting `normalized_stress=True`,
-however it is only compatible with the non-metric MDS problem and will be ignored
-in the metric case.
-
-.. figure:: ../auto_examples/manifold/images/sphx_glr_plot_mds_001.png
-   :target: ../auto_examples/manifold/plot_mds.html
-   :align: center
-   :scale: 60
+  The use of normalized Stress-1 can be enabled by setting `normalized_stress=True`,
+  however it is only compatible with the non-metric MDS problem and will be ignored
+  in the metric case.
 
-|details-end|
+  .. figure:: ../auto_examples/manifold/images/sphx_glr_plot_mds_001.png
+    :target: ../auto_examples/manifold/plot_mds.html
+    :align: center
+    :scale: 60
 
-.. topic:: References:
+.. rubric:: References
 
-  * `"Modern Multidimensional Scaling - Theory and Applications"
-    <https://www.springer.com/fr/book/9780387251509>`_
-    Borg, I.; Groenen P. Springer Series in Statistics (1997)
+* `"Modern Multidimensional Scaling - Theory and Applications"
+  <https://www.springer.com/fr/book/9780387251509>`_
+  Borg, I.; Groenen P. Springer Series in Statistics (1997)
 
-  * `"Nonmetric multidimensional scaling: a numerical method"
-    <http://cda.psych.uiuc.edu/psychometrika_highly_cited_articles/kruskal_1964b.pdf>`_
-    Kruskal, J. Psychometrika, 29 (1964)
+* `"Nonmetric multidimensional scaling: a numerical method"
+  <http://cda.psych.uiuc.edu/psychometrika_highly_cited_articles/kruskal_1964b.pdf>`_
+  Kruskal, J. Psychometrika, 29 (1964)
 
-  * `"Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis"
-    <http://cda.psych.uiuc.edu/psychometrika_highly_cited_articles/kruskal_1964a.pdf>`_
-    Kruskal, J. Psychometrika, 29, (1964)
+* `"Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis"
+  <http://cda.psych.uiuc.edu/psychometrika_highly_cited_articles/kruskal_1964a.pdf>`_
+  Kruskal, J. Psychometrika, 29, (1964)
 
 .. _t_sne:
 
@@ -575,120 +543,110 @@ The disadvantages to using t-SNE are roughly:
    :align: center
    :scale: 50
 
-|details-start|
-**Optimizing t-SNE**
-|details-split|
-
-The main purpose of t-SNE is visualization of high-dimensional data. Hence,
-it works best when the data will be embedded on two or three dimensions.
-
-Optimizing the KL divergence can be a little bit tricky sometimes. There are
-five parameters that control the optimization of t-SNE and therefore possibly
-the quality of the resulting embedding:
-
-* perplexity
-* early exaggeration factor
-* learning rate
-* maximum number of iterations
-* angle (not used in the exact method)
-
-The perplexity is defined as :math:`k=2^{(S)}` where :math:`S` is the Shannon
-entropy of the conditional probability distribution. The perplexity of a
-:math:`k`-sided die is :math:`k`, so that :math:`k` is effectively the number of
-nearest neighbors t-SNE considers when generating the conditional probabilities.
-Larger perplexities lead to more nearest neighbors and less sensitive to small
-structure. Conversely a lower perplexity considers a smaller number of
-neighbors, and thus ignores more global information in favour of the
-local neighborhood. As dataset sizes get larger more points will be
-required to get a reasonable sample of the local neighborhood, and hence
-larger perplexities may be required. Similarly noisier datasets will require
-larger perplexity values to encompass enough local neighbors to see beyond
-the background noise.
-
-The maximum number of iterations is usually high enough and does not need
-any tuning. The optimization consists of two phases: the early exaggeration
-phase and the final optimization. During early exaggeration the joint
-probabilities in the original space will be artificially increased by
-multiplication with a given factor. Larger factors result in larger gaps
-between natural clusters in the data. If the factor is too high, the KL
-divergence could increase during this phase. Usually it does not have to be
-tuned. A critical parameter is the learning rate. If it is too low gradient
-descent will get stuck in a bad local minimum. If it is too high the KL
-divergence will increase during optimization. A heuristic suggested in
-Belkina et al. (2019) is to set the learning rate to the sample size
-divided by the early exaggeration factor. We implement this heuristic
-as `learning_rate='auto'` argument. More tips can be found in
-Laurens van der Maaten's FAQ (see references). The last parameter, angle,
-is a tradeoff between performance and accuracy. Larger angles imply that we
-can approximate larger regions by a single point, leading to better speed
-but less accurate results.
-
-`"How to Use t-SNE Effectively" <https://distill.pub/2016/misread-tsne/>`_
-provides a good discussion of the effects of the various parameters, as well
-as interactive plots to explore the effects of different parameters.
-
-|details-end|
-
-|details-start|
-**Barnes-Hut t-SNE**
-|details-split|
-
-The Barnes-Hut t-SNE that has been implemented here is usually much slower than
-other manifold learning algorithms. The optimization is quite difficult
-and the computation of the gradient is :math:`O[d N log(N)]`, where :math:`d`
-is the number of output dimensions and :math:`N` is the number of samples. The
-Barnes-Hut method improves on the exact method where t-SNE complexity is
-:math:`O[d N^2]`, but has several other notable differences:
-
-* The Barnes-Hut implementation only works when the target dimensionality is 3
-  or less. The 2D case is typical when building visualizations.
-* Barnes-Hut only works with dense input data. Sparse data matrices can only be
-  embedded with the exact method or can be approximated by a dense low rank
-  projection for instance using :class:`~sklearn.decomposition.PCA`
-* Barnes-Hut is an approximation of the exact method. The approximation is
-  parameterized with the angle parameter, therefore the angle parameter is
-  unused when method="exact"
-* Barnes-Hut is significantly more scalable. Barnes-Hut can be used to embed
-  hundred of thousands of data points while the exact method can handle
-  thousands of samples before becoming computationally intractable
-
-For visualization purpose (which is the main use case of t-SNE), using the
-Barnes-Hut method is strongly recommended. The exact t-SNE method is useful
-for checking the theoretically properties of the embedding possibly in higher
-dimensional space but limit to small datasets due to computational constraints.
-
-Also note that the digits labels roughly match the natural grouping found by
-t-SNE while the linear 2D projection of the PCA model yields a representation
-where label regions largely overlap. This is a strong clue that this data can
-be well separated by non linear methods that focus on the local structure (e.g.
-an SVM with a Gaussian RBF kernel). However, failing to visualize well
-separated homogeneously labeled groups with t-SNE in 2D does not necessarily
-imply that the data cannot be correctly classified by a supervised model. It
-might be the case that 2 dimensions are not high enough to accurately represent
-the internal structure of the data.
-
-|details-end|
-
-.. topic:: References:
-
-  * `"Visualizing High-Dimensional Data Using t-SNE"
-    <https://jmlr.org/papers/v9/vandermaaten08a.html>`_
-    van der Maaten, L.J.P.; Hinton, G. Journal of Machine Learning Research
-    (2008)
-
-  * `"t-Distributed Stochastic Neighbor Embedding"
-    <https://lvdmaaten.github.io/tsne/>`_
-    van der Maaten, L.J.P.
-
-  * `"Accelerating t-SNE using Tree-Based Algorithms"
-    <https://lvdmaaten.github.io/publications/papers/JMLR_2014.pdf>`_
-    van der Maaten, L.J.P.; Journal of Machine Learning Research 15(Oct):3221-3245, 2014.
-
-  * `"Automated optimized parameters for T-distributed stochastic neighbor
-    embedding improve visualization and analysis of large datasets"
-    <https://www.nature.com/articles/s41467-019-13055-y>`_
-    Belkina, A.C., Ciccolella, C.O., Anno, R., Halpert, R., Spidlen, J.,
-    Snyder-Cappione, J.E., Nature Communications 10, 5415 (2019).
+.. dropdown:: Optimizing t-SNE
+
+  The main purpose of t-SNE is visualization of high-dimensional data. Hence,
+  it works best when the data will be embedded on two or three dimensions.
+
+  Optimizing the KL divergence can be a little bit tricky sometimes. There are
+  five parameters that control the optimization of t-SNE and therefore possibly
+  the quality of the resulting embedding:
+
+  * perplexity
+  * early exaggeration factor
+  * learning rate
+  * maximum number of iterations
+  * angle (not used in the exact method)
+
+  The perplexity is defined as :math:`k=2^{(S)}` where :math:`S` is the Shannon
+  entropy of the conditional probability distribution. The perplexity of a
+  :math:`k`-sided die is :math:`k`, so that :math:`k` is effectively the number of
+  nearest neighbors t-SNE considers when generating the conditional probabilities.
+  Larger perplexities lead to more nearest neighbors and less sensitive to small
+  structure. Conversely a lower perplexity considers a smaller number of
+  neighbors, and thus ignores more global information in favour of the
+  local neighborhood. As dataset sizes get larger more points will be
+  required to get a reasonable sample of the local neighborhood, and hence
+  larger perplexities may be required. Similarly noisier datasets will require
+  larger perplexity values to encompass enough local neighbors to see beyond
+  the background noise.
+
+  The maximum number of iterations is usually high enough and does not need
+  any tuning. The optimization consists of two phases: the early exaggeration
+  phase and the final optimization. During early exaggeration the joint
+  probabilities in the original space will be artificially increased by
+  multiplication with a given factor. Larger factors result in larger gaps
+  between natural clusters in the data. If the factor is too high, the KL
+  divergence could increase during this phase. Usually it does not have to be
+  tuned. A critical parameter is the learning rate. If it is too low gradient
+  descent will get stuck in a bad local minimum. If it is too high the KL
+  divergence will increase during optimization. A heuristic suggested in
+  Belkina et al. (2019) is to set the learning rate to the sample size
+  divided by the early exaggeration factor. We implement this heuristic
+  as `learning_rate='auto'` argument. More tips can be found in
+  Laurens van der Maaten's FAQ (see references). The last parameter, angle,
+  is a tradeoff between performance and accuracy. Larger angles imply that we
+  can approximate larger regions by a single point, leading to better speed
+  but less accurate results.
+
+  `"How to Use t-SNE Effectively" <https://distill.pub/2016/misread-tsne/>`_
+  provides a good discussion of the effects of the various parameters, as well
+  as interactive plots to explore the effects of different parameters.
+
+.. dropdown:: Barnes-Hut t-SNE
+
+  The Barnes-Hut t-SNE that has been implemented here is usually much slower than
+  other manifold learning algorithms. The optimization is quite difficult
+  and the computation of the gradient is :math:`O[d N log(N)]`, where :math:`d`
+  is the number of output dimensions and :math:`N` is the number of samples. The
+  Barnes-Hut method improves on the exact method where t-SNE complexity is
+  :math:`O[d N^2]`, but has several other notable differences:
+
+  * The Barnes-Hut implementation only works when the target dimensionality is 3
+    or less. The 2D case is typical when building visualizations.
+  * Barnes-Hut only works with dense input data. Sparse data matrices can only be
+    embedded with the exact method or can be approximated by a dense low rank
+    projection for instance using :class:`~sklearn.decomposition.PCA`
+  * Barnes-Hut is an approximation of the exact method. The approximation is
+    parameterized with the angle parameter, therefore the angle parameter is
+    unused when method="exact"
+  * Barnes-Hut is significantly more scalable. Barnes-Hut can be used to embed
+    hundred of thousands of data points while the exact method can handle
+    thousands of samples before becoming computationally intractable
+
+  For visualization purpose (which is the main use case of t-SNE), using the
+  Barnes-Hut method is strongly recommended. The exact t-SNE method is useful
+  for checking the theoretically properties of the embedding possibly in higher
+  dimensional space but limit to small datasets due to computational constraints.
+
+  Also note that the digits labels roughly match the natural grouping found by
+  t-SNE while the linear 2D projection of the PCA model yields a representation
+  where label regions largely overlap. This is a strong clue that this data can
+  be well separated by non linear methods that focus on the local structure (e.g.
+  an SVM with a Gaussian RBF kernel). However, failing to visualize well
+  separated homogeneously labeled groups with t-SNE in 2D does not necessarily
+  imply that the data cannot be correctly classified by a supervised model. It
+  might be the case that 2 dimensions are not high enough to accurately represent
+  the internal structure of the data.
+
+.. rubric:: References
+
+* `"Visualizing High-Dimensional Data Using t-SNE"
+  <https://jmlr.org/papers/v9/vandermaaten08a.html>`_
+  van der Maaten, L.J.P.; Hinton, G. Journal of Machine Learning Research (2008)
+
+* `"t-Distributed Stochastic Neighbor Embedding"
+  <https://lvdmaaten.github.io/tsne/>`_ van der Maaten, L.J.P.
+
+* `"Accelerating t-SNE using Tree-Based Algorithms"
+  <https://lvdmaaten.github.io/publications/papers/JMLR_2014.pdf>`_
+  van der Maaten, L.J.P.; Journal of Machine Learning Research 15(Oct):3221-3245, 2014.
+
+* `"Automated optimized parameters for T-distributed stochastic neighbor
+  embedding improve visualization and analysis of large datasets"
+  <https://www.nature.com/articles/s41467-019-13055-y>`_
+  Belkina, A.C., Ciccolella, C.O., Anno, R., Halpert, R., Spidlen, J.,
+  Snyder-Cappione, J.E., Nature Communications 10, 5415 (2019).
 
 Tips on practical use
 =====================
diff --git a/doc/modules/metrics.rst b/doc/modules/metrics.rst
index caea39319e869..63ea797223c22 100644
--- a/doc/modules/metrics.rst
+++ b/doc/modules/metrics.rst
@@ -87,11 +87,11 @@ represented as tf-idf vectors.
 can produce normalized vectors, in which case :func:`cosine_similarity`
 is equivalent to :func:`linear_kernel`, only slower.)
 
-.. topic:: References:
+.. rubric:: References
 
-    * C.D. Manning, P. Raghavan and H. Schütze (2008). Introduction to
-      Information Retrieval. Cambridge University Press.
-      https://nlp.stanford.edu/IR-book/html/htmledition/the-vector-space-model-for-scoring-1.html
+* C.D. Manning, P. Raghavan and H. Schütze (2008). Introduction to
+  Information Retrieval. Cambridge University Press.
+  https://nlp.stanford.edu/IR-book/html/htmledition/the-vector-space-model-for-scoring-1.html
 
 .. _linear_kernel:
 
@@ -222,10 +222,10 @@ which is a distance between discrete probability distributions.
 
 The chi squared kernel is most commonly used on histograms (bags) of visual words.
 
-.. topic:: References:
+.. rubric:: References
 
-    * Zhang, J. and Marszalek, M. and Lazebnik, S. and Schmid, C.
-      Local features and kernels for classification of texture and object
-      categories: A comprehensive study
-      International Journal of Computer Vision 2007
-      https://hal.archives-ouvertes.fr/hal-00171412/document
+* Zhang, J. and Marszalek, M. and Lazebnik, S. and Schmid, C.
+  Local features and kernels for classification of texture and object
+  categories: A comprehensive study
+  International Journal of Computer Vision 2007
+  https://hal.archives-ouvertes.fr/hal-00171412/document
diff --git a/doc/modules/mixture.rst b/doc/modules/mixture.rst
index df5d8020a1369..1fd72c3158336 100644
--- a/doc/modules/mixture.rst
+++ b/doc/modules/mixture.rst
@@ -60,128 +60,111 @@ full covariance.
    :align: center
    :scale: 75%
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * See :ref:`sphx_glr_auto_examples_mixture_plot_gmm_covariances.py` for an example of
-      using the Gaussian mixture as clustering on the iris dataset.
+* See :ref:`sphx_glr_auto_examples_mixture_plot_gmm_covariances.py` for an example of
+  using the Gaussian mixture as clustering on the iris dataset.
 
-    * See :ref:`sphx_glr_auto_examples_mixture_plot_gmm_pdf.py` for an example on plotting the
-      density estimation.
+* See :ref:`sphx_glr_auto_examples_mixture_plot_gmm_pdf.py` for an example on plotting the
+  density estimation.
 
-|details-start|
-**Pros and cons of class GaussianMixture**
-|details-split|
+.. dropdown:: Pros and cons of class GaussianMixture
 
-.. topic:: Pros:
+  .. rubric:: Pros
 
-    :Speed: It is the fastest algorithm for learning mixture models
+  :Speed: It is the fastest algorithm for learning mixture models
 
-    :Agnostic: As this algorithm maximizes only the likelihood, it
-      will not bias the means towards zero, or bias the cluster sizes to
-      have specific structures that might or might not apply.
+  :Agnostic: As this algorithm maximizes only the likelihood, it
+    will not bias the means towards zero, or bias the cluster sizes to
+    have specific structures that might or might not apply.
 
-.. topic:: Cons:
+  .. rubric:: Cons
 
-    :Singularities: When one has insufficiently many points per
-      mixture, estimating the covariance matrices becomes difficult,
-      and the algorithm is known to diverge and find solutions with
-      infinite likelihood unless one regularizes the covariances artificially.
+  :Singularities: When one has insufficiently many points per
+    mixture, estimating the covariance matrices becomes difficult,
+    and the algorithm is known to diverge and find solutions with
+    infinite likelihood unless one regularizes the covariances artificially.
 
-    :Number of components: This algorithm will always use all the
-      components it has access to, needing held-out data
-      or information theoretical criteria to decide how many components to use
-      in the absence of external cues.
+  :Number of components: This algorithm will always use all the
+    components it has access to, needing held-out data
+    or information theoretical criteria to decide how many components to use
+    in the absence of external cues.
 
-|details-end|
+.. dropdown:: Selecting the number of components in a classical Gaussian Mixture model
 
+  The BIC criterion can be used to select the number of components in a Gaussian
+  Mixture in an efficient way. In theory, it recovers the true number of
+  components only in the asymptotic regime (i.e. if much data is available and
+  assuming that the data was actually generated i.i.d. from a mixture of Gaussian
+  distribution). Note that using a :ref:`Variational Bayesian Gaussian mixture <bgmm>`
+  avoids the specification of the number of components for a Gaussian mixture
+  model.
 
-|details-start|
-**Selecting the number of components in a classical Gaussian Mixture model**
-|details-split|
+  .. figure:: ../auto_examples/mixture/images/sphx_glr_plot_gmm_selection_002.png
+    :target: ../auto_examples/mixture/plot_gmm_selection.html
+    :align: center
+    :scale: 50%
 
-The BIC criterion can be used to select the number of components in a Gaussian
-Mixture in an efficient way. In theory, it recovers the true number of
-components only in the asymptotic regime (i.e. if much data is available and
-assuming that the data was actually generated i.i.d. from a mixture of Gaussian
-distribution). Note that using a :ref:`Variational Bayesian Gaussian mixture <bgmm>`
-avoids the specification of the number of components for a Gaussian mixture
-model.
+  .. rubric:: Examples
 
-.. figure:: ../auto_examples/mixture/images/sphx_glr_plot_gmm_selection_002.png
-   :target: ../auto_examples/mixture/plot_gmm_selection.html
-   :align: center
-   :scale: 50%
-
-.. topic:: Examples:
-
-    * See :ref:`sphx_glr_auto_examples_mixture_plot_gmm_selection.py` for an example
-      of model selection performed with classical Gaussian mixture.
-
-|details-end|
+  * See :ref:`sphx_glr_auto_examples_mixture_plot_gmm_selection.py` for an example
+    of model selection performed with classical Gaussian mixture.
 
 .. _expectation_maximization:
 
-|details-start|
-**Estimation algorithm expectation-maximization**
-|details-split|
-
-The main difficulty in learning Gaussian mixture models from unlabeled
-data is that one usually doesn't know which points came from
-which latent component (if one has access to this information it gets
-very easy to fit a separate Gaussian distribution to each set of
-points). `Expectation-maximization
-<https://en.wikipedia.org/wiki/Expectation%E2%80%93maximization_algorithm>`_
-is a well-founded statistical
-algorithm to get around this problem by an iterative process. First
-one assumes random components (randomly centered on data points,
-learned from k-means, or even just normally distributed around the
-origin) and computes for each point a probability of being generated by
-each component of the model. Then, one tweaks the
-parameters to maximize the likelihood of the data given those
-assignments. Repeating this process is guaranteed to always converge
-to a local optimum.
-
-|details-end|
-
-|details-start|
-**Choice of the Initialization method**
-|details-split|
-
-There is a choice of four initialization methods (as well as inputting user defined
-initial means) to generate the initial centers for the model components:
-
-k-means (default)
-  This applies a traditional k-means clustering algorithm.
-  This can be computationally expensive compared to other initialization methods.
-
-k-means++
-  This uses the initialization method of k-means clustering: k-means++.
-  This will pick the first center at random from the data. Subsequent centers will be
-  chosen from a weighted distribution of the data favouring points further away from
-  existing centers. k-means++ is the default initialization for k-means so will be
-  quicker than running a full k-means but can still take a significant amount of
-  time for large data sets with many components.
-
-random_from_data
-  This will pick random data points from the input data as the initial
-  centers. This is a very fast method of initialization but can produce non-convergent
-  results if the chosen points are too close to each other.
-
-random
-  Centers are chosen as a small perturbation away from the mean of all data.
-  This method is simple but can lead to the model taking longer to converge.
-
-.. figure:: ../auto_examples/mixture/images/sphx_glr_plot_gmm_init_001.png
-   :target: ../auto_examples/mixture/plot_gmm_init.html
-   :align: center
-   :scale: 50%
-
-.. topic:: Examples:
-
-    * See :ref:`sphx_glr_auto_examples_mixture_plot_gmm_init.py` for an example of
-      using different initializations in Gaussian Mixture.
-
-|details-end|
+.. dropdown:: Estimation algorithm expectation-maximization
+
+  The main difficulty in learning Gaussian mixture models from unlabeled
+  data is that one usually doesn't know which points came from
+  which latent component (if one has access to this information it gets
+  very easy to fit a separate Gaussian distribution to each set of
+  points). `Expectation-maximization
+  <https://en.wikipedia.org/wiki/Expectation%E2%80%93maximization_algorithm>`_
+  is a well-founded statistical
+  algorithm to get around this problem by an iterative process. First
+  one assumes random components (randomly centered on data points,
+  learned from k-means, or even just normally distributed around the
+  origin) and computes for each point a probability of being generated by
+  each component of the model. Then, one tweaks the
+  parameters to maximize the likelihood of the data given those
+  assignments. Repeating this process is guaranteed to always converge
+  to a local optimum.
+
+.. dropdown:: Choice of the Initialization method
+
+  There is a choice of four initialization methods (as well as inputting user defined
+  initial means) to generate the initial centers for the model components:
+
+  k-means (default)
+    This applies a traditional k-means clustering algorithm.
+    This can be computationally expensive compared to other initialization methods.
+
+  k-means++
+    This uses the initialization method of k-means clustering: k-means++.
+    This will pick the first center at random from the data. Subsequent centers will be
+    chosen from a weighted distribution of the data favouring points further away from
+    existing centers. k-means++ is the default initialization for k-means so will be
+    quicker than running a full k-means but can still take a significant amount of
+    time for large data sets with many components.
+
+  random_from_data
+    This will pick random data points from the input data as the initial
+    centers. This is a very fast method of initialization but can produce non-convergent
+    results if the chosen points are too close to each other.
+
+  random
+    Centers are chosen as a small perturbation away from the mean of all data.
+    This method is simple but can lead to the model taking longer to converge.
+
+  .. figure:: ../auto_examples/mixture/images/sphx_glr_plot_gmm_init_001.png
+    :target: ../auto_examples/mixture/plot_gmm_init.html
+    :align: center
+    :scale: 50%
+
+  .. rubric:: Examples
+
+  * See :ref:`sphx_glr_auto_examples_mixture_plot_gmm_init.py` for an example of
+    using different initializations in Gaussian Mixture.
 
 .. _bgmm:
 
@@ -276,63 +259,58 @@ from the two resulting mixtures.
 
 
 
-.. topic:: Examples:
-
-    * See :ref:`sphx_glr_auto_examples_mixture_plot_gmm.py` for an example on
-      plotting the confidence ellipsoids for both :class:`GaussianMixture`
-      and :class:`BayesianGaussianMixture`.
-
-    * :ref:`sphx_glr_auto_examples_mixture_plot_gmm_sin.py` shows using
-      :class:`GaussianMixture` and :class:`BayesianGaussianMixture` to fit a
-      sine wave.
+.. rubric:: Examples
 
-    * See :ref:`sphx_glr_auto_examples_mixture_plot_concentration_prior.py`
-      for an example plotting the confidence ellipsoids for the
-      :class:`BayesianGaussianMixture` with different
-      ``weight_concentration_prior_type`` for different values of the parameter
-      ``weight_concentration_prior``.
+* See :ref:`sphx_glr_auto_examples_mixture_plot_gmm.py` for an example on
+  plotting the confidence ellipsoids for both :class:`GaussianMixture`
+  and :class:`BayesianGaussianMixture`.
 
-|details-start|
-**Pros and cons of variational inference with BayesianGaussianMixture**
-|details-split|
+* :ref:`sphx_glr_auto_examples_mixture_plot_gmm_sin.py` shows using
+  :class:`GaussianMixture` and :class:`BayesianGaussianMixture` to fit a
+  sine wave.
 
-.. topic:: Pros:
+* See :ref:`sphx_glr_auto_examples_mixture_plot_concentration_prior.py`
+  for an example plotting the confidence ellipsoids for the
+  :class:`BayesianGaussianMixture` with different
+  ``weight_concentration_prior_type`` for different values of the parameter
+  ``weight_concentration_prior``.
 
-    :Automatic selection: when ``weight_concentration_prior`` is small enough and
-      ``n_components`` is larger than what is found necessary by the model, the
-      Variational Bayesian mixture model has a natural tendency to set some mixture
-      weights values close to zero. This makes it possible to let the model choose
-      a suitable number of effective components automatically. Only an upper bound
-      of this number needs to be provided. Note however that the "ideal" number of
-      active components is very application specific and is typically ill-defined
-      in a data exploration setting.
+.. dropdown:: Pros and cons of variational inference with BayesianGaussianMixture
 
-    :Less sensitivity to the number of parameters: unlike finite models, which will
-      almost always use all components as much as they can, and hence will produce
-      wildly different solutions for different numbers of components, the
-      variational inference with a Dirichlet process prior
-      (``weight_concentration_prior_type='dirichlet_process'``) won't change much
-      with changes to the parameters, leading to more stability and less tuning.
+  .. rubric:: Pros
 
-    :Regularization: due to the incorporation of prior information,
-      variational solutions have less pathological special cases than
-      expectation-maximization solutions.
+  :Automatic selection: when ``weight_concentration_prior`` is small enough and
+    ``n_components`` is larger than what is found necessary by the model, the
+    Variational Bayesian mixture model has a natural tendency to set some mixture
+    weights values close to zero. This makes it possible to let the model choose
+    a suitable number of effective components automatically. Only an upper bound
+    of this number needs to be provided. Note however that the "ideal" number of
+    active components is very application specific and is typically ill-defined
+    in a data exploration setting.
 
+  :Less sensitivity to the number of parameters: unlike finite models, which will
+    almost always use all components as much as they can, and hence will produce
+    wildly different solutions for different numbers of components, the
+    variational inference with a Dirichlet process prior
+    (``weight_concentration_prior_type='dirichlet_process'``) won't change much
+    with changes to the parameters, leading to more stability and less tuning.
 
-.. topic:: Cons:
+  :Regularization: due to the incorporation of prior information,
+    variational solutions have less pathological special cases than
+    expectation-maximization solutions.
 
-    :Speed: the extra parametrization necessary for variational inference makes
-      inference slower, although not by much.
+  .. rubric:: Cons
 
-    :Hyperparameters: this algorithm needs an extra hyperparameter
-      that might need experimental tuning via cross-validation.
+  :Speed: the extra parametrization necessary for variational inference makes
+    inference slower, although not by much.
 
-    :Bias: there are many implicit biases in the inference algorithms (and also in
-      the Dirichlet process if used), and whenever there is a mismatch between
-      these biases and the data it might be possible to fit better models using a
-      finite mixture.
+  :Hyperparameters: this algorithm needs an extra hyperparameter
+    that might need experimental tuning via cross-validation.
 
-|details-end|
+  :Bias: there are many implicit biases in the inference algorithms (and also in
+    the Dirichlet process if used), and whenever there is a mismatch between
+    these biases and the data it might be possible to fit better models using a
+    finite mixture.
 
 .. _dirichlet_process:
 
diff --git a/doc/modules/model_evaluation.rst b/doc/modules/model_evaluation.rst
index 9b79a2c7e151f..080ed0c63a58c 100644
--- a/doc/modules/model_evaluation.rst
+++ b/doc/modules/model_evaluation.rst
@@ -77,6 +77,7 @@ Scoring                                Function
 'roc_auc_ovo'                          :func:`metrics.roc_auc_score`
 'roc_auc_ovr_weighted'                 :func:`metrics.roc_auc_score`
 'roc_auc_ovo_weighted'                 :func:`metrics.roc_auc_score`
+'d2_log_loss_score'                    :func:`metrics.d2_log_loss_score`
 
 **Clustering**
 'adjusted_mutual_info_score'           :func:`metrics.adjusted_mutual_info_score`
@@ -102,12 +103,9 @@ Scoring                                Function
 'neg_mean_poisson_deviance'            :func:`metrics.mean_poisson_deviance`
 'neg_mean_gamma_deviance'              :func:`metrics.mean_gamma_deviance`
 'neg_mean_absolute_percentage_error'   :func:`metrics.mean_absolute_percentage_error`
-'d2_absolute_error_score'              :func:`metrics.d2_absolute_error_score`
-'d2_pinball_score'                     :func:`metrics.d2_pinball_score`
-'d2_tweedie_score'                     :func:`metrics.d2_tweedie_score`
+'d2_absolute_error_score' 	           :func:`metrics.d2_absolute_error_score`
 ====================================   ==============================================     ==================================
 
-
 Usage examples:
 
     >>> from sklearn import svm, datasets
@@ -130,27 +128,25 @@ Usage examples:
 Defining your scoring strategy from metric functions
 -----------------------------------------------------
 
-The module :mod:`sklearn.metrics` also exposes a set of simple functions
-measuring a prediction error given ground truth and prediction:
-
-- functions ending with ``_score`` return a value to
-  maximize, the higher the better.
-
-- functions ending with ``_error`` or ``_loss`` return a
-  value to minimize, the lower the better.  When converting
-  into a scorer object using :func:`make_scorer`, set
-  the ``greater_is_better`` parameter to ``False`` (``True`` by default; see the
-  parameter description below).
-
-Metrics available for various machine learning tasks are detailed in sections
-below.
-
-Many metrics are not given names to be used as ``scoring`` values,
+The following metrics functions are not implemented as named scorers,
 sometimes because they require additional parameters, such as
-:func:`fbeta_score`. In such cases, you need to generate an appropriate
-scoring object.  The simplest way to generate a callable object for scoring
-is by using :func:`make_scorer`. That function converts metrics
-into callables that can be used for model evaluation.
+:func:`fbeta_score`. They cannot be passed to the ``scoring``
+parameters; instead their callable needs to be passed to
+:func:`make_scorer` together with the value of the user-settable
+parameters.
+
+=====================================  =========  ==============================================
+Function                               Parameter  Example usage
+=====================================  =========  ==============================================
+**Classification**
+:func:`metrics.fbeta_score`            ``beta``   ``make_scorer(fbeta_score, beta=2)``
+
+**Regression**
+:func:`metrics.mean_tweedie_deviance`  ``power``  ``make_scorer(mean_tweedie_deviance, power=1.5)``
+:func:`metrics.mean_pinball_loss`      ``alpha``  ``make_scorer(mean_pinball_loss, alpha=0.95)``
+:func:`metrics.d2_tweedie_score`       ``power``  ``make_scorer(d2_tweedie_score, power=1.5)``
+:func:`metrics.d2_pinball_score`       ``alpha``  ``make_scorer(d2_pinball_score, alpha=0.95)``
+=====================================  =========  ==============================================
 
 One typical use case is to wrap an existing metric function from the library
 with non-default values for its parameters, such as the ``beta`` parameter for
@@ -160,62 +156,69 @@ the :func:`fbeta_score` function::
     >>> ftwo_scorer = make_scorer(fbeta_score, beta=2)
     >>> from sklearn.model_selection import GridSearchCV
     >>> from sklearn.svm import LinearSVC
-    >>> grid = GridSearchCV(LinearSVC(dual="auto"), param_grid={'C': [1, 10]},
+    >>> grid = GridSearchCV(LinearSVC(), param_grid={'C': [1, 10]},
     ...                     scoring=ftwo_scorer, cv=5)
 
+The module :mod:`sklearn.metrics` also exposes a set of simple functions
+measuring a prediction error given ground truth and prediction:
 
-|details-start|
-**Custom scorer objects**
-|details-split|
-
-
-The second use case is to build a completely custom scorer object
-from a simple python function using :func:`make_scorer`, which can
-take several parameters:
-
-* the python function you want to use (``my_custom_loss_func``
-  in the example below)
-
-* whether the python function returns a score (``greater_is_better=True``,
-  the default) or a loss (``greater_is_better=False``).  If a loss, the output
-  of the python function is negated by the scorer object, conforming to
-  the cross validation convention that scorers return higher values for better models.
-
-* for classification metrics only: whether the python function you provided requires
-  continuous decision certainties. If the scoring function only accepts probability
-  estimates (e.g. :func:`metrics.log_loss`) then one needs to set the parameter
-  `response_method`, thus in this case `response_method="predict_proba"`. Some scoring
-  function do not necessarily require probability estimates but rather non-thresholded
-  decision values (e.g. :func:`metrics.roc_auc_score`). In this case, one provides a
-  list such as `response_method=["decision_function", "predict_proba"]`. In this case,
-  the scorer will use the first available method, in the order given in the list,
-  to compute the scores.
+- functions ending with ``_score`` return a value to
+  maximize, the higher the better.
 
-* any additional parameters, such as ``beta`` or ``labels`` in :func:`f1_score`.
+- functions ending with ``_error``, ``_loss``, or ``_deviance`` return a
+  value to minimize, the lower the better.  When converting
+  into a scorer object using :func:`make_scorer`, set
+  the ``greater_is_better`` parameter to ``False`` (``True`` by default; see the
+  parameter description below).
 
-Here is an example of building custom scorers, and of using the
-``greater_is_better`` parameter::
 
-    >>> import numpy as np
-    >>> def my_custom_loss_func(y_true, y_pred):
-    ...     diff = np.abs(y_true - y_pred).max()
-    ...     return np.log1p(diff)
-    ...
-    >>> # score will negate the return value of my_custom_loss_func,
-    >>> # which will be np.log(2), 0.693, given the values for X
-    >>> # and y defined below.
-    >>> score = make_scorer(my_custom_loss_func, greater_is_better=False)
-    >>> X = [[1], [1]]
-    >>> y = [0, 1]
-    >>> from sklearn.dummy import DummyClassifier
-    >>> clf = DummyClassifier(strategy='most_frequent', random_state=0)
-    >>> clf = clf.fit(X, y)
-    >>> my_custom_loss_func(y, clf.predict(X))
-    0.69...
-    >>> score(clf, X, y)
-    -0.69...
-
-|details-end|
+.. dropdown:: Custom scorer objects
+
+  The second use case is to build a completely custom scorer object
+  from a simple python function using :func:`make_scorer`, which can
+  take several parameters:
+
+  * the python function you want to use (``my_custom_loss_func``
+    in the example below)
+
+  * whether the python function returns a score (``greater_is_better=True``,
+    the default) or a loss (``greater_is_better=False``).  If a loss, the output
+    of the python function is negated by the scorer object, conforming to
+    the cross validation convention that scorers return higher values for better models.
+
+  * for classification metrics only: whether the python function you provided requires
+    continuous decision certainties. If the scoring function only accepts probability
+    estimates (e.g. :func:`metrics.log_loss`) then one needs to set the parameter
+    `response_method`, thus in this case `response_method="predict_proba"`. Some scoring
+    function do not necessarily require probability estimates but rather non-thresholded
+    decision values (e.g. :func:`metrics.roc_auc_score`). In this case, one provides a
+    list such as `response_method=["decision_function", "predict_proba"]`. In this case,
+    the scorer will use the first available method, in the order given in the list,
+    to compute the scores.
+
+  * any additional parameters, such as ``beta`` or ``labels`` in :func:`f1_score`.
+
+  Here is an example of building custom scorers, and of using the
+  ``greater_is_better`` parameter::
+
+      >>> import numpy as np
+      >>> def my_custom_loss_func(y_true, y_pred):
+      ...     diff = np.abs(y_true - y_pred).max()
+      ...     return np.log1p(diff)
+      ...
+      >>> # score will negate the return value of my_custom_loss_func,
+      >>> # which will be np.log(2), 0.693, given the values for X
+      >>> # and y defined below.
+      >>> score = make_scorer(my_custom_loss_func, greater_is_better=False)
+      >>> X = [[1], [1]]
+      >>> y = [0, 1]
+      >>> from sklearn.dummy import DummyClassifier
+      >>> clf = DummyClassifier(strategy='most_frequent', random_state=0)
+      >>> clf = clf.fit(X, y)
+      >>> my_custom_loss_func(y, clf.predict(X))
+      0.69...
+      >>> score(clf, X, y)
+      -0.69...
 
 .. _diy_scoring:
 
@@ -226,51 +229,47 @@ You can generate even more flexible model scorers by constructing your own
 scoring object from scratch, without using the :func:`make_scorer` factory.
 
 
-|details-start|
-**How to build a scorer from scratch**
-|details-split|
-
-For a callable to be a scorer, it needs to meet the protocol specified by
-the following two rules:
+.. dropdown:: How to build a scorer from scratch
 
-- It can be called with parameters ``(estimator, X, y)``, where ``estimator``
-  is the model that should be evaluated, ``X`` is validation data, and ``y`` is
-  the ground truth target for ``X`` (in the supervised case) or ``None`` (in the
-  unsupervised case).
+  For a callable to be a scorer, it needs to meet the protocol specified by
+  the following two rules:
 
-- It returns a floating point number that quantifies the
-  ``estimator`` prediction quality on ``X``, with reference to ``y``.
-  Again, by convention higher numbers are better, so if your scorer
-  returns loss, that value should be negated.
+  - It can be called with parameters ``(estimator, X, y)``, where ``estimator``
+    is the model that should be evaluated, ``X`` is validation data, and ``y`` is
+    the ground truth target for ``X`` (in the supervised case) or ``None`` (in the
+    unsupervised case).
 
-- Advanced: If it requires extra metadata to be passed to it, it should expose
-  a ``get_metadata_routing`` method returning the requested metadata. The user
-  should be able to set the requested metadata via a ``set_score_request``
-  method. Please see :ref:`User Guide <metadata_routing>` and :ref:`Developer
-  Guide <sphx_glr_auto_examples_miscellaneous_plot_metadata_routing.py>` for
-  more details.
+  - It returns a floating point number that quantifies the
+    ``estimator`` prediction quality on ``X``, with reference to ``y``.
+    Again, by convention higher numbers are better, so if your scorer
+    returns loss, that value should be negated.
 
+  - Advanced: If it requires extra metadata to be passed to it, it should expose
+    a ``get_metadata_routing`` method returning the requested metadata. The user
+    should be able to set the requested metadata via a ``set_score_request``
+    method. Please see :ref:`User Guide <metadata_routing>` and :ref:`Developer
+    Guide <sphx_glr_auto_examples_miscellaneous_plot_metadata_routing.py>` for
+    more details.
 
-.. note:: **Using custom scorers in functions where n_jobs > 1**
 
-    While defining the custom scoring function alongside the calling function
-    should work out of the box with the default joblib backend (loky),
-    importing it from another module will be a more robust approach and work
-    independently of the joblib backend.
+  .. note:: **Using custom scorers in functions where n_jobs > 1**
 
-    For example, to use ``n_jobs`` greater than 1 in the example below,
-    ``custom_scoring_function`` function is saved in a user-created module
-    (``custom_scorer_module.py``) and imported::
+      While defining the custom scoring function alongside the calling function
+      should work out of the box with the default joblib backend (loky),
+      importing it from another module will be a more robust approach and work
+      independently of the joblib backend.
 
-        >>> from custom_scorer_module import custom_scoring_function # doctest: +SKIP
-        >>> cross_val_score(model,
-        ...  X_train,
-        ...  y_train,
-        ...  scoring=make_scorer(custom_scoring_function, greater_is_better=False),
-        ...  cv=5,
-        ...  n_jobs=-1) # doctest: +SKIP
+      For example, to use ``n_jobs`` greater than 1 in the example below,
+      ``custom_scoring_function`` function is saved in a user-created module
+      (``custom_scorer_module.py``) and imported::
 
-|details-end|
+          >>> from custom_scorer_module import custom_scoring_function # doctest: +SKIP
+          >>> cross_val_score(model,
+          ...  X_train,
+          ...  y_train,
+          ...  scoring=make_scorer(custom_scoring_function, greater_is_better=False),
+          ...  cv=5,
+          ...  n_jobs=-1) # doctest: +SKIP
 
 .. _multimetric_scoring:
 
@@ -301,7 +300,7 @@ parameter:
     >>> from sklearn.metrics import confusion_matrix
     >>> # A sample toy binary classification dataset
     >>> X, y = datasets.make_classification(n_classes=2, random_state=0)
-    >>> svm = LinearSVC(dual="auto", random_state=0)
+    >>> svm = LinearSVC(random_state=0)
     >>> def confusion_matrix_scorer(clf, X, y):
     ...      y_pred = clf.predict(X)
     ...      cm = confusion_matrix(y, y_pred)
@@ -370,6 +369,7 @@ Some also work in the multilabel case:
    recall_score
    roc_auc_score
    zero_one_loss
+   d2_log_loss_score
 
 And some work with binary and multilabel (but not multiclass) problems:
 
@@ -465,11 +465,11 @@ In the multilabel case with binary label indicators::
   >>> accuracy_score(np.array([[0, 1], [1, 1]]), np.ones((2, 2)))
   0.5
 
-.. topic:: Example:
+.. rubric:: Examples
 
-  * See :ref:`sphx_glr_auto_examples_model_selection_plot_permutation_tests_for_classification.py`
-    for an example of accuracy score usage using permutations of
-    the dataset.
+* See :ref:`sphx_glr_auto_examples_model_selection_plot_permutation_tests_for_classification.py`
+  for an example of accuracy score usage using permutations of
+  the dataset.
 
 .. _top_k_accuracy_score:
 
@@ -580,22 +580,20 @@ or *informedness*.
     * Balanced Accuracy as described in [Urbanowicz2015]_: the average of sensitivity and specificity
       is computed for each class and then averaged over total number of classes.
 
-.. topic:: References:
-
-  .. [Guyon2015] I. Guyon, K. Bennett, G. Cawley, H.J. Escalante, S. Escalera, T.K. Ho, N. Macià,
-     B. Ray, M. Saeed, A.R. Statnikov, E. Viegas, `Design of the 2015 ChaLearn AutoML Challenge
-     <https://ieeexplore.ieee.org/document/7280767>`_,
-     IJCNN 2015.
-  .. [Mosley2013] L. Mosley, `A balanced approach to the multi-class imbalance problem
-     <https://lib.dr.iastate.edu/etd/13537/>`_,
-     IJCV 2010.
-  .. [Kelleher2015] John. D. Kelleher, Brian Mac Namee, Aoife D'Arcy, `Fundamentals of
-     Machine Learning for Predictive Data Analytics: Algorithms, Worked Examples,
-     and Case Studies <https://mitpress.mit.edu/books/fundamentals-machine-learning-predictive-data-analytics>`_,
-     2015.
-  .. [Urbanowicz2015] Urbanowicz R.J.,  Moore, J.H. :doi:`ExSTraCS 2.0: description
-      and evaluation of a scalable learning classifier
-      system <10.1007/s12065-015-0128-8>`, Evol. Intel. (2015) 8: 89.
+.. rubric:: References
+
+.. [Guyon2015] I. Guyon, K. Bennett, G. Cawley, H.J. Escalante, S. Escalera, T.K. Ho, N. Macià,
+    B. Ray, M. Saeed, A.R. Statnikov, E. Viegas, `Design of the 2015 ChaLearn AutoML Challenge
+    <https://ieeexplore.ieee.org/document/7280767>`_, IJCNN 2015.
+.. [Mosley2013] L. Mosley, `A balanced approach to the multi-class imbalance problem
+    <https://lib.dr.iastate.edu/etd/13537/>`_, IJCV 2010.
+.. [Kelleher2015] John. D. Kelleher, Brian Mac Namee, Aoife D'Arcy, `Fundamentals of
+    Machine Learning for Predictive Data Analytics: Algorithms, Worked Examples,
+    and Case Studies <https://mitpress.mit.edu/books/fundamentals-machine-learning-predictive-data-analytics>`_,
+    2015.
+.. [Urbanowicz2015] Urbanowicz R.J.,  Moore, J.H. :doi:`ExSTraCS 2.0: description
+    and evaluation of a scalable learning classifier
+    system <10.1007/s12065-015-0128-8>`, Evol. Intel. (2015) 8: 89.
 
 .. _cohen_kappa:
 
@@ -607,7 +605,7 @@ The function :func:`cohen_kappa_score` computes `Cohen's kappa
 This measure is intended to compare labelings by different human annotators,
 not a classifier versus a ground truth.
 
-The kappa score (see docstring) is a number between -1 and 1.
+The kappa score is a number between -1 and 1.
 Scores above .8 are generally considered good agreement;
 zero or lower means no agreement (practically random labels).
 
@@ -616,9 +614,9 @@ but not for multilabel problems (except by manually computing a per-label score)
 and not for more than two annotators.
 
   >>> from sklearn.metrics import cohen_kappa_score
-  >>> y_true = [2, 0, 2, 2, 0, 1]
-  >>> y_pred = [0, 0, 2, 2, 0, 2]
-  >>> cohen_kappa_score(y_true, y_pred)
+  >>> labeling1 = [2, 0, 2, 2, 0, 1]
+  >>> labeling2 = [0, 0, 2, 2, 0, 2]
+  >>> cohen_kappa_score(labeling1, labeling2)
   0.4285714285714286
 
 .. _confusion_matrix:
@@ -674,19 +672,19 @@ false negatives and true positives as follows::
   >>> tn, fp, fn, tp
   (2, 1, 2, 3)
 
-.. topic:: Example:
+.. rubric:: Examples
 
-  * See :ref:`sphx_glr_auto_examples_model_selection_plot_confusion_matrix.py`
-    for an example of using a confusion matrix to evaluate classifier output
-    quality.
+* See :ref:`sphx_glr_auto_examples_model_selection_plot_confusion_matrix.py`
+  for an example of using a confusion matrix to evaluate classifier output
+  quality.
 
-  * See :ref:`sphx_glr_auto_examples_classification_plot_digits_classification.py`
-    for an example of using a confusion matrix to classify
-    hand-written digits.
+* See :ref:`sphx_glr_auto_examples_classification_plot_digits_classification.py`
+  for an example of using a confusion matrix to classify
+  hand-written digits.
 
-  * See :ref:`sphx_glr_auto_examples_text_plot_document_classification_20newsgroups.py`
-    for an example of using a confusion matrix to classify text
-    documents.
+* See :ref:`sphx_glr_auto_examples_text_plot_document_classification_20newsgroups.py`
+  for an example of using a confusion matrix to classify text
+  documents.
 
 .. _classification_report:
 
@@ -713,15 +711,15 @@ and inferred labels::
    weighted avg       0.67      0.60      0.59         5
    <BLANKLINE>
 
-.. topic:: Example:
+.. rubric:: Examples
 
-  * See :ref:`sphx_glr_auto_examples_classification_plot_digits_classification.py`
-    for an example of classification report usage for
-    hand-written digits.
+* See :ref:`sphx_glr_auto_examples_classification_plot_digits_classification.py`
+  for an example of classification report usage for
+  hand-written digits.
 
-  * See :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_digits.py`
-    for an example of classification report usage for
-    grid search with nested cross-validation.
+* See :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_digits.py`
+  for an example of classification report usage for
+  grid search with nested cross-validation.
 
 .. _hamming_loss:
 
@@ -839,31 +837,31 @@ precision-recall curve as follows.
         :scale: 75
         :align: center
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * See :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_digits.py`
-    for an example of :func:`precision_score` and :func:`recall_score` usage
-    to estimate parameters using grid search with nested cross-validation.
+* See :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_digits.py`
+  for an example of :func:`precision_score` and :func:`recall_score` usage
+  to estimate parameters using grid search with nested cross-validation.
 
-  * See :ref:`sphx_glr_auto_examples_model_selection_plot_precision_recall.py`
-    for an example of :func:`precision_recall_curve` usage to evaluate
-    classifier output quality.
+* See :ref:`sphx_glr_auto_examples_model_selection_plot_precision_recall.py`
+  for an example of :func:`precision_recall_curve` usage to evaluate
+  classifier output quality.
 
-.. topic:: References:
+.. rubric:: References
 
-  .. [Manning2008] C.D. Manning, P. Raghavan, H. Schütze, `Introduction to Information Retrieval
-     <https://nlp.stanford.edu/IR-book/html/htmledition/evaluation-of-ranked-retrieval-results-1.html>`_,
-     2008.
-  .. [Everingham2010] M. Everingham, L. Van Gool, C.K.I. Williams, J. Winn, A. Zisserman,
-     `The Pascal Visual Object Classes (VOC) Challenge
-     <https://citeseerx.ist.psu.edu/doc_view/pid/b6bebfd529b233f00cb854b7d8070319600cf59d>`_,
-     IJCV 2010.
-  .. [Davis2006] J. Davis, M. Goadrich, `The Relationship Between Precision-Recall and ROC Curves
-     <https://www.biostat.wisc.edu/~page/rocpr.pdf>`_,
-     ICML 2006.
-  .. [Flach2015] P.A. Flach, M. Kull, `Precision-Recall-Gain Curves: PR Analysis Done Right
-     <https://papers.nips.cc/paper/5867-precision-recall-gain-curves-pr-analysis-done-right.pdf>`_,
-     NIPS 2015.
+.. [Manning2008] C.D. Manning, P. Raghavan, H. Schütze, `Introduction to Information Retrieval
+    <https://nlp.stanford.edu/IR-book/html/htmledition/evaluation-of-ranked-retrieval-results-1.html>`_,
+    2008.
+.. [Everingham2010] M. Everingham, L. Van Gool, C.K.I. Williams, J. Winn, A. Zisserman,
+    `The Pascal Visual Object Classes (VOC) Challenge
+    <https://citeseerx.ist.psu.edu/doc_view/pid/b6bebfd529b233f00cb854b7d8070319600cf59d>`_,
+    IJCV 2010.
+.. [Davis2006] J. Davis, M. Goadrich, `The Relationship Between Precision-Recall and ROC Curves
+    <https://www.biostat.wisc.edu/~page/rocpr.pdf>`_,
+    ICML 2006.
+.. [Flach2015] P.A. Flach, M. Kull, `Precision-Recall-Gain Curves: PR Analysis Done Right
+    <https://papers.nips.cc/paper/5867-precision-recall-gain-curves-pr-analysis-done-right.pdf>`_,
+    NIPS 2015.
 
 Binary classification
 ^^^^^^^^^^^^^^^^^^^^^
@@ -1032,10 +1030,10 @@ Similarly, labels not present in the data sample may be accounted for in macro-a
   >>> metrics.precision_score(y_true, y_pred, labels=[0, 1, 2, 3], average='macro')
   0.166...
 
-.. topic:: References:
+.. rubric:: References
 
-    .. [OB2019] :arxiv:`Opitz, J., & Burst, S. (2019). "Macro f1 and macro f1."
-       <1911.03347>`
+.. [OB2019] :arxiv:`Opitz, J., & Burst, S. (2019). "Macro f1 and macro f1."
+    <1911.03347>`
 
 .. _jaccard_similarity_score:
 
@@ -1141,9 +1139,9 @@ with a svm classifier in a binary class problem::
   >>> from sklearn.metrics import hinge_loss
   >>> X = [[0], [1]]
   >>> y = [-1, 1]
-  >>> est = svm.LinearSVC(dual="auto", random_state=0)
+  >>> est = svm.LinearSVC(random_state=0)
   >>> est.fit(X, y)
-  LinearSVC(dual='auto', random_state=0)
+  LinearSVC(random_state=0)
   >>> pred_decision = est.decision_function([[-2], [3], [0.5]])
   >>> pred_decision
   array([-2.18...,  2.36...,  0.09...])
@@ -1156,9 +1154,9 @@ with a svm classifier in a multiclass problem::
   >>> X = np.array([[0], [1], [2], [3]])
   >>> Y = np.array([0, 1, 2, 3])
   >>> labels = np.array([0, 1, 2, 3])
-  >>> est = svm.LinearSVC(dual="auto")
+  >>> est = svm.LinearSVC()
   >>> est.fit(X, Y)
-  LinearSVC(dual='auto')
+  LinearSVC()
   >>> pred_decision = est.decision_function([[-1], [2], [3]])
   >>> y_true = [0, 2, 3]
   >>> hinge_loss(y_true, pred_decision, labels=labels)
@@ -1269,6 +1267,7 @@ When there are more than two labels, the value of the MCC will no longer range
 between -1 and +1. Instead the minimum value will be somewhere between -1 and 0
 depending on the number and distribution of ground true labels. The maximum
 value is always +1.
+For additional information, see [WikipediaMCC2021]_.
 
 Here is a small example illustrating the usage of the :func:`matthews_corrcoef`
 function:
@@ -1279,6 +1278,13 @@ function:
     >>> matthews_corrcoef(y_true, y_pred)
     -0.33...
 
+.. topic:: References:
+
+  .. [WikipediaMCC2021] Wikipedia contributors. Phi coefficient.
+     Wikipedia, The Free Encyclopedia. April 21, 2021, 12:21 CEST.
+     Available at: https://en.wikipedia.org/wiki/Phi_coefficient
+     Accessed April 21, 2021.
+
 .. _multilabel_confusion_matrix:
 
 Multi-label confusion matrix
@@ -1487,65 +1493,57 @@ correspond to the probability estimates that a sample belongs to a particular
 class. The OvO and OvR algorithms support weighting uniformly
 (``average='macro'``) and by prevalence (``average='weighted'``).
 
-|details-start|
-**One-vs-one Algorithm**
-|details-split|
-
-Computes the average AUC of all possible pairwise
-combinations of classes. [HT2001]_ defines a multiclass AUC metric weighted
-uniformly:
-
-.. math::
+.. dropdown:: One-vs-one Algorithm
 
-   \frac{1}{c(c-1)}\sum_{j=1}^{c}\sum_{k > j}^c (\text{AUC}(j | k) +
-   \text{AUC}(k | j))
+  Computes the average AUC of all possible pairwise
+  combinations of classes. [HT2001]_ defines a multiclass AUC metric weighted
+  uniformly:
 
-where :math:`c` is the number of classes and :math:`\text{AUC}(j | k)` is the
-AUC with class :math:`j` as the positive class and class :math:`k` as the
-negative class. In general,
-:math:`\text{AUC}(j | k) \neq \text{AUC}(k | j))` in the multiclass
-case. This algorithm is used by setting the keyword argument ``multiclass``
-to ``'ovo'`` and ``average`` to ``'macro'``.
+  .. math::
 
-The [HT2001]_ multiclass AUC metric can be extended to be weighted by the
-prevalence:
+    \frac{1}{c(c-1)}\sum_{j=1}^{c}\sum_{k > j}^c (\text{AUC}(j | k) +
+    \text{AUC}(k | j))
 
-.. math::
+  where :math:`c` is the number of classes and :math:`\text{AUC}(j | k)` is the
+  AUC with class :math:`j` as the positive class and class :math:`k` as the
+  negative class. In general,
+  :math:`\text{AUC}(j | k) \neq \text{AUC}(k | j))` in the multiclass
+  case. This algorithm is used by setting the keyword argument ``multiclass``
+  to ``'ovo'`` and ``average`` to ``'macro'``.
 
-   \frac{1}{c(c-1)}\sum_{j=1}^{c}\sum_{k > j}^c p(j \cup k)(
-   \text{AUC}(j | k) + \text{AUC}(k | j))
+  The [HT2001]_ multiclass AUC metric can be extended to be weighted by the
+  prevalence:
 
-where :math:`c` is the number of classes. This algorithm is used by setting
-the keyword argument ``multiclass`` to ``'ovo'`` and ``average`` to
-``'weighted'``. The ``'weighted'`` option returns a prevalence-weighted average
-as described in [FC2009]_.
+  .. math::
 
-|details-end|
+    \frac{1}{c(c-1)}\sum_{j=1}^{c}\sum_{k > j}^c p(j \cup k)(
+    \text{AUC}(j | k) + \text{AUC}(k | j))
 
-|details-start|
-**One-vs-rest Algorithm**
-|details-split|
+  where :math:`c` is the number of classes. This algorithm is used by setting
+  the keyword argument ``multiclass`` to ``'ovo'`` and ``average`` to
+  ``'weighted'``. The ``'weighted'`` option returns a prevalence-weighted average
+  as described in [FC2009]_.
 
-Computes the AUC of each class against the rest
-[PD2000]_. The algorithm is functionally the same as the multilabel case. To
-enable this algorithm set the keyword argument ``multiclass`` to ``'ovr'``.
-Additionally to ``'macro'`` [F2006]_ and ``'weighted'`` [F2001]_ averaging, OvR
-supports ``'micro'`` averaging.
+.. dropdown:: One-vs-rest Algorithm
 
-In applications where a high false positive rate is not tolerable the parameter
-``max_fpr`` of :func:`roc_auc_score` can be used to summarize the ROC curve up
-to the given limit.
+  Computes the AUC of each class against the rest
+  [PD2000]_. The algorithm is functionally the same as the multilabel case. To
+  enable this algorithm set the keyword argument ``multiclass`` to ``'ovr'``.
+  Additionally to ``'macro'`` [F2006]_ and ``'weighted'`` [F2001]_ averaging, OvR
+  supports ``'micro'`` averaging.
 
-The following figure shows the micro-averaged ROC curve and its corresponding
-ROC-AUC score for a classifier aimed to distinguish the different species in
-the :ref:`iris_dataset`:
+  In applications where a high false positive rate is not tolerable the parameter
+  ``max_fpr`` of :func:`roc_auc_score` can be used to summarize the ROC curve up
+  to the given limit.
 
-.. image:: ../auto_examples/model_selection/images/sphx_glr_plot_roc_002.png
-   :target: ../auto_examples/model_selection/plot_roc.html
-   :scale: 75
-   :align: center
+  The following figure shows the micro-averaged ROC curve and its corresponding
+  ROC-AUC score for a classifier aimed to distinguish the different species in
+  the :ref:`iris_dataset`:
 
-|details-end|
+  .. image:: ../auto_examples/model_selection/images/sphx_glr_plot_roc_002.png
+    :target: ../auto_examples/model_selection/plot_roc.html
+    :scale: 75
+    :align: center
 
 .. _roc_auc_multilabel:
 
@@ -1575,46 +1573,43 @@ And the decision values do not require such processing.
   >>> roc_auc_score(y, y_score, average=None)
   array([0.81..., 0.84... , 0.93..., 0.87..., 0.94...])
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * See :ref:`sphx_glr_auto_examples_model_selection_plot_roc.py`
-    for an example of using ROC to
-    evaluate the quality of the output of a classifier.
+* See :ref:`sphx_glr_auto_examples_model_selection_plot_roc.py` for an example of
+  using ROC to evaluate the quality of the output of a classifier.
 
-  * See :ref:`sphx_glr_auto_examples_model_selection_plot_roc_crossval.py`
-    for an example of using ROC to
-    evaluate classifier output quality, using cross-validation.
+* See :ref:`sphx_glr_auto_examples_model_selection_plot_roc_crossval.py`  for an
+  example of using ROC to evaluate classifier output quality, using cross-validation.
 
-  * See :ref:`sphx_glr_auto_examples_applications_plot_species_distribution_modeling.py`
-    for an example of using ROC to
-    model species distribution.
+* See :ref:`sphx_glr_auto_examples_applications_plot_species_distribution_modeling.py`
+  for an example of using ROC to model species distribution.
 
-.. topic:: References:
+.. rubric:: References
 
-    .. [HT2001] Hand, D.J. and Till, R.J., (2001). `A simple generalisation
-       of the area under the ROC curve for multiple class classification problems.
-       <http://link.springer.com/article/10.1023/A:1010920819831>`_
-       Machine learning, 45(2), pp. 171-186.
+.. [HT2001] Hand, D.J. and Till, R.J., (2001). `A simple generalisation
+   of the area under the ROC curve for multiple class classification problems.
+   <http://link.springer.com/article/10.1023/A:1010920819831>`_
+   Machine learning, 45(2), pp. 171-186.
 
-    .. [FC2009] Ferri, Cèsar & Hernandez-Orallo, Jose & Modroiu, R. (2009).
-       `An Experimental Comparison of Performance Measures for Classification.
-       <https://www.math.ucdavis.edu/~saito/data/roc/ferri-class-perf-metrics.pdf>`_
-       Pattern Recognition Letters. 30. 27-38.
+.. [FC2009] Ferri, Cèsar & Hernandez-Orallo, Jose & Modroiu, R. (2009).
+   `An Experimental Comparison of Performance Measures for Classification.
+   <https://www.math.ucdavis.edu/~saito/data/roc/ferri-class-perf-metrics.pdf>`_
+   Pattern Recognition Letters. 30. 27-38.
 
-    .. [PD2000] Provost, F., Domingos, P. (2000). `Well-trained PETs: Improving
-       probability estimation trees
-       <https://fosterprovost.com/publication/well-trained-pets-improving-probability-estimation-trees/>`_
-       (Section 6.2), CeDER Working Paper #IS-00-04, Stern School of Business,
-       New York University.
+.. [PD2000] Provost, F., Domingos, P. (2000). `Well-trained PETs: Improving
+   probability estimation trees
+   <https://fosterprovost.com/publication/well-trained-pets-improving-probability-estimation-trees/>`_
+   (Section 6.2), CeDER Working Paper #IS-00-04, Stern School of Business,
+   New York University.
 
-    .. [F2006] Fawcett, T., 2006. `An introduction to ROC analysis.
-       <http://www.sciencedirect.com/science/article/pii/S016786550500303X>`_
-       Pattern Recognition Letters, 27(8), pp. 861-874.
+.. [F2006] Fawcett, T., 2006. `An introduction to ROC analysis.
+   <http://www.sciencedirect.com/science/article/pii/S016786550500303X>`_
+   Pattern Recognition Letters, 27(8), pp. 861-874.
 
-    .. [F2001] Fawcett, T., 2001. `Using rule sets to maximize
-       ROC performance <https://ieeexplore.ieee.org/document/989510/>`_
-       In Data Mining, 2001.
-       Proceedings IEEE International Conference, pp. 131-138.
+.. [F2001] Fawcett, T., 2001. `Using rule sets to maximize
+   ROC performance <https://ieeexplore.ieee.org/document/989510/>`_
+   In Data Mining, 2001.
+   Proceedings IEEE International Conference, pp. 131-138.
 
 .. _det_curve:
 
@@ -1650,67 +1645,57 @@ same classification task:
    :scale: 75
    :align: center
 
-.. topic:: Examples:
-
-  * See :ref:`sphx_glr_auto_examples_model_selection_plot_det.py`
-    for an example comparison between receiver operating characteristic (ROC)
-    curves and Detection error tradeoff (DET) curves.
+.. dropdown:: Properties
 
-|details-start|
-**Properties**
-|details-split|
+  * DET curves form a linear curve in normal deviate scale if the detection
+    scores are normally (or close-to normally) distributed.
+    It was shown by [Navratil2007]_ that the reverse is not necessarily true and
+    even more general distributions are able to produce linear DET curves.
 
-* DET curves form a linear curve in normal deviate scale if the detection
-  scores are normally (or close-to normally) distributed.
-  It was shown by [Navratil2007]_ that the reverse is not necessarily true and
-  even more general distributions are able to produce linear DET curves.
+  * The normal deviate scale transformation spreads out the points such that a
+    comparatively larger space of plot is occupied.
+    Therefore curves with similar classification performance might be easier to
+    distinguish on a DET plot.
 
-* The normal deviate scale transformation spreads out the points such that a
-  comparatively larger space of plot is occupied.
-  Therefore curves with similar classification performance might be easier to
-  distinguish on a DET plot.
+  * With False Negative Rate being "inverse" to True Positive Rate the point
+    of perfection for DET curves is the origin (in contrast to the top left
+    corner for ROC curves).
 
-* With False Negative Rate being "inverse" to True Positive Rate the point
-  of perfection for DET curves is the origin (in contrast to the top left
-  corner for ROC curves).
+.. dropdown:: Applications and limitations
 
-|details-end|
+  DET curves are intuitive to read and hence allow quick visual assessment of a
+  classifier's performance.
+  Additionally DET curves can be consulted for threshold analysis and operating
+  point selection.
+  This is particularly helpful if a comparison of error types is required.
 
-|details-start|
-**Applications and limitations**
-|details-split|
+  On the other hand DET curves do not provide their metric as a single number.
+  Therefore for either automated evaluation or comparison to other
+  classification tasks metrics like the derived area under ROC curve might be
+  better suited.
 
-DET curves are intuitive to read and hence allow quick visual assessment of a
-classifier's performance.
-Additionally DET curves can be consulted for threshold analysis and operating
-point selection.
-This is particularly helpful if a comparison of error types is required.
+.. rubric:: Examples
 
-On the other hand DET curves do not provide their metric as a single number.
-Therefore for either automated evaluation or comparison to other
-classification tasks metrics like the derived area under ROC curve might be
-better suited.
+* See :ref:`sphx_glr_auto_examples_model_selection_plot_det.py`
+  for an example comparison between receiver operating characteristic (ROC)
+  curves and Detection error tradeoff (DET) curves.
 
-|details-end|
+.. rubric:: References
 
-.. topic:: References:
-
-  .. [WikipediaDET2017] Wikipedia contributors. Detection error tradeoff.
-     Wikipedia, The Free Encyclopedia. September 4, 2017, 23:33 UTC.
-     Available at: https://en.wikipedia.org/w/index.php?title=Detection_error_tradeoff&oldid=798982054.
-     Accessed February 19, 2018.
+.. [WikipediaDET2017] Wikipedia contributors. Detection error tradeoff.
+    Wikipedia, The Free Encyclopedia. September 4, 2017, 23:33 UTC.
+    Available at: https://en.wikipedia.org/w/index.php?title=Detection_error_tradeoff&oldid=798982054.
+    Accessed February 19, 2018.
 
-  .. [Martin1997] A. Martin, G. Doddington, T. Kamm, M. Ordowski, and M. Przybocki,
-     `The DET Curve in Assessment of Detection Task Performance
-     <https://ccc.inaoep.mx/~villasen/bib/martin97det.pdf>`_,
-     NIST 1997.
+.. [Martin1997] A. Martin, G. Doddington, T. Kamm, M. Ordowski, and M. Przybocki,
+    `The DET Curve in Assessment of Detection Task Performance
+    <https://ccc.inaoep.mx/~villasen/bib/martin97det.pdf>`_, NIST 1997.
 
-  .. [Navratil2007] J. Navractil and D. Klusacek,
-     "`On Linear DETs,
-     <https://ieeexplore.ieee.org/document/4218079>`_"
-     2007 IEEE International Conference on Acoustics,
-     Speech and Signal Processing - ICASSP '07, Honolulu,
-     HI, 2007, pp. IV-229-IV-232.
+.. [Navratil2007] J. Navractil and D. Klusacek,
+    `"On Linear DETs" <https://ieeexplore.ieee.org/document/4218079>`_,
+    2007 IEEE International Conference on Acoustics,
+    Speech and Signal Processing - ICASSP '07, Honolulu,
+    HI, 2007, pp. IV-229-IV-232.
 
 .. _zero_one_loss:
 
@@ -1758,11 +1743,11 @@ set [0,1] has an error::
   >>> zero_one_loss(np.array([[0, 1], [1, 1]]), np.ones((2, 2)),  normalize=False)
   1.0
 
-.. topic:: Example:
+.. rubric:: Examples
 
-  * See :ref:`sphx_glr_auto_examples_feature_selection_plot_rfe_with_cross_validation.py`
-    for an example of zero one loss usage to perform recursive feature
-    elimination with cross-validation.
+* See :ref:`sphx_glr_auto_examples_feature_selection_plot_rfe_with_cross_validation.py`
+  for an example of zero one loss usage to perform recursive feature
+  elimination with cross-validation.
 
 .. _brier_score_loss:
 
@@ -1818,28 +1803,27 @@ necessarily mean a better calibrated model. "Only when refinement loss remains
 the same does a lower Brier score loss always mean better calibration"
 [Bella2012]_, [Flach2008]_.
 
-.. topic:: Example:
+.. rubric:: Examples
 
-  * See :ref:`sphx_glr_auto_examples_calibration_plot_calibration.py`
-    for an example of Brier score loss usage to perform probability
-    calibration of classifiers.
+* See :ref:`sphx_glr_auto_examples_calibration_plot_calibration.py`
+  for an example of Brier score loss usage to perform probability
+  calibration of classifiers.
 
-.. topic:: References:
+.. rubric:: References
 
-  .. [Brier1950] G. Brier, `Verification of forecasts expressed in terms of
-    probability
-    <ftp://ftp.library.noaa.gov/docs.lib/htdocs/rescue/mwr/078/mwr-078-01-0001.pdf>`_,
-    Monthly weather review 78.1 (1950)
+.. [Brier1950] G. Brier, `Verification of forecasts expressed in terms of probability
+  <ftp://ftp.library.noaa.gov/docs.lib/htdocs/rescue/mwr/078/mwr-078-01-0001.pdf>`_,
+  Monthly weather review 78.1 (1950)
 
-  .. [Bella2012] Bella, Ferri, Hernández-Orallo, and Ramírez-Quintana
-    `"Calibration of Machine Learning Models"
-    <http://dmip.webs.upv.es/papers/BFHRHandbook2010.pdf>`_
-    in Khosrow-Pour, M. "Machine learning: concepts, methodologies, tools
-    and applications." Hershey, PA: Information Science Reference (2012).
+.. [Bella2012] Bella, Ferri, Hernández-Orallo, and Ramírez-Quintana
+  `"Calibration of Machine Learning Models"
+  <http://dmip.webs.upv.es/papers/BFHRHandbook2010.pdf>`_
+  in Khosrow-Pour, M. "Machine learning: concepts, methodologies, tools
+  and applications." Hershey, PA: Information Science Reference (2012).
 
-  .. [Flach2008] Flach, Peter, and Edson Matsubara. `"On classification, ranking,
-    and probability estimation." <https://drops.dagstuhl.de/opus/volltexte/2008/1382/>`_
-    Dagstuhl Seminar Proceedings. Schloss Dagstuhl-Leibniz-Zentrum fr Informatik (2008).
+.. [Flach2008] Flach, Peter, and Edson Matsubara. `"On classification, ranking,
+  and probability estimation." <https://drops.dagstuhl.de/opus/volltexte/2008/1382/>`_
+  Dagstuhl Seminar Proceedings. Schloss Dagstuhl-Leibniz-Zentrum fr Informatik (2008).
 
 .. _class_likelihood_ratios:
 
@@ -1892,82 +1876,72 @@ counts ``tp`` (see `the wikipedia page
 <https://en.wikipedia.org/wiki/Likelihood_ratios_in_diagnostic_testing>`_ for
 the actual formulas).
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_model_selection_plot_likelihood_ratios.py`
+* :ref:`sphx_glr_auto_examples_model_selection_plot_likelihood_ratios.py`
 
-|details-start|
-**Interpretation across varying prevalence**
-|details-split|
+.. dropdown:: Interpretation across varying prevalence
 
-Both class likelihood ratios are interpretable in terms of an odds ratio
-(pre-test and post-tests):
+  Both class likelihood ratios are interpretable in terms of an odds ratio
+  (pre-test and post-tests):
 
-.. math::
+  .. math::
 
-   \text{post-test odds} = \text{Likelihood ratio} \times \text{pre-test odds}.
+    \text{post-test odds} = \text{Likelihood ratio} \times \text{pre-test odds}.
 
-Odds are in general related to probabilities via
+  Odds are in general related to probabilities via
 
-.. math::
+  .. math::
 
-   \text{odds} = \frac{\text{probability}}{1 - \text{probability}},
+    \text{odds} = \frac{\text{probability}}{1 - \text{probability}},
 
-or equivalently
+  or equivalently
 
-.. math::
+  .. math::
 
-   \text{probability} = \frac{\text{odds}}{1 + \text{odds}}.
+    \text{probability} = \frac{\text{odds}}{1 + \text{odds}}.
 
-On a given population, the pre-test probability is given by the prevalence. By
-converting odds to probabilities, the likelihood ratios can be translated into a
-probability of truly belonging to either class before and after a classifier
-prediction:
+  On a given population, the pre-test probability is given by the prevalence. By
+  converting odds to probabilities, the likelihood ratios can be translated into a
+  probability of truly belonging to either class before and after a classifier
+  prediction:
 
-.. math::
+  .. math::
 
-   \text{post-test odds} = \text{Likelihood ratio} \times
-   \frac{\text{pre-test probability}}{1 - \text{pre-test probability}},
+    \text{post-test odds} = \text{Likelihood ratio} \times
+    \frac{\text{pre-test probability}}{1 - \text{pre-test probability}},
 
-.. math::
-
-   \text{post-test probability} = \frac{\text{post-test odds}}{1 + \text{post-test odds}}.
-
-|details-end|
+  .. math::
 
-|details-start|
-**Mathematical divergences**
-|details-split|
+    \text{post-test probability} = \frac{\text{post-test odds}}{1 + \text{post-test odds}}.
 
-The positive likelihood ratio is undefined when :math:`fp = 0`, which can be
-interpreted as the classifier perfectly identifying positive cases. If :math:`fp
-= 0` and additionally :math:`tp = 0`, this leads to a zero/zero division. This
-happens, for instance, when using a `DummyClassifier` that always predicts the
-negative class and therefore the interpretation as a perfect classifier is lost.
+.. dropdown:: Mathematical divergences
 
-The negative likelihood ratio is undefined when :math:`tn = 0`. Such divergence
-is invalid, as :math:`LR_- > 1` would indicate an increase in the odds of a
-sample belonging to the positive class after being classified as negative, as if
-the act of classifying caused the positive condition. This includes the case of
-a `DummyClassifier` that always predicts the positive class (i.e. when
-:math:`tn=fn=0`).
+  The positive likelihood ratio is undefined when :math:`fp = 0`, which can be
+  interpreted as the classifier perfectly identifying positive cases. If :math:`fp
+  = 0` and additionally :math:`tp = 0`, this leads to a zero/zero division. This
+  happens, for instance, when using a `DummyClassifier` that always predicts the
+  negative class and therefore the interpretation as a perfect classifier is lost.
 
-Both class likelihood ratios are undefined when :math:`tp=fn=0`, which means
-that no samples of the positive class were present in the testing set. This can
-also happen when cross-validating highly imbalanced data.
+  The negative likelihood ratio is undefined when :math:`tn = 0`. Such divergence
+  is invalid, as :math:`LR_- > 1` would indicate an increase in the odds of a
+  sample belonging to the positive class after being classified as negative, as if
+  the act of classifying caused the positive condition. This includes the case of
+  a `DummyClassifier` that always predicts the positive class (i.e. when
+  :math:`tn=fn=0`).
 
-In all the previous cases the :func:`class_likelihood_ratios` function raises by
-default an appropriate warning message and returns `nan` to avoid pollution when
-averaging over cross-validation folds.
+  Both class likelihood ratios are undefined when :math:`tp=fn=0`, which means
+  that no samples of the positive class were present in the testing set. This can
+  also happen when cross-validating highly imbalanced data.
 
-For a worked-out demonstration of the :func:`class_likelihood_ratios` function,
-see the example below.
+  In all the previous cases the :func:`class_likelihood_ratios` function raises by
+  default an appropriate warning message and returns `nan` to avoid pollution when
+  averaging over cross-validation folds.
 
-|details-end|
+  For a worked-out demonstration of the :func:`class_likelihood_ratios` function,
+  see the example below.
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
   * `Wikipedia entry for Likelihood ratios in diagnostic testing
     <https://en.wikipedia.org/wiki/Likelihood_ratios_in_diagnostic_testing>`_
@@ -1977,7 +1951,68 @@ see the example below.
     values with disease prevalence.
     Statistics in medicine, 16(9), 981-991.
 
-|details-end|
+
+.. _d2_score_classification:
+
+D² score for classification
+---------------------------
+
+The D² score computes the fraction of deviance explained.
+It is a generalization of R², where the squared error is generalized and replaced
+by a classification deviance of choice :math:`\text{dev}(y, \hat{y})`
+(e.g., Log loss). D² is a form of a *skill score*.
+It is calculated as
+
+.. math::
+
+  D^2(y, \hat{y}) = 1 - \frac{\text{dev}(y, \hat{y})}{\text{dev}(y, y_{\text{null}})} \,.
+
+Where :math:`y_{\text{null}}` is the optimal prediction of an intercept-only model
+(e.g., the per-class proportion of `y_true` in the case of the Log loss).
+
+Like R², the best possible score is 1.0 and it can be negative (because the
+model can be arbitrarily worse). A constant model that always predicts
+:math:`y_{\text{null}}`, disregarding the input features, would get a D² score
+of 0.0.
+
+.. dropdown:: D2 log loss score
+
+  The :func:`d2_log_loss_score` function implements the special case
+  of D² with the log loss, see :ref:`log_loss`, i.e.:
+
+  .. math::
+
+    \text{dev}(y, \hat{y}) = \text{log_loss}(y, \hat{y}).
+
+  Here are some usage examples of the :func:`d2_log_loss_score` function::
+
+    >>> from sklearn.metrics import d2_log_loss_score
+    >>> y_true = [1, 1, 2, 3]
+    >>> y_pred = [
+    ...    [0.5, 0.25, 0.25],
+    ...    [0.5, 0.25, 0.25],
+    ...    [0.5, 0.25, 0.25],
+    ...    [0.5, 0.25, 0.25],
+    ... ]
+    >>> d2_log_loss_score(y_true, y_pred)
+    0.0
+    >>> y_true = [1, 2, 3]
+    >>> y_pred = [
+    ...     [0.98, 0.01, 0.01],
+    ...     [0.01, 0.98, 0.01],
+    ...     [0.01, 0.01, 0.98],
+    ... ]
+    >>> d2_log_loss_score(y_true, y_pred)
+    0.981...
+    >>> y_true = [1, 2, 3]
+    >>> y_pred = [
+    ...     [0.1, 0.6, 0.3],
+    ...     [0.1, 0.6, 0.3],
+    ...     [0.4, 0.5, 0.1],
+    ... ]
+    >>> d2_log_loss_score(y_true, y_pred)
+    -0.552...
+
 
 .. _multilabel_ranking_metrics:
 
@@ -2117,14 +2152,11 @@ Here is a small example of usage of this function::
     0.0
 
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
   * Tsoumakas, G., Katakis, I., & Vlahavas, I. (2010). Mining multi-label data. In
     Data mining and knowledge discovery handbook (pp. 667-685). Springer US.
 
-|details-end|
 
 .. _ndcg:
 
@@ -2170,9 +2202,7 @@ DCG score is
 and the NDCG score is the DCG score divided by the DCG score obtained for
 :math:`y`.
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
   * `Wikipedia entry for Discounted Cumulative Gain
     <https://en.wikipedia.org/wiki/Discounted_cumulative_gain>`_
@@ -2190,7 +2220,6 @@ and the NDCG score is the DCG score divided by the DCG score obtained for
     European conference on information retrieval (pp. 414-421). Springer,
     Berlin, Heidelberg.
 
-|details-end|
 
 .. _regression_metrics:
 
@@ -2223,9 +2252,6 @@ leads to a weighting of each individual score by the variance of the
 corresponding target variable. This setting quantifies the globally captured
 unscaled variance. If the target variables are of different scale, then this
 score puts more importance on explaining the higher variance variables.
-``multioutput='variance_weighted'`` is the default value for :func:`r2_score`
-for backward compatibility. This will be changed to ``uniform_average`` in the
-future.
 
 .. _r2_score:
 
@@ -2303,11 +2329,11 @@ Here is a small example of usage of the :func:`r2_score` function::
   >>> r2_score(y_true, y_pred, force_finite=False)
   -inf
 
-.. topic:: Example:
+.. rubric:: Examples
 
-  * See :ref:`sphx_glr_auto_examples_linear_model_plot_lasso_and_elasticnet.py`
-    for an example of R² score usage to
-    evaluate Lasso and Elastic Net on sparse signals.
+* See :ref:`sphx_glr_auto_examples_linear_model_plot_lasso_and_elasticnet.py`
+  for an example of R² score usage to
+  evaluate Lasso and Elastic Net on sparse signals.
 
 .. _mean_absolute_error:
 
@@ -2374,11 +2400,10 @@ function::
   >>> mean_squared_error(y_true, y_pred)
   0.7083...
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * See :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_regression.py`
-    for an example of mean squared error usage to
-    evaluate gradient boosting regression.
+* See :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_regression.py`
+  for an example of mean squared error usage to evaluate gradient boosting regression.
 
 Taking the square root of the MSE, called the root mean squared error (RMSE), is another
 common metric that provides a measure in the same units as the target variable. RSME is
@@ -2716,12 +2741,12 @@ It is also possible to build scorer objects for hyper-parameter tuning. The
 sign of the loss must be switched to ensure that greater means better as
 explained in the example linked below.
 
-.. topic:: Example:
+.. rubric:: Examples
 
-  * See :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_quantile.py`
-    for an example of using the pinball loss to evaluate and tune the
-    hyper-parameters of quantile regression models on data with non-symmetric
-    noise and outliers.
+* See :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_quantile.py`
+  for an example of using the pinball loss to evaluate and tune the
+  hyper-parameters of quantile regression models on data with non-symmetric
+  noise and outliers.
 
 .. _d2_score:
 
@@ -2747,77 +2772,66 @@ model can be arbitrarily worse). A constant model that always predicts
 :math:`y_{\text{null}}`, disregarding the input features, would get a D² score
 of 0.0.
 
-|details-start|
-**D² Tweedie score**
-|details-split|
-
-The :func:`d2_tweedie_score` function implements the special case of D²
-where :math:`\text{dev}(y, \hat{y})` is the Tweedie deviance, see :ref:`mean_tweedie_deviance`.
-It is also known as D² Tweedie and is related to McFadden's likelihood ratio index.
-
-The argument ``power`` defines the Tweedie power as for
-:func:`mean_tweedie_deviance`. Note that for `power=0`,
-:func:`d2_tweedie_score` equals :func:`r2_score` (for single targets).
+.. dropdown:: D² Tweedie score
 
-A scorer object with a specific choice of ``power`` can be built by::
+  The :func:`d2_tweedie_score` function implements the special case of D²
+  where :math:`\text{dev}(y, \hat{y})` is the Tweedie deviance, see :ref:`mean_tweedie_deviance`.
+  It is also known as D² Tweedie and is related to McFadden's likelihood ratio index.
 
-  >>> from sklearn.metrics import d2_tweedie_score, make_scorer
-  >>> d2_tweedie_score_15 = make_scorer(d2_tweedie_score, power=1.5)
+  The argument ``power`` defines the Tweedie power as for
+  :func:`mean_tweedie_deviance`. Note that for `power=0`,
+  :func:`d2_tweedie_score` equals :func:`r2_score` (for single targets).
 
-|details-end|
+  A scorer object with a specific choice of ``power`` can be built by::
 
-|details-start|
-**D² pinball score**
-|details-split|
+    >>> from sklearn.metrics import d2_tweedie_score, make_scorer
+    >>> d2_tweedie_score_15 = make_scorer(d2_tweedie_score, power=1.5)
 
-The :func:`d2_pinball_score` function implements the special case
-of D² with the pinball loss, see :ref:`pinball_loss`, i.e.:
+.. dropdown:: D² pinball score
 
-.. math::
+  The :func:`d2_pinball_score` function implements the special case
+  of D² with the pinball loss, see :ref:`pinball_loss`, i.e.:
 
-  \text{dev}(y, \hat{y}) = \text{pinball}(y, \hat{y}).
+  .. math::
 
-The argument ``alpha`` defines the slope of the pinball loss as for
-:func:`mean_pinball_loss` (:ref:`pinball_loss`). It determines the
-quantile level ``alpha`` for which the pinball loss and also D²
-are optimal. Note that for `alpha=0.5` (the default) :func:`d2_pinball_score`
-equals :func:`d2_absolute_error_score`.
+    \text{dev}(y, \hat{y}) = \text{pinball}(y, \hat{y}).
 
-A scorer object with a specific choice of ``alpha`` can be built by::
+  The argument ``alpha`` defines the slope of the pinball loss as for
+  :func:`mean_pinball_loss` (:ref:`pinball_loss`). It determines the
+  quantile level ``alpha`` for which the pinball loss and also D²
+  are optimal. Note that for `alpha=0.5` (the default) :func:`d2_pinball_score`
+  equals :func:`d2_absolute_error_score`.
 
-  >>> from sklearn.metrics import d2_pinball_score, make_scorer
-  >>> d2_pinball_score_08 = make_scorer(d2_pinball_score, alpha=0.8)
+  A scorer object with a specific choice of ``alpha`` can be built by::
 
-|details-end|
+    >>> from sklearn.metrics import d2_pinball_score, make_scorer
+    >>> d2_pinball_score_08 = make_scorer(d2_pinball_score, alpha=0.8)
 
-|details-start|
-**D² absolute error score**
-|details-split|
+.. dropdown:: D² absolute error score
 
-The :func:`d2_absolute_error_score` function implements the special case of
-the :ref:`mean_absolute_error`:
+  The :func:`d2_absolute_error_score` function implements the special case of
+  the :ref:`mean_absolute_error`:
 
-.. math::
+  .. math::
 
-  \text{dev}(y, \hat{y}) = \text{MAE}(y, \hat{y}).
+    \text{dev}(y, \hat{y}) = \text{MAE}(y, \hat{y}).
 
-Here are some usage examples of the :func:`d2_absolute_error_score` function::
+  Here are some usage examples of the :func:`d2_absolute_error_score` function::
 
-  >>> from sklearn.metrics import d2_absolute_error_score
-  >>> y_true = [3, -0.5, 2, 7]
-  >>> y_pred = [2.5, 0.0, 2, 8]
-  >>> d2_absolute_error_score(y_true, y_pred)
-  0.764...
-  >>> y_true = [1, 2, 3]
-  >>> y_pred = [1, 2, 3]
-  >>> d2_absolute_error_score(y_true, y_pred)
-  1.0
-  >>> y_true = [1, 2, 3]
-  >>> y_pred = [2, 2, 2]
-  >>> d2_absolute_error_score(y_true, y_pred)
-  0.0
+    >>> from sklearn.metrics import d2_absolute_error_score
+    >>> y_true = [3, -0.5, 2, 7]
+    >>> y_pred = [2.5, 0.0, 2, 8]
+    >>> d2_absolute_error_score(y_true, y_pred)
+    0.764...
+    >>> y_true = [1, 2, 3]
+    >>> y_pred = [1, 2, 3]
+    >>> d2_absolute_error_score(y_true, y_pred)
+    1.0
+    >>> y_true = [1, 2, 3]
+    >>> y_pred = [2, 2, 2]
+    >>> d2_absolute_error_score(y_true, y_pred)
+    0.0
 
-|details-end|
 
 .. _visualization_regression_evaluation:
 
@@ -2887,12 +2901,12 @@ model might be useful.
 Refer to the example below to see a model evaluation that makes use of this
 display.
 
-.. topic:: Example:
+.. rubric:: Examples
 
-  * See :ref:`sphx_glr_auto_examples_compose_plot_transformed_target.py` for
-    an example on how to use :class:`~sklearn.metrics.PredictionErrorDisplay`
-    to visualize the prediction quality improvement of a regression model
-    obtained by transforming the target before learning.
+* See :ref:`sphx_glr_auto_examples_compose_plot_transformed_target.py` for
+  an example on how to use :class:`~sklearn.metrics.PredictionErrorDisplay`
+  to visualize the prediction quality improvement of a regression model
+  obtained by transforming the target before learning.
 
 .. _clustering_metrics:
 
diff --git a/doc/modules/multiclass.rst b/doc/modules/multiclass.rst
index 21bf568ebab97..07d7c9d221a73 100644
--- a/doc/modules/multiclass.rst
+++ b/doc/modules/multiclass.rst
@@ -63,8 +63,8 @@ can provide additional strategies beyond what is built-in:
   - :class:`semi_supervised.LabelSpreading`
   - :class:`discriminant_analysis.LinearDiscriminantAnalysis`
   - :class:`svm.LinearSVC` (setting multi_class="crammer_singer")
-  - :class:`linear_model.LogisticRegression` (setting multi_class="multinomial")
-  - :class:`linear_model.LogisticRegressionCV` (setting multi_class="multinomial")
+  - :class:`linear_model.LogisticRegression` (with most solvers)
+  - :class:`linear_model.LogisticRegressionCV` (with most solvers)
   - :class:`neural_network.MLPClassifier`
   - :class:`neighbors.NearestCentroid`
   - :class:`discriminant_analysis.QuadraticDiscriminantAnalysis`
@@ -86,8 +86,8 @@ can provide additional strategies beyond what is built-in:
   - :class:`ensemble.GradientBoostingClassifier`
   - :class:`gaussian_process.GaussianProcessClassifier` (setting multi_class = "one_vs_rest")
   - :class:`svm.LinearSVC` (setting multi_class="ovr")
-  - :class:`linear_model.LogisticRegression` (setting multi_class="ovr")
-  - :class:`linear_model.LogisticRegressionCV` (setting multi_class="ovr")
+  - :class:`linear_model.LogisticRegression` (most solvers)
+  - :class:`linear_model.LogisticRegressionCV` (most solvers)
   - :class:`linear_model.SGDClassifier`
   - :class:`linear_model.Perceptron`
   - :class:`linear_model.PassiveAggressiveClassifier`
@@ -172,6 +172,9 @@ Valid :term:`multiclass` representations for
     >>> from scipy import sparse
     >>> y_sparse = sparse.csr_matrix(y_dense)
     >>> print(y_sparse)
+    <Compressed Sparse Row sparse matrix of dtype 'int64'
+    	with 4 stored elements and shape (4, 3)>
+      Coords	Values
       (0, 0)	1
       (1, 2)	1
       (2, 0)	1
@@ -201,7 +204,7 @@ Below is an example of multiclass learning using OvR::
   >>> from sklearn.multiclass import OneVsRestClassifier
   >>> from sklearn.svm import LinearSVC
   >>> X, y = datasets.load_iris(return_X_y=True)
-  >>> OneVsRestClassifier(LinearSVC(dual="auto", random_state=0)).fit(X, y).predict(X)
+  >>> OneVsRestClassifier(LinearSVC(random_state=0)).fit(X, y).predict(X)
   array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
          0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
          0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
@@ -222,9 +225,9 @@ in which cell [i, j] indicates the presence of label j in sample i.
     :scale: 75%
 
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_miscellaneous_plot_multilabel.py`
+* :ref:`sphx_glr_auto_examples_miscellaneous_plot_multilabel.py`
 
 .. _ovo_classification:
 
@@ -253,7 +256,7 @@ Below is an example of multiclass learning using OvO::
   >>> from sklearn.multiclass import OneVsOneClassifier
   >>> from sklearn.svm import LinearSVC
   >>> X, y = datasets.load_iris(return_X_y=True)
-  >>> OneVsOneClassifier(LinearSVC(dual="auto", random_state=0)).fit(X, y).predict(X)
+  >>> OneVsOneClassifier(LinearSVC(random_state=0)).fit(X, y).predict(X)
   array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
          0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
          0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
@@ -263,10 +266,10 @@ Below is an example of multiclass learning using OvO::
          2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2])
 
 
-.. topic:: References:
+.. rubric:: References
 
-    * "Pattern Recognition and Machine Learning. Springer",
-      Christopher M. Bishop, page 183, (First Edition)
+* "Pattern Recognition and Machine Learning. Springer",
+  Christopher M. Bishop, page 183, (First Edition)
 
 .. _ecoc:
 
@@ -311,8 +314,7 @@ Below is an example of multiclass learning using Output-Codes::
   >>> from sklearn.multiclass import OutputCodeClassifier
   >>> from sklearn.svm import LinearSVC
   >>> X, y = datasets.load_iris(return_X_y=True)
-  >>> clf = OutputCodeClassifier(LinearSVC(dual="auto", random_state=0),
-  ...                            code_size=2, random_state=0)
+  >>> clf = OutputCodeClassifier(LinearSVC(random_state=0), code_size=2, random_state=0)
   >>> clf.fit(X, y).predict(X)
   array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
          0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
@@ -322,21 +324,16 @@ Below is an example of multiclass learning using Output-Codes::
          2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 1, 2, 2, 2,
          2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2])
 
-.. topic:: References:
+.. rubric:: References
 
-    * "Solving multiclass learning problems via error-correcting output codes",
-      Dietterich T., Bakiri G.,
-      Journal of Artificial Intelligence Research 2,
-      1995.
+* "Solving multiclass learning problems via error-correcting output codes",
+  Dietterich T., Bakiri G., Journal of Artificial Intelligence Research 2, 1995.
 
-    .. [3] "The error coding method and PICTs",
-        James G., Hastie T.,
-        Journal of Computational and Graphical statistics 7,
-        1998.
+.. [3] "The error coding method and PICTs", James G., Hastie T.,
+  Journal of Computational and Graphical statistics 7, 1998.
 
-    * "The Elements of Statistical Learning",
-      Hastie T., Tibshirani R., Friedman J., page 606 (second-edition)
-      2008.
+* "The Elements of Statistical Learning",
+  Hastie T., Tibshirani R., Friedman J., page 606 (second-edition), 2008.
 
 .. _multilabel_classification:
 
@@ -383,6 +380,9 @@ An example of the same ``y`` in sparse matrix form:
 
   >>> y_sparse = sparse.csr_matrix(y)
   >>> print(y_sparse)
+  <Compressed Sparse Row sparse matrix of dtype 'int64'
+    with 4 stored elements and shape (3, 4)>
+    Coords	Values
     (0, 0)	1
     (0, 3)	1
     (1, 2)	1
@@ -433,10 +433,10 @@ one does not know the optimal ordering of the models in the chain so
 typically many randomly ordered chains are fit and their predictions are
 averaged together.
 
-.. topic:: References:
+.. rubric:: References
 
-    Jesse Read, Bernhard Pfahringer, Geoff Holmes, Eibe Frank,
-        "Classifier Chains for Multi-label Classification", 2009.
+* Jesse Read, Bernhard Pfahringer, Geoff Holmes, Eibe Frank,
+  "Classifier Chains for Multi-label Classification", 2009.
 
 .. _multiclass_multioutput_classification:
 
diff --git a/doc/modules/naive_bayes.rst b/doc/modules/naive_bayes.rst
index 05ca928dfae0b..6e80ec6145919 100644
--- a/doc/modules/naive_bayes.rst
+++ b/doc/modules/naive_bayes.rst
@@ -69,15 +69,11 @@ On the flip side, although naive Bayes is known as a decent classifier,
 it is known to be a bad estimator, so the probability outputs from
 ``predict_proba`` are not to be taken too seriously.
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
-* H. Zhang (2004). `The optimality of Naive Bayes.
-  <https://www.cs.unb.ca/~hzhang/publications/FLAIRS04ZhangH.pdf>`_
-  Proc. FLAIRS.
-
-|details-end|
+   * H. Zhang (2004). `The optimality of Naive Bayes.
+     <https://www.cs.unb.ca/~hzhang/publications/FLAIRS04ZhangH.pdf>`_
+     Proc. FLAIRS.
 
 .. _gaussian_naive_bayes:
 
@@ -153,47 +149,40 @@ The inventors of CNB show empirically that the parameter estimates for CNB are
 more stable than those for MNB. Further, CNB regularly outperforms MNB (often
 by a considerable margin) on text classification tasks.
 
-|details-start|
-**Weights calculation**
-|details-split|
-
-The procedure for calculating the weights is as follows:
+.. dropdown:: Weights calculation
 
-.. math::
+   The procedure for calculating the weights is as follows:
 
-    \hat{\theta}_{ci} = \frac{\alpha_i + \sum_{j:y_j \neq c} d_{ij}}
-                             {\alpha + \sum_{j:y_j \neq c} \sum_{k} d_{kj}}
+   .. math::
 
-    w_{ci} = \log \hat{\theta}_{ci}
+      \hat{\theta}_{ci} = \frac{\alpha_i + \sum_{j:y_j \neq c} d_{ij}}
+                              {\alpha + \sum_{j:y_j \neq c} \sum_{k} d_{kj}}
 
-    w_{ci} = \frac{w_{ci}}{\sum_{j} |w_{cj}|}
+      w_{ci} = \log \hat{\theta}_{ci}
 
-where the summations are over all documents :math:`j` not in class :math:`c`,
-:math:`d_{ij}` is either the count or tf-idf value of term :math:`i` in document
-:math:`j`, :math:`\alpha_i` is a smoothing hyperparameter like that found in
-MNB, and :math:`\alpha = \sum_{i} \alpha_i`. The second normalization addresses
-the tendency for longer documents to dominate parameter estimates in MNB. The
-classification rule is:
+      w_{ci} = \frac{w_{ci}}{\sum_{j} |w_{cj}|}
 
-.. math::
+   where the summations are over all documents :math:`j` not in class :math:`c`,
+   :math:`d_{ij}` is either the count or tf-idf value of term :math:`i` in document
+   :math:`j`, :math:`\alpha_i` is a smoothing hyperparameter like that found in
+   MNB, and :math:`\alpha = \sum_{i} \alpha_i`. The second normalization addresses
+   the tendency for longer documents to dominate parameter estimates in MNB. The
+   classification rule is:
 
-    \hat{c} = \arg\min_c \sum_{i} t_i w_{ci}
+   .. math::
 
-i.e., a document is assigned to the class that is the *poorest* complement
-match.
+      \hat{c} = \arg\min_c \sum_{i} t_i w_{ci}
 
-|details-end|
+   i.e., a document is assigned to the class that is the *poorest* complement
+   match.
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
-* Rennie, J. D., Shih, L., Teevan, J., & Karger, D. R. (2003).
-  `Tackling the poor assumptions of naive bayes text classifiers.
-  <https://people.csail.mit.edu/jrennie/papers/icml03-nb.pdf>`_
-  In ICML (Vol. 3, pp. 616-623).
+   * Rennie, J. D., Shih, L., Teevan, J., & Karger, D. R. (2003).
+     `Tackling the poor assumptions of naive bayes text classifiers.
+     <https://people.csail.mit.edu/jrennie/papers/icml03-nb.pdf>`_
+     In ICML (Vol. 3, pp. 616-623).
 
-|details-end|
 
 .. _bernoulli_naive_bayes:
 
@@ -224,24 +213,21 @@ count vectors) may be used to train and use this classifier. :class:`BernoulliNB
 might perform better on some datasets, especially those with shorter documents.
 It is advisable to evaluate both models, if time permits.
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
-* C.D. Manning, P. Raghavan and H. Schütze (2008). Introduction to
-  Information Retrieval. Cambridge University Press, pp. 234-265.
+   * C.D. Manning, P. Raghavan and H. Schütze (2008). Introduction to
+     Information Retrieval. Cambridge University Press, pp. 234-265.
 
-* A. McCallum and K. Nigam (1998).
-  `A comparison of event models for Naive Bayes text classification.
-  <https://citeseerx.ist.psu.edu/doc_view/pid/04ce064505b1635583fa0d9cc07cac7e9ea993cc>`_
-  Proc. AAAI/ICML-98 Workshop on Learning for Text Categorization, pp. 41-48.
+   * A. McCallum and K. Nigam (1998).
+     `A comparison of event models for Naive Bayes text classification.
+     <https://citeseerx.ist.psu.edu/doc_view/pid/04ce064505b1635583fa0d9cc07cac7e9ea993cc>`_
+     Proc. AAAI/ICML-98 Workshop on Learning for Text Categorization, pp. 41-48.
 
-* V. Metsis, I. Androutsopoulos and G. Paliouras (2006).
-  `Spam filtering with Naive Bayes -- Which Naive Bayes?
-  <https://citeseerx.ist.psu.edu/doc_view/pid/8bd0934b366b539ec95e683ae39f8abb29ccc757>`_
-  3rd Conf. on Email and Anti-Spam (CEAS).
+   * V. Metsis, I. Androutsopoulos and G. Paliouras (2006).
+     `Spam filtering with Naive Bayes -- Which Naive Bayes?
+     <https://citeseerx.ist.psu.edu/doc_view/pid/8bd0934b366b539ec95e683ae39f8abb29ccc757>`_
+     3rd Conf. on Email and Anti-Spam (CEAS).
 
-|details-end|
 
 .. _categorical_naive_bayes:
 
@@ -258,25 +244,21 @@ For each feature :math:`i` in the training set :math:`X`,
 of X conditioned on the class y. The index set of the samples is defined as
 :math:`J = \{ 1, \dots, m \}`, with :math:`m` as the number of samples.
 
-|details-start|
-**Probability calculation**
-|details-split|
-
-The probability of category :math:`t` in feature :math:`i` given class
-:math:`c` is estimated as:
+.. dropdown:: Probability calculation
 
-.. math::
+   The probability of category :math:`t` in feature :math:`i` given class
+   :math:`c` is estimated as:
 
-    P(x_i = t \mid y = c \: ;\, \alpha) = \frac{ N_{tic} + \alpha}{N_{c} +
-                                           \alpha n_i},
+   .. math::
 
-where :math:`N_{tic} = |\{j \in J \mid x_{ij} = t, y_j = c\}|` is the number
-of times category :math:`t` appears in the samples :math:`x_{i}`, which belong
-to class :math:`c`, :math:`N_{c} = |\{ j \in J\mid y_j = c\}|` is the number
-of samples with class c, :math:`\alpha` is a smoothing parameter and
-:math:`n_i` is the number of available categories of feature :math:`i`.
+      P(x_i = t \mid y = c \: ;\, \alpha) = \frac{ N_{tic} + \alpha}{N_{c} +
+                                             \alpha n_i},
 
-|details-end|
+   where :math:`N_{tic} = |\{j \in J \mid x_{ij} = t, y_j = c\}|` is the number
+   of times category :math:`t` appears in the samples :math:`x_{i}`, which belong
+   to class :math:`c`, :math:`N_{c} = |\{ j \in J\mid y_j = c\}|` is the number
+   of samples with class c, :math:`\alpha` is a smoothing parameter and
+   :math:`n_i` is the number of available categories of feature :math:`i`.
 
 :class:`CategoricalNB` assumes that the sample matrix :math:`X` is encoded (for
 instance with the help of :class:`~sklearn.preprocessing.OrdinalEncoder`) such
diff --git a/doc/modules/neighbors.rst b/doc/modules/neighbors.rst
index b081b29572d8a..de0eff67018bc 100644
--- a/doc/modules/neighbors.rst
+++ b/doc/modules/neighbors.rst
@@ -192,10 +192,10 @@ distance can be supplied to compute the weights.
 
 .. centered:: |classification_1|
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_neighbors_plot_classification.py`: an example of
-    classification using nearest neighbors.
+* :ref:`sphx_glr_auto_examples_neighbors_plot_classification.py`: an example of
+  classification using nearest neighbors.
 
 .. _regression:
 
@@ -241,13 +241,13 @@ the lower half of those faces.
    :align: center
 
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_neighbors_plot_regression.py`: an example of regression
-    using nearest neighbors.
+* :ref:`sphx_glr_auto_examples_neighbors_plot_regression.py`: an example of regression
+  using nearest neighbors.
 
-  * :ref:`sphx_glr_auto_examples_miscellaneous_plot_multioutput_face_completion.py`: an example of
-    multi-output regression using nearest neighbors.
+* :ref:`sphx_glr_auto_examples_miscellaneous_plot_multioutput_face_completion.py`:
+  an example of multi-output regression using nearest neighbors.
 
 
 Nearest Neighbor Algorithms
@@ -304,15 +304,13 @@ In scikit-learn, KD tree neighbors searches are specified using the
 keyword ``algorithm = 'kd_tree'``, and are computed using the class
 :class:`KDTree`.
 
-|details-start|
-**References**
-|details-split|
 
-   * `"Multidimensional binary search trees used for associative searching"
-     <https://dl.acm.org/citation.cfm?doid=361002.361007>`_,
-     Bentley, J.L., Communications of the ACM (1975)
+.. dropdown:: References
+
+  * `"Multidimensional binary search trees used for associative searching"
+    <https://dl.acm.org/citation.cfm?doid=361002.361007>`_,
+    Bentley, J.L., Communications of the ACM (1975)
 
-|details-end|
 
 .. _ball_tree:
 
@@ -345,156 +343,142 @@ neighbors searches are specified using the keyword ``algorithm = 'ball_tree'``,
 and are computed using the class :class:`BallTree`.
 Alternatively, the user can work with the :class:`BallTree` class directly.
 
-|details-start|
-**References**
-|details-split|
-
-   * `"Five Balltree Construction Algorithms"
-     <https://citeseerx.ist.psu.edu/doc_view/pid/17ac002939f8e950ffb32ec4dc8e86bdd8cb5ff1>`_,
-     Omohundro, S.M., International Computer Science Institute
-     Technical Report (1989)
-
-|details-end|
-
-|details-start|
-**Choice of Nearest Neighbors Algorithm**
-|details-split|
-
-The optimal algorithm for a given dataset is a complicated choice, and
-depends on a number of factors:
-
-* number of samples :math:`N` (i.e. ``n_samples``) and dimensionality
-  :math:`D` (i.e. ``n_features``).
-
-  * *Brute force* query time grows as :math:`O[D N]`
-  * *Ball tree* query time grows as approximately :math:`O[D \log(N)]`
-  * *KD tree* query time changes with :math:`D` in a way that is difficult
-    to precisely characterise.  For small :math:`D` (less than 20 or so)
-    the cost is approximately :math:`O[D\log(N)]`, and the KD tree
-    query can be very efficient.
-    For larger :math:`D`, the cost increases to nearly :math:`O[DN]`, and
-    the overhead due to the tree
-    structure can lead to queries which are slower than brute force.
-
-  For small data sets (:math:`N` less than 30 or so), :math:`\log(N)` is
-  comparable to :math:`N`, and brute force algorithms can be more efficient
-  than a tree-based approach.  Both :class:`KDTree` and :class:`BallTree`
-  address this through providing a *leaf size* parameter: this controls the
-  number of samples at which a query switches to brute-force.  This allows both
-  algorithms to approach the efficiency of a brute-force computation for small
-  :math:`N`.
-
-* data structure: *intrinsic dimensionality* of the data and/or *sparsity*
-  of the data. Intrinsic dimensionality refers to the dimension
-  :math:`d \le D` of a manifold on which the data lies, which can be linearly
-  or non-linearly embedded in the parameter space. Sparsity refers to the
-  degree to which the data fills the parameter space (this is to be
-  distinguished from the concept as used in "sparse" matrices.  The data
-  matrix may have no zero entries, but the **structure** can still be
-  "sparse" in this sense).
-
-  * *Brute force* query time is unchanged by data structure.
-  * *Ball tree* and *KD tree* query times can be greatly influenced
-    by data structure.  In general, sparser data with a smaller intrinsic
-    dimensionality leads to faster query times.  Because the KD tree
-    internal representation is aligned with the parameter axes, it will not
-    generally show as much improvement as ball tree for arbitrarily
-    structured data.
-
-  Datasets used in machine learning tend to be very structured, and are
-  very well-suited for tree-based queries.
-
-* number of neighbors :math:`k` requested for a query point.
-
-  * *Brute force* query time is largely unaffected by the value of :math:`k`
-  * *Ball tree* and *KD tree* query time will become slower as :math:`k`
-    increases.  This is due to two effects: first, a larger :math:`k` leads
-    to the necessity to search a larger portion of the parameter space.
-    Second, using :math:`k > 1` requires internal queueing of results
-    as the tree is traversed.
-
-  As :math:`k` becomes large compared to :math:`N`, the ability to prune
-  branches in a tree-based query is reduced.  In this situation, Brute force
-  queries can be more efficient.
-
-* number of query points.  Both the ball tree and the KD Tree
-  require a construction phase.  The cost of this construction becomes
-  negligible when amortized over many queries.  If only a small number of
-  queries will be performed, however, the construction can make up
-  a significant fraction of the total cost.  If very few query points
-  will be required, brute force is better than a tree-based method.
-
-Currently, ``algorithm = 'auto'`` selects ``'brute'`` if any of the following
-conditions are verified:
-
-* input data is sparse
-* ``metric = 'precomputed'``
-* :math:`D > 15`
-* :math:`k >= N/2`
-* ``effective_metric_`` isn't in the ``VALID_METRICS`` list for either
-  ``'kd_tree'`` or ``'ball_tree'``
-
-Otherwise, it selects the first out of ``'kd_tree'`` and ``'ball_tree'`` that
-has ``effective_metric_`` in its ``VALID_METRICS`` list. This heuristic is
-based on the following assumptions:
-
-* the number of query points is at least the same order as the number of
-  training points
-* ``leaf_size`` is close to its default value of ``30``
-* when :math:`D > 15`, the intrinsic dimensionality of the data is generally
-  too high for tree-based methods
-
-|details-end|
-
-|details-start|
-**Effect of ``leaf_size``**
-|details-split|
-
-As noted above, for small sample sizes a brute force search can be more
-efficient than a tree-based query.  This fact is accounted for in the ball
-tree and KD tree by internally switching to brute force searches within
-leaf nodes.  The level of this switch can be specified with the parameter
-``leaf_size``.  This parameter choice has many effects:
-
-**construction time**
-  A larger ``leaf_size`` leads to a faster tree construction time, because
-  fewer nodes need to be created
-
-**query time**
-  Both a large or small ``leaf_size`` can lead to suboptimal query cost.
-  For ``leaf_size`` approaching 1, the overhead involved in traversing
-  nodes can significantly slow query times.  For ``leaf_size`` approaching
-  the size of the training set, queries become essentially brute force.
-  A good compromise between these is ``leaf_size = 30``, the default value
-  of the parameter.
-
-**memory**
-  As ``leaf_size`` increases, the memory required to store a tree structure
-  decreases.  This is especially important in the case of ball tree, which
-  stores a :math:`D`-dimensional centroid for each node.  The required
-  storage space for :class:`BallTree` is approximately ``1 / leaf_size`` times
-  the size of the training set.
-
-``leaf_size`` is not referenced for brute force queries.
-|details-end|
-
-|details-start|
-**Valid Metrics for Nearest Neighbor Algorithms**
-|details-split|
-
-For a list of available metrics, see the documentation of the
-:class:`~sklearn.metrics.DistanceMetric` class and the metrics listed in
-`sklearn.metrics.pairwise.PAIRWISE_DISTANCE_FUNCTIONS`. Note that the "cosine"
-metric uses :func:`~sklearn.metrics.pairwise.cosine_distances`.
-
-A list of valid metrics for any of the above algorithms can be obtained by using their
-``valid_metric`` attribute. For example, valid metrics for ``KDTree`` can be generated by:
-
-    >>> from sklearn.neighbors import KDTree
-    >>> print(sorted(KDTree.valid_metrics))
-    ['chebyshev', 'cityblock', 'euclidean', 'infinity', 'l1', 'l2', 'manhattan', 'minkowski', 'p']
 
-|details-end|
+.. dropdown:: References
+
+  * `"Five Balltree Construction Algorithms"
+    <https://citeseerx.ist.psu.edu/doc_view/pid/17ac002939f8e950ffb32ec4dc8e86bdd8cb5ff1>`_,
+    Omohundro, S.M., International Computer Science Institute
+    Technical Report (1989)
+
+.. dropdown:: Choice of Nearest Neighbors Algorithm
+
+  The optimal algorithm for a given dataset is a complicated choice, and
+  depends on a number of factors:
+
+  * number of samples :math:`N` (i.e. ``n_samples``) and dimensionality
+    :math:`D` (i.e. ``n_features``).
+
+    * *Brute force* query time grows as :math:`O[D N]`
+    * *Ball tree* query time grows as approximately :math:`O[D \log(N)]`
+    * *KD tree* query time changes with :math:`D` in a way that is difficult
+      to precisely characterise.  For small :math:`D` (less than 20 or so)
+      the cost is approximately :math:`O[D\log(N)]`, and the KD tree
+      query can be very efficient.
+      For larger :math:`D`, the cost increases to nearly :math:`O[DN]`, and
+      the overhead due to the tree
+      structure can lead to queries which are slower than brute force.
+
+    For small data sets (:math:`N` less than 30 or so), :math:`\log(N)` is
+    comparable to :math:`N`, and brute force algorithms can be more efficient
+    than a tree-based approach.  Both :class:`KDTree` and :class:`BallTree`
+    address this through providing a *leaf size* parameter: this controls the
+    number of samples at which a query switches to brute-force.  This allows both
+    algorithms to approach the efficiency of a brute-force computation for small
+    :math:`N`.
+
+  * data structure: *intrinsic dimensionality* of the data and/or *sparsity*
+    of the data. Intrinsic dimensionality refers to the dimension
+    :math:`d \le D` of a manifold on which the data lies, which can be linearly
+    or non-linearly embedded in the parameter space. Sparsity refers to the
+    degree to which the data fills the parameter space (this is to be
+    distinguished from the concept as used in "sparse" matrices.  The data
+    matrix may have no zero entries, but the **structure** can still be
+    "sparse" in this sense).
+
+    * *Brute force* query time is unchanged by data structure.
+    * *Ball tree* and *KD tree* query times can be greatly influenced
+      by data structure.  In general, sparser data with a smaller intrinsic
+      dimensionality leads to faster query times.  Because the KD tree
+      internal representation is aligned with the parameter axes, it will not
+      generally show as much improvement as ball tree for arbitrarily
+      structured data.
+
+    Datasets used in machine learning tend to be very structured, and are
+    very well-suited for tree-based queries.
+
+  * number of neighbors :math:`k` requested for a query point.
+
+    * *Brute force* query time is largely unaffected by the value of :math:`k`
+    * *Ball tree* and *KD tree* query time will become slower as :math:`k`
+      increases.  This is due to two effects: first, a larger :math:`k` leads
+      to the necessity to search a larger portion of the parameter space.
+      Second, using :math:`k > 1` requires internal queueing of results
+      as the tree is traversed.
+
+    As :math:`k` becomes large compared to :math:`N`, the ability to prune
+    branches in a tree-based query is reduced.  In this situation, Brute force
+    queries can be more efficient.
+
+  * number of query points.  Both the ball tree and the KD Tree
+    require a construction phase.  The cost of this construction becomes
+    negligible when amortized over many queries.  If only a small number of
+    queries will be performed, however, the construction can make up
+    a significant fraction of the total cost.  If very few query points
+    will be required, brute force is better than a tree-based method.
+
+  Currently, ``algorithm = 'auto'`` selects ``'brute'`` if any of the following
+  conditions are verified:
+
+  * input data is sparse
+  * ``metric = 'precomputed'``
+  * :math:`D > 15`
+  * :math:`k >= N/2`
+  * ``effective_metric_`` isn't in the ``VALID_METRICS`` list for either
+    ``'kd_tree'`` or ``'ball_tree'``
+
+  Otherwise, it selects the first out of ``'kd_tree'`` and ``'ball_tree'`` that
+  has ``effective_metric_`` in its ``VALID_METRICS`` list. This heuristic is
+  based on the following assumptions:
+
+  * the number of query points is at least the same order as the number of
+    training points
+  * ``leaf_size`` is close to its default value of ``30``
+  * when :math:`D > 15`, the intrinsic dimensionality of the data is generally
+    too high for tree-based methods
+
+.. dropdown:: Effect of ``leaf_size``
+
+  As noted above, for small sample sizes a brute force search can be more
+  efficient than a tree-based query.  This fact is accounted for in the ball
+  tree and KD tree by internally switching to brute force searches within
+  leaf nodes.  The level of this switch can be specified with the parameter
+  ``leaf_size``.  This parameter choice has many effects:
+
+  **construction time**
+    A larger ``leaf_size`` leads to a faster tree construction time, because
+    fewer nodes need to be created
+
+  **query time**
+    Both a large or small ``leaf_size`` can lead to suboptimal query cost.
+    For ``leaf_size`` approaching 1, the overhead involved in traversing
+    nodes can significantly slow query times.  For ``leaf_size`` approaching
+    the size of the training set, queries become essentially brute force.
+    A good compromise between these is ``leaf_size = 30``, the default value
+    of the parameter.
+
+  **memory**
+    As ``leaf_size`` increases, the memory required to store a tree structure
+    decreases.  This is especially important in the case of ball tree, which
+    stores a :math:`D`-dimensional centroid for each node.  The required
+    storage space for :class:`BallTree` is approximately ``1 / leaf_size`` times
+    the size of the training set.
+
+  ``leaf_size`` is not referenced for brute force queries.
+
+.. dropdown:: Valid Metrics for Nearest Neighbor Algorithms
+
+  For a list of available metrics, see the documentation of the
+  :class:`~sklearn.metrics.DistanceMetric` class and the metrics listed in
+  `sklearn.metrics.pairwise.PAIRWISE_DISTANCE_FUNCTIONS`. Note that the "cosine"
+  metric uses :func:`~sklearn.metrics.pairwise.cosine_distances`.
+
+  A list of valid metrics for any of the above algorithms can be obtained by using their
+  ``valid_metric`` attribute. For example, valid metrics for ``KDTree`` can be generated by:
+
+      >>> from sklearn.neighbors import KDTree
+      >>> print(sorted(KDTree.valid_metrics))
+      ['chebyshev', 'cityblock', 'euclidean', 'infinity', 'l1', 'l2', 'manhattan', 'minkowski', 'p']
 
 .. _nearest_centroid_classifier:
 
@@ -547,10 +531,10 @@ the model from 0.81 to 0.82.
 
 .. centered:: |nearest_centroid_1| |nearest_centroid_2|
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_neighbors_plot_nearest_centroid.py`: an example of
-    classification using nearest centroid with different shrink thresholds.
+* :ref:`sphx_glr_auto_examples_neighbors_plot_nearest_centroid.py`: an example of
+  classification using nearest centroid with different shrink thresholds.
 
 .. _neighbors_transformer:
 
@@ -635,17 +619,17 @@ implementation with special data types. The precomputed neighbors
   include one extra neighbor in a custom nearest neighbors estimator, since
   unnecessary neighbors will be filtered by following estimators.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_neighbors_approximate_nearest_neighbors.py`:
-    an example of pipelining :class:`KNeighborsTransformer` and
-    :class:`~sklearn.manifold.TSNE`. Also proposes two custom nearest neighbors
-    estimators based on external packages.
+* :ref:`sphx_glr_auto_examples_neighbors_approximate_nearest_neighbors.py`:
+  an example of pipelining :class:`KNeighborsTransformer` and
+  :class:`~sklearn.manifold.TSNE`. Also proposes two custom nearest neighbors
+  estimators based on external packages.
 
-  * :ref:`sphx_glr_auto_examples_neighbors_plot_caching_nearest_neighbors.py`:
-    an example of pipelining :class:`KNeighborsTransformer` and
-    :class:`KNeighborsClassifier` to enable caching of the neighbors graph
-    during a hyper-parameter grid-search.
+* :ref:`sphx_glr_auto_examples_neighbors_plot_caching_nearest_neighbors.py`:
+  an example of pipelining :class:`KNeighborsTransformer` and
+  :class:`KNeighborsClassifier` to enable caching of the neighbors graph
+  during a hyper-parameter grid-search.
 
 .. _nca:
 
@@ -769,11 +753,11 @@ by each method. Each data sample belongs to one of 10 classes.
 .. centered:: |nca_dim_reduction_1| |nca_dim_reduction_2| |nca_dim_reduction_3|
 
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_neighbors_plot_nca_classification.py`
- * :ref:`sphx_glr_auto_examples_neighbors_plot_nca_dim_reduction.py`
- * :ref:`sphx_glr_auto_examples_manifold_plot_lle_digits.py`
+* :ref:`sphx_glr_auto_examples_neighbors_plot_nca_classification.py`
+* :ref:`sphx_glr_auto_examples_neighbors_plot_nca_dim_reduction.py`
+* :ref:`sphx_glr_auto_examples_manifold_plot_lle_digits.py`
 
 .. _nca_mathematical_formulation:
 
@@ -806,20 +790,17 @@ space:
   p_{i j} = \frac{\exp(-||L x_i - L x_j||^2)}{\sum\limits_{k \ne
             i} {\exp{-(||L x_i - L x_k||^2)}}} , \quad p_{i i} = 0
 
-|details-start|
-**Mahalanobis distance**
-|details-split|
+.. dropdown:: Mahalanobis distance
 
-NCA can be seen as learning a (squared) Mahalanobis distance metric:
+  NCA can be seen as learning a (squared) Mahalanobis distance metric:
 
-.. math::
+  .. math::
 
-    || L(x_i - x_j)||^2 = (x_i - x_j)^TM(x_i - x_j),
+      || L(x_i - x_j)||^2 = (x_i - x_j)^TM(x_i - x_j),
 
-where :math:`M = L^T L` is a symmetric positive semi-definite matrix of size
-``(n_features, n_features)``.
+  where :math:`M = L^T L` is a symmetric positive semi-definite matrix of size
+  ``(n_features, n_features)``.
 
-|details-end|
 
 Implementation
 --------------
@@ -851,14 +832,12 @@ complexity equals ``n_components * n_features * n_samples_test``. There is no
 added space complexity in the operation.
 
 
-.. topic:: References:
-
-    .. [1] `"Neighbourhood Components Analysis"
-      <http://www.cs.nyu.edu/~roweis/papers/ncanips.pdf>`_,
-      J. Goldberger, S. Roweis, G. Hinton, R. Salakhutdinov, Advances in
-      Neural Information Processing Systems, Vol. 17, May 2005, pp. 513-520.
+.. rubric:: References
 
-    `Wikipedia entry on Neighborhood Components Analysis
-    <https://en.wikipedia.org/wiki/Neighbourhood_components_analysis>`_
+.. [1] `"Neighbourhood Components Analysis"
+  <http://www.cs.nyu.edu/~roweis/papers/ncanips.pdf>`_,
+  J. Goldberger, S. Roweis, G. Hinton, R. Salakhutdinov, Advances in
+  Neural Information Processing Systems, Vol. 17, May 2005, pp. 513-520.
 
-|details-end|
+* `Wikipedia entry on Neighborhood Components Analysis
+  <https://en.wikipedia.org/wiki/Neighbourhood_components_analysis>`_
diff --git a/doc/modules/neural_networks_supervised.rst b/doc/modules/neural_networks_supervised.rst
index 95d0a1be38238..5c6baecb7e2ff 100644
--- a/doc/modules/neural_networks_supervised.rst
+++ b/doc/modules/neural_networks_supervised.rst
@@ -49,33 +49,30 @@ The module contains the public attributes ``coefs_`` and ``intercepts_``.
 :math:`i+1`. ``intercepts_`` is a list of bias vectors, where the vector
 at index :math:`i` represents the bias values added to layer :math:`i+1`.
 
-|details-start|
-**Advantages and disadvantages of Multi-layer Perceptron**
-|details-split|
+.. dropdown:: Advantages and disadvantages of Multi-layer Perceptron
 
-The advantages of Multi-layer Perceptron are:
+  The advantages of Multi-layer Perceptron are:
 
-+ Capability to learn non-linear models.
+  + Capability to learn non-linear models.
 
-+ Capability to learn models in real-time (on-line learning)
-  using ``partial_fit``.
+  + Capability to learn models in real-time (on-line learning)
+    using ``partial_fit``.
 
 
-The disadvantages of Multi-layer Perceptron (MLP) include:
+  The disadvantages of Multi-layer Perceptron (MLP) include:
 
-+ MLP with hidden layers have a non-convex loss function where there exists
-  more than one local minimum. Therefore different random weight
-  initializations can lead to different validation accuracy.
+  + MLP with hidden layers have a non-convex loss function where there exists
+    more than one local minimum. Therefore different random weight
+    initializations can lead to different validation accuracy.
 
-+ MLP requires tuning a number of hyperparameters such as the number of
-  hidden neurons, layers, and iterations.
+  + MLP requires tuning a number of hyperparameters such as the number of
+    hidden neurons, layers, and iterations.
 
-+ MLP is sensitive to feature scaling.
+  + MLP is sensitive to feature scaling.
 
-Please see :ref:`Tips on Practical Use <mlp_tips>` section that addresses
-some of these disadvantages.
+  Please see :ref:`Tips on Practical Use <mlp_tips>` section that addresses
+  some of these disadvantages.
 
-|details-end|
 
 Classification
 ==============
@@ -148,11 +145,11 @@ indices where the value is `1` represents the assigned classes of that sample::
 See the examples below and the docstring of
 :meth:`MLPClassifier.fit` for further information.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_neural_networks_plot_mlp_training_curves.py`
- * See :ref:`sphx_glr_auto_examples_neural_networks_plot_mnist_filters.py` for
-   visualized representation of trained weights.
+* :ref:`sphx_glr_auto_examples_neural_networks_plot_mlp_training_curves.py`
+* See :ref:`sphx_glr_auto_examples_neural_networks_plot_mnist_filters.py` for
+  visualized representation of trained weights.
 
 Regression
 ==========
@@ -181,9 +178,9 @@ decision function with value of alpha.
 
 See the examples below for further information.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_neural_networks_plot_mlp_alpha.py`
+* :ref:`sphx_glr_auto_examples_neural_networks_plot_mlp_alpha.py`
 
 Algorithms
 ==========
@@ -229,88 +226,83 @@ Complexity
 Suppose there are :math:`n` training samples, :math:`m` features, :math:`k`
 hidden layers, each containing :math:`h` neurons - for simplicity, and :math:`o`
 output neurons.  The time complexity of backpropagation is
-:math:`O(n\cdot m \cdot h^k \cdot o \cdot i)`, where :math:`i` is the number
+:math:`O(i \cdot n \cdot (m \cdot h + (k - 1) \cdot h \cdot h + h \cdot o))`, where :math:`i` is the number
 of iterations. Since backpropagation has a high time complexity, it is advisable
 to start with smaller number of hidden neurons and few hidden layers for
 training.
 
-|details-start|
-Mathematical formulation
-|details-split|
+.. dropdown:: Mathematical formulation
 
-Given a set of training examples :math:`(x_1, y_1), (x_2, y_2), \ldots, (x_n, y_n)`
-where :math:`x_i \in \mathbf{R}^n` and :math:`y_i \in \{0, 1\}`, a one hidden
-layer one hidden neuron MLP learns the function :math:`f(x) = W_2 g(W_1^T x + b_1) + b_2`
-where :math:`W_1 \in \mathbf{R}^m` and :math:`W_2, b_1, b_2 \in \mathbf{R}` are
-model parameters. :math:`W_1, W_2` represent the weights of the input layer and
-hidden layer, respectively; and :math:`b_1, b_2` represent the bias added to
-the hidden layer and the output layer, respectively.
-:math:`g(\cdot) : R \rightarrow R` is the activation function, set by default as
-the hyperbolic tan. It is given as,
+  Given a set of training examples :math:`(x_1, y_1), (x_2, y_2), \ldots, (x_n, y_n)`
+  where :math:`x_i \in \mathbf{R}^n` and :math:`y_i \in \{0, 1\}`, a one hidden
+  layer one hidden neuron MLP learns the function :math:`f(x) = W_2 g(W_1^T x + b_1) + b_2`
+  where :math:`W_1 \in \mathbf{R}^m` and :math:`W_2, b_1, b_2 \in \mathbf{R}` are
+  model parameters. :math:`W_1, W_2` represent the weights of the input layer and
+  hidden layer, respectively; and :math:`b_1, b_2` represent the bias added to
+  the hidden layer and the output layer, respectively.
+  :math:`g(\cdot) : R \rightarrow R` is the activation function, set by default as
+  the hyperbolic tan. It is given as,
 
-.. math::
-      g(z)= \frac{e^z-e^{-z}}{e^z+e^{-z}}
-
-For binary classification, :math:`f(x)` passes through the logistic function
-:math:`g(z)=1/(1+e^{-z})` to obtain output values between zero and one. A
-threshold, set to 0.5, would assign samples of outputs larger or equal 0.5
-to the positive class, and the rest to the negative class.
+  .. math::
+        g(z)= \frac{e^z-e^{-z}}{e^z+e^{-z}}
 
-If there are more than two classes, :math:`f(x)` itself would be a vector of
-size (n_classes,). Instead of passing through logistic function, it passes
-through the softmax function, which is written as,
-
-.. math::
-      \text{softmax}(z)_i = \frac{\exp(z_i)}{\sum_{l=1}^k\exp(z_l)}
+  For binary classification, :math:`f(x)` passes through the logistic function
+  :math:`g(z)=1/(1+e^{-z})` to obtain output values between zero and one. A
+  threshold, set to 0.5, would assign samples of outputs larger or equal 0.5
+  to the positive class, and the rest to the negative class.
 
-where :math:`z_i` represents the :math:`i` th element of the input to softmax,
-which corresponds to class :math:`i`, and :math:`K` is the number of classes.
-The result is a vector containing the probabilities that sample :math:`x`
-belong to each class. The output is the class with the highest probability.
+  If there are more than two classes, :math:`f(x)` itself would be a vector of
+  size (n_classes,). Instead of passing through logistic function, it passes
+  through the softmax function, which is written as,
 
-In regression, the output remains as :math:`f(x)`; therefore, output activation
-function is just the identity function.
+  .. math::
+        \text{softmax}(z)_i = \frac{\exp(z_i)}{\sum_{l=1}^k\exp(z_l)}
 
-MLP uses different loss functions depending on the problem type. The loss
-function for classification is Average Cross-Entropy, which in binary case is
-given as,
+  where :math:`z_i` represents the :math:`i` th element of the input to softmax,
+  which corresponds to class :math:`i`, and :math:`K` is the number of classes.
+  The result is a vector containing the probabilities that sample :math:`x`
+  belong to each class. The output is the class with the highest probability.
 
-.. math::
+  In regression, the output remains as :math:`f(x)`; therefore, output activation
+  function is just the identity function.
 
-    Loss(\hat{y},y,W) = -\dfrac{1}{n}\sum_{i=0}^n(y_i \ln {\hat{y_i}} + (1-y_i) \ln{(1-\hat{y_i})}) + \dfrac{\alpha}{2n} ||W||_2^2
+  MLP uses different loss functions depending on the problem type. The loss
+  function for classification is Average Cross-Entropy, which in binary case is
+  given as,
 
-where :math:`\alpha ||W||_2^2` is an L2-regularization term (aka penalty)
-that penalizes complex models; and :math:`\alpha > 0` is a non-negative
-hyperparameter that controls the magnitude of the penalty.
+  .. math::
 
-For regression, MLP uses the Mean Square Error loss function; written as,
+      Loss(\hat{y},y,W) = -\dfrac{1}{n}\sum_{i=0}^n(y_i \ln {\hat{y_i}} + (1-y_i) \ln{(1-\hat{y_i})}) + \dfrac{\alpha}{2n} ||W||_2^2
 
-.. math::
+  where :math:`\alpha ||W||_2^2` is an L2-regularization term (aka penalty)
+  that penalizes complex models; and :math:`\alpha > 0` is a non-negative
+  hyperparameter that controls the magnitude of the penalty.
 
-    Loss(\hat{y},y,W) = \frac{1}{2n}\sum_{i=0}^n||\hat{y}_i - y_i ||_2^2 + \frac{\alpha}{2n} ||W||_2^2
+  For regression, MLP uses the Mean Square Error loss function; written as,
 
+  .. math::
 
-Starting from initial random weights, multi-layer perceptron (MLP) minimizes
-the loss function by repeatedly updating these weights. After computing the
-loss, a backward pass propagates it from the output layer to the previous
-layers, providing each weight parameter with an update value meant to decrease
-the loss.
+      Loss(\hat{y},y,W) = \frac{1}{2n}\sum_{i=0}^n||\hat{y}_i - y_i ||_2^2 + \frac{\alpha}{2n} ||W||_2^2
 
-In gradient descent, the gradient :math:`\nabla Loss_{W}` of the loss with respect
-to the weights is computed and deducted from :math:`W`.
-More formally, this is expressed as,
+  Starting from initial random weights, multi-layer perceptron (MLP) minimizes
+  the loss function by repeatedly updating these weights. After computing the
+  loss, a backward pass propagates it from the output layer to the previous
+  layers, providing each weight parameter with an update value meant to decrease
+  the loss.
 
-.. math::
-    W^{i+1} = W^i - \epsilon \nabla {Loss}_{W}^{i}
+  In gradient descent, the gradient :math:`\nabla Loss_{W}` of the loss with respect
+  to the weights is computed and deducted from :math:`W`.
+  More formally, this is expressed as,
 
+  .. math::
+      W^{i+1} = W^i - \epsilon \nabla {Loss}_{W}^{i}
 
-where :math:`i` is the iteration step, and :math:`\epsilon` is the learning rate
-with a value larger than 0.
+  where :math:`i` is the iteration step, and :math:`\epsilon` is the learning rate
+  with a value larger than 0.
 
-The algorithm stops when it reaches a preset maximum number of iterations; or
-when the improvement in loss is below a certain, small number.
+  The algorithm stops when it reaches a preset maximum number of iterations; or
+  when the improvement in loss is below a certain, small number.
 
-|details-end|
 
 .. _mlp_tips:
 
@@ -361,25 +353,19 @@ or want to do additional monitoring, using ``warm_start=True`` and
     ...     # additional monitoring / inspection
     MLPClassifier(...
 
-|details-start|
-**References**
-|details-split|
-
-    * `"Learning representations by back-propagating errors."
-      <https://www.iro.umontreal.ca/~pift6266/A06/refs/backprop_old.pdf>`_
-      Rumelhart, David E., Geoffrey E. Hinton, and Ronald J. Williams.
+.. dropdown:: References
 
-    * `"Stochastic Gradient Descent" <https://leon.bottou.org/projects/sgd>`_ L. Bottou - Website, 2010.
+  * `"Learning representations by back-propagating errors."
+    <https://www.iro.umontreal.ca/~pift6266/A06/refs/backprop_old.pdf>`_
+    Rumelhart, David E., Geoffrey E. Hinton, and Ronald J. Williams.
 
-    * `"Backpropagation" <http://ufldl.stanford.edu/wiki/index.php/Backpropagation_Algorithm>`_
-      Andrew Ng, Jiquan Ngiam, Chuan Yu Foo, Yifan Mai, Caroline Suen - Website, 2011.
+  * `"Stochastic Gradient Descent" <https://leon.bottou.org/projects/sgd>`_ L. Bottou - Website, 2010.
 
-    * `"Efficient BackProp" <http://yann.lecun.com/exdb/publis/pdf/lecun-98b.pdf>`_
-      Y. LeCun, L. Bottou, G. Orr, K. Müller - In Neural Networks: Tricks
-      of the Trade 1998.
+  * `"Backpropagation" <http://ufldl.stanford.edu/wiki/index.php/Backpropagation_Algorithm>`_
+    Andrew Ng, Jiquan Ngiam, Chuan Yu Foo, Yifan Mai, Caroline Suen - Website, 2011.
 
-    *  :arxiv:`"Adam: A method for stochastic optimization."
-       <1412.6980>`
-       Kingma, Diederik, and Jimmy Ba (2014)
+  * `"Efficient BackProp" <http://yann.lecun.com/exdb/publis/pdf/lecun-98b.pdf>`_
+    Y. LeCun, L. Bottou, G. Orr, K. Müller - In Neural Networks: Tricks of the Trade 1998.
 
-|details-end|
+  * :arxiv:`"Adam: A method for stochastic optimization." <1412.6980>`
+    Kingma, Diederik, and Jimmy Ba (2014)
diff --git a/doc/modules/neural_networks_unsupervised.rst b/doc/modules/neural_networks_unsupervised.rst
index aca56ae8aaf2e..7f6c0016d183b 100644
--- a/doc/modules/neural_networks_unsupervised.rst
+++ b/doc/modules/neural_networks_unsupervised.rst
@@ -37,9 +37,9 @@ weights of independent RBMs. This method is known as unsupervised pre-training.
    :align: center
    :scale: 100%
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-   * :ref:`sphx_glr_auto_examples_neural_networks_plot_rbm_logistic_classification.py`
+* :ref:`sphx_glr_auto_examples_neural_networks_plot_rbm_logistic_classification.py`
 
 
 Graphical model and parametrization
@@ -57,7 +57,7 @@ visible and hidden unit, omitted from the image for simplicity.
 
 The energy function measures the quality of a joint assignment:
 
-.. math:: 
+.. math::
 
    E(\mathbf{v}, \mathbf{h}) = -\sum_i \sum_j w_{ij}v_ih_j - \sum_i b_iv_i
      - \sum_j c_jh_j
@@ -149,13 +149,13 @@ step, in PCD we keep a number of chains (fantasy particles) that are updated
 :math:`k` Gibbs steps after each weight update. This allows the particles to
 explore the space more thoroughly.
 
-.. topic:: References:
+.. rubric:: References
 
-    * `"A fast learning algorithm for deep belief nets"
-      <https://www.cs.toronto.edu/~hinton/absps/fastnc.pdf>`_
-      G. Hinton, S. Osindero, Y.-W. Teh, 2006
+* `"A fast learning algorithm for deep belief nets"
+  <https://www.cs.toronto.edu/~hinton/absps/fastnc.pdf>`_,
+  G. Hinton, S. Osindero, Y.-W. Teh, 2006
 
-    * `"Training Restricted Boltzmann Machines using Approximations to
-      the Likelihood Gradient"
-      <https://www.cs.toronto.edu/~tijmen/pcd/pcd.pdf>`_
-      T. Tieleman, 2008
+* `"Training Restricted Boltzmann Machines using Approximations to
+  the Likelihood Gradient"
+  <https://www.cs.toronto.edu/~tijmen/pcd/pcd.pdf>`_,
+  T. Tieleman, 2008
diff --git a/doc/modules/outlier_detection.rst b/doc/modules/outlier_detection.rst
index d003b645eb19c..0c6891ed119bd 100644
--- a/doc/modules/outlier_detection.rst
+++ b/doc/modules/outlier_detection.rst
@@ -123,19 +123,19 @@ refer to the example
 :ref:`sphx_glr_auto_examples_miscellaneous_plot_anomaly_comparison.py` and the
 sections hereunder.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * See :ref:`sphx_glr_auto_examples_miscellaneous_plot_anomaly_comparison.py`
-    for a comparison of the :class:`svm.OneClassSVM`, the
-    :class:`ensemble.IsolationForest`, the
-    :class:`neighbors.LocalOutlierFactor` and
-    :class:`covariance.EllipticEnvelope`.
+* See :ref:`sphx_glr_auto_examples_miscellaneous_plot_anomaly_comparison.py`
+  for a comparison of the :class:`svm.OneClassSVM`, the
+  :class:`ensemble.IsolationForest`, the
+  :class:`neighbors.LocalOutlierFactor` and
+  :class:`covariance.EllipticEnvelope`.
 
-  * See :ref:`sphx_glr_auto_examples_miscellaneous_plot_outlier_detection_bench.py`
-    for an example showing how to evaluate outlier detection estimators,
-    the :class:`neighbors.LocalOutlierFactor` and the
-    :class:`ensemble.IsolationForest`, using ROC curves from
-    :class:`metrics.RocCurveDisplay`.
+* See :ref:`sphx_glr_auto_examples_miscellaneous_plot_outlier_detection_bench.py`
+  for an example showing how to evaluate outlier detection estimators,
+  the :class:`neighbors.LocalOutlierFactor` and the
+  :class:`ensemble.IsolationForest`, using ROC curves from
+  :class:`metrics.RocCurveDisplay`.
 
 Novelty Detection
 =================
@@ -167,18 +167,18 @@ implementation. The `nu` parameter, also known as the margin of
 the One-Class SVM, corresponds to the probability of finding a new,
 but regular, observation outside the frontier.
 
-.. topic:: References:
+.. rubric:: References
 
-    * `Estimating the support of a high-dimensional distribution
-      <https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/tr-99-87.pdf>`_
-      Schölkopf, Bernhard, et al. Neural computation 13.7 (2001): 1443-1471.
+* `Estimating the support of a high-dimensional distribution
+  <https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/tr-99-87.pdf>`_
+  Schölkopf, Bernhard, et al. Neural computation 13.7 (2001): 1443-1471.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-   * See :ref:`sphx_glr_auto_examples_svm_plot_oneclass.py` for visualizing the
-     frontier learned around some data by a
-     :class:`svm.OneClassSVM` object.
-   * :ref:`sphx_glr_auto_examples_applications_plot_species_distribution_modeling.py`
+* See :ref:`sphx_glr_auto_examples_svm_plot_oneclass.py` for visualizing the
+  frontier learned around some data by a :class:`svm.OneClassSVM` object.
+
+* :ref:`sphx_glr_auto_examples_applications_plot_species_distribution_modeling.py`
 
 .. figure:: ../auto_examples/svm/images/sphx_glr_plot_oneclass_001.png
    :target: ../auto_examples/svm/plot_oneclass.html
@@ -196,11 +196,11 @@ approximate the solution of a kernelized :class:`svm.OneClassSVM` whose
 complexity is at best quadratic in the number of samples. See section
 :ref:`sgd_online_one_class_svm` for more details.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * See :ref:`sphx_glr_auto_examples_linear_model_plot_sgdocsvm_vs_ocsvm.py`
-    for an illustration of the approximation of a kernelized One-Class SVM
-    with the `linear_model.SGDOneClassSVM` combined with kernel approximation.
+* See :ref:`sphx_glr_auto_examples_linear_model_plot_sgdocsvm_vs_ocsvm.py`
+  for an illustration of the approximation of a kernelized One-Class SVM
+  with the `linear_model.SGDOneClassSVM` combined with kernel approximation.
 
 
 Outlier Detection
@@ -238,18 +238,18 @@ This strategy is illustrated below.
    :align: center
    :scale: 75%
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-   * See :ref:`sphx_glr_auto_examples_covariance_plot_mahalanobis_distances.py` for
-     an illustration of the difference between using a standard
-     (:class:`covariance.EmpiricalCovariance`) or a robust estimate
-     (:class:`covariance.MinCovDet`) of location and covariance to
-     assess the degree of outlyingness of an observation.
+* See :ref:`sphx_glr_auto_examples_covariance_plot_mahalanobis_distances.py` for
+  an illustration of the difference between using a standard
+  (:class:`covariance.EmpiricalCovariance`) or a robust estimate
+  (:class:`covariance.MinCovDet`) of location and covariance to
+  assess the degree of outlyingness of an observation.
 
-.. topic:: References:
+.. rubric:: References
 
-    * Rousseeuw, P.J., Van Driessen, K. "A fast algorithm for the minimum
-      covariance determinant estimator" Technometrics 41(3), 212 (1999)
+* Rousseeuw, P.J., Van Driessen, K. "A fast algorithm for the minimum
+  covariance determinant estimator" Technometrics 41(3), 212 (1999)
 
 .. _isolation_forest:
 
@@ -299,22 +299,22 @@ allows you to add more trees to an already fitted model::
   >>> clf.set_params(n_estimators=20)  # add 10 more trees  # doctest: +SKIP
   >>> clf.fit(X)  # fit the added trees  # doctest: +SKIP
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-   * See :ref:`sphx_glr_auto_examples_ensemble_plot_isolation_forest.py` for
-     an illustration of the use of IsolationForest.
+* See :ref:`sphx_glr_auto_examples_ensemble_plot_isolation_forest.py` for
+  an illustration of the use of IsolationForest.
 
-   * See :ref:`sphx_glr_auto_examples_miscellaneous_plot_anomaly_comparison.py`
-     for a comparison of :class:`ensemble.IsolationForest` with
-     :class:`neighbors.LocalOutlierFactor`,
-     :class:`svm.OneClassSVM` (tuned to perform like an outlier detection
-     method), :class:`linear_model.SGDOneClassSVM`, and a covariance-based
-     outlier detection with :class:`covariance.EllipticEnvelope`.
+* See :ref:`sphx_glr_auto_examples_miscellaneous_plot_anomaly_comparison.py`
+  for a comparison of :class:`ensemble.IsolationForest` with
+  :class:`neighbors.LocalOutlierFactor`,
+  :class:`svm.OneClassSVM` (tuned to perform like an outlier detection
+  method), :class:`linear_model.SGDOneClassSVM`, and a covariance-based
+  outlier detection with :class:`covariance.EllipticEnvelope`.
 
-.. topic:: References:
+.. rubric:: References
 
-    * Liu, Fei Tony, Ting, Kai Ming and Zhou, Zhi-Hua. "Isolation forest."
-      Data Mining, 2008. ICDM'08. Eighth IEEE International Conference on.
+* Liu, Fei Tony, Ting, Kai Ming and Zhou, Zhi-Hua. "Isolation forest."
+  Data Mining, 2008. ICDM'08. Eighth IEEE International Conference on.
 
 .. _local_outlier_factor:
 
@@ -370,20 +370,20 @@ This strategy is illustrated below.
    :align: center
    :scale: 75%
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-   * See :ref:`sphx_glr_auto_examples_neighbors_plot_lof_outlier_detection.py`
-     for an illustration of the use of :class:`neighbors.LocalOutlierFactor`.
+* See :ref:`sphx_glr_auto_examples_neighbors_plot_lof_outlier_detection.py`
+  for an illustration of the use of :class:`neighbors.LocalOutlierFactor`.
 
-   * See :ref:`sphx_glr_auto_examples_miscellaneous_plot_anomaly_comparison.py`
-     for a comparison with other anomaly detection methods.
+* See :ref:`sphx_glr_auto_examples_miscellaneous_plot_anomaly_comparison.py`
+  for a comparison with other anomaly detection methods.
 
-.. topic:: References:
+.. rubric:: References
 
-   *  Breunig, Kriegel, Ng, and Sander (2000)
-      `LOF: identifying density-based local outliers.
-      <https://www.dbs.ifi.lmu.de/Publikationen/Papers/LOF.pdf>`_
-      Proc. ACM SIGMOD
+* Breunig, Kriegel, Ng, and Sander (2000)
+  `LOF: identifying density-based local outliers.
+  <https://www.dbs.ifi.lmu.de/Publikationen/Papers/LOF.pdf>`_
+  Proc. ACM SIGMOD
 
 .. _novelty_with_lof:
 
diff --git a/doc/modules/partial_dependence.rst b/doc/modules/partial_dependence.rst
index 6fe5a79b51f63..40f691a9e6dcc 100644
--- a/doc/modules/partial_dependence.rst
+++ b/doc/modules/partial_dependence.rst
@@ -79,25 +79,21 @@ parameter takes a list of indices, names of the categorical features or a boolea
 mask. The graphical representation of partial dependence for categorical features is
 a bar plot or a 2D heatmap.
 
-|details-start|
-**PDPs for multi-class classification**
-|details-split|
-
-For multi-class classification, you need to set the class label for which
-the PDPs should be created via the ``target`` argument::
-
-    >>> from sklearn.datasets import load_iris
-    >>> iris = load_iris()
-    >>> mc_clf = GradientBoostingClassifier(n_estimators=10,
-    ...     max_depth=1).fit(iris.data, iris.target)
-    >>> features = [3, 2, (3, 2)]
-    >>> PartialDependenceDisplay.from_estimator(mc_clf, X, features, target=0)
-    <...>
+.. dropdown:: PDPs for multi-class classification
+
+    For multi-class classification, you need to set the class label for which
+    the PDPs should be created via the ``target`` argument::
 
-The same parameter ``target`` is used to specify the target in multi-output
-regression settings.
+        >>> from sklearn.datasets import load_iris
+        >>> iris = load_iris()
+        >>> mc_clf = GradientBoostingClassifier(n_estimators=10,
+        ...     max_depth=1).fit(iris.data, iris.target)
+        >>> features = [3, 2, (3, 2)]
+        >>> PartialDependenceDisplay.from_estimator(mc_clf, X, features, target=0)
+        <...>
 
-|details-end|
+    The same parameter ``target`` is used to specify the target in multi-output
+    regression settings.
 
 If you need the raw values of the partial dependence function rather than
 the plots, you can use the
@@ -108,7 +104,7 @@ the plots, you can use the
     >>> results = partial_dependence(clf, X, [0])
     >>> results["average"]
     array([[ 2.466...,  2.466..., ...
-    >>> results["values"]
+    >>> results["grid_values"]
     [array([-1.624..., -1.592..., ...
 
 The values at which the partial dependence should be evaluated are directly
@@ -266,9 +262,9 @@ estimators that support it, and 'brute' is used for the rest.
     interpreting PDPs is that the features should be independent.
 
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_inspection_plot_partial_dependence.py`
+* :ref:`sphx_glr_auto_examples_inspection_plot_partial_dependence.py`
 
 .. rubric:: Footnotes
 
@@ -276,21 +272,20 @@ estimators that support it, and 'brute' is used for the rest.
    class (the positive class for binary classification), or the decision
    function.
 
-.. topic:: References
+.. rubric:: References
 
-    .. [H2009] T. Hastie, R. Tibshirani and J. Friedman,
-               `The Elements of Statistical Learning
-               <https://web.stanford.edu/~hastie/ElemStatLearn//>`_,
-               Second Edition, Section 10.13.2, Springer, 2009.
+.. [H2009] T. Hastie, R. Tibshirani and J. Friedman,
+    `The Elements of Statistical Learning
+    <https://web.stanford.edu/~hastie/ElemStatLearn//>`_,
+    Second Edition, Section 10.13.2, Springer, 2009.
 
-    .. [M2019] C. Molnar,
-               `Interpretable Machine Learning
-               <https://christophm.github.io/interpretable-ml-book/>`_,
-               Section 5.1, 2019.
+.. [M2019] C. Molnar,
+    `Interpretable Machine Learning
+    <https://christophm.github.io/interpretable-ml-book/>`_,
+    Section 5.1, 2019.
 
-    .. [G2015] :arxiv:`A. Goldstein, A. Kapelner, J. Bleich, and E. Pitkin,
-               "Peeking Inside the Black Box: Visualizing Statistical
-               Learning With Plots of Individual Conditional Expectation"
-               Journal of Computational and Graphical Statistics,
-               24(1): 44-65, Springer, 2015.
-               <1309.6392>`
+.. [G2015] :arxiv:`A. Goldstein, A. Kapelner, J. Bleich, and E. Pitkin,
+    "Peeking Inside the Black Box: Visualizing Statistical
+    Learning With Plots of Individual Conditional Expectation"
+    Journal of Computational and Graphical Statistics,
+    24(1): 44-65, Springer, 2015. <1309.6392>`
diff --git a/doc/modules/permutation_importance.rst b/doc/modules/permutation_importance.rst
index 368c6a6409aa0..12a20a8bcaa6c 100644
--- a/doc/modules/permutation_importance.rst
+++ b/doc/modules/permutation_importance.rst
@@ -110,48 +110,44 @@ which is more computationally efficient than sequentially calling
 :func:`permutation_importance` several times with a different scorer, as it
 reuses model predictions.
 
-|details-start|
-**Example of permutation feature importance using multiple scorers**
-|details-split|
-
-In the example below we use a list of metrics, but more input formats are
-possible, as documented in :ref:`multimetric_scoring`.
-
-  >>> scoring = ['r2', 'neg_mean_absolute_percentage_error', 'neg_mean_squared_error']
-  >>> r_multi = permutation_importance(
-  ...     model, X_val, y_val, n_repeats=30, random_state=0, scoring=scoring)
-  ...
-  >>> for metric in r_multi:
-  ...     print(f"{metric}")
-  ...     r = r_multi[metric]
-  ...     for i in r.importances_mean.argsort()[::-1]:
-  ...         if r.importances_mean[i] - 2 * r.importances_std[i] > 0:
-  ...             print(f"    {diabetes.feature_names[i]:<8}"
-  ...                   f"{r.importances_mean[i]:.3f}"
-  ...                   f" +/- {r.importances_std[i]:.3f}")
-  ...
-  r2
-      s5      0.204 +/- 0.050
-      bmi     0.176 +/- 0.048
-      bp      0.088 +/- 0.033
-      sex     0.056 +/- 0.023
-  neg_mean_absolute_percentage_error
-      s5      0.081 +/- 0.020
-      bmi     0.064 +/- 0.015
-      bp      0.029 +/- 0.010
-  neg_mean_squared_error
-      s5      1013.866 +/- 246.445
-      bmi     872.726 +/- 240.298
-      bp      438.663 +/- 163.022
-      sex     277.376 +/- 115.123
-
-The ranking of the features is approximately the same for different metrics even
-if the scales of the importance values are very different. However, this is not
-guaranteed and different metrics might lead to significantly different feature
-importances, in particular for models trained for imbalanced classification problems,
-for which **the choice of the classification metric can be critical**.
-
-|details-end|
+.. dropdown:: Example of permutation feature importance using multiple scorers
+
+  In the example below we use a list of metrics, but more input formats are
+  possible, as documented in :ref:`multimetric_scoring`.
+
+    >>> scoring = ['r2', 'neg_mean_absolute_percentage_error', 'neg_mean_squared_error']
+    >>> r_multi = permutation_importance(
+    ...     model, X_val, y_val, n_repeats=30, random_state=0, scoring=scoring)
+    ...
+    >>> for metric in r_multi:
+    ...     print(f"{metric}")
+    ...     r = r_multi[metric]
+    ...     for i in r.importances_mean.argsort()[::-1]:
+    ...         if r.importances_mean[i] - 2 * r.importances_std[i] > 0:
+    ...             print(f"    {diabetes.feature_names[i]:<8}"
+    ...                   f"{r.importances_mean[i]:.3f}"
+    ...                   f" +/- {r.importances_std[i]:.3f}")
+    ...
+    r2
+        s5      0.204 +/- 0.050
+        bmi     0.176 +/- 0.048
+        bp      0.088 +/- 0.033
+        sex     0.056 +/- 0.023
+    neg_mean_absolute_percentage_error
+        s5      0.081 +/- 0.020
+        bmi     0.064 +/- 0.015
+        bp      0.029 +/- 0.010
+    neg_mean_squared_error
+        s5      1013.866 +/- 246.445
+        bmi     872.726 +/- 240.298
+        bp      438.663 +/- 163.022
+        sex     277.376 +/- 115.123
+
+  The ranking of the features is approximately the same for different metrics even
+  if the scales of the importance values are very different. However, this is not
+  guaranteed and different metrics might lead to significantly different feature
+  importances, in particular for models trained for imbalanced classification problems,
+  for which **the choice of the classification metric can be critical**.
 
 Outline of the permutation importance algorithm
 -----------------------------------------------
@@ -228,12 +224,12 @@ keep one feature from each cluster.
 For more details on such strategy, see the example
 :ref:`sphx_glr_auto_examples_inspection_plot_permutation_importance_multicollinear.py`.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_inspection_plot_permutation_importance.py`
-  * :ref:`sphx_glr_auto_examples_inspection_plot_permutation_importance_multicollinear.py`
+* :ref:`sphx_glr_auto_examples_inspection_plot_permutation_importance.py`
+* :ref:`sphx_glr_auto_examples_inspection_plot_permutation_importance_multicollinear.py`
 
-.. topic:: References:
+.. rubric:: References
 
-   .. [1] L. Breiman, :doi:`"Random Forests" <10.1023/A:1010933404324>`,
-      Machine Learning, 45(1), 5-32, 2001.
+.. [1] L. Breiman, :doi:`"Random Forests" <10.1023/A:1010933404324>`,
+  Machine Learning, 45(1), 5-32, 2001.
diff --git a/doc/modules/preprocessing.rst b/doc/modules/preprocessing.rst
index 99678f2b3e45b..90889ad5af7e0 100644
--- a/doc/modules/preprocessing.rst
+++ b/doc/modules/preprocessing.rst
@@ -219,28 +219,22 @@ of the data is likely to not work very well. In these cases, you can use
 :class:`RobustScaler` as a drop-in replacement instead. It uses
 more robust estimates for the center and range of your data.
 
-|details-start|
-**References**
-|details-split|
 
-Further discussion on the importance of centering and scaling data is
-available on this FAQ: `Should I normalize/standardize/rescale the data?
-<http://www.faqs.org/faqs/ai-faq/neural-nets/part2/section-16.html>`_
+.. dropdown:: References
 
-|details-end|
+  Further discussion on the importance of centering and scaling data is
+  available on this FAQ: `Should I normalize/standardize/rescale the data?
+  <http://www.faqs.org/faqs/ai-faq/neural-nets/part2/section-16.html>`_
 
-|details-start|
-**Scaling vs Whitening**
-|details-split|
+.. dropdown:: Scaling vs Whitening
 
-It is sometimes not enough to center and scale the features
-independently, since a downstream model can further make some assumption
-on the linear independence of the features.
+  It is sometimes not enough to center and scale the features
+  independently, since a downstream model can further make some assumption
+  on the linear independence of the features.
 
-To address this issue you can use :class:`~sklearn.decomposition.PCA` with
-``whiten=True`` to further remove the linear correlation across features.
+  To address this issue you can use :class:`~sklearn.decomposition.PCA` with
+  ``whiten=True`` to further remove the linear correlation across features.
 
-|details-end|
 
 .. _kernel_centering:
 
@@ -255,63 +249,59 @@ followed by the removal of the mean in that space. In other words,
 :class:`KernelCenterer` computes the centered Gram matrix associated to a
 positive semidefinite kernel :math:`K`.
 
-|details-start|
-**Mathematical formulation**
-|details-split|
+.. dropdown:: Mathematical formulation
 
-We can have a look at the mathematical formulation now that we have the
-intuition. Let :math:`K` be a kernel matrix of shape `(n_samples, n_samples)`
-computed from :math:`X`, a data matrix of shape `(n_samples, n_features)`,
-during the `fit` step. :math:`K` is defined by
+  We can have a look at the mathematical formulation now that we have the
+  intuition. Let :math:`K` be a kernel matrix of shape `(n_samples, n_samples)`
+  computed from :math:`X`, a data matrix of shape `(n_samples, n_features)`,
+  during the `fit` step. :math:`K` is defined by
 
-.. math::
-  K(X, X) = \phi(X) . \phi(X)^{T}
+  .. math::
+    K(X, X) = \phi(X) . \phi(X)^{T}
 
-:math:`\phi(X)` is a function mapping of :math:`X` to a Hilbert space. A
-centered kernel :math:`\tilde{K}` is defined as:
+  :math:`\phi(X)` is a function mapping of :math:`X` to a Hilbert space. A
+  centered kernel :math:`\tilde{K}` is defined as:
 
-.. math::
-  \tilde{K}(X, X) = \tilde{\phi}(X) . \tilde{\phi}(X)^{T}
+  .. math::
+    \tilde{K}(X, X) = \tilde{\phi}(X) . \tilde{\phi}(X)^{T}
 
-where :math:`\tilde{\phi}(X)` results from centering :math:`\phi(X)` in the
-Hilbert space.
+  where :math:`\tilde{\phi}(X)` results from centering :math:`\phi(X)` in the
+  Hilbert space.
 
-Thus, one could compute :math:`\tilde{K}` by mapping :math:`X` using the
-function :math:`\phi(\cdot)` and center the data in this new space. However,
-kernels are often used because they allows some algebra calculations that
-avoid computing explicitly this mapping using :math:`\phi(\cdot)`. Indeed, one
-can implicitly center as shown in Appendix B in [Scholkopf1998]_:
+  Thus, one could compute :math:`\tilde{K}` by mapping :math:`X` using the
+  function :math:`\phi(\cdot)` and center the data in this new space. However,
+  kernels are often used because they allows some algebra calculations that
+  avoid computing explicitly this mapping using :math:`\phi(\cdot)`. Indeed, one
+  can implicitly center as shown in Appendix B in [Scholkopf1998]_:
 
-.. math::
-  \tilde{K} = K - 1_{\text{n}_{samples}} K - K 1_{\text{n}_{samples}} + 1_{\text{n}_{samples}} K 1_{\text{n}_{samples}}
+  .. math::
+    \tilde{K} = K - 1_{\text{n}_{samples}} K - K 1_{\text{n}_{samples}} + 1_{\text{n}_{samples}} K 1_{\text{n}_{samples}}
 
-:math:`1_{\text{n}_{samples}}` is a matrix of `(n_samples, n_samples)` where
-all entries are equal to :math:`\frac{1}{\text{n}_{samples}}`. In the
-`transform` step, the kernel becomes :math:`K_{test}(X, Y)` defined as:
+  :math:`1_{\text{n}_{samples}}` is a matrix of `(n_samples, n_samples)` where
+  all entries are equal to :math:`\frac{1}{\text{n}_{samples}}`. In the
+  `transform` step, the kernel becomes :math:`K_{test}(X, Y)` defined as:
 
-.. math::
-  K_{test}(X, Y) = \phi(Y) . \phi(X)^{T}
+  .. math::
+    K_{test}(X, Y) = \phi(Y) . \phi(X)^{T}
 
-:math:`Y` is the test dataset of shape `(n_samples_test, n_features)` and thus
-:math:`K_{test}` is of shape `(n_samples_test, n_samples)`. In this case,
-centering :math:`K_{test}` is done as:
+  :math:`Y` is the test dataset of shape `(n_samples_test, n_features)` and thus
+  :math:`K_{test}` is of shape `(n_samples_test, n_samples)`. In this case,
+  centering :math:`K_{test}` is done as:
 
-.. math::
-  \tilde{K}_{test}(X, Y) = K_{test} - 1'_{\text{n}_{samples}} K - K_{test} 1_{\text{n}_{samples}} + 1'_{\text{n}_{samples}} K 1_{\text{n}_{samples}}
+  .. math::
+    \tilde{K}_{test}(X, Y) = K_{test} - 1'_{\text{n}_{samples}} K - K_{test} 1_{\text{n}_{samples}} + 1'_{\text{n}_{samples}} K 1_{\text{n}_{samples}}
 
-:math:`1'_{\text{n}_{samples}}` is a matrix of shape
-`(n_samples_test, n_samples)` where all entries are equal to
-:math:`\frac{1}{\text{n}_{samples}}`.
+  :math:`1'_{\text{n}_{samples}}` is a matrix of shape
+  `(n_samples_test, n_samples)` where all entries are equal to
+  :math:`\frac{1}{\text{n}_{samples}}`.
 
-.. topic:: References
+  .. rubric:: References
 
   .. [Scholkopf1998] B. Schölkopf, A. Smola, and K.R. Müller,
     `"Nonlinear component analysis as a kernel eigenvalue problem."
     <https://www.mlpack.org/papers/kpca.pdf>`_
     Neural computation 10.5 (1998): 1299-1319.
 
-|details-end|
-
 .. _preprocessing_transformer:
 
 Non-linear transformation
@@ -383,54 +373,46 @@ possible in order to stabilize variance and minimize skewness.
 :class:`PowerTransformer` currently provides two such power transformations,
 the Yeo-Johnson transform and the Box-Cox transform.
 
-|details-start|
-**Yeo-Johnson transform**
-|details-split|
-
-.. math::
-    x_i^{(\lambda)} =
-    \begin{cases}
-     [(x_i + 1)^\lambda - 1] / \lambda & \text{if } \lambda \neq 0, x_i \geq 0, \\[8pt]
-    \ln{(x_i + 1)} & \text{if } \lambda = 0, x_i \geq 0 \\[8pt]
-    -[(-x_i + 1)^{2 - \lambda} - 1] / (2 - \lambda) & \text{if } \lambda \neq 2, x_i < 0, \\[8pt]
-     - \ln (- x_i + 1) & \text{if } \lambda = 2, x_i < 0
-    \end{cases}
-
-|details-end|
-
-|details-start|
-**Box-Cox transform**
-|details-split|
-
-.. math::
-    x_i^{(\lambda)} =
-    \begin{cases}
-    \dfrac{x_i^\lambda - 1}{\lambda} & \text{if } \lambda \neq 0, \\[8pt]
-    \ln{(x_i)} & \text{if } \lambda = 0,
-    \end{cases}
-
-
-Box-Cox can only be applied to strictly positive data. In both methods, the
-transformation is parameterized by :math:`\lambda`, which is determined through
-maximum likelihood estimation. Here is an example of using Box-Cox to map
-samples drawn from a lognormal distribution to a normal distribution::
-
-  >>> pt = preprocessing.PowerTransformer(method='box-cox', standardize=False)
-  >>> X_lognormal = np.random.RandomState(616).lognormal(size=(3, 3))
-  >>> X_lognormal
-  array([[1.28..., 1.18..., 0.84...],
-         [0.94..., 1.60..., 0.38...],
-         [1.35..., 0.21..., 1.09...]])
-  >>> pt.fit_transform(X_lognormal)
-  array([[ 0.49...,  0.17..., -0.15...],
-         [-0.05...,  0.58..., -0.57...],
-         [ 0.69..., -0.84...,  0.10...]])
-
-While the above example sets the `standardize` option to `False`,
-:class:`PowerTransformer` will apply zero-mean, unit-variance normalization
-to the transformed output by default.
-
-|details-end|
+.. dropdown:: Yeo-Johnson transform
+
+  .. math::
+      x_i^{(\lambda)} =
+      \begin{cases}
+      [(x_i + 1)^\lambda - 1] / \lambda & \text{if } \lambda \neq 0, x_i \geq 0, \\[8pt]
+      \ln{(x_i + 1)} & \text{if } \lambda = 0, x_i \geq 0 \\[8pt]
+      -[(-x_i + 1)^{2 - \lambda} - 1] / (2 - \lambda) & \text{if } \lambda \neq 2, x_i < 0, \\[8pt]
+      - \ln (- x_i + 1) & \text{if } \lambda = 2, x_i < 0
+      \end{cases}
+
+.. dropdown:: Box-Cox transform
+
+  .. math::
+      x_i^{(\lambda)} =
+      \begin{cases}
+      \dfrac{x_i^\lambda - 1}{\lambda} & \text{if } \lambda \neq 0, \\[8pt]
+      \ln{(x_i)} & \text{if } \lambda = 0,
+      \end{cases}
+
+  Box-Cox can only be applied to strictly positive data. In both methods, the
+  transformation is parameterized by :math:`\lambda`, which is determined through
+  maximum likelihood estimation. Here is an example of using Box-Cox to map
+  samples drawn from a lognormal distribution to a normal distribution::
+
+    >>> pt = preprocessing.PowerTransformer(method='box-cox', standardize=False)
+    >>> X_lognormal = np.random.RandomState(616).lognormal(size=(3, 3))
+    >>> X_lognormal
+    array([[1.28..., 1.18..., 0.84...],
+          [0.94..., 1.60..., 0.38...],
+          [1.35..., 0.21..., 1.09...]])
+    >>> pt.fit_transform(X_lognormal)
+    array([[ 0.49...,  0.17..., -0.15...],
+          [-0.05...,  0.58..., -0.57...],
+          [ 0.69..., -0.84...,  0.10...]])
+
+  While the above example sets the `standardize` option to `False`,
+  :class:`PowerTransformer` will apply zero-mean, unit-variance normalization
+  to the transformed output by default.
+
 
 Below are examples of Box-Cox and Yeo-Johnson applied to various probability
 distributions.  Note that when applied to certain distributions, the power
@@ -518,9 +500,8 @@ The normalizer instance can then be used on sample vectors as any transformer::
 
 Note: L2 normalization is also known as spatial sign preprocessing.
 
-|details-start|
-**Sparse input**
-|details-split|
+.. dropdown:: Sparse input
+
   :func:`normalize` and :class:`Normalizer` accept **both dense array-like
   and sparse matrices from scipy.sparse as input**.
 
@@ -529,12 +510,11 @@ Note: L2 normalization is also known as spatial sign preprocessing.
   efficient Cython routines. To avoid unnecessary memory copies, it is
   recommended to choose the CSR representation upstream.
 
-|details-end|
-
 .. _preprocessing_categorical_features:
 
 Encoding categorical features
 =============================
+
 Often features are not given as continuous values but categorical.
 For example a person could have features ``["male", "female"]``,
 ``["from Europe", "from US", "from Asia"]``,
@@ -721,42 +701,39 @@ not dropped::
     >>> drop_enc.inverse_transform(X_trans)
     array([['female', None, None]], dtype=object)
 
-|details-start|
-**Support of categorical features with missing values**
-|details-split|
+.. dropdown:: Support of categorical features with missing values
 
-:class:`OneHotEncoder` supports categorical features with missing values by
-considering the missing values as an additional category::
+  :class:`OneHotEncoder` supports categorical features with missing values by
+  considering the missing values as an additional category::
 
-    >>> X = [['male', 'Safari'],
-    ...      ['female', None],
-    ...      [np.nan, 'Firefox']]
-    >>> enc = preprocessing.OneHotEncoder(handle_unknown='error').fit(X)
-    >>> enc.categories_
-    [array(['female', 'male', nan], dtype=object),
-     array(['Firefox', 'Safari', None], dtype=object)]
-    >>> enc.transform(X).toarray()
-    array([[0., 1., 0., 0., 1., 0.],
-           [1., 0., 0., 0., 0., 1.],
-           [0., 0., 1., 1., 0., 0.]])
-
-If a feature contains both `np.nan` and `None`, they will be considered
-separate categories::
-
-    >>> X = [['Safari'], [None], [np.nan], ['Firefox']]
-    >>> enc = preprocessing.OneHotEncoder(handle_unknown='error').fit(X)
-    >>> enc.categories_
-    [array(['Firefox', 'Safari', None, nan], dtype=object)]
-    >>> enc.transform(X).toarray()
-    array([[0., 1., 0., 0.],
-           [0., 0., 1., 0.],
-           [0., 0., 0., 1.],
-           [1., 0., 0., 0.]])
+      >>> X = [['male', 'Safari'],
+      ...      ['female', None],
+      ...      [np.nan, 'Firefox']]
+      >>> enc = preprocessing.OneHotEncoder(handle_unknown='error').fit(X)
+      >>> enc.categories_
+      [array(['female', 'male', nan], dtype=object),
+      array(['Firefox', 'Safari', None], dtype=object)]
+      >>> enc.transform(X).toarray()
+      array([[0., 1., 0., 0., 1., 0.],
+            [1., 0., 0., 0., 0., 1.],
+            [0., 0., 1., 1., 0., 0.]])
+
+  If a feature contains both `np.nan` and `None`, they will be considered
+  separate categories::
+
+      >>> X = [['Safari'], [None], [np.nan], ['Firefox']]
+      >>> enc = preprocessing.OneHotEncoder(handle_unknown='error').fit(X)
+      >>> enc.categories_
+      [array(['Firefox', 'Safari', None, nan], dtype=object)]
+      >>> enc.transform(X).toarray()
+      array([[0., 1., 0., 0.],
+            [0., 0., 1., 0.],
+            [0., 0., 0., 1.],
+            [1., 0., 0., 0.]])
 
-See :ref:`dict_feature_extraction` for categorical features that are
-represented as a dict, not as scalars.
+  See :ref:`dict_feature_extraction` for categorical features that are
+  represented as a dict, not as scalars.
 
-|details-end|
 
 .. _encoder_infrequent_categories:
 
@@ -910,66 +887,55 @@ cardinality, where one-hot encoding would inflate the feature space making it
 more expensive for a downstream model to process. A classical example of high
 cardinality categories are location based such as zip code or region.
 
-|details-start|
-**Binary classification targets**
-|details-split|
-
-For the binary classification target, the target encoding is given by:
-
-.. math::
-    S_i = \lambda_i\frac{n_{iY}}{n_i} + (1 - \lambda_i)\frac{n_Y}{n}
+.. dropdown:: Binary classification targets
 
-where :math:`S_i` is the encoding for category :math:`i`, :math:`n_{iY}` is the
-number of observations with :math:`Y=1` and category :math:`i`, :math:`n_i` is
-the number of observations with category :math:`i`, :math:`n_Y` is the number of
-observations with :math:`Y=1`, :math:`n` is the number of observations, and
-:math:`\lambda_i` is a shrinkage factor for category :math:`i`. The shrinkage
-factor is given by:
+  For the binary classification target, the target encoding is given by:
 
-.. math::
-    \lambda_i = \frac{n_i}{m + n_i}
+  .. math::
+      S_i = \lambda_i\frac{n_{iY}}{n_i} + (1 - \lambda_i)\frac{n_Y}{n}
 
-where :math:`m` is a smoothing factor, which is controlled with the `smooth`
-parameter in :class:`TargetEncoder`. Large smoothing factors will put more
-weight on the global mean. When `smooth="auto"`, the smoothing factor is
-computed as an empirical Bayes estimate: :math:`m=\sigma_i^2/\tau^2`, where
-:math:`\sigma_i^2` is the variance of `y` with category :math:`i` and
-:math:`\tau^2` is the global variance of `y`.
+  where :math:`S_i` is the encoding for category :math:`i`, :math:`n_{iY}` is the
+  number of observations with :math:`Y=1` and category :math:`i`, :math:`n_i` is
+  the number of observations with category :math:`i`, :math:`n_Y` is the number of
+  observations with :math:`Y=1`, :math:`n` is the number of observations, and
+  :math:`\lambda_i` is a shrinkage factor for category :math:`i`. The shrinkage
+  factor is given by:
 
-|details-end|
+  .. math::
+      \lambda_i = \frac{n_i}{m + n_i}
 
-|details-start|
-**Multiclass classification targets**
-|details-split|
+  where :math:`m` is a smoothing factor, which is controlled with the `smooth`
+  parameter in :class:`TargetEncoder`. Large smoothing factors will put more
+  weight on the global mean. When `smooth="auto"`, the smoothing factor is
+  computed as an empirical Bayes estimate: :math:`m=\sigma_i^2/\tau^2`, where
+  :math:`\sigma_i^2` is the variance of `y` with category :math:`i` and
+  :math:`\tau^2` is the global variance of `y`.
 
-For multiclass classification targets, the formulation is similar to binary
-classification:
+.. dropdown:: Multiclass classification targets
 
-.. math::
-    S_{ij} = \lambda_i\frac{n_{iY_j}}{n_i} + (1 - \lambda_i)\frac{n_{Y_j}}{n}
+  For multiclass classification targets, the formulation is similar to binary
+  classification:
 
-where :math:`S_{ij}` is the encoding for category :math:`i` and class :math:`j`,
-:math:`n_{iY_j}` is the number of observations with :math:`Y=j` and category
-:math:`i`, :math:`n_i` is the number of observations with category :math:`i`,
-:math:`n_{Y_j}` is the number of observations with :math:`Y=j`, :math:`n` is the
-number of observations, and :math:`\lambda_i` is a shrinkage factor for category
-:math:`i`.
+  .. math::
+      S_{ij} = \lambda_i\frac{n_{iY_j}}{n_i} + (1 - \lambda_i)\frac{n_{Y_j}}{n}
 
-|details-end|
+  where :math:`S_{ij}` is the encoding for category :math:`i` and class :math:`j`,
+  :math:`n_{iY_j}` is the number of observations with :math:`Y=j` and category
+  :math:`i`, :math:`n_i` is the number of observations with category :math:`i`,
+  :math:`n_{Y_j}` is the number of observations with :math:`Y=j`, :math:`n` is the
+  number of observations, and :math:`\lambda_i` is a shrinkage factor for category
+  :math:`i`.
 
-|details-start|
-**Continuous targets**
-|details-split|
+.. dropdown:: Continuous targets
 
-For continuous targets, the formulation is similar to binary classification:
+  For continuous targets, the formulation is similar to binary classification:
 
-.. math::
-    S_i = \lambda_i\frac{\sum_{k\in L_i}Y_k}{n_i} + (1 - \lambda_i)\frac{\sum_{k=1}^{n}Y_k}{n}
+  .. math::
+      S_i = \lambda_i\frac{\sum_{k\in L_i}Y_k}{n_i} + (1 - \lambda_i)\frac{\sum_{k=1}^{n}Y_k}{n}
 
-where :math:`L_i` is the set of observations with category :math:`i` and
-:math:`n_i` is the number of observations with category :math:`i`.
+  where :math:`L_i` is the set of observations with category :math:`i` and
+  :math:`n_i` is the number of observations with category :math:`i`.
 
-|details-end|
 
 :meth:`~TargetEncoder.fit_transform` internally relies on a :term:`cross fitting`
 scheme to prevent target information from leaking into the train-time
@@ -1005,21 +971,21 @@ encoding learned in :meth:`~TargetEncoder.fit_transform`.
   that are not seen during `fit` are encoded with the target mean, i.e.
   `target_mean_`.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_preprocessing_plot_target_encoder.py`
-  * :ref:`sphx_glr_auto_examples_preprocessing_plot_target_encoder_cross_val.py`
+* :ref:`sphx_glr_auto_examples_preprocessing_plot_target_encoder.py`
+* :ref:`sphx_glr_auto_examples_preprocessing_plot_target_encoder_cross_val.py`
 
-.. topic:: References
+.. rubric:: References
 
-  .. [MIC] :doi:`Micci-Barreca, Daniele. "A preprocessing scheme for high-cardinality
-     categorical attributes in classification and prediction problems"
-     SIGKDD Explor. Newsl. 3, 1 (July 2001), 27–32. <10.1145/507533.507538>`
+.. [MIC] :doi:`Micci-Barreca, Daniele. "A preprocessing scheme for high-cardinality
+    categorical attributes in classification and prediction problems"
+    SIGKDD Explor. Newsl. 3, 1 (July 2001), 27-32. <10.1145/507533.507538>`
 
-  .. [PAR] :doi:`Pargent, F., Pfisterer, F., Thomas, J. et al. "Regularized target
-     encoding outperforms traditional methods in supervised machine learning with
-     high cardinality features" Comput Stat 37, 2671–2692 (2022)
-     <10.1007/s00180-022-01207-6>`
+.. [PAR] :doi:`Pargent, F., Pfisterer, F., Thomas, J. et al. "Regularized target
+    encoding outperforms traditional methods in supervised machine learning with
+    high cardinality features" Comput Stat 37, 2671-2692 (2022)
+    <10.1007/s00180-022-01207-6>`
 
 .. _preprocessing_discretization:
 
@@ -1097,11 +1063,11 @@ For instance, we can use the Pandas function :func:`pandas.cut`::
   ['infant', 'kid', 'teen', 'adult', 'senior citizen']
   Categories (5, object): ['infant' < 'kid' < 'teen' < 'adult' < 'senior citizen']
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_preprocessing_plot_discretization.py`
-  * :ref:`sphx_glr_auto_examples_preprocessing_plot_discretization_classification.py`
-  * :ref:`sphx_glr_auto_examples_preprocessing_plot_discretization_strategies.py`
+* :ref:`sphx_glr_auto_examples_preprocessing_plot_discretization.py`
+* :ref:`sphx_glr_auto_examples_preprocessing_plot_discretization_classification.py`
+* :ref:`sphx_glr_auto_examples_preprocessing_plot_discretization_strategies.py`
 
 .. _preprocessing_binarization:
 
@@ -1294,23 +1260,20 @@ Interestingly, a :class:`SplineTransformer` of ``degree=0`` is the same as
 ``encode='onehot-dense'`` and ``n_bins = n_knots - 1`` if
 ``knots = strategy``.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_linear_model_plot_polynomial_interpolation.py`
-    * :ref:`sphx_glr_auto_examples_applications_plot_cyclical_feature_engineering.py`
+* :ref:`sphx_glr_auto_examples_linear_model_plot_polynomial_interpolation.py`
+* :ref:`sphx_glr_auto_examples_applications_plot_cyclical_feature_engineering.py`
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
-    * Eilers, P., & Marx, B. (1996). :doi:`Flexible Smoothing with B-splines and
-      Penalties <10.1214/ss/1038425655>`. Statist. Sci. 11 (1996), no. 2, 89--121.
+  * Eilers, P., & Marx, B. (1996). :doi:`Flexible Smoothing with B-splines and
+    Penalties <10.1214/ss/1038425655>`. Statist. Sci. 11 (1996), no. 2, 89--121.
 
-    * Perperoglou, A., Sauerbrei, W., Abrahamowicz, M. et al. :doi:`A review of
-      spline function procedures in R <10.1186/s12874-019-0666-3>`.
-      BMC Med Res Methodol 19, 46 (2019).
+  * Perperoglou, A., Sauerbrei, W., Abrahamowicz, M. et al. :doi:`A review of
+    spline function procedures in R <10.1186/s12874-019-0666-3>`.
+    BMC Med Res Methodol 19, 46 (2019).
 
-|details-end|
 
 .. _function_transformer:
 
diff --git a/doc/modules/random_projection.rst b/doc/modules/random_projection.rst
index 6931feb34ad1d..173aee434576c 100644
--- a/doc/modules/random_projection.rst
+++ b/doc/modules/random_projection.rst
@@ -19,19 +19,19 @@ samples of the dataset. Thus random projection is a suitable approximation
 technique for distance based method.
 
 
-.. topic:: References:
+.. rubric:: References
 
- * Sanjoy Dasgupta. 2000.
-   `Experiments with random projection. <https://cseweb.ucsd.edu/~dasgupta/papers/randomf.pdf>`_
-   In Proceedings of the Sixteenth conference on Uncertainty in artificial
-   intelligence (UAI'00), Craig Boutilier and Moisés Goldszmidt (Eds.). Morgan
-   Kaufmann Publishers Inc., San Francisco, CA, USA, 143-151.
+* Sanjoy Dasgupta. 2000.
+  `Experiments with random projection. <https://cseweb.ucsd.edu/~dasgupta/papers/randomf.pdf>`_
+  In Proceedings of the Sixteenth conference on Uncertainty in artificial
+  intelligence (UAI'00), Craig Boutilier and Moisés Goldszmidt (Eds.). Morgan
+  Kaufmann Publishers Inc., San Francisco, CA, USA, 143-151.
 
- * Ella Bingham and Heikki Mannila. 2001.
-   `Random projection in dimensionality reduction: applications to image and text data. <https://citeseerx.ist.psu.edu/doc_view/pid/aed77346f737b0ed5890b61ad02e5eb4ab2f3dc6>`_
-   In Proceedings of the seventh ACM SIGKDD international conference on
-   Knowledge discovery and data mining (KDD '01). ACM, New York, NY, USA,
-   245-250.
+* Ella Bingham and Heikki Mannila. 2001.
+  `Random projection in dimensionality reduction: applications to image and text data. <https://citeseerx.ist.psu.edu/doc_view/pid/aed77346f737b0ed5890b61ad02e5eb4ab2f3dc6>`_
+  In Proceedings of the seventh ACM SIGKDD international conference on
+  Knowledge discovery and data mining (KDD '01). ACM, New York, NY, USA,
+  245-250.
 
 
 .. _johnson_lindenstrauss:
@@ -74,17 +74,17 @@ bounded distortion introduced by the random projection::
    :scale: 75
    :align: center
 
-.. topic:: Example:
+.. rubric:: Examples
 
-  * See :ref:`sphx_glr_auto_examples_miscellaneous_plot_johnson_lindenstrauss_bound.py`
-    for a theoretical explication on the Johnson-Lindenstrauss lemma and an
-    empirical validation using sparse random matrices.
+* See :ref:`sphx_glr_auto_examples_miscellaneous_plot_johnson_lindenstrauss_bound.py`
+  for a theoretical explication on the Johnson-Lindenstrauss lemma and an
+  empirical validation using sparse random matrices.
 
-.. topic:: References:
+.. rubric:: References
 
-  * Sanjoy Dasgupta and Anupam Gupta, 1999.
-    `An elementary proof of the Johnson-Lindenstrauss Lemma.
-    <https://citeseerx.ist.psu.edu/doc_view/pid/95cd464d27c25c9c8690b378b894d337cdf021f9>`_
+* Sanjoy Dasgupta and Anupam Gupta, 1999.
+  `An elementary proof of the Johnson-Lindenstrauss Lemma.
+  <https://citeseerx.ist.psu.edu/doc_view/pid/95cd464d27c25c9c8690b378b894d337cdf021f9>`_
 
 .. _gaussian_random_matrix:
 
@@ -148,18 +148,17 @@ projection transformer::
   (100, 3947)
 
 
-.. topic:: References:
+.. rubric:: References
 
- * D. Achlioptas. 2003.
-   `Database-friendly random projections: Johnson-Lindenstrauss  with binary
-   coins <https://www.sciencedirect.com/science/article/pii/S0022000003000254>`_.
-   Journal of Computer and System Sciences 66 (2003) 671–687
+* D. Achlioptas. 2003.
+  `Database-friendly random projections: Johnson-Lindenstrauss  with binary
+  coins <https://www.sciencedirect.com/science/article/pii/S0022000003000254>`_.
+  Journal of Computer and System Sciences 66 (2003) 671-687.
 
- * Ping Li, Trevor J. Hastie, and Kenneth W. Church. 2006.
-   `Very sparse random projections. <https://web.stanford.edu/~hastie/Papers/Ping/KDD06_rp.pdf>`_
-   In Proceedings of the 12th ACM SIGKDD international conference on
-   Knowledge discovery and data mining (KDD '06). ACM, New York, NY, USA,
-   287-296.
+* Ping Li, Trevor J. Hastie, and Kenneth W. Church. 2006.
+  `Very sparse random projections. <https://web.stanford.edu/~hastie/Papers/Ping/KDD06_rp.pdf>`_
+  In Proceedings of the 12th ACM SIGKDD international conference on
+  Knowledge discovery and data mining (KDD '06). ACM, New York, NY, USA, 287-296.
 
 
 .. _random_projection_inverse_transform:
diff --git a/doc/modules/semi_supervised.rst b/doc/modules/semi_supervised.rst
index f8cae0a9ddcdf..8ba33638c6eec 100644
--- a/doc/modules/semi_supervised.rst
+++ b/doc/modules/semi_supervised.rst
@@ -60,18 +60,18 @@ until all samples have labels or no new samples are selected in that iteration.
    When using the self-training classifier, the
    :ref:`calibration <calibration>` of the classifier is important.
 
-.. topic:: Examples
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_semi_supervised_plot_self_training_varying_threshold.py`
-  * :ref:`sphx_glr_auto_examples_semi_supervised_plot_semi_supervised_versus_svm_iris.py`
+* :ref:`sphx_glr_auto_examples_semi_supervised_plot_self_training_varying_threshold.py`
+* :ref:`sphx_glr_auto_examples_semi_supervised_plot_semi_supervised_versus_svm_iris.py`
 
-.. topic:: References
+.. rubric:: References
 
-    .. [1] :doi:`"Unsupervised word sense disambiguation rivaling supervised methods"
-       <10.3115/981658.981684>`
-       David Yarowsky, Proceedings of the 33rd annual meeting on Association for
-       Computational Linguistics (ACL '95). Association for Computational Linguistics,
-       Stroudsburg, PA, USA, 189-196.
+.. [1] :doi:`"Unsupervised word sense disambiguation rivaling supervised methods"
+    <10.3115/981658.981684>`
+    David Yarowsky, Proceedings of the 33rd annual meeting on Association for
+    Computational Linguistics (ACL '95). Association for Computational Linguistics,
+    Stroudsburg, PA, USA, 189-196.
 
 .. _label_propagation:
 
@@ -134,18 +134,18 @@ algorithm can lead to prohibitively long running times. On the other hand,
 the KNN kernel will produce a much more memory-friendly sparse matrix
 which can drastically reduce running times.
 
-.. topic:: Examples
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_semi_supervised_plot_semi_supervised_versus_svm_iris.py`
-  * :ref:`sphx_glr_auto_examples_semi_supervised_plot_label_propagation_structure.py`
-  * :ref:`sphx_glr_auto_examples_semi_supervised_plot_label_propagation_digits.py`
-  * :ref:`sphx_glr_auto_examples_semi_supervised_plot_label_propagation_digits_active_learning.py`
+* :ref:`sphx_glr_auto_examples_semi_supervised_plot_semi_supervised_versus_svm_iris.py`
+* :ref:`sphx_glr_auto_examples_semi_supervised_plot_label_propagation_structure.py`
+* :ref:`sphx_glr_auto_examples_semi_supervised_plot_label_propagation_digits.py`
+* :ref:`sphx_glr_auto_examples_semi_supervised_plot_label_propagation_digits_active_learning.py`
 
-.. topic:: References
+.. rubric:: References
 
-    [2] Yoshua Bengio, Olivier Delalleau, Nicolas Le Roux. In Semi-Supervised
-    Learning (2006), pp. 193-216
+[2] Yoshua Bengio, Olivier Delalleau, Nicolas Le Roux. In Semi-Supervised
+Learning (2006), pp. 193-216
 
-    [3] Olivier Delalleau, Yoshua Bengio, Nicolas Le Roux. Efficient
-    Non-Parametric Function Induction in Semi-Supervised Learning. AISTAT 2005
-    https://www.gatsby.ucl.ac.uk/aistats/fullpapers/204.pdf
+[3] Olivier Delalleau, Yoshua Bengio, Nicolas Le Roux. Efficient
+Non-Parametric Function Induction in Semi-Supervised Learning. AISTAT 2005
+https://www.gatsby.ucl.ac.uk/aistats/fullpapers/204.pdf
diff --git a/doc/modules/sgd.rst b/doc/modules/sgd.rst
index a7981e9d4ec28..73df123b4ed19 100644
--- a/doc/modules/sgd.rst
+++ b/doc/modules/sgd.rst
@@ -189,14 +189,14 @@ For classification with a logistic loss, another variant of SGD with an
 averaging strategy is available with Stochastic Average Gradient (SAG)
 algorithm, available as a solver in :class:`LogisticRegression`.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- - :ref:`sphx_glr_auto_examples_linear_model_plot_sgd_separating_hyperplane.py`,
- - :ref:`sphx_glr_auto_examples_linear_model_plot_sgd_iris.py`
- - :ref:`sphx_glr_auto_examples_linear_model_plot_sgd_weighted_samples.py`
- - :ref:`sphx_glr_auto_examples_linear_model_plot_sgd_comparison.py`
- - :ref:`sphx_glr_auto_examples_svm_plot_separating_hyperplane_unbalanced.py`
-   (See the Note in the example)
+- :ref:`sphx_glr_auto_examples_linear_model_plot_sgd_separating_hyperplane.py`
+- :ref:`sphx_glr_auto_examples_linear_model_plot_sgd_iris.py`
+- :ref:`sphx_glr_auto_examples_linear_model_plot_sgd_weighted_samples.py`
+- :ref:`sphx_glr_auto_examples_linear_model_plot_sgd_comparison.py`
+- :ref:`sphx_glr_auto_examples_svm_plot_separating_hyperplane_unbalanced.py`
+  (See the Note in the example)
 
 Regression
 ==========
@@ -249,44 +249,40 @@ quadratic in the number of samples.
 with a large number of training samples (> 10,000) for which the SGD
 variant can be several orders of magnitude faster.
 
-|details-start|
-**Mathematical details**
-|details-split|
+.. dropdown:: Mathematical details
 
-Its implementation is based on the implementation of the stochastic
-gradient descent. Indeed, the original optimization problem of the One-Class
-SVM is given by
+  Its implementation is based on the implementation of the stochastic
+  gradient descent. Indeed, the original optimization problem of the One-Class
+  SVM is given by
 
-.. math::
-
-  \begin{aligned}
-  \min_{w, \rho, \xi} & \quad \frac{1}{2}\Vert w \Vert^2 - \rho + \frac{1}{\nu n} \sum_{i=1}^n \xi_i \\
-  \text{s.t.} & \quad \langle w, x_i \rangle \geq \rho - \xi_i \quad 1 \leq i \leq n \\
-  & \quad \xi_i \geq 0 \quad 1 \leq i \leq n
-  \end{aligned}
+  .. math::
 
-where :math:`\nu \in (0, 1]` is the user-specified parameter controlling the
-proportion of outliers and the proportion of support vectors. Getting rid of
-the slack variables :math:`\xi_i` this problem is equivalent to
+    \begin{aligned}
+    \min_{w, \rho, \xi} & \quad \frac{1}{2}\Vert w \Vert^2 - \rho + \frac{1}{\nu n} \sum_{i=1}^n \xi_i \\
+    \text{s.t.} & \quad \langle w, x_i \rangle \geq \rho - \xi_i \quad 1 \leq i \leq n \\
+    & \quad \xi_i \geq 0 \quad 1 \leq i \leq n
+    \end{aligned}
 
-.. math::
+  where :math:`\nu \in (0, 1]` is the user-specified parameter controlling the
+  proportion of outliers and the proportion of support vectors. Getting rid of
+  the slack variables :math:`\xi_i` this problem is equivalent to
 
-  \min_{w, \rho} \frac{1}{2}\Vert w \Vert^2 - \rho + \frac{1}{\nu n} \sum_{i=1}^n \max(0, \rho - \langle w, x_i \rangle) \, .
+  .. math::
 
-Multiplying by the constant :math:`\nu` and introducing the intercept
-:math:`b = 1 - \rho` we obtain the following equivalent optimization problem
+    \min_{w, \rho} \frac{1}{2}\Vert w \Vert^2 - \rho + \frac{1}{\nu n} \sum_{i=1}^n \max(0, \rho - \langle w, x_i \rangle) \, .
 
-.. math::
+  Multiplying by the constant :math:`\nu` and introducing the intercept
+  :math:`b = 1 - \rho` we obtain the following equivalent optimization problem
 
-  \min_{w, b} \frac{\nu}{2}\Vert w \Vert^2 + b\nu + \frac{1}{n} \sum_{i=1}^n \max(0, 1 - (\langle w, x_i \rangle + b)) \, .
+  .. math::
 
-This is similar to the optimization problems studied in section
-:ref:`sgd_mathematical_formulation` with :math:`y_i = 1, 1 \leq i \leq n` and
-:math:`\alpha = \nu/2`, :math:`L` being the hinge loss function and :math:`R`
-being the L2 norm. We just need to add the term :math:`b\nu` in the
-optimization loop.
+    \min_{w, b} \frac{\nu}{2}\Vert w \Vert^2 + b\nu + \frac{1}{n} \sum_{i=1}^n \max(0, 1 - (\langle w, x_i \rangle + b)) \, .
 
-|details-end|
+  This is similar to the optimization problems studied in section
+  :ref:`sgd_mathematical_formulation` with :math:`y_i = 1, 1 \leq i \leq n` and
+  :math:`\alpha = \nu/2`, :math:`L` being the hinge loss function and :math:`R`
+  being the L2 norm. We just need to add the term :math:`b\nu` in the
+  optimization loop.
 
 As :class:`SGDClassifier` and :class:`SGDRegressor`, :class:`SGDOneClassSVM`
 supports averaged SGD. Averaging can be enabled by setting ``average=True``.
@@ -305,9 +301,9 @@ efficiency, however, use the CSR
 matrix format as defined in `scipy.sparse.csr_matrix
 <https://docs.scipy.org/doc/scipy/reference/generated/scipy.sparse.csr_matrix.html>`_.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- - :ref:`sphx_glr_auto_examples_text_plot_document_classification_20newsgroups.py`
+- :ref:`sphx_glr_auto_examples_text_plot_document_classification_20newsgroups.py`
 
 Complexity
 ==========
@@ -385,11 +381,11 @@ Tips on Practical Use
 * We found that Averaged SGD works best with a larger number of features
   and a higher eta0.
 
-.. topic:: References:
+.. rubric:: References
 
- * `"Efficient BackProp" <http://yann.lecun.com/exdb/publis/pdf/lecun-98b.pdf>`_
-   Y. LeCun, L. Bottou, G. Orr, K. Müller - In Neural Networks: Tricks
-   of the Trade 1998.
+* `"Efficient BackProp" <http://yann.lecun.com/exdb/publis/pdf/lecun-98b.pdf>`_
+  Y. LeCun, L. Bottou, G. Orr, K. Müller - In Neural Networks: Tricks
+  of the Trade 1998.
 
 .. _sgd_mathematical_formulation:
 
@@ -416,32 +412,28 @@ where :math:`L` is a loss function that measures model (mis)fit and
 complexity; :math:`\alpha > 0` is a non-negative hyperparameter that controls
 the regularization strength.
 
-|details-start|
-**Loss functions details**
-|details-split|
-
-Different choices for :math:`L` entail different classifiers or regressors:
-
-- Hinge (soft-margin): equivalent to Support Vector Classification.
-  :math:`L(y_i, f(x_i)) = \max(0, 1 - y_i f(x_i))`.
-- Perceptron:
-  :math:`L(y_i, f(x_i)) = \max(0, - y_i f(x_i))`.
-- Modified Huber:
-  :math:`L(y_i, f(x_i)) = \max(0, 1 - y_i f(x_i))^2` if :math:`y_i f(x_i) >
-  -1`, and :math:`L(y_i, f(x_i)) = -4 y_i f(x_i)` otherwise.
-- Log Loss: equivalent to Logistic Regression.
-  :math:`L(y_i, f(x_i)) = \log(1 + \exp (-y_i f(x_i)))`.
-- Squared Error: Linear regression (Ridge or Lasso depending on
-  :math:`R`).
-  :math:`L(y_i, f(x_i)) = \frac{1}{2}(y_i - f(x_i))^2`.
-- Huber: less sensitive to outliers than least-squares. It is equivalent to
-  least squares when :math:`|y_i - f(x_i)| \leq \varepsilon`, and
-  :math:`L(y_i, f(x_i)) = \varepsilon |y_i - f(x_i)| - \frac{1}{2}
-  \varepsilon^2` otherwise.
-- Epsilon-Insensitive: (soft-margin) equivalent to Support Vector Regression.
-  :math:`L(y_i, f(x_i)) = \max(0, |y_i - f(x_i)| - \varepsilon)`.
-
-|details-end|
+.. dropdown:: Loss functions details
+
+  Different choices for :math:`L` entail different classifiers or regressors:
+
+  - Hinge (soft-margin): equivalent to Support Vector Classification.
+    :math:`L(y_i, f(x_i)) = \max(0, 1 - y_i f(x_i))`.
+  - Perceptron:
+    :math:`L(y_i, f(x_i)) = \max(0, - y_i f(x_i))`.
+  - Modified Huber:
+    :math:`L(y_i, f(x_i)) = \max(0, 1 - y_i f(x_i))^2` if :math:`y_i f(x_i) >
+    -1`, and :math:`L(y_i, f(x_i)) = -4 y_i f(x_i)` otherwise.
+  - Log Loss: equivalent to Logistic Regression.
+    :math:`L(y_i, f(x_i)) = \log(1 + \exp (-y_i f(x_i)))`.
+  - Squared Error: Linear regression (Ridge or Lasso depending on
+    :math:`R`).
+    :math:`L(y_i, f(x_i)) = \frac{1}{2}(y_i - f(x_i))^2`.
+  - Huber: less sensitive to outliers than least-squares. It is equivalent to
+    least squares when :math:`|y_i - f(x_i)| \leq \varepsilon`, and
+    :math:`L(y_i, f(x_i)) = \varepsilon |y_i - f(x_i)| - \frac{1}{2}
+    \varepsilon^2` otherwise.
+  - Epsilon-Insensitive: (soft-margin) equivalent to Support Vector Regression.
+    :math:`L(y_i, f(x_i)) = \max(0, |y_i - f(x_i)| - \varepsilon)`.
 
 All of the above loss functions can be regarded as an upper bound on the
 misclassification error (Zero-one loss) as shown in the Figure below.
@@ -553,32 +545,29 @@ We use the truncated gradient algorithm proposed in [#3]_
 for L1 regularization (and the Elastic Net).
 The code is written in Cython.
 
-.. topic:: References:
+.. rubric:: References
 
-   .. [#1] `"Stochastic Gradient Descent"
-       <https://leon.bottou.org/projects/sgd>`_ L. Bottou - Website, 2010.
+.. [#1] `"Stochastic Gradient Descent"
+  <https://leon.bottou.org/projects/sgd>`_ L. Bottou - Website, 2010.
 
-   .. [#2] :doi:`"Pegasos: Primal estimated sub-gradient solver for svm"
-      <10.1145/1273496.1273598>`
-      S. Shalev-Shwartz, Y. Singer, N. Srebro - In Proceedings of ICML '07.
+.. [#2] :doi:`"Pegasos: Primal estimated sub-gradient solver for svm"
+  <10.1145/1273496.1273598>`
+  S. Shalev-Shwartz, Y. Singer, N. Srebro - In Proceedings of ICML '07.
 
-   .. [#3] `"Stochastic gradient descent training for l1-regularized
-      log-linear models with cumulative penalty"
-      <https://www.aclweb.org/anthology/P/P09/P09-1054.pdf>`_
-      Y. Tsuruoka, J. Tsujii, S. Ananiadou - In Proceedings of the AFNLP/ACL
-      '09.
+.. [#3] `"Stochastic gradient descent training for l1-regularized
+  log-linear models with cumulative penalty"
+  <https://www.aclweb.org/anthology/P/P09/P09-1054.pdf>`_
+  Y. Tsuruoka, J. Tsujii, S. Ananiadou - In Proceedings of the AFNLP/ACL'09.
 
-   .. [#4] :arxiv:`"Towards Optimal One Pass Large Scale Learning with
-      Averaged Stochastic Gradient Descent"
-      <1107.2490v2>`
-      Xu, Wei (2011)
+.. [#4] :arxiv:`"Towards Optimal One Pass Large Scale Learning with
+  Averaged Stochastic Gradient Descent"
+  <1107.2490v2>`. Xu, Wei (2011)
 
-   .. [#5] :doi:`"Regularization and variable selection via the elastic net"
-      <10.1111/j.1467-9868.2005.00503.x>`
-      H. Zou, T. Hastie - Journal of the Royal Statistical Society Series B,
-      67 (2), 301-320.
+.. [#5] :doi:`"Regularization and variable selection via the elastic net"
+  <10.1111/j.1467-9868.2005.00503.x>`
+  H. Zou, T. Hastie - Journal of the Royal Statistical Society Series B,
+  67 (2), 301-320.
 
-   .. [#6] :doi:`"Solving large scale linear prediction problems using stochastic
-      gradient descent algorithms"
-      <10.1145/1015330.1015332>`
-      T. Zhang - In Proceedings of ICML '04.
+.. [#6] :doi:`"Solving large scale linear prediction problems using stochastic
+  gradient descent algorithms" <10.1145/1015330.1015332>`
+  T. Zhang - In Proceedings of ICML '04.
diff --git a/doc/modules/svm.rst b/doc/modules/svm.rst
index 32fb9fe3e7d84..47115e43a89e0 100644
--- a/doc/modules/svm.rst
+++ b/doc/modules/svm.rst
@@ -108,11 +108,10 @@ properties of these support vectors can be found in attributes
     >>> clf.n_support_
     array([1, 1]...)
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_svm_plot_separating_hyperplane.py`,
- * :ref:`sphx_glr_auto_examples_svm_plot_svm_nonlinear.py`
- * :ref:`sphx_glr_auto_examples_svm_plot_svm_anova.py`,
+* :ref:`sphx_glr_auto_examples_svm_plot_separating_hyperplane.py`
+* :ref:`sphx_glr_auto_examples_svm_plot_svm_anova.py`
 
 .. _svm_multi_class:
 
@@ -144,9 +143,9 @@ function of shape ``(n_samples, n_classes)``.
 On the other hand, :class:`LinearSVC` implements "one-vs-the-rest"
 multi-class strategy, thus training `n_classes` models.
 
-    >>> lin_clf = svm.LinearSVC(dual="auto")
+    >>> lin_clf = svm.LinearSVC()
     >>> lin_clf.fit(X, Y)
-    LinearSVC(dual='auto')
+    LinearSVC()
     >>> dec = lin_clf.decision_function([[1]])
     >>> dec.shape[1]
     4
@@ -154,65 +153,61 @@ multi-class strategy, thus training `n_classes` models.
 See :ref:`svm_mathematical_formulation` for a complete description of
 the decision function.
 
-|details-start|
-**Details on multi-class strategies**
-|details-split|
-
-Note that the :class:`LinearSVC` also implements an alternative multi-class
-strategy, the so-called multi-class SVM formulated by Crammer and Singer
-[#8]_, by using the option ``multi_class='crammer_singer'``. In practice,
-one-vs-rest classification is usually preferred, since the results are mostly
-similar, but the runtime is significantly less.
-
-For "one-vs-rest" :class:`LinearSVC` the attributes ``coef_`` and ``intercept_``
-have the shape ``(n_classes, n_features)`` and ``(n_classes,)`` respectively.
-Each row of the coefficients corresponds to one of the ``n_classes``
-"one-vs-rest" classifiers and similar for the intercepts, in the
-order of the "one" class.
-
-In the case of "one-vs-one" :class:`SVC` and :class:`NuSVC`, the layout of
-the attributes is a little more involved. In the case of a linear
-kernel, the attributes ``coef_`` and ``intercept_`` have the shape
-``(n_classes * (n_classes - 1) / 2, n_features)`` and ``(n_classes *
-(n_classes - 1) / 2)`` respectively. This is similar to the layout for
-:class:`LinearSVC` described above, with each row now corresponding
-to a binary classifier. The order for classes
-0 to n is "0 vs 1", "0 vs 2" , ... "0 vs n", "1 vs 2", "1 vs 3", "1 vs n", . .
-. "n-1 vs n".
-
-The shape of ``dual_coef_`` is ``(n_classes-1, n_SV)`` with
-a somewhat hard to grasp layout.
-The columns correspond to the support vectors involved in any
-of the ``n_classes * (n_classes - 1) / 2`` "one-vs-one" classifiers.
-Each support vector ``v`` has a dual coefficient in each of the
-``n_classes - 1`` classifiers comparing the class of ``v`` against another class.
-Note that some, but not all, of these dual coefficients, may be zero.
-The ``n_classes - 1`` entries in each column are these dual coefficients,
-ordered by the opposing class.
-
-This might be clearer with an example: consider a three class problem with
-class 0 having three support vectors
-:math:`v^{0}_0, v^{1}_0, v^{2}_0` and class 1 and 2 having two support vectors
-:math:`v^{0}_1, v^{1}_1` and :math:`v^{0}_2, v^{1}_2` respectively.  For each
-support vector :math:`v^{j}_i`, there are two dual coefficients.  Let's call
-the coefficient of support vector :math:`v^{j}_i` in the classifier between
-classes :math:`i` and :math:`k` :math:`\alpha^{j}_{i,k}`.
-Then ``dual_coef_`` looks like this:
-
-+------------------------+------------------------+------------------------+------------------------+------------------------+------------------------+------------------------+
-|:math:`\alpha^{0}_{0,1}`|:math:`\alpha^{1}_{0,1}`|:math:`\alpha^{2}_{0,1}`|:math:`\alpha^{0}_{1,0}`|:math:`\alpha^{1}_{1,0}`|:math:`\alpha^{0}_{2,0}`|:math:`\alpha^{1}_{2,0}`|
-+------------------------+------------------------+------------------------+------------------------+------------------------+------------------------+------------------------+
-|:math:`\alpha^{0}_{0,2}`|:math:`\alpha^{1}_{0,2}`|:math:`\alpha^{2}_{0,2}`|:math:`\alpha^{0}_{1,2}`|:math:`\alpha^{1}_{1,2}`|:math:`\alpha^{0}_{2,1}`|:math:`\alpha^{1}_{2,1}`|
-+------------------------+------------------------+------------------------+------------------------+------------------------+------------------------+------------------------+
-|Coefficients                                                              |Coefficients                                     |Coefficients                                     |
-|for SVs of class 0                                                        |for SVs of class 1                               |for SVs of class 2                               |
-+--------------------------------------------------------------------------+-------------------------------------------------+-------------------------------------------------+
-
-|details-end|
-
-.. topic:: Examples:
-
- * :ref:`sphx_glr_auto_examples_svm_plot_iris_svc.py`,
+.. dropdown:: Details on multi-class strategies
+
+  Note that the :class:`LinearSVC` also implements an alternative multi-class
+  strategy, the so-called multi-class SVM formulated by Crammer and Singer
+  [#8]_, by using the option ``multi_class='crammer_singer'``. In practice,
+  one-vs-rest classification is usually preferred, since the results are mostly
+  similar, but the runtime is significantly less.
+
+  For "one-vs-rest" :class:`LinearSVC` the attributes ``coef_`` and ``intercept_``
+  have the shape ``(n_classes, n_features)`` and ``(n_classes,)`` respectively.
+  Each row of the coefficients corresponds to one of the ``n_classes``
+  "one-vs-rest" classifiers and similar for the intercepts, in the
+  order of the "one" class.
+
+  In the case of "one-vs-one" :class:`SVC` and :class:`NuSVC`, the layout of
+  the attributes is a little more involved. In the case of a linear
+  kernel, the attributes ``coef_`` and ``intercept_`` have the shape
+  ``(n_classes * (n_classes - 1) / 2, n_features)`` and ``(n_classes *
+  (n_classes - 1) / 2)`` respectively. This is similar to the layout for
+  :class:`LinearSVC` described above, with each row now corresponding
+  to a binary classifier. The order for classes
+  0 to n is "0 vs 1", "0 vs 2" , ... "0 vs n", "1 vs 2", "1 vs 3", "1 vs n", . .
+  . "n-1 vs n".
+
+  The shape of ``dual_coef_`` is ``(n_classes-1, n_SV)`` with
+  a somewhat hard to grasp layout.
+  The columns correspond to the support vectors involved in any
+  of the ``n_classes * (n_classes - 1) / 2`` "one-vs-one" classifiers.
+  Each support vector ``v`` has a dual coefficient in each of the
+  ``n_classes - 1`` classifiers comparing the class of ``v`` against another class.
+  Note that some, but not all, of these dual coefficients, may be zero.
+  The ``n_classes - 1`` entries in each column are these dual coefficients,
+  ordered by the opposing class.
+
+  This might be clearer with an example: consider a three class problem with
+  class 0 having three support vectors
+  :math:`v^{0}_0, v^{1}_0, v^{2}_0` and class 1 and 2 having two support vectors
+  :math:`v^{0}_1, v^{1}_1` and :math:`v^{0}_2, v^{1}_2` respectively.  For each
+  support vector :math:`v^{j}_i`, there are two dual coefficients.  Let's call
+  the coefficient of support vector :math:`v^{j}_i` in the classifier between
+  classes :math:`i` and :math:`k` :math:`\alpha^{j}_{i,k}`.
+  Then ``dual_coef_`` looks like this:
+
+  +------------------------+------------------------+------------------------+------------------------+------------------------+------------------------+------------------------+
+  |:math:`\alpha^{0}_{0,1}`|:math:`\alpha^{1}_{0,1}`|:math:`\alpha^{2}_{0,1}`|:math:`\alpha^{0}_{1,0}`|:math:`\alpha^{1}_{1,0}`|:math:`\alpha^{0}_{2,0}`|:math:`\alpha^{1}_{2,0}`|
+  +------------------------+------------------------+------------------------+------------------------+------------------------+------------------------+------------------------+
+  |:math:`\alpha^{0}_{0,2}`|:math:`\alpha^{1}_{0,2}`|:math:`\alpha^{2}_{0,2}`|:math:`\alpha^{0}_{1,2}`|:math:`\alpha^{1}_{1,2}`|:math:`\alpha^{0}_{2,1}`|:math:`\alpha^{1}_{2,1}`|
+  +------------------------+------------------------+------------------------+------------------------+------------------------+------------------------+------------------------+
+  |Coefficients                                                              |Coefficients                                     |Coefficients                                     |
+  |for SVs of class 0                                                        |for SVs of class 1                               |for SVs of class 2                               |
+  +--------------------------------------------------------------------------+-------------------------------------------------+-------------------------------------------------+
+
+.. rubric:: Examples
+
+* :ref:`sphx_glr_auto_examples_svm_plot_iris_svc.py`
 
 .. _scores_probabilities:
 
@@ -295,10 +290,10 @@ to the sample weights:
    :align: center
    :scale: 75
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_svm_plot_separating_hyperplane_unbalanced.py`
- * :ref:`sphx_glr_auto_examples_svm_plot_weighted_samples.py`,
+* :ref:`sphx_glr_auto_examples_svm_plot_separating_hyperplane_unbalanced.py`
+* :ref:`sphx_glr_auto_examples_svm_plot_weighted_samples.py`
 
 
 .. _svm_regression:
@@ -343,9 +338,9 @@ floating point values instead of integer values::
     array([1.5])
 
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_svm_plot_svm_regression.py`
+* :ref:`sphx_glr_auto_examples_svm_plot_svm_regression.py`
 
 .. _svm_outlier_detection:
 
@@ -516,10 +511,10 @@ Proper choice of ``C`` and ``gamma`` is critical to the SVM's performance.  One
 is advised to use :class:`~sklearn.model_selection.GridSearchCV` with
 ``C`` and ``gamma`` spaced exponentially far apart to choose good values.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_svm_plot_rbf_parameters.py`
- * :ref:`sphx_glr_auto_examples_svm_plot_svm_nonlinear.py`
+* :ref:`sphx_glr_auto_examples_svm_plot_rbf_parameters.py`
+* :ref:`sphx_glr_auto_examples_svm_plot_svm_scale_c.py`
 
 Custom Kernels
 --------------
@@ -538,60 +533,52 @@ classifiers, except that:
   use of ``fit()`` and ``predict()`` you will have unexpected results.
 
 
-|details-start|
-**Using Python functions as kernels**
-|details-split|
+.. dropdown:: Using Python functions as kernels
 
-You can use your own defined kernels by passing a function to the
-``kernel`` parameter.
+  You can use your own defined kernels by passing a function to the
+  ``kernel`` parameter.
 
-Your kernel must take as arguments two matrices of shape
-``(n_samples_1, n_features)``, ``(n_samples_2, n_features)``
-and return a kernel matrix of shape ``(n_samples_1, n_samples_2)``.
+  Your kernel must take as arguments two matrices of shape
+  ``(n_samples_1, n_features)``, ``(n_samples_2, n_features)``
+  and return a kernel matrix of shape ``(n_samples_1, n_samples_2)``.
 
-The following code defines a linear kernel and creates a classifier
-instance that will use that kernel::
+  The following code defines a linear kernel and creates a classifier
+  instance that will use that kernel::
 
-    >>> import numpy as np
-    >>> from sklearn import svm
-    >>> def my_kernel(X, Y):
-    ...     return np.dot(X, Y.T)
-    ...
-    >>> clf = svm.SVC(kernel=my_kernel)
-
-|details-end|
+      >>> import numpy as np
+      >>> from sklearn import svm
+      >>> def my_kernel(X, Y):
+      ...     return np.dot(X, Y.T)
+      ...
+      >>> clf = svm.SVC(kernel=my_kernel)
 
 
-|details-start|
-**Using the Gram matrix**
-|details-split|
+.. dropdown:: Using the Gram matrix
 
-You can pass pre-computed kernels by using the ``kernel='precomputed'``
-option. You should then pass Gram matrix instead of X to the `fit` and
-`predict` methods. The kernel values between *all* training vectors and the
-test vectors must be provided:
+  You can pass pre-computed kernels by using the ``kernel='precomputed'``
+  option. You should then pass Gram matrix instead of X to the `fit` and
+  `predict` methods. The kernel values between *all* training vectors and the
+  test vectors must be provided:
 
-    >>> import numpy as np
-    >>> from sklearn.datasets import make_classification
-    >>> from sklearn.model_selection import train_test_split
-    >>> from sklearn import svm
-    >>> X, y = make_classification(n_samples=10, random_state=0)
-    >>> X_train , X_test , y_train, y_test = train_test_split(X, y, random_state=0)
-    >>> clf = svm.SVC(kernel='precomputed')
-    >>> # linear kernel computation
-    >>> gram_train = np.dot(X_train, X_train.T)
-    >>> clf.fit(gram_train, y_train)
-    SVC(kernel='precomputed')
-    >>> # predict on training examples
-    >>> gram_test = np.dot(X_test, X_train.T)
-    >>> clf.predict(gram_test)
-    array([0, 1, 0])
+      >>> import numpy as np
+      >>> from sklearn.datasets import make_classification
+      >>> from sklearn.model_selection import train_test_split
+      >>> from sklearn import svm
+      >>> X, y = make_classification(n_samples=10, random_state=0)
+      >>> X_train , X_test , y_train, y_test = train_test_split(X, y, random_state=0)
+      >>> clf = svm.SVC(kernel='precomputed')
+      >>> # linear kernel computation
+      >>> gram_train = np.dot(X_train, X_train.T)
+      >>> clf.fit(gram_train, y_train)
+      SVC(kernel='precomputed')
+      >>> # predict on training examples
+      >>> gram_test = np.dot(X_test, X_train.T)
+      >>> clf.predict(gram_test)
+      array([0, 1, 0])
 
-|details-end|
+.. rubric:: Examples
 
-.. topic:: Examples:
-
- * :ref:`sphx_glr_auto_examples_svm_plot_custom_kernel.py`.
+* :ref:`sphx_glr_auto_examples_svm_plot_custom_kernel.py`
 
 .. _svm_mathematical_formulation:
 
@@ -688,43 +675,35 @@ term :math:`b`
     estimator used is :class:`~sklearn.linear_model.Ridge` regression,
     the relation between them is given as :math:`C = \frac{1}{alpha}`.
 
-|details-start|
-**LinearSVC**
-|details-split|
+.. dropdown:: LinearSVC
 
-The primal problem can be equivalently formulated as
+  The primal problem can be equivalently formulated as
 
-.. math::
+  .. math::
 
-    \min_ {w, b} \frac{1}{2} w^T w + C \sum_{i=1}^{n}\max(0, 1 - y_i (w^T \phi(x_i) + b)),
+      \min_ {w, b} \frac{1}{2} w^T w + C \sum_{i=1}^{n}\max(0, 1 - y_i (w^T \phi(x_i) + b)),
 
-where we make use of the `hinge loss
-<https://en.wikipedia.org/wiki/Hinge_loss>`_. This is the form that is
-directly optimized by :class:`LinearSVC`, but unlike the dual form, this one
-does not involve inner products between samples, so the famous kernel trick
-cannot be applied. This is why only the linear kernel is supported by
-:class:`LinearSVC` (:math:`\phi` is the identity function).
-
-|details-end|
+  where we make use of the `hinge loss
+  <https://en.wikipedia.org/wiki/Hinge_loss>`_. This is the form that is
+  directly optimized by :class:`LinearSVC`, but unlike the dual form, this one
+  does not involve inner products between samples, so the famous kernel trick
+  cannot be applied. This is why only the linear kernel is supported by
+  :class:`LinearSVC` (:math:`\phi` is the identity function).
 
 .. _nu_svc:
 
-|details-start|
-**NuSVC**
-|details-split|
-
-The :math:`\nu`-SVC formulation [#7]_ is a reparameterization of the
-:math:`C`-SVC and therefore mathematically equivalent.
+.. dropdown:: NuSVC
 
-We introduce a new parameter :math:`\nu` (instead of :math:`C`) which
-controls the number of support vectors and *margin errors*:
-:math:`\nu \in (0, 1]` is an upper bound on the fraction of margin errors and
-a lower bound of the fraction of support vectors. A margin error corresponds
-to a sample that lies on the wrong side of its margin boundary: it is either
-misclassified, or it is correctly classified but does not lie beyond the
-margin.
+  The :math:`\nu`-SVC formulation [#7]_ is a reparameterization of the
+  :math:`C`-SVC and therefore mathematically equivalent.
 
-|details-end|
+  We introduce a new parameter :math:`\nu` (instead of :math:`C`) which
+  controls the number of support vectors and *margin errors*:
+  :math:`\nu \in (0, 1]` is an upper bound on the fraction of margin errors and
+  a lower bound of the fraction of support vectors. A margin error corresponds
+  to a sample that lies on the wrong side of its margin boundary: it is either
+  misclassified, or it is correctly classified but does not lie beyond the
+  margin.
 
 SVR
 ---
@@ -773,21 +752,17 @@ which holds the difference :math:`\alpha_i - \alpha_i^*`, ``support_vectors_`` w
 holds the support vectors, and ``intercept_`` which holds the independent
 term :math:`b`
 
-|details-start|
-**LinearSVR**
-|details-split|
+.. dropdown:: LinearSVR
 
-The primal problem can be equivalently formulated as
-
-.. math::
+  The primal problem can be equivalently formulated as
 
-    \min_ {w, b} \frac{1}{2} w^T w + C \sum_{i=1}^{n}\max(0, |y_i - (w^T \phi(x_i) + b)| - \varepsilon),
+  .. math::
 
-where we make use of the epsilon-insensitive loss, i.e. errors of less than
-:math:`\varepsilon` are ignored. This is the form that is directly optimized
-by :class:`LinearSVR`.
+      \min_ {w, b} \frac{1}{2} w^T w + C \sum_{i=1}^{n}\max(0, |y_i - (w^T \phi(x_i) + b)| - \varepsilon),
 
-|details-end|
+  where we make use of the epsilon-insensitive loss, i.e. errors of less than
+  :math:`\varepsilon` are ignored. This is the form that is directly optimized
+  by :class:`LinearSVR`.
 
 .. _svm_implementation_details:
 
@@ -803,38 +778,37 @@ used, please refer to their respective papers.
 .. _`libsvm`: https://www.csie.ntu.edu.tw/~cjlin/libsvm/
 .. _`liblinear`: https://www.csie.ntu.edu.tw/~cjlin/liblinear/
 
-.. topic:: References:
+.. rubric:: References
 
-   .. [#1] Platt `"Probabilistic outputs for SVMs and comparisons to
-      regularized likelihood methods"
-      <https://www.cs.colorado.edu/~mozer/Teaching/syllabi/6622/papers/Platt1999.pdf>`_.
+.. [#1] Platt `"Probabilistic outputs for SVMs and comparisons to
+  regularized likelihood methods"
+  <https://www.cs.colorado.edu/~mozer/Teaching/syllabi/6622/papers/Platt1999.pdf>`_.
 
-   .. [#2] Wu, Lin and Weng, `"Probability estimates for multi-class
-      classification by pairwise coupling"
-      <https://www.csie.ntu.edu.tw/~cjlin/papers/svmprob/svmprob.pdf>`_, JMLR
-      5:975-1005, 2004.
+.. [#2] Wu, Lin and Weng, `"Probability estimates for multi-class
+  classification by pairwise coupling"
+  <https://www.csie.ntu.edu.tw/~cjlin/papers/svmprob/svmprob.pdf>`_,
+  JMLR 5:975-1005, 2004.
 
-   .. [#3] Fan, Rong-En, et al.,
-      `"LIBLINEAR: A library for large linear classification."
-      <https://www.csie.ntu.edu.tw/~cjlin/papers/liblinear.pdf>`_,
-      Journal of machine learning research 9.Aug (2008): 1871-1874.
+.. [#3] Fan, Rong-En, et al.,
+  `"LIBLINEAR: A library for large linear classification."
+  <https://www.csie.ntu.edu.tw/~cjlin/papers/liblinear.pdf>`_,
+  Journal of machine learning research 9.Aug (2008): 1871-1874.
 
-   .. [#4] Chang and Lin, `LIBSVM: A Library for Support Vector Machines
-      <https://www.csie.ntu.edu.tw/~cjlin/papers/libsvm.pdf>`_.
+.. [#4] Chang and Lin, `LIBSVM: A Library for Support Vector Machines
+  <https://www.csie.ntu.edu.tw/~cjlin/papers/libsvm.pdf>`_.
 
-   .. [#5] Bishop, `Pattern recognition and machine learning
-      <https://www.microsoft.com/en-us/research/uploads/prod/2006/01/Bishop-Pattern-Recognition-and-Machine-Learning-2006.pdf>`_,
-      chapter 7 Sparse Kernel Machines
+.. [#5] Bishop, `Pattern recognition and machine learning
+  <https://www.microsoft.com/en-us/research/uploads/prod/2006/01/Bishop-Pattern-Recognition-and-Machine-Learning-2006.pdf>`_,
+  chapter 7 Sparse Kernel Machines
 
-   .. [#6] :doi:`"A Tutorial on Support Vector Regression"
-      <10.1023/B:STCO.0000035301.49549.88>`
-      Alex J. Smola, Bernhard Schölkopf - Statistics and Computing archive
-      Volume 14 Issue 3, August 2004, p. 199-222.
+.. [#6] :doi:`"A Tutorial on Support Vector Regression"
+  <10.1023/B:STCO.0000035301.49549.88>`
+  Alex J. Smola, Bernhard Schölkopf - Statistics and Computing archive
+  Volume 14 Issue 3, August 2004, p. 199-222.
 
-   .. [#7] Schölkopf et. al `New Support Vector Algorithms
-      <https://www.stat.purdue.edu/~yuzhu/stat598m3/Papers/NewSVM.pdf>`_
+.. [#7] Schölkopf et. al `New Support Vector Algorithms
+  <https://www.stat.purdue.edu/~yuzhu/stat598m3/Papers/NewSVM.pdf>`_
 
-   .. [#8] Crammer and Singer `On the Algorithmic Implementation ofMulticlass
-      Kernel-based Vector Machines
-      <http://jmlr.csail.mit.edu/papers/volume2/crammer01a/crammer01a.pdf>`_,
-      JMLR 2001.
+.. [#8] Crammer and Singer `On the Algorithmic Implementation ofMulticlass
+  Kernel-based Vector Machines
+  <http://jmlr.csail.mit.edu/papers/volume2/crammer01a/crammer01a.pdf>`_, JMLR 2001.
diff --git a/doc/modules/tree.rst b/doc/modules/tree.rst
index b54b913573a34..371cfccfffc1b 100644
--- a/doc/modules/tree.rst
+++ b/doc/modules/tree.rst
@@ -146,82 +146,78 @@ Once trained, you can plot the tree with the :func:`plot_tree` function::
    :scale: 75
    :align: center
 
-|details-start|
-**Alternative ways to export trees**
-|details-split|
-
-We can also export the tree in `Graphviz
-<https://www.graphviz.org/>`_ format using the :func:`export_graphviz`
-exporter. If you use the `conda <https://conda.io>`_ package manager, the graphviz binaries
-and the python package can be installed with `conda install python-graphviz`.
-
-Alternatively binaries for graphviz can be downloaded from the graphviz project homepage,
-and the Python wrapper installed from pypi with `pip install graphviz`.
-
-Below is an example graphviz export of the above tree trained on the entire
-iris dataset; the results are saved in an output file `iris.pdf`::
-
-
-    >>> import graphviz # doctest: +SKIP
-    >>> dot_data = tree.export_graphviz(clf, out_file=None) # doctest: +SKIP
-    >>> graph = graphviz.Source(dot_data) # doctest: +SKIP
-    >>> graph.render("iris") # doctest: +SKIP
-
-The :func:`export_graphviz` exporter also supports a variety of aesthetic
-options, including coloring nodes by their class (or value for regression) and
-using explicit variable and class names if desired. Jupyter notebooks also
-render these plots inline automatically::
-
-    >>> dot_data = tree.export_graphviz(clf, out_file=None, # doctest: +SKIP
-    ...                      feature_names=iris.feature_names,  # doctest: +SKIP
-    ...                      class_names=iris.target_names,  # doctest: +SKIP
-    ...                      filled=True, rounded=True,  # doctest: +SKIP
-    ...                      special_characters=True)  # doctest: +SKIP
-    >>> graph = graphviz.Source(dot_data)  # doctest: +SKIP
-    >>> graph # doctest: +SKIP
-
-.. only:: html
-
-    .. figure:: ../images/iris.svg
-       :align: center
-
-.. only:: latex
-
-    .. figure:: ../images/iris.pdf
-       :align: center
-
-.. figure:: ../auto_examples/tree/images/sphx_glr_plot_iris_dtc_001.png
-   :target: ../auto_examples/tree/plot_iris_dtc.html
-   :align: center
-   :scale: 75
-
-Alternatively, the tree can also be exported in textual format with the
-function :func:`export_text`. This method doesn't require the installation
-of external libraries and is more compact:
-
-    >>> from sklearn.datasets import load_iris
-    >>> from sklearn.tree import DecisionTreeClassifier
-    >>> from sklearn.tree import export_text
-    >>> iris = load_iris()
-    >>> decision_tree = DecisionTreeClassifier(random_state=0, max_depth=2)
-    >>> decision_tree = decision_tree.fit(iris.data, iris.target)
-    >>> r = export_text(decision_tree, feature_names=iris['feature_names'])
-    >>> print(r)
-    |--- petal width (cm) <= 0.80
-    |   |--- class: 0
-    |--- petal width (cm) >  0.80
-    |   |--- petal width (cm) <= 1.75
-    |   |   |--- class: 1
-    |   |--- petal width (cm) >  1.75
-    |   |   |--- class: 2
-    <BLANKLINE>
-
-|details-end|
-
-.. topic:: Examples:
-
- * :ref:`sphx_glr_auto_examples_tree_plot_iris_dtc.py`
- * :ref:`sphx_glr_auto_examples_tree_plot_unveil_tree_structure.py`
+.. dropdown:: Alternative ways to export trees
+
+  We can also export the tree in `Graphviz
+  <https://www.graphviz.org/>`_ format using the :func:`export_graphviz`
+  exporter. If you use the `conda <https://conda.io>`_ package manager, the graphviz binaries
+  and the python package can be installed with `conda install python-graphviz`.
+
+  Alternatively binaries for graphviz can be downloaded from the graphviz project homepage,
+  and the Python wrapper installed from pypi with `pip install graphviz`.
+
+  Below is an example graphviz export of the above tree trained on the entire
+  iris dataset; the results are saved in an output file `iris.pdf`::
+
+
+      >>> import graphviz # doctest: +SKIP
+      >>> dot_data = tree.export_graphviz(clf, out_file=None) # doctest: +SKIP
+      >>> graph = graphviz.Source(dot_data) # doctest: +SKIP
+      >>> graph.render("iris") # doctest: +SKIP
+
+  The :func:`export_graphviz` exporter also supports a variety of aesthetic
+  options, including coloring nodes by their class (or value for regression) and
+  using explicit variable and class names if desired. Jupyter notebooks also
+  render these plots inline automatically::
+
+      >>> dot_data = tree.export_graphviz(clf, out_file=None, # doctest: +SKIP
+      ...                      feature_names=iris.feature_names,  # doctest: +SKIP
+      ...                      class_names=iris.target_names,  # doctest: +SKIP
+      ...                      filled=True, rounded=True,  # doctest: +SKIP
+      ...                      special_characters=True)  # doctest: +SKIP
+      >>> graph = graphviz.Source(dot_data)  # doctest: +SKIP
+      >>> graph # doctest: +SKIP
+
+  .. only:: html
+
+      .. figure:: ../images/iris.svg
+        :align: center
+
+  .. only:: latex
+
+      .. figure:: ../images/iris.pdf
+        :align: center
+
+  .. figure:: ../auto_examples/tree/images/sphx_glr_plot_iris_dtc_001.png
+    :target: ../auto_examples/tree/plot_iris_dtc.html
+    :align: center
+    :scale: 75
+
+  Alternatively, the tree can also be exported in textual format with the
+  function :func:`export_text`. This method doesn't require the installation
+  of external libraries and is more compact:
+
+      >>> from sklearn.datasets import load_iris
+      >>> from sklearn.tree import DecisionTreeClassifier
+      >>> from sklearn.tree import export_text
+      >>> iris = load_iris()
+      >>> decision_tree = DecisionTreeClassifier(random_state=0, max_depth=2)
+      >>> decision_tree = decision_tree.fit(iris.data, iris.target)
+      >>> r = export_text(decision_tree, feature_names=iris['feature_names'])
+      >>> print(r)
+      |--- petal width (cm) <= 0.80
+      |   |--- class: 0
+      |--- petal width (cm) >  0.80
+      |   |--- petal width (cm) <= 1.75
+      |   |   |--- class: 1
+      |   |--- petal width (cm) >  1.75
+      |   |   |--- class: 2
+      <BLANKLINE>
+
+.. rubric:: Examples
+
+* :ref:`sphx_glr_auto_examples_tree_plot_iris_dtc.py`
+* :ref:`sphx_glr_auto_examples_tree_plot_unveil_tree_structure.py`
 
 .. _tree_regression:
 
@@ -248,9 +244,9 @@ instead of integer values::
     >>> clf.predict([[1, 1]])
     array([0.5])
 
-.. topic:: Examples:
+.. rubric:: Examples
 
- * :ref:`sphx_glr_auto_examples_tree_plot_tree_regression.py`
+* :ref:`sphx_glr_auto_examples_tree_plot_tree_regression.py`
 
 
 .. _tree_multioutput:
@@ -306,21 +302,17 @@ the lower half of those faces.
    :scale: 75
    :align: center
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-  * :ref:`sphx_glr_auto_examples_tree_plot_tree_regression_multioutput.py`
-  * :ref:`sphx_glr_auto_examples_miscellaneous_plot_multioutput_face_completion.py`
+* :ref:`sphx_glr_auto_examples_tree_plot_tree_regression_multioutput.py`
+* :ref:`sphx_glr_auto_examples_miscellaneous_plot_multioutput_face_completion.py`
 
-|details-start|
-**References**
-|details-split|
+.. rubric:: References
 
 * M. Dumont et al,  `Fast multi-class image annotation with random subwindows
   and multiple output randomized trees
-  <http://www.montefiore.ulg.ac.be/services/stochastic/pubs/2009/DMWG09/dumont-visapp09-shortpaper.pdf>`_, International Conference on
-  Computer Vision Theory and Applications 2009
-
-|details-end|
+  <http://www.montefiore.ulg.ac.be/services/stochastic/pubs/2009/DMWG09/dumont-visapp09-shortpaper.pdf>`_,
+  International Conference on Computer Vision Theory and Applications 2009
 
 .. _tree_complexity:
 
@@ -412,36 +404,32 @@ Tree algorithms: ID3, C4.5, C5.0 and CART
 What are all the various decision tree algorithms and how do they differ
 from each other? Which one is implemented in scikit-learn?
 
-|details-start|
-**Various decision tree algorithms**
-|details-split|
-
-ID3_ (Iterative Dichotomiser 3) was developed in 1986 by Ross Quinlan.
-The algorithm creates a multiway tree, finding for each node (i.e. in
-a greedy manner) the categorical feature that will yield the largest
-information gain for categorical targets. Trees are grown to their
-maximum size and then a pruning step is usually applied to improve the
-ability of the tree to generalize to unseen data.
-
-C4.5 is the successor to ID3 and removed the restriction that features
-must be categorical by dynamically defining a discrete attribute (based
-on numerical variables) that partitions the continuous attribute value
-into a discrete set of intervals. C4.5 converts the trained trees
-(i.e. the output of the ID3 algorithm) into sets of if-then rules.
-The accuracy of each rule is then evaluated to determine the order
-in which they should be applied. Pruning is done by removing a rule's
-precondition if the accuracy of the rule improves without it.
-
-C5.0 is Quinlan's latest version release under a proprietary license.
-It uses less memory and builds smaller rulesets than C4.5 while being
-more accurate.
-
-CART (Classification and Regression Trees) is very similar to C4.5, but
-it differs in that it supports numerical target variables (regression) and
-does not compute rule sets. CART constructs binary trees using the feature
-and threshold that yield the largest information gain at each node.
-
-|details-end|
+.. dropdown:: Various decision tree algorithms
+
+  ID3_ (Iterative Dichotomiser 3) was developed in 1986 by Ross Quinlan.
+  The algorithm creates a multiway tree, finding for each node (i.e. in
+  a greedy manner) the categorical feature that will yield the largest
+  information gain for categorical targets. Trees are grown to their
+  maximum size and then a pruning step is usually applied to improve the
+  ability of the tree to generalize to unseen data.
+
+  C4.5 is the successor to ID3 and removed the restriction that features
+  must be categorical by dynamically defining a discrete attribute (based
+  on numerical variables) that partitions the continuous attribute value
+  into a discrete set of intervals. C4.5 converts the trained trees
+  (i.e. the output of the ID3 algorithm) into sets of if-then rules.
+  The accuracy of each rule is then evaluated to determine the order
+  in which they should be applied. Pruning is done by removing a rule's
+  precondition if the accuracy of the rule improves without it.
+
+  C5.0 is Quinlan's latest version release under a proprietary license.
+  It uses less memory and builds smaller rulesets than C4.5 while being
+  more accurate.
+
+  CART (Classification and Regression Trees) is very similar to C4.5, but
+  it differs in that it supports numerical target variables (regression) and
+  does not compute rule sets. CART constructs binary trees using the feature
+  and threshold that yield the largest information gain at each node.
 
 scikit-learn uses an optimized version of the CART algorithm; however, the
 scikit-learn implementation does not support categorical variables for now.
@@ -515,39 +503,35 @@ Log Loss or Entropy:
 
     H(Q_m) = - \sum_k p_{mk} \log(p_{mk})
 
-|details-start|
-**Shannon entropy**
-|details-split|
+.. dropdown:: Shannon entropy
 
-The entropy criterion computes the Shannon entropy of the possible classes. It
-takes the class frequencies of the training data points that reached a given
-leaf :math:`m` as their probability. Using the **Shannon entropy as tree node
-splitting criterion is equivalent to minimizing the log loss** (also known as
-cross-entropy and multinomial deviance) between the true labels :math:`y_i`
-and the probabilistic predictions :math:`T_k(x_i)` of the tree model :math:`T` for class :math:`k`.
+  The entropy criterion computes the Shannon entropy of the possible classes. It
+  takes the class frequencies of the training data points that reached a given
+  leaf :math:`m` as their probability. Using the **Shannon entropy as tree node
+  splitting criterion is equivalent to minimizing the log loss** (also known as
+  cross-entropy and multinomial deviance) between the true labels :math:`y_i`
+  and the probabilistic predictions :math:`T_k(x_i)` of the tree model :math:`T` for class :math:`k`.
 
-To see this, first recall that the log loss of a tree model :math:`T`
-computed on a dataset :math:`D` is defined as follows:
+  To see this, first recall that the log loss of a tree model :math:`T`
+  computed on a dataset :math:`D` is defined as follows:
 
-.. math::
-
-    \mathrm{LL}(D, T) = -\frac{1}{n} \sum_{(x_i, y_i) \in D} \sum_k I(y_i = k) \log(T_k(x_i))
+  .. math::
 
-where :math:`D` is a training dataset of :math:`n` pairs :math:`(x_i, y_i)`.
+      \mathrm{LL}(D, T) = -\frac{1}{n} \sum_{(x_i, y_i) \in D} \sum_k I(y_i = k) \log(T_k(x_i))
 
-In a classification tree, the predicted class probabilities within leaf nodes
-are constant, that is: for all :math:`(x_i, y_i) \in Q_m`, one has:
-:math:`T_k(x_i) = p_{mk}` for each class :math:`k`.
+  where :math:`D` is a training dataset of :math:`n` pairs :math:`(x_i, y_i)`.
 
-This property makes it possible to rewrite :math:`\mathrm{LL}(D, T)` as the
-sum of the Shannon entropies computed for each leaf of :math:`T` weighted by
-the number of training data points that reached each leaf:
+  In a classification tree, the predicted class probabilities within leaf nodes
+  are constant, that is: for all :math:`(x_i, y_i) \in Q_m`, one has:
+  :math:`T_k(x_i) = p_{mk}` for each class :math:`k`.
 
-.. math::
+  This property makes it possible to rewrite :math:`\mathrm{LL}(D, T)` as the
+  sum of the Shannon entropies computed for each leaf of :math:`T` weighted by
+  the number of training data points that reached each leaf:
 
-    \mathrm{LL}(D, T) = \sum_{m \in T} \frac{n_m}{n} H(Q_m)
+  .. math::
 
-|details-end|
+      \mathrm{LL}(D, T) = \sum_{m \in T} \frac{n_m}{n} H(Q_m)
 
 Regression criteria
 -------------------
@@ -595,11 +579,21 @@ Note that it fits much slower than the MSE criterion.
 Missing Values Support
 ======================
 
-:class:`DecisionTreeClassifier` and :class:`DecisionTreeRegressor`
-have built-in support for missing values when `splitter='best'` and criterion is
+:class:`DecisionTreeClassifier`, :class:`DecisionTreeRegressor`
+have built-in support for missing values using `splitter='best'`, where
+the splits are determined in a greedy fashion.
+:class:`ExtraTreeClassifier`, and :class:`ExtraTreeRegressor` have built-in
+support for missing values for `splitter='random'`, where the splits
+are determined randomly. For more details on how the splitter differs on
+non-missing values, see the :ref:`Forest section <forest>`.
+
+The criterion supported when there are missing-values are
 `'gini'`, `'entropy`', or `'log_loss'`, for classification or
 `'squared_error'`, `'friedman_mse'`, or `'poisson'` for regression.
 
+First we will describe how :class:`DecisionTreeClassifier`, :class:`DecisionTreeRegressor`
+handle missing-values in the data.
+
 For each potential threshold on the non-missing data, the splitter will evaluate
 the split with all the missing values going to the left node or the right node.
 
@@ -650,6 +644,22 @@ Decisions are made as follows:
     >>> tree.predict(X_test)
     array([1])
 
+:class:`ExtraTreeClassifier`, and :class:`ExtraTreeRegressor` handle missing values
+in a slightly different way. When splitting a node, a random threshold will be chosen
+to split the non-missing values on. Then the non-missing values will be sent to the
+left and right child based on the randomly selected threshold, while the missing
+values will also be randomly sent to the left or right child. This is repeated for
+every feature considered at each split. The best split among these is chosen.
+
+During prediction, the treatment of missing-values is the same as that of the
+decision tree:
+
+- By default when predicting, the samples with missing values are classified
+  with the class used in the split found during training.
+
+- If no missing values are seen during training for a given feature, then during
+  prediction missing values are mapped to the child with the most samples.
+
 .. _minimal_cost_complexity_pruning:
 
 Minimal Cost-Complexity Pruning
@@ -685,13 +695,11 @@ with the smallest value of :math:`\alpha_{eff}` is the weakest link and will
 be pruned. This process stops when the pruned tree's minimal
 :math:`\alpha_{eff}` is greater than the ``ccp_alpha`` parameter.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_tree_plot_cost_complexity_pruning.py`
+* :ref:`sphx_glr_auto_examples_tree_plot_cost_complexity_pruning.py`
 
-|details-start|
-**References**
-|details-split|
+.. rubric:: References
 
 .. [BRE] L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification
   and Regression Trees. Wadsworth, Belmont, CA, 1984.
@@ -705,5 +713,3 @@ be pruned. This process stops when the pruned tree's minimal
 
 * T. Hastie, R. Tibshirani and J. Friedman. Elements of Statistical
   Learning, Springer, 2009.
-
-|details-end|
diff --git a/doc/modules/unsupervised_reduction.rst b/doc/modules/unsupervised_reduction.rst
index 90c80714c3131..f94d6ac301e47 100644
--- a/doc/modules/unsupervised_reduction.rst
+++ b/doc/modules/unsupervised_reduction.rst
@@ -24,9 +24,9 @@ PCA: principal component analysis
 :class:`decomposition.PCA` looks for a combination of features that
 capture well the variance of the original features. See :ref:`decompositions`.
 
-.. topic:: **Examples**
+.. rubric:: Examples
 
-   * :ref:`sphx_glr_auto_examples_applications_plot_face_recognition.py`
+* :ref:`sphx_glr_auto_examples_applications_plot_face_recognition.py`
 
 Random projections
 -------------------
@@ -35,9 +35,9 @@ The module: :mod:`~sklearn.random_projection` provides several tools for data
 reduction by random projections. See the relevant section of the
 documentation: :ref:`random_projection`.
 
-.. topic:: **Examples**
+.. rubric:: Examples
 
-   * :ref:`sphx_glr_auto_examples_miscellaneous_plot_johnson_lindenstrauss_bound.py`
+* :ref:`sphx_glr_auto_examples_miscellaneous_plot_johnson_lindenstrauss_bound.py`
 
 Feature agglomeration
 ------------------------
@@ -46,10 +46,10 @@ Feature agglomeration
 :ref:`hierarchical_clustering` to group together features that behave
 similarly.
 
-.. topic:: **Examples**
+.. rubric:: Examples
 
-   * :ref:`sphx_glr_auto_examples_cluster_plot_feature_agglomeration_vs_univariate_selection.py`
-   * :ref:`sphx_glr_auto_examples_cluster_plot_digits_agglomeration.py`
+* :ref:`sphx_glr_auto_examples_cluster_plot_feature_agglomeration_vs_univariate_selection.py`
+* :ref:`sphx_glr_auto_examples_cluster_plot_digits_agglomeration.py`
 
 .. topic:: **Feature scaling**
 
diff --git a/doc/preface.rst b/doc/preface.rst
deleted file mode 100644
index 447083a3a8136..0000000000000
--- a/doc/preface.rst
+++ /dev/null
@@ -1,32 +0,0 @@
-.. This helps define the TOC ordering for "about us" sections. Particularly
-   useful for PDF output as this section is not linked from elsewhere.
-
-.. Places global toc into the sidebar
-
-:globalsidebartoc: True
-
-.. _preface_menu:
-
-.. include:: includes/big_toc_css.rst
-.. include:: tune_toc.rst
-
-=======================
-Welcome to scikit-learn
-=======================
-
-|
-
-.. toctree::
-    :maxdepth: 2
-
-    install
-    faq
-    support
-    related_projects
-    about
-    testimonials/testimonials
-    whats_new
-    roadmap
-    governance
-
-|
diff --git a/doc/presentations.rst b/doc/presentations.rst
index 19fd09218b5fd..92f23c0fa26cb 100644
--- a/doc/presentations.rst
+++ b/doc/presentations.rst
@@ -2,9 +2,6 @@
 External Resources, Videos and Talks
 ===========================================
 
-For written tutorials, see the :ref:`Tutorial section <tutorial_menu>` of
-the documentation.
-
 New to Scientific Python?
 ==========================
 For those that are still new to the scientific Python ecosystem, we highly
@@ -45,9 +42,7 @@ Videos
 
   An extensive tutorial, consisting of four sessions of one hour.
   The tutorial covers the basics of machine learning,
-  many algorithms and how to apply them using scikit-learn. The
-  material corresponding is now in the scikit-learn documentation
-  section :ref:`stat_learn_tut_index`.
+  many algorithms and how to apply them using scikit-learn.
 
 - `Statistical Learning for Text Classification with scikit-learn and NLTK
   <https://pyvideo.org/video/417/pycon-2011--statistical-machine-learning-for-text>`_
diff --git a/doc/scss/api-search.scss b/doc/scss/api-search.scss
new file mode 100644
index 0000000000000..51cf15f92c1cb
--- /dev/null
+++ b/doc/scss/api-search.scss
@@ -0,0 +1,111 @@
+/**
+ * This is the styling for the API index page (`api/index`), in particular for the API
+ * search table. It involves overriding the style sheet of DataTables which does not
+ * fit well into the theme, especially in dark theme; see https://datatables.net/
+ */
+
+.dt-container {
+  margin-bottom: 2rem;
+
+  // Fix the selection box for entries per page
+  select.dt-input {
+    padding: 0 !important;
+    margin-right: 0.4rem !important;
+
+    > option {
+      color: var(--pst-color-text-base);
+      background-color: var(--pst-color-background);
+    }
+  }
+
+  // Fix the search box
+  input.dt-input {
+    width: 50%;
+    line-height: normal;
+    padding: 0.1rem 0.3rem !important;
+    margin-left: 0.4rem !important;
+  }
+
+  table.dataTable {
+    th {
+      // Avoid table header being too tall
+      p {
+        margin-bottom: 0;
+      }
+
+      // Fix the ascending/descending order buttons in the header
+      span.dt-column-order {
+        &::before,
+        &::after {
+          color: var(--pst-color-text-base);
+          line-height: 0.7rem !important;
+        }
+      }
+    }
+
+    td {
+      // Fix color of text warning no records found
+      &.dt-empty {
+        color: var(--pst-color-text-base) !important;
+      }
+    }
+
+    // Unset bottom border of the last row
+    tr:last-child > * {
+      border-bottom: unset !important;
+    }
+  }
+
+  div.dt-paging button.dt-paging-button {
+    padding: 0 0.5rem;
+
+    &.disabled {
+      color: var(--pst-color-border) !important;
+
+      // Overwrite the !important color assigned by DataTables because we must keep
+      // the color of disabled buttons consistent with and without hovering
+      &:hover {
+        color: var(--pst-color-border) !important;
+      }
+    }
+
+    // Fix colors of paging buttons
+    &.current,
+    &:not(.disabled):not(.current):hover {
+      color: var(--pst-color-on-surface) !important;
+      border-color: var(--pst-color-surface) !important;
+      background: var(--pst-color-surface) !important;
+    }
+
+    // Highlight the border of the current selected paging button
+    &.current {
+      border-color: var(--pst-color-text-base) !important;
+    }
+  }
+}
+
+// Styling the object description cells in the table
+div.sk-apisearch-desc {
+  p {
+    margin-bottom: 0;
+  }
+
+  div.caption > p {
+    a,
+    code {
+      color: var(--pst-color-text-muted);
+    }
+
+    code {
+      padding: 0;
+      font-size: 0.7rem;
+      font-weight: var(--pst-font-weight-caption);
+      background-color: transparent;
+    }
+
+    .sd-badge {
+      font-size: 0.7rem;
+      margin-left: 0.3rem;
+    }
+  }
+}
diff --git a/doc/scss/api.scss b/doc/scss/api.scss
new file mode 100644
index 0000000000000..d7110def4ac09
--- /dev/null
+++ b/doc/scss/api.scss
@@ -0,0 +1,52 @@
+/**
+ * This is the styling for API reference pages, currently under `modules/generated`.
+ * Note that it should be applied *ONLY* to API reference pages, as the selectors are
+ * designed based on how `autodoc` and `autosummary` generate the stuff.
+ */
+
+// Make the admonitions more compact
+div.versionadded,
+div.versionchanged,
+div.deprecated {
+  margin: 1rem auto;
+
+  > p {
+    margin: 0.3rem auto;
+  }
+}
+
+// Make docstrings more compact
+dd {
+  p:not(table *) {
+    margin-bottom: 0.5rem !important;
+  }
+
+  ul {
+    margin-bottom: 0.5rem !important;
+    padding-left: 2rem !important;
+  }
+}
+
+// The first method is too close the the docstring above
+dl.py.method:first-of-type {
+  margin-top: 2rem;
+}
+
+// https://github.com/pydata/pydata-sphinx-theme/blob/8cf45f835bfdafc5f3821014a18f3b7e0fc2d44b/src/pydata_sphinx_theme/assets/styles/content/_api.scss
+dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) {
+  margin-bottom: 1.5rem;
+
+  dd {
+    margin-left: 1.2rem;
+  }
+
+  // "Parameters", "Returns", etc. in the docstring
+  dt.field-odd,
+  dt.field-even {
+    margin: 0.5rem 0;
+
+    + dd > dl {
+      margin-bottom: 0.5rem;
+    }
+  }
+}
diff --git a/doc/scss/colors.scss b/doc/scss/colors.scss
new file mode 100644
index 0000000000000..bbc6aa6c2a3d6
--- /dev/null
+++ b/doc/scss/colors.scss
@@ -0,0 +1,51 @@
+/**
+ * This is the style sheet for customized colors of scikit-learn.
+ * Tints and shades are generated by https://colorkit.co/color-shades-generator/
+ *
+ * This file is compiled into styles/colors.css by sphinxcontrib.sass, see:
+ * https://sass-lang.com/guide/
+ */
+
+:root {
+  /* scikit-learn cyan */
+  --sk-cyan-tint-9: #edf7fd;
+  --sk-cyan-tint-8: #daeffa;
+  --sk-cyan-tint-7: #c8e6f8;
+  --sk-cyan-tint-6: #b5def5;
+  --sk-cyan-tint-5: #a2d6f2;
+  --sk-cyan-tint-4: #8fcdef;
+  --sk-cyan-tint-3: #7ac5ec;
+  --sk-cyan-tint-2: #64bce9;
+  --sk-cyan-tint-1: #4bb4e5;
+  --sk-cyan: #29abe2;
+  --sk-cyan-shades-1: #2294c4;
+  --sk-cyan-shades-2: #1c7ea8;
+  --sk-cyan-shades-3: #15688c;
+  --sk-cyan-shades-4: #0f5471;
+  --sk-cyan-shades-5: #094057;
+  --sk-cyan-shades-6: #052d3e;
+  --sk-cyan-shades-7: #021b27;
+  --sk-cyan-shades-8: #010b12;
+  --sk-cyan-shades-9: #000103;
+
+  /* scikit-learn orange */
+  --sk-orange-tint-9: #fff5ec;
+  --sk-orange-tint-8: #ffead9;
+  --sk-orange-tint-7: #ffe0c5;
+  --sk-orange-tint-6: #ffd5b2;
+  --sk-orange-tint-5: #fecb9e;
+  --sk-orange-tint-4: #fdc08a;
+  --sk-orange-tint-3: #fcb575;
+  --sk-orange-tint-2: #fbaa5e;
+  --sk-orange-tint-1: #f99f44;
+  --sk-orange: #f7931e;
+  --sk-orange-shades-1: #d77f19;
+  --sk-orange-shades-2: #b76c13;
+  --sk-orange-shades-3: #99590e;
+  --sk-orange-shades-4: #7c4709;
+  --sk-orange-shades-5: #603605;
+  --sk-orange-shades-6: #452503;
+  --sk-orange-shades-7: #2c1601;
+  --sk-orange-shades-8: #150800;
+  --sk-orange-shades-9: #030100;
+}
diff --git a/doc/scss/custom.scss b/doc/scss/custom.scss
new file mode 100644
index 0000000000000..ce4451fce4467
--- /dev/null
+++ b/doc/scss/custom.scss
@@ -0,0 +1,192 @@
+/**
+ * This is a general styling sheet.
+ * It should be used for customizations that affect multiple pages.
+ *
+ * This file is compiled into styles/custom.css by sphinxcontrib.sass, see:
+ * https://sass-lang.com/guide/
+ */
+
+/* Global */
+
+code.literal {
+  border: 0;
+}
+
+/* Version switcher */
+
+.version-switcher__menu a.list-group-item.sk-avail-docs-link {
+  display: flex;
+  align-items: center;
+
+  &:after {
+    content: var(--pst-icon-external-link);
+    font: var(--fa-font-solid);
+    font-size: 0.75rem;
+    margin-left: 0.5rem;
+  }
+}
+
+/* Primary sidebar */
+
+.bd-sidebar-primary {
+  width: 22.5%;
+  min-width: 16rem;
+
+  // The version switcher button in the sidebar is ill-styled
+  button.version-switcher__button {
+    margin-bottom: unset;
+    margin-left: 0.3rem;
+    font-size: 1rem;
+  }
+
+  // The section navigation part is to close to the right boundary (originally an even
+  // larger negative right margin was used)
+  nav.bd-links {
+    margin-right: -0.5rem;
+  }
+}
+
+/* Article content */
+
+.bd-article {
+  h1 {
+    font-weight: 500;
+    margin-bottom: 2rem;
+  }
+
+  h2 {
+    font-weight: 500;
+    margin-bottom: 1.5rem;
+  }
+
+  // Avoid changing the aspect ratio of images; add some padding so that at least
+  // there is some space between image and background in dark mode
+  img {
+    height: unset !important;
+    padding: 1%;
+  }
+
+  // Resize table of contents to make the top few levels of headings more visible
+  li.toctree-l1 {
+    padding-bottom: 0.5em;
+
+    > a {
+      font-size: 150%;
+      font-weight: bold;
+    }
+  }
+
+  li.toctree-l2,
+  li.toctree-l3,
+  li.toctree-l4 {
+    margin-left: 15px;
+  }
+}
+
+/* Dropdowns (sphinx-design) */
+
+details.sd-dropdown {
+  &:hover > summary.sd-summary-title > a.headerlink {
+    visibility: visible;
+  }
+
+  > summary.sd-summary-title {
+    > a.headerlink {
+      font-size: 1rem;
+    }
+
+    // See `js/scripts/dropdown.js`: this is styling the "expand/collapse all" button
+    > button.sk-toggle-all {
+      color: var(--pst-sd-dropdown-color);
+      top: 0.9rem !important;
+      right: 3rem !important;
+      pointer-events: auto !important;
+      display: none;
+      border: none;
+      background: transparent;
+    }
+  }
+
+  &[open] > summary.sd-summary-title:hover > .sd-summary-up.sk-toggle-all,
+  &:not([open])
+    > summary.sd-summary-title:hover
+    > .sd-summary-down.sk-toggle-all {
+    display: block;
+  }
+}
+
+/* scikit-learn buttons */
+
+a.btn {
+  &.sk-btn-orange {
+    background-color: var(--sk-orange-tint-1);
+    color: black !important;
+
+    &:hover {
+      background-color: var(--sk-orange-tint-3);
+    }
+  }
+
+  &.sk-btn-cyan {
+    background-color: var(--sk-cyan-shades-2);
+    color: white !important;
+
+    &:hover {
+      background-color: var(--sk-cyan-shades-1);
+    }
+  }
+}
+
+/* scikit-learn avatar grid, see build_tools/generate_authors_table.py */
+
+div.sk-authors-container {
+  display: flex;
+  flex-wrap: wrap;
+  justify-content: center;
+
+  > div {
+    width: 6rem;
+    margin: 0.5rem;
+    font-size: 0.9rem;
+  }
+}
+
+/* scikit-learn text-image grid, used in testimonials and sponsors pages */
+
+@mixin sk-text-image-grid($img-max-height) {
+  display: flex;
+  align-items: center;
+  flex-wrap: wrap;
+
+  div.text-box,
+  div.image-box {
+    width: 50%;
+
+    @media screen and (max-width: 500px) {
+      width: 100%;
+    }
+  }
+
+  div.text-box .annotation {
+    font-size: 0.9rem;
+    font-style: italic;
+    color: var(--pst-color-text-muted);
+  }
+
+  div.image-box {
+    text-align: center;
+
+    img {
+      max-height: $img-max-height;
+      max-width: 50%;
+    }
+  }
+}
+
+div.sk-text-image-grid-small {
+  @include sk-text-image-grid(60px);
+}
+
+div.sk-text-image-grid-large {
+  @include sk-text-image-grid(100px);
+}
diff --git a/doc/scss/index.scss b/doc/scss/index.scss
new file mode 100644
index 0000000000000..c3bb8e86b41c6
--- /dev/null
+++ b/doc/scss/index.scss
@@ -0,0 +1,176 @@
+/**
+ * Styling sheet for the scikit-learn landing page. This should be loaded only for the
+ * landing page.
+ *
+ * This file is compiled into styles/index.css by sphinxcontrib.sass, see:
+ * https://sass-lang.com/guide/
+ */
+
+/* Theme-aware colors for the landing page */
+
+html {
+  &[data-theme="light"] {
+    --sk-landing-bg-1: var(--sk-cyan-shades-3);
+    --sk-landing-bg-2: var(--sk-cyan);
+    --sk-landing-bg-3: var(--sk-orange-tint-8);
+    --sk-landing-bg-4: var(--sk-orange-tint-3);
+  }
+
+  &[data-theme="dark"] {
+    --sk-landing-bg-1: var(--sk-cyan-shades-5);
+    --sk-landing-bg-2: var(--sk-cyan-shades-2);
+    --sk-landing-bg-3: var(--sk-orange-tint-4);
+    --sk-landing-bg-4: var(--sk-orange-tint-1);
+  }
+}
+
+/* General */
+
+div.sk-landing-container {
+  max-width: 1400px;
+}
+
+/* Top bar */
+
+div.sk-landing-top-bar {
+  background-image: linear-gradient(
+    160deg,
+    var(--sk-landing-bg-1) 0%,
+    var(--sk-landing-bg-2) 17%,
+    var(--sk-landing-bg-3) 59%,
+    var(--sk-landing-bg-4) 100%
+  );
+
+  .sk-landing-header,
+  .sk-landing-subheader {
+    color: white;
+    text-shadow: 0px 0px 8px var(--sk-landing-bg-1);
+  }
+
+  .sk-landing-header {
+    font-size: 3.2rem;
+    margin-bottom: 0.5rem;
+  }
+
+  .sk-landing-subheader {
+    letter-spacing: 0.17rem;
+    margin-top: 0;
+    font-weight: 500;
+  }
+
+  a.sk-btn-orange {
+    font-size: 1.1rem;
+    font-weight: 500;
+  }
+
+  ul.sk-landing-header-body {
+    margin-top: auto;
+    margin-bottom: auto;
+    font-size: 1.2rem;
+    font-weight: 500;
+    color: black;
+  }
+}
+
+/* Body */
+
+div.sk-landing-body {
+  div.card {
+    background-color: var(--pst-color-background);
+    border-color: var(--pst-color-border);
+  }
+
+  .sk-px-xl-4 {
+    @media screen and (min-width: 1200px) {
+      padding-left: 1.3rem !important;
+      padding-right: 1.3rem !important;
+    }
+  }
+
+  .card-body {
+    p {
+      margin-bottom: 0.8rem;
+      color: var(--pst-color-text-base);
+    }
+
+    .sk-card-title {
+      font-weight: 700;
+      margin: 0 0 1rem 0;
+    }
+  }
+
+  .sk-card-img-container {
+    display: flex;
+    justify-content: center;
+    align-items: end;
+    margin-bottom: 1rem;
+
+    img {
+      max-width: unset;
+      height: 15rem;
+    }
+  }
+}
+
+/* More info */
+
+div.sk-landing-more-info {
+  font-size: 0.96rem;
+  background-color: var(--pst-color-surface);
+
+  .sk-landing-call-header {
+    font-weight: 700;
+    margin-top: 0;
+
+    html[data-theme="light"] & {
+      color: var(--sk-orange-shades-1);
+    }
+
+    html[data-theme="dark"] & {
+      color: var(--sk-orange);
+    }
+  }
+
+  ul.sk-landing-call-list > li {
+    margin-bottom: 0.25rem;
+  }
+
+  .sk-who-uses-carousel {
+    min-height: 200px;
+
+    .carousel-item img {
+      max-height: 100px;
+      max-width: 50%;
+      margin: 0.5rem;
+    }
+  }
+
+  .sk-more-testimonials {
+    text-align: right !important;
+  }
+}
+
+/* Footer */
+
+div.sk-landing-footer {
+  a.sk-footer-funding-link {
+    text-decoration: none;
+
+    p.sk-footer-funding-text {
+      color: var(--pst-color-link);
+
+      &:hover {
+        color: var(--pst-color-secondary);
+      }
+    }
+
+    div.sk-footer-funding-logos > img {
+      max-height: 40px;
+      max-width: 85px;
+      margin: 0 8px 8px 8px;
+      padding: 5px;
+      border-radius: 3px;
+      background-color: white;
+    }
+  }
+}
diff --git a/doc/scss/install.scss b/doc/scss/install.scss
new file mode 100644
index 0000000000000..5f4fc406bff7d
--- /dev/null
+++ b/doc/scss/install.scss
@@ -0,0 +1,60 @@
+/**
+ * Styling for the installation page, including overriding some default styling of
+ * sphinx-design. This style sheet should be included only for the install page.
+ *
+ * This file is compiled into styles/install.css by sphinxcontrib.sass, see:
+ * https://sass-lang.com/guide/
+ */
+
+.install-instructions .sd-tab-set {
+  .sd-tab-content {
+    padding: 0.5rem 0 0 0; // Vertical gap between the two sets of nested tabs
+    background-color: transparent;
+    border: none;
+
+    p:first-child {
+      margin-top: 1rem !important;
+    }
+  }
+
+  > label.sd-tab-label {
+    margin: 0 3px; // Horizontal gap within the same set of tabs
+    display: flex;
+    align-items: center;
+    justify-content: center;
+    border-radius: 5px !important;
+
+    &.tab-6 {
+      width: calc((100% - var(--tab-caption-width, 0%)) / 2 - 6px) !important;
+    }
+
+    &.tab-4 {
+      width: calc((100% - var(--tab-caption-width, 0%)) / 3 - 6px) !important;
+    }
+  }
+
+  > input:checked + label.sd-tab-label {
+    transform: unset;
+    border: 2px solid var(--pst-color-primary);
+  }
+
+  // Show tab captions on large screens
+  @media screen and (min-width: 960px) {
+    --tab-caption-width: 20%;
+
+    &::before {
+      width: var(--tab-caption-width);
+      display: flex;
+      align-items: center;
+      font-weight: bold;
+    }
+
+    &.tabs-os::before {
+      content: "Operating System";
+    }
+
+    &.tabs-package-manager::before {
+      content: "Package Manager";
+    }
+  }
+}
diff --git a/doc/sphinxext/add_toctree_functions.py b/doc/sphinxext/add_toctree_functions.py
deleted file mode 100644
index 4459ab971f4c4..0000000000000
--- a/doc/sphinxext/add_toctree_functions.py
+++ /dev/null
@@ -1,160 +0,0 @@
-"""Inspired by https://github.com/pandas-dev/pydata-sphinx-theme
-
-BSD 3-Clause License
-
-Copyright (c) 2018, pandas
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-
-* Redistributions of source code must retain the above copyright notice, this
-  list of conditions and the following disclaimer.
-
-* Redistributions in binary form must reproduce the above copyright notice,
-  this list of conditions and the following disclaimer in the documentation
-  and/or other materials provided with the distribution.
-
-* Neither the name of the copyright holder nor the names of its
-  contributors may be used to endorse or promote products derived from
-  this software without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
-FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
-SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
-CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
-OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-"""
-
-import docutils
-
-
-def add_toctree_functions(app, pagename, templatename, context, doctree):
-    """Add functions so Jinja templates can add toctree objects.
-
-    This converts the docutils nodes into a nested dictionary that Jinja can
-    use in our templating.
-    """
-    from sphinx.environment.adapters.toctree import TocTree
-
-    def get_nav_object(maxdepth=None, collapse=True, numbered=False, **kwargs):
-        """Return a list of nav links that can be accessed from Jinja.
-
-        Parameters
-        ----------
-        maxdepth: int
-            How many layers of TocTree will be returned
-        collapse: bool
-            Whether to only include sub-pages of the currently-active page,
-            instead of sub-pages of all top-level pages of the site.
-        numbered: bool
-            Whether to add section number to title
-        kwargs: key/val pairs
-            Passed to the `TocTree.get_toctree_for` Sphinx method
-        """
-        # The TocTree will contain the full site TocTree including sub-pages.
-        # "collapse=True" collapses sub-pages of non-active TOC pages.
-        # maxdepth controls how many TOC levels are returned
-        toctree = TocTree(app.env).get_toctree_for(
-            pagename, app.builder, collapse=collapse, maxdepth=maxdepth, **kwargs
-        )
-        # If no toctree is defined (AKA a single-page site), skip this
-        if toctree is None:
-            return []
-
-        # toctree has this structure
-        #   <caption>
-        #   <bullet_list>
-        #       <list_item classes="toctree-l1">
-        #       <list_item classes="toctree-l1">
-        # `list_item`s are the actual TOC links and are the only thing we want
-        toc_items = [
-            item
-            for child in toctree.children
-            for item in child
-            if isinstance(item, docutils.nodes.list_item)
-        ]
-
-        # Now convert our docutils nodes into dicts that Jinja can use
-        nav = [
-            docutils_node_to_jinja(child, only_pages=True, numbered=numbered)
-            for child in toc_items
-        ]
-
-        return nav
-
-    context["get_nav_object"] = get_nav_object
-
-
-def docutils_node_to_jinja(list_item, only_pages=False, numbered=False):
-    """Convert a docutils node to a structure that can be read by Jinja.
-
-    Parameters
-    ----------
-    list_item : docutils list_item node
-        A parent item, potentially with children, corresponding to the level
-        of a TocTree.
-    only_pages : bool
-        Only include items for full pages in the output dictionary. Exclude
-        anchor links (TOC items with a URL that starts with #)
-    numbered: bool
-        Whether to add section number to title
-
-    Returns
-    -------
-    nav : dict
-        The TocTree, converted into a dictionary with key/values that work
-        within Jinja.
-    """
-    if not list_item.children:
-        return None
-
-    # We assume this structure of a list item:
-    # <list_item>
-    #     <compact_paragraph >
-    #         <reference> <-- the thing we want
-    reference = list_item.children[0].children[0]
-    title = reference.astext()
-    url = reference.attributes["refuri"]
-    active = "current" in list_item.attributes["classes"]
-
-    secnumber = reference.attributes.get("secnumber", None)
-    if numbered and secnumber is not None:
-        secnumber = ".".join(str(n) for n in secnumber)
-        title = f"{secnumber}. {title}"
-
-    # If we've got an anchor link, skip it if we wish
-    if only_pages and "#" in url:
-        return None
-
-    # Converting the docutils attributes into jinja-friendly objects
-    nav = {}
-    nav["title"] = title
-    nav["url"] = url
-    nav["active"] = active
-
-    # Recursively convert children as well
-    # If there are sub-pages for this list_item, there should be two children:
-    # a paragraph, and a bullet_list.
-    nav["children"] = []
-    if len(list_item.children) > 1:
-        # The `.children` of the bullet_list has the nodes of the sub-pages.
-        subpage_list = list_item.children[1].children
-        for sub_page in subpage_list:
-            child_nav = docutils_node_to_jinja(
-                sub_page, only_pages=only_pages, numbered=numbered
-            )
-            if child_nav is not None:
-                nav["children"].append(child_nav)
-    return nav
-
-
-def setup(app):
-    app.connect("html-page-context", add_toctree_functions)
-
-    return {"parallel_read_safe": True, "parallel_write_safe": True}
diff --git a/doc/sphinxext/autoshortsummary.py b/doc/sphinxext/autoshortsummary.py
new file mode 100644
index 0000000000000..8451f3133d05b
--- /dev/null
+++ b/doc/sphinxext/autoshortsummary.py
@@ -0,0 +1,53 @@
+from sphinx.ext.autodoc import ModuleLevelDocumenter
+
+
+class ShortSummaryDocumenter(ModuleLevelDocumenter):
+    """An autodocumenter that only renders the short summary of the object."""
+
+    # Defines the usage: .. autoshortsummary:: {{ object }}
+    objtype = "shortsummary"
+
+    # Disable content indentation
+    content_indent = ""
+
+    # Avoid being selected as the default documenter for some objects, because we are
+    # returning `can_document_member` as True for all objects
+    priority = -99
+
+    @classmethod
+    def can_document_member(cls, member, membername, isattr, parent):
+        """Allow documenting any object."""
+        return True
+
+    def get_object_members(self, want_all):
+        """Document no members."""
+        return (False, [])
+
+    def add_directive_header(self, sig):
+        """Override default behavior to add no directive header or options."""
+        pass
+
+    def add_content(self, more_content):
+        """Override default behavior to add only the first line of the docstring.
+
+        Modified based on the part of processing docstrings in the original
+        implementation of this method.
+
+        https://github.com/sphinx-doc/sphinx/blob/faa33a53a389f6f8bc1f6ae97d6015fa92393c4a/sphinx/ext/autodoc/__init__.py#L609-L622
+        """
+        sourcename = self.get_sourcename()
+        docstrings = self.get_doc()
+
+        if docstrings is not None:
+            if not docstrings:
+                docstrings.append([])
+            # Get the first non-empty line of the processed docstring; this could lead
+            # to unexpected results if the object does not have a short summary line.
+            short_summary = next(
+                (s for s in self.process_doc(docstrings) if s), "<no summary>"
+            )
+            self.add_line(short_summary, sourcename, 0)
+
+
+def setup(app):
+    app.add_autodocumenter(ShortSummaryDocumenter)
diff --git a/doc/sphinxext/dropdown_anchors.py b/doc/sphinxext/dropdown_anchors.py
new file mode 100644
index 0000000000000..eb0b414de6ae8
--- /dev/null
+++ b/doc/sphinxext/dropdown_anchors.py
@@ -0,0 +1,78 @@
+import re
+
+from docutils import nodes
+from sphinx.transforms.post_transforms import SphinxPostTransform
+from sphinx_design.dropdown import dropdown_main, dropdown_title
+
+
+class DropdownAnchorAdder(SphinxPostTransform):
+    """Insert anchor links to the sphinx-design dropdowns.
+
+    Some of the dropdowns were originally headers that had automatic anchors, so we
+    need to make sure that the old anchors still work. See the original implementation
+    (in JS): https://github.com/scikit-learn/scikit-learn/pull/27409
+
+    The structure of each sphinx-design dropdown node is expected to be:
+
+    <dropdown_main ...>
+        <dropdown_title ...>
+            ...icon      <-- This exists if the "icon" option of the sphinx-design
+                             dropdown is set; we do not use it in our documentation
+
+            ...title     <-- This may contain multiple nodes, e.g. literal nodes if
+                             there are inline codes; we use the concatenated text of
+                             all these nodes to generate the anchor ID
+
+            Here we insert the anchor link!
+
+            <container ...>  <-- The "dropdown closed" marker
+            <container ...>  <-- The "dropdown open" marker
+        </dropdown_title>
+        <container...>
+            ...main contents
+        </container>
+    </dropdown_main>
+    """
+
+    default_priority = 9999  # Apply later than everything else
+    formats = ["html"]
+
+    def run(self):
+        """Run the post transformation."""
+        # Counter to store the duplicated summary text to add it as a suffix in the
+        # anchor ID
+        anchor_id_counters = {}
+
+        for sd_dropdown in self.document.findall(dropdown_main):
+            # Grab the dropdown title
+            sd_dropdown_title = sd_dropdown.next_node(dropdown_title)
+
+            # Concatenate the text of relevant nodes as the title text
+            # Since we do not have the prefix icon, the relevant nodes are the very
+            # first child node until the third last node (last two are markers)
+            title_text = "".join(
+                node.astext() for node in sd_dropdown_title.children[:-2]
+            )
+
+            # The ID uses the first line, lowercased, with spaces replaced by dashes;
+            # suffix the anchor ID with a counter if it already exists
+            anchor_id = re.sub(r"\s+", "-", title_text.strip().split("\n")[0]).lower()
+            if anchor_id in anchor_id_counters:
+                anchor_id_counters[anchor_id] += 1
+                anchor_id = f"{anchor_id}-{anchor_id_counters[anchor_id]}"
+            else:
+                anchor_id_counters[anchor_id] = 1
+            sd_dropdown["ids"].append(anchor_id)
+
+            # Create the anchor element and insert after the title text; we do this
+            # directly with raw HTML
+            anchor_html = (
+                f'<a class="headerlink" href="#{anchor_id}" '
+                'title="Link to this dropdown">#</a>'
+            )
+            anchor_node = nodes.raw("", anchor_html, format="html")
+            sd_dropdown_title.insert(-2, anchor_node)  # before the two markers
+
+
+def setup(app):
+    app.add_post_transform(DropdownAnchorAdder)
diff --git a/doc/sphinxext/move_gallery_links.py b/doc/sphinxext/move_gallery_links.py
new file mode 100644
index 0000000000000..dff27f7358c7f
--- /dev/null
+++ b/doc/sphinxext/move_gallery_links.py
@@ -0,0 +1,193 @@
+"""
+This script intends to better integrate sphinx-gallery into pydata-sphinx-theme. In
+particular, it moves the download links and badge links in the footer of each generated
+example page into the secondary sidebar, then removes the footer and the top note
+pointing to the footer.
+
+The download links are for Python source code and Jupyter notebook respectively, and
+the badge links are for JupyterLite and Binder.
+
+Currently this is achieved via post-processing the HTML generated by sphinx-gallery.
+This hack can be removed if the following upstream issue is resolved:
+https://github.com/sphinx-gallery/sphinx-gallery/issues/1258
+"""
+
+from pathlib import Path
+
+from bs4 import BeautifulSoup
+from sphinx.util.display import status_iterator
+from sphinx.util.logging import getLogger
+
+logger = getLogger(__name__)
+
+
+def move_gallery_links(app, exception):
+    if exception is not None:
+        return
+
+    for gallery_dir in app.config.sphinx_gallery_conf["gallery_dirs"]:
+        html_gallery_dir = Path(app.builder.outdir, gallery_dir)
+
+        # Get all gallery example files to be tweaked; tuples (file, docname)
+        flat = []
+        for file in html_gallery_dir.rglob("*.html"):
+            if file.name in ("index.html", "sg_execution_times.html"):
+                # These are not gallery example pages, skip
+                continue
+
+            # Extract the documentation name from the path
+            docname = file.relative_to(app.builder.outdir).with_suffix("").as_posix()
+            if docname in app.config.html_context["redirects"]:
+                # This is a redirected page, skip
+                continue
+            if docname not in app.project.docnames:
+                # This should not happen, warn
+                logger.warning(f"Document {docname} not found but {file} exists")
+                continue
+            flat.append((file, docname))
+
+        for html_file, _ in status_iterator(
+            flat,
+            length=len(flat),
+            summary="Tweaking gallery links... ",
+            verbosity=app.verbosity,
+            stringify_func=lambda x: x[1],  # display docname
+        ):
+            with html_file.open("r", encoding="utf-8") as f:
+                html = f.read()
+            soup = BeautifulSoup(html, "html.parser")
+
+            # Find the secondary sidebar; it should exist in all gallery example pages
+            secondary_sidebar = soup.find("div", class_="sidebar-secondary-items")
+            if secondary_sidebar is None:
+                logger.warning(f"Secondary sidebar not found in {html_file}")
+                continue
+
+            def _create_secondary_sidebar_component(items):
+                """Create a new component in the secondary sidebar.
+
+                `items` should be a list of dictionaries with "element" being the bs4
+                tag of the component and "title" being the title (None if not needed).
+                """
+                component = soup.new_tag("div", **{"class": "sidebar-secondary-item"})
+                for item in items:
+                    item_wrapper = soup.new_tag("div")
+                    item_wrapper.append(item["element"])
+                    if item["title"]:
+                        item_wrapper["title"] = item["title"]
+                    component.append(item_wrapper)
+                secondary_sidebar.append(component)
+
+            def _create_download_link(link, is_jupyter=False):
+                """Create a download link to be appended to a component.
+
+                `link` should be the bs4 tag of the original download link, either for
+                the Python source code (is_jupyter=False) of for the Jupyter notebook
+                (is_jupyter=True). `link` will not be removed; instead the whole
+                footnote would be removed where `link` is located.
+
+                This returns a dictionary with "element" being the bs4 tag of the new
+                download link and "title" being the name of the file to download.
+                """
+                new_link = soup.new_tag("a", href=link["href"], download="")
+
+                # Place a download icon at the beginning of the new link
+                download_icon = soup.new_tag("i", **{"class": "fa-solid fa-download"})
+                new_link.append(download_icon)
+
+                # Create the text of the new link; it is shortend to fit better into
+                # the secondary sidebar. The leading space before "Download ..." is
+                # intentional to create a small gap between the icon and the text,
+                # being consistent with the other pydata-sphinx-theme components
+                link_type = "Jupyter notebook" if is_jupyter else "source code"
+                new_text = soup.new_string(f" Download {link_type}")
+                new_link.append(new_text)
+
+                # Get the file name to download and use it as the title of the new link
+                # which will show up when hovering over the link; the file name is
+                # expected to be in the last span of `link`
+                link_spans = link.find_all("span")
+                title = link_spans[-1].text if link_spans else None
+
+                return {"element": new_link, "title": title}
+
+            def _create_badge_link(link):
+                """Create a badge link to be appended to a component.
+
+                `link` should be the bs4 tag of the original badge link, either for
+                binder or JupyterLite. `link` will not be removed; instead the whole
+                footnote would be removed where `link` is located.
+
+                This returns a dictionary with "element" being the bs4 tag of the new
+                download link and "title" being `None` (no need).
+                """
+                new_link = soup.new_tag("a", href=link["href"])
+
+                # The link would essentially be an anchor wrapper outside the image of
+                # the badge; we get the src and alt attributes by finding the original
+                # image and limit the height to 20px (fixed) so that the secondary
+                # sidebar will appear neater
+                badge_img = link.find("img")
+                new_img = soup.new_tag(
+                    "img", src=badge_img["src"], alt=badge_img["alt"], height=20
+                )
+                new_link.append(new_img)
+
+                return {"element": new_link, "title": None}
+
+            try:
+                # `sg_note` is the "go to the end" note at the top of the page
+                # `sg_footer` is the footer with the download links and badge links
+                # These will be removed at the end if new links are successfully created
+                sg_note = soup.find("div", class_="sphx-glr-download-link-note")
+                sg_footer = soup.find("div", class_="sphx-glr-footer")
+
+                # If any one of these two is not found, we directly give up tweaking
+                if sg_note is None or sg_footer is None:
+                    continue
+
+                # Move the download links into the secondary sidebar
+                py_link_div = sg_footer.find("div", class_="sphx-glr-download-python")
+                ipy_link_div = sg_footer.find("div", class_="sphx-glr-download-jupyter")
+                _create_secondary_sidebar_component(
+                    [
+                        _create_download_link(py_link_div.a, is_jupyter=False),
+                        _create_download_link(ipy_link_div.a, is_jupyter=True),
+                    ]
+                )
+
+                # Move the badge links into the secondary sidebar
+                lite_link_div = sg_footer.find("div", class_="lite-badge")
+                binder_link_div = sg_footer.find("div", class_="binder-badge")
+                _create_secondary_sidebar_component(
+                    [
+                        _create_badge_link(lite_link_div.a),
+                        _create_badge_link(binder_link_div.a),
+                    ]
+                )
+
+                # Remove the sourcelink component from the secondary sidebar; the reason
+                # we do not remove it by configuration is that we need the secondary
+                # sidebar to be present for this script to work, while in-page toc alone
+                # could have been empty
+                sourcelink = secondary_sidebar.find("div", class_="sourcelink")
+                if sourcelink is not None:
+                    sourcelink.parent.extract()  # because sourcelink has a wrapper div
+
+                # Remove the the top note and the whole footer
+                sg_note.extract()
+                sg_footer.extract()
+
+            except Exception:
+                # If any step fails we directly skip the file
+                continue
+
+            # Write the modified file back
+            with html_file.open("w", encoding="utf-8") as f:
+                f.write(str(soup))
+
+
+def setup(app):
+    # Default priority is 500 which sphinx-gallery uses for its build-finished events;
+    # we need a larger priority to run after sphinx-gallery (larger is later)
+    app.connect("build-finished", move_gallery_links, priority=900)
diff --git a/doc/sphinxext/override_pst_pagetoc.py b/doc/sphinxext/override_pst_pagetoc.py
new file mode 100644
index 0000000000000..f5697de8ef155
--- /dev/null
+++ b/doc/sphinxext/override_pst_pagetoc.py
@@ -0,0 +1,84 @@
+from functools import cache
+
+from sphinx.util.logging import getLogger
+
+logger = getLogger(__name__)
+
+
+def override_pst_pagetoc(app, pagename, templatename, context, doctree):
+    """Overrides the `generate_toc_html` function of pydata-sphinx-theme for API."""
+
+    @cache
+    def generate_api_toc_html(kind="html"):
+        """Generate the in-page toc for an API page.
+
+        This relies on the `generate_toc_html` function added by pydata-sphinx-theme
+        into the context. We save the original function into `pst_generate_toc_html`
+        and override `generate_toc_html` with this function for generated API pages.
+
+        The pagetoc of an API page would look like the following:
+
+        <ul class="visible ...">               <-- Unwrap
+         <li class="toc-h1 ...">               <-- Unwrap
+          <a class="..." href="#">{{obj}}</a>  <-- Decompose
+
+          <ul class="visible ...">
+           <li class="toc-h2 ...">
+            ...object
+            <ul class="...">                          <-- Set visible if exists
+             <li class="toc-h3 ...">...method 1</li>  <-- Shorten
+             <li class="toc-h3 ...">...method 2</li>  <-- Shorten
+             ...more methods                          <-- Shorten
+            </ul>
+           </li>
+           <li class="toc-h2 ...">...gallery examples</li>
+          </ul>
+
+         </li>                                 <-- Unwrapped
+        </ul>                                  <-- Unwrapped
+        """
+        soup = context["pst_generate_toc_html"](kind="soup")
+
+        try:
+            # Unwrap the outermost level
+            soup.ul.unwrap()
+            soup.li.unwrap()
+            soup.a.decompose()
+
+            # Get all toc-h2 level entries, where the first one should be the function
+            # or class, and the second one, if exists, should be the examples; there
+            # should be no more than two entries at this level for generated API pages
+            lis = soup.ul.select("li.toc-h2")
+            main_li = lis[0]
+            meth_list = main_li.ul
+
+            if meth_list is not None:
+                # This is a class API page, we remove the class name from the method
+                # names to make them better fit into the secondary sidebar; also we
+                # make the toc-h3 level entries always visible to more easily navigate
+                # through the methods
+                meth_list["class"].append("visible")
+                for meth in meth_list.find_all("li", {"class": "toc-h3"}):
+                    target = meth.a.code.span
+                    target.string = target.string.split(".", 1)[1]
+
+            # This corresponds to the behavior of `generate_toc_html`
+            return str(soup) if kind == "html" else soup
+
+        except Exception as e:
+            # Upon any failure we return the original pagetoc
+            logger.warning(
+                f"Failed to generate API pagetoc for {pagename}: {e}; falling back"
+            )
+            return context["pst_generate_toc_html"](kind=kind)
+
+    # Override the pydata-sphinx-theme implementation for generate API pages
+    if pagename.startswith("modules/generated/"):
+        context["pst_generate_toc_html"] = context["generate_toc_html"]
+        context["generate_toc_html"] = generate_api_toc_html
+
+
+def setup(app):
+    # Need to be triggered after `pydata_sphinx_theme.toctree.add_toctree_functions`,
+    # and since default priority is 500 we set 900 for safety
+    app.connect("html-page-context", override_pst_pagetoc, priority=900)
diff --git a/doc/supervised_learning.rst b/doc/supervised_learning.rst
index 71fb3007c2e3c..ba24e8ee23c6f 100644
--- a/doc/supervised_learning.rst
+++ b/doc/supervised_learning.rst
@@ -1,9 +1,3 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
-.. include:: includes/big_toc_css.rst
-
 .. _supervised-learning:
 
 Supervised learning
diff --git a/doc/templates/base.rst b/doc/templates/base.rst
new file mode 100644
index 0000000000000..ee86bd8a18dbe
--- /dev/null
+++ b/doc/templates/base.rst
@@ -0,0 +1,36 @@
+{{ objname | escape | underline(line="=") }}
+
+{% if objtype == "module" -%}
+
+.. automodule:: {{ fullname }}
+
+{%- elif objtype == "function" -%}
+
+.. currentmodule:: {{ module }}
+
+.. autofunction:: {{ objname }}
+
+.. minigallery:: {{ module }}.{{ objname }}
+   :add-heading: Gallery examples
+   :heading-level: -
+
+{%- elif objtype == "class" -%}
+
+.. currentmodule:: {{ module }}
+
+.. autoclass:: {{ objname }}
+   :members:
+   :inherited-members:
+   :special-members: __call__
+
+.. minigallery:: {{ module }}.{{ objname }} {% for meth in methods %}{{ module }}.{{ objname }}.{{ meth }} {% endfor %}
+   :add-heading: Gallery examples
+   :heading-level: -
+
+{%- else -%}
+
+.. currentmodule:: {{ module }}
+
+.. auto{{ objtype }}:: {{ objname }}
+
+{%- endif -%}
diff --git a/doc/templates/class.rst b/doc/templates/class.rst
deleted file mode 100644
index 1e98be4099b73..0000000000000
--- a/doc/templates/class.rst
+++ /dev/null
@@ -1,17 +0,0 @@
-..
-    The empty line below should not be removed. It is added such that the `rst_prolog`
-    is added before the :mod: directive. Otherwise, the rendering will show as a
-    paragraph instead of a header.
-
-:mod:`{{module}}`.{{objname}}
-{{ underline }}==============
-
-.. currentmodule:: {{ module }}
-
-.. autoclass:: {{ objname }}
-
-.. include:: {{module}}.{{objname}}.examples
-
-.. raw:: html
-
-    <div class="clearer"></div>
diff --git a/doc/templates/class_with_call.rst b/doc/templates/class_with_call.rst
deleted file mode 100644
index bc1567709c9d3..0000000000000
--- a/doc/templates/class_with_call.rst
+++ /dev/null
@@ -1,21 +0,0 @@
-..
-    The empty line below should not be removed. It is added such that the `rst_prolog`
-    is added before the :mod: directive. Otherwise, the rendering will show as a
-    paragraph instead of a header.
-
-:mod:`{{module}}`.{{objname}}
-{{ underline }}===============
-
-.. currentmodule:: {{ module }}
-
-.. autoclass:: {{ objname }}
-
-   {% block methods %}
-   .. automethod:: __call__
-   {% endblock %}
-
-.. include:: {{module}}.{{objname}}.examples
-
-.. raw:: html
-
-    <div class="clearer"></div>
diff --git a/doc/templates/deprecated_class.rst b/doc/templates/deprecated_class.rst
deleted file mode 100644
index 5c31936f6fc36..0000000000000
--- a/doc/templates/deprecated_class.rst
+++ /dev/null
@@ -1,28 +0,0 @@
-..
-    The empty line below should not be removed. It is added such that the `rst_prolog`
-    is added before the :mod: directive. Otherwise, the rendering will show as a
-    paragraph instead of a header.
-
-:mod:`{{module}}`.{{objname}}
-{{ underline }}==============
-
-.. meta::
-   :robots: noindex
-
-.. warning::
-   **DEPRECATED**
-
-
-.. currentmodule:: {{ module }}
-
-.. autoclass:: {{ objname }}
-
-   {% block methods %}
-   .. automethod:: __init__
-   {% endblock %}
-
-.. include:: {{module}}.{{objname}}.examples
-
-.. raw:: html
-
-    <div class="clearer"></div>
diff --git a/doc/templates/deprecated_class_with_call.rst b/doc/templates/deprecated_class_with_call.rst
deleted file mode 100644
index 072a31112be50..0000000000000
--- a/doc/templates/deprecated_class_with_call.rst
+++ /dev/null
@@ -1,29 +0,0 @@
-..
-    The empty line below should not be removed. It is added such that the `rst_prolog`
-    is added before the :mod: directive. Otherwise, the rendering will show as a
-    paragraph instead of a header.
-
-:mod:`{{module}}`.{{objname}}
-{{ underline }}===============
-
-.. meta::
-   :robots: noindex
-
-.. warning::
-   **DEPRECATED**
-
-
-.. currentmodule:: {{ module }}
-
-.. autoclass:: {{ objname }}
-
-   {% block methods %}
-   .. automethod:: __init__
-   .. automethod:: __call__
-   {% endblock %}
-
-.. include:: {{module}}.{{objname}}.examples
-
-.. raw:: html
-
-    <div class="clearer"></div>
diff --git a/doc/templates/deprecated_class_without_init.rst b/doc/templates/deprecated_class_without_init.rst
deleted file mode 100644
index a26afbead5451..0000000000000
--- a/doc/templates/deprecated_class_without_init.rst
+++ /dev/null
@@ -1,24 +0,0 @@
-..
-    The empty line below should not be removed. It is added such that the `rst_prolog`
-    is added before the :mod: directive. Otherwise, the rendering will show as a
-    paragraph instead of a header.
-
-:mod:`{{module}}`.{{objname}}
-{{ underline }}==============
-
-.. meta::
-   :robots: noindex
-
-.. warning::
-   **DEPRECATED**
-
-
-.. currentmodule:: {{ module }}
-
-.. autoclass:: {{ objname }}
-
-.. include:: {{module}}.{{objname}}.examples
-
-.. raw:: html
-
-    <div class="clearer"></div>
diff --git a/doc/templates/deprecated_function.rst b/doc/templates/deprecated_function.rst
deleted file mode 100644
index ead5abec27076..0000000000000
--- a/doc/templates/deprecated_function.rst
+++ /dev/null
@@ -1,24 +0,0 @@
-..
-    The empty line below should not be removed. It is added such that the `rst_prolog`
-    is added before the :mod: directive. Otherwise, the rendering will show as a
-    paragraph instead of a header.
-
-:mod:`{{module}}`.{{objname}}
-{{ underline }}====================
-
-.. meta::
-   :robots: noindex
-
-.. warning::
-   **DEPRECATED**
-
-
-.. currentmodule:: {{ module }}
-
-.. autofunction:: {{ objname }}
-
-.. include:: {{module}}.{{objname}}.examples
-
-.. raw:: html
-
-    <div class="clearer"></div>
diff --git a/doc/templates/display_all_class_methods.rst b/doc/templates/display_all_class_methods.rst
deleted file mode 100644
index b179473cf841e..0000000000000
--- a/doc/templates/display_all_class_methods.rst
+++ /dev/null
@@ -1,19 +0,0 @@
-..
-    The empty line below should not be removed. It is added such that the `rst_prolog`
-    is added before the :mod: directive. Otherwise, the rendering will show as a
-    paragraph instead of a header.
-
-:mod:`{{module}}`.{{objname}}
-{{ underline }}==============
-
-.. currentmodule:: {{ module }}
-
-.. autoclass:: {{ objname }}
-
-.. include:: {{module}}.{{objname}}.examples
-.. include:: {{module}}.{{objname}}.from_estimator.examples
-.. include:: {{module}}.{{objname}}.from_predictions.examples
-
-.. raw:: html
-
-    <div class="clearer"></div>
diff --git a/doc/templates/display_only_from_estimator.rst b/doc/templates/display_only_from_estimator.rst
deleted file mode 100644
index 9981910dc8be7..0000000000000
--- a/doc/templates/display_only_from_estimator.rst
+++ /dev/null
@@ -1,18 +0,0 @@
-..
-    The empty line below should not be removed. It is added such that the `rst_prolog`
-    is added before the :mod: directive. Otherwise, the rendering will show as a
-    paragraph instead of a header.
-
-:mod:`{{module}}`.{{objname}}
-{{ underline }}==============
-
-.. currentmodule:: {{ module }}
-
-.. autoclass:: {{ objname }}
-
-.. include:: {{module}}.{{objname}}.examples
-.. include:: {{module}}.{{objname}}.from_estimator.examples
-
-.. raw:: html
-
-    <div class="clearer"></div>
diff --git a/doc/templates/function.rst b/doc/templates/function.rst
deleted file mode 100644
index 93d368ecfe6d5..0000000000000
--- a/doc/templates/function.rst
+++ /dev/null
@@ -1,17 +0,0 @@
-..
-    The empty line below should not be removed. It is added such that the `rst_prolog`
-    is added before the :mod: directive. Otherwise, the rendering will show as a
-    paragraph instead of a header.
-
-:mod:`{{module}}`.{{objname}}
-{{ underline }}====================
-
-.. currentmodule:: {{ module }}
-
-.. autofunction:: {{ objname }}
-
-.. include:: {{module}}.{{objname}}.examples
-
-.. raw:: html
-
-    <div class="clearer"></div>
diff --git a/doc/templates/generate_deprecated.sh b/doc/templates/generate_deprecated.sh
deleted file mode 100755
index a7301fb5dc419..0000000000000
--- a/doc/templates/generate_deprecated.sh
+++ /dev/null
@@ -1,8 +0,0 @@
-#!/bin/bash
-for f in [^d]*; do (head -n2 < $f; echo '
-.. meta::
-   :robots: noindex
-
-.. warning::
-   **DEPRECATED**
-'; tail -n+3 $f) > deprecated_$f; done
diff --git a/doc/templates/index.html b/doc/templates/index.html
index a3c91c30ca765..875a295068f7c 100644
--- a/doc/templates/index.html
+++ b/doc/templates/index.html
@@ -1,25 +1,27 @@
 {% extends "layout.html" %}
 {% set title = 'scikit-learn: machine learning in Python' %}
 
-{% if theme_link_to_live_contributing_page|tobool %}
+{% if is_devrelease|tobool %}
+  {%- set contributing_link = pathto("developers/contributing") %}
+  {%- set contributing_attrs = "" %}
+{%- else %}
   {%- set contributing_link = "https://scikit-learn.org/dev/developers/contributing.html" %}
   {%- set contributing_attrs = 'target="_blank" rel="noopener noreferrer"' %}
-{%- else %}
-  {%- set contributing_link = pathto('developers/contributing') %}
-  {%- set contributing_attrs = '' %}
 {%- endif %}
 
+{%- import "static/webpack-macros.html" as _webpack with context %}
 
-{% block content %}
-<div class="container-fluid sk-landing-bg py-3">
+{% block docs_navbar %}
+{{ super() }}
+
+<div class="container-fluid sk-landing-top-bar py-4">
   <div class="container sk-landing-container">
     <div class="row">
       <div class="col-md-6 mb-3 mb-md-0">
-        <h1 class="sk-landing-header text-white text-monospace">scikit-learn</h1>
-        <h4 class="sk-landing-subheader text-white font-italic mb-3">Machine Learning in Python</h4>
-        <a class="btn sk-landing-btn mb-1" href="{{ pathto('getting_started') }}" role="button">Getting Started</a>
-        <a class="btn sk-landing-btn mb-1" href="{{ pathto(release_highlights) }}" role="button">Release Highlights for {{ release_highlights_version }}</a>
-        <a class="btn sk-landing-btn mb-1" href="https://github.com/scikit-learn/scikit-learn" role="button">GitHub</a>
+        <h1 class="sk-landing-header font-monospace">scikit-learn</h1>
+        <h4 class="sk-landing-subheader fst-italic mb-3">Machine Learning in Python</h4>
+        <a class="btn sk-btn-orange mb-1" href="{{ pathto('getting_started') }}" role="button">Getting Started</a>
+        <a class="btn sk-btn-orange mb-1" href="{{ pathto(release_highlights) }}" role="button">Release Highlights for {{ release_highlights_version }}</a>
       </div>
       <div class="col-md-6 d-flex">
         <ul class="sk-landing-header-body">
@@ -33,239 +35,279 @@ <h4 class="sk-landing-subheader text-white font-italic mb-3">Machine Learning in
   </div>
 </div>
 
-<div class="container sk-landing-container pt-3 body" role="main">
+{% endblock docs_navbar %}
+
+{% block docs_main %}
+
+<div class="container sk-landing-container pt-3 sk-landing-body" role="main">
   <div class="row no-gutters">
+    <!-- Classification -->
     <div class="col-md-4 mb-3 px-md-2 sk-px-xl-4">
-      <div class="card h-100">
+      <div class="card h-100" sk-align-group="1">
         <div class="card-body">
-          <a href="supervised_learning.html#supervised-learning"><h4 class="sk-card-title card-title">Classification</h4></a>
-          <p class="card-text">Identifying which category an object belongs to.</p>
-          <p class="card-text"><strong>Applications:</strong> Spam detection, image recognition.</br>
-          <strong>Algorithms:</strong>
-          <a href="modules/ensemble.html#histogram-based-gradient-boosting">Gradient boosting</a>,
-          <a href="modules/neighbors.html#classification">nearest neighbors</a>,
-          <a href="modules/ensemble.html#forest">random forest</a>,
-          <a href="modules/linear_model.html#logistic-regression">logistic regression</a>,
-          and <a href="supervised_learning.html#supervised-learning">more...</a></p>
+          <h4 class="sk-card-title card-title sk-vert-align" sk-align-name="title">
+            <a href="supervised_learning.html">Classification</a>
+          </h4>
+          <p class="sk-vert-align" sk-align-name="desc">Identifying which category an object belongs to.</p>
+          <p>
+            <strong>Applications:</strong> Spam detection, image recognition.</br>
+            <strong>Algorithms:</strong>
+            <a href="modules/ensemble.html#histogram-based-gradient-boosting">Gradient boosting</a>,
+            <a href="modules/neighbors.html#classification">nearest neighbors</a>,
+            <a href="modules/ensemble.html#forest">random forest</a>,
+            <a href="modules/linear_model.html#logistic-regression">logistic regression</a>,
+            and <a href="supervised_learning.html">more...</a>
+          </p>
         </div>
-        <div class="overflow-hidden mx-2 text-center flex-fill">
-          <a href="auto_examples/classification/plot_classifier_comparison.html"  aria-label="Classification">
-          <img src="_images/sphx_glr_plot_classifier_comparison_001_carousel.png" class="sk-index-img" style="width:initial;max-width:initial" alt="Classifier comparison">
+        <div class="sk-card-img-container overflow-hidden mx-2 flex-fill">
+          <a href="auto_examples/classification/plot_classifier_comparison.html" aria-label="Classification">
+            <img src="_images/sphx_glr_plot_classifier_comparison_001_carousel.png" alt="Classifier comparison">
           </a>
         </div>
-          <a href="auto_examples/index.html#classification" class="sk-btn-primary btn text-white btn-block" role="button">Examples</a>
+        <a href="auto_examples/classification/index.html" class="sk-btn-cyan btn" role="button">Examples</a>
       </div>
     </div>
+    <!-- Regression -->
     <div class="col-md-4 mb-3 px-md-2 sk-px-xl-4">
-      <div class="card h-100">
+      <div class="card h-100" sk-align-group="1">
         <div class="card-body">
-          <a href="supervised_learning.html#supervised-learning"><h4 class="sk-card-title card-title">Regression</h4></a>
-          <p class="card-text">Predicting a continuous-valued attribute associated with an object.</p>
-          <p class="card-text"><strong>Applications:</strong> Drug response, Stock prices.</br>
-          <strong>Algorithms:</strong>
-          <a href="modules/ensemble.html#histogram-based-gradient-boosting">Gradient boosting</a>,
-          <a href="modules/neighbors.html#regression">nearest neighbors</a>,
-          <a href="modules/ensemble.html#forest">random forest</a>,
-          <a href="modules/linear_model.html#ridge-regression-and-classification">ridge</a>,
-          and <a href="supervised_learning.html#supervised-learning">more...</a></p>
+          <h4 class="sk-card-title card-title sk-vert-align" sk-align-name="title">
+            <a href="supervised_learning.html">Regression</a>
+          </h4>
+          <p class="sk-vert-align" sk-align-name="desc">Predicting a continuous-valued attribute associated with an object.</p>
+          <p>
+            <strong>Applications:</strong> Drug response, stock prices.</br>
+            <strong>Algorithms:</strong>
+            <a href="modules/ensemble.html#histogram-based-gradient-boosting">Gradient boosting</a>,
+            <a href="modules/neighbors.html#regression">nearest neighbors</a>,
+            <a href="modules/ensemble.html#forest">random forest</a>,
+            <a href="modules/linear_model.html#ridge-regression-and-classification">ridge</a>,
+            and <a href="supervised_learning.html">more...</a>
+          </p>
         </div>
-        <div class="overflow-hidden mx-2 text-center flex-fill">
-          <a href="auto_examples/ensemble/plot_hgbt_regression.html"  aria-label="Regression">
-          <img src="_images/sphx_glr_plot_hgbt_regression_002.png" class="sk-index-img" alt="Decision Tree Regression with HGBT">
+        <div class="sk-card-img-container overflow-hidden mx-2 flex-fill">
+          <a href="auto_examples/ensemble/plot_hgbt_regression.html" aria-label="Regression">
+            <img src="_images/sphx_glr_plot_hgbt_regression_002.png" alt="Decision Tree Regression with HGBT">
           </a>
         </div>
-          <a href="auto_examples/index.html#examples" class="sk-btn-primary btn text-white btn-block" role="button">Examples</a>
+        <a href="auto_examples/index.html" class="sk-btn-cyan btn" role="button">Examples</a>
       </div>
     </div>
+    <!-- Clustering -->
     <div class="col-md-4 mb-3 px-md-2 sk-px-xl-4">
-      <div class="card h-100">
+      <div class="card h-100" sk-align-group="1">
         <div class="card-body">
-          <a href="modules/clustering.html#clustering"><h4 class="sk-card-title card-title">Clustering</h4></a>
-          <p class="card-text">Automatic grouping of similar objects into sets.</p>
-          <p class="card-text"><strong>Applications:</strong> Customer segmentation, Grouping experiment outcomes</br>
-          <strong>Algorithms:</strong>
-          <a href="modules/clustering.html#k-means">k-Means</a>,
-          <a href="modules/clustering.html#hdbscan">HDBSCAN</a>,
-          <a href="modules/clustering.html#hierarchical-clustering">hierarchical
-	  clustering</a>,
-          and <a href="modules/clustering.html#clustering">more...</a></p>
+          <h4 class="sk-card-title card-title sk-vert-align" sk-align-name="title">
+            <a href="modules/clustering.html">Clustering</a>
+          </h4>
+          <p class="sk-vert-align" sk-align-name="desc">Automatic grouping of similar objects into sets.</p>
+          <p>
+            <strong>Applications:</strong> Customer segmentation, grouping experiment outcomes.</br>
+            <strong>Algorithms:</strong>
+            <a href="modules/clustering.html#k-means">k-Means</a>,
+            <a href="modules/clustering.html#hdbscan">HDBSCAN</a>,
+            <a href="modules/clustering.html#hierarchical-clustering">hierarchical clustering</a>,
+            and <a href="modules/clustering.html">more...</a>
+          </p>
         </div>
-        <div class="overflow-hidden mx-2 text-center flex-fill">
-          <a href="auto_examples/cluster/plot_kmeans_digits.html"  aria-label="Clustering">
-          <img src="_images/sphx_glr_plot_kmeans_digits_thumb.png" class="sk-index-img" alt="A demo of K-Means clustering on the handwritten digits data">
+        <div class="sk-card-img-container overflow-hidden mx-2 flex-fill">
+          <a href="auto_examples/cluster/plot_kmeans_digits.html" aria-label="Clustering">
+            <img src="_images/sphx_glr_plot_kmeans_digits_thumb.png" alt="A demo of K-Means clustering on the handwritten digits data">
           </a>
         </div>
-          <a href="auto_examples/index.html#cluster-examples" class="sk-btn-primary btn text-white btn-block" role="button">Examples</a>
+        <a href="auto_examples/cluster/index.html" class="sk-btn-cyan btn" role="button">Examples</a>
       </div>
     </div>
+    <!-- Dimensionality reduction -->
     <div class="col-md-4 mb-3 px-md-2 sk-px-xl-4">
-      <div class="card h-100">
+      <div class="card h-100" sk-align-group="2">
         <div class="card-body">
-          <a href="modules/decomposition.html#decompositions"><h4 class="sk-card-title card-title">Dimensionality reduction</h4></a>
-          <p class="card-text">Reducing the number of random variables to consider.</p>
-          <p class="card-text"><strong>Applications:</strong> Visualization, Increased efficiency</br>
-          <strong>Algorithms:</strong>
-          <a href="modules/decomposition.html#pca">PCA</a>,
-          <a href="modules/feature_selection.html#feature-selection">feature selection</a>,
-          <a href="modules/decomposition.html#nmf">non-negative matrix factorization</a>,
-          and <a href="modules/decomposition.html#decompositions">more...</a></p>
+          <h4 class="sk-card-title card-title sk-vert-align" sk-align-name="title">
+            <a href="modules/decomposition.html">Dimensionality reduction</a>
+          </h4>
+          <p class="sk-vert-align" sk-align-name="desc">Reducing the number of random variables to consider.</p>
+          <p>
+            <strong>Applications:</strong> Visualization, increased efficiency.</br>
+            <strong>Algorithms:</strong>
+            <a href="modules/decomposition.html#pca">PCA</a>,
+            <a href="modules/feature_selection.html#feature-selection">feature selection</a>,
+            <a href="modules/decomposition.html#nmf">non-negative matrix factorization</a>,
+            and <a href="modules/decomposition.html">more...</a>
+          </p>
         </div>
-        <div class="overflow-hidden mx-2 text-center flex-fill">
-          <a href="auto_examples/decomposition/plot_pca_iris.html"  aria-label="Dimensionality reduction">
-          <img src="_images/sphx_glr_plot_pca_iris_thumb.png" class="sk-index-img" alt="PCA example with Iris Data-set">
+        <div class="sk-card-img-container overflow-hidden mx-2 flex-fill">
+          <a href="auto_examples/decomposition/plot_pca_iris.html" aria-label="Dimensionality reduction">
+            <img src="_images/sphx_glr_plot_pca_iris_thumb.png" alt="PCA example with Iris Data-set">
           </a>
         </div>
-          <a href="auto_examples/index.html#decomposition-examples" class="sk-btn-primary btn text-white btn-block" role="button">Examples</a>
+        <a href="auto_examples/decomposition/index.html" class="sk-btn-cyan btn" role="button">Examples</a>
       </div>
     </div>
+    <!-- Model selection -->
     <div class="col-md-4 mb-3 px-md-2 sk-px-xl-4">
-      <div class="card h-100">
+      <div class="card h-100" sk-align-group="2">
         <div class="card-body">
-          <a href="model_selection.html#model-selection"><h4 class="sk-card-title card-title">Model selection</h4></a>
-          <p class="card-text">Comparing, validating and choosing parameters and models.</p>
-          <p class="card-text"><strong>Applications:</strong> Improved accuracy via parameter tuning</br>
-          <strong>Algorithms:</strong>
-          <a href="modules/grid_search.html#grid-search">grid search</a>,
-          <a href="modules/cross_validation.html#cross-validation">cross validation</a>,
-          <a href="modules/model_evaluation.html#model-evaluation">metrics</a>,
-          and <a href="model_selection.html">more...</a></p>
+          <h4 class="sk-card-title card-title sk-vert-align" sk-align-name="title">
+            <a href="model_selection.html">Model selection</a>
+          </h4>
+          <p class="sk-vert-align" sk-align-name="desc">Comparing, validating and choosing parameters and models.</p>
+          <p>
+            <strong>Applications:</strong> Improved accuracy via parameter tuning.</br>
+            <strong>Algorithms:</strong>
+            <a href="modules/grid_search.html">Grid search</a>,
+            <a href="modules/cross_validation.html">cross validation</a>,
+            <a href="modules/model_evaluation.html">metrics</a>,
+            and <a href="model_selection.html">more...</a>
+          </p>
         </div>
-        <div class="overflow-hidden mx-2 text-center flex-fill">
-          <a href="auto_examples/model_selection/plot_multi_metric_evaluation.html"  aria-label="Model selection">
-            <img src="_images/sphx_glr_plot_multi_metric_evaluation_thumb.png" class="sk-index-img" alt="Demonstration of multi-metric evaluation on cross_val_score and GridSearchCV">
+        <div class="sk-card-img-container overflow-hidden mx-2 flex-fill">
+          <a href="auto_examples/model_selection/plot_multi_metric_evaluation.html" aria-label="Model selection">
+            <img src="_images/sphx_glr_plot_multi_metric_evaluation_thumb.png" alt="Demonstration of multi-metric evaluation on cross_val_score and GridSearchCV">
           </a>
         </div>
-          <a href="auto_examples/index.html#model-selection" class="sk-btn-primary btn text-white btn-block" role="button">Examples</a>
+        <a href="auto_examples/model_selection/index.html" class="sk-btn-cyan btn" role="button">Examples</a>
       </div>
     </div>
+    <!-- Preprocessing -->
     <div class="col-md-4 mb-3 px-md-2 sk-px-xl-4">
-      <div class="card h-100">
+      <div class="card h-100" sk-align-group="2">
         <div class="card-body">
-          <a href="modules/preprocessing.html#preprocessing"><h4 class="sk-card-title card-title">Preprocessing</h4></a>
-          <p class="card-text">Feature extraction and normalization.</p>
-          <p class="card-text"><strong>Applications:</strong>  Transforming input data such as text for use with machine learning algorithms.</br>
-          <strong>Algorithms:</strong>
-          <a href="modules/preprocessing.html#preprocessing">preprocessing</a>,
-          <a href="modules/feature_extraction.html#feature-extraction">feature extraction</a>,
-          and <a href="modules/preprocessing.html#preprocessing">more...</a></p>
+          <h4 class="sk-card-title card-title sk-vert-align" sk-align-name="title">
+            <a href="modules/preprocessing.html">Preprocessing</a>
+          </h4>
+          <p class="sk-vert-align" sk-align-name="desc">Feature extraction and normalization.</p>
+          <p>
+            <strong>Applications:</strong> Transforming input data such as text for use with machine learning algorithms.</br>
+            <strong>Algorithms:</strong>
+            <a href="modules/preprocessing.html">Preprocessing</a>,
+            <a href="modules/feature_extraction.html">feature extraction</a>,
+            and <a href="modules/preprocessing.html">more...</a>
+          </p>
         </div>
-        <div class="overflow-hidden mx-2 text-center flex-fill">
-          <a href="auto_examples/preprocessing/plot_discretization_strategies.html"  aria-label="Preprocessing">
-          <img src="_images/sphx_glr_plot_discretization_strategies_thumb.png" class="sk-index-img" alt="Demonstrating the different strategies of KBinsDiscretizer">
+        <div class="sk-card-img-container overflow-hidden mx-2 flex-fill">
+          <a href="auto_examples/preprocessing/plot_discretization_strategies.html" aria-label="Preprocessing">
+            <img src="_images/sphx_glr_plot_discretization_strategies_thumb.png" alt="Demonstrating the different strategies of KBinsDiscretizer">
           </a>
         </div>
-          <a href="auto_examples/index.html#preprocessing" class="sk-btn-primary btn text-white btn-block" role="button">Examples</a>
+        <a href="auto_examples/preprocessing/index.html" class="sk-btn-cyan btn" role="button">Examples</a>
       </div>
     </div>
   </div>
 </div>
 
-<div class="container-fluid sk-landing-bg-more-info py-3">
-  <div class="container sk-landing-container">
+{% endblock docs_main %}
+
+{% block footer %}
+
+<div class="container-fluid sk-landing-more-info py-3">
+  <div class="container sk-landing-container bd-page-width">
     <div class="row">
+      <!-- News -->
       <div class="col-md-4">
         <h4 class="sk-landing-call-header">News</h4>
         <ul class="sk-landing-call-list list-unstyled">
-        <li><strong>On-going development:</strong>
-        <a href="whats_new/v1.5.html#version-1-5-0">scikit-learn 1.5 (Changelog)</a>
-        </li>
-        <li><strong>April 2024.</strong> scikit-learn 1.4.2 is available for download (<a href="whats_new/v1.4.html#version-1-4-2">Changelog</a>).
-        </li>
-        <li><strong>February 2024.</strong> scikit-learn 1.4.1.post1 is available for download (<a href="whats_new/v1.4.html#version-1-4-1-post1">Changelog</a>).
-        </li>
-        <li><strong>January 2024.</strong> scikit-learn 1.4.0 is available for download (<a href="whats_new/v1.4.html#version-1-4-0">Changelog</a>).
-        </li>
-        <li><strong>October 2023.</strong> scikit-learn 1.3.2 is available for download (<a href="whats_new/v1.3.html#version-1-3-2">Changelog</a>).
-        </li>
-	      <li><strong>September 2023.</strong> scikit-learn 1.3.1 is available for download (<a href="whats_new/v1.3.html#version-1-3-1">Changelog</a>).
-        </li>
-        <li><strong>June 2023.</strong> scikit-learn 1.3.0 is available for download (<a href="whats_new/v1.3.html#version-1-3-0">Changelog</a>).
-	      </li>
-        <li><strong>All releases:</strong>
-        <a href="https://scikit-learn.org/dev/whats_new.html"><strong>What's new</strong> (Changelog)</a>
-        </li>
+          <li><strong>On-going development:</strong> <a href="whats_new/v1.6.html#version-1-6-0">scikit-learn 1.6 (Changelog)</a>.</li>
+          <li><strong>July 2024.</strong> scikit-learn 1.5.1 is available for download (<a href="whats_new/v1.5.html#version-1-5-1">Changelog</a>).</li>
+          <li><strong>May 2024.</strong> scikit-learn 1.5.0 is available for download (<a href="whats_new/v1.5.html#version-1-5-0">Changelog</a>).</li>
+          <li><strong>April 2024.</strong> scikit-learn 1.4.2 is available for download (<a href="whats_new/v1.4.html#version-1-4-2">Changelog</a>).</li>
+          <li><strong>February 2024.</strong> scikit-learn 1.4.1.post1 is available for download (<a href="whats_new/v1.4.html#version-1-4-1-post1">Changelog</a>).</li>
+          <li><strong>January 2024.</strong> scikit-learn 1.4.0 is available for download (<a href="whats_new/v1.4.html#version-1-4-0">Changelog</a>).</li>
+          <li><strong>October 2023.</strong> scikit-learn 1.3.2 is available for download (<a href="whats_new/v1.3.html#version-1-3-2">Changelog</a>).</li>
+          <li><strong>September 2023.</strong> scikit-learn 1.3.1 is available for download (<a href="whats_new/v1.3.html#version-1-3-1">Changelog</a>).</li>
+          <li><strong>June 2023.</strong> scikit-learn 1.3.0 is available for download (<a href="whats_new/v1.3.html#version-1-3-0">Changelog</a>).</li>
+          <li><strong>All releases:</strong> <a href="https://scikit-learn.org/dev/whats_new.html"><strong>What's new</strong> (Changelog)</a>.</li>
         </ul>
       </div>
+      <!-- Community -->
       <div class="col-md-4">
         <h4 class="sk-landing-call-header">Community</h4>
         <ul class="sk-landing-call-list list-unstyled">
-        <li><strong>About us:</strong> See <a href="about.html#people">authors</a> and <a href="{{ contributing_link }}" {{ contributing_attrs }}>contributing</a></li>
-        <li><strong>More Machine Learning:</strong> Find <a href="related_projects.html">related projects</a></li>
-        <li><strong>Questions?</strong> See <a href="faq.html">FAQ</a>, <a href="support.html">support</a>, and <a href="https://stackoverflow.com/questions/tagged/scikit-learn">stackoverflow</a></li>
-        <li><strong>Subscribe to the</strong> <a href="https://mail.python.org/mailman/listinfo/scikit-learn">mailing list</a></li>
-        <li><strong>Blog:</strong> <a href="https://blog.scikit-learn.org">blog.scikit-learn.org</a></li>
-        <li><strong>Logos & Branding:</strong> <a href="https://github.com/scikit-learn/scikit-learn/tree/main/doc/logos">logos and branding</a></li>
-        <li><strong>Calendar:</strong> <a href="https://blog.scikit-learn.org/calendar/">calendar</a></li>
-        <li><strong>Twitter:</strong> <a href="https://twitter.com/scikit_learn">@scikit_learn</a></li>
-        <li><strong>LinkedIn:</strong> <a href="https://www.linkedin.com/company/scikit-learn">linkedin/scikit-learn</a></li>
-        <li><strong>YouTube:</strong> <a href="https://www.youtube.com/channel/UCJosFjYm0ZYVUARxuOZqnnw/playlists">youtube.com/scikit-learn</a></li>
-        <li><strong>Facebook:</strong> <a href="https://www.facebook.com/scikitlearnofficial/">@scikitlearnofficial</a></li>
-        <li><strong>Instagram:</strong> <a href="https://www.instagram.com/scikitlearnofficial/">@scikitlearnofficial</a></li>
-        <li><strong>TikTok:</strong> <a href="https://www.tiktok.com/@scikit.learn">@scikit.learn</a></li>
-        <li><strong>Mastodon:</strong> <a href="https://mastodon.social/@sklearn@fosstodon.org">@sklearn</a></li>
-        <li><strong>Discord:</strong> <a href="https://discord.gg/h9qyrK8Jc8">@scikit-learn</a></li>
-        <li>Communication on all channels should respect <a href="https://www.python.org/psf/conduct/">PSF's code of conduct.</a></li>
+          <li><strong>About us:</strong> See <a href="about.html#the-people-behind-scikit-learn">people</a> and <a href="{{ contributing_link }}" {{ contributing_attrs }}>contributing</a></li>
+          <li><strong>More Machine Learning:</strong> Find <a href="related_projects.html">related projects</a></li>
+          <li><strong>Questions?</strong> See <a href="faq.html">FAQ</a>, <a href="support.html">support</a>, and <a href="https://stackoverflow.com/questions/tagged/scikit-learn">stackoverflow</a></li>
+          <li><strong>Subscribe to the</strong> <a href="https://mail.python.org/mailman/listinfo/scikit-learn">mailing list</a></li>
+          <li><strong>Blog:</strong> <a href="https://blog.scikit-learn.org">blog.scikit-learn.org</a></li>
+          <li><strong>Logos & Branding:</strong> <a href="https://github.com/scikit-learn/scikit-learn/tree/main/doc/logos">logos and branding</a></li>
+          <li><strong>Calendar:</strong> <a href="https://blog.scikit-learn.org/calendar/">calendar</a></li>
+          <li><strong>Twitter:</strong> <a href="https://twitter.com/scikit_learn">@scikit_learn</a></li>
+          <li><strong>LinkedIn:</strong> <a href="https://www.linkedin.com/company/scikit-learn">linkedin/scikit-learn</a></li>
+          <li><strong>YouTube:</strong> <a href="https://www.youtube.com/channel/UCJosFjYm0ZYVUARxuOZqnnw/playlists">youtube.com/scikit-learn</a></li>
+          <li><strong>Facebook:</strong> <a href="https://www.facebook.com/scikitlearnofficial/">@scikitlearnofficial</a></li>
+          <li><strong>Instagram:</strong> <a href="https://www.instagram.com/scikitlearnofficial/">@scikitlearnofficial</a></li>
+          <li><strong>TikTok:</strong> <a href="https://www.tiktok.com/@scikit.learn">@scikit.learn</a></li>
+          <li><strong>Mastodon:</strong> <a href="https://mastodon.social/@sklearn@fosstodon.org">@sklearn</a></li>
+          <li><strong>Discord:</strong> <a href="https://discord.gg/h9qyrK8Jc8">@scikit-learn</a></li>
+          <li>Communication on all channels should respect <a href="https://www.python.org/psf/conduct/">PSF's code of conduct.</a></li>
         </ul>
-
-        <a class="btn btn-warning btn-big sk-donate-btn mb-1" href="https://numfocus.org/donate-to-scikit-learn">Help us, <strong>donate!</strong></a>
-        <a class="btn btn-warning btn-big mb-1" href="about.html#citing-scikit-learn"><strong>Cite us!</strong></a>
+        <p>
+          <a class="btn sk-btn-orange mb-1" href="https://numfocus.org/donate-to-scikit-learn">Help us, <strong>donate!</strong></a>
+          <a class="btn sk-btn-orange mb-1" href="about.html#citing-scikit-learn"><strong>Cite us!</strong></a>
+        </p>
       </div>
+      <!--Testimonials -->
       <div class="col-md-4">
         <h4 class="sk-landing-call-header">Who uses scikit-learn?</h4>
-        <div id="carouselExampleSlidesOnly" class="carousel slide" data-ride="carousel">
-        <div class="carousel-inner">
+        <div id="skWhoUsesCarousel" class="carousel slide sk-who-uses-carousel" data-bs-ride="carousel" data-bs-interval="5000">
+          <div class="carousel-inner">
             <div class="carousel-item active">
-            <img class="d-block mx-auto sk-who-uses-carousel-img img-thumbnail" src="_images/inria.png" alt="inria">
-            <em>"We use scikit-learn to support leading-edge basic research [...]"</em>
+              <img class="d-block mx-auto img-thumbnail" src="_images/inria.png" alt="inria">
+              <em>"We use scikit-learn to support leading-edge basic research [...]"</em>
             </div>
             <div class="carousel-item">
-            <img class="d-block mx-auto sk-who-uses-carousel-img img-thumbnail" src="_images/spotify.png" alt="spotify">
-            <em>"I think it's the most well-designed ML package I've seen so far."</em>
+              <img class="d-block mx-auto img-thumbnail" src="_images/spotify.png" alt="spotify">
+              <em>"I think it's the most well-designed ML package I've seen so far."</em>
             </div>
             <div class="carousel-item">
-            <img class="d-block mx-auto sk-who-uses-carousel-img img-thumbnail" src="_images/change-logo.png" alt="change-logo">
-            <em>"scikit-learn's ease-of-use, performance and overall variety of algorithms implemented has proved invaluable [...]."</em>
+              <img class="d-block mx-auto img-thumbnail" src="_images/change-logo.png" alt="change-logo">
+              <em>"scikit-learn's ease-of-use, performance and overall variety of algorithms implemented has proved invaluable [...]"</em>
             </div>
             <div class="carousel-item">
-            <img class="d-block mx-auto sk-who-uses-carousel-img img-thumbnail" src="_images/telecomparistech.jpg" alt="telecomparistech">
-            <em>"The great benefit of scikit-learn is its fast learning curve [...]"</em>
+              <img class="d-block mx-auto img-thumbnail" src="_images/telecomparistech.jpg" alt="telecomparistech">
+              <em>"The great benefit of scikit-learn is its fast learning curve [...]"</em>
             </div>
             <div class="carousel-item">
-            <img class="d-block mx-auto sk-who-uses-carousel-img img-thumbnail" src="_images/aweber.png" alt="aweber">
-            <em>"It allows us to do AWesome stuff we would not otherwise accomplish"</em>
+              <img class="d-block mx-auto img-thumbnail" src="_images/aweber.png" alt="aweber">
+              <em>"It allows us to do AWesome stuff we would not otherwise accomplish."</em>
             </div>
             <div class="carousel-item">
-            <img class="d-block mx-auto sk-who-uses-carousel-img img-thumbnail" src="_images/yhat.png" alt="yhat">
-            <em>"scikit-learn makes doing advanced analysis in Python accessible to anyone."</em>
+              <img class="d-block mx-auto img-thumbnail" src="_images/yhat.png" alt="yhat">
+              <em>"scikit-learn makes doing advanced analysis in Python accessible to anyone."</em>
             </div>
           </div>
         </div>
-        <p class="text-right">
-            <a href="testimonials/testimonials.html">More testimonials</a>
+        <p class="sk-more-testimonials">
+          <a href="testimonials/testimonials.html">More testimonials...</a>
         </p>
       </div>
     </div>
   </div>
 </div>
-<div class="container-fluid py-3">
+
+<div class="container-fluid sk-landing-footer py-3">
   <div class="container sk-landing-container">
-        <a class="sk-footer-funding-link" href="about.html#funding">
-        <div class="text-center">
-                <p class="mt-2">
-                  scikit-learn development and maintenance are financially supported by
-                </p>
-                <img class="sk-footer-funding-logo" src="_static/probabl.png" title="Probabl">
-                <img class="sk-footer-funding-logo" src="_static/inria-small.png" title="INRIA">
-                <img class="sk-footer-funding-logo" src="_static/chanel-small.png" title="Chanel" >
-                <img class="sk-footer-funding-logo" src="_static/axa-small.png" title="AXA Assurances" >
-                <img class="sk-footer-funding-logo" src="_static/bnp-small.png" title="BNP Paris Bas Cardif" >
-                <img class="sk-footer-funding-logo" src="_static/microsoft-small.png" title="Microsoft" >
-                <img class="sk-footer-funding-logo" src="_static/dataiku-small.png" title="Dataiku" >
-                <img class="sk-footer-funding-logo" src="_static/huggingface_logo-noborder.png" title="Hugging Face" >
-                <img class="sk-footer-funding-logo" src="_static/nvidia-small.png" title="Nvidia" >
-                <img class="sk-footer-funding-logo" src="_static/quansight-labs-small.png" title="Quansight Labs" >
+    <a class="sk-footer-funding-link" href="about.html#funding">
+      <div class="text-center">
+        <p class="mt-2 sk-footer-funding-text">
+          scikit-learn development and maintenance are financially supported by
+        </p>
+        <div class="sk-footer-funding-logos">
+          <img src="_static/probabl.png" title="Probabl">
+          <img src="_static/inria-small.png" title="INRIA">
+          <img src="_static/chanel-small.png" title="Chanel">
+          <img src="_static/axa-small.png" title="AXA Assurances">
+          <img src="_static/bnp-small.png" title="BNP Paris Bas Cardif">
+          <img src="_static/microsoft-small.png" title="Microsoft">
+          <img src="_static/dataiku-small.png" title="Dataiku">
+          <img src="_static/nvidia-small.png" title="Nvidia">
+          <img src="_static/quansight-labs-small.png" title="Quansight Labs">
         </div>
-        </a>
+      </div>
+    </a>
   </div>
 </div>
-{% endblock %}
+
+{% endblock footer %}
+
+{%- block scripts_end %}
+{{ _webpack.body_post() }}
+{%- endblock scripts_end %}
diff --git a/doc/testimonials/testimonials.rst b/doc/testimonials/testimonials.rst
index fbf53ae36ef2c..3c8c15b2e25ee 100644
--- a/doc/testimonials/testimonials.rst
+++ b/doc/testimonials/testimonials.rst
@@ -1,1151 +1,752 @@
-.. _testimonials:
-
-================================================================================
-Who is using scikit-learn?
-================================================================================
+:orphan:
 
-.. raw:: html
-
-  <div class="testimonial">
+.. title:: Testimonials
 
+.. _testimonials:
 
-.. to add a testimonials, just XXX
+==========================
+Who is using scikit-learn?
+==========================
 
 `J.P.Morgan <https://www.jpmorgan.com>`_
-------------------------------------------
-
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-Scikit-learn is an indispensable part of the Python machine learning
-toolkit at JPMorgan. It is very widely used across all parts of the bank
-for classification, predictive analytics, and very many other machine
-learning tasks. Its straightforward API, its breadth of algorithms, and
-the quality of its documentation combine to make scikit-learn
-simultaneously very approachable and very powerful.
+----------------------------------------
 
-.. raw:: html
+.. div:: sk-text-image-grid-large
 
-   <span class="testimonial-author">
+  .. div:: text-box
 
-Stephen Simmons, VP, Athena Research, JPMorgan
+    Scikit-learn is an indispensable part of the Python machine learning
+    toolkit at JPMorgan. It is very widely used across all parts of the bank
+    for classification, predictive analytics, and very many other machine
+    learning tasks. Its straightforward API, its breadth of algorithms, and
+    the quality of its documentation combine to make scikit-learn
+    simultaneously very approachable and very powerful.
 
-.. raw:: html
+    .. rst-class:: annotation
 
-   </span>
-    </div>
-    <div class="sk-testimonial-div-box">
+      Stephen Simmons, VP, Athena Research, JPMorgan
 
-.. image:: images/jpmorgan.png
-    :width: 120pt
-    :align: center
-    :target: https://www.jpmorgan.com
+  .. div:: image-box
 
-.. raw:: html
+    .. image:: images/jpmorgan.png
+      :target: https://www.jpmorgan.com
 
-   </div>
-   </div>
 
 `Spotify <https://www.spotify.com>`_
 ------------------------------------
 
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-Scikit-learn provides a toolbox with solid implementations of a bunch of
-state-of-the-art models and makes it easy to plug them into existing
-applications. We've been using it quite a lot for music recommendations at
-Spotify and I think it's the most well-designed ML package I've seen so
-far.
-
-.. raw:: html
+.. div:: sk-text-image-grid-large
 
-   <span class="testimonial-author">
+  .. div:: text-box
 
-Erik Bernhardsson, Engineering Manager Music Discovery & Machine Learning, Spotify
+    Scikit-learn provides a toolbox with solid implementations of a bunch of
+    state-of-the-art models and makes it easy to plug them into existing
+    applications. We've been using it quite a lot for music recommendations at
+    Spotify and I think it's the most well-designed ML package I've seen so far.
 
-.. raw:: html
+    .. rst-class:: annotation
 
-   </span>
-    </div>
-    <div class="sk-testimonial-div-box">
+      Erik Bernhardsson, Engineering Manager Music Discovery & Machine Learning, Spotify
 
-.. image:: images/spotify.png
-    :width: 120pt
-    :align: center
-    :target: https://www.spotify.com
+  .. div:: image-box
 
-.. raw:: html
+    .. image:: images/spotify.png
+      :target: https://www.spotify.com
 
-   </div>
-   </div>
 
 `Inria <https://www.inria.fr/>`_
 --------------------------------
 
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-.. title Scikit-learn for efficient and easier machine learning research
-.. Author: Gaël Varoquaux
-
-
-At INRIA, we use scikit-learn to support leading-edge basic research in many
-teams: `Parietal <https://team.inria.fr/parietal/>`_ for neuroimaging, `Lear
-<https://lear.inrialpes.fr/>`_ for computer vision, `Visages
-<https://team.inria.fr/visages/>`_ for medical image analysis, `Privatics
-<https://team.inria.fr/privatics>`_ for security. The project is a fantastic
-tool to address difficult applications of machine learning in an academic
-environment as it is performant and versatile, but all easy-to-use and well
-documented, which makes it well suited to grad students.
+.. div:: sk-text-image-grid-large
 
+  .. div:: text-box
 
-.. raw:: html
+    At INRIA, we use scikit-learn to support leading-edge basic research in many
+    teams: `Parietal <https://team.inria.fr/parietal/>`_ for neuroimaging, `Lear
+    <https://lear.inrialpes.fr/>`_ for computer vision, `Visages
+    <https://team.inria.fr/visages/>`_ for medical image analysis, `Privatics
+    <https://team.inria.fr/privatics>`_ for security. The project is a fantastic
+    tool to address difficult applications of machine learning in an academic
+    environment as it is performant and versatile, but all easy-to-use and well
+    documented, which makes it well suited to grad students.
 
-   <span class="testimonial-author">
+    .. rst-class:: annotation
 
-Gaël Varoquaux, research at Parietal
+      Gaël Varoquaux, research at Parietal
 
-.. raw:: html
+  .. div:: image-box
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
-
-.. image:: images/inria.png
-    :width: 120pt
-    :align: center
-    :target: https://www.inria.fr/
-
-.. raw:: html
-
-   </div>
-   </div>
+    .. image:: images/inria.png
+      :target: https://www.inria.fr/
 
 
 `betaworks <https://betaworks.com>`_
 ------------------------------------
 
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-Betaworks is a NYC-based startup studio that builds new products, grows
-companies, and invests in others. Over the past 8 years we've launched a
-handful of social data analytics-driven services, such as Bitly, Chartbeat,
-digg and Scale Model. Consistently the betaworks data science team uses
-Scikit-learn for a variety of tasks. From exploratory analysis, to product
-development, it is an essential part of our toolkit. Recent uses are included
-in `digg's new video recommender system
-<https://medium.com/i-data/the-digg-video-recommender-2f9ade7c4ba3>`_,
-and Poncho's `dynamic heuristic subspace clustering
-<https://medium.com/@DiggData/scaling-poncho-using-data-ca24569d56fd>`_.
+.. div:: sk-text-image-grid-large
 
-.. raw:: html
+  .. div:: text-box
 
-   <span class="testimonial-author">
+    Betaworks is a NYC-based startup studio that builds new products, grows
+    companies, and invests in others. Over the past 8 years we've launched a
+    handful of social data analytics-driven services, such as Bitly, Chartbeat,
+    digg and Scale Model. Consistently the betaworks data science team uses
+    Scikit-learn for a variety of tasks. From exploratory analysis, to product
+    development, it is an essential part of our toolkit. Recent uses are included
+    in `digg's new video recommender system
+    <https://medium.com/i-data/the-digg-video-recommender-2f9ade7c4ba3>`_,
+    and Poncho's `dynamic heuristic subspace clustering
+    <https://medium.com/@DiggData/scaling-poncho-using-data-ca24569d56fd>`_.
 
-Gilad Lotan, Chief Data Scientist
+    .. rst-class:: annotation
 
-.. raw:: html
+      Gilad Lotan, Chief Data Scientist
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+  .. div:: image-box
 
-.. image:: images/betaworks.png
-    :width: 120pt
-    :align: center
-    :target: https://betaworks.com
-
-.. raw:: html
-
-   </div>
-   </div>
+    .. image:: images/betaworks.png
+      :target: https://betaworks.com
 
 
 `Hugging Face <https://huggingface.co>`_
 ----------------------------------------
 
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-At Hugging Face we're using NLP and probabilistic models to generate
-conversational Artificial intelligences that are fun to chat with. Despite using
-deep neural nets for `a few <https://medium.com/huggingface/understanding-emotions-from-keras-to-pytorch-3ccb61d5a983>`_
-of our `NLP tasks <https://huggingface.co/coref/>`_, scikit-learn is still the bread-and-butter of
-our daily machine learning routine. The ease of use and predictability of the
-interface, as well as the straightforward mathematical explanations that are
-here when you need them, is the killer feature. We use a variety of scikit-learn
-models in production and they are also operationally very pleasant to work with.
+.. div:: sk-text-image-grid-large
 
-.. raw:: html
+  .. div:: text-box
 
-   <span class="testimonial-author">
+    At Hugging Face we're using NLP and probabilistic models to generate
+    conversational Artificial intelligences that are fun to chat with. Despite using
+    deep neural nets for `a few <https://medium.com/huggingface/understanding-emotions-from-keras-to-pytorch-3ccb61d5a983>`_
+    of our `NLP tasks <https://huggingface.co/coref/>`_, scikit-learn is still the
+    bread-and-butter of our daily machine learning routine. The ease of use and
+    predictability of the interface, as well as the straightforward mathematical
+    explanations that are here when you need them, is the killer feature. We use a
+    variety of scikit-learn models in production and they are also operationally very
+    pleasant to work with.
 
-Julien Chaumond, Chief Technology Officer
+    .. rst-class:: annotation
 
-.. raw:: html
+      Julien Chaumond, Chief Technology Officer
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+  .. div:: image-box
 
-.. image:: images/huggingface.png
-    :width: 120pt
-    :align: center
-    :target: https://huggingface.co
-
-.. raw:: html
-
-   </div>
-   </div>
+    .. image:: images/huggingface.png
+      :target: https://huggingface.co
 
 
 `Evernote <https://evernote.com>`_
 ----------------------------------
 
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-Building a classifier is typically an iterative process of exploring
-the data, selecting the features (the attributes of the data believed
-to be predictive in some way), training the models, and finally
-evaluating them. For many of these tasks, we relied on the excellent
-scikit-learn package for Python.
+.. div:: sk-text-image-grid-large
 
-`Read more <http://blog.evernote.com/tech/2013/01/22/stay-classified/>`_
+  .. div:: text-box
 
-.. raw:: html
+    Building a classifier is typically an iterative process of exploring
+    the data, selecting the features (the attributes of the data believed
+    to be predictive in some way), training the models, and finally
+    evaluating them. For many of these tasks, we relied on the excellent
+    scikit-learn package for Python.
 
-   <span class="testimonial-author">
+    `Read more <http://blog.evernote.com/tech/2013/01/22/stay-classified/>`_
 
-Mark Ayzenshtat, VP, Augmented Intelligence
+    .. rst-class:: annotation
 
-.. raw:: html
+      Mark Ayzenshtat, VP, Augmented Intelligence
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+  .. div:: image-box
 
-.. image:: images/evernote.png
-    :width: 120pt
-    :align: center
-    :target: https://evernote.com
+    .. image:: images/evernote.png
+      :target: https://evernote.com
 
-.. raw:: html
-
-   </div>
-   </div>
 
 `Télécom ParisTech <https://www.telecom-paristech.fr/>`_
 --------------------------------------------------------
 
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-At Telecom ParisTech, scikit-learn is used for hands-on sessions and home
-assignments in introductory and advanced machine learning courses. The classes
-are for undergrads and masters students. The great benefit of scikit-learn is
-its fast learning curve that allows students to quickly start working on
-interesting and motivating problems.
-
-.. raw:: html
+.. div:: sk-text-image-grid-large
 
-   <span class="testimonial-author">
+  .. div:: text-box
 
-Alexandre Gramfort, Assistant Professor
+    At Telecom ParisTech, scikit-learn is used for hands-on sessions and home
+    assignments in introductory and advanced machine learning courses. The classes
+    are for undergrads and masters students. The great benefit of scikit-learn is
+    its fast learning curve that allows students to quickly start working on
+    interesting and motivating problems.
 
-.. raw:: html
+    .. rst-class:: annotation
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+      Alexandre Gramfort, Assistant Professor
 
-.. image:: images/telecomparistech.jpg
-    :width: 120pt
-    :align: center
-    :target: https://www.telecom-paristech.fr/
+  .. div:: image-box
 
-.. raw:: html
-
-   </div>
-   </div>
+    .. image:: images/telecomparistech.jpg
+      :target: https://www.telecom-paristech.fr/
 
 
 `Booking.com <https://www.booking.com>`_
------------------------------------------
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-At Booking.com, we use machine learning algorithms for many different
-applications, such as recommending hotels and destinations to our customers,
-detecting fraudulent reservations, or scheduling our customer service agents.
-Scikit-learn is one of the tools we use when implementing standard algorithms
-for prediction tasks. Its API and documentations are excellent and make it easy
-to use. The scikit-learn developers do a great job of incorporating state of
-the art implementations and new algorithms into the package. Thus, scikit-learn
-provides convenient access to a wide spectrum of algorithms, and allows us to
-readily find the right tool for the right job.
-
+----------------------------------------
 
-.. raw:: html
+.. div:: sk-text-image-grid-large
 
-   <span class="testimonial-author">
+  .. div:: text-box
 
-Melanie Mueller, Data Scientist
+    At Booking.com, we use machine learning algorithms for many different
+    applications, such as recommending hotels and destinations to our customers,
+    detecting fraudulent reservations, or scheduling our customer service agents.
+    Scikit-learn is one of the tools we use when implementing standard algorithms
+    for prediction tasks. Its API and documentations are excellent and make it easy
+    to use. The scikit-learn developers do a great job of incorporating state of
+    the art implementations and new algorithms into the package. Thus, scikit-learn
+    provides convenient access to a wide spectrum of algorithms, and allows us to
+    readily find the right tool for the right job.
 
-.. raw:: html
+    .. rst-class:: annotation
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+      Melanie Mueller, Data Scientist
 
-.. image:: images/booking.png
-    :width: 120pt
-    :align: center
-    :target: https://www.booking.com
+  .. div:: image-box
 
-.. raw:: html
+    .. image:: images/booking.png
+      :target: https://www.booking.com
 
-   </div>
-   </div>
 
 `AWeber <https://www.aweber.com/>`_
-------------------------------------------
-
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-The scikit-learn toolkit is indispensable for the Data Analysis and Management
-team at AWeber.  It allows us to do AWesome stuff we would not otherwise have
-the time or resources to accomplish. The documentation is excellent, allowing
-new engineers to quickly evaluate and apply many different algorithms to our
-data. The text feature extraction utilities are useful when working with the
-large volume of email content we have at AWeber. The RandomizedPCA
-implementation, along with Pipelining and FeatureUnions, allows us to develop
-complex machine learning algorithms efficiently and reliably.
+-----------------------------------
 
-Anyone interested in learning more about how AWeber deploys scikit-learn in a
-production environment should check out talks from PyData Boston by AWeber's
-Michael Becker available at https://github.com/mdbecker/pydata_2013
+.. div:: sk-text-image-grid-large
 
-.. raw:: html
+  .. div:: text-box
 
-   <span class="testimonial-author">
+    The scikit-learn toolkit is indispensable for the Data Analysis and Management
+    team at AWeber.  It allows us to do AWesome stuff we would not otherwise have
+    the time or resources to accomplish. The documentation is excellent, allowing
+    new engineers to quickly evaluate and apply many different algorithms to our
+    data. The text feature extraction utilities are useful when working with the
+    large volume of email content we have at AWeber. The RandomizedPCA
+    implementation, along with Pipelining and FeatureUnions, allows us to develop
+    complex machine learning algorithms efficiently and reliably.
 
-Michael Becker, Software Engineer, Data Analysis and Management Ninjas
+    Anyone interested in learning more about how AWeber deploys scikit-learn in a
+    production environment should check out talks from PyData Boston by AWeber's
+    Michael Becker available at https://github.com/mdbecker/pydata_2013.
 
-.. raw:: html
+    .. rst-class:: annotation
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+      Michael Becker, Software Engineer, Data Analysis and Management Ninjas
 
-.. image:: images/aweber.png
-    :width: 120pt
-    :align: center
-    :target: https://www.aweber.com/
+  .. div:: image-box
 
-.. raw:: html
+    .. image:: images/aweber.png
+      :target: https://www.aweber.com
 
-   </div>
-   </div>
 
 `Yhat <https://www.yhat.com>`_
-------------------------------------------
-
-.. raw:: html
+------------------------------
 
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
+.. div:: sk-text-image-grid-large
 
-The combination of consistent APIs, thorough documentation, and top notch
-implementation make scikit-learn our favorite machine learning package in
-Python. scikit-learn makes doing advanced analysis in Python accessible to
-anyone. At Yhat, we make it easy to integrate these models into your production
-applications. Thus eliminating the unnecessary dev time encountered
-productionizing analytical work.
+  .. div:: text-box
 
+    The combination of consistent APIs, thorough documentation, and top notch
+    implementation make scikit-learn our favorite machine learning package in
+    Python. scikit-learn makes doing advanced analysis in Python accessible to
+    anyone. At Yhat, we make it easy to integrate these models into your production
+    applications. Thus eliminating the unnecessary dev time encountered
+    productionizing analytical work.
 
-.. raw:: html
+    .. rst-class:: annotation
 
-   <span class="testimonial-author">
+      Greg Lamp, Co-founder
 
-Greg Lamp, Co-founder Yhat
+  .. div:: image-box
 
-.. raw:: html
+    .. image:: images/yhat.png
+      :target: https://www.yhat.com
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
-
-.. image:: images/yhat.png
-    :width: 120pt
-    :align: center
-    :target: https://www.yhat.com
-
-.. raw:: html
-
-   </div>
-   </div>
 
 `Rangespan <http://www.rangespan.com>`_
-----------------------------------------
+---------------------------------------
 
-.. raw:: html
+.. div:: sk-text-image-grid-large
 
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
+  .. div:: text-box
 
-The Python scikit-learn toolkit is a core tool in the data science
-group at Rangespan. Its large collection of well documented models and
-algorithms allow our team of data scientists to prototype fast and
-quickly iterate to find the right solution to our learning problems.
-We find that scikit-learn is not only the right tool for prototyping,
-but its careful and well tested implementation give us the confidence
-to run scikit-learn models in production.
+    The Python scikit-learn toolkit is a core tool in the data science
+    group at Rangespan. Its large collection of well documented models and
+    algorithms allow our team of data scientists to prototype fast and
+    quickly iterate to find the right solution to our learning problems.
+    We find that scikit-learn is not only the right tool for prototyping,
+    but its careful and well tested implementation give us the confidence
+    to run scikit-learn models in production.
 
-.. raw:: html
+    .. rst-class:: annotation
 
-   <span class="testimonial-author">
+      Jurgen Van Gael, Data Science Director
 
-Jurgen Van Gael, Data Science Director at Rangespan Ltd
+  .. div:: image-box
 
-.. raw:: html
+    .. image:: images/rangespan.png
+      :target: http://www.rangespan.com
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
-
-.. image:: images/rangespan.png
-    :width: 120pt
-    :align: center
-    :target: http://www.rangespan.com
-
-.. raw:: html
-
-   </div>
-   </div>
 
 `Birchbox <https://www.birchbox.com>`_
-------------------------------------------
-
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-At Birchbox, we face a range of machine learning problems typical to
-E-commerce: product recommendation, user clustering, inventory prediction,
-trends detection, etc. Scikit-learn lets us experiment with many models,
-especially in the exploration phase of a new project: the data can be passed
-around in a consistent way; models are easy to save and reuse; updates keep us
-informed of new developments from the pattern discovery research community.
-Scikit-learn is an important tool for our team, built the right way in the
-right language.
-
-.. raw:: html
+--------------------------------------
 
-   <span class="testimonial-author">
+.. div:: sk-text-image-grid-large
 
-Thierry Bertin-Mahieux, Birchbox, Data Scientist
+  .. div:: text-box
 
-.. raw:: html
+    At Birchbox, we face a range of machine learning problems typical to
+    E-commerce: product recommendation, user clustering, inventory prediction,
+    trends detection, etc. Scikit-learn lets us experiment with many models,
+    especially in the exploration phase of a new project: the data can be passed
+    around in a consistent way; models are easy to save and reuse; updates keep us
+    informed of new developments from the pattern discovery research community.
+    Scikit-learn is an important tool for our team, built the right way in the
+    right language.
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+    .. rst-class:: annotation
 
-.. image:: images/birchbox.jpg
-    :width: 120pt
-    :align: center
-    :target: https://www.birchbox.com
+      Thierry Bertin-Mahieux, Data Scientist
 
-.. raw:: html
+  .. div:: image-box
 
-   </div>
-   </div>
+    .. image:: images/birchbox.jpg
+      :target: https://www.birchbox.com
 
 
 `Bestofmedia Group <http://www.bestofmedia.com>`_
---------------------------------------------------
+-------------------------------------------------
 
-.. raw:: html
+.. div:: sk-text-image-grid-large
 
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
+  .. div:: text-box
 
-Scikit-learn is our #1 toolkit for all things machine learning
-at Bestofmedia. We use it for a variety of tasks (e.g. spam fighting,
-ad click prediction, various ranking models) thanks to the varied,
-state-of-the-art algorithm implementations packaged into it.
-In the lab it accelerates prototyping of complex pipelines. In
-production I can say it has proven to be robust and efficient enough
-to be deployed for business critical components.
+    Scikit-learn is our #1 toolkit for all things machine learning
+    at Bestofmedia. We use it for a variety of tasks (e.g. spam fighting,
+    ad click prediction, various ranking models) thanks to the varied,
+    state-of-the-art algorithm implementations packaged into it.
+    In the lab it accelerates prototyping of complex pipelines. In
+    production I can say it has proven to be robust and efficient enough
+    to be deployed for business critical components.
 
-.. raw:: html
+    .. rst-class:: annotation
 
-   <span class="testimonial-author">
+      Eustache Diemert, Lead Scientist
 
-Eustache Diemert, Lead Scientist Bestofmedia Group
+  .. div:: image-box
 
-.. raw:: html
+    .. image:: images/bestofmedia-logo.png
+      :target: http://www.bestofmedia.com
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
-
-.. image:: images/bestofmedia-logo.png
-    :width: 120pt
-    :align: center
-    :target: http://www.bestofmedia.com
-
-.. raw:: html
-
-   </div>
-   </div>
 
 `Change.org <https://www.change.org>`_
 --------------------------------------
 
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
+.. div:: sk-text-image-grid-large
 
-At change.org we automate the use of scikit-learn's RandomForestClassifier
-in our production systems to drive email targeting that reaches millions
-of users across the world each week. In the lab, scikit-learn's ease-of-use,
-performance, and overall variety of algorithms implemented has proved invaluable
-in giving us a single reliable source to turn to for our machine-learning needs.
+  .. div:: text-box
 
-.. raw:: html
+    At change.org we automate the use of scikit-learn's RandomForestClassifier
+    in our production systems to drive email targeting that reaches millions
+    of users across the world each week. In the lab, scikit-learn's ease-of-use,
+    performance, and overall variety of algorithms implemented has proved invaluable
+    in giving us a single reliable source to turn to for our machine-learning needs.
 
-   <span class="testimonial-author">
+    .. rst-class:: annotation
 
-Vijay Ramesh, Software Engineer in Data/science at Change.org
+      Vijay Ramesh, Software Engineer in Data/science at Change.org
 
-.. raw:: html
+  .. div:: image-box
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+    .. image:: images/change-logo.png
+      :target: https://www.change.org
 
-.. image:: images/change-logo.png
-    :width: 120pt
-    :align: center
-    :target: https://www.change.org
-
-.. raw:: html
-
-   </div>
-   </div>
 
 `PHIMECA Engineering <https://www.phimeca.com/?lang=en>`_
-----------------------------------------------------------
-
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-At PHIMECA Engineering, we use scikit-learn estimators as surrogates for
-expensive-to-evaluate numerical models (mostly but not exclusively
-finite-element mechanical models) for speeding up the intensive post-processing
-operations involved in our simulation-based decision making framework.
-Scikit-learn's fit/predict API together with its efficient cross-validation
-tools considerably eases the task of selecting the best-fit estimator. We are
-also using scikit-learn for illustrating concepts in our training sessions.
-Trainees are always impressed by the ease-of-use of scikit-learn despite the
-apparent theoretical complexity of machine learning.
+---------------------------------------------------------
 
-.. raw:: html
+.. div:: sk-text-image-grid-large
 
-   <span class="testimonial-author">
+  .. div:: text-box
 
-Vincent Dubourg, PHIMECA Engineering, PhD Engineer
+    At PHIMECA Engineering, we use scikit-learn estimators as surrogates for
+    expensive-to-evaluate numerical models (mostly but not exclusively
+    finite-element mechanical models) for speeding up the intensive post-processing
+    operations involved in our simulation-based decision making framework.
+    Scikit-learn's fit/predict API together with its efficient cross-validation
+    tools considerably eases the task of selecting the best-fit estimator. We are
+    also using scikit-learn for illustrating concepts in our training sessions.
+    Trainees are always impressed by the ease-of-use of scikit-learn despite the
+    apparent theoretical complexity of machine learning.
 
-.. raw:: html
+    .. rst-class:: annotation
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+      Vincent Dubourg, PHIMECA Engineering, PhD Engineer
 
-.. image:: images/phimeca.png
-    :width: 120pt
-    :align: center
-    :target: https://www.phimeca.com/?lang=en
+  .. div:: image-box
 
-.. raw:: html
+    .. image:: images/phimeca.png
+      :target: https://www.phimeca.com/?lang=en
 
-   </div>
-   </div>
 
 `HowAboutWe <http://www.howaboutwe.com/>`_
-----------------------------------------------------------
-
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-At HowAboutWe, scikit-learn lets us implement a wide array of machine learning
-techniques in analysis and in production, despite having a small team.  We use
-scikit-learn's classification algorithms to predict user behavior, enabling us
-to (for example) estimate the value of leads from a given traffic source early
-in the lead's tenure on our site. Also, our users' profiles consist of
-primarily unstructured data (answers to open-ended questions), so we use
-scikit-learn's feature extraction and dimensionality reduction tools to
-translate these unstructured data into inputs for our matchmaking system.
-
-.. raw:: html
+------------------------------------------
 
-   <span class="testimonial-author">
+.. div:: sk-text-image-grid-large
 
-Daniel Weitzenfeld, Senior Data Scientist at HowAboutWe
+  .. div:: text-box
 
-.. raw:: html
+    At HowAboutWe, scikit-learn lets us implement a wide array of machine learning
+    techniques in analysis and in production, despite having a small team.  We use
+    scikit-learn's classification algorithms to predict user behavior, enabling us
+    to (for example) estimate the value of leads from a given traffic source early
+    in the lead's tenure on our site. Also, our users' profiles consist of
+    primarily unstructured data (answers to open-ended questions), so we use
+    scikit-learn's feature extraction and dimensionality reduction tools to
+    translate these unstructured data into inputs for our matchmaking system.
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+    .. rst-class:: annotation
 
-.. image:: images/howaboutwe.png
-    :width: 120pt
-    :align: center
-    :target: http://www.howaboutwe.com/
+      Daniel Weitzenfeld, Senior Data Scientist at HowAboutWe
 
-.. raw:: html
+  .. div:: image-box
 
-   </div>
-   </div>
+    .. image:: images/howaboutwe.png
+      :target: http://www.howaboutwe.com/
 
 
 `PeerIndex <https://www.brandwatch.com/peerindex-and-brandwatch>`_
 ------------------------------------------------------------------
 
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-At PeerIndex we use scientific methodology to build the Influence Graph - a
-unique dataset that allows us to identify who's really influential and in which
-context. To do this, we have to tackle a range of machine learning and
-predictive modeling problems. Scikit-learn has emerged as our primary tool for
-developing prototypes and making quick progress. From predicting missing data
-and classifying tweets to clustering communities of social media users, scikit-
-learn proved useful in a variety of applications. Its very intuitive interface
-and excellent compatibility with other python tools makes it and indispensable
-tool in our daily research efforts.
+.. div:: sk-text-image-grid-large
 
-.. raw:: html
+  .. div:: text-box
 
-   <span class="testimonial-author">
+    At PeerIndex we use scientific methodology to build the Influence Graph - a
+    unique dataset that allows us to identify who's really influential and in which
+    context. To do this, we have to tackle a range of machine learning and
+    predictive modeling problems. Scikit-learn has emerged as our primary tool for
+    developing prototypes and making quick progress. From predicting missing data
+    and classifying tweets to clustering communities of social media users, scikit-
+    learn proved useful in a variety of applications. Its very intuitive interface
+    and excellent compatibility with other python tools makes it and indispensable
+    tool in our daily research efforts.
 
-Ferenc Huszar - Senior Data Scientist at Peerindex
+    .. rst-class:: annotation
 
-.. raw:: html
+      Ferenc Huszar, Senior Data Scientist at Peerindex
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+  .. div:: image-box
 
-.. image:: images/peerindex.png
-    :width: 120pt
-    :align: center
-    :target: https://www.brandwatch.com/peerindex-and-brandwatch
-
-.. raw:: html
-
-   </div>
-   </div>
+    .. image:: images/peerindex.png
+      :target: https://www.brandwatch.com/peerindex-and-brandwatch
 
 
 `DataRobot <https://www.datarobot.com>`_
 ----------------------------------------
 
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-DataRobot is building next generation predictive analytics software to make data scientists more productive, and scikit-learn is an integral part of our system. The variety of machine learning techniques in combination with the solid implementations that scikit-learn offers makes it a one-stop-shopping library for machine learning in Python. Moreover, its consistent API, well-tested code and permissive licensing allow us to use it in a production environment. Scikit-learn has literally saved us years of work we would have had to do ourselves to bring our product to market.
-
-.. raw:: html
+.. div:: sk-text-image-grid-large
 
-   <span class="testimonial-author">
+  .. div:: text-box
 
-Jeremy Achin, CEO & Co-founder DataRobot Inc.
+    DataRobot is building next generation predictive analytics software to make data
+    scientists more productive, and scikit-learn is an integral part of our system. The
+    variety of machine learning techniques in combination with the solid implementations
+    that scikit-learn offers makes it a one-stop-shopping library for machine learning
+    in Python. Moreover, its consistent API, well-tested code and permissive licensing
+    allow us to use it in a production environment. Scikit-learn has literally saved us
+    years of work we would have had to do ourselves to bring our product to market.
 
-.. raw:: html
+    .. rst-class:: annotation
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+      Jeremy Achin, CEO & Co-founder DataRobot Inc.
 
-.. image:: images/datarobot.png
-    :width: 120pt
-    :align: center
-    :target: https://www.datarobot.com
+  .. div:: image-box
 
-.. raw:: html
-
-   </div>
-   </div>
+    .. image:: images/datarobot.png
+      :target: https://www.datarobot.com
 
 
 `OkCupid <https://www.okcupid.com/>`_
---------------------------------------
-
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
+-------------------------------------
 
-We're using scikit-learn at OkCupid to evaluate and improve our matchmaking
-system. The range of features it has, especially preprocessing utilities, means
-we can use it for a wide variety of projects, and it's performant enough to
-handle the volume of data that we need to sort through. The documentation is
-really thorough, as well, which makes the library quite easy to use.
+.. div:: sk-text-image-grid-large
 
-.. raw:: html
+  .. div:: text-box
 
-   <span class="testimonial-author">
+    We're using scikit-learn at OkCupid to evaluate and improve our matchmaking
+    system. The range of features it has, especially preprocessing utilities, means
+    we can use it for a wide variety of projects, and it's performant enough to
+    handle the volume of data that we need to sort through. The documentation is
+    really thorough, as well, which makes the library quite easy to use.
 
-David Koh - Senior Data Scientist at OkCupid
+    .. rst-class:: annotation
 
-.. raw:: html
+      David Koh - Senior Data Scientist at OkCupid
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+  .. div:: image-box
 
-.. image:: images/okcupid.png
-    :width: 120pt
-    :align: center
-    :target: https://www.okcupid.com
-
-.. raw:: html
-
-    </div>
-    </div>
+    .. image:: images/okcupid.png
+      :target: https://www.okcupid.com
 
 
 `Lovely <https://livelovely.com/>`_
 -----------------------------------
 
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-At Lovely, we strive to deliver the best apartment marketplace, with respect to
-our users and our listings. From understanding user behavior, improving data
-quality, and detecting fraud, scikit-learn is a regular tool for gathering
-insights, predictive modeling and improving our product. The easy-to-read
-documentation and intuitive architecture of the API makes machine learning both
-explorable and accessible to a wide range of python developers. I'm constantly
-recommending that more developers and scientists try scikit-learn.
-
-.. raw:: html
+.. div:: sk-text-image-grid-large
 
-   <span class="testimonial-author">
+  .. div:: text-box
 
-Simon Frid - Data Scientist, Lead at Lovely
+    At Lovely, we strive to deliver the best apartment marketplace, with respect to
+    our users and our listings. From understanding user behavior, improving data
+    quality, and detecting fraud, scikit-learn is a regular tool for gathering
+    insights, predictive modeling and improving our product. The easy-to-read
+    documentation and intuitive architecture of the API makes machine learning both
+    explorable and accessible to a wide range of python developers. I'm constantly
+    recommending that more developers and scientists try scikit-learn.
 
-.. raw:: html
+    .. rst-class:: annotation
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+      Simon Frid - Data Scientist, Lead at Lovely
 
-.. image:: images/lovely.png
-    :width: 120pt
-    :align: center
-    :target: https://livelovely.com
-
-.. raw:: html
-
-   </div>
-   </div>
+  .. div:: image-box
 
+    .. image:: images/lovely.png
+      :target: https://livelovely.com
 
 
 `Data Publica <http://www.data-publica.com/>`_
 ----------------------------------------------
 
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-Data Publica builds a new predictive sales tool for commercial and marketing teams called C-Radar.
-We extensively use scikit-learn to build segmentations of customers through clustering, and to predict future customers based on past partnerships success or failure.
-We also categorize companies using their website communication thanks to scikit-learn and its machine learning algorithm implementations.
-Eventually, machine learning makes it possible to detect weak signals that traditional tools cannot see.
-All these complex tasks are performed in an easy and straightforward way thanks to the great quality of the scikit-learn framework.
+.. div:: sk-text-image-grid-large
 
-.. raw:: html
+  .. div:: text-box
 
-   <span class="testimonial-author">
+    Data Publica builds a new predictive sales tool for commercial and marketing teams
+    called C-Radar. We extensively use scikit-learn to build segmentations of customers
+    through clustering, and to predict future customers based on past partnerships
+    success or failure. We also categorize companies using their website communication
+    thanks to scikit-learn and its machine learning algorithm implementations.
+    Eventually, machine learning makes it possible to detect weak signals that
+    traditional tools cannot see. All these complex tasks are performed in an easy and
+    straightforward way thanks to the great quality of the scikit-learn framework.
 
-Guillaume Lebourgeois & Samuel Charron - Data Scientists at Data Publica
+    .. rst-class:: annotation
 
-.. raw:: html
+      Guillaume Lebourgeois & Samuel Charron - Data Scientists at Data Publica
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
-
-.. image:: images/datapublica.png
-    :width: 120pt
-    :align: center
-    :target: http://www.data-publica.com/
-
-.. raw:: html
-
-   </div>
-   </div>
+  .. div:: image-box
 
+    .. image:: images/datapublica.png
+      :target: http://www.data-publica.com/
 
 
 `Machinalis <https://www.machinalis.com/>`_
 -------------------------------------------
 
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
+.. div:: sk-text-image-grid-large
 
-Scikit-learn is the cornerstone of all the machine learning projects carried at
-Machinalis. It has a consistent API, a wide selection of algorithms and lots
-of auxiliary tools to deal with the boilerplate.
-We have used it in production environments on a variety of projects
-including click-through rate prediction, `information extraction <https://github.com/machinalis/iepy>`_,
-and even counting sheep!
+  .. div:: text-box
 
-In fact, we use it so much that we've started to freeze our common use cases
-into Python packages, some of them open-sourced, like
-`FeatureForge <https://github.com/machinalis/featureforge>`_ .
-Scikit-learn in one word: Awesome.
+    Scikit-learn is the cornerstone of all the machine learning projects carried at
+    Machinalis. It has a consistent API, a wide selection of algorithms and lots of
+    auxiliary tools to deal with the boilerplate. We have used it in production
+    environments on a variety of projects including click-through rate prediction,
+    `information extraction <https://github.com/machinalis/iepy>`_, and even counting
+    sheep!
 
-.. raw:: html
+    In fact, we use it so much that we've started to freeze our common use cases
+    into Python packages, some of them open-sourced, like `FeatureForge
+    <https://github.com/machinalis/featureforge>`_. Scikit-learn in one word: Awesome.
 
-   <span class="testimonial-author">
+    .. rst-class:: annotation
 
-Rafael Carrascosa, Lead developer
+      Rafael Carrascosa, Lead developer
 
-.. raw:: html
+  .. div:: image-box
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
-
-.. image:: images/machinalis.png
-    :width: 120pt
-    :align: center
-    :target: https://www.machinalis.com/
-
-.. raw:: html
-
-   </div>
-   </div>
+    .. image:: images/machinalis.png
+      :target: https://www.machinalis.com/
 
 
 `solido <https://www.solidodesign.com/>`_
 -----------------------------------------
 
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
+.. div:: sk-text-image-grid-large
 
-Scikit-learn is helping to drive Moore's Law, via Solido. Solido creates
-computer-aided design tools used by the majority of top-20 semiconductor
-companies and fabs, to design the bleeding-edge chips inside smartphones,
-automobiles, and more. Scikit-learn helps to power Solido's algorithms for
-rare-event estimation, worst-case verification, optimization, and more. At
-Solido, we are particularly fond of scikit-learn's libraries for Gaussian
-Process models, large-scale regularized linear regression, and classification.
-Scikit-learn has increased our productivity, because for many ML problems we no
-longer need to “roll our own” code. `This PyData 2014 talk <https://www.youtube.com/watch?v=Jm-eBD9xR3w>`_ has details.
+  .. div:: text-box
 
+    Scikit-learn is helping to drive Moore's Law, via Solido. Solido creates
+    computer-aided design tools used by the majority of top-20 semiconductor
+    companies and fabs, to design the bleeding-edge chips inside smartphones,
+    automobiles, and more. Scikit-learn helps to power Solido's algorithms for
+    rare-event estimation, worst-case verification, optimization, and more. At
+    Solido, we are particularly fond of scikit-learn's libraries for Gaussian
+    Process models, large-scale regularized linear regression, and classification.
+    Scikit-learn has increased our productivity, because for many ML problems we no
+    longer need to “roll our own” code. `This PyData 2014 talk
+    <https://www.youtube.com/watch?v=Jm-eBD9xR3w>`_ has details.
 
-.. raw:: html
+    .. rst-class:: annotation
 
-  <span class="testimonial-author">
+      Trent McConaghy, founder, Solido Design Automation Inc.
 
-Trent McConaghy, founder, Solido Design Automation Inc.
-
-.. raw:: html
-
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
-
-.. image:: images/solido_logo.png
-    :width: 120pt
-    :align: center
-    :target: https://www.solidodesign.com/
-
-.. raw:: html
-
-   </div>
-   </div>
+  .. div:: image-box
 
+    .. image:: images/solido_logo.png
+      :target: https://www.solidodesign.com/
 
 
 `INFONEA <http://www.infonea.com/en/>`_
------------------------------------------
-
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-We employ scikit-learn for rapid prototyping and custom-made Data Science
-solutions within our in-memory based Business Intelligence Software
-INFONEA®. As a well-documented and comprehensive collection of
-state-of-the-art algorithms and pipelining methods, scikit-learn enables
-us to provide flexible and scalable scientific analysis solutions. Thus,
-scikit-learn is immensely valuable in realizing a powerful integration of
-Data Science technology within self-service business analytics.
+---------------------------------------
 
-.. raw:: html
+.. div:: sk-text-image-grid-large
 
-  <span class="testimonial-author">
+  .. div:: text-box
 
-Thorsten Kranz, Data Scientist, Coma Soft AG.
+    We employ scikit-learn for rapid prototyping and custom-made Data Science
+    solutions within our in-memory based Business Intelligence Software
+    INFONEA®. As a well-documented and comprehensive collection of
+    state-of-the-art algorithms and pipelining methods, scikit-learn enables
+    us to provide flexible and scalable scientific analysis solutions. Thus,
+    scikit-learn is immensely valuable in realizing a powerful integration of
+    Data Science technology within self-service business analytics.
 
-.. raw:: html
+    .. rst-class:: annotation
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+      Thorsten Kranz, Data Scientist, Coma Soft AG.
 
-.. image:: images/infonea.jpg
-    :width: 120pt
-    :align: center
-    :target: http://www.infonea.com/en/
+  .. div:: image-box
 
-.. raw:: html
-
-   </div>
-   </div>
+    .. image:: images/infonea.jpg
+      :target: http://www.infonea.com/en/
 
 
 `Dataiku <https://www.dataiku.com/>`_
------------------------------------------
-
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
+-------------------------------------
 
-Our software, Data Science Studio (DSS), enables users to create data services
-that combine `ETL <https://en.wikipedia.org/wiki/Extract,_transform,_load>`_ with
-Machine Learning. Our Machine Learning module integrates
-many scikit-learn algorithms. The scikit-learn library is a perfect integration
-with DSS because it offers algorithms for virtually all business cases. Our goal
-is to offer a transparent and flexible tool that makes it easier to optimize
-time consuming aspects of building a data service, preparing data, and training
-machine learning algorithms on all types of data.
+.. div:: sk-text-image-grid-large
 
+  .. div:: text-box
 
-.. raw:: html
+    Our software, Data Science Studio (DSS), enables users to create data services
+    that combine `ETL <https://en.wikipedia.org/wiki/Extract,_transform,_load>`_ with
+    Machine Learning. Our Machine Learning module integrates
+    many scikit-learn algorithms. The scikit-learn library is a perfect integration
+    with DSS because it offers algorithms for virtually all business cases. Our goal
+    is to offer a transparent and flexible tool that makes it easier to optimize
+    time consuming aspects of building a data service, preparing data, and training
+    machine learning algorithms on all types of data.
 
-  <span class="testimonial-author">
+    .. rst-class:: annotation
 
-Florian Douetteau, CEO, Dataiku
+      Florian Douetteau, CEO, Dataiku
 
-.. raw:: html
+  .. div:: image-box
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+    .. image:: images/dataiku_logo.png
+      :target: https://www.dataiku.com/
 
-.. image:: images/dataiku_logo.png
-    :width: 120pt
-    :align: center
-    :target: https://www.dataiku.com/
-
-.. raw:: html
-
-   </div>
-   </div>
 
 `Otto Group <https://ottogroup.com/>`_
------------------------------------------
-
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-Here at Otto Group, one of global Big Five B2C online retailers, we are using
-scikit-learn in all aspects of our daily work from data exploration to development
-of machine learning application to the productive deployment of those services.
-It helps us to tackle machine learning problems ranging from e-commerce to logistics.
-It consistent APIs enabled us to build the `Palladium REST-API framework
-<https://github.com/ottogroup/palladium/>`_ around it and continuously deliver
-scikit-learn based services.
-
+--------------------------------------
 
-.. raw:: html
+.. div:: sk-text-image-grid-large
 
-  <span class="testimonial-author">
+  .. div:: text-box
 
-Christian Rammig, Head of Data Science, Otto Group
+    Here at Otto Group, one of global Big Five B2C online retailers, we are using
+    scikit-learn in all aspects of our daily work from data exploration to development
+    of machine learning application to the productive deployment of those services.
+    It helps us to tackle machine learning problems ranging from e-commerce to logistics.
+    It consistent APIs enabled us to build the `Palladium REST-API framework
+    <https://github.com/ottogroup/palladium/>`_ around it and continuously deliver
+    scikit-learn based services.
 
-.. raw:: html
+    .. rst-class:: annotation
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+      Christian Rammig, Head of Data Science, Otto Group
 
-.. image:: images/ottogroup_logo.png
-    :width: 120pt
-    :align: center
-    :target: https://ottogroup.com
+  .. div:: image-box
 
-.. raw:: html
+    .. image:: images/ottogroup_logo.png
+      :target: https://ottogroup.com
 
-   </div>
-   </div>
 
 `Zopa <https://zopa.com/>`_
------------------------------------------
+---------------------------
 
-.. raw:: html
+.. div:: sk-text-image-grid-large
 
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box"-->
+  .. div:: text-box
 
-At Zopa, the first ever Peer-to-Peer lending platform, we extensively use scikit-learn
-to run the business and optimize our users' experience. It powers our
-Machine Learning models involved in credit risk, fraud risk, marketing, and pricing,
-and has been used for originating at least 1 billion GBP worth of Zopa loans.
-It is very well documented, powerful, and simple to use. We are grateful for the
-capabilities it has provided, and for allowing us to deliver on our mission of making
-money simple and fair.
+    At Zopa, the first ever Peer-to-Peer lending platform, we extensively use
+    scikit-learn to run the business and optimize our users' experience. It powers our
+    Machine Learning models involved in credit risk, fraud risk, marketing, and pricing,
+    and has been used for originating at least 1 billion GBP worth of Zopa loans. It is
+    very well documented, powerful, and simple to use. We are grateful for the
+    capabilities it has provided, and for allowing us to deliver on our mission of
+    making money simple and fair.
 
-.. raw:: html
+    .. rst-class:: annotation
 
-  <span class="testimonial-author">
+      Vlasios Vasileiou, Head of Data Science, Zopa
 
-Vlasios Vasileiou, Head of Data Science, Zopa
+  .. div:: image-box
 
-.. raw:: html
+    .. image:: images/zopa.png
+      :target: https://zopa.com
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box"-->
-
-.. image:: images/zopa.png
-    :width: 120pt
-    :align: center
-    :target: https://zopa.com
-
-.. raw:: html
-
-   </div>
-   </div>
 
 `MARS <https://www.mars.com/global>`_
---------------------------------------
+-------------------------------------
 
-.. raw:: html
+.. div:: sk-text-image-grid-large
 
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
+  .. div:: text-box
 
-Scikit-Learn is integral to the Machine Learning Ecosystem at Mars. Whether
-we're designing better recipes for petfood or closely analysing our cocoa
-supply chain, Scikit-Learn is used as a tool for rapidly prototyping ideas
-and taking them to production. This allows us to better understand and meet
-the needs of our consumers worldwide. Scikit-Learn's feature-rich toolset is
-easy to use and equips our associates with the capabilities they need to
-solve the business challenges they face every day.
+    Scikit-Learn is integral to the Machine Learning Ecosystem at Mars. Whether
+    we're designing better recipes for petfood or closely analysing our cocoa
+    supply chain, Scikit-Learn is used as a tool for rapidly prototyping ideas
+    and taking them to production. This allows us to better understand and meet
+    the needs of our consumers worldwide. Scikit-Learn's feature-rich toolset is
+    easy to use and equips our associates with the capabilities they need to
+    solve the business challenges they face every day.
 
-.. raw:: html
+    .. rst-class:: annotation
 
-   <span class="testimonial-author">
+      Michael Fitzke, Next Generation Technologies Sr Leader, Mars Inc.
 
-Michael Fitzke Next Generation Technologies Sr Leader, Mars Inc.
+  .. div:: image-box
 
-.. raw:: html
-
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
-
-.. image:: images/mars.png
-    :width: 120pt
-    :align: center
-    :target: https://www.mars.com/global
-
-.. raw:: html
-
-   </div>
-   </div>
+    .. image:: images/mars.png
+      :target: https://www.mars.com/global
 
 
 `BNP Paribas Cardif <https://www.bnpparibascardif.com/>`_
 ---------------------------------------------------------
 
-.. raw:: html
-
-   <div class="sk-testimonial-div">
-   <div class="sk-testimonial-div-box">
-
-BNP Paribas Cardif uses scikit-learn for several of its machine learning models
-in production. Our internal community of developers and data scientists has
-been using scikit-learn since 2015, for several reasons: the quality of the
-developments, documentation and contribution governance, and the sheer size of
-the contributing community. We even explicitly mention the use of
-scikit-learn's pipelines in our internal model risk governance as one of our
-good practices to decrease operational risks and overfitting risk. As a way to
-support open source software development and in particular scikit-learn
-project, we decided to participate to scikit-learn's consortium at La Fondation
-Inria since its creation in 2018.
-
-.. raw:: html
-
-   <span class="testimonial-author">
+.. div:: sk-text-image-grid-large
 
-Sébastien Conort, Chief Data Scientist, BNP Paribas Cardif
+  .. div:: text-box
 
-.. raw:: html
+    BNP Paribas Cardif uses scikit-learn for several of its machine learning models
+    in production. Our internal community of developers and data scientists has
+    been using scikit-learn since 2015, for several reasons: the quality of the
+    developments, documentation and contribution governance, and the sheer size of
+    the contributing community. We even explicitly mention the use of
+    scikit-learn's pipelines in our internal model risk governance as one of our
+    good practices to decrease operational risks and overfitting risk. As a way to
+    support open source software development and in particular scikit-learn
+    project, we decided to participate to scikit-learn's consortium at La Fondation
+    Inria since its creation in 2018.
 
-   </span>
-   </div>
-   <div class="sk-testimonial-div-box">
+    .. rst-class:: annotation
 
-.. image:: images/bnp_paribas_cardif.png
-    :width: 120pt
-    :align: center
-    :target: https://www.bnpparibascardif.com/
+      Sébastien Conort, Chief Data Scientist, BNP Paribas Cardif
 
-.. raw:: html
+  .. div:: image-box
 
-   </div>
-   </div>
+    .. image:: images/bnp_paribas_cardif.png
+      :target: https://www.bnpparibascardif.com/
diff --git a/doc/themes/scikit-learn-modern/javascript.html b/doc/themes/scikit-learn-modern/javascript.html
deleted file mode 100644
index be4cf26073441..0000000000000
--- a/doc/themes/scikit-learn-modern/javascript.html
+++ /dev/null
@@ -1,56 +0,0 @@
-{% if theme_legacy_google_analytics|tobool %}
-<script>
-    window.ga=window.ga||function(){(ga.q=ga.q||[]).push(arguments)};ga.l=+new Date;
-    ga('create', 'UA-22606712-2', 'auto');
-    ga('set', 'anonymizeIp', true);
-    ga('send', 'pageview');
-</script>
-<script async src='https://www.google-analytics.com/analytics.js'></script>
-{% endif %}
-
-{% if theme_analytics|tobool %}
-<script defer data-domain="scikit-learn.org" src="https://views.scientific-python.org/js/script.js">
-</script>
-{% endif %}
-
-<script src="{{ pathto('_static/clipboard.min.js', 1) }}"></script>
-<script src="{{ pathto('_static/copybutton.js', 1) }}"></script>
-
-<script>
-$(document).ready(function() {
-    /* Add a [>>>] button on the top-right corner of code samples to hide
-     * the >>> and ... prompts and the output and thus make the code
-     * copyable. */
-    var div = $('.highlight-python .highlight,' +
-                '.highlight-python3 .highlight,' +
-                '.highlight-pycon .highlight,' +
-		'.highlight-default .highlight')
-    var pre = div.find('pre');
-
-    // get the styles from the current theme
-    pre.parent().parent().css('position', 'relative');
-
-    // create and add the button to all the code blocks that contain >>>
-    div.each(function(index) {
-        var jthis = $(this);
-        // tracebacks (.gt) contain bare text elements that need to be
-        // wrapped in a span to work with .nextUntil() (see later)
-        jthis.find('pre:has(.gt)').contents().filter(function() {
-            return ((this.nodeType == 3) && (this.data.trim().length > 0));
-        }).wrap('<span>');
-    });
-
-	/*** Add permalink buttons next to glossary terms ***/
-	$('dl.glossary > dt[id]').append(function() {
-		return ('<a class="headerlink" href="#' +
-			    this.getAttribute('id') +
-			    '" title="Permalink to this term">¶</a>');
-	});
-});
-
-</script>
-{%- if pagename != 'index' and pagename != 'documentation' %}
-    {% if theme_mathjax_path %}
-<script id="MathJax-script" async src="{{ theme_mathjax_path }}"></script>
-    {% endif %}
-{%- endif %}
diff --git a/doc/themes/scikit-learn-modern/layout.html b/doc/themes/scikit-learn-modern/layout.html
deleted file mode 100644
index c95184d42c671..0000000000000
--- a/doc/themes/scikit-learn-modern/layout.html
+++ /dev/null
@@ -1,150 +0,0 @@
-{# TEMPLATE VAR SETTINGS #}
-{%- set url_root = pathto('', 1) %}
-{%- if url_root == '#' %}{% set url_root = '' %}{% endif %}
-{%- if not embedded and docstitle %}
-  {%- set titlesuffix = " &mdash; "|safe + docstitle|e %}
-{%- else %}
-  {%- set titlesuffix = "" %}
-{%- endif %}
-{%- set lang_attr = 'en' %}
-
-<!DOCTYPE html>
-<!-- data-theme below is forced to be "light" but should be changed if we use pydata-theme-sphinx in the future -->
-<!--[if IE 8]><html class="no-js lt-ie9" lang="{{ lang_attr }}" data-content_root="{{ url_root }}" data-theme="light"> <![endif]-->
-<!--[if gt IE 8]><!--> <html class="no-js" lang="{{ lang_attr }}" data-content_root="{{ url_root }}" data-theme="light"> <!--<![endif]-->
-<head>
-  <meta charset="utf-8">
-  {{ metatags }}
-  <meta name="viewport" content="width=device-width, initial-scale=1.0">
-
-  {% block htmltitle %}
-  <title>{{ title|striptags|e }}{{ titlesuffix }}</title>
-  {% endblock %}
-  <link rel="canonical" href="https://scikit-learn.org/stable/{{pagename}}.html" />
-
-  {% if favicon_url %}
-  <link rel="shortcut icon" href="{{ favicon_url|e }}"/>
-  {% endif %}
-
-  <link rel="stylesheet" href="{{ pathto('_static/css/vendor/bootstrap.min.css', 1) }}" type="text/css" />
-  {%- for css in css_files %}
-    {%- if css|attr("rel") %}
-  <link rel="{{ css.rel }}" href="{{ pathto(css.filename, 1) }}" type="text/css"{% if css.title is not none %} title="{{ css.title }}"{% endif %} />
-    {%- else %}
-  <link rel="stylesheet" href="{{ pathto(css, 1) }}" type="text/css" />
-    {%- endif %}
-  {%- endfor %}
-  <link rel="stylesheet" href="{{ pathto('_static/' + styles[0], 1) }}" type="text/css" />
-<script id="documentation_options" data-url_root="{{ url_root }}" src="{{ pathto('_static/documentation_options.js', 1) }}"></script>
-<script src="{{ pathto('_static/js/vendor/jquery-3.6.3.slim.min.js', 1) }}"></script>
-<script src="{{ pathto('_static/js/details-permalink.js', 1) }}"></script>
-{%- block extrahead %} {% endblock %}
-</head>
-<body>
-{% include "nav.html" %}
-{%- block content %}
-<div class="d-flex" id="sk-doc-wrapper">
-    <input type="checkbox" name="sk-toggle-checkbox" id="sk-toggle-checkbox">
-    <label id="sk-sidemenu-toggle" class="sk-btn-toggle-toc btn sk-btn-primary" for="sk-toggle-checkbox">Toggle Menu</label>
-    <div id="sk-sidebar-wrapper" class="border-right">
-      <div class="sk-sidebar-toc-wrapper">
-        <div class="btn-group w-100 mb-2" role="group" aria-label="rellinks">
-          {%- if prev %}
-            <a href="{{ prev.link|e }}" role="button" class="btn sk-btn-rellink py-1" sk-rellink-tooltip="{{ prev.title|striptags }}">Prev</a>
-          {%- else %}
-            <a href="#" role="button" class="btn sk-btn-rellink py-1 disabled"">Prev</a>
-          {%- endif %}
-          {%- if parents -%}
-            <a href="{{ parents[-1].link|e }}" role="button" class="btn sk-btn-rellink py-1" sk-rellink-tooltip="{{ parents[-1].title|striptags }}">Up</a>
-          {%- else %}
-            <a href="#" role="button" class="btn sk-btn-rellink disabled py-1">Up</a>
-          {%- endif %}
-          {%- if next %}
-            <a href="{{ next.link|e }}" role="button" class="btn sk-btn-rellink py-1" sk-rellink-tooltip="{{ next.title|striptags }}">Next</a>
-          {%- else %}
-            <a href="#" role="button" class="btn sk-btn-rellink py-1 disabled"">Next</a>
-          {%- endif %}
-        </div>
-        {%- if pagename != "install" %}
-        <div class="alert alert-danger p-1 mb-2" role="alert">
-          <p class="text-center mb-0">
-          <strong>scikit-learn {{ release }}</strong><br/>
-          <a href="https://scikit-learn.org/dev/versions.html">Other versions</a>
-          </p>
-        </div>
-        {%- endif %}
-        <div class="alert alert-warning p-1 mb-2" role="alert">
-          <p class="text-center mb-0">
-            Please <a class="font-weight-bold" href="{{ pathto('about').replace('#', '') }}#citing-scikit-learn"><string>cite us</string></a> if you use the software.
-          </p>
-        </div>
-            {%- if meta and meta['parenttoc']|tobool %}
-            <div class="sk-sidebar-toc">
-            {% set nav = get_nav_object(maxdepth=3, collapse=True, numbered=True) %}
-              <ul>
-              {% for main_nav_item in nav %}
-              {% if main_nav_item.active %}
-              <li>
-                <a href="{{ main_nav_item.url }}" class="sk-toc-active">{{ main_nav_item.title }}</a>
-              </li>
-              <ul>
-              {% for nav_item in main_nav_item.children %}
-                <li>
-                  <a href="{{ nav_item.url }}" class="{% if nav_item.active %}sk-toc-active{% endif %}">{{ nav_item.title }}</a>
-                  {% if nav_item.children %}
-                  <ul>
-                    {% for inner_child in nav_item.children %}
-                      <li class="sk-toctree-l3">
-                        <a href="{{ inner_child.url }}">{{ inner_child.title }}</a>
-                      </li>
-                    {% endfor %}
-                  </ul>
-                  {% endif %}
-                </li>
-              {% endfor %}
-              </ul>
-              {% endif %}
-              {% endfor %}
-              </ul>
-            </div>
-            {%- elif meta and meta['globalsidebartoc']|tobool %}
-            <div class="sk-sidebar-toc sk-sidebar-global-toc">
-              {{ toctree(maxdepth=2, titles_only=True) }}
-            </div>
-            {%- else %}
-            <div class="sk-sidebar-toc">
-              {{ toc }}
-            </div>
-            {%- endif %}
-      </div>
-    </div>
-    <div id="sk-page-content-wrapper">
-      <div class="sk-page-content container-fluid body px-md-3" role="main">
-        {% block body %}{% endblock %}
-      </div>
-    <div class="container">
-      <footer class="sk-content-footer">
-        {%- if pagename != 'index' %}
-        {%- if show_copyright %}
-          {%- if hasdoc('copyright') %}
-            {% trans path=pathto('copyright'), copyright=copyright|e %}&copy; {{ copyright }}.{% endtrans %}
-          {%- else %}
-            {% trans copyright=copyright|e %}&copy; {{ copyright }}.{% endtrans %}
-          {%- endif %}
-        {%- endif %}
-        {%- if last_updated %}
-          {% trans last_updated=last_updated|e %}Last updated on {{ last_updated }}.{% endtrans %}
-        {%- endif %}
-        {%- if show_source and has_source and sourcename %}
-          <a href="{{ pathto('_sources/' + sourcename, true)|e }}" rel="nofollow">{{ _('Show this page source') }}</a>
-        {%- endif %}
-        {%- endif %}
-      </footer>
-    </div>
-  </div>
-</div>
-{%- endblock %}
-<script src="{{ pathto('_static/js/vendor/bootstrap.min.js', 1) }}"></script>
-{% include "javascript.html" %}
-</body>
-</html>
diff --git a/doc/themes/scikit-learn-modern/nav.html b/doc/themes/scikit-learn-modern/nav.html
deleted file mode 100644
index 14d82e2e46e95..0000000000000
--- a/doc/themes/scikit-learn-modern/nav.html
+++ /dev/null
@@ -1,102 +0,0 @@
-{%- if pagename != 'index' and pagename != 'documentation' %}
-  {%- set nav_bar_class = "sk-docs-navbar" %}
-  {%- set top_container_cls = "sk-docs-container" %}
-{%- else %}
-  {%- set nav_bar_class = "sk-landing-navbar" %}
-  {%- set top_container_cls = "sk-landing-container" %}
-{%- endif %}
-
-{% if theme_link_to_live_contributing_page|tobool %}
-{# Link to development page for live builds #}
-  {%- set development_link = "https://scikit-learn.org/dev/developers/index.html" %}
-{# Open on a new development page in new window/tab for live builds #}
-  {%- set development_attrs = 'target="_blank" rel="noopener noreferrer"' %}
-{%- else %}
-  {%- set development_link = pathto('developers/index') %}
-  {%- set development_attrs = '' %}
-{%- endif %}
-
-{# title, link, link_attrs #}
-{%- set drop_down_navigation = [
-  ('Getting Started', pathto('getting_started'), ''),
-  ('Tutorial', pathto('tutorial/index'), ''),
-  ("What's new", pathto('whats_new/v' + version), ''),
-  ('Glossary', pathto('glossary'), ''),
-  ('Development', development_link, development_attrs),
-  ('FAQ', pathto('faq'), ''),
-  ('Support', pathto('support'), ''),
-  ('Related packages', pathto('related_projects'), ''),
-  ('Roadmap', pathto('roadmap'), ''),
-  ('Governance', pathto('governance'), ''),
-  ('About us', pathto('about'), ''),
-  ('GitHub', 'https://github.com/scikit-learn/scikit-learn', ''),
-  ('Other Versions and Download', 'https://scikit-learn.org/dev/versions.html', '')]
--%}
-
-<nav id="navbar" class="{{ nav_bar_class }} navbar navbar-expand-md navbar-light bg-light py-0">
-  <div class="container-fluid {{ top_container_cls }} px-0">
-    {%- if logo_url %}
-      <a class="navbar-brand py-0" href="{{ pathto('index') }}">
-        <img
-          class="sk-brand-img"
-          src="{{ logo_url|e }}"
-          alt="logo"/>
-      </a>
-    {%- endif %}
-    <button
-      id="sk-navbar-toggler"
-      class="navbar-toggler"
-      type="button"
-      data-toggle="collapse"
-      data-target="#navbarSupportedContent"
-      aria-controls="navbarSupportedContent"
-      aria-expanded="false"
-      aria-label="Toggle navigation"
-    >
-      <span class="navbar-toggler-icon"></span>
-    </button>
-
-    <div class="sk-navbar-collapse collapse navbar-collapse" id="navbarSupportedContent">
-      <ul class="navbar-nav mr-auto">
-        <li class="nav-item">
-          <a class="sk-nav-link nav-link" href="{{ pathto('install') }}">Install</a>
-        </li>
-        <li class="nav-item">
-          <a class="sk-nav-link nav-link" href="{{ pathto('user_guide') }}">User Guide</a>
-        </li>
-        <li class="nav-item">
-          <a class="sk-nav-link nav-link" href="{{ pathto('modules/classes') }}">API</a>
-        </li>
-        <li class="nav-item">
-          <a class="sk-nav-link nav-link" href="{{ pathto('auto_examples/index') }}">Examples</a>
-        </li>
-        <li class="nav-item">
-          <a class="sk-nav-link nav-link" target="_blank" rel="noopener noreferrer" href="https://blog.scikit-learn.org/">Community</a>
-        </li>
-        {%- for title, link, link_attrs in drop_down_navigation %}
-        <li class="nav-item">
-          <a class="sk-nav-link nav-link nav-more-item-mobile-items" href="{{ link }}" {{ link_attrs }}>{{ title }}</a>
-        </li>
-        {%- endfor %}
-        <li class="nav-item dropdown nav-more-item-dropdown">
-          <a class="sk-nav-link nav-link dropdown-toggle" href="#" id="navbarDropdown" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false">More</a>
-          <div class="dropdown-menu" aria-labelledby="navbarDropdown">
-            {%- for title, link, link_attrs in drop_down_navigation %}
-              <a class="sk-nav-dropdown-item dropdown-item" href="{{ link }}" {{ link_attrs }}>{{ title}}</a>
-            {%- endfor %}
-          </div>
-        </li>
-      </ul>
-      {%- if pagename != "search"%}
-      <div id="searchbox" role="search">
-          <div class="searchformwrapper">
-          <form class="search" action="{{ pathto('search') }}" method="get">
-            <input class="sk-search-text-input" type="text" name="q" aria-labelledby="searchlabel" />
-            <input class="sk-search-text-btn" type="submit" value="{{ _('Go') }}" />
-          </form>
-          </div>
-      </div>
-      {%- endif %}
-    </div>
-  </div>
-</nav>
diff --git a/doc/themes/scikit-learn-modern/search.html b/doc/themes/scikit-learn-modern/search.html
deleted file mode 100644
index 81e000bf9e5c4..0000000000000
--- a/doc/themes/scikit-learn-modern/search.html
+++ /dev/null
@@ -1,8 +0,0 @@
-{%- extends "basic/search.html" %}
-{% block extrahead %}
-  <script type="text/javascript" src="{{ pathto('searchindex.js', 1) }}" defer></script>
-  <script src="{{ pathto('_static/doctools.js', 1) }}"></script>
-  <script src="{{ pathto('_static/language_data.js', 1) }}"></script>
-  <script src="{{ pathto('_static/searchtools.js', 1) }}"></script>
-  <script src="{{ pathto('_static/sphinx_highlight.js', 1) }}"></script>
-{% endblock %}
diff --git a/doc/themes/scikit-learn-modern/static/css/theme.css b/doc/themes/scikit-learn-modern/static/css/theme.css
deleted file mode 100644
index bd447d88e0b3b..0000000000000
--- a/doc/themes/scikit-learn-modern/static/css/theme.css
+++ /dev/null
@@ -1,1412 +0,0 @@
-/* Elements */
-a {
-  color: #2878A2;
-  word-wrap: break-word;
-}
-
-a:focus {
-  outline: none;
-}
-
-/* Anchor links */
-
-a.headerlink {
-  color: #c60f0f;
-  font-size: 0.8em;
-  padding: 0 4px 0 4px;
-  text-decoration: none;
-  visibility: hidden;
-}
-
-a.headerlink:hover {
-  background-color: #c60f0f;
-  color: white;
-}
-
-p {
-  word-break: break-word;
-  hyphens: auto;
-}
-
-input:focus {
-  outline: none;
-}
-
-code {
-  color: #222;
-  background-color: #ecf0f3;
-  border-radius: 0.2rem;
-  padding: 0.15rem;
-  word-break: normal;
-}
-
-nav {
-  z-index: 3;
-}
-
-h1 code, h2 code, h3 code, h4 code, h5 code, h6 code {
-  background-color: transparent;
-}
-
-h4 .section-number, h5 .section-number, h6 .section-number {
-  display: none;
-}
-
-h1:hover a.headerlink,
-h2:hover a.headerlink,
-h3:hover a.headerlink,
-h4:hover a.headerlink,
-h5:hover a.headerlink,
-h6:hover a.headerlink,
-dt:hover a.headerlink {
-  visibility: visible;
-}
-
-strong {
-  font-weight: bold;
-}
-
-a code {
-  color: inherit;
-}
-
-a code {
-  background-color: transparent;
-  font-weight: bold;
-  color: #2878A2;
-  border-radius: 0;
-  padding: 0;
-  white-space: nowrap;
-}
-
-img {
-   max-width: 100%;
-}
-
-span.highlighted {
-    background-color: #fbe54e;
-}
-
-div.highlight {
-  border: 1px solid #ddd;
-  margin-bottom: 1rem;
-}
-
-div.highlight pre {
-  padding: 0.2rem 0.5rem;
-  margin-bottom: 0;
-  line-height: 1.2rem;
-}
-
-div.highlight a {
-  text-decoration: underline;
-}
-
-.versionmodified {
-  font-style: italic;
-}
-
-a.sk-landing-btn {
-  background-color: #ff9c34;
-  color: black;
-  cursor: pointer;
-  font-size: 1.1rem;
-  font-weight: 500;
-}
-
-a.sk-landing-btn:hover {
-  background-color: #ffb05f;
-}
-
-.sk-donate-btn {
-  cursor: pointer;
-}
-
-.sk-page-content div.logo {
-  float: left;
-  width: 200px;
-}
-
-@media screen and (min-width: 992px) {
-  .sk-page-content {
-    padding-left: 2rem!important;
-    padding-right: 2rem!important;
-  }
-}
-
-@media screen and (min-width: 1200px) {
-  .sk-px-xl-4 {
-    padding-left: 1.3rem!important;
-    padding-right: 1.3rem!important;
-  }
-}
-
-/* clearfix */
-
-div.clearer {
-  clear: both;
-}
-
-/* details / summary */
-
-/* Enables section links to be visible when anchor-linked */
-div.sk-page-content details::before {
-  display: block;
-  height: 52px;
-  margin-top: -52px;
-  visibility: hidden;
-  content: "";
-}
-
-div.sk-page-content details {
-    margin: 4ex 0pt;
-}
-
-div.sk-page-content summary.btn {
-    display: list-item;
-    padding: 6px 20px;
-    border: 1pt solid #999;
-}
-
-div.sk-page-content details div.card {
-    padding: 0pt .5ex;
-    margin: 1ex 0pt;
-    border: 1px solid #e9ecef;
-    border-left-width: .25rem;
-    border-radius: .25rem;
-    background: rgb(250, 252, 253)
-}
-
-div.sk-page-content summary {
-  position: relative; /* Needed for the tooltips */
-}
-
-div.sk-page-content summary .tooltiptext {
-  visibility: hidden;
-  width: 120px;
-  background-color: black;
-  color: #fff;
-  text-align: center;
-  border-radius: 6px;
-  padding: 5px 0;
-  position: absolute;
-  z-index: 1;
-  bottom: 150%;
-  left: 50%;
-  margin-left: -60px;
-}
-
-div.sk-page-content summary .tooltiptext::after {
-  content: "";
-  position: absolute;
-  top: 100%;
-  left: 50%;
-  margin-left: -5px;
-  border-width: 5px;
-  border-style: solid;
-  border-color: black transparent transparent transparent;
-}
-
-div.sk-page-content summary:hover .tooltiptext {
-  visibility: visible;
-}
-
-div.sk-page-content summary:hover .headerlink {
-  visibility: visible;
-}
-
-/* Button */
-
-.sk-btn-primary {
-  background-color: #30799C;
-  border-color: #30799C;
-  color: white;
-}
-
-.sk-btn-primary:hover,
-.sk-btn-primary:active {
-  background-color: #3499cd;
-  border-color: #3499cd;
-}
-
-/* Quote */
-
-.quote {
-  text-align: right;
-  line-height: 1.5em;
-  font-style: italic;
-  margin: 2em 3em 1em 3em;
-}
-
-.line-block {
-  display: block;
-  margin-top: 1em;
-  margin-bottom: 1em;
-}
-
-/* Search */
-
-#search-results {
-  margin-top: 1rem;
-}
-
-#searchbox {
-  padding-top: 0.1rem;
-}
-
-.sk-search-text-input {
-  width: 12rem;
-}
-
-.sk-search-text-btn {
-  padding-left: 0.2rem;
-  padding-right: 0.2rem;
-}
-
-ul.search li div.context {
-  color: #888;
-  margin: 0.1rem 0 0 0;
-  text-align: left;
-}
-
-@media screen and (min-width: 768px) {
-  ul.search li div.context {
-    margin-left: 1rem;
-  }
-
-  .sk-search-text-input {
-    width: 5rem;
-  }
-}
-
-@media screen and (min-width: 806px) {
-  .sk-search-text-input {
-    width: 7rem;
-  }
-}
-
-@media screen and (min-width: 820px) {
-  .sk-search-text-input {
-    width: 8rem;
-  }
-}
-
-@media screen and (min-width: 886px) {
-  .sk-search-text-input {
-    width: 12rem;
-  }
-}
-
-ul.search li a {
-  font-weight: bold;
-}
-/* navbar */
-
-img.sk-brand-img {
-  height: 48px;
-}
-
-.navbar-light .navbar-nav a.nav-link, a.sk-dropdown-item  {
-  color: rgba(77, 77, 77, 1);
-  font-weight: 500;
-}
-
-.navbar-light .navbar-nav a.nav-link:hover, a.sk-dropdown-item:hover {
-  color: rgba(246, 126, 0, 1);
-}
-
-a.sk-nav-dropdown-item:active {
-  color: white;
-  background-color: rgba(246, 126, 0, 1);
-}
-
-.nav-more-item-mobile-items {
-  display: inherit;
-}
-
-.nav-more-item-dropdown {
-  display: none;
-}
-
-@media screen and (min-width: 768px) {
-  .nav-more-item-dropdown {
-    display: inherit;
-  }
-
-  .nav-more-item-mobile-items {
-    display: none;
-  }
-}
-/* LANDING PAGE STYLE */
-
-div.sk-landing-container {
-  max-width: 1400px;
-}
-
-div.sk-landing-container .text-white {
-    text-shadow: 0px 0px 8px rgb(42, 98, 128);
-}
-
-ul.sk-landing-header-body {
-  margin-top: auto;
-  margin-bottom: auto;
-  font-size: 1.2rem;
-  font-weight: 500;
-}
-
-div.sk-landing-bg-more-info dd {
-  padding-left: 0;
-}
-
-div.sk-landing-bg {
-  background-image: linear-gradient(160deg, rgba(42,98,128,1) 0%, rgba(52,153,205,1) 17%, rgba(255,243,211,1) 59%, rgba(255,178,96,1) 100%);
-}
-
-div.sk-landing-bg-more-info {
-  background-color: #f8f8f8;
-  font-size: 0.96rem;
-}
-
-.sk-card-title {
-  font-weight: 700;
-}
-
-.sk-landing-header {
-  font-size: 3.2rem;
-}
-
-.sk-landing-subheader {
-  letter-spacing: 0.17rem;
-}
-
-.sk-landing-call-header {
-  color: #E07200;
-  font-weight: 700;
-}
-
-img.sk-index-img {
-  max-height: 240px;
-  margin: auto;
-  margin-bottom: 1em;
-  width: auto;
-}
-
-@media screen and (min-width: 768px) {
-  img.sk-index-img {
-    width: 100%
-  }
-}
-
-img.sk-who-uses-carousel-img {
-  max-height: 100px;
-  max-width: 50%;
-}
-
-div#carouselExampleSlidesOnly {
-  min-height: 200px;
-}
-
-ul.sk-landing-call-list li {
-  margin-bottom: 0.25rem;
-}
-
-img.sk-footer-funding-logo {
-  max-height: 36px;
-  max-width: 80px;
-  margin: 0 8px;
-  margin-bottom: 8px;
-}
-
-a.sk-footer-funding-link:hover {
-  text-decoration: none;
-}
-/* DOCS STYLE */
-
-.navbar > .sk-docs-container {
-  max-width: 1400px;
-  margin: 0 auto;
-}
-
-#sk-sidebar-wrapper {
-  height: 100%;
-  overflow-y: hidden;
-  overflow-x: hidden;
-  position: fixed;
-  margin-left: -240px;
-  width: 240px;
-  -webkit-transition: margin 0.25s ease-out, opacity 0.25s ease-out;
-  -moz-transition: margin 0.25s ease-out, opacity 0.25s ease-out;
-  -o-transition: margin 0.25s ease-out, opacity 0.25s ease-out;
-  transition: margin 0.25s ease-out, opacity 0.25s ease-out;
-  background-color: white;
-  opacity: 0;
-  top: 0;
-  padding: 0 0.5rem 0.5rem 0.5rem;
-  z-index: 2;
-}
-
-#sk-toggle-checkbox {
-  display: none;
-}
-
-#sk-toggle-checkbox:checked ~ #sk-sidebar-wrapper {
-  margin-left: 0;
-  opacity: 1;
-}
-
-#sk-doc-wrapper {
-  max-width: 1400px;
-  margin: 0 auto;
-}
-
-#sk-page-content-wrapper {
-  width: 100%;
-}
-
-/* Enables section links to be visible when anchor-linked */
-section[id]::before {
-  display: block;
-  height: 52px;
-  margin-top: -52px;
-  visibility: hidden;
-  content: "";
-}
-
-div.sk-page-content {
-  background-color: white;
-  position: relative;
-  margin-top: 0.5rem;
-}
-
-div.sk-page-content {
-  table-layout: fixed;
-  max-width: 100%;
-}
-
-div.section h2,
-div.section h3,
-div.section h4,
-div.section h5,
-div.section h6 {
-  margin-top: 1rem;
-}
-
-.sk-btn-toggle-toc {
-  position: fixed;
-  bottom: 0;
-  margin: 0;
-  border-radius: 0;
-  border-top-right-radius: 0.5rem;
-  z-index: 3;
-  cursor: pointer;
-}
-
-div.sk-page-content {
-  margin-top: 52px;
-}
-
-@media screen and (min-width: 1400px) {
-  .sk-btn-toggle-toc {
-    border-top-left-radius: 0.5rem;
-  }
-}
-
-.sk-btn-toggle-toc:hover {
-  color: white;
-  background-color: #297ca7;
-}
-
-footer.sk-content-footer {
-  padding: 1rem 0;
-  color: #999;
-  text-align: right;
-}
-
-nav.sk-docs-navbar {
-  width: 100%;
-  z-index: 3;
-  -webkit-transition: top .2s ease-in-out;
-  -moz-transition: top .2s ease-in-out .05s;
-  -o-transition: top .2s ease-in-out .05s;
-  transition: top .2s ease-in-out .05s;
-  position: fixed;
-  max-height: 100vh;
-  overflow-y: auto;
-  align-items: initial;
-}
-
-div.sk-navbar-collapse {
-  padding-bottom: 4rem;
-}
-
-@media screen and (min-width: 768px) {
-
-  nav.sk-docs-navbar {
-    overflow-y: visible;
-    max-height: none;
-  }
-
-  div.sk-navbar-collapse {
-    padding-bottom: 0;
-  }
-
-  #sk-page-content-wrapper {
-    padding-left: 240px;
-    max-width: 1240px;
-    margin-left: auto;
-    margin-right: auto;
-  }
-
-  #sk-sidebar-wrapper {
-    margin-left: 0;
-    opacity: 1;
-  }
-
-  #sk-toggle-checkbox:checked ~ #sk-sidebar-wrapper {
-    margin-left: -240px;
-    opacity: 0;
-  }
-
-  #sk-toggle-checkbox:checked ~ #sk-page-content-wrapper {
-    padding-left: 0;
-    margin-left: auto;
-    margin-right: auto;
-  }
-}
-
-.centered {
-  text-align: center;
-}
-
-dl.citation > dd > ol > li {
-  display: inline;
-}
-
-dl.citation > dd > ol {
-  margin-bottom: 0;
-}
-
-/* docs index */
-
-div.sk-documentation-index-card {
-  border-left: 0.15rem solid #ff9c34;
-}
-div.sk-documentation-index-card:hover {
-  box-shadow: 0 0.5rem 1rem rgba(0, 0, 0, 0.15);
-}
-
-a.sk-documentation-index-anchor:hover {
-  text-decoration: none;
-  color: #2878A2;
-}
-
-.sk-documentation-index-header {
-  background-color: #cde8ef;
-  padding: 0.5rem;
-  border-radius: 0 1rem;
-  text-align: center;
-  font-size: 2rem;
-  font-weight: 500;
-}
-
-/* toc  */
-
-.sk-toc-active {
-  font-weight: bold;
-}
-
-div.sk-sidebar-toc-wrapper {
-  font-size: 0.9rem;
-  width: 252px;
-  overflow-x: hidden;
-  overflow-y: scroll;
-  height: 100vh;
-  padding-right: 1.75rem;
-  padding-top: 52px;
-
-  /* Hide scrollbar for IE and Edge */
-  -ms-overflow-style: none;
-
-  /* Hide scrollbar for Firefox */
-  scrollbar-width: none;
-}
-
-div.sk-sidebar-toc-wrapper::-webkit-scrollbar {
-  display: none;
-}
-
-div.sk-sidebar-toc-wrapper::after {
-  display: block;
-  content: "";
-  height: 3rem;
-  visibility: hidden;
-}
-
-div.sk-sidebar-toc > ul > li > a{
-  font-weight: bold;
-}
-
-div.sk-sidebar-toc > ul,
-div.sk-sidebar-toc ul ul {
-  list-style: none;
-  margin-left: 0;
-  padding-left: 0;
-}
-
-div.sk-sidebar-toc ul ul ul {
-  margin-left: 1rem;
-}
-
-
-div.sk-sidebar-toc ul li ul li ul{
-  display: none;
-}
-
-div.sk-sidebar-toc span {
-  white-space: pre;
-}
-
-div.sk-sidebar-global-toc ul ul {
-  padding-left: 0.75rem;
-}
-/* content styling element style */
-
-div.sk-page-content h1 {
-  background-color: #cde8ef;
-  padding: 0.5rem;
-  margin-top: calc(max(1rem, 1vh));
-  border-radius: 0 1rem;
-  text-align: center;
-  font-size: 2rem;
-  word-wrap: break-word;
-}
-
-/* General sibling selector: does not apply to first h1, to avoid gap in
- * top of page */
-div.sk-page-content ~ h1 {
-    margin-top: calc(max(2.5rem, 1vh));
-}
-
-div.sk-page-content h2 {
-  padding: 0.5rem;
-  background-color: #BED4EB;
-  border-radius: 0.3rem;
-  font-size: 1.5rem;
-  margin-top: calc(max(2rem, .7vh));
-  margin-bottom: 1rem;
-  word-wrap: break-word;
-}
-
-div.sk-page-content h3 {
-  padding: 0.3rem;
-  background-color: #eee;
-  border-radius: 0.3rem;
-  font-size: 1.2rem;
-  word-wrap: break-word;
-  margin-top: 1.5rem;
-}
-
-div.sk-page-content h4 {
-  padding: 0.2rem;
-  background-color: #F4F4F4;
-  border-radius: 0.3rem;
-  font-size: 1.2rem;
-  word-wrap: break-word;
-}
-
-div.sk-page-content h1 code,
-div.sk-page-content h2 code,
-div.sk-page-content h3 code,
-div.sk-page-content h4 code {
-  white-space: normal;
-}
-
-/* longtables */
-
-table.longtable p {
-    -moz-hyphens: none;
-    -ms-hyphens: none;
-    -webkit-hyphens: none;
-    hyphens: none;
-    line-height: 1.1em;
-    margin-bottom: 0;
-}
-
-table.longtable td, table.longtable th {
-  border-top: 1px solid #ddd;
-  border-bottom: 1px solid #ddd;
-  padding-right: 0.5rem;
-  white-space:nowrap;
-}
-
-table.longtable tr.row-odd {
-  background-color: #F0F7FA;
-}
-
-/* api docs */
-
-.class > dt, .function > dt, .method > dt {
-  padding: 0.5rem;
-  background-color: #f8f8f8;
-  font-weight: normal;
-  border: 1px solid rgba(0, 0, 0, 0.125);
-  border-left: 2px solid #ff9c34;
-  overflow: auto;
-  margin-bottom: 1rem;
-}
-
-.class > dt::after, .function > dt::after, .method > dt::after {
-  overflow: auto;
-}
-
-span.descname {
-  font-weight: bold;
-  background-color: transparent;
-  padding: 0;
-  font-family: monospace;
-}
-
-span.descclassname {
-  background-color: transparent;
-  font-family: monospace;
-}
-
-.viewcode-link {
-  float: right;
-}
-
-dl.field-list {
-  display: flex;
-  flex-wrap: wrap;
-  overflow-x: auto;
-}
-
-dl.field-list > dt {
-  flex-basis: 100%;
-  font-weight: bold;
-  word-break: break-word;
-}
-
-dl.field-list > dd {
-  flex-basis: 100%;
-  margin-bottom: 0;
-}
-
-@media screen and (min-width: 768px) {
-  dl.field-list > dt {
-    flex-basis: 110px;
-  }
-  dl.field-list > dd {
-    flex: 1 0 calc(100% - 110px);
-    max-width: calc(100% - 110px);
-  }
-
-}
-
-dt.field-odd, dt.field-even {
-  background-color: #F0F7FA;
-  padding-left: 0.25rem;
-}
-
-.field-odd, .field-even {
-  margin-top: 0;
-  border-bottom: 1px solid #ddd;
-  border-top: 1px solid #ddd;
-  box-sizing: border-box;
-}
-
-.classifier {
-  font-style: italic;
-}
-
-.classifier::before {
-  font-style: normal;
-  margin: 0 0.3em;
-  content: ":";
-  display: inline-block;
-}
-
-dd {
-  padding-left: 1rem;
-}
-
-dl.class > dd {
-  padding-left: 0;
-}
-
-@media screen and (min-width: 768px) {
-  dl.class > dd {
-    padding-left: 1rem;
-  }
-}
-
-.rubric {
-  font-weight: bold;
-  margin-top: 1rem;
-}
-
-ul.simple li p, ol.simple li p {
-  margin-bottom: 0;
-}
-
-ul.simple, ol.simple {
-  padding-left: 1.5rem;
-}
-
-/* info boxes */
-
-div.topic {
-  padding: 0.5rem;
-  background-color: #eee;
-  margin-bottom: 1rem;
-  border-radius: 0.25rem;
-  border: 1px solid #CCC;
-}
-
-div.topic p {
-  margin-bottom: 0.25rem;
-}
-
-div.topic dd {
-  margin-bottom: 0.25rem;
-}
-
-p.topic-title {
-  font-weight: bold;
-  margin-bottom: 0.5rem;
-}
-
-div.topic > ul.simple {
-  margin-bottom: 0.25rem;
-}
-
-p.admonition-title {
-  margin-right: 0.5rem;
-  font-weight: bold;
-  display: inline;
-}
-
-p.admonition-title:after {
-  content: ":";
-}
-
-div.admonition p.admonition-title + p, div.deprecated p {
-  display: inline;
-}
-
-div.admonition, div.deprecated,
-div.versionchanged {
-  margin-top: 0.5rem;
-  padding: 0.5rem;
-  border-radius: 0.5rem;
-  margin-bottom: 0.5rem;
-  border: 1px solid #ddd;
-}
-
-div.versionadded {
-  margin: 1rem 0;
-}
-
-div.admonition {
-  background-color: #eee;
-}
-
-div.admonition p:last-child,
-div.admonition dl:last-child,
-div.admonition dd:last-child,
-div.deprecated p:last-child,
-div.versionchanged p:last-child,
-div.versionadded p:last-child{
-  margin-bottom: 0
-}
-
-div.deprecated {
-  color: #b94a48;
-  background-color: #F3E5E5;
-  border-color: #eed3d7;
-}
-
-div.seealso {
-  background-color: #FFFBE8;
-  border-color: #fbeed5;
-  color: #AF8A4B;
-}
-
-div.versionchanged {
-  background-color: #FFFBE8;
-  border-color: #fbeed5;
-}
-
-dt.label {
-  float: left;
-  padding-right: 0.5rem;
-}
-
-button.copybtn {
-  border: 0;
-}
-
-div.body img {
-    max-width: 100%;
-    height: unset!important; /* Needed because sphinx sets the height */
-}
-
-div.body dd > p {
-    hyphens: none;
-}
-
-img.align-center, figure.align-center,
-.figure.align-center, object.align-center {
-  display: block;
-  margin-left: auto;
-  margin-right: auto;
-  margin-bottom: 1rem;
-  text-align: center;
-}
-
-img.align-right, figure.align-right,
-.figure.align-right, object.align-right {
-  clear: right;
-  float: right;
-  margin-left: 1em;
-}
-
-/* world */
-
-img.avatar {
-  width: 100%;
-}
-
-/* table */
-table.align-default {
-  margin-left: auto;
-  margin-right: auto;
-}
-
-table.docutils tr:nth-child(odd) {
-  background-color: #F0F7FA;
-}
-
-table.docutils tr {
-  border-style: solid none solid none;
-  border-width: 1px 0;
-  border-color: #ddd;
-}
-
-table.docutils td, table.docutils th {
-  padding: 0.125rem 0.5rem 0.125rem 0.25rem;
-}
-
-table.docutils {
-  margin-bottom: 1rem;
-  line-height: 1rem;
-  max-width: 100%;
-  display: block;
-  overflow-x: auto;
-}
-
-table.docutils p {
-  margin-bottom: 0;
-}
-
-table.docutils p {
-  white-space: pre-wrap;
-  word-wrap: break-word;
-  word-break: initial;
-}
-
-/* gallery */
-
-div.sphx-glr-thumbcontainer {
-  min-height: 250px;
-  font-size: 0.9rem;
-}
-
-.sphx-glr-example-title > :target::before {
-  display: block;
-  content: "";
-  margin-top: -150px;
-  height: 150px;
-  visibility: hidden;
-}
-
-.sphx-glr-script-out .highlight pre {
-  padding: 1ex;
-}
-
-.sphx-glr-script-out div.highlight {
-  padding: 0;
-}
-
-@media screen and (min-width: 1540px) {
-  div.sphx-glr-download-link-note.admonition.note {
-    position: absolute;
-    left: 98%;
-    width: 20ex;
-    margin-top: calc(max(5.75rem, 1vh));
-  }
-}
-
-/* Pandas dataframe css */
-/* Taken from: https://github.com/spatialaudio/nbsphinx/blob/fb3ba670fc1ba5f54d4c487573dbc1b4ecf7e9ff/src/nbsphinx.py#L587-L619 */
-/* FIXME: to be removed when sphinx-gallery >= 5.0 will be released */
-
-table.dataframe {
-  border: none !important;
-  border-collapse: collapse;
-  border-spacing: 0;
-  border-color: transparent;
-  color: black;
-  font-size: 12px;
-  table-layout: fixed;
-}
-table.dataframe thead {
-  border-bottom: 1px solid black;
-  vertical-align: bottom;
-}
-table.dataframe tr,
-table.dataframe th,
-table.dataframe td {
-  text-align: right;
-  vertical-align: middle;
-  padding: 0.5em 0.5em;
-  line-height: normal;
-  white-space: normal;
-  max-width: none;
-  border: none;
-}
-table.dataframe th {
-  font-weight: bold;
-}
-table.dataframe tbody tr:nth-child(odd) {
-  background: #f5f5f5;
-}
-table.dataframe tbody tr:hover {
-  background: rgba(66, 165, 245, 0.2);
-}
-
-/* rellinks */
-
-.sk-btn-rellink {
-  background-color: #ff9c34;
-  border-color: #ff9c34;
-  color: white;
-  cursor: pointer;
-  font-size: 0.8rem;
-  font-weight: bold;
-}
-
-.sk-btn-rellink:hover {
-  color: black;
-  border: 1px solid black;
-}
-
-[sk-rellink-tooltip] {
-  position: relative;
-  cursor: pointer;
-}
-
-[sk-rellink-tooltip]::before {
-  visibility: hidden;
-  position: absolute;
-  padding: 0.5rem;
-  overflow: hidden;
-  background-color: #ff9c34;
-  border: 1px solid #ff9c34;
-  white-space: pre;
-  content: attr(sk-rellink-tooltip);
-  text-align: left;
-  width: 222px;
-  top: 100%;
-  left: -78px;
-  border: 1px solid black;
-}
-
-[sk-rellink-tooltip]:first-child::before {
-  left: 0;
-}
-
-[sk-rellink-tooltip]:last-child::before {
-  left: -144px;
-}
-
-[sk-rellink-tooltip]:hover::before {
-  visibility: visible;
-  white-space: pre-wrap;
-  word-wrap: break-word;
-}
-
-/* authors */
-.sk-authors-container {
-  display: flex;
-  flex-wrap: wrap;
-  justify-content: center;
-}
-
-.sk-authors-container > div {
-  width: 100px;
-  margin: 5px;
-  font-size: 0.9rem;
-}
-
-
-/* testimonial */
-
-div.testimonial h2 {
-  background-color: transparent;
-  color: #008EB2;
-  padding: 0;
-  height: 26px;
-  line-height: 1.1em;
-  font-size: 22px;
-  font-weight: bold;
-  text-align: left;
-}
-
-div.testimonial p {
-  color: #1c1c1c;
-}
-
-div.testimonial span.testimonial-author p {
-  font-size: 0.8em;
-  font-style: italic;
-  color: #808080;
-}
-
-div.testimonial p {
-  color: #1c1c1c;
-}
-
-/* Installation quickstart */
-/* This quickstart installation is a hack of the awesome
-   https://spacy.io/usage/#quickstart page.
-   See the original javascript implementation
-   https://github.com/ines/quickstart */
-
-/* style input radio and checkbox */
-
-div.install > input {
-  -moz-appearance: none;
-  -webkit-appearance: none;
-  appearance: none;
-  opacity: 0;
-}
-
-/* Style the button */
-div.install > label {
-  display: inline-block;
-  margin-top: 12px;
-  padding: 5px 11px;
-  background-color: #fff3cd;
-  border: none;
-  border-radius: 3px;
-  color: black;
-}
-
-div.install > label:hover {
-  cursor: pointer;
-}
-
-/* Style the button when the checkbox is checked */
-div.install > input:checked + label {
-  background-color: #ff9c34;
-  color: white;
-}
-
-/* Hide expandable content by default */
-.sk-expandable {
-  display: none;
-}
-.sk-expandable + .copybtn {
-  display: none;
-}
-
-pre.sk-expandable > span:before {
-  content: "$ ";
-}
-
-/* Show hidden content when the checkbox is checked */
-/* for conda */
-#quickstart-conda:checked  ~* [data-packager="conda"] {
-  display: block;
-}
-#quickstart-conda:checked  ~* [data-packager="conda"] + .copybtn {
-  display: block;
-}
-
-#quickstart-conda:checked ~ #quickstart-venv ~ label[for="quickstart-venv"] {
-  display: none;
-}
-#quickstart-conda:checked ~ #quickstart-venv ~ label[for="quickstart-venv"] + .copybtn {
-  display: none;
-}
-
-/* for pip */
-#quickstart-pip:checked ~* [data-packager="pip"] {
-  display: block;
-}
-#quickstart-pip:checked ~* [data-packager="pip"] + .copybtn {
-  display: block;
-}
-
-#quickstart-pip:checked ~ label[for="quickstart-venv"]:before  {
-  content: "Use pip virtualenv";
-}
-
-#quickstart-win:not(:checked) ~* [data-os="windows"] {
-  display: none;
-}
-#quickstart-win:not(:checked) ~* [data-os="windows"] + .copybtn {
-  display: none;
-}
-
-#quickstart-lin:not(:checked) ~* [data-os="linux"] {
-  display: none;
-}
-#quickstart-lin:not(:checked) ~* [data-os="linux"] + .copybtn {
-  display: none;
-}
-
-#quickstart-mac:not(:checked) ~* [data-os="mac"] {
-  display: none;
-}
-#quickstart-mac:not(:checked) ~* [data-os="mac"] + .copybtn {
-  display: none;
-}
-
-#quickstart-venv:not(:checked) ~* [data-venv=""] {
-  display: none;
-}
-#quickstart-venv:not(:checked) ~* [data-venv=""] + .copybtn {
-  display: none;
-}
-
-#quickstart-venv:checked ~* [data-venv="no"] {
-  display: none;
-}
-#quickstart-venv:checked ~* [data-venv="no"] + .copybtn {
-  display: none;
-}
-
-/* Algorithm cheet-sheet */
-
-div.sk-page-content img.map {
-  position: absolute;
-  max-width: none;
-  transform-origin: left top;
-  -webkit-transform: scale(0.5);
-      -ms-transform: scale(0.5);
-          transform: scale(0.5);
-}
-
-/* sponsors and testimonials */
-
-div.sk-sponsor-div, div.sk-testimonial-div {
-  display: flex;
-  flex-wrap: wrap;
-  -webkit-flex-align: center;
-  -ms-flex-align: center;
-  -webkit-align-items: center;
-  align-items: center;
-}
-
-div.sk-sponsor-div-box, div.sk-testimonial-div-box {
-  width: 100%;
-}
-
-@media screen and (min-width: 500px) {
-  div.sk-sponsor-div-box, div.sk-testimonial-div-box {
-    width: 50%;
-  }
-}
-
-div.sk-sponsor-div-box table.sk-sponsor-table {
-  display: table;
-}
-
-table.sk-sponsor-table tr, table.sk-sponsor-table tr:nth-child(odd) {
-  border-style: none;
-  background-color: white;
-  vertical-align: middle;
-  text-align: center;
-}
-
-table.sk-sponsor-table td {
-  padding: 0.30rem;
-}
-
-.caption {
-  text-align: center
-}
-
-/* pygments - highlighting */
-
-.highlight .hll { background-color: #ffffcc }
-.highlight  { background: #f8f8f8; }
-.highlight .c { color: #408090; font-style: italic } /* Comment */
-.highlight .err { border: 1px solid #FF0000 } /* Error */
-.highlight .k { color: #007020; font-weight: bold } /* Keyword */
-.highlight .o { color: #666666 } /* Operator */
-.highlight .ch { color: #408090; font-style: italic } /* Comment.Hashbang */
-.highlight .cm { color: #408090; font-style: italic } /* Comment.Multiline */
-.highlight .cp { color: #007020 } /* Comment.Preproc */
-.highlight .cpf { color: #408090; font-style: italic } /* Comment.PreprocFile */
-.highlight .c1 { color: #408090; font-style: italic } /* Comment.Single */
-.highlight .cs { color: #408090; background-color: #fff0f0 } /* Comment.Special */
-.highlight .gd { color: #A00000 } /* Generic.Deleted */
-.highlight .ge { font-style: italic } /* Generic.Emph */
-.highlight .gr { color: #FF0000 } /* Generic.Error */
-.highlight .gh { color: #000080; font-weight: bold } /* Generic.Heading */
-.highlight .gi { color: #00A000 } /* Generic.Inserted */
-.highlight .go { color: #333333 } /* Generic.Output */
-.highlight .gp { color: #c65d09; font-weight: bold } /* Generic.Prompt */
-.highlight .gs { font-weight: bold } /* Generic.Strong */
-.highlight .gu { color: #800080; font-weight: bold } /* Generic.Subheading */
-.highlight .gt { color: #0044DD } /* Generic.Traceback */
-.highlight .kc { color: #007020; font-weight: bold } /* Keyword.Constant */
-.highlight .kd { color: #007020; font-weight: bold } /* Keyword.Declaration */
-.highlight .kn { color: #007020; font-weight: bold } /* Keyword.Namespace */
-.highlight .kp { color: #007020 } /* Keyword.Pseudo */
-.highlight .kr { color: #007020; font-weight: bold } /* Keyword.Reserved */
-.highlight .kt { color: #902000 } /* Keyword.Type */
-.highlight .m { color: #208050 } /* Literal.Number */
-.highlight .s { color: #4070a0 } /* Literal.String */
-.highlight .na { color: #4070a0 } /* Name.Attribute */
-.highlight .nb { color: #007020 } /* Name.Builtin */
-.highlight .nc { color: #0e84b5; font-weight: bold } /* Name.Class */
-.highlight .no { color: #60add5 } /* Name.Constant */
-.highlight .nd { color: #555555; font-weight: bold } /* Name.Decorator */
-.highlight .ni { color: #d55537; font-weight: bold } /* Name.Entity */
-.highlight .ne { color: #007020 } /* Name.Exception */
-.highlight .nf { color: #06287e } /* Name.Function */
-.highlight .nl { color: #002070; font-weight: bold } /* Name.Label */
-.highlight .nn { color: #0e84b5; font-weight: bold } /* Name.Namespace */
-.highlight .nt { color: #062873; font-weight: bold } /* Name.Tag */
-.highlight .nv { color: #bb60d5 } /* Name.Variable */
-.highlight .ow { color: #007020; font-weight: bold } /* Operator.Word */
-.highlight .w { color: #bbbbbb } /* Text.Whitespace */
-.highlight .mb { color: #208050 } /* Literal.Number.Bin */
-.highlight .mf { color: #208050 } /* Literal.Number.Float */
-.highlight .mh { color: #208050 } /* Literal.Number.Hex */
-.highlight .mi { color: #208050 } /* Literal.Number.Integer */
-.highlight .mo { color: #208050 } /* Literal.Number.Oct */
-.highlight .sa { color: #4070a0 } /* Literal.String.Affix */
-.highlight .sb { color: #4070a0 } /* Literal.String.Backtick */
-.highlight .sc { color: #4070a0 } /* Literal.String.Char */
-.highlight .dl { color: #4070a0 } /* Literal.String.Delimiter */
-.highlight .sd { color: #4070a0; font-style: italic } /* Literal.String.Doc */
-.highlight .s2 { color: #4070a0 } /* Literal.String.Double */
-.highlight .se { color: #4070a0; font-weight: bold } /* Literal.String.Escape */
-.highlight .sh { color: #4070a0 } /* Literal.String.Heredoc */
-.highlight .si { color: #70a0d0; font-style: italic } /* Literal.String.Interpol */
-.highlight .sx { color: #c65d09 } /* Literal.String.Other */
-.highlight .sr { color: #235388 } /* Literal.String.Regex */
-.highlight .s1 { color: #4070a0 } /* Literal.String.Single */
-.highlight .ss { color: #517918 } /* Literal.String.Symbol */
-.highlight .bp { color: #007020 } /* Name.Builtin.Pseudo */
-.highlight .fm { color: #06287e } /* Name.Function.Magic */
-.highlight .vc { color: #bb60d5 } /* Name.Variable.Class */
-.highlight .vg { color: #bb60d5 } /* Name.Variable.Global */
-.highlight .vi { color: #bb60d5 } /* Name.Variable.Instance */
-.highlight .vm { color: #bb60d5 } /* Name.Variable.Magic */
-.highlight .il { color: #208050 } /* Literal.Number.Integer.Long */
diff --git a/doc/themes/scikit-learn-modern/static/css/vendor/bootstrap.min.css b/doc/themes/scikit-learn-modern/static/css/vendor/bootstrap.min.css
deleted file mode 100644
index 326cf7fb8aef2..0000000000000
--- a/doc/themes/scikit-learn-modern/static/css/vendor/bootstrap.min.css
+++ /dev/null
@@ -1,6 +0,0 @@
-/*!
- * Bootstrap v4.3.1 (https://getbootstrap.com/)
- * Copyright 2011-2019 The Bootstrap Authors
- * Copyright 2011-2019 Twitter, Inc.
- * Licensed under MIT (https://github.com/twbs/bootstrap/blob/master/LICENSE)
- */:root{--blue:#007bff;--indigo:#6610f2;--purple:#6f42c1;--pink:#e83e8c;--red:#dc3545;--orange:#fd7e14;--yellow:#ffc107;--green:#28a745;--teal:#20c997;--cyan:#17a2b8;--white:#fff;--gray:#6c757d;--gray-dark:#343a40;--primary:#007bff;--secondary:#6c757d;--success:#28a745;--info:#17a2b8;--warning:#ffc107;--danger:#dc3545;--light:#f8f9fa;--dark:#343a40;--breakpoint-xs:0;--breakpoint-sm:576px;--breakpoint-md:768px;--breakpoint-lg:992px;--breakpoint-xl:1200px;--font-family-sans-serif:-apple-system,BlinkMacSystemFont,"Segoe UI",Roboto,"Helvetica Neue",Arial,"Noto Sans",sans-serif,"Apple Color Emoji","Segoe UI Emoji","Segoe UI Symbol","Noto Color Emoji";--font-family-monospace:SFMono-Regular,Menlo,Monaco,Consolas,"Liberation Mono","Courier New",monospace}*,::after,::before{box-sizing:border-box}html{font-family:sans-serif;line-height:1.15;-webkit-text-size-adjust:100%;-webkit-tap-highlight-color:transparent}article,aside,figcaption,figure,footer,header,hgroup,main,nav,section{display:block}body{margin:0;font-family:-apple-system,BlinkMacSystemFont,"Segoe UI",Roboto,"Helvetica Neue",Arial,"Noto Sans",sans-serif,"Apple Color Emoji","Segoe UI Emoji","Segoe UI Symbol","Noto Color Emoji";font-size:1rem;font-weight:400;line-height:1.5;color:#212529;text-align:left;background-color:#fff}[tabindex="-1"]:focus{outline:0!important}hr{box-sizing:content-box;height:0;overflow:visible}h1,h2,h3,h4,h5,h6{margin-top:0;margin-bottom:.5rem}p{margin-top:0;margin-bottom:1rem}abbr[data-original-title],abbr[title]{text-decoration:underline;-webkit-text-decoration:underline dotted;text-decoration:underline dotted;cursor:help;border-bottom:0;-webkit-text-decoration-skip-ink:none;text-decoration-skip-ink:none}address{margin-bottom:1rem;font-style:normal;line-height:inherit}dl,ol,ul{margin-top:0;margin-bottom:1rem}ol ol,ol ul,ul ol,ul ul{margin-bottom:0}dt{font-weight:700}dd{margin-bottom:.5rem;margin-left:0}blockquote{margin:0 0 1rem}b,strong{font-weight:bolder}small{font-size:80%}sub,sup{position:relative;font-size:75%;line-height:0;vertical-align:baseline}sub{bottom:-.25em}sup{top:-.5em}a{color:#007bff;text-decoration:none;background-color:transparent}a:hover{color:#0056b3;text-decoration:underline}a:not([href]):not([tabindex]){color:inherit;text-decoration:none}a:not([href]):not([tabindex]):focus,a:not([href]):not([tabindex]):hover{color:inherit;text-decoration:none}a:not([href]):not([tabindex]):focus{outline:0}code,kbd,pre,samp{font-family:SFMono-Regular,Menlo,Monaco,Consolas,"Liberation Mono","Courier New",monospace;font-size:1em}pre{margin-top:0;margin-bottom:1rem;overflow:auto}figure{margin:0 0 1rem}img{vertical-align:middle;border-style:none}svg{overflow:hidden;vertical-align:middle}table{border-collapse:collapse}caption{padding-top:.75rem;padding-bottom:.75rem;color:#6c757d;text-align:left;caption-side:bottom}th{text-align:inherit}label{display:inline-block;margin-bottom:.5rem}button{border-radius:0}button:focus{outline:1px dotted;outline:5px auto -webkit-focus-ring-color}button,input,optgroup,select,textarea{margin:0;font-family:inherit;font-size:inherit;line-height:inherit}button,input{overflow:visible}button,select{text-transform:none}select{word-wrap:normal}[type=button],[type=reset],[type=submit],button{-webkit-appearance:button}[type=button]:not(:disabled),[type=reset]:not(:disabled),[type=submit]:not(:disabled),button:not(:disabled){cursor:pointer}[type=button]::-moz-focus-inner,[type=reset]::-moz-focus-inner,[type=submit]::-moz-focus-inner,button::-moz-focus-inner{padding:0;border-style:none}input[type=checkbox],input[type=radio]{box-sizing:border-box;padding:0}input[type=date],input[type=datetime-local],input[type=month],input[type=time]{-webkit-appearance:listbox}textarea{overflow:auto;resize:vertical}fieldset{min-width:0;padding:0;margin:0;border:0}legend{display:block;width:100%;max-width:100%;padding:0;margin-bottom:.5rem;font-size:1.5rem;line-height:inherit;color:inherit;white-space:normal}progress{vertical-align:baseline}[type=number]::-webkit-inner-spin-button,[type=number]::-webkit-outer-spin-button{height:auto}[type=search]{outline-offset:-2px;-webkit-appearance:none}[type=search]::-webkit-search-decoration{-webkit-appearance:none}::-webkit-file-upload-button{font:inherit;-webkit-appearance:button}output{display:inline-block}summary{display:list-item;cursor:pointer}template{display:none}[hidden]{display:none!important}.h1,.h2,.h3,.h4,.h5,.h6,h1,h2,h3,h4,h5,h6{margin-bottom:.5rem;font-weight:500;line-height:1.2}.h1,h1{font-size:2.5rem}.h2,h2{font-size:2rem}.h3,h3{font-size:1.75rem}.h4,h4{font-size:1.5rem}.h5,h5{font-size:1.25rem}.h6,h6{font-size:1rem}.lead{font-size:1.25rem;font-weight:300}.display-1{font-size:6rem;font-weight:300;line-height:1.2}.display-2{font-size:5.5rem;font-weight:300;line-height:1.2}.display-3{font-size:4.5rem;font-weight:300;line-height:1.2}.display-4{font-size:3.5rem;font-weight:300;line-height:1.2}hr{margin-top:1rem;margin-bottom:1rem;border:0;border-top:1px solid rgba(0,0,0,.1)}.small,small{font-size:80%;font-weight:400}.mark,mark{padding:.2em;background-color:#fcf8e3}.list-unstyled{padding-left:0;list-style:none}.list-inline{padding-left:0;list-style:none}.list-inline-item{display:inline-block}.list-inline-item:not(:last-child){margin-right:.5rem}.initialism{font-size:90%;text-transform:uppercase}.blockquote{margin-bottom:1rem;font-size:1.25rem}.blockquote-footer{display:block;font-size:80%;color:#6c757d}.blockquote-footer::before{content:"\2014\00A0"}.img-fluid{max-width:100%;height:auto}.img-thumbnail{padding:.25rem;background-color:#fff;border:1px solid #dee2e6;border-radius:.25rem;max-width:100%;height:auto}.figure{display:inline-block}.figure-img{margin-bottom:.5rem;line-height:1}.figure-caption{font-size:90%;color:#6c757d}code{font-size:87.5%;color:#e83e8c;word-break:break-word}a>code{color:inherit}kbd{padding:.2rem .4rem;font-size:87.5%;color:#fff;background-color:#212529;border-radius:.2rem}kbd kbd{padding:0;font-size:100%;font-weight:700}pre{display:block;font-size:87.5%;color:#212529}pre code{font-size:inherit;color:inherit;word-break:normal}.pre-scrollable{max-height:340px;overflow-y:scroll}.container{width:100%;padding-right:15px;padding-left:15px;margin-right:auto;margin-left:auto}@media (min-width:576px){.container{max-width:540px}}@media (min-width:768px){.container{max-width:720px}}@media (min-width:992px){.container{max-width:960px}}@media (min-width:1200px){.container{max-width:1140px}}.container-fluid{width:100%;padding-right:15px;padding-left:15px;margin-right:auto;margin-left:auto}.row{display:-ms-flexbox;display:flex;-ms-flex-wrap:wrap;flex-wrap:wrap;margin-right:-15px;margin-left:-15px}.no-gutters{margin-right:0;margin-left:0}.no-gutters>.col,.no-gutters>[class*=col-]{padding-right:0;padding-left:0}.col,.col-1,.col-10,.col-11,.col-12,.col-2,.col-3,.col-4,.col-5,.col-6,.col-7,.col-8,.col-9,.col-auto,.col-lg,.col-lg-1,.col-lg-10,.col-lg-11,.col-lg-12,.col-lg-2,.col-lg-3,.col-lg-4,.col-lg-5,.col-lg-6,.col-lg-7,.col-lg-8,.col-lg-9,.col-lg-auto,.col-md,.col-md-1,.col-md-10,.col-md-11,.col-md-12,.col-md-2,.col-md-3,.col-md-4,.col-md-5,.col-md-6,.col-md-7,.col-md-8,.col-md-9,.col-md-auto,.col-sm,.col-sm-1,.col-sm-10,.col-sm-11,.col-sm-12,.col-sm-2,.col-sm-3,.col-sm-4,.col-sm-5,.col-sm-6,.col-sm-7,.col-sm-8,.col-sm-9,.col-sm-auto,.col-xl,.col-xl-1,.col-xl-10,.col-xl-11,.col-xl-12,.col-xl-2,.col-xl-3,.col-xl-4,.col-xl-5,.col-xl-6,.col-xl-7,.col-xl-8,.col-xl-9,.col-xl-auto{position:relative;width:100%;padding-right:15px;padding-left:15px}.col{-ms-flex-preferred-size:0;flex-basis:0;-ms-flex-positive:1;flex-grow:1;max-width:100%}.col-auto{-ms-flex:0 0 auto;flex:0 0 auto;width:auto;max-width:100%}.col-1{-ms-flex:0 0 8.333333%;flex:0 0 8.333333%;max-width:8.333333%}.col-2{-ms-flex:0 0 16.666667%;flex:0 0 16.666667%;max-width:16.666667%}.col-3{-ms-flex:0 0 25%;flex:0 0 25%;max-width:25%}.col-4{-ms-flex:0 0 33.333333%;flex:0 0 33.333333%;max-width:33.333333%}.col-5{-ms-flex:0 0 41.666667%;flex:0 0 41.666667%;max-width:41.666667%}.col-6{-ms-flex:0 0 50%;flex:0 0 50%;max-width:50%}.col-7{-ms-flex:0 0 58.333333%;flex:0 0 58.333333%;max-width:58.333333%}.col-8{-ms-flex:0 0 66.666667%;flex:0 0 66.666667%;max-width:66.666667%}.col-9{-ms-flex:0 0 75%;flex:0 0 75%;max-width:75%}.col-10{-ms-flex:0 0 83.333333%;flex:0 0 83.333333%;max-width:83.333333%}.col-11{-ms-flex:0 0 91.666667%;flex:0 0 91.666667%;max-width:91.666667%}.col-12{-ms-flex:0 0 100%;flex:0 0 100%;max-width:100%}.order-first{-ms-flex-order:-1;order:-1}.order-last{-ms-flex-order:13;order:13}.order-0{-ms-flex-order:0;order:0}.order-1{-ms-flex-order:1;order:1}.order-2{-ms-flex-order:2;order:2}.order-3{-ms-flex-order:3;order:3}.order-4{-ms-flex-order:4;order:4}.order-5{-ms-flex-order:5;order:5}.order-6{-ms-flex-order:6;order:6}.order-7{-ms-flex-order:7;order:7}.order-8{-ms-flex-order:8;order:8}.order-9{-ms-flex-order:9;order:9}.order-10{-ms-flex-order:10;order:10}.order-11{-ms-flex-order:11;order:11}.order-12{-ms-flex-order:12;order:12}.offset-1{margin-left:8.333333%}.offset-2{margin-left:16.666667%}.offset-3{margin-left:25%}.offset-4{margin-left:33.333333%}.offset-5{margin-left:41.666667%}.offset-6{margin-left:50%}.offset-7{margin-left:58.333333%}.offset-8{margin-left:66.666667%}.offset-9{margin-left:75%}.offset-10{margin-left:83.333333%}.offset-11{margin-left:91.666667%}@media (min-width:576px){.col-sm{-ms-flex-preferred-size:0;flex-basis:0;-ms-flex-positive:1;flex-grow:1;max-width:100%}.col-sm-auto{-ms-flex:0 0 auto;flex:0 0 auto;width:auto;max-width:100%}.col-sm-1{-ms-flex:0 0 8.333333%;flex:0 0 8.333333%;max-width:8.333333%}.col-sm-2{-ms-flex:0 0 16.666667%;flex:0 0 16.666667%;max-width:16.666667%}.col-sm-3{-ms-flex:0 0 25%;flex:0 0 25%;max-width:25%}.col-sm-4{-ms-flex:0 0 33.333333%;flex:0 0 33.333333%;max-width:33.333333%}.col-sm-5{-ms-flex:0 0 41.666667%;flex:0 0 41.666667%;max-width:41.666667%}.col-sm-6{-ms-flex:0 0 50%;flex:0 0 50%;max-width:50%}.col-sm-7{-ms-flex:0 0 58.333333%;flex:0 0 58.333333%;max-width:58.333333%}.col-sm-8{-ms-flex:0 0 66.666667%;flex:0 0 66.666667%;max-width:66.666667%}.col-sm-9{-ms-flex:0 0 75%;flex:0 0 75%;max-width:75%}.col-sm-10{-ms-flex:0 0 83.333333%;flex:0 0 83.333333%;max-width:83.333333%}.col-sm-11{-ms-flex:0 0 91.666667%;flex:0 0 91.666667%;max-width:91.666667%}.col-sm-12{-ms-flex:0 0 100%;flex:0 0 100%;max-width:100%}.order-sm-first{-ms-flex-order:-1;order:-1}.order-sm-last{-ms-flex-order:13;order:13}.order-sm-0{-ms-flex-order:0;order:0}.order-sm-1{-ms-flex-order:1;order:1}.order-sm-2{-ms-flex-order:2;order:2}.order-sm-3{-ms-flex-order:3;order:3}.order-sm-4{-ms-flex-order:4;order:4}.order-sm-5{-ms-flex-order:5;order:5}.order-sm-6{-ms-flex-order:6;order:6}.order-sm-7{-ms-flex-order:7;order:7}.order-sm-8{-ms-flex-order:8;order:8}.order-sm-9{-ms-flex-order:9;order:9}.order-sm-10{-ms-flex-order:10;order:10}.order-sm-11{-ms-flex-order:11;order:11}.order-sm-12{-ms-flex-order:12;order:12}.offset-sm-0{margin-left:0}.offset-sm-1{margin-left:8.333333%}.offset-sm-2{margin-left:16.666667%}.offset-sm-3{margin-left:25%}.offset-sm-4{margin-left:33.333333%}.offset-sm-5{margin-left:41.666667%}.offset-sm-6{margin-left:50%}.offset-sm-7{margin-left:58.333333%}.offset-sm-8{margin-left:66.666667%}.offset-sm-9{margin-left:75%}.offset-sm-10{margin-left:83.333333%}.offset-sm-11{margin-left:91.666667%}}@media (min-width:768px){.col-md{-ms-flex-preferred-size:0;flex-basis:0;-ms-flex-positive:1;flex-grow:1;max-width:100%}.col-md-auto{-ms-flex:0 0 auto;flex:0 0 auto;width:auto;max-width:100%}.col-md-1{-ms-flex:0 0 8.333333%;flex:0 0 8.333333%;max-width:8.333333%}.col-md-2{-ms-flex:0 0 16.666667%;flex:0 0 16.666667%;max-width:16.666667%}.col-md-3{-ms-flex:0 0 25%;flex:0 0 25%;max-width:25%}.col-md-4{-ms-flex:0 0 33.333333%;flex:0 0 33.333333%;max-width:33.333333%}.col-md-5{-ms-flex:0 0 41.666667%;flex:0 0 41.666667%;max-width:41.666667%}.col-md-6{-ms-flex:0 0 50%;flex:0 0 50%;max-width:50%}.col-md-7{-ms-flex:0 0 58.333333%;flex:0 0 58.333333%;max-width:58.333333%}.col-md-8{-ms-flex:0 0 66.666667%;flex:0 0 66.666667%;max-width:66.666667%}.col-md-9{-ms-flex:0 0 75%;flex:0 0 75%;max-width:75%}.col-md-10{-ms-flex:0 0 83.333333%;flex:0 0 83.333333%;max-width:83.333333%}.col-md-11{-ms-flex:0 0 91.666667%;flex:0 0 91.666667%;max-width:91.666667%}.col-md-12{-ms-flex:0 0 100%;flex:0 0 100%;max-width:100%}.order-md-first{-ms-flex-order:-1;order:-1}.order-md-last{-ms-flex-order:13;order:13}.order-md-0{-ms-flex-order:0;order:0}.order-md-1{-ms-flex-order:1;order:1}.order-md-2{-ms-flex-order:2;order:2}.order-md-3{-ms-flex-order:3;order:3}.order-md-4{-ms-flex-order:4;order:4}.order-md-5{-ms-flex-order:5;order:5}.order-md-6{-ms-flex-order:6;order:6}.order-md-7{-ms-flex-order:7;order:7}.order-md-8{-ms-flex-order:8;order:8}.order-md-9{-ms-flex-order:9;order:9}.order-md-10{-ms-flex-order:10;order:10}.order-md-11{-ms-flex-order:11;order:11}.order-md-12{-ms-flex-order:12;order:12}.offset-md-0{margin-left:0}.offset-md-1{margin-left:8.333333%}.offset-md-2{margin-left:16.666667%}.offset-md-3{margin-left:25%}.offset-md-4{margin-left:33.333333%}.offset-md-5{margin-left:41.666667%}.offset-md-6{margin-left:50%}.offset-md-7{margin-left:58.333333%}.offset-md-8{margin-left:66.666667%}.offset-md-9{margin-left:75%}.offset-md-10{margin-left:83.333333%}.offset-md-11{margin-left:91.666667%}}@media (min-width:992px){.col-lg{-ms-flex-preferred-size:0;flex-basis:0;-ms-flex-positive:1;flex-grow:1;max-width:100%}.col-lg-auto{-ms-flex:0 0 auto;flex:0 0 auto;width:auto;max-width:100%}.col-lg-1{-ms-flex:0 0 8.333333%;flex:0 0 8.333333%;max-width:8.333333%}.col-lg-2{-ms-flex:0 0 16.666667%;flex:0 0 16.666667%;max-width:16.666667%}.col-lg-3{-ms-flex:0 0 25%;flex:0 0 25%;max-width:25%}.col-lg-4{-ms-flex:0 0 33.333333%;flex:0 0 33.333333%;max-width:33.333333%}.col-lg-5{-ms-flex:0 0 41.666667%;flex:0 0 41.666667%;max-width:41.666667%}.col-lg-6{-ms-flex:0 0 50%;flex:0 0 50%;max-width:50%}.col-lg-7{-ms-flex:0 0 58.333333%;flex:0 0 58.333333%;max-width:58.333333%}.col-lg-8{-ms-flex:0 0 66.666667%;flex:0 0 66.666667%;max-width:66.666667%}.col-lg-9{-ms-flex:0 0 75%;flex:0 0 75%;max-width:75%}.col-lg-10{-ms-flex:0 0 83.333333%;flex:0 0 83.333333%;max-width:83.333333%}.col-lg-11{-ms-flex:0 0 91.666667%;flex:0 0 91.666667%;max-width:91.666667%}.col-lg-12{-ms-flex:0 0 100%;flex:0 0 100%;max-width:100%}.order-lg-first{-ms-flex-order:-1;order:-1}.order-lg-last{-ms-flex-order:13;order:13}.order-lg-0{-ms-flex-order:0;order:0}.order-lg-1{-ms-flex-order:1;order:1}.order-lg-2{-ms-flex-order:2;order:2}.order-lg-3{-ms-flex-order:3;order:3}.order-lg-4{-ms-flex-order:4;order:4}.order-lg-5{-ms-flex-order:5;order:5}.order-lg-6{-ms-flex-order:6;order:6}.order-lg-7{-ms-flex-order:7;order:7}.order-lg-8{-ms-flex-order:8;order:8}.order-lg-9{-ms-flex-order:9;order:9}.order-lg-10{-ms-flex-order:10;order:10}.order-lg-11{-ms-flex-order:11;order:11}.order-lg-12{-ms-flex-order:12;order:12}.offset-lg-0{margin-left:0}.offset-lg-1{margin-left:8.333333%}.offset-lg-2{margin-left:16.666667%}.offset-lg-3{margin-left:25%}.offset-lg-4{margin-left:33.333333%}.offset-lg-5{margin-left:41.666667%}.offset-lg-6{margin-left:50%}.offset-lg-7{margin-left:58.333333%}.offset-lg-8{margin-left:66.666667%}.offset-lg-9{margin-left:75%}.offset-lg-10{margin-left:83.333333%}.offset-lg-11{margin-left:91.666667%}}@media (min-width:1200px){.col-xl{-ms-flex-preferred-size:0;flex-basis:0;-ms-flex-positive:1;flex-grow:1;max-width:100%}.col-xl-auto{-ms-flex:0 0 auto;flex:0 0 auto;width:auto;max-width:100%}.col-xl-1{-ms-flex:0 0 8.333333%;flex:0 0 8.333333%;max-width:8.333333%}.col-xl-2{-ms-flex:0 0 16.666667%;flex:0 0 16.666667%;max-width:16.666667%}.col-xl-3{-ms-flex:0 0 25%;flex:0 0 25%;max-width:25%}.col-xl-4{-ms-flex:0 0 33.333333%;flex:0 0 33.333333%;max-width:33.333333%}.col-xl-5{-ms-flex:0 0 41.666667%;flex:0 0 41.666667%;max-width:41.666667%}.col-xl-6{-ms-flex:0 0 50%;flex:0 0 50%;max-width:50%}.col-xl-7{-ms-flex:0 0 58.333333%;flex:0 0 58.333333%;max-width:58.333333%}.col-xl-8{-ms-flex:0 0 66.666667%;flex:0 0 66.666667%;max-width:66.666667%}.col-xl-9{-ms-flex:0 0 75%;flex:0 0 75%;max-width:75%}.col-xl-10{-ms-flex:0 0 83.333333%;flex:0 0 83.333333%;max-width:83.333333%}.col-xl-11{-ms-flex:0 0 91.666667%;flex:0 0 91.666667%;max-width:91.666667%}.col-xl-12{-ms-flex:0 0 100%;flex:0 0 100%;max-width:100%}.order-xl-first{-ms-flex-order:-1;order:-1}.order-xl-last{-ms-flex-order:13;order:13}.order-xl-0{-ms-flex-order:0;order:0}.order-xl-1{-ms-flex-order:1;order:1}.order-xl-2{-ms-flex-order:2;order:2}.order-xl-3{-ms-flex-order:3;order:3}.order-xl-4{-ms-flex-order:4;order:4}.order-xl-5{-ms-flex-order:5;order:5}.order-xl-6{-ms-flex-order:6;order:6}.order-xl-7{-ms-flex-order:7;order:7}.order-xl-8{-ms-flex-order:8;order:8}.order-xl-9{-ms-flex-order:9;order:9}.order-xl-10{-ms-flex-order:10;order:10}.order-xl-11{-ms-flex-order:11;order:11}.order-xl-12{-ms-flex-order:12;order:12}.offset-xl-0{margin-left:0}.offset-xl-1{margin-left:8.333333%}.offset-xl-2{margin-left:16.666667%}.offset-xl-3{margin-left:25%}.offset-xl-4{margin-left:33.333333%}.offset-xl-5{margin-left:41.666667%}.offset-xl-6{margin-left:50%}.offset-xl-7{margin-left:58.333333%}.offset-xl-8{margin-left:66.666667%}.offset-xl-9{margin-left:75%}.offset-xl-10{margin-left:83.333333%}.offset-xl-11{margin-left:91.666667%}}.table{width:100%;margin-bottom:1rem;color:#212529}.table td,.table th{padding:.75rem;vertical-align:top;border-top:1px solid #dee2e6}.table thead th{vertical-align:bottom;border-bottom:2px solid #dee2e6}.table tbody+tbody{border-top:2px solid #dee2e6}.table-sm td,.table-sm th{padding:.3rem}.table-bordered{border:1px solid #dee2e6}.table-bordered td,.table-bordered th{border:1px solid #dee2e6}.table-bordered thead td,.table-bordered thead th{border-bottom-width:2px}.table-borderless tbody+tbody,.table-borderless td,.table-borderless th,.table-borderless thead th{border:0}.table-striped tbody tr:nth-of-type(odd){background-color:rgba(0,0,0,.05)}.table-hover tbody tr:hover{color:#212529;background-color:rgba(0,0,0,.075)}.table-primary,.table-primary>td,.table-primary>th{background-color:#b8daff}.table-primary tbody+tbody,.table-primary td,.table-primary th,.table-primary thead th{border-color:#7abaff}.table-hover .table-primary:hover{background-color:#9fcdff}.table-hover .table-primary:hover>td,.table-hover .table-primary:hover>th{background-color:#9fcdff}.table-secondary,.table-secondary>td,.table-secondary>th{background-color:#d6d8db}.table-secondary tbody+tbody,.table-secondary td,.table-secondary th,.table-secondary thead th{border-color:#b3b7bb}.table-hover .table-secondary:hover{background-color:#c8cbcf}.table-hover .table-secondary:hover>td,.table-hover .table-secondary:hover>th{background-color:#c8cbcf}.table-success,.table-success>td,.table-success>th{background-color:#c3e6cb}.table-success tbody+tbody,.table-success td,.table-success th,.table-success thead th{border-color:#8fd19e}.table-hover .table-success:hover{background-color:#b1dfbb}.table-hover .table-success:hover>td,.table-hover .table-success:hover>th{background-color:#b1dfbb}.table-info,.table-info>td,.table-info>th{background-color:#bee5eb}.table-info tbody+tbody,.table-info td,.table-info th,.table-info thead th{border-color:#86cfda}.table-hover .table-info:hover{background-color:#abdde5}.table-hover .table-info:hover>td,.table-hover .table-info:hover>th{background-color:#abdde5}.table-warning,.table-warning>td,.table-warning>th{background-color:#ffeeba}.table-warning tbody+tbody,.table-warning td,.table-warning th,.table-warning thead th{border-color:#ffdf7e}.table-hover .table-warning:hover{background-color:#ffe8a1}.table-hover .table-warning:hover>td,.table-hover .table-warning:hover>th{background-color:#ffe8a1}.table-danger,.table-danger>td,.table-danger>th{background-color:#f5c6cb}.table-danger tbody+tbody,.table-danger td,.table-danger th,.table-danger thead th{border-color:#ed969e}.table-hover .table-danger:hover{background-color:#f1b0b7}.table-hover .table-danger:hover>td,.table-hover .table-danger:hover>th{background-color:#f1b0b7}.table-light,.table-light>td,.table-light>th{background-color:#fdfdfe}.table-light tbody+tbody,.table-light td,.table-light th,.table-light thead th{border-color:#fbfcfc}.table-hover .table-light:hover{background-color:#ececf6}.table-hover .table-light:hover>td,.table-hover .table-light:hover>th{background-color:#ececf6}.table-dark,.table-dark>td,.table-dark>th{background-color:#c6c8ca}.table-dark tbody+tbody,.table-dark td,.table-dark th,.table-dark thead th{border-color:#95999c}.table-hover .table-dark:hover{background-color:#b9bbbe}.table-hover .table-dark:hover>td,.table-hover .table-dark:hover>th{background-color:#b9bbbe}.table-active,.table-active>td,.table-active>th{background-color:rgba(0,0,0,.075)}.table-hover .table-active:hover{background-color:rgba(0,0,0,.075)}.table-hover .table-active:hover>td,.table-hover .table-active:hover>th{background-color:rgba(0,0,0,.075)}.table .thead-dark th{color:#fff;background-color:#343a40;border-color:#454d55}.table .thead-light th{color:#495057;background-color:#e9ecef;border-color:#dee2e6}.table-dark{color:#fff;background-color:#343a40}.table-dark td,.table-dark th,.table-dark thead th{border-color:#454d55}.table-dark.table-bordered{border:0}.table-dark.table-striped tbody tr:nth-of-type(odd){background-color:rgba(255,255,255,.05)}.table-dark.table-hover tbody tr:hover{color:#fff;background-color:rgba(255,255,255,.075)}@media (max-width:575.98px){.table-responsive-sm{display:block;width:100%;overflow-x:auto;-webkit-overflow-scrolling:touch}.table-responsive-sm>.table-bordered{border:0}}@media (max-width:767.98px){.table-responsive-md{display:block;width:100%;overflow-x:auto;-webkit-overflow-scrolling:touch}.table-responsive-md>.table-bordered{border:0}}@media (max-width:991.98px){.table-responsive-lg{display:block;width:100%;overflow-x:auto;-webkit-overflow-scrolling:touch}.table-responsive-lg>.table-bordered{border:0}}@media (max-width:1199.98px){.table-responsive-xl{display:block;width:100%;overflow-x:auto;-webkit-overflow-scrolling:touch}.table-responsive-xl>.table-bordered{border:0}}.table-responsive{display:block;width:100%;overflow-x:auto;-webkit-overflow-scrolling:touch}.table-responsive>.table-bordered{border:0}.form-control{display:block;width:100%;height:calc(1.5em + .75rem + 2px);padding:.375rem .75rem;font-size:1rem;font-weight:400;line-height:1.5;color:#495057;background-color:#fff;background-clip:padding-box;border:1px solid #ced4da;border-radius:.25rem;transition:border-color .15s ease-in-out,box-shadow .15s ease-in-out}@media (prefers-reduced-motion:reduce){.form-control{transition:none}}.form-control::-ms-expand{background-color:transparent;border:0}.form-control:focus{color:#495057;background-color:#fff;border-color:#80bdff;outline:0;box-shadow:0 0 0 .2rem rgba(0,123,255,.25)}.form-control::-webkit-input-placeholder{color:#6c757d;opacity:1}.form-control::-moz-placeholder{color:#6c757d;opacity:1}.form-control:-ms-input-placeholder{color:#6c757d;opacity:1}.form-control::-ms-input-placeholder{color:#6c757d;opacity:1}.form-control::placeholder{color:#6c757d;opacity:1}.form-control:disabled,.form-control[readonly]{background-color:#e9ecef;opacity:1}select.form-control:focus::-ms-value{color:#495057;background-color:#fff}.form-control-file,.form-control-range{display:block;width:100%}.col-form-label{padding-top:calc(.375rem + 1px);padding-bottom:calc(.375rem + 1px);margin-bottom:0;font-size:inherit;line-height:1.5}.col-form-label-lg{padding-top:calc(.5rem + 1px);padding-bottom:calc(.5rem + 1px);font-size:1.25rem;line-height:1.5}.col-form-label-sm{padding-top:calc(.25rem + 1px);padding-bottom:calc(.25rem + 1px);font-size:.875rem;line-height:1.5}.form-control-plaintext{display:block;width:100%;padding-top:.375rem;padding-bottom:.375rem;margin-bottom:0;line-height:1.5;color:#212529;background-color:transparent;border:solid transparent;border-width:1px 0}.form-control-plaintext.form-control-lg,.form-control-plaintext.form-control-sm{padding-right:0;padding-left:0}.form-control-sm{height:calc(1.5em + .5rem + 2px);padding:.25rem .5rem;font-size:.875rem;line-height:1.5;border-radius:.2rem}.form-control-lg{height:calc(1.5em + 1rem + 2px);padding:.5rem 1rem;font-size:1.25rem;line-height:1.5;border-radius:.3rem}select.form-control[multiple],select.form-control[size]{height:auto}textarea.form-control{height:auto}.form-group{margin-bottom:1rem}.form-text{display:block;margin-top:.25rem}.form-row{display:-ms-flexbox;display:flex;-ms-flex-wrap:wrap;flex-wrap:wrap;margin-right:-5px;margin-left:-5px}.form-row>.col,.form-row>[class*=col-]{padding-right:5px;padding-left:5px}.form-check{position:relative;display:block;padding-left:1.25rem}.form-check-input{position:absolute;margin-top:.3rem;margin-left:-1.25rem}.form-check-input:disabled~.form-check-label{color:#6c757d}.form-check-label{margin-bottom:0}.form-check-inline{display:-ms-inline-flexbox;display:inline-flex;-ms-flex-align:center;align-items:center;padding-left:0;margin-right:.75rem}.form-check-inline .form-check-input{position:static;margin-top:0;margin-right:.3125rem;margin-left:0}.valid-feedback{display:none;width:100%;margin-top:.25rem;font-size:80%;color:#28a745}.valid-tooltip{position:absolute;top:100%;z-index:5;display:none;max-width:100%;padding:.25rem .5rem;margin-top:.1rem;font-size:.875rem;line-height:1.5;color:#fff;background-color:rgba(40,167,69,.9);border-radius:.25rem}.form-control.is-valid,.was-validated .form-control:valid{border-color:#28a745;padding-right:calc(1.5em + .75rem);background-image:url("data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 8 8'%3e%3cpath fill='%2328a745' d='M2.3 6.73L.6 4.53c-.4-1.04.46-1.4 1.1-.8l1.1 1.4 3.4-3.8c.6-.63 1.6-.27 1.2.7l-4 4.6c-.43.5-.8.4-1.1.1z'/%3e%3c/svg%3e");background-repeat:no-repeat;background-position:center right calc(.375em + .1875rem);background-size:calc(.75em + .375rem) calc(.75em + .375rem)}.form-control.is-valid:focus,.was-validated .form-control:valid:focus{border-color:#28a745;box-shadow:0 0 0 .2rem rgba(40,167,69,.25)}.form-control.is-valid~.valid-feedback,.form-control.is-valid~.valid-tooltip,.was-validated .form-control:valid~.valid-feedback,.was-validated .form-control:valid~.valid-tooltip{display:block}.was-validated textarea.form-control:valid,textarea.form-control.is-valid{padding-right:calc(1.5em + .75rem);background-position:top calc(.375em + .1875rem) right calc(.375em + .1875rem)}.custom-select.is-valid,.was-validated .custom-select:valid{border-color:#28a745;padding-right:calc((1em + .75rem) * 3 / 4 + 1.75rem);background:url("data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 4 5'%3e%3cpath fill='%23343a40' d='M2 0L0 2h4zm0 5L0 3h4z'/%3e%3c/svg%3e") no-repeat right .75rem center/8px 10px,url("data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 8 8'%3e%3cpath fill='%2328a745' d='M2.3 6.73L.6 4.53c-.4-1.04.46-1.4 1.1-.8l1.1 1.4 3.4-3.8c.6-.63 1.6-.27 1.2.7l-4 4.6c-.43.5-.8.4-1.1.1z'/%3e%3c/svg%3e") #fff no-repeat center right 1.75rem/calc(.75em + .375rem) calc(.75em + .375rem)}.custom-select.is-valid:focus,.was-validated .custom-select:valid:focus{border-color:#28a745;box-shadow:0 0 0 .2rem rgba(40,167,69,.25)}.custom-select.is-valid~.valid-feedback,.custom-select.is-valid~.valid-tooltip,.was-validated .custom-select:valid~.valid-feedback,.was-validated .custom-select:valid~.valid-tooltip{display:block}.form-control-file.is-valid~.valid-feedback,.form-control-file.is-valid~.valid-tooltip,.was-validated .form-control-file:valid~.valid-feedback,.was-validated .form-control-file:valid~.valid-tooltip{display:block}.form-check-input.is-valid~.form-check-label,.was-validated .form-check-input:valid~.form-check-label{color:#28a745}.form-check-input.is-valid~.valid-feedback,.form-check-input.is-valid~.valid-tooltip,.was-validated .form-check-input:valid~.valid-feedback,.was-validated .form-check-input:valid~.valid-tooltip{display:block}.custom-control-input.is-valid~.custom-control-label,.was-validated .custom-control-input:valid~.custom-control-label{color:#28a745}.custom-control-input.is-valid~.custom-control-label::before,.was-validated .custom-control-input:valid~.custom-control-label::before{border-color:#28a745}.custom-control-input.is-valid~.valid-feedback,.custom-control-input.is-valid~.valid-tooltip,.was-validated .custom-control-input:valid~.valid-feedback,.was-validated .custom-control-input:valid~.valid-tooltip{display:block}.custom-control-input.is-valid:checked~.custom-control-label::before,.was-validated .custom-control-input:valid:checked~.custom-control-label::before{border-color:#34ce57;background-color:#34ce57}.custom-control-input.is-valid:focus~.custom-control-label::before,.was-validated .custom-control-input:valid:focus~.custom-control-label::before{box-shadow:0 0 0 .2rem rgba(40,167,69,.25)}.custom-control-input.is-valid:focus:not(:checked)~.custom-control-label::before,.was-validated .custom-control-input:valid:focus:not(:checked)~.custom-control-label::before{border-color:#28a745}.custom-file-input.is-valid~.custom-file-label,.was-validated .custom-file-input:valid~.custom-file-label{border-color:#28a745}.custom-file-input.is-valid~.valid-feedback,.custom-file-input.is-valid~.valid-tooltip,.was-validated .custom-file-input:valid~.valid-feedback,.was-validated .custom-file-input:valid~.valid-tooltip{display:block}.custom-file-input.is-valid:focus~.custom-file-label,.was-validated .custom-file-input:valid:focus~.custom-file-label{border-color:#28a745;box-shadow:0 0 0 .2rem rgba(40,167,69,.25)}.invalid-feedback{display:none;width:100%;margin-top:.25rem;font-size:80%;color:#dc3545}.invalid-tooltip{position:absolute;top:100%;z-index:5;display:none;max-width:100%;padding:.25rem .5rem;margin-top:.1rem;font-size:.875rem;line-height:1.5;color:#fff;background-color:rgba(220,53,69,.9);border-radius:.25rem}.form-control.is-invalid,.was-validated .form-control:invalid{border-color:#dc3545;padding-right:calc(1.5em + .75rem);background-image:url("data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' fill='%23dc3545' viewBox='-2 -2 7 7'%3e%3cpath stroke='%23dc3545' d='M0 0l3 3m0-3L0 3'/%3e%3ccircle r='.5'/%3e%3ccircle cx='3' r='.5'/%3e%3ccircle cy='3' r='.5'/%3e%3ccircle cx='3' cy='3' r='.5'/%3e%3c/svg%3E");background-repeat:no-repeat;background-position:center right calc(.375em + .1875rem);background-size:calc(.75em + .375rem) calc(.75em + .375rem)}.form-control.is-invalid:focus,.was-validated .form-control:invalid:focus{border-color:#dc3545;box-shadow:0 0 0 .2rem rgba(220,53,69,.25)}.form-control.is-invalid~.invalid-feedback,.form-control.is-invalid~.invalid-tooltip,.was-validated .form-control:invalid~.invalid-feedback,.was-validated .form-control:invalid~.invalid-tooltip{display:block}.was-validated textarea.form-control:invalid,textarea.form-control.is-invalid{padding-right:calc(1.5em + .75rem);background-position:top calc(.375em + .1875rem) right calc(.375em + .1875rem)}.custom-select.is-invalid,.was-validated .custom-select:invalid{border-color:#dc3545;padding-right:calc((1em + .75rem) * 3 / 4 + 1.75rem);background:url("data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 4 5'%3e%3cpath fill='%23343a40' d='M2 0L0 2h4zm0 5L0 3h4z'/%3e%3c/svg%3e") no-repeat right .75rem center/8px 10px,url("data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' fill='%23dc3545' viewBox='-2 -2 7 7'%3e%3cpath stroke='%23dc3545' d='M0 0l3 3m0-3L0 3'/%3e%3ccircle r='.5'/%3e%3ccircle cx='3' r='.5'/%3e%3ccircle cy='3' r='.5'/%3e%3ccircle cx='3' cy='3' r='.5'/%3e%3c/svg%3E") #fff no-repeat center right 1.75rem/calc(.75em + .375rem) calc(.75em + .375rem)}.custom-select.is-invalid:focus,.was-validated .custom-select:invalid:focus{border-color:#dc3545;box-shadow:0 0 0 .2rem rgba(220,53,69,.25)}.custom-select.is-invalid~.invalid-feedback,.custom-select.is-invalid~.invalid-tooltip,.was-validated .custom-select:invalid~.invalid-feedback,.was-validated .custom-select:invalid~.invalid-tooltip{display:block}.form-control-file.is-invalid~.invalid-feedback,.form-control-file.is-invalid~.invalid-tooltip,.was-validated .form-control-file:invalid~.invalid-feedback,.was-validated .form-control-file:invalid~.invalid-tooltip{display:block}.form-check-input.is-invalid~.form-check-label,.was-validated .form-check-input:invalid~.form-check-label{color:#dc3545}.form-check-input.is-invalid~.invalid-feedback,.form-check-input.is-invalid~.invalid-tooltip,.was-validated .form-check-input:invalid~.invalid-feedback,.was-validated .form-check-input:invalid~.invalid-tooltip{display:block}.custom-control-input.is-invalid~.custom-control-label,.was-validated .custom-control-input:invalid~.custom-control-label{color:#dc3545}.custom-control-input.is-invalid~.custom-control-label::before,.was-validated .custom-control-input:invalid~.custom-control-label::before{border-color:#dc3545}.custom-control-input.is-invalid~.invalid-feedback,.custom-control-input.is-invalid~.invalid-tooltip,.was-validated .custom-control-input:invalid~.invalid-feedback,.was-validated .custom-control-input:invalid~.invalid-tooltip{display:block}.custom-control-input.is-invalid:checked~.custom-control-label::before,.was-validated .custom-control-input:invalid:checked~.custom-control-label::before{border-color:#e4606d;background-color:#e4606d}.custom-control-input.is-invalid:focus~.custom-control-label::before,.was-validated .custom-control-input:invalid:focus~.custom-control-label::before{box-shadow:0 0 0 .2rem rgba(220,53,69,.25)}.custom-control-input.is-invalid:focus:not(:checked)~.custom-control-label::before,.was-validated .custom-control-input:invalid:focus:not(:checked)~.custom-control-label::before{border-color:#dc3545}.custom-file-input.is-invalid~.custom-file-label,.was-validated .custom-file-input:invalid~.custom-file-label{border-color:#dc3545}.custom-file-input.is-invalid~.invalid-feedback,.custom-file-input.is-invalid~.invalid-tooltip,.was-validated .custom-file-input:invalid~.invalid-feedback,.was-validated .custom-file-input:invalid~.invalid-tooltip{display:block}.custom-file-input.is-invalid:focus~.custom-file-label,.was-validated .custom-file-input:invalid:focus~.custom-file-label{border-color:#dc3545;box-shadow:0 0 0 .2rem rgba(220,53,69,.25)}.form-inline{display:-ms-flexbox;display:flex;-ms-flex-flow:row wrap;flex-flow:row wrap;-ms-flex-align:center;align-items:center}.form-inline .form-check{width:100%}@media (min-width:576px){.form-inline label{display:-ms-flexbox;display:flex;-ms-flex-align:center;align-items:center;-ms-flex-pack:center;justify-content:center;margin-bottom:0}.form-inline .form-group{display:-ms-flexbox;display:flex;-ms-flex:0 0 auto;flex:0 0 auto;-ms-flex-flow:row wrap;flex-flow:row wrap;-ms-flex-align:center;align-items:center;margin-bottom:0}.form-inline .form-control{display:inline-block;width:auto;vertical-align:middle}.form-inline .form-control-plaintext{display:inline-block}.form-inline .custom-select,.form-inline .input-group{width:auto}.form-inline .form-check{display:-ms-flexbox;display:flex;-ms-flex-align:center;align-items:center;-ms-flex-pack:center;justify-content:center;width:auto;padding-left:0}.form-inline .form-check-input{position:relative;-ms-flex-negative:0;flex-shrink:0;margin-top:0;margin-right:.25rem;margin-left:0}.form-inline .custom-control{-ms-flex-align:center;align-items:center;-ms-flex-pack:center;justify-content:center}.form-inline .custom-control-label{margin-bottom:0}}.btn{display:inline-block;font-weight:400;color:#212529;text-align:center;vertical-align:middle;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;background-color:transparent;border:1px solid transparent;padding:.375rem .75rem;font-size:1rem;line-height:1.5;border-radius:.25rem;transition:color .15s ease-in-out,background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out}@media (prefers-reduced-motion:reduce){.btn{transition:none}}.btn:hover{color:#212529;text-decoration:none}.btn.focus,.btn:focus{outline:0;box-shadow:0 0 0 .2rem rgba(0,123,255,.25)}.btn.disabled,.btn:disabled{opacity:.65}a.btn.disabled,fieldset:disabled a.btn{pointer-events:none}.btn-primary{color:#fff;background-color:#007bff;border-color:#007bff}.btn-primary:hover{color:#fff;background-color:#0069d9;border-color:#0062cc}.btn-primary.focus,.btn-primary:focus{box-shadow:0 0 0 .2rem rgba(38,143,255,.5)}.btn-primary.disabled,.btn-primary:disabled{color:#fff;background-color:#007bff;border-color:#007bff}.btn-primary:not(:disabled):not(.disabled).active,.btn-primary:not(:disabled):not(.disabled):active,.show>.btn-primary.dropdown-toggle{color:#fff;background-color:#0062cc;border-color:#005cbf}.btn-primary:not(:disabled):not(.disabled).active:focus,.btn-primary:not(:disabled):not(.disabled):active:focus,.show>.btn-primary.dropdown-toggle:focus{box-shadow:0 0 0 .2rem rgba(38,143,255,.5)}.btn-secondary{color:#fff;background-color:#6c757d;border-color:#6c757d}.btn-secondary:hover{color:#fff;background-color:#5a6268;border-color:#545b62}.btn-secondary.focus,.btn-secondary:focus{box-shadow:0 0 0 .2rem rgba(130,138,145,.5)}.btn-secondary.disabled,.btn-secondary:disabled{color:#fff;background-color:#6c757d;border-color:#6c757d}.btn-secondary:not(:disabled):not(.disabled).active,.btn-secondary:not(:disabled):not(.disabled):active,.show>.btn-secondary.dropdown-toggle{color:#fff;background-color:#545b62;border-color:#4e555b}.btn-secondary:not(:disabled):not(.disabled).active:focus,.btn-secondary:not(:disabled):not(.disabled):active:focus,.show>.btn-secondary.dropdown-toggle:focus{box-shadow:0 0 0 .2rem rgba(130,138,145,.5)}.btn-success{color:#fff;background-color:#28a745;border-color:#28a745}.btn-success:hover{color:#fff;background-color:#218838;border-color:#1e7e34}.btn-success.focus,.btn-success:focus{box-shadow:0 0 0 .2rem rgba(72,180,97,.5)}.btn-success.disabled,.btn-success:disabled{color:#fff;background-color:#28a745;border-color:#28a745}.btn-success:not(:disabled):not(.disabled).active,.btn-success:not(:disabled):not(.disabled):active,.show>.btn-success.dropdown-toggle{color:#fff;background-color:#1e7e34;border-color:#1c7430}.btn-success:not(:disabled):not(.disabled).active:focus,.btn-success:not(:disabled):not(.disabled):active:focus,.show>.btn-success.dropdown-toggle:focus{box-shadow:0 0 0 .2rem rgba(72,180,97,.5)}.btn-info{color:#fff;background-color:#17a2b8;border-color:#17a2b8}.btn-info:hover{color:#fff;background-color:#138496;border-color:#117a8b}.btn-info.focus,.btn-info:focus{box-shadow:0 0 0 .2rem rgba(58,176,195,.5)}.btn-info.disabled,.btn-info:disabled{color:#fff;background-color:#17a2b8;border-color:#17a2b8}.btn-info:not(:disabled):not(.disabled).active,.btn-info:not(:disabled):not(.disabled):active,.show>.btn-info.dropdown-toggle{color:#fff;background-color:#117a8b;border-color:#10707f}.btn-info:not(:disabled):not(.disabled).active:focus,.btn-info:not(:disabled):not(.disabled):active:focus,.show>.btn-info.dropdown-toggle:focus{box-shadow:0 0 0 .2rem rgba(58,176,195,.5)}.btn-warning{color:#212529;background-color:#ffc107;border-color:#ffc107}.btn-warning:hover{color:#212529;background-color:#e0a800;border-color:#d39e00}.btn-warning.focus,.btn-warning:focus{box-shadow:0 0 0 .2rem rgba(222,170,12,.5)}.btn-warning.disabled,.btn-warning:disabled{color:#212529;background-color:#ffc107;border-color:#ffc107}.btn-warning:not(:disabled):not(.disabled).active,.btn-warning:not(:disabled):not(.disabled):active,.show>.btn-warning.dropdown-toggle{color:#212529;background-color:#d39e00;border-color:#c69500}.btn-warning:not(:disabled):not(.disabled).active:focus,.btn-warning:not(:disabled):not(.disabled):active:focus,.show>.btn-warning.dropdown-toggle:focus{box-shadow:0 0 0 .2rem rgba(222,170,12,.5)}.btn-danger{color:#fff;background-color:#dc3545;border-color:#dc3545}.btn-danger:hover{color:#fff;background-color:#c82333;border-color:#bd2130}.btn-danger.focus,.btn-danger:focus{box-shadow:0 0 0 .2rem rgba(225,83,97,.5)}.btn-danger.disabled,.btn-danger:disabled{color:#fff;background-color:#dc3545;border-color:#dc3545}.btn-danger:not(:disabled):not(.disabled).active,.btn-danger:not(:disabled):not(.disabled):active,.show>.btn-danger.dropdown-toggle{color:#fff;background-color:#bd2130;border-color:#b21f2d}.btn-danger:not(:disabled):not(.disabled).active:focus,.btn-danger:not(:disabled):not(.disabled):active:focus,.show>.btn-danger.dropdown-toggle:focus{box-shadow:0 0 0 .2rem rgba(225,83,97,.5)}.btn-light{color:#212529;background-color:#f8f9fa;border-color:#f8f9fa}.btn-light:hover{color:#212529;background-color:#e2e6ea;border-color:#dae0e5}.btn-light.focus,.btn-light:focus{box-shadow:0 0 0 .2rem rgba(216,217,219,.5)}.btn-light.disabled,.btn-light:disabled{color:#212529;background-color:#f8f9fa;border-color:#f8f9fa}.btn-light:not(:disabled):not(.disabled).active,.btn-light:not(:disabled):not(.disabled):active,.show>.btn-light.dropdown-toggle{color:#212529;background-color:#dae0e5;border-color:#d3d9df}.btn-light:not(:disabled):not(.disabled).active:focus,.btn-light:not(:disabled):not(.disabled):active:focus,.show>.btn-light.dropdown-toggle:focus{box-shadow:0 0 0 .2rem rgba(216,217,219,.5)}.btn-dark{color:#fff;background-color:#343a40;border-color:#343a40}.btn-dark:hover{color:#fff;background-color:#23272b;border-color:#1d2124}.btn-dark.focus,.btn-dark:focus{box-shadow:0 0 0 .2rem rgba(82,88,93,.5)}.btn-dark.disabled,.btn-dark:disabled{color:#fff;background-color:#343a40;border-color:#343a40}.btn-dark:not(:disabled):not(.disabled).active,.btn-dark:not(:disabled):not(.disabled):active,.show>.btn-dark.dropdown-toggle{color:#fff;background-color:#1d2124;border-color:#171a1d}.btn-dark:not(:disabled):not(.disabled).active:focus,.btn-dark:not(:disabled):not(.disabled):active:focus,.show>.btn-dark.dropdown-toggle:focus{box-shadow:0 0 0 .2rem rgba(82,88,93,.5)}.btn-outline-primary{color:#007bff;border-color:#007bff}.btn-outline-primary:hover{color:#fff;background-color:#007bff;border-color:#007bff}.btn-outline-primary.focus,.btn-outline-primary:focus{box-shadow:0 0 0 .2rem rgba(0,123,255,.5)}.btn-outline-primary.disabled,.btn-outline-primary:disabled{color:#007bff;background-color:transparent}.btn-outline-primary:not(:disabled):not(.disabled).active,.btn-outline-primary:not(:disabled):not(.disabled):active,.show>.btn-outline-primary.dropdown-toggle{color:#fff;background-color:#007bff;border-color:#007bff}.btn-outline-primary:not(:disabled):not(.disabled).active:focus,.btn-outline-primary:not(:disabled):not(.disabled):active:focus,.show>.btn-outline-primary.dropdown-toggle:focus{box-shadow:0 0 0 .2rem rgba(0,123,255,.5)}.btn-outline-secondary{color:#6c757d;border-color:#6c757d}.btn-outline-secondary:hover{color:#fff;background-color:#6c757d;border-color:#6c757d}.btn-outline-secondary.focus,.btn-outline-secondary:focus{box-shadow:0 0 0 .2rem rgba(108,117,125,.5)}.btn-outline-secondary.disabled,.btn-outline-secondary:disabled{color:#6c757d;background-color:transparent}.btn-outline-secondary:not(:disabled):not(.disabled).active,.btn-outline-secondary:not(:disabled):not(.disabled):active,.show>.btn-outline-secondary.dropdown-toggle{color:#fff;background-color:#6c757d;border-color:#6c757d}.btn-outline-secondary:not(:disabled):not(.disabled).active:focus,.btn-outline-secondary:not(:disabled):not(.disabled):active:focus,.show>.btn-outline-secondary.dropdown-toggle:focus{box-shadow:0 0 0 .2rem rgba(108,117,125,.5)}.btn-outline-success{color:#28a745;border-color:#28a745}.btn-outline-success:hover{color:#fff;background-color:#28a745;border-color:#28a745}.btn-outline-success.focus,.btn-outline-success:focus{box-shadow:0 0 0 .2rem rgba(40,167,69,.5)}.btn-outline-success.disabled,.btn-outline-success:disabled{color:#28a745;background-color:transparent}.btn-outline-success:not(:disabled):not(.disabled).active,.btn-outline-success:not(:disabled):not(.disabled):active,.show>.btn-outline-success.dropdown-toggle{color:#fff;background-color:#28a745;border-color:#28a745}.btn-outline-success:not(:disabled):not(.disabled).active:focus,.btn-outline-success:not(:disabled):not(.disabled):active:focus,.show>.btn-outline-success.dropdown-toggle:focus{box-shadow:0 0 0 .2rem rgba(40,167,69,.5)}.btn-outline-info{color:#17a2b8;border-color:#17a2b8}.btn-outline-info:hover{color:#fff;background-color:#17a2b8;border-color:#17a2b8}.btn-outline-info.focus,.btn-outline-info:focus{box-shadow:0 0 0 .2rem rgba(23,162,184,.5)}.btn-outline-info.disabled,.btn-outline-info:disabled{color:#17a2b8;background-color:transparent}.btn-outline-info:not(:disabled):not(.disabled).active,.btn-outline-info:not(:disabled):not(.disabled):active,.show>.btn-outline-info.dropdown-toggle{color:#fff;background-color:#17a2b8;border-color:#17a2b8}.btn-outline-info:not(:disabled):not(.disabled).active:focus,.btn-outline-info:not(:disabled):not(.disabled):active:focus,.show>.btn-outline-info.dropdown-toggle:focus{box-shadow:0 0 0 .2rem rgba(23,162,184,.5)}.btn-outline-warning{color:#ffc107;border-color:#ffc107}.btn-outline-warning:hover{color:#212529;background-color:#ffc107;border-color:#ffc107}.btn-outline-warning.focus,.btn-outline-warning:focus{box-shadow:0 0 0 .2rem rgba(255,193,7,.5)}.btn-outline-warning.disabled,.btn-outline-warning:disabled{color:#ffc107;background-color:transparent}.btn-outline-warning:not(:disabled):not(.disabled).active,.btn-outline-warning:not(:disabled):not(.disabled):active,.show>.btn-outline-warning.dropdown-toggle{color:#212529;background-color:#ffc107;border-color:#ffc107}.btn-outline-warning:not(:disabled):not(.disabled).active:focus,.btn-outline-warning:not(:disabled):not(.disabled):active:focus,.show>.btn-outline-warning.dropdown-toggle:focus{box-shadow:0 0 0 .2rem rgba(255,193,7,.5)}.btn-outline-danger{color:#dc3545;border-color:#dc3545}.btn-outline-danger:hover{color:#fff;background-color:#dc3545;border-color:#dc3545}.btn-outline-danger.focus,.btn-outline-danger:focus{box-shadow:0 0 0 .2rem rgba(220,53,69,.5)}.btn-outline-danger.disabled,.btn-outline-danger:disabled{color:#dc3545;background-color:transparent}.btn-outline-danger:not(:disabled):not(.disabled).active,.btn-outline-danger:not(:disabled):not(.disabled):active,.show>.btn-outline-danger.dropdown-toggle{color:#fff;background-color:#dc3545;border-color:#dc3545}.btn-outline-danger:not(:disabled):not(.disabled).active:focus,.btn-outline-danger:not(:disabled):not(.disabled):active:focus,.show>.btn-outline-danger.dropdown-toggle:focus{box-shadow:0 0 0 .2rem rgba(220,53,69,.5)}.btn-outline-light{color:#f8f9fa;border-color:#f8f9fa}.btn-outline-light:hover{color:#212529;background-color:#f8f9fa;border-color:#f8f9fa}.btn-outline-light.focus,.btn-outline-light:focus{box-shadow:0 0 0 .2rem rgba(248,249,250,.5)}.btn-outline-light.disabled,.btn-outline-light:disabled{color:#f8f9fa;background-color:transparent}.btn-outline-light:not(:disabled):not(.disabled).active,.btn-outline-light:not(:disabled):not(.disabled):active,.show>.btn-outline-light.dropdown-toggle{color:#212529;background-color:#f8f9fa;border-color:#f8f9fa}.btn-outline-light:not(:disabled):not(.disabled).active:focus,.btn-outline-light:not(:disabled):not(.disabled):active:focus,.show>.btn-outline-light.dropdown-toggle:focus{box-shadow:0 0 0 .2rem rgba(248,249,250,.5)}.btn-outline-dark{color:#343a40;border-color:#343a40}.btn-outline-dark:hover{color:#fff;background-color:#343a40;border-color:#343a40}.btn-outline-dark.focus,.btn-outline-dark:focus{box-shadow:0 0 0 .2rem rgba(52,58,64,.5)}.btn-outline-dark.disabled,.btn-outline-dark:disabled{color:#343a40;background-color:transparent}.btn-outline-dark:not(:disabled):not(.disabled).active,.btn-outline-dark:not(:disabled):not(.disabled):active,.show>.btn-outline-dark.dropdown-toggle{color:#fff;background-color:#343a40;border-color:#343a40}.btn-outline-dark:not(:disabled):not(.disabled).active:focus,.btn-outline-dark:not(:disabled):not(.disabled):active:focus,.show>.btn-outline-dark.dropdown-toggle:focus{box-shadow:0 0 0 .2rem rgba(52,58,64,.5)}.btn-link{font-weight:400;color:#007bff;text-decoration:none}.btn-link:hover{color:#0056b3;text-decoration:underline}.btn-link.focus,.btn-link:focus{text-decoration:underline;box-shadow:none}.btn-link.disabled,.btn-link:disabled{color:#6c757d;pointer-events:none}.btn-group-lg>.btn,.btn-lg{padding:.5rem 1rem;font-size:1.25rem;line-height:1.5;border-radius:.3rem}.btn-group-sm>.btn,.btn-sm{padding:.25rem .5rem;font-size:.875rem;line-height:1.5;border-radius:.2rem}.btn-block{display:block;width:100%}.btn-block+.btn-block{margin-top:.5rem}input[type=button].btn-block,input[type=reset].btn-block,input[type=submit].btn-block{width:100%}.fade{transition:opacity .15s linear}@media (prefers-reduced-motion:reduce){.fade{transition:none}}.fade:not(.show){opacity:0}.collapse:not(.show){display:none}.collapsing{position:relative;height:0;overflow:hidden;transition:height .35s ease}@media (prefers-reduced-motion:reduce){.collapsing{transition:none}}.dropdown,.dropleft,.dropright,.dropup{position:relative}.dropdown-toggle{white-space:nowrap}.dropdown-toggle::after{display:inline-block;margin-left:.255em;vertical-align:.255em;content:"";border-top:.3em solid;border-right:.3em solid transparent;border-bottom:0;border-left:.3em solid transparent}.dropdown-toggle:empty::after{margin-left:0}.dropdown-menu{position:absolute;top:100%;left:0;z-index:1000;display:none;float:left;min-width:10rem;padding:.5rem 0;margin:.125rem 0 0;font-size:1rem;color:#212529;text-align:left;list-style:none;background-color:#fff;background-clip:padding-box;border:1px solid rgba(0,0,0,.15);border-radius:.25rem}.dropdown-menu-left{right:auto;left:0}.dropdown-menu-right{right:0;left:auto}@media (min-width:576px){.dropdown-menu-sm-left{right:auto;left:0}.dropdown-menu-sm-right{right:0;left:auto}}@media (min-width:768px){.dropdown-menu-md-left{right:auto;left:0}.dropdown-menu-md-right{right:0;left:auto}}@media (min-width:992px){.dropdown-menu-lg-left{right:auto;left:0}.dropdown-menu-lg-right{right:0;left:auto}}@media (min-width:1200px){.dropdown-menu-xl-left{right:auto;left:0}.dropdown-menu-xl-right{right:0;left:auto}}.dropup .dropdown-menu{top:auto;bottom:100%;margin-top:0;margin-bottom:.125rem}.dropup .dropdown-toggle::after{display:inline-block;margin-left:.255em;vertical-align:.255em;content:"";border-top:0;border-right:.3em solid transparent;border-bottom:.3em solid;border-left:.3em solid transparent}.dropup .dropdown-toggle:empty::after{margin-left:0}.dropright .dropdown-menu{top:0;right:auto;left:100%;margin-top:0;margin-left:.125rem}.dropright .dropdown-toggle::after{display:inline-block;margin-left:.255em;vertical-align:.255em;content:"";border-top:.3em solid transparent;border-right:0;border-bottom:.3em solid transparent;border-left:.3em solid}.dropright .dropdown-toggle:empty::after{margin-left:0}.dropright .dropdown-toggle::after{vertical-align:0}.dropleft .dropdown-menu{top:0;right:100%;left:auto;margin-top:0;margin-right:.125rem}.dropleft .dropdown-toggle::after{display:inline-block;margin-left:.255em;vertical-align:.255em;content:""}.dropleft .dropdown-toggle::after{display:none}.dropleft .dropdown-toggle::before{display:inline-block;margin-right:.255em;vertical-align:.255em;content:"";border-top:.3em solid transparent;border-right:.3em solid;border-bottom:.3em solid transparent}.dropleft .dropdown-toggle:empty::after{margin-left:0}.dropleft .dropdown-toggle::before{vertical-align:0}.dropdown-menu[x-placement^=bottom],.dropdown-menu[x-placement^=left],.dropdown-menu[x-placement^=right],.dropdown-menu[x-placement^=top]{right:auto;bottom:auto}.dropdown-divider{height:0;margin:.5rem 0;overflow:hidden;border-top:1px solid #e9ecef}.dropdown-item{display:block;width:100%;padding:.25rem 1.5rem;clear:both;font-weight:400;color:#212529;text-align:inherit;white-space:nowrap;background-color:transparent;border:0}.dropdown-item:focus,.dropdown-item:hover{color:#16181b;text-decoration:none;background-color:#f8f9fa}.dropdown-item.active,.dropdown-item:active{color:#fff;text-decoration:none;background-color:#007bff}.dropdown-item.disabled,.dropdown-item:disabled{color:#6c757d;pointer-events:none;background-color:transparent}.dropdown-menu.show{display:block}.dropdown-header{display:block;padding:.5rem 1.5rem;margin-bottom:0;font-size:.875rem;color:#6c757d;white-space:nowrap}.dropdown-item-text{display:block;padding:.25rem 1.5rem;color:#212529}.btn-group,.btn-group-vertical{position:relative;display:-ms-inline-flexbox;display:inline-flex;vertical-align:middle}.btn-group-vertical>.btn,.btn-group>.btn{position:relative;-ms-flex:1 1 auto;flex:1 1 auto}.btn-group-vertical>.btn:hover,.btn-group>.btn:hover{z-index:1}.btn-group-vertical>.btn.active,.btn-group-vertical>.btn:active,.btn-group-vertical>.btn:focus,.btn-group>.btn.active,.btn-group>.btn:active,.btn-group>.btn:focus{z-index:1}.btn-toolbar{display:-ms-flexbox;display:flex;-ms-flex-wrap:wrap;flex-wrap:wrap;-ms-flex-pack:start;justify-content:flex-start}.btn-toolbar .input-group{width:auto}.btn-group>.btn-group:not(:first-child),.btn-group>.btn:not(:first-child){margin-left:-1px}.btn-group>.btn-group:not(:last-child)>.btn,.btn-group>.btn:not(:last-child):not(.dropdown-toggle){border-top-right-radius:0;border-bottom-right-radius:0}.btn-group>.btn-group:not(:first-child)>.btn,.btn-group>.btn:not(:first-child){border-top-left-radius:0;border-bottom-left-radius:0}.dropdown-toggle-split{padding-right:.5625rem;padding-left:.5625rem}.dropdown-toggle-split::after,.dropright .dropdown-toggle-split::after,.dropup .dropdown-toggle-split::after{margin-left:0}.dropleft .dropdown-toggle-split::before{margin-right:0}.btn-group-sm>.btn+.dropdown-toggle-split,.btn-sm+.dropdown-toggle-split{padding-right:.375rem;padding-left:.375rem}.btn-group-lg>.btn+.dropdown-toggle-split,.btn-lg+.dropdown-toggle-split{padding-right:.75rem;padding-left:.75rem}.btn-group-vertical{-ms-flex-direction:column;flex-direction:column;-ms-flex-align:start;align-items:flex-start;-ms-flex-pack:center;justify-content:center}.btn-group-vertical>.btn,.btn-group-vertical>.btn-group{width:100%}.btn-group-vertical>.btn-group:not(:first-child),.btn-group-vertical>.btn:not(:first-child){margin-top:-1px}.btn-group-vertical>.btn-group:not(:last-child)>.btn,.btn-group-vertical>.btn:not(:last-child):not(.dropdown-toggle){border-bottom-right-radius:0;border-bottom-left-radius:0}.btn-group-vertical>.btn-group:not(:first-child)>.btn,.btn-group-vertical>.btn:not(:first-child){border-top-left-radius:0;border-top-right-radius:0}.btn-group-toggle>.btn,.btn-group-toggle>.btn-group>.btn{margin-bottom:0}.btn-group-toggle>.btn input[type=checkbox],.btn-group-toggle>.btn input[type=radio],.btn-group-toggle>.btn-group>.btn input[type=checkbox],.btn-group-toggle>.btn-group>.btn input[type=radio]{position:absolute;clip:rect(0,0,0,0);pointer-events:none}.input-group{position:relative;display:-ms-flexbox;display:flex;-ms-flex-wrap:wrap;flex-wrap:wrap;-ms-flex-align:stretch;align-items:stretch;width:100%}.input-group>.custom-file,.input-group>.custom-select,.input-group>.form-control,.input-group>.form-control-plaintext{position:relative;-ms-flex:1 1 auto;flex:1 1 auto;width:1%;margin-bottom:0}.input-group>.custom-file+.custom-file,.input-group>.custom-file+.custom-select,.input-group>.custom-file+.form-control,.input-group>.custom-select+.custom-file,.input-group>.custom-select+.custom-select,.input-group>.custom-select+.form-control,.input-group>.form-control+.custom-file,.input-group>.form-control+.custom-select,.input-group>.form-control+.form-control,.input-group>.form-control-plaintext+.custom-file,.input-group>.form-control-plaintext+.custom-select,.input-group>.form-control-plaintext+.form-control{margin-left:-1px}.input-group>.custom-file .custom-file-input:focus~.custom-file-label,.input-group>.custom-select:focus,.input-group>.form-control:focus{z-index:3}.input-group>.custom-file .custom-file-input:focus{z-index:4}.input-group>.custom-select:not(:last-child),.input-group>.form-control:not(:last-child){border-top-right-radius:0;border-bottom-right-radius:0}.input-group>.custom-select:not(:first-child),.input-group>.form-control:not(:first-child){border-top-left-radius:0;border-bottom-left-radius:0}.input-group>.custom-file{display:-ms-flexbox;display:flex;-ms-flex-align:center;align-items:center}.input-group>.custom-file:not(:last-child) .custom-file-label,.input-group>.custom-file:not(:last-child) .custom-file-label::after{border-top-right-radius:0;border-bottom-right-radius:0}.input-group>.custom-file:not(:first-child) .custom-file-label{border-top-left-radius:0;border-bottom-left-radius:0}.input-group-append,.input-group-prepend{display:-ms-flexbox;display:flex}.input-group-append .btn,.input-group-prepend .btn{position:relative;z-index:2}.input-group-append .btn:focus,.input-group-prepend .btn:focus{z-index:3}.input-group-append .btn+.btn,.input-group-append .btn+.input-group-text,.input-group-append .input-group-text+.btn,.input-group-append .input-group-text+.input-group-text,.input-group-prepend .btn+.btn,.input-group-prepend .btn+.input-group-text,.input-group-prepend .input-group-text+.btn,.input-group-prepend .input-group-text+.input-group-text{margin-left:-1px}.input-group-prepend{margin-right:-1px}.input-group-append{margin-left:-1px}.input-group-text{display:-ms-flexbox;display:flex;-ms-flex-align:center;align-items:center;padding:.375rem .75rem;margin-bottom:0;font-size:1rem;font-weight:400;line-height:1.5;color:#495057;text-align:center;white-space:nowrap;background-color:#e9ecef;border:1px solid #ced4da;border-radius:.25rem}.input-group-text input[type=checkbox],.input-group-text input[type=radio]{margin-top:0}.input-group-lg>.custom-select,.input-group-lg>.form-control:not(textarea){height:calc(1.5em + 1rem + 2px)}.input-group-lg>.custom-select,.input-group-lg>.form-control,.input-group-lg>.input-group-append>.btn,.input-group-lg>.input-group-append>.input-group-text,.input-group-lg>.input-group-prepend>.btn,.input-group-lg>.input-group-prepend>.input-group-text{padding:.5rem 1rem;font-size:1.25rem;line-height:1.5;border-radius:.3rem}.input-group-sm>.custom-select,.input-group-sm>.form-control:not(textarea){height:calc(1.5em + .5rem + 2px)}.input-group-sm>.custom-select,.input-group-sm>.form-control,.input-group-sm>.input-group-append>.btn,.input-group-sm>.input-group-append>.input-group-text,.input-group-sm>.input-group-prepend>.btn,.input-group-sm>.input-group-prepend>.input-group-text{padding:.25rem .5rem;font-size:.875rem;line-height:1.5;border-radius:.2rem}.input-group-lg>.custom-select,.input-group-sm>.custom-select{padding-right:1.75rem}.input-group>.input-group-append:last-child>.btn:not(:last-child):not(.dropdown-toggle),.input-group>.input-group-append:last-child>.input-group-text:not(:last-child),.input-group>.input-group-append:not(:last-child)>.btn,.input-group>.input-group-append:not(:last-child)>.input-group-text,.input-group>.input-group-prepend>.btn,.input-group>.input-group-prepend>.input-group-text{border-top-right-radius:0;border-bottom-right-radius:0}.input-group>.input-group-append>.btn,.input-group>.input-group-append>.input-group-text,.input-group>.input-group-prepend:first-child>.btn:not(:first-child),.input-group>.input-group-prepend:first-child>.input-group-text:not(:first-child),.input-group>.input-group-prepend:not(:first-child)>.btn,.input-group>.input-group-prepend:not(:first-child)>.input-group-text{border-top-left-radius:0;border-bottom-left-radius:0}.custom-control{position:relative;display:block;min-height:1.5rem;padding-left:1.5rem}.custom-control-inline{display:-ms-inline-flexbox;display:inline-flex;margin-right:1rem}.custom-control-input{position:absolute;z-index:-1;opacity:0}.custom-control-input:checked~.custom-control-label::before{color:#fff;border-color:#007bff;background-color:#007bff}.custom-control-input:focus~.custom-control-label::before{box-shadow:0 0 0 .2rem rgba(0,123,255,.25)}.custom-control-input:focus:not(:checked)~.custom-control-label::before{border-color:#80bdff}.custom-control-input:not(:disabled):active~.custom-control-label::before{color:#fff;background-color:#b3d7ff;border-color:#b3d7ff}.custom-control-input:disabled~.custom-control-label{color:#6c757d}.custom-control-input:disabled~.custom-control-label::before{background-color:#e9ecef}.custom-control-label{position:relative;margin-bottom:0;vertical-align:top}.custom-control-label::before{position:absolute;top:.25rem;left:-1.5rem;display:block;width:1rem;height:1rem;pointer-events:none;content:"";background-color:#fff;border:#adb5bd solid 1px}.custom-control-label::after{position:absolute;top:.25rem;left:-1.5rem;display:block;width:1rem;height:1rem;content:"";background:no-repeat 50%/50% 50%}.custom-checkbox .custom-control-label::before{border-radius:.25rem}.custom-checkbox .custom-control-input:checked~.custom-control-label::after{background-image:url("data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 8 8'%3e%3cpath fill='%23fff' d='M6.564.75l-3.59 3.612-1.538-1.55L0 4.26 2.974 7.25 8 2.193z'/%3e%3c/svg%3e")}.custom-checkbox .custom-control-input:indeterminate~.custom-control-label::before{border-color:#007bff;background-color:#007bff}.custom-checkbox .custom-control-input:indeterminate~.custom-control-label::after{background-image:url("data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 4 4'%3e%3cpath stroke='%23fff' d='M0 2h4'/%3e%3c/svg%3e")}.custom-checkbox .custom-control-input:disabled:checked~.custom-control-label::before{background-color:rgba(0,123,255,.5)}.custom-checkbox .custom-control-input:disabled:indeterminate~.custom-control-label::before{background-color:rgba(0,123,255,.5)}.custom-radio .custom-control-label::before{border-radius:50%}.custom-radio .custom-control-input:checked~.custom-control-label::after{background-image:url("data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'%3e%3ccircle r='3' fill='%23fff'/%3e%3c/svg%3e")}.custom-radio .custom-control-input:disabled:checked~.custom-control-label::before{background-color:rgba(0,123,255,.5)}.custom-switch{padding-left:2.25rem}.custom-switch .custom-control-label::before{left:-2.25rem;width:1.75rem;pointer-events:all;border-radius:.5rem}.custom-switch .custom-control-label::after{top:calc(.25rem + 2px);left:calc(-2.25rem + 2px);width:calc(1rem - 4px);height:calc(1rem - 4px);background-color:#adb5bd;border-radius:.5rem;transition:background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out,-webkit-transform .15s ease-in-out;transition:transform .15s ease-in-out,background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out;transition:transform .15s ease-in-out,background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out,-webkit-transform .15s ease-in-out}@media (prefers-reduced-motion:reduce){.custom-switch .custom-control-label::after{transition:none}}.custom-switch .custom-control-input:checked~.custom-control-label::after{background-color:#fff;-webkit-transform:translateX(.75rem);transform:translateX(.75rem)}.custom-switch .custom-control-input:disabled:checked~.custom-control-label::before{background-color:rgba(0,123,255,.5)}.custom-select{display:inline-block;width:100%;height:calc(1.5em + .75rem + 2px);padding:.375rem 1.75rem .375rem .75rem;font-size:1rem;font-weight:400;line-height:1.5;color:#495057;vertical-align:middle;background:url("data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 4 5'%3e%3cpath fill='%23343a40' d='M2 0L0 2h4zm0 5L0 3h4z'/%3e%3c/svg%3e") no-repeat right .75rem center/8px 10px;background-color:#fff;border:1px solid #ced4da;border-radius:.25rem;-webkit-appearance:none;-moz-appearance:none;appearance:none}.custom-select:focus{border-color:#80bdff;outline:0;box-shadow:0 0 0 .2rem rgba(0,123,255,.25)}.custom-select:focus::-ms-value{color:#495057;background-color:#fff}.custom-select[multiple],.custom-select[size]:not([size="1"]){height:auto;padding-right:.75rem;background-image:none}.custom-select:disabled{color:#6c757d;background-color:#e9ecef}.custom-select::-ms-expand{display:none}.custom-select-sm{height:calc(1.5em + .5rem + 2px);padding-top:.25rem;padding-bottom:.25rem;padding-left:.5rem;font-size:.875rem}.custom-select-lg{height:calc(1.5em + 1rem + 2px);padding-top:.5rem;padding-bottom:.5rem;padding-left:1rem;font-size:1.25rem}.custom-file{position:relative;display:inline-block;width:100%;height:calc(1.5em + .75rem + 2px);margin-bottom:0}.custom-file-input{position:relative;z-index:2;width:100%;height:calc(1.5em + .75rem + 2px);margin:0;opacity:0}.custom-file-input:focus~.custom-file-label{border-color:#80bdff;box-shadow:0 0 0 .2rem rgba(0,123,255,.25)}.custom-file-input:disabled~.custom-file-label{background-color:#e9ecef}.custom-file-input:lang(en)~.custom-file-label::after{content:"Browse"}.custom-file-input~.custom-file-label[data-browse]::after{content:attr(data-browse)}.custom-file-label{position:absolute;top:0;right:0;left:0;z-index:1;height:calc(1.5em + .75rem + 2px);padding:.375rem .75rem;font-weight:400;line-height:1.5;color:#495057;background-color:#fff;border:1px solid #ced4da;border-radius:.25rem}.custom-file-label::after{position:absolute;top:0;right:0;bottom:0;z-index:3;display:block;height:calc(1.5em + .75rem);padding:.375rem .75rem;line-height:1.5;color:#495057;content:"Browse";background-color:#e9ecef;border-left:inherit;border-radius:0 .25rem .25rem 0}.custom-range{width:100%;height:calc(1rem + .4rem);padding:0;background-color:transparent;-webkit-appearance:none;-moz-appearance:none;appearance:none}.custom-range:focus{outline:0}.custom-range:focus::-webkit-slider-thumb{box-shadow:0 0 0 1px #fff,0 0 0 .2rem rgba(0,123,255,.25)}.custom-range:focus::-moz-range-thumb{box-shadow:0 0 0 1px #fff,0 0 0 .2rem rgba(0,123,255,.25)}.custom-range:focus::-ms-thumb{box-shadow:0 0 0 1px #fff,0 0 0 .2rem rgba(0,123,255,.25)}.custom-range::-moz-focus-outer{border:0}.custom-range::-webkit-slider-thumb{width:1rem;height:1rem;margin-top:-.25rem;background-color:#007bff;border:0;border-radius:1rem;transition:background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out;-webkit-appearance:none;appearance:none}@media (prefers-reduced-motion:reduce){.custom-range::-webkit-slider-thumb{transition:none}}.custom-range::-webkit-slider-thumb:active{background-color:#b3d7ff}.custom-range::-webkit-slider-runnable-track{width:100%;height:.5rem;color:transparent;cursor:pointer;background-color:#dee2e6;border-color:transparent;border-radius:1rem}.custom-range::-moz-range-thumb{width:1rem;height:1rem;background-color:#007bff;border:0;border-radius:1rem;transition:background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out;-moz-appearance:none;appearance:none}@media (prefers-reduced-motion:reduce){.custom-range::-moz-range-thumb{transition:none}}.custom-range::-moz-range-thumb:active{background-color:#b3d7ff}.custom-range::-moz-range-track{width:100%;height:.5rem;color:transparent;cursor:pointer;background-color:#dee2e6;border-color:transparent;border-radius:1rem}.custom-range::-ms-thumb{width:1rem;height:1rem;margin-top:0;margin-right:.2rem;margin-left:.2rem;background-color:#007bff;border:0;border-radius:1rem;transition:background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out;appearance:none}@media (prefers-reduced-motion:reduce){.custom-range::-ms-thumb{transition:none}}.custom-range::-ms-thumb:active{background-color:#b3d7ff}.custom-range::-ms-track{width:100%;height:.5rem;color:transparent;cursor:pointer;background-color:transparent;border-color:transparent;border-width:.5rem}.custom-range::-ms-fill-lower{background-color:#dee2e6;border-radius:1rem}.custom-range::-ms-fill-upper{margin-right:15px;background-color:#dee2e6;border-radius:1rem}.custom-range:disabled::-webkit-slider-thumb{background-color:#adb5bd}.custom-range:disabled::-webkit-slider-runnable-track{cursor:default}.custom-range:disabled::-moz-range-thumb{background-color:#adb5bd}.custom-range:disabled::-moz-range-track{cursor:default}.custom-range:disabled::-ms-thumb{background-color:#adb5bd}.custom-control-label::before,.custom-file-label,.custom-select{transition:background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out}@media (prefers-reduced-motion:reduce){.custom-control-label::before,.custom-file-label,.custom-select{transition:none}}.nav{display:-ms-flexbox;display:flex;-ms-flex-wrap:wrap;flex-wrap:wrap;padding-left:0;margin-bottom:0;list-style:none}.nav-link{display:block;padding:.5rem 1rem}.nav-link:focus,.nav-link:hover{text-decoration:none}.nav-link.disabled{color:#6c757d;pointer-events:none;cursor:default}.nav-tabs{border-bottom:1px solid #dee2e6}.nav-tabs .nav-item{margin-bottom:-1px}.nav-tabs .nav-link{border:1px solid transparent;border-top-left-radius:.25rem;border-top-right-radius:.25rem}.nav-tabs .nav-link:focus,.nav-tabs .nav-link:hover{border-color:#e9ecef #e9ecef #dee2e6}.nav-tabs .nav-link.disabled{color:#6c757d;background-color:transparent;border-color:transparent}.nav-tabs .nav-item.show .nav-link,.nav-tabs .nav-link.active{color:#495057;background-color:#fff;border-color:#dee2e6 #dee2e6 #fff}.nav-tabs .dropdown-menu{margin-top:-1px;border-top-left-radius:0;border-top-right-radius:0}.nav-pills .nav-link{border-radius:.25rem}.nav-pills .nav-link.active,.nav-pills .show>.nav-link{color:#fff;background-color:#007bff}.nav-fill .nav-item{-ms-flex:1 1 auto;flex:1 1 auto;text-align:center}.nav-justified .nav-item{-ms-flex-preferred-size:0;flex-basis:0;-ms-flex-positive:1;flex-grow:1;text-align:center}.tab-content>.tab-pane{display:none}.tab-content>.active{display:block}.navbar{position:relative;display:-ms-flexbox;display:flex;-ms-flex-wrap:wrap;flex-wrap:wrap;-ms-flex-align:center;align-items:center;-ms-flex-pack:justify;justify-content:space-between;padding:.5rem 1rem}.navbar>.container,.navbar>.container-fluid{display:-ms-flexbox;display:flex;-ms-flex-wrap:wrap;flex-wrap:wrap;-ms-flex-align:center;align-items:center;-ms-flex-pack:justify;justify-content:space-between}.navbar-brand{display:inline-block;padding-top:.3125rem;padding-bottom:.3125rem;margin-right:1rem;font-size:1.25rem;line-height:inherit;white-space:nowrap}.navbar-brand:focus,.navbar-brand:hover{text-decoration:none}.navbar-nav{display:-ms-flexbox;display:flex;-ms-flex-direction:column;flex-direction:column;padding-left:0;margin-bottom:0;list-style:none}.navbar-nav .nav-link{padding-right:0;padding-left:0}.navbar-nav .dropdown-menu{position:static;float:none}.navbar-text{display:inline-block;padding-top:.5rem;padding-bottom:.5rem}.navbar-collapse{-ms-flex-preferred-size:100%;flex-basis:100%;-ms-flex-positive:1;flex-grow:1;-ms-flex-align:center;align-items:center}.navbar-toggler{padding:.25rem .75rem;font-size:1.25rem;line-height:1;background-color:transparent;border:1px solid transparent;border-radius:.25rem}.navbar-toggler:focus,.navbar-toggler:hover{text-decoration:none}.navbar-toggler-icon{display:inline-block;width:1.5em;height:1.5em;vertical-align:middle;content:"";background:no-repeat center center;background-size:100% 100%}@media (max-width:575.98px){.navbar-expand-sm>.container,.navbar-expand-sm>.container-fluid{padding-right:0;padding-left:0}}@media (min-width:576px){.navbar-expand-sm{-ms-flex-flow:row nowrap;flex-flow:row nowrap;-ms-flex-pack:start;justify-content:flex-start}.navbar-expand-sm .navbar-nav{-ms-flex-direction:row;flex-direction:row}.navbar-expand-sm .navbar-nav .dropdown-menu{position:absolute}.navbar-expand-sm .navbar-nav .nav-link{padding-right:.5rem;padding-left:.5rem}.navbar-expand-sm>.container,.navbar-expand-sm>.container-fluid{-ms-flex-wrap:nowrap;flex-wrap:nowrap}.navbar-expand-sm .navbar-collapse{display:-ms-flexbox!important;display:flex!important;-ms-flex-preferred-size:auto;flex-basis:auto}.navbar-expand-sm .navbar-toggler{display:none}}@media (max-width:767.98px){.navbar-expand-md>.container,.navbar-expand-md>.container-fluid{padding-right:0;padding-left:0}}@media (min-width:768px){.navbar-expand-md{-ms-flex-flow:row nowrap;flex-flow:row nowrap;-ms-flex-pack:start;justify-content:flex-start}.navbar-expand-md .navbar-nav{-ms-flex-direction:row;flex-direction:row}.navbar-expand-md .navbar-nav .dropdown-menu{position:absolute}.navbar-expand-md .navbar-nav .nav-link{padding-right:.5rem;padding-left:.5rem}.navbar-expand-md>.container,.navbar-expand-md>.container-fluid{-ms-flex-wrap:nowrap;flex-wrap:nowrap}.navbar-expand-md .navbar-collapse{display:-ms-flexbox!important;display:flex!important;-ms-flex-preferred-size:auto;flex-basis:auto}.navbar-expand-md .navbar-toggler{display:none}}@media (max-width:991.98px){.navbar-expand-lg>.container,.navbar-expand-lg>.container-fluid{padding-right:0;padding-left:0}}@media (min-width:992px){.navbar-expand-lg{-ms-flex-flow:row nowrap;flex-flow:row nowrap;-ms-flex-pack:start;justify-content:flex-start}.navbar-expand-lg .navbar-nav{-ms-flex-direction:row;flex-direction:row}.navbar-expand-lg .navbar-nav .dropdown-menu{position:absolute}.navbar-expand-lg .navbar-nav .nav-link{padding-right:.5rem;padding-left:.5rem}.navbar-expand-lg>.container,.navbar-expand-lg>.container-fluid{-ms-flex-wrap:nowrap;flex-wrap:nowrap}.navbar-expand-lg .navbar-collapse{display:-ms-flexbox!important;display:flex!important;-ms-flex-preferred-size:auto;flex-basis:auto}.navbar-expand-lg .navbar-toggler{display:none}}@media (max-width:1199.98px){.navbar-expand-xl>.container,.navbar-expand-xl>.container-fluid{padding-right:0;padding-left:0}}@media (min-width:1200px){.navbar-expand-xl{-ms-flex-flow:row nowrap;flex-flow:row nowrap;-ms-flex-pack:start;justify-content:flex-start}.navbar-expand-xl .navbar-nav{-ms-flex-direction:row;flex-direction:row}.navbar-expand-xl .navbar-nav .dropdown-menu{position:absolute}.navbar-expand-xl .navbar-nav .nav-link{padding-right:.5rem;padding-left:.5rem}.navbar-expand-xl>.container,.navbar-expand-xl>.container-fluid{-ms-flex-wrap:nowrap;flex-wrap:nowrap}.navbar-expand-xl .navbar-collapse{display:-ms-flexbox!important;display:flex!important;-ms-flex-preferred-size:auto;flex-basis:auto}.navbar-expand-xl .navbar-toggler{display:none}}.navbar-expand{-ms-flex-flow:row nowrap;flex-flow:row nowrap;-ms-flex-pack:start;justify-content:flex-start}.navbar-expand>.container,.navbar-expand>.container-fluid{padding-right:0;padding-left:0}.navbar-expand .navbar-nav{-ms-flex-direction:row;flex-direction:row}.navbar-expand .navbar-nav .dropdown-menu{position:absolute}.navbar-expand .navbar-nav .nav-link{padding-right:.5rem;padding-left:.5rem}.navbar-expand>.container,.navbar-expand>.container-fluid{-ms-flex-wrap:nowrap;flex-wrap:nowrap}.navbar-expand .navbar-collapse{display:-ms-flexbox!important;display:flex!important;-ms-flex-preferred-size:auto;flex-basis:auto}.navbar-expand .navbar-toggler{display:none}.navbar-light .navbar-brand{color:rgba(0,0,0,.9)}.navbar-light .navbar-brand:focus,.navbar-light .navbar-brand:hover{color:rgba(0,0,0,.9)}.navbar-light .navbar-nav .nav-link{color:rgba(0,0,0,.5)}.navbar-light .navbar-nav .nav-link:focus,.navbar-light .navbar-nav .nav-link:hover{color:rgba(0,0,0,.7)}.navbar-light .navbar-nav .nav-link.disabled{color:rgba(0,0,0,.3)}.navbar-light .navbar-nav .active>.nav-link,.navbar-light .navbar-nav .nav-link.active,.navbar-light .navbar-nav .nav-link.show,.navbar-light .navbar-nav .show>.nav-link{color:rgba(0,0,0,.9)}.navbar-light .navbar-toggler{color:rgba(0,0,0,.5);border-color:rgba(0,0,0,.1)}.navbar-light .navbar-toggler-icon{background-image:url("data:image/svg+xml,%3csvg viewBox='0 0 30 30' xmlns='http://www.w3.org/2000/svg'%3e%3cpath stroke='rgba(0, 0, 0, 0.5)' stroke-width='2' stroke-linecap='round' stroke-miterlimit='10' d='M4 7h22M4 15h22M4 23h22'/%3e%3c/svg%3e")}.navbar-light .navbar-text{color:rgba(0,0,0,.5)}.navbar-light .navbar-text a{color:rgba(0,0,0,.9)}.navbar-light .navbar-text a:focus,.navbar-light .navbar-text a:hover{color:rgba(0,0,0,.9)}.navbar-dark .navbar-brand{color:#fff}.navbar-dark .navbar-brand:focus,.navbar-dark .navbar-brand:hover{color:#fff}.navbar-dark .navbar-nav .nav-link{color:rgba(255,255,255,.5)}.navbar-dark .navbar-nav .nav-link:focus,.navbar-dark .navbar-nav .nav-link:hover{color:rgba(255,255,255,.75)}.navbar-dark .navbar-nav .nav-link.disabled{color:rgba(255,255,255,.25)}.navbar-dark .navbar-nav .active>.nav-link,.navbar-dark .navbar-nav .nav-link.active,.navbar-dark .navbar-nav .nav-link.show,.navbar-dark .navbar-nav .show>.nav-link{color:#fff}.navbar-dark .navbar-toggler{color:rgba(255,255,255,.5);border-color:rgba(255,255,255,.1)}.navbar-dark .navbar-toggler-icon{background-image:url("data:image/svg+xml,%3csvg viewBox='0 0 30 30' xmlns='http://www.w3.org/2000/svg'%3e%3cpath stroke='rgba(255, 255, 255, 0.5)' stroke-width='2' stroke-linecap='round' stroke-miterlimit='10' d='M4 7h22M4 15h22M4 23h22'/%3e%3c/svg%3e")}.navbar-dark .navbar-text{color:rgba(255,255,255,.5)}.navbar-dark .navbar-text a{color:#fff}.navbar-dark .navbar-text a:focus,.navbar-dark .navbar-text a:hover{color:#fff}.card{position:relative;display:-ms-flexbox;display:flex;-ms-flex-direction:column;flex-direction:column;min-width:0;word-wrap:break-word;background-color:#fff;background-clip:border-box;border:1px solid rgba(0,0,0,.125);border-radius:.25rem}.card>hr{margin-right:0;margin-left:0}.card>.list-group:first-child .list-group-item:first-child{border-top-left-radius:.25rem;border-top-right-radius:.25rem}.card>.list-group:last-child .list-group-item:last-child{border-bottom-right-radius:.25rem;border-bottom-left-radius:.25rem}.card-body{-ms-flex:1 1 auto;flex:1 1 auto;padding:1.25rem}.card-title{margin-bottom:.75rem}.card-subtitle{margin-top:-.375rem;margin-bottom:0}.card-text:last-child{margin-bottom:0}.card-link:hover{text-decoration:none}.card-link+.card-link{margin-left:1.25rem}.card-header{padding:.75rem 1.25rem;margin-bottom:0;background-color:rgba(0,0,0,.03);border-bottom:1px solid rgba(0,0,0,.125)}.card-header:first-child{border-radius:calc(.25rem - 1px) calc(.25rem - 1px) 0 0}.card-header+.list-group .list-group-item:first-child{border-top:0}.card-footer{padding:.75rem 1.25rem;background-color:rgba(0,0,0,.03);border-top:1px solid rgba(0,0,0,.125)}.card-footer:last-child{border-radius:0 0 calc(.25rem - 1px) calc(.25rem - 1px)}.card-header-tabs{margin-right:-.625rem;margin-bottom:-.75rem;margin-left:-.625rem;border-bottom:0}.card-header-pills{margin-right:-.625rem;margin-left:-.625rem}.card-img-overlay{position:absolute;top:0;right:0;bottom:0;left:0;padding:1.25rem}.card-img{width:100%;border-radius:calc(.25rem - 1px)}.card-img-top{width:100%;border-top-left-radius:calc(.25rem - 1px);border-top-right-radius:calc(.25rem - 1px)}.card-img-bottom{width:100%;border-bottom-right-radius:calc(.25rem - 1px);border-bottom-left-radius:calc(.25rem - 1px)}.card-deck{display:-ms-flexbox;display:flex;-ms-flex-direction:column;flex-direction:column}.card-deck .card{margin-bottom:15px}@media (min-width:576px){.card-deck{-ms-flex-flow:row wrap;flex-flow:row wrap;margin-right:-15px;margin-left:-15px}.card-deck .card{display:-ms-flexbox;display:flex;-ms-flex:1 0 0%;flex:1 0 0%;-ms-flex-direction:column;flex-direction:column;margin-right:15px;margin-bottom:0;margin-left:15px}}.card-group{display:-ms-flexbox;display:flex;-ms-flex-direction:column;flex-direction:column}.card-group>.card{margin-bottom:15px}@media (min-width:576px){.card-group{-ms-flex-flow:row wrap;flex-flow:row wrap}.card-group>.card{-ms-flex:1 0 0%;flex:1 0 0%;margin-bottom:0}.card-group>.card+.card{margin-left:0;border-left:0}.card-group>.card:not(:last-child){border-top-right-radius:0;border-bottom-right-radius:0}.card-group>.card:not(:last-child) .card-header,.card-group>.card:not(:last-child) .card-img-top{border-top-right-radius:0}.card-group>.card:not(:last-child) .card-footer,.card-group>.card:not(:last-child) .card-img-bottom{border-bottom-right-radius:0}.card-group>.card:not(:first-child){border-top-left-radius:0;border-bottom-left-radius:0}.card-group>.card:not(:first-child) .card-header,.card-group>.card:not(:first-child) .card-img-top{border-top-left-radius:0}.card-group>.card:not(:first-child) .card-footer,.card-group>.card:not(:first-child) .card-img-bottom{border-bottom-left-radius:0}}.card-columns .card{margin-bottom:.75rem}@media (min-width:576px){.card-columns{-webkit-column-count:3;-moz-column-count:3;column-count:3;-webkit-column-gap:1.25rem;-moz-column-gap:1.25rem;column-gap:1.25rem;orphans:1;widows:1}.card-columns .card{display:inline-block;width:100%}}.accordion>.card{overflow:hidden}.accordion>.card:not(:first-of-type) .card-header:first-child{border-radius:0}.accordion>.card:not(:first-of-type):not(:last-of-type){border-bottom:0;border-radius:0}.accordion>.card:first-of-type{border-bottom:0;border-bottom-right-radius:0;border-bottom-left-radius:0}.accordion>.card:last-of-type{border-top-left-radius:0;border-top-right-radius:0}.accordion>.card .card-header{margin-bottom:-1px}.breadcrumb{display:-ms-flexbox;display:flex;-ms-flex-wrap:wrap;flex-wrap:wrap;padding:.75rem 1rem;margin-bottom:1rem;list-style:none;background-color:#e9ecef;border-radius:.25rem}.breadcrumb-item+.breadcrumb-item{padding-left:.5rem}.breadcrumb-item+.breadcrumb-item::before{display:inline-block;padding-right:.5rem;color:#6c757d;content:"/"}.breadcrumb-item+.breadcrumb-item:hover::before{text-decoration:underline}.breadcrumb-item+.breadcrumb-item:hover::before{text-decoration:none}.breadcrumb-item.active{color:#6c757d}.pagination{display:-ms-flexbox;display:flex;padding-left:0;list-style:none;border-radius:.25rem}.page-link{position:relative;display:block;padding:.5rem .75rem;margin-left:-1px;line-height:1.25;color:#007bff;background-color:#fff;border:1px solid #dee2e6}.page-link:hover{z-index:2;color:#0056b3;text-decoration:none;background-color:#e9ecef;border-color:#dee2e6}.page-link:focus{z-index:2;outline:0;box-shadow:0 0 0 .2rem rgba(0,123,255,.25)}.page-item:first-child .page-link{margin-left:0;border-top-left-radius:.25rem;border-bottom-left-radius:.25rem}.page-item:last-child .page-link{border-top-right-radius:.25rem;border-bottom-right-radius:.25rem}.page-item.active .page-link{z-index:1;color:#fff;background-color:#007bff;border-color:#007bff}.page-item.disabled .page-link{color:#6c757d;pointer-events:none;cursor:auto;background-color:#fff;border-color:#dee2e6}.pagination-lg .page-link{padding:.75rem 1.5rem;font-size:1.25rem;line-height:1.5}.pagination-lg .page-item:first-child .page-link{border-top-left-radius:.3rem;border-bottom-left-radius:.3rem}.pagination-lg .page-item:last-child .page-link{border-top-right-radius:.3rem;border-bottom-right-radius:.3rem}.pagination-sm .page-link{padding:.25rem .5rem;font-size:.875rem;line-height:1.5}.pagination-sm .page-item:first-child .page-link{border-top-left-radius:.2rem;border-bottom-left-radius:.2rem}.pagination-sm .page-item:last-child .page-link{border-top-right-radius:.2rem;border-bottom-right-radius:.2rem}.badge{display:inline-block;padding:.25em .4em;font-size:75%;font-weight:700;line-height:1;text-align:center;white-space:nowrap;vertical-align:baseline;border-radius:.25rem;transition:color .15s ease-in-out,background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out}@media (prefers-reduced-motion:reduce){.badge{transition:none}}a.badge:focus,a.badge:hover{text-decoration:none}.badge:empty{display:none}.btn .badge{position:relative;top:-1px}.badge-pill{padding-right:.6em;padding-left:.6em;border-radius:10rem}.badge-primary{color:#fff;background-color:#007bff}a.badge-primary:focus,a.badge-primary:hover{color:#fff;background-color:#0062cc}a.badge-primary.focus,a.badge-primary:focus{outline:0;box-shadow:0 0 0 .2rem rgba(0,123,255,.5)}.badge-secondary{color:#fff;background-color:#6c757d}a.badge-secondary:focus,a.badge-secondary:hover{color:#fff;background-color:#545b62}a.badge-secondary.focus,a.badge-secondary:focus{outline:0;box-shadow:0 0 0 .2rem rgba(108,117,125,.5)}.badge-success{color:#fff;background-color:#28a745}a.badge-success:focus,a.badge-success:hover{color:#fff;background-color:#1e7e34}a.badge-success.focus,a.badge-success:focus{outline:0;box-shadow:0 0 0 .2rem rgba(40,167,69,.5)}.badge-info{color:#fff;background-color:#17a2b8}a.badge-info:focus,a.badge-info:hover{color:#fff;background-color:#117a8b}a.badge-info.focus,a.badge-info:focus{outline:0;box-shadow:0 0 0 .2rem rgba(23,162,184,.5)}.badge-warning{color:#212529;background-color:#ffc107}a.badge-warning:focus,a.badge-warning:hover{color:#212529;background-color:#d39e00}a.badge-warning.focus,a.badge-warning:focus{outline:0;box-shadow:0 0 0 .2rem rgba(255,193,7,.5)}.badge-danger{color:#fff;background-color:#dc3545}a.badge-danger:focus,a.badge-danger:hover{color:#fff;background-color:#bd2130}a.badge-danger.focus,a.badge-danger:focus{outline:0;box-shadow:0 0 0 .2rem rgba(220,53,69,.5)}.badge-light{color:#212529;background-color:#f8f9fa}a.badge-light:focus,a.badge-light:hover{color:#212529;background-color:#dae0e5}a.badge-light.focus,a.badge-light:focus{outline:0;box-shadow:0 0 0 .2rem rgba(248,249,250,.5)}.badge-dark{color:#fff;background-color:#343a40}a.badge-dark:focus,a.badge-dark:hover{color:#fff;background-color:#1d2124}a.badge-dark.focus,a.badge-dark:focus{outline:0;box-shadow:0 0 0 .2rem rgba(52,58,64,.5)}.jumbotron{padding:2rem 1rem;margin-bottom:2rem;background-color:#e9ecef;border-radius:.3rem}@media (min-width:576px){.jumbotron{padding:4rem 2rem}}.jumbotron-fluid{padding-right:0;padding-left:0;border-radius:0}.alert{position:relative;padding:.75rem 1.25rem;margin-bottom:1rem;border:1px solid transparent;border-radius:.25rem}.alert-heading{color:inherit}.alert-link{font-weight:700}.alert-dismissible{padding-right:4rem}.alert-dismissible .close{position:absolute;top:0;right:0;padding:.75rem 1.25rem;color:inherit}.alert-primary{color:#004085;background-color:#cce5ff;border-color:#b8daff}.alert-primary hr{border-top-color:#9fcdff}.alert-primary .alert-link{color:#002752}.alert-secondary{color:#383d41;background-color:#e2e3e5;border-color:#d6d8db}.alert-secondary hr{border-top-color:#c8cbcf}.alert-secondary .alert-link{color:#202326}.alert-success{color:#155724;background-color:#d4edda;border-color:#c3e6cb}.alert-success hr{border-top-color:#b1dfbb}.alert-success .alert-link{color:#0b2e13}.alert-info{color:#0c5460;background-color:#d1ecf1;border-color:#bee5eb}.alert-info hr{border-top-color:#abdde5}.alert-info .alert-link{color:#062c33}.alert-warning{color:#856404;background-color:#fff3cd;border-color:#ffeeba}.alert-warning hr{border-top-color:#ffe8a1}.alert-warning .alert-link{color:#533f03}.alert-danger{color:#721c24;background-color:#f8d7da;border-color:#f5c6cb}.alert-danger hr{border-top-color:#f1b0b7}.alert-danger .alert-link{color:#491217}.alert-light{color:#818182;background-color:#fefefe;border-color:#fdfdfe}.alert-light hr{border-top-color:#ececf6}.alert-light .alert-link{color:#686868}.alert-dark{color:#1b1e21;background-color:#d6d8d9;border-color:#c6c8ca}.alert-dark hr{border-top-color:#b9bbbe}.alert-dark .alert-link{color:#040505}@-webkit-keyframes progress-bar-stripes{from{background-position:1rem 0}to{background-position:0 0}}@keyframes progress-bar-stripes{from{background-position:1rem 0}to{background-position:0 0}}.progress{display:-ms-flexbox;display:flex;height:1rem;overflow:hidden;font-size:.75rem;background-color:#e9ecef;border-radius:.25rem}.progress-bar{display:-ms-flexbox;display:flex;-ms-flex-direction:column;flex-direction:column;-ms-flex-pack:center;justify-content:center;color:#fff;text-align:center;white-space:nowrap;background-color:#007bff;transition:width .6s ease}@media (prefers-reduced-motion:reduce){.progress-bar{transition:none}}.progress-bar-striped{background-image:linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-size:1rem 1rem}.progress-bar-animated{-webkit-animation:progress-bar-stripes 1s linear infinite;animation:progress-bar-stripes 1s linear infinite}@media (prefers-reduced-motion:reduce){.progress-bar-animated{-webkit-animation:none;animation:none}}.media{display:-ms-flexbox;display:flex;-ms-flex-align:start;align-items:flex-start}.media-body{-ms-flex:1;flex:1}.list-group{display:-ms-flexbox;display:flex;-ms-flex-direction:column;flex-direction:column;padding-left:0;margin-bottom:0}.list-group-item-action{width:100%;color:#495057;text-align:inherit}.list-group-item-action:focus,.list-group-item-action:hover{z-index:1;color:#495057;text-decoration:none;background-color:#f8f9fa}.list-group-item-action:active{color:#212529;background-color:#e9ecef}.list-group-item{position:relative;display:block;padding:.75rem 1.25rem;margin-bottom:-1px;background-color:#fff;border:1px solid rgba(0,0,0,.125)}.list-group-item:first-child{border-top-left-radius:.25rem;border-top-right-radius:.25rem}.list-group-item:last-child{margin-bottom:0;border-bottom-right-radius:.25rem;border-bottom-left-radius:.25rem}.list-group-item.disabled,.list-group-item:disabled{color:#6c757d;pointer-events:none;background-color:#fff}.list-group-item.active{z-index:2;color:#fff;background-color:#007bff;border-color:#007bff}.list-group-horizontal{-ms-flex-direction:row;flex-direction:row}.list-group-horizontal .list-group-item{margin-right:-1px;margin-bottom:0}.list-group-horizontal .list-group-item:first-child{border-top-left-radius:.25rem;border-bottom-left-radius:.25rem;border-top-right-radius:0}.list-group-horizontal .list-group-item:last-child{margin-right:0;border-top-right-radius:.25rem;border-bottom-right-radius:.25rem;border-bottom-left-radius:0}@media (min-width:576px){.list-group-horizontal-sm{-ms-flex-direction:row;flex-direction:row}.list-group-horizontal-sm .list-group-item{margin-right:-1px;margin-bottom:0}.list-group-horizontal-sm .list-group-item:first-child{border-top-left-radius:.25rem;border-bottom-left-radius:.25rem;border-top-right-radius:0}.list-group-horizontal-sm .list-group-item:last-child{margin-right:0;border-top-right-radius:.25rem;border-bottom-right-radius:.25rem;border-bottom-left-radius:0}}@media (min-width:768px){.list-group-horizontal-md{-ms-flex-direction:row;flex-direction:row}.list-group-horizontal-md .list-group-item{margin-right:-1px;margin-bottom:0}.list-group-horizontal-md .list-group-item:first-child{border-top-left-radius:.25rem;border-bottom-left-radius:.25rem;border-top-right-radius:0}.list-group-horizontal-md .list-group-item:last-child{margin-right:0;border-top-right-radius:.25rem;border-bottom-right-radius:.25rem;border-bottom-left-radius:0}}@media (min-width:992px){.list-group-horizontal-lg{-ms-flex-direction:row;flex-direction:row}.list-group-horizontal-lg .list-group-item{margin-right:-1px;margin-bottom:0}.list-group-horizontal-lg .list-group-item:first-child{border-top-left-radius:.25rem;border-bottom-left-radius:.25rem;border-top-right-radius:0}.list-group-horizontal-lg .list-group-item:last-child{margin-right:0;border-top-right-radius:.25rem;border-bottom-right-radius:.25rem;border-bottom-left-radius:0}}@media (min-width:1200px){.list-group-horizontal-xl{-ms-flex-direction:row;flex-direction:row}.list-group-horizontal-xl .list-group-item{margin-right:-1px;margin-bottom:0}.list-group-horizontal-xl .list-group-item:first-child{border-top-left-radius:.25rem;border-bottom-left-radius:.25rem;border-top-right-radius:0}.list-group-horizontal-xl .list-group-item:last-child{margin-right:0;border-top-right-radius:.25rem;border-bottom-right-radius:.25rem;border-bottom-left-radius:0}}.list-group-flush .list-group-item{border-right:0;border-left:0;border-radius:0}.list-group-flush .list-group-item:last-child{margin-bottom:-1px}.list-group-flush:first-child .list-group-item:first-child{border-top:0}.list-group-flush:last-child .list-group-item:last-child{margin-bottom:0;border-bottom:0}.list-group-item-primary{color:#004085;background-color:#b8daff}.list-group-item-primary.list-group-item-action:focus,.list-group-item-primary.list-group-item-action:hover{color:#004085;background-color:#9fcdff}.list-group-item-primary.list-group-item-action.active{color:#fff;background-color:#004085;border-color:#004085}.list-group-item-secondary{color:#383d41;background-color:#d6d8db}.list-group-item-secondary.list-group-item-action:focus,.list-group-item-secondary.list-group-item-action:hover{color:#383d41;background-color:#c8cbcf}.list-group-item-secondary.list-group-item-action.active{color:#fff;background-color:#383d41;border-color:#383d41}.list-group-item-success{color:#155724;background-color:#c3e6cb}.list-group-item-success.list-group-item-action:focus,.list-group-item-success.list-group-item-action:hover{color:#155724;background-color:#b1dfbb}.list-group-item-success.list-group-item-action.active{color:#fff;background-color:#155724;border-color:#155724}.list-group-item-info{color:#0c5460;background-color:#bee5eb}.list-group-item-info.list-group-item-action:focus,.list-group-item-info.list-group-item-action:hover{color:#0c5460;background-color:#abdde5}.list-group-item-info.list-group-item-action.active{color:#fff;background-color:#0c5460;border-color:#0c5460}.list-group-item-warning{color:#856404;background-color:#ffeeba}.list-group-item-warning.list-group-item-action:focus,.list-group-item-warning.list-group-item-action:hover{color:#856404;background-color:#ffe8a1}.list-group-item-warning.list-group-item-action.active{color:#fff;background-color:#856404;border-color:#856404}.list-group-item-danger{color:#721c24;background-color:#f5c6cb}.list-group-item-danger.list-group-item-action:focus,.list-group-item-danger.list-group-item-action:hover{color:#721c24;background-color:#f1b0b7}.list-group-item-danger.list-group-item-action.active{color:#fff;background-color:#721c24;border-color:#721c24}.list-group-item-light{color:#818182;background-color:#fdfdfe}.list-group-item-light.list-group-item-action:focus,.list-group-item-light.list-group-item-action:hover{color:#818182;background-color:#ececf6}.list-group-item-light.list-group-item-action.active{color:#fff;background-color:#818182;border-color:#818182}.list-group-item-dark{color:#1b1e21;background-color:#c6c8ca}.list-group-item-dark.list-group-item-action:focus,.list-group-item-dark.list-group-item-action:hover{color:#1b1e21;background-color:#b9bbbe}.list-group-item-dark.list-group-item-action.active{color:#fff;background-color:#1b1e21;border-color:#1b1e21}.close{float:right;font-size:1.5rem;font-weight:700;line-height:1;color:#000;text-shadow:0 1px 0 #fff;opacity:.5}.close:hover{color:#000;text-decoration:none}.close:not(:disabled):not(.disabled):focus,.close:not(:disabled):not(.disabled):hover{opacity:.75}button.close{padding:0;background-color:transparent;border:0;-webkit-appearance:none;-moz-appearance:none;appearance:none}a.close.disabled{pointer-events:none}.toast{max-width:350px;overflow:hidden;font-size:.875rem;background-color:rgba(255,255,255,.85);background-clip:padding-box;border:1px solid rgba(0,0,0,.1);box-shadow:0 .25rem .75rem rgba(0,0,0,.1);-webkit-backdrop-filter:blur(10px);backdrop-filter:blur(10px);opacity:0;border-radius:.25rem}.toast:not(:last-child){margin-bottom:.75rem}.toast.showing{opacity:1}.toast.show{display:block;opacity:1}.toast.hide{display:none}.toast-header{display:-ms-flexbox;display:flex;-ms-flex-align:center;align-items:center;padding:.25rem .75rem;color:#6c757d;background-color:rgba(255,255,255,.85);background-clip:padding-box;border-bottom:1px solid rgba(0,0,0,.05)}.toast-body{padding:.75rem}.modal-open{overflow:hidden}.modal-open .modal{overflow-x:hidden;overflow-y:auto}.modal{position:fixed;top:0;left:0;z-index:1050;display:none;width:100%;height:100%;overflow:hidden;outline:0}.modal-dialog{position:relative;width:auto;margin:.5rem;pointer-events:none}.modal.fade .modal-dialog{transition:-webkit-transform .3s ease-out;transition:transform .3s ease-out;transition:transform .3s ease-out,-webkit-transform .3s ease-out;-webkit-transform:translate(0,-50px);transform:translate(0,-50px)}@media (prefers-reduced-motion:reduce){.modal.fade .modal-dialog{transition:none}}.modal.show .modal-dialog{-webkit-transform:none;transform:none}.modal-dialog-scrollable{display:-ms-flexbox;display:flex;max-height:calc(100% - 1rem)}.modal-dialog-scrollable .modal-content{max-height:calc(100vh - 1rem);overflow:hidden}.modal-dialog-scrollable .modal-footer,.modal-dialog-scrollable .modal-header{-ms-flex-negative:0;flex-shrink:0}.modal-dialog-scrollable .modal-body{overflow-y:auto}.modal-dialog-centered{display:-ms-flexbox;display:flex;-ms-flex-align:center;align-items:center;min-height:calc(100% - 1rem)}.modal-dialog-centered::before{display:block;height:calc(100vh - 1rem);content:""}.modal-dialog-centered.modal-dialog-scrollable{-ms-flex-direction:column;flex-direction:column;-ms-flex-pack:center;justify-content:center;height:100%}.modal-dialog-centered.modal-dialog-scrollable .modal-content{max-height:none}.modal-dialog-centered.modal-dialog-scrollable::before{content:none}.modal-content{position:relative;display:-ms-flexbox;display:flex;-ms-flex-direction:column;flex-direction:column;width:100%;pointer-events:auto;background-color:#fff;background-clip:padding-box;border:1px solid rgba(0,0,0,.2);border-radius:.3rem;outline:0}.modal-backdrop{position:fixed;top:0;left:0;z-index:1040;width:100vw;height:100vh;background-color:#000}.modal-backdrop.fade{opacity:0}.modal-backdrop.show{opacity:.5}.modal-header{display:-ms-flexbox;display:flex;-ms-flex-align:start;align-items:flex-start;-ms-flex-pack:justify;justify-content:space-between;padding:1rem 1rem;border-bottom:1px solid #dee2e6;border-top-left-radius:.3rem;border-top-right-radius:.3rem}.modal-header .close{padding:1rem 1rem;margin:-1rem -1rem -1rem auto}.modal-title{margin-bottom:0;line-height:1.5}.modal-body{position:relative;-ms-flex:1 1 auto;flex:1 1 auto;padding:1rem}.modal-footer{display:-ms-flexbox;display:flex;-ms-flex-align:center;align-items:center;-ms-flex-pack:end;justify-content:flex-end;padding:1rem;border-top:1px solid #dee2e6;border-bottom-right-radius:.3rem;border-bottom-left-radius:.3rem}.modal-footer>:not(:first-child){margin-left:.25rem}.modal-footer>:not(:last-child){margin-right:.25rem}.modal-scrollbar-measure{position:absolute;top:-9999px;width:50px;height:50px;overflow:scroll}@media (min-width:576px){.modal-dialog{max-width:500px;margin:1.75rem auto}.modal-dialog-scrollable{max-height:calc(100% - 3.5rem)}.modal-dialog-scrollable .modal-content{max-height:calc(100vh - 3.5rem)}.modal-dialog-centered{min-height:calc(100% - 3.5rem)}.modal-dialog-centered::before{height:calc(100vh - 3.5rem)}.modal-sm{max-width:300px}}@media (min-width:992px){.modal-lg,.modal-xl{max-width:800px}}@media (min-width:1200px){.modal-xl{max-width:1140px}}.tooltip{position:absolute;z-index:1070;display:block;margin:0;font-family:-apple-system,BlinkMacSystemFont,"Segoe UI",Roboto,"Helvetica Neue",Arial,"Noto Sans",sans-serif,"Apple Color Emoji","Segoe UI Emoji","Segoe UI Symbol","Noto Color Emoji";font-style:normal;font-weight:400;line-height:1.5;text-align:left;text-align:start;text-decoration:none;text-shadow:none;text-transform:none;letter-spacing:normal;word-break:normal;word-spacing:normal;white-space:normal;line-break:auto;font-size:.875rem;word-wrap:break-word;opacity:0}.tooltip.show{opacity:.9}.tooltip .arrow{position:absolute;display:block;width:.8rem;height:.4rem}.tooltip .arrow::before{position:absolute;content:"";border-color:transparent;border-style:solid}.bs-tooltip-auto[x-placement^=top],.bs-tooltip-top{padding:.4rem 0}.bs-tooltip-auto[x-placement^=top] .arrow,.bs-tooltip-top .arrow{bottom:0}.bs-tooltip-auto[x-placement^=top] .arrow::before,.bs-tooltip-top .arrow::before{top:0;border-width:.4rem .4rem 0;border-top-color:#000}.bs-tooltip-auto[x-placement^=right],.bs-tooltip-right{padding:0 .4rem}.bs-tooltip-auto[x-placement^=right] .arrow,.bs-tooltip-right .arrow{left:0;width:.4rem;height:.8rem}.bs-tooltip-auto[x-placement^=right] .arrow::before,.bs-tooltip-right .arrow::before{right:0;border-width:.4rem .4rem .4rem 0;border-right-color:#000}.bs-tooltip-auto[x-placement^=bottom],.bs-tooltip-bottom{padding:.4rem 0}.bs-tooltip-auto[x-placement^=bottom] .arrow,.bs-tooltip-bottom .arrow{top:0}.bs-tooltip-auto[x-placement^=bottom] .arrow::before,.bs-tooltip-bottom .arrow::before{bottom:0;border-width:0 .4rem .4rem;border-bottom-color:#000}.bs-tooltip-auto[x-placement^=left],.bs-tooltip-left{padding:0 .4rem}.bs-tooltip-auto[x-placement^=left] .arrow,.bs-tooltip-left .arrow{right:0;width:.4rem;height:.8rem}.bs-tooltip-auto[x-placement^=left] .arrow::before,.bs-tooltip-left .arrow::before{left:0;border-width:.4rem 0 .4rem .4rem;border-left-color:#000}.tooltip-inner{max-width:200px;padding:.25rem .5rem;color:#fff;text-align:center;background-color:#000;border-radius:.25rem}.popover{position:absolute;top:0;left:0;z-index:1060;display:block;max-width:276px;font-family:-apple-system,BlinkMacSystemFont,"Segoe UI",Roboto,"Helvetica Neue",Arial,"Noto Sans",sans-serif,"Apple Color Emoji","Segoe UI Emoji","Segoe UI Symbol","Noto Color Emoji";font-style:normal;font-weight:400;line-height:1.5;text-align:left;text-align:start;text-decoration:none;text-shadow:none;text-transform:none;letter-spacing:normal;word-break:normal;word-spacing:normal;white-space:normal;line-break:auto;font-size:.875rem;word-wrap:break-word;background-color:#fff;background-clip:padding-box;border:1px solid rgba(0,0,0,.2);border-radius:.3rem}.popover .arrow{position:absolute;display:block;width:1rem;height:.5rem;margin:0 .3rem}.popover .arrow::after,.popover .arrow::before{position:absolute;display:block;content:"";border-color:transparent;border-style:solid}.bs-popover-auto[x-placement^=top],.bs-popover-top{margin-bottom:.5rem}.bs-popover-auto[x-placement^=top]>.arrow,.bs-popover-top>.arrow{bottom:calc((.5rem + 1px) * -1)}.bs-popover-auto[x-placement^=top]>.arrow::before,.bs-popover-top>.arrow::before{bottom:0;border-width:.5rem .5rem 0;border-top-color:rgba(0,0,0,.25)}.bs-popover-auto[x-placement^=top]>.arrow::after,.bs-popover-top>.arrow::after{bottom:1px;border-width:.5rem .5rem 0;border-top-color:#fff}.bs-popover-auto[x-placement^=right],.bs-popover-right{margin-left:.5rem}.bs-popover-auto[x-placement^=right]>.arrow,.bs-popover-right>.arrow{left:calc((.5rem + 1px) * -1);width:.5rem;height:1rem;margin:.3rem 0}.bs-popover-auto[x-placement^=right]>.arrow::before,.bs-popover-right>.arrow::before{left:0;border-width:.5rem .5rem .5rem 0;border-right-color:rgba(0,0,0,.25)}.bs-popover-auto[x-placement^=right]>.arrow::after,.bs-popover-right>.arrow::after{left:1px;border-width:.5rem .5rem .5rem 0;border-right-color:#fff}.bs-popover-auto[x-placement^=bottom],.bs-popover-bottom{margin-top:.5rem}.bs-popover-auto[x-placement^=bottom]>.arrow,.bs-popover-bottom>.arrow{top:calc((.5rem + 1px) * -1)}.bs-popover-auto[x-placement^=bottom]>.arrow::before,.bs-popover-bottom>.arrow::before{top:0;border-width:0 .5rem .5rem .5rem;border-bottom-color:rgba(0,0,0,.25)}.bs-popover-auto[x-placement^=bottom]>.arrow::after,.bs-popover-bottom>.arrow::after{top:1px;border-width:0 .5rem .5rem .5rem;border-bottom-color:#fff}.bs-popover-auto[x-placement^=bottom] .popover-header::before,.bs-popover-bottom .popover-header::before{position:absolute;top:0;left:50%;display:block;width:1rem;margin-left:-.5rem;content:"";border-bottom:1px solid #f7f7f7}.bs-popover-auto[x-placement^=left],.bs-popover-left{margin-right:.5rem}.bs-popover-auto[x-placement^=left]>.arrow,.bs-popover-left>.arrow{right:calc((.5rem + 1px) * -1);width:.5rem;height:1rem;margin:.3rem 0}.bs-popover-auto[x-placement^=left]>.arrow::before,.bs-popover-left>.arrow::before{right:0;border-width:.5rem 0 .5rem .5rem;border-left-color:rgba(0,0,0,.25)}.bs-popover-auto[x-placement^=left]>.arrow::after,.bs-popover-left>.arrow::after{right:1px;border-width:.5rem 0 .5rem .5rem;border-left-color:#fff}.popover-header{padding:.5rem .75rem;margin-bottom:0;font-size:1rem;background-color:#f7f7f7;border-bottom:1px solid #ebebeb;border-top-left-radius:calc(.3rem - 1px);border-top-right-radius:calc(.3rem - 1px)}.popover-header:empty{display:none}.popover-body{padding:.5rem .75rem;color:#212529}.carousel{position:relative}.carousel.pointer-event{-ms-touch-action:pan-y;touch-action:pan-y}.carousel-inner{position:relative;width:100%;overflow:hidden}.carousel-inner::after{display:block;clear:both;content:""}.carousel-item{position:relative;display:none;float:left;width:100%;margin-right:-100%;-webkit-backface-visibility:hidden;backface-visibility:hidden;transition:-webkit-transform .6s ease-in-out;transition:transform .6s ease-in-out;transition:transform .6s ease-in-out,-webkit-transform .6s ease-in-out}@media (prefers-reduced-motion:reduce){.carousel-item{transition:none}}.carousel-item-next,.carousel-item-prev,.carousel-item.active{display:block}.active.carousel-item-right,.carousel-item-next:not(.carousel-item-left){-webkit-transform:translateX(100%);transform:translateX(100%)}.active.carousel-item-left,.carousel-item-prev:not(.carousel-item-right){-webkit-transform:translateX(-100%);transform:translateX(-100%)}.carousel-fade .carousel-item{opacity:0;transition-property:opacity;-webkit-transform:none;transform:none}.carousel-fade .carousel-item-next.carousel-item-left,.carousel-fade .carousel-item-prev.carousel-item-right,.carousel-fade .carousel-item.active{z-index:1;opacity:1}.carousel-fade .active.carousel-item-left,.carousel-fade .active.carousel-item-right{z-index:0;opacity:0;transition:0s .6s opacity}@media (prefers-reduced-motion:reduce){.carousel-fade .active.carousel-item-left,.carousel-fade .active.carousel-item-right{transition:none}}.carousel-control-next,.carousel-control-prev{position:absolute;top:0;bottom:0;z-index:1;display:-ms-flexbox;display:flex;-ms-flex-align:center;align-items:center;-ms-flex-pack:center;justify-content:center;width:15%;color:#fff;text-align:center;opacity:.5;transition:opacity .15s ease}@media (prefers-reduced-motion:reduce){.carousel-control-next,.carousel-control-prev{transition:none}}.carousel-control-next:focus,.carousel-control-next:hover,.carousel-control-prev:focus,.carousel-control-prev:hover{color:#fff;text-decoration:none;outline:0;opacity:.9}.carousel-control-prev{left:0}.carousel-control-next{right:0}.carousel-control-next-icon,.carousel-control-prev-icon{display:inline-block;width:20px;height:20px;background:no-repeat 50%/100% 100%}.carousel-control-prev-icon{background-image:url("data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' fill='%23fff' viewBox='0 0 8 8'%3e%3cpath d='M5.25 0l-4 4 4 4 1.5-1.5-2.5-2.5 2.5-2.5-1.5-1.5z'/%3e%3c/svg%3e")}.carousel-control-next-icon{background-image:url("data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' fill='%23fff' viewBox='0 0 8 8'%3e%3cpath d='M2.75 0l-1.5 1.5 2.5 2.5-2.5 2.5 1.5 1.5 4-4-4-4z'/%3e%3c/svg%3e")}.carousel-indicators{position:absolute;right:0;bottom:0;left:0;z-index:15;display:-ms-flexbox;display:flex;-ms-flex-pack:center;justify-content:center;padding-left:0;margin-right:15%;margin-left:15%;list-style:none}.carousel-indicators li{box-sizing:content-box;-ms-flex:0 1 auto;flex:0 1 auto;width:30px;height:3px;margin-right:3px;margin-left:3px;text-indent:-999px;cursor:pointer;background-color:#fff;background-clip:padding-box;border-top:10px solid transparent;border-bottom:10px solid transparent;opacity:.5;transition:opacity .6s ease}@media (prefers-reduced-motion:reduce){.carousel-indicators li{transition:none}}.carousel-indicators .active{opacity:1}.carousel-caption{position:absolute;right:15%;bottom:20px;left:15%;z-index:10;padding-top:20px;padding-bottom:20px;color:#fff;text-align:center}@-webkit-keyframes spinner-border{to{-webkit-transform:rotate(360deg);transform:rotate(360deg)}}@keyframes spinner-border{to{-webkit-transform:rotate(360deg);transform:rotate(360deg)}}.spinner-border{display:inline-block;width:2rem;height:2rem;vertical-align:text-bottom;border:.25em solid currentColor;border-right-color:transparent;border-radius:50%;-webkit-animation:spinner-border .75s linear infinite;animation:spinner-border .75s linear infinite}.spinner-border-sm{width:1rem;height:1rem;border-width:.2em}@-webkit-keyframes spinner-grow{0%{-webkit-transform:scale(0);transform:scale(0)}50%{opacity:1}}@keyframes spinner-grow{0%{-webkit-transform:scale(0);transform:scale(0)}50%{opacity:1}}.spinner-grow{display:inline-block;width:2rem;height:2rem;vertical-align:text-bottom;background-color:currentColor;border-radius:50%;opacity:0;-webkit-animation:spinner-grow .75s linear infinite;animation:spinner-grow .75s linear infinite}.spinner-grow-sm{width:1rem;height:1rem}.align-baseline{vertical-align:baseline!important}.align-top{vertical-align:top!important}.align-middle{vertical-align:middle!important}.align-bottom{vertical-align:bottom!important}.align-text-bottom{vertical-align:text-bottom!important}.align-text-top{vertical-align:text-top!important}.bg-primary{background-color:#007bff!important}a.bg-primary:focus,a.bg-primary:hover,button.bg-primary:focus,button.bg-primary:hover{background-color:#0062cc!important}.bg-secondary{background-color:#6c757d!important}a.bg-secondary:focus,a.bg-secondary:hover,button.bg-secondary:focus,button.bg-secondary:hover{background-color:#545b62!important}.bg-success{background-color:#28a745!important}a.bg-success:focus,a.bg-success:hover,button.bg-success:focus,button.bg-success:hover{background-color:#1e7e34!important}.bg-info{background-color:#17a2b8!important}a.bg-info:focus,a.bg-info:hover,button.bg-info:focus,button.bg-info:hover{background-color:#117a8b!important}.bg-warning{background-color:#ffc107!important}a.bg-warning:focus,a.bg-warning:hover,button.bg-warning:focus,button.bg-warning:hover{background-color:#d39e00!important}.bg-danger{background-color:#dc3545!important}a.bg-danger:focus,a.bg-danger:hover,button.bg-danger:focus,button.bg-danger:hover{background-color:#bd2130!important}.bg-light{background-color:#f8f9fa!important}a.bg-light:focus,a.bg-light:hover,button.bg-light:focus,button.bg-light:hover{background-color:#dae0e5!important}.bg-dark{background-color:#343a40!important}a.bg-dark:focus,a.bg-dark:hover,button.bg-dark:focus,button.bg-dark:hover{background-color:#1d2124!important}.bg-white{background-color:#fff!important}.bg-transparent{background-color:transparent!important}.border{border:1px solid #dee2e6!important}.border-top{border-top:1px solid #dee2e6!important}.border-right{border-right:1px solid #dee2e6!important}.border-bottom{border-bottom:1px solid #dee2e6!important}.border-left{border-left:1px solid #dee2e6!important}.border-0{border:0!important}.border-top-0{border-top:0!important}.border-right-0{border-right:0!important}.border-bottom-0{border-bottom:0!important}.border-left-0{border-left:0!important}.border-primary{border-color:#007bff!important}.border-secondary{border-color:#6c757d!important}.border-success{border-color:#28a745!important}.border-info{border-color:#17a2b8!important}.border-warning{border-color:#ffc107!important}.border-danger{border-color:#dc3545!important}.border-light{border-color:#f8f9fa!important}.border-dark{border-color:#343a40!important}.border-white{border-color:#fff!important}.rounded-sm{border-radius:.2rem!important}.rounded{border-radius:.25rem!important}.rounded-top{border-top-left-radius:.25rem!important;border-top-right-radius:.25rem!important}.rounded-right{border-top-right-radius:.25rem!important;border-bottom-right-radius:.25rem!important}.rounded-bottom{border-bottom-right-radius:.25rem!important;border-bottom-left-radius:.25rem!important}.rounded-left{border-top-left-radius:.25rem!important;border-bottom-left-radius:.25rem!important}.rounded-lg{border-radius:.3rem!important}.rounded-circle{border-radius:50%!important}.rounded-pill{border-radius:50rem!important}.rounded-0{border-radius:0!important}.clearfix::after{display:block;clear:both;content:""}.d-none{display:none!important}.d-inline{display:inline!important}.d-inline-block{display:inline-block!important}.d-block{display:block!important}.d-table{display:table!important}.d-table-row{display:table-row!important}.d-table-cell{display:table-cell!important}.d-flex{display:-ms-flexbox!important;display:flex!important}.d-inline-flex{display:-ms-inline-flexbox!important;display:inline-flex!important}@media (min-width:576px){.d-sm-none{display:none!important}.d-sm-inline{display:inline!important}.d-sm-inline-block{display:inline-block!important}.d-sm-block{display:block!important}.d-sm-table{display:table!important}.d-sm-table-row{display:table-row!important}.d-sm-table-cell{display:table-cell!important}.d-sm-flex{display:-ms-flexbox!important;display:flex!important}.d-sm-inline-flex{display:-ms-inline-flexbox!important;display:inline-flex!important}}@media (min-width:768px){.d-md-none{display:none!important}.d-md-inline{display:inline!important}.d-md-inline-block{display:inline-block!important}.d-md-block{display:block!important}.d-md-table{display:table!important}.d-md-table-row{display:table-row!important}.d-md-table-cell{display:table-cell!important}.d-md-flex{display:-ms-flexbox!important;display:flex!important}.d-md-inline-flex{display:-ms-inline-flexbox!important;display:inline-flex!important}}@media (min-width:992px){.d-lg-none{display:none!important}.d-lg-inline{display:inline!important}.d-lg-inline-block{display:inline-block!important}.d-lg-block{display:block!important}.d-lg-table{display:table!important}.d-lg-table-row{display:table-row!important}.d-lg-table-cell{display:table-cell!important}.d-lg-flex{display:-ms-flexbox!important;display:flex!important}.d-lg-inline-flex{display:-ms-inline-flexbox!important;display:inline-flex!important}}@media (min-width:1200px){.d-xl-none{display:none!important}.d-xl-inline{display:inline!important}.d-xl-inline-block{display:inline-block!important}.d-xl-block{display:block!important}.d-xl-table{display:table!important}.d-xl-table-row{display:table-row!important}.d-xl-table-cell{display:table-cell!important}.d-xl-flex{display:-ms-flexbox!important;display:flex!important}.d-xl-inline-flex{display:-ms-inline-flexbox!important;display:inline-flex!important}}@media print{.d-print-none{display:none!important}.d-print-inline{display:inline!important}.d-print-inline-block{display:inline-block!important}.d-print-block{display:block!important}.d-print-table{display:table!important}.d-print-table-row{display:table-row!important}.d-print-table-cell{display:table-cell!important}.d-print-flex{display:-ms-flexbox!important;display:flex!important}.d-print-inline-flex{display:-ms-inline-flexbox!important;display:inline-flex!important}}.embed-responsive{position:relative;display:block;width:100%;padding:0;overflow:hidden}.embed-responsive::before{display:block;content:""}.embed-responsive .embed-responsive-item,.embed-responsive embed,.embed-responsive iframe,.embed-responsive object,.embed-responsive video{position:absolute;top:0;bottom:0;left:0;width:100%;height:100%;border:0}.embed-responsive-21by9::before{padding-top:42.857143%}.embed-responsive-16by9::before{padding-top:56.25%}.embed-responsive-4by3::before{padding-top:75%}.embed-responsive-1by1::before{padding-top:100%}.flex-row{-ms-flex-direction:row!important;flex-direction:row!important}.flex-column{-ms-flex-direction:column!important;flex-direction:column!important}.flex-row-reverse{-ms-flex-direction:row-reverse!important;flex-direction:row-reverse!important}.flex-column-reverse{-ms-flex-direction:column-reverse!important;flex-direction:column-reverse!important}.flex-wrap{-ms-flex-wrap:wrap!important;flex-wrap:wrap!important}.flex-nowrap{-ms-flex-wrap:nowrap!important;flex-wrap:nowrap!important}.flex-wrap-reverse{-ms-flex-wrap:wrap-reverse!important;flex-wrap:wrap-reverse!important}.flex-fill{-ms-flex:1 1 auto!important;flex:1 1 auto!important}.flex-grow-0{-ms-flex-positive:0!important;flex-grow:0!important}.flex-grow-1{-ms-flex-positive:1!important;flex-grow:1!important}.flex-shrink-0{-ms-flex-negative:0!important;flex-shrink:0!important}.flex-shrink-1{-ms-flex-negative:1!important;flex-shrink:1!important}.justify-content-start{-ms-flex-pack:start!important;justify-content:flex-start!important}.justify-content-end{-ms-flex-pack:end!important;justify-content:flex-end!important}.justify-content-center{-ms-flex-pack:center!important;justify-content:center!important}.justify-content-between{-ms-flex-pack:justify!important;justify-content:space-between!important}.justify-content-around{-ms-flex-pack:distribute!important;justify-content:space-around!important}.align-items-start{-ms-flex-align:start!important;align-items:flex-start!important}.align-items-end{-ms-flex-align:end!important;align-items:flex-end!important}.align-items-center{-ms-flex-align:center!important;align-items:center!important}.align-items-baseline{-ms-flex-align:baseline!important;align-items:baseline!important}.align-items-stretch{-ms-flex-align:stretch!important;align-items:stretch!important}.align-content-start{-ms-flex-line-pack:start!important;align-content:flex-start!important}.align-content-end{-ms-flex-line-pack:end!important;align-content:flex-end!important}.align-content-center{-ms-flex-line-pack:center!important;align-content:center!important}.align-content-between{-ms-flex-line-pack:justify!important;align-content:space-between!important}.align-content-around{-ms-flex-line-pack:distribute!important;align-content:space-around!important}.align-content-stretch{-ms-flex-line-pack:stretch!important;align-content:stretch!important}.align-self-auto{-ms-flex-item-align:auto!important;align-self:auto!important}.align-self-start{-ms-flex-item-align:start!important;align-self:flex-start!important}.align-self-end{-ms-flex-item-align:end!important;align-self:flex-end!important}.align-self-center{-ms-flex-item-align:center!important;align-self:center!important}.align-self-baseline{-ms-flex-item-align:baseline!important;align-self:baseline!important}.align-self-stretch{-ms-flex-item-align:stretch!important;align-self:stretch!important}@media (min-width:576px){.flex-sm-row{-ms-flex-direction:row!important;flex-direction:row!important}.flex-sm-column{-ms-flex-direction:column!important;flex-direction:column!important}.flex-sm-row-reverse{-ms-flex-direction:row-reverse!important;flex-direction:row-reverse!important}.flex-sm-column-reverse{-ms-flex-direction:column-reverse!important;flex-direction:column-reverse!important}.flex-sm-wrap{-ms-flex-wrap:wrap!important;flex-wrap:wrap!important}.flex-sm-nowrap{-ms-flex-wrap:nowrap!important;flex-wrap:nowrap!important}.flex-sm-wrap-reverse{-ms-flex-wrap:wrap-reverse!important;flex-wrap:wrap-reverse!important}.flex-sm-fill{-ms-flex:1 1 auto!important;flex:1 1 auto!important}.flex-sm-grow-0{-ms-flex-positive:0!important;flex-grow:0!important}.flex-sm-grow-1{-ms-flex-positive:1!important;flex-grow:1!important}.flex-sm-shrink-0{-ms-flex-negative:0!important;flex-shrink:0!important}.flex-sm-shrink-1{-ms-flex-negative:1!important;flex-shrink:1!important}.justify-content-sm-start{-ms-flex-pack:start!important;justify-content:flex-start!important}.justify-content-sm-end{-ms-flex-pack:end!important;justify-content:flex-end!important}.justify-content-sm-center{-ms-flex-pack:center!important;justify-content:center!important}.justify-content-sm-between{-ms-flex-pack:justify!important;justify-content:space-between!important}.justify-content-sm-around{-ms-flex-pack:distribute!important;justify-content:space-around!important}.align-items-sm-start{-ms-flex-align:start!important;align-items:flex-start!important}.align-items-sm-end{-ms-flex-align:end!important;align-items:flex-end!important}.align-items-sm-center{-ms-flex-align:center!important;align-items:center!important}.align-items-sm-baseline{-ms-flex-align:baseline!important;align-items:baseline!important}.align-items-sm-stretch{-ms-flex-align:stretch!important;align-items:stretch!important}.align-content-sm-start{-ms-flex-line-pack:start!important;align-content:flex-start!important}.align-content-sm-end{-ms-flex-line-pack:end!important;align-content:flex-end!important}.align-content-sm-center{-ms-flex-line-pack:center!important;align-content:center!important}.align-content-sm-between{-ms-flex-line-pack:justify!important;align-content:space-between!important}.align-content-sm-around{-ms-flex-line-pack:distribute!important;align-content:space-around!important}.align-content-sm-stretch{-ms-flex-line-pack:stretch!important;align-content:stretch!important}.align-self-sm-auto{-ms-flex-item-align:auto!important;align-self:auto!important}.align-self-sm-start{-ms-flex-item-align:start!important;align-self:flex-start!important}.align-self-sm-end{-ms-flex-item-align:end!important;align-self:flex-end!important}.align-self-sm-center{-ms-flex-item-align:center!important;align-self:center!important}.align-self-sm-baseline{-ms-flex-item-align:baseline!important;align-self:baseline!important}.align-self-sm-stretch{-ms-flex-item-align:stretch!important;align-self:stretch!important}}@media (min-width:768px){.flex-md-row{-ms-flex-direction:row!important;flex-direction:row!important}.flex-md-column{-ms-flex-direction:column!important;flex-direction:column!important}.flex-md-row-reverse{-ms-flex-direction:row-reverse!important;flex-direction:row-reverse!important}.flex-md-column-reverse{-ms-flex-direction:column-reverse!important;flex-direction:column-reverse!important}.flex-md-wrap{-ms-flex-wrap:wrap!important;flex-wrap:wrap!important}.flex-md-nowrap{-ms-flex-wrap:nowrap!important;flex-wrap:nowrap!important}.flex-md-wrap-reverse{-ms-flex-wrap:wrap-reverse!important;flex-wrap:wrap-reverse!important}.flex-md-fill{-ms-flex:1 1 auto!important;flex:1 1 auto!important}.flex-md-grow-0{-ms-flex-positive:0!important;flex-grow:0!important}.flex-md-grow-1{-ms-flex-positive:1!important;flex-grow:1!important}.flex-md-shrink-0{-ms-flex-negative:0!important;flex-shrink:0!important}.flex-md-shrink-1{-ms-flex-negative:1!important;flex-shrink:1!important}.justify-content-md-start{-ms-flex-pack:start!important;justify-content:flex-start!important}.justify-content-md-end{-ms-flex-pack:end!important;justify-content:flex-end!important}.justify-content-md-center{-ms-flex-pack:center!important;justify-content:center!important}.justify-content-md-between{-ms-flex-pack:justify!important;justify-content:space-between!important}.justify-content-md-around{-ms-flex-pack:distribute!important;justify-content:space-around!important}.align-items-md-start{-ms-flex-align:start!important;align-items:flex-start!important}.align-items-md-end{-ms-flex-align:end!important;align-items:flex-end!important}.align-items-md-center{-ms-flex-align:center!important;align-items:center!important}.align-items-md-baseline{-ms-flex-align:baseline!important;align-items:baseline!important}.align-items-md-stretch{-ms-flex-align:stretch!important;align-items:stretch!important}.align-content-md-start{-ms-flex-line-pack:start!important;align-content:flex-start!important}.align-content-md-end{-ms-flex-line-pack:end!important;align-content:flex-end!important}.align-content-md-center{-ms-flex-line-pack:center!important;align-content:center!important}.align-content-md-between{-ms-flex-line-pack:justify!important;align-content:space-between!important}.align-content-md-around{-ms-flex-line-pack:distribute!important;align-content:space-around!important}.align-content-md-stretch{-ms-flex-line-pack:stretch!important;align-content:stretch!important}.align-self-md-auto{-ms-flex-item-align:auto!important;align-self:auto!important}.align-self-md-start{-ms-flex-item-align:start!important;align-self:flex-start!important}.align-self-md-end{-ms-flex-item-align:end!important;align-self:flex-end!important}.align-self-md-center{-ms-flex-item-align:center!important;align-self:center!important}.align-self-md-baseline{-ms-flex-item-align:baseline!important;align-self:baseline!important}.align-self-md-stretch{-ms-flex-item-align:stretch!important;align-self:stretch!important}}@media (min-width:992px){.flex-lg-row{-ms-flex-direction:row!important;flex-direction:row!important}.flex-lg-column{-ms-flex-direction:column!important;flex-direction:column!important}.flex-lg-row-reverse{-ms-flex-direction:row-reverse!important;flex-direction:row-reverse!important}.flex-lg-column-reverse{-ms-flex-direction:column-reverse!important;flex-direction:column-reverse!important}.flex-lg-wrap{-ms-flex-wrap:wrap!important;flex-wrap:wrap!important}.flex-lg-nowrap{-ms-flex-wrap:nowrap!important;flex-wrap:nowrap!important}.flex-lg-wrap-reverse{-ms-flex-wrap:wrap-reverse!important;flex-wrap:wrap-reverse!important}.flex-lg-fill{-ms-flex:1 1 auto!important;flex:1 1 auto!important}.flex-lg-grow-0{-ms-flex-positive:0!important;flex-grow:0!important}.flex-lg-grow-1{-ms-flex-positive:1!important;flex-grow:1!important}.flex-lg-shrink-0{-ms-flex-negative:0!important;flex-shrink:0!important}.flex-lg-shrink-1{-ms-flex-negative:1!important;flex-shrink:1!important}.justify-content-lg-start{-ms-flex-pack:start!important;justify-content:flex-start!important}.justify-content-lg-end{-ms-flex-pack:end!important;justify-content:flex-end!important}.justify-content-lg-center{-ms-flex-pack:center!important;justify-content:center!important}.justify-content-lg-between{-ms-flex-pack:justify!important;justify-content:space-between!important}.justify-content-lg-around{-ms-flex-pack:distribute!important;justify-content:space-around!important}.align-items-lg-start{-ms-flex-align:start!important;align-items:flex-start!important}.align-items-lg-end{-ms-flex-align:end!important;align-items:flex-end!important}.align-items-lg-center{-ms-flex-align:center!important;align-items:center!important}.align-items-lg-baseline{-ms-flex-align:baseline!important;align-items:baseline!important}.align-items-lg-stretch{-ms-flex-align:stretch!important;align-items:stretch!important}.align-content-lg-start{-ms-flex-line-pack:start!important;align-content:flex-start!important}.align-content-lg-end{-ms-flex-line-pack:end!important;align-content:flex-end!important}.align-content-lg-center{-ms-flex-line-pack:center!important;align-content:center!important}.align-content-lg-between{-ms-flex-line-pack:justify!important;align-content:space-between!important}.align-content-lg-around{-ms-flex-line-pack:distribute!important;align-content:space-around!important}.align-content-lg-stretch{-ms-flex-line-pack:stretch!important;align-content:stretch!important}.align-self-lg-auto{-ms-flex-item-align:auto!important;align-self:auto!important}.align-self-lg-start{-ms-flex-item-align:start!important;align-self:flex-start!important}.align-self-lg-end{-ms-flex-item-align:end!important;align-self:flex-end!important}.align-self-lg-center{-ms-flex-item-align:center!important;align-self:center!important}.align-self-lg-baseline{-ms-flex-item-align:baseline!important;align-self:baseline!important}.align-self-lg-stretch{-ms-flex-item-align:stretch!important;align-self:stretch!important}}@media (min-width:1200px){.flex-xl-row{-ms-flex-direction:row!important;flex-direction:row!important}.flex-xl-column{-ms-flex-direction:column!important;flex-direction:column!important}.flex-xl-row-reverse{-ms-flex-direction:row-reverse!important;flex-direction:row-reverse!important}.flex-xl-column-reverse{-ms-flex-direction:column-reverse!important;flex-direction:column-reverse!important}.flex-xl-wrap{-ms-flex-wrap:wrap!important;flex-wrap:wrap!important}.flex-xl-nowrap{-ms-flex-wrap:nowrap!important;flex-wrap:nowrap!important}.flex-xl-wrap-reverse{-ms-flex-wrap:wrap-reverse!important;flex-wrap:wrap-reverse!important}.flex-xl-fill{-ms-flex:1 1 auto!important;flex:1 1 auto!important}.flex-xl-grow-0{-ms-flex-positive:0!important;flex-grow:0!important}.flex-xl-grow-1{-ms-flex-positive:1!important;flex-grow:1!important}.flex-xl-shrink-0{-ms-flex-negative:0!important;flex-shrink:0!important}.flex-xl-shrink-1{-ms-flex-negative:1!important;flex-shrink:1!important}.justify-content-xl-start{-ms-flex-pack:start!important;justify-content:flex-start!important}.justify-content-xl-end{-ms-flex-pack:end!important;justify-content:flex-end!important}.justify-content-xl-center{-ms-flex-pack:center!important;justify-content:center!important}.justify-content-xl-between{-ms-flex-pack:justify!important;justify-content:space-between!important}.justify-content-xl-around{-ms-flex-pack:distribute!important;justify-content:space-around!important}.align-items-xl-start{-ms-flex-align:start!important;align-items:flex-start!important}.align-items-xl-end{-ms-flex-align:end!important;align-items:flex-end!important}.align-items-xl-center{-ms-flex-align:center!important;align-items:center!important}.align-items-xl-baseline{-ms-flex-align:baseline!important;align-items:baseline!important}.align-items-xl-stretch{-ms-flex-align:stretch!important;align-items:stretch!important}.align-content-xl-start{-ms-flex-line-pack:start!important;align-content:flex-start!important}.align-content-xl-end{-ms-flex-line-pack:end!important;align-content:flex-end!important}.align-content-xl-center{-ms-flex-line-pack:center!important;align-content:center!important}.align-content-xl-between{-ms-flex-line-pack:justify!important;align-content:space-between!important}.align-content-xl-around{-ms-flex-line-pack:distribute!important;align-content:space-around!important}.align-content-xl-stretch{-ms-flex-line-pack:stretch!important;align-content:stretch!important}.align-self-xl-auto{-ms-flex-item-align:auto!important;align-self:auto!important}.align-self-xl-start{-ms-flex-item-align:start!important;align-self:flex-start!important}.align-self-xl-end{-ms-flex-item-align:end!important;align-self:flex-end!important}.align-self-xl-center{-ms-flex-item-align:center!important;align-self:center!important}.align-self-xl-baseline{-ms-flex-item-align:baseline!important;align-self:baseline!important}.align-self-xl-stretch{-ms-flex-item-align:stretch!important;align-self:stretch!important}}.float-left{float:left!important}.float-right{float:right!important}.float-none{float:none!important}@media (min-width:576px){.float-sm-left{float:left!important}.float-sm-right{float:right!important}.float-sm-none{float:none!important}}@media (min-width:768px){.float-md-left{float:left!important}.float-md-right{float:right!important}.float-md-none{float:none!important}}@media (min-width:992px){.float-lg-left{float:left!important}.float-lg-right{float:right!important}.float-lg-none{float:none!important}}@media (min-width:1200px){.float-xl-left{float:left!important}.float-xl-right{float:right!important}.float-xl-none{float:none!important}}.overflow-auto{overflow:auto!important}.overflow-hidden{overflow:hidden!important}.position-static{position:static!important}.position-relative{position:relative!important}.position-absolute{position:absolute!important}.position-fixed{position:fixed!important}.position-sticky{position:-webkit-sticky!important;position:sticky!important}.fixed-top{position:fixed;top:0;right:0;left:0;z-index:1030}.fixed-bottom{position:fixed;right:0;bottom:0;left:0;z-index:1030}@supports ((position:-webkit-sticky) or (position:sticky)){.sticky-top{position:-webkit-sticky;position:sticky;top:0;z-index:1020}}.sr-only{position:absolute;width:1px;height:1px;padding:0;overflow:hidden;clip:rect(0,0,0,0);white-space:nowrap;border:0}.sr-only-focusable:active,.sr-only-focusable:focus{position:static;width:auto;height:auto;overflow:visible;clip:auto;white-space:normal}.shadow-sm{box-shadow:0 .125rem .25rem rgba(0,0,0,.075)!important}.shadow{box-shadow:0 .5rem 1rem rgba(0,0,0,.15)!important}.shadow-lg{box-shadow:0 1rem 3rem rgba(0,0,0,.175)!important}.shadow-none{box-shadow:none!important}.w-25{width:25%!important}.w-50{width:50%!important}.w-75{width:75%!important}.w-100{width:100%!important}.w-auto{width:auto!important}.h-25{height:25%!important}.h-50{height:50%!important}.h-75{height:75%!important}.h-100{height:100%!important}.h-auto{height:auto!important}.mw-100{max-width:100%!important}.mh-100{max-height:100%!important}.min-vw-100{min-width:100vw!important}.min-vh-100{min-height:100vh!important}.vw-100{width:100vw!important}.vh-100{height:100vh!important}.stretched-link::after{position:absolute;top:0;right:0;bottom:0;left:0;z-index:1;pointer-events:auto;content:"";background-color:rgba(0,0,0,0)}.m-0{margin:0!important}.mt-0,.my-0{margin-top:0!important}.mr-0,.mx-0{margin-right:0!important}.mb-0,.my-0{margin-bottom:0!important}.ml-0,.mx-0{margin-left:0!important}.m-1{margin:.25rem!important}.mt-1,.my-1{margin-top:.25rem!important}.mr-1,.mx-1{margin-right:.25rem!important}.mb-1,.my-1{margin-bottom:.25rem!important}.ml-1,.mx-1{margin-left:.25rem!important}.m-2{margin:.5rem!important}.mt-2,.my-2{margin-top:.5rem!important}.mr-2,.mx-2{margin-right:.5rem!important}.mb-2,.my-2{margin-bottom:.5rem!important}.ml-2,.mx-2{margin-left:.5rem!important}.m-3{margin:1rem!important}.mt-3,.my-3{margin-top:1rem!important}.mr-3,.mx-3{margin-right:1rem!important}.mb-3,.my-3{margin-bottom:1rem!important}.ml-3,.mx-3{margin-left:1rem!important}.m-4{margin:1.5rem!important}.mt-4,.my-4{margin-top:1.5rem!important}.mr-4,.mx-4{margin-right:1.5rem!important}.mb-4,.my-4{margin-bottom:1.5rem!important}.ml-4,.mx-4{margin-left:1.5rem!important}.m-5{margin:3rem!important}.mt-5,.my-5{margin-top:3rem!important}.mr-5,.mx-5{margin-right:3rem!important}.mb-5,.my-5{margin-bottom:3rem!important}.ml-5,.mx-5{margin-left:3rem!important}.p-0{padding:0!important}.pt-0,.py-0{padding-top:0!important}.pr-0,.px-0{padding-right:0!important}.pb-0,.py-0{padding-bottom:0!important}.pl-0,.px-0{padding-left:0!important}.p-1{padding:.25rem!important}.pt-1,.py-1{padding-top:.25rem!important}.pr-1,.px-1{padding-right:.25rem!important}.pb-1,.py-1{padding-bottom:.25rem!important}.pl-1,.px-1{padding-left:.25rem!important}.p-2{padding:.5rem!important}.pt-2,.py-2{padding-top:.5rem!important}.pr-2,.px-2{padding-right:.5rem!important}.pb-2,.py-2{padding-bottom:.5rem!important}.pl-2,.px-2{padding-left:.5rem!important}.p-3{padding:1rem!important}.pt-3,.py-3{padding-top:1rem!important}.pr-3,.px-3{padding-right:1rem!important}.pb-3,.py-3{padding-bottom:1rem!important}.pl-3,.px-3{padding-left:1rem!important}.p-4{padding:1.5rem!important}.pt-4,.py-4{padding-top:1.5rem!important}.pr-4,.px-4{padding-right:1.5rem!important}.pb-4,.py-4{padding-bottom:1.5rem!important}.pl-4,.px-4{padding-left:1.5rem!important}.p-5{padding:3rem!important}.pt-5,.py-5{padding-top:3rem!important}.pr-5,.px-5{padding-right:3rem!important}.pb-5,.py-5{padding-bottom:3rem!important}.pl-5,.px-5{padding-left:3rem!important}.m-n1{margin:-.25rem!important}.mt-n1,.my-n1{margin-top:-.25rem!important}.mr-n1,.mx-n1{margin-right:-.25rem!important}.mb-n1,.my-n1{margin-bottom:-.25rem!important}.ml-n1,.mx-n1{margin-left:-.25rem!important}.m-n2{margin:-.5rem!important}.mt-n2,.my-n2{margin-top:-.5rem!important}.mr-n2,.mx-n2{margin-right:-.5rem!important}.mb-n2,.my-n2{margin-bottom:-.5rem!important}.ml-n2,.mx-n2{margin-left:-.5rem!important}.m-n3{margin:-1rem!important}.mt-n3,.my-n3{margin-top:-1rem!important}.mr-n3,.mx-n3{margin-right:-1rem!important}.mb-n3,.my-n3{margin-bottom:-1rem!important}.ml-n3,.mx-n3{margin-left:-1rem!important}.m-n4{margin:-1.5rem!important}.mt-n4,.my-n4{margin-top:-1.5rem!important}.mr-n4,.mx-n4{margin-right:-1.5rem!important}.mb-n4,.my-n4{margin-bottom:-1.5rem!important}.ml-n4,.mx-n4{margin-left:-1.5rem!important}.m-n5{margin:-3rem!important}.mt-n5,.my-n5{margin-top:-3rem!important}.mr-n5,.mx-n5{margin-right:-3rem!important}.mb-n5,.my-n5{margin-bottom:-3rem!important}.ml-n5,.mx-n5{margin-left:-3rem!important}.m-auto{margin:auto!important}.mt-auto,.my-auto{margin-top:auto!important}.mr-auto,.mx-auto{margin-right:auto!important}.mb-auto,.my-auto{margin-bottom:auto!important}.ml-auto,.mx-auto{margin-left:auto!important}@media (min-width:576px){.m-sm-0{margin:0!important}.mt-sm-0,.my-sm-0{margin-top:0!important}.mr-sm-0,.mx-sm-0{margin-right:0!important}.mb-sm-0,.my-sm-0{margin-bottom:0!important}.ml-sm-0,.mx-sm-0{margin-left:0!important}.m-sm-1{margin:.25rem!important}.mt-sm-1,.my-sm-1{margin-top:.25rem!important}.mr-sm-1,.mx-sm-1{margin-right:.25rem!important}.mb-sm-1,.my-sm-1{margin-bottom:.25rem!important}.ml-sm-1,.mx-sm-1{margin-left:.25rem!important}.m-sm-2{margin:.5rem!important}.mt-sm-2,.my-sm-2{margin-top:.5rem!important}.mr-sm-2,.mx-sm-2{margin-right:.5rem!important}.mb-sm-2,.my-sm-2{margin-bottom:.5rem!important}.ml-sm-2,.mx-sm-2{margin-left:.5rem!important}.m-sm-3{margin:1rem!important}.mt-sm-3,.my-sm-3{margin-top:1rem!important}.mr-sm-3,.mx-sm-3{margin-right:1rem!important}.mb-sm-3,.my-sm-3{margin-bottom:1rem!important}.ml-sm-3,.mx-sm-3{margin-left:1rem!important}.m-sm-4{margin:1.5rem!important}.mt-sm-4,.my-sm-4{margin-top:1.5rem!important}.mr-sm-4,.mx-sm-4{margin-right:1.5rem!important}.mb-sm-4,.my-sm-4{margin-bottom:1.5rem!important}.ml-sm-4,.mx-sm-4{margin-left:1.5rem!important}.m-sm-5{margin:3rem!important}.mt-sm-5,.my-sm-5{margin-top:3rem!important}.mr-sm-5,.mx-sm-5{margin-right:3rem!important}.mb-sm-5,.my-sm-5{margin-bottom:3rem!important}.ml-sm-5,.mx-sm-5{margin-left:3rem!important}.p-sm-0{padding:0!important}.pt-sm-0,.py-sm-0{padding-top:0!important}.pr-sm-0,.px-sm-0{padding-right:0!important}.pb-sm-0,.py-sm-0{padding-bottom:0!important}.pl-sm-0,.px-sm-0{padding-left:0!important}.p-sm-1{padding:.25rem!important}.pt-sm-1,.py-sm-1{padding-top:.25rem!important}.pr-sm-1,.px-sm-1{padding-right:.25rem!important}.pb-sm-1,.py-sm-1{padding-bottom:.25rem!important}.pl-sm-1,.px-sm-1{padding-left:.25rem!important}.p-sm-2{padding:.5rem!important}.pt-sm-2,.py-sm-2{padding-top:.5rem!important}.pr-sm-2,.px-sm-2{padding-right:.5rem!important}.pb-sm-2,.py-sm-2{padding-bottom:.5rem!important}.pl-sm-2,.px-sm-2{padding-left:.5rem!important}.p-sm-3{padding:1rem!important}.pt-sm-3,.py-sm-3{padding-top:1rem!important}.pr-sm-3,.px-sm-3{padding-right:1rem!important}.pb-sm-3,.py-sm-3{padding-bottom:1rem!important}.pl-sm-3,.px-sm-3{padding-left:1rem!important}.p-sm-4{padding:1.5rem!important}.pt-sm-4,.py-sm-4{padding-top:1.5rem!important}.pr-sm-4,.px-sm-4{padding-right:1.5rem!important}.pb-sm-4,.py-sm-4{padding-bottom:1.5rem!important}.pl-sm-4,.px-sm-4{padding-left:1.5rem!important}.p-sm-5{padding:3rem!important}.pt-sm-5,.py-sm-5{padding-top:3rem!important}.pr-sm-5,.px-sm-5{padding-right:3rem!important}.pb-sm-5,.py-sm-5{padding-bottom:3rem!important}.pl-sm-5,.px-sm-5{padding-left:3rem!important}.m-sm-n1{margin:-.25rem!important}.mt-sm-n1,.my-sm-n1{margin-top:-.25rem!important}.mr-sm-n1,.mx-sm-n1{margin-right:-.25rem!important}.mb-sm-n1,.my-sm-n1{margin-bottom:-.25rem!important}.ml-sm-n1,.mx-sm-n1{margin-left:-.25rem!important}.m-sm-n2{margin:-.5rem!important}.mt-sm-n2,.my-sm-n2{margin-top:-.5rem!important}.mr-sm-n2,.mx-sm-n2{margin-right:-.5rem!important}.mb-sm-n2,.my-sm-n2{margin-bottom:-.5rem!important}.ml-sm-n2,.mx-sm-n2{margin-left:-.5rem!important}.m-sm-n3{margin:-1rem!important}.mt-sm-n3,.my-sm-n3{margin-top:-1rem!important}.mr-sm-n3,.mx-sm-n3{margin-right:-1rem!important}.mb-sm-n3,.my-sm-n3{margin-bottom:-1rem!important}.ml-sm-n3,.mx-sm-n3{margin-left:-1rem!important}.m-sm-n4{margin:-1.5rem!important}.mt-sm-n4,.my-sm-n4{margin-top:-1.5rem!important}.mr-sm-n4,.mx-sm-n4{margin-right:-1.5rem!important}.mb-sm-n4,.my-sm-n4{margin-bottom:-1.5rem!important}.ml-sm-n4,.mx-sm-n4{margin-left:-1.5rem!important}.m-sm-n5{margin:-3rem!important}.mt-sm-n5,.my-sm-n5{margin-top:-3rem!important}.mr-sm-n5,.mx-sm-n5{margin-right:-3rem!important}.mb-sm-n5,.my-sm-n5{margin-bottom:-3rem!important}.ml-sm-n5,.mx-sm-n5{margin-left:-3rem!important}.m-sm-auto{margin:auto!important}.mt-sm-auto,.my-sm-auto{margin-top:auto!important}.mr-sm-auto,.mx-sm-auto{margin-right:auto!important}.mb-sm-auto,.my-sm-auto{margin-bottom:auto!important}.ml-sm-auto,.mx-sm-auto{margin-left:auto!important}}@media (min-width:768px){.m-md-0{margin:0!important}.mt-md-0,.my-md-0{margin-top:0!important}.mr-md-0,.mx-md-0{margin-right:0!important}.mb-md-0,.my-md-0{margin-bottom:0!important}.ml-md-0,.mx-md-0{margin-left:0!important}.m-md-1{margin:.25rem!important}.mt-md-1,.my-md-1{margin-top:.25rem!important}.mr-md-1,.mx-md-1{margin-right:.25rem!important}.mb-md-1,.my-md-1{margin-bottom:.25rem!important}.ml-md-1,.mx-md-1{margin-left:.25rem!important}.m-md-2{margin:.5rem!important}.mt-md-2,.my-md-2{margin-top:.5rem!important}.mr-md-2,.mx-md-2{margin-right:.5rem!important}.mb-md-2,.my-md-2{margin-bottom:.5rem!important}.ml-md-2,.mx-md-2{margin-left:.5rem!important}.m-md-3{margin:1rem!important}.mt-md-3,.my-md-3{margin-top:1rem!important}.mr-md-3,.mx-md-3{margin-right:1rem!important}.mb-md-3,.my-md-3{margin-bottom:1rem!important}.ml-md-3,.mx-md-3{margin-left:1rem!important}.m-md-4{margin:1.5rem!important}.mt-md-4,.my-md-4{margin-top:1.5rem!important}.mr-md-4,.mx-md-4{margin-right:1.5rem!important}.mb-md-4,.my-md-4{margin-bottom:1.5rem!important}.ml-md-4,.mx-md-4{margin-left:1.5rem!important}.m-md-5{margin:3rem!important}.mt-md-5,.my-md-5{margin-top:3rem!important}.mr-md-5,.mx-md-5{margin-right:3rem!important}.mb-md-5,.my-md-5{margin-bottom:3rem!important}.ml-md-5,.mx-md-5{margin-left:3rem!important}.p-md-0{padding:0!important}.pt-md-0,.py-md-0{padding-top:0!important}.pr-md-0,.px-md-0{padding-right:0!important}.pb-md-0,.py-md-0{padding-bottom:0!important}.pl-md-0,.px-md-0{padding-left:0!important}.p-md-1{padding:.25rem!important}.pt-md-1,.py-md-1{padding-top:.25rem!important}.pr-md-1,.px-md-1{padding-right:.25rem!important}.pb-md-1,.py-md-1{padding-bottom:.25rem!important}.pl-md-1,.px-md-1{padding-left:.25rem!important}.p-md-2{padding:.5rem!important}.pt-md-2,.py-md-2{padding-top:.5rem!important}.pr-md-2,.px-md-2{padding-right:.5rem!important}.pb-md-2,.py-md-2{padding-bottom:.5rem!important}.pl-md-2,.px-md-2{padding-left:.5rem!important}.p-md-3{padding:1rem!important}.pt-md-3,.py-md-3{padding-top:1rem!important}.pr-md-3,.px-md-3{padding-right:1rem!important}.pb-md-3,.py-md-3{padding-bottom:1rem!important}.pl-md-3,.px-md-3{padding-left:1rem!important}.p-md-4{padding:1.5rem!important}.pt-md-4,.py-md-4{padding-top:1.5rem!important}.pr-md-4,.px-md-4{padding-right:1.5rem!important}.pb-md-4,.py-md-4{padding-bottom:1.5rem!important}.pl-md-4,.px-md-4{padding-left:1.5rem!important}.p-md-5{padding:3rem!important}.pt-md-5,.py-md-5{padding-top:3rem!important}.pr-md-5,.px-md-5{padding-right:3rem!important}.pb-md-5,.py-md-5{padding-bottom:3rem!important}.pl-md-5,.px-md-5{padding-left:3rem!important}.m-md-n1{margin:-.25rem!important}.mt-md-n1,.my-md-n1{margin-top:-.25rem!important}.mr-md-n1,.mx-md-n1{margin-right:-.25rem!important}.mb-md-n1,.my-md-n1{margin-bottom:-.25rem!important}.ml-md-n1,.mx-md-n1{margin-left:-.25rem!important}.m-md-n2{margin:-.5rem!important}.mt-md-n2,.my-md-n2{margin-top:-.5rem!important}.mr-md-n2,.mx-md-n2{margin-right:-.5rem!important}.mb-md-n2,.my-md-n2{margin-bottom:-.5rem!important}.ml-md-n2,.mx-md-n2{margin-left:-.5rem!important}.m-md-n3{margin:-1rem!important}.mt-md-n3,.my-md-n3{margin-top:-1rem!important}.mr-md-n3,.mx-md-n3{margin-right:-1rem!important}.mb-md-n3,.my-md-n3{margin-bottom:-1rem!important}.ml-md-n3,.mx-md-n3{margin-left:-1rem!important}.m-md-n4{margin:-1.5rem!important}.mt-md-n4,.my-md-n4{margin-top:-1.5rem!important}.mr-md-n4,.mx-md-n4{margin-right:-1.5rem!important}.mb-md-n4,.my-md-n4{margin-bottom:-1.5rem!important}.ml-md-n4,.mx-md-n4{margin-left:-1.5rem!important}.m-md-n5{margin:-3rem!important}.mt-md-n5,.my-md-n5{margin-top:-3rem!important}.mr-md-n5,.mx-md-n5{margin-right:-3rem!important}.mb-md-n5,.my-md-n5{margin-bottom:-3rem!important}.ml-md-n5,.mx-md-n5{margin-left:-3rem!important}.m-md-auto{margin:auto!important}.mt-md-auto,.my-md-auto{margin-top:auto!important}.mr-md-auto,.mx-md-auto{margin-right:auto!important}.mb-md-auto,.my-md-auto{margin-bottom:auto!important}.ml-md-auto,.mx-md-auto{margin-left:auto!important}}@media (min-width:992px){.m-lg-0{margin:0!important}.mt-lg-0,.my-lg-0{margin-top:0!important}.mr-lg-0,.mx-lg-0{margin-right:0!important}.mb-lg-0,.my-lg-0{margin-bottom:0!important}.ml-lg-0,.mx-lg-0{margin-left:0!important}.m-lg-1{margin:.25rem!important}.mt-lg-1,.my-lg-1{margin-top:.25rem!important}.mr-lg-1,.mx-lg-1{margin-right:.25rem!important}.mb-lg-1,.my-lg-1{margin-bottom:.25rem!important}.ml-lg-1,.mx-lg-1{margin-left:.25rem!important}.m-lg-2{margin:.5rem!important}.mt-lg-2,.my-lg-2{margin-top:.5rem!important}.mr-lg-2,.mx-lg-2{margin-right:.5rem!important}.mb-lg-2,.my-lg-2{margin-bottom:.5rem!important}.ml-lg-2,.mx-lg-2{margin-left:.5rem!important}.m-lg-3{margin:1rem!important}.mt-lg-3,.my-lg-3{margin-top:1rem!important}.mr-lg-3,.mx-lg-3{margin-right:1rem!important}.mb-lg-3,.my-lg-3{margin-bottom:1rem!important}.ml-lg-3,.mx-lg-3{margin-left:1rem!important}.m-lg-4{margin:1.5rem!important}.mt-lg-4,.my-lg-4{margin-top:1.5rem!important}.mr-lg-4,.mx-lg-4{margin-right:1.5rem!important}.mb-lg-4,.my-lg-4{margin-bottom:1.5rem!important}.ml-lg-4,.mx-lg-4{margin-left:1.5rem!important}.m-lg-5{margin:3rem!important}.mt-lg-5,.my-lg-5{margin-top:3rem!important}.mr-lg-5,.mx-lg-5{margin-right:3rem!important}.mb-lg-5,.my-lg-5{margin-bottom:3rem!important}.ml-lg-5,.mx-lg-5{margin-left:3rem!important}.p-lg-0{padding:0!important}.pt-lg-0,.py-lg-0{padding-top:0!important}.pr-lg-0,.px-lg-0{padding-right:0!important}.pb-lg-0,.py-lg-0{padding-bottom:0!important}.pl-lg-0,.px-lg-0{padding-left:0!important}.p-lg-1{padding:.25rem!important}.pt-lg-1,.py-lg-1{padding-top:.25rem!important}.pr-lg-1,.px-lg-1{padding-right:.25rem!important}.pb-lg-1,.py-lg-1{padding-bottom:.25rem!important}.pl-lg-1,.px-lg-1{padding-left:.25rem!important}.p-lg-2{padding:.5rem!important}.pt-lg-2,.py-lg-2{padding-top:.5rem!important}.pr-lg-2,.px-lg-2{padding-right:.5rem!important}.pb-lg-2,.py-lg-2{padding-bottom:.5rem!important}.pl-lg-2,.px-lg-2{padding-left:.5rem!important}.p-lg-3{padding:1rem!important}.pt-lg-3,.py-lg-3{padding-top:1rem!important}.pr-lg-3,.px-lg-3{padding-right:1rem!important}.pb-lg-3,.py-lg-3{padding-bottom:1rem!important}.pl-lg-3,.px-lg-3{padding-left:1rem!important}.p-lg-4{padding:1.5rem!important}.pt-lg-4,.py-lg-4{padding-top:1.5rem!important}.pr-lg-4,.px-lg-4{padding-right:1.5rem!important}.pb-lg-4,.py-lg-4{padding-bottom:1.5rem!important}.pl-lg-4,.px-lg-4{padding-left:1.5rem!important}.p-lg-5{padding:3rem!important}.pt-lg-5,.py-lg-5{padding-top:3rem!important}.pr-lg-5,.px-lg-5{padding-right:3rem!important}.pb-lg-5,.py-lg-5{padding-bottom:3rem!important}.pl-lg-5,.px-lg-5{padding-left:3rem!important}.m-lg-n1{margin:-.25rem!important}.mt-lg-n1,.my-lg-n1{margin-top:-.25rem!important}.mr-lg-n1,.mx-lg-n1{margin-right:-.25rem!important}.mb-lg-n1,.my-lg-n1{margin-bottom:-.25rem!important}.ml-lg-n1,.mx-lg-n1{margin-left:-.25rem!important}.m-lg-n2{margin:-.5rem!important}.mt-lg-n2,.my-lg-n2{margin-top:-.5rem!important}.mr-lg-n2,.mx-lg-n2{margin-right:-.5rem!important}.mb-lg-n2,.my-lg-n2{margin-bottom:-.5rem!important}.ml-lg-n2,.mx-lg-n2{margin-left:-.5rem!important}.m-lg-n3{margin:-1rem!important}.mt-lg-n3,.my-lg-n3{margin-top:-1rem!important}.mr-lg-n3,.mx-lg-n3{margin-right:-1rem!important}.mb-lg-n3,.my-lg-n3{margin-bottom:-1rem!important}.ml-lg-n3,.mx-lg-n3{margin-left:-1rem!important}.m-lg-n4{margin:-1.5rem!important}.mt-lg-n4,.my-lg-n4{margin-top:-1.5rem!important}.mr-lg-n4,.mx-lg-n4{margin-right:-1.5rem!important}.mb-lg-n4,.my-lg-n4{margin-bottom:-1.5rem!important}.ml-lg-n4,.mx-lg-n4{margin-left:-1.5rem!important}.m-lg-n5{margin:-3rem!important}.mt-lg-n5,.my-lg-n5{margin-top:-3rem!important}.mr-lg-n5,.mx-lg-n5{margin-right:-3rem!important}.mb-lg-n5,.my-lg-n5{margin-bottom:-3rem!important}.ml-lg-n5,.mx-lg-n5{margin-left:-3rem!important}.m-lg-auto{margin:auto!important}.mt-lg-auto,.my-lg-auto{margin-top:auto!important}.mr-lg-auto,.mx-lg-auto{margin-right:auto!important}.mb-lg-auto,.my-lg-auto{margin-bottom:auto!important}.ml-lg-auto,.mx-lg-auto{margin-left:auto!important}}@media (min-width:1200px){.m-xl-0{margin:0!important}.mt-xl-0,.my-xl-0{margin-top:0!important}.mr-xl-0,.mx-xl-0{margin-right:0!important}.mb-xl-0,.my-xl-0{margin-bottom:0!important}.ml-xl-0,.mx-xl-0{margin-left:0!important}.m-xl-1{margin:.25rem!important}.mt-xl-1,.my-xl-1{margin-top:.25rem!important}.mr-xl-1,.mx-xl-1{margin-right:.25rem!important}.mb-xl-1,.my-xl-1{margin-bottom:.25rem!important}.ml-xl-1,.mx-xl-1{margin-left:.25rem!important}.m-xl-2{margin:.5rem!important}.mt-xl-2,.my-xl-2{margin-top:.5rem!important}.mr-xl-2,.mx-xl-2{margin-right:.5rem!important}.mb-xl-2,.my-xl-2{margin-bottom:.5rem!important}.ml-xl-2,.mx-xl-2{margin-left:.5rem!important}.m-xl-3{margin:1rem!important}.mt-xl-3,.my-xl-3{margin-top:1rem!important}.mr-xl-3,.mx-xl-3{margin-right:1rem!important}.mb-xl-3,.my-xl-3{margin-bottom:1rem!important}.ml-xl-3,.mx-xl-3{margin-left:1rem!important}.m-xl-4{margin:1.5rem!important}.mt-xl-4,.my-xl-4{margin-top:1.5rem!important}.mr-xl-4,.mx-xl-4{margin-right:1.5rem!important}.mb-xl-4,.my-xl-4{margin-bottom:1.5rem!important}.ml-xl-4,.mx-xl-4{margin-left:1.5rem!important}.m-xl-5{margin:3rem!important}.mt-xl-5,.my-xl-5{margin-top:3rem!important}.mr-xl-5,.mx-xl-5{margin-right:3rem!important}.mb-xl-5,.my-xl-5{margin-bottom:3rem!important}.ml-xl-5,.mx-xl-5{margin-left:3rem!important}.p-xl-0{padding:0!important}.pt-xl-0,.py-xl-0{padding-top:0!important}.pr-xl-0,.px-xl-0{padding-right:0!important}.pb-xl-0,.py-xl-0{padding-bottom:0!important}.pl-xl-0,.px-xl-0{padding-left:0!important}.p-xl-1{padding:.25rem!important}.pt-xl-1,.py-xl-1{padding-top:.25rem!important}.pr-xl-1,.px-xl-1{padding-right:.25rem!important}.pb-xl-1,.py-xl-1{padding-bottom:.25rem!important}.pl-xl-1,.px-xl-1{padding-left:.25rem!important}.p-xl-2{padding:.5rem!important}.pt-xl-2,.py-xl-2{padding-top:.5rem!important}.pr-xl-2,.px-xl-2{padding-right:.5rem!important}.pb-xl-2,.py-xl-2{padding-bottom:.5rem!important}.pl-xl-2,.px-xl-2{padding-left:.5rem!important}.p-xl-3{padding:1rem!important}.pt-xl-3,.py-xl-3{padding-top:1rem!important}.pr-xl-3,.px-xl-3{padding-right:1rem!important}.pb-xl-3,.py-xl-3{padding-bottom:1rem!important}.pl-xl-3,.px-xl-3{padding-left:1rem!important}.p-xl-4{padding:1.5rem!important}.pt-xl-4,.py-xl-4{padding-top:1.5rem!important}.pr-xl-4,.px-xl-4{padding-right:1.5rem!important}.pb-xl-4,.py-xl-4{padding-bottom:1.5rem!important}.pl-xl-4,.px-xl-4{padding-left:1.5rem!important}.p-xl-5{padding:3rem!important}.pt-xl-5,.py-xl-5{padding-top:3rem!important}.pr-xl-5,.px-xl-5{padding-right:3rem!important}.pb-xl-5,.py-xl-5{padding-bottom:3rem!important}.pl-xl-5,.px-xl-5{padding-left:3rem!important}.m-xl-n1{margin:-.25rem!important}.mt-xl-n1,.my-xl-n1{margin-top:-.25rem!important}.mr-xl-n1,.mx-xl-n1{margin-right:-.25rem!important}.mb-xl-n1,.my-xl-n1{margin-bottom:-.25rem!important}.ml-xl-n1,.mx-xl-n1{margin-left:-.25rem!important}.m-xl-n2{margin:-.5rem!important}.mt-xl-n2,.my-xl-n2{margin-top:-.5rem!important}.mr-xl-n2,.mx-xl-n2{margin-right:-.5rem!important}.mb-xl-n2,.my-xl-n2{margin-bottom:-.5rem!important}.ml-xl-n2,.mx-xl-n2{margin-left:-.5rem!important}.m-xl-n3{margin:-1rem!important}.mt-xl-n3,.my-xl-n3{margin-top:-1rem!important}.mr-xl-n3,.mx-xl-n3{margin-right:-1rem!important}.mb-xl-n3,.my-xl-n3{margin-bottom:-1rem!important}.ml-xl-n3,.mx-xl-n3{margin-left:-1rem!important}.m-xl-n4{margin:-1.5rem!important}.mt-xl-n4,.my-xl-n4{margin-top:-1.5rem!important}.mr-xl-n4,.mx-xl-n4{margin-right:-1.5rem!important}.mb-xl-n4,.my-xl-n4{margin-bottom:-1.5rem!important}.ml-xl-n4,.mx-xl-n4{margin-left:-1.5rem!important}.m-xl-n5{margin:-3rem!important}.mt-xl-n5,.my-xl-n5{margin-top:-3rem!important}.mr-xl-n5,.mx-xl-n5{margin-right:-3rem!important}.mb-xl-n5,.my-xl-n5{margin-bottom:-3rem!important}.ml-xl-n5,.mx-xl-n5{margin-left:-3rem!important}.m-xl-auto{margin:auto!important}.mt-xl-auto,.my-xl-auto{margin-top:auto!important}.mr-xl-auto,.mx-xl-auto{margin-right:auto!important}.mb-xl-auto,.my-xl-auto{margin-bottom:auto!important}.ml-xl-auto,.mx-xl-auto{margin-left:auto!important}}.text-monospace{font-family:SFMono-Regular,Menlo,Monaco,Consolas,"Liberation Mono","Courier New",monospace!important}.text-justify{text-align:justify!important}.text-wrap{white-space:normal!important}.text-nowrap{white-space:nowrap!important}.text-truncate{overflow:hidden;text-overflow:ellipsis;white-space:nowrap}.text-left{text-align:left!important}.text-right{text-align:right!important}.text-center{text-align:center!important}@media (min-width:576px){.text-sm-left{text-align:left!important}.text-sm-right{text-align:right!important}.text-sm-center{text-align:center!important}}@media (min-width:768px){.text-md-left{text-align:left!important}.text-md-right{text-align:right!important}.text-md-center{text-align:center!important}}@media (min-width:992px){.text-lg-left{text-align:left!important}.text-lg-right{text-align:right!important}.text-lg-center{text-align:center!important}}@media (min-width:1200px){.text-xl-left{text-align:left!important}.text-xl-right{text-align:right!important}.text-xl-center{text-align:center!important}}.text-lowercase{text-transform:lowercase!important}.text-uppercase{text-transform:uppercase!important}.text-capitalize{text-transform:capitalize!important}.font-weight-light{font-weight:300!important}.font-weight-lighter{font-weight:lighter!important}.font-weight-normal{font-weight:400!important}.font-weight-bold{font-weight:700!important}.font-weight-bolder{font-weight:bolder!important}.font-italic{font-style:italic!important}.text-white{color:#fff!important}.text-primary{color:#007bff!important}a.text-primary:focus,a.text-primary:hover{color:#0056b3!important}.text-secondary{color:#6c757d!important}a.text-secondary:focus,a.text-secondary:hover{color:#494f54!important}.text-success{color:#28a745!important}a.text-success:focus,a.text-success:hover{color:#19692c!important}.text-info{color:#17a2b8!important}a.text-info:focus,a.text-info:hover{color:#0f6674!important}.text-warning{color:#ffc107!important}a.text-warning:focus,a.text-warning:hover{color:#ba8b00!important}.text-danger{color:#dc3545!important}a.text-danger:focus,a.text-danger:hover{color:#a71d2a!important}.text-light{color:#f8f9fa!important}a.text-light:focus,a.text-light:hover{color:#cbd3da!important}.text-dark{color:#343a40!important}a.text-dark:focus,a.text-dark:hover{color:#121416!important}.text-body{color:#212529!important}.text-muted{color:#6c757d!important}.text-black-50{color:rgba(0,0,0,.5)!important}.text-white-50{color:rgba(255,255,255,.5)!important}.text-hide{font:0/0 a;color:transparent;text-shadow:none;background-color:transparent;border:0}.text-decoration-none{text-decoration:none!important}.text-break{word-break:break-word!important;overflow-wrap:break-word!important}.text-reset{color:inherit!important}.visible{visibility:visible!important}.invisible{visibility:hidden!important}@media print{*,::after,::before{text-shadow:none!important;box-shadow:none!important}a:not(.btn){text-decoration:underline}abbr[title]::after{content:" (" attr(title) ")"}pre{white-space:pre-wrap!important}blockquote,pre{border:1px solid #adb5bd;page-break-inside:avoid}thead{display:table-header-group}img,tr{page-break-inside:avoid}h2,h3,p{orphans:3;widows:3}h2,h3{page-break-after:avoid}@page{size:a3}body{min-width:992px!important}.container{min-width:992px!important}.navbar{display:none}.badge{border:1px solid #000}.table{border-collapse:collapse!important}.table td,.table th{background-color:#fff!important}.table-bordered td,.table-bordered th{border:1px solid #dee2e6!important}.table-dark{color:inherit}.table-dark tbody+tbody,.table-dark td,.table-dark th,.table-dark thead th{border-color:#dee2e6}.table .thead-dark th{color:inherit;border-color:#dee2e6}}
\ No newline at end of file
diff --git a/doc/themes/scikit-learn-modern/static/js/details-permalink.js b/doc/themes/scikit-learn-modern/static/js/details-permalink.js
deleted file mode 100644
index 62392e9836f64..0000000000000
--- a/doc/themes/scikit-learn-modern/static/js/details-permalink.js
+++ /dev/null
@@ -1,47 +0,0 @@
-// Function to create permalink into <details> elements to be able to link them
-// The assumption is that such a block will be defined as follows:
-//     <details id="summary-anchor">
-//     <summary class="btn btn-light">
-//     Some title
-//     <span class="tooltiptext">Click for more details</span>
-//     <a class="headerlink" href="#summary-anchor" title="Permalink to this heading">¶</a>
-//     </summary>
-//     <div class="card">
-//     Some details
-//     </div>
-//     </details>
-// We seek to replace `#summary-anchor` with a unique identifier based on the
-// summary text.
-// This syntax is defined in `doc/conf.py` in the `rst_prolog` variable.
-function updateIdAndHrefBasedOnSummaryText() {
-    var allDetailsElements = document.querySelectorAll('details');
-    // Counter to store the duplicated summary text to add it as a suffix in the
-    // anchor ID
-    var anchorIDCounters = {};
-
-    allDetailsElements.forEach(function (detailsElement) {
-        // Get the <summary> element within the current <details>
-        var summaryElement = detailsElement.querySelector('summary');
-
-        // The ID uses the first line, lowercased, and spaces replaced with dashes
-        var anchorID = summaryElement.textContent.trim().split("\n")[0].replace(/\s+/g, '-').toLowerCase();
-
-        // Suffix the anchor ID with a counter if it already exists
-        if (anchorIDCounters[anchorID]) {
-            anchorIDCounters[anchorID] += 1;
-            anchorID = anchorID + '-' + anchorIDCounters[anchorID];
-        } else {
-            anchorIDCounters[anchorID] = 1;
-        }
-
-        detailsElement.setAttribute('id', anchorID);
-
-        var anchorElement = summaryElement.querySelector('a.headerlink');
-        anchorElement.setAttribute('href', '#' + anchorID);
-    });
-}
-
-// Add an event listener to execute the function when the page is loaded
-document.addEventListener('DOMContentLoaded', function () {
-    updateIdAndHrefBasedOnSummaryText();
-});
diff --git a/doc/themes/scikit-learn-modern/static/js/vendor/bootstrap.min.js b/doc/themes/scikit-learn-modern/static/js/vendor/bootstrap.min.js
deleted file mode 100644
index 4955aeec1142c..0000000000000
--- a/doc/themes/scikit-learn-modern/static/js/vendor/bootstrap.min.js
+++ /dev/null
@@ -1,6 +0,0 @@
-/*!
-  * Bootstrap v4.3.1 (https://getbootstrap.com/)
-  * Copyright 2011-2019 The Bootstrap Authors (https://github.com/twbs/bootstrap/graphs/contributors)
-  * Licensed under MIT (https://github.com/twbs/bootstrap/blob/master/LICENSE)
-  */
-!function(t,e){"object"==typeof exports&&"undefined"!=typeof module?e(exports,require("jquery"),require("popper.js")):"function"==typeof define&&define.amd?define(["exports","jquery","popper.js"],e):e((t=t||self).bootstrap={},t.jQuery,t.Popper)}(this,function(t,g,u){"use strict";function i(t,e){for(var n=0;n<e.length;n++){var i=e[n];i.enumerable=i.enumerable||!1,i.configurable=!0,"value"in i&&(i.writable=!0),Object.defineProperty(t,i.key,i)}}function s(t,e,n){return e&&i(t.prototype,e),n&&i(t,n),t}function l(o){for(var t=1;t<arguments.length;t++){var r=null!=arguments[t]?arguments[t]:{},e=Object.keys(r);"function"==typeof Object.getOwnPropertySymbols&&(e=e.concat(Object.getOwnPropertySymbols(r).filter(function(t){return Object.getOwnPropertyDescriptor(r,t).enumerable}))),e.forEach(function(t){var e,n,i;e=o,i=r[n=t],n in e?Object.defineProperty(e,n,{value:i,enumerable:!0,configurable:!0,writable:!0}):e[n]=i})}return o}g=g&&g.hasOwnProperty("default")?g.default:g,u=u&&u.hasOwnProperty("default")?u.default:u;var e="transitionend";function n(t){var e=this,n=!1;return g(this).one(_.TRANSITION_END,function(){n=!0}),setTimeout(function(){n||_.triggerTransitionEnd(e)},t),this}var _={TRANSITION_END:"bsTransitionEnd",getUID:function(t){for(;t+=~~(1e6*Math.random()),document.getElementById(t););return t},getSelectorFromElement:function(t){var e=t.getAttribute("data-target");if(!e||"#"===e){var n=t.getAttribute("href");e=n&&"#"!==n?n.trim():""}try{return document.querySelector(e)?e:null}catch(t){return null}},getTransitionDurationFromElement:function(t){if(!t)return 0;var e=g(t).css("transition-duration"),n=g(t).css("transition-delay"),i=parseFloat(e),o=parseFloat(n);return i||o?(e=e.split(",")[0],n=n.split(",")[0],1e3*(parseFloat(e)+parseFloat(n))):0},reflow:function(t){return t.offsetHeight},triggerTransitionEnd:function(t){g(t).trigger(e)},supportsTransitionEnd:function(){return Boolean(e)},isElement:function(t){return(t[0]||t).nodeType},typeCheckConfig:function(t,e,n){for(var i in n)if(Object.prototype.hasOwnProperty.call(n,i)){var o=n[i],r=e[i],s=r&&_.isElement(r)?"element":(a=r,{}.toString.call(a).match(/\s([a-z]+)/i)[1].toLowerCase());if(!new RegExp(o).test(s))throw new Error(t.toUpperCase()+': Option "'+i+'" provided type "'+s+'" but expected type "'+o+'".')}var a},findShadowRoot:function(t){if(!document.documentElement.attachShadow)return null;if("function"!=typeof t.getRootNode)return t instanceof ShadowRoot?t:t.parentNode?_.findShadowRoot(t.parentNode):null;var e=t.getRootNode();return e instanceof ShadowRoot?e:null}};g.fn.emulateTransitionEnd=n,g.event.special[_.TRANSITION_END]={bindType:e,delegateType:e,handle:function(t){if(g(t.target).is(this))return t.handleObj.handler.apply(this,arguments)}};var o="alert",r="bs.alert",a="."+r,c=g.fn[o],h={CLOSE:"close"+a,CLOSED:"closed"+a,CLICK_DATA_API:"click"+a+".data-api"},f="alert",d="fade",m="show",p=function(){function i(t){this._element=t}var t=i.prototype;return t.close=function(t){var e=this._element;t&&(e=this._getRootElement(t)),this._triggerCloseEvent(e).isDefaultPrevented()||this._removeElement(e)},t.dispose=function(){g.removeData(this._element,r),this._element=null},t._getRootElement=function(t){var e=_.getSelectorFromElement(t),n=!1;return e&&(n=document.querySelector(e)),n||(n=g(t).closest("."+f)[0]),n},t._triggerCloseEvent=function(t){var e=g.Event(h.CLOSE);return g(t).trigger(e),e},t._removeElement=function(e){var n=this;if(g(e).removeClass(m),g(e).hasClass(d)){var t=_.getTransitionDurationFromElement(e);g(e).one(_.TRANSITION_END,function(t){return n._destroyElement(e,t)}).emulateTransitionEnd(t)}else this._destroyElement(e)},t._destroyElement=function(t){g(t).detach().trigger(h.CLOSED).remove()},i._jQueryInterface=function(n){return this.each(function(){var t=g(this),e=t.data(r);e||(e=new i(this),t.data(r,e)),"close"===n&&e[n](this)})},i._handleDismiss=function(e){return function(t){t&&t.preventDefault(),e.close(this)}},s(i,null,[{key:"VERSION",get:function(){return"4.3.1"}}]),i}();g(document).on(h.CLICK_DATA_API,'[data-dismiss="alert"]',p._handleDismiss(new p)),g.fn[o]=p._jQueryInterface,g.fn[o].Constructor=p,g.fn[o].noConflict=function(){return g.fn[o]=c,p._jQueryInterface};var v="button",y="bs.button",E="."+y,C=".data-api",T=g.fn[v],S="active",b="btn",I="focus",D='[data-toggle^="button"]',w='[data-toggle="buttons"]',A='input:not([type="hidden"])',N=".active",O=".btn",k={CLICK_DATA_API:"click"+E+C,FOCUS_BLUR_DATA_API:"focus"+E+C+" blur"+E+C},P=function(){function n(t){this._element=t}var t=n.prototype;return t.toggle=function(){var t=!0,e=!0,n=g(this._element).closest(w)[0];if(n){var i=this._element.querySelector(A);if(i){if("radio"===i.type)if(i.checked&&this._element.classList.contains(S))t=!1;else{var o=n.querySelector(N);o&&g(o).removeClass(S)}if(t){if(i.hasAttribute("disabled")||n.hasAttribute("disabled")||i.classList.contains("disabled")||n.classList.contains("disabled"))return;i.checked=!this._element.classList.contains(S),g(i).trigger("change")}i.focus(),e=!1}}e&&this._element.setAttribute("aria-pressed",!this._element.classList.contains(S)),t&&g(this._element).toggleClass(S)},t.dispose=function(){g.removeData(this._element,y),this._element=null},n._jQueryInterface=function(e){return this.each(function(){var t=g(this).data(y);t||(t=new n(this),g(this).data(y,t)),"toggle"===e&&t[e]()})},s(n,null,[{key:"VERSION",get:function(){return"4.3.1"}}]),n}();g(document).on(k.CLICK_DATA_API,D,function(t){t.preventDefault();var e=t.target;g(e).hasClass(b)||(e=g(e).closest(O)),P._jQueryInterface.call(g(e),"toggle")}).on(k.FOCUS_BLUR_DATA_API,D,function(t){var e=g(t.target).closest(O)[0];g(e).toggleClass(I,/^focus(in)?$/.test(t.type))}),g.fn[v]=P._jQueryInterface,g.fn[v].Constructor=P,g.fn[v].noConflict=function(){return g.fn[v]=T,P._jQueryInterface};var L="carousel",j="bs.carousel",H="."+j,R=".data-api",x=g.fn[L],F={interval:5e3,keyboard:!0,slide:!1,pause:"hover",wrap:!0,touch:!0},U={interval:"(number|boolean)",keyboard:"boolean",slide:"(boolean|string)",pause:"(string|boolean)",wrap:"boolean",touch:"boolean"},W="next",q="prev",M="left",K="right",Q={SLIDE:"slide"+H,SLID:"slid"+H,KEYDOWN:"keydown"+H,MOUSEENTER:"mouseenter"+H,MOUSELEAVE:"mouseleave"+H,TOUCHSTART:"touchstart"+H,TOUCHMOVE:"touchmove"+H,TOUCHEND:"touchend"+H,POINTERDOWN:"pointerdown"+H,POINTERUP:"pointerup"+H,DRAG_START:"dragstart"+H,LOAD_DATA_API:"load"+H+R,CLICK_DATA_API:"click"+H+R},B="carousel",V="active",Y="slide",z="carousel-item-right",X="carousel-item-left",$="carousel-item-next",G="carousel-item-prev",J="pointer-event",Z=".active",tt=".active.carousel-item",et=".carousel-item",nt=".carousel-item img",it=".carousel-item-next, .carousel-item-prev",ot=".carousel-indicators",rt="[data-slide], [data-slide-to]",st='[data-ride="carousel"]',at={TOUCH:"touch",PEN:"pen"},lt=function(){function r(t,e){this._items=null,this._interval=null,this._activeElement=null,this._isPaused=!1,this._isSliding=!1,this.touchTimeout=null,this.touchStartX=0,this.touchDeltaX=0,this._config=this._getConfig(e),this._element=t,this._indicatorsElement=this._element.querySelector(ot),this._touchSupported="ontouchstart"in document.documentElement||0<navigator.maxTouchPoints,this._pointerEvent=Boolean(window.PointerEvent||window.MSPointerEvent),this._addEventListeners()}var t=r.prototype;return t.next=function(){this._isSliding||this._slide(W)},t.nextWhenVisible=function(){!document.hidden&&g(this._element).is(":visible")&&"hidden"!==g(this._element).css("visibility")&&this.next()},t.prev=function(){this._isSliding||this._slide(q)},t.pause=function(t){t||(this._isPaused=!0),this._element.querySelector(it)&&(_.triggerTransitionEnd(this._element),this.cycle(!0)),clearInterval(this._interval),this._interval=null},t.cycle=function(t){t||(this._isPaused=!1),this._interval&&(clearInterval(this._interval),this._interval=null),this._config.interval&&!this._isPaused&&(this._interval=setInterval((document.visibilityState?this.nextWhenVisible:this.next).bind(this),this._config.interval))},t.to=function(t){var e=this;this._activeElement=this._element.querySelector(tt);var n=this._getItemIndex(this._activeElement);if(!(t>this._items.length-1||t<0))if(this._isSliding)g(this._element).one(Q.SLID,function(){return e.to(t)});else{if(n===t)return this.pause(),void this.cycle();var i=n<t?W:q;this._slide(i,this._items[t])}},t.dispose=function(){g(this._element).off(H),g.removeData(this._element,j),this._items=null,this._config=null,this._element=null,this._interval=null,this._isPaused=null,this._isSliding=null,this._activeElement=null,this._indicatorsElement=null},t._getConfig=function(t){return t=l({},F,t),_.typeCheckConfig(L,t,U),t},t._handleSwipe=function(){var t=Math.abs(this.touchDeltaX);if(!(t<=40)){var e=t/this.touchDeltaX;0<e&&this.prev(),e<0&&this.next()}},t._addEventListeners=function(){var e=this;this._config.keyboard&&g(this._element).on(Q.KEYDOWN,function(t){return e._keydown(t)}),"hover"===this._config.pause&&g(this._element).on(Q.MOUSEENTER,function(t){return e.pause(t)}).on(Q.MOUSELEAVE,function(t){return e.cycle(t)}),this._config.touch&&this._addTouchEventListeners()},t._addTouchEventListeners=function(){var n=this;if(this._touchSupported){var e=function(t){n._pointerEvent&&at[t.originalEvent.pointerType.toUpperCase()]?n.touchStartX=t.originalEvent.clientX:n._pointerEvent||(n.touchStartX=t.originalEvent.touches[0].clientX)},i=function(t){n._pointerEvent&&at[t.originalEvent.pointerType.toUpperCase()]&&(n.touchDeltaX=t.originalEvent.clientX-n.touchStartX),n._handleSwipe(),"hover"===n._config.pause&&(n.pause(),n.touchTimeout&&clearTimeout(n.touchTimeout),n.touchTimeout=setTimeout(function(t){return n.cycle(t)},500+n._config.interval))};g(this._element.querySelectorAll(nt)).on(Q.DRAG_START,function(t){return t.preventDefault()}),this._pointerEvent?(g(this._element).on(Q.POINTERDOWN,function(t){return e(t)}),g(this._element).on(Q.POINTERUP,function(t){return i(t)}),this._element.classList.add(J)):(g(this._element).on(Q.TOUCHSTART,function(t){return e(t)}),g(this._element).on(Q.TOUCHMOVE,function(t){var e;(e=t).originalEvent.touches&&1<e.originalEvent.touches.length?n.touchDeltaX=0:n.touchDeltaX=e.originalEvent.touches[0].clientX-n.touchStartX}),g(this._element).on(Q.TOUCHEND,function(t){return i(t)}))}},t._keydown=function(t){if(!/input|textarea/i.test(t.target.tagName))switch(t.which){case 37:t.preventDefault(),this.prev();break;case 39:t.preventDefault(),this.next()}},t._getItemIndex=function(t){return this._items=t&&t.parentNode?[].slice.call(t.parentNode.querySelectorAll(et)):[],this._items.indexOf(t)},t._getItemByDirection=function(t,e){var n=t===W,i=t===q,o=this._getItemIndex(e),r=this._items.length-1;if((i&&0===o||n&&o===r)&&!this._config.wrap)return e;var s=(o+(t===q?-1:1))%this._items.length;return-1===s?this._items[this._items.length-1]:this._items[s]},t._triggerSlideEvent=function(t,e){var n=this._getItemIndex(t),i=this._getItemIndex(this._element.querySelector(tt)),o=g.Event(Q.SLIDE,{relatedTarget:t,direction:e,from:i,to:n});return g(this._element).trigger(o),o},t._setActiveIndicatorElement=function(t){if(this._indicatorsElement){var e=[].slice.call(this._indicatorsElement.querySelectorAll(Z));g(e).removeClass(V);var n=this._indicatorsElement.children[this._getItemIndex(t)];n&&g(n).addClass(V)}},t._slide=function(t,e){var n,i,o,r=this,s=this._element.querySelector(tt),a=this._getItemIndex(s),l=e||s&&this._getItemByDirection(t,s),c=this._getItemIndex(l),h=Boolean(this._interval);if(o=t===W?(n=X,i=$,M):(n=z,i=G,K),l&&g(l).hasClass(V))this._isSliding=!1;else if(!this._triggerSlideEvent(l,o).isDefaultPrevented()&&s&&l){this._isSliding=!0,h&&this.pause(),this._setActiveIndicatorElement(l);var u=g.Event(Q.SLID,{relatedTarget:l,direction:o,from:a,to:c});if(g(this._element).hasClass(Y)){g(l).addClass(i),_.reflow(l),g(s).addClass(n),g(l).addClass(n);var f=parseInt(l.getAttribute("data-interval"),10);this._config.interval=f?(this._config.defaultInterval=this._config.defaultInterval||this._config.interval,f):this._config.defaultInterval||this._config.interval;var d=_.getTransitionDurationFromElement(s);g(s).one(_.TRANSITION_END,function(){g(l).removeClass(n+" "+i).addClass(V),g(s).removeClass(V+" "+i+" "+n),r._isSliding=!1,setTimeout(function(){return g(r._element).trigger(u)},0)}).emulateTransitionEnd(d)}else g(s).removeClass(V),g(l).addClass(V),this._isSliding=!1,g(this._element).trigger(u);h&&this.cycle()}},r._jQueryInterface=function(i){return this.each(function(){var t=g(this).data(j),e=l({},F,g(this).data());"object"==typeof i&&(e=l({},e,i));var n="string"==typeof i?i:e.slide;if(t||(t=new r(this,e),g(this).data(j,t)),"number"==typeof i)t.to(i);else if("string"==typeof n){if("undefined"==typeof t[n])throw new TypeError('No method named "'+n+'"');t[n]()}else e.interval&&e.ride&&(t.pause(),t.cycle())})},r._dataApiClickHandler=function(t){var e=_.getSelectorFromElement(this);if(e){var n=g(e)[0];if(n&&g(n).hasClass(B)){var i=l({},g(n).data(),g(this).data()),o=this.getAttribute("data-slide-to");o&&(i.interval=!1),r._jQueryInterface.call(g(n),i),o&&g(n).data(j).to(o),t.preventDefault()}}},s(r,null,[{key:"VERSION",get:function(){return"4.3.1"}},{key:"Default",get:function(){return F}}]),r}();g(document).on(Q.CLICK_DATA_API,rt,lt._dataApiClickHandler),g(window).on(Q.LOAD_DATA_API,function(){for(var t=[].slice.call(document.querySelectorAll(st)),e=0,n=t.length;e<n;e++){var i=g(t[e]);lt._jQueryInterface.call(i,i.data())}}),g.fn[L]=lt._jQueryInterface,g.fn[L].Constructor=lt,g.fn[L].noConflict=function(){return g.fn[L]=x,lt._jQueryInterface};var ct="collapse",ht="bs.collapse",ut="."+ht,ft=g.fn[ct],dt={toggle:!0,parent:""},gt={toggle:"boolean",parent:"(string|element)"},_t={SHOW:"show"+ut,SHOWN:"shown"+ut,HIDE:"hide"+ut,HIDDEN:"hidden"+ut,CLICK_DATA_API:"click"+ut+".data-api"},mt="show",pt="collapse",vt="collapsing",yt="collapsed",Et="width",Ct="height",Tt=".show, .collapsing",St='[data-toggle="collapse"]',bt=function(){function a(e,t){this._isTransitioning=!1,this._element=e,this._config=this._getConfig(t),this._triggerArray=[].slice.call(document.querySelectorAll('[data-toggle="collapse"][href="#'+e.id+'"],[data-toggle="collapse"][data-target="#'+e.id+'"]'));for(var n=[].slice.call(document.querySelectorAll(St)),i=0,o=n.length;i<o;i++){var r=n[i],s=_.getSelectorFromElement(r),a=[].slice.call(document.querySelectorAll(s)).filter(function(t){return t===e});null!==s&&0<a.length&&(this._selector=s,this._triggerArray.push(r))}this._parent=this._config.parent?this._getParent():null,this._config.parent||this._addAriaAndCollapsedClass(this._element,this._triggerArray),this._config.toggle&&this.toggle()}var t=a.prototype;return t.toggle=function(){g(this._element).hasClass(mt)?this.hide():this.show()},t.show=function(){var t,e,n=this;if(!this._isTransitioning&&!g(this._element).hasClass(mt)&&(this._parent&&0===(t=[].slice.call(this._parent.querySelectorAll(Tt)).filter(function(t){return"string"==typeof n._config.parent?t.getAttribute("data-parent")===n._config.parent:t.classList.contains(pt)})).length&&(t=null),!(t&&(e=g(t).not(this._selector).data(ht))&&e._isTransitioning))){var i=g.Event(_t.SHOW);if(g(this._element).trigger(i),!i.isDefaultPrevented()){t&&(a._jQueryInterface.call(g(t).not(this._selector),"hide"),e||g(t).data(ht,null));var o=this._getDimension();g(this._element).removeClass(pt).addClass(vt),this._element.style[o]=0,this._triggerArray.length&&g(this._triggerArray).removeClass(yt).attr("aria-expanded",!0),this.setTransitioning(!0);var r="scroll"+(o[0].toUpperCase()+o.slice(1)),s=_.getTransitionDurationFromElement(this._element);g(this._element).one(_.TRANSITION_END,function(){g(n._element).removeClass(vt).addClass(pt).addClass(mt),n._element.style[o]="",n.setTransitioning(!1),g(n._element).trigger(_t.SHOWN)}).emulateTransitionEnd(s),this._element.style[o]=this._element[r]+"px"}}},t.hide=function(){var t=this;if(!this._isTransitioning&&g(this._element).hasClass(mt)){var e=g.Event(_t.HIDE);if(g(this._element).trigger(e),!e.isDefaultPrevented()){var n=this._getDimension();this._element.style[n]=this._element.getBoundingClientRect()[n]+"px",_.reflow(this._element),g(this._element).addClass(vt).removeClass(pt).removeClass(mt);var i=this._triggerArray.length;if(0<i)for(var o=0;o<i;o++){var r=this._triggerArray[o],s=_.getSelectorFromElement(r);if(null!==s)g([].slice.call(document.querySelectorAll(s))).hasClass(mt)||g(r).addClass(yt).attr("aria-expanded",!1)}this.setTransitioning(!0);this._element.style[n]="";var a=_.getTransitionDurationFromElement(this._element);g(this._element).one(_.TRANSITION_END,function(){t.setTransitioning(!1),g(t._element).removeClass(vt).addClass(pt).trigger(_t.HIDDEN)}).emulateTransitionEnd(a)}}},t.setTransitioning=function(t){this._isTransitioning=t},t.dispose=function(){g.removeData(this._element,ht),this._config=null,this._parent=null,this._element=null,this._triggerArray=null,this._isTransitioning=null},t._getConfig=function(t){return(t=l({},dt,t)).toggle=Boolean(t.toggle),_.typeCheckConfig(ct,t,gt),t},t._getDimension=function(){return g(this._element).hasClass(Et)?Et:Ct},t._getParent=function(){var t,n=this;_.isElement(this._config.parent)?(t=this._config.parent,"undefined"!=typeof this._config.parent.jquery&&(t=this._config.parent[0])):t=document.querySelector(this._config.parent);var e='[data-toggle="collapse"][data-parent="'+this._config.parent+'"]',i=[].slice.call(t.querySelectorAll(e));return g(i).each(function(t,e){n._addAriaAndCollapsedClass(a._getTargetFromElement(e),[e])}),t},t._addAriaAndCollapsedClass=function(t,e){var n=g(t).hasClass(mt);e.length&&g(e).toggleClass(yt,!n).attr("aria-expanded",n)},a._getTargetFromElement=function(t){var e=_.getSelectorFromElement(t);return e?document.querySelector(e):null},a._jQueryInterface=function(i){return this.each(function(){var t=g(this),e=t.data(ht),n=l({},dt,t.data(),"object"==typeof i&&i?i:{});if(!e&&n.toggle&&/show|hide/.test(i)&&(n.toggle=!1),e||(e=new a(this,n),t.data(ht,e)),"string"==typeof i){if("undefined"==typeof e[i])throw new TypeError('No method named "'+i+'"');e[i]()}})},s(a,null,[{key:"VERSION",get:function(){return"4.3.1"}},{key:"Default",get:function(){return dt}}]),a}();g(document).on(_t.CLICK_DATA_API,St,function(t){"A"===t.currentTarget.tagName&&t.preventDefault();var n=g(this),e=_.getSelectorFromElement(this),i=[].slice.call(document.querySelectorAll(e));g(i).each(function(){var t=g(this),e=t.data(ht)?"toggle":n.data();bt._jQueryInterface.call(t,e)})}),g.fn[ct]=bt._jQueryInterface,g.fn[ct].Constructor=bt,g.fn[ct].noConflict=function(){return g.fn[ct]=ft,bt._jQueryInterface};var It="dropdown",Dt="bs.dropdown",wt="."+Dt,At=".data-api",Nt=g.fn[It],Ot=new RegExp("38|40|27"),kt={HIDE:"hide"+wt,HIDDEN:"hidden"+wt,SHOW:"show"+wt,SHOWN:"shown"+wt,CLICK:"click"+wt,CLICK_DATA_API:"click"+wt+At,KEYDOWN_DATA_API:"keydown"+wt+At,KEYUP_DATA_API:"keyup"+wt+At},Pt="disabled",Lt="show",jt="dropup",Ht="dropright",Rt="dropleft",xt="dropdown-menu-right",Ft="position-static",Ut='[data-toggle="dropdown"]',Wt=".dropdown form",qt=".dropdown-menu",Mt=".navbar-nav",Kt=".dropdown-menu .dropdown-item:not(.disabled):not(:disabled)",Qt="top-start",Bt="top-end",Vt="bottom-start",Yt="bottom-end",zt="right-start",Xt="left-start",$t={offset:0,flip:!0,boundary:"scrollParent",reference:"toggle",display:"dynamic"},Gt={offset:"(number|string|function)",flip:"boolean",boundary:"(string|element)",reference:"(string|element)",display:"string"},Jt=function(){function c(t,e){this._element=t,this._popper=null,this._config=this._getConfig(e),this._menu=this._getMenuElement(),this._inNavbar=this._detectNavbar(),this._addEventListeners()}var t=c.prototype;return t.toggle=function(){if(!this._element.disabled&&!g(this._element).hasClass(Pt)){var t=c._getParentFromElement(this._element),e=g(this._menu).hasClass(Lt);if(c._clearMenus(),!e){var n={relatedTarget:this._element},i=g.Event(kt.SHOW,n);if(g(t).trigger(i),!i.isDefaultPrevented()){if(!this._inNavbar){if("undefined"==typeof u)throw new TypeError("Bootstrap's dropdowns require Popper.js (https://popper.js.org/)");var o=this._element;"parent"===this._config.reference?o=t:_.isElement(this._config.reference)&&(o=this._config.reference,"undefined"!=typeof this._config.reference.jquery&&(o=this._config.reference[0])),"scrollParent"!==this._config.boundary&&g(t).addClass(Ft),this._popper=new u(o,this._menu,this._getPopperConfig())}"ontouchstart"in document.documentElement&&0===g(t).closest(Mt).length&&g(document.body).children().on("mouseover",null,g.noop),this._element.focus(),this._element.setAttribute("aria-expanded",!0),g(this._menu).toggleClass(Lt),g(t).toggleClass(Lt).trigger(g.Event(kt.SHOWN,n))}}}},t.show=function(){if(!(this._element.disabled||g(this._element).hasClass(Pt)||g(this._menu).hasClass(Lt))){var t={relatedTarget:this._element},e=g.Event(kt.SHOW,t),n=c._getParentFromElement(this._element);g(n).trigger(e),e.isDefaultPrevented()||(g(this._menu).toggleClass(Lt),g(n).toggleClass(Lt).trigger(g.Event(kt.SHOWN,t)))}},t.hide=function(){if(!this._element.disabled&&!g(this._element).hasClass(Pt)&&g(this._menu).hasClass(Lt)){var t={relatedTarget:this._element},e=g.Event(kt.HIDE,t),n=c._getParentFromElement(this._element);g(n).trigger(e),e.isDefaultPrevented()||(g(this._menu).toggleClass(Lt),g(n).toggleClass(Lt).trigger(g.Event(kt.HIDDEN,t)))}},t.dispose=function(){g.removeData(this._element,Dt),g(this._element).off(wt),this._element=null,(this._menu=null)!==this._popper&&(this._popper.destroy(),this._popper=null)},t.update=function(){this._inNavbar=this._detectNavbar(),null!==this._popper&&this._popper.scheduleUpdate()},t._addEventListeners=function(){var e=this;g(this._element).on(kt.CLICK,function(t){t.preventDefault(),t.stopPropagation(),e.toggle()})},t._getConfig=function(t){return t=l({},this.constructor.Default,g(this._element).data(),t),_.typeCheckConfig(It,t,this.constructor.DefaultType),t},t._getMenuElement=function(){if(!this._menu){var t=c._getParentFromElement(this._element);t&&(this._menu=t.querySelector(qt))}return this._menu},t._getPlacement=function(){var t=g(this._element.parentNode),e=Vt;return t.hasClass(jt)?(e=Qt,g(this._menu).hasClass(xt)&&(e=Bt)):t.hasClass(Ht)?e=zt:t.hasClass(Rt)?e=Xt:g(this._menu).hasClass(xt)&&(e=Yt),e},t._detectNavbar=function(){return 0<g(this._element).closest(".navbar").length},t._getOffset=function(){var e=this,t={};return"function"==typeof this._config.offset?t.fn=function(t){return t.offsets=l({},t.offsets,e._config.offset(t.offsets,e._element)||{}),t}:t.offset=this._config.offset,t},t._getPopperConfig=function(){var t={placement:this._getPlacement(),modifiers:{offset:this._getOffset(),flip:{enabled:this._config.flip},preventOverflow:{boundariesElement:this._config.boundary}}};return"static"===this._config.display&&(t.modifiers.applyStyle={enabled:!1}),t},c._jQueryInterface=function(e){return this.each(function(){var t=g(this).data(Dt);if(t||(t=new c(this,"object"==typeof e?e:null),g(this).data(Dt,t)),"string"==typeof e){if("undefined"==typeof t[e])throw new TypeError('No method named "'+e+'"');t[e]()}})},c._clearMenus=function(t){if(!t||3!==t.which&&("keyup"!==t.type||9===t.which))for(var e=[].slice.call(document.querySelectorAll(Ut)),n=0,i=e.length;n<i;n++){var o=c._getParentFromElement(e[n]),r=g(e[n]).data(Dt),s={relatedTarget:e[n]};if(t&&"click"===t.type&&(s.clickEvent=t),r){var a=r._menu;if(g(o).hasClass(Lt)&&!(t&&("click"===t.type&&/input|textarea/i.test(t.target.tagName)||"keyup"===t.type&&9===t.which)&&g.contains(o,t.target))){var l=g.Event(kt.HIDE,s);g(o).trigger(l),l.isDefaultPrevented()||("ontouchstart"in document.documentElement&&g(document.body).children().off("mouseover",null,g.noop),e[n].setAttribute("aria-expanded","false"),g(a).removeClass(Lt),g(o).removeClass(Lt).trigger(g.Event(kt.HIDDEN,s)))}}}},c._getParentFromElement=function(t){var e,n=_.getSelectorFromElement(t);return n&&(e=document.querySelector(n)),e||t.parentNode},c._dataApiKeydownHandler=function(t){if((/input|textarea/i.test(t.target.tagName)?!(32===t.which||27!==t.which&&(40!==t.which&&38!==t.which||g(t.target).closest(qt).length)):Ot.test(t.which))&&(t.preventDefault(),t.stopPropagation(),!this.disabled&&!g(this).hasClass(Pt))){var e=c._getParentFromElement(this),n=g(e).hasClass(Lt);if(n&&(!n||27!==t.which&&32!==t.which)){var i=[].slice.call(e.querySelectorAll(Kt));if(0!==i.length){var o=i.indexOf(t.target);38===t.which&&0<o&&o--,40===t.which&&o<i.length-1&&o++,o<0&&(o=0),i[o].focus()}}else{if(27===t.which){var r=e.querySelector(Ut);g(r).trigger("focus")}g(this).trigger("click")}}},s(c,null,[{key:"VERSION",get:function(){return"4.3.1"}},{key:"Default",get:function(){return $t}},{key:"DefaultType",get:function(){return Gt}}]),c}();g(document).on(kt.KEYDOWN_DATA_API,Ut,Jt._dataApiKeydownHandler).on(kt.KEYDOWN_DATA_API,qt,Jt._dataApiKeydownHandler).on(kt.CLICK_DATA_API+" "+kt.KEYUP_DATA_API,Jt._clearMenus).on(kt.CLICK_DATA_API,Ut,function(t){t.preventDefault(),t.stopPropagation(),Jt._jQueryInterface.call(g(this),"toggle")}).on(kt.CLICK_DATA_API,Wt,function(t){t.stopPropagation()}),g.fn[It]=Jt._jQueryInterface,g.fn[It].Constructor=Jt,g.fn[It].noConflict=function(){return g.fn[It]=Nt,Jt._jQueryInterface};var Zt="modal",te="bs.modal",ee="."+te,ne=g.fn[Zt],ie={backdrop:!0,keyboard:!0,focus:!0,show:!0},oe={backdrop:"(boolean|string)",keyboard:"boolean",focus:"boolean",show:"boolean"},re={HIDE:"hide"+ee,HIDDEN:"hidden"+ee,SHOW:"show"+ee,SHOWN:"shown"+ee,FOCUSIN:"focusin"+ee,RESIZE:"resize"+ee,CLICK_DISMISS:"click.dismiss"+ee,KEYDOWN_DISMISS:"keydown.dismiss"+ee,MOUSEUP_DISMISS:"mouseup.dismiss"+ee,MOUSEDOWN_DISMISS:"mousedown.dismiss"+ee,CLICK_DATA_API:"click"+ee+".data-api"},se="modal-dialog-scrollable",ae="modal-scrollbar-measure",le="modal-backdrop",ce="modal-open",he="fade",ue="show",fe=".modal-dialog",de=".modal-body",ge='[data-toggle="modal"]',_e='[data-dismiss="modal"]',me=".fixed-top, .fixed-bottom, .is-fixed, .sticky-top",pe=".sticky-top",ve=function(){function o(t,e){this._config=this._getConfig(e),this._element=t,this._dialog=t.querySelector(fe),this._backdrop=null,this._isShown=!1,this._isBodyOverflowing=!1,this._ignoreBackdropClick=!1,this._isTransitioning=!1,this._scrollbarWidth=0}var t=o.prototype;return t.toggle=function(t){return this._isShown?this.hide():this.show(t)},t.show=function(t){var e=this;if(!this._isShown&&!this._isTransitioning){g(this._element).hasClass(he)&&(this._isTransitioning=!0);var n=g.Event(re.SHOW,{relatedTarget:t});g(this._element).trigger(n),this._isShown||n.isDefaultPrevented()||(this._isShown=!0,this._checkScrollbar(),this._setScrollbar(),this._adjustDialog(),this._setEscapeEvent(),this._setResizeEvent(),g(this._element).on(re.CLICK_DISMISS,_e,function(t){return e.hide(t)}),g(this._dialog).on(re.MOUSEDOWN_DISMISS,function(){g(e._element).one(re.MOUSEUP_DISMISS,function(t){g(t.target).is(e._element)&&(e._ignoreBackdropClick=!0)})}),this._showBackdrop(function(){return e._showElement(t)}))}},t.hide=function(t){var e=this;if(t&&t.preventDefault(),this._isShown&&!this._isTransitioning){var n=g.Event(re.HIDE);if(g(this._element).trigger(n),this._isShown&&!n.isDefaultPrevented()){this._isShown=!1;var i=g(this._element).hasClass(he);if(i&&(this._isTransitioning=!0),this._setEscapeEvent(),this._setResizeEvent(),g(document).off(re.FOCUSIN),g(this._element).removeClass(ue),g(this._element).off(re.CLICK_DISMISS),g(this._dialog).off(re.MOUSEDOWN_DISMISS),i){var o=_.getTransitionDurationFromElement(this._element);g(this._element).one(_.TRANSITION_END,function(t){return e._hideModal(t)}).emulateTransitionEnd(o)}else this._hideModal()}}},t.dispose=function(){[window,this._element,this._dialog].forEach(function(t){return g(t).off(ee)}),g(document).off(re.FOCUSIN),g.removeData(this._element,te),this._config=null,this._element=null,this._dialog=null,this._backdrop=null,this._isShown=null,this._isBodyOverflowing=null,this._ignoreBackdropClick=null,this._isTransitioning=null,this._scrollbarWidth=null},t.handleUpdate=function(){this._adjustDialog()},t._getConfig=function(t){return t=l({},ie,t),_.typeCheckConfig(Zt,t,oe),t},t._showElement=function(t){var e=this,n=g(this._element).hasClass(he);this._element.parentNode&&this._element.parentNode.nodeType===Node.ELEMENT_NODE||document.body.appendChild(this._element),this._element.style.display="block",this._element.removeAttribute("aria-hidden"),this._element.setAttribute("aria-modal",!0),g(this._dialog).hasClass(se)?this._dialog.querySelector(de).scrollTop=0:this._element.scrollTop=0,n&&_.reflow(this._element),g(this._element).addClass(ue),this._config.focus&&this._enforceFocus();var i=g.Event(re.SHOWN,{relatedTarget:t}),o=function(){e._config.focus&&e._element.focus(),e._isTransitioning=!1,g(e._element).trigger(i)};if(n){var r=_.getTransitionDurationFromElement(this._dialog);g(this._dialog).one(_.TRANSITION_END,o).emulateTransitionEnd(r)}else o()},t._enforceFocus=function(){var e=this;g(document).off(re.FOCUSIN).on(re.FOCUSIN,function(t){document!==t.target&&e._element!==t.target&&0===g(e._element).has(t.target).length&&e._element.focus()})},t._setEscapeEvent=function(){var e=this;this._isShown&&this._config.keyboard?g(this._element).on(re.KEYDOWN_DISMISS,function(t){27===t.which&&(t.preventDefault(),e.hide())}):this._isShown||g(this._element).off(re.KEYDOWN_DISMISS)},t._setResizeEvent=function(){var e=this;this._isShown?g(window).on(re.RESIZE,function(t){return e.handleUpdate(t)}):g(window).off(re.RESIZE)},t._hideModal=function(){var t=this;this._element.style.display="none",this._element.setAttribute("aria-hidden",!0),this._element.removeAttribute("aria-modal"),this._isTransitioning=!1,this._showBackdrop(function(){g(document.body).removeClass(ce),t._resetAdjustments(),t._resetScrollbar(),g(t._element).trigger(re.HIDDEN)})},t._removeBackdrop=function(){this._backdrop&&(g(this._backdrop).remove(),this._backdrop=null)},t._showBackdrop=function(t){var e=this,n=g(this._element).hasClass(he)?he:"";if(this._isShown&&this._config.backdrop){if(this._backdrop=document.createElement("div"),this._backdrop.className=le,n&&this._backdrop.classList.add(n),g(this._backdrop).appendTo(document.body),g(this._element).on(re.CLICK_DISMISS,function(t){e._ignoreBackdropClick?e._ignoreBackdropClick=!1:t.target===t.currentTarget&&("static"===e._config.backdrop?e._element.focus():e.hide())}),n&&_.reflow(this._backdrop),g(this._backdrop).addClass(ue),!t)return;if(!n)return void t();var i=_.getTransitionDurationFromElement(this._backdrop);g(this._backdrop).one(_.TRANSITION_END,t).emulateTransitionEnd(i)}else if(!this._isShown&&this._backdrop){g(this._backdrop).removeClass(ue);var o=function(){e._removeBackdrop(),t&&t()};if(g(this._element).hasClass(he)){var r=_.getTransitionDurationFromElement(this._backdrop);g(this._backdrop).one(_.TRANSITION_END,o).emulateTransitionEnd(r)}else o()}else t&&t()},t._adjustDialog=function(){var t=this._element.scrollHeight>document.documentElement.clientHeight;!this._isBodyOverflowing&&t&&(this._element.style.paddingLeft=this._scrollbarWidth+"px"),this._isBodyOverflowing&&!t&&(this._element.style.paddingRight=this._scrollbarWidth+"px")},t._resetAdjustments=function(){this._element.style.paddingLeft="",this._element.style.paddingRight=""},t._checkScrollbar=function(){var t=document.body.getBoundingClientRect();this._isBodyOverflowing=t.left+t.right<window.innerWidth,this._scrollbarWidth=this._getScrollbarWidth()},t._setScrollbar=function(){var o=this;if(this._isBodyOverflowing){var t=[].slice.call(document.querySelectorAll(me)),e=[].slice.call(document.querySelectorAll(pe));g(t).each(function(t,e){var n=e.style.paddingRight,i=g(e).css("padding-right");g(e).data("padding-right",n).css("padding-right",parseFloat(i)+o._scrollbarWidth+"px")}),g(e).each(function(t,e){var n=e.style.marginRight,i=g(e).css("margin-right");g(e).data("margin-right",n).css("margin-right",parseFloat(i)-o._scrollbarWidth+"px")});var n=document.body.style.paddingRight,i=g(document.body).css("padding-right");g(document.body).data("padding-right",n).css("padding-right",parseFloat(i)+this._scrollbarWidth+"px")}g(document.body).addClass(ce)},t._resetScrollbar=function(){var t=[].slice.call(document.querySelectorAll(me));g(t).each(function(t,e){var n=g(e).data("padding-right");g(e).removeData("padding-right"),e.style.paddingRight=n||""});var e=[].slice.call(document.querySelectorAll(""+pe));g(e).each(function(t,e){var n=g(e).data("margin-right");"undefined"!=typeof n&&g(e).css("margin-right",n).removeData("margin-right")});var n=g(document.body).data("padding-right");g(document.body).removeData("padding-right"),document.body.style.paddingRight=n||""},t._getScrollbarWidth=function(){var t=document.createElement("div");t.className=ae,document.body.appendChild(t);var e=t.getBoundingClientRect().width-t.clientWidth;return document.body.removeChild(t),e},o._jQueryInterface=function(n,i){return this.each(function(){var t=g(this).data(te),e=l({},ie,g(this).data(),"object"==typeof n&&n?n:{});if(t||(t=new o(this,e),g(this).data(te,t)),"string"==typeof n){if("undefined"==typeof t[n])throw new TypeError('No method named "'+n+'"');t[n](i)}else e.show&&t.show(i)})},s(o,null,[{key:"VERSION",get:function(){return"4.3.1"}},{key:"Default",get:function(){return ie}}]),o}();g(document).on(re.CLICK_DATA_API,ge,function(t){var e,n=this,i=_.getSelectorFromElement(this);i&&(e=document.querySelector(i));var o=g(e).data(te)?"toggle":l({},g(e).data(),g(this).data());"A"!==this.tagName&&"AREA"!==this.tagName||t.preventDefault();var r=g(e).one(re.SHOW,function(t){t.isDefaultPrevented()||r.one(re.HIDDEN,function(){g(n).is(":visible")&&n.focus()})});ve._jQueryInterface.call(g(e),o,this)}),g.fn[Zt]=ve._jQueryInterface,g.fn[Zt].Constructor=ve,g.fn[Zt].noConflict=function(){return g.fn[Zt]=ne,ve._jQueryInterface};var ye=["background","cite","href","itemtype","longdesc","poster","src","xlink:href"],Ee={"*":["class","dir","id","lang","role",/^aria-[\w-]*$/i],a:["target","href","title","rel"],area:[],b:[],br:[],col:[],code:[],div:[],em:[],hr:[],h1:[],h2:[],h3:[],h4:[],h5:[],h6:[],i:[],img:["src","alt","title","width","height"],li:[],ol:[],p:[],pre:[],s:[],small:[],span:[],sub:[],sup:[],strong:[],u:[],ul:[]},Ce=/^(?:(?:https?|mailto|ftp|tel|file):|[^&:/?#]*(?:[/?#]|$))/gi,Te=/^data:(?:image\/(?:bmp|gif|jpeg|jpg|png|tiff|webp)|video\/(?:mpeg|mp4|ogg|webm)|audio\/(?:mp3|oga|ogg|opus));base64,[a-z0-9+/]+=*$/i;function Se(t,s,e){if(0===t.length)return t;if(e&&"function"==typeof e)return e(t);for(var n=(new window.DOMParser).parseFromString(t,"text/html"),a=Object.keys(s),l=[].slice.call(n.body.querySelectorAll("*")),i=function(t,e){var n=l[t],i=n.nodeName.toLowerCase();if(-1===a.indexOf(n.nodeName.toLowerCase()))return n.parentNode.removeChild(n),"continue";var o=[].slice.call(n.attributes),r=[].concat(s["*"]||[],s[i]||[]);o.forEach(function(t){(function(t,e){var n=t.nodeName.toLowerCase();if(-1!==e.indexOf(n))return-1===ye.indexOf(n)||Boolean(t.nodeValue.match(Ce)||t.nodeValue.match(Te));for(var i=e.filter(function(t){return t instanceof RegExp}),o=0,r=i.length;o<r;o++)if(n.match(i[o]))return!0;return!1})(t,r)||n.removeAttribute(t.nodeName)})},o=0,r=l.length;o<r;o++)i(o);return n.body.innerHTML}var be="tooltip",Ie="bs.tooltip",De="."+Ie,we=g.fn[be],Ae="bs-tooltip",Ne=new RegExp("(^|\\s)"+Ae+"\\S+","g"),Oe=["sanitize","whiteList","sanitizeFn"],ke={animation:"boolean",template:"string",title:"(string|element|function)",trigger:"string",delay:"(number|object)",html:"boolean",selector:"(string|boolean)",placement:"(string|function)",offset:"(number|string|function)",container:"(string|element|boolean)",fallbackPlacement:"(string|array)",boundary:"(string|element)",sanitize:"boolean",sanitizeFn:"(null|function)",whiteList:"object"},Pe={AUTO:"auto",TOP:"top",RIGHT:"right",BOTTOM:"bottom",LEFT:"left"},Le={animation:!0,template:'<div class="tooltip" role="tooltip"><div class="arrow"></div><div class="tooltip-inner"></div></div>',trigger:"hover focus",title:"",delay:0,html:!1,selector:!1,placement:"top",offset:0,container:!1,fallbackPlacement:"flip",boundary:"scrollParent",sanitize:!0,sanitizeFn:null,whiteList:Ee},je="show",He="out",Re={HIDE:"hide"+De,HIDDEN:"hidden"+De,SHOW:"show"+De,SHOWN:"shown"+De,INSERTED:"inserted"+De,CLICK:"click"+De,FOCUSIN:"focusin"+De,FOCUSOUT:"focusout"+De,MOUSEENTER:"mouseenter"+De,MOUSELEAVE:"mouseleave"+De},xe="fade",Fe="show",Ue=".tooltip-inner",We=".arrow",qe="hover",Me="focus",Ke="click",Qe="manual",Be=function(){function i(t,e){if("undefined"==typeof u)throw new TypeError("Bootstrap's tooltips require Popper.js (https://popper.js.org/)");this._isEnabled=!0,this._timeout=0,this._hoverState="",this._activeTrigger={},this._popper=null,this.element=t,this.config=this._getConfig(e),this.tip=null,this._setListeners()}var t=i.prototype;return t.enable=function(){this._isEnabled=!0},t.disable=function(){this._isEnabled=!1},t.toggleEnabled=function(){this._isEnabled=!this._isEnabled},t.toggle=function(t){if(this._isEnabled)if(t){var e=this.constructor.DATA_KEY,n=g(t.currentTarget).data(e);n||(n=new this.constructor(t.currentTarget,this._getDelegateConfig()),g(t.currentTarget).data(e,n)),n._activeTrigger.click=!n._activeTrigger.click,n._isWithActiveTrigger()?n._enter(null,n):n._leave(null,n)}else{if(g(this.getTipElement()).hasClass(Fe))return void this._leave(null,this);this._enter(null,this)}},t.dispose=function(){clearTimeout(this._timeout),g.removeData(this.element,this.constructor.DATA_KEY),g(this.element).off(this.constructor.EVENT_KEY),g(this.element).closest(".modal").off("hide.bs.modal"),this.tip&&g(this.tip).remove(),this._isEnabled=null,this._timeout=null,this._hoverState=null,(this._activeTrigger=null)!==this._popper&&this._popper.destroy(),this._popper=null,this.element=null,this.config=null,this.tip=null},t.show=function(){var e=this;if("none"===g(this.element).css("display"))throw new Error("Please use show on visible elements");var t=g.Event(this.constructor.Event.SHOW);if(this.isWithContent()&&this._isEnabled){g(this.element).trigger(t);var n=_.findShadowRoot(this.element),i=g.contains(null!==n?n:this.element.ownerDocument.documentElement,this.element);if(t.isDefaultPrevented()||!i)return;var o=this.getTipElement(),r=_.getUID(this.constructor.NAME);o.setAttribute("id",r),this.element.setAttribute("aria-describedby",r),this.setContent(),this.config.animation&&g(o).addClass(xe);var s="function"==typeof this.config.placement?this.config.placement.call(this,o,this.element):this.config.placement,a=this._getAttachment(s);this.addAttachmentClass(a);var l=this._getContainer();g(o).data(this.constructor.DATA_KEY,this),g.contains(this.element.ownerDocument.documentElement,this.tip)||g(o).appendTo(l),g(this.element).trigger(this.constructor.Event.INSERTED),this._popper=new u(this.element,o,{placement:a,modifiers:{offset:this._getOffset(),flip:{behavior:this.config.fallbackPlacement},arrow:{element:We},preventOverflow:{boundariesElement:this.config.boundary}},onCreate:function(t){t.originalPlacement!==t.placement&&e._handlePopperPlacementChange(t)},onUpdate:function(t){return e._handlePopperPlacementChange(t)}}),g(o).addClass(Fe),"ontouchstart"in document.documentElement&&g(document.body).children().on("mouseover",null,g.noop);var c=function(){e.config.animation&&e._fixTransition();var t=e._hoverState;e._hoverState=null,g(e.element).trigger(e.constructor.Event.SHOWN),t===He&&e._leave(null,e)};if(g(this.tip).hasClass(xe)){var h=_.getTransitionDurationFromElement(this.tip);g(this.tip).one(_.TRANSITION_END,c).emulateTransitionEnd(h)}else c()}},t.hide=function(t){var e=this,n=this.getTipElement(),i=g.Event(this.constructor.Event.HIDE),o=function(){e._hoverState!==je&&n.parentNode&&n.parentNode.removeChild(n),e._cleanTipClass(),e.element.removeAttribute("aria-describedby"),g(e.element).trigger(e.constructor.Event.HIDDEN),null!==e._popper&&e._popper.destroy(),t&&t()};if(g(this.element).trigger(i),!i.isDefaultPrevented()){if(g(n).removeClass(Fe),"ontouchstart"in document.documentElement&&g(document.body).children().off("mouseover",null,g.noop),this._activeTrigger[Ke]=!1,this._activeTrigger[Me]=!1,this._activeTrigger[qe]=!1,g(this.tip).hasClass(xe)){var r=_.getTransitionDurationFromElement(n);g(n).one(_.TRANSITION_END,o).emulateTransitionEnd(r)}else o();this._hoverState=""}},t.update=function(){null!==this._popper&&this._popper.scheduleUpdate()},t.isWithContent=function(){return Boolean(this.getTitle())},t.addAttachmentClass=function(t){g(this.getTipElement()).addClass(Ae+"-"+t)},t.getTipElement=function(){return this.tip=this.tip||g(this.config.template)[0],this.tip},t.setContent=function(){var t=this.getTipElement();this.setElementContent(g(t.querySelectorAll(Ue)),this.getTitle()),g(t).removeClass(xe+" "+Fe)},t.setElementContent=function(t,e){"object"!=typeof e||!e.nodeType&&!e.jquery?this.config.html?(this.config.sanitize&&(e=Se(e,this.config.whiteList,this.config.sanitizeFn)),t.html(e)):t.text(e):this.config.html?g(e).parent().is(t)||t.empty().append(e):t.text(g(e).text())},t.getTitle=function(){var t=this.element.getAttribute("data-original-title");return t||(t="function"==typeof this.config.title?this.config.title.call(this.element):this.config.title),t},t._getOffset=function(){var e=this,t={};return"function"==typeof this.config.offset?t.fn=function(t){return t.offsets=l({},t.offsets,e.config.offset(t.offsets,e.element)||{}),t}:t.offset=this.config.offset,t},t._getContainer=function(){return!1===this.config.container?document.body:_.isElement(this.config.container)?g(this.config.container):g(document).find(this.config.container)},t._getAttachment=function(t){return Pe[t.toUpperCase()]},t._setListeners=function(){var i=this;this.config.trigger.split(" ").forEach(function(t){if("click"===t)g(i.element).on(i.constructor.Event.CLICK,i.config.selector,function(t){return i.toggle(t)});else if(t!==Qe){var e=t===qe?i.constructor.Event.MOUSEENTER:i.constructor.Event.FOCUSIN,n=t===qe?i.constructor.Event.MOUSELEAVE:i.constructor.Event.FOCUSOUT;g(i.element).on(e,i.config.selector,function(t){return i._enter(t)}).on(n,i.config.selector,function(t){return i._leave(t)})}}),g(this.element).closest(".modal").on("hide.bs.modal",function(){i.element&&i.hide()}),this.config.selector?this.config=l({},this.config,{trigger:"manual",selector:""}):this._fixTitle()},t._fixTitle=function(){var t=typeof this.element.getAttribute("data-original-title");(this.element.getAttribute("title")||"string"!==t)&&(this.element.setAttribute("data-original-title",this.element.getAttribute("title")||""),this.element.setAttribute("title",""))},t._enter=function(t,e){var n=this.constructor.DATA_KEY;(e=e||g(t.currentTarget).data(n))||(e=new this.constructor(t.currentTarget,this._getDelegateConfig()),g(t.currentTarget).data(n,e)),t&&(e._activeTrigger["focusin"===t.type?Me:qe]=!0),g(e.getTipElement()).hasClass(Fe)||e._hoverState===je?e._hoverState=je:(clearTimeout(e._timeout),e._hoverState=je,e.config.delay&&e.config.delay.show?e._timeout=setTimeout(function(){e._hoverState===je&&e.show()},e.config.delay.show):e.show())},t._leave=function(t,e){var n=this.constructor.DATA_KEY;(e=e||g(t.currentTarget).data(n))||(e=new this.constructor(t.currentTarget,this._getDelegateConfig()),g(t.currentTarget).data(n,e)),t&&(e._activeTrigger["focusout"===t.type?Me:qe]=!1),e._isWithActiveTrigger()||(clearTimeout(e._timeout),e._hoverState=He,e.config.delay&&e.config.delay.hide?e._timeout=setTimeout(function(){e._hoverState===He&&e.hide()},e.config.delay.hide):e.hide())},t._isWithActiveTrigger=function(){for(var t in this._activeTrigger)if(this._activeTrigger[t])return!0;return!1},t._getConfig=function(t){var e=g(this.element).data();return Object.keys(e).forEach(function(t){-1!==Oe.indexOf(t)&&delete e[t]}),"number"==typeof(t=l({},this.constructor.Default,e,"object"==typeof t&&t?t:{})).delay&&(t.delay={show:t.delay,hide:t.delay}),"number"==typeof t.title&&(t.title=t.title.toString()),"number"==typeof t.content&&(t.content=t.content.toString()),_.typeCheckConfig(be,t,this.constructor.DefaultType),t.sanitize&&(t.template=Se(t.template,t.whiteList,t.sanitizeFn)),t},t._getDelegateConfig=function(){var t={};if(this.config)for(var e in this.config)this.constructor.Default[e]!==this.config[e]&&(t[e]=this.config[e]);return t},t._cleanTipClass=function(){var t=g(this.getTipElement()),e=t.attr("class").match(Ne);null!==e&&e.length&&t.removeClass(e.join(""))},t._handlePopperPlacementChange=function(t){var e=t.instance;this.tip=e.popper,this._cleanTipClass(),this.addAttachmentClass(this._getAttachment(t.placement))},t._fixTransition=function(){var t=this.getTipElement(),e=this.config.animation;null===t.getAttribute("x-placement")&&(g(t).removeClass(xe),this.config.animation=!1,this.hide(),this.show(),this.config.animation=e)},i._jQueryInterface=function(n){return this.each(function(){var t=g(this).data(Ie),e="object"==typeof n&&n;if((t||!/dispose|hide/.test(n))&&(t||(t=new i(this,e),g(this).data(Ie,t)),"string"==typeof n)){if("undefined"==typeof t[n])throw new TypeError('No method named "'+n+'"');t[n]()}})},s(i,null,[{key:"VERSION",get:function(){return"4.3.1"}},{key:"Default",get:function(){return Le}},{key:"NAME",get:function(){return be}},{key:"DATA_KEY",get:function(){return Ie}},{key:"Event",get:function(){return Re}},{key:"EVENT_KEY",get:function(){return De}},{key:"DefaultType",get:function(){return ke}}]),i}();g.fn[be]=Be._jQueryInterface,g.fn[be].Constructor=Be,g.fn[be].noConflict=function(){return g.fn[be]=we,Be._jQueryInterface};var Ve="popover",Ye="bs.popover",ze="."+Ye,Xe=g.fn[Ve],$e="bs-popover",Ge=new RegExp("(^|\\s)"+$e+"\\S+","g"),Je=l({},Be.Default,{placement:"right",trigger:"click",content:"",template:'<div class="popover" role="tooltip"><div class="arrow"></div><h3 class="popover-header"></h3><div class="popover-body"></div></div>'}),Ze=l({},Be.DefaultType,{content:"(string|element|function)"}),tn="fade",en="show",nn=".popover-header",on=".popover-body",rn={HIDE:"hide"+ze,HIDDEN:"hidden"+ze,SHOW:"show"+ze,SHOWN:"shown"+ze,INSERTED:"inserted"+ze,CLICK:"click"+ze,FOCUSIN:"focusin"+ze,FOCUSOUT:"focusout"+ze,MOUSEENTER:"mouseenter"+ze,MOUSELEAVE:"mouseleave"+ze},sn=function(t){var e,n;function i(){return t.apply(this,arguments)||this}n=t,(e=i).prototype=Object.create(n.prototype),(e.prototype.constructor=e).__proto__=n;var o=i.prototype;return o.isWithContent=function(){return this.getTitle()||this._getContent()},o.addAttachmentClass=function(t){g(this.getTipElement()).addClass($e+"-"+t)},o.getTipElement=function(){return this.tip=this.tip||g(this.config.template)[0],this.tip},o.setContent=function(){var t=g(this.getTipElement());this.setElementContent(t.find(nn),this.getTitle());var e=this._getContent();"function"==typeof e&&(e=e.call(this.element)),this.setElementContent(t.find(on),e),t.removeClass(tn+" "+en)},o._getContent=function(){return this.element.getAttribute("data-content")||this.config.content},o._cleanTipClass=function(){var t=g(this.getTipElement()),e=t.attr("class").match(Ge);null!==e&&0<e.length&&t.removeClass(e.join(""))},i._jQueryInterface=function(n){return this.each(function(){var t=g(this).data(Ye),e="object"==typeof n?n:null;if((t||!/dispose|hide/.test(n))&&(t||(t=new i(this,e),g(this).data(Ye,t)),"string"==typeof n)){if("undefined"==typeof t[n])throw new TypeError('No method named "'+n+'"');t[n]()}})},s(i,null,[{key:"VERSION",get:function(){return"4.3.1"}},{key:"Default",get:function(){return Je}},{key:"NAME",get:function(){return Ve}},{key:"DATA_KEY",get:function(){return Ye}},{key:"Event",get:function(){return rn}},{key:"EVENT_KEY",get:function(){return ze}},{key:"DefaultType",get:function(){return Ze}}]),i}(Be);g.fn[Ve]=sn._jQueryInterface,g.fn[Ve].Constructor=sn,g.fn[Ve].noConflict=function(){return g.fn[Ve]=Xe,sn._jQueryInterface};var an="scrollspy",ln="bs.scrollspy",cn="."+ln,hn=g.fn[an],un={offset:10,method:"auto",target:""},fn={offset:"number",method:"string",target:"(string|element)"},dn={ACTIVATE:"activate"+cn,SCROLL:"scroll"+cn,LOAD_DATA_API:"load"+cn+".data-api"},gn="dropdown-item",_n="active",mn='[data-spy="scroll"]',pn=".nav, .list-group",vn=".nav-link",yn=".nav-item",En=".list-group-item",Cn=".dropdown",Tn=".dropdown-item",Sn=".dropdown-toggle",bn="offset",In="position",Dn=function(){function n(t,e){var n=this;this._element=t,this._scrollElement="BODY"===t.tagName?window:t,this._config=this._getConfig(e),this._selector=this._config.target+" "+vn+","+this._config.target+" "+En+","+this._config.target+" "+Tn,this._offsets=[],this._targets=[],this._activeTarget=null,this._scrollHeight=0,g(this._scrollElement).on(dn.SCROLL,function(t){return n._process(t)}),this.refresh(),this._process()}var t=n.prototype;return t.refresh=function(){var e=this,t=this._scrollElement===this._scrollElement.window?bn:In,o="auto"===this._config.method?t:this._config.method,r=o===In?this._getScrollTop():0;this._offsets=[],this._targets=[],this._scrollHeight=this._getScrollHeight(),[].slice.call(document.querySelectorAll(this._selector)).map(function(t){var e,n=_.getSelectorFromElement(t);if(n&&(e=document.querySelector(n)),e){var i=e.getBoundingClientRect();if(i.width||i.height)return[g(e)[o]().top+r,n]}return null}).filter(function(t){return t}).sort(function(t,e){return t[0]-e[0]}).forEach(function(t){e._offsets.push(t[0]),e._targets.push(t[1])})},t.dispose=function(){g.removeData(this._element,ln),g(this._scrollElement).off(cn),this._element=null,this._scrollElement=null,this._config=null,this._selector=null,this._offsets=null,this._targets=null,this._activeTarget=null,this._scrollHeight=null},t._getConfig=function(t){if("string"!=typeof(t=l({},un,"object"==typeof t&&t?t:{})).target){var e=g(t.target).attr("id");e||(e=_.getUID(an),g(t.target).attr("id",e)),t.target="#"+e}return _.typeCheckConfig(an,t,fn),t},t._getScrollTop=function(){return this._scrollElement===window?this._scrollElement.pageYOffset:this._scrollElement.scrollTop},t._getScrollHeight=function(){return this._scrollElement.scrollHeight||Math.max(document.body.scrollHeight,document.documentElement.scrollHeight)},t._getOffsetHeight=function(){return this._scrollElement===window?window.innerHeight:this._scrollElement.getBoundingClientRect().height},t._process=function(){var t=this._getScrollTop()+this._config.offset,e=this._getScrollHeight(),n=this._config.offset+e-this._getOffsetHeight();if(this._scrollHeight!==e&&this.refresh(),n<=t){var i=this._targets[this._targets.length-1];this._activeTarget!==i&&this._activate(i)}else{if(this._activeTarget&&t<this._offsets[0]&&0<this._offsets[0])return this._activeTarget=null,void this._clear();for(var o=this._offsets.length;o--;){this._activeTarget!==this._targets[o]&&t>=this._offsets[o]&&("undefined"==typeof this._offsets[o+1]||t<this._offsets[o+1])&&this._activate(this._targets[o])}}},t._activate=function(e){this._activeTarget=e,this._clear();var t=this._selector.split(",").map(function(t){return t+'[data-target="'+e+'"],'+t+'[href="'+e+'"]'}),n=g([].slice.call(document.querySelectorAll(t.join(","))));n.hasClass(gn)?(n.closest(Cn).find(Sn).addClass(_n),n.addClass(_n)):(n.addClass(_n),n.parents(pn).prev(vn+", "+En).addClass(_n),n.parents(pn).prev(yn).children(vn).addClass(_n)),g(this._scrollElement).trigger(dn.ACTIVATE,{relatedTarget:e})},t._clear=function(){[].slice.call(document.querySelectorAll(this._selector)).filter(function(t){return t.classList.contains(_n)}).forEach(function(t){return t.classList.remove(_n)})},n._jQueryInterface=function(e){return this.each(function(){var t=g(this).data(ln);if(t||(t=new n(this,"object"==typeof e&&e),g(this).data(ln,t)),"string"==typeof e){if("undefined"==typeof t[e])throw new TypeError('No method named "'+e+'"');t[e]()}})},s(n,null,[{key:"VERSION",get:function(){return"4.3.1"}},{key:"Default",get:function(){return un}}]),n}();g(window).on(dn.LOAD_DATA_API,function(){for(var t=[].slice.call(document.querySelectorAll(mn)),e=t.length;e--;){var n=g(t[e]);Dn._jQueryInterface.call(n,n.data())}}),g.fn[an]=Dn._jQueryInterface,g.fn[an].Constructor=Dn,g.fn[an].noConflict=function(){return g.fn[an]=hn,Dn._jQueryInterface};var wn="bs.tab",An="."+wn,Nn=g.fn.tab,On={HIDE:"hide"+An,HIDDEN:"hidden"+An,SHOW:"show"+An,SHOWN:"shown"+An,CLICK_DATA_API:"click"+An+".data-api"},kn="dropdown-menu",Pn="active",Ln="disabled",jn="fade",Hn="show",Rn=".dropdown",xn=".nav, .list-group",Fn=".active",Un="> li > .active",Wn='[data-toggle="tab"], [data-toggle="pill"], [data-toggle="list"]',qn=".dropdown-toggle",Mn="> .dropdown-menu .active",Kn=function(){function i(t){this._element=t}var t=i.prototype;return t.show=function(){var n=this;if(!(this._element.parentNode&&this._element.parentNode.nodeType===Node.ELEMENT_NODE&&g(this._element).hasClass(Pn)||g(this._element).hasClass(Ln))){var t,i,e=g(this._element).closest(xn)[0],o=_.getSelectorFromElement(this._element);if(e){var r="UL"===e.nodeName||"OL"===e.nodeName?Un:Fn;i=(i=g.makeArray(g(e).find(r)))[i.length-1]}var s=g.Event(On.HIDE,{relatedTarget:this._element}),a=g.Event(On.SHOW,{relatedTarget:i});if(i&&g(i).trigger(s),g(this._element).trigger(a),!a.isDefaultPrevented()&&!s.isDefaultPrevented()){o&&(t=document.querySelector(o)),this._activate(this._element,e);var l=function(){var t=g.Event(On.HIDDEN,{relatedTarget:n._element}),e=g.Event(On.SHOWN,{relatedTarget:i});g(i).trigger(t),g(n._element).trigger(e)};t?this._activate(t,t.parentNode,l):l()}}},t.dispose=function(){g.removeData(this._element,wn),this._element=null},t._activate=function(t,e,n){var i=this,o=(!e||"UL"!==e.nodeName&&"OL"!==e.nodeName?g(e).children(Fn):g(e).find(Un))[0],r=n&&o&&g(o).hasClass(jn),s=function(){return i._transitionComplete(t,o,n)};if(o&&r){var a=_.getTransitionDurationFromElement(o);g(o).removeClass(Hn).one(_.TRANSITION_END,s).emulateTransitionEnd(a)}else s()},t._transitionComplete=function(t,e,n){if(e){g(e).removeClass(Pn);var i=g(e.parentNode).find(Mn)[0];i&&g(i).removeClass(Pn),"tab"===e.getAttribute("role")&&e.setAttribute("aria-selected",!1)}if(g(t).addClass(Pn),"tab"===t.getAttribute("role")&&t.setAttribute("aria-selected",!0),_.reflow(t),t.classList.contains(jn)&&t.classList.add(Hn),t.parentNode&&g(t.parentNode).hasClass(kn)){var o=g(t).closest(Rn)[0];if(o){var r=[].slice.call(o.querySelectorAll(qn));g(r).addClass(Pn)}t.setAttribute("aria-expanded",!0)}n&&n()},i._jQueryInterface=function(n){return this.each(function(){var t=g(this),e=t.data(wn);if(e||(e=new i(this),t.data(wn,e)),"string"==typeof n){if("undefined"==typeof e[n])throw new TypeError('No method named "'+n+'"');e[n]()}})},s(i,null,[{key:"VERSION",get:function(){return"4.3.1"}}]),i}();g(document).on(On.CLICK_DATA_API,Wn,function(t){t.preventDefault(),Kn._jQueryInterface.call(g(this),"show")}),g.fn.tab=Kn._jQueryInterface,g.fn.tab.Constructor=Kn,g.fn.tab.noConflict=function(){return g.fn.tab=Nn,Kn._jQueryInterface};var Qn="toast",Bn="bs.toast",Vn="."+Bn,Yn=g.fn[Qn],zn={CLICK_DISMISS:"click.dismiss"+Vn,HIDE:"hide"+Vn,HIDDEN:"hidden"+Vn,SHOW:"show"+Vn,SHOWN:"shown"+Vn},Xn="fade",$n="hide",Gn="show",Jn="showing",Zn={animation:"boolean",autohide:"boolean",delay:"number"},ti={animation:!0,autohide:!0,delay:500},ei='[data-dismiss="toast"]',ni=function(){function i(t,e){this._element=t,this._config=this._getConfig(e),this._timeout=null,this._setListeners()}var t=i.prototype;return t.show=function(){var t=this;g(this._element).trigger(zn.SHOW),this._config.animation&&this._element.classList.add(Xn);var e=function(){t._element.classList.remove(Jn),t._element.classList.add(Gn),g(t._element).trigger(zn.SHOWN),t._config.autohide&&t.hide()};if(this._element.classList.remove($n),this._element.classList.add(Jn),this._config.animation){var n=_.getTransitionDurationFromElement(this._element);g(this._element).one(_.TRANSITION_END,e).emulateTransitionEnd(n)}else e()},t.hide=function(t){var e=this;this._element.classList.contains(Gn)&&(g(this._element).trigger(zn.HIDE),t?this._close():this._timeout=setTimeout(function(){e._close()},this._config.delay))},t.dispose=function(){clearTimeout(this._timeout),this._timeout=null,this._element.classList.contains(Gn)&&this._element.classList.remove(Gn),g(this._element).off(zn.CLICK_DISMISS),g.removeData(this._element,Bn),this._element=null,this._config=null},t._getConfig=function(t){return t=l({},ti,g(this._element).data(),"object"==typeof t&&t?t:{}),_.typeCheckConfig(Qn,t,this.constructor.DefaultType),t},t._setListeners=function(){var t=this;g(this._element).on(zn.CLICK_DISMISS,ei,function(){return t.hide(!0)})},t._close=function(){var t=this,e=function(){t._element.classList.add($n),g(t._element).trigger(zn.HIDDEN)};if(this._element.classList.remove(Gn),this._config.animation){var n=_.getTransitionDurationFromElement(this._element);g(this._element).one(_.TRANSITION_END,e).emulateTransitionEnd(n)}else e()},i._jQueryInterface=function(n){return this.each(function(){var t=g(this),e=t.data(Bn);if(e||(e=new i(this,"object"==typeof n&&n),t.data(Bn,e)),"string"==typeof n){if("undefined"==typeof e[n])throw new TypeError('No method named "'+n+'"');e[n](this)}})},s(i,null,[{key:"VERSION",get:function(){return"4.3.1"}},{key:"DefaultType",get:function(){return Zn}},{key:"Default",get:function(){return ti}}]),i}();g.fn[Qn]=ni._jQueryInterface,g.fn[Qn].Constructor=ni,g.fn[Qn].noConflict=function(){return g.fn[Qn]=Yn,ni._jQueryInterface},function(){if("undefined"==typeof g)throw new TypeError("Bootstrap's JavaScript requires jQuery. jQuery must be included before Bootstrap's JavaScript.");var t=g.fn.jquery.split(" ")[0].split(".");if(t[0]<2&&t[1]<9||1===t[0]&&9===t[1]&&t[2]<1||4<=t[0])throw new Error("Bootstrap's JavaScript requires at least jQuery v1.9.1 but less than v4.0.0")}(),t.Util=_,t.Alert=p,t.Button=P,t.Carousel=lt,t.Collapse=bt,t.Dropdown=Jt,t.Modal=ve,t.Popover=sn,t.Scrollspy=Dn,t.Tab=Kn,t.Toast=ni,t.Tooltip=Be,Object.defineProperty(t,"__esModule",{value:!0})});
\ No newline at end of file
diff --git a/doc/themes/scikit-learn-modern/static/js/vendor/jquery-3.6.3.slim.min.js b/doc/themes/scikit-learn-modern/static/js/vendor/jquery-3.6.3.slim.min.js
deleted file mode 100644
index dba338653a50a..0000000000000
--- a/doc/themes/scikit-learn-modern/static/js/vendor/jquery-3.6.3.slim.min.js
+++ /dev/null
@@ -1,2 +0,0 @@
-/*! jQuery v3.6.3 -ajax,-ajax/jsonp,-ajax/load,-ajax/script,-ajax/var/location,-ajax/var/nonce,-ajax/var/rquery,-ajax/xhr,-manipulation/_evalUrl,-deprecated/ajax-event-alias,-effects,-effects/Tween,-effects/animatedSelector | (c) OpenJS Foundation and other contributors | jquery.org/license */
-!function(e,t){"use strict";"object"==typeof module&&"object"==typeof module.exports?module.exports=e.document?t(e,!0):function(e){if(!e.document)throw new Error("jQuery requires a window with a document");return t(e)}:t(e)}("undefined"!=typeof window?window:this,function(g,e){"use strict";var t=[],r=Object.getPrototypeOf,s=t.slice,v=t.flat?function(e){return t.flat.call(e)}:function(e){return t.concat.apply([],e)},u=t.push,i=t.indexOf,n={},o=n.toString,y=n.hasOwnProperty,a=y.toString,l=a.call(Object),m={},b=function(e){return"function"==typeof e&&"number"!=typeof e.nodeType&&"function"!=typeof e.item},x=function(e){return null!=e&&e===e.window},w=g.document,c={type:!0,src:!0,nonce:!0,noModule:!0};function C(e,t,n){var r,i,o=(n=n||w).createElement("script");if(o.text=e,t)for(r in c)(i=t[r]||t.getAttribute&&t.getAttribute(r))&&o.setAttribute(r,i);n.head.appendChild(o).parentNode.removeChild(o)}function T(e){return null==e?e+"":"object"==typeof e||"function"==typeof e?n[o.call(e)]||"object":typeof e}var f="3.6.3 -ajax,-ajax/jsonp,-ajax/load,-ajax/script,-ajax/var/location,-ajax/var/nonce,-ajax/var/rquery,-ajax/xhr,-manipulation/_evalUrl,-deprecated/ajax-event-alias,-effects,-effects/Tween,-effects/animatedSelector",E=function(e,t){return new E.fn.init(e,t)};function d(e){var t=!!e&&"length"in e&&e.length,n=T(e);return!b(e)&&!x(e)&&("array"===n||0===t||"number"==typeof t&&0<t&&t-1 in e)}E.fn=E.prototype={jquery:f,constructor:E,length:0,toArray:function(){return s.call(this)},get:function(e){return null==e?s.call(this):e<0?this[e+this.length]:this[e]},pushStack:function(e){var t=E.merge(this.constructor(),e);return t.prevObject=this,t},each:function(e){return E.each(this,e)},map:function(n){return this.pushStack(E.map(this,function(e,t){return n.call(e,t,e)}))},slice:function(){return this.pushStack(s.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},even:function(){return this.pushStack(E.grep(this,function(e,t){return(t+1)%2}))},odd:function(){return this.pushStack(E.grep(this,function(e,t){return t%2}))},eq:function(e){var t=this.length,n=+e+(e<0?t:0);return this.pushStack(0<=n&&n<t?[this[n]]:[])},end:function(){return this.prevObject||this.constructor()},push:u,sort:t.sort,splice:t.splice},E.extend=E.fn.extend=function(){var e,t,n,r,i,o,a=arguments[0]||{},s=1,u=arguments.length,l=!1;for("boolean"==typeof a&&(l=a,a=arguments[s]||{},s++),"object"==typeof a||b(a)||(a={}),s===u&&(a=this,s--);s<u;s++)if(null!=(e=arguments[s]))for(t in e)r=e[t],"__proto__"!==t&&a!==r&&(l&&r&&(E.isPlainObject(r)||(i=Array.isArray(r)))?(n=a[t],o=i&&!Array.isArray(n)?[]:i||E.isPlainObject(n)?n:{},i=!1,a[t]=E.extend(l,o,r)):void 0!==r&&(a[t]=r));return a},E.extend({expando:"jQuery"+(f+Math.random()).replace(/\D/g,""),isReady:!0,error:function(e){throw new Error(e)},noop:function(){},isPlainObject:function(e){var t,n;return!(!e||"[object Object]"!==o.call(e))&&(!(t=r(e))||"function"==typeof(n=y.call(t,"constructor")&&t.constructor)&&a.call(n)===l)},isEmptyObject:function(e){var t;for(t in e)return!1;return!0},globalEval:function(e,t,n){C(e,{nonce:t&&t.nonce},n)},each:function(e,t){var n,r=0;if(d(e)){for(n=e.length;r<n;r++)if(!1===t.call(e[r],r,e[r]))break}else for(r in e)if(!1===t.call(e[r],r,e[r]))break;return e},makeArray:function(e,t){var n=t||[];return null!=e&&(d(Object(e))?E.merge(n,"string"==typeof e?[e]:e):u.call(n,e)),n},inArray:function(e,t,n){return null==t?-1:i.call(t,e,n)},merge:function(e,t){for(var n=+t.length,r=0,i=e.length;r<n;r++)e[i++]=t[r];return e.length=i,e},grep:function(e,t,n){for(var r=[],i=0,o=e.length,a=!n;i<o;i++)!t(e[i],i)!==a&&r.push(e[i]);return r},map:function(e,t,n){var r,i,o=0,a=[];if(d(e))for(r=e.length;o<r;o++)null!=(i=t(e[o],o,n))&&a.push(i);else for(o in e)null!=(i=t(e[o],o,n))&&a.push(i);return v(a)},guid:1,support:m}),"function"==typeof Symbol&&(E.fn[Symbol.iterator]=t[Symbol.iterator]),E.each("Boolean Number String Function Array Date RegExp Object Error Symbol".split(" "),function(e,t){n["[object "+t+"]"]=t.toLowerCase()});var p=function(n){var e,p,x,o,i,h,f,g,w,u,l,C,T,a,E,v,s,c,y,S="sizzle"+1*new Date,d=n.document,A=0,r=0,m=ue(),b=ue(),N=ue(),k=ue(),D=function(e,t){return e===t&&(l=!0),0},L={}.hasOwnProperty,t=[],j=t.pop,q=t.push,O=t.push,P=t.slice,H=function(e,t){for(var n=0,r=e.length;n<r;n++)if(e[n]===t)return n;return-1},I="checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped",R="[\\x20\\t\\r\\n\\f]",B="(?:\\\\[\\da-fA-F]{1,6}"+R+"?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+",M="\\["+R+"*("+B+")(?:"+R+"*([*^$|!~]?=)"+R+"*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|("+B+"))|)"+R+"*\\]",W=":("+B+")(?:\\((('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|((?:\\\\.|[^\\\\()[\\]]|"+M+")*)|.*)\\)|)",F=new RegExp(R+"+","g"),$=new RegExp("^"+R+"+|((?:^|[^\\\\])(?:\\\\.)*)"+R+"+$","g"),z=new RegExp("^"+R+"*,"+R+"*"),_=new RegExp("^"+R+"*([>+~]|"+R+")"+R+"*"),U=new RegExp(R+"|>"),V=new RegExp(W),X=new RegExp("^"+B+"$"),Q={ID:new RegExp("^#("+B+")"),CLASS:new RegExp("^\\.("+B+")"),TAG:new RegExp("^("+B+"|[*])"),ATTR:new RegExp("^"+M),PSEUDO:new RegExp("^"+W),CHILD:new RegExp("^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\("+R+"*(even|odd|(([+-]|)(\\d*)n|)"+R+"*(?:([+-]|)"+R+"*(\\d+)|))"+R+"*\\)|)","i"),bool:new RegExp("^(?:"+I+")$","i"),needsContext:new RegExp("^"+R+"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\("+R+"*((?:-\\d)?\\d*)"+R+"*\\)|)(?=[^-]|$)","i")},Y=/HTML$/i,G=/^(?:input|select|textarea|button)$/i,K=/^h\d$/i,J=/^[^{]+\{\s*\[native \w/,Z=/^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,ee=/[+~]/,te=new RegExp("\\\\[\\da-fA-F]{1,6}"+R+"?|\\\\([^\\r\\n\\f])","g"),ne=function(e,t){var n="0x"+e.slice(1)-65536;return t||(n<0?String.fromCharCode(n+65536):String.fromCharCode(n>>10|55296,1023&n|56320))},re=/([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g,ie=function(e,t){return t?"\0"===e?"\ufffd":e.slice(0,-1)+"\\"+e.charCodeAt(e.length-1).toString(16)+" ":"\\"+e},oe=function(){C()},ae=xe(function(e){return!0===e.disabled&&"fieldset"===e.nodeName.toLowerCase()},{dir:"parentNode",next:"legend"});try{O.apply(t=P.call(d.childNodes),d.childNodes),t[d.childNodes.length].nodeType}catch(e){O={apply:t.length?function(e,t){q.apply(e,P.call(t))}:function(e,t){var n=e.length,r=0;while(e[n++]=t[r++]);e.length=n-1}}}function se(t,e,n,r){var i,o,a,s,u,l,c,f=e&&e.ownerDocument,d=e?e.nodeType:9;if(n=n||[],"string"!=typeof t||!t||1!==d&&9!==d&&11!==d)return n;if(!r&&(C(e),e=e||T,E)){if(11!==d&&(u=Z.exec(t)))if(i=u[1]){if(9===d){if(!(a=e.getElementById(i)))return n;if(a.id===i)return n.push(a),n}else if(f&&(a=f.getElementById(i))&&y(e,a)&&a.id===i)return n.push(a),n}else{if(u[2])return O.apply(n,e.getElementsByTagName(t)),n;if((i=u[3])&&p.getElementsByClassName&&e.getElementsByClassName)return O.apply(n,e.getElementsByClassName(i)),n}if(p.qsa&&!k[t+" "]&&(!v||!v.test(t))&&(1!==d||"object"!==e.nodeName.toLowerCase())){if(c=t,f=e,1===d&&(U.test(t)||_.test(t))){(f=ee.test(t)&&ye(e.parentNode)||e)===e&&p.scope||((s=e.getAttribute("id"))?s=s.replace(re,ie):e.setAttribute("id",s=S)),o=(l=h(t)).length;while(o--)l[o]=(s?"#"+s:":scope")+" "+be(l[o]);c=l.join(",")}try{if(p.cssSupportsSelector&&!CSS.supports("selector(:is("+c+"))"))throw new Error;return O.apply(n,f.querySelectorAll(c)),n}catch(e){k(t,!0)}finally{s===S&&e.removeAttribute("id")}}}return g(t.replace($,"$1"),e,n,r)}function ue(){var r=[];return function e(t,n){return r.push(t+" ")>x.cacheLength&&delete e[r.shift()],e[t+" "]=n}}function le(e){return e[S]=!0,e}function ce(e){var t=T.createElement("fieldset");try{return!!e(t)}catch(e){return!1}finally{t.parentNode&&t.parentNode.removeChild(t),t=null}}function fe(e,t){var n=e.split("|"),r=n.length;while(r--)x.attrHandle[n[r]]=t}function de(e,t){var n=t&&e,r=n&&1===e.nodeType&&1===t.nodeType&&e.sourceIndex-t.sourceIndex;if(r)return r;if(n)while(n=n.nextSibling)if(n===t)return-1;return e?1:-1}function pe(t){return function(e){return"input"===e.nodeName.toLowerCase()&&e.type===t}}function he(n){return function(e){var t=e.nodeName.toLowerCase();return("input"===t||"button"===t)&&e.type===n}}function ge(t){return function(e){return"form"in e?e.parentNode&&!1===e.disabled?"label"in e?"label"in e.parentNode?e.parentNode.disabled===t:e.disabled===t:e.isDisabled===t||e.isDisabled!==!t&&ae(e)===t:e.disabled===t:"label"in e&&e.disabled===t}}function ve(a){return le(function(o){return o=+o,le(function(e,t){var n,r=a([],e.length,o),i=r.length;while(i--)e[n=r[i]]&&(e[n]=!(t[n]=e[n]))})})}function ye(e){return e&&"undefined"!=typeof e.getElementsByTagName&&e}for(e in p=se.support={},i=se.isXML=function(e){var t=e&&e.namespaceURI,n=e&&(e.ownerDocument||e).documentElement;return!Y.test(t||n&&n.nodeName||"HTML")},C=se.setDocument=function(e){var t,n,r=e?e.ownerDocument||e:d;return r!=T&&9===r.nodeType&&r.documentElement&&(a=(T=r).documentElement,E=!i(T),d!=T&&(n=T.defaultView)&&n.top!==n&&(n.addEventListener?n.addEventListener("unload",oe,!1):n.attachEvent&&n.attachEvent("onunload",oe)),p.scope=ce(function(e){return a.appendChild(e).appendChild(T.createElement("div")),"undefined"!=typeof e.querySelectorAll&&!e.querySelectorAll(":scope fieldset div").length}),p.cssSupportsSelector=ce(function(){return CSS.supports("selector(*)")&&T.querySelectorAll(":is(:jqfake)")&&!CSS.supports("selector(:is(*,:jqfake))")}),p.attributes=ce(function(e){return e.className="i",!e.getAttribute("className")}),p.getElementsByTagName=ce(function(e){return e.appendChild(T.createComment("")),!e.getElementsByTagName("*").length}),p.getElementsByClassName=J.test(T.getElementsByClassName),p.getById=ce(function(e){return a.appendChild(e).id=S,!T.getElementsByName||!T.getElementsByName(S).length}),p.getById?(x.filter.ID=function(e){var t=e.replace(te,ne);return function(e){return e.getAttribute("id")===t}},x.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n=t.getElementById(e);return n?[n]:[]}}):(x.filter.ID=function(e){var n=e.replace(te,ne);return function(e){var t="undefined"!=typeof e.getAttributeNode&&e.getAttributeNode("id");return t&&t.value===n}},x.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n,r,i,o=t.getElementById(e);if(o){if((n=o.getAttributeNode("id"))&&n.value===e)return[o];i=t.getElementsByName(e),r=0;while(o=i[r++])if((n=o.getAttributeNode("id"))&&n.value===e)return[o]}return[]}}),x.find.TAG=p.getElementsByTagName?function(e,t){return"undefined"!=typeof t.getElementsByTagName?t.getElementsByTagName(e):p.qsa?t.querySelectorAll(e):void 0}:function(e,t){var n,r=[],i=0,o=t.getElementsByTagName(e);if("*"===e){while(n=o[i++])1===n.nodeType&&r.push(n);return r}return o},x.find.CLASS=p.getElementsByClassName&&function(e,t){if("undefined"!=typeof t.getElementsByClassName&&E)return t.getElementsByClassName(e)},s=[],v=[],(p.qsa=J.test(T.querySelectorAll))&&(ce(function(e){var t;a.appendChild(e).innerHTML="<a id='"+S+"'></a><select id='"+S+"-\r\\' msallowcapture=''><option selected=''></option></select>",e.querySelectorAll("[msallowcapture^='']").length&&v.push("[*^$]="+R+"*(?:''|\"\")"),e.querySelectorAll("[selected]").length||v.push("\\["+R+"*(?:value|"+I+")"),e.querySelectorAll("[id~="+S+"-]").length||v.push("~="),(t=T.createElement("input")).setAttribute("name",""),e.appendChild(t),e.querySelectorAll("[name='']").length||v.push("\\["+R+"*name"+R+"*="+R+"*(?:''|\"\")"),e.querySelectorAll(":checked").length||v.push(":checked"),e.querySelectorAll("a#"+S+"+*").length||v.push(".#.+[+~]"),e.querySelectorAll("\\\f"),v.push("[\\r\\n\\f]")}),ce(function(e){e.innerHTML="<a href='' disabled='disabled'></a><select disabled='disabled'><option/></select>";var t=T.createElement("input");t.setAttribute("type","hidden"),e.appendChild(t).setAttribute("name","D"),e.querySelectorAll("[name=d]").length&&v.push("name"+R+"*[*^$|!~]?="),2!==e.querySelectorAll(":enabled").length&&v.push(":enabled",":disabled"),a.appendChild(e).disabled=!0,2!==e.querySelectorAll(":disabled").length&&v.push(":enabled",":disabled"),e.querySelectorAll("*,:x"),v.push(",.*:")})),(p.matchesSelector=J.test(c=a.matches||a.webkitMatchesSelector||a.mozMatchesSelector||a.oMatchesSelector||a.msMatchesSelector))&&ce(function(e){p.disconnectedMatch=c.call(e,"*"),c.call(e,"[s!='']:x"),s.push("!=",W)}),p.cssSupportsSelector||v.push(":has"),v=v.length&&new RegExp(v.join("|")),s=s.length&&new RegExp(s.join("|")),t=J.test(a.compareDocumentPosition),y=t||J.test(a.contains)?function(e,t){var n=9===e.nodeType&&e.documentElement||e,r=t&&t.parentNode;return e===r||!(!r||1!==r.nodeType||!(n.contains?n.contains(r):e.compareDocumentPosition&&16&e.compareDocumentPosition(r)))}:function(e,t){if(t)while(t=t.parentNode)if(t===e)return!0;return!1},D=t?function(e,t){if(e===t)return l=!0,0;var n=!e.compareDocumentPosition-!t.compareDocumentPosition;return n||(1&(n=(e.ownerDocument||e)==(t.ownerDocument||t)?e.compareDocumentPosition(t):1)||!p.sortDetached&&t.compareDocumentPosition(e)===n?e==T||e.ownerDocument==d&&y(d,e)?-1:t==T||t.ownerDocument==d&&y(d,t)?1:u?H(u,e)-H(u,t):0:4&n?-1:1)}:function(e,t){if(e===t)return l=!0,0;var n,r=0,i=e.parentNode,o=t.parentNode,a=[e],s=[t];if(!i||!o)return e==T?-1:t==T?1:i?-1:o?1:u?H(u,e)-H(u,t):0;if(i===o)return de(e,t);n=e;while(n=n.parentNode)a.unshift(n);n=t;while(n=n.parentNode)s.unshift(n);while(a[r]===s[r])r++;return r?de(a[r],s[r]):a[r]==d?-1:s[r]==d?1:0}),T},se.matches=function(e,t){return se(e,null,null,t)},se.matchesSelector=function(e,t){if(C(e),p.matchesSelector&&E&&!k[t+" "]&&(!s||!s.test(t))&&(!v||!v.test(t)))try{var n=c.call(e,t);if(n||p.disconnectedMatch||e.document&&11!==e.document.nodeType)return n}catch(e){k(t,!0)}return 0<se(t,T,null,[e]).length},se.contains=function(e,t){return(e.ownerDocument||e)!=T&&C(e),y(e,t)},se.attr=function(e,t){(e.ownerDocument||e)!=T&&C(e);var n=x.attrHandle[t.toLowerCase()],r=n&&L.call(x.attrHandle,t.toLowerCase())?n(e,t,!E):void 0;return void 0!==r?r:p.attributes||!E?e.getAttribute(t):(r=e.getAttributeNode(t))&&r.specified?r.value:null},se.escape=function(e){return(e+"").replace(re,ie)},se.error=function(e){throw new Error("Syntax error, unrecognized expression: "+e)},se.uniqueSort=function(e){var t,n=[],r=0,i=0;if(l=!p.detectDuplicates,u=!p.sortStable&&e.slice(0),e.sort(D),l){while(t=e[i++])t===e[i]&&(r=n.push(i));while(r--)e.splice(n[r],1)}return u=null,e},o=se.getText=function(e){var t,n="",r=0,i=e.nodeType;if(i){if(1===i||9===i||11===i){if("string"==typeof e.textContent)return e.textContent;for(e=e.firstChild;e;e=e.nextSibling)n+=o(e)}else if(3===i||4===i)return e.nodeValue}else while(t=e[r++])n+=o(t);return n},(x=se.selectors={cacheLength:50,createPseudo:le,match:Q,attrHandle:{},find:{},relative:{">":{dir:"parentNode",first:!0}," ":{dir:"parentNode"},"+":{dir:"previousSibling",first:!0},"~":{dir:"previousSibling"}},preFilter:{ATTR:function(e){return e[1]=e[1].replace(te,ne),e[3]=(e[3]||e[4]||e[5]||"").replace(te,ne),"~="===e[2]&&(e[3]=" "+e[3]+" "),e.slice(0,4)},CHILD:function(e){return e[1]=e[1].toLowerCase(),"nth"===e[1].slice(0,3)?(e[3]||se.error(e[0]),e[4]=+(e[4]?e[5]+(e[6]||1):2*("even"===e[3]||"odd"===e[3])),e[5]=+(e[7]+e[8]||"odd"===e[3])):e[3]&&se.error(e[0]),e},PSEUDO:function(e){var t,n=!e[6]&&e[2];return Q.CHILD.test(e[0])?null:(e[3]?e[2]=e[4]||e[5]||"":n&&V.test(n)&&(t=h(n,!0))&&(t=n.indexOf(")",n.length-t)-n.length)&&(e[0]=e[0].slice(0,t),e[2]=n.slice(0,t)),e.slice(0,3))}},filter:{TAG:function(e){var t=e.replace(te,ne).toLowerCase();return"*"===e?function(){return!0}:function(e){return e.nodeName&&e.nodeName.toLowerCase()===t}},CLASS:function(e){var t=m[e+" "];return t||(t=new RegExp("(^|"+R+")"+e+"("+R+"|$)"))&&m(e,function(e){return t.test("string"==typeof e.className&&e.className||"undefined"!=typeof e.getAttribute&&e.getAttribute("class")||"")})},ATTR:function(n,r,i){return function(e){var t=se.attr(e,n);return null==t?"!="===r:!r||(t+="","="===r?t===i:"!="===r?t!==i:"^="===r?i&&0===t.indexOf(i):"*="===r?i&&-1<t.indexOf(i):"$="===r?i&&t.slice(-i.length)===i:"~="===r?-1<(" "+t.replace(F," ")+" ").indexOf(i):"|="===r&&(t===i||t.slice(0,i.length+1)===i+"-"))}},CHILD:function(h,e,t,g,v){var y="nth"!==h.slice(0,3),m="last"!==h.slice(-4),b="of-type"===e;return 1===g&&0===v?function(e){return!!e.parentNode}:function(e,t,n){var r,i,o,a,s,u,l=y!==m?"nextSibling":"previousSibling",c=e.parentNode,f=b&&e.nodeName.toLowerCase(),d=!n&&!b,p=!1;if(c){if(y){while(l){a=e;while(a=a[l])if(b?a.nodeName.toLowerCase()===f:1===a.nodeType)return!1;u=l="only"===h&&!u&&"nextSibling"}return!0}if(u=[m?c.firstChild:c.lastChild],m&&d){p=(s=(r=(i=(o=(a=c)[S]||(a[S]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]||[])[0]===A&&r[1])&&r[2],a=s&&c.childNodes[s];while(a=++s&&a&&a[l]||(p=s=0)||u.pop())if(1===a.nodeType&&++p&&a===e){i[h]=[A,s,p];break}}else if(d&&(p=s=(r=(i=(o=(a=e)[S]||(a[S]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]||[])[0]===A&&r[1]),!1===p)while(a=++s&&a&&a[l]||(p=s=0)||u.pop())if((b?a.nodeName.toLowerCase()===f:1===a.nodeType)&&++p&&(d&&((i=(o=a[S]||(a[S]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]=[A,p]),a===e))break;return(p-=v)===g||p%g==0&&0<=p/g}}},PSEUDO:function(e,o){var t,a=x.pseudos[e]||x.setFilters[e.toLowerCase()]||se.error("unsupported pseudo: "+e);return a[S]?a(o):1<a.length?(t=[e,e,"",o],x.setFilters.hasOwnProperty(e.toLowerCase())?le(function(e,t){var n,r=a(e,o),i=r.length;while(i--)e[n=H(e,r[i])]=!(t[n]=r[i])}):function(e){return a(e,0,t)}):a}},pseudos:{not:le(function(e){var r=[],i=[],s=f(e.replace($,"$1"));return s[S]?le(function(e,t,n,r){var i,o=s(e,null,r,[]),a=e.length;while(a--)(i=o[a])&&(e[a]=!(t[a]=i))}):function(e,t,n){return r[0]=e,s(r,null,n,i),r[0]=null,!i.pop()}}),has:le(function(t){return function(e){return 0<se(t,e).length}}),contains:le(function(t){return t=t.replace(te,ne),function(e){return-1<(e.textContent||o(e)).indexOf(t)}}),lang:le(function(n){return X.test(n||"")||se.error("unsupported lang: "+n),n=n.replace(te,ne).toLowerCase(),function(e){var t;do{if(t=E?e.lang:e.getAttribute("xml:lang")||e.getAttribute("lang"))return(t=t.toLowerCase())===n||0===t.indexOf(n+"-")}while((e=e.parentNode)&&1===e.nodeType);return!1}}),target:function(e){var t=n.location&&n.location.hash;return t&&t.slice(1)===e.id},root:function(e){return e===a},focus:function(e){return e===T.activeElement&&(!T.hasFocus||T.hasFocus())&&!!(e.type||e.href||~e.tabIndex)},enabled:ge(!1),disabled:ge(!0),checked:function(e){var t=e.nodeName.toLowerCase();return"input"===t&&!!e.checked||"option"===t&&!!e.selected},selected:function(e){return e.parentNode&&e.parentNode.selectedIndex,!0===e.selected},empty:function(e){for(e=e.firstChild;e;e=e.nextSibling)if(e.nodeType<6)return!1;return!0},parent:function(e){return!x.pseudos.empty(e)},header:function(e){return K.test(e.nodeName)},input:function(e){return G.test(e.nodeName)},button:function(e){var t=e.nodeName.toLowerCase();return"input"===t&&"button"===e.type||"button"===t},text:function(e){var t;return"input"===e.nodeName.toLowerCase()&&"text"===e.type&&(null==(t=e.getAttribute("type"))||"text"===t.toLowerCase())},first:ve(function(){return[0]}),last:ve(function(e,t){return[t-1]}),eq:ve(function(e,t,n){return[n<0?n+t:n]}),even:ve(function(e,t){for(var n=0;n<t;n+=2)e.push(n);return e}),odd:ve(function(e,t){for(var n=1;n<t;n+=2)e.push(n);return e}),lt:ve(function(e,t,n){for(var r=n<0?n+t:t<n?t:n;0<=--r;)e.push(r);return e}),gt:ve(function(e,t,n){for(var r=n<0?n+t:n;++r<t;)e.push(r);return e})}}).pseudos.nth=x.pseudos.eq,{radio:!0,checkbox:!0,file:!0,password:!0,image:!0})x.pseudos[e]=pe(e);for(e in{submit:!0,reset:!0})x.pseudos[e]=he(e);function me(){}function be(e){for(var t=0,n=e.length,r="";t<n;t++)r+=e[t].value;return r}function xe(s,e,t){var u=e.dir,l=e.next,c=l||u,f=t&&"parentNode"===c,d=r++;return e.first?function(e,t,n){while(e=e[u])if(1===e.nodeType||f)return s(e,t,n);return!1}:function(e,t,n){var r,i,o,a=[A,d];if(n){while(e=e[u])if((1===e.nodeType||f)&&s(e,t,n))return!0}else while(e=e[u])if(1===e.nodeType||f)if(i=(o=e[S]||(e[S]={}))[e.uniqueID]||(o[e.uniqueID]={}),l&&l===e.nodeName.toLowerCase())e=e[u]||e;else{if((r=i[c])&&r[0]===A&&r[1]===d)return a[2]=r[2];if((i[c]=a)[2]=s(e,t,n))return!0}return!1}}function we(i){return 1<i.length?function(e,t,n){var r=i.length;while(r--)if(!i[r](e,t,n))return!1;return!0}:i[0]}function Ce(e,t,n,r,i){for(var o,a=[],s=0,u=e.length,l=null!=t;s<u;s++)(o=e[s])&&(n&&!n(o,r,i)||(a.push(o),l&&t.push(s)));return a}function Te(p,h,g,v,y,e){return v&&!v[S]&&(v=Te(v)),y&&!y[S]&&(y=Te(y,e)),le(function(e,t,n,r){var i,o,a,s=[],u=[],l=t.length,c=e||function(e,t,n){for(var r=0,i=t.length;r<i;r++)se(e,t[r],n);return n}(h||"*",n.nodeType?[n]:n,[]),f=!p||!e&&h?c:Ce(c,s,p,n,r),d=g?y||(e?p:l||v)?[]:t:f;if(g&&g(f,d,n,r),v){i=Ce(d,u),v(i,[],n,r),o=i.length;while(o--)(a=i[o])&&(d[u[o]]=!(f[u[o]]=a))}if(e){if(y||p){if(y){i=[],o=d.length;while(o--)(a=d[o])&&i.push(f[o]=a);y(null,d=[],i,r)}o=d.length;while(o--)(a=d[o])&&-1<(i=y?H(e,a):s[o])&&(e[i]=!(t[i]=a))}}else d=Ce(d===t?d.splice(l,d.length):d),y?y(null,t,d,r):O.apply(t,d)})}function Ee(e){for(var i,t,n,r=e.length,o=x.relative[e[0].type],a=o||x.relative[" "],s=o?1:0,u=xe(function(e){return e===i},a,!0),l=xe(function(e){return-1<H(i,e)},a,!0),c=[function(e,t,n){var r=!o&&(n||t!==w)||((i=t).nodeType?u(e,t,n):l(e,t,n));return i=null,r}];s<r;s++)if(t=x.relative[e[s].type])c=[xe(we(c),t)];else{if((t=x.filter[e[s].type].apply(null,e[s].matches))[S]){for(n=++s;n<r;n++)if(x.relative[e[n].type])break;return Te(1<s&&we(c),1<s&&be(e.slice(0,s-1).concat({value:" "===e[s-2].type?"*":""})).replace($,"$1"),t,s<n&&Ee(e.slice(s,n)),n<r&&Ee(e=e.slice(n)),n<r&&be(e))}c.push(t)}return we(c)}return me.prototype=x.filters=x.pseudos,x.setFilters=new me,h=se.tokenize=function(e,t){var n,r,i,o,a,s,u,l=b[e+" "];if(l)return t?0:l.slice(0);a=e,s=[],u=x.preFilter;while(a){for(o in n&&!(r=z.exec(a))||(r&&(a=a.slice(r[0].length)||a),s.push(i=[])),n=!1,(r=_.exec(a))&&(n=r.shift(),i.push({value:n,type:r[0].replace($," ")}),a=a.slice(n.length)),x.filter)!(r=Q[o].exec(a))||u[o]&&!(r=u[o](r))||(n=r.shift(),i.push({value:n,type:o,matches:r}),a=a.slice(n.length));if(!n)break}return t?a.length:a?se.error(e):b(e,s).slice(0)},f=se.compile=function(e,t){var n,v,y,m,b,r,i=[],o=[],a=N[e+" "];if(!a){t||(t=h(e)),n=t.length;while(n--)(a=Ee(t[n]))[S]?i.push(a):o.push(a);(a=N(e,(v=o,m=0<(y=i).length,b=0<v.length,r=function(e,t,n,r,i){var o,a,s,u=0,l="0",c=e&&[],f=[],d=w,p=e||b&&x.find.TAG("*",i),h=A+=null==d?1:Math.random()||.1,g=p.length;for(i&&(w=t==T||t||i);l!==g&&null!=(o=p[l]);l++){if(b&&o){a=0,t||o.ownerDocument==T||(C(o),n=!E);while(s=v[a++])if(s(o,t||T,n)){r.push(o);break}i&&(A=h)}m&&((o=!s&&o)&&u--,e&&c.push(o))}if(u+=l,m&&l!==u){a=0;while(s=y[a++])s(c,f,t,n);if(e){if(0<u)while(l--)c[l]||f[l]||(f[l]=j.call(r));f=Ce(f)}O.apply(r,f),i&&!e&&0<f.length&&1<u+y.length&&se.uniqueSort(r)}return i&&(A=h,w=d),c},m?le(r):r))).selector=e}return a},g=se.select=function(e,t,n,r){var i,o,a,s,u,l="function"==typeof e&&e,c=!r&&h(e=l.selector||e);if(n=n||[],1===c.length){if(2<(o=c[0]=c[0].slice(0)).length&&"ID"===(a=o[0]).type&&9===t.nodeType&&E&&x.relative[o[1].type]){if(!(t=(x.find.ID(a.matches[0].replace(te,ne),t)||[])[0]))return n;l&&(t=t.parentNode),e=e.slice(o.shift().value.length)}i=Q.needsContext.test(e)?0:o.length;while(i--){if(a=o[i],x.relative[s=a.type])break;if((u=x.find[s])&&(r=u(a.matches[0].replace(te,ne),ee.test(o[0].type)&&ye(t.parentNode)||t))){if(o.splice(i,1),!(e=r.length&&be(o)))return O.apply(n,r),n;break}}}return(l||f(e,c))(r,t,!E,n,!t||ee.test(e)&&ye(t.parentNode)||t),n},p.sortStable=S.split("").sort(D).join("")===S,p.detectDuplicates=!!l,C(),p.sortDetached=ce(function(e){return 1&e.compareDocumentPosition(T.createElement("fieldset"))}),ce(function(e){return e.innerHTML="<a href='#'></a>","#"===e.firstChild.getAttribute("href")})||fe("type|href|height|width",function(e,t,n){if(!n)return e.getAttribute(t,"type"===t.toLowerCase()?1:2)}),p.attributes&&ce(function(e){return e.innerHTML="<input/>",e.firstChild.setAttribute("value",""),""===e.firstChild.getAttribute("value")})||fe("value",function(e,t,n){if(!n&&"input"===e.nodeName.toLowerCase())return e.defaultValue}),ce(function(e){return null==e.getAttribute("disabled")})||fe(I,function(e,t,n){var r;if(!n)return!0===e[t]?t.toLowerCase():(r=e.getAttributeNode(t))&&r.specified?r.value:null}),se}(g);E.find=p,E.expr=p.selectors,E.expr[":"]=E.expr.pseudos,E.uniqueSort=E.unique=p.uniqueSort,E.text=p.getText,E.isXMLDoc=p.isXML,E.contains=p.contains,E.escapeSelector=p.escape;var h=function(e,t,n){var r=[],i=void 0!==n;while((e=e[t])&&9!==e.nodeType)if(1===e.nodeType){if(i&&E(e).is(n))break;r.push(e)}return r},S=function(e,t){for(var n=[];e;e=e.nextSibling)1===e.nodeType&&e!==t&&n.push(e);return n},A=E.expr.match.needsContext;function N(e,t){return e.nodeName&&e.nodeName.toLowerCase()===t.toLowerCase()}var k=/^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i;function D(e,n,r){return b(n)?E.grep(e,function(e,t){return!!n.call(e,t,e)!==r}):n.nodeType?E.grep(e,function(e){return e===n!==r}):"string"!=typeof n?E.grep(e,function(e){return-1<i.call(n,e)!==r}):E.filter(n,e,r)}E.filter=function(e,t,n){var r=t[0];return n&&(e=":not("+e+")"),1===t.length&&1===r.nodeType?E.find.matchesSelector(r,e)?[r]:[]:E.find.matches(e,E.grep(t,function(e){return 1===e.nodeType}))},E.fn.extend({find:function(e){var t,n,r=this.length,i=this;if("string"!=typeof e)return this.pushStack(E(e).filter(function(){for(t=0;t<r;t++)if(E.contains(i[t],this))return!0}));for(n=this.pushStack([]),t=0;t<r;t++)E.find(e,i[t],n);return 1<r?E.uniqueSort(n):n},filter:function(e){return this.pushStack(D(this,e||[],!1))},not:function(e){return this.pushStack(D(this,e||[],!0))},is:function(e){return!!D(this,"string"==typeof e&&A.test(e)?E(e):e||[],!1).length}});var L,j=/^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/;(E.fn.init=function(e,t,n){var r,i;if(!e)return this;if(n=n||L,"string"==typeof e){if(!(r="<"===e[0]&&">"===e[e.length-1]&&3<=e.length?[null,e,null]:j.exec(e))||!r[1]&&t)return!t||t.jquery?(t||n).find(e):this.constructor(t).find(e);if(r[1]){if(t=t instanceof E?t[0]:t,E.merge(this,E.parseHTML(r[1],t&&t.nodeType?t.ownerDocument||t:w,!0)),k.test(r[1])&&E.isPlainObject(t))for(r in t)b(this[r])?this[r](t[r]):this.attr(r,t[r]);return this}return(i=w.getElementById(r[2]))&&(this[0]=i,this.length=1),this}return e.nodeType?(this[0]=e,this.length=1,this):b(e)?void 0!==n.ready?n.ready(e):e(E):E.makeArray(e,this)}).prototype=E.fn,L=E(w);var q=/^(?:parents|prev(?:Until|All))/,O={children:!0,contents:!0,next:!0,prev:!0};function P(e,t){while((e=e[t])&&1!==e.nodeType);return e}E.fn.extend({has:function(e){var t=E(e,this),n=t.length;return this.filter(function(){for(var e=0;e<n;e++)if(E.contains(this,t[e]))return!0})},closest:function(e,t){var n,r=0,i=this.length,o=[],a="string"!=typeof e&&E(e);if(!A.test(e))for(;r<i;r++)for(n=this[r];n&&n!==t;n=n.parentNode)if(n.nodeType<11&&(a?-1<a.index(n):1===n.nodeType&&E.find.matchesSelector(n,e))){o.push(n);break}return this.pushStack(1<o.length?E.uniqueSort(o):o)},index:function(e){return e?"string"==typeof e?i.call(E(e),this[0]):i.call(this,e.jquery?e[0]:e):this[0]&&this[0].parentNode?this.first().prevAll().length:-1},add:function(e,t){return this.pushStack(E.uniqueSort(E.merge(this.get(),E(e,t))))},addBack:function(e){return this.add(null==e?this.prevObject:this.prevObject.filter(e))}}),E.each({parent:function(e){var t=e.parentNode;return t&&11!==t.nodeType?t:null},parents:function(e){return h(e,"parentNode")},parentsUntil:function(e,t,n){return h(e,"parentNode",n)},next:function(e){return P(e,"nextSibling")},prev:function(e){return P(e,"previousSibling")},nextAll:function(e){return h(e,"nextSibling")},prevAll:function(e){return h(e,"previousSibling")},nextUntil:function(e,t,n){return h(e,"nextSibling",n)},prevUntil:function(e,t,n){return h(e,"previousSibling",n)},siblings:function(e){return S((e.parentNode||{}).firstChild,e)},children:function(e){return S(e.firstChild)},contents:function(e){return null!=e.contentDocument&&r(e.contentDocument)?e.contentDocument:(N(e,"template")&&(e=e.content||e),E.merge([],e.childNodes))}},function(r,i){E.fn[r]=function(e,t){var n=E.map(this,i,e);return"Until"!==r.slice(-5)&&(t=e),t&&"string"==typeof t&&(n=E.filter(t,n)),1<this.length&&(O[r]||E.uniqueSort(n),q.test(r)&&n.reverse()),this.pushStack(n)}});var H=/[^\x20\t\r\n\f]+/g;function I(e){return e}function R(e){throw e}function B(e,t,n,r){var i;try{e&&b(i=e.promise)?i.call(e).done(t).fail(n):e&&b(i=e.then)?i.call(e,t,n):t.apply(void 0,[e].slice(r))}catch(e){n.apply(void 0,[e])}}E.Callbacks=function(r){var e,n;r="string"==typeof r?(e=r,n={},E.each(e.match(H)||[],function(e,t){n[t]=!0}),n):E.extend({},r);var i,t,o,a,s=[],u=[],l=-1,c=function(){for(a=a||r.once,o=i=!0;u.length;l=-1){t=u.shift();while(++l<s.length)!1===s[l].apply(t[0],t[1])&&r.stopOnFalse&&(l=s.length,t=!1)}r.memory||(t=!1),i=!1,a&&(s=t?[]:"")},f={add:function(){return s&&(t&&!i&&(l=s.length-1,u.push(t)),function n(e){E.each(e,function(e,t){b(t)?r.unique&&f.has(t)||s.push(t):t&&t.length&&"string"!==T(t)&&n(t)})}(arguments),t&&!i&&c()),this},remove:function(){return E.each(arguments,function(e,t){var n;while(-1<(n=E.inArray(t,s,n)))s.splice(n,1),n<=l&&l--}),this},has:function(e){return e?-1<E.inArray(e,s):0<s.length},empty:function(){return s&&(s=[]),this},disable:function(){return a=u=[],s=t="",this},disabled:function(){return!s},lock:function(){return a=u=[],t||i||(s=t=""),this},locked:function(){return!!a},fireWith:function(e,t){return a||(t=[e,(t=t||[]).slice?t.slice():t],u.push(t),i||c()),this},fire:function(){return f.fireWith(this,arguments),this},fired:function(){return!!o}};return f},E.extend({Deferred:function(e){var o=[["notify","progress",E.Callbacks("memory"),E.Callbacks("memory"),2],["resolve","done",E.Callbacks("once memory"),E.Callbacks("once memory"),0,"resolved"],["reject","fail",E.Callbacks("once memory"),E.Callbacks("once memory"),1,"rejected"]],i="pending",a={state:function(){return i},always:function(){return s.done(arguments).fail(arguments),this},"catch":function(e){return a.then(null,e)},pipe:function(){var i=arguments;return E.Deferred(function(r){E.each(o,function(e,t){var n=b(i[t[4]])&&i[t[4]];s[t[1]](function(){var e=n&&n.apply(this,arguments);e&&b(e.promise)?e.promise().progress(r.notify).done(r.resolve).fail(r.reject):r[t[0]+"With"](this,n?[e]:arguments)})}),i=null}).promise()},then:function(t,n,r){var u=0;function l(i,o,a,s){return function(){var n=this,r=arguments,e=function(){var e,t;if(!(i<u)){if((e=a.apply(n,r))===o.promise())throw new TypeError("Thenable self-resolution");t=e&&("object"==typeof e||"function"==typeof e)&&e.then,b(t)?s?t.call(e,l(u,o,I,s),l(u,o,R,s)):(u++,t.call(e,l(u,o,I,s),l(u,o,R,s),l(u,o,I,o.notifyWith))):(a!==I&&(n=void 0,r=[e]),(s||o.resolveWith)(n,r))}},t=s?e:function(){try{e()}catch(e){E.Deferred.exceptionHook&&E.Deferred.exceptionHook(e,t.stackTrace),u<=i+1&&(a!==R&&(n=void 0,r=[e]),o.rejectWith(n,r))}};i?t():(E.Deferred.getStackHook&&(t.stackTrace=E.Deferred.getStackHook()),g.setTimeout(t))}}return E.Deferred(function(e){o[0][3].add(l(0,e,b(r)?r:I,e.notifyWith)),o[1][3].add(l(0,e,b(t)?t:I)),o[2][3].add(l(0,e,b(n)?n:R))}).promise()},promise:function(e){return null!=e?E.extend(e,a):a}},s={};return E.each(o,function(e,t){var n=t[2],r=t[5];a[t[1]]=n.add,r&&n.add(function(){i=r},o[3-e][2].disable,o[3-e][3].disable,o[0][2].lock,o[0][3].lock),n.add(t[3].fire),s[t[0]]=function(){return s[t[0]+"With"](this===s?void 0:this,arguments),this},s[t[0]+"With"]=n.fireWith}),a.promise(s),e&&e.call(s,s),s},when:function(e){var n=arguments.length,t=n,r=Array(t),i=s.call(arguments),o=E.Deferred(),a=function(t){return function(e){r[t]=this,i[t]=1<arguments.length?s.call(arguments):e,--n||o.resolveWith(r,i)}};if(n<=1&&(B(e,o.done(a(t)).resolve,o.reject,!n),"pending"===o.state()||b(i[t]&&i[t].then)))return o.then();while(t--)B(i[t],a(t),o.reject);return o.promise()}});var M=/^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/;E.Deferred.exceptionHook=function(e,t){g.console&&g.console.warn&&e&&M.test(e.name)&&g.console.warn("jQuery.Deferred exception: "+e.message,e.stack,t)},E.readyException=function(e){g.setTimeout(function(){throw e})};var W=E.Deferred();function F(){w.removeEventListener("DOMContentLoaded",F),g.removeEventListener("load",F),E.ready()}E.fn.ready=function(e){return W.then(e)["catch"](function(e){E.readyException(e)}),this},E.extend({isReady:!1,readyWait:1,ready:function(e){(!0===e?--E.readyWait:E.isReady)||(E.isReady=!0)!==e&&0<--E.readyWait||W.resolveWith(w,[E])}}),E.ready.then=W.then,"complete"===w.readyState||"loading"!==w.readyState&&!w.documentElement.doScroll?g.setTimeout(E.ready):(w.addEventListener("DOMContentLoaded",F),g.addEventListener("load",F));var $=function(e,t,n,r,i,o,a){var s=0,u=e.length,l=null==n;if("object"===T(n))for(s in i=!0,n)$(e,t,s,n[s],!0,o,a);else if(void 0!==r&&(i=!0,b(r)||(a=!0),l&&(a?(t.call(e,r),t=null):(l=t,t=function(e,t,n){return l.call(E(e),n)})),t))for(;s<u;s++)t(e[s],n,a?r:r.call(e[s],s,t(e[s],n)));return i?e:l?t.call(e):u?t(e[0],n):o},z=/^-ms-/,_=/-([a-z])/g;function U(e,t){return t.toUpperCase()}function V(e){return e.replace(z,"ms-").replace(_,U)}var X=function(e){return 1===e.nodeType||9===e.nodeType||!+e.nodeType};function Q(){this.expando=E.expando+Q.uid++}Q.uid=1,Q.prototype={cache:function(e){var t=e[this.expando];return t||(t={},X(e)&&(e.nodeType?e[this.expando]=t:Object.defineProperty(e,this.expando,{value:t,configurable:!0}))),t},set:function(e,t,n){var r,i=this.cache(e);if("string"==typeof t)i[V(t)]=n;else for(r in t)i[V(r)]=t[r];return i},get:function(e,t){return void 0===t?this.cache(e):e[this.expando]&&e[this.expando][V(t)]},access:function(e,t,n){return void 0===t||t&&"string"==typeof t&&void 0===n?this.get(e,t):(this.set(e,t,n),void 0!==n?n:t)},remove:function(e,t){var n,r=e[this.expando];if(void 0!==r){if(void 0!==t){n=(t=Array.isArray(t)?t.map(V):(t=V(t))in r?[t]:t.match(H)||[]).length;while(n--)delete r[t[n]]}(void 0===t||E.isEmptyObject(r))&&(e.nodeType?e[this.expando]=void 0:delete e[this.expando])}},hasData:function(e){var t=e[this.expando];return void 0!==t&&!E.isEmptyObject(t)}};var Y=new Q,G=new Q,K=/^(?:\{[\w\W]*\}|\[[\w\W]*\])$/,J=/[A-Z]/g;function Z(e,t,n){var r,i;if(void 0===n&&1===e.nodeType)if(r="data-"+t.replace(J,"-$&").toLowerCase(),"string"==typeof(n=e.getAttribute(r))){try{n="true"===(i=n)||"false"!==i&&("null"===i?null:i===+i+""?+i:K.test(i)?JSON.parse(i):i)}catch(e){}G.set(e,t,n)}else n=void 0;return n}E.extend({hasData:function(e){return G.hasData(e)||Y.hasData(e)},data:function(e,t,n){return G.access(e,t,n)},removeData:function(e,t){G.remove(e,t)},_data:function(e,t,n){return Y.access(e,t,n)},_removeData:function(e,t){Y.remove(e,t)}}),E.fn.extend({data:function(n,e){var t,r,i,o=this[0],a=o&&o.attributes;if(void 0===n){if(this.length&&(i=G.get(o),1===o.nodeType&&!Y.get(o,"hasDataAttrs"))){t=a.length;while(t--)a[t]&&0===(r=a[t].name).indexOf("data-")&&(r=V(r.slice(5)),Z(o,r,i[r]));Y.set(o,"hasDataAttrs",!0)}return i}return"object"==typeof n?this.each(function(){G.set(this,n)}):$(this,function(e){var t;if(o&&void 0===e)return void 0!==(t=G.get(o,n))?t:void 0!==(t=Z(o,n))?t:void 0;this.each(function(){G.set(this,n,e)})},null,e,1<arguments.length,null,!0)},removeData:function(e){return this.each(function(){G.remove(this,e)})}}),E.extend({queue:function(e,t,n){var r;if(e)return t=(t||"fx")+"queue",r=Y.get(e,t),n&&(!r||Array.isArray(n)?r=Y.access(e,t,E.makeArray(n)):r.push(n)),r||[]},dequeue:function(e,t){t=t||"fx";var n=E.queue(e,t),r=n.length,i=n.shift(),o=E._queueHooks(e,t);"inprogress"===i&&(i=n.shift(),r--),i&&("fx"===t&&n.unshift("inprogress"),delete o.stop,i.call(e,function(){E.dequeue(e,t)},o)),!r&&o&&o.empty.fire()},_queueHooks:function(e,t){var n=t+"queueHooks";return Y.get(e,n)||Y.access(e,n,{empty:E.Callbacks("once memory").add(function(){Y.remove(e,[t+"queue",n])})})}}),E.fn.extend({queue:function(t,n){var e=2;return"string"!=typeof t&&(n=t,t="fx",e--),arguments.length<e?E.queue(this[0],t):void 0===n?this:this.each(function(){var e=E.queue(this,t,n);E._queueHooks(this,t),"fx"===t&&"inprogress"!==e[0]&&E.dequeue(this,t)})},dequeue:function(e){return this.each(function(){E.dequeue(this,e)})},clearQueue:function(e){return this.queue(e||"fx",[])},promise:function(e,t){var n,r=1,i=E.Deferred(),o=this,a=this.length,s=function(){--r||i.resolveWith(o,[o])};"string"!=typeof e&&(t=e,e=void 0),e=e||"fx";while(a--)(n=Y.get(o[a],e+"queueHooks"))&&n.empty&&(r++,n.empty.add(s));return s(),i.promise(t)}});var ee=/[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/.source,te=new RegExp("^(?:([+-])=|)("+ee+")([a-z%]*)$","i"),ne=["Top","Right","Bottom","Left"],re=w.documentElement,ie=function(e){return E.contains(e.ownerDocument,e)},oe={composed:!0};re.getRootNode&&(ie=function(e){return E.contains(e.ownerDocument,e)||e.getRootNode(oe)===e.ownerDocument});var ae=function(e,t){return"none"===(e=t||e).style.display||""===e.style.display&&ie(e)&&"none"===E.css(e,"display")};var se={};function ue(e,t){for(var n,r,i,o,a,s,u,l=[],c=0,f=e.length;c<f;c++)(r=e[c]).style&&(n=r.style.display,t?("none"===n&&(l[c]=Y.get(r,"display")||null,l[c]||(r.style.display="")),""===r.style.display&&ae(r)&&(l[c]=(u=a=o=void 0,a=(i=r).ownerDocument,s=i.nodeName,(u=se[s])||(o=a.body.appendChild(a.createElement(s)),u=E.css(o,"display"),o.parentNode.removeChild(o),"none"===u&&(u="block"),se[s]=u)))):"none"!==n&&(l[c]="none",Y.set(r,"display",n)));for(c=0;c<f;c++)null!=l[c]&&(e[c].style.display=l[c]);return e}E.fn.extend({show:function(){return ue(this,!0)},hide:function(){return ue(this)},toggle:function(e){return"boolean"==typeof e?e?this.show():this.hide():this.each(function(){ae(this)?E(this).show():E(this).hide()})}});var le,ce,fe=/^(?:checkbox|radio)$/i,de=/<([a-z][^\/\0>\x20\t\r\n\f]*)/i,pe=/^$|^module$|\/(?:java|ecma)script/i;le=w.createDocumentFragment().appendChild(w.createElement("div")),(ce=w.createElement("input")).setAttribute("type","radio"),ce.setAttribute("checked","checked"),ce.setAttribute("name","t"),le.appendChild(ce),m.checkClone=le.cloneNode(!0).cloneNode(!0).lastChild.checked,le.innerHTML="<textarea>x</textarea>",m.noCloneChecked=!!le.cloneNode(!0).lastChild.defaultValue,le.innerHTML="<option></option>",m.option=!!le.lastChild;var he={thead:[1,"<table>","</table>"],col:[2,"<table><colgroup>","</colgroup></table>"],tr:[2,"<table><tbody>","</tbody></table>"],td:[3,"<table><tbody><tr>","</tr></tbody></table>"],_default:[0,"",""]};function ge(e,t){var n;return n="undefined"!=typeof e.getElementsByTagName?e.getElementsByTagName(t||"*"):"undefined"!=typeof e.querySelectorAll?e.querySelectorAll(t||"*"):[],void 0===t||t&&N(e,t)?E.merge([e],n):n}function ve(e,t){for(var n=0,r=e.length;n<r;n++)Y.set(e[n],"globalEval",!t||Y.get(t[n],"globalEval"))}he.tbody=he.tfoot=he.colgroup=he.caption=he.thead,he.th=he.td,m.option||(he.optgroup=he.option=[1,"<select multiple='multiple'>","</select>"]);var ye=/<|&#?\w+;/;function me(e,t,n,r,i){for(var o,a,s,u,l,c,f=t.createDocumentFragment(),d=[],p=0,h=e.length;p<h;p++)if((o=e[p])||0===o)if("object"===T(o))E.merge(d,o.nodeType?[o]:o);else if(ye.test(o)){a=a||f.appendChild(t.createElement("div")),s=(de.exec(o)||["",""])[1].toLowerCase(),u=he[s]||he._default,a.innerHTML=u[1]+E.htmlPrefilter(o)+u[2],c=u[0];while(c--)a=a.lastChild;E.merge(d,a.childNodes),(a=f.firstChild).textContent=""}else d.push(t.createTextNode(o));f.textContent="",p=0;while(o=d[p++])if(r&&-1<E.inArray(o,r))i&&i.push(o);else if(l=ie(o),a=ge(f.appendChild(o),"script"),l&&ve(a),n){c=0;while(o=a[c++])pe.test(o.type||"")&&n.push(o)}return f}var be=/^([^.]*)(?:\.(.+)|)/;function xe(){return!0}function we(){return!1}function Ce(e,t){return e===function(){try{return w.activeElement}catch(e){}}()==("focus"===t)}function Te(e,t,n,r,i,o){var a,s;if("object"==typeof t){for(s in"string"!=typeof n&&(r=r||n,n=void 0),t)Te(e,s,n,r,t[s],o);return e}if(null==r&&null==i?(i=n,r=n=void 0):null==i&&("string"==typeof n?(i=r,r=void 0):(i=r,r=n,n=void 0)),!1===i)i=we;else if(!i)return e;return 1===o&&(a=i,(i=function(e){return E().off(e),a.apply(this,arguments)}).guid=a.guid||(a.guid=E.guid++)),e.each(function(){E.event.add(this,t,i,r,n)})}function Ee(e,i,o){o?(Y.set(e,i,!1),E.event.add(e,i,{namespace:!1,handler:function(e){var t,n,r=Y.get(this,i);if(1&e.isTrigger&&this[i]){if(r.length)(E.event.special[i]||{}).delegateType&&e.stopPropagation();else if(r=s.call(arguments),Y.set(this,i,r),t=o(this,i),this[i](),r!==(n=Y.get(this,i))||t?Y.set(this,i,!1):n={},r!==n)return e.stopImmediatePropagation(),e.preventDefault(),n&&n.value}else r.length&&(Y.set(this,i,{value:E.event.trigger(E.extend(r[0],E.Event.prototype),r.slice(1),this)}),e.stopImmediatePropagation())}})):void 0===Y.get(e,i)&&E.event.add(e,i,xe)}E.event={global:{},add:function(t,e,n,r,i){var o,a,s,u,l,c,f,d,p,h,g,v=Y.get(t);if(X(t)){n.handler&&(n=(o=n).handler,i=o.selector),i&&E.find.matchesSelector(re,i),n.guid||(n.guid=E.guid++),(u=v.events)||(u=v.events=Object.create(null)),(a=v.handle)||(a=v.handle=function(e){return"undefined"!=typeof E&&E.event.triggered!==e.type?E.event.dispatch.apply(t,arguments):void 0}),l=(e=(e||"").match(H)||[""]).length;while(l--)p=g=(s=be.exec(e[l])||[])[1],h=(s[2]||"").split(".").sort(),p&&(f=E.event.special[p]||{},p=(i?f.delegateType:f.bindType)||p,f=E.event.special[p]||{},c=E.extend({type:p,origType:g,data:r,handler:n,guid:n.guid,selector:i,needsContext:i&&E.expr.match.needsContext.test(i),namespace:h.join(".")},o),(d=u[p])||((d=u[p]=[]).delegateCount=0,f.setup&&!1!==f.setup.call(t,r,h,a)||t.addEventListener&&t.addEventListener(p,a)),f.add&&(f.add.call(t,c),c.handler.guid||(c.handler.guid=n.guid)),i?d.splice(d.delegateCount++,0,c):d.push(c),E.event.global[p]=!0)}},remove:function(e,t,n,r,i){var o,a,s,u,l,c,f,d,p,h,g,v=Y.hasData(e)&&Y.get(e);if(v&&(u=v.events)){l=(t=(t||"").match(H)||[""]).length;while(l--)if(p=g=(s=be.exec(t[l])||[])[1],h=(s[2]||"").split(".").sort(),p){f=E.event.special[p]||{},d=u[p=(r?f.delegateType:f.bindType)||p]||[],s=s[2]&&new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"),a=o=d.length;while(o--)c=d[o],!i&&g!==c.origType||n&&n.guid!==c.guid||s&&!s.test(c.namespace)||r&&r!==c.selector&&("**"!==r||!c.selector)||(d.splice(o,1),c.selector&&d.delegateCount--,f.remove&&f.remove.call(e,c));a&&!d.length&&(f.teardown&&!1!==f.teardown.call(e,h,v.handle)||E.removeEvent(e,p,v.handle),delete u[p])}else for(p in u)E.event.remove(e,p+t[l],n,r,!0);E.isEmptyObject(u)&&Y.remove(e,"handle events")}},dispatch:function(e){var t,n,r,i,o,a,s=new Array(arguments.length),u=E.event.fix(e),l=(Y.get(this,"events")||Object.create(null))[u.type]||[],c=E.event.special[u.type]||{};for(s[0]=u,t=1;t<arguments.length;t++)s[t]=arguments[t];if(u.delegateTarget=this,!c.preDispatch||!1!==c.preDispatch.call(this,u)){a=E.event.handlers.call(this,u,l),t=0;while((i=a[t++])&&!u.isPropagationStopped()){u.currentTarget=i.elem,n=0;while((o=i.handlers[n++])&&!u.isImmediatePropagationStopped())u.rnamespace&&!1!==o.namespace&&!u.rnamespace.test(o.namespace)||(u.handleObj=o,u.data=o.data,void 0!==(r=((E.event.special[o.origType]||{}).handle||o.handler).apply(i.elem,s))&&!1===(u.result=r)&&(u.preventDefault(),u.stopPropagation()))}return c.postDispatch&&c.postDispatch.call(this,u),u.result}},handlers:function(e,t){var n,r,i,o,a,s=[],u=t.delegateCount,l=e.target;if(u&&l.nodeType&&!("click"===e.type&&1<=e.button))for(;l!==this;l=l.parentNode||this)if(1===l.nodeType&&("click"!==e.type||!0!==l.disabled)){for(o=[],a={},n=0;n<u;n++)void 0===a[i=(r=t[n]).selector+" "]&&(a[i]=r.needsContext?-1<E(i,this).index(l):E.find(i,this,null,[l]).length),a[i]&&o.push(r);o.length&&s.push({elem:l,handlers:o})}return l=this,u<t.length&&s.push({elem:l,handlers:t.slice(u)}),s},addProp:function(t,e){Object.defineProperty(E.Event.prototype,t,{enumerable:!0,configurable:!0,get:b(e)?function(){if(this.originalEvent)return e(this.originalEvent)}:function(){if(this.originalEvent)return this.originalEvent[t]},set:function(e){Object.defineProperty(this,t,{enumerable:!0,configurable:!0,writable:!0,value:e})}})},fix:function(e){return e[E.expando]?e:new E.Event(e)},special:{load:{noBubble:!0},click:{setup:function(e){var t=this||e;return fe.test(t.type)&&t.click&&N(t,"input")&&Ee(t,"click",xe),!1},trigger:function(e){var t=this||e;return fe.test(t.type)&&t.click&&N(t,"input")&&Ee(t,"click"),!0},_default:function(e){var t=e.target;return fe.test(t.type)&&t.click&&N(t,"input")&&Y.get(t,"click")||N(t,"a")}},beforeunload:{postDispatch:function(e){void 0!==e.result&&e.originalEvent&&(e.originalEvent.returnValue=e.result)}}}},E.removeEvent=function(e,t,n){e.removeEventListener&&e.removeEventListener(t,n)},E.Event=function(e,t){if(!(this instanceof E.Event))return new E.Event(e,t);e&&e.type?(this.originalEvent=e,this.type=e.type,this.isDefaultPrevented=e.defaultPrevented||void 0===e.defaultPrevented&&!1===e.returnValue?xe:we,this.target=e.target&&3===e.target.nodeType?e.target.parentNode:e.target,this.currentTarget=e.currentTarget,this.relatedTarget=e.relatedTarget):this.type=e,t&&E.extend(this,t),this.timeStamp=e&&e.timeStamp||Date.now(),this[E.expando]=!0},E.Event.prototype={constructor:E.Event,isDefaultPrevented:we,isPropagationStopped:we,isImmediatePropagationStopped:we,isSimulated:!1,preventDefault:function(){var e=this.originalEvent;this.isDefaultPrevented=xe,e&&!this.isSimulated&&e.preventDefault()},stopPropagation:function(){var e=this.originalEvent;this.isPropagationStopped=xe,e&&!this.isSimulated&&e.stopPropagation()},stopImmediatePropagation:function(){var e=this.originalEvent;this.isImmediatePropagationStopped=xe,e&&!this.isSimulated&&e.stopImmediatePropagation(),this.stopPropagation()}},E.each({altKey:!0,bubbles:!0,cancelable:!0,changedTouches:!0,ctrlKey:!0,detail:!0,eventPhase:!0,metaKey:!0,pageX:!0,pageY:!0,shiftKey:!0,view:!0,"char":!0,code:!0,charCode:!0,key:!0,keyCode:!0,button:!0,buttons:!0,clientX:!0,clientY:!0,offsetX:!0,offsetY:!0,pointerId:!0,pointerType:!0,screenX:!0,screenY:!0,targetTouches:!0,toElement:!0,touches:!0,which:!0},E.event.addProp),E.each({focus:"focusin",blur:"focusout"},function(t,e){E.event.special[t]={setup:function(){return Ee(this,t,Ce),!1},trigger:function(){return Ee(this,t),!0},_default:function(e){return Y.get(e.target,t)},delegateType:e}}),E.each({mouseenter:"mouseover",mouseleave:"mouseout",pointerenter:"pointerover",pointerleave:"pointerout"},function(e,i){E.event.special[e]={delegateType:i,bindType:i,handle:function(e){var t,n=e.relatedTarget,r=e.handleObj;return n&&(n===this||E.contains(this,n))||(e.type=r.origType,t=r.handler.apply(this,arguments),e.type=i),t}}}),E.fn.extend({on:function(e,t,n,r){return Te(this,e,t,n,r)},one:function(e,t,n,r){return Te(this,e,t,n,r,1)},off:function(e,t,n){var r,i;if(e&&e.preventDefault&&e.handleObj)return r=e.handleObj,E(e.delegateTarget).off(r.namespace?r.origType+"."+r.namespace:r.origType,r.selector,r.handler),this;if("object"==typeof e){for(i in e)this.off(i,t,e[i]);return this}return!1!==t&&"function"!=typeof t||(n=t,t=void 0),!1===n&&(n=we),this.each(function(){E.event.remove(this,e,n,t)})}});var Se=/<script|<style|<link/i,Ae=/checked\s*(?:[^=]|=\s*.checked.)/i,Ne=/^\s*<!\[CDATA\[|\]\]>\s*$/g;function ke(e,t){return N(e,"table")&&N(11!==t.nodeType?t:t.firstChild,"tr")&&E(e).children("tbody")[0]||e}function De(e){return e.type=(null!==e.getAttribute("type"))+"/"+e.type,e}function Le(e){return"true/"===(e.type||"").slice(0,5)?e.type=e.type.slice(5):e.removeAttribute("type"),e}function je(e,t){var n,r,i,o,a,s;if(1===t.nodeType){if(Y.hasData(e)&&(s=Y.get(e).events))for(i in Y.remove(t,"handle events"),s)for(n=0,r=s[i].length;n<r;n++)E.event.add(t,i,s[i][n]);G.hasData(e)&&(o=G.access(e),a=E.extend({},o),G.set(t,a))}}function qe(n,r,i,o){r=v(r);var e,t,a,s,u,l,c=0,f=n.length,d=f-1,p=r[0],h=b(p);if(h||1<f&&"string"==typeof p&&!m.checkClone&&Ae.test(p))return n.each(function(e){var t=n.eq(e);h&&(r[0]=p.call(this,e,t.html())),qe(t,r,i,o)});if(f&&(t=(e=me(r,n[0].ownerDocument,!1,n,o)).firstChild,1===e.childNodes.length&&(e=t),t||o)){for(s=(a=E.map(ge(e,"script"),De)).length;c<f;c++)u=e,c!==d&&(u=E.clone(u,!0,!0),s&&E.merge(a,ge(u,"script"))),i.call(n[c],u,c);if(s)for(l=a[a.length-1].ownerDocument,E.map(a,Le),c=0;c<s;c++)u=a[c],pe.test(u.type||"")&&!Y.access(u,"globalEval")&&E.contains(l,u)&&(u.src&&"module"!==(u.type||"").toLowerCase()?E._evalUrl&&!u.noModule&&E._evalUrl(u.src,{nonce:u.nonce||u.getAttribute("nonce")},l):C(u.textContent.replace(Ne,""),u,l))}return n}function Oe(e,t,n){for(var r,i=t?E.filter(t,e):e,o=0;null!=(r=i[o]);o++)n||1!==r.nodeType||E.cleanData(ge(r)),r.parentNode&&(n&&ie(r)&&ve(ge(r,"script")),r.parentNode.removeChild(r));return e}E.extend({htmlPrefilter:function(e){return e},clone:function(e,t,n){var r,i,o,a,s,u,l,c=e.cloneNode(!0),f=ie(e);if(!(m.noCloneChecked||1!==e.nodeType&&11!==e.nodeType||E.isXMLDoc(e)))for(a=ge(c),r=0,i=(o=ge(e)).length;r<i;r++)s=o[r],u=a[r],void 0,"input"===(l=u.nodeName.toLowerCase())&&fe.test(s.type)?u.checked=s.checked:"input"!==l&&"textarea"!==l||(u.defaultValue=s.defaultValue);if(t)if(n)for(o=o||ge(e),a=a||ge(c),r=0,i=o.length;r<i;r++)je(o[r],a[r]);else je(e,c);return 0<(a=ge(c,"script")).length&&ve(a,!f&&ge(e,"script")),c},cleanData:function(e){for(var t,n,r,i=E.event.special,o=0;void 0!==(n=e[o]);o++)if(X(n)){if(t=n[Y.expando]){if(t.events)for(r in t.events)i[r]?E.event.remove(n,r):E.removeEvent(n,r,t.handle);n[Y.expando]=void 0}n[G.expando]&&(n[G.expando]=void 0)}}}),E.fn.extend({detach:function(e){return Oe(this,e,!0)},remove:function(e){return Oe(this,e)},text:function(e){return $(this,function(e){return void 0===e?E.text(this):this.empty().each(function(){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||(this.textContent=e)})},null,e,arguments.length)},append:function(){return qe(this,arguments,function(e){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||ke(this,e).appendChild(e)})},prepend:function(){return qe(this,arguments,function(e){if(1===this.nodeType||11===this.nodeType||9===this.nodeType){var t=ke(this,e);t.insertBefore(e,t.firstChild)}})},before:function(){return qe(this,arguments,function(e){this.parentNode&&this.parentNode.insertBefore(e,this)})},after:function(){return qe(this,arguments,function(e){this.parentNode&&this.parentNode.insertBefore(e,this.nextSibling)})},empty:function(){for(var e,t=0;null!=(e=this[t]);t++)1===e.nodeType&&(E.cleanData(ge(e,!1)),e.textContent="");return this},clone:function(e,t){return e=null!=e&&e,t=null==t?e:t,this.map(function(){return E.clone(this,e,t)})},html:function(e){return $(this,function(e){var t=this[0]||{},n=0,r=this.length;if(void 0===e&&1===t.nodeType)return t.innerHTML;if("string"==typeof e&&!Se.test(e)&&!he[(de.exec(e)||["",""])[1].toLowerCase()]){e=E.htmlPrefilter(e);try{for(;n<r;n++)1===(t=this[n]||{}).nodeType&&(E.cleanData(ge(t,!1)),t.innerHTML=e);t=0}catch(e){}}t&&this.empty().append(e)},null,e,arguments.length)},replaceWith:function(){var n=[];return qe(this,arguments,function(e){var t=this.parentNode;E.inArray(this,n)<0&&(E.cleanData(ge(this)),t&&t.replaceChild(e,this))},n)}}),E.each({appendTo:"append",prependTo:"prepend",insertBefore:"before",insertAfter:"after",replaceAll:"replaceWith"},function(e,a){E.fn[e]=function(e){for(var t,n=[],r=E(e),i=r.length-1,o=0;o<=i;o++)t=o===i?this:this.clone(!0),E(r[o])[a](t),u.apply(n,t.get());return this.pushStack(n)}});var Pe=new RegExp("^("+ee+")(?!px)[a-z%]+$","i"),He=/^--/,Ie=function(e){var t=e.ownerDocument.defaultView;return t&&t.opener||(t=g),t.getComputedStyle(e)},Re=function(e,t,n){var r,i,o={};for(i in t)o[i]=e.style[i],e.style[i]=t[i];for(i in r=n.call(e),t)e.style[i]=o[i];return r},Be=new RegExp(ne.join("|"),"i"),Me="[\\x20\\t\\r\\n\\f]",We=new RegExp("^"+Me+"+|((?:^|[^\\\\])(?:\\\\.)*)"+Me+"+$","g");function Fe(e,t,n){var r,i,o,a,s=He.test(t),u=e.style;return(n=n||Ie(e))&&(a=n.getPropertyValue(t)||n[t],s&&a&&(a=a.replace(We,"$1")||void 0),""!==a||ie(e)||(a=E.style(e,t)),!m.pixelBoxStyles()&&Pe.test(a)&&Be.test(t)&&(r=u.width,i=u.minWidth,o=u.maxWidth,u.minWidth=u.maxWidth=u.width=a,a=n.width,u.width=r,u.minWidth=i,u.maxWidth=o)),void 0!==a?a+"":a}function $e(e,t){return{get:function(){if(!e())return(this.get=t).apply(this,arguments);delete this.get}}}!function(){function e(){if(l){u.style.cssText="position:absolute;left:-11111px;width:60px;margin-top:1px;padding:0;border:0",l.style.cssText="position:relative;display:block;box-sizing:border-box;overflow:scroll;margin:auto;border:1px;padding:1px;width:60%;top:1%",re.appendChild(u).appendChild(l);var e=g.getComputedStyle(l);n="1%"!==e.top,s=12===t(e.marginLeft),l.style.right="60%",o=36===t(e.right),r=36===t(e.width),l.style.position="absolute",i=12===t(l.offsetWidth/3),re.removeChild(u),l=null}}function t(e){return Math.round(parseFloat(e))}var n,r,i,o,a,s,u=w.createElement("div"),l=w.createElement("div");l.style&&(l.style.backgroundClip="content-box",l.cloneNode(!0).style.backgroundClip="",m.clearCloneStyle="content-box"===l.style.backgroundClip,E.extend(m,{boxSizingReliable:function(){return e(),r},pixelBoxStyles:function(){return e(),o},pixelPosition:function(){return e(),n},reliableMarginLeft:function(){return e(),s},scrollboxSize:function(){return e(),i},reliableTrDimensions:function(){var e,t,n,r;return null==a&&(e=w.createElement("table"),t=w.createElement("tr"),n=w.createElement("div"),e.style.cssText="position:absolute;left:-11111px;border-collapse:separate",t.style.cssText="border:1px solid",t.style.height="1px",n.style.height="9px",n.style.display="block",re.appendChild(e).appendChild(t).appendChild(n),r=g.getComputedStyle(t),a=parseInt(r.height,10)+parseInt(r.borderTopWidth,10)+parseInt(r.borderBottomWidth,10)===t.offsetHeight,re.removeChild(e)),a}}))}();var ze=["Webkit","Moz","ms"],_e=w.createElement("div").style,Ue={};function Ve(e){var t=E.cssProps[e]||Ue[e];return t||(e in _e?e:Ue[e]=function(e){var t=e[0].toUpperCase()+e.slice(1),n=ze.length;while(n--)if((e=ze[n]+t)in _e)return e}(e)||e)}var Xe,Qe,Ye=/^(none|table(?!-c[ea]).+)/,Ge={position:"absolute",visibility:"hidden",display:"block"},Ke={letterSpacing:"0",fontWeight:"400"};function Je(e,t,n){var r=te.exec(t);return r?Math.max(0,r[2]-(n||0))+(r[3]||"px"):t}function Ze(e,t,n,r,i,o){var a="width"===t?1:0,s=0,u=0;if(n===(r?"border":"content"))return 0;for(;a<4;a+=2)"margin"===n&&(u+=E.css(e,n+ne[a],!0,i)),r?("content"===n&&(u-=E.css(e,"padding"+ne[a],!0,i)),"margin"!==n&&(u-=E.css(e,"border"+ne[a]+"Width",!0,i))):(u+=E.css(e,"padding"+ne[a],!0,i),"padding"!==n?u+=E.css(e,"border"+ne[a]+"Width",!0,i):s+=E.css(e,"border"+ne[a]+"Width",!0,i));return!r&&0<=o&&(u+=Math.max(0,Math.ceil(e["offset"+t[0].toUpperCase()+t.slice(1)]-o-u-s-.5))||0),u}function et(e,t,n){var r=Ie(e),i=(!m.boxSizingReliable()||n)&&"border-box"===E.css(e,"boxSizing",!1,r),o=i,a=Fe(e,t,r),s="offset"+t[0].toUpperCase()+t.slice(1);if(Pe.test(a)){if(!n)return a;a="auto"}return(!m.boxSizingReliable()&&i||!m.reliableTrDimensions()&&N(e,"tr")||"auto"===a||!parseFloat(a)&&"inline"===E.css(e,"display",!1,r))&&e.getClientRects().length&&(i="border-box"===E.css(e,"boxSizing",!1,r),(o=s in e)&&(a=e[s])),(a=parseFloat(a)||0)+Ze(e,t,n||(i?"border":"content"),o,r,a)+"px"}E.extend({cssHooks:{opacity:{get:function(e,t){if(t){var n=Fe(e,"opacity");return""===n?"1":n}}}},cssNumber:{animationIterationCount:!0,columnCount:!0,fillOpacity:!0,flexGrow:!0,flexShrink:!0,fontWeight:!0,gridArea:!0,gridColumn:!0,gridColumnEnd:!0,gridColumnStart:!0,gridRow:!0,gridRowEnd:!0,gridRowStart:!0,lineHeight:!0,opacity:!0,order:!0,orphans:!0,widows:!0,zIndex:!0,zoom:!0},cssProps:{},style:function(e,t,n,r){if(e&&3!==e.nodeType&&8!==e.nodeType&&e.style){var i,o,a,s=V(t),u=He.test(t),l=e.style;if(u||(t=Ve(s)),a=E.cssHooks[t]||E.cssHooks[s],void 0===n)return a&&"get"in a&&void 0!==(i=a.get(e,!1,r))?i:l[t];"string"===(o=typeof n)&&(i=te.exec(n))&&i[1]&&(n=function(e,t,n,r){var i,o,a=20,s=r?function(){return r.cur()}:function(){return E.css(e,t,"")},u=s(),l=n&&n[3]||(E.cssNumber[t]?"":"px"),c=e.nodeType&&(E.cssNumber[t]||"px"!==l&&+u)&&te.exec(E.css(e,t));if(c&&c[3]!==l){u/=2,l=l||c[3],c=+u||1;while(a--)E.style(e,t,c+l),(1-o)*(1-(o=s()/u||.5))<=0&&(a=0),c/=o;c*=2,E.style(e,t,c+l),n=n||[]}return n&&(c=+c||+u||0,i=n[1]?c+(n[1]+1)*n[2]:+n[2],r&&(r.unit=l,r.start=c,r.end=i)),i}(e,t,i),o="number"),null!=n&&n==n&&("number"!==o||u||(n+=i&&i[3]||(E.cssNumber[s]?"":"px")),m.clearCloneStyle||""!==n||0!==t.indexOf("background")||(l[t]="inherit"),a&&"set"in a&&void 0===(n=a.set(e,n,r))||(u?l.setProperty(t,n):l[t]=n))}},css:function(e,t,n,r){var i,o,a,s=V(t);return He.test(t)||(t=Ve(s)),(a=E.cssHooks[t]||E.cssHooks[s])&&"get"in a&&(i=a.get(e,!0,n)),void 0===i&&(i=Fe(e,t,r)),"normal"===i&&t in Ke&&(i=Ke[t]),""===n||n?(o=parseFloat(i),!0===n||isFinite(o)?o||0:i):i}}),E.each(["height","width"],function(e,u){E.cssHooks[u]={get:function(e,t,n){if(t)return!Ye.test(E.css(e,"display"))||e.getClientRects().length&&e.getBoundingClientRect().width?et(e,u,n):Re(e,Ge,function(){return et(e,u,n)})},set:function(e,t,n){var r,i=Ie(e),o=!m.scrollboxSize()&&"absolute"===i.position,a=(o||n)&&"border-box"===E.css(e,"boxSizing",!1,i),s=n?Ze(e,u,n,a,i):0;return a&&o&&(s-=Math.ceil(e["offset"+u[0].toUpperCase()+u.slice(1)]-parseFloat(i[u])-Ze(e,u,"border",!1,i)-.5)),s&&(r=te.exec(t))&&"px"!==(r[3]||"px")&&(e.style[u]=t,t=E.css(e,u)),Je(0,t,s)}}}),E.cssHooks.marginLeft=$e(m.reliableMarginLeft,function(e,t){if(t)return(parseFloat(Fe(e,"marginLeft"))||e.getBoundingClientRect().left-Re(e,{marginLeft:0},function(){return e.getBoundingClientRect().left}))+"px"}),E.each({margin:"",padding:"",border:"Width"},function(i,o){E.cssHooks[i+o]={expand:function(e){for(var t=0,n={},r="string"==typeof e?e.split(" "):[e];t<4;t++)n[i+ne[t]+o]=r[t]||r[t-2]||r[0];return n}},"margin"!==i&&(E.cssHooks[i+o].set=Je)}),E.fn.extend({css:function(e,t){return $(this,function(e,t,n){var r,i,o={},a=0;if(Array.isArray(t)){for(r=Ie(e),i=t.length;a<i;a++)o[t[a]]=E.css(e,t[a],!1,r);return o}return void 0!==n?E.style(e,t,n):E.css(e,t)},e,t,1<arguments.length)}}),E.fn.delay=function(r,e){return r=E.fx&&E.fx.speeds[r]||r,e=e||"fx",this.queue(e,function(e,t){var n=g.setTimeout(e,r);t.stop=function(){g.clearTimeout(n)}})},Xe=w.createElement("input"),Qe=w.createElement("select").appendChild(w.createElement("option")),Xe.type="checkbox",m.checkOn=""!==Xe.value,m.optSelected=Qe.selected,(Xe=w.createElement("input")).value="t",Xe.type="radio",m.radioValue="t"===Xe.value;var tt,nt=E.expr.attrHandle;E.fn.extend({attr:function(e,t){return $(this,E.attr,e,t,1<arguments.length)},removeAttr:function(e){return this.each(function(){E.removeAttr(this,e)})}}),E.extend({attr:function(e,t,n){var r,i,o=e.nodeType;if(3!==o&&8!==o&&2!==o)return"undefined"==typeof e.getAttribute?E.prop(e,t,n):(1===o&&E.isXMLDoc(e)||(i=E.attrHooks[t.toLowerCase()]||(E.expr.match.bool.test(t)?tt:void 0)),void 0!==n?null===n?void E.removeAttr(e,t):i&&"set"in i&&void 0!==(r=i.set(e,n,t))?r:(e.setAttribute(t,n+""),n):i&&"get"in i&&null!==(r=i.get(e,t))?r:null==(r=E.find.attr(e,t))?void 0:r)},attrHooks:{type:{set:function(e,t){if(!m.radioValue&&"radio"===t&&N(e,"input")){var n=e.value;return e.setAttribute("type",t),n&&(e.value=n),t}}}},removeAttr:function(e,t){var n,r=0,i=t&&t.match(H);if(i&&1===e.nodeType)while(n=i[r++])e.removeAttribute(n)}}),tt={set:function(e,t,n){return!1===t?E.removeAttr(e,n):e.setAttribute(n,n),n}},E.each(E.expr.match.bool.source.match(/\w+/g),function(e,t){var a=nt[t]||E.find.attr;nt[t]=function(e,t,n){var r,i,o=t.toLowerCase();return n||(i=nt[o],nt[o]=r,r=null!=a(e,t,n)?o:null,nt[o]=i),r}});var rt=/^(?:input|select|textarea|button)$/i,it=/^(?:a|area)$/i;function ot(e){return(e.match(H)||[]).join(" ")}function at(e){return e.getAttribute&&e.getAttribute("class")||""}function st(e){return Array.isArray(e)?e:"string"==typeof e&&e.match(H)||[]}E.fn.extend({prop:function(e,t){return $(this,E.prop,e,t,1<arguments.length)},removeProp:function(e){return this.each(function(){delete this[E.propFix[e]||e]})}}),E.extend({prop:function(e,t,n){var r,i,o=e.nodeType;if(3!==o&&8!==o&&2!==o)return 1===o&&E.isXMLDoc(e)||(t=E.propFix[t]||t,i=E.propHooks[t]),void 0!==n?i&&"set"in i&&void 0!==(r=i.set(e,n,t))?r:e[t]=n:i&&"get"in i&&null!==(r=i.get(e,t))?r:e[t]},propHooks:{tabIndex:{get:function(e){var t=E.find.attr(e,"tabindex");return t?parseInt(t,10):rt.test(e.nodeName)||it.test(e.nodeName)&&e.href?0:-1}}},propFix:{"for":"htmlFor","class":"className"}}),m.optSelected||(E.propHooks.selected={get:function(e){var t=e.parentNode;return t&&t.parentNode&&t.parentNode.selectedIndex,null},set:function(e){var t=e.parentNode;t&&(t.selectedIndex,t.parentNode&&t.parentNode.selectedIndex)}}),E.each(["tabIndex","readOnly","maxLength","cellSpacing","cellPadding","rowSpan","colSpan","useMap","frameBorder","contentEditable"],function(){E.propFix[this.toLowerCase()]=this}),E.fn.extend({addClass:function(t){var e,n,r,i,o,a;return b(t)?this.each(function(e){E(this).addClass(t.call(this,e,at(this)))}):(e=st(t)).length?this.each(function(){if(r=at(this),n=1===this.nodeType&&" "+ot(r)+" "){for(o=0;o<e.length;o++)i=e[o],n.indexOf(" "+i+" ")<0&&(n+=i+" ");a=ot(n),r!==a&&this.setAttribute("class",a)}}):this},removeClass:function(t){var e,n,r,i,o,a;return b(t)?this.each(function(e){E(this).removeClass(t.call(this,e,at(this)))}):arguments.length?(e=st(t)).length?this.each(function(){if(r=at(this),n=1===this.nodeType&&" "+ot(r)+" "){for(o=0;o<e.length;o++){i=e[o];while(-1<n.indexOf(" "+i+" "))n=n.replace(" "+i+" "," ")}a=ot(n),r!==a&&this.setAttribute("class",a)}}):this:this.attr("class","")},toggleClass:function(t,n){var e,r,i,o,a=typeof t,s="string"===a||Array.isArray(t);return b(t)?this.each(function(e){E(this).toggleClass(t.call(this,e,at(this),n),n)}):"boolean"==typeof n&&s?n?this.addClass(t):this.removeClass(t):(e=st(t),this.each(function(){if(s)for(o=E(this),i=0;i<e.length;i++)r=e[i],o.hasClass(r)?o.removeClass(r):o.addClass(r);else void 0!==t&&"boolean"!==a||((r=at(this))&&Y.set(this,"__className__",r),this.setAttribute&&this.setAttribute("class",r||!1===t?"":Y.get(this,"__className__")||""))}))},hasClass:function(e){var t,n,r=0;t=" "+e+" ";while(n=this[r++])if(1===n.nodeType&&-1<(" "+ot(at(n))+" ").indexOf(t))return!0;return!1}});var ut=/\r/g;E.fn.extend({val:function(n){var r,e,i,t=this[0];return arguments.length?(i=b(n),this.each(function(e){var t;1===this.nodeType&&(null==(t=i?n.call(this,e,E(this).val()):n)?t="":"number"==typeof t?t+="":Array.isArray(t)&&(t=E.map(t,function(e){return null==e?"":e+""})),(r=E.valHooks[this.type]||E.valHooks[this.nodeName.toLowerCase()])&&"set"in r&&void 0!==r.set(this,t,"value")||(this.value=t))})):t?(r=E.valHooks[t.type]||E.valHooks[t.nodeName.toLowerCase()])&&"get"in r&&void 0!==(e=r.get(t,"value"))?e:"string"==typeof(e=t.value)?e.replace(ut,""):null==e?"":e:void 0}}),E.extend({valHooks:{option:{get:function(e){var t=E.find.attr(e,"value");return null!=t?t:ot(E.text(e))}},select:{get:function(e){var t,n,r,i=e.options,o=e.selectedIndex,a="select-one"===e.type,s=a?null:[],u=a?o+1:i.length;for(r=o<0?u:a?o:0;r<u;r++)if(((n=i[r]).selected||r===o)&&!n.disabled&&(!n.parentNode.disabled||!N(n.parentNode,"optgroup"))){if(t=E(n).val(),a)return t;s.push(t)}return s},set:function(e,t){var n,r,i=e.options,o=E.makeArray(t),a=i.length;while(a--)((r=i[a]).selected=-1<E.inArray(E.valHooks.option.get(r),o))&&(n=!0);return n||(e.selectedIndex=-1),o}}}}),E.each(["radio","checkbox"],function(){E.valHooks[this]={set:function(e,t){if(Array.isArray(t))return e.checked=-1<E.inArray(E(e).val(),t)}},m.checkOn||(E.valHooks[this].get=function(e){return null===e.getAttribute("value")?"on":e.value})}),m.focusin="onfocusin"in g;var lt=/^(?:focusinfocus|focusoutblur)$/,ct=function(e){e.stopPropagation()};E.extend(E.event,{trigger:function(e,t,n,r){var i,o,a,s,u,l,c,f,d=[n||w],p=y.call(e,"type")?e.type:e,h=y.call(e,"namespace")?e.namespace.split("."):[];if(o=f=a=n=n||w,3!==n.nodeType&&8!==n.nodeType&&!lt.test(p+E.event.triggered)&&(-1<p.indexOf(".")&&(p=(h=p.split(".")).shift(),h.sort()),u=p.indexOf(":")<0&&"on"+p,(e=e[E.expando]?e:new E.Event(p,"object"==typeof e&&e)).isTrigger=r?2:3,e.namespace=h.join("."),e.rnamespace=e.namespace?new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"):null,e.result=void 0,e.target||(e.target=n),t=null==t?[e]:E.makeArray(t,[e]),c=E.event.special[p]||{},r||!c.trigger||!1!==c.trigger.apply(n,t))){if(!r&&!c.noBubble&&!x(n)){for(s=c.delegateType||p,lt.test(s+p)||(o=o.parentNode);o;o=o.parentNode)d.push(o),a=o;a===(n.ownerDocument||w)&&d.push(a.defaultView||a.parentWindow||g)}i=0;while((o=d[i++])&&!e.isPropagationStopped())f=o,e.type=1<i?s:c.bindType||p,(l=(Y.get(o,"events")||Object.create(null))[e.type]&&Y.get(o,"handle"))&&l.apply(o,t),(l=u&&o[u])&&l.apply&&X(o)&&(e.result=l.apply(o,t),!1===e.result&&e.preventDefault());return e.type=p,r||e.isDefaultPrevented()||c._default&&!1!==c._default.apply(d.pop(),t)||!X(n)||u&&b(n[p])&&!x(n)&&((a=n[u])&&(n[u]=null),E.event.triggered=p,e.isPropagationStopped()&&f.addEventListener(p,ct),n[p](),e.isPropagationStopped()&&f.removeEventListener(p,ct),E.event.triggered=void 0,a&&(n[u]=a)),e.result}},simulate:function(e,t,n){var r=E.extend(new E.Event,n,{type:e,isSimulated:!0});E.event.trigger(r,null,t)}}),E.fn.extend({trigger:function(e,t){return this.each(function(){E.event.trigger(e,t,this)})},triggerHandler:function(e,t){var n=this[0];if(n)return E.event.trigger(e,t,n,!0)}}),m.focusin||E.each({focus:"focusin",blur:"focusout"},function(n,r){var i=function(e){E.event.simulate(r,e.target,E.event.fix(e))};E.event.special[r]={setup:function(){var e=this.ownerDocument||this.document||this,t=Y.access(e,r);t||e.addEventListener(n,i,!0),Y.access(e,r,(t||0)+1)},teardown:function(){var e=this.ownerDocument||this.document||this,t=Y.access(e,r)-1;t?Y.access(e,r,t):(e.removeEventListener(n,i,!0),Y.remove(e,r))}}}),E.parseXML=function(e){var t,n;if(!e||"string"!=typeof e)return null;try{t=(new g.DOMParser).parseFromString(e,"text/xml")}catch(e){}return n=t&&t.getElementsByTagName("parsererror")[0],t&&!n||E.error("Invalid XML: "+(n?E.map(n.childNodes,function(e){return e.textContent}).join("\n"):e)),t};var ft,dt=/\[\]$/,pt=/\r?\n/g,ht=/^(?:submit|button|image|reset|file)$/i,gt=/^(?:input|select|textarea|keygen)/i;function vt(n,e,r,i){var t;if(Array.isArray(e))E.each(e,function(e,t){r||dt.test(n)?i(n,t):vt(n+"["+("object"==typeof t&&null!=t?e:"")+"]",t,r,i)});else if(r||"object"!==T(e))i(n,e);else for(t in e)vt(n+"["+t+"]",e[t],r,i)}E.param=function(e,t){var n,r=[],i=function(e,t){var n=b(t)?t():t;r[r.length]=encodeURIComponent(e)+"="+encodeURIComponent(null==n?"":n)};if(null==e)return"";if(Array.isArray(e)||e.jquery&&!E.isPlainObject(e))E.each(e,function(){i(this.name,this.value)});else for(n in e)vt(n,e[n],t,i);return r.join("&")},E.fn.extend({serialize:function(){return E.param(this.serializeArray())},serializeArray:function(){return this.map(function(){var e=E.prop(this,"elements");return e?E.makeArray(e):this}).filter(function(){var e=this.type;return this.name&&!E(this).is(":disabled")&&gt.test(this.nodeName)&&!ht.test(e)&&(this.checked||!fe.test(e))}).map(function(e,t){var n=E(this).val();return null==n?null:Array.isArray(n)?E.map(n,function(e){return{name:t.name,value:e.replace(pt,"\r\n")}}):{name:t.name,value:n.replace(pt,"\r\n")}}).get()}}),E.fn.extend({wrapAll:function(e){var t;return this[0]&&(b(e)&&(e=e.call(this[0])),t=E(e,this[0].ownerDocument).eq(0).clone(!0),this[0].parentNode&&t.insertBefore(this[0]),t.map(function(){var e=this;while(e.firstElementChild)e=e.firstElementChild;return e}).append(this)),this},wrapInner:function(n){return b(n)?this.each(function(e){E(this).wrapInner(n.call(this,e))}):this.each(function(){var e=E(this),t=e.contents();t.length?t.wrapAll(n):e.append(n)})},wrap:function(t){var n=b(t);return this.each(function(e){E(this).wrapAll(n?t.call(this,e):t)})},unwrap:function(e){return this.parent(e).not("body").each(function(){E(this).replaceWith(this.childNodes)}),this}}),E.expr.pseudos.hidden=function(e){return!E.expr.pseudos.visible(e)},E.expr.pseudos.visible=function(e){return!!(e.offsetWidth||e.offsetHeight||e.getClientRects().length)},m.createHTMLDocument=((ft=w.implementation.createHTMLDocument("").body).innerHTML="<form></form><form></form>",2===ft.childNodes.length),E.parseHTML=function(e,t,n){return"string"!=typeof e?[]:("boolean"==typeof t&&(n=t,t=!1),t||(m.createHTMLDocument?((r=(t=w.implementation.createHTMLDocument("")).createElement("base")).href=w.location.href,t.head.appendChild(r)):t=w),o=!n&&[],(i=k.exec(e))?[t.createElement(i[1])]:(i=me([e],t,o),o&&o.length&&E(o).remove(),E.merge([],i.childNodes)));var r,i,o},E.offset={setOffset:function(e,t,n){var r,i,o,a,s,u,l=E.css(e,"position"),c=E(e),f={};"static"===l&&(e.style.position="relative"),s=c.offset(),o=E.css(e,"top"),u=E.css(e,"left"),("absolute"===l||"fixed"===l)&&-1<(o+u).indexOf("auto")?(a=(r=c.position()).top,i=r.left):(a=parseFloat(o)||0,i=parseFloat(u)||0),b(t)&&(t=t.call(e,n,E.extend({},s))),null!=t.top&&(f.top=t.top-s.top+a),null!=t.left&&(f.left=t.left-s.left+i),"using"in t?t.using.call(e,f):c.css(f)}},E.fn.extend({offset:function(t){if(arguments.length)return void 0===t?this:this.each(function(e){E.offset.setOffset(this,t,e)});var e,n,r=this[0];return r?r.getClientRects().length?(e=r.getBoundingClientRect(),n=r.ownerDocument.defaultView,{top:e.top+n.pageYOffset,left:e.left+n.pageXOffset}):{top:0,left:0}:void 0},position:function(){if(this[0]){var e,t,n,r=this[0],i={top:0,left:0};if("fixed"===E.css(r,"position"))t=r.getBoundingClientRect();else{t=this.offset(),n=r.ownerDocument,e=r.offsetParent||n.documentElement;while(e&&(e===n.body||e===n.documentElement)&&"static"===E.css(e,"position"))e=e.parentNode;e&&e!==r&&1===e.nodeType&&((i=E(e).offset()).top+=E.css(e,"borderTopWidth",!0),i.left+=E.css(e,"borderLeftWidth",!0))}return{top:t.top-i.top-E.css(r,"marginTop",!0),left:t.left-i.left-E.css(r,"marginLeft",!0)}}},offsetParent:function(){return this.map(function(){var e=this.offsetParent;while(e&&"static"===E.css(e,"position"))e=e.offsetParent;return e||re})}}),E.each({scrollLeft:"pageXOffset",scrollTop:"pageYOffset"},function(t,i){var o="pageYOffset"===i;E.fn[t]=function(e){return $(this,function(e,t,n){var r;if(x(e)?r=e:9===e.nodeType&&(r=e.defaultView),void 0===n)return r?r[i]:e[t];r?r.scrollTo(o?r.pageXOffset:n,o?n:r.pageYOffset):e[t]=n},t,e,arguments.length)}}),E.each(["top","left"],function(e,n){E.cssHooks[n]=$e(m.pixelPosition,function(e,t){if(t)return t=Fe(e,n),Pe.test(t)?E(e).position()[n]+"px":t})}),E.each({Height:"height",Width:"width"},function(a,s){E.each({padding:"inner"+a,content:s,"":"outer"+a},function(r,o){E.fn[o]=function(e,t){var n=arguments.length&&(r||"boolean"!=typeof e),i=r||(!0===e||!0===t?"margin":"border");return $(this,function(e,t,n){var r;return x(e)?0===o.indexOf("outer")?e["inner"+a]:e.document.documentElement["client"+a]:9===e.nodeType?(r=e.documentElement,Math.max(e.body["scroll"+a],r["scroll"+a],e.body["offset"+a],r["offset"+a],r["client"+a])):void 0===n?E.css(e,t,i):E.style(e,t,n,i)},s,n?e:void 0,n)}})}),E.fn.extend({bind:function(e,t,n){return this.on(e,null,t,n)},unbind:function(e,t){return this.off(e,null,t)},delegate:function(e,t,n,r){return this.on(t,e,n,r)},undelegate:function(e,t,n){return 1===arguments.length?this.off(e,"**"):this.off(t,e||"**",n)},hover:function(e,t){return this.mouseenter(e).mouseleave(t||e)}}),E.each("blur focus focusin focusout resize scroll click dblclick mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave change select submit keydown keypress keyup contextmenu".split(" "),function(e,n){E.fn[n]=function(e,t){return 0<arguments.length?this.on(n,null,e,t):this.trigger(n)}});var yt=/^[\s\uFEFF\xA0]+|([^\s\uFEFF\xA0])[\s\uFEFF\xA0]+$/g;E.proxy=function(e,t){var n,r,i;if("string"==typeof t&&(n=e[t],t=e,e=n),b(e))return r=s.call(arguments,2),(i=function(){return e.apply(t||this,r.concat(s.call(arguments)))}).guid=e.guid=e.guid||E.guid++,i},E.holdReady=function(e){e?E.readyWait++:E.ready(!0)},E.isArray=Array.isArray,E.parseJSON=JSON.parse,E.nodeName=N,E.isFunction=b,E.isWindow=x,E.camelCase=V,E.type=T,E.now=Date.now,E.isNumeric=function(e){var t=E.type(e);return("number"===t||"string"===t)&&!isNaN(e-parseFloat(e))},E.trim=function(e){return null==e?"":(e+"").replace(yt,"$1")},"function"==typeof define&&define.amd&&define("jquery",[],function(){return E});var mt=g.jQuery,bt=g.$;return E.noConflict=function(e){return g.$===E&&(g.$=bt),e&&g.jQuery===E&&(g.jQuery=mt),E},"undefined"==typeof e&&(g.jQuery=g.$=E),E});
diff --git a/doc/themes/scikit-learn-modern/theme.conf b/doc/themes/scikit-learn-modern/theme.conf
deleted file mode 100644
index f86c74b1b1686..0000000000000
--- a/doc/themes/scikit-learn-modern/theme.conf
+++ /dev/null
@@ -1,10 +0,0 @@
-[theme]
-inherit = basic
-pygments_style = default
-stylesheet = css/theme.css
-
-[options]
-legacy_google_analytics = true
-analytics = true
-link_to_live_contributing_page = false
-mathjax_path =
diff --git a/doc/tune_toc.rst b/doc/tune_toc.rst
deleted file mode 100644
index 0310f0e59b4e4..0000000000000
--- a/doc/tune_toc.rst
+++ /dev/null
@@ -1,131 +0,0 @@
-.. raw:: html
-
-   <script>
-   window.addEventListener('DOMContentLoaded', function() {
-        (function($) {
-   //Function to make the index toctree collapsible
-   $(function () {
-       $('div.body .toctree-l2')
-           .click(function(event){
-               if (event.target.tagName.toLowerCase() != "a") {
-                   if ($(this).children('ul').length > 0) {
-                        $(this).attr('data-content',
-                            (!$(this).children('ul').is(':hidden')) ? '\u25ba' : '\u25bc');
-                       $(this).children('ul').toggle();
-                   }
-                   return true; //Makes links clickable
-               }
-           })
-           .mousedown(function(event){ return false; }) //Firefox highlighting fix
-           .children('ul').hide();
-       // Initialize the values
-       $('div.body li.toctree-l2:not(:has(ul))').attr('data-content', '-');
-       $('div.body li.toctree-l2:has(ul)').attr('data-content', '\u25ba');
-       $('div.body li.toctree-l2:has(ul)').css('cursor', 'pointer');
-
-       $('div.body .toctree-l2').hover(
-           function () {
-               if ($(this).children('ul').length > 0) {
-                   $(this).css('background-color', '#e5e5e5').children('ul').css('background-color', '#F0F0F0');
-                   $(this).attr('data-content',
-                       (!$(this).children('ul').is(':hidden')) ? '\u25bc' : '\u25ba');
-               }
-               else {
-                   $(this).css('background-color', '#F9F9F9');
-               }
-           },
-           function () {
-               $(this).css('background-color', 'white').children('ul').css('background-color', 'white');
-               if ($(this).children('ul').length > 0) {
-                   $(this).attr('data-content',
-                       (!$(this).children('ul').is(':hidden')) ? '\u25bc' : '\u25ba');
-               }
-           }
-       );
-   });
-        })(jQuery);
-    });
-   </script>
-
-  <style type="text/css">
-    div.body li, div.body ul {
-        transition-duration: 0.2s;
-    }
-
-    div.body li.toctree-l1 {
-        padding: 5px 0 0;
-        list-style-type: none;
-        font-size: 150%;
-        background-color: #f2f2f2;
-        font-weight: normal;
-        color: #20435c;
-        margin-left: 0;
-        margin-bottom: 1.2em;
-        font-weight: bold;
-        }
-
-    div.body li.toctree-l1 a {
-        color: #314F64;
-    }
-
-    div.body li.toctree-l1 > a {
-        margin-left: 0.75rem;
-    }
-
-    div.body li.toctree-l2 {
-        padding: 0.25em 0 0.25em 0 ;
-        list-style-type: none;
-        background-color: #FFFFFF;
-        font-size: 85% ;
-        font-weight: normal;
-        margin-left: 0;
-    }
-
-    div.body li.toctree-l2 ul {
-        padding-left: 40px ;
-    }
-
-    div.body li.toctree-l2:before {
-        content: attr(data-content);
-        font-size: 1rem;
-        color: #777;
-        display: inline-block;
-        width: 1.5rem;
-    }
-
-    div.body li.toctree-l3 {
-        font-size: 88% ;
-        list-style-type: square;
-        font-weight: normal;
-        margin-left: 0;
-    }
-
-    div.body li.toctree-l4 {
-        font-size: 93% ;
-        list-style-type: circle;
-        font-weight: normal;
-        margin-left: 0;
-    }
-
-    div.body div.topic li.toctree-l1 {
-        font-size: 100% ;
-        font-weight: bold;
-        background-color: transparent;
-        margin-bottom: 0;
-        margin-left: 1.5em;
-        display:inline;
-    }
-
-    div.body div.topic p {
-        font-size: 90% ;
-        margin: 0.4ex;
-    }
-
-    div.body div.topic p.topic-title {
-        display:inline;
-        font-size: 100% ;
-        margin-bottom: 0;
-    }
-  </style>
-
-
diff --git a/doc/tutorial/basic/tutorial.rst b/doc/tutorial/basic/tutorial.rst
deleted file mode 100644
index 27dddb4e0e909..0000000000000
--- a/doc/tutorial/basic/tutorial.rst
+++ /dev/null
@@ -1,351 +0,0 @@
-.. _introduction:
-
-An introduction to machine learning with scikit-learn
-=====================================================
-
-.. topic:: Section contents
-
-    In this section, we introduce the `machine learning
-    <https://en.wikipedia.org/wiki/Machine_learning>`_
-    vocabulary that we use throughout scikit-learn and give a
-    simple learning example.
-
-
-Machine learning: the problem setting
--------------------------------------
-
-In general, a learning problem considers a set of n
-`samples <https://en.wikipedia.org/wiki/Sample_(statistics)>`_ of
-data and then tries to predict properties of unknown data. If each sample is
-more than a single number and, for instance, a multi-dimensional entry
-(aka `multivariate <https://en.wikipedia.org/wiki/Multivariate_random_variable>`_
-data), it is said to have several attributes or **features**.
-
-Learning problems fall into a few categories:
-
-* `supervised learning <https://en.wikipedia.org/wiki/Supervised_learning>`_,
-  in which the data comes with additional attributes that we want to predict
-  (:ref:`Click here <supervised-learning>`
-  to go to the scikit-learn supervised learning page).This problem
-  can be either:
-
-  * `classification
-    <https://en.wikipedia.org/wiki/Classification_in_machine_learning>`_:
-    samples belong to two or more classes and we
-    want to learn from already labeled data how to predict the class
-    of unlabeled data. An example of a classification problem would
-    be handwritten digit recognition, in which the aim is
-    to assign each input vector to one of a finite number of discrete
-    categories.  Another way to think of classification is as a discrete
-    (as opposed to continuous) form of supervised learning where one has a
-    limited number of categories and for each of the n samples provided,
-    one is to try to label them with the correct category or class.
-
-  * `regression <https://en.wikipedia.org/wiki/Regression_analysis>`_:
-    if the desired output consists of one or more
-    continuous variables, then the task is called *regression*. An
-    example of a regression problem would be the prediction of the
-    length of a salmon as a function of its age and weight.
-
-* `unsupervised learning <https://en.wikipedia.org/wiki/Unsupervised_learning>`_,
-  in which the training data consists of a set of input vectors x
-  without any corresponding target values. The goal in such problems
-  may be to discover groups of similar examples within the data, where
-  it is called `clustering <https://en.wikipedia.org/wiki/Cluster_analysis>`_,
-  or to determine the distribution of data within the input space, known as
-  `density estimation <https://en.wikipedia.org/wiki/Density_estimation>`_, or
-  to project the data from a high-dimensional space down to two or three
-  dimensions for the purpose of *visualization*
-  (:ref:`Click here <unsupervised-learning>`
-  to go to the Scikit-Learn unsupervised learning page).
-
-.. topic:: Training set and testing set
-
-    Machine learning is about learning some properties of a data set
-    and then testing those properties against another data set. A common
-    practice in machine learning is to evaluate an algorithm by splitting a data
-    set into two. We call one of those sets the **training set**, on which we
-    learn some properties; we call the other set the **testing set**, on which
-    we test the learned properties.
-
-
-.. _loading_example_dataset:
-
-Loading an example dataset
---------------------------
-
-`scikit-learn` comes with a few standard datasets, for instance the
-`iris <https://en.wikipedia.org/wiki/Iris_flower_data_set>`_ and `digits
-<https://archive.ics.uci.edu/ml/datasets/Pen-Based+Recognition+of+Handwritten+Digits>`_
-datasets for classification and the `diabetes dataset
-<https://www4.stat.ncsu.edu/~boos/var.select/diabetes.html>`_ for regression.
-
-In the following, we start a Python interpreter from our shell and then
-load the ``iris`` and ``digits`` datasets.  Our notational convention is that
-``$`` denotes the shell prompt while ``>>>`` denotes the Python
-interpreter prompt::
-
-  $ python
-  >>> from sklearn import datasets
-  >>> iris = datasets.load_iris()
-  >>> digits = datasets.load_digits()
-
-A dataset is a dictionary-like object that holds all the data and some
-metadata about the data. This data is stored in the ``.data`` member,
-which is a ``n_samples, n_features`` array. In the case of supervised
-problems, one or more response variables are stored in the ``.target`` member. More
-details on the different datasets can be found in the :ref:`dedicated
-section <datasets>`.
-
-For instance, in the case of the digits dataset, ``digits.data`` gives
-access to the features that can be used to classify the digits samples::
-
-  >>> print(digits.data)
-  [[ 0.   0.   5. ...   0.   0.   0.]
-   [ 0.   0.   0. ...  10.   0.   0.]
-   [ 0.   0.   0. ...  16.   9.   0.]
-   ...
-   [ 0.   0.   1. ...   6.   0.   0.]
-   [ 0.   0.   2. ...  12.   0.   0.]
-   [ 0.   0.  10. ...  12.   1.   0.]]
-
-and ``digits.target`` gives the ground truth for the digit dataset, that
-is the number corresponding to each digit image that we are trying to
-learn::
-
-  >>> digits.target
-  array([0, 1, 2, ..., 8, 9, 8])
-
-.. topic:: Shape of the data arrays
-
-    The data is always a 2D array, shape ``(n_samples, n_features)``, although
-    the original data may have had a different shape. In the case of the
-    digits, each original sample is an image of shape ``(8, 8)`` and can be
-    accessed using::
-
-      >>> digits.images[0]
-      array([[  0.,   0.,   5.,  13.,   9.,   1.,   0.,   0.],
-             [  0.,   0.,  13.,  15.,  10.,  15.,   5.,   0.],
-             [  0.,   3.,  15.,   2.,   0.,  11.,   8.,   0.],
-             [  0.,   4.,  12.,   0.,   0.,   8.,   8.,   0.],
-             [  0.,   5.,   8.,   0.,   0.,   9.,   8.,   0.],
-             [  0.,   4.,  11.,   0.,   1.,  12.,   7.,   0.],
-             [  0.,   2.,  14.,   5.,  10.,  12.,   0.,   0.],
-             [  0.,   0.,   6.,  13.,  10.,   0.,   0.,   0.]])
-
-    The :ref:`simple example on this dataset
-    <sphx_glr_auto_examples_classification_plot_digits_classification.py>` illustrates how starting
-    from the original problem one can shape the data for consumption in
-    scikit-learn.
-
-.. topic:: Loading from external datasets
-
-    To load from an external dataset, please refer to :ref:`loading external datasets <external_datasets>`.
-
-Learning and predicting
-------------------------
-
-In the case of the digits dataset, the task is to predict, given an image,
-which digit it represents. We are given samples of each of the 10
-possible classes (the digits zero through nine) on which we *fit* an
-`estimator <https://en.wikipedia.org/wiki/Estimator>`_ to be able to *predict*
-the classes to which unseen samples belong.
-
-In scikit-learn, an estimator for classification is a Python object that
-implements the methods ``fit(X, y)`` and ``predict(T)``.
-
-An example of an estimator is the class ``sklearn.svm.SVC``, which
-implements `support vector classification
-<https://en.wikipedia.org/wiki/Support_vector_machine>`_. The
-estimator's constructor takes as arguments the model's parameters.
-
-For now, we will consider the estimator as a black box::
-
-  >>> from sklearn import svm
-  >>> clf = svm.SVC(gamma=0.001, C=100.)
-
-.. topic:: Choosing the parameters of the model
-
-  In this example, we set the value of ``gamma`` manually.
-  To find good values for these parameters, we can use tools
-  such as :ref:`grid search <grid_search>` and :ref:`cross validation
-  <cross_validation>`.
-
-The ``clf`` (for classifier) estimator instance is first
-fitted to the model; that is, it must *learn* from the model. This is
-done by passing our training set to the ``fit`` method. For the training
-set, we'll use all the images from our dataset, except for the last
-image, which we'll reserve for our predicting. We select the training set with
-the ``[:-1]`` Python syntax, which produces a new array that contains all but
-the last item from ``digits.data``::
-
-  >>> clf.fit(digits.data[:-1], digits.target[:-1])
-  SVC(C=100.0, gamma=0.001)
-
-Now you can *predict* new values. In this case, you'll predict using the last
-image from ``digits.data``. By predicting, you'll determine the image from the
-training set that best matches the last image.
-
-
-  >>> clf.predict(digits.data[-1:])
-  array([8])
-
-The corresponding image is:
-
-.. image:: /auto_examples/datasets/images/sphx_glr_plot_digits_last_image_001.png
-    :target: ../../auto_examples/datasets/plot_digits_last_image.html
-    :align: center
-    :scale: 50
-
-As you can see, it is a challenging task: after all, the images are of poor
-resolution. Do you agree with the classifier?
-
-A complete example of this classification problem is available as an
-example that you can run and study:
-:ref:`sphx_glr_auto_examples_classification_plot_digits_classification.py`.
-
-Conventions
------------
-
-scikit-learn estimators follow certain rules to make their behavior more
-predictive.  These are described in more detail in the :ref:`glossary`.
-
-Type casting
-~~~~~~~~~~~~
-
-Where possible, input of type ``float32`` will maintain its data type. Otherwise
-input will be cast to ``float64``::
-
-  >>> import numpy as np
-  >>> from sklearn import kernel_approximation
-
-  >>> rng = np.random.RandomState(0)
-  >>> X = rng.rand(10, 2000)
-  >>> X = np.array(X, dtype='float32')
-  >>> X.dtype
-  dtype('float32')
-
-  >>> transformer = kernel_approximation.RBFSampler()
-  >>> X_new = transformer.fit_transform(X)
-  >>> X_new.dtype
-  dtype('float32')
-
-In this example, ``X`` is ``float32``, and is unchanged by ``fit_transform(X)``.
-
-Using `float32`-typed training (or testing) data is often more
-efficient than using the usual ``float64`` ``dtype``: it allows to
-reduce the memory usage and sometimes also reduces processing time
-by leveraging the vector instructions of the CPU. However it can
-sometimes lead to numerical stability problems causing the algorithm
-to be more sensitive to the scale of the values and :ref:`require
-adequate preprocessing<preprocessing_scaler>`.
-
-Keep in mind however that not all scikit-learn estimators attempt to
-work in `float32` mode. For instance, some transformers will always
-cast their input to `float64` and return `float64` transformed
-values as a result.
-
-Regression targets are cast to ``float64`` and classification targets are
-maintained::
-
-    >>> from sklearn import datasets
-    >>> from sklearn.svm import SVC
-    >>> iris = datasets.load_iris()
-    >>> clf = SVC()
-    >>> clf.fit(iris.data, iris.target)
-    SVC()
-
-    >>> list(clf.predict(iris.data[:3]))
-    [0, 0, 0]
-
-    >>> clf.fit(iris.data, iris.target_names[iris.target])
-    SVC()
-
-    >>> list(clf.predict(iris.data[:3]))
-    ['setosa', 'setosa', 'setosa']
-
-Here, the first ``predict()`` returns an integer array, since ``iris.target``
-(an integer array) was used in ``fit``. The second ``predict()`` returns a string
-array, since ``iris.target_names`` was for fitting.
-
-Refitting and updating parameters
-~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-
-Hyper-parameters of an estimator can be updated after it has been constructed
-via the :term:`set_params()<set_params>` method. Calling ``fit()`` more than
-once will overwrite what was learned by any previous ``fit()``::
-
-  >>> import numpy as np
-  >>> from sklearn.datasets import load_iris
-  >>> from sklearn.svm import SVC
-  >>> X, y = load_iris(return_X_y=True)
-
-  >>> clf = SVC()
-  >>> clf.set_params(kernel='linear').fit(X, y)
-  SVC(kernel='linear')
-  >>> clf.predict(X[:5])
-  array([0, 0, 0, 0, 0])
-
-  >>> clf.set_params(kernel='rbf').fit(X, y)
-  SVC()
-  >>> clf.predict(X[:5])
-  array([0, 0, 0, 0, 0])
-
-Here, the default kernel ``rbf`` is first changed to ``linear`` via
-:func:`SVC.set_params()<sklearn.svm.SVC.set_params>` after the estimator has
-been constructed, and changed back to ``rbf`` to refit the estimator and to
-make a second prediction.
-
-Multiclass vs. multilabel fitting
-~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-
-When using :class:`multiclass classifiers <sklearn.multiclass>`,
-the learning and prediction task that is performed is dependent on the format of
-the target data fit upon::
-
-    >>> from sklearn.svm import SVC
-    >>> from sklearn.multiclass import OneVsRestClassifier
-    >>> from sklearn.preprocessing import LabelBinarizer
-
-    >>> X = [[1, 2], [2, 4], [4, 5], [3, 2], [3, 1]]
-    >>> y = [0, 0, 1, 1, 2]
-
-    >>> classif = OneVsRestClassifier(estimator=SVC(random_state=0))
-    >>> classif.fit(X, y).predict(X)
-    array([0, 0, 1, 1, 2])
-
-In the above case, the classifier is fit on a 1d array of multiclass labels and
-the ``predict()`` method therefore provides corresponding multiclass predictions.
-It is also possible to fit upon a 2d array of binary label indicators::
-
-    >>> y = LabelBinarizer().fit_transform(y)
-    >>> classif.fit(X, y).predict(X)
-    array([[1, 0, 0],
-           [1, 0, 0],
-           [0, 1, 0],
-           [0, 0, 0],
-           [0, 0, 0]])
-
-Here, the classifier is ``fit()``  on a 2d binary label representation of ``y``,
-using the :class:`LabelBinarizer <sklearn.preprocessing.LabelBinarizer>`.
-In this case ``predict()`` returns a 2d array representing the corresponding
-multilabel predictions.
-
-Note that the fourth and fifth instances returned all zeroes, indicating that
-they matched none of the three labels ``fit`` upon. With multilabel outputs, it
-is similarly possible for an instance to be assigned multiple labels::
-
-  >>> from sklearn.preprocessing import MultiLabelBinarizer
-  >>> y = [[0, 1], [0, 2], [1, 3], [0, 2, 3], [2, 4]]
-  >>> y = MultiLabelBinarizer().fit_transform(y)
-  >>> classif.fit(X, y).predict(X)
-  array([[1, 1, 0, 0, 0],
-         [1, 0, 1, 0, 0],
-         [0, 1, 0, 1, 0],
-         [1, 0, 1, 0, 0],
-         [1, 0, 1, 0, 0]])
-
-In this case, the classifier is fit upon instances each assigned multiple labels.
-The :class:`MultiLabelBinarizer <sklearn.preprocessing.MultiLabelBinarizer>` is
-used to binarize the 2d array of multilabels to ``fit`` upon. As a result,
-``predict()`` returns a 2d array with multiple predicted labels for each instance.
diff --git a/doc/tutorial/common_includes/info.txt b/doc/tutorial/common_includes/info.txt
deleted file mode 100644
index f8e44fec90f2f..0000000000000
--- a/doc/tutorial/common_includes/info.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-Meant to share common RST file snippets that we want to reuse by inclusion 
-in the real tutorial in order to lower the maintenance burden 
-of redundant sections.
diff --git a/doc/tutorial/index.rst b/doc/tutorial/index.rst
deleted file mode 100644
index cfd63719321f2..0000000000000
--- a/doc/tutorial/index.rst
+++ /dev/null
@@ -1,38 +0,0 @@
-.. Places global toc into the sidebar
-
-:globalsidebartoc: True
-
-.. _tutorial_menu:
-
-
-.. include:: ../includes/big_toc_css.rst
-.. include:: ../tune_toc.rst
-
-======================
-scikit-learn Tutorials
-======================
-
-|
-
-.. toctree::
-   :maxdepth: 2
-
-   basic/tutorial.rst
-   statistical_inference/index.rst
-   text_analytics/working_with_text_data.rst
-   machine_learning_map/index
-   ../presentations
-
-|
-
-.. note:: **Doctest Mode**
-
-   The code-examples in the above tutorials are written in a
-   *python-console* format. If you wish to easily execute these examples
-   in **IPython**, use::
-
-	%doctest_mode
-
-   in the IPython-console. You can then simply copy and paste the examples
-   directly into IPython without having to worry about removing the **>>>**
-   manually.
diff --git a/doc/tutorial/machine_learning_map/ML_MAPS_README.txt b/doc/tutorial/machine_learning_map/ML_MAPS_README.txt
deleted file mode 100644
index 114ecb2d13f59..0000000000000
--- a/doc/tutorial/machine_learning_map/ML_MAPS_README.txt
+++ /dev/null
@@ -1,93 +0,0 @@
-Machine Learning Cheat Sheet (for scikit-learn)
-===============================================
-
-This document is intended to explain how to edit
-the machine learning cheat sheet, originally created
-by Andreas Mueller:
-
-(https://peekaboo-vision.blogspot.de/2013/01/machine-learning-cheat-sheet-for-scikit.html)
-
-The image is made interactive using an imagemap, and uses the jQuery Map Highlight plugin module
-by David Lynch (https://davidlynch.org/projects/maphilight/docs/) to highlight
-the different items on the image upon mouseover.
-
-Modifying the map on the docs is currently a little bit tedious,
-so I'll try to make it as simple as possible.
-
-1. Editing the layout of the map and its paths.
-------------------------------------------------
-
-Use a Graphics editor like Inkscape Vector Graphics Editor
-to open the ml_map.svg file, in this folder. From there
-you can move objects around, etc. as you need.
-
-Save when done, and make sure to export a .PNG file
-to replace the old-outdated ml_map.png, as that file
-is used as a background image.
-
-2. Accessing the paths of the SVG file and exporting them.
-----------------------------------------------------------
-
-Use an image manipulation package like GIMP Image Editor to open
-the ml_map.svg file, in this folder. With GIMP, make sure
-to select 'Import paths'.
-
-Once the image has been opened, you can see all imported paths on the paths tab.
-You can edit these or create new paths. In GIMP, right-clicking one of the
-paths and choosing: Path Tool will allow you to see the paths on
-the image. The paths will be exported later and will be used to
-make the click able regions on our image map.
-
-3. Export paths as SVG files
-----------------------------
-
-After you've edited a path or created a new one, right click it on
-the paths menu and choose 'Export Path..'. This way we extract just
-that path on its own as 'new_area.svg' for example.
-
-4. Edit the SVG file
----------------------
-Using a script made by David Lynch, we will convert the svg files into
-html maps. To do this, open the svg file in question in any text editor.
-Make sure that the 'width' and 'height' are not in 'in' or 'px', i.e
-"100" is OK, but "100px" or "1.25in" are not.
-
-Then wrap the <path> tags in <g> and </g> tags.
-Then the file is ready for the script.
-
-5. From SVG to HTML map
------------------------
-
-Use the provided svg2imagemap.py script on your edited svg file:
-
-$ python svg2imagemap.py new_area.svg
-
-where new_area.svg is our file.
-
-6. Add the new map to the main html file
-------------------------------------------
-
-Copy the code from the newly created 'new_area.html'
-file. Open the ml_map.html file.
-
-Add the <area href=....... ></area> that you copied
-after the last </area> tag in the ml_map.html file.
-
-Add the link address to 'href' and a tooltip to
-'title' within your <area ...> tag.
-
-If you wish to add the green and blue hover effect
-to the area, add
-data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'
-
-to your  area tag, as done in the other <area..> tags above.
-
-Save the file, and you're done.
-
------------------------------------------------------
-
-I'll take some time to make some scripts to automate this process
-a bit more at some point, as it is not difficult to do,
-but tedious.
-
--Jaques Grobler
diff --git a/doc/tutorial/machine_learning_map/index.rst b/doc/tutorial/machine_learning_map/index.rst
deleted file mode 100644
index 708f8bc43bf73..0000000000000
--- a/doc/tutorial/machine_learning_map/index.rst
+++ /dev/null
@@ -1,55 +0,0 @@
-.. _ml_map:
-
-
-.. include:: ../../includes/big_toc_css.rst
-
-Choosing the right estimator
-=======================================================
-
-
-Often the hardest part of solving a machine learning problem can
-be finding the right estimator for the job.
-
-Different estimators are better suited for different types of data
-and different problems.
-
-The flowchart below is designed to give users a bit of
-a rough guide on how to approach problems with regard to
-which estimators to try on your data.
-
-Click on any estimator in the chart below to see its documentation.
-
-
-
-.. raw:: html
-
-        <img src="../../_static/ml_map.png" class="map" alt="Move mouse over image" usemap="#imgmap">
-      	    <map name="imgmap">
-	    	<area href="../../documentation.html" title="Back to Documentation" shape="poly" coords="97,1094, 76,1097, 56,1105, 40,1120, 35,1132, 34,1145, 35,1153, 40,1162, 46,1171, 54,1177, 62,1182, 72,1187, 81,1188, 100,1189, 118,1186, 127,1182, 136,1177, 146,1170, 152,1162, 155,1158, 158,1146, 158,1126, 143,1110, 138,1105, 127,1100, 97,1094"></area>
-		<area href="../../modules/linear_model.html#elastic-net" title="Elastic Net Documentation" shape="poly" coords="1556,446, 1556,446, 1556,476, 1556,476, 1556,476, 1676,476, 1676,476, 1676,476, 1676,446, 1676,446, 1676,446, 1556,446, 1556,446" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/ensemble.html" title="Ensemble Methods Documentation" shape="poly" coords="209,200, 209,200, 209,252, 209,252, 209,252, 332,252, 332,252, 332,252, 332,200, 332,200, 332,200, 209,200, 209,200" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/ensemble.html" title="Ensemble Methods Documentation" shape="poly" coords="1828,506, 1828,506, 1828,544, 1828,544, 1828,544, 2054,544, 2054,544, 2054,544, 2054,506, 2054,506, 2054,506, 1828,506, 1828,506" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/mixture.html" title="Gaussian mixture models Documentation" shape="poly" coords="142,637, 142,637, 142,667, 142,667, 142,667, 265,667, 265,667, 265,667, 265,637, 265,637, 265,637, 142,637, 142,637" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/manifold.html#isomap" title="Isomap Documentation" shape="poly" coords="1500,799, 1500,799, 1500,844, 1500,844, 1500,844, 1618,844, 1618,844, 1618,844, 1618,800, 1618,800, 1618,800, 1500,799, 1500,799" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/kernel_approximation.html" title="Kernel Approximation Documentation" shape="poly" coords="1477,982, 1477,982, 1477,1055, 1477,1055, 1477,1055, 1638,1055, 1638,1055, 1638,1055, 1638,982, 1638,982, 1638,982, 1477,982, 1477,982" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/kernel_approximation.html" title="Kernel Approximation Documentation" shape="poly" coords="472,100, 472,100, 472,173, 472,173, 472,173, 634,173, 634,173, 634,173, 634,100, 634,100, 634,100, 472,100, 472,100" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/clustering.html#k-means" title="KMeans Documentation" shape="poly" coords="377,605, 377,605, 377,655, 377,655, 377,655, 476,655, 476,655, 476,655, 476,605, 476,605, 476,605, 377,605, 377,605" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/neighbors.html" title="Nearest Neighbors" shape="poly" coords="440,219, 440,219, 440,293, 440,293, 440,293, 574,293, 574,293, 574,293, 574,219, 574,219, 574,219, 440,219, 440,219" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/linear_model.html#lasso" title="Lasso Documentation" shape="poly" coords="1550,408, 1550,408, 1550,436, 1550,436, 1550,436, 1671,436, 1671,436, 1671,436, 1671,408, 1671,408, 1671,408, 1550,408, 1550,408" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/svm.html#classification" title="LinearSVC Documentation" shape="poly" coords="609,419, 609,419, 609,492, 609,492, 609,492, 693,492, 693,492, 693,492, 693,419, 693,419, 693,419, 609,419, 609,419" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/manifold.html#locally-linear-embedding" title="Locally Linear Embedding Documentation" shape="poly" coords="1719,888, 1719,888, 1719,945, 1719,945, 1719,945, 1819,945, 1819,945, 1819,945, 1819,888, 1819,888, 1819,888, 1719,888, 1719,888" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/clustering.html#mean-shift" title="Mean Shift Documentation" shape="poly" coords="562,949, 562,949, 562,981, 562,981, 562,981, 682,981, 682,981, 682,981, 682,949, 682,949, 682,949, 562,949, 562,949" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/clustering.html#mini-batch-k-means" title="Mini Batch K-means Documentation" shape="poly" coords="343,917, 343,917, 343,990, 343,990, 343,990, 461,990, 461,990, 461,990, 461,917, 461,917, 461,917, 343,917, 343,917" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/naive_bayes.html" title="Naive Bayes Documentation" shape="poly" coords="194,339, 194,339, 194,412, 194,412, 194,412, 294,412, 294,412, 294,412, 294,339, 294,339, 294,339, 194,339, 194,339" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/decomposition.html#principal-component-analysis-pca" title="Principal Component Analysis Documentation" shape="poly" coords="1208,778, 1208,778, 1208,851, 1208,851, 1208,851, 1350,851, 1350,851, 1350,851, 1350,778, 1350,778, 1350,778, 1208,778, 1208,778" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/linear_model.html#ridge-regression" title="Ridge Regression Documentation" shape="poly" coords="1696,648, 1696,648, 1696,687, 1696,687, 1696,687, 1890,687, 1890,687, 1890,687, 1890,648, 1890,648, 1890,648, 1696,648, 1696,648" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/sgd.html#classification" title="SGD Classifier Documentation" shape="poly" coords="691,205, 691,205, 691,278, 691,278, 691,278, 803,278, 803,278, 803,278, 803,205, 803,205, 803,205, 691,205, 691,205" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/sgd.html#regression" title="SGD Regression Documentation" shape="poly" coords="1317,425, 1317,425, 1317,498, 1317,498, 1317,498, 1436,498, 1436,498, 1436,498, 1436,425, 1436,425, 1436,425, 1317,425, 1317,425" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/clustering.html#spectral-clustering" title="Spectral Clustering Documentation" shape="poly" coords="145,572, 145,572, 145,631, 145,631, 145,631, 267,631, 267,631, 267,631, 267,572, 267,572, 267,572, 145,572, 145,572" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/manifold.html#spectral-embedding" title="Spectral Embedding Documentation" shape="poly" coords="1502,849, 1502,849, 1502,910, 1502,910, 1502,910, 1618,910, 1618,910, 1618,910, 1618,849, 1618,849, 1618,849, 1502,849, 1502,849" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/svm.html#classification" title="SVC Documentation" shape="poly" coords="210,157, 210,157, 210,194, 210,194, 210,194, 333,194, 333,194, 333,194, 333,157, 333,157, 333,157, 210,157, 210,157" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/svm.html#regression" title="SVR Documentation" shape="poly" coords="1696,692, 1696,692, 1696,732, 1696,732, 1696,732, 1890,732, 1890,732, 1890,732, 1890,692, 1890,692, 1890,692, 1696,692, 1696,692" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/svm.html#regression" title="SVR Documentation" shape="poly" coords="1831,458, 1831,458, 1831,496, 1831,496, 1831,496, 2052,496, 2052,496, 2052,496, 2052,458, 2052,458, 2052,458, 1831,458, 1831,458" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-		<area href="../../modules/mixture.html#bgmm" title=" Bayesian GMM Documentation" shape="poly" coords="562,994, 562,994, 562,1026, 562,1026, 562,1026, 682,1026, 682,1026, 682,1026, 682,994, 682,994, 682,994, 562,994, 562,994" data-maphilight='{"strokeColor":"0000ff","strokeWidth":5,"fillColor":"66FF66","fillOpacity":0.4}'></area>
-	    </map>
-	</img>
diff --git a/doc/tutorial/machine_learning_map/parse_path.py b/doc/tutorial/machine_learning_map/parse_path.py
deleted file mode 100644
index b1c68cec7f76b..0000000000000
--- a/doc/tutorial/machine_learning_map/parse_path.py
+++ /dev/null
@@ -1,192 +0,0 @@
-#!/usr/local/bin/python
-
-"""
-Based on: http://wxpsvg.googlecode.com/svn/trunk/svg/pathdata.py
-According to that project, this file is licensed under the LGPL
-"""
-
-try:
-    from pyparsing import (ParserElement, Literal, Word, CaselessLiteral, 
-        Optional, Combine, Forward, ZeroOrMore, nums, oneOf, Group, ParseException, OneOrMore)
-except ImportError:
-    import sys
-    sys.exit("pyparsing is required")
-    
-    
-#ParserElement.enablePackrat()
-
-def Command(char):
-    """ Case insensitive but case preserving"""
-    return CaselessPreservingLiteral(char)
-    
-def Arguments(token):
-    return Group(token)
-    
-    
-class CaselessPreservingLiteral(CaselessLiteral):
-    """ Like CaselessLiteral, but returns the match as found
-        instead of as defined.
-    """
-    def __init__( self, matchString ):
-        super().__init__(matchString.upper())
-        self.name = "'%s'" % matchString
-        self.errmsg = "Expected " + self.name
-        self.myException.msg = self.errmsg
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        test = instring[ loc:loc+self.matchLen ]
-        if test.upper() == self.match:
-            return loc+self.matchLen, test
-        #~ raise ParseException( instring, loc, self.errmsg )
-        exc = self.myException
-        exc.loc = loc
-        exc.pstr = instring
-        raise exc   
-    
-def Sequence(token):
-    """ A sequence of the token"""
-    return OneOrMore(token+maybeComma)
-
-digit_sequence = Word(nums)
-
-sign = oneOf("+ -")
-
-def convertToFloat(s, loc, toks):
-    try:
-        return float(toks[0])
-    except BaseException as e:
-        raise ParseException(loc, "invalid float format %s" % toks[0]) from e
-
-exponent = CaselessLiteral("e")+Optional(sign)+Word(nums)
-
-#note that almost all these fields are optional, 
-#and this can match almost anything. We rely on Pythons built-in
-#float() function to clear out invalid values - loosely matching like this
-#speeds up parsing quite a lot
-floatingPointConstant = Combine(
-    Optional(sign) + 
-    Optional(Word(nums)) + 
-    Optional(Literal(".") + Optional(Word(nums)))+
-    Optional(exponent)
-)
-
-floatingPointConstant.setParseAction(convertToFloat)
-
-number = floatingPointConstant
-
-#same as FP constant but don't allow a - sign
-nonnegativeNumber = Combine(
-    Optional(Word(nums)) + 
-    Optional(Literal(".") + Optional(Word(nums)))+
-    Optional(exponent)
-)
-nonnegativeNumber.setParseAction(convertToFloat)
-
-coordinate = number
-
-#comma or whitespace can separate values all over the place in SVG
-maybeComma = Optional(Literal(',')).suppress()
-
-coordinateSequence = Sequence(coordinate)
-
-coordinatePair = (coordinate + maybeComma + coordinate).setParseAction(tuple)
-coordinatePairSequence = Sequence(coordinatePair)
-
-coordinatePairPair = coordinatePair + maybeComma + coordinatePair
-coordinatePairPairSequence = Sequence(Group(coordinatePairPair))
-
-coordinatePairTriple = coordinatePair + maybeComma + coordinatePair + maybeComma + coordinatePair
-coordinatePairTripleSequence = Sequence(Group(coordinatePairTriple))
-
-#commands
-lineTo = Group(Command("L") + Arguments(coordinatePairSequence))
-curve = Group(Command("C") + Arguments(coordinatePairSequence))
-
-moveTo = Group(Command("M") + Arguments(coordinatePairSequence))
-
-closePath = Group(Command("Z")).setParseAction(lambda t: ('Z', (None,)))
-
-flag = oneOf("1 0").setParseAction(lambda t: bool(int((t[0]))))
-
-arcRadius = (
-    nonnegativeNumber + maybeComma + #rx
-    nonnegativeNumber #ry
-).setParseAction(tuple)
-
-arcFlags = (flag + maybeComma + flag).setParseAction(tuple)
-
-ellipticalArcArgument = Group(
-    arcRadius + maybeComma + #rx, ry
-    number + maybeComma +#rotation
-    arcFlags + #large-arc-flag, sweep-flag
-    coordinatePair #(x,y)
-)
-
-ellipticalArc = Group(Command("A") + Arguments(Sequence(ellipticalArcArgument)))
-
-smoothQuadraticBezierCurveto = Group(Command("T") + Arguments(coordinatePairSequence))
-
-quadraticBezierCurveto = Group(Command("Q") + Arguments(coordinatePairPairSequence))
-
-smoothCurve = Group(Command("S") + Arguments(coordinatePairPairSequence))
-
-#curve = Group(Command("C") + Arguments(coordinatePairTripleSequence))
-
-horizontalLine = Group(Command("H") + Arguments(coordinateSequence))
-verticalLine = Group(Command("V") + Arguments(coordinateSequence))
-
-drawToCommand = (
-    lineTo | moveTo | closePath | ellipticalArc | smoothQuadraticBezierCurveto |
-    quadraticBezierCurveto | smoothCurve | curve | horizontalLine | verticalLine
-    )
-
-#~ number.debug = True
-moveToDrawToCommands = moveTo + ZeroOrMore(drawToCommand)
-
-path = ZeroOrMore(moveToDrawToCommands)
-path.keepTabs = True
-
-def get_points(d):
-    commands = path.parseString(d)
-    points = []
-    currentset = None
-    for command in commands:
-        if command[0] == 'M' or command[0] == 'm':
-            currentset = []
-            points.append(currentset)
-            currentset.append(command[1][-1])
-        elif command[0] == 'L' or command[0] == 'l':
-            currentset.extend(command[1])
-        elif command[0] == 'C' or command[0] == 'c':
-            currentset.extend(command[1])
-    return points
-
-if __name__ == "__main__":
-    s = ("M 242.96145,653.59282 L 244.83646,650.1553 L 247.02397,649.8428 "
-         "L 247.33647,650.62405 L 245.30521,653.59282 L 242.96145,653.59282 z "
-         "M 252.80525,649.99905 L 258.74278,652.49906 L 260.77404,652.18656 "
-         "L 262.33654,648.43654 L 261.71154,645.15528 L 257.64902,644.68653 "
-         "L 253.74275,646.40528 L 252.80525,649.99905 z M 282.49289,659.6866 "
-         "L 286.08665,664.99912 L 288.43041,664.68662 L 289.52417,664.21787 "
-         "L 290.93042,665.46787 L 294.52419,665.31162 L 295.4617,663.90537 "
-         "L 292.64918,662.18661 L 290.77417,658.59284 L 288.74291,655.15533 "
-         "L 283.11789,657.96784 L 282.49289,659.6866 z M 302.02423,668.28039 "
-         "L 303.27423,666.40538 L 307.8055,667.34288 L 308.43051,666.87413 "
-         "L 314.36803,667.49913 L 314.05553,668.74914 L 311.55552,670.15539 "
-         "L 307.33675,669.84289 L 302.02423,668.28039 z M 307.1805,673.28041 "
-         "L 309.05551,677.03043 L 312.02427,675.93667 L 312.33677,674.37416 "
-         "L 310.77427,672.3429 L 307.1805,672.0304 L 307.1805,673.28041 z "
-         "M 313.89928,672.18665 L 316.08679,669.37414 L 320.61806,671.7179 "
-         "L 324.83683,672.81166 L 329.0556,675.46792 L 329.0556,677.34293 "
-         "L 325.61809,679.06169 L 320.93056,679.99919 L 318.5868,678.59293 "
-         "L 313.89928,672.18665 z M 329.99311,687.18672 L 331.55561,685.93672 "
-         "L 334.83688,687.49923 L 342.18066,690.93674 L 345.46193,692.968 "
-         "L 347.02443,695.31176 L 348.89944,699.53053 L 352.80571,702.03054 "
-         "L 352.49321,703.28055 L 348.74319,706.40556 L 344.68067,707.81182 "
-         "L 343.27442,707.18682 L 340.30565,708.90557 L 337.96189,712.03059 "
-         "L 335.77438,714.8431 L 334.05562,714.68685 L 330.61811,712.18684 "
-         "L 330.30561,707.81182 L 330.93061,705.46806 L 329.3681,699.99928 "
-         "L 327.33684,698.28052 L 327.18059,695.78051 L 329.3681,694.84301 "
-         "L 331.39936,691.87425 L 331.86811,690.93674 L 330.30561,689.21798 "
-         "L 329.99311,687.18672 z ")
-    print(path.parseString(s))
diff --git a/doc/tutorial/machine_learning_map/pyparsing.py b/doc/tutorial/machine_learning_map/pyparsing.py
deleted file mode 100644
index 88d00e138d02c..0000000000000
--- a/doc/tutorial/machine_learning_map/pyparsing.py
+++ /dev/null
@@ -1,5715 +0,0 @@
-# module pyparsing.py
-#
-# Copyright (c) 2003-2016  Paul T. McGuire
-#
-# Permission is hereby granted, free of charge, to any person obtaining
-# a copy of this software and associated documentation files (the
-# "Software"), to deal in the Software without restriction, including
-# without limitation the rights to use, copy, modify, merge, publish,
-# distribute, sublicense, and/or sell copies of the Software, and to
-# permit persons to whom the Software is furnished to do so, subject to
-# the following conditions:
-#
-# The above copyright notice and this permission notice shall be
-# included in all copies or substantial portions of the Software.
-#
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
-# IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
-# CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
-# TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
-# SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-#
-# ruff: noqa
-
-__doc__ = \
-"""
-pyparsing module - Classes and methods to define and execute parsing grammars
-
-The pyparsing module is an alternative approach to creating and executing simple grammars,
-vs. the traditional lex/yacc approach, or the use of regular expressions.  With pyparsing, you
-don't need to learn a new syntax for defining grammars or matching expressions - the parsing module
-provides a library of classes that you use to construct the grammar directly in Python.
-
-Here is a program to parse "Hello, World!" (or any greeting of the form 
-C{"<salutation>, <addressee>!"}), built up using L{Word}, L{Literal}, and L{And} elements 
-(L{'+'<ParserElement.__add__>} operator gives L{And} expressions, strings are auto-converted to
-L{Literal} expressions)::
-
-    from pyparsing import Word, alphas
-
-    # define grammar of a greeting
-    greet = Word(alphas) + "," + Word(alphas) + "!"
-
-    hello = "Hello, World!"
-    print (hello, "->", greet.parseString(hello))
-
-The program outputs the following::
-
-    Hello, World! -> ['Hello', ',', 'World', '!']
-
-The Python representation of the grammar is quite readable, owing to the self-explanatory
-class names, and the use of '+', '|' and '^' operators.
-
-The L{ParseResults} object returned from L{ParserElement.parseString<ParserElement.parseString>} can be accessed as a nested list, a dictionary, or an
-object with named attributes.
-
-The pyparsing module handles some of the problems that are typically vexing when writing text parsers:
- - extra or missing whitespace (the above program will also handle "Hello,World!", "Hello  ,  World  !", etc.)
- - quoted strings
- - embedded comments
-"""
-
-__version__ = "2.2.0"
-__versionTime__ = "06 Mar 2017 02:06 UTC"
-__author__ = "Paul McGuire <ptmcg@users.sourceforge.net>"
-
-import string
-from weakref import ref as wkref
-import copy
-import sys
-import warnings
-import re
-import sre_constants
-import collections
-import pprint
-import traceback
-import types
-from datetime import datetime
-
-try:
-    from _thread import RLock
-except ImportError:
-    from threading import RLock
-
-try:
-    from collections import OrderedDict as _OrderedDict
-except ImportError:
-    try:
-        from ordereddict import OrderedDict as _OrderedDict
-    except ImportError:
-        _OrderedDict = None
-
-#~ sys.stderr.write( "testing pyparsing module, version %s, %s\n" % (__version__,__versionTime__ ) )
-
-__all__ = [
-'And', 'CaselessKeyword', 'CaselessLiteral', 'CharsNotIn', 'Combine', 'Dict', 'Each', 'Empty',
-'FollowedBy', 'Forward', 'GoToColumn', 'Group', 'Keyword', 'LineEnd', 'LineStart', 'Literal',
-'MatchFirst', 'NoMatch', 'NotAny', 'OneOrMore', 'OnlyOnce', 'Optional', 'Or',
-'ParseBaseException', 'ParseElementEnhance', 'ParseException', 'ParseExpression', 'ParseFatalException',
-'ParseResults', 'ParseSyntaxException', 'ParserElement', 'QuotedString', 'RecursiveGrammarException',
-'Regex', 'SkipTo', 'StringEnd', 'StringStart', 'Suppress', 'Token', 'TokenConverter', 
-'White', 'Word', 'WordEnd', 'WordStart', 'ZeroOrMore',
-'alphanums', 'alphas', 'alphas8bit', 'anyCloseTag', 'anyOpenTag', 'cStyleComment', 'col',
-'commaSeparatedList', 'commonHTMLEntity', 'countedArray', 'cppStyleComment', 'dblQuotedString',
-'dblSlashComment', 'delimitedList', 'dictOf', 'downcaseTokens', 'empty', 'hexnums',
-'htmlComment', 'javaStyleComment', 'line', 'lineEnd', 'lineStart', 'lineno',
-'makeHTMLTags', 'makeXMLTags', 'matchOnlyAtCol', 'matchPreviousExpr', 'matchPreviousLiteral',
-'nestedExpr', 'nullDebugAction', 'nums', 'oneOf', 'opAssoc', 'operatorPrecedence', 'printables',
-'punc8bit', 'pythonStyleComment', 'quotedString', 'removeQuotes', 'replaceHTMLEntity', 
-'replaceWith', 'restOfLine', 'sglQuotedString', 'srange', 'stringEnd',
-'stringStart', 'traceParseAction', 'unicodeString', 'upcaseTokens', 'withAttribute',
-'indentedBlock', 'originalTextFor', 'ungroup', 'infixNotation','locatedExpr', 'withClass',
-'CloseMatch', 'tokenMap', 'pyparsing_common',
-]
-
-system_version = tuple(sys.version_info)[:3]
-PY_3 = system_version[0] == 3
-if PY_3:
-    _MAX_INT = sys.maxsize
-    basestring = str
-    unichr = chr
-    _ustr = str
-
-    # build list of single arg builtins, that can be used as parse actions
-    singleArgBuiltins = [sum, len, sorted, reversed, list, tuple, set, any, all, min, max]
-
-else:
-    _MAX_INT = sys.maxint
-    range = xrange
-
-    def _ustr(obj):
-        """Drop-in replacement for str(obj) that tries to be Unicode friendly. It first tries
-           str(obj). If that fails with a UnicodeEncodeError, then it tries unicode(obj). It
-           then < returns the unicode object | encodes it with the default encoding | ... >.
-        """
-        if isinstance(obj,unicode):
-            return obj
-
-        try:
-            # If this works, then _ustr(obj) has the same behaviour as str(obj), so
-            # it won't break any existing code.
-            return str(obj)
-
-        except UnicodeEncodeError:
-            # Else encode it
-            ret = unicode(obj).encode(sys.getdefaultencoding(), 'xmlcharrefreplace')
-            xmlcharref = Regex(r'&#\d+;')
-            xmlcharref.setParseAction(lambda t: '\\u' + hex(int(t[0][2:-1]))[2:])
-            return xmlcharref.transformString(ret)
-
-    # build list of single arg builtins, tolerant of Python version, that can be used as parse actions
-    singleArgBuiltins = []
-    import __builtin__
-    for fname in "sum len sorted reversed list tuple set any all min max".split():
-        try:
-            singleArgBuiltins.append(getattr(__builtin__,fname))
-        except AttributeError:
-            continue
-            
-_generatorType = type((y for y in range(1)))
- 
-def _xml_escape(data):
-    """Escape &, <, >, ", ', etc. in a string of data."""
-
-    # ampersand must be replaced first
-    from_symbols = '&><"\''
-    to_symbols = ('&'+s+';' for s in "amp gt lt quot apos".split())
-    for from_,to_ in zip(from_symbols, to_symbols):
-        data = data.replace(from_, to_)
-    return data
-
-class _Constants(object):
-    pass
-
-alphas     = string.ascii_uppercase + string.ascii_lowercase
-nums       = "0123456789"
-hexnums    = nums + "ABCDEFabcdef"
-alphanums  = alphas + nums
-_bslash    = chr(92)
-printables = "".join(c for c in string.printable if c not in string.whitespace)
-
-class ParseBaseException(Exception):
-    """base exception class for all parsing runtime exceptions"""
-    # Performance tuning: we construct a *lot* of these, so keep this
-    # constructor as small and fast as possible
-    def __init__( self, pstr, loc=0, msg=None, elem=None ):
-        self.loc = loc
-        if msg is None:
-            self.msg = pstr
-            self.pstr = ""
-        else:
-            self.msg = msg
-            self.pstr = pstr
-        self.parserElement = elem
-        self.args = (pstr, loc, msg)
-
-    @classmethod
-    def _from_exception(cls, pe):
-        """
-        internal factory method to simplify creating one type of ParseException 
-        from another - avoids having __init__ signature conflicts among subclasses
-        """
-        return cls(pe.pstr, pe.loc, pe.msg, pe.parserElement)
-
-    def __getattr__( self, aname ):
-        """supported attributes by name are:
-            - lineno - returns the line number of the exception text
-            - col - returns the column number of the exception text
-            - line - returns the line containing the exception text
-        """
-        if( aname == "lineno" ):
-            return lineno( self.loc, self.pstr )
-        elif( aname in ("col", "column") ):
-            return col( self.loc, self.pstr )
-        elif( aname == "line" ):
-            return line( self.loc, self.pstr )
-        else:
-            raise AttributeError(aname)
-
-    def __str__( self ):
-        return "%s (at char %d), (line:%d, col:%d)" % \
-                ( self.msg, self.loc, self.lineno, self.column )
-    def __repr__( self ):
-        return _ustr(self)
-    def markInputline( self, markerString = ">!<" ):
-        """Extracts the exception line from the input string, and marks
-           the location of the exception with a special symbol.
-        """
-        line_str = self.line
-        line_column = self.column - 1
-        if markerString:
-            line_str = "".join((line_str[:line_column],
-                                markerString, line_str[line_column:]))
-        return line_str.strip()
-    def __dir__(self):
-        return "lineno col line".split() + dir(type(self))
-
-class ParseException(ParseBaseException):
-    """
-    Exception thrown when parse expressions don't match class;
-    supported attributes by name are:
-     - lineno - returns the line number of the exception text
-     - col - returns the column number of the exception text
-     - line - returns the line containing the exception text
-        
-    Example::
-        try:
-            Word(nums).setName("integer").parseString("ABC")
-        except ParseException as pe:
-            print(pe)
-            print("column: {}".format(pe.col))
-            
-    prints::
-       Expected integer (at char 0), (line:1, col:1)
-        column: 1
-    """
-    pass
-
-class ParseFatalException(ParseBaseException):
-    """user-throwable exception thrown when inconsistent parse content
-       is found; stops all parsing immediately"""
-    pass
-
-class ParseSyntaxException(ParseFatalException):
-    """just like L{ParseFatalException}, but thrown internally when an
-       L{ErrorStop<And._ErrorStop>} ('-' operator) indicates that parsing is to stop 
-       immediately because an unbacktrackable syntax error has been found"""
-    pass
-
-#~ class ReparseException(ParseBaseException):
-    #~ """Experimental class - parse actions can raise this exception to cause
-       #~ pyparsing to reparse the input string:
-        #~ - with a modified input string, and/or
-        #~ - with a modified start location
-       #~ Set the values of the ReparseException in the constructor, and raise the
-       #~ exception in a parse action to cause pyparsing to use the new string/location.
-       #~ Setting the values as None causes no change to be made.
-       #~ """
-    #~ def __init_( self, newstring, restartLoc ):
-        #~ self.newParseText = newstring
-        #~ self.reparseLoc = restartLoc
-
-class RecursiveGrammarException(Exception):
-    """exception thrown by L{ParserElement.validate} if the grammar could be improperly recursive"""
-    def __init__( self, parseElementList ):
-        self.parseElementTrace = parseElementList
-
-    def __str__( self ):
-        return "RecursiveGrammarException: %s" % self.parseElementTrace
-
-class _ParseResultsWithOffset(object):
-    def __init__(self,p1,p2):
-        self.tup = (p1,p2)
-    def __getitem__(self,i):
-        return self.tup[i]
-    def __repr__(self):
-        return repr(self.tup[0])
-    def setOffset(self,i):
-        self.tup = (self.tup[0],i)
-
-class ParseResults(object):
-    """
-    Structured parse results, to provide multiple means of access to the parsed data:
-       - as a list (C{len(results)})
-       - by list index (C{results[0], results[1]}, etc.)
-       - by attribute (C{results.<resultsName>} - see L{ParserElement.setResultsName})
-
-    Example::
-        integer = Word(nums)
-        date_str = (integer.setResultsName("year") + '/' 
-                        + integer.setResultsName("month") + '/' 
-                        + integer.setResultsName("day"))
-        # equivalent form:
-        # date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
-
-        # parseString returns a ParseResults object
-        result = date_str.parseString("1999/12/31")
-
-        def test(s, fn=repr):
-            print("%s -> %s" % (s, fn(eval(s))))
-        test("list(result)")
-        test("result[0]")
-        test("result['month']")
-        test("result.day")
-        test("'month' in result")
-        test("'minutes' in result")
-        test("result.dump()", str)
-    prints::
-        list(result) -> ['1999', '/', '12', '/', '31']
-        result[0] -> '1999'
-        result['month'] -> '12'
-        result.day -> '31'
-        'month' in result -> True
-        'minutes' in result -> False
-        result.dump() -> ['1999', '/', '12', '/', '31']
-        - day: 31
-        - month: 12
-        - year: 1999
-    """
-    def __new__(cls, toklist=None, name=None, asList=True, modal=True ):
-        if isinstance(toklist, cls):
-            return toklist
-        retobj = object.__new__(cls)
-        retobj.__doinit = True
-        return retobj
-
-    # Performance tuning: we construct a *lot* of these, so keep this
-    # constructor as small and fast as possible
-    def __init__( self, toklist=None, name=None, asList=True, modal=True, isinstance=isinstance ):
-        if self.__doinit:
-            self.__doinit = False
-            self.__name = None
-            self.__parent = None
-            self.__accumNames = {}
-            self.__asList = asList
-            self.__modal = modal
-            if toklist is None:
-                toklist = []
-            if isinstance(toklist, list):
-                self.__toklist = toklist[:]
-            elif isinstance(toklist, _generatorType):
-                self.__toklist = list(toklist)
-            else:
-                self.__toklist = [toklist]
-            self.__tokdict = dict()
-
-        if name is not None and name:
-            if not modal:
-                self.__accumNames[name] = 0
-            if isinstance(name,int):
-                name = _ustr(name) # will always return a str, but use _ustr for consistency
-            self.__name = name
-            if not (isinstance(toklist, (type(None), basestring, list)) and toklist in (None,'',[])):
-                if isinstance(toklist,basestring):
-                    toklist = [ toklist ]
-                if asList:
-                    if isinstance(toklist,ParseResults):
-                        self[name] = _ParseResultsWithOffset(toklist.copy(),0)
-                    else:
-                        self[name] = _ParseResultsWithOffset(ParseResults(toklist[0]),0)
-                    self[name].__name = name
-                else:
-                    try:
-                        self[name] = toklist[0]
-                    except (KeyError,TypeError,IndexError):
-                        self[name] = toklist
-
-    def __getitem__( self, i ):
-        if isinstance( i, (int,slice) ):
-            return self.__toklist[i]
-        else:
-            if i not in self.__accumNames:
-                return self.__tokdict[i][-1][0]
-            else:
-                return ParseResults([ v[0] for v in self.__tokdict[i] ])
-
-    def __setitem__( self, k, v, isinstance=isinstance ):
-        if isinstance(v,_ParseResultsWithOffset):
-            self.__tokdict[k] = self.__tokdict.get(k,list()) + [v]
-            sub = v[0]
-        elif isinstance(k,(int,slice)):
-            self.__toklist[k] = v
-            sub = v
-        else:
-            self.__tokdict[k] = self.__tokdict.get(k,list()) + [_ParseResultsWithOffset(v,0)]
-            sub = v
-        if isinstance(sub,ParseResults):
-            sub.__parent = wkref(self)
-
-    def __delitem__( self, i ):
-        if isinstance(i,(int,slice)):
-            mylen = len( self.__toklist )
-            del self.__toklist[i]
-
-            # convert int to slice
-            if isinstance(i, int):
-                if i < 0:
-                    i += mylen
-                i = slice(i, i+1)
-            # get removed indices
-            removed = list(range(*i.indices(mylen)))
-            removed.reverse()
-            # fixup indices in token dictionary
-            for name,occurrences in self.__tokdict.items():
-                for j in removed:
-                    for k, (value, position) in enumerate(occurrences):
-                        occurrences[k] = _ParseResultsWithOffset(value, position - (position > j))
-        else:
-            del self.__tokdict[i]
-
-    def __contains__( self, k ):
-        return k in self.__tokdict
-
-    def __len__( self ): return len( self.__toklist )
-    def __bool__(self): return ( not not self.__toklist )
-    __nonzero__ = __bool__
-    def __iter__( self ): return iter( self.__toklist )
-    def __reversed__( self ): return iter( self.__toklist[::-1] )
-    def _iterkeys( self ):
-        if hasattr(self.__tokdict, "iterkeys"):
-            return self.__tokdict.iterkeys()
-        else:
-            return iter(self.__tokdict)
-
-    def _itervalues( self ):
-        return (self[k] for k in self._iterkeys())
-            
-    def _iteritems( self ):
-        return ((k, self[k]) for k in self._iterkeys())
-
-    if PY_3:
-        keys = _iterkeys       
-        """Returns an iterator of all named result keys (Python 3.x only)."""
-
-        values = _itervalues
-        """Returns an iterator of all named result values (Python 3.x only)."""
-
-        items = _iteritems
-        """Returns an iterator of all named result key-value tuples (Python 3.x only)."""
-
-    else:
-        iterkeys = _iterkeys
-        """Returns an iterator of all named result keys (Python 2.x only)."""
-
-        itervalues = _itervalues
-        """Returns an iterator of all named result values (Python 2.x only)."""
-
-        iteritems = _iteritems
-        """Returns an iterator of all named result key-value tuples (Python 2.x only)."""
-
-        def keys( self ):
-            """Returns all named result keys (as a list in Python 2.x, as an iterator in Python 3.x)."""
-            return list(self.iterkeys())
-
-        def values( self ):
-            """Returns all named result values (as a list in Python 2.x, as an iterator in Python 3.x)."""
-            return list(self.itervalues())
-                
-        def items( self ):
-            """Returns all named result key-values (as a list of tuples in Python 2.x, as an iterator in Python 3.x)."""
-            return list(self.iteritems())
-
-    def haskeys( self ):
-        """Since keys() returns an iterator, this method is helpful in bypassing
-           code that looks for the existence of any defined results names."""
-        return bool(self.__tokdict)
-        
-    def pop( self, *args, **kwargs):
-        """
-        Removes and returns item at specified index (default=C{last}).
-        Supports both C{list} and C{dict} semantics for C{pop()}. If passed no
-        argument or an integer argument, it will use C{list} semantics
-        and pop tokens from the list of parsed tokens. If passed a 
-        non-integer argument (most likely a string), it will use C{dict}
-        semantics and pop the corresponding value from any defined 
-        results names. A second default return value argument is 
-        supported, just as in C{dict.pop()}.
-
-        Example::
-            def remove_first(tokens):
-                tokens.pop(0)
-            print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
-            print(OneOrMore(Word(nums)).addParseAction(remove_first).parseString("0 123 321")) # -> ['123', '321']
-
-            label = Word(alphas)
-            patt = label("LABEL") + OneOrMore(Word(nums))
-            print(patt.parseString("AAB 123 321").dump())
-
-            # Use pop() in a parse action to remove named result (note that corresponding value is not
-            # removed from list form of results)
-            def remove_LABEL(tokens):
-                tokens.pop("LABEL")
-                return tokens
-            patt.addParseAction(remove_LABEL)
-            print(patt.parseString("AAB 123 321").dump())
-        prints::
-            ['AAB', '123', '321']
-            - LABEL: AAB
-
-            ['AAB', '123', '321']
-        """
-        if not args:
-            args = [-1]
-        for k,v in kwargs.items():
-            if k == 'default':
-                args = (args[0], v)
-            else:
-                raise TypeError("pop() got an unexpected keyword argument '%s'" % k)
-        if (isinstance(args[0], int) or 
-                        len(args) == 1 or 
-                        args[0] in self):
-            index = args[0]
-            ret = self[index]
-            del self[index]
-            return ret
-        else:
-            defaultvalue = args[1]
-            return defaultvalue
-
-    def get(self, key, defaultValue=None):
-        """
-        Returns named result matching the given key, or if there is no
-        such name, then returns the given C{defaultValue} or C{None} if no
-        C{defaultValue} is specified.
-
-        Similar to C{dict.get()}.
-        
-        Example::
-            integer = Word(nums)
-            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")           
-
-            result = date_str.parseString("1999/12/31")
-            print(result.get("year")) # -> '1999'
-            print(result.get("hour", "not specified")) # -> 'not specified'
-            print(result.get("hour")) # -> None
-        """
-        if key in self:
-            return self[key]
-        else:
-            return defaultValue
-
-    def insert( self, index, insStr ):
-        """
-        Inserts new element at location index in the list of parsed tokens.
-        
-        Similar to C{list.insert()}.
-
-        Example::
-            print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
-
-            # use a parse action to insert the parse location in the front of the parsed results
-            def insert_locn(locn, tokens):
-                tokens.insert(0, locn)
-            print(OneOrMore(Word(nums)).addParseAction(insert_locn).parseString("0 123 321")) # -> [0, '0', '123', '321']
-        """
-        self.__toklist.insert(index, insStr)
-        # fixup indices in token dictionary
-        for name,occurrences in self.__tokdict.items():
-            for k, (value, position) in enumerate(occurrences):
-                occurrences[k] = _ParseResultsWithOffset(value, position + (position > index))
-
-    def append( self, item ):
-        """
-        Add single element to end of ParseResults list of elements.
-
-        Example::
-            print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
-            
-            # use a parse action to compute the sum of the parsed integers, and add it to the end
-            def append_sum(tokens):
-                tokens.append(sum(map(int, tokens)))
-            print(OneOrMore(Word(nums)).addParseAction(append_sum).parseString("0 123 321")) # -> ['0', '123', '321', 444]
-        """
-        self.__toklist.append(item)
-
-    def extend( self, itemseq ):
-        """
-        Add sequence of elements to end of ParseResults list of elements.
-
-        Example::
-            patt = OneOrMore(Word(alphas))
-            
-            # use a parse action to append the reverse of the matched strings, to make a palindrome
-            def make_palindrome(tokens):
-                tokens.extend(reversed([t[::-1] for t in tokens]))
-                return ''.join(tokens)
-            print(patt.addParseAction(make_palindrome).parseString("lskdj sdlkjf lksd")) # -> 'lskdjsdlkjflksddsklfjkldsjdksl'
-        """
-        if isinstance(itemseq, ParseResults):
-            self += itemseq
-        else:
-            self.__toklist.extend(itemseq)
-
-    def clear( self ):
-        """
-        Clear all elements and results names.
-        """
-        del self.__toklist[:]
-        self.__tokdict.clear()
-
-    def __getattr__( self, name ):
-        try:
-            return self[name]
-        except KeyError:
-            return ""
-            
-        if name in self.__tokdict:
-            if name not in self.__accumNames:
-                return self.__tokdict[name][-1][0]
-            else:
-                return ParseResults([ v[0] for v in self.__tokdict[name] ])
-        else:
-            return ""
-
-    def __add__( self, other ):
-        ret = self.copy()
-        ret += other
-        return ret
-
-    def __iadd__( self, other ):
-        if other.__tokdict:
-            offset = len(self.__toklist)
-            addoffset = lambda a: offset if a<0 else a+offset
-            otheritems = other.__tokdict.items()
-            otherdictitems = [(k, _ParseResultsWithOffset(v[0],addoffset(v[1])) )
-                                for (k,vlist) in otheritems for v in vlist]
-            for k,v in otherdictitems:
-                self[k] = v
-                if isinstance(v[0],ParseResults):
-                    v[0].__parent = wkref(self)
-            
-        self.__toklist += other.__toklist
-        self.__accumNames.update( other.__accumNames )
-        return self
-
-    def __radd__(self, other):
-        if isinstance(other,int) and other == 0:
-            # useful for merging many ParseResults using sum() builtin
-            return self.copy()
-        else:
-            # this may raise a TypeError - so be it
-            return other + self
-        
-    def __repr__( self ):
-        return "(%s, %s)" % ( repr( self.__toklist ), repr( self.__tokdict ) )
-
-    def __str__( self ):
-        return '[' + ', '.join(_ustr(i) if isinstance(i, ParseResults) else repr(i) for i in self.__toklist) + ']'
-
-    def _asStringList( self, sep='' ):
-        out = []
-        for item in self.__toklist:
-            if out and sep:
-                out.append(sep)
-            if isinstance( item, ParseResults ):
-                out += item._asStringList()
-            else:
-                out.append( _ustr(item) )
-        return out
-
-    def asList( self ):
-        """
-        Returns the parse results as a nested list of matching tokens, all converted to strings.
-
-        Example::
-            patt = OneOrMore(Word(alphas))
-            result = patt.parseString("sldkj lsdkj sldkj")
-            # even though the result prints in string-like form, it is actually a pyparsing ParseResults
-            print(type(result), result) # -> <class 'pyparsing.ParseResults'> ['sldkj', 'lsdkj', 'sldkj']
-            
-            # Use asList() to create an actual list
-            result_list = result.asList()
-            print(type(result_list), result_list) # -> <class 'list'> ['sldkj', 'lsdkj', 'sldkj']
-        """
-        return [res.asList() if isinstance(res,ParseResults) else res for res in self.__toklist]
-
-    def asDict( self ):
-        """
-        Returns the named parse results as a nested dictionary.
-
-        Example::
-            integer = Word(nums)
-            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
-            
-            result = date_str.parseString('12/31/1999')
-            print(type(result), repr(result)) # -> <class 'pyparsing.ParseResults'> (['12', '/', '31', '/', '1999'], {'day': [('1999', 4)], 'year': [('12', 0)], 'month': [('31', 2)]})
-            
-            result_dict = result.asDict()
-            print(type(result_dict), repr(result_dict)) # -> <class 'dict'> {'day': '1999', 'year': '12', 'month': '31'}
-
-            # even though a ParseResults supports dict-like access, sometime you just need to have a dict
-            import json
-            print(json.dumps(result)) # -> Exception: TypeError: ... is not JSON serializable
-            print(json.dumps(result.asDict())) # -> {"month": "31", "day": "1999", "year": "12"}
-        """
-        if PY_3:
-            item_fn = self.items
-        else:
-            item_fn = self.iteritems
-            
-        def toItem(obj):
-            if isinstance(obj, ParseResults):
-                if obj.haskeys():
-                    return obj.asDict()
-                else:
-                    return [toItem(v) for v in obj]
-            else:
-                return obj
-                
-        return dict((k,toItem(v)) for k,v in item_fn())
-
-    def copy( self ):
-        """
-        Returns a new copy of a C{ParseResults} object.
-        """
-        ret = ParseResults( self.__toklist )
-        ret.__tokdict = self.__tokdict.copy()
-        ret.__parent = self.__parent
-        ret.__accumNames.update( self.__accumNames )
-        ret.__name = self.__name
-        return ret
-
-    def asXML( self, doctag=None, namedItemsOnly=False, indent="", formatted=True ):
-        """
-        (Deprecated) Returns the parse results as XML. Tags are created for tokens and lists that have defined results names.
-        """
-        nl = "\n"
-        out = []
-        namedItems = dict((v[1],k) for (k,vlist) in self.__tokdict.items()
-                                                            for v in vlist)
-        nextLevelIndent = indent + "  "
-
-        # collapse out indents if formatting is not desired
-        if not formatted:
-            indent = ""
-            nextLevelIndent = ""
-            nl = ""
-
-        selfTag = None
-        if doctag is not None:
-            selfTag = doctag
-        else:
-            if self.__name:
-                selfTag = self.__name
-
-        if not selfTag:
-            if namedItemsOnly:
-                return ""
-            else:
-                selfTag = "ITEM"
-
-        out += [ nl, indent, "<", selfTag, ">" ]
-
-        for i,res in enumerate(self.__toklist):
-            if isinstance(res,ParseResults):
-                if i in namedItems:
-                    out += [ res.asXML(namedItems[i],
-                                        namedItemsOnly and doctag is None,
-                                        nextLevelIndent,
-                                        formatted)]
-                else:
-                    out += [ res.asXML(None,
-                                        namedItemsOnly and doctag is None,
-                                        nextLevelIndent,
-                                        formatted)]
-            else:
-                # individual token, see if there is a name for it
-                resTag = None
-                if i in namedItems:
-                    resTag = namedItems[i]
-                if not resTag:
-                    if namedItemsOnly:
-                        continue
-                    else:
-                        resTag = "ITEM"
-                xmlBodyText = _xml_escape(_ustr(res))
-                out += [ nl, nextLevelIndent, "<", resTag, ">",
-                                                xmlBodyText,
-                                                "</", resTag, ">" ]
-
-        out += [ nl, indent, "</", selfTag, ">" ]
-        return "".join(out)
-
-    def __lookup(self,sub):
-        for k,vlist in self.__tokdict.items():
-            for v,loc in vlist:
-                if sub is v:
-                    return k
-        return None
-
-    def getName(self):
-        r"""
-        Returns the results name for this token expression. Useful when several 
-        different expressions might match at a particular location.
-
-        Example::
-            integer = Word(nums)
-            ssn_expr = Regex(r"\d\d\d-\d\d-\d\d\d\d")
-            house_number_expr = Suppress('#') + Word(nums, alphanums)
-            user_data = (Group(house_number_expr)("house_number") 
-                        | Group(ssn_expr)("ssn")
-                        | Group(integer)("age"))
-            user_info = OneOrMore(user_data)
-            
-            result = user_info.parseString("22 111-22-3333 #221B")
-            for item in result:
-                print(item.getName(), ':', item[0])
-        prints::
-            age : 22
-            ssn : 111-22-3333
-            house_number : 221B
-        """
-        if self.__name:
-            return self.__name
-        elif self.__parent:
-            par = self.__parent()
-            if par:
-                return par.__lookup(self)
-            else:
-                return None
-        elif (len(self) == 1 and
-               len(self.__tokdict) == 1 and
-               next(iter(self.__tokdict.values()))[0][1] in (0,-1)):
-            return next(iter(self.__tokdict.keys()))
-        else:
-            return None
-
-    def dump(self, indent='', depth=0, full=True):
-        """
-        Diagnostic method for listing out the contents of a C{ParseResults}.
-        Accepts an optional C{indent} argument so that this string can be embedded
-        in a nested display of other data.
-
-        Example::
-            integer = Word(nums)
-            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
-            
-            result = date_str.parseString('12/31/1999')
-            print(result.dump())
-        prints::
-            ['12', '/', '31', '/', '1999']
-            - day: 1999
-            - month: 31
-            - year: 12
-        """
-        out = []
-        NL = '\n'
-        out.append( indent+_ustr(self.asList()) )
-        if full:
-            if self.haskeys():
-                items = sorted((str(k), v) for k,v in self.items())
-                for k,v in items:
-                    if out:
-                        out.append(NL)
-                    out.append( "%s%s- %s: " % (indent,('  '*depth), k) )
-                    if isinstance(v,ParseResults):
-                        if v:
-                            out.append( v.dump(indent,depth+1) )
-                        else:
-                            out.append(_ustr(v))
-                    else:
-                        out.append(repr(v))
-            elif any(isinstance(vv,ParseResults) for vv in self):
-                v = self
-                for i,vv in enumerate(v):
-                    if isinstance(vv,ParseResults):
-                        out.append("\n%s%s[%d]:\n%s%s%s" % (indent,('  '*(depth)),i,indent,('  '*(depth+1)),vv.dump(indent,depth+1) ))
-                    else:
-                        out.append("\n%s%s[%d]:\n%s%s%s" % (indent,('  '*(depth)),i,indent,('  '*(depth+1)),_ustr(vv)))
-            
-        return "".join(out)
-
-    def pprint(self, *args, **kwargs):
-        """
-        Pretty-printer for parsed results as a list, using the C{pprint} module.
-        Accepts additional positional or keyword args as defined for the 
-        C{pprint.pprint} method. (U{https://docs.python.org/3/library/pprint.html#pprint.pprint})
-
-        Example::
-            ident = Word(alphas, alphanums)
-            num = Word(nums)
-            func = Forward()
-            term = ident | num | Group('(' + func + ')')
-            func <<= ident + Group(Optional(delimitedList(term)))
-            result = func.parseString("fna a,b,(fnb c,d,200),100")
-            result.pprint(width=40)
-        prints::
-            ['fna',
-             ['a',
-              'b',
-              ['(', 'fnb', ['c', 'd', '200'], ')'],
-              '100']]
-        """
-        pprint.pprint(self.asList(), *args, **kwargs)
-
-    # add support for pickle protocol
-    def __getstate__(self):
-        return ( self.__toklist,
-                 ( self.__tokdict.copy(),
-                   self.__parent is not None and self.__parent() or None,
-                   self.__accumNames,
-                   self.__name ) )
-
-    def __setstate__(self,state):
-        self.__toklist = state[0]
-        (self.__tokdict,
-         par,
-         inAccumNames,
-         self.__name) = state[1]
-        self.__accumNames = {}
-        self.__accumNames.update(inAccumNames)
-        if par is not None:
-            self.__parent = wkref(par)
-        else:
-            self.__parent = None
-
-    def __getnewargs__(self):
-        return self.__toklist, self.__name, self.__asList, self.__modal
-
-    def __dir__(self):
-        return (dir(type(self)) + list(self.keys()))
-
-collections.MutableMapping.register(ParseResults)
-
-def col (loc,strg):
-    """Returns current column within a string, counting newlines as line separators.
-   The first column is number 1.
-
-   Note: the default parsing behavior is to expand tabs in the input string
-   before starting the parsing process.  See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
-   on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
-   consistent view of the parsed string, the parse location, and line and column
-   positions within the parsed string.
-   """
-    s = strg
-    return 1 if 0<loc<len(s) and s[loc-1] == '\n' else loc - s.rfind("\n", 0, loc)
-
-def lineno(loc,strg):
-    """Returns current line number within a string, counting newlines as line separators.
-   The first line is number 1.
-
-   Note: the default parsing behavior is to expand tabs in the input string
-   before starting the parsing process.  See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
-   on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
-   consistent view of the parsed string, the parse location, and line and column
-   positions within the parsed string.
-   """
-    return strg.count("\n",0,loc) + 1
-
-def line( loc, strg ):
-    """Returns the line of text containing loc within a string, counting newlines as line separators.
-       """
-    lastCR = strg.rfind("\n", 0, loc)
-    nextCR = strg.find("\n", loc)
-    if nextCR >= 0:
-        return strg[lastCR+1:nextCR]
-    else:
-        return strg[lastCR+1:]
-
-def _defaultStartDebugAction( instring, loc, expr ):
-    print (("Match " + _ustr(expr) + " at loc " + _ustr(loc) + "(%d,%d)" % ( lineno(loc,instring), col(loc,instring) )))
-
-def _defaultSuccessDebugAction( instring, startloc, endloc, expr, toks ):
-    print ("Matched " + _ustr(expr) + " -> " + str(toks.asList()))
-
-def _defaultExceptionDebugAction( instring, loc, expr, exc ):
-    print ("Exception raised:" + _ustr(exc))
-
-def nullDebugAction(*args):
-    """'Do-nothing' debug action, to suppress debugging output during parsing."""
-    pass
-
-# Only works on Python 3.x - nonlocal is toxic to Python 2 installs
-#~ 'decorator to trim function calls to match the arity of the target'
-#~ def _trim_arity(func, maxargs=3):
-    #~ if func in singleArgBuiltins:
-        #~ return lambda s,l,t: func(t)
-    #~ limit = 0
-    #~ foundArity = False
-    #~ def wrapper(*args):
-        #~ nonlocal limit,foundArity
-        #~ while 1:
-            #~ try:
-                #~ ret = func(*args[limit:])
-                #~ foundArity = True
-                #~ return ret
-            #~ except TypeError:
-                #~ if limit == maxargs or foundArity:
-                    #~ raise
-                #~ limit += 1
-                #~ continue
-    #~ return wrapper
-
-# this version is Python 2.x-3.x cross-compatible
-'decorator to trim function calls to match the arity of the target'
-def _trim_arity(func, maxargs=2):
-    if func in singleArgBuiltins:
-        return lambda s,l,t: func(t)
-    limit = [0]
-    foundArity = [False]
-    
-    def extract_stack(limit=0):
-        offset = -2
-        frame_summary = traceback.extract_stack(limit=-offset+limit-1)[offset]
-        return [(frame_summary.filename, frame_summary.lineno)]
-    def extract_tb(tb, limit=0):
-        frames = traceback.extract_tb(tb, limit=limit)
-        frame_summary = frames[-1]
-        return [(frame_summary.filename, frame_summary.lineno)]
-    
-    # synthesize what would be returned by traceback.extract_stack at the call to 
-    # user's parse action 'func', so that we don't incur call penalty at parse time
-    
-    LINE_DIFF = 6
-    # IF ANY CODE CHANGES, EVEN JUST COMMENTS OR BLANK LINES, BETWEEN THE NEXT LINE AND 
-    # THE CALL TO FUNC INSIDE WRAPPER, LINE_DIFF MUST BE MODIFIED!!!!
-    this_line = extract_stack(limit=2)[-1]
-    pa_call_line_synth = (this_line[0], this_line[1]+LINE_DIFF)
-
-    def wrapper(*args):
-        while 1:
-            try:
-                ret = func(*args[limit[0]:])
-                foundArity[0] = True
-                return ret
-            except TypeError:
-                # re-raise TypeErrors if they did not come from our arity testing
-                if foundArity[0]:
-                    raise
-                else:
-                    try:
-                        tb = sys.exc_info()[-1]
-                        if not extract_tb(tb, limit=2)[-1][:2] == pa_call_line_synth:
-                            raise
-                    finally:
-                        del tb
-
-                if limit[0] <= maxargs:
-                    limit[0] += 1
-                    continue
-                raise
-
-    # copy func name to wrapper for sensible debug output
-    func_name = "<parse action>"
-    try:
-        func_name = getattr(func, '__name__', 
-                            getattr(func, '__class__').__name__)
-    except Exception:
-        func_name = str(func)
-    wrapper.__name__ = func_name
-
-    return wrapper
-
-class ParserElement(object):
-    """Abstract base level parser element class."""
-    DEFAULT_WHITE_CHARS = " \n\t\r"
-    verbose_stacktrace = False
-
-    @staticmethod
-    def setDefaultWhitespaceChars( chars ):
-        r"""
-        Overrides the default whitespace chars
-
-        Example::
-            # default whitespace chars are space, <TAB> and newline
-            OneOrMore(Word(alphas)).parseString("abc def\nghi jkl")  # -> ['abc', 'def', 'ghi', 'jkl']
-            
-            # change to just treat newline as significant
-            ParserElement.setDefaultWhitespaceChars(" \t")
-            OneOrMore(Word(alphas)).parseString("abc def\nghi jkl")  # -> ['abc', 'def']
-        """
-        ParserElement.DEFAULT_WHITE_CHARS = chars
-
-    @staticmethod
-    def inlineLiteralsUsing(cls):
-        """
-        Set class to be used for inclusion of string literals into a parser.
-        
-        Example::
-            # default literal class used is Literal
-            integer = Word(nums)
-            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")           
-
-            date_str.parseString("1999/12/31")  # -> ['1999', '/', '12', '/', '31']
-
-
-            # change to Suppress
-            ParserElement.inlineLiteralsUsing(Suppress)
-            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")           
-
-            date_str.parseString("1999/12/31")  # -> ['1999', '12', '31']
-        """
-        ParserElement._literalStringClass = cls
-
-    def __init__( self, savelist=False ):
-        self.parseAction = list()
-        self.failAction = None
-        #~ self.name = "<unknown>"  # don't define self.name, let subclasses try/except upcall
-        self.strRepr = None
-        self.resultsName = None
-        self.saveAsList = savelist
-        self.skipWhitespace = True
-        self.whiteChars = ParserElement.DEFAULT_WHITE_CHARS
-        self.copyDefaultWhiteChars = True
-        self.mayReturnEmpty = False # used when checking for left-recursion
-        self.keepTabs = False
-        self.ignoreExprs = list()
-        self.debug = False
-        self.streamlined = False
-        self.mayIndexError = True # used to optimize exception handling for subclasses that don't advance parse index
-        self.errmsg = ""
-        self.modalResults = True # used to mark results names as modal (report only last) or cumulative (list all)
-        self.debugActions = ( None, None, None ) #custom debug actions
-        self.re = None
-        self.callPreparse = True # used to avoid redundant calls to preParse
-        self.callDuringTry = False
-
-    def copy( self ):
-        """
-        Make a copy of this C{ParserElement}.  Useful for defining different parse actions
-        for the same parsing pattern, using copies of the original parse element.
-        
-        Example::
-            integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
-            integerK = integer.copy().addParseAction(lambda toks: toks[0]*1024) + Suppress("K")
-            integerM = integer.copy().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
-            
-            print(OneOrMore(integerK | integerM | integer).parseString("5K 100 640K 256M"))
-        prints::
-            [5120, 100, 655360, 268435456]
-        Equivalent form of C{expr.copy()} is just C{expr()}::
-            integerM = integer().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
-        """
-        cpy = copy.copy( self )
-        cpy.parseAction = self.parseAction[:]
-        cpy.ignoreExprs = self.ignoreExprs[:]
-        if self.copyDefaultWhiteChars:
-            cpy.whiteChars = ParserElement.DEFAULT_WHITE_CHARS
-        return cpy
-
-    def setName( self, name ):
-        """
-        Define name for this expression, makes debugging and exception messages clearer.
-        
-        Example::
-            Word(nums).parseString("ABC")  # -> Exception: Expected W:(0123...) (at char 0), (line:1, col:1)
-            Word(nums).setName("integer").parseString("ABC")  # -> Exception: Expected integer (at char 0), (line:1, col:1)
-        """
-        self.name = name
-        self.errmsg = "Expected " + self.name
-        if hasattr(self,"exception"):
-            self.exception.msg = self.errmsg
-        return self
-
-    def setResultsName( self, name, listAllMatches=False ):
-        """
-        Define name for referencing matching tokens as a nested attribute
-        of the returned parse results.
-        NOTE: this returns a *copy* of the original C{ParserElement} object;
-        this is so that the client can define a basic element, such as an
-        integer, and reference it in multiple places with different names.
-
-        You can also set results names using the abbreviated syntax,
-        C{expr("name")} in place of C{expr.setResultsName("name")} - 
-        see L{I{__call__}<__call__>}.
-
-        Example::
-            date_str = (integer.setResultsName("year") + '/' 
-                        + integer.setResultsName("month") + '/' 
-                        + integer.setResultsName("day"))
-
-            # equivalent form:
-            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
-        """
-        newself = self.copy()
-        if name.endswith("*"):
-            name = name[:-1]
-            listAllMatches=True
-        newself.resultsName = name
-        newself.modalResults = not listAllMatches
-        return newself
-
-    def setBreak(self,breakFlag = True):
-        """Method to invoke the Python pdb debugger when this element is
-           about to be parsed. Set C{breakFlag} to True to enable, False to
-           disable.
-        """
-        if breakFlag:
-            _parseMethod = self._parse
-            def breaker(instring, loc, doActions=True, callPreParse=True):
-                import pdb
-                pdb.set_trace()
-                return _parseMethod( instring, loc, doActions, callPreParse )
-            breaker._originalParseMethod = _parseMethod
-            self._parse = breaker
-        else:
-            if hasattr(self._parse,"_originalParseMethod"):
-                self._parse = self._parse._originalParseMethod
-        return self
-
-    def setParseAction( self, *fns, **kwargs ):
-        """
-        Define one or more actions to perform when successfully matching parse element definition.
-        Parse action fn is a callable method with 0-3 arguments, called as C{fn(s,loc,toks)},
-        C{fn(loc,toks)}, C{fn(toks)}, or just C{fn()}, where:
-         - s   = the original string being parsed (see note below)
-         - loc = the location of the matching substring
-         - toks = a list of the matched tokens, packaged as a C{L{ParseResults}} object
-        If the functions in fns modify the tokens, they can return them as the return
-        value from fn, and the modified list of tokens will replace the original.
-        Otherwise, fn does not need to return any value.
-
-        Optional keyword arguments:
-         - callDuringTry = (default=C{False}) indicate if parse action should be run during lookaheads and alternate testing
-
-        Note: the default parsing behavior is to expand tabs in the input string
-        before starting the parsing process.  See L{I{parseString}<parseString>} for more information
-        on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
-        consistent view of the parsed string, the parse location, and line and column
-        positions within the parsed string.
-        
-        Example::
-            integer = Word(nums)
-            date_str = integer + '/' + integer + '/' + integer
-
-            date_str.parseString("1999/12/31")  # -> ['1999', '/', '12', '/', '31']
-
-            # use parse action to convert to ints at parse time
-            integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
-            date_str = integer + '/' + integer + '/' + integer
-
-            # note that integer fields are now ints, not strings
-            date_str.parseString("1999/12/31")  # -> [1999, '/', 12, '/', 31]
-        """
-        self.parseAction = list(map(_trim_arity, list(fns)))
-        self.callDuringTry = kwargs.get("callDuringTry", False)
-        return self
-
-    def addParseAction( self, *fns, **kwargs ):
-        """
-        Add one or more parse actions to expression's list of parse actions. See L{I{setParseAction}<setParseAction>}.
-        
-        See examples in L{I{copy}<copy>}.
-        """
-        self.parseAction += list(map(_trim_arity, list(fns)))
-        self.callDuringTry = self.callDuringTry or kwargs.get("callDuringTry", False)
-        return self
-
-    def addCondition(self, *fns, **kwargs):
-        """Add a boolean predicate function to expression's list of parse actions. See 
-        L{I{setParseAction}<setParseAction>} for function call signatures. Unlike C{setParseAction}, 
-        functions passed to C{addCondition} need to return boolean success/fail of the condition.
-
-        Optional keyword arguments:
-         - message = define a custom message to be used in the raised exception
-         - fatal   = if True, will raise ParseFatalException to stop parsing immediately; otherwise will raise ParseException
-         
-        Example::
-            integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
-            year_int = integer.copy()
-            year_int.addCondition(lambda toks: toks[0] >= 2000, message="Only support years 2000 and later")
-            date_str = year_int + '/' + integer + '/' + integer
-
-            result = date_str.parseString("1999/12/31")  # -> Exception: Only support years 2000 and later (at char 0), (line:1, col:1)
-        """
-        msg = kwargs.get("message", "failed user-defined condition")
-        exc_type = ParseFatalException if kwargs.get("fatal", False) else ParseException
-        for fn in fns:
-            def pa(s,l,t):
-                if not bool(_trim_arity(fn)(s,l,t)):
-                    raise exc_type(s,l,msg)
-            self.parseAction.append(pa)
-        self.callDuringTry = self.callDuringTry or kwargs.get("callDuringTry", False)
-        return self
-
-    def setFailAction( self, fn ):
-        """Define action to perform if parsing fails at this expression.
-           Fail action fn is a callable function that takes the arguments
-           C{fn(s,loc,expr,err)} where:
-            - s = string being parsed
-            - loc = location where expression match was attempted and failed
-            - expr = the parse expression that failed
-            - err = the exception thrown
-           The function returns no value.  It may throw C{L{ParseFatalException}}
-           if it is desired to stop parsing immediately."""
-        self.failAction = fn
-        return self
-
-    def _skipIgnorables( self, instring, loc ):
-        exprsFound = True
-        while exprsFound:
-            exprsFound = False
-            for e in self.ignoreExprs:
-                try:
-                    while 1:
-                        loc,dummy = e._parse( instring, loc )
-                        exprsFound = True
-                except ParseException:
-                    pass
-        return loc
-
-    def preParse( self, instring, loc ):
-        if self.ignoreExprs:
-            loc = self._skipIgnorables( instring, loc )
-
-        if self.skipWhitespace:
-            wt = self.whiteChars
-            instrlen = len(instring)
-            while loc < instrlen and instring[loc] in wt:
-                loc += 1
-
-        return loc
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        return loc, []
-
-    def postParse( self, instring, loc, tokenlist ):
-        return tokenlist
-
-    #~ @profile
-    def _parseNoCache( self, instring, loc, doActions=True, callPreParse=True ):
-        debugging = ( self.debug ) #and doActions )
-
-        if debugging or self.failAction:
-            #~ print ("Match",self,"at loc",loc,"(%d,%d)" % ( lineno(loc,instring), col(loc,instring) ))
-            if (self.debugActions[0] ):
-                self.debugActions[0]( instring, loc, self )
-            if callPreParse and self.callPreparse:
-                preloc = self.preParse( instring, loc )
-            else:
-                preloc = loc
-            tokensStart = preloc
-            try:
-                try:
-                    loc,tokens = self.parseImpl( instring, preloc, doActions )
-                except IndexError:
-                    raise ParseException( instring, len(instring), self.errmsg, self )
-            except ParseBaseException as err:
-                #~ print ("Exception raised:", err)
-                if self.debugActions[2]:
-                    self.debugActions[2]( instring, tokensStart, self, err )
-                if self.failAction:
-                    self.failAction( instring, tokensStart, self, err )
-                raise
-        else:
-            if callPreParse and self.callPreparse:
-                preloc = self.preParse( instring, loc )
-            else:
-                preloc = loc
-            tokensStart = preloc
-            if self.mayIndexError or loc >= len(instring):
-                try:
-                    loc,tokens = self.parseImpl( instring, preloc, doActions )
-                except IndexError:
-                    raise ParseException( instring, len(instring), self.errmsg, self )
-            else:
-                loc,tokens = self.parseImpl( instring, preloc, doActions )
-
-        tokens = self.postParse( instring, loc, tokens )
-
-        retTokens = ParseResults( tokens, self.resultsName, asList=self.saveAsList, modal=self.modalResults )
-        if self.parseAction and (doActions or self.callDuringTry):
-            if debugging:
-                try:
-                    for fn in self.parseAction:
-                        tokens = fn( instring, tokensStart, retTokens )
-                        if tokens is not None:
-                            retTokens = ParseResults( tokens,
-                                                      self.resultsName,
-                                                      asList=self.saveAsList and isinstance(tokens,(ParseResults,list)),
-                                                      modal=self.modalResults )
-                except ParseBaseException as err:
-                    #~ print "Exception raised in user parse action:", err
-                    if (self.debugActions[2] ):
-                        self.debugActions[2]( instring, tokensStart, self, err )
-                    raise
-            else:
-                for fn in self.parseAction:
-                    tokens = fn( instring, tokensStart, retTokens )
-                    if tokens is not None:
-                        retTokens = ParseResults( tokens,
-                                                  self.resultsName,
-                                                  asList=self.saveAsList and isinstance(tokens,(ParseResults,list)),
-                                                  modal=self.modalResults )
-
-        if debugging:
-            #~ print ("Matched",self,"->",retTokens.asList())
-            if (self.debugActions[1] ):
-                self.debugActions[1]( instring, tokensStart, loc, self, retTokens )
-
-        return loc, retTokens
-
-    def tryParse( self, instring, loc ):
-        try:
-            return self._parse( instring, loc, doActions=False )[0]
-        except ParseFatalException:
-            raise ParseException( instring, loc, self.errmsg, self)
-    
-    def canParseNext(self, instring, loc):
-        try:
-            self.tryParse(instring, loc)
-        except (ParseException, IndexError):
-            return False
-        else:
-            return True
-
-    class _UnboundedCache(object):
-        def __init__(self):
-            cache = {}
-            self.not_in_cache = not_in_cache = object()
-
-            def get(self, key):
-                return cache.get(key, not_in_cache)
-
-            def set(self, key, value):
-                cache[key] = value
-
-            def clear(self):
-                cache.clear()
-                
-            def cache_len(self):
-                return len(cache)
-
-            self.get = types.MethodType(get, self)
-            self.set = types.MethodType(set, self)
-            self.clear = types.MethodType(clear, self)
-            self.__len__ = types.MethodType(cache_len, self)
-
-    if _OrderedDict is not None:
-        class _FifoCache(object):
-            def __init__(self, size):
-                self.not_in_cache = not_in_cache = object()
-
-                cache = _OrderedDict()
-
-                def get(self, key):
-                    return cache.get(key, not_in_cache)
-
-                def set(self, key, value):
-                    cache[key] = value
-                    while len(cache) > size:
-                        try:
-                            cache.popitem(False)
-                        except KeyError:
-                            pass
-
-                def clear(self):
-                    cache.clear()
-
-                def cache_len(self):
-                    return len(cache)
-
-                self.get = types.MethodType(get, self)
-                self.set = types.MethodType(set, self)
-                self.clear = types.MethodType(clear, self)
-                self.__len__ = types.MethodType(cache_len, self)
-
-    else:
-        class _FifoCache(object):
-            def __init__(self, size):
-                self.not_in_cache = not_in_cache = object()
-
-                cache = {}
-                key_fifo = collections.deque([], size)
-
-                def get(self, key):
-                    return cache.get(key, not_in_cache)
-
-                def set(self, key, value):
-                    cache[key] = value
-                    while len(key_fifo) > size:
-                        cache.pop(key_fifo.popleft(), None)
-                    key_fifo.append(key)
-
-                def clear(self):
-                    cache.clear()
-                    key_fifo.clear()
-
-                def cache_len(self):
-                    return len(cache)
-
-                self.get = types.MethodType(get, self)
-                self.set = types.MethodType(set, self)
-                self.clear = types.MethodType(clear, self)
-                self.__len__ = types.MethodType(cache_len, self)
-
-    # argument cache for optimizing repeated calls when backtracking through recursive expressions
-    packrat_cache = {} # this is set later by enabledPackrat(); this is here so that resetCache() doesn't fail
-    packrat_cache_lock = RLock()
-    packrat_cache_stats = [0, 0]
-
-    # this method gets repeatedly called during backtracking with the same arguments -
-    # we can cache these arguments and save ourselves the trouble of re-parsing the contained expression
-    def _parseCache( self, instring, loc, doActions=True, callPreParse=True ):
-        HIT, MISS = 0, 1
-        lookup = (self, instring, loc, callPreParse, doActions)
-        with ParserElement.packrat_cache_lock:
-            cache = ParserElement.packrat_cache
-            value = cache.get(lookup)
-            if value is cache.not_in_cache:
-                ParserElement.packrat_cache_stats[MISS] += 1
-                try:
-                    value = self._parseNoCache(instring, loc, doActions, callPreParse)
-                except ParseBaseException as pe:
-                    # cache a copy of the exception, without the traceback
-                    cache.set(lookup, pe.__class__(*pe.args))
-                    raise
-                else:
-                    cache.set(lookup, (value[0], value[1].copy()))
-                    return value
-            else:
-                ParserElement.packrat_cache_stats[HIT] += 1
-                if isinstance(value, Exception):
-                    raise value
-                return (value[0], value[1].copy())
-
-    _parse = _parseNoCache
-
-    @staticmethod
-    def resetCache():
-        ParserElement.packrat_cache.clear()
-        ParserElement.packrat_cache_stats[:] = [0] * len(ParserElement.packrat_cache_stats)
-
-    _packratEnabled = False
-    @staticmethod
-    def enablePackrat(cache_size_limit=128):
-        """Enables "packrat" parsing, which adds memoizing to the parsing logic.
-           Repeated parse attempts at the same string location (which happens
-           often in many complex grammars) can immediately return a cached value,
-           instead of re-executing parsing/validating code.  Memoizing is done of
-           both valid results and parsing exceptions.
-           
-           Parameters:
-            - cache_size_limit - (default=C{128}) - if an integer value is provided
-              will limit the size of the packrat cache; if None is passed, then
-              the cache size will be unbounded; if 0 is passed, the cache will
-              be effectively disabled.
-            
-           This speedup may break existing programs that use parse actions that
-           have side-effects.  For this reason, packrat parsing is disabled when
-           you first import pyparsing.  To activate the packrat feature, your
-           program must call the class method C{ParserElement.enablePackrat()}.  If
-           your program uses C{psyco} to "compile as you go", you must call
-           C{enablePackrat} before calling C{psyco.full()}.  If you do not do this,
-           Python will crash.  For best results, call C{enablePackrat()} immediately
-           after importing pyparsing.
-           
-           Example::
-               import pyparsing
-               pyparsing.ParserElement.enablePackrat()
-        """
-        if not ParserElement._packratEnabled:
-            ParserElement._packratEnabled = True
-            if cache_size_limit is None:
-                ParserElement.packrat_cache = ParserElement._UnboundedCache()
-            else:
-                ParserElement.packrat_cache = ParserElement._FifoCache(cache_size_limit)
-            ParserElement._parse = ParserElement._parseCache
-
-    def parseString( self, instring, parseAll=False ):
-        """
-        Execute the parse expression with the given string.
-        This is the main interface to the client code, once the complete
-        expression has been built.
-
-        If you want the grammar to require that the entire input string be
-        successfully parsed, then set C{parseAll} to True (equivalent to ending
-        the grammar with C{L{StringEnd()}}).
-
-        Note: C{parseString} implicitly calls C{expandtabs()} on the input string,
-        in order to report proper column numbers in parse actions.
-        If the input string contains tabs and
-        the grammar uses parse actions that use the C{loc} argument to index into the
-        string being parsed, you can ensure you have a consistent view of the input
-        string by:
-         - calling C{parseWithTabs} on your grammar before calling C{parseString}
-           (see L{I{parseWithTabs}<parseWithTabs>})
-         - define your parse action using the full C{(s,loc,toks)} signature, and
-           reference the input string using the parse action's C{s} argument
-         - explicitly expand the tabs in your input string before calling
-           C{parseString}
-        
-        Example::
-            Word('a').parseString('aaaaabaaa')  # -> ['aaaaa']
-            Word('a').parseString('aaaaabaaa', parseAll=True)  # -> Exception: Expected end of text
-        """
-        ParserElement.resetCache()
-        if not self.streamlined:
-            self.streamline()
-            #~ self.saveAsList = True
-        for e in self.ignoreExprs:
-            e.streamline()
-        if not self.keepTabs:
-            instring = instring.expandtabs()
-        try:
-            loc, tokens = self._parse( instring, 0 )
-            if parseAll:
-                loc = self.preParse( instring, loc )
-                se = Empty() + StringEnd()
-                se._parse( instring, loc )
-        except ParseBaseException as exc:
-            if ParserElement.verbose_stacktrace:
-                raise
-            else:
-                # catch and re-raise exception from here, clears out pyparsing internal stack trace
-                raise exc
-        else:
-            return tokens
-
-    def scanString( self, instring, maxMatches=_MAX_INT, overlap=False ):
-        """
-        Scan the input string for expression matches.  Each match will return the
-        matching tokens, start location, and end location.  May be called with optional
-        C{maxMatches} argument, to clip scanning after 'n' matches are found.  If
-        C{overlap} is specified, then overlapping matches will be reported.
-
-        Note that the start and end locations are reported relative to the string
-        being parsed.  See L{I{parseString}<parseString>} for more information on parsing
-        strings with embedded tabs.
-
-        Example::
-            source = "sldjf123lsdjjkf345sldkjf879lkjsfd987"
-            print(source)
-            for tokens,start,end in Word(alphas).scanString(source):
-                print(' '*start + '^'*(end-start))
-                print(' '*start + tokens[0])
-        
-        prints::
-        
-            sldjf123lsdjjkf345sldkjf879lkjsfd987
-            ^^^^^
-            sldjf
-                    ^^^^^^^
-                    lsdjjkf
-                              ^^^^^^
-                              sldkjf
-                                       ^^^^^^
-                                       lkjsfd
-        """
-        if not self.streamlined:
-            self.streamline()
-        for e in self.ignoreExprs:
-            e.streamline()
-
-        if not self.keepTabs:
-            instring = _ustr(instring).expandtabs()
-        instrlen = len(instring)
-        loc = 0
-        preparseFn = self.preParse
-        parseFn = self._parse
-        ParserElement.resetCache()
-        matches = 0
-        try:
-            while loc <= instrlen and matches < maxMatches:
-                try:
-                    preloc = preparseFn( instring, loc )
-                    nextLoc,tokens = parseFn( instring, preloc, callPreParse=False )
-                except ParseException:
-                    loc = preloc+1
-                else:
-                    if nextLoc > loc:
-                        matches += 1
-                        yield tokens, preloc, nextLoc
-                        if overlap:
-                            nextloc = preparseFn( instring, loc )
-                            if nextloc > loc:
-                                loc = nextLoc
-                            else:
-                                loc += 1
-                        else:
-                            loc = nextLoc
-                    else:
-                        loc = preloc+1
-        except ParseBaseException as exc:
-            if ParserElement.verbose_stacktrace:
-                raise
-            else:
-                # catch and re-raise exception from here, clears out pyparsing internal stack trace
-                raise exc
-
-    def transformString( self, instring ):
-        """
-        Extension to C{L{scanString}}, to modify matching text with modified tokens that may
-        be returned from a parse action.  To use C{transformString}, define a grammar and
-        attach a parse action to it that modifies the returned token list.
-        Invoking C{transformString()} on a target string will then scan for matches,
-        and replace the matched text patterns according to the logic in the parse
-        action.  C{transformString()} returns the resulting transformed string.
-        
-        Example::
-            wd = Word(alphas)
-            wd.setParseAction(lambda toks: toks[0].title())
-            
-            print(wd.transformString("now is the winter of our discontent made glorious summer by this sun of york."))
-        Prints::
-            Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York.
-        """
-        out = []
-        lastE = 0
-        # force preservation of <TAB>s, to minimize unwanted transformation of string, and to
-        # keep string locs straight between transformString and scanString
-        self.keepTabs = True
-        try:
-            for t,s,e in self.scanString( instring ):
-                out.append( instring[lastE:s] )
-                if t:
-                    if isinstance(t,ParseResults):
-                        out += t.asList()
-                    elif isinstance(t,list):
-                        out += t
-                    else:
-                        out.append(t)
-                lastE = e
-            out.append(instring[lastE:])
-            out = [o for o in out if o]
-            return "".join(map(_ustr,_flatten(out)))
-        except ParseBaseException as exc:
-            if ParserElement.verbose_stacktrace:
-                raise
-            else:
-                # catch and re-raise exception from here, clears out pyparsing internal stack trace
-                raise exc
-
-    def searchString( self, instring, maxMatches=_MAX_INT ):
-        """
-        Another extension to C{L{scanString}}, simplifying the access to the tokens found
-        to match the given parse expression.  May be called with optional
-        C{maxMatches} argument, to clip searching after 'n' matches are found.
-        
-        Example::
-            # a capitalized word starts with an uppercase letter, followed by zero or more lowercase letters
-            cap_word = Word(alphas.upper(), alphas.lower())
-            
-            print(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity"))
-
-            # the sum() builtin can be used to merge results into a single ParseResults object
-            print(sum(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity")))
-        prints::
-            [['More'], ['Iron'], ['Lead'], ['Gold'], ['I'], ['Electricity']]
-            ['More', 'Iron', 'Lead', 'Gold', 'I', 'Electricity']
-        """
-        try:
-            return ParseResults([ t for t,s,e in self.scanString( instring, maxMatches ) ])
-        except ParseBaseException as exc:
-            if ParserElement.verbose_stacktrace:
-                raise
-            else:
-                # catch and re-raise exception from here, clears out pyparsing internal stack trace
-                raise exc
-
-    def split(self, instring, maxsplit=_MAX_INT, includeSeparators=False):
-        """
-        Generator method to split a string using the given expression as a separator.
-        May be called with optional C{maxsplit} argument, to limit the number of splits;
-        and the optional C{includeSeparators} argument (default=C{False}), if the separating
-        matching text should be included in the split results.
-        
-        Example::        
-            punc = oneOf(list(".,;:/-!?"))
-            print(list(punc.split("This, this?, this sentence, is badly punctuated!")))
-        prints::
-            ['This', ' this', '', ' this sentence', ' is badly punctuated', '']
-        """
-        splits = 0
-        last = 0
-        for t,s,e in self.scanString(instring, maxMatches=maxsplit):
-            yield instring[last:s]
-            if includeSeparators:
-                yield t[0]
-            last = e
-        yield instring[last:]
-
-    def __add__(self, other ):
-        """
-        Implementation of + operator - returns C{L{And}}. Adding strings to a ParserElement
-        converts them to L{Literal}s by default.
-        
-        Example::
-            greet = Word(alphas) + "," + Word(alphas) + "!"
-            hello = "Hello, World!"
-            print (hello, "->", greet.parseString(hello))
-        Prints::
-            Hello, World! -> ['Hello', ',', 'World', '!']
-        """
-        if isinstance( other, basestring ):
-            other = ParserElement._literalStringClass( other )
-        if not isinstance( other, ParserElement ):
-            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
-                    SyntaxWarning, stacklevel=2)
-            return None
-        return And( [ self, other ] )
-
-    def __radd__(self, other ):
-        """
-        Implementation of + operator when left operand is not a C{L{ParserElement}}
-        """
-        if isinstance( other, basestring ):
-            other = ParserElement._literalStringClass( other )
-        if not isinstance( other, ParserElement ):
-            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
-                    SyntaxWarning, stacklevel=2)
-            return None
-        return other + self
-
-    def __sub__(self, other):
-        """
-        Implementation of - operator, returns C{L{And}} with error stop
-        """
-        if isinstance( other, basestring ):
-            other = ParserElement._literalStringClass( other )
-        if not isinstance( other, ParserElement ):
-            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
-                    SyntaxWarning, stacklevel=2)
-            return None
-        return self + And._ErrorStop() + other
-
-    def __rsub__(self, other ):
-        """
-        Implementation of - operator when left operand is not a C{L{ParserElement}}
-        """
-        if isinstance( other, basestring ):
-            other = ParserElement._literalStringClass( other )
-        if not isinstance( other, ParserElement ):
-            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
-                    SyntaxWarning, stacklevel=2)
-            return None
-        return other - self
-
-    def __mul__(self,other):
-        """
-        Implementation of * operator, allows use of C{expr * 3} in place of
-        C{expr + expr + expr}.  Expressions may also me multiplied by a 2-integer
-        tuple, similar to C{{min,max}} multipliers in regular expressions.  Tuples
-        may also include C{None} as in:
-         - C{expr*(n,None)} or C{expr*(n,)} is equivalent
-              to C{expr*n + L{ZeroOrMore}(expr)}
-              (read as "at least n instances of C{expr}")
-         - C{expr*(None,n)} is equivalent to C{expr*(0,n)}
-              (read as "0 to n instances of C{expr}")
-         - C{expr*(None,None)} is equivalent to C{L{ZeroOrMore}(expr)}
-         - C{expr*(1,None)} is equivalent to C{L{OneOrMore}(expr)}
-
-        Note that C{expr*(None,n)} does not raise an exception if
-        more than n exprs exist in the input stream; that is,
-        C{expr*(None,n)} does not enforce a maximum number of expr
-        occurrences.  If this behavior is desired, then write
-        C{expr*(None,n) + ~expr}
-        """
-        if isinstance(other,int):
-            minElements, optElements = other,0
-        elif isinstance(other,tuple):
-            other = (other + (None, None))[:2]
-            if other[0] is None:
-                other = (0, other[1])
-            if isinstance(other[0],int) and other[1] is None:
-                if other[0] == 0:
-                    return ZeroOrMore(self)
-                if other[0] == 1:
-                    return OneOrMore(self)
-                else:
-                    return self*other[0] + ZeroOrMore(self)
-            elif isinstance(other[0],int) and isinstance(other[1],int):
-                minElements, optElements = other
-                optElements -= minElements
-            else:
-                raise TypeError("cannot multiply 'ParserElement' and ('%s','%s') objects", type(other[0]),type(other[1]))
-        else:
-            raise TypeError("cannot multiply 'ParserElement' and '%s' objects", type(other))
-
-        if minElements < 0:
-            raise ValueError("cannot multiply ParserElement by negative value")
-        if optElements < 0:
-            raise ValueError("second tuple value must be greater or equal to first tuple value")
-        if minElements == optElements == 0:
-            raise ValueError("cannot multiply ParserElement by 0 or (0,0)")
-
-        if (optElements):
-            def makeOptionalList(n):
-                if n>1:
-                    return Optional(self + makeOptionalList(n-1))
-                else:
-                    return Optional(self)
-            if minElements:
-                if minElements == 1:
-                    ret = self + makeOptionalList(optElements)
-                else:
-                    ret = And([self]*minElements) + makeOptionalList(optElements)
-            else:
-                ret = makeOptionalList(optElements)
-        else:
-            if minElements == 1:
-                ret = self
-            else:
-                ret = And([self]*minElements)
-        return ret
-
-    def __rmul__(self, other):
-        return self.__mul__(other)
-
-    def __or__(self, other ):
-        """
-        Implementation of | operator - returns C{L{MatchFirst}}
-        """
-        if isinstance( other, basestring ):
-            other = ParserElement._literalStringClass( other )
-        if not isinstance( other, ParserElement ):
-            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
-                    SyntaxWarning, stacklevel=2)
-            return None
-        return MatchFirst( [ self, other ] )
-
-    def __ror__(self, other ):
-        """
-        Implementation of | operator when left operand is not a C{L{ParserElement}}
-        """
-        if isinstance( other, basestring ):
-            other = ParserElement._literalStringClass( other )
-        if not isinstance( other, ParserElement ):
-            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
-                    SyntaxWarning, stacklevel=2)
-            return None
-        return other | self
-
-    def __xor__(self, other ):
-        """
-        Implementation of ^ operator - returns C{L{Or}}
-        """
-        if isinstance( other, basestring ):
-            other = ParserElement._literalStringClass( other )
-        if not isinstance( other, ParserElement ):
-            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
-                    SyntaxWarning, stacklevel=2)
-            return None
-        return Or( [ self, other ] )
-
-    def __rxor__(self, other ):
-        """
-        Implementation of ^ operator when left operand is not a C{L{ParserElement}}
-        """
-        if isinstance( other, basestring ):
-            other = ParserElement._literalStringClass( other )
-        if not isinstance( other, ParserElement ):
-            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
-                    SyntaxWarning, stacklevel=2)
-            return None
-        return other ^ self
-
-    def __and__(self, other ):
-        """
-        Implementation of & operator - returns C{L{Each}}
-        """
-        if isinstance( other, basestring ):
-            other = ParserElement._literalStringClass( other )
-        if not isinstance( other, ParserElement ):
-            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
-                    SyntaxWarning, stacklevel=2)
-            return None
-        return Each( [ self, other ] )
-
-    def __rand__(self, other ):
-        """
-        Implementation of & operator when left operand is not a C{L{ParserElement}}
-        """
-        if isinstance( other, basestring ):
-            other = ParserElement._literalStringClass( other )
-        if not isinstance( other, ParserElement ):
-            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
-                    SyntaxWarning, stacklevel=2)
-            return None
-        return other & self
-
-    def __invert__( self ):
-        """
-        Implementation of ~ operator - returns C{L{NotAny}}
-        """
-        return NotAny( self )
-
-    def __call__(self, name=None):
-        """
-        Shortcut for C{L{setResultsName}}, with C{listAllMatches=False}.
-        
-        If C{name} is given with a trailing C{'*'} character, then C{listAllMatches} will be
-        passed as C{True}.
-           
-        If C{name} is omitted, same as calling C{L{copy}}.
-
-        Example::
-            # these are equivalent
-            userdata = Word(alphas).setResultsName("name") + Word(nums+"-").setResultsName("socsecno")
-            userdata = Word(alphas)("name") + Word(nums+"-")("socsecno")             
-        """
-        if name is not None:
-            return self.setResultsName(name)
-        else:
-            return self.copy()
-
-    def suppress( self ):
-        """
-        Suppresses the output of this C{ParserElement}; useful to keep punctuation from
-        cluttering up returned output.
-        """
-        return Suppress( self )
-
-    def leaveWhitespace( self ):
-        """
-        Disables the skipping of whitespace before matching the characters in the
-        C{ParserElement}'s defined pattern.  This is normally only used internally by
-        the pyparsing module, but may be needed in some whitespace-sensitive grammars.
-        """
-        self.skipWhitespace = False
-        return self
-
-    def setWhitespaceChars( self, chars ):
-        """
-        Overrides the default whitespace chars
-        """
-        self.skipWhitespace = True
-        self.whiteChars = chars
-        self.copyDefaultWhiteChars = False
-        return self
-
-    def parseWithTabs( self ):
-        """
-        Overrides default behavior to expand C{<TAB>}s to spaces before parsing the input string.
-        Must be called before C{parseString} when the input grammar contains elements that
-        match C{<TAB>} characters.
-        """
-        self.keepTabs = True
-        return self
-
-    def ignore( self, other ):
-        """
-        Define expression to be ignored (e.g., comments) while doing pattern
-        matching; may be called repeatedly, to define multiple comment or other
-        ignorable patterns.
-        
-        Example::
-            patt = OneOrMore(Word(alphas))
-            patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj']
-            
-            patt.ignore(cStyleComment)
-            patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj', 'lskjd']
-        """
-        if isinstance(other, basestring):
-            other = Suppress(other)
-
-        if isinstance( other, Suppress ):
-            if other not in self.ignoreExprs:
-                self.ignoreExprs.append(other)
-        else:
-            self.ignoreExprs.append( Suppress( other.copy() ) )
-        return self
-
-    def setDebugActions( self, startAction, successAction, exceptionAction ):
-        """
-        Enable display of debugging messages while doing pattern matching.
-        """
-        self.debugActions = (startAction or _defaultStartDebugAction,
-                             successAction or _defaultSuccessDebugAction,
-                             exceptionAction or _defaultExceptionDebugAction)
-        self.debug = True
-        return self
-
-    def setDebug( self, flag=True ):
-        """
-        Enable display of debugging messages while doing pattern matching.
-        Set C{flag} to True to enable, False to disable.
-
-        Example::
-            wd = Word(alphas).setName("alphaword")
-            integer = Word(nums).setName("numword")
-            term = wd | integer
-            
-            # turn on debugging for wd
-            wd.setDebug()
-
-            OneOrMore(term).parseString("abc 123 xyz 890")
-        
-        prints::
-            Match alphaword at loc 0(1,1)
-            Matched alphaword -> ['abc']
-            Match alphaword at loc 3(1,4)
-            Exception raised:Expected alphaword (at char 4), (line:1, col:5)
-            Match alphaword at loc 7(1,8)
-            Matched alphaword -> ['xyz']
-            Match alphaword at loc 11(1,12)
-            Exception raised:Expected alphaword (at char 12), (line:1, col:13)
-            Match alphaword at loc 15(1,16)
-            Exception raised:Expected alphaword (at char 15), (line:1, col:16)
-
-        The output shown is that produced by the default debug actions - custom debug actions can be
-        specified using L{setDebugActions}. Prior to attempting
-        to match the C{wd} expression, the debugging message C{"Match <exprname> at loc <n>(<line>,<col>)"}
-        is shown. Then if the parse succeeds, a C{"Matched"} message is shown, or an C{"Exception raised"}
-        message is shown. Also note the use of L{setName} to assign a human-readable name to the expression,
-        which makes debugging and exception messages easier to understand - for instance, the default
-        name created for the C{Word} expression without calling C{setName} is C{"W:(ABCD...)"}.
-        """
-        if flag:
-            self.setDebugActions( _defaultStartDebugAction, _defaultSuccessDebugAction, _defaultExceptionDebugAction )
-        else:
-            self.debug = False
-        return self
-
-    def __str__( self ):
-        return self.name
-
-    def __repr__( self ):
-        return _ustr(self)
-
-    def streamline( self ):
-        self.streamlined = True
-        self.strRepr = None
-        return self
-
-    def checkRecursion( self, parseElementList ):
-        pass
-
-    def validate( self, validateTrace=[] ):
-        """
-        Check defined expressions for valid structure, check for infinite recursive definitions.
-        """
-        self.checkRecursion( [] )
-
-    def parseFile( self, file_or_filename, parseAll=False ):
-        """
-        Execute the parse expression on the given file or filename.
-        If a filename is specified (instead of a file object),
-        the entire file is opened, read, and closed before parsing.
-        """
-        try:
-            file_contents = file_or_filename.read()
-        except AttributeError:
-            with open(file_or_filename, "r") as f:
-                file_contents = f.read()
-        try:
-            return self.parseString(file_contents, parseAll)
-        except ParseBaseException as exc:
-            if ParserElement.verbose_stacktrace:
-                raise
-            else:
-                # catch and re-raise exception from here, clears out pyparsing internal stack trace
-                raise exc
-
-    def __eq__(self,other):
-        if isinstance(other, ParserElement):
-            return self is other or vars(self) == vars(other)
-        elif isinstance(other, basestring):
-            return self.matches(other)
-        else:
-            return super(ParserElement,self)==other
-
-    def __ne__(self,other):
-        return not (self == other)
-
-    def __hash__(self):
-        return hash(id(self))
-
-    def __req__(self,other):
-        return self == other
-
-    def __rne__(self,other):
-        return not (self == other)
-
-    def matches(self, testString, parseAll=True):
-        """
-        Method for quick testing of a parser against a test string. Good for simple 
-        inline microtests of sub expressions while building up larger parser.
-           
-        Parameters:
-         - testString - to test against this expression for a match
-         - parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
-            
-        Example::
-            expr = Word(nums)
-            assert expr.matches("100")
-        """
-        try:
-            self.parseString(_ustr(testString), parseAll=parseAll)
-            return True
-        except ParseBaseException:
-            return False
-                
-    def runTests(self, tests, parseAll=True, comment='#', fullDump=True, printResults=True, failureTests=False):
-        """
-        Execute the parse expression on a series of test strings, showing each
-        test, the parsed results or where the parse failed. Quick and easy way to
-        run a parse expression against a list of sample strings.
-           
-        Parameters:
-         - tests - a list of separate test strings, or a multiline string of test strings
-         - parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests           
-         - comment - (default=C{'#'}) - expression for indicating embedded comments in the test 
-              string; pass None to disable comment filtering
-         - fullDump - (default=C{True}) - dump results as list followed by results names in nested outline;
-              if False, only dump nested list
-         - printResults - (default=C{True}) prints test output to stdout
-         - failureTests - (default=C{False}) indicates if these tests are expected to fail parsing
-
-        Returns: a (success, results) tuple, where success indicates that all tests succeeded
-        (or failed if C{failureTests} is True), and the results contain a list of lines of each 
-        test's output
-        
-        Example::
-            number_expr = pyparsing_common.number.copy()
-
-            result = number_expr.runTests('''
-                # unsigned integer
-                100
-                # negative integer
-                -100
-                # float with scientific notation
-                6.02e23
-                # integer with scientific notation
-                1e-12
-                ''')
-            print("Success" if result[0] else "Failed!")
-
-            result = number_expr.runTests('''
-                # stray character
-                100Z
-                # missing leading digit before '.'
-                -.100
-                # too many '.'
-                3.14.159
-                ''', failureTests=True)
-            print("Success" if result[0] else "Failed!")
-        prints::
-            # unsigned integer
-            100
-            [100]
-
-            # negative integer
-            -100
-            [-100]
-
-            # float with scientific notation
-            6.02e23
-            [6.02e+23]
-
-            # integer with scientific notation
-            1e-12
-            [1e-12]
-
-            Success
-            
-            # stray character
-            100Z
-               ^
-            FAIL: Expected end of text (at char 3), (line:1, col:4)
-
-            # missing leading digit before '.'
-            -.100
-            ^
-            FAIL: Expected {real number with scientific notation | real number | signed integer} (at char 0), (line:1, col:1)
-
-            # too many '.'
-            3.14.159
-                ^
-            FAIL: Expected end of text (at char 4), (line:1, col:5)
-
-            Success
-
-        Each test string must be on a single line. If you want to test a string that spans multiple
-        lines, create a test like this::
-
-            expr.runTest(r"this is a test\\n of strings that spans \\n 3 lines")
-        
-        (Note that this is a raw string literal, you must include the leading 'r'.)
-        """
-        if isinstance(tests, basestring):
-            tests = list(map(str.strip, tests.rstrip().splitlines()))
-        if isinstance(comment, basestring):
-            comment = Literal(comment)
-        allResults = []
-        comments = []
-        success = True
-        for t in tests:
-            if comment is not None and comment.matches(t, False) or comments and not t:
-                comments.append(t)
-                continue
-            if not t:
-                continue
-            out = ['\n'.join(comments), t]
-            comments = []
-            try:
-                t = t.replace(r'\n','\n')
-                result = self.parseString(t, parseAll=parseAll)
-                out.append(result.dump(full=fullDump))
-                success = success and not failureTests
-            except ParseBaseException as pe:
-                fatal = "(FATAL)" if isinstance(pe, ParseFatalException) else ""
-                if '\n' in t:
-                    out.append(line(pe.loc, t))
-                    out.append(' '*(col(pe.loc,t)-1) + '^' + fatal)
-                else:
-                    out.append(' '*pe.loc + '^' + fatal)
-                out.append("FAIL: " + str(pe))
-                success = success and failureTests
-                result = pe
-            except Exception as exc:
-                out.append("FAIL-EXCEPTION: " + str(exc))
-                success = success and failureTests
-                result = exc
-
-            if printResults:
-                if fullDump:
-                    out.append('')
-                print('\n'.join(out))
-
-            allResults.append((t, result))
-        
-        return success, allResults
-
-        
-class Token(ParserElement):
-    """
-    Abstract C{ParserElement} subclass, for defining atomic matching patterns.
-    """
-    def __init__( self ):
-        super(Token,self).__init__( savelist=False )
-
-
-class Empty(Token):
-    """
-    An empty token, will always match.
-    """
-    def __init__( self ):
-        super(Empty,self).__init__()
-        self.name = "Empty"
-        self.mayReturnEmpty = True
-        self.mayIndexError = False
-
-
-class NoMatch(Token):
-    """
-    A token that will never match.
-    """
-    def __init__( self ):
-        super(NoMatch,self).__init__()
-        self.name = "NoMatch"
-        self.mayReturnEmpty = True
-        self.mayIndexError = False
-        self.errmsg = "Unmatchable token"
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        raise ParseException(instring, loc, self.errmsg, self)
-
-
-class Literal(Token):
-    """
-    Token to exactly match a specified string.
-    
-    Example::
-        Literal('blah').parseString('blah')  # -> ['blah']
-        Literal('blah').parseString('blahfooblah')  # -> ['blah']
-        Literal('blah').parseString('bla')  # -> Exception: Expected "blah"
-    
-    For case-insensitive matching, use L{CaselessLiteral}.
-    
-    For keyword matching (force word break before and after the matched string),
-    use L{Keyword} or L{CaselessKeyword}.
-    """
-    def __init__( self, matchString ):
-        super(Literal,self).__init__()
-        self.match = matchString
-        self.matchLen = len(matchString)
-        try:
-            self.firstMatchChar = matchString[0]
-        except IndexError:
-            warnings.warn("null string passed to Literal; use Empty() instead",
-                            SyntaxWarning, stacklevel=2)
-            self.__class__ = Empty
-        self.name = '"%s"' % _ustr(self.match)
-        self.errmsg = "Expected " + self.name
-        self.mayReturnEmpty = False
-        self.mayIndexError = False
-
-    # Performance tuning: this routine gets called a *lot*
-    # if this is a single character match string  and the first character matches,
-    # short-circuit as quickly as possible, and avoid calling startswith
-    #~ @profile
-    def parseImpl( self, instring, loc, doActions=True ):
-        if (instring[loc] == self.firstMatchChar and
-            (self.matchLen==1 or instring.startswith(self.match,loc)) ):
-            return loc+self.matchLen, self.match
-        raise ParseException(instring, loc, self.errmsg, self)
-_L = Literal
-ParserElement._literalStringClass = Literal
-
-class Keyword(Token):
-    """
-    Token to exactly match a specified string as a keyword, that is, it must be
-    immediately followed by a non-keyword character.  Compare with C{L{Literal}}:
-     - C{Literal("if")} will match the leading C{'if'} in C{'ifAndOnlyIf'}.
-     - C{Keyword("if")} will not; it will only match the leading C{'if'} in C{'if x=1'}, or C{'if(y==2)'}
-    Accepts two optional constructor arguments in addition to the keyword string:
-     - C{identChars} is a string of characters that would be valid identifier characters,
-          defaulting to all alphanumerics + "_" and "$"
-     - C{caseless} allows case-insensitive matching, default is C{False}.
-       
-    Example::
-        Keyword("start").parseString("start")  # -> ['start']
-        Keyword("start").parseString("starting")  # -> Exception
-
-    For case-insensitive matching, use L{CaselessKeyword}.
-    """
-    DEFAULT_KEYWORD_CHARS = alphanums+"_$"
-
-    def __init__( self, matchString, identChars=None, caseless=False ):
-        super(Keyword,self).__init__()
-        if identChars is None:
-            identChars = Keyword.DEFAULT_KEYWORD_CHARS
-        self.match = matchString
-        self.matchLen = len(matchString)
-        try:
-            self.firstMatchChar = matchString[0]
-        except IndexError:
-            warnings.warn("null string passed to Keyword; use Empty() instead",
-                            SyntaxWarning, stacklevel=2)
-        self.name = '"%s"' % self.match
-        self.errmsg = "Expected " + self.name
-        self.mayReturnEmpty = False
-        self.mayIndexError = False
-        self.caseless = caseless
-        if caseless:
-            self.caselessmatch = matchString.upper()
-            identChars = identChars.upper()
-        self.identChars = set(identChars)
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        if self.caseless:
-            if ( (instring[ loc:loc+self.matchLen ].upper() == self.caselessmatch) and
-                 (loc >= len(instring)-self.matchLen or instring[loc+self.matchLen].upper() not in self.identChars) and
-                 (loc == 0 or instring[loc-1].upper() not in self.identChars) ):
-                return loc+self.matchLen, self.match
-        else:
-            if (instring[loc] == self.firstMatchChar and
-                (self.matchLen==1 or instring.startswith(self.match,loc)) and
-                (loc >= len(instring)-self.matchLen or instring[loc+self.matchLen] not in self.identChars) and
-                (loc == 0 or instring[loc-1] not in self.identChars) ):
-                return loc+self.matchLen, self.match
-        raise ParseException(instring, loc, self.errmsg, self)
-
-    def copy(self):
-        c = super(Keyword,self).copy()
-        c.identChars = Keyword.DEFAULT_KEYWORD_CHARS
-        return c
-
-    @staticmethod
-    def setDefaultKeywordChars( chars ):
-        """Overrides the default Keyword chars
-        """
-        Keyword.DEFAULT_KEYWORD_CHARS = chars
-
-class CaselessLiteral(Literal):
-    """
-    Token to match a specified string, ignoring case of letters.
-    Note: the matched results will always be in the case of the given
-    match string, NOT the case of the input text.
-
-    Example::
-        OneOrMore(CaselessLiteral("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD', 'CMD']
-        
-    (Contrast with example for L{CaselessKeyword}.)
-    """
-    def __init__( self, matchString ):
-        super(CaselessLiteral,self).__init__( matchString.upper() )
-        # Preserve the defining literal.
-        self.returnString = matchString
-        self.name = "'%s'" % self.returnString
-        self.errmsg = "Expected " + self.name
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        if instring[ loc:loc+self.matchLen ].upper() == self.match:
-            return loc+self.matchLen, self.returnString
-        raise ParseException(instring, loc, self.errmsg, self)
-
-class CaselessKeyword(Keyword):
-    """
-    Caseless version of L{Keyword}.
-
-    Example::
-        OneOrMore(CaselessKeyword("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD']
-        
-    (Contrast with example for L{CaselessLiteral}.)
-    """
-    def __init__( self, matchString, identChars=None ):
-        super(CaselessKeyword,self).__init__( matchString, identChars, caseless=True )
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        if ( (instring[ loc:loc+self.matchLen ].upper() == self.caselessmatch) and
-             (loc >= len(instring)-self.matchLen or instring[loc+self.matchLen].upper() not in self.identChars) ):
-            return loc+self.matchLen, self.match
-        raise ParseException(instring, loc, self.errmsg, self)
-
-class CloseMatch(Token):
-    """
-    A variation on L{Literal} which matches "close" matches, that is, 
-    strings with at most 'n' mismatching characters. C{CloseMatch} takes parameters:
-     - C{match_string} - string to be matched
-     - C{maxMismatches} - (C{default=1}) maximum number of mismatches allowed to count as a match
-    
-    The results from a successful parse will contain the matched text from the input string and the following named results:
-     - C{mismatches} - a list of the positions within the match_string where mismatches were found
-     - C{original} - the original match_string used to compare against the input string
-    
-    If C{mismatches} is an empty list, then the match was an exact match.
-    
-    Example::
-        patt = CloseMatch("ATCATCGAATGGA")
-        patt.parseString("ATCATCGAAXGGA") # -> (['ATCATCGAAXGGA'], {'mismatches': [[9]], 'original': ['ATCATCGAATGGA']})
-        patt.parseString("ATCAXCGAAXGGA") # -> Exception: Expected 'ATCATCGAATGGA' (with up to 1 mismatches) (at char 0), (line:1, col:1)
-
-        # exact match
-        patt.parseString("ATCATCGAATGGA") # -> (['ATCATCGAATGGA'], {'mismatches': [[]], 'original': ['ATCATCGAATGGA']})
-
-        # close match allowing up to 2 mismatches
-        patt = CloseMatch("ATCATCGAATGGA", maxMismatches=2)
-        patt.parseString("ATCAXCGAAXGGA") # -> (['ATCAXCGAAXGGA'], {'mismatches': [[4, 9]], 'original': ['ATCATCGAATGGA']})
-    """
-    def __init__(self, match_string, maxMismatches=1):
-        super(CloseMatch,self).__init__()
-        self.name = match_string
-        self.match_string = match_string
-        self.maxMismatches = maxMismatches
-        self.errmsg = "Expected %r (with up to %d mismatches)" % (self.match_string, self.maxMismatches)
-        self.mayIndexError = False
-        self.mayReturnEmpty = False
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        start = loc
-        instrlen = len(instring)
-        maxloc = start + len(self.match_string)
-
-        if maxloc <= instrlen:
-            match_string = self.match_string
-            match_stringloc = 0
-            mismatches = []
-            maxMismatches = self.maxMismatches
-
-            for match_stringloc,s_m in enumerate(zip(instring[loc:maxloc], self.match_string)):
-                src,mat = s_m
-                if src != mat:
-                    mismatches.append(match_stringloc)
-                    if len(mismatches) > maxMismatches:
-                        break
-            else:
-                loc = match_stringloc + 1
-                results = ParseResults([instring[start:loc]])
-                results['original'] = self.match_string
-                results['mismatches'] = mismatches
-                return loc, results
-
-        raise ParseException(instring, loc, self.errmsg, self)
-
-
-class Word(Token):
-    """
-    Token for matching words composed of allowed character sets.
-    Defined with string containing all allowed initial characters,
-    an optional string containing allowed body characters (if omitted,
-    defaults to the initial character set), and an optional minimum,
-    maximum, and/or exact length.  The default value for C{min} is 1 (a
-    minimum value < 1 is not valid); the default values for C{max} and C{exact}
-    are 0, meaning no maximum or exact length restriction. An optional
-    C{excludeChars} parameter can list characters that might be found in 
-    the input C{bodyChars} string; useful to define a word of all printables
-    except for one or two characters, for instance.
-    
-    L{srange} is useful for defining custom character set strings for defining 
-    C{Word} expressions, using range notation from regular expression character sets.
-    
-    A common mistake is to use C{Word} to match a specific literal string, as in 
-    C{Word("Address")}. Remember that C{Word} uses the string argument to define
-    I{sets} of matchable characters. This expression would match "Add", "AAA",
-    "dAred", or any other word made up of the characters 'A', 'd', 'r', 'e', and 's'.
-    To match an exact literal string, use L{Literal} or L{Keyword}.
-
-    pyparsing includes helper strings for building Words:
-     - L{alphas}
-     - L{nums}
-     - L{alphanums}
-     - L{hexnums}
-     - L{alphas8bit} (alphabetic characters in ASCII range 128-255 - accented, tilded, umlauted, etc.)
-     - L{punc8bit} (non-alphabetic characters in ASCII range 128-255 - currency, symbols, superscripts, diacriticals, etc.)
-     - L{printables} (any non-whitespace character)
-
-    Example::
-        # a word composed of digits
-        integer = Word(nums) # equivalent to Word("0123456789") or Word(srange("0-9"))
-        
-        # a word with a leading capital, and zero or more lowercase
-        capital_word = Word(alphas.upper(), alphas.lower())
-
-        # hostnames are alphanumeric, with leading alpha, and '-'
-        hostname = Word(alphas, alphanums+'-')
-        
-        # roman numeral (not a strict parser, accepts invalid mix of characters)
-        roman = Word("IVXLCDM")
-        
-        # any string of non-whitespace characters, except for ','
-        csv_value = Word(printables, excludeChars=",")
-    """
-    def __init__( self, initChars, bodyChars=None, min=1, max=0, exact=0, asKeyword=False, excludeChars=None ):
-        super(Word,self).__init__()
-        if excludeChars:
-            initChars = ''.join(c for c in initChars if c not in excludeChars)
-            if bodyChars:
-                bodyChars = ''.join(c for c in bodyChars if c not in excludeChars)
-        self.initCharsOrig = initChars
-        self.initChars = set(initChars)
-        if bodyChars :
-            self.bodyCharsOrig = bodyChars
-            self.bodyChars = set(bodyChars)
-        else:
-            self.bodyCharsOrig = initChars
-            self.bodyChars = set(initChars)
-
-        self.maxSpecified = max > 0
-
-        if min < 1:
-            raise ValueError("cannot specify a minimum length < 1; use Optional(Word()) if zero-length word is permitted")
-
-        self.minLen = min
-
-        if max > 0:
-            self.maxLen = max
-        else:
-            self.maxLen = _MAX_INT
-
-        if exact > 0:
-            self.maxLen = exact
-            self.minLen = exact
-
-        self.name = _ustr(self)
-        self.errmsg = "Expected " + self.name
-        self.mayIndexError = False
-        self.asKeyword = asKeyword
-
-        if ' ' not in self.initCharsOrig+self.bodyCharsOrig and (min==1 and max==0 and exact==0):
-            if self.bodyCharsOrig == self.initCharsOrig:
-                self.reString = "[%s]+" % _escapeRegexRangeChars(self.initCharsOrig)
-            elif len(self.initCharsOrig) == 1:
-                self.reString = "%s[%s]*" % \
-                                      (re.escape(self.initCharsOrig),
-                                      _escapeRegexRangeChars(self.bodyCharsOrig),)
-            else:
-                self.reString = "[%s][%s]*" % \
-                                      (_escapeRegexRangeChars(self.initCharsOrig),
-                                      _escapeRegexRangeChars(self.bodyCharsOrig),)
-            if self.asKeyword:
-                self.reString = r"\b"+self.reString+r"\b"
-            try:
-                self.re = re.compile( self.reString )
-            except Exception:
-                self.re = None
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        if self.re:
-            result = self.re.match(instring,loc)
-            if not result:
-                raise ParseException(instring, loc, self.errmsg, self)
-
-            loc = result.end()
-            return loc, result.group()
-
-        if not(instring[ loc ] in self.initChars):
-            raise ParseException(instring, loc, self.errmsg, self)
-
-        start = loc
-        loc += 1
-        instrlen = len(instring)
-        bodychars = self.bodyChars
-        maxloc = start + self.maxLen
-        maxloc = min( maxloc, instrlen )
-        while loc < maxloc and instring[loc] in bodychars:
-            loc += 1
-
-        throwException = False
-        if loc - start < self.minLen:
-            throwException = True
-        if self.maxSpecified and loc < instrlen and instring[loc] in bodychars:
-            throwException = True
-        if self.asKeyword:
-            if (start>0 and instring[start-1] in bodychars) or (loc<instrlen and instring[loc] in bodychars):
-                throwException = True
-
-        if throwException:
-            raise ParseException(instring, loc, self.errmsg, self)
-
-        return loc, instring[start:loc]
-
-    def __str__( self ):
-        try:
-            return super(Word,self).__str__()
-        except Exception:
-            pass
-
-
-        if self.strRepr is None:
-
-            def charsAsStr(s):
-                if len(s)>4:
-                    return s[:4]+"..."
-                else:
-                    return s
-
-            if ( self.initCharsOrig != self.bodyCharsOrig ):
-                self.strRepr = "W:(%s,%s)" % ( charsAsStr(self.initCharsOrig), charsAsStr(self.bodyCharsOrig) )
-            else:
-                self.strRepr = "W:(%s)" % charsAsStr(self.initCharsOrig)
-
-        return self.strRepr
-
-
-class Regex(Token):
-    r"""
-    Token for matching strings that match a given regular expression.
-    Defined with string specifying the regular expression in a form recognized by the inbuilt Python re module.
-    If the given regex contains named groups (defined using C{(?P<name>...)}), these will be preserved as 
-    named parse results.
-
-    Example::
-        realnum = Regex(r"[+-]?\d+\.\d*")
-        date = Regex(r'(?P<year>\d{4})-(?P<month>\d\d?)-(?P<day>\d\d?)')
-        # ref: https://stackoverflow.com/questions/267399/how-do-you-match-only-valid-roman-numerals-with-a-regular-expression
-        roman = Regex(r"M{0,4}(CM|CD|D?C{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})")
-    """
-    compiledREtype = type(re.compile("[A-Z]"))
-    def __init__( self, pattern, flags=0):
-        """The parameters C{pattern} and C{flags} are passed to the C{re.compile()} function as-is. See the Python C{re} module for an explanation of the acceptable patterns and flags."""
-        super(Regex,self).__init__()
-
-        if isinstance(pattern, basestring):
-            if not pattern:
-                warnings.warn("null string passed to Regex; use Empty() instead",
-                        SyntaxWarning, stacklevel=2)
-
-            self.pattern = pattern
-            self.flags = flags
-
-            try:
-                self.re = re.compile(self.pattern, self.flags)
-                self.reString = self.pattern
-            except sre_constants.error:
-                warnings.warn("invalid pattern (%s) passed to Regex" % pattern,
-                    SyntaxWarning, stacklevel=2)
-                raise
-
-        elif isinstance(pattern, Regex.compiledREtype):
-            self.re = pattern
-            self.pattern = \
-            self.reString = str(pattern)
-            self.flags = flags
-            
-        else:
-            raise ValueError("Regex may only be constructed with a string or a compiled RE object")
-
-        self.name = _ustr(self)
-        self.errmsg = "Expected " + self.name
-        self.mayIndexError = False
-        self.mayReturnEmpty = True
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        result = self.re.match(instring,loc)
-        if not result:
-            raise ParseException(instring, loc, self.errmsg, self)
-
-        loc = result.end()
-        d = result.groupdict()
-        ret = ParseResults(result.group())
-        if d:
-            for k in d:
-                ret[k] = d[k]
-        return loc,ret
-
-    def __str__( self ):
-        try:
-            return super(Regex,self).__str__()
-        except Exception:
-            pass
-
-        if self.strRepr is None:
-            self.strRepr = "Re:(%s)" % repr(self.pattern)
-
-        return self.strRepr
-
-
-class QuotedString(Token):
-    r"""
-    Token for matching strings that are delimited by quoting characters.
-    
-    Defined with the following parameters:
-        - quoteChar - string of one or more characters defining the quote delimiting string
-        - escChar - character to escape quotes, typically backslash (default=C{None})
-        - escQuote - special quote sequence to escape an embedded quote string (such as SQL's "" to escape an embedded ") (default=C{None})
-        - multiline - boolean indicating whether quotes can span multiple lines (default=C{False})
-        - unquoteResults - boolean indicating whether the matched text should be unquoted (default=C{True})
-        - endQuoteChar - string of one or more characters defining the end of the quote delimited string (default=C{None} => same as quoteChar)
-        - convertWhitespaceEscapes - convert escaped whitespace (C{'\t'}, C{'\n'}, etc.) to actual whitespace (default=C{True})
-
-    Example::
-        qs = QuotedString('"')
-        print(qs.searchString('lsjdf "This is the quote" sldjf'))
-        complex_qs = QuotedString('{{', endQuoteChar='}}')
-        print(complex_qs.searchString('lsjdf {{This is the "quote"}} sldjf'))
-        sql_qs = QuotedString('"', escQuote='""')
-        print(sql_qs.searchString('lsjdf "This is the quote with ""embedded"" quotes" sldjf'))
-    prints::
-        [['This is the quote']]
-        [['This is the "quote"']]
-        [['This is the quote with "embedded" quotes']]
-    """
-    def __init__( self, quoteChar, escChar=None, escQuote=None, multiline=False, unquoteResults=True, endQuoteChar=None, convertWhitespaceEscapes=True):
-        super(QuotedString,self).__init__()
-
-        # remove white space from quote chars - won't work anyway
-        quoteChar = quoteChar.strip()
-        if not quoteChar:
-            warnings.warn("quoteChar cannot be the empty string",SyntaxWarning,stacklevel=2)
-            raise SyntaxError()
-
-        if endQuoteChar is None:
-            endQuoteChar = quoteChar
-        else:
-            endQuoteChar = endQuoteChar.strip()
-            if not endQuoteChar:
-                warnings.warn("endQuoteChar cannot be the empty string",SyntaxWarning,stacklevel=2)
-                raise SyntaxError()
-
-        self.quoteChar = quoteChar
-        self.quoteCharLen = len(quoteChar)
-        self.firstQuoteChar = quoteChar[0]
-        self.endQuoteChar = endQuoteChar
-        self.endQuoteCharLen = len(endQuoteChar)
-        self.escChar = escChar
-        self.escQuote = escQuote
-        self.unquoteResults = unquoteResults
-        self.convertWhitespaceEscapes = convertWhitespaceEscapes
-
-        if multiline:
-            self.flags = re.MULTILINE | re.DOTALL
-            self.pattern = r'%s(?:[^%s%s]' % \
-                ( re.escape(self.quoteChar),
-                  _escapeRegexRangeChars(self.endQuoteChar[0]),
-                  (escChar is not None and _escapeRegexRangeChars(escChar) or '') )
-        else:
-            self.flags = 0
-            self.pattern = r'%s(?:[^%s\n\r%s]' % \
-                ( re.escape(self.quoteChar),
-                  _escapeRegexRangeChars(self.endQuoteChar[0]),
-                  (escChar is not None and _escapeRegexRangeChars(escChar) or '') )
-        if len(self.endQuoteChar) > 1:
-            self.pattern += (
-                '|(?:' + ')|(?:'.join("%s[^%s]" % (re.escape(self.endQuoteChar[:i]),
-                                               _escapeRegexRangeChars(self.endQuoteChar[i]))
-                                    for i in range(len(self.endQuoteChar)-1,0,-1)) + ')'
-                )
-        if escQuote:
-            self.pattern += (r'|(?:%s)' % re.escape(escQuote))
-        if escChar:
-            self.pattern += (r'|(?:%s.)' % re.escape(escChar))
-            self.escCharReplacePattern = re.escape(self.escChar)+"(.)"
-        self.pattern += (r')*%s' % re.escape(self.endQuoteChar))
-
-        try:
-            self.re = re.compile(self.pattern, self.flags)
-            self.reString = self.pattern
-        except sre_constants.error:
-            warnings.warn("invalid pattern (%s) passed to Regex" % self.pattern,
-                SyntaxWarning, stacklevel=2)
-            raise
-
-        self.name = _ustr(self)
-        self.errmsg = "Expected " + self.name
-        self.mayIndexError = False
-        self.mayReturnEmpty = True
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        result = instring[loc] == self.firstQuoteChar and self.re.match(instring,loc) or None
-        if not result:
-            raise ParseException(instring, loc, self.errmsg, self)
-
-        loc = result.end()
-        ret = result.group()
-
-        if self.unquoteResults:
-
-            # strip off quotes
-            ret = ret[self.quoteCharLen:-self.endQuoteCharLen]
-
-            if isinstance(ret,basestring):
-                # replace escaped whitespace
-                if '\\' in ret and self.convertWhitespaceEscapes:
-                    ws_map = {
-                        r'\t' : '\t',
-                        r'\n' : '\n',
-                        r'\f' : '\f',
-                        r'\r' : '\r',
-                    }
-                    for wslit,wschar in ws_map.items():
-                        ret = ret.replace(wslit, wschar)
-
-                # replace escaped characters
-                if self.escChar:
-                    ret = re.sub(self.escCharReplacePattern, r"\g<1>", ret)
-
-                # replace escaped quotes
-                if self.escQuote:
-                    ret = ret.replace(self.escQuote, self.endQuoteChar)
-
-        return loc, ret
-
-    def __str__( self ):
-        try:
-            return super(QuotedString,self).__str__()
-        except Exception:
-            pass
-
-        if self.strRepr is None:
-            self.strRepr = "quoted string, starting with %s ending with %s" % (self.quoteChar, self.endQuoteChar)
-
-        return self.strRepr
-
-
-class CharsNotIn(Token):
-    """
-    Token for matching words composed of characters I{not} in a given set (will
-    include whitespace in matched characters if not listed in the provided exclusion set - see example).
-    Defined with string containing all disallowed characters, and an optional
-    minimum, maximum, and/or exact length.  The default value for C{min} is 1 (a
-    minimum value < 1 is not valid); the default values for C{max} and C{exact}
-    are 0, meaning no maximum or exact length restriction.
-
-    Example::
-        # define a comma-separated-value as anything that is not a ','
-        csv_value = CharsNotIn(',')
-        print(delimitedList(csv_value).parseString("dkls,lsdkjf,s12 34,@!#,213"))
-    prints::
-        ['dkls', 'lsdkjf', 's12 34', '@!#', '213']
-    """
-    def __init__( self, notChars, min=1, max=0, exact=0 ):
-        super(CharsNotIn,self).__init__()
-        self.skipWhitespace = False
-        self.notChars = notChars
-
-        if min < 1:
-            raise ValueError("cannot specify a minimum length < 1; use Optional(CharsNotIn()) if zero-length char group is permitted")
-
-        self.minLen = min
-
-        if max > 0:
-            self.maxLen = max
-        else:
-            self.maxLen = _MAX_INT
-
-        if exact > 0:
-            self.maxLen = exact
-            self.minLen = exact
-
-        self.name = _ustr(self)
-        self.errmsg = "Expected " + self.name
-        self.mayReturnEmpty = ( self.minLen == 0 )
-        self.mayIndexError = False
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        if instring[loc] in self.notChars:
-            raise ParseException(instring, loc, self.errmsg, self)
-
-        start = loc
-        loc += 1
-        notchars = self.notChars
-        maxlen = min( start+self.maxLen, len(instring) )
-        while loc < maxlen and \
-              (instring[loc] not in notchars):
-            loc += 1
-
-        if loc - start < self.minLen:
-            raise ParseException(instring, loc, self.errmsg, self)
-
-        return loc, instring[start:loc]
-
-    def __str__( self ):
-        try:
-            return super(CharsNotIn, self).__str__()
-        except Exception:
-            pass
-
-        if self.strRepr is None:
-            if len(self.notChars) > 4:
-                self.strRepr = "!W:(%s...)" % self.notChars[:4]
-            else:
-                self.strRepr = "!W:(%s)" % self.notChars
-
-        return self.strRepr
-
-class White(Token):
-    """
-    Special matching class for matching whitespace.  Normally, whitespace is ignored
-    by pyparsing grammars.  This class is included when some whitespace structures
-    are significant.  Define with a string containing the whitespace characters to be
-    matched; default is C{" \\t\\r\\n"}.  Also takes optional C{min}, C{max}, and C{exact} arguments,
-    as defined for the C{L{Word}} class.
-    """
-    whiteStrs = {
-        " " : "<SPC>",
-        "\t": "<TAB>",
-        "\n": "<LF>",
-        "\r": "<CR>",
-        "\f": "<FF>",
-        }
-    def __init__(self, ws=" \t\r\n", min=1, max=0, exact=0):
-        super(White,self).__init__()
-        self.matchWhite = ws
-        self.setWhitespaceChars( "".join(c for c in self.whiteChars if c not in self.matchWhite) )
-        #~ self.leaveWhitespace()
-        self.name = ("".join(White.whiteStrs[c] for c in self.matchWhite))
-        self.mayReturnEmpty = True
-        self.errmsg = "Expected " + self.name
-
-        self.minLen = min
-
-        if max > 0:
-            self.maxLen = max
-        else:
-            self.maxLen = _MAX_INT
-
-        if exact > 0:
-            self.maxLen = exact
-            self.minLen = exact
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        if not(instring[ loc ] in self.matchWhite):
-            raise ParseException(instring, loc, self.errmsg, self)
-        start = loc
-        loc += 1
-        maxloc = start + self.maxLen
-        maxloc = min( maxloc, len(instring) )
-        while loc < maxloc and instring[loc] in self.matchWhite:
-            loc += 1
-
-        if loc - start < self.minLen:
-            raise ParseException(instring, loc, self.errmsg, self)
-
-        return loc, instring[start:loc]
-
-
-class _PositionToken(Token):
-    def __init__( self ):
-        super(_PositionToken,self).__init__()
-        self.name=self.__class__.__name__
-        self.mayReturnEmpty = True
-        self.mayIndexError = False
-
-class GoToColumn(_PositionToken):
-    """
-    Token to advance to a specific column of input text; useful for tabular report scraping.
-    """
-    def __init__( self, colno ):
-        super(GoToColumn,self).__init__()
-        self.col = colno
-
-    def preParse( self, instring, loc ):
-        if col(loc,instring) != self.col:
-            instrlen = len(instring)
-            if self.ignoreExprs:
-                loc = self._skipIgnorables( instring, loc )
-            while loc < instrlen and instring[loc].isspace() and col( loc, instring ) != self.col :
-                loc += 1
-        return loc
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        thiscol = col( loc, instring )
-        if thiscol > self.col:
-            raise ParseException( instring, loc, "Text not in expected column", self )
-        newloc = loc + self.col - thiscol
-        ret = instring[ loc: newloc ]
-        return newloc, ret
-
-
-class LineStart(_PositionToken):
-    """
-    Matches if current position is at the beginning of a line within the parse string
-    
-    Example::
-    
-        test = '''\
-        AAA this line
-        AAA and this line
-          AAA but not this one
-        B AAA and definitely not this one
-        '''
-
-        for t in (LineStart() + 'AAA' + restOfLine).searchString(test):
-            print(t)
-    
-    Prints::
-        ['AAA', ' this line']
-        ['AAA', ' and this line']    
-
-    """
-    def __init__( self ):
-        super(LineStart,self).__init__()
-        self.errmsg = "Expected start of line"
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        if col(loc, instring) == 1:
-            return loc, []
-        raise ParseException(instring, loc, self.errmsg, self)
-
-class LineEnd(_PositionToken):
-    """
-    Matches if current position is at the end of a line within the parse string
-    """
-    def __init__( self ):
-        super(LineEnd,self).__init__()
-        self.setWhitespaceChars( ParserElement.DEFAULT_WHITE_CHARS.replace("\n","") )
-        self.errmsg = "Expected end of line"
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        if loc<len(instring):
-            if instring[loc] == "\n":
-                return loc+1, "\n"
-            else:
-                raise ParseException(instring, loc, self.errmsg, self)
-        elif loc == len(instring):
-            return loc+1, []
-        else:
-            raise ParseException(instring, loc, self.errmsg, self)
-
-class StringStart(_PositionToken):
-    """
-    Matches if current position is at the beginning of the parse string
-    """
-    def __init__( self ):
-        super(StringStart,self).__init__()
-        self.errmsg = "Expected start of text"
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        if loc != 0:
-            # see if entire string up to here is just whitespace and ignoreables
-            if loc != self.preParse( instring, 0 ):
-                raise ParseException(instring, loc, self.errmsg, self)
-        return loc, []
-
-class StringEnd(_PositionToken):
-    """
-    Matches if current position is at the end of the parse string
-    """
-    def __init__( self ):
-        super(StringEnd,self).__init__()
-        self.errmsg = "Expected end of text"
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        if loc < len(instring):
-            raise ParseException(instring, loc, self.errmsg, self)
-        elif loc == len(instring):
-            return loc+1, []
-        elif loc > len(instring):
-            return loc, []
-        else:
-            raise ParseException(instring, loc, self.errmsg, self)
-
-class WordStart(_PositionToken):
-    """
-    Matches if the current position is at the beginning of a Word, and
-    is not preceded by any character in a given set of C{wordChars}
-    (default=C{printables}). To emulate the C{\b} behavior of regular expressions,
-    use C{WordStart(alphanums)}. C{WordStart} will also match at the beginning of
-    the string being parsed, or at the beginning of a line.
-    """
-    def __init__(self, wordChars = printables):
-        super(WordStart,self).__init__()
-        self.wordChars = set(wordChars)
-        self.errmsg = "Not at the start of a word"
-
-    def parseImpl(self, instring, loc, doActions=True ):
-        if loc != 0:
-            if (instring[loc-1] in self.wordChars or
-                instring[loc] not in self.wordChars):
-                raise ParseException(instring, loc, self.errmsg, self)
-        return loc, []
-
-class WordEnd(_PositionToken):
-    """
-    Matches if the current position is at the end of a Word, and
-    is not followed by any character in a given set of C{wordChars}
-    (default=C{printables}). To emulate the C{\b} behavior of regular expressions,
-    use C{WordEnd(alphanums)}. C{WordEnd} will also match at the end of
-    the string being parsed, or at the end of a line.
-    """
-    def __init__(self, wordChars = printables):
-        super(WordEnd,self).__init__()
-        self.wordChars = set(wordChars)
-        self.skipWhitespace = False
-        self.errmsg = "Not at the end of a word"
-
-    def parseImpl(self, instring, loc, doActions=True ):
-        instrlen = len(instring)
-        if instrlen>0 and loc<instrlen:
-            if (instring[loc] in self.wordChars or
-                instring[loc-1] not in self.wordChars):
-                raise ParseException(instring, loc, self.errmsg, self)
-        return loc, []
-
-
-class ParseExpression(ParserElement):
-    """
-    Abstract subclass of ParserElement, for combining and post-processing parsed tokens.
-    """
-    def __init__( self, exprs, savelist = False ):
-        super(ParseExpression,self).__init__(savelist)
-        if isinstance( exprs, _generatorType ):
-            exprs = list(exprs)
-
-        if isinstance( exprs, basestring ):
-            self.exprs = [ ParserElement._literalStringClass( exprs ) ]
-        elif isinstance( exprs, collections.Iterable ):
-            exprs = list(exprs)
-            # if sequence of strings provided, wrap with Literal
-            if all(isinstance(expr, basestring) for expr in exprs):
-                exprs = map(ParserElement._literalStringClass, exprs)
-            self.exprs = list(exprs)
-        else:
-            try:
-                self.exprs = list( exprs )
-            except TypeError:
-                self.exprs = [ exprs ]
-        self.callPreparse = False
-
-    def __getitem__( self, i ):
-        return self.exprs[i]
-
-    def append( self, other ):
-        self.exprs.append( other )
-        self.strRepr = None
-        return self
-
-    def leaveWhitespace( self ):
-        """Extends C{leaveWhitespace} defined in base class, and also invokes C{leaveWhitespace} on
-           all contained expressions."""
-        self.skipWhitespace = False
-        self.exprs = [ e.copy() for e in self.exprs ]
-        for e in self.exprs:
-            e.leaveWhitespace()
-        return self
-
-    def ignore( self, other ):
-        if isinstance( other, Suppress ):
-            if other not in self.ignoreExprs:
-                super( ParseExpression, self).ignore( other )
-                for e in self.exprs:
-                    e.ignore( self.ignoreExprs[-1] )
-        else:
-            super( ParseExpression, self).ignore( other )
-            for e in self.exprs:
-                e.ignore( self.ignoreExprs[-1] )
-        return self
-
-    def __str__( self ):
-        try:
-            return super(ParseExpression,self).__str__()
-        except Exception:
-            pass
-
-        if self.strRepr is None:
-            self.strRepr = "%s:(%s)" % ( self.__class__.__name__, _ustr(self.exprs) )
-        return self.strRepr
-
-    def streamline( self ):
-        super(ParseExpression,self).streamline()
-
-        for e in self.exprs:
-            e.streamline()
-
-        # collapse nested And's of the form And( And( And( a,b), c), d) to And( a,b,c,d )
-        # but only if there are no parse actions or resultsNames on the nested And's
-        # (likewise for Or's and MatchFirst's)
-        if ( len(self.exprs) == 2 ):
-            other = self.exprs[0]
-            if ( isinstance( other, self.__class__ ) and
-                  not(other.parseAction) and
-                  other.resultsName is None and
-                  not other.debug ):
-                self.exprs = other.exprs[:] + [ self.exprs[1] ]
-                self.strRepr = None
-                self.mayReturnEmpty |= other.mayReturnEmpty
-                self.mayIndexError  |= other.mayIndexError
-
-            other = self.exprs[-1]
-            if ( isinstance( other, self.__class__ ) and
-                  not(other.parseAction) and
-                  other.resultsName is None and
-                  not other.debug ):
-                self.exprs = self.exprs[:-1] + other.exprs[:]
-                self.strRepr = None
-                self.mayReturnEmpty |= other.mayReturnEmpty
-                self.mayIndexError  |= other.mayIndexError
-
-        self.errmsg = "Expected " + _ustr(self)
-        
-        return self
-
-    def setResultsName( self, name, listAllMatches=False ):
-        ret = super(ParseExpression,self).setResultsName(name,listAllMatches)
-        return ret
-
-    def validate( self, validateTrace=[] ):
-        tmp = validateTrace[:]+[self]
-        for e in self.exprs:
-            e.validate(tmp)
-        self.checkRecursion( [] )
-        
-    def copy(self):
-        ret = super(ParseExpression,self).copy()
-        ret.exprs = [e.copy() for e in self.exprs]
-        return ret
-
-class And(ParseExpression):
-    """
-    Requires all given C{ParseExpression}s to be found in the given order.
-    Expressions may be separated by whitespace.
-    May be constructed using the C{'+'} operator.
-    May also be constructed using the C{'-'} operator, which will suppress backtracking.
-
-    Example::
-        integer = Word(nums)
-        name_expr = OneOrMore(Word(alphas))
-
-        expr = And([integer("id"),name_expr("name"),integer("age")])
-        # more easily written as:
-        expr = integer("id") + name_expr("name") + integer("age")
-    """
-
-    class _ErrorStop(Empty):
-        def __init__(self, *args, **kwargs):
-            super(And._ErrorStop,self).__init__(*args, **kwargs)
-            self.name = '-'
-            self.leaveWhitespace()
-
-    def __init__( self, exprs, savelist = True ):
-        super(And,self).__init__(exprs, savelist)
-        self.mayReturnEmpty = all(e.mayReturnEmpty for e in self.exprs)
-        self.setWhitespaceChars( self.exprs[0].whiteChars )
-        self.skipWhitespace = self.exprs[0].skipWhitespace
-        self.callPreparse = True
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        # pass False as last arg to _parse for first element, since we already
-        # pre-parsed the string as part of our And pre-parsing
-        loc, resultlist = self.exprs[0]._parse( instring, loc, doActions, callPreParse=False )
-        errorStop = False
-        for e in self.exprs[1:]:
-            if isinstance(e, And._ErrorStop):
-                errorStop = True
-                continue
-            if errorStop:
-                try:
-                    loc, exprtokens = e._parse( instring, loc, doActions )
-                except ParseSyntaxException:
-                    raise
-                except ParseBaseException as pe:
-                    pe.__traceback__ = None
-                    raise ParseSyntaxException._from_exception(pe)
-                except IndexError:
-                    raise ParseSyntaxException(instring, len(instring), self.errmsg, self)
-            else:
-                loc, exprtokens = e._parse( instring, loc, doActions )
-            if exprtokens or exprtokens.haskeys():
-                resultlist += exprtokens
-        return loc, resultlist
-
-    def __iadd__(self, other ):
-        if isinstance( other, basestring ):
-            other = ParserElement._literalStringClass( other )
-        return self.append( other ) #And( [ self, other ] )
-
-    def checkRecursion( self, parseElementList ):
-        subRecCheckList = parseElementList[:] + [ self ]
-        for e in self.exprs:
-            e.checkRecursion( subRecCheckList )
-            if not e.mayReturnEmpty:
-                break
-
-    def __str__( self ):
-        if hasattr(self,"name"):
-            return self.name
-
-        if self.strRepr is None:
-            self.strRepr = "{" + " ".join(_ustr(e) for e in self.exprs) + "}"
-
-        return self.strRepr
-
-
-class Or(ParseExpression):
-    """
-    Requires that at least one C{ParseExpression} is found.
-    If two expressions match, the expression that matches the longest string will be used.
-    May be constructed using the C{'^'} operator.
-
-    Example::
-        # construct Or using '^' operator
-        
-        number = Word(nums) ^ Combine(Word(nums) + '.' + Word(nums))
-        print(number.searchString("123 3.1416 789"))
-    prints::
-        [['123'], ['3.1416'], ['789']]
-    """
-    def __init__( self, exprs, savelist = False ):
-        super(Or,self).__init__(exprs, savelist)
-        if self.exprs:
-            self.mayReturnEmpty = any(e.mayReturnEmpty for e in self.exprs)
-        else:
-            self.mayReturnEmpty = True
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        maxExcLoc = -1
-        maxException = None
-        matches = []
-        for e in self.exprs:
-            try:
-                loc2 = e.tryParse( instring, loc )
-            except ParseException as err:
-                err.__traceback__ = None
-                if err.loc > maxExcLoc:
-                    maxException = err
-                    maxExcLoc = err.loc
-            except IndexError:
-                if len(instring) > maxExcLoc:
-                    maxException = ParseException(instring,len(instring),e.errmsg,self)
-                    maxExcLoc = len(instring)
-            else:
-                # save match among all matches, to retry longest to shortest
-                matches.append((loc2, e))
-
-        if matches:
-            matches.sort(key=lambda x: -x[0])
-            for _,e in matches:
-                try:
-                    return e._parse( instring, loc, doActions )
-                except ParseException as err:
-                    err.__traceback__ = None
-                    if err.loc > maxExcLoc:
-                        maxException = err
-                        maxExcLoc = err.loc
-
-        if maxException is not None:
-            maxException.msg = self.errmsg
-            raise maxException
-        else:
-            raise ParseException(instring, loc, "no defined alternatives to match", self)
-
-
-    def __ixor__(self, other ):
-        if isinstance( other, basestring ):
-            other = ParserElement._literalStringClass( other )
-        return self.append( other ) #Or( [ self, other ] )
-
-    def __str__( self ):
-        if hasattr(self,"name"):
-            return self.name
-
-        if self.strRepr is None:
-            self.strRepr = "{" + " ^ ".join(_ustr(e) for e in self.exprs) + "}"
-
-        return self.strRepr
-
-    def checkRecursion( self, parseElementList ):
-        subRecCheckList = parseElementList[:] + [ self ]
-        for e in self.exprs:
-            e.checkRecursion( subRecCheckList )
-
-
-class MatchFirst(ParseExpression):
-    """
-    Requires that at least one C{ParseExpression} is found.
-    If two expressions match, the first one listed is the one that will match.
-    May be constructed using the C{'|'} operator.
-
-    Example::
-        # construct MatchFirst using '|' operator
-        
-        # watch the order of expressions to match
-        number = Word(nums) | Combine(Word(nums) + '.' + Word(nums))
-        print(number.searchString("123 3.1416 789")) #  Fail! -> [['123'], ['3'], ['1416'], ['789']]
-
-        # put more selective expression first
-        number = Combine(Word(nums) + '.' + Word(nums)) | Word(nums)
-        print(number.searchString("123 3.1416 789")) #  Better -> [['123'], ['3.1416'], ['789']]
-    """
-    def __init__( self, exprs, savelist = False ):
-        super(MatchFirst,self).__init__(exprs, savelist)
-        if self.exprs:
-            self.mayReturnEmpty = any(e.mayReturnEmpty for e in self.exprs)
-        else:
-            self.mayReturnEmpty = True
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        maxExcLoc = -1
-        maxException = None
-        for e in self.exprs:
-            try:
-                ret = e._parse( instring, loc, doActions )
-                return ret
-            except ParseException as err:
-                if err.loc > maxExcLoc:
-                    maxException = err
-                    maxExcLoc = err.loc
-            except IndexError:
-                if len(instring) > maxExcLoc:
-                    maxException = ParseException(instring,len(instring),e.errmsg,self)
-                    maxExcLoc = len(instring)
-
-        # only got here if no expression matched, raise exception for match that made it the furthest
-        else:
-            if maxException is not None:
-                maxException.msg = self.errmsg
-                raise maxException
-            else:
-                raise ParseException(instring, loc, "no defined alternatives to match", self)
-
-    def __ior__(self, other ):
-        if isinstance( other, basestring ):
-            other = ParserElement._literalStringClass( other )
-        return self.append( other ) #MatchFirst( [ self, other ] )
-
-    def __str__( self ):
-        if hasattr(self,"name"):
-            return self.name
-
-        if self.strRepr is None:
-            self.strRepr = "{" + " | ".join(_ustr(e) for e in self.exprs) + "}"
-
-        return self.strRepr
-
-    def checkRecursion( self, parseElementList ):
-        subRecCheckList = parseElementList[:] + [ self ]
-        for e in self.exprs:
-            e.checkRecursion( subRecCheckList )
-
-
-class Each(ParseExpression):
-    """
-    Requires all given C{ParseExpression}s to be found, but in any order.
-    Expressions may be separated by whitespace.
-    May be constructed using the C{'&'} operator.
-
-    Example::
-        color = oneOf("RED ORANGE YELLOW GREEN BLUE PURPLE BLACK WHITE BROWN")
-        shape_type = oneOf("SQUARE CIRCLE TRIANGLE STAR HEXAGON OCTAGON")
-        integer = Word(nums)
-        shape_attr = "shape:" + shape_type("shape")
-        posn_attr = "posn:" + Group(integer("x") + ',' + integer("y"))("posn")
-        color_attr = "color:" + color("color")
-        size_attr = "size:" + integer("size")
-
-        # use Each (using operator '&') to accept attributes in any order 
-        # (shape and posn are required, color and size are optional)
-        shape_spec = shape_attr & posn_attr & Optional(color_attr) & Optional(size_attr)
-
-        shape_spec.runTests('''
-            shape: SQUARE color: BLACK posn: 100, 120
-            shape: CIRCLE size: 50 color: BLUE posn: 50,80
-            color:GREEN size:20 shape:TRIANGLE posn:20,40
-            '''
-            )
-    prints::
-        shape: SQUARE color: BLACK posn: 100, 120
-        ['shape:', 'SQUARE', 'color:', 'BLACK', 'posn:', ['100', ',', '120']]
-        - color: BLACK
-        - posn: ['100', ',', '120']
-          - x: 100
-          - y: 120
-        - shape: SQUARE
-
-
-        shape: CIRCLE size: 50 color: BLUE posn: 50,80
-        ['shape:', 'CIRCLE', 'size:', '50', 'color:', 'BLUE', 'posn:', ['50', ',', '80']]
-        - color: BLUE
-        - posn: ['50', ',', '80']
-          - x: 50
-          - y: 80
-        - shape: CIRCLE
-        - size: 50
-
-
-        color: GREEN size: 20 shape: TRIANGLE posn: 20,40
-        ['color:', 'GREEN', 'size:', '20', 'shape:', 'TRIANGLE', 'posn:', ['20', ',', '40']]
-        - color: GREEN
-        - posn: ['20', ',', '40']
-          - x: 20
-          - y: 40
-        - shape: TRIANGLE
-        - size: 20
-    """
-    def __init__( self, exprs, savelist = True ):
-        super(Each,self).__init__(exprs, savelist)
-        self.mayReturnEmpty = all(e.mayReturnEmpty for e in self.exprs)
-        self.skipWhitespace = True
-        self.initExprGroups = True
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        if self.initExprGroups:
-            self.opt1map = dict((id(e.expr),e) for e in self.exprs if isinstance(e,Optional))
-            opt1 = [ e.expr for e in self.exprs if isinstance(e,Optional) ]
-            opt2 = [ e for e in self.exprs if e.mayReturnEmpty and not isinstance(e,Optional)]
-            self.optionals = opt1 + opt2
-            self.multioptionals = [ e.expr for e in self.exprs if isinstance(e,ZeroOrMore) ]
-            self.multirequired = [ e.expr for e in self.exprs if isinstance(e,OneOrMore) ]
-            self.required = [ e for e in self.exprs if not isinstance(e,(Optional,ZeroOrMore,OneOrMore)) ]
-            self.required += self.multirequired
-            self.initExprGroups = False
-        tmpLoc = loc
-        tmpReqd = self.required[:]
-        tmpOpt  = self.optionals[:]
-        matchOrder = []
-
-        keepMatching = True
-        while keepMatching:
-            tmpExprs = tmpReqd + tmpOpt + self.multioptionals + self.multirequired
-            failed = []
-            for e in tmpExprs:
-                try:
-                    tmpLoc = e.tryParse( instring, tmpLoc )
-                except ParseException:
-                    failed.append(e)
-                else:
-                    matchOrder.append(self.opt1map.get(id(e),e))
-                    if e in tmpReqd:
-                        tmpReqd.remove(e)
-                    elif e in tmpOpt:
-                        tmpOpt.remove(e)
-            if len(failed) == len(tmpExprs):
-                keepMatching = False
-
-        if tmpReqd:
-            missing = ", ".join(_ustr(e) for e in tmpReqd)
-            raise ParseException(instring,loc,"Missing one or more required elements (%s)" % missing )
-
-        # add any unmatched Optionals, in case they have default values defined
-        matchOrder += [e for e in self.exprs if isinstance(e,Optional) and e.expr in tmpOpt]
-
-        resultlist = []
-        for e in matchOrder:
-            loc,results = e._parse(instring,loc,doActions)
-            resultlist.append(results)
-
-        finalResults = sum(resultlist, ParseResults([]))
-        return loc, finalResults
-
-    def __str__( self ):
-        if hasattr(self,"name"):
-            return self.name
-
-        if self.strRepr is None:
-            self.strRepr = "{" + " & ".join(_ustr(e) for e in self.exprs) + "}"
-
-        return self.strRepr
-
-    def checkRecursion( self, parseElementList ):
-        subRecCheckList = parseElementList[:] + [ self ]
-        for e in self.exprs:
-            e.checkRecursion( subRecCheckList )
-
-
-class ParseElementEnhance(ParserElement):
-    """
-    Abstract subclass of C{ParserElement}, for combining and post-processing parsed tokens.
-    """
-    def __init__( self, expr, savelist=False ):
-        super(ParseElementEnhance,self).__init__(savelist)
-        if isinstance( expr, basestring ):
-            if issubclass(ParserElement._literalStringClass, Token):
-                expr = ParserElement._literalStringClass(expr)
-            else:
-                expr = ParserElement._literalStringClass(Literal(expr))
-        self.expr = expr
-        self.strRepr = None
-        if expr is not None:
-            self.mayIndexError = expr.mayIndexError
-            self.mayReturnEmpty = expr.mayReturnEmpty
-            self.setWhitespaceChars( expr.whiteChars )
-            self.skipWhitespace = expr.skipWhitespace
-            self.saveAsList = expr.saveAsList
-            self.callPreparse = expr.callPreparse
-            self.ignoreExprs.extend(expr.ignoreExprs)
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        if self.expr is not None:
-            return self.expr._parse( instring, loc, doActions, callPreParse=False )
-        else:
-            raise ParseException("",loc,self.errmsg,self)
-
-    def leaveWhitespace( self ):
-        self.skipWhitespace = False
-        self.expr = self.expr.copy()
-        if self.expr is not None:
-            self.expr.leaveWhitespace()
-        return self
-
-    def ignore( self, other ):
-        if isinstance( other, Suppress ):
-            if other not in self.ignoreExprs:
-                super( ParseElementEnhance, self).ignore( other )
-                if self.expr is not None:
-                    self.expr.ignore( self.ignoreExprs[-1] )
-        else:
-            super( ParseElementEnhance, self).ignore( other )
-            if self.expr is not None:
-                self.expr.ignore( self.ignoreExprs[-1] )
-        return self
-
-    def streamline( self ):
-        super(ParseElementEnhance,self).streamline()
-        if self.expr is not None:
-            self.expr.streamline()
-        return self
-
-    def checkRecursion( self, parseElementList ):
-        if self in parseElementList:
-            raise RecursiveGrammarException( parseElementList+[self] )
-        subRecCheckList = parseElementList[:] + [ self ]
-        if self.expr is not None:
-            self.expr.checkRecursion( subRecCheckList )
-
-    def validate( self, validateTrace=[] ):
-        tmp = validateTrace[:]+[self]
-        if self.expr is not None:
-            self.expr.validate(tmp)
-        self.checkRecursion( [] )
-
-    def __str__( self ):
-        try:
-            return super(ParseElementEnhance,self).__str__()
-        except Exception:
-            pass
-
-        if self.strRepr is None and self.expr is not None:
-            self.strRepr = "%s:(%s)" % ( self.__class__.__name__, _ustr(self.expr) )
-        return self.strRepr
-
-
-class FollowedBy(ParseElementEnhance):
-    """
-    Lookahead matching of the given parse expression.  C{FollowedBy}
-    does I{not} advance the parsing position within the input string, it only
-    verifies that the specified parse expression matches at the current
-    position.  C{FollowedBy} always returns a null token list.
-
-    Example::
-        # use FollowedBy to match a label only if it is followed by a ':'
-        data_word = Word(alphas)
-        label = data_word + FollowedBy(':')
-        attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
-        
-        OneOrMore(attr_expr).parseString("shape: SQUARE color: BLACK posn: upper left").pprint()
-    prints::
-        [['shape', 'SQUARE'], ['color', 'BLACK'], ['posn', 'upper left']]
-    """
-    def __init__( self, expr ):
-        super(FollowedBy,self).__init__(expr)
-        self.mayReturnEmpty = True
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        self.expr.tryParse( instring, loc )
-        return loc, []
-
-
-class NotAny(ParseElementEnhance):
-    """
-    Lookahead to disallow matching with the given parse expression.  C{NotAny}
-    does I{not} advance the parsing position within the input string, it only
-    verifies that the specified parse expression does I{not} match at the current
-    position.  Also, C{NotAny} does I{not} skip over leading whitespace. C{NotAny}
-    always returns a null token list.  May be constructed using the '~' operator.
-
-    Example::
-        
-    """
-    def __init__( self, expr ):
-        super(NotAny,self).__init__(expr)
-        #~ self.leaveWhitespace()
-        self.skipWhitespace = False  # do NOT use self.leaveWhitespace(), don't want to propagate to exprs
-        self.mayReturnEmpty = True
-        self.errmsg = "Found unwanted token, "+_ustr(self.expr)
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        if self.expr.canParseNext(instring, loc):
-            raise ParseException(instring, loc, self.errmsg, self)
-        return loc, []
-
-    def __str__( self ):
-        if hasattr(self,"name"):
-            return self.name
-
-        if self.strRepr is None:
-            self.strRepr = "~{" + _ustr(self.expr) + "}"
-
-        return self.strRepr
-
-class _MultipleMatch(ParseElementEnhance):
-    def __init__( self, expr, stopOn=None):
-        super(_MultipleMatch, self).__init__(expr)
-        self.saveAsList = True
-        ender = stopOn
-        if isinstance(ender, basestring):
-            ender = ParserElement._literalStringClass(ender)
-        self.not_ender = ~ender if ender is not None else None
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        self_expr_parse = self.expr._parse
-        self_skip_ignorables = self._skipIgnorables
-        check_ender = self.not_ender is not None
-        if check_ender:
-            try_not_ender = self.not_ender.tryParse
-        
-        # must be at least one (but first see if we are the stopOn sentinel;
-        # if so, fail)
-        if check_ender:
-            try_not_ender(instring, loc)
-        loc, tokens = self_expr_parse( instring, loc, doActions, callPreParse=False )
-        try:
-            hasIgnoreExprs = bool(self.ignoreExprs)
-            while 1:
-                if check_ender:
-                    try_not_ender(instring, loc)
-                if hasIgnoreExprs:
-                    preloc = self_skip_ignorables( instring, loc )
-                else:
-                    preloc = loc
-                loc, tmptokens = self_expr_parse( instring, preloc, doActions )
-                if tmptokens or tmptokens.haskeys():
-                    tokens += tmptokens
-        except (ParseException,IndexError):
-            pass
-
-        return loc, tokens
-        
-class OneOrMore(_MultipleMatch):
-    """
-    Repetition of one or more of the given expression.
-    
-    Parameters:
-     - expr - expression that must match one or more times
-     - stopOn - (default=C{None}) - expression for a terminating sentinel
-          (only required if the sentinel would ordinarily match the repetition 
-          expression)          
-
-    Example::
-        data_word = Word(alphas)
-        label = data_word + FollowedBy(':')
-        attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
-
-        text = "shape: SQUARE posn: upper left color: BLACK"
-        OneOrMore(attr_expr).parseString(text).pprint()  # Fail! read 'color' as data instead of next label -> [['shape', 'SQUARE color']]
-
-        # use stopOn attribute for OneOrMore to avoid reading label string as part of the data
-        attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
-        OneOrMore(attr_expr).parseString(text).pprint() # Better -> [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'BLACK']]
-        
-        # could also be written as
-        (attr_expr * (1,)).parseString(text).pprint()
-    """
-
-    def __str__( self ):
-        if hasattr(self,"name"):
-            return self.name
-
-        if self.strRepr is None:
-            self.strRepr = "{" + _ustr(self.expr) + "}..."
-
-        return self.strRepr
-
-class ZeroOrMore(_MultipleMatch):
-    """
-    Optional repetition of zero or more of the given expression.
-    
-    Parameters:
-     - expr - expression that must match zero or more times
-     - stopOn - (default=C{None}) - expression for a terminating sentinel
-          (only required if the sentinel would ordinarily match the repetition 
-          expression)          
-
-    Example: similar to L{OneOrMore}
-    """
-    def __init__( self, expr, stopOn=None):
-        super(ZeroOrMore,self).__init__(expr, stopOn=stopOn)
-        self.mayReturnEmpty = True
-        
-    def parseImpl( self, instring, loc, doActions=True ):
-        try:
-            return super(ZeroOrMore, self).parseImpl(instring, loc, doActions)
-        except (ParseException,IndexError):
-            return loc, []
-
-    def __str__( self ):
-        if hasattr(self,"name"):
-            return self.name
-
-        if self.strRepr is None:
-            self.strRepr = "[" + _ustr(self.expr) + "]..."
-
-        return self.strRepr
-
-class _NullToken(object):
-    def __bool__(self):
-        return False
-    __nonzero__ = __bool__
-    def __str__(self):
-        return ""
-
-_optionalNotMatched = _NullToken()
-class Optional(ParseElementEnhance):
-    """
-    Optional matching of the given expression.
-
-    Parameters:
-     - expr - expression that must match zero or more times
-     - default (optional) - value to be returned if the optional expression is not found.
-
-    Example::
-        # US postal code can be a 5-digit zip, plus optional 4-digit qualifier
-        zip = Combine(Word(nums, exact=5) + Optional('-' + Word(nums, exact=4)))
-        zip.runTests('''
-            # traditional ZIP code
-            12345
-            
-            # ZIP+4 form
-            12101-0001
-            
-            # invalid ZIP
-            98765-
-            ''')
-    prints::
-        # traditional ZIP code
-        12345
-        ['12345']
-
-        # ZIP+4 form
-        12101-0001
-        ['12101-0001']
-
-        # invalid ZIP
-        98765-
-             ^
-        FAIL: Expected end of text (at char 5), (line:1, col:6)
-    """
-    def __init__( self, expr, default=_optionalNotMatched ):
-        super(Optional,self).__init__( expr, savelist=False )
-        self.saveAsList = self.expr.saveAsList
-        self.defaultValue = default
-        self.mayReturnEmpty = True
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        try:
-            loc, tokens = self.expr._parse( instring, loc, doActions, callPreParse=False )
-        except (ParseException,IndexError):
-            if self.defaultValue is not _optionalNotMatched:
-                if self.expr.resultsName:
-                    tokens = ParseResults([ self.defaultValue ])
-                    tokens[self.expr.resultsName] = self.defaultValue
-                else:
-                    tokens = [ self.defaultValue ]
-            else:
-                tokens = []
-        return loc, tokens
-
-    def __str__( self ):
-        if hasattr(self,"name"):
-            return self.name
-
-        if self.strRepr is None:
-            self.strRepr = "[" + _ustr(self.expr) + "]"
-
-        return self.strRepr
-
-class SkipTo(ParseElementEnhance):
-    """
-    Token for skipping over all undefined text until the matched expression is found.
-
-    Parameters:
-     - expr - target expression marking the end of the data to be skipped
-     - include - (default=C{False}) if True, the target expression is also parsed 
-          (the skipped text and target expression are returned as a 2-element list).
-     - ignore - (default=C{None}) used to define grammars (typically quoted strings and 
-          comments) that might contain false matches to the target expression
-     - failOn - (default=C{None}) define expressions that are not allowed to be 
-          included in the skipped test; if found before the target expression is found, 
-          the SkipTo is not a match
-
-    Example::
-        report = '''
-            Outstanding Issues Report - 1 Jan 2000
-
-               # | Severity | Description                               |  Days Open
-            -----+----------+-------------------------------------------+-----------
-             101 | Critical | Intermittent system crash                 |          6
-              94 | Cosmetic | Spelling error on Login ('log|n')         |         14
-              79 | Minor    | System slow when running too many reports |         47
-            '''
-        integer = Word(nums)
-        SEP = Suppress('|')
-        # use SkipTo to simply match everything up until the next SEP
-        # - ignore quoted strings, so that a '|' character inside a quoted string does not match
-        # - parse action will call token.strip() for each matched token, i.e., the description body
-        string_data = SkipTo(SEP, ignore=quotedString)
-        string_data.setParseAction(tokenMap(str.strip))
-        ticket_expr = (integer("issue_num") + SEP 
-                      + string_data("sev") + SEP 
-                      + string_data("desc") + SEP 
-                      + integer("days_open"))
-        
-        for tkt in ticket_expr.searchString(report):
-            print tkt.dump()
-    prints::
-        ['101', 'Critical', 'Intermittent system crash', '6']
-        - days_open: 6
-        - desc: Intermittent system crash
-        - issue_num: 101
-        - sev: Critical
-        ['94', 'Cosmetic', "Spelling error on Login ('log|n')", '14']
-        - days_open: 14
-        - desc: Spelling error on Login ('log|n')
-        - issue_num: 94
-        - sev: Cosmetic
-        ['79', 'Minor', 'System slow when running too many reports', '47']
-        - days_open: 47
-        - desc: System slow when running too many reports
-        - issue_num: 79
-        - sev: Minor
-    """
-    def __init__( self, other, include=False, ignore=None, failOn=None ):
-        super( SkipTo, self ).__init__( other )
-        self.ignoreExpr = ignore
-        self.mayReturnEmpty = True
-        self.mayIndexError = False
-        self.includeMatch = include
-        self.asList = False
-        if isinstance(failOn, basestring):
-            self.failOn = ParserElement._literalStringClass(failOn)
-        else:
-            self.failOn = failOn
-        self.errmsg = "No match found for "+_ustr(self.expr)
-
-    def parseImpl( self, instring, loc, doActions=True ):
-        startloc = loc
-        instrlen = len(instring)
-        expr = self.expr
-        expr_parse = self.expr._parse
-        self_failOn_canParseNext = self.failOn.canParseNext if self.failOn is not None else None
-        self_ignoreExpr_tryParse = self.ignoreExpr.tryParse if self.ignoreExpr is not None else None
-        
-        tmploc = loc
-        while tmploc <= instrlen:
-            if self_failOn_canParseNext is not None:
-                # break if failOn expression matches
-                if self_failOn_canParseNext(instring, tmploc):
-                    break
-                    
-            if self_ignoreExpr_tryParse is not None:
-                # advance past ignore expressions
-                while 1:
-                    try:
-                        tmploc = self_ignoreExpr_tryParse(instring, tmploc)
-                    except ParseBaseException:
-                        break
-            
-            try:
-                expr_parse(instring, tmploc, doActions=False, callPreParse=False)
-            except (ParseException, IndexError):
-                # no match, advance loc in string
-                tmploc += 1
-            else:
-                # matched skipto expr, done
-                break
-
-        else:
-            # ran off the end of the input string without matching skipto expr, fail
-            raise ParseException(instring, loc, self.errmsg, self)
-
-        # build up return values
-        loc = tmploc
-        skiptext = instring[startloc:loc]
-        skipresult = ParseResults(skiptext)
-        
-        if self.includeMatch:
-            loc, mat = expr_parse(instring,loc,doActions,callPreParse=False)
-            skipresult += mat
-
-        return loc, skipresult
-
-class Forward(ParseElementEnhance):
-    """
-    Forward declaration of an expression to be defined later -
-    used for recursive grammars, such as algebraic infix notation.
-    When the expression is known, it is assigned to the C{Forward} variable using the '<<' operator.
-
-    Note: take care when assigning to C{Forward} not to overlook precedence of operators.
-    Specifically, '|' has a lower precedence than '<<', so that::
-        fwdExpr << a | b | c
-    will actually be evaluated as::
-        (fwdExpr << a) | b | c
-    thereby leaving b and c out as parseable alternatives.  It is recommended that you
-    explicitly group the values inserted into the C{Forward}::
-        fwdExpr << (a | b | c)
-    Converting to use the '<<=' operator instead will avoid this problem.
-
-    See L{ParseResults.pprint} for an example of a recursive parser created using
-    C{Forward}.
-    """
-    def __init__( self, other=None ):
-        super(Forward,self).__init__( other, savelist=False )
-
-    def __lshift__( self, other ):
-        if isinstance( other, basestring ):
-            other = ParserElement._literalStringClass(other)
-        self.expr = other
-        self.strRepr = None
-        self.mayIndexError = self.expr.mayIndexError
-        self.mayReturnEmpty = self.expr.mayReturnEmpty
-        self.setWhitespaceChars( self.expr.whiteChars )
-        self.skipWhitespace = self.expr.skipWhitespace
-        self.saveAsList = self.expr.saveAsList
-        self.ignoreExprs.extend(self.expr.ignoreExprs)
-        return self
-        
-    def __ilshift__(self, other):
-        return self << other
-    
-    def leaveWhitespace( self ):
-        self.skipWhitespace = False
-        return self
-
-    def streamline( self ):
-        if not self.streamlined:
-            self.streamlined = True
-            if self.expr is not None:
-                self.expr.streamline()
-        return self
-
-    def validate( self, validateTrace=[] ):
-        if self not in validateTrace:
-            tmp = validateTrace[:]+[self]
-            if self.expr is not None:
-                self.expr.validate(tmp)
-        self.checkRecursion([])
-
-    def __str__( self ):
-        if hasattr(self,"name"):
-            return self.name
-        return self.__class__.__name__ + ": ..."
-
-        # stubbed out for now - creates awful memory and perf issues
-        self._revertClass = self.__class__
-        self.__class__ = _ForwardNoRecurse
-        try:
-            if self.expr is not None:
-                retString = _ustr(self.expr)
-            else:
-                retString = "None"
-        finally:
-            self.__class__ = self._revertClass
-        return self.__class__.__name__ + ": " + retString
-
-    def copy(self):
-        if self.expr is not None:
-            return super(Forward,self).copy()
-        else:
-            ret = Forward()
-            ret <<= self
-            return ret
-
-class _ForwardNoRecurse(Forward):
-    def __str__( self ):
-        return "..."
-
-class TokenConverter(ParseElementEnhance):
-    """
-    Abstract subclass of C{ParseExpression}, for converting parsed results.
-    """
-    def __init__( self, expr, savelist=False ):
-        super(TokenConverter,self).__init__( expr )#, savelist )
-        self.saveAsList = False
-
-class Combine(TokenConverter):
-    """
-    Converter to concatenate all matching tokens to a single string.
-    By default, the matching patterns must also be contiguous in the input string;
-    this can be disabled by specifying C{'adjacent=False'} in the constructor.
-
-    Example::
-        real = Word(nums) + '.' + Word(nums)
-        print(real.parseString('3.1416')) # -> ['3', '.', '1416']
-        # will also erroneously match the following
-        print(real.parseString('3. 1416')) # -> ['3', '.', '1416']
-
-        real = Combine(Word(nums) + '.' + Word(nums))
-        print(real.parseString('3.1416')) # -> ['3.1416']
-        # no match when there are internal spaces
-        print(real.parseString('3. 1416')) # -> Exception: Expected W:(0123...)
-    """
-    def __init__( self, expr, joinString="", adjacent=True ):
-        super(Combine,self).__init__( expr )
-        # suppress whitespace-stripping in contained parse expressions, but re-enable it on the Combine itself
-        if adjacent:
-            self.leaveWhitespace()
-        self.adjacent = adjacent
-        self.skipWhitespace = True
-        self.joinString = joinString
-        self.callPreparse = True
-
-    def ignore( self, other ):
-        if self.adjacent:
-            ParserElement.ignore(self, other)
-        else:
-            super( Combine, self).ignore( other )
-        return self
-
-    def postParse( self, instring, loc, tokenlist ):
-        retToks = tokenlist.copy()
-        del retToks[:]
-        retToks += ParseResults([ "".join(tokenlist._asStringList(self.joinString)) ], modal=self.modalResults)
-
-        if self.resultsName and retToks.haskeys():
-            return [ retToks ]
-        else:
-            return retToks
-
-class Group(TokenConverter):
-    """
-    Converter to return the matched tokens as a list - useful for returning tokens of C{L{ZeroOrMore}} and C{L{OneOrMore}} expressions.
-
-    Example::
-        ident = Word(alphas)
-        num = Word(nums)
-        term = ident | num
-        func = ident + Optional(delimitedList(term))
-        print(func.parseString("fn a,b,100"))  # -> ['fn', 'a', 'b', '100']
-
-        func = ident + Group(Optional(delimitedList(term)))
-        print(func.parseString("fn a,b,100"))  # -> ['fn', ['a', 'b', '100']]
-    """
-    def __init__( self, expr ):
-        super(Group,self).__init__( expr )
-        self.saveAsList = True
-
-    def postParse( self, instring, loc, tokenlist ):
-        return [ tokenlist ]
-
-class Dict(TokenConverter):
-    """
-    Converter to return a repetitive expression as a list, but also as a dictionary.
-    Each element can also be referenced using the first token in the expression as its key.
-    Useful for tabular report scraping when the first column can be used as a item key.
-
-    Example::
-        data_word = Word(alphas)
-        label = data_word + FollowedBy(':')
-        attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
-
-        text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
-        attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
-        
-        # print attributes as plain groups
-        print(OneOrMore(attr_expr).parseString(text).dump())
-        
-        # instead of OneOrMore(expr), parse using Dict(OneOrMore(Group(expr))) - Dict will auto-assign names
-        result = Dict(OneOrMore(Group(attr_expr))).parseString(text)
-        print(result.dump())
-        
-        # access named fields as dict entries, or output as dict
-        print(result['shape'])        
-        print(result.asDict())
-    prints::
-        ['shape', 'SQUARE', 'posn', 'upper left', 'color', 'light blue', 'texture', 'burlap']
-
-        [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
-        - color: light blue
-        - posn: upper left
-        - shape: SQUARE
-        - texture: burlap
-        SQUARE
-        {'color': 'light blue', 'posn': 'upper left', 'texture': 'burlap', 'shape': 'SQUARE'}
-    See more examples at L{ParseResults} of accessing fields by results name.
-    """
-    def __init__( self, expr ):
-        super(Dict,self).__init__( expr )
-        self.saveAsList = True
-
-    def postParse( self, instring, loc, tokenlist ):
-        for i,tok in enumerate(tokenlist):
-            if len(tok) == 0:
-                continue
-            ikey = tok[0]
-            if isinstance(ikey,int):
-                ikey = _ustr(tok[0]).strip()
-            if len(tok)==1:
-                tokenlist[ikey] = _ParseResultsWithOffset("",i)
-            elif len(tok)==2 and not isinstance(tok[1],ParseResults):
-                tokenlist[ikey] = _ParseResultsWithOffset(tok[1],i)
-            else:
-                dictvalue = tok.copy() #ParseResults(i)
-                del dictvalue[0]
-                if len(dictvalue)!= 1 or (isinstance(dictvalue,ParseResults) and dictvalue.haskeys()):
-                    tokenlist[ikey] = _ParseResultsWithOffset(dictvalue,i)
-                else:
-                    tokenlist[ikey] = _ParseResultsWithOffset(dictvalue[0],i)
-
-        if self.resultsName:
-            return [ tokenlist ]
-        else:
-            return tokenlist
-
-
-class Suppress(TokenConverter):
-    """
-    Converter for ignoring the results of a parsed expression.
-
-    Example::
-        source = "a, b, c,d"
-        wd = Word(alphas)
-        wd_list1 = wd + ZeroOrMore(',' + wd)
-        print(wd_list1.parseString(source))
-
-        # often, delimiters that are useful during parsing are just in the
-        # way afterward - use Suppress to keep them out of the parsed output
-        wd_list2 = wd + ZeroOrMore(Suppress(',') + wd)
-        print(wd_list2.parseString(source))
-    prints::
-        ['a', ',', 'b', ',', 'c', ',', 'd']
-        ['a', 'b', 'c', 'd']
-    (See also L{delimitedList}.)
-    """
-    def postParse( self, instring, loc, tokenlist ):
-        return []
-
-    def suppress( self ):
-        return self
-
-
-class OnlyOnce(object):
-    """
-    Wrapper for parse actions, to ensure they are only called once.
-    """
-    def __init__(self, methodCall):
-        self.callable = _trim_arity(methodCall)
-        self.called = False
-    def __call__(self,s,l,t):
-        if not self.called:
-            results = self.callable(s,l,t)
-            self.called = True
-            return results
-        raise ParseException(s,l,"")
-    def reset(self):
-        self.called = False
-
-def traceParseAction(f):
-    """
-    Decorator for debugging parse actions. 
-    
-    When the parse action is called, this decorator will print C{">> entering I{method-name}(line:I{current_source_line}, I{parse_location}, I{matched_tokens})".}
-    When the parse action completes, the decorator will print C{"<<"} followed by the returned value, or any exception that the parse action raised.
-
-    Example::
-        wd = Word(alphas)
-
-        @traceParseAction
-        def remove_duplicate_chars(tokens):
-            return ''.join(sorted(set(''.join(tokens)))
-
-        wds = OneOrMore(wd).setParseAction(remove_duplicate_chars)
-        print(wds.parseString("slkdjs sld sldd sdlf sdljf"))
-    prints::
-        >>entering remove_duplicate_chars(line: 'slkdjs sld sldd sdlf sdljf', 0, (['slkdjs', 'sld', 'sldd', 'sdlf', 'sdljf'], {}))
-        <<leaving remove_duplicate_chars (ret: 'dfjkls')
-        ['dfjkls']
-    """
-    f = _trim_arity(f)
-    def z(*paArgs):
-        thisFunc = f.__name__
-        s,l,t = paArgs[-3:]
-        if len(paArgs)>3:
-            thisFunc = paArgs[0].__class__.__name__ + '.' + thisFunc
-        sys.stderr.write( ">>entering %s(line: '%s', %d, %r)\n" % (thisFunc,line(l,s),l,t) )
-        try:
-            ret = f(*paArgs)
-        except Exception as exc:
-            sys.stderr.write( "<<leaving %s (exception: %s)\n" % (thisFunc,exc) )
-            raise
-        sys.stderr.write( "<<leaving %s (ret: %r)\n" % (thisFunc,ret) )
-        return ret
-    try:
-        z.__name__ = f.__name__
-    except AttributeError:
-        pass
-    return z
-
-#
-# global helpers
-#
-def delimitedList( expr, delim=",", combine=False ):
-    """
-    Helper to define a delimited list of expressions - the delimiter defaults to ','.
-    By default, the list elements and delimiters can have intervening whitespace, and
-    comments, but this can be overridden by passing C{combine=True} in the constructor.
-    If C{combine} is set to C{True}, the matching tokens are returned as a single token
-    string, with the delimiters included; otherwise, the matching tokens are returned
-    as a list of tokens, with the delimiters suppressed.
-
-    Example::
-        delimitedList(Word(alphas)).parseString("aa,bb,cc") # -> ['aa', 'bb', 'cc']
-        delimitedList(Word(hexnums), delim=':', combine=True).parseString("AA:BB:CC:DD:EE") # -> ['AA:BB:CC:DD:EE']
-    """
-    dlName = _ustr(expr)+" ["+_ustr(delim)+" "+_ustr(expr)+"]..."
-    if combine:
-        return Combine( expr + ZeroOrMore( delim + expr ) ).setName(dlName)
-    else:
-        return ( expr + ZeroOrMore( Suppress( delim ) + expr ) ).setName(dlName)
-
-def countedArray( expr, intExpr=None ):
-    """
-    Helper to define a counted list of expressions.
-    This helper defines a pattern of the form::
-        integer expr expr expr...
-    where the leading integer tells how many expr expressions follow.
-    The matched tokens returns the array of expr tokens as a list - the leading count token is suppressed.
-    
-    If C{intExpr} is specified, it should be a pyparsing expression that produces an integer value.
-
-    Example::
-        countedArray(Word(alphas)).parseString('2 ab cd ef')  # -> ['ab', 'cd']
-
-        # in this parser, the leading integer value is given in binary,
-        # '10' indicating that 2 values are in the array
-        binaryConstant = Word('01').setParseAction(lambda t: int(t[0], 2))
-        countedArray(Word(alphas), intExpr=binaryConstant).parseString('10 ab cd ef')  # -> ['ab', 'cd']
-    """
-    arrayExpr = Forward()
-    def countFieldParseAction(s,l,t):
-        n = t[0]
-        arrayExpr << (n and Group(And([expr]*n)) or Group(empty))
-        return []
-    if intExpr is None:
-        intExpr = Word(nums).setParseAction(lambda t:int(t[0]))
-    else:
-        intExpr = intExpr.copy()
-    intExpr.setName("arrayLen")
-    intExpr.addParseAction(countFieldParseAction, callDuringTry=True)
-    return ( intExpr + arrayExpr ).setName('(len) ' + _ustr(expr) + '...')
-
-def _flatten(L):
-    ret = []
-    for i in L:
-        if isinstance(i,list):
-            ret.extend(_flatten(i))
-        else:
-            ret.append(i)
-    return ret
-
-def matchPreviousLiteral(expr):
-    """
-    Helper to define an expression that is indirectly defined from
-    the tokens matched in a previous expression, that is, it looks
-    for a 'repeat' of a previous expression.  For example::
-        first = Word(nums)
-        second = matchPreviousLiteral(first)
-        matchExpr = first + ":" + second
-    will match C{"1:1"}, but not C{"1:2"}.  Because this matches a
-    previous literal, will also match the leading C{"1:1"} in C{"1:10"}.
-    If this is not desired, use C{matchPreviousExpr}.
-    Do I{not} use with packrat parsing enabled.
-    """
-    rep = Forward()
-    def copyTokenToRepeater(s,l,t):
-        if t:
-            if len(t) == 1:
-                rep << t[0]
-            else:
-                # flatten t tokens
-                tflat = _flatten(t.asList())
-                rep << And(Literal(tt) for tt in tflat)
-        else:
-            rep << Empty()
-    expr.addParseAction(copyTokenToRepeater, callDuringTry=True)
-    rep.setName('(prev) ' + _ustr(expr))
-    return rep
-
-def matchPreviousExpr(expr):
-    """
-    Helper to define an expression that is indirectly defined from
-    the tokens matched in a previous expression, that is, it looks
-    for a 'repeat' of a previous expression.  For example::
-        first = Word(nums)
-        second = matchPreviousExpr(first)
-        matchExpr = first + ":" + second
-    will match C{"1:1"}, but not C{"1:2"}.  Because this matches by
-    expressions, will I{not} match the leading C{"1:1"} in C{"1:10"};
-    the expressions are evaluated first, and then compared, so
-    C{"1"} is compared with C{"10"}.
-    Do I{not} use with packrat parsing enabled.
-    """
-    rep = Forward()
-    e2 = expr.copy()
-    rep <<= e2
-    def copyTokenToRepeater(s,l,t):
-        matchTokens = _flatten(t.asList())
-        def mustMatchTheseTokens(s,l,t):
-            theseTokens = _flatten(t.asList())
-            if  theseTokens != matchTokens:
-                raise ParseException("",0,"")
-        rep.setParseAction( mustMatchTheseTokens, callDuringTry=True )
-    expr.addParseAction(copyTokenToRepeater, callDuringTry=True)
-    rep.setName('(prev) ' + _ustr(expr))
-    return rep
-
-def _escapeRegexRangeChars(s):
-    #~  escape these chars: ^-]
-    for c in r"\^-]":
-        s = s.replace(c,_bslash+c)
-    s = s.replace("\n",r"\n")
-    s = s.replace("\t",r"\t")
-    return _ustr(s)
-
-def oneOf( strs, caseless=False, useRegex=True ):
-    """
-    Helper to quickly define a set of alternative Literals, and makes sure to do
-    longest-first testing when there is a conflict, regardless of the input order,
-    but returns a C{L{MatchFirst}} for best performance.
-
-    Parameters:
-     - strs - a string of space-delimited literals, or a collection of string literals
-     - caseless - (default=C{False}) - treat all literals as caseless
-     - useRegex - (default=C{True}) - as an optimization, will generate a Regex
-          object; otherwise, will generate a C{MatchFirst} object (if C{caseless=True}, or
-          if creating a C{Regex} raises an exception)
-
-    Example::
-        comp_oper = oneOf("< = > <= >= !=")
-        var = Word(alphas)
-        number = Word(nums)
-        term = var | number
-        comparison_expr = term + comp_oper + term
-        print(comparison_expr.searchString("B = 12  AA=23 B<=AA AA>12"))
-    prints::
-        [['B', '=', '12'], ['AA', '=', '23'], ['B', '<=', 'AA'], ['AA', '>', '12']]
-    """
-    if caseless:
-        isequal = ( lambda a,b: a.upper() == b.upper() )
-        masks = ( lambda a,b: b.upper().startswith(a.upper()) )
-        parseElementClass = CaselessLiteral
-    else:
-        isequal = ( lambda a,b: a == b )
-        masks = ( lambda a,b: b.startswith(a) )
-        parseElementClass = Literal
-
-    symbols = []
-    if isinstance(strs,basestring):
-        symbols = strs.split()
-    elif isinstance(strs, collections.Iterable):
-        symbols = list(strs)
-    else:
-        warnings.warn("Invalid argument to oneOf, expected string or iterable",
-                SyntaxWarning, stacklevel=2)
-    if not symbols:
-        return NoMatch()
-
-    i = 0
-    while i < len(symbols)-1:
-        cur = symbols[i]
-        for j,other in enumerate(symbols[i+1:]):
-            if ( isequal(other, cur) ):
-                del symbols[i+j+1]
-                break
-            elif ( masks(cur, other) ):
-                del symbols[i+j+1]
-                symbols.insert(i,other)
-                cur = other
-                break
-        else:
-            i += 1
-
-    if not caseless and useRegex:
-        #~ print (strs,"->", "|".join( [ _escapeRegexChars(sym) for sym in symbols] ))
-        try:
-            if len(symbols)==len("".join(symbols)):
-                return Regex( "[%s]" % "".join(_escapeRegexRangeChars(sym) for sym in symbols) ).setName(' | '.join(symbols))
-            else:
-                return Regex( "|".join(re.escape(sym) for sym in symbols) ).setName(' | '.join(symbols))
-        except Exception:
-            warnings.warn("Exception creating Regex for oneOf, building MatchFirst",
-                    SyntaxWarning, stacklevel=2)
-
-
-    # last resort, just use MatchFirst
-    return MatchFirst(parseElementClass(sym) for sym in symbols).setName(' | '.join(symbols))
-
-def dictOf( key, value ):
-    """
-    Helper to easily and clearly define a dictionary by specifying the respective patterns
-    for the key and value.  Takes care of defining the C{L{Dict}}, C{L{ZeroOrMore}}, and C{L{Group}} tokens
-    in the proper order.  The key pattern can include delimiting markers or punctuation,
-    as long as they are suppressed, thereby leaving the significant key text.  The value
-    pattern can include named results, so that the C{Dict} results can include named token
-    fields.
-
-    Example::
-        text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
-        attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
-        print(OneOrMore(attr_expr).parseString(text).dump())
-        
-        attr_label = label
-        attr_value = Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join)
-
-        # similar to Dict, but simpler call format
-        result = dictOf(attr_label, attr_value).parseString(text)
-        print(result.dump())
-        print(result['shape'])
-        print(result.shape)  # object attribute access works too
-        print(result.asDict())
-    prints::
-        [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
-        - color: light blue
-        - posn: upper left
-        - shape: SQUARE
-        - texture: burlap
-        SQUARE
-        SQUARE
-        {'color': 'light blue', 'shape': 'SQUARE', 'posn': 'upper left', 'texture': 'burlap'}
-    """
-    return Dict( ZeroOrMore( Group ( key + value ) ) )
-
-def originalTextFor(expr, asString=True):
-    """
-    Helper to return the original, untokenized text for a given expression.  Useful to
-    restore the parsed fields of an HTML start tag into the raw tag text itself, or to
-    revert separate tokens with intervening whitespace back to the original matching
-    input text. By default, returns astring containing the original parsed text.  
-       
-    If the optional C{asString} argument is passed as C{False}, then the return value is a 
-    C{L{ParseResults}} containing any results names that were originally matched, and a 
-    single token containing the original matched text from the input string.  So if 
-    the expression passed to C{L{originalTextFor}} contains expressions with defined
-    results names, you must set C{asString} to C{False} if you want to preserve those
-    results name values.
-
-    Example::
-        src = "this is test <b> bold <i>text</i> </b> normal text "
-        for tag in ("b","i"):
-            opener,closer = makeHTMLTags(tag)
-            patt = originalTextFor(opener + SkipTo(closer) + closer)
-            print(patt.searchString(src)[0])
-    prints::
-        ['<b> bold <i>text</i> </b>']
-        ['<i>text</i>']
-    """
-    locMarker = Empty().setParseAction(lambda s,loc,t: loc)
-    endlocMarker = locMarker.copy()
-    endlocMarker.callPreparse = False
-    matchExpr = locMarker("_original_start") + expr + endlocMarker("_original_end")
-    if asString:
-        extractText = lambda s,l,t: s[t._original_start:t._original_end]
-    else:
-        def extractText(s,l,t):
-            t[:] = [s[t.pop('_original_start'):t.pop('_original_end')]]
-    matchExpr.setParseAction(extractText)
-    matchExpr.ignoreExprs = expr.ignoreExprs
-    return matchExpr
-
-def ungroup(expr): 
-    """
-    Helper to undo pyparsing's default grouping of And expressions, even
-    if all but one are non-empty.
-    """
-    return TokenConverter(expr).setParseAction(lambda t:t[0])
-
-def locatedExpr(expr):
-    """
-    Helper to decorate a returned token with its starting and ending locations in the input string.
-    This helper adds the following results names:
-     - locn_start = location where matched expression begins
-     - locn_end = location where matched expression ends
-     - value = the actual parsed results
-
-    Be careful if the input text contains C{<TAB>} characters, you may want to call
-    C{L{ParserElement.parseWithTabs}}
-
-    Example::
-        wd = Word(alphas)
-        for match in locatedExpr(wd).searchString("ljsdf123lksdjjf123lkkjj1222"):
-            print(match)
-    prints::
-        [[0, 'ljsdf', 5]]
-        [[8, 'lksdjjf', 15]]
-        [[18, 'lkkjj', 23]]
-    """
-    locator = Empty().setParseAction(lambda s,l,t: l)
-    return Group(locator("locn_start") + expr("value") + locator.copy().leaveWhitespace()("locn_end"))
-
-
-# convenience constants for positional expressions
-empty       = Empty().setName("empty")
-lineStart   = LineStart().setName("lineStart")
-lineEnd     = LineEnd().setName("lineEnd")
-stringStart = StringStart().setName("stringStart")
-stringEnd   = StringEnd().setName("stringEnd")
-
-_escapedPunc = Word( _bslash, r"\[]-*.$+^?()~ ", exact=2 ).setParseAction(lambda s,l,t:t[0][1])
-_escapedHexChar = Regex(r"\\0?[xX][0-9a-fA-F]+").setParseAction(lambda s,l,t:unichr(int(t[0].lstrip(r'\0x'),16)))
-_escapedOctChar = Regex(r"\\0[0-7]+").setParseAction(lambda s,l,t:unichr(int(t[0][1:],8)))
-_singleChar = _escapedPunc | _escapedHexChar | _escapedOctChar | Word(printables, excludeChars=r'\]', exact=1) | Regex(r"\w", re.UNICODE)
-_charRange = Group(_singleChar + Suppress("-") + _singleChar)
-_reBracketExpr = Literal("[") + Optional("^").setResultsName("negate") + Group( OneOrMore( _charRange | _singleChar ) ).setResultsName("body") + "]"
-
-def srange(s):
-    r"""
-    Helper to easily define string ranges for use in Word construction.  Borrows
-    syntax from regexp '[]' string range definitions::
-        srange("[0-9]")   -> "0123456789"
-        srange("[a-z]")   -> "abcdefghijklmnopqrstuvwxyz"
-        srange("[a-z$_]") -> "abcdefghijklmnopqrstuvwxyz$_"
-    The input string must be enclosed in []'s, and the returned string is the expanded
-    character set joined into a single string.
-    The values enclosed in the []'s may be:
-     - a single character
-     - an escaped character with a leading backslash (such as C{\-} or C{\]})
-     - an escaped hex character with a leading C{'\x'} (C{\x21}, which is a C{'!'} character) 
-         (C{\0x##} is also supported for backwards compatibility) 
-     - an escaped octal character with a leading C{'\0'} (C{\041}, which is a C{'!'} character)
-     - a range of any of the above, separated by a dash (C{'a-z'}, etc.)
-     - any combination of the above (C{'aeiouy'}, C{'a-zA-Z0-9_$'}, etc.)
-    """
-    _expanded = lambda p: p if not isinstance(p,ParseResults) else ''.join(unichr(c) for c in range(ord(p[0]),ord(p[1])+1))
-    try:
-        return "".join(_expanded(part) for part in _reBracketExpr.parseString(s).body)
-    except Exception:
-        return ""
-
-def matchOnlyAtCol(n):
-    """
-    Helper method for defining parse actions that require matching at a specific
-    column in the input text.
-    """
-    def verifyCol(strg,locn,toks):
-        if col(locn,strg) != n:
-            raise ParseException(strg,locn,"matched token not at column %d" % n)
-    return verifyCol
-
-def replaceWith(replStr):
-    """
-    Helper method for common parse actions that simply return a literal value.  Especially
-    useful when used with C{L{transformString<ParserElement.transformString>}()}.
-
-    Example::
-        num = Word(nums).setParseAction(lambda toks: int(toks[0]))
-        na = oneOf("N/A NA").setParseAction(replaceWith(math.nan))
-        term = na | num
-        
-        OneOrMore(term).parseString("324 234 N/A 234") # -> [324, 234, nan, 234]
-    """
-    return lambda s,l,t: [replStr]
-
-def removeQuotes(s,l,t):
-    """
-    Helper parse action for removing quotation marks from parsed quoted strings.
-
-    Example::
-        # by default, quotation marks are included in parsed results
-        quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["'Now is the Winter of our Discontent'"]
-
-        # use removeQuotes to strip quotation marks from parsed results
-        quotedString.setParseAction(removeQuotes)
-        quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["Now is the Winter of our Discontent"]
-    """
-    return t[0][1:-1]
-
-def tokenMap(func, *args):
-    """
-    Helper to define a parse action by mapping a function to all elements of a ParseResults list.If any additional 
-    args are passed, they are forwarded to the given function as additional arguments after
-    the token, as in C{hex_integer = Word(hexnums).setParseAction(tokenMap(int, 16))}, which will convert the
-    parsed data to an integer using base 16.
-
-    Example (compare the last to example in L{ParserElement.transformString}::
-        hex_ints = OneOrMore(Word(hexnums)).setParseAction(tokenMap(int, 16))
-        hex_ints.runTests('''
-            00 11 22 aa FF 0a 0d 1a
-            ''')
-        
-        upperword = Word(alphas).setParseAction(tokenMap(str.upper))
-        OneOrMore(upperword).runTests('''
-            my kingdom for a horse
-            ''')
-
-        wd = Word(alphas).setParseAction(tokenMap(str.title))
-        OneOrMore(wd).setParseAction(' '.join).runTests('''
-            now is the winter of our discontent made glorious summer by this sun of york
-            ''')
-    prints::
-        00 11 22 aa FF 0a 0d 1a
-        [0, 17, 34, 170, 255, 10, 13, 26]
-
-        my kingdom for a horse
-        ['MY', 'KINGDOM', 'FOR', 'A', 'HORSE']
-
-        now is the winter of our discontent made glorious summer by this sun of york
-        ['Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York']
-    """
-    def pa(s,l,t):
-        return [func(tokn, *args) for tokn in t]
-
-    try:
-        func_name = getattr(func, '__name__', 
-                            getattr(func, '__class__').__name__)
-    except Exception:
-        func_name = str(func)
-    pa.__name__ = func_name
-
-    return pa
-
-upcaseTokens = tokenMap(lambda t: _ustr(t).upper())
-"""(Deprecated) Helper parse action to convert tokens to upper case. Deprecated in favor of L{pyparsing_common.upcaseTokens}"""
-
-downcaseTokens = tokenMap(lambda t: _ustr(t).lower())
-"""(Deprecated) Helper parse action to convert tokens to lower case. Deprecated in favor of L{pyparsing_common.downcaseTokens}"""
-    
-def _makeTags(tagStr, xml):
-    """Internal helper to construct opening and closing tag expressions, given a tag name"""
-    if isinstance(tagStr,basestring):
-        resname = tagStr
-        tagStr = Keyword(tagStr, caseless=not xml)
-    else:
-        resname = tagStr.name
-
-    tagAttrName = Word(alphas,alphanums+"_-:")
-    if (xml):
-        tagAttrValue = dblQuotedString.copy().setParseAction( removeQuotes )
-        openTag = Suppress("<") + tagStr("tag") + \
-                Dict(ZeroOrMore(Group( tagAttrName + Suppress("=") + tagAttrValue ))) + \
-                Optional("/",default=[False]).setResultsName("empty").setParseAction(lambda s,l,t:t[0]=='/') + Suppress(">")
-    else:
-        printablesLessRAbrack = "".join(c for c in printables if c not in ">")
-        tagAttrValue = quotedString.copy().setParseAction( removeQuotes ) | Word(printablesLessRAbrack)
-        openTag = Suppress("<") + tagStr("tag") + \
-                Dict(ZeroOrMore(Group( tagAttrName.setParseAction(downcaseTokens) + \
-                Optional( Suppress("=") + tagAttrValue ) ))) + \
-                Optional("/",default=[False]).setResultsName("empty").setParseAction(lambda s,l,t:t[0]=='/') + Suppress(">")
-    closeTag = Combine(_L("</") + tagStr + ">")
-
-    openTag = openTag.setResultsName("start"+"".join(resname.replace(":"," ").title().split())).setName("<%s>" % resname)
-    closeTag = closeTag.setResultsName("end"+"".join(resname.replace(":"," ").title().split())).setName("</%s>" % resname)
-    openTag.tag = resname
-    closeTag.tag = resname
-    return openTag, closeTag
-
-def makeHTMLTags(tagStr):
-    """
-    Helper to construct opening and closing tag expressions for HTML, given a tag name. Matches
-    tags in either upper or lower case, attributes with namespaces and with quoted or unquoted values.
-
-    Example::
-        text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
-        # makeHTMLTags returns pyparsing expressions for the opening and closing tags as a 2-tuple
-        a,a_end = makeHTMLTags("A")
-        link_expr = a + SkipTo(a_end)("link_text") + a_end
-        
-        for link in link_expr.searchString(text):
-            # attributes in the <A> tag (like "href" shown here) are also accessible as named results
-            print(link.link_text, '->', link.href)
-    prints::
-        pyparsing -> http://pyparsing.wikispaces.com
-    """
-    return _makeTags( tagStr, False )
-
-def makeXMLTags(tagStr):
-    """
-    Helper to construct opening and closing tag expressions for XML, given a tag name. Matches
-    tags only in the given upper/lower case.
-
-    Example: similar to L{makeHTMLTags}
-    """
-    return _makeTags( tagStr, True )
-
-def withAttribute(*args,**attrDict):
-    """
-    Helper to create a validating parse action to be used with start tags created
-    with C{L{makeXMLTags}} or C{L{makeHTMLTags}}. Use C{withAttribute} to qualify a starting tag
-    with a required attribute value, to avoid false matches on common tags such as
-    C{<TD>} or C{<DIV>}.
-
-    Call C{withAttribute} with a series of attribute names and values. Specify the list
-    of filter attributes names and values as:
-     - keyword arguments, as in C{(align="right")}, or
-     - as an explicit dict with C{**} operator, when an attribute name is also a Python
-          reserved word, as in C{**{"class":"Customer", "align":"right"}}
-     - a list of name-value tuples, as in ( ("ns1:class", "Customer"), ("ns2:align","right") )
-    For attribute names with a namespace prefix, you must use the second form.  Attribute
-    names are matched insensitive to upper/lower case.
-       
-    If just testing for C{class} (with or without a namespace), use C{L{withClass}}.
-
-    To verify that the attribute exists, but without specifying a value, pass
-    C{withAttribute.ANY_VALUE} as the value.
-
-    Example::
-        html = '''
-            <div>
-            Some text
-            <div type="grid">1 4 0 1 0</div>
-            <div type="graph">1,3 2,3 1,1</div>
-            <div>this has no type</div>
-            </div>
-                
-        '''
-        div,div_end = makeHTMLTags("div")
-
-        # only match div tag having a type attribute with value "grid"
-        div_grid = div().setParseAction(withAttribute(type="grid"))
-        grid_expr = div_grid + SkipTo(div | div_end)("body")
-        for grid_header in grid_expr.searchString(html):
-            print(grid_header.body)
-        
-        # construct a match with any div tag having a type attribute, regardless of the value
-        div_any_type = div().setParseAction(withAttribute(type=withAttribute.ANY_VALUE))
-        div_expr = div_any_type + SkipTo(div | div_end)("body")
-        for div_header in div_expr.searchString(html):
-            print(div_header.body)
-    prints::
-        1 4 0 1 0
-
-        1 4 0 1 0
-        1,3 2,3 1,1
-    """
-    if args:
-        attrs = args[:]
-    else:
-        attrs = attrDict.items()
-    attrs = [(k,v) for k,v in attrs]
-    def pa(s,l,tokens):
-        for attrName,attrValue in attrs:
-            if attrName not in tokens:
-                raise ParseException(s,l,"no matching attribute " + attrName)
-            if attrValue != withAttribute.ANY_VALUE and tokens[attrName] != attrValue:
-                raise ParseException(s,l,"attribute '%s' has value '%s', must be '%s'" %
-                                            (attrName, tokens[attrName], attrValue))
-    return pa
-withAttribute.ANY_VALUE = object()
-
-def withClass(classname, namespace=''):
-    """
-    Simplified version of C{L{withAttribute}} when matching on a div class - made
-    difficult because C{class} is a reserved word in Python.
-
-    Example::
-        html = '''
-            <div>
-            Some text
-            <div class="grid">1 4 0 1 0</div>
-            <div class="graph">1,3 2,3 1,1</div>
-            <div>this &lt;div&gt; has no class</div>
-            </div>
-                
-        '''
-        div,div_end = makeHTMLTags("div")
-        div_grid = div().setParseAction(withClass("grid"))
-        
-        grid_expr = div_grid + SkipTo(div | div_end)("body")
-        for grid_header in grid_expr.searchString(html):
-            print(grid_header.body)
-        
-        div_any_type = div().setParseAction(withClass(withAttribute.ANY_VALUE))
-        div_expr = div_any_type + SkipTo(div | div_end)("body")
-        for div_header in div_expr.searchString(html):
-            print(div_header.body)
-    prints::
-        1 4 0 1 0
-
-        1 4 0 1 0
-        1,3 2,3 1,1
-    """
-    classattr = "%s:class" % namespace if namespace else "class"
-    return withAttribute(**{classattr : classname})        
-
-opAssoc = _Constants()
-opAssoc.LEFT = object()
-opAssoc.RIGHT = object()
-
-def infixNotation( baseExpr, opList, lpar=Suppress('('), rpar=Suppress(')') ):
-    """
-    Helper method for constructing grammars of expressions made up of
-    operators working in a precedence hierarchy.  Operators may be unary or
-    binary, left- or right-associative.  Parse actions can also be attached
-    to operator expressions. The generated parser will also recognize the use 
-    of parentheses to override operator precedences (see example below).
-    
-    Note: if you define a deep operator list, you may see performance issues
-    when using infixNotation. See L{ParserElement.enablePackrat} for a
-    mechanism to potentially improve your parser performance.
-
-    Parameters:
-     - baseExpr - expression representing the most basic element for the nested
-     - opList - list of tuples, one for each operator precedence level in the
-      expression grammar; each tuple is of the form
-      (opExpr, numTerms, rightLeftAssoc, parseAction), where:
-       - opExpr is the pyparsing expression for the operator;
-          may also be a string, which will be converted to a Literal;
-          if numTerms is 3, opExpr is a tuple of two expressions, for the
-          two operators separating the 3 terms
-       - numTerms is the number of terms for this operator (must
-          be 1, 2, or 3)
-       - rightLeftAssoc is the indicator whether the operator is
-          right or left associative, using the pyparsing-defined
-          constants C{opAssoc.RIGHT} and C{opAssoc.LEFT}.
-       - parseAction is the parse action to be associated with
-          expressions matching this operator expression (the
-          parse action tuple member may be omitted); if the parse action
-          is passed a tuple or list of functions, this is equivalent to
-          calling C{setParseAction(*fn)} (L{ParserElement.setParseAction})
-     - lpar - expression for matching left-parentheses (default=C{Suppress('(')})
-     - rpar - expression for matching right-parentheses (default=C{Suppress(')')})
-
-    Example::
-        # simple example of four-function arithmetic with ints and variable names
-        integer = pyparsing_common.signed_integer
-        varname = pyparsing_common.identifier 
-        
-        arith_expr = infixNotation(integer | varname,
-            [
-            ('-', 1, opAssoc.RIGHT),
-            (oneOf('* /'), 2, opAssoc.LEFT),
-            (oneOf('+ -'), 2, opAssoc.LEFT),
-            ])
-        
-        arith_expr.runTests('''
-            5+3*6
-            (5+3)*6
-            -2--11
-            ''', fullDump=False)
-    prints::
-        5+3*6
-        [[5, '+', [3, '*', 6]]]
-
-        (5+3)*6
-        [[[5, '+', 3], '*', 6]]
-
-        -2--11
-        [[['-', 2], '-', ['-', 11]]]
-    """
-    ret = Forward()
-    lastExpr = baseExpr | ( lpar + ret + rpar )
-    for i,operDef in enumerate(opList):
-        opExpr,arity,rightLeftAssoc,pa = (operDef + (None,))[:4]
-        termName = "%s term" % opExpr if arity < 3 else "%s%s term" % opExpr
-        if arity == 3:
-            if opExpr is None or len(opExpr) != 2:
-                raise ValueError("if numterms=3, opExpr must be a tuple or list of two expressions")
-            opExpr1, opExpr2 = opExpr
-        thisExpr = Forward().setName(termName)
-        if rightLeftAssoc == opAssoc.LEFT:
-            if arity == 1:
-                matchExpr = FollowedBy(lastExpr + opExpr) + Group( lastExpr + OneOrMore( opExpr ) )
-            elif arity == 2:
-                if opExpr is not None:
-                    matchExpr = FollowedBy(lastExpr + opExpr + lastExpr) + Group( lastExpr + OneOrMore( opExpr + lastExpr ) )
-                else:
-                    matchExpr = FollowedBy(lastExpr+lastExpr) + Group( lastExpr + OneOrMore(lastExpr) )
-            elif arity == 3:
-                matchExpr = FollowedBy(lastExpr + opExpr1 + lastExpr + opExpr2 + lastExpr) + \
-                            Group( lastExpr + opExpr1 + lastExpr + opExpr2 + lastExpr )
-            else:
-                raise ValueError("operator must be unary (1), binary (2), or ternary (3)")
-        elif rightLeftAssoc == opAssoc.RIGHT:
-            if arity == 1:
-                # try to avoid LR with this extra test
-                if not isinstance(opExpr, Optional):
-                    opExpr = Optional(opExpr)
-                matchExpr = FollowedBy(opExpr.expr + thisExpr) + Group( opExpr + thisExpr )
-            elif arity == 2:
-                if opExpr is not None:
-                    matchExpr = FollowedBy(lastExpr + opExpr + thisExpr) + Group( lastExpr + OneOrMore( opExpr + thisExpr ) )
-                else:
-                    matchExpr = FollowedBy(lastExpr + thisExpr) + Group( lastExpr + OneOrMore( thisExpr ) )
-            elif arity == 3:
-                matchExpr = FollowedBy(lastExpr + opExpr1 + thisExpr + opExpr2 + thisExpr) + \
-                            Group( lastExpr + opExpr1 + thisExpr + opExpr2 + thisExpr )
-            else:
-                raise ValueError("operator must be unary (1), binary (2), or ternary (3)")
-        else:
-            raise ValueError("operator must indicate right or left associativity")
-        if pa:
-            if isinstance(pa, (tuple, list)):
-                matchExpr.setParseAction(*pa)
-            else:
-                matchExpr.setParseAction(pa)
-        thisExpr <<= ( matchExpr.setName(termName) | lastExpr )
-        lastExpr = thisExpr
-    ret <<= lastExpr
-    return ret
-
-operatorPrecedence = infixNotation
-"""(Deprecated) Former name of C{L{infixNotation}}, will be dropped in a future release."""
-
-dblQuotedString = Combine(Regex(r'"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*')+'"').setName("string enclosed in double quotes")
-sglQuotedString = Combine(Regex(r"'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*")+"'").setName("string enclosed in single quotes")
-quotedString = Combine(Regex(r'"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*')+'"'|
-                       Regex(r"'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*")+"'").setName("quotedString using single or double quotes")
-unicodeString = Combine(_L('u') + quotedString.copy()).setName("unicode string literal")
-
-def nestedExpr(opener="(", closer=")", content=None, ignoreExpr=quotedString.copy()):
-    """
-    Helper method for defining nested lists enclosed in opening and closing
-    delimiters ("(" and ")" are the default).
-
-    Parameters:
-     - opener - opening character for a nested list (default=C{"("}); can also be a pyparsing expression
-     - closer - closing character for a nested list (default=C{")"}); can also be a pyparsing expression
-     - content - expression for items within the nested lists (default=C{None})
-     - ignoreExpr - expression for ignoring opening and closing delimiters (default=C{quotedString})
-
-    If an expression is not provided for the content argument, the nested
-    expression will capture all whitespace-delimited content between delimiters
-    as a list of separate values.
-
-    Use the C{ignoreExpr} argument to define expressions that may contain
-    opening or closing characters that should not be treated as opening
-    or closing characters for nesting, such as quotedString or a comment
-    expression.  Specify multiple expressions using an C{L{Or}} or C{L{MatchFirst}}.
-    The default is L{quotedString}, but if no expressions are to be ignored,
-    then pass C{None} for this argument.
-
-    Example::
-        data_type = oneOf("void int short long char float double")
-        decl_data_type = Combine(data_type + Optional(Word('*')))
-        ident = Word(alphas+'_', alphanums+'_')
-        number = pyparsing_common.number
-        arg = Group(decl_data_type + ident)
-        LPAR,RPAR = map(Suppress, "()")
-
-        code_body = nestedExpr('{', '}', ignoreExpr=(quotedString | cStyleComment))
-
-        c_function = (decl_data_type("type") 
-                      + ident("name")
-                      + LPAR + Optional(delimitedList(arg), [])("args") + RPAR 
-                      + code_body("body"))
-        c_function.ignore(cStyleComment)
-        
-        source_code = '''
-            int is_odd(int x) { 
-                return (x%2); 
-            }
-                
-            int dec_to_hex(char hchar) { 
-                if (hchar >= '0' && hchar <= '9') { 
-                    return (ord(hchar)-ord('0')); 
-                } else { 
-                    return (10+ord(hchar)-ord('A'));
-                } 
-            }
-        '''
-        for func in c_function.searchString(source_code):
-            print("%(name)s (%(type)s) args: %(args)s" % func)
-
-    prints::
-        is_odd (int) args: [['int', 'x']]
-        dec_to_hex (int) args: [['char', 'hchar']]
-    """
-    if opener == closer:
-        raise ValueError("opening and closing strings cannot be the same")
-    if content is None:
-        if isinstance(opener,basestring) and isinstance(closer,basestring):
-            if len(opener) == 1 and len(closer)==1:
-                if ignoreExpr is not None:
-                    content = (Combine(OneOrMore(~ignoreExpr +
-                                    CharsNotIn(opener+closer+ParserElement.DEFAULT_WHITE_CHARS,exact=1))
-                                ).setParseAction(lambda t:t[0].strip()))
-                else:
-                    content = (empty.copy()+CharsNotIn(opener+closer+ParserElement.DEFAULT_WHITE_CHARS
-                                ).setParseAction(lambda t:t[0].strip()))
-            else:
-                if ignoreExpr is not None:
-                    content = (Combine(OneOrMore(~ignoreExpr + 
-                                    ~Literal(opener) + ~Literal(closer) +
-                                    CharsNotIn(ParserElement.DEFAULT_WHITE_CHARS,exact=1))
-                                ).setParseAction(lambda t:t[0].strip()))
-                else:
-                    content = (Combine(OneOrMore(~Literal(opener) + ~Literal(closer) +
-                                    CharsNotIn(ParserElement.DEFAULT_WHITE_CHARS,exact=1))
-                                ).setParseAction(lambda t:t[0].strip()))
-        else:
-            raise ValueError("opening and closing arguments must be strings if no content expression is given")
-    ret = Forward()
-    if ignoreExpr is not None:
-        ret <<= Group( Suppress(opener) + ZeroOrMore( ignoreExpr | ret | content ) + Suppress(closer) )
-    else:
-        ret <<= Group( Suppress(opener) + ZeroOrMore( ret | content )  + Suppress(closer) )
-    ret.setName('nested %s%s expression' % (opener,closer))
-    return ret
-
-def indentedBlock(blockStatementExpr, indentStack, indent=True):
-    """
-    Helper method for defining space-delimited indentation blocks, such as
-    those used to define block statements in Python source code.
-
-    Parameters:
-     - blockStatementExpr - expression defining syntax of statement that
-            is repeated within the indented block
-     - indentStack - list created by caller to manage indentation stack
-            (multiple statementWithIndentedBlock expressions within a single grammar
-            should share a common indentStack)
-     - indent - boolean indicating whether block must be indented beyond the
-            the current level; set to False for block of left-most statements
-            (default=C{True})
-
-    A valid block must contain at least one C{blockStatement}.
-
-    Example::
-        data = '''
-        def A(z):
-          A1
-          B = 100
-          G = A2
-          A2
-          A3
-        B
-        def BB(a,b,c):
-          BB1
-          def BBA():
-            bba1
-            bba2
-            bba3
-        C
-        D
-        def spam(x,y):
-             def eggs(z):
-                 pass
-        '''
-
-
-        indentStack = [1]
-        stmt = Forward()
-
-        identifier = Word(alphas, alphanums)
-        funcDecl = ("def" + identifier + Group( "(" + Optional( delimitedList(identifier) ) + ")" ) + ":")
-        func_body = indentedBlock(stmt, indentStack)
-        funcDef = Group( funcDecl + func_body )
-
-        rvalue = Forward()
-        funcCall = Group(identifier + "(" + Optional(delimitedList(rvalue)) + ")")
-        rvalue << (funcCall | identifier | Word(nums))
-        assignment = Group(identifier + "=" + rvalue)
-        stmt << ( funcDef | assignment | identifier )
-
-        module_body = OneOrMore(stmt)
-
-        parseTree = module_body.parseString(data)
-        parseTree.pprint()
-    prints::
-        [['def',
-          'A',
-          ['(', 'z', ')'],
-          ':',
-          [['A1'], [['B', '=', '100']], [['G', '=', 'A2']], ['A2'], ['A3']]],
-         'B',
-         ['def',
-          'BB',
-          ['(', 'a', 'b', 'c', ')'],
-          ':',
-          [['BB1'], [['def', 'BBA', ['(', ')'], ':', [['bba1'], ['bba2'], ['bba3']]]]]],
-         'C',
-         'D',
-         ['def',
-          'spam',
-          ['(', 'x', 'y', ')'],
-          ':',
-          [[['def', 'eggs', ['(', 'z', ')'], ':', [['pass']]]]]]] 
-    """
-    def checkPeerIndent(s,l,t):
-        if l >= len(s): return
-        curCol = col(l,s)
-        if curCol != indentStack[-1]:
-            if curCol > indentStack[-1]:
-                raise ParseFatalException(s,l,"illegal nesting")
-            raise ParseException(s,l,"not a peer entry")
-
-    def checkSubIndent(s,l,t):
-        curCol = col(l,s)
-        if curCol > indentStack[-1]:
-            indentStack.append( curCol )
-        else:
-            raise ParseException(s,l,"not a subentry")
-
-    def checkUnindent(s,l,t):
-        if l >= len(s): return
-        curCol = col(l,s)
-        if not(indentStack and curCol < indentStack[-1] and curCol <= indentStack[-2]):
-            raise ParseException(s,l,"not an unindent")
-        indentStack.pop()
-
-    NL = OneOrMore(LineEnd().setWhitespaceChars("\t ").suppress())
-    INDENT = (Empty() + Empty().setParseAction(checkSubIndent)).setName('INDENT')
-    PEER   = Empty().setParseAction(checkPeerIndent).setName('')
-    UNDENT = Empty().setParseAction(checkUnindent).setName('UNINDENT')
-    if indent:
-        smExpr = Group( Optional(NL) +
-            #~ FollowedBy(blockStatementExpr) +
-            INDENT + (OneOrMore( PEER + Group(blockStatementExpr) + Optional(NL) )) + UNDENT)
-    else:
-        smExpr = Group( Optional(NL) +
-            (OneOrMore( PEER + Group(blockStatementExpr) + Optional(NL) )) )
-    blockStatementExpr.ignore(_bslash + LineEnd())
-    return smExpr.setName('indented block')
-
-alphas8bit = srange(r"[\0xc0-\0xd6\0xd8-\0xf6\0xf8-\0xff]")
-punc8bit = srange(r"[\0xa1-\0xbf\0xd7\0xf7]")
-
-anyOpenTag,anyCloseTag = makeHTMLTags(Word(alphas,alphanums+"_:").setName('any tag'))
-_htmlEntityMap = dict(zip("gt lt amp nbsp quot apos".split(),'><& "\''))
-commonHTMLEntity = Regex('&(?P<entity>' + '|'.join(_htmlEntityMap.keys()) +");").setName("common HTML entity")
-def replaceHTMLEntity(t):
-    """Helper parser action to replace common HTML entities with their special characters"""
-    return _htmlEntityMap.get(t.entity)
-
-# it's easy to get these comment structures wrong - they're very common, so may as well make them available
-cStyleComment = Combine(Regex(r"/\*(?:[^*]|\*(?!/))*") + '*/').setName("C style comment")
-"Comment of the form C{/* ... */}"
-
-htmlComment = Regex(r"<!--[\s\S]*?-->").setName("HTML comment")
-"Comment of the form C{<!-- ... -->}"
-
-restOfLine = Regex(r".*").leaveWhitespace().setName("rest of line")
-dblSlashComment = Regex(r"//(?:\\\n|[^\n])*").setName("// comment")
-"Comment of the form C{// ... (to end of line)}"
-
-cppStyleComment = Combine(Regex(r"/\*(?:[^*]|\*(?!/))*") + '*/'| dblSlashComment).setName("C++ style comment")
-"Comment of either form C{L{cStyleComment}} or C{L{dblSlashComment}}"
-
-javaStyleComment = cppStyleComment
-"Same as C{L{cppStyleComment}}"
-
-pythonStyleComment = Regex(r"#.*").setName("Python style comment")
-"Comment of the form C{# ... (to end of line)}"
-
-_commasepitem = Combine(OneOrMore(Word(printables, excludeChars=',') +
-                                  Optional( Word(" \t") +
-                                            ~Literal(",") + ~LineEnd() ) ) ).streamline().setName("commaItem")
-commaSeparatedList = delimitedList( Optional( quotedString.copy() | _commasepitem, default="") ).setName("commaSeparatedList")
-"""(Deprecated) Predefined expression of 1 or more printable words or quoted strings, separated by commas.
-   This expression is deprecated in favor of L{pyparsing_common.comma_separated_list}."""
-
-# some other useful expressions - using lower-case class name since we are really using this as a namespace
-class pyparsing_common:
-    """
-    Here are some common low-level expressions that may be useful in jump-starting parser development:
-     - numeric forms (L{integers<integer>}, L{reals<real>}, L{scientific notation<sci_real>})
-     - common L{programming identifiers<identifier>}
-     - network addresses (L{MAC<mac_address>}, L{IPv4<ipv4_address>}, L{IPv6<ipv6_address>})
-     - ISO8601 L{dates<iso8601_date>} and L{datetime<iso8601_datetime>}
-     - L{UUID<uuid>}
-     - L{comma-separated list<comma_separated_list>}
-    Parse actions:
-     - C{L{convertToInteger}}
-     - C{L{convertToFloat}}
-     - C{L{convertToDate}}
-     - C{L{convertToDatetime}}
-     - C{L{stripHTMLTags}}
-     - C{L{upcaseTokens}}
-     - C{L{downcaseTokens}}
-
-    Example::
-        pyparsing_common.number.runTests('''
-            # any int or real number, returned as the appropriate type
-            100
-            -100
-            +100
-            3.14159
-            6.02e23
-            1e-12
-            ''')
-
-        pyparsing_common.fnumber.runTests('''
-            # any int or real number, returned as float
-            100
-            -100
-            +100
-            3.14159
-            6.02e23
-            1e-12
-            ''')
-
-        pyparsing_common.hex_integer.runTests('''
-            # hex numbers
-            100
-            FF
-            ''')
-
-        pyparsing_common.fraction.runTests('''
-            # fractions
-            1/2
-            -3/4
-            ''')
-
-        pyparsing_common.mixed_integer.runTests('''
-            # mixed fractions
-            1
-            1/2
-            -3/4
-            1-3/4
-            ''')
-
-        import uuid
-        pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
-        pyparsing_common.uuid.runTests('''
-            # uuid
-            12345678-1234-5678-1234-567812345678
-            ''')
-    prints::
-        # any int or real number, returned as the appropriate type
-        100
-        [100]
-
-        -100
-        [-100]
-
-        +100
-        [100]
-
-        3.14159
-        [3.14159]
-
-        6.02e23
-        [6.02e+23]
-
-        1e-12
-        [1e-12]
-
-        # any int or real number, returned as float
-        100
-        [100.0]
-
-        -100
-        [-100.0]
-
-        +100
-        [100.0]
-
-        3.14159
-        [3.14159]
-
-        6.02e23
-        [6.02e+23]
-
-        1e-12
-        [1e-12]
-
-        # hex numbers
-        100
-        [256]
-
-        FF
-        [255]
-
-        # fractions
-        1/2
-        [0.5]
-
-        -3/4
-        [-0.75]
-
-        # mixed fractions
-        1
-        [1]
-
-        1/2
-        [0.5]
-
-        -3/4
-        [-0.75]
-
-        1-3/4
-        [1.75]
-
-        # uuid
-        12345678-1234-5678-1234-567812345678
-        [UUID('12345678-1234-5678-1234-567812345678')]
-    """
-
-    convertToInteger = tokenMap(int)
-    """
-    Parse action for converting parsed integers to Python int
-    """
-
-    convertToFloat = tokenMap(float)
-    """
-    Parse action for converting parsed numbers to Python float
-    """
-
-    integer = Word(nums).setName("integer").setParseAction(convertToInteger)
-    """expression that parses an unsigned integer, returns an int"""
-
-    hex_integer = Word(hexnums).setName("hex integer").setParseAction(tokenMap(int,16))
-    """expression that parses a hexadecimal integer, returns an int"""
-
-    signed_integer = Regex(r'[+-]?\d+').setName("signed integer").setParseAction(convertToInteger)
-    """expression that parses an integer with optional leading sign, returns an int"""
-
-    fraction = (signed_integer().setParseAction(convertToFloat) + '/' + signed_integer().setParseAction(convertToFloat)).setName("fraction")
-    """fractional expression of an integer divided by an integer, returns a float"""
-    fraction.addParseAction(lambda t: t[0]/t[-1])
-
-    mixed_integer = (fraction | signed_integer + Optional(Optional('-').suppress() + fraction)).setName("fraction or mixed integer-fraction")
-    """mixed integer of the form 'integer - fraction', with optional leading integer, returns float"""
-    mixed_integer.addParseAction(sum)
-
-    real = Regex(r'[+-]?\d+\.\d*').setName("real number").setParseAction(convertToFloat)
-    """expression that parses a floating point number and returns a float"""
-
-    sci_real = Regex(r'[+-]?\d+([eE][+-]?\d+|\.\d*([eE][+-]?\d+)?)').setName("real number with scientific notation").setParseAction(convertToFloat)
-    """expression that parses a floating point number with optional scientific notation and returns a float"""
-
-    # streamlining this expression makes the docs nicer-looking
-    number = (sci_real | real | signed_integer).streamline()
-    """any numeric expression, returns the corresponding Python type"""
-
-    fnumber = Regex(r'[+-]?\d+\.?\d*([eE][+-]?\d+)?').setName("fnumber").setParseAction(convertToFloat)
-    """any int or real number, returned as float"""
-    
-    identifier = Word(alphas+'_', alphanums+'_').setName("identifier")
-    """typical code identifier (leading alpha or '_', followed by 0 or more alphas, nums, or '_')"""
-    
-    ipv4_address = Regex(r'(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})(\.(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})){3}').setName("IPv4 address")
-    "IPv4 address (C{0.0.0.0 - 255.255.255.255})"
-
-    _ipv6_part = Regex(r'[0-9a-fA-F]{1,4}').setName("hex_integer")
-    _full_ipv6_address = (_ipv6_part + (':' + _ipv6_part)*7).setName("full IPv6 address")
-    _short_ipv6_address = (Optional(_ipv6_part + (':' + _ipv6_part)*(0,6)) + "::" + Optional(_ipv6_part + (':' + _ipv6_part)*(0,6))).setName("short IPv6 address")
-    _short_ipv6_address.addCondition(lambda t: sum(1 for tt in t if pyparsing_common._ipv6_part.matches(tt)) < 8)
-    _mixed_ipv6_address = ("::ffff:" + ipv4_address).setName("mixed IPv6 address")
-    ipv6_address = Combine((_full_ipv6_address | _mixed_ipv6_address | _short_ipv6_address).setName("IPv6 address")).setName("IPv6 address")
-    "IPv6 address (long, short, or mixed form)"
-    
-    mac_address = Regex(r'[0-9a-fA-F]{2}([:.-])[0-9a-fA-F]{2}(?:\1[0-9a-fA-F]{2}){4}').setName("MAC address")
-    "MAC address xx:xx:xx:xx:xx (may also have '-' or '.' delimiters)"
-
-    @staticmethod
-    def convertToDate(fmt="%Y-%m-%d"):
-        """
-        Helper to create a parse action for converting parsed date string to Python datetime.date
-
-        Params -
-         - fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%d"})
-
-        Example::
-            date_expr = pyparsing_common.iso8601_date.copy()
-            date_expr.setParseAction(pyparsing_common.convertToDate())
-            print(date_expr.parseString("1999-12-31"))
-        prints::
-            [datetime.date(1999, 12, 31)]
-        """
-        def cvt_fn(s,l,t):
-            try:
-                return datetime.strptime(t[0], fmt).date()
-            except ValueError as ve:
-                raise ParseException(s, l, str(ve))
-        return cvt_fn
-
-    @staticmethod
-    def convertToDatetime(fmt="%Y-%m-%dT%H:%M:%S.%f"):
-        """
-        Helper to create a parse action for converting parsed datetime string to Python datetime.datetime
-
-        Params -
-         - fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%dT%H:%M:%S.%f"})
-
-        Example::
-            dt_expr = pyparsing_common.iso8601_datetime.copy()
-            dt_expr.setParseAction(pyparsing_common.convertToDatetime())
-            print(dt_expr.parseString("1999-12-31T23:59:59.999"))
-        prints::
-            [datetime.datetime(1999, 12, 31, 23, 59, 59, 999000)]
-        """
-        def cvt_fn(s,l,t):
-            try:
-                return datetime.strptime(t[0], fmt)
-            except ValueError as ve:
-                raise ParseException(s, l, str(ve))
-        return cvt_fn
-
-    iso8601_date = Regex(r'(?P<year>\d{4})(?:-(?P<month>\d\d)(?:-(?P<day>\d\d))?)?').setName("ISO8601 date")
-    "ISO8601 date (C{yyyy-mm-dd})"
-
-    iso8601_datetime = Regex(r'(?P<year>\d{4})-(?P<month>\d\d)-(?P<day>\d\d)[T ](?P<hour>\d\d):(?P<minute>\d\d)(:(?P<second>\d\d(\.\d*)?)?)?(?P<tz>Z|[+-]\d\d:?\d\d)?').setName("ISO8601 datetime")
-    "ISO8601 datetime (C{yyyy-mm-ddThh:mm:ss.s(Z|+-00:00)}) - trailing seconds, milliseconds, and timezone optional; accepts separating C{'T'} or C{' '}"
-
-    uuid = Regex(r'[0-9a-fA-F]{8}(-[0-9a-fA-F]{4}){3}-[0-9a-fA-F]{12}').setName("UUID")
-    "UUID (C{xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx})"
-
-    _html_stripper = anyOpenTag.suppress() | anyCloseTag.suppress()
-    @staticmethod
-    def stripHTMLTags(s, l, tokens):
-        """
-        Parse action to remove HTML tags from web page HTML source
-
-        Example::
-            # strip HTML links from normal text 
-            text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
-            td,td_end = makeHTMLTags("TD")
-            table_text = td + SkipTo(td_end).setParseAction(pyparsing_common.stripHTMLTags)("body") + td_end
-            
-            print(table_text.parseString(text).body) # -> 'More info at the pyparsing wiki page'
-        """
-        return pyparsing_common._html_stripper.transformString(tokens[0])
-
-    _commasepitem = Combine(OneOrMore(~Literal(",") + ~LineEnd() + Word(printables, excludeChars=',') 
-                                        + Optional( White(" \t") ) ) ).streamline().setName("commaItem")
-    comma_separated_list = delimitedList( Optional( quotedString.copy() | _commasepitem, default="") ).setName("comma separated list")
-    """Predefined expression of 1 or more printable words or quoted strings, separated by commas."""
-
-    upcaseTokens = staticmethod(tokenMap(lambda t: _ustr(t).upper()))
-    """Parse action to convert tokens to upper case."""
-
-    downcaseTokens = staticmethod(tokenMap(lambda t: _ustr(t).lower()))
-    """Parse action to convert tokens to lower case."""
-
-
-if __name__ == "__main__":
-
-    selectToken    = CaselessLiteral("select")
-    fromToken      = CaselessLiteral("from")
-
-    ident          = Word(alphas, alphanums + "_$")
-
-    columnName     = delimitedList(ident, ".", combine=True).setParseAction(upcaseTokens)
-    columnNameList = Group(delimitedList(columnName)).setName("columns")
-    columnSpec     = ('*' | columnNameList)
-
-    tableName      = delimitedList(ident, ".", combine=True).setParseAction(upcaseTokens)
-    tableNameList  = Group(delimitedList(tableName)).setName("tables")
-    
-    simpleSQL      = selectToken("command") + columnSpec("columns") + fromToken + tableNameList("tables")
-
-    # demo runTests method, including embedded comments in test string
-    simpleSQL.runTests("""
-        # '*' as column list and dotted table name
-        select * from SYS.XYZZY
-
-        # caseless match on "SELECT", and casts back to "select"
-        SELECT * from XYZZY, ABC
-
-        # list of column names, and mixed case SELECT keyword
-        Select AA,BB,CC from Sys.dual
-
-        # multiple tables
-        Select A, B, C from Sys.dual, Table2
-
-        # invalid SELECT keyword - should fail
-        Xelect A, B, C from Sys.dual
-
-        # incomplete command - should fail
-        Select
-
-        # invalid column name - should fail
-        Select ^^^ frox Sys.dual
-
-        """)
-
-    pyparsing_common.number.runTests("""
-        100
-        -100
-        +100
-        3.14159
-        6.02e23
-        1e-12
-        """)
-
-    # any int or real number, returned as float
-    pyparsing_common.fnumber.runTests("""
-        100
-        -100
-        +100
-        3.14159
-        6.02e23
-        1e-12
-        """)
-
-    pyparsing_common.hex_integer.runTests("""
-        100
-        FF
-        """)
-
-    import uuid
-    pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
-    pyparsing_common.uuid.runTests("""
-        12345678-1234-5678-1234-567812345678
-        """)
diff --git a/doc/tutorial/machine_learning_map/svg2imagemap.py b/doc/tutorial/machine_learning_map/svg2imagemap.py
deleted file mode 100644
index 80f06c8fb9738..0000000000000
--- a/doc/tutorial/machine_learning_map/svg2imagemap.py
+++ /dev/null
@@ -1,111 +0,0 @@
-#!/usr/local/bin/python
-
-"""
-This script converts a subset of SVG into an HTML imagemap
-
-Note *subset*.  It only handles <path> elements, for which it only pays
-attention to the M and L commands.  Further, it only notices the "translate"
-transform.
-
-It was written to generate the examples in the documentation for maphilight,
-and thus is very squarely aimed at handling several SVG maps from wikipedia.
-It *assumes* that all the <path>s it will need are inside a <g>.  Any <path>
-outside of a <g> will be ignored.
-
-It takes several possible arguments, in the form:
-$ svn2imagemap.py FILENAME [x y [group1 group2 ... groupN]]
-
-FILENAME must be the name of an SVG file.  All other arguments are optional.
-
-x and y, if present, are the dimensions of the image you'll be creating from
-the SVG.  If not present, it assumes the values of the width and height
-attributes in the SVG file.
-
-group1 through groupN are group ids.  If only want particular groups used,
-enter their ids here and all others will be ignored.
-"""
-import os
-import re
-import sys
-import xml.dom.minidom
-
-import parse_path
-
-if len(sys.argv) == 1:
-    sys.exit("svn2imagemap.py FILENAME [x y [group1 group2 ... groupN]]")
-if not os.path.exists(sys.argv[1]):
-    sys.exit("Input file does not exist")
-x, y, groups = None, None, None
-if len(sys.argv) >= 3:
-    x = float(sys.argv[2])
-    y = float(sys.argv[3])
-    if len(sys.argv) > 3:
-        groups = sys.argv[4:]
-
-svg_file = xml.dom.minidom.parse(sys.argv[1])
-svg = svg_file.getElementsByTagName("svg")[0]
-
-raw_width = float(svg.getAttribute("width"))
-raw_height = float(svg.getAttribute("height"))
-width_ratio = x and (x / raw_width) or 1
-height_ratio = y and (y / raw_height) or 1
-
-if groups:
-    elements = [
-        g
-        for g in svg.getElementsByTagName("g")
-        if (g.hasAttribute("id") and g.getAttribute("id") in groups)
-    ]
-    elements.extend(
-        [
-            p
-            for p in svg.getElementsByTagName("path")
-            if (p.hasAttribute("id") and p.getAttribute("id") in groups)
-        ]
-    )
-else:
-    elements = svg.getElementsByTagName("g")
-
-parsed_groups = {}
-for e in elements:
-    paths = []
-    if e.nodeName == "g":
-        for path in e.getElementsByTagName("path"):
-            points = parse_path.get_points(path.getAttribute("d"))
-            for pointset in points:
-                paths.append([path.getAttribute("id"), pointset])
-    else:
-        points = parse_path.get_points(e.getAttribute("d"))
-        for pointset in points:
-            paths.append([e.getAttribute("id"), pointset])
-    if e.hasAttribute("transform"):
-        print(e.getAttribute("id"), e.getAttribute("transform"))
-        for transform in re.findall(
-            r"(\w+)\((-?\d+.?\d*),(-?\d+.?\d*)\)", e.getAttribute("transform")
-        ):
-            if transform[0] == "translate":
-                x_shift = float(transform[1])
-                y_shift = float(transform[2])
-                for path in paths:
-                    path[1] = [(p[0] + x_shift, p[1] + y_shift) for p in path[1]]
-
-    parsed_groups[e.getAttribute("id")] = paths
-
-out = []
-for g in parsed_groups:
-    for path in parsed_groups[g]:
-        out.append(
-            '<area href="#" title="%s" shape="poly" coords="%s"></area>'
-            % (
-                path[0],
-                ", ".join(
-                    [
-                        "%d,%d" % (p[0] * width_ratio, p[1] * height_ratio)
-                        for p in path[1]
-                    ]
-                ),
-            )
-        )
-
-with open(sys.argv[1].replace(".svg", ".html"), "w") as f:
-    f.write("\n".join(out))
diff --git a/doc/tutorial/statistical_inference/index.rst b/doc/tutorial/statistical_inference/index.rst
deleted file mode 100644
index 1ea527054fc38..0000000000000
--- a/doc/tutorial/statistical_inference/index.rst
+++ /dev/null
@@ -1,36 +0,0 @@
-.. _stat_learn_tut_index:
-
-==========================================================================
-A tutorial on statistical-learning for scientific data processing
-==========================================================================
-
-.. topic:: Statistical learning 
-
-    `Machine learning <https://en.wikipedia.org/wiki/Machine_learning>`_ is
-    a technique with a growing importance, as the
-    size of the datasets experimental sciences are facing is rapidly
-    growing. Problems it tackles range from building a prediction function
-    linking different observations, to classifying observations, or
-    learning the structure in an unlabeled dataset. 
-    
-    This tutorial will explore *statistical learning*, the use of
-    machine learning techniques with the goal of `statistical inference 
-    <https://en.wikipedia.org/wiki/Statistical_inference>`_:
-    drawing conclusions on the data at hand.
-
-    Scikit-learn is a Python module integrating classic machine
-    learning algorithms in the tightly-knit world of scientific Python
-    packages (`NumPy <https://www.numpy.org/>`_, `SciPy
-    <https://scipy.org/>`_, `matplotlib
-    <https://matplotlib.org/>`_).
-
-.. include:: ../../includes/big_toc_css.rst
-
-.. toctree::
-   :maxdepth: 2
-
-   settings
-   supervised_learning
-   model_selection
-   unsupervised_learning
-   putting_together
diff --git a/doc/tutorial/statistical_inference/model_selection.rst b/doc/tutorial/statistical_inference/model_selection.rst
deleted file mode 100644
index 87423ef1c3925..0000000000000
--- a/doc/tutorial/statistical_inference/model_selection.rst
+++ /dev/null
@@ -1,318 +0,0 @@
-.. _model_selection_tut:
-
-============================================================
-Model selection: choosing estimators and their parameters
-============================================================
-
-Score, and cross-validated scores
-==================================
-
-As we have seen, every estimator exposes a ``score`` method that can judge
-the quality of the fit (or the prediction) on new data. **Bigger is
-better**.
-
-::
-
-    >>> from sklearn import datasets, svm
-    >>> X_digits, y_digits = datasets.load_digits(return_X_y=True)
-    >>> svc = svm.SVC(C=1, kernel='linear')
-    >>> svc.fit(X_digits[:-100], y_digits[:-100]).score(X_digits[-100:], y_digits[-100:])
-    0.98
-
-To get a better measure of prediction accuracy (which we can use as a
-proxy for goodness of fit of the model), we can successively split the
-data in *folds* that we use for training and testing::
-
-    >>> import numpy as np
-    >>> X_folds = np.array_split(X_digits, 3)
-    >>> y_folds = np.array_split(y_digits, 3)
-    >>> scores = list()
-    >>> for k in range(3):
-    ...     # We use 'list' to copy, in order to 'pop' later on
-    ...     X_train = list(X_folds)
-    ...     X_test = X_train.pop(k)
-    ...     X_train = np.concatenate(X_train)
-    ...     y_train = list(y_folds)
-    ...     y_test = y_train.pop(k)
-    ...     y_train = np.concatenate(y_train)
-    ...     scores.append(svc.fit(X_train, y_train).score(X_test, y_test))
-    >>> print(scores)
-    [0.934..., 0.956..., 0.939...]
-
-.. currentmodule:: sklearn.model_selection
-
-This is called a :class:`KFold` cross-validation.
-
-.. _cv_generators_tut:
-
-Cross-validation generators
-=============================
-
-Scikit-learn has a collection of classes which can be used to generate lists of
-train/test indices for popular cross-validation strategies.
-
-They expose a ``split`` method which accepts the input
-dataset to be split and yields the train/test set indices for each iteration
-of the chosen cross-validation strategy.
-
-This example shows an example usage of the ``split`` method.
-
-    >>> from sklearn.model_selection import KFold, cross_val_score
-    >>> X = ["a", "a", "a", "b", "b", "c", "c", "c", "c", "c"]
-    >>> k_fold = KFold(n_splits=5)
-    >>> for train_indices, test_indices in k_fold.split(X):
-    ...      print('Train: %s | test: %s' % (train_indices, test_indices))
-    Train: [2 3 4 5 6 7 8 9] | test: [0 1]
-    Train: [0 1 4 5 6 7 8 9] | test: [2 3]
-    Train: [0 1 2 3 6 7 8 9] | test: [4 5]
-    Train: [0 1 2 3 4 5 8 9] | test: [6 7]
-    Train: [0 1 2 3 4 5 6 7] | test: [8 9]
-
-The cross-validation can then be performed easily::
-
-    >>> [svc.fit(X_digits[train], y_digits[train]).score(X_digits[test], y_digits[test])
-    ...  for train, test in k_fold.split(X_digits)]
-    [0.963..., 0.922..., 0.963..., 0.963..., 0.930...]
-
-The cross-validation score can be directly calculated using the
-:func:`cross_val_score` helper. Given an estimator, the cross-validation object
-and the input dataset, the :func:`cross_val_score` splits the data repeatedly into
-a training and a testing set, trains the estimator using the training set and
-computes the scores based on the testing set for each iteration of cross-validation.
-
-By default the estimator's ``score`` method is used to compute the individual scores.
-
-Refer the :ref:`metrics module <metrics>` to learn more on the available scoring
-methods.
-
-    >>> cross_val_score(svc, X_digits, y_digits, cv=k_fold, n_jobs=-1)
-    array([0.96388889, 0.92222222, 0.9637883 , 0.9637883 , 0.93036212])
-
-`n_jobs=-1` means that the computation will be dispatched on all the CPUs
-of the computer.
-
-Alternatively, the ``scoring`` argument can be provided to specify an alternative
-scoring method.
-
-    >>> cross_val_score(svc, X_digits, y_digits, cv=k_fold,
-    ...                 scoring='precision_macro')
-    array([0.96578289, 0.92708922, 0.96681476, 0.96362897, 0.93192644])
-
-**Cross-validation generators**
-
-
-.. list-table::
-
-   *
-
-    - :class:`KFold` **(n_splits, shuffle, random_state)**
-
-    - :class:`StratifiedKFold` **(n_splits, shuffle, random_state)**
-
-    - :class:`GroupKFold` **(n_splits)**
-
-
-   *
-
-    - Splits it into K folds, trains on K-1 and then tests on the left-out.
-
-    - Same as K-Fold but preserves the class distribution within each fold.
-
-    - Ensures that the same group is not in both testing and training sets.
-
-
-.. list-table::
-
-   *
-
-    - :class:`ShuffleSplit` **(n_splits, test_size, train_size, random_state)**
-
-    - :class:`StratifiedShuffleSplit`
-
-    - :class:`GroupShuffleSplit`
-
-   *
-
-    - Generates train/test indices based on random permutation.
-
-    - Same as shuffle split but preserves the class distribution within each iteration.
-
-    - Ensures that the same group is not in both testing and training sets.
-
-
-.. list-table::
-
-   *
-
-    - :class:`LeaveOneGroupOut` **()**
-
-    - :class:`LeavePGroupsOut`  **(n_groups)**
-
-    - :class:`LeaveOneOut` **()**
-
-
-
-   *
-
-    - Takes a group array to group observations.
-
-    - Leave P groups out.
-
-    - Leave one observation out.
-
-
-
-.. list-table::
-
-   *
-
-    - :class:`LeavePOut` **(p)**
-
-    - :class:`PredefinedSplit`
-
-   *
-
-    - Leave P observations out.
-
-    - Generates train/test indices based on predefined splits.
-
-
-.. currentmodule:: sklearn.svm
-
-.. topic:: **Exercise**
-
-    On the digits dataset, plot the cross-validation score of a :class:`SVC`
-    estimator with a linear kernel as a function of parameter ``C`` (use a
-    logarithmic grid of points, from 1 to 10).
-
-    ::
-
-        >>> import numpy as np
-        >>> from sklearn import datasets, svm
-        >>> from sklearn.model_selection import cross_val_score
-        >>> X, y = datasets.load_digits(return_X_y=True)
-        >>> svc = svm.SVC(kernel="linear")
-        >>> C_s = np.logspace(-10, 0, 10)
-        >>> scores = list()
-        >>> scores_std = list()
-
-    |details-start|
-    **Solution**
-    |details-split|
-
-    .. plot::
-        :context: close-figs
-        :align: center
-
-        import numpy as np
-        from sklearn import datasets, svm
-        from sklearn.model_selection import cross_val_score
-        X, y = datasets.load_digits(return_X_y=True)
-        svc = svm.SVC(kernel="linear")
-        C_s = np.logspace(-10, 0, 10)
-        scores = list()
-        scores_std = list()
-        for C in C_s:
-            svc.C = C
-            this_scores = cross_val_score(svc, X, y, n_jobs=1)
-            scores.append(np.mean(this_scores))
-            scores_std.append(np.std(this_scores))
-
-        import matplotlib.pyplot as plt
-
-        plt.figure()
-        plt.semilogx(C_s, scores)
-        plt.semilogx(C_s, np.array(scores) + np.array(scores_std), "b--")
-        plt.semilogx(C_s, np.array(scores) - np.array(scores_std), "b--")
-        locs, labels = plt.yticks()
-        plt.yticks(locs, list(map(lambda x: "%g" % x, locs)))
-        plt.ylabel("CV score")
-        plt.xlabel("Parameter C")
-        plt.ylim(0, 1.1)
-        plt.show()
-    |details-end|
-
-Grid-search and cross-validated estimators
-============================================
-
-Grid-search
--------------
-
-.. currentmodule:: sklearn.model_selection
-
-scikit-learn provides an object that, given data, computes the score
-during the fit of an estimator on a parameter grid and chooses the
-parameters to maximize the cross-validation score. This object takes an
-estimator during the construction and exposes an estimator API::
-
-    >>> from sklearn.model_selection import GridSearchCV, cross_val_score
-    >>> Cs = np.logspace(-6, -1, 10)
-    >>> clf = GridSearchCV(estimator=svc, param_grid=dict(C=Cs),
-    ...                    n_jobs=-1)
-    >>> clf.fit(X_digits[:1000], y_digits[:1000])        # doctest: +SKIP
-    GridSearchCV(cv=None,...
-    >>> clf.best_score_                                  # doctest: +SKIP
-    0.925...
-    >>> clf.best_estimator_.C                            # doctest: +SKIP
-    0.0077...
-
-    >>> # Prediction performance on test set is not as good as on train set
-    >>> clf.score(X_digits[1000:], y_digits[1000:])      # doctest: +SKIP
-    0.943...
-
-
-By default, the :class:`GridSearchCV` uses a 5-fold cross-validation. However,
-if it detects that a classifier is passed, rather than a regressor, it uses
-a stratified 5-fold.
-
-.. topic:: Nested cross-validation
-
-    ::
-
-        >>> cross_val_score(clf, X_digits, y_digits) # doctest: +SKIP
-        array([0.938..., 0.963..., 0.944...])
-
-    Two cross-validation loops are performed in parallel: one by the
-    :class:`GridSearchCV` estimator to set ``gamma`` and the other one by
-    ``cross_val_score`` to measure the prediction performance of the
-    estimator. The resulting scores are unbiased estimates of the
-    prediction score on new data.
-
-.. warning::
-
-    You cannot nest objects with parallel computing (``n_jobs`` different
-    than 1).
-
-.. _cv_estimators_tut:
-
-Cross-validated estimators
-----------------------------
-
-Cross-validation to set a parameter can be done more efficiently on an
-algorithm-by-algorithm basis. This is why, for certain estimators,
-scikit-learn exposes :ref:`cross_validation` estimators that set their
-parameter automatically by cross-validation::
-
-    >>> from sklearn import linear_model, datasets
-    >>> lasso = linear_model.LassoCV()
-    >>> X_diabetes, y_diabetes = datasets.load_diabetes(return_X_y=True)
-    >>> lasso.fit(X_diabetes, y_diabetes)
-    LassoCV()
-    >>> # The estimator chose automatically its lambda:
-    >>> lasso.alpha_
-    0.00375...
-
-These estimators are called similarly to their counterparts, with 'CV'
-appended to their name.
-
-.. topic:: **Exercise**
-
-   On the diabetes dataset, find the optimal regularization parameter
-   alpha.
-
-   **Bonus**: How much can you trust the selection of alpha?
-
-   .. literalinclude:: ../../auto_examples/exercises/plot_cv_diabetes.py
-       :lines: 17-24
-
-   **Solution:** :ref:`sphx_glr_auto_examples_exercises_plot_cv_diabetes.py`
diff --git a/doc/tutorial/statistical_inference/putting_together.rst b/doc/tutorial/statistical_inference/putting_together.rst
deleted file mode 100644
index b28ba77bfac33..0000000000000
--- a/doc/tutorial/statistical_inference/putting_together.rst
+++ /dev/null
@@ -1,62 +0,0 @@
-=========================
-Putting it all together
-=========================
-
-..  Imports
-    >>> import numpy as np
-
-Pipelining
-============
-
-We have seen that some estimators can transform data and that some estimators
-can predict variables. We can also create combined estimators:
-
-.. literalinclude:: ../../auto_examples/compose/plot_digits_pipe.py
-    :lines: 23-63
-
-.. image:: ../../auto_examples/compose/images/sphx_glr_plot_digits_pipe_001.png
-   :target: ../../auto_examples/compose/plot_digits_pipe.html
-   :scale: 65
-   :align: center
-
-Face recognition with eigenfaces
-=================================
-
-The dataset used in this example is a preprocessed excerpt of the
-"Labeled Faces in the Wild", also known as LFW_:
-
-http://vis-www.cs.umass.edu/lfw/lfw-funneled.tgz (233MB)
-
-.. _LFW: http://vis-www.cs.umass.edu/lfw/
-
-.. literalinclude:: ../../auto_examples/applications/plot_face_recognition.py
-
-.. figure:: ../../images/plot_face_recognition_1.png
-   :scale: 50
-
-   **Prediction**
-
-.. figure:: ../../images/plot_face_recognition_2.png
-   :scale: 50
-
-   **Eigenfaces**
-
-Expected results for the top 5 most represented people in the dataset::
-
-                     precision    recall  f1-score   support
-
-  Gerhard_Schroeder       0.91      0.75      0.82        28
-    Donald_Rumsfeld       0.84      0.82      0.83        33
-         Tony_Blair       0.65      0.82      0.73        34
-       Colin_Powell       0.78      0.88      0.83        58
-      George_W_Bush       0.93      0.86      0.90       129
-
-        avg / total       0.86      0.84      0.85       282
-
-
-Open problem: Stock Market Structure
-=====================================
-
-Can we predict the variation in stock prices for Google over a given time frame?
-
-:ref:`stock_market`
diff --git a/doc/tutorial/statistical_inference/settings.rst b/doc/tutorial/statistical_inference/settings.rst
deleted file mode 100644
index 422972fbd6cb4..0000000000000
--- a/doc/tutorial/statistical_inference/settings.rst
+++ /dev/null
@@ -1,92 +0,0 @@
-
-==========================================================================
-Statistical learning: the setting and the estimator object in scikit-learn
-==========================================================================
-
-Datasets
-=========
-
-Scikit-learn deals with learning information from one or more
-datasets that are represented as 2D arrays. They can be understood as a
-list of multi-dimensional observations. We say that the first axis of
-these arrays is the **samples** axis, while the second is the
-**features** axis.
-
-.. topic:: A simple example shipped with scikit-learn: iris dataset
-
-    ::
-
-        >>> from sklearn import datasets
-        >>> iris = datasets.load_iris()
-        >>> data = iris.data
-        >>> data.shape
-        (150, 4)
-
-    It is made of 150 observations of irises, each described by 4
-    features: their sepal and petal length and width, as detailed in
-    ``iris.DESCR``.
-
-When the data is not initially in the ``(n_samples, n_features)`` shape, it
-needs to be preprocessed in order to be used by scikit-learn.
-
-.. topic:: An example of reshaping data would be the digits dataset
-
-    The digits dataset is made of 1797 8x8 images of hand-written
-    digits ::
-
-        >>> digits = datasets.load_digits()
-        >>> digits.images.shape
-        (1797, 8, 8)
-        >>> import matplotlib.pyplot as plt
-        >>> plt.imshow(digits.images[-1],
-        ...            cmap=plt.cm.gray_r)
-        <...>
-    
-    .. image:: /auto_examples/datasets/images/sphx_glr_plot_digits_last_image_001.png
-        :target: ../../auto_examples/datasets/plot_digits_last_image.html
-        :align: center
-
-    To use this dataset with scikit-learn, we transform each 8x8 image into a
-    feature vector of length 64 ::
-
-        >>> data = digits.images.reshape(
-        ...     (digits.images.shape[0], -1)
-        ... )
-
-Estimators objects
-===================
-
-.. Some code to make the doctests run
-
-   >>> from sklearn.base import BaseEstimator
-   >>> class Estimator(BaseEstimator):
-   ...      def __init__(self, param1=0, param2=0):
-   ...          self.param1 = param1
-   ...          self.param2 = param2
-   ...      def fit(self, data):
-   ...          pass
-   >>> estimator = Estimator()
-
-**Fitting data**: the main API implemented by scikit-learn is that of the
-`estimator`. An estimator is any object that learns from data;
-it may be a classification, regression or clustering algorithm or
-a *transformer* that extracts/filters useful features from raw data.
-
-All estimator objects expose a ``fit`` method that takes a dataset
-(usually a 2-d array):
-
-    >>> estimator.fit(data)
-
-**Estimator parameters**: All the parameters of an estimator can be set
-when it is instantiated or by modifying the corresponding attribute::
-
-    >>> estimator = Estimator(param1=1, param2=2)
-    >>> estimator.param1
-    1
-
-**Estimated parameters**: When data is fitted with an estimator,
-parameters are estimated from the data at hand. All the estimated
-parameters are attributes of the estimator object ending by an
-underscore::
-
-    >>> estimator.estimated_param_ #doctest: +SKIP
diff --git a/doc/tutorial/statistical_inference/supervised_learning.rst b/doc/tutorial/statistical_inference/supervised_learning.rst
deleted file mode 100644
index 45fc4cf5b9bc0..0000000000000
--- a/doc/tutorial/statistical_inference/supervised_learning.rst
+++ /dev/null
@@ -1,535 +0,0 @@
-.. _supervised_learning_tut:
-
-=======================================================================================
-Supervised learning: predicting an output variable from high-dimensional observations
-=======================================================================================
-
-
-.. topic:: The problem solved in supervised learning
-
-   :ref:`Supervised learning <supervised-learning>`
-   consists in learning the link between two
-   datasets: the observed data ``X`` and an external variable ``y`` that we
-   are trying to predict, usually called "target" or "labels". Most often,
-   ``y`` is a 1D array of length ``n_samples``.
-
-   All supervised `estimators <https://en.wikipedia.org/wiki/Estimator>`_
-   in scikit-learn implement a ``fit(X, y)`` method to fit the model
-   and a ``predict(X)`` method that, given unlabeled observations ``X``,
-   returns the predicted labels ``y``.
-
-.. topic:: Vocabulary: classification and regression
-
-   If the prediction task is to classify the observations in a set of
-   finite labels, in other words to "name" the objects observed, the task
-   is said to be a **classification** task. On the other hand, if the goal
-   is to predict a continuous target variable, it is said to be a
-   **regression** task.
-
-   When doing classification in scikit-learn, ``y`` is a vector of integers
-   or strings.
-
-   Note: See the :ref:`Introduction to machine learning with scikit-learn
-   Tutorial <introduction>` for a quick run-through on the basic machine
-   learning vocabulary used within scikit-learn.
-
-Nearest neighbor and the curse of dimensionality
-=================================================
-
-.. topic:: Classifying irises:
-
-    The iris dataset is a classification task consisting in identifying 3
-    different types of irises (Setosa, Versicolour, and Virginica) from
-    their petal and sepal length and width::
-
-        >>> import numpy as np
-        >>> from sklearn import datasets
-        >>> iris_X, iris_y = datasets.load_iris(return_X_y=True)
-        >>> np.unique(iris_y)
-        array([0, 1, 2])
-
-    .. image:: /auto_examples/datasets/images/sphx_glr_plot_iris_dataset_001.png
-        :target: ../../auto_examples/datasets/plot_iris_dataset.html
-        :align: center
-	:scale: 50
-
-k-Nearest neighbors classifier
--------------------------------
-
-The simplest possible classifier is the
-`nearest neighbor <https://en.wikipedia.org/wiki/K-nearest_neighbor_algorithm>`_:
-given a new observation ``X_test``, find in the training set (i.e. the data
-used to train the estimator) the observation with the closest feature vector.
-(Please see the :ref:`Nearest Neighbors section<neighbors>` of the online
-Scikit-learn documentation for more information about this type of classifier.)
-
-.. topic:: Training set and testing set
-
-   While experimenting with any learning algorithm, it is important not to
-   test the prediction of an estimator on the data used to fit the
-   estimator as this would not be evaluating the performance of the
-   estimator on **new data**. This is why datasets are often split into
-   *train* and *test* data.
-
-**KNN (k nearest neighbors) classification example**:
-
-.. image:: /auto_examples/neighbors/images/sphx_glr_plot_classification_001.png
-   :target: ../../auto_examples/neighbors/plot_classification.html
-   :align: center
-   :scale: 70
-
-::
-
-    >>> # Split iris data in train and test data
-    >>> # A random permutation, to split the data randomly
-    >>> np.random.seed(0)
-    >>> indices = np.random.permutation(len(iris_X))
-    >>> iris_X_train = iris_X[indices[:-10]]
-    >>> iris_y_train = iris_y[indices[:-10]]
-    >>> iris_X_test = iris_X[indices[-10:]]
-    >>> iris_y_test = iris_y[indices[-10:]]
-    >>> # Create and fit a nearest-neighbor classifier
-    >>> from sklearn.neighbors import KNeighborsClassifier
-    >>> knn = KNeighborsClassifier()
-    >>> knn.fit(iris_X_train, iris_y_train)
-    KNeighborsClassifier()
-    >>> knn.predict(iris_X_test)
-    array([1, 2, 1, 0, 0, 0, 2, 1, 2, 0])
-    >>> iris_y_test
-    array([1, 1, 1, 0, 0, 0, 2, 1, 2, 0])
-
-.. _curse_of_dimensionality:
-
-The curse of dimensionality
--------------------------------
-
-For an estimator to be effective, you need the distance between neighboring
-points to be less than some value :math:`d`, which depends on the problem.
-In one dimension, this requires on average :math:`n \sim 1/d` points.
-In the context of the above :math:`k`-NN example, if the data is described by
-just one feature with values ranging from 0 to 1 and with :math:`n` training
-observations, then new data will be no further away than :math:`1/n`.
-Therefore, the nearest neighbor decision rule will be efficient as soon as
-:math:`1/n` is small compared to the scale of between-class feature variations.
-
-If the number of features is :math:`p`, you now require :math:`n \sim 1/d^p`
-points.  Let's say that we require 10 points in one dimension: now :math:`10^p`
-points are required in :math:`p` dimensions to pave the :math:`[0, 1]` space.
-As :math:`p` becomes large, the number of training points required for a good
-estimator grows exponentially.
-
-For example, if each point is just a single number (8 bytes), then an
-effective :math:`k`-NN estimator in a paltry :math:`p \sim 20` dimensions would
-require more training data than the current estimated size of the entire
-internet (±1000 Exabytes or so).
-
-This is called the
-`curse of dimensionality  <https://en.wikipedia.org/wiki/Curse_of_dimensionality>`_
-and is a core problem that machine learning addresses.
-
-Linear model: from regression to sparsity
-==========================================
-
-.. topic:: Diabetes dataset
-
-    The diabetes dataset consists of 10 physiological variables (age,
-    sex, weight, blood pressure) measured on 442 patients, and an
-    indication of disease progression after one year::
-
-        >>> diabetes_X, diabetes_y = datasets.load_diabetes(return_X_y=True)
-        >>> diabetes_X_train = diabetes_X[:-20]
-        >>> diabetes_X_test  = diabetes_X[-20:]
-        >>> diabetes_y_train = diabetes_y[:-20]
-        >>> diabetes_y_test  = diabetes_y[-20:]
-
-    The task at hand is to predict disease progression from physiological
-    variables.
-
-Linear regression
-------------------
-
-.. currentmodule:: sklearn.linear_model
-
-:class:`LinearRegression`,
-in its simplest form, fits a linear model to the data set by adjusting
-a set of parameters in order to make the sum of the squared residuals
-of the model as small as possible.
-
-Linear models: :math:`y = X\beta + \epsilon`
-
-* :math:`X`: data
-* :math:`y`: target variable
-* :math:`\beta`: Coefficients
-* :math:`\epsilon`: Observation noise
-
-.. image:: /auto_examples/linear_model/images/sphx_glr_plot_ols_001.png
-   :target: ../../auto_examples/linear_model/plot_ols.html
-   :scale: 50
-   :align: center
-
-::
-
-    >>> from sklearn import linear_model
-    >>> regr = linear_model.LinearRegression()
-    >>> regr.fit(diabetes_X_train, diabetes_y_train)
-    LinearRegression()
-    >>> print(regr.coef_) # doctest: +SKIP
-    [   0.30349955 -237.63931533  510.53060544  327.73698041 -814.13170937
-      492.81458798  102.84845219  184.60648906  743.51961675   76.09517222]
-
-
-    >>> # The mean square error
-    >>> np.mean((regr.predict(diabetes_X_test) - diabetes_y_test)**2)
-    2004.5...
-
-    >>> # Explained variance score: 1 is perfect prediction
-    >>> # and 0 means that there is no linear relationship
-    >>> # between X and y.
-    >>> regr.score(diabetes_X_test, diabetes_y_test)
-    0.585...
-
-
-.. _shrinkage:
-
-Shrinkage
-----------
-
-If there are few data points per dimension, noise in the observations
-induces high variance:
-
-::
-
-    >>> X = np.c_[ .5, 1].T
-    >>> y = [.5, 1]
-    >>> test = np.c_[ 0, 2].T
-    >>> regr = linear_model.LinearRegression()
-
-    >>> import matplotlib.pyplot as plt
-    >>> plt.figure()
-    <...>
-    >>> np.random.seed(0)
-    >>> for _ in range(6):
-    ...     this_X = .1 * np.random.normal(size=(2, 1)) + X
-    ...     regr.fit(this_X, y)
-    ...     plt.plot(test, regr.predict(test))
-    ...     plt.scatter(this_X, y, s=3)
-    LinearRegression...
-
-.. image:: /auto_examples/linear_model/images/sphx_glr_plot_ols_ridge_variance_001.png
-   :target: ../../auto_examples/linear_model/plot_ols_ridge_variance.html
-   :align: center
-
-A solution in high-dimensional statistical learning is to *shrink* the
-regression coefficients to zero: any two randomly chosen set of
-observations are likely to be uncorrelated. This is called :class:`Ridge`
-regression:
-
-::
-
-    >>> regr = linear_model.Ridge(alpha=.1)
-
-    >>> plt.figure()
-    <...>
-    >>> np.random.seed(0)
-    >>> for _ in range(6):
-    ...     this_X = .1 * np.random.normal(size=(2, 1)) + X
-    ...     regr.fit(this_X, y)
-    ...     plt.plot(test, regr.predict(test))
-    ...     plt.scatter(this_X, y, s=3)
-    Ridge...
-
-.. image:: /auto_examples/linear_model/images/sphx_glr_plot_ols_ridge_variance_002.png
-   :target: ../../auto_examples/linear_model/plot_ols_ridge_variance.html
-   :align: center
-
-This is an example of **bias/variance tradeoff**: the larger the ridge
-``alpha`` parameter, the higher the bias and the lower the variance.
-
-We can choose ``alpha`` to minimize left out error, this time using the
-diabetes dataset rather than our synthetic data::
-
-    >>> alphas = np.logspace(-4, -1, 6)
-    >>> print([regr.set_params(alpha=alpha)
-    ...            .fit(diabetes_X_train, diabetes_y_train)
-    ...            .score(diabetes_X_test, diabetes_y_test)
-    ...        for alpha in alphas])
-    [0.585..., 0.585..., 0.5854..., 0.5855..., 0.583..., 0.570...]
-
-
-.. note::
-
-    Capturing in the fitted parameters noise that prevents the model to
-    generalize to new data is called
-    `overfitting <https://en.wikipedia.org/wiki/Overfitting>`_. The bias introduced
-    by the ridge regression is called a
-    `regularization <https://en.wikipedia.org/wiki/Regularization_%28machine_learning%29>`_.
-
-.. _sparsity:
-
-Sparsity
-----------
-
-
-.. |diabetes_ols_1| image:: /auto_examples/linear_model/images/sphx_glr_plot_ols_3d_001.png
-   :target: ../../auto_examples/linear_model/plot_ols_3d.html
-   :scale: 65
-
-.. |diabetes_ols_3| image:: /auto_examples/linear_model/images/sphx_glr_plot_ols_3d_003.png
-   :target: ../../auto_examples/linear_model/plot_ols_3d.html
-   :scale: 65
-
-.. |diabetes_ols_2| image:: /auto_examples/linear_model/images/sphx_glr_plot_ols_3d_002.png
-   :target: ../../auto_examples/linear_model/plot_ols_3d.html
-   :scale: 65
-
-
-
-
-.. rst-class:: centered
-
-    **Fitting only features 1 and 2**
-
-.. centered:: |diabetes_ols_1| |diabetes_ols_3| |diabetes_ols_2|
-
-.. note::
-
-   A representation of the full diabetes dataset would involve 11
-   dimensions (10 feature dimensions and one of the target variable). It
-   is hard to develop an intuition on such representation, but it may be
-   useful to keep in mind that it would be a fairly *empty* space.
-
-
-
-We can see that, although feature 2 has a strong coefficient on the full
-model, it conveys little information on ``y`` when considered with feature 1.
-
-To improve the conditioning of the problem (i.e. mitigating the
-:ref:`curse_of_dimensionality`), it would be interesting to select only the
-informative features and set non-informative ones, like feature 2 to 0. Ridge
-regression will decrease their contribution, but not set them to zero. Another
-penalization approach, called :ref:`lasso` (least absolute shrinkage and
-selection operator), can set some coefficients to zero. Such methods are
-called **sparse methods** and sparsity can be seen as an
-application of Occam's razor: *prefer simpler models*.
-
-::
-
-    >>> regr = linear_model.Lasso()
-    >>> scores = [regr.set_params(alpha=alpha)
-    ...               .fit(diabetes_X_train, diabetes_y_train)
-    ...               .score(diabetes_X_test, diabetes_y_test)
-    ...           for alpha in alphas]
-    >>> best_alpha = alphas[scores.index(max(scores))]
-    >>> regr.alpha = best_alpha
-    >>> regr.fit(diabetes_X_train, diabetes_y_train)
-    Lasso(alpha=0.025118864315095794)
-    >>> print(regr.coef_)
-    [   0.         -212.4...   517.2...  313.7... -160.8...
-       -0.         -187.1...   69.3...  508.6...   71.8... ]
-
-.. topic:: **Different algorithms for the same problem**
-
-    Different algorithms can be used to solve the same mathematical
-    problem. For instance the ``Lasso`` object in scikit-learn
-    solves the lasso regression problem using a
-    `coordinate descent <https://en.wikipedia.org/wiki/Coordinate_descent>`_ method,
-    that is efficient on large datasets. However, scikit-learn also
-    provides the :class:`LassoLars` object using the *LARS* algorithm,
-    which is very efficient for problems in which the weight vector estimated
-    is very sparse (i.e. problems with very few observations).
-
-.. _clf_tut:
-
-Classification
----------------
-
-For classification, as in the labeling
-`iris <https://en.wikipedia.org/wiki/Iris_flower_data_set>`_ task, linear
-regression is not the right approach as it will give too much weight to
-data far from the decision frontier. A linear approach is to fit a sigmoid
-function or **logistic** function:
-
-.. image:: /auto_examples/linear_model/images/sphx_glr_plot_logistic_001.png
-   :target: ../../auto_examples/linear_model/plot_logistic.html
-   :scale: 70
-   :align: center
-
-.. math::
-
-   y = \textrm{sigmoid}(X\beta - \textrm{offset}) + \epsilon =
-   \frac{1}{1 + \textrm{exp}(- X\beta + \textrm{offset})} + \epsilon
-
-::
-
-    >>> log = linear_model.LogisticRegression(C=1e5)
-    >>> log.fit(iris_X_train, iris_y_train)
-    LogisticRegression(C=100000.0)
-
-This is known as :class:`LogisticRegression`.
-
-.. image:: /auto_examples/linear_model/images/sphx_glr_plot_iris_logistic_001.png
-   :target: ../../auto_examples/linear_model/plot_iris_logistic.html
-   :scale: 83
-   :align: center
-
-.. topic:: Multiclass classification
-
-   If you have several classes to predict, an option often used is to fit
-   one-versus-all classifiers and then use a voting heuristic for the final
-   decision.
-
-.. topic:: Shrinkage and sparsity with logistic regression
-
-   The ``C`` parameter controls the amount of regularization in the
-   :class:`LogisticRegression` object: a large value for ``C`` results in
-   less regularization.
-   ``penalty="l2"`` gives :ref:`shrinkage` (i.e. non-sparse coefficients), while
-   ``penalty="l1"`` gives :ref:`sparsity`.
-
-.. topic:: **Exercise**
-   :class: green
-
-   Try classifying the digits dataset with nearest neighbors and a linear
-   model. Leave out the last 10% and test prediction performance on these
-   observations.
-
-   .. literalinclude:: ../../auto_examples/exercises/plot_digits_classification_exercise.py
-       :lines: 15-19
-
-   A solution can be downloaded :download:`here <../../auto_examples/exercises/plot_digits_classification_exercise.py>`.
-
-
-Support vector machines (SVMs)
-================================
-
-Linear SVMs
--------------
-
-
-:ref:`svm` belong to the discriminant model family: they try to find a combination of
-samples to build a plane maximizing the margin between the two classes.
-Regularization is set by the ``C`` parameter: a small value for ``C`` means the margin
-is calculated using many or all of the observations around the separating line
-(more regularization);
-a large value for ``C`` means the margin is calculated on observations close to
-the separating line (less regularization).
-
-.. currentmodule :: sklearn.svm
-
-.. figure:: /auto_examples/svm/images/sphx_glr_plot_svm_margin_001.png
-   :target: ../../auto_examples/svm/plot_svm_margin.html
-
-   **Unregularized SVM**
-
-.. figure:: /auto_examples/svm/images/sphx_glr_plot_svm_margin_002.png
-   :target: ../../auto_examples/svm/plot_svm_margin.html
-
-   **Regularized SVM (default)**
-
-.. topic:: Example:
-
- - :ref:`sphx_glr_auto_examples_svm_plot_iris_svc.py`
-
-
-SVMs can be used in regression --:class:`SVR` (Support Vector Regression)--, or in
-classification --:class:`SVC` (Support Vector Classification).
-
-::
-
-    >>> from sklearn import svm
-    >>> svc = svm.SVC(kernel='linear')
-    >>> svc.fit(iris_X_train, iris_y_train)
-    SVC(kernel='linear')
-
-
-.. warning:: **Normalizing data**
-
-   For many estimators, including the SVMs, having datasets with unit
-   standard deviation for each feature is important to get good
-   prediction.
-
-.. _using_kernels_tut:
-
-Using kernels
--------------
-
-Classes are not always linearly separable in feature space. The solution is to
-build a decision function that is not linear but may be polynomial instead.
-This is done using the *kernel trick* that can be seen as
-creating a decision energy by positioning *kernels* on observations:
-
-Linear kernel
-^^^^^^^^^^^^^
-
-::
-
-    >>> svc = svm.SVC(kernel='linear')
-
-.. image:: /auto_examples/svm/images/sphx_glr_plot_svm_kernels_002.png
-   :target: ../../auto_examples/svm/plot_svm_kernels.html
-
-Polynomial kernel
-^^^^^^^^^^^^^^^^^
-
-::
-
-    >>> svc = svm.SVC(kernel='poly',
-    ...               degree=3)
-    >>> # degree: polynomial degree
-
-.. image:: /auto_examples/svm/images/sphx_glr_plot_svm_kernels_003.png
-   :target: ../../auto_examples/svm/plot_svm_kernels.html
-
-RBF kernel (Radial Basis Function)
-^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
-
-::
-
-    >>> svc = svm.SVC(kernel='rbf')
-    >>> # gamma: inverse of size of
-    >>> # radial kernel
-
-.. image:: /auto_examples/svm/images/sphx_glr_plot_svm_kernels_004.png
-   :target: ../../auto_examples/svm/plot_svm_kernels.html
-
-Sigmoid kernel
-^^^^^^^^^^^^^^
-
-::
-
-    >>> svc = svm.SVC(kernel='sigmoid')
-
-.. image:: /auto_examples/svm/images/sphx_glr_plot_svm_kernels_005.png
-   :target: ../../auto_examples/svm/plot_svm_kernels.html
-
-
-
-.. topic:: **Interactive example**
-
-   See the :ref:`SVM GUI <sphx_glr_auto_examples_applications_svm_gui.py>` to download
-   ``svm_gui.py``; add data points of both classes with right and left button,
-   fit the model and change parameters and data.
-
-.. topic:: **Exercise**
-   :class: green
-
-   Try classifying classes 1 and 2 from the iris dataset with SVMs, with
-   the 2 first features. Leave out 10% of each class and test prediction
-   performance on these observations.
-
-   **Warning**: the classes are ordered, do not leave out the last 10%,
-   you would be testing on only one class.
-
-   **Hint**: You can use the ``decision_function`` method on a grid to get
-   intuitions.
-
-   .. literalinclude:: ../../auto_examples/exercises/plot_iris_exercise.py
-       :lines: 18-23
-
-   .. image:: /auto_examples/datasets/images/sphx_glr_plot_iris_dataset_001.png
-      :target: ../../auto_examples/datasets/plot_iris_dataset.html
-      :align: center
-      :scale: 70
-
-
-   A solution can be downloaded :download:`here <../../auto_examples/exercises/plot_iris_exercise.py>`
diff --git a/doc/tutorial/statistical_inference/unsupervised_learning.rst b/doc/tutorial/statistical_inference/unsupervised_learning.rst
deleted file mode 100644
index fd827cc75b212..0000000000000
--- a/doc/tutorial/statistical_inference/unsupervised_learning.rst
+++ /dev/null
@@ -1,297 +0,0 @@
-============================================================
-Unsupervised learning: seeking representations of the data
-============================================================
-
-Clustering: grouping observations together
-============================================
-
-.. topic:: The problem solved in clustering
-
-    Given the iris dataset, if we knew that there were 3 types of iris, but
-    did not have access to a taxonomist to label them: we could try a
-    **clustering task**: split the observations into well-separated group
-    called *clusters*.
-
-::
-
-   >>> # Set the PRNG
-   >>> import numpy as np
-   >>> np.random.seed(1)
-
-K-means clustering
--------------------
-
-Note that there exist a lot of different clustering criteria and associated
-algorithms. The simplest clustering algorithm is :ref:`k_means`.
-
-::
-
-    >>> from sklearn import cluster, datasets
-    >>> X_iris, y_iris = datasets.load_iris(return_X_y=True)
-
-    >>> k_means = cluster.KMeans(n_clusters=3)
-    >>> k_means.fit(X_iris)
-    KMeans(n_clusters=3)
-    >>> print(k_means.labels_[::10])
-    [1 1 1 1 1 2 0 0 0 0 2 2 2 2 2]
-    >>> print(y_iris[::10])
-    [0 0 0 0 0 1 1 1 1 1 2 2 2 2 2]
-
-.. figure:: /auto_examples/cluster/images/sphx_glr_plot_cluster_iris_001.png
-   :target: ../../auto_examples/cluster/plot_cluster_iris.html
-   :scale: 63
-
-.. warning::
-
-    There is absolutely no guarantee of recovering a ground truth. First,
-    choosing the right number of clusters is hard. Second, the algorithm
-    is sensitive to initialization, and can fall into local minima,
-    although scikit-learn employs several tricks to mitigate this issue.
-
-    For instance, on the image above, we can observe the difference between the
-    ground-truth (bottom right figure) and different clustering. We do not
-    recover the expected labels, either because the number of cluster was
-    chosen to be to large (top left figure) or suffer from a bad initialization
-    (bottom left figure).
-
-    **It is therefore important to not over-interpret clustering results.**
-
-.. topic:: **Application example: vector quantization**
-
-    Clustering in general and KMeans, in particular, can be seen as a way
-    of choosing a small number of exemplars to compress the information.
-    The problem is sometimes known as
-    `vector quantization <https://en.wikipedia.org/wiki/Vector_quantization>`_.
-    For instance, this can be used to posterize an image::
-
-        >>> import scipy as sp
-        >>> try:
-        ...    face = sp.face(gray=True)
-        ... except AttributeError:
-        ...    from scipy import misc
-        ...    face = misc.face(gray=True)
-    	>>> X = face.reshape((-1, 1)) # We need an (n_sample, n_feature) array
-    	>>> k_means = cluster.KMeans(n_clusters=5, n_init=1)
-    	>>> k_means.fit(X)
-        KMeans(n_clusters=5, n_init=1)
-    	>>> values = k_means.cluster_centers_.squeeze()
-    	>>> labels = k_means.labels_
-    	>>> face_compressed = np.choose(labels, values)
-    	>>> face_compressed.shape = face.shape
-
-**Raw image**
-
-.. figure:: /auto_examples/cluster/images/sphx_glr_plot_face_compress_001.png
-   :target: ../../auto_examples/cluster/plot_face_compress.html
-
-**K-means quantization**
-
-.. figure:: /auto_examples/cluster/images/sphx_glr_plot_face_compress_004.png
-   :target: ../../auto_examples/cluster/plot_face_compress.html
-
-**Equal bins**
-
-.. figure:: /auto_examples/cluster/images/sphx_glr_plot_face_compress_002.png
-   :target: ../../auto_examples/cluster/plot_face_compress.html
-
-Hierarchical agglomerative clustering: Ward
----------------------------------------------
-
-A :ref:`hierarchical_clustering` method is a type of cluster analysis
-that aims to build a hierarchy of clusters. In general, the various approaches
-of this technique are either:
-
-* **Agglomerative** - bottom-up approaches: each observation starts in its
-  own cluster, and clusters are iteratively merged in such a way to
-  minimize a *linkage* criterion. This approach is particularly interesting
-  when the clusters of interest are made of only a few observations. When
-  the number of clusters is large, it is much more computationally efficient
-  than k-means.
-
-* **Divisive** - top-down approaches: all observations start in one
-  cluster, which is iteratively split as one moves down the hierarchy.
-  For estimating large numbers of clusters, this approach is both slow (due
-  to all observations starting as one cluster, which it splits recursively)
-  and statistically ill-posed.
-
-Connectivity-constrained clustering
-.....................................
-
-With agglomerative clustering, it is possible to specify which samples can be
-clustered together by giving a connectivity graph. Graphs in scikit-learn
-are represented by their adjacency matrix. Often, a sparse matrix is used.
-This can be useful, for instance, to retrieve connected regions (sometimes
-also referred to as connected components) when clustering an image.
-
-.. image:: /auto_examples/cluster/images/sphx_glr_plot_coin_ward_segmentation_001.png
-   :target: ../../auto_examples/cluster/plot_coin_ward_segmentation.html
-   :scale: 40
-   :align: center
-
-::
-
-    >>> from skimage.data import coins
-    >>> from scipy.ndimage import gaussian_filter
-    >>> from skimage.transform import rescale
-    >>> rescaled_coins = rescale(
-    ...     gaussian_filter(coins(), sigma=2),
-    ...     0.2, mode='reflect', anti_aliasing=False
-    ... )
-    >>> X = np.reshape(rescaled_coins, (-1, 1))
-
-We need a vectorized version of the image. `'rescaled_coins'` is a down-scaled
-version of the coins image to speed up the process::
-
-    >>> from sklearn.feature_extraction import grid_to_graph
-    >>> connectivity = grid_to_graph(*rescaled_coins.shape)
-
-Define the graph structure of the data. Pixels connected to their neighbors::
-
-    >>> n_clusters = 27  # number of regions
-
-    >>> from sklearn.cluster import AgglomerativeClustering
-    >>> ward = AgglomerativeClustering(n_clusters=n_clusters, linkage='ward',
-    ...                                connectivity=connectivity)
-    >>> ward.fit(X)
-    AgglomerativeClustering(connectivity=..., n_clusters=27)
-    >>> label = np.reshape(ward.labels_, rescaled_coins.shape)
-
-Feature agglomeration
-......................
-
-We have seen that sparsity could be used to mitigate the curse of
-dimensionality, *i.e* an insufficient amount of observations compared to the
-number of features. Another approach is to merge together similar
-features: **feature agglomeration**. This approach can be implemented by
-clustering in the feature direction, in other words clustering the
-transposed data.
-
-.. image:: /auto_examples/cluster/images/sphx_glr_plot_digits_agglomeration_001.png
-   :target: ../../auto_examples/cluster/plot_digits_agglomeration.html
-   :align: center
-   :scale: 57
-
-::
-
-   >>> digits = datasets.load_digits()
-   >>> images = digits.images
-   >>> X = np.reshape(images, (len(images), -1))
-   >>> connectivity = grid_to_graph(*images[0].shape)
-
-   >>> agglo = cluster.FeatureAgglomeration(connectivity=connectivity,
-   ...                                      n_clusters=32)
-   >>> agglo.fit(X)
-   FeatureAgglomeration(connectivity=..., n_clusters=32)
-   >>> X_reduced = agglo.transform(X)
-
-   >>> X_approx = agglo.inverse_transform(X_reduced)
-   >>> images_approx = np.reshape(X_approx, images.shape)
-
-.. topic:: ``transform`` and ``inverse_transform`` methods
-
-   Some estimators expose a ``transform`` method, for instance to reduce
-   the dimensionality of the dataset.
-
-Decompositions: from a signal to components and loadings
-===========================================================
-
-.. topic:: **Components and loadings**
-
-   If X is our multivariate data, then the problem that we are trying to solve
-   is to rewrite it on a different observational basis: we want to learn
-   loadings L and a set of components C such that *X = L C*.
-   Different criteria exist to choose the components
-
-Principal component analysis: PCA
------------------------------------
-
-:ref:`PCA` selects the successive components that explain the maximum variance in the
-signal. Let's create a synthetic 3-dimensional dataset.
-
-.. np.random.seed(0)
-
-::
-
-    >>> # Create a signal with only 2 useful dimensions
-    >>> x1 = np.random.normal(size=(100, 1))
-    >>> x2 = np.random.normal(size=(100, 1))
-    >>> x3 = x1 + x2
-    >>> X = np.concatenate([x1, x2, x3], axis=1)
-
-The point cloud spanned by the observations above is very flat in one
-direction: one of the three univariate features (i.e. z-axis) can almost be exactly
-computed using the other two.
-
-.. plot::
-   :context: close-figs
-   :align: center
-
-   >>> import matplotlib.pyplot as plt
-   >>> fig = plt.figure()
-   >>> ax = fig.add_subplot(111, projection='3d')
-   >>> ax.scatter(X[:, 0], X[:, 1], X[:, 2])
-   <...>
-   >>> _ = ax.set(xlabel="x", ylabel="y", zlabel="z")
-
-
-PCA finds the directions in which the data is not *flat*.
-
-::
-
-   >>> from sklearn import decomposition
-   >>> pca = decomposition.PCA()
-   >>> pca.fit(X)
-   PCA()
-   >>> print(pca.explained_variance_)  # doctest: +SKIP
-   [  2.18565811e+00   1.19346747e+00   8.43026679e-32]
-
-Looking at the explained variance, we see that only the first two components
-are useful. PCA can be used to reduce dimensionality while preserving
-most of the information. It will project the data on the principal subspace.
-
-::
-
-   >>> pca.set_params(n_components=2)
-   PCA(n_components=2)
-   >>> X_reduced = pca.fit_transform(X)
-   >>> X_reduced.shape
-   (100, 2)
-
-.. Eigenfaces here?
-
-Independent Component Analysis: ICA
--------------------------------------
-
-:ref:`ICA` selects components so that the distribution of their loadings carries
-a maximum amount of independent information. It is able to recover
-**non-Gaussian** independent signals:
-
-.. image:: /auto_examples/decomposition/images/sphx_glr_plot_ica_blind_source_separation_001.png
-   :target: ../../auto_examples/decomposition/plot_ica_blind_source_separation.html
-   :scale: 70
-   :align: center
-
-.. np.random.seed(0)
-
-::
-
-    >>> # Generate sample data
-    >>> import numpy as np
-    >>> from scipy import signal
-    >>> time = np.linspace(0, 10, 2000)
-    >>> s1 = np.sin(2 * time)  # Signal 1 : sinusoidal signal
-    >>> s2 = np.sign(np.sin(3 * time))  # Signal 2 : square signal
-    >>> s3 = signal.sawtooth(2 * np.pi * time)  # Signal 3: saw tooth signal
-    >>> S = np.c_[s1, s2, s3]
-    >>> S += 0.2 * np.random.normal(size=S.shape)  # Add noise
-    >>> S /= S.std(axis=0)  # Standardize data
-    >>> # Mix data
-    >>> A = np.array([[1, 1, 1], [0.5, 2, 1], [1.5, 1, 2]])  # Mixing matrix
-    >>> X = np.dot(S, A.T)  # Generate observations
-
-    >>> # Compute ICA
-    >>> ica = decomposition.FastICA()
-    >>> S_ = ica.fit_transform(X)  # Get the estimated sources
-    >>> A_ = ica.mixing_.T
-    >>> np.allclose(X,  np.dot(S_, A_) + ica.mean_)
-    True
diff --git a/doc/tutorial/text_analytics/.gitignore b/doc/tutorial/text_analytics/.gitignore
deleted file mode 100644
index 54c78634d9dd1..0000000000000
--- a/doc/tutorial/text_analytics/.gitignore
+++ /dev/null
@@ -1,25 +0,0 @@
-# cruft
-.*.swp
-*.pyc
-.DS_Store
-*.pdf
-
-# folder to be used for working on the exercises
-workspace
-
-# output of the sphinx build of the documentation
-tutorial/_build
-
-# datasets to be fetched from the web and cached locally
-data/twenty_newsgroups/20news-bydate.tar.gz
-data/twenty_newsgroups/20news-bydate-train
-data/twenty_newsgroups/20news-bydate-test
-
-data/movie_reviews/txt_sentoken
-data/movie_reviews/poldata.README.2.0
-
-data/languages/paragraphs
-data/languages/short_paragraphs
-data/languages/html
-
-data/labeled_faces_wild/lfw_preprocessed/
diff --git a/doc/tutorial/text_analytics/data/languages/fetch_data.py b/doc/tutorial/text_analytics/data/languages/fetch_data.py
deleted file mode 100644
index 2dd0f208ade86..0000000000000
--- a/doc/tutorial/text_analytics/data/languages/fetch_data.py
+++ /dev/null
@@ -1,103 +0,0 @@
-
-# simple python script to collect text paragraphs from various languages on the
-# same topic namely the Wikipedia encyclopedia itself
-
-import os
-from urllib.request import Request, build_opener
-
-import lxml.html
-from lxml.etree import ElementTree
-import numpy as np
-
-import codecs
-
-pages = {
-    'ar': 'http://ar.wikipedia.org/wiki/%D9%88%D9%8A%D9%83%D9%8A%D8%A8%D9%8A%D8%AF%D9%8A%D8%A7',   # noqa: E501
-    'de': 'http://de.wikipedia.org/wiki/Wikipedia',
-    'en': 'https://en.wikipedia.org/wiki/Wikipedia',
-    'es': 'http://es.wikipedia.org/wiki/Wikipedia',
-    'fr': 'http://fr.wikipedia.org/wiki/Wikip%C3%A9dia',
-    'it': 'http://it.wikipedia.org/wiki/Wikipedia',
-    'ja': 'http://ja.wikipedia.org/wiki/Wikipedia',
-    'nl': 'http://nl.wikipedia.org/wiki/Wikipedia',
-    'pl': 'http://pl.wikipedia.org/wiki/Wikipedia',
-    'pt': 'http://pt.wikipedia.org/wiki/Wikip%C3%A9dia',
-    'ru': 'http://ru.wikipedia.org/wiki/%D0%92%D0%B8%D0%BA%D0%B8%D0%BF%D0%B5%D0%B4%D0%B8%D1%8F',  # noqa: E501
-#    u'zh': u'http://zh.wikipedia.org/wiki/Wikipedia',
-}
-
-html_folder = 'html'
-text_folder = 'paragraphs'
-short_text_folder = 'short_paragraphs'
-n_words_per_short_text = 5
-
-
-if not os.path.exists(html_folder):
-    os.makedirs(html_folder)
-
-for lang, page in pages.items():
-
-    text_lang_folder = os.path.join(text_folder, lang)
-    if not os.path.exists(text_lang_folder):
-        os.makedirs(text_lang_folder)
-
-    short_text_lang_folder = os.path.join(short_text_folder, lang)
-    if not os.path.exists(short_text_lang_folder):
-        os.makedirs(short_text_lang_folder)
-
-    opener = build_opener()
-    html_filename = os.path.join(html_folder, lang + '.html')
-    if not os.path.exists(html_filename):
-        print("Downloading %s" % page)
-        request = Request(page)
-        # change the User Agent to avoid being blocked by Wikipedia
-        # downloading a couple of articles should not be considered abusive
-        request.add_header('User-Agent', 'OpenAnything/1.0')
-        html_content = opener.open(request).read()
-        with open(html_filename, 'wb') as f:
-            f.write(html_content)
-
-    # decode the payload explicitly as UTF-8 since lxml is confused for some
-    # reason
-    with codecs.open(html_filename,'r','utf-8') as html_file:
-        html_content = html_file.read()
-    tree = ElementTree(lxml.html.document_fromstring(html_content))
-    i = 0
-    j = 0
-    for p in tree.findall('//p'):
-        content = p.text_content()
-        if len(content) < 100:
-            # skip paragraphs that are too short - probably too noisy and not
-            # representative of the actual language
-            continue
-
-        text_filename = os.path.join(text_lang_folder,
-                                     '%s_%04d.txt' % (lang, i))
-        print("Writing %s" % text_filename)
-        with open(text_filename, 'wb') as f:
-            f.write(content.encode('utf-8', 'ignore'))
-        i += 1
-
-        # split the paragraph into fake smaller paragraphs to make the
-        # problem harder e.g. more similar to tweets
-        if lang in ('zh', 'ja'):
-        # FIXME: whitespace tokenizing does not work on chinese and japanese
-            continue
-        words = content.split()
-        n_groups = len(words) / n_words_per_short_text
-        if n_groups < 1:
-            continue
-        groups = np.array_split(words, n_groups)
-
-        for group in groups:
-            small_content = " ".join(group)
-
-            short_text_filename = os.path.join(short_text_lang_folder,
-                                               '%s_%04d.txt' % (lang, j))
-            print("Writing %s" % short_text_filename)
-            with open(short_text_filename, 'wb') as f:
-                f.write(small_content.encode('utf-8', 'ignore'))
-            j += 1
-            if j >= 1000:
-                break
-
diff --git a/doc/tutorial/text_analytics/data/movie_reviews/fetch_data.py b/doc/tutorial/text_analytics/data/movie_reviews/fetch_data.py
deleted file mode 100644
index 67def14889774..0000000000000
--- a/doc/tutorial/text_analytics/data/movie_reviews/fetch_data.py
+++ /dev/null
@@ -1,33 +0,0 @@
-"""Script to download the movie review dataset"""
-
-from pathlib import Path
-from hashlib import sha256
-import tarfile
-from urllib.request import urlopen
-
-
-URL = "http://www.cs.cornell.edu/people/pabo/movie-review-data/review_polarity.tar.gz"
-
-ARCHIVE_SHA256 = "fc0dccc2671af5db3c5d8f81f77a1ebfec953ecdd422334062df61ede36b2179"
-ARCHIVE_NAME = Path(URL.rsplit("/", 1)[1])
-DATA_FOLDER = Path("txt_sentoken")
-
-
-if not DATA_FOLDER.exists():
-
-    if not ARCHIVE_NAME.exists():
-        print("Downloading dataset from %s (3 MB)" % URL)
-        opener = urlopen(URL)
-        with open(ARCHIVE_NAME, "wb") as archive:
-            archive.write(opener.read())
-
-    try:
-        print("Checking the integrity of the archive")
-        assert sha256(ARCHIVE_NAME.read_bytes()).hexdigest() == ARCHIVE_SHA256
-
-        print("Decompressing %s" % ARCHIVE_NAME)
-        with tarfile.open(ARCHIVE_NAME, "r:gz") as archive:
-            archive.extractall(path=".")
-
-    finally:
-        ARCHIVE_NAME.unlink()
diff --git a/doc/tutorial/text_analytics/skeletons/exercise_01_language_train_model.py b/doc/tutorial/text_analytics/skeletons/exercise_01_language_train_model.py
deleted file mode 100644
index 438481120d126..0000000000000
--- a/doc/tutorial/text_analytics/skeletons/exercise_01_language_train_model.py
+++ /dev/null
@@ -1,62 +0,0 @@
-"""Build a language detector model
-
-The goal of this exercise is to train a linear classifier on text features
-that represent sequences of up to 3 consecutive characters so as to be
-recognize natural languages by using the frequencies of short character
-sequences as 'fingerprints'.
-
-"""
-# Author: Olivier Grisel <olivier.grisel@ensta.org>
-# License: Simplified BSD
-
-import sys
-
-from sklearn.feature_extraction.text import TfidfVectorizer
-from sklearn.linear_model import Perceptron
-from sklearn.pipeline import Pipeline
-from sklearn.datasets import load_files
-from sklearn.model_selection import train_test_split
-from sklearn import metrics
-
-
-# The training data folder must be passed as first argument
-languages_data_folder = sys.argv[1]
-dataset = load_files(languages_data_folder)
-
-# Split the dataset in training and test set:
-docs_train, docs_test, y_train, y_test = train_test_split(
-    dataset.data, dataset.target, test_size=0.5)
-
-
-# TASK: Build a vectorizer that splits strings into sequence of 1 to 3
-# characters instead of word tokens
-
-# TASK: Build a vectorizer / classifier pipeline using the previous analyzer
-# the pipeline instance should stored in a variable named clf
-
-# TASK: Fit the pipeline on the training set
-
-# TASK: Predict the outcome on the testing set in a variable named y_predicted
-
-# Print the classification report
-print(metrics.classification_report(y_test, y_predicted,
-                                    target_names=dataset.target_names))
-
-# Plot the confusion matrix
-cm = metrics.confusion_matrix(y_test, y_predicted)
-print(cm)
-
-#import matplotlib.pyplot as plt
-#plt.matshow(cm, cmap=plt.cm.jet)
-#plt.show()
-
-# Predict the result on some short new sentences:
-sentences = [
-    'This is a language detection test.',
-    'Ceci est un test de d\xe9tection de la langue.',
-    'Dies ist ein Test, um die Sprache zu erkennen.',
-]
-predicted = clf.predict(sentences)
-
-for s, p in zip(sentences, predicted):
-    print('The language of "%s" is "%s"' % (s, dataset.target_names[p]))
diff --git a/doc/tutorial/text_analytics/skeletons/exercise_02_sentiment.py b/doc/tutorial/text_analytics/skeletons/exercise_02_sentiment.py
deleted file mode 100644
index 23299f5f01b3d..0000000000000
--- a/doc/tutorial/text_analytics/skeletons/exercise_02_sentiment.py
+++ /dev/null
@@ -1,63 +0,0 @@
-"""Build a sentiment analysis / polarity model
-
-Sentiment analysis can be casted as a binary text classification problem,
-that is fitting a linear classifier on features extracted from the text
-of the user messages so as to guess whether the opinion of the author is
-positive or negative.
-
-In this examples we will use a movie review dataset.
-
-"""
-# Author: Olivier Grisel <olivier.grisel@ensta.org>
-# License: Simplified BSD
-
-import sys
-from sklearn.feature_extraction.text import TfidfVectorizer
-from sklearn.svm import LinearSVC
-from sklearn.pipeline import Pipeline
-from sklearn.model_selection import GridSearchCV
-from sklearn.datasets import load_files
-from sklearn.model_selection import train_test_split
-from sklearn import metrics
-
-
-if __name__ == "__main__":
-    # NOTE: we put the following in a 'if __name__ == "__main__"' protected
-    # block to be able to use a multi-core grid search that also works under
-    # Windows, see: http://docs.python.org/library/multiprocessing.html#windows
-    # The multiprocessing module is used as the backend of joblib.Parallel
-    # that is used when n_jobs != 1 in GridSearchCV
-
-    # the training data folder must be passed as first argument
-    movie_reviews_data_folder = sys.argv[1]
-    dataset = load_files(movie_reviews_data_folder, shuffle=False)
-    print("n_samples: %d" % len(dataset.data))
-
-    # split the dataset in training and test set:
-    docs_train, docs_test, y_train, y_test = train_test_split(
-        dataset.data, dataset.target, test_size=0.25, random_state=None)
-
-    # TASK: Build a vectorizer / classifier pipeline that filters out tokens
-    # that are too rare or too frequent
-
-    # TASK: Build a grid search to find out whether unigrams or bigrams are
-    # more useful.
-    # Fit the pipeline on the training set using grid search for the parameters
-
-    # TASK: print the cross-validated scores for the each parameters set
-    # explored by the grid search
-
-    # TASK: Predict the outcome on the testing set and store it in a variable
-    # named y_predicted
-
-    # Print the classification report
-    print(metrics.classification_report(y_test, y_predicted,
-                                        target_names=dataset.target_names))
-
-    # Print and plot the confusion matrix
-    cm = metrics.confusion_matrix(y_test, y_predicted)
-    print(cm)
-
-    # import matplotlib.pyplot as plt
-    # plt.matshow(cm)
-    # plt.show()
diff --git a/doc/tutorial/text_analytics/solutions/exercise_01_language_train_model.py b/doc/tutorial/text_analytics/solutions/exercise_01_language_train_model.py
deleted file mode 100644
index 21cee0c80e00e..0000000000000
--- a/doc/tutorial/text_analytics/solutions/exercise_01_language_train_model.py
+++ /dev/null
@@ -1,70 +0,0 @@
-"""Build a language detector model
-
-The goal of this exercise is to train a linear classifier on text features
-that represent sequences of up to 3 consecutive characters so as to be
-recognize natural languages by using the frequencies of short character
-sequences as 'fingerprints'.
-
-"""
-# Author: Olivier Grisel <olivier.grisel@ensta.org>
-# License: Simplified BSD
-
-import sys
-
-from sklearn.feature_extraction.text import TfidfVectorizer
-from sklearn.linear_model import Perceptron
-from sklearn.pipeline import Pipeline
-from sklearn.datasets import load_files
-from sklearn.model_selection import train_test_split
-from sklearn import metrics
-
-
-# The training data folder must be passed as first argument
-languages_data_folder = sys.argv[1]
-dataset = load_files(languages_data_folder)
-
-# Split the dataset in training and test set:
-docs_train, docs_test, y_train, y_test = train_test_split(
-    dataset.data, dataset.target, test_size=0.5)
-
-
-# TASK: Build a vectorizer that splits strings into sequence of 1 to 3
-# characters instead of word tokens
-vectorizer = TfidfVectorizer(ngram_range=(1, 3), analyzer='char',
-                             use_idf=False)
-
-# TASK: Build a vectorizer / classifier pipeline using the previous analyzer
-# the pipeline instance should stored in a variable named clf
-clf = Pipeline([
-    ('vec', vectorizer),
-    ('clf', Perceptron()),
-])
-
-# TASK: Fit the pipeline on the training set
-clf.fit(docs_train, y_train)
-
-# TASK: Predict the outcome on the testing set in a variable named y_predicted
-y_predicted = clf.predict(docs_test)
-
-# Print the classification report
-print(metrics.classification_report(y_test, y_predicted,
-                                    target_names=dataset.target_names))
-
-# Plot the confusion matrix
-cm = metrics.confusion_matrix(y_test, y_predicted)
-print(cm)
-
-#import matlotlib.pyplot as plt
-#plt.matshow(cm, cmap=plt.cm.jet)
-#plt.show()
-
-# Predict the result on some short new sentences:
-sentences = [
-    'This is a language detection test.',
-    'Ceci est un test de d\xe9tection de la langue.',
-    'Dies ist ein Test, um die Sprache zu erkennen.',
-]
-predicted = clf.predict(sentences)
-
-for s, p in zip(sentences, predicted):
-    print('The language of "%s" is "%s"' % (s, dataset.target_names[p]))
diff --git a/doc/tutorial/text_analytics/solutions/exercise_02_sentiment.py b/doc/tutorial/text_analytics/solutions/exercise_02_sentiment.py
deleted file mode 100644
index 434bece341975..0000000000000
--- a/doc/tutorial/text_analytics/solutions/exercise_02_sentiment.py
+++ /dev/null
@@ -1,79 +0,0 @@
-"""Build a sentiment analysis / polarity model
-
-Sentiment analysis can be casted as a binary text classification problem,
-that is fitting a linear classifier on features extracted from the text
-of the user messages so as to guess whether the opinion of the author is
-positive or negative.
-
-In this examples we will use a movie review dataset.
-
-"""
-# Author: Olivier Grisel <olivier.grisel@ensta.org>
-# License: Simplified BSD
-
-import sys
-from sklearn.feature_extraction.text import TfidfVectorizer
-from sklearn.svm import LinearSVC
-from sklearn.pipeline import Pipeline
-from sklearn.model_selection import GridSearchCV
-from sklearn.datasets import load_files
-from sklearn.model_selection import train_test_split
-from sklearn import metrics
-
-
-if __name__ == "__main__":
-    # NOTE: we put the following in a 'if __name__ == "__main__"' protected
-    # block to be able to use a multi-core grid search that also works under
-    # Windows, see: http://docs.python.org/library/multiprocessing.html#windows
-    # The multiprocessing module is used as the backend of joblib.Parallel
-    # that is used when n_jobs != 1 in GridSearchCV
-
-    # the training data folder must be passed as first argument
-    movie_reviews_data_folder = sys.argv[1]
-    dataset = load_files(movie_reviews_data_folder, shuffle=False)
-    print("n_samples: %d" % len(dataset.data))
-
-    # split the dataset in training and test set:
-    docs_train, docs_test, y_train, y_test = train_test_split(
-        dataset.data, dataset.target, test_size=0.25, random_state=None)
-
-    # TASK: Build a vectorizer / classifier pipeline that filters out tokens
-    # that are too rare or too frequent
-    pipeline = Pipeline([
-        ('vect', TfidfVectorizer(min_df=3, max_df=0.95)),
-        ('clf', LinearSVC(C=1000)),
-    ])
-
-    # TASK: Build a grid search to find out whether unigrams or bigrams are
-    # more useful.
-    # Fit the pipeline on the training set using grid search for the parameters
-    parameters = {
-        'vect__ngram_range': [(1, 1), (1, 2)],
-    }
-    grid_search = GridSearchCV(pipeline, parameters, n_jobs=-1)
-    grid_search.fit(docs_train, y_train)
-
-    # TASK: print the mean and std for each candidate along with the parameter
-    # settings for all the candidates explored by grid search.
-    n_candidates = len(grid_search.cv_results_['params'])
-    for i in range(n_candidates):
-        print(i, 'params - %s; mean - %0.2f; std - %0.2f'
-                 % (grid_search.cv_results_['params'][i],
-                    grid_search.cv_results_['mean_test_score'][i],
-                    grid_search.cv_results_['std_test_score'][i]))
-
-    # TASK: Predict the outcome on the testing set and store it in a variable
-    # named y_predicted
-    y_predicted = grid_search.predict(docs_test)
-
-    # Print the classification report
-    print(metrics.classification_report(y_test, y_predicted,
-                                        target_names=dataset.target_names))
-
-    # Print and plot the confusion matrix
-    cm = metrics.confusion_matrix(y_test, y_predicted)
-    print(cm)
-
-    # import matplotlib.pyplot as plt
-    # plt.matshow(cm)
-    # plt.show()
diff --git a/doc/tutorial/text_analytics/solutions/generate_skeletons.py b/doc/tutorial/text_analytics/solutions/generate_skeletons.py
deleted file mode 100644
index 4729b976530c7..0000000000000
--- a/doc/tutorial/text_analytics/solutions/generate_skeletons.py
+++ /dev/null
@@ -1,38 +0,0 @@
-"""Generate skeletons from the example code"""
-import os
-
-exercise_dir = os.path.dirname(__file__)
-if exercise_dir == '':
-    exercise_dir = '.'
-
-skeleton_dir = os.path.abspath(os.path.join(exercise_dir, '..', 'skeletons'))
-if not os.path.exists(skeleton_dir):
-    os.makedirs(skeleton_dir)
-
-solutions = os.listdir(exercise_dir)
-
-for f in solutions:
-    if not f.endswith('.py'):
-        continue
-
-    if f == os.path.basename(__file__):
-        continue
-
-    print("Generating skeleton for %s" % f)
-
-    input_file = open(os.path.join(exercise_dir, f))
-    output_file = open(os.path.join(skeleton_dir, f), 'w')
-
-    in_exercise_region = False
-
-    for line in input_file:
-        linestrip = line.strip()
-        if len(linestrip) == 0:
-            in_exercise_region = False
-        elif linestrip.startswith('# TASK:'):
-            in_exercise_region = True
-
-        if not in_exercise_region or linestrip.startswith('#'):
-            output_file.write(line)
-
-    output_file.close()
diff --git a/doc/tutorial/text_analytics/working_with_text_data.rst b/doc/tutorial/text_analytics/working_with_text_data.rst
deleted file mode 100644
index 43fd305c3b8b6..0000000000000
--- a/doc/tutorial/text_analytics/working_with_text_data.rst
+++ /dev/null
@@ -1,586 +0,0 @@
-.. _text_data_tutorial:
-
-======================
-Working With Text Data
-======================
-
-The goal of this guide is to explore some of the main ``scikit-learn``
-tools on a single practical task: analyzing a collection of text
-documents (newsgroups posts) on twenty different topics.
-
-In this section we will see how to:
-
-- load the file contents and the categories
-
-- extract feature vectors suitable for machine learning
-
-- train a linear model to perform categorization
-
-- use a grid search strategy to find a good configuration of both
-  the feature extraction components and the classifier
-
-
-Tutorial setup
---------------
-
-To get started with this tutorial, you must first install
-*scikit-learn* and all of its required dependencies.
-
-Please refer to the :ref:`installation instructions <installation-instructions>`
-page for more information and for system-specific instructions.
-
-The source of this tutorial can be found within your scikit-learn folder::
-
-    scikit-learn/doc/tutorial/text_analytics/
-
-The source can also be found `on Github
-<https://github.com/scikit-learn/scikit-learn/tree/main/doc/tutorial/text_analytics>`_.
-
-The tutorial folder should contain the following sub-folders:
-
-* ``*.rst files`` - the source of the tutorial document written with sphinx
-
-* ``data`` - folder to put the datasets used during the tutorial
-
-* ``skeletons`` - sample incomplete scripts for the exercises
-
-* ``solutions`` - solutions of the exercises
-
-
-You can already copy the skeletons into a new folder somewhere
-on your hard-drive named ``sklearn_tut_workspace``, where you
-will edit your own files for the exercises while keeping
-the original skeletons intact:
-
-.. prompt:: bash $
-
-  cp -r skeletons work_directory/sklearn_tut_workspace
-
-
-Machine learning algorithms need data. Go to each ``$TUTORIAL_HOME/data``
-sub-folder and run the ``fetch_data.py`` script from there (after
-having read them first).
-
-For instance:
-
-.. prompt:: bash $
-
-  cd $TUTORIAL_HOME/data/languages
-  less fetch_data.py
-  python fetch_data.py
-
-
-Loading the 20 newsgroups dataset
----------------------------------
-
-The dataset is called "Twenty Newsgroups". Here is the official
-description, quoted from the `website
-<http://people.csail.mit.edu/jrennie/20Newsgroups/>`_:
-
-  The 20 Newsgroups data set is a collection of approximately 20,000
-  newsgroup documents, partitioned (nearly) evenly across 20 different
-  newsgroups. To the best of our knowledge, it was originally collected
-  by Ken Lang, probably for his paper "Newsweeder: Learning to filter
-  netnews," though he does not explicitly mention this collection.
-  The 20 newsgroups collection has become a popular data set for
-  experiments in text applications of machine learning techniques,
-  such as text classification and text clustering.
-
-In the following we will use the built-in dataset loader for 20 newsgroups
-from scikit-learn. Alternatively, it is possible to download the dataset
-manually from the website and use the :func:`sklearn.datasets.load_files`
-function by pointing it to the ``20news-bydate-train`` sub-folder of the
-uncompressed archive folder.
-
-In order to get faster execution times for this first example, we will
-work on a partial dataset with only 4 categories out of the 20 available
-in the dataset::
-
-  >>> categories = ['alt.atheism', 'soc.religion.christian',
-  ...               'comp.graphics', 'sci.med']
-
-We can now load the list of files matching those categories as follows::
-
-  >>> from sklearn.datasets import fetch_20newsgroups
-  >>> twenty_train = fetch_20newsgroups(subset='train',
-  ...     categories=categories, shuffle=True, random_state=42)
-
-The returned dataset is a ``scikit-learn`` "bunch": a simple holder
-object with fields that can be both accessed as python ``dict``
-keys or ``object`` attributes for convenience, for instance the
-``target_names`` holds the list of the requested category names::
-
-  >>> twenty_train.target_names
-  ['alt.atheism', 'comp.graphics', 'sci.med', 'soc.religion.christian']
-
-The files themselves are loaded in memory in the ``data`` attribute. For
-reference the filenames are also available::
-
-  >>> len(twenty_train.data)
-  2257
-  >>> len(twenty_train.filenames)
-  2257
-
-Let's print the first lines of the first loaded file::
-
-  >>> print("\n".join(twenty_train.data[0].split("\n")[:3]))
-  From: sd345@city.ac.uk (Michael Collier)
-  Subject: Converting images to HP LaserJet III?
-  Nntp-Posting-Host: hampton
-
-  >>> print(twenty_train.target_names[twenty_train.target[0]])
-  comp.graphics
-
-Supervised learning algorithms will require a category label for each
-document in the training set. In this case the category is the name of the
-newsgroup which also happens to be the name of the folder holding the
-individual documents.
-
-For speed and space efficiency reasons, ``scikit-learn`` loads the
-target attribute as an array of integers that corresponds to the
-index of the category name in the ``target_names`` list. The category
-integer id of each sample is stored in the ``target`` attribute::
-
-  >>> twenty_train.target[:10]
-  array([1, 1, 3, 3, 3, 3, 3, 2, 2, 2])
-
-It is possible to get back the category names as follows::
-
-  >>> for t in twenty_train.target[:10]:
-  ...     print(twenty_train.target_names[t])
-  ...
-  comp.graphics
-  comp.graphics
-  soc.religion.christian
-  soc.religion.christian
-  soc.religion.christian
-  soc.religion.christian
-  soc.religion.christian
-  sci.med
-  sci.med
-  sci.med
-
-You might have noticed that the samples were shuffled randomly when we called
-``fetch_20newsgroups(..., shuffle=True, random_state=42)``: this is useful if
-you wish to select only a subset of samples to quickly train a model and get a
-first idea of the results before re-training on the complete dataset later.
-
-
-Extracting features from text files
------------------------------------
-
-In order to perform machine learning on text documents, we first need to
-turn the text content into numerical feature vectors.
-
-.. currentmodule:: sklearn.feature_extraction.text
-
-
-Bags of words
-~~~~~~~~~~~~~
-
-The most intuitive way to do so is to use a bags of words representation:
-
-1. Assign a fixed integer id to each word occurring in any document
-   of the training set (for instance by building a dictionary
-   from words to integer indices).
-
-2. For each document ``#i``, count the number of occurrences of each
-   word ``w`` and store it in ``X[i, j]`` as the value of feature
-   ``#j`` where ``j`` is the index of word ``w`` in the dictionary.
-
-The bags of words representation implies that ``n_features`` is
-the number of distinct words in the corpus: this number is typically
-larger than 100,000.
-
-If ``n_samples == 10000``, storing ``X`` as a NumPy array of type
-float32 would require 10000 x 100000 x 4 bytes = **4GB in RAM** which
-is barely manageable on today's computers.
-
-Fortunately, **most values in X will be zeros** since for a given
-document less than a few thousand distinct words will be
-used. For this reason we say that bags of words are typically
-**high-dimensional sparse datasets**. We can save a lot of memory by
-only storing the non-zero parts of the feature vectors in memory.
-
-``scipy.sparse`` matrices are data structures that do exactly this,
-and ``scikit-learn`` has built-in support for these structures.
-
-
-Tokenizing text with ``scikit-learn``
-~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-
-Text preprocessing, tokenizing and filtering of stopwords are all included
-in :class:`CountVectorizer`, which builds a dictionary of features and
-transforms documents to feature vectors::
-
-  >>> from sklearn.feature_extraction.text import CountVectorizer
-  >>> count_vect = CountVectorizer()
-  >>> X_train_counts = count_vect.fit_transform(twenty_train.data)
-  >>> X_train_counts.shape
-  (2257, 35788)
-
-:class:`CountVectorizer` supports counts of N-grams of words or consecutive
-characters. Once fitted, the vectorizer has built a dictionary of feature
-indices::
-
-  >>> count_vect.vocabulary_.get(u'algorithm')
-  4690
-
-The index value of a word in the vocabulary is linked to its frequency
-in the whole training corpus.
-
-.. note:
-
-  The method ``count_vect.fit_transform`` performs two actions:
-  it learns the vocabulary and transforms the documents into count vectors.
-  It's possible to separate these steps by calling
-  ``count_vect.fit(twenty_train.data)`` followed by
-  ``X_train_counts = count_vect.transform(twenty_train.data)``,
-  but doing so would tokenize and vectorize each text file twice.
-
-
-From occurrences to frequencies
-~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-
-Occurrence count is a good start but there is an issue: longer
-documents will have higher average count values than shorter documents,
-even though they might talk about the same topics.
-
-To avoid these potential discrepancies it suffices to divide the
-number of occurrences of each word in a document by the total number
-of words in the document: these new features are called ``tf`` for Term
-Frequencies.
-
-Another refinement on top of tf is to downscale weights for words
-that occur in many documents in the corpus and are therefore less
-informative than those that occur only in a smaller portion of the
-corpus.
-
-This downscaling is called `tf–idf`_ for "Term Frequency times
-Inverse Document Frequency".
-
-.. _`tf–idf`: https://en.wikipedia.org/wiki/Tf-idf
-
-
-Both **tf** and **tf–idf** can be computed as follows using
-:class:`TfidfTransformer`::
-
-  >>> from sklearn.feature_extraction.text import TfidfTransformer
-  >>> tf_transformer = TfidfTransformer(use_idf=False).fit(X_train_counts)
-  >>> X_train_tf = tf_transformer.transform(X_train_counts)
-  >>> X_train_tf.shape
-  (2257, 35788)
-
-In the above example-code, we firstly use the ``fit(..)`` method to fit our
-estimator to the data and secondly the ``transform(..)`` method to transform
-our count-matrix to a tf-idf representation.
-These two steps can be combined to achieve the same end result faster
-by skipping redundant processing. This is done through using the
-``fit_transform(..)`` method as shown below, and as mentioned in the note
-in the previous section::
-
-  >>> tfidf_transformer = TfidfTransformer()
-  >>> X_train_tfidf = tfidf_transformer.fit_transform(X_train_counts)
-  >>> X_train_tfidf.shape
-  (2257, 35788)
-
-
-Training a classifier
----------------------
-
-Now that we have our features, we can train a classifier to try to predict
-the category of a post. Let's start with a :ref:`naïve Bayes <naive_bayes>`
-classifier, which
-provides a nice baseline for this task. ``scikit-learn`` includes several
-variants of this classifier, and the one most suitable for word counts is the
-multinomial variant::
-
-  >>> from sklearn.naive_bayes import MultinomialNB
-  >>> clf = MultinomialNB().fit(X_train_tfidf, twenty_train.target)
-
-To try to predict the outcome on a new document we need to extract
-the features using almost the same feature extracting chain as before.
-The difference is that we call ``transform`` instead of ``fit_transform``
-on the transformers, since they have already been fit to the training set::
-
-  >>> docs_new = ['God is love', 'OpenGL on the GPU is fast']
-  >>> X_new_counts = count_vect.transform(docs_new)
-  >>> X_new_tfidf = tfidf_transformer.transform(X_new_counts)
-
-  >>> predicted = clf.predict(X_new_tfidf)
-
-  >>> for doc, category in zip(docs_new, predicted):
-  ...     print('%r => %s' % (doc, twenty_train.target_names[category]))
-  ...
-  'God is love' => soc.religion.christian
-  'OpenGL on the GPU is fast' => comp.graphics
-
-
-Building a pipeline
--------------------
-
-In order to make the vectorizer => transformer => classifier easier
-to work with, ``scikit-learn`` provides a :class:`~sklearn.pipeline.Pipeline` class that behaves
-like a compound classifier::
-
-  >>> from sklearn.pipeline import Pipeline
-  >>> text_clf = Pipeline([
-  ...     ('vect', CountVectorizer()),
-  ...     ('tfidf', TfidfTransformer()),
-  ...     ('clf', MultinomialNB()),
-  ... ])
-
-
-The names ``vect``, ``tfidf`` and ``clf`` (classifier) are arbitrary.
-We will use them to perform grid search for suitable hyperparameters below.
-We can now train the model with a single command::
-
-  >>> text_clf.fit(twenty_train.data, twenty_train.target)
-  Pipeline(...)
-
-
-Evaluation of the performance on the test set
----------------------------------------------
-
-Evaluating the predictive accuracy of the model is equally easy::
-
-  >>> import numpy as np
-  >>> twenty_test = fetch_20newsgroups(subset='test',
-  ...     categories=categories, shuffle=True, random_state=42)
-  >>> docs_test = twenty_test.data
-  >>> predicted = text_clf.predict(docs_test)
-  >>> np.mean(predicted == twenty_test.target)
-  0.8348...
-
-We achieved 83.5% accuracy. Let's see if we can do better with a
-linear :ref:`support vector machine (SVM) <svm>`,
-which is widely regarded as one of
-the best text classification algorithms (although it's also a bit slower
-than naïve Bayes). We can change the learner by simply plugging a different
-classifier object into our pipeline::
-
-  >>> from sklearn.linear_model import SGDClassifier
-  >>> text_clf = Pipeline([
-  ...     ('vect', CountVectorizer()),
-  ...     ('tfidf', TfidfTransformer()),
-  ...     ('clf', SGDClassifier(loss='hinge', penalty='l2',
-  ...                           alpha=1e-3, random_state=42,
-  ...                           max_iter=5, tol=None)),
-  ... ])
-
-  >>> text_clf.fit(twenty_train.data, twenty_train.target)
-  Pipeline(...)
-  >>> predicted = text_clf.predict(docs_test)
-  >>> np.mean(predicted == twenty_test.target)
-  0.9101...
-
-We achieved 91.3% accuracy using the SVM. ``scikit-learn`` provides further
-utilities for more detailed performance analysis of the results::
-
-  >>> from sklearn import metrics
-  >>> print(metrics.classification_report(twenty_test.target, predicted,
-  ...     target_names=twenty_test.target_names))
-                          precision    recall  f1-score   support
-  <BLANKLINE>
-             alt.atheism       0.95      0.80      0.87       319
-           comp.graphics       0.87      0.98      0.92       389
-                 sci.med       0.94      0.89      0.91       396
-  soc.religion.christian       0.90      0.95      0.93       398
-  <BLANKLINE>
-                accuracy                           0.91      1502
-               macro avg       0.91      0.91      0.91      1502
-            weighted avg       0.91      0.91      0.91      1502
-  <BLANKLINE>
-
-  >>> metrics.confusion_matrix(twenty_test.target, predicted)
-  array([[256,  11,  16,  36],
-         [  4, 380,   3,   2],
-         [  5,  35, 353,   3],
-         [  5,  11,   4, 378]])
-
-As expected the confusion matrix shows that posts from the newsgroups
-on atheism and Christianity are more often confused for one another than
-with computer graphics.
-
-.. note:
-
-  SGD stands for Stochastic Gradient Descent. This is a simple
-  optimization algorithms that is known to be scalable when the dataset
-  has many samples.
-
-  By setting ``loss="hinge"`` and ``penalty="l2"`` we are configuring
-  the classifier model to tune its parameters for the linear Support
-  Vector Machine cost function.
-
-  Alternatively we could have used ``sklearn.svm.LinearSVC`` (Linear
-  Support Vector Machine Classifier) that provides an alternative
-  optimizer for the same cost function based on the liblinear_ C++
-  library.
-
-.. _liblinear: https://www.csie.ntu.edu.tw/~cjlin/liblinear/
-
-
-Parameter tuning using grid search
-----------------------------------
-
-We've already encountered some parameters such as ``use_idf`` in the
-``TfidfTransformer``. Classifiers tend to have many parameters as well;
-e.g., ``MultinomialNB`` includes a smoothing parameter ``alpha`` and
-``SGDClassifier`` has a penalty parameter ``alpha`` and configurable loss
-and penalty terms in the objective function (see the module documentation,
-or use the Python ``help`` function to get a description of these).
-
-Instead of tweaking the parameters of the various components of the
-chain, it is possible to run an exhaustive search of the best
-parameters on a grid of possible values. We try out all classifiers
-on either words or bigrams, with or without idf, and with a penalty
-parameter of either 0.01 or 0.001 for the linear SVM::
-
-  >>> from sklearn.model_selection import GridSearchCV
-  >>> parameters = {
-  ...     'vect__ngram_range': [(1, 1), (1, 2)],
-  ...     'tfidf__use_idf': (True, False),
-  ...     'clf__alpha': (1e-2, 1e-3),
-  ... }
-
-
-Obviously, such an exhaustive search can be expensive. If we have multiple
-CPU cores at our disposal, we can tell the grid searcher to try these eight
-parameter combinations in parallel with the ``n_jobs`` parameter. If we give
-this parameter a value of ``-1``, grid search will detect how many cores
-are installed and use them all::
-
-  >>> gs_clf = GridSearchCV(text_clf, parameters, cv=5, n_jobs=-1)
-
-The grid search instance behaves like a normal ``scikit-learn``
-model. Let's perform the search on a smaller subset of the training data
-to speed up the computation::
-
-  >>> gs_clf = gs_clf.fit(twenty_train.data[:400], twenty_train.target[:400])
-
-The result of calling ``fit`` on a ``GridSearchCV`` object is a classifier
-that we can use to ``predict``::
-
-  >>> twenty_train.target_names[gs_clf.predict(['God is love'])[0]]
-  'soc.religion.christian'
-
-The object's ``best_score_`` and ``best_params_`` attributes store the best
-mean score and the parameters setting corresponding to that score::
-
-  >>> gs_clf.best_score_
-  0.9...
-  >>> for param_name in sorted(parameters.keys()):
-  ...     print("%s: %r" % (param_name, gs_clf.best_params_[param_name]))
-  ...
-  clf__alpha: 0.001
-  tfidf__use_idf: True
-  vect__ngram_range: (1, 1)
-
-A more detailed summary of the search is available at ``gs_clf.cv_results_``.
-
-The ``cv_results_`` parameter can be easily imported into pandas as a
-``DataFrame`` for further inspection.
-
-.. note:
-
-  A ``GridSearchCV`` object also stores the best classifier that it trained
-  as its ``best_estimator_`` attribute. In this case, that isn't much use as
-  we trained on a small, 400-document subset of our full training set.
-
-
-Exercises
-~~~~~~~~~
-
-To do the exercises, copy the content of the 'skeletons' folder as
-a new folder named 'workspace':
-
-.. prompt:: bash $
-
-  cp -r skeletons workspace
-
-
-You can then edit the content of the workspace without fear of losing
-the original exercise instructions.
-
-Then fire an ipython shell and run the work-in-progress script with::
-
-  [1] %run workspace/exercise_XX_script.py arg1 arg2 arg3
-
-If an exception is triggered, use ``%debug`` to fire-up a post
-mortem ipdb session.
-
-Refine the implementation and iterate until the exercise is solved.
-
-**For each exercise, the skeleton file provides all the necessary import
-statements, boilerplate code to load the data and sample code to evaluate
-the predictive accuracy of the model.**
-
-
-Exercise 1: Language identification
------------------------------------
-
-- Write a text classification pipeline using a custom preprocessor and
-  ``TfidfVectorizer`` set up to use character based n-grams, using data from Wikipedia articles as the training set.
-
-- Evaluate the performance on some held out test set.
-
-ipython command line::
-
-  %run workspace/exercise_01_language_train_model.py data/languages/paragraphs/
-
-
-Exercise 2: Sentiment Analysis on movie reviews
------------------------------------------------
-
-- Write a text classification pipeline to classify movie reviews as either
-  positive or negative.
-
-- Find a good set of parameters using grid search.
-
-- Evaluate the performance on a held out test set.
-
-ipython command line::
-
-  %run workspace/exercise_02_sentiment.py data/movie_reviews/txt_sentoken/
-
-
-Exercise 3: CLI text classification utility
--------------------------------------------
-
-Using the results of the previous exercises and the ``cPickle``
-module of the standard library, write a command line utility that
-detects the language of some text provided on ``stdin`` and estimate
-the polarity (positive or negative) if the text is written in
-English.
-
-Bonus point if the utility is able to give a confidence level for its
-predictions.
-
-
-Where to from here
-------------------
-
-Here are a few suggestions to help further your scikit-learn intuition
-upon the completion of this tutorial:
-
-
-* Try playing around with the ``analyzer`` and ``token normalisation`` under
-  :class:`CountVectorizer`.
-
-* If you don't have labels, try using
-  :ref:`Clustering <sphx_glr_auto_examples_text_plot_document_clustering.py>`
-  on your problem.
-
-* If you have multiple labels per document, e.g. categories, have a look
-  at the :ref:`Multiclass and multilabel section <multiclass>`.
-
-* Try using :ref:`Truncated SVD <LSA>` for
-  `latent semantic analysis <https://en.wikipedia.org/wiki/Latent_semantic_analysis>`_.
-
-* Have a look at using
-  :ref:`Out-of-core Classification
-  <sphx_glr_auto_examples_applications_plot_out_of_core_classification.py>` to
-  learn from data that would not fit into the computer main memory.
-
-* Have a look at the :ref:`Hashing Vectorizer <hashing_vectorizer>`
-  as a memory efficient alternative to :class:`CountVectorizer`.
diff --git a/doc/unsupervised_learning.rst b/doc/unsupervised_learning.rst
index 9c1de0c134623..57e8b429fd67e 100644
--- a/doc/unsupervised_learning.rst
+++ b/doc/unsupervised_learning.rst
@@ -1,9 +1,3 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
-.. include:: includes/big_toc_css.rst
-
 .. _unsupervised-learning:
 
 Unsupervised learning
diff --git a/doc/user_guide.rst b/doc/user_guide.rst
index cd2f331004aa9..81ce774a5155e 100644
--- a/doc/user_guide.rst
+++ b/doc/user_guide.rst
@@ -1,21 +1,9 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
-.. title:: User guide: contents
-
 .. _user_guide:
 
 ==========
 User Guide
 ==========
 
-.. include:: includes/big_toc_css.rst
-
-.. nice layout in the toc
-
-.. include:: tune_toc.rst
-
 .. toctree::
    :numbered:
    :maxdepth: 3
@@ -31,6 +19,8 @@ User Guide
    model_persistence.rst
    common_pitfalls.rst
    dispatching.rst
+   machine_learning_map.rst
+   presentations.rst
 
 Under Development
 -----------------
diff --git a/doc/visualizations.rst b/doc/visualizations.rst
index 9a44f6feb1b48..7252a2900eb26 100644
--- a/doc/visualizations.rst
+++ b/doc/visualizations.rst
@@ -1,9 +1,3 @@
-.. Places parent toc into the sidebar
-
-:parenttoc: True
-
-.. include:: includes/big_toc_css.rst
-
 .. _visualizations:
 
 ==============
@@ -63,12 +57,12 @@ the previously computed roc curve again by using the `plot` method of the
 Notice that we pass `alpha=0.8` to the plot functions to adjust the alpha
 values of the curves.
 
-.. topic:: Examples:
+.. rubric:: Examples
 
-    * :ref:`sphx_glr_auto_examples_miscellaneous_plot_roc_curve_visualization_api.py`
-    * :ref:`sphx_glr_auto_examples_miscellaneous_plot_partial_dependence_visualization_api.py`
-    * :ref:`sphx_glr_auto_examples_miscellaneous_plot_display_object_visualization.py`
-    * :ref:`sphx_glr_auto_examples_calibration_plot_compare_calibration.py`
+* :ref:`sphx_glr_auto_examples_miscellaneous_plot_roc_curve_visualization_api.py`
+* :ref:`sphx_glr_auto_examples_miscellaneous_plot_partial_dependence_visualization_api.py`
+* :ref:`sphx_glr_auto_examples_miscellaneous_plot_display_object_visualization.py`
+* :ref:`sphx_glr_auto_examples_calibration_plot_compare_calibration.py`
 
 Available Plotting Utilities
 ============================
diff --git a/doc/whats_new.rst b/doc/whats_new.rst
index ecf657936186d..e659e6453f9a0 100644
--- a/doc/whats_new.rst
+++ b/doc/whats_new.rst
@@ -15,6 +15,7 @@ Changelogs and release notes for all scikit-learn releases are linked in this pa
 .. toctree::
    :maxdepth: 2
 
+   whats_new/v1.6.rst
    whats_new/v1.5.rst
    whats_new/v1.4.rst
    whats_new/v1.3.rst
diff --git a/doc/whats_new/_contributors.rst b/doc/whats_new/_contributors.rst
index 21559e8112c0a..83f6ca5448b24 100644
--- a/doc/whats_new/_contributors.rst
+++ b/doc/whats_new/_contributors.rst
@@ -12,12 +12,12 @@
 .. role:: raw-latex(raw)
    :format: latex
 
-.. |MajorFeature| replace:: :raw-html:`<span class="badge badge-success">Major Feature</span>` :raw-latex:`{\small\sc [Major Feature]}`
-.. |Feature| replace:: :raw-html:`<span class="badge badge-success">Feature</span>` :raw-latex:`{\small\sc [Feature]}`
-.. |Efficiency| replace:: :raw-html:`<span class="badge badge-info">Efficiency</span>` :raw-latex:`{\small\sc [Efficiency]}`
-.. |Enhancement| replace:: :raw-html:`<span class="badge badge-info">Enhancement</span>` :raw-latex:`{\small\sc [Enhancement]}`
-.. |Fix| replace:: :raw-html:`<span class="badge badge-danger">Fix</span>` :raw-latex:`{\small\sc [Fix]}`
-.. |API| replace:: :raw-html:`<span class="badge badge-warning">API Change</span>` :raw-latex:`{\small\sc [API Change]}`
+.. |MajorFeature| replace:: :raw-html:`<span class="badge text-bg-success">Major Feature</span>` :raw-latex:`{\small\sc [Major Feature]}`
+.. |Feature| replace:: :raw-html:`<span class="badge text-bg-success">Feature</span>` :raw-latex:`{\small\sc [Feature]}`
+.. |Efficiency| replace:: :raw-html:`<span class="badge text-bg-info">Efficiency</span>` :raw-latex:`{\small\sc [Efficiency]}`
+.. |Enhancement| replace:: :raw-html:`<span class="badge text-bg-info">Enhancement</span>` :raw-latex:`{\small\sc [Enhancement]}`
+.. |Fix| replace:: :raw-html:`<span class="badge text-bg-danger">Fix</span>` :raw-latex:`{\small\sc [Fix]}`
+.. |API| replace:: :raw-html:`<span class="badge text-bg-warning">API Change</span>` :raw-latex:`{\small\sc [API Change]}`
 
 
 .. _Olivier Grisel: https://twitter.com/ogrisel
diff --git a/doc/whats_new/older_versions.rst b/doc/whats_new/older_versions.rst
index f4e1d1c0cdf10..dc440fcc800fe 100644
--- a/doc/whats_new/older_versions.rst
+++ b/doc/whats_new/older_versions.rst
@@ -1153,7 +1153,6 @@ Changelog
   datasets was created. These include:
   :ref:`sphx_glr_auto_examples_applications_plot_face_recognition.py`,
   :ref:`sphx_glr_auto_examples_applications_plot_species_distribution_modeling.py`,
-  :ref:`sphx_glr_auto_examples_applications_svm_gui.py`,
   :ref:`sphx_glr_auto_examples_applications_wikipedia_principal_eigenvector.py` and
   others.
 
diff --git a/doc/whats_new/v0.15.rst b/doc/whats_new/v0.15.rst
index d12c4a2526d71..6f87a2852b751 100644
--- a/doc/whats_new/v0.15.rst
+++ b/doc/whats_new/v0.15.rst
@@ -315,7 +315,7 @@ Enhancements
 Documentation improvements
 ...........................
 
-- The :ref:`Working With Text Data <text_data_tutorial>` tutorial
+- The Working With Text Data tutorial
   has now been worked in to the main documentation's tutorial section.
   Includes exercises and skeletons for tutorial presentation.
   Original tutorial created by several authors including
diff --git a/doc/whats_new/v1.4.rst b/doc/whats_new/v1.4.rst
index 7865ff38adb79..96715e49277b3 100644
--- a/doc/whats_new/v1.4.rst
+++ b/doc/whats_new/v1.4.rst
@@ -29,6 +29,15 @@ Version 1.4.1
 
 **February 2024**
 
+Changed models
+--------------
+
+- |API| The `tree_.value` attribute in :class:`tree.DecisionTreeClassifier`,
+  :class:`tree.DecisionTreeRegressor`, :class:`tree.ExtraTreeClassifier` and
+  :class:`tree.ExtraTreeRegressor` changed from an weighted absolute count
+  of number of samples to a weighted fraction of the total number of samples.
+  :pr:`27639` by :user:`Samuel Ronsin <samronsin>`.
+
 Metadata Routing
 ----------------
 
diff --git a/doc/whats_new/v1.5.rst b/doc/whats_new/v1.5.rst
index 9e13171e88528..059875eec12d6 100644
--- a/doc/whats_new/v1.5.rst
+++ b/doc/whats_new/v1.5.rst
@@ -8,19 +8,124 @@
 Version 1.5
 ===========
 
-..
-  -- UNCOMMENT WHEN 1.5.0 IS RELEASED --
-  For a short description of the main highlights of the release, please refer to
-  :ref:`sphx_glr_auto_examples_release_highlights_plot_release_highlights_1_5_0.py`.
+For a short description of the main highlights of the release, please refer to
+:ref:`sphx_glr_auto_examples_release_highlights_plot_release_highlights_1_5_0.py`.
 
 .. include:: changelog_legend.inc
 
+.. _changes_1_5_2:
+
+Version 1.5.2
+=============
+
+**release date of 1.5.2**
+
+Changelog
+---------
+
+:mod:`sklearn.compose`
+......................
+
+- |Fix| Fixed :class:`compose.TransformedTargetRegressor` not to raise `UserWarning` if
+  transform output is set to `pandas` or `polars`, since it isn't a transformer.
+  :pr:`29401` by :user:`Stefanie Senger <StefanieSenger>`.
+
+.. _changes_1_5_1:
+
+Version 1.5.1
+=============
+
+**July 2024**
+
+Changes impacting many modules
+------------------------------
+
+- |Fix| Fixed a regression in the validation of the input data of all estimators where
+  an unexpected error was raised when passing a DataFrame backed by a read-only buffer.
+  :pr:`29018` by :user:`Jérémie du Boisberranger <jeremiedbb>`.
+
+- |Fix| Fixed a regression causing a dead-lock at import time in some settings.
+  :pr:`29235` by :user:`Jérémie du Boisberranger <jeremiedbb>`.
+
+Changelog
+---------
+
+:mod:`sklearn.compose`
+......................
+
+- |Efficiency| Fix a performance regression in :class:`compose.ColumnTransformer`
+  where the full input data was copied for each transformer when `n_jobs > 1`.
+  :pr:`29330` by :user:`Jérémie du Boisberranger <jeremiedbb>`.
+
+:mod:`sklearn.metrics`
+......................
+
+- |Fix| Fix a regression in :func:`metrics.r2_score`. Passing torch CPU tensors
+  with array API dispatched disabled would complain about non-CPU devices
+  instead of implicitly converting those inputs as regular NumPy arrays.
+  :pr:`29119` by :user:`Olivier Grisel`.
+
+- |Fix| Fix a regression in :func:`metrics.accuracy_score` and in
+  :func:`metrics.zero_one_loss` causing an error for Array API dispatch with multilabel
+  inputs.
+  :pr:`29269` by :user:`Yaroslav Korobko <Tialo>` and
+  :pr:`29336` by :user:`Edoardo Abati <EdAbati>`.
+
+:mod:`sklearn.model_selection`
+..............................
+
+- |Fix| Fix a regression in :class:`model_selection.GridSearchCV` for parameter
+  grids that have heterogeneous parameter values.
+  :pr:`29078` by :user:`Loïc Estève <lesteve>`.
+
+- |Fix| Fix a regression in :class:`model_selection.GridSearchCV` for parameter
+  grids that have estimators as parameter values.
+  :pr:`29179` by :user:`Marco Gorelli<MarcoGorelli>`.
+
+- |Fix| Fix a regression in :class:`model_selection.GridSearchCV` for parameter
+  grids that have arrays of different sizes as parameter values.
+  :pr:`29314` by :user:`Marco Gorelli<MarcoGorelli>`.
+
+:mod:`sklearn.tree`
+...................
+
+- |Fix| Fix an issue in :func:`tree.export_graphviz` and :func:`tree.plot_tree`
+  that could potentially result in exception or wrong results on 32bit OSes.
+  :pr:`29327` by :user:`Loïc Estève<lesteve>`.
+
+:mod:`sklearn.utils`
+....................
+
+- |API| :func:`utils.validation.check_array` has a new parameter, `force_writeable`, to
+  control the writeability of the output array. If set to `True`, the output array will
+  be guaranteed to be writeable and a copy will be made if the input array is read-only.
+  If set to `False`, no guarantee is made about the writeability of the output array.
+  :pr:`29018` by :user:`Jérémie du Boisberranger <jeremiedbb>`.
+
 .. _changes_1_5:
 
 Version 1.5.0
 =============
 
-**In Development**
+**May 2024**
+
+Security
+--------
+
+- |Fix| :class:`feature_extraction.text.CountVectorizer` and
+  :class:`feature_extraction.text.TfidfVectorizer` no longer store discarded
+  tokens from the training set in their `stop_words_` attribute. This attribute
+  would hold too frequent (above `max_df`) but also too rare tokens (below
+  `min_df`). This fixes a potential security issue (data leak) if the discarded
+  rare tokens hold sensitive information from the training set without the
+  model developer's knowledge.
+
+  Note: users of those classes are encouraged to either retrain their pipelines
+  with the new scikit-learn version or to manually clear the `stop_words_`
+  attribute from previously trained instances of those transformers. This
+  attribute was designed only for model inspection purposes and has no impact
+  on the behavior of the transformers.
+  :pr:`28823` by :user:`Olivier Grisel <ogrisel>`.
 
 Changed models
 --------------
@@ -31,6 +136,28 @@ Changed models
   properties).
   :pr:`27344` by :user:`Xuefeng Xu <xuefeng-xu>`.
 
+- |Enhancement| :class:`decomposition.PCA`, :class:`decomposition.SparsePCA`
+  and :class:`decomposition.TruncatedSVD` now set the sign of the `components_`
+  attribute based on the component values instead of using the transformed data
+  as reference. This change is needed to be able to offer consistent component
+  signs across all `PCA` solvers, including the new
+  `svd_solver="covariance_eigh"` option introduced in this release.
+
+Changes impacting many modules
+------------------------------
+
+- |Fix| Raise `ValueError` with an informative error message when passing 1D
+  sparse arrays to methods that expect 2D sparse inputs.
+  :pr:`28988` by :user:`Olivier Grisel <ogrisel>`.
+
+- |API| The name of the input of the `inverse_transform` method of estimators has been
+  standardized to `X`. As a consequence, `Xt` is deprecated and will be removed in
+  version 1.7 in the following estimators: :class:`cluster.FeatureAgglomeration`,
+  :class:`decomposition.MiniBatchNMF`, :class:`decomposition.NMF`,
+  :class:`model_selection.GridSearchCV`, :class:`model_selection.RandomizedSearchCV`,
+  :class:`pipeline.Pipeline` and :class:`preprocessing.KBinsDiscretizer`.
+  :pr:`28756` by :user:`Will Dean <wd60622>`.
+
 Support for Array API
 ---------------------
 
@@ -42,20 +169,29 @@ See :ref:`array_api` for more details.
 **Functions:**
 
 - :func:`sklearn.metrics.r2_score` now supports Array API compliant inputs.
-  :pr:`27904` by :user:`Eric Lindgren <elindgren>`, `Franck Charras <fcharras>`,
-  `Olivier Grisel <ogrisel>` and `Tim Head <betatim>`.
+  :pr:`27904` by :user:`Eric Lindgren <elindgren>`, :user:`Franck Charras <fcharras>`,
+  :user:`Olivier Grisel <ogrisel>` and :user:`Tim Head <betatim>`.
 
 **Classes:**
 
+- :class:`linear_model.Ridge` now supports the Array API for the `svd` solver.
+  See :ref:`array_api` for more details.
+  :pr:`27800` by :user:`Franck Charras <fcharras>`, :user:`Olivier Grisel <ogrisel>`
+  and :user:`Tim Head <betatim>`.
+
 Support for building with Meson
 -------------------------------
 
-Meson is now supported as a build backend, see :ref:`Building from source
-<install_bleeding_edge>` for more details.
+From scikit-learn 1.5 onwards, Meson is the main supported way to build
+scikit-learn, see :ref:`Building from source <install_bleeding_edge>` for more
+details.
 
-:pr:`28040` by :user:`Loïc Estève <lesteve>`
+Unless we discover a major blocker, setuptools support will be dropped in
+scikit-learn 1.6. The 1.5.x releases will support building scikit-learn with
+setuptools.
 
-TODO Fill more details before the 1.5 release, when the Meson story has settled down.
+Meson support for building scikit-learn was added in :pr:`28040` by
+:user:`Loïc Estève <lesteve>`
 
 Metadata Routing
 ----------------
@@ -71,7 +207,8 @@ more details.
   now support metadata routing. The fit methods now
   accept ``**fit_params`` which are passed to the underlying estimators
   via their `fit` methods.
-  :pr:`28432` by :user:`Adam Li <adam2392>` and :user:`Benjamin Bossan <BenjaminBossan>`.
+  :pr:`28432` by :user:`Adam Li <adam2392>` and
+  :user:`Benjamin Bossan <BenjaminBossan>`.
 
 - |Feature| :class:`linear_model.RidgeCV` and
   :class:`linear_model.RidgeClassifierCV` now support metadata routing in
@@ -95,8 +232,8 @@ more details.
 
 - |Feature| :class:`pipeline.FeatureUnion` now supports metadata routing in its
   ``fit`` and ``fit_transform`` methods and route metadata to the underlying
-  transformers' ``fit`` and ``fit_transform``. :pr:`28205` by :user:`Stefanie
-  Senger <StefanieSenger>`.
+  transformers' ``fit`` and ``fit_transform``.
+  :pr:`28205` by :user:`Stefanie Senger <StefanieSenger>`.
 
 - |Fix| Fix an issue when resolving default routing requests set via class
   attributes.
@@ -106,6 +243,10 @@ more details.
   methods, which can happen if one tries to decorate them.
   :pr:`28651` by `Adrin Jalali`_.
 
+- |FIX| Prevent a `RecursionError` when estimators with the default `scoring`
+  param (`None`) route metadata.
+  :pr:`28712` by :user:`Stefanie Senger <StefanieSenger>`.
+
 Changelog
 ---------
 
@@ -120,13 +261,27 @@ Changelog
     :pr:`123456` by :user:`Joe Bloggs <joeongithub>`.
     where 123455 is the *pull request* number, not the issue number.
 
+:mod:`sklearn.calibration`
+..........................
+
+- |Fix| Fixed a regression in :class:`calibration.CalibratedClassifierCV` where
+  an error was wrongly raised with string targets.
+  :pr:`28843` by :user:`Jérémie du Boisberranger <jeremiedbb>`.
+
 :mod:`sklearn.cluster`
 ......................
 
+- |Fix| The :class:`cluster.MeanShift` class now properly converges for constant data.
+  :pr:`28951` by :user:`Akihiro Kuno <akikuno>`.
+
 - |FIX| Create copy of precomputed sparse matrix within the `fit` method of
   :class:`~cluster.OPTICS` to avoid in-place modification of the sparse matrix.
   :pr:`28491` by :user:`Thanh Lam Dang <lamdang2k>`.
 
+- |Fix| :class:`cluster.HDBSCAN` now supports all metrics supported by
+  :func:`sklearn.metrics.pairwise_distances` when `algorithm="brute"` or `"auto"`.
+  :pr:`28664` by :user:`Manideep Yenugula <myenugula>`.
+
 :mod:`sklearn.compose`
 ......................
 
@@ -138,16 +293,31 @@ Changelog
   being explicitly set as well.
   :pr:`28483` by :user:`Stefanie Senger <StefanieSenger>`.
 
+- |Enhancement| :class:`compose.ColumnTransformer` can now expose the "remainder"
+  columns in the fitted `transformers_` attribute as column names or boolean
+  masks, rather than column indices.
+  :pr:`27657` by :user:`Jérôme Dockès <jeromedockes>`.
+
+- |Fix| Fixed an bug in :class:`compose.ColumnTransformer` with `n_jobs > 1`, where the
+  intermediate selected columns were passed to the transformers as read-only arrays.
+  :pr:`28822` by :user:`Jérémie du Boisberranger <jeremiedbb>`.
+
 :mod:`sklearn.cross_decomposition`
 ..................................
 
-- |API| Deprecates `Y` in favor of `y` in the methods fit, transform and inverse_transform of:
+- |Fix| The `coef_` fitted attribute of :class:`cross_decomposition.PLSRegression`
+  now takes into account both the scale of `X` and `Y` when `scale=True`. Note that
+  the previous predicted values were not affected by this bug.
+  :pr:`28612` by :user:`Guillaume Lemaitre <glemaitre>`.
+
+- |API| Deprecates `Y` in favor of `y` in the methods fit, transform and
+  inverse_transform of:
   :class:`cross_decomposition.PLSRegression`.
   :class:`cross_decomposition.PLSCanonical`,
   :class:`cross_decomposition.CCA`,
   and :class:`cross_decomposition.PLSSVD`.
   `Y` will be removed in version 1.7.
-  :pr:`28604` by :user:`David Leon <davidleon123>`
+  :pr:`28604` by :user:`David Leon <davidleon123>`.
 
 :mod:`sklearn.datasets`
 .......................
@@ -164,15 +334,39 @@ Changelog
   :func:`datasets.fetch_rcv1`,
   and :func:`datasets.fetch_species_distributions`.
   By default, the functions will retry up to 3 times in case of network failures.
-  :pr:`28160` by :user:`Zhehao Liu <MaxwellLZH>` and :user:`Filip Karlo Došilović <fkdosilovic>`.
+  :pr:`28160` by :user:`Zhehao Liu <MaxwellLZH>` and
+  :user:`Filip Karlo Došilović <fkdosilovic>`.
 
 :mod:`sklearn.decomposition`
 ............................
 
+- |Efficiency| :class:`decomposition.PCA` with `svd_solver="full"` now assigns
+  a contiguous `components_` attribute instead of an non-contiguous slice of
+  the singular vectors. When `n_components << n_features`, this can save some
+  memory and, more importantly, help speed-up subsequent calls to the `transform`
+  method by more than an order of magnitude by leveraging cache locality of
+  BLAS GEMM on contiguous arrays.
+  :pr:`27491` by :user:`Olivier Grisel <ogrisel>`.
+
 - |Enhancement| :class:`~decomposition.PCA` now automatically selects the ARPACK solver
   for sparse inputs when `svd_solver="auto"` instead of raising an error.
   :pr:`28498` by :user:`Thanh Lam Dang <lamdang2k>`.
 
+- |Enhancement| :class:`decomposition.PCA` now supports a new solver option
+  named `svd_solver="covariance_eigh"` which offers an order of magnitude
+  speed-up and reduced memory usage for datasets with a large number of data
+  points and a small number of features (say, `n_samples >> 1000 >
+  n_features`). The `svd_solver="auto"` option has been updated to use the new
+  solver automatically for such datasets. This solver also accepts sparse input
+  data.
+  :pr:`27491` by :user:`Olivier Grisel <ogrisel>`.
+
+- |Fix| :class:`decomposition.PCA` fit with `svd_solver="arpack"`,
+  `whiten=True` and a value for `n_components` that is larger than the rank of
+  the training set, no longer returns infinite values when transforming
+  hold-out data.
+  :pr:`27491` by :user:`Olivier Grisel <ogrisel>`.
+
 :mod:`sklearn.dummy`
 ....................
 
@@ -192,6 +386,11 @@ Changelog
   pre-sorting the data before finding the thresholds for binning.
   :pr:`28102` by :user:`Christian Lorentzen <lorentzenchr>`.
 
+- |Fix| Fixes a bug in :class:`ensemble.HistGradientBoostingClassifier` and
+  :class:`ensemble.HistGradientBoostingRegressor` when `monotonic_cst` is specified
+  for non-categorical features.
+  :pr:`28925` by :user:`Xiao Yuan <yuanx749>`.
+
 :mod:`sklearn.feature_extraction`
 .................................
 
@@ -234,15 +433,15 @@ Changelog
 :mod:`sklearn.linear_model`
 ...........................
 
+- |Enhancement| Solver `"newton-cg"` in :class:`linear_model.LogisticRegression` and
+  :class:`linear_model.LogisticRegressionCV` now emits information when `verbose` is
+  set to positive values.
+  :pr:`27526` by :user:`Christian Lorentzen <lorentzenchr>`.
+
 - |Fix| :class:`linear_model.ElasticNet`, :class:`linear_model.ElasticNetCV`,
   :class:`linear_model.Lasso` and :class:`linear_model.LassoCV` now explicitly don't
-  accept large sparse data formats. :pr:`27576` by :user:`Stefanie Senger
-  <StefanieSenger>`.
-
-- |API| :class:`linear_model.RidgeCV` and :class:`linear_model.RidgeClassifierCV`
-  will now allow `alpha=0` when `cv != None`, which is consistent with
-  :class:`linear_model.Ridge` and :class:`linear_model.RidgeClassifier`.
-  :pr:`28425` by :user:`Lucy Liu <lucyleeow>`.
+  accept large sparse data formats.
+  :pr:`27576` by :user:`Stefanie Senger <StefanieSenger>`.
 
 - |Fix| :class:`linear_model.RidgeCV` and :class:`RidgeClassifierCV` correctly pass
   `sample_weight` to the underlying scorer when `cv` is None.
@@ -252,6 +451,11 @@ Changelog
   will now always be `None` when `tol` is set, as `n_nonzero_coefs` is ignored in
   this case. :pr:`28557` by :user:`Lucy Liu <lucyleeow>`.
 
+- |API| :class:`linear_model.RidgeCV` and :class:`linear_model.RidgeClassifierCV`
+  will now allow `alpha=0` when `cv != None`, which is consistent with
+  :class:`linear_model.Ridge` and :class:`linear_model.RidgeClassifier`.
+  :pr:`28425` by :user:`Lucy Liu <lucyleeow>`.
+
 - |API| Passing `average=0` to disable averaging is deprecated in
   :class:`linear_model.PassiveAggressiveClassifier`,
   :class:`linear_model.PassiveAggressiveRegressor`,
@@ -259,6 +463,19 @@ Changelog
   :class:`linear_model.SGDOneClassSVM`. Pass `average=False` instead.
   :pr:`28582` by :user:`Jérémie du Boisberranger <jeremiedbb>`.
 
+- |API| Parameter `multi_class` was deprecated in
+  :class:`linear_model.LogisticRegression` and
+  :class:`linear_model.LogisticRegressionCV`. `multi_class` will be removed in 1.7,
+  and internally, for 3 and more classes, it will always use multinomial.
+  If you still want to use the one-vs-rest scheme, you can use
+  `OneVsRestClassifier(LogisticRegression(..))`.
+  :pr:`28703` by :user:`Christian Lorentzen <lorentzenchr>`.
+
+- |API| `store_cv_values` and `cv_values_` are deprecated in favor of
+  `store_cv_results` and `cv_results_` in `~linear_model.RidgeCV` and
+  `~linear_model.RidgeClassifierCV`.
+  :pr:`28915` by :user:`Lucy Liu <lucyleeow>`.
+
 :mod:`sklearn.manifold`
 .......................
 
@@ -275,8 +492,15 @@ Changelog
   :pr:`27456` by :user:`Venkatachalam N <venkyyuvy>`, :user:`Kshitij Mathur <Kshitij68>`
   and :user:`Julian Libiseller-Egger <julibeg>`.
 
+- |Feature| :func:`sklearn.metrics.check_scoring` now returns a multi-metric scorer
+  when `scoring` as a `dict`, `set`, `tuple`, or `list`. :pr:`28360` by `Thomas Fan`_.
+
+- |Feature| :func:`metrics.d2_log_loss_score` has been added which
+  calculates the D^2 score for the log loss.
+  :pr:`28351` by :user:`Omar Salman <OmarManzoor>`.
+
 - |Efficiency| Improve efficiency of functions :func:`~metrics.brier_score_loss`,
-  :func:`~metrics.calibration_curve`, :func:`~metrics.det_curve`,
+  :func:`~calibration.calibration_curve`, :func:`~metrics.det_curve`,
   :func:`~metrics.precision_recall_curve`,
   :func:`~metrics.roc_curve` when `pos_label` argument is specified.
   Also improve efficiency of methods `from_estimator`
@@ -285,9 +509,6 @@ Changelog
   :class:`~calibration.CalibrationDisplay`.
   :pr:`28051` by :user:`Pierre de Fréminville <pidefrem>`.
 
-- |Feature| :func:`sklearn.metrics.check_scoring` now returns a multi-metric scorer
-  when `scoring` as a `dict`, `set`, `tuple`, or `list`. :pr:`28360` by `Thomas Fan`_.
-
 - |Fix|:class:`metrics.classification_report` now shows only accuracy and not
   micro-average when input is a subset of labels.
   :pr:`28399` by :user:`Vineet Joshi <vjoshi253>`.
@@ -296,14 +517,18 @@ Changelog
   computation. This is likely to affect neighbor-based algorithms.
   :pr:`28692` by :user:`Loïc Estève <lesteve>`.
 
-- |API| :func:`metrics.precision_recall_curve` deprecated the keyword argument `probas_pred`
-  in favor of `y_score`. `probas_pred` will be removed in version 1.7.
+- |API| :func:`metrics.precision_recall_curve` deprecated the keyword argument
+  `probas_pred` in favor of `y_score`. `probas_pred` will be removed in version 1.7.
   :pr:`28092` by :user:`Adam Li <adam2392>`.
 
 - |API| :func:`metrics.brier_score_loss` deprecated the keyword argument `y_prob`
   in favor of `y_proba`. `y_prob` will be removed in version 1.7.
   :pr:`28092` by :user:`Adam Li <adam2392>`.
 
+- |API| For classifiers and classification metrics, labels encoded as bytes
+  is deprecated and will raise an error in v1.7.
+  :pr:`18555` by :user:`Kaushik Amar Das <cozek>`.
+
 :mod:`sklearn.mixture`
 ......................
 
@@ -315,21 +540,37 @@ Changelog
 :mod:`sklearn.model_selection`
 ..............................
 
+- |MajorFeature| :class:`model_selection.TunedThresholdClassifierCV` finds
+  the decision threshold of a binary classifier that maximizes a
+  classification metric through cross-validation.
+  :class:`model_selection.FixedThresholdClassifier` is an alternative when one wants
+  to use a fixed decision threshold without any tuning scheme.
+  :pr:`26120` by :user:`Guillaume Lemaitre <glemaitre>`.
+
 - |Enhancement| :term:`CV splitters <CV splitter>` that ignores the group parameter now
   raises a warning when groups are passed in to :term:`split`. :pr:`28210` by
+  `Thomas Fan`_.
+
+- |Enhancement| The HTML diagram representation of
+  :class:`~model_selection.GridSearchCV`,
+  :class:`~model_selection.RandomizedSearchCV`,
+  :class:`~model_selection.HalvingGridSearchCV`, and
+  :class:`~model_selection.HalvingRandomSearchCV` will show the best estimator when
+  `refit=True`. :pr:`28722` by :user:`Yao Xiao <Charlie-XIAO>` and `Thomas Fan`_.
+
 - |Fix| the ``cv_results_`` attribute (of :class:`model_selection.GridSearchCV`) now
   returns masked arrays of the appropriate NumPy dtype, as opposed to always returning
   dtype ``object``. :pr:`28352` by :user:`Marco Gorelli<MarcoGorelli>`.
 
-- |Fix| :func:`sklearn.model_selection.train_test_score` works with Array API inputs.
+- |Fix| :func:`model_selection.train_test_split` works with Array API inputs.
   Previously indexing was not handled correctly leading to exceptions when using strict
   implementations of the Array API like CuPY.
-  :pr:`28407` by `Tim Head <betatim>`.
+  :pr:`28407` by :user:`Tim Head <betatim>`.
 
 :mod:`sklearn.multioutput`
 ..........................
 
-- |Enhancement| `chain_method` parameter added to `:class:`multioutput.ClassifierChain`.
+- |Enhancement| `chain_method` parameter added to :class:`multioutput.ClassifierChain`.
   :pr:`27700` by :user:`Lucy Liu <lucyleeow>`.
 
 :mod:`sklearn.neighbors`
@@ -368,19 +609,59 @@ Changelog
 :mod:`sklearn.utils`
 ....................
 
+- |Fix| :func:`~utils._safe_indexing` now works correctly for polars DataFrame when
+  `axis=0` and supports indexing polars Series.
+  :pr:`28521` by :user:`Yao Xiao <Charlie-XIAO>`.
+
 - |API| :data:`utils.IS_PYPY` is deprecated and will be removed in version 1.7.
   :pr:`28768` by :user:`Jérémie du Boisberranger <jeremiedbb>`.
 
 - |API| :func:`utils.tosequence` is deprecated and will be removed in version 1.7.
   :pr:`28763` by :user:`Jérémie du Boisberranger <jeremiedbb>`.
 
-- |Fix| :func:`~utils._safe_indexing` now works correctly for polars DataFrame when
-  `axis=0` and supports indexing polars Series.
-  :pr:`28521` by :user:`Yao Xiao <Charlie-XIAO>`.
+- |API| :class:`utils.parallel_backend` and :func:`utils.register_parallel_backend` are
+  deprecated and will be removed in version 1.7. Use `joblib.parallel_backend` and
+  `joblib.register_parallel_backend` instead.
+  :pr:`28847` by :user:`Jérémie du Boisberranger <jeremiedbb>`.
+
+- |API| Raise informative warning message in :func:`~utils.multiclass.type_of_target`
+  when represented as bytes. For classifiers and classification metrics, labels encoded
+  as bytes is deprecated and will raise an error in v1.7.
+  :pr:`18555` by :user:`Kaushik Amar Das <cozek>`.
+
+- |API| :func:`utils.estimator_checks.check_estimator_sparse_data` was split into two
+  functions: :func:`utils.estimator_checks.check_estimator_sparse_matrix` and
+  :func:`utils.estimator_checks.check_estimator_sparse_array`.
+  :pr:`27576` by :user:`Stefanie Senger <StefanieSenger>`.
 
 .. rubric:: Code and documentation contributors
 
 Thanks to everyone who has contributed to the maintenance and improvement of
 the project since version 1.4, including:
 
-TODO: update at the time of the release.
+101AlexMartin, Abdulaziz Aloqeely, Adam J. Stewart, Adam Li, Adarsh Wase, Adrin
+Jalali, Advik Sinha, Akash Srivastava, Akihiro Kuno, Alan Guedes, Alexis
+IMBERT, Ana Paula Gomes, Anderson Nelson, Andrei Dzis, Arnaud Capitaine, Arturo
+Amor, Aswathavicky, Bharat Raghunathan, Brendan Lu, Bruno, Cemlyn, Christian
+Lorentzen, Christian Veenhuis, Cindy Liang, Claudio Salvatore Arcidiacono,
+Connor Boyle, Conrad Stevens, crispinlogan, davidleon123, DerWeh, Dipan Banik,
+Duarte São José, DUONG, Eddie Bergman, Edoardo Abati, Egehan Gunduz, Emad
+Izadifar, Erich Schubert, Filip Karlo Došilović, Franck Charras, Gael
+Varoquaux, Gönül Aycı, Guillaume Lemaitre, Gyeongjae Choi, Harmanan Kohli,
+Hong Xiang Yue, Ian Faust, itsaphel, Ivan Wiryadi, Jack Bowyer, Javier Marin
+Tur, Jérémie du Boisberranger, Jérôme Dockès, Jiawei Zhang, Joel Nothman,
+Johanna Bayer, John Cant, John Hopfensperger, jpcars, jpienaar-tuks, Julian
+Libiseller-Egger, Julien Jerphanion, KanchiMoe, Kaushik Amar Das, keyber,
+Koustav Ghosh, kraktus, Krsto Proroković, ldwy4, LeoGrin, lihaitao, Linus
+Sommer, Loic Esteve, Lucy Liu, Lukas Geiger, manasimj, Manuel Labbé, Manuel
+Morales, Marco Edward Gorelli, Maren Westermann, Marija Vlajic, Mark Elliot,
+Mateusz Sokół, Mavs, Michael Higgins, Michael Mayer, miguelcsilva, Miki
+Watanabe, Mohammed Hamdy, myenugula, Nathan Goldbaum, Naziya Mahimkar, Neto,
+Olivier Grisel, Omar Salman, Patrick Wang, Pierre de Fréminville, Priyash
+Shah, Puneeth K, Rahil Parikh, raisadz, Raj Pulapakura, Ralf Gommers, Ralph
+Urlus, Randolf Scholz, Reshama Shaikh, Richard Barnes, Rodrigo Romero, Saad
+Mahmood, Salim Dohri, Sandip Dutta, SarahRemus, scikit-learn-bot, Shaharyar
+Choudhry, Shubham, sperret6, Stefanie Senger, Suha Siddiqui, Thanh Lam DANG,
+thebabush, Thomas J. Fan, Thomas Lazarus, Thomas Li, Tialo, Tim Head, Tuhin
+Sharma, VarunChaduvula, Vineet Joshi, virchan, Waël Boukhobza, Weyb, Will
+Dean, Xavier Beltran, Xiao Yuan, Xuefeng Xu, Yao Xiao
diff --git a/doc/whats_new/v1.6.rst b/doc/whats_new/v1.6.rst
new file mode 100644
index 0000000000000..36dd6b8a963a2
--- /dev/null
+++ b/doc/whats_new/v1.6.rst
@@ -0,0 +1,230 @@
+.. include:: _contributors.rst
+
+.. currentmodule:: sklearn
+
+.. _release_notes_1_6:
+
+===========
+Version 1.6
+===========
+
+..
+  -- UNCOMMENT WHEN 1.6.0 IS RELEASED --
+  For a short description of the main highlights of the release, please refer to
+  :ref:`sphx_glr_auto_examples_release_highlights_plot_release_highlights_1_6_0.py`.
+
+.. include:: changelog_legend.inc
+
+.. _changes_1_6:
+
+Version 1.6.0
+=============
+
+**In Development**
+
+Support for Array API
+---------------------
+
+Additional estimators and functions have been updated to include support for all
+`Array API <https://data-apis.org/array-api/latest/>`_ compliant inputs.
+
+See :ref:`array_api` for more details.
+
+**Functions:**
+
+- :func:`sklearn.metrics.cluster.entropy` :pr:`29141` by :user:`Yaroslav Korobko <Tialo>`;
+- :func:`sklearn.metrics.d2_tweedie_score` :pr:`29207` by :user:`Emily Chen <EmilyXinyi>`;
+- :func:`sklearn.metrics.max_error` :pr:`29212` by :user:`Edoardo Abati <EdAbati>`;
+- :func:`sklearn.metrics.mean_absolute_error` :pr:`27736` by :user:`Edoardo Abati <EdAbati>`
+  and :pr:`29143` by :user:`Tialo <Tialo>` and :user:`Loïc Estève <lesteve>`;
+- :func:`sklearn.metrics.mean_absolute_percentage_error` :pr:`29300` by :user:`Emily Chen <EmilyXinyi>`;
+- :func:`sklearn.metrics.mean_gamma_deviance` :pr:`29239` by :user:`Emily Chen <EmilyXinyi>`;
+- :func:`sklearn.metrics.mean_squared_error` :pr:`29142` by :user:`Yaroslav Korobko <Tialo>`;
+- :func:`sklearn.metrics.mean_tweedie_deviance` :pr:`28106` by :user:`Thomas Li <lithomas1>`;
+- :func:`sklearn.metrics.pairwise.additive_chi2_kernel` :pr:`29144` by :user:`Yaroslav Korobko <Tialo>`;
+- :func:`sklearn.metrics.pairwise.chi2_kernel` :pr:`29267` by :user:`Yaroslav Korobko <Tialo>`;
+- :func:`sklearn.metrics.pairwise.cosine_similarity` :pr:`29014` by :user:`Edoardo Abati <EdAbati>`;
+- :func:`sklearn.metrics.pairwise.cosine_distances` :pr:`29265` by :user:`Emily Chen <EmilyXinyi>`;
+- :func:`sklearn.metrics.pairwise.euclidean_distances` :pr:`29433` by :user:`Omar Salman <OmarManzoor>`;
+- :func:`sklearn.metrics.pairwise.paired_cosine_distances` :pr:`29112` by :user:`Edoardo Abati <EdAbati>`;
+- :func:`sklearn.metrics.pairwise.rbf_kernel` :pr:`29433` by :user:`Omar Salman <OmarManzoor>`.
+
+**Classes:**
+
+- :class:`preprocessing.LabelEncoder` now supports Array API compatible inputs.
+  :pr:`27381` by :user:`Omar Salman <OmarManzoor>`.
+- :class:`model_selection.GridSearchCV`,
+  :class:`model_selection.RandomizedSearchCV`,
+  :class:`model_selection.HalvingGridSearchCV` and
+  :class:`model_selection.HalvingRandomSearchCV` now support Array API
+  compatible inputs when their base estimators do. :pr:`27096` by :user:`Tim
+  Head <betatim>` and :user:`Olivier Grisel <ogrisel>`.
+
+Metadata Routing
+----------------
+
+The following models now support metadata routing in one or more of their
+methods. Refer to the :ref:`Metadata Routing User Guide <metadata_routing>` for
+more details.
+
+- |Feature| :func:`model_selection.learning_curve` now supports metadata routing for the
+  `fit` method of its estimator and for its underlying CV splitter and scorer.
+  :pr:`28975` by :user:`Stefanie Senger <StefanieSenger>`.
+
+- |Feature| :class:`ensemble.StackingClassifier` and
+  :class:`ensemble.StackingRegressor` now support metadata routing and pass
+  ``**fit_params`` to the underlying estimators via their `fit` methods.
+  :pr:`28701` by :user:`Stefanie Senger <StefanieSenger>`.
+  
+- |Feature| :class:`compose.TransformedTargetRegressor` now supports metadata
+  routing in its `fit` and `predict` methods and routes the corresponding
+  params to the underlying regressor.
+  :pr:`29136` by :user:`Omar Salman <OmarManzoor>`.
+
+- |Feature| :func:`model_selection.validation_curve` now supports metadata routing for
+  the `fit` method of its estimator and for its underlying CV splitter and scorer.
+  :pr:`29329` by :user:`Stefanie Senger <StefanieSenger>`.
+
+- |Feature| :class:`semi_supervised.SelfTrainingClassifier`
+  now supports metadata routing. The fit method now accepts ``**fit_params``
+  which are passed to the underlying estimators via their `fit` methods.
+  In addition, the `predict`, `predict_proba`, `predict_log_proba`, `score`
+  and `decision_function` methods also accept ``**params`` which are
+  passed to the underlying estimators via their respective methods.
+  :pr:`28494` by :user:`Adam Li <adam2392>`.
+
+Dropping official support for PyPy
+----------------------------------
+
+Due to limited maintainer resources and small number of users, official PyPy
+support has been dropped. Some parts of scikit-learn may still work but PyPy is
+not tested anymore in the scikit-learn Continuous Integration.
+:pr:`29128` by :user:`Loïc Estève <lesteve>`.
+
+Changelog
+---------
+
+..
+    Entries should be grouped by module (in alphabetic order) and prefixed with
+    one of the labels: |MajorFeature|, |Feature|, |Efficiency|, |Enhancement|,
+    |Fix| or |API| (see whats_new.rst for descriptions).
+    Entries should be ordered by those labels (e.g. |Fix| after |Efficiency|).
+    Changes not specific to a module should be listed under *Multiple Modules*
+    or *Miscellaneous*.
+    Entries should end with:
+    :pr:`123456` by :user:`Joe Bloggs <joeongithub>`.
+    where 123455 is the *pull request* number, not the issue number.
+
+:mod:`sklearn.base`
+...................
+
+- |Enhancement| Added a function :func:`base.is_clusterer` which determines
+  whether a given estimator is of category clusterer.
+  :pr:`28936` by :user:`Christian Veenhuis <ChVeen>`.
+
+:mod:`sklearn.cluster`
+......................
+
+- |API| The `copy` parameter of :class:`cluster.Birch` was deprecated in 1.6 and will be
+  removed in 1.8. It has no effect as the estimator does not perform in-place operations
+  on the input data.
+  :pr:`29124` by :user:`Yao Xiao <Charlie-XIAO>`.
+
+:mod:`sklearn.discriminant_analysis`
+....................................
+
+- |Fix| :class:`discriminant_analysis.QuadraticDiscriminantAnalysis`
+  will now cause `LinAlgWarning` in case of collinear variables. These errors
+  can be silenced using the `reg_param` attribute.
+  :pr:`19731` by :user:`Alihan Zihna <azihna>`.
+
+:mod:`sklearn.ensemble`
+.......................
+
+- |Efficiency| Small runtime improvement of fitting
+  :class:`ensemble.HistGradientBoostingClassifier` and :class:`ensemble.HistGradientBoostingRegressor`
+  by parallelizing the initial search for bin thresholds
+  :pr:`28064` by :user:`Christian Lorentzen <lorentzenchr>`.
+
+- |Efficiency| :class:`ensemble.IsolationForest` now runs parallel jobs
+  during :term:`predict` offering a speedup of up to 2-4x on sample sizes
+  larger than 2000 using `joblib`.
+  :pr:`28622` by :user:`Adam Li <adam2392>` and
+  :user:`Sérgio Pereira <sergiormpereira>`.
+
+:mod:`sklearn.impute`
+.....................
+
+- |Fix| :class:`impute.KNNImputer` excludes samples with nan distances when
+  computing the mean value for uniform weights.
+  :pr:`29135` by :user:`Xuefeng Xu <xuefeng-xu>`.
+
+:mod:`sklearn.linear_model`
+...........................
+
+- |API| Deprecates `copy_X` in :class:`linear_model.TheilSenRegressor` as the parameter
+  has no effect. `copy_X` will be removed in 1.8.
+  :pr:`29105` by :user:`Adam Li <adam2392>`.
+
+:mod:`sklearn.manifold`
+.......................
+
+- |Efficiency| :func:`manifold.locally_linear_embedding` and
+  :class:`manifold.LocallyLinearEmbedding` now allocate more efficiently the memory of
+  sparse matrices in the Hessian, Modified and LTSA methods.
+  :pr:`28096` by :user:`Giorgio Angelotti <giorgioangel>`.
+
+:mod:`sklearn.metrics`
+......................
+
+- |Enhancement| :func:`sklearn.metrics.check_scoring` now accepts `raise_exc` to specify
+  whether to raise an exception if a subset of the scorers in multimetric scoring fails
+  or to return an error code. :pr:`28992` by :user:`Stefanie Senger <StefanieSenger>`.
+
+- |Enhancement| Adds `zero_division` to :func:`cohen_kappa_score`. When there is a
+  division by zero, the metric is undefined and this value is returned.
+  :pr:`29210` by :user:`Marc Torrellas Socastro <marctorsoc>` and
+  :user:`Stefanie Senger <StefanieSenger>`.
+
+:mod:`sklearn.mixture`
+..............................
+
+- |Feature| Add  :class:`mixture.GaussianMixtureIC` to perform Gaussian mixture
+  model selection.
+  :pr:`26735` by :user:`Tingshan Liu <tingshanL>`.
+
+:mod:`sklearn.model_selection`
+..............................
+
+- |Enhancement| Add the parameter `prefit` to
+  :class:`model_selection.FixedThresholdClassifier` allowing the use of a pre-fitted
+  estimator without re-fitting it.
+  :pr:`29067` by :user:`Guillaume Lemaitre <glemaitre>`.
+
+:mod:`sklearn.neighbors`
+........................
+
+- |Fix| :class:`neighbors.LocalOutlierFactor` raises a warning in the `fit` method
+  when duplicate values in the training data lead to inaccurate outlier detection.
+  :pr:`28773` by :user:`Henrique Caroço <HenriqueProj>`.
+
+:mod:`sklearn.semi_supervised`
+..............................
+
+- |API| :class:`semi_supervised.SelfTrainingClassifier`
+  deprecated the `base_estimator` parameter in favor of `estimator`.
+  :pr:`28494` by :user:`Adam Li <adam2392>`.
+
+:mod:`sklearn.tree`
+...................
+
+- |Feature| :class:`tree.ExtraTreeClassifier` and :class:`tree.ExtraTreeRegressor` now
+  support missing-values in the data matrix ``X``. Missing-values are handled by
+  randomly moving all of the samples to the left, or right child node as the tree is
+  traversed.
+  :pr:`27966` by :user:`Adam Li <adam2392>`.
+
+Thanks to everyone who has contributed to the maintenance and improvement of
+the project since version 1.5, including:
+
+TODO: update at the time of the release.
diff --git a/examples/README.txt b/examples/README.txt
index 958de667a5c69..57a4e7e60eb32 100644
--- a/examples/README.txt
+++ b/examples/README.txt
@@ -2,3 +2,8 @@
 
 Examples
 ========
+
+This is the gallery of examples that showcase how scikit-learn can be used. Some
+examples demonstrate the use of the :ref:`API <api_ref>` in general and some
+demonstrate specific applications in tutorial form. Also check out our
+:ref:`user guide <user_guide>` for more detailed illustrations.
diff --git a/examples/applications/plot_digits_denoising.py b/examples/applications/plot_digits_denoising.py
index 10d94aa0212d6..9d4b0cae79d06 100644
--- a/examples/applications/plot_digits_denoising.py
+++ b/examples/applications/plot_digits_denoising.py
@@ -12,12 +12,12 @@
 
 We will use USPS digits dataset to reproduce presented in Sect. 4 of [1]_.
 
-.. topic:: References
+.. rubric:: References
 
-   .. [1] `Bakır, Gökhan H., Jason Weston, and Bernhard Schölkopf.
-      "Learning to find pre-images."
-      Advances in neural information processing systems 16 (2004): 449-456.
-      <https://papers.nips.cc/paper/2003/file/ac1ad983e08ad3304a97e147f522747e-Paper.pdf>`_
+.. [1] `Bakır, Gökhan H., Jason Weston, and Bernhard Schölkopf.
+    "Learning to find pre-images."
+    Advances in neural information processing systems 16 (2004): 449-456.
+    <https://papers.nips.cc/paper/2003/file/ac1ad983e08ad3304a97e147f522747e-Paper.pdf>`_
 
 """
 
diff --git a/examples/applications/plot_model_complexity_influence.py b/examples/applications/plot_model_complexity_influence.py
index f83be241230c3..342dd4d899dab 100644
--- a/examples/applications/plot_model_complexity_influence.py
+++ b/examples/applications/plot_model_complexity_influence.py
@@ -36,10 +36,8 @@
 
 """
 
-# Authors: Eustache Diemert <eustache@diemert.fr>
-#          Maria Telenczuk <https://github.com/maikia>
-#          Guillaume Lemaitre <g.lemaitre58@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import time
 
diff --git a/examples/applications/plot_out_of_core_classification.py b/examples/applications/plot_out_of_core_classification.py
index 4183c4dabad75..a698c8e1c66e2 100644
--- a/examples/applications/plot_out_of_core_classification.py
+++ b/examples/applications/plot_out_of_core_classification.py
@@ -14,9 +14,8 @@
 
 """
 
-# Authors: Eustache Diemert <eustache@diemert.fr>
-#          @FedericoV <https://github.com/FedericoV/>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import itertools
 import re
diff --git a/examples/applications/plot_outlier_detection_wine.py b/examples/applications/plot_outlier_detection_wine.py
index 9db863828556e..6940a562119ae 100644
--- a/examples/applications/plot_outlier_detection_wine.py
+++ b/examples/applications/plot_outlier_detection_wine.py
@@ -23,8 +23,8 @@
 and can therefore model the complex shape of the data much better.
 """
 
-# Author: Virgile Fritsch <virgile.fritsch@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # First example
diff --git a/examples/applications/plot_prediction_latency.py b/examples/applications/plot_prediction_latency.py
index 0c966b3b1e28e..c67fd651cb083 100644
--- a/examples/applications/plot_prediction_latency.py
+++ b/examples/applications/plot_prediction_latency.py
@@ -13,8 +13,8 @@
 
 """
 
-# Authors: Eustache Diemert <eustache@diemert.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import gc
 import time
diff --git a/examples/applications/plot_species_distribution_modeling.py b/examples/applications/plot_species_distribution_modeling.py
index bdf50918840c2..ea5f2c4aaf97d 100644
--- a/examples/applications/plot_species_distribution_modeling.py
+++ b/examples/applications/plot_species_distribution_modeling.py
@@ -36,10 +36,8 @@
 
 """
 
-# Authors: Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#          Jake Vanderplas <vanderplas@astro.washington.edu>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from time import time
 
diff --git a/examples/applications/plot_stock_market.py b/examples/applications/plot_stock_market.py
index 30d9c441ffa57..c8790cdf13415 100644
--- a/examples/applications/plot_stock_market.py
+++ b/examples/applications/plot_stock_market.py
@@ -10,8 +10,8 @@
 that are linked tend to fluctuate in relation to each other during a day.
 """
 
-# Author: Gael Varoquaux gael.varoquaux@normalesup.org
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Retrieve the data from Internet
diff --git a/examples/applications/plot_time_series_lagged_features.py b/examples/applications/plot_time_series_lagged_features.py
index 9159825cbbd43..2efc12acae276 100644
--- a/examples/applications/plot_time_series_lagged_features.py
+++ b/examples/applications/plot_time_series_lagged_features.py
@@ -1,425 +1,435 @@
-"""
-===========================================
-Lagged features for time series forecasting
-===========================================
-
-This example demonstrates how Polars-engineered lagged features can be used
-for time series forecasting with
-:class:`~sklearn.ensemble.HistGradientBoostingRegressor` on the Bike Sharing
-Demand dataset.
-
-See the example on
-:ref:`sphx_glr_auto_examples_applications_plot_cyclical_feature_engineering.py`
-for some data exploration on this dataset and a demo on periodic feature
-engineering.
-
-"""
-
-# %%
-# Analyzing the Bike Sharing Demand dataset
-# -----------------------------------------
-#
-# We start by loading the data from the OpenML repository
-# as a pandas dataframe. This will be replaced with Polars
-# once `fetch_openml` adds a native support for it.
-# We convert to Polars for feature engineering, as it automatically caches
-# common subexpressions which are reused in multiple expressions
-# (like `pl.col("count").shift(1)` below). See
-# https://docs.pola.rs/user-guide/lazy/optimizations/ for more information.
-
-import numpy as np
-import polars as pl
-
-from sklearn.datasets import fetch_openml
-
-pl.Config.set_fmt_str_lengths(20)
-
-bike_sharing = fetch_openml(
-    "Bike_Sharing_Demand", version=2, as_frame=True, parser="pandas"
-)
-df = bike_sharing.frame
-df = pl.DataFrame({col: df[col].to_numpy() for col in df.columns})
-
-# %%
-# Next, we take a look at the statistical summary of the dataset
-# so that we can better understand the data that we are working with.
-import polars.selectors as cs
-
-summary = df.select(cs.numeric()).describe()
-summary
-
-# %%
-# Let us look at the count of the seasons `"fall"`, `"spring"`, `"summer"`
-# and `"winter"` present in the dataset to confirm they are balanced.
-
-import matplotlib.pyplot as plt
-
-df["season"].value_counts()
-
-
-# %%
-# Generating Polars-engineered lagged features
-# --------------------------------------------
-# Let's consider the problem of predicting the demand at the
-# next hour given past demands. Since the demand is a continuous
-# variable, one could intuitively use any regression model. However, we do
-# not have the usual `(X_train, y_train)` dataset. Instead, we just have
-# the `y_train` demand data sequentially organized by time.
-lagged_df = df.select(
-    "count",
-    *[pl.col("count").shift(i).alias(f"lagged_count_{i}h") for i in [1, 2, 3]],
-    lagged_count_1d=pl.col("count").shift(24),
-    lagged_count_1d_1h=pl.col("count").shift(24 + 1),
-    lagged_count_7d=pl.col("count").shift(7 * 24),
-    lagged_count_7d_1h=pl.col("count").shift(7 * 24 + 1),
-    lagged_mean_24h=pl.col("count").shift(1).rolling_mean(24),
-    lagged_max_24h=pl.col("count").shift(1).rolling_max(24),
-    lagged_min_24h=pl.col("count").shift(1).rolling_min(24),
-    lagged_mean_7d=pl.col("count").shift(1).rolling_mean(7 * 24),
-    lagged_max_7d=pl.col("count").shift(1).rolling_max(7 * 24),
-    lagged_min_7d=pl.col("count").shift(1).rolling_min(7 * 24),
-)
-lagged_df.tail(10)
-
-# %%
-# Watch out however, the first lines have undefined values because their own
-# past is unknown. This depends on how much lag we used:
-lagged_df.head(10)
-
-# %%
-# We can now separate the lagged features in a matrix `X` and the target variable
-# (the counts to predict) in an array of the same first dimension `y`.
-lagged_df = lagged_df.drop_nulls()
-X = lagged_df.drop("count")
-y = lagged_df["count"]
-print("X shape: {}\ny shape: {}".format(X.shape, y.shape))
-
-# %%
-# Naive evaluation of the next hour bike demand regression
-# --------------------------------------------------------
-# Let's randomly split our tabularized dataset to train a gradient
-# boosting regression tree (GBRT) model and evaluate it using Mean
-# Absolute Percentage Error (MAPE). If our model is aimed at forecasting
-# (i.e., predicting future data from past data), we should not use training
-# data that are ulterior to the testing data. In time series machine learning
-# the "i.i.d" (independent and identically distributed) assumption does not
-# hold true as the data points are not independent and have a temporal
-# relationship.
-from sklearn.ensemble import HistGradientBoostingRegressor
-from sklearn.model_selection import train_test_split
-
-X_train, X_test, y_train, y_test = train_test_split(
-    X, y, test_size=0.2, random_state=42
-)
-
-model = HistGradientBoostingRegressor().fit(X_train, y_train)
-
-# %%
-# Taking a look at the performance of the model.
-from sklearn.metrics import mean_absolute_percentage_error
-
-y_pred = model.predict(X_test)
-mean_absolute_percentage_error(y_test, y_pred)
-
-# %%
-# Proper next hour forecasting evaluation
-# ---------------------------------------
-# Let's use a proper evaluation splitting strategies that takes into account
-# the temporal structure of the dataset to evaluate our model's ability to
-# predict data points in the future (to avoid cheating by reading values from
-# the lagged features in the training set).
-from sklearn.model_selection import TimeSeriesSplit
-
-ts_cv = TimeSeriesSplit(
-    n_splits=3,  # to keep the notebook fast enough on common laptops
-    gap=48,  # 2 days data gap between train and test
-    max_train_size=10000,  # keep train sets of comparable sizes
-    test_size=3000,  # for 2 or 3 digits of precision in scores
-)
-all_splits = list(ts_cv.split(X, y))
-
-# %%
-# Training the model and evaluating its performance based on MAPE.
-train_idx, test_idx = all_splits[0]
-X_train, X_test = X[train_idx, :], X[test_idx, :]
-y_train, y_test = y[train_idx], y[test_idx]
-
-model = HistGradientBoostingRegressor().fit(X_train, y_train)
-y_pred = model.predict(X_test)
-mean_absolute_percentage_error(y_test, y_pred)
-
-# %%
-# The generalization error measured via a shuffled trained test split
-# is too optimistic. The generalization via a time-based split is likely to
-# be more representative of the true performance of the regression model.
-# Let's assess this variability of our error evaluation with proper
-# cross-validation:
-from sklearn.model_selection import cross_val_score
-
-cv_mape_scores = -cross_val_score(
-    model, X, y, cv=ts_cv, scoring="neg_mean_absolute_percentage_error"
-)
-cv_mape_scores
-
-# %%
-# The variability across splits is quite large! In a real life setting
-# it would be advised to use more splits to better assess the variability.
-# Let's report the mean CV scores and their standard deviation from now on.
-print(f"CV MAPE: {cv_mape_scores.mean():.3f} ± {cv_mape_scores.std():.3f}")
-
-# %%
-# We can compute several combinations of evaluation metrics and loss functions,
-# which are reported a bit below.
-from collections import defaultdict
-
-from sklearn.metrics import (
-    make_scorer,
-    mean_absolute_error,
-    mean_pinball_loss,
-    root_mean_squared_error,
-)
-from sklearn.model_selection import cross_validate
-
-
-def consolidate_scores(cv_results, scores, metric):
-    if metric == "MAPE":
-        scores[metric].append(f"{value.mean():.2f} ± {value.std():.2f}")
-    else:
-        scores[metric].append(f"{value.mean():.1f} ± {value.std():.1f}")
-
-    return scores
-
-
-scoring = {
-    "MAPE": make_scorer(mean_absolute_percentage_error),
-    "RMSE": make_scorer(root_mean_squared_error),
-    "MAE": make_scorer(mean_absolute_error),
-    "pinball_loss_05": make_scorer(mean_pinball_loss, alpha=0.05),
-    "pinball_loss_50": make_scorer(mean_pinball_loss, alpha=0.50),
-    "pinball_loss_95": make_scorer(mean_pinball_loss, alpha=0.95),
-}
-loss_functions = ["squared_error", "poisson", "absolute_error"]
-scores = defaultdict(list)
-for loss_func in loss_functions:
-    model = HistGradientBoostingRegressor(loss=loss_func)
-    cv_results = cross_validate(
-        model,
-        X,
-        y,
-        cv=ts_cv,
-        scoring=scoring,
-        n_jobs=2,
-    )
-    time = cv_results["fit_time"]
-    scores["loss"].append(loss_func)
-    scores["fit_time"].append(f"{time.mean():.2f} ± {time.std():.2f} s")
-
-    for key, value in cv_results.items():
-        if key.startswith("test_"):
-            metric = key.split("test_")[1]
-            scores = consolidate_scores(cv_results, scores, metric)
-
-
-# %%
-# Modeling predictive uncertainty via quantile regression
-# -------------------------------------------------------
-# Instead of modeling the expected value of the distribution of
-# :math:`Y|X` like the least squares and Poisson losses do, one could try to
-# estimate quantiles of the conditional distribution.
-#
-# :math:`Y|X=x_i` is expected to be a random variable for a given data point
-# :math:`x_i` because we expect that the number of rentals cannot be 100%
-# accurately predicted from the features. It can be influenced by other
-# variables not properly captured by the existing lagged features. For
-# instance whether or not it will rain in the next hour cannot be fully
-# anticipated from the past hours bike rental data. This is what we
-# call aleatoric uncertainty.
-#
-# Quantile regression makes it possible to give a finer description of that
-# distribution without making strong assumptions on its shape.
-quantile_list = [0.05, 0.5, 0.95]
-
-for quantile in quantile_list:
-    model = HistGradientBoostingRegressor(loss="quantile", quantile=quantile)
-    cv_results = cross_validate(
-        model,
-        X,
-        y,
-        cv=ts_cv,
-        scoring=scoring,
-        n_jobs=2,
-    )
-    time = cv_results["fit_time"]
-    scores["fit_time"].append(f"{time.mean():.2f} ± {time.std():.2f} s")
-
-    scores["loss"].append(f"quantile {int(quantile*100)}")
-    for key, value in cv_results.items():
-        if key.startswith("test_"):
-            metric = key.split("test_")[1]
-            scores = consolidate_scores(cv_results, scores, metric)
-
-scores_df = pl.DataFrame(scores)
-scores_df
-
-
-# %%
-# Let us take a look at the losses that minimise each metric.
-def min_arg(col):
-    col_split = pl.col(col).str.split(" ")
-    return pl.arg_sort_by(
-        col_split.list.get(0).cast(pl.Float64),
-        col_split.list.get(2).cast(pl.Float64),
-    ).first()
-
-
-scores_df.select(
-    pl.col("loss").get(min_arg(col_name)).alias(col_name)
-    for col_name in scores_df.columns
-    if col_name != "loss"
-)
-
-# %%
-# Even if the score distributions overlap due to the variance in the dataset,
-# it is true that the average RMSE is lower when `loss="squared_error"`, whereas
-# the average MAPE is lower when `loss="absolute_error"` as expected. That is
-# also the case for the Mean Pinball Loss with the quantiles 5 and 95. The score
-# corresponding to the 50 quantile loss is overlapping with the score obtained
-# by minimizing other loss functions, which is also the case for the MAE.
-#
-# A qualitative look at the predictions
-# -------------------------------------
-# We can now visualize the performance of the model with regards
-# to the 5th percentile, median and the 95th percentile:
-all_splits = list(ts_cv.split(X, y))
-train_idx, test_idx = all_splits[0]
-
-X_train, X_test = X[train_idx, :], X[test_idx, :]
-y_train, y_test = y[train_idx], y[test_idx]
-
-max_iter = 50
-gbrt_mean_poisson = HistGradientBoostingRegressor(loss="poisson", max_iter=max_iter)
-gbrt_mean_poisson.fit(X_train, y_train)
-mean_predictions = gbrt_mean_poisson.predict(X_test)
-
-gbrt_median = HistGradientBoostingRegressor(
-    loss="quantile", quantile=0.5, max_iter=max_iter
-)
-gbrt_median.fit(X_train, y_train)
-median_predictions = gbrt_median.predict(X_test)
-
-gbrt_percentile_5 = HistGradientBoostingRegressor(
-    loss="quantile", quantile=0.05, max_iter=max_iter
-)
-gbrt_percentile_5.fit(X_train, y_train)
-percentile_5_predictions = gbrt_percentile_5.predict(X_test)
-
-gbrt_percentile_95 = HistGradientBoostingRegressor(
-    loss="quantile", quantile=0.95, max_iter=max_iter
-)
-gbrt_percentile_95.fit(X_train, y_train)
-percentile_95_predictions = gbrt_percentile_95.predict(X_test)
-
-# %%
-# We can now take a look at the predictions made by the regression models:
-last_hours = slice(-96, None)
-fig, ax = plt.subplots(figsize=(15, 7))
-plt.title("Predictions by regression models")
-ax.plot(
-    y_test[last_hours],
-    "x-",
-    alpha=0.2,
-    label="Actual demand",
-    color="black",
-)
-ax.plot(
-    median_predictions[last_hours],
-    "^-",
-    label="GBRT median",
-)
-ax.plot(
-    mean_predictions[last_hours],
-    "x-",
-    label="GBRT mean (Poisson)",
-)
-ax.fill_between(
-    np.arange(96),
-    percentile_5_predictions[last_hours],
-    percentile_95_predictions[last_hours],
-    alpha=0.3,
-    label="GBRT 90% interval",
-)
-_ = ax.legend()
-
-# %%
-# Here it's interesting to notice that the blue area between the 5% and 95%
-# percentile estimators has a width that varies with the time of the day:
-#
-# - At night, the blue band is much narrower: the pair of models is quite
-#   certain that there will be a small number of bike rentals. And furthermore
-#   these seem correct in the sense that the actual demand stays in that blue
-#   band.
-# - During the day, the blue band is much wider: the uncertainty grows, probably
-#   because of the variability of the weather that can have a very large impact,
-#   especially on week-ends.
-# - We can also see that during week-days, the commute pattern is still visible in
-#   the 5% and 95% estimations.
-# - Finally, it is expected that 10% of the time, the actual demand does not lie
-#   between the 5% and 95% percentile estimates. On this test span, the actual
-#   demand seems to be higher, especially during the rush hours. It might reveal that
-#   our 95% percentile estimator underestimates the demand peaks. This could be be
-#   quantitatively confirmed by computing empirical coverage numbers as done in
-#   the :ref:`calibration of confidence intervals <calibration-section>`.
-#
-# Looking at the performance of non-linear regression models vs
-# the best models:
-from sklearn.metrics import PredictionErrorDisplay
-
-fig, axes = plt.subplots(ncols=3, figsize=(15, 6), sharey=True)
-fig.suptitle("Non-linear regression models")
-predictions = [
-    median_predictions,
-    percentile_5_predictions,
-    percentile_95_predictions,
-]
-labels = [
-    "Median",
-    "5th percentile",
-    "95th percentile",
-]
-for ax, pred, label in zip(axes, predictions, labels):
-    PredictionErrorDisplay.from_predictions(
-        y_true=y_test,
-        y_pred=pred,
-        kind="residual_vs_predicted",
-        scatter_kwargs={"alpha": 0.3},
-        ax=ax,
-    )
-    ax.set(xlabel="Predicted demand", ylabel="True demand")
-    ax.legend(["Best model", label])
-
-plt.show()
-
-# %%
-# Conclusion
-# ----------
-# Through this example we explored time series forecasting using lagged
-# features. We compared a naive regression (using the standardized
-# :class:`~sklearn.model_selection.train_test_split`) with a proper time
-# series evaluation strategy using
-# :class:`~sklearn.model_selection.TimeSeriesSplit`. We observed that the
-# model trained using :class:`~sklearn.model_selection.train_test_split`,
-# having a default value of `shuffle` set to `True` produced an overly
-# optimistic Mean Average Percentage Error (MAPE). The results
-# produced from the time-based split better represent the performance
-# of our time-series regression model. We also analyzed the predictive uncertainty
-# of our model via Quantile Regression. Predictions based on the 5th and
-# 95th percentile using `loss="quantile"` provide us with a quantitative estimate
-# of the uncertainty of the forecasts made by our time series regression model.
-# Uncertainty estimation can also be performed
-# using `MAPIE <https://mapie.readthedocs.io/en/latest/index.html>`_,
-# that provides an implementation based on recent work on conformal prediction
-# methods and estimates both aleatoric and epistemic uncertainty at the same time.
-# Furthermore, functionalities provided
-# by `sktime <https://www.sktime.net/en/latest/users.html>`_
-# can be used to extend scikit-learn estimators by making use of recursive time
-# series forecasting, that enables dynamic predictions of future values.
+"""
+===========================================
+Lagged features for time series forecasting
+===========================================
+
+This example demonstrates how Polars-engineered lagged features can be used
+for time series forecasting with
+:class:`~sklearn.ensemble.HistGradientBoostingRegressor` on the Bike Sharing
+Demand dataset.
+
+See the example on
+:ref:`sphx_glr_auto_examples_applications_plot_cyclical_feature_engineering.py`
+for some data exploration on this dataset and a demo on periodic feature
+engineering.
+
+"""
+
+# %%
+# Analyzing the Bike Sharing Demand dataset
+# -----------------------------------------
+#
+# We start by loading the data from the OpenML repository as a raw parquet file
+# to illustrate how to work with an arbitrary parquet file instead of hiding this
+# step in a convenience tool such as `sklearn.datasets.fetch_openml`.
+#
+# The URL of the parquet file can be found in the JSON description of the
+# Bike Sharing Demand dataset with id 44063 on openml.org
+# (https://openml.org/search?type=data&status=active&id=44063).
+#
+# The `sha256` hash of the file is also provided to ensure the integrity of the
+# downloaded file.
+import numpy as np
+import polars as pl
+
+from sklearn.datasets import fetch_file
+
+pl.Config.set_fmt_str_lengths(20)
+
+bike_sharing_data_file = fetch_file(
+    "https://openml1.win.tue.nl/datasets/0004/44063/dataset_44063.pq",
+    sha256="d120af76829af0d256338dc6dd4be5df4fd1f35bf3a283cab66a51c1c6abd06a",
+)
+bike_sharing_data_file
+
+# %%
+# We load the parquet file with Polars for feature engineering. Polars
+# automatically caches common subexpressions which are reused in multiple
+# expressions (like `pl.col("count").shift(1)` below). See
+# https://docs.pola.rs/user-guide/lazy/optimizations/ for more information.
+
+df = pl.read_parquet(bike_sharing_data_file)
+
+# %%
+# Next, we take a look at the statistical summary of the dataset
+# so that we can better understand the data that we are working with.
+import polars.selectors as cs
+
+summary = df.select(cs.numeric()).describe()
+summary
+
+# %%
+# Let us look at the count of the seasons `"fall"`, `"spring"`, `"summer"`
+# and `"winter"` present in the dataset to confirm they are balanced.
+
+import matplotlib.pyplot as plt
+
+df["season"].value_counts()
+
+
+# %%
+# Generating Polars-engineered lagged features
+# --------------------------------------------
+# Let's consider the problem of predicting the demand at the
+# next hour given past demands. Since the demand is a continuous
+# variable, one could intuitively use any regression model. However, we do
+# not have the usual `(X_train, y_train)` dataset. Instead, we just have
+# the `y_train` demand data sequentially organized by time.
+lagged_df = df.select(
+    "count",
+    *[pl.col("count").shift(i).alias(f"lagged_count_{i}h") for i in [1, 2, 3]],
+    lagged_count_1d=pl.col("count").shift(24),
+    lagged_count_1d_1h=pl.col("count").shift(24 + 1),
+    lagged_count_7d=pl.col("count").shift(7 * 24),
+    lagged_count_7d_1h=pl.col("count").shift(7 * 24 + 1),
+    lagged_mean_24h=pl.col("count").shift(1).rolling_mean(24),
+    lagged_max_24h=pl.col("count").shift(1).rolling_max(24),
+    lagged_min_24h=pl.col("count").shift(1).rolling_min(24),
+    lagged_mean_7d=pl.col("count").shift(1).rolling_mean(7 * 24),
+    lagged_max_7d=pl.col("count").shift(1).rolling_max(7 * 24),
+    lagged_min_7d=pl.col("count").shift(1).rolling_min(7 * 24),
+)
+lagged_df.tail(10)
+
+# %%
+# Watch out however, the first lines have undefined values because their own
+# past is unknown. This depends on how much lag we used:
+lagged_df.head(10)
+
+# %%
+# We can now separate the lagged features in a matrix `X` and the target variable
+# (the counts to predict) in an array of the same first dimension `y`.
+lagged_df = lagged_df.drop_nulls()
+X = lagged_df.drop("count")
+y = lagged_df["count"]
+print("X shape: {}\ny shape: {}".format(X.shape, y.shape))
+
+# %%
+# Naive evaluation of the next hour bike demand regression
+# --------------------------------------------------------
+# Let's randomly split our tabularized dataset to train a gradient
+# boosting regression tree (GBRT) model and evaluate it using Mean
+# Absolute Percentage Error (MAPE). If our model is aimed at forecasting
+# (i.e., predicting future data from past data), we should not use training
+# data that are ulterior to the testing data. In time series machine learning
+# the "i.i.d" (independent and identically distributed) assumption does not
+# hold true as the data points are not independent and have a temporal
+# relationship.
+from sklearn.ensemble import HistGradientBoostingRegressor
+from sklearn.model_selection import train_test_split
+
+X_train, X_test, y_train, y_test = train_test_split(
+    X, y, test_size=0.2, random_state=42
+)
+
+model = HistGradientBoostingRegressor().fit(X_train, y_train)
+
+# %%
+# Taking a look at the performance of the model.
+from sklearn.metrics import mean_absolute_percentage_error
+
+y_pred = model.predict(X_test)
+mean_absolute_percentage_error(y_test, y_pred)
+
+# %%
+# Proper next hour forecasting evaluation
+# ---------------------------------------
+# Let's use a proper evaluation splitting strategies that takes into account
+# the temporal structure of the dataset to evaluate our model's ability to
+# predict data points in the future (to avoid cheating by reading values from
+# the lagged features in the training set).
+from sklearn.model_selection import TimeSeriesSplit
+
+ts_cv = TimeSeriesSplit(
+    n_splits=3,  # to keep the notebook fast enough on common laptops
+    gap=48,  # 2 days data gap between train and test
+    max_train_size=10000,  # keep train sets of comparable sizes
+    test_size=3000,  # for 2 or 3 digits of precision in scores
+)
+all_splits = list(ts_cv.split(X, y))
+
+# %%
+# Training the model and evaluating its performance based on MAPE.
+train_idx, test_idx = all_splits[0]
+X_train, X_test = X[train_idx, :], X[test_idx, :]
+y_train, y_test = y[train_idx], y[test_idx]
+
+model = HistGradientBoostingRegressor().fit(X_train, y_train)
+y_pred = model.predict(X_test)
+mean_absolute_percentage_error(y_test, y_pred)
+
+# %%
+# The generalization error measured via a shuffled trained test split
+# is too optimistic. The generalization via a time-based split is likely to
+# be more representative of the true performance of the regression model.
+# Let's assess this variability of our error evaluation with proper
+# cross-validation:
+from sklearn.model_selection import cross_val_score
+
+cv_mape_scores = -cross_val_score(
+    model, X, y, cv=ts_cv, scoring="neg_mean_absolute_percentage_error"
+)
+cv_mape_scores
+
+# %%
+# The variability across splits is quite large! In a real life setting
+# it would be advised to use more splits to better assess the variability.
+# Let's report the mean CV scores and their standard deviation from now on.
+print(f"CV MAPE: {cv_mape_scores.mean():.3f} ± {cv_mape_scores.std():.3f}")
+
+# %%
+# We can compute several combinations of evaluation metrics and loss functions,
+# which are reported a bit below.
+from collections import defaultdict
+
+from sklearn.metrics import (
+    make_scorer,
+    mean_absolute_error,
+    mean_pinball_loss,
+    root_mean_squared_error,
+)
+from sklearn.model_selection import cross_validate
+
+
+def consolidate_scores(cv_results, scores, metric):
+    if metric == "MAPE":
+        scores[metric].append(f"{value.mean():.2f} ± {value.std():.2f}")
+    else:
+        scores[metric].append(f"{value.mean():.1f} ± {value.std():.1f}")
+
+    return scores
+
+
+scoring = {
+    "MAPE": make_scorer(mean_absolute_percentage_error),
+    "RMSE": make_scorer(root_mean_squared_error),
+    "MAE": make_scorer(mean_absolute_error),
+    "pinball_loss_05": make_scorer(mean_pinball_loss, alpha=0.05),
+    "pinball_loss_50": make_scorer(mean_pinball_loss, alpha=0.50),
+    "pinball_loss_95": make_scorer(mean_pinball_loss, alpha=0.95),
+}
+loss_functions = ["squared_error", "poisson", "absolute_error"]
+scores = defaultdict(list)
+for loss_func in loss_functions:
+    model = HistGradientBoostingRegressor(loss=loss_func)
+    cv_results = cross_validate(
+        model,
+        X,
+        y,
+        cv=ts_cv,
+        scoring=scoring,
+        n_jobs=2,
+    )
+    time = cv_results["fit_time"]
+    scores["loss"].append(loss_func)
+    scores["fit_time"].append(f"{time.mean():.2f} ± {time.std():.2f} s")
+
+    for key, value in cv_results.items():
+        if key.startswith("test_"):
+            metric = key.split("test_")[1]
+            scores = consolidate_scores(cv_results, scores, metric)
+
+
+# %%
+# Modeling predictive uncertainty via quantile regression
+# -------------------------------------------------------
+# Instead of modeling the expected value of the distribution of
+# :math:`Y|X` like the least squares and Poisson losses do, one could try to
+# estimate quantiles of the conditional distribution.
+#
+# :math:`Y|X=x_i` is expected to be a random variable for a given data point
+# :math:`x_i` because we expect that the number of rentals cannot be 100%
+# accurately predicted from the features. It can be influenced by other
+# variables not properly captured by the existing lagged features. For
+# instance whether or not it will rain in the next hour cannot be fully
+# anticipated from the past hours bike rental data. This is what we
+# call aleatoric uncertainty.
+#
+# Quantile regression makes it possible to give a finer description of that
+# distribution without making strong assumptions on its shape.
+quantile_list = [0.05, 0.5, 0.95]
+
+for quantile in quantile_list:
+    model = HistGradientBoostingRegressor(loss="quantile", quantile=quantile)
+    cv_results = cross_validate(
+        model,
+        X,
+        y,
+        cv=ts_cv,
+        scoring=scoring,
+        n_jobs=2,
+    )
+    time = cv_results["fit_time"]
+    scores["fit_time"].append(f"{time.mean():.2f} ± {time.std():.2f} s")
+
+    scores["loss"].append(f"quantile {int(quantile*100)}")
+    for key, value in cv_results.items():
+        if key.startswith("test_"):
+            metric = key.split("test_")[1]
+            scores = consolidate_scores(cv_results, scores, metric)
+
+scores_df = pl.DataFrame(scores)
+scores_df
+
+
+# %%
+# Let us take a look at the losses that minimise each metric.
+def min_arg(col):
+    col_split = pl.col(col).str.split(" ")
+    return pl.arg_sort_by(
+        col_split.list.get(0).cast(pl.Float64),
+        col_split.list.get(2).cast(pl.Float64),
+    ).first()
+
+
+scores_df.select(
+    pl.col("loss").get(min_arg(col_name)).alias(col_name)
+    for col_name in scores_df.columns
+    if col_name != "loss"
+)
+
+# %%
+# Even if the score distributions overlap due to the variance in the dataset,
+# it is true that the average RMSE is lower when `loss="squared_error"`, whereas
+# the average MAPE is lower when `loss="absolute_error"` as expected. That is
+# also the case for the Mean Pinball Loss with the quantiles 5 and 95. The score
+# corresponding to the 50 quantile loss is overlapping with the score obtained
+# by minimizing other loss functions, which is also the case for the MAE.
+#
+# A qualitative look at the predictions
+# -------------------------------------
+# We can now visualize the performance of the model with regards
+# to the 5th percentile, median and the 95th percentile:
+all_splits = list(ts_cv.split(X, y))
+train_idx, test_idx = all_splits[0]
+
+X_train, X_test = X[train_idx, :], X[test_idx, :]
+y_train, y_test = y[train_idx], y[test_idx]
+
+max_iter = 50
+gbrt_mean_poisson = HistGradientBoostingRegressor(loss="poisson", max_iter=max_iter)
+gbrt_mean_poisson.fit(X_train, y_train)
+mean_predictions = gbrt_mean_poisson.predict(X_test)
+
+gbrt_median = HistGradientBoostingRegressor(
+    loss="quantile", quantile=0.5, max_iter=max_iter
+)
+gbrt_median.fit(X_train, y_train)
+median_predictions = gbrt_median.predict(X_test)
+
+gbrt_percentile_5 = HistGradientBoostingRegressor(
+    loss="quantile", quantile=0.05, max_iter=max_iter
+)
+gbrt_percentile_5.fit(X_train, y_train)
+percentile_5_predictions = gbrt_percentile_5.predict(X_test)
+
+gbrt_percentile_95 = HistGradientBoostingRegressor(
+    loss="quantile", quantile=0.95, max_iter=max_iter
+)
+gbrt_percentile_95.fit(X_train, y_train)
+percentile_95_predictions = gbrt_percentile_95.predict(X_test)
+
+# %%
+# We can now take a look at the predictions made by the regression models:
+last_hours = slice(-96, None)
+fig, ax = plt.subplots(figsize=(15, 7))
+plt.title("Predictions by regression models")
+ax.plot(
+    y_test[last_hours],
+    "x-",
+    alpha=0.2,
+    label="Actual demand",
+    color="black",
+)
+ax.plot(
+    median_predictions[last_hours],
+    "^-",
+    label="GBRT median",
+)
+ax.plot(
+    mean_predictions[last_hours],
+    "x-",
+    label="GBRT mean (Poisson)",
+)
+ax.fill_between(
+    np.arange(96),
+    percentile_5_predictions[last_hours],
+    percentile_95_predictions[last_hours],
+    alpha=0.3,
+    label="GBRT 90% interval",
+)
+_ = ax.legend()
+
+# %%
+# Here it's interesting to notice that the blue area between the 5% and 95%
+# percentile estimators has a width that varies with the time of the day:
+#
+# - At night, the blue band is much narrower: the pair of models is quite
+#   certain that there will be a small number of bike rentals. And furthermore
+#   these seem correct in the sense that the actual demand stays in that blue
+#   band.
+# - During the day, the blue band is much wider: the uncertainty grows, probably
+#   because of the variability of the weather that can have a very large impact,
+#   especially on week-ends.
+# - We can also see that during week-days, the commute pattern is still visible in
+#   the 5% and 95% estimations.
+# - Finally, it is expected that 10% of the time, the actual demand does not lie
+#   between the 5% and 95% percentile estimates. On this test span, the actual
+#   demand seems to be higher, especially during the rush hours. It might reveal that
+#   our 95% percentile estimator underestimates the demand peaks. This could be be
+#   quantitatively confirmed by computing empirical coverage numbers as done in
+#   the :ref:`calibration of confidence intervals <calibration-section>`.
+#
+# Looking at the performance of non-linear regression models vs
+# the best models:
+from sklearn.metrics import PredictionErrorDisplay
+
+fig, axes = plt.subplots(ncols=3, figsize=(15, 6), sharey=True)
+fig.suptitle("Non-linear regression models")
+predictions = [
+    median_predictions,
+    percentile_5_predictions,
+    percentile_95_predictions,
+]
+labels = [
+    "Median",
+    "5th percentile",
+    "95th percentile",
+]
+for ax, pred, label in zip(axes, predictions, labels):
+    PredictionErrorDisplay.from_predictions(
+        y_true=y_test,
+        y_pred=pred,
+        kind="residual_vs_predicted",
+        scatter_kwargs={"alpha": 0.3},
+        ax=ax,
+    )
+    ax.set(xlabel="Predicted demand", ylabel="True demand")
+    ax.legend(["Best model", label])
+
+plt.show()
+
+# %%
+# Conclusion
+# ----------
+# Through this example we explored time series forecasting using lagged
+# features. We compared a naive regression (using the standardized
+# :class:`~sklearn.model_selection.train_test_split`) with a proper time
+# series evaluation strategy using
+# :class:`~sklearn.model_selection.TimeSeriesSplit`. We observed that the
+# model trained using :class:`~sklearn.model_selection.train_test_split`,
+# having a default value of `shuffle` set to `True` produced an overly
+# optimistic Mean Average Percentage Error (MAPE). The results
+# produced from the time-based split better represent the performance
+# of our time-series regression model. We also analyzed the predictive uncertainty
+# of our model via Quantile Regression. Predictions based on the 5th and
+# 95th percentile using `loss="quantile"` provide us with a quantitative estimate
+# of the uncertainty of the forecasts made by our time series regression model.
+# Uncertainty estimation can also be performed
+# using `MAPIE <https://mapie.readthedocs.io/en/latest/index.html>`_,
+# that provides an implementation based on recent work on conformal prediction
+# methods and estimates both aleatoric and epistemic uncertainty at the same time.
+# Furthermore, functionalities provided
+# by `sktime <https://www.sktime.net/en/latest/users.html>`_
+# can be used to extend scikit-learn estimators by making use of recursive time
+# series forecasting, that enables dynamic predictions of future values.
diff --git a/examples/applications/plot_tomography_l1_reconstruction.py b/examples/applications/plot_tomography_l1_reconstruction.py
index d851613402571..02d4594b90518 100644
--- a/examples/applications/plot_tomography_l1_reconstruction.py
+++ b/examples/applications/plot_tomography_l1_reconstruction.py
@@ -36,8 +36,8 @@ class :class:`~sklearn.linear_model.Lasso`, that uses the coordinate descent
 
 """
 
-# Author: Emmanuelle Gouillart <emmanuelle.gouillart@nsup.org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/applications/plot_topics_extraction_with_nmf_lda.py b/examples/applications/plot_topics_extraction_with_nmf_lda.py
index 86821b5458492..faeef5ae15a11 100644
--- a/examples/applications/plot_topics_extraction_with_nmf_lda.py
+++ b/examples/applications/plot_topics_extraction_with_nmf_lda.py
@@ -21,10 +21,8 @@
 
 """
 
-# Author: Olivier Grisel <olivier.grisel@ensta.org>
-#         Lars Buitinck
-#         Chyi-Kwei Yau <chyikwei.yau@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from time import time
 
diff --git a/examples/applications/wikipedia_principal_eigenvector.py b/examples/applications/wikipedia_principal_eigenvector.py
index 0be1661d7ed5c..599a598d60fe2 100644
--- a/examples/applications/wikipedia_principal_eigenvector.py
+++ b/examples/applications/wikipedia_principal_eigenvector.py
@@ -30,8 +30,8 @@
 
 """
 
-# Author: Olivier Grisel <olivier.grisel@ensta.org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import os
 from bz2 import BZ2File
diff --git a/examples/bicluster/plot_spectral_biclustering.py b/examples/bicluster/plot_spectral_biclustering.py
index 041ef4c4944f6..469c3c71e17c6 100644
--- a/examples/bicluster/plot_spectral_biclustering.py
+++ b/examples/bicluster/plot_spectral_biclustering.py
@@ -18,8 +18,8 @@
 plot the biclusters found.
 """
 
-# Author: Kemal Eren <kemal@kemaleren.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Generate sample data
diff --git a/examples/bicluster/plot_spectral_coclustering.py b/examples/bicluster/plot_spectral_coclustering.py
index 92b10d93956e7..a0edaceafeb66 100644
--- a/examples/bicluster/plot_spectral_coclustering.py
+++ b/examples/bicluster/plot_spectral_coclustering.py
@@ -15,8 +15,8 @@
 
 """
 
-# Author: Kemal Eren <kemal@kemaleren.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 from matplotlib import pyplot as plt
diff --git a/examples/calibration/plot_calibration.py b/examples/calibration/plot_calibration.py
index 91dca761d1fe3..6ea132269fa38 100644
--- a/examples/calibration/plot_calibration.py
+++ b/examples/calibration/plot_calibration.py
@@ -23,12 +23,8 @@
 
 """
 
-# Authors:
-# Mathieu Blondel <mathieu@mblondel.org>
-# Alexandre Gramfort <alexandre.gramfort@telecom-paristech.fr>
-# Balazs Kegl <balazs.kegl@gmail.com>
-# Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-# License: BSD Style.
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Generate synthetic dataset
diff --git a/examples/calibration/plot_calibration_curve.py b/examples/calibration/plot_calibration_curve.py
index 915d3b7c20cc9..03bc28e25740a 100644
--- a/examples/calibration/plot_calibration_curve.py
+++ b/examples/calibration/plot_calibration_curve.py
@@ -12,9 +12,8 @@
 
 """
 
-# Author: Alexandre Gramfort <alexandre.gramfort@telecom-paristech.fr>
-#         Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-# License: BSD 3 clause.
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 # %%
 # Dataset
 # -------
@@ -222,7 +221,7 @@ def predict_proba(self, X):
 # %%
 
 lr = LogisticRegression(C=1.0)
-svc = NaivelyCalibratedLinearSVC(max_iter=10_000, dual="auto")
+svc = NaivelyCalibratedLinearSVC(max_iter=10_000)
 svc_isotonic = CalibratedClassifierCV(svc, cv=2, method="isotonic")
 svc_sigmoid = CalibratedClassifierCV(svc, cv=2, method="sigmoid")
 
diff --git a/examples/calibration/plot_calibration_multiclass.py b/examples/calibration/plot_calibration_multiclass.py
index fc6349f3dea5f..8525c76221a8f 100644
--- a/examples/calibration/plot_calibration_multiclass.py
+++ b/examples/calibration/plot_calibration_multiclass.py
@@ -27,8 +27,8 @@ class of an instance (red: class 1, green: class 2, blue: class 3).
 # of both the train and valid subsets. This is used when we only want to train
 # the classifier but not calibrate the predicted probabilities.
 
-# Author: Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-# License: BSD Style.
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 
diff --git a/examples/calibration/plot_compare_calibration.py b/examples/calibration/plot_compare_calibration.py
index 389e231c8f07c..33898d8f151f3 100644
--- a/examples/calibration/plot_compare_calibration.py
+++ b/examples/calibration/plot_compare_calibration.py
@@ -17,8 +17,8 @@
 """
 
 # %%
-# Author: Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-# License: BSD 3 clause.
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 #
 # Dataset
 # -------
@@ -107,7 +107,7 @@ def predict_proba(self, X):
     Cs=np.logspace(-6, 6, 101), cv=10, scoring="neg_log_loss", max_iter=1_000
 )
 gnb = GaussianNB()
-svc = NaivelyCalibratedLinearSVC(C=1.0, dual="auto")
+svc = NaivelyCalibratedLinearSVC(C=1.0)
 rfc = RandomForestClassifier(random_state=42)
 
 clf_list = [
diff --git a/examples/classification/plot_classification_probability.py b/examples/classification/plot_classification_probability.py
index 4e8f0763d3b47..3702d2670282b 100644
--- a/examples/classification/plot_classification_probability.py
+++ b/examples/classification/plot_classification_probability.py
@@ -5,8 +5,8 @@
 
 Plot the classification probability for different classifiers. We use a 3 class
 dataset, and we classify it with a Support Vector classifier, L1 and L2
-penalized logistic regression with either a One-Vs-Rest or multinomial setting,
-and Gaussian process classification.
+penalized logistic regression (multinomial multiclass), a One-Vs-Rest version with
+logistic regression, and Gaussian process classification.
 
 Linear SVC is not a probabilistic classifier by default but it has a built-in
 calibration option enabled in this example (`probability=True`).
@@ -17,8 +17,8 @@
 
 """
 
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
@@ -30,6 +30,7 @@
 from sklearn.inspection import DecisionBoundaryDisplay
 from sklearn.linear_model import LogisticRegression
 from sklearn.metrics import accuracy_score
+from sklearn.multiclass import OneVsRestClassifier
 from sklearn.svm import SVC
 
 iris = datasets.load_iris()
@@ -43,14 +44,12 @@
 
 # Create different classifiers.
 classifiers = {
-    "L1 logistic": LogisticRegression(
-        C=C, penalty="l1", solver="saga", multi_class="multinomial", max_iter=10000
-    ),
+    "L1 logistic": LogisticRegression(C=C, penalty="l1", solver="saga", max_iter=10000),
     "L2 logistic (Multinomial)": LogisticRegression(
-        C=C, penalty="l2", solver="saga", multi_class="multinomial", max_iter=10000
+        C=C, penalty="l2", solver="saga", max_iter=10000
     ),
-    "L2 logistic (OvR)": LogisticRegression(
-        C=C, penalty="l2", solver="saga", multi_class="ovr", max_iter=10000
+    "L2 logistic (OvR)": OneVsRestClassifier(
+        LogisticRegression(C=C, penalty="l2", solver="saga", max_iter=10000)
     ),
     "Linear SVC": SVC(kernel="linear", C=C, probability=True, random_state=0),
     "GPC": GaussianProcessClassifier(kernel),
diff --git a/examples/classification/plot_classifier_comparison.py b/examples/classification/plot_classifier_comparison.py
index 6a4a4cb60db88..4fb8a142e2606 100644
--- a/examples/classification/plot_classifier_comparison.py
+++ b/examples/classification/plot_classifier_comparison.py
@@ -22,7 +22,7 @@
 # Code source: Gaël Varoquaux
 #              Andreas Müller
 # Modified for documentation by Jaques Grobler
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/classification/plot_digits_classification.py b/examples/classification/plot_digits_classification.py
index d6208400d5416..58b514161d570 100644
--- a/examples/classification/plot_digits_classification.py
+++ b/examples/classification/plot_digits_classification.py
@@ -8,8 +8,8 @@
 
 """
 
-# Author: Gael Varoquaux <gael dot varoquaux at normalesup dot org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # Standard scientific Python imports
 import matplotlib.pyplot as plt
diff --git a/examples/cluster/plot_adjusted_for_chance_measures.py b/examples/cluster/plot_adjusted_for_chance_measures.py
index 1ab8f11d6d627..088a42771ed95 100644
--- a/examples/cluster/plot_adjusted_for_chance_measures.py
+++ b/examples/cluster/plot_adjusted_for_chance_measures.py
@@ -15,9 +15,8 @@
   as the "ground truth labels".
 """
 
-# Author: Olivier Grisel <olivier.grisel@ensta.org>
-#         Arturo Amor <david-arturo.amor-quiroz@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Defining the list of metrics to evaluate
diff --git a/examples/cluster/plot_agglomerative_clustering.py b/examples/cluster/plot_agglomerative_clustering.py
index 0cbce55cd3f29..f6165266206aa 100644
--- a/examples/cluster/plot_agglomerative_clustering.py
+++ b/examples/cluster/plot_agglomerative_clustering.py
@@ -24,8 +24,8 @@
 
 """
 
-# Authors: Gael Varoquaux, Nelle Varoquaux
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import time
 
diff --git a/examples/cluster/plot_agglomerative_clustering_metrics.py b/examples/cluster/plot_agglomerative_clustering_metrics.py
index 8eb2ea3f7285f..c565a5859d093 100644
--- a/examples/cluster/plot_agglomerative_clustering_metrics.py
+++ b/examples/cluster/plot_agglomerative_clustering_metrics.py
@@ -34,8 +34,8 @@
 
 """
 
-# Author: Gael Varoquaux
-# License: BSD 3-Clause or CC-0
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.patheffects as PathEffects
 import matplotlib.pyplot as plt
diff --git a/examples/cluster/plot_agglomerative_dendrogram.py b/examples/cluster/plot_agglomerative_dendrogram.py
index 20c22f4f0bb39..2acb3675ff7c1 100644
--- a/examples/cluster/plot_agglomerative_dendrogram.py
+++ b/examples/cluster/plot_agglomerative_dendrogram.py
@@ -1,5 +1,5 @@
-# Authors: Mathew Kallada, Andreas Mueller
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 """
 =========================================
 Plot Hierarchical Clustering Dendrogram
diff --git a/examples/cluster/plot_birch_vs_minibatchkmeans.py b/examples/cluster/plot_birch_vs_minibatchkmeans.py
index c9c213c948913..347a28cbc95b7 100644
--- a/examples/cluster/plot_birch_vs_minibatchkmeans.py
+++ b/examples/cluster/plot_birch_vs_minibatchkmeans.py
@@ -21,9 +21,8 @@
 
 """
 
-# Authors: Manoj Kumar <manojkumarsivaraj334@gmail.com
-#          Alexandre Gramfort <alexandre.gramfort@telecom-paristech.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from itertools import cycle
 from time import time
diff --git a/examples/cluster/plot_cluster_iris.py b/examples/cluster/plot_cluster_iris.py
index ad85c0c9910a7..e3a6d6a3d8664 100644
--- a/examples/cluster/plot_cluster_iris.py
+++ b/examples/cluster/plot_cluster_iris.py
@@ -20,7 +20,7 @@
 
 # Code source: Gaël Varoquaux
 # Modified for documentation by Jaques Grobler
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 
diff --git a/examples/cluster/plot_coin_segmentation.py b/examples/cluster/plot_coin_segmentation.py
index 2a3d1c67a01e0..304ba35bf68bd 100644
--- a/examples/cluster/plot_coin_segmentation.py
+++ b/examples/cluster/plot_coin_segmentation.py
@@ -20,10 +20,8 @@
   that directly determines the partition in the embedding space.
 """
 
-# Author: Gael Varoquaux <gael.varoquaux@normalesup.org>
-#         Brian Cheung
-#         Andrew Knyazev <Andrew.Knyazev@ucdenver.edu>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import time
 
diff --git a/examples/cluster/plot_coin_ward_segmentation.py b/examples/cluster/plot_coin_ward_segmentation.py
index 1a505dbc4efaa..431829af3bac8 100644
--- a/examples/cluster/plot_coin_ward_segmentation.py
+++ b/examples/cluster/plot_coin_ward_segmentation.py
@@ -9,9 +9,8 @@
 
 """
 
-# Author : Vincent Michel, 2010
-#          Alexandre Gramfort, 2011
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Generate data
diff --git a/examples/cluster/plot_color_quantization.py b/examples/cluster/plot_color_quantization.py
index ec21949466daf..bd1958d3cf145 100644
--- a/examples/cluster/plot_color_quantization.py
+++ b/examples/cluster/plot_color_quantization.py
@@ -19,11 +19,8 @@
 
 """
 
-# Authors: Robert Layton <robertlayton@gmail.com>
-#          Olivier Grisel <olivier.grisel@ensta.org>
-#          Mathieu Blondel <mathieu@mblondel.org>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from time import time
 
diff --git a/examples/cluster/plot_digits_agglomeration.py b/examples/cluster/plot_digits_agglomeration.py
index faedefb8aeed8..3773a300cb51a 100644
--- a/examples/cluster/plot_digits_agglomeration.py
+++ b/examples/cluster/plot_digits_agglomeration.py
@@ -10,7 +10,7 @@
 
 # Code source: Gaël Varoquaux
 # Modified for documentation by Jaques Grobler
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/cluster/plot_digits_linkage.py b/examples/cluster/plot_digits_linkage.py
index ae67bd5d8e0f4..05d71d5c94172 100644
--- a/examples/cluster/plot_digits_linkage.py
+++ b/examples/cluster/plot_digits_linkage.py
@@ -27,8 +27,8 @@
 
 """
 
-# Authors: Gael Varoquaux
-# License: BSD 3 clause (C) INRIA 2014
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from time import time
 
diff --git a/examples/cluster/plot_face_compress.py b/examples/cluster/plot_face_compress.py
index e873bd96b08e7..4e248a0fc65b2 100644
--- a/examples/cluster/plot_face_compress.py
+++ b/examples/cluster/plot_face_compress.py
@@ -7,9 +7,8 @@
 to perform vector quantization on a set of toy image, the raccoon face.
 """
 
-# Authors: Gael Varoquaux
-#          Jaques Grobler
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Original image
@@ -81,7 +80,6 @@
     encode="ordinal",
     strategy="uniform",
     random_state=0,
-    subsample=200_000,
 )
 compressed_raccoon_uniform = encoder.fit_transform(raccoon_face.reshape(-1, 1)).reshape(
     raccoon_face.shape
@@ -130,7 +128,6 @@
     encode="ordinal",
     strategy="kmeans",
     random_state=0,
-    subsample=200_000,
 )
 compressed_raccoon_kmeans = encoder.fit_transform(raccoon_face.reshape(-1, 1)).reshape(
     raccoon_face.shape
diff --git a/examples/cluster/plot_feature_agglomeration_vs_univariate_selection.py b/examples/cluster/plot_feature_agglomeration_vs_univariate_selection.py
index 577d65f314337..fbad9c0ad7a31 100644
--- a/examples/cluster/plot_feature_agglomeration_vs_univariate_selection.py
+++ b/examples/cluster/plot_feature_agglomeration_vs_univariate_selection.py
@@ -14,8 +14,8 @@
 
 """
 
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 import shutil
diff --git a/examples/cluster/plot_kmeans_assumptions.py b/examples/cluster/plot_kmeans_assumptions.py
index 46a7ec6fa58b5..25dcff9570314 100644
--- a/examples/cluster/plot_kmeans_assumptions.py
+++ b/examples/cluster/plot_kmeans_assumptions.py
@@ -8,9 +8,8 @@
 
 """
 
-# Author: Phil Roth <mr.phil.roth@gmail.com>
-#         Arturo Amor <david-arturo.amor-quiroz@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Data generation
diff --git a/examples/cluster/plot_kmeans_stability_low_dim_dense.py b/examples/cluster/plot_kmeans_stability_low_dim_dense.py
index 9340239a3d00e..e56fc81eb6e88 100644
--- a/examples/cluster/plot_kmeans_stability_low_dim_dense.py
+++ b/examples/cluster/plot_kmeans_stability_low_dim_dense.py
@@ -23,8 +23,8 @@
 
 """
 
-# Author: Olivier Grisel <olivier.grisel@ensta.org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.cm as cm
 import matplotlib.pyplot as plt
diff --git a/examples/cluster/plot_optics.py b/examples/cluster/plot_optics.py
index c8fe1f1eebbc1..26218302542d9 100644
--- a/examples/cluster/plot_optics.py
+++ b/examples/cluster/plot_optics.py
@@ -17,9 +17,8 @@
 
 """
 
-# Authors: Shane Grigsby <refuge@rocktalus.com>
-#          Adrin Jalali <adrin.jalali@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.gridspec as gridspec
 import matplotlib.pyplot as plt
diff --git a/examples/cluster/plot_segmentation_toy.py b/examples/cluster/plot_segmentation_toy.py
index 6fc41f7a5daf2..5cd239bd39572 100644
--- a/examples/cluster/plot_segmentation_toy.py
+++ b/examples/cluster/plot_segmentation_toy.py
@@ -26,9 +26,8 @@
 
 """
 
-# Authors:  Emmanuelle Gouillart <emmanuelle.gouillart@normalesup.org>
-#           Gael Varoquaux <gael.varoquaux@normalesup.org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Generate the data
diff --git a/examples/cluster/plot_ward_structured_vs_unstructured.py b/examples/cluster/plot_ward_structured_vs_unstructured.py
index 446d744b31e78..5f8d416aaf51f 100644
--- a/examples/cluster/plot_ward_structured_vs_unstructured.py
+++ b/examples/cluster/plot_ward_structured_vs_unstructured.py
@@ -20,10 +20,8 @@
 
 """
 
-# Authors : Vincent Michel, 2010
-#           Alexandre Gramfort, 2010
-#           Gael Varoquaux, 2010
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import time as time
 
diff --git a/examples/compose/plot_column_transformer.py b/examples/compose/plot_column_transformer.py
index 207f7450a2705..8f779d085614a 100644
--- a/examples/compose/plot_column_transformer.py
+++ b/examples/compose/plot_column_transformer.py
@@ -18,9 +18,8 @@
 
 """
 
-# Author: Matt Terry <matt.terry@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 
diff --git a/examples/compose/plot_column_transformer_mixed_types.py b/examples/compose/plot_column_transformer_mixed_types.py
index d7d5da768ea2c..91768e261f271 100644
--- a/examples/compose/plot_column_transformer_mixed_types.py
+++ b/examples/compose/plot_column_transformer_mixed_types.py
@@ -25,9 +25,8 @@
 
 """
 
-# Author: Pedro Morales <part.morales@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 import numpy as np
diff --git a/examples/compose/plot_digits_pipe.py b/examples/compose/plot_digits_pipe.py
index 223fef687f65f..511878fcd4d99 100644
--- a/examples/compose/plot_digits_pipe.py
+++ b/examples/compose/plot_digits_pipe.py
@@ -12,7 +12,7 @@
 
 # Code source: Gaël Varoquaux
 # Modified for documentation by Jaques Grobler
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/compose/plot_feature_union.py b/examples/compose/plot_feature_union.py
index 01f7e02bfe44f..ef04a50846a48 100644
--- a/examples/compose/plot_feature_union.py
+++ b/examples/compose/plot_feature_union.py
@@ -16,9 +16,8 @@
 
 """
 
-# Author: Andreas Mueller <amueller@ais.uni-bonn.de>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from sklearn.datasets import load_iris
 from sklearn.decomposition import PCA
diff --git a/examples/compose/plot_transformed_target.py b/examples/compose/plot_transformed_target.py
index ec7c09aebe45a..5fe502b3adf27 100644
--- a/examples/compose/plot_transformed_target.py
+++ b/examples/compose/plot_transformed_target.py
@@ -11,8 +11,8 @@
 
 """
 
-# Author: Guillaume Lemaitre <guillaume.lemaitre@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 print(__doc__)
 
diff --git a/examples/covariance/plot_mahalanobis_distances.py b/examples/covariance/plot_mahalanobis_distances.py
index b82c861133de7..537d3fa0d9d8a 100644
--- a/examples/covariance/plot_mahalanobis_distances.py
+++ b/examples/covariance/plot_mahalanobis_distances.py
@@ -50,15 +50,15 @@
 
     See also :ref:`sphx_glr_auto_examples_covariance_plot_robust_vs_empirical_covariance.py`
 
-.. topic:: References:
-
-    .. [1] P. J. Rousseeuw. `Least median of squares regression
-        <http://web.ipac.caltech.edu/staff/fmasci/home/astro_refs/LeastMedianOfSquares.pdf>`_. J. Am
-        Stat Ass, 79:871, 1984.
-    .. [2] Wilson, E. B., & Hilferty, M. M. (1931). `The distribution of chi-square.
-        <https://water.usgs.gov/osw/bulletin17b/Wilson_Hilferty_1931.pdf>`_
-        Proceedings of the National Academy of Sciences of the United States
-        of America, 17, 684-688.
+.. rubric:: References
+
+.. [1] P. J. Rousseeuw. `Least median of squares regression
+    <http://web.ipac.caltech.edu/staff/fmasci/home/astro_refs/LeastMedianOfSquares.pdf>`_. J. Am
+    Stat Ass, 79:871, 1984.
+.. [2] Wilson, E. B., & Hilferty, M. M. (1931). `The distribution of chi-square.
+    <https://water.usgs.gov/osw/bulletin17b/Wilson_Hilferty_1931.pdf>`_
+    Proceedings of the National Academy of Sciences of the United States
+    of America, 17, 684-688.
 
 """  # noqa: E501
 
diff --git a/examples/covariance/plot_sparse_cov.py b/examples/covariance/plot_sparse_cov.py
index a088aeb7e69c0..868f1f3d49a6c 100644
--- a/examples/covariance/plot_sparse_cov.py
+++ b/examples/covariance/plot_sparse_cov.py
@@ -50,9 +50,8 @@
 
 """
 
-# author: Gael Varoquaux <gael.varoquaux@inria.fr>
-# License: BSD 3 clause
-# Copyright: INRIA
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Generate the data
diff --git a/examples/datasets/plot_digits_last_image.py b/examples/datasets/plot_digits_last_image.py
index 0fde32cc674a8..ce6c48e58715e 100644
--- a/examples/datasets/plot_digits_last_image.py
+++ b/examples/datasets/plot_digits_last_image.py
@@ -9,14 +9,14 @@
 first transform it into a feature vector with length 64.
 
 See `here
-<https://archive.ics.uci.edu/ml/datasets/Pen-Based+Recognition+of+Handwritten+Digits>`_
+<https://archive.ics.uci.edu/dataset/81/pen+based+recognition+of+handwritten+digits>`_
 for more information about this dataset.
 
 """
 
 # Code source: Gaël Varoquaux
 # Modified for documentation by Jaques Grobler
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 
diff --git a/examples/datasets/plot_iris_dataset.py b/examples/datasets/plot_iris_dataset.py
index 32aba8918547e..d36ebca1ebe83 100644
--- a/examples/datasets/plot_iris_dataset.py
+++ b/examples/datasets/plot_iris_dataset.py
@@ -17,7 +17,7 @@
 
 # Code source: Gaël Varoquaux
 # Modified for documentation by Jaques Grobler
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Loading the iris dataset
diff --git a/examples/decomposition/plot_ica_vs_pca.py b/examples/decomposition/plot_ica_vs_pca.py
index 07f6327e9922f..e7b2ab06540d0 100644
--- a/examples/decomposition/plot_ica_vs_pca.py
+++ b/examples/decomposition/plot_ica_vs_pca.py
@@ -29,8 +29,8 @@
 
 """
 
-# Authors: Alexandre Gramfort, Gael Varoquaux
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Generate sample data
diff --git a/examples/decomposition/plot_incremental_pca.py b/examples/decomposition/plot_incremental_pca.py
index 8e5aeccfddc8a..b10618dcddf00 100644
--- a/examples/decomposition/plot_incremental_pca.py
+++ b/examples/decomposition/plot_incremental_pca.py
@@ -19,8 +19,8 @@
 
 """
 
-# Authors: Kyle Kastner
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/decomposition/plot_kernel_pca.py b/examples/decomposition/plot_kernel_pca.py
index 10f82ffec15f0..0c3a148c7c753 100644
--- a/examples/decomposition/plot_kernel_pca.py
+++ b/examples/decomposition/plot_kernel_pca.py
@@ -16,10 +16,8 @@
 :class:`~sklearn.decomposition.PCA`.
 """
 
-# Authors: Mathieu Blondel
-#          Andreas Mueller
-#          Guillaume Lemaitre
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Projecting data: `PCA` vs. `KernelPCA`
diff --git a/examples/decomposition/plot_pca_iris.py b/examples/decomposition/plot_pca_iris.py
index d025ba34adc27..f574e14bdfd17 100644
--- a/examples/decomposition/plot_pca_iris.py
+++ b/examples/decomposition/plot_pca_iris.py
@@ -11,7 +11,7 @@
 """
 
 # Code source: Gaël Varoquaux
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 
diff --git a/examples/decomposition/plot_pca_vs_fa_model_selection.py b/examples/decomposition/plot_pca_vs_fa_model_selection.py
index e269fc6b5c278..865d69989255a 100644
--- a/examples/decomposition/plot_pca_vs_fa_model_selection.py
+++ b/examples/decomposition/plot_pca_vs_fa_model_selection.py
@@ -25,9 +25,8 @@
 
 """
 
-# Authors: Alexandre Gramfort
-#          Denis A. Engemann
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Create the data
diff --git a/examples/decomposition/plot_varimax_fa.py b/examples/decomposition/plot_varimax_fa.py
index 9d4c3b9ed1ee7..4289464af5eea 100644
--- a/examples/decomposition/plot_varimax_fa.py
+++ b/examples/decomposition/plot_varimax_fa.py
@@ -16,8 +16,8 @@
 
 """
 
-# Authors: Jona Sassenhagen
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/developing_estimators/sklearn_is_fitted.py b/examples/developing_estimators/sklearn_is_fitted.py
index b144f8f2fa363..e5ebea7cd8641 100644
--- a/examples/developing_estimators/sklearn_is_fitted.py
+++ b/examples/developing_estimators/sklearn_is_fitted.py
@@ -27,9 +27,8 @@
 # scikit-learn and showcases the usage of the `__sklearn_is_fitted__` method
 # and the `check_is_fitted` utility function.
 
-# Author: Kushan <kushansharma1@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from sklearn.base import BaseEstimator, ClassifierMixin
 from sklearn.utils.validation import check_is_fitted
diff --git a/examples/ensemble/plot_adaboost_multiclass.py b/examples/ensemble/plot_adaboost_multiclass.py
index 35b0d1bb86470..8ae7372b0874f 100644
--- a/examples/ensemble/plot_adaboost_multiclass.py
+++ b/examples/ensemble/plot_adaboost_multiclass.py
@@ -17,16 +17,16 @@
 be selected. This ensures that subsequent iterations of the algorithm focus on
 the difficult-to-classify samples.
 
-.. topic:: References:
+.. rubric:: References
 
-    .. [1] :doi:`J. Zhu, H. Zou, S. Rosset, T. Hastie, "Multi-class adaboost."
-           Statistics and its Interface 2.3 (2009): 349-360.
-           <10.4310/SII.2009.v2.n3.a8>`
+.. [1] :doi:`J. Zhu, H. Zou, S. Rosset, T. Hastie, "Multi-class adaboost."
+    Statistics and its Interface 2.3 (2009): 349-360.
+    <10.4310/SII.2009.v2.n3.a8>`
 
 """
 
 # Noel Dawe <noel.dawe@gmail.com>
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Creating the dataset
@@ -231,16 +231,16 @@ def misclassification_error(y_true, y_pred):
 # decision. Indeed, this exactly is the formulation of updating the base
 # estimators' weights after each iteration in AdaBoost.
 #
-# |details-start| Mathematical details |details-split|
+# .. dropdown:: Mathematical details
 #
-# The weight associated with a weak learner trained at the stage :math:`m` is
-# inversely associated with its misclassification error such that:
+#    The weight associated with a weak learner trained at the stage :math:`m` is
+#    inversely associated with its misclassification error such that:
 #
-# .. math:: \alpha^{(m)} = \log \frac{1 - err^{(m)}}{err^{(m)}} + \log (K - 1),
+#    .. math:: \alpha^{(m)} = \log \frac{1 - err^{(m)}}{err^{(m)}} + \log (K - 1),
 #
-# where :math:`\alpha^{(m)}` and :math:`err^{(m)}` are the weight and the error
-# of the :math:`m` th weak learner, respectively, and :math:`K` is the number of
-# classes in our classification problem. |details-end|
+#    where :math:`\alpha^{(m)}` and :math:`err^{(m)}` are the weight and the error
+#    of the :math:`m` th weak learner, respectively, and :math:`K` is the number of
+#    classes in our classification problem.
 #
 # Another interesting observation boils down to the fact that the first weak
 # learners of the model make fewer errors than later weak learners of the
diff --git a/examples/ensemble/plot_adaboost_regression.py b/examples/ensemble/plot_adaboost_regression.py
index 8ba01df63b561..bed8e8ee30b56 100644
--- a/examples/ensemble/plot_adaboost_regression.py
+++ b/examples/ensemble/plot_adaboost_regression.py
@@ -23,9 +23,8 @@
 # ------------------
 # First, we prepare dummy data with a sinusoidal relationship and some gaussian noise.
 
-# Author: Noel Dawe <noel.dawe@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 
diff --git a/examples/ensemble/plot_adaboost_twoclass.py b/examples/ensemble/plot_adaboost_twoclass.py
index d1e89c47b7fcf..5d1554eb754d4 100644
--- a/examples/ensemble/plot_adaboost_twoclass.py
+++ b/examples/ensemble/plot_adaboost_twoclass.py
@@ -17,9 +17,8 @@
 
 """
 
-# Author: Noel Dawe <noel.dawe@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
@@ -74,7 +73,6 @@
         X[idx, 0],
         X[idx, 1],
         c=c,
-        cmap=plt.cm.Paired,
         s=20,
         edgecolor="k",
         label="Class %s" % n,
diff --git a/examples/ensemble/plot_bias_variance.py b/examples/ensemble/plot_bias_variance.py
index 9239603115db1..afc791e0f2a82 100644
--- a/examples/ensemble/plot_bias_variance.py
+++ b/examples/ensemble/plot_bias_variance.py
@@ -63,8 +63,8 @@
 
 """
 
-# Author: Gilles Louppe <g.louppe@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/ensemble/plot_ensemble_oob.py b/examples/ensemble/plot_ensemble_oob.py
index 972ca1f6259aa..2c89660b69d42 100644
--- a/examples/ensemble/plot_ensemble_oob.py
+++ b/examples/ensemble/plot_ensemble_oob.py
@@ -20,11 +20,8 @@
 
 """
 
-# Author: Kian Ho <hui.kian.ho@gmail.com>
-#         Gilles Louppe <g.louppe@gmail.com>
-#         Andreas Mueller <amueller@ais.uni-bonn.de>
-#
-# License: BSD 3 Clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from collections import OrderedDict
 
diff --git a/examples/ensemble/plot_feature_transformation.py b/examples/ensemble/plot_feature_transformation.py
index d492de07fec87..ef0d66fa3eda4 100644
--- a/examples/ensemble/plot_feature_transformation.py
+++ b/examples/ensemble/plot_feature_transformation.py
@@ -20,9 +20,8 @@
 
 """
 
-# Author: Tim Head <betatim@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # First, we will create a large dataset and split it into three sets:
diff --git a/examples/ensemble/plot_forest_hist_grad_boosting_comparison.py b/examples/ensemble/plot_forest_hist_grad_boosting_comparison.py
index 853caec241491..1bc3804ee4764 100644
--- a/examples/ensemble/plot_forest_hist_grad_boosting_comparison.py
+++ b/examples/ensemble/plot_forest_hist_grad_boosting_comparison.py
@@ -27,8 +27,8 @@
 example showcasing some other features of HGBT models.
 """
 
-# Author:  Arturo Amor <david-arturo.amor-quiroz@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Load dataset
diff --git a/examples/ensemble/plot_gradient_boosting_oob.py b/examples/ensemble/plot_gradient_boosting_oob.py
index 0cb40ad2c11ea..8c4ff8d755ebe 100644
--- a/examples/ensemble/plot_gradient_boosting_oob.py
+++ b/examples/ensemble/plot_gradient_boosting_oob.py
@@ -22,9 +22,8 @@
 but is computationally more demanding.
 """
 
-# Author: Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/ensemble/plot_gradient_boosting_regression.py b/examples/ensemble/plot_gradient_boosting_regression.py
index 76437680708be..bdcc6cca66996 100644
--- a/examples/ensemble/plot_gradient_boosting_regression.py
+++ b/examples/ensemble/plot_gradient_boosting_regression.py
@@ -18,11 +18,8 @@
 
 """
 
-# Author: Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#         Maria Telenczuk <https://github.com/maikia>
-#         Katrina Ni <https://github.com/nilichen>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/ensemble/plot_gradient_boosting_regularization.py b/examples/ensemble/plot_gradient_boosting_regularization.py
index 218d69d5ac7d7..1aa01c7ba4ff4 100644
--- a/examples/ensemble/plot_gradient_boosting_regularization.py
+++ b/examples/ensemble/plot_gradient_boosting_regularization.py
@@ -21,9 +21,8 @@
 
 """
 
-# Author: Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/ensemble/plot_hgbt_regression.py b/examples/ensemble/plot_hgbt_regression.py
index 3bf3762bae406..0827effd23abd 100644
--- a/examples/ensemble/plot_hgbt_regression.py
+++ b/examples/ensemble/plot_hgbt_regression.py
@@ -13,10 +13,10 @@
 
 The top usability features of HGBT models are:
 
-1. Several available loss function for mean and quantile regression tasks, see
+1. Several available loss functions for mean and quantile regression tasks, see
    :ref:`Quantile loss <quantile_support_hgbdt>`.
-2. :ref:`categorical_support_gbdt` (see
-   :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_categorical.py`).
+2. :ref:`categorical_support_gbdt`, see
+   :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_categorical.py`.
 3. Early stopping.
 4. :ref:`nan_support_hgbt`, which avoids the need for an imputer.
 5. :ref:`monotonic_cst_gbdt`.
@@ -26,8 +26,8 @@
 setting.
 """
 
-# Author: Arturo Amor <david-arturo.amor-quiroz@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Preparing the data
@@ -38,17 +38,18 @@
 # set every five minutes. Electricity transfers to/from the neighboring state of
 # Victoria were done to alleviate fluctuations.
 #
-# The dataset (originally named ELEC2) contains 45,312 instances dated from 7
+# The dataset, originally named ELEC2, contains 45,312 instances dated from 7
 # May 1996 to 5 December 1998. Each sample of the dataset refers to a period of
 # 30 minutes, i.e. there are 48 instances for each time period of one day. Each
 # sample on the dataset has 7 columns:
-#   - date: between 7 May 1996 to 5 December 1998. Normalized between 0 and 1;
-#   - day: day of week (1-7);
-#   - period: half hour intervals over 24 hours. Normalized between 0 and 1;
-#   - nswprice/nswdemand: electricity price/demand of New South Wales;
-#   - vicprice/vicdemand: electricity price/demand of Victoria.
 #
-# It is originally a classification task, but here we use it for the regression
+# - date: between 7 May 1996 to 5 December 1998. Normalized between 0 and 1;
+# - day: day of week (1-7);
+# - period: half hour intervals over 24 hours. Normalized between 0 and 1;
+# - nswprice/nswdemand: electricity price/demand of New South Wales;
+# - vicprice/vicdemand: electricity price/demand of Victoria.
+#
+# Originally, it is a classification task, but here we use it for the regression
 # task to predict the scheduled electricity transfer between states.
 
 from sklearn.datasets import fetch_openml
@@ -86,7 +87,7 @@
 _ = ax.legend(handles, ["Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"])
 
 # %%
-# Notice energy transfer increases systematically during weekends.
+# Notice that energy transfer increases systematically during weekends.
 #
 # Effect of number of trees and early stopping
 # ============================================
@@ -95,7 +96,7 @@
 # daily electricity transfer using the whole dataset. Then we visualize its
 # predictions depending on the `max_iter` parameter. Here we don't try to
 # evaluate the performance of the model and its capacity to generalize but
-# rather its capacity to learn from the training data.
+# rather its capability to learn from the training data.
 
 from sklearn.ensemble import HistGradientBoostingRegressor
 from sklearn.model_selection import train_test_split
@@ -144,22 +145,24 @@
 # With just a few iterations, HGBT models can achieve convergence (see
 # :ref:`sphx_glr_auto_examples_ensemble_plot_forest_hist_grad_boosting_comparison.py`),
 # meaning that adding more trees does not improve the model anymore. In the
-# figure above, 5 iterations are not enough to be able to predict. With 50
+# figure above, 5 iterations are not enough to get good predictions. With 50
 # iterations, we are already able to do a good job.
 #
-# Instead of relying on `max_iter` alone to determine when to stop, the HGBT
-# implementation in scikit-learn supports early stopping. With it, the model
+# Setting `max_iter` too high might degrade the prediction quality and cost a lot of
+# avoidable computing resources. Therefore, the HGBT implementation in scikit-learn
+# provides an automatic **early stopping** strategy. With it, the model
 # uses a fraction of the training data as internal validation set
 # (`validation_fraction`) and stops training if the validation score does not
 # improve (or degrades) after `n_iter_no_change` iterations up to a certain
-# `tol`.
+# tolerance (`tol`).
 #
 # Notice that there is a trade-off between `learning_rate` and `max_iter`:
 # Generally, smaller learning rates are preferable but require more iterations
 # to converge to the minimum loss, while larger learning rates converge faster
 # (less iterations/trees needed) but at the cost of a larger minimum loss.
 #
-# Indeed, a good practice is to tune the learning rate along with any other
+# Because of this high correlation between the learning rate the number of iterations,
+# a good practice is to tune the learning rate along with all (important) other
 # hyperparameters, fit the HBGT on the training set with a large enough value
 # for `max_iter` and determine the best `max_iter` via early stopping and some
 # explicit `validation_fraction`.
@@ -204,9 +207,9 @@
 # HGBT models have native support of missing values. During training, the tree
 # grower decides where samples with missing values should go (left or right
 # child) at each split, based on the potential gain. When predicting, these
-# samples are sent to either child accordingly. If a feature had no missing
-# values during training, samples with missing values for that feature are sent
-# to the child with the most samples.
+# samples are sent to the learnt child accordingly. If a feature had no missing
+# values during training, then for prediction, samples with missing values for that
+# feature are sent to the child with the most samples (as seen during fit).
 #
 # The present example shows how HGBT regressions deal with values missing
 # completely at random (MCAR), i.e. the missingness does not depend on the
@@ -313,10 +316,10 @@ def generate_missing_values(X, missing_fraction):
 # model. One can still improve the quality of such estimations by:
 #
 # - collecting more data-points;
-# - better tuning of the model hyperparameters (see
-#   :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_quantile.py`);
-# - engineering more predictive features from the same data (see
-#   :ref:`sphx_glr_auto_examples_applications_plot_cyclical_feature_engineering.py`).
+# - better tuning of the model hyperparameters, see
+#   :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_quantile.py`;
+# - engineering more predictive features from the same data, see
+#   :ref:`sphx_glr_auto_examples_applications_plot_cyclical_feature_engineering.py`.
 #
 # Monotonic constraints
 # =====================
@@ -342,7 +345,8 @@ def generate_missing_values(X, missing_fraction):
 # - 0: no constraint
 # - -1: monotonic decrease
 #
-# Else, one can pass an array-like encoding the above convention by position.
+# Alternatively, one can pass an array-like object encoding the above convention by
+# position.
 
 from sklearn.inspection import PartialDependenceDisplay
 
@@ -394,8 +398,9 @@ def generate_missing_values(X, missing_fraction):
 _ = plt.legend()
 
 # %%
-# Observe that `nswdemand` seems already monotonic without constraint. This is a
-# good example to show that the model is "overconstraining".
+# Observe that `nswdemand` and `vicdemand` seem already monotonic without constraint.
+# This is a good example to show that the model with monotonicity constraints is
+# "overconstraining".
 #
 # Additionally, we can verify that the predictive quality of the model is not
 # significantly degraded by introducing the monotonic constraints. For such
diff --git a/examples/ensemble/plot_random_forest_regression_multioutput.py b/examples/ensemble/plot_random_forest_regression_multioutput.py
index ce8346c329127..52df62dc19f41 100644
--- a/examples/ensemble/plot_random_forest_regression_multioutput.py
+++ b/examples/ensemble/plot_random_forest_regression_multioutput.py
@@ -21,9 +21,8 @@
 
 """
 
-# Author: Tim Head <betatim@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/ensemble/plot_stack_predictors.py b/examples/ensemble/plot_stack_predictors.py
index 1d0db0575fbbe..5a566e643293a 100644
--- a/examples/ensemble/plot_stack_predictors.py
+++ b/examples/ensemble/plot_stack_predictors.py
@@ -16,9 +16,8 @@
 
 """
 
-# Authors: Guillaume Lemaitre <g.lemaitre58@gmail.com>
-#          Maria Telenczuk    <https://github.com/maikia>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Download the dataset
diff --git a/examples/feature_selection/plot_feature_selection.py b/examples/feature_selection/plot_feature_selection.py
index c57a2d5d6b6f9..2cf64cb6ea598 100644
--- a/examples/feature_selection/plot_feature_selection.py
+++ b/examples/feature_selection/plot_feature_selection.py
@@ -77,7 +77,7 @@
 from sklearn.preprocessing import MinMaxScaler
 from sklearn.svm import LinearSVC
 
-clf = make_pipeline(MinMaxScaler(), LinearSVC(dual="auto"))
+clf = make_pipeline(MinMaxScaler(), LinearSVC())
 clf.fit(X_train, y_train)
 print(
     "Classification accuracy without selecting features: {:.3f}".format(
@@ -90,9 +90,7 @@
 
 # %%
 # After univariate feature selection
-clf_selected = make_pipeline(
-    SelectKBest(f_classif, k=4), MinMaxScaler(), LinearSVC(dual="auto")
-)
+clf_selected = make_pipeline(SelectKBest(f_classif, k=4), MinMaxScaler(), LinearSVC())
 clf_selected.fit(X_train, y_train)
 print(
     "Classification accuracy after univariate feature selection: {:.3f}".format(
diff --git a/examples/feature_selection/plot_feature_selection_pipeline.py b/examples/feature_selection/plot_feature_selection_pipeline.py
index 42094c452491e..1d7c44050ea78 100644
--- a/examples/feature_selection/plot_feature_selection_pipeline.py
+++ b/examples/feature_selection/plot_feature_selection_pipeline.py
@@ -46,7 +46,7 @@
 from sklearn.svm import LinearSVC
 
 anova_filter = SelectKBest(f_classif, k=3)
-clf = LinearSVC(dual="auto")
+clf = LinearSVC()
 anova_svm = make_pipeline(anova_filter, clf)
 anova_svm.fit(X_train, y_train)
 
diff --git a/examples/feature_selection/plot_rfe_digits.py b/examples/feature_selection/plot_rfe_digits.py
index 553f38f9c674f..198a3d6f3af90 100644
--- a/examples/feature_selection/plot_rfe_digits.py
+++ b/examples/feature_selection/plot_rfe_digits.py
@@ -3,8 +3,14 @@
 Recursive feature elimination
 =============================
 
-A recursive feature elimination example showing the relevance of pixels in
-a digit classification task.
+This example demonstrates how Recursive Feature Elimination
+(:class:`~sklearn.feature_selection.RFE`) can be used to determine the
+importance of individual pixels for classifying handwritten digits.
+:class:`~sklearn.feature_selection.RFE` recursively removes the least
+significant features, assigning ranks based on their importance, where higher
+`ranking_` values denote lower importance. The ranking is visualized using both
+shades of blue and pixel annotations for clarity. As expected, pixels positioned
+at the center of the image tend to be more predictive than those near the edges.
 
 .. note::
 
@@ -16,21 +22,33 @@
 
 from sklearn.datasets import load_digits
 from sklearn.feature_selection import RFE
-from sklearn.svm import SVC
+from sklearn.linear_model import LogisticRegression
+from sklearn.pipeline import Pipeline
+from sklearn.preprocessing import MinMaxScaler
 
 # Load the digits dataset
 digits = load_digits()
 X = digits.images.reshape((len(digits.images), -1))
 y = digits.target
 
-# Create the RFE object and rank each pixel
-svc = SVC(kernel="linear", C=1)
-rfe = RFE(estimator=svc, n_features_to_select=1, step=1)
-rfe.fit(X, y)
-ranking = rfe.ranking_.reshape(digits.images[0].shape)
+pipe = Pipeline(
+    [
+        ("scaler", MinMaxScaler()),
+        ("rfe", RFE(estimator=LogisticRegression(), n_features_to_select=1, step=1)),
+    ]
+)
+
+pipe.fit(X, y)
+ranking = pipe.named_steps["rfe"].ranking_.reshape(digits.images[0].shape)
 
 # Plot pixel ranking
 plt.matshow(ranking, cmap=plt.cm.Blues)
+
+# Add annotations for pixel numbers
+for i in range(ranking.shape[0]):
+    for j in range(ranking.shape[1]):
+        plt.text(j, i, str(ranking[i, j]), ha="center", va="center", color="black")
+
 plt.colorbar()
-plt.title("Ranking of pixels with RFE")
+plt.title("Ranking of pixels with RFE\n(Logistic Regression)")
 plt.show()
diff --git a/examples/gaussian_process/plot_compare_gpr_krr.py b/examples/gaussian_process/plot_compare_gpr_krr.py
index 8379baf148256..52375a9c4a267 100644
--- a/examples/gaussian_process/plot_compare_gpr_krr.py
+++ b/examples/gaussian_process/plot_compare_gpr_krr.py
@@ -25,9 +25,8 @@
 tuning the kernel hyperparameters.
 """
 
-# Authors: Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-#          Guillaume Lemaitre <g.lemaitre58@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Generating a dataset
diff --git a/examples/gaussian_process/plot_gpc.py b/examples/gaussian_process/plot_gpc.py
index 21a99065e06ce..e1d5d03586774 100644
--- a/examples/gaussian_process/plot_gpc.py
+++ b/examples/gaussian_process/plot_gpc.py
@@ -22,9 +22,8 @@
 
 """
 
-# Authors: Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 from matplotlib import pyplot as plt
diff --git a/examples/gaussian_process/plot_gpc_isoprobability.py b/examples/gaussian_process/plot_gpc_isoprobability.py
index a986d285632b7..52a97e7fd2944 100644
--- a/examples/gaussian_process/plot_gpc_isoprobability.py
+++ b/examples/gaussian_process/plot_gpc_isoprobability.py
@@ -8,10 +8,8 @@
 
 """
 
-# Author: Vincent Dubourg <vincent.dubourg@gmail.com>
-# Adapted to GaussianProcessClassifier:
-#         Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 from matplotlib import cm
diff --git a/examples/gaussian_process/plot_gpc_xor.py b/examples/gaussian_process/plot_gpc_xor.py
index 4439a5ee722b6..012b8f98ad337 100644
--- a/examples/gaussian_process/plot_gpc_xor.py
+++ b/examples/gaussian_process/plot_gpc_xor.py
@@ -11,9 +11,8 @@
 
 """
 
-# Authors: Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/gaussian_process/plot_gpr_co2.py b/examples/gaussian_process/plot_gpr_co2.py
index 33b0ab7271549..ae3d96aebc17f 100644
--- a/examples/gaussian_process/plot_gpr_co2.py
+++ b/examples/gaussian_process/plot_gpr_co2.py
@@ -4,7 +4,7 @@
 ====================================================================================
 
 This example is based on Section 5.4.3 of "Gaussian Processes for Machine
-Learning" [RW2006]_. It illustrates an example of complex kernel engineering
+Learning" [1]_. It illustrates an example of complex kernel engineering
 and hyperparameter optimization using gradient ascent on the
 log-marginal-likelihood. The data consists of the monthly average atmospheric
 CO2 concentrations (in parts per million by volume (ppm)) collected at the
@@ -12,19 +12,17 @@
 model the CO2 concentration as a function of the time :math:`t` and extrapolate
 for years after 2001.
 
-.. topic: References
+.. rubric:: References
 
-    .. [RW2006] `Rasmussen, Carl Edward.
-       "Gaussian processes in machine learning."
-       Summer school on machine learning. Springer, Berlin, Heidelberg, 2003
-       <http://www.gaussianprocess.org/gpml/chapters/RW.pdf>`_.
+.. [1] `Rasmussen, Carl Edward. "Gaussian processes in machine learning."
+    Summer school on machine learning. Springer, Berlin, Heidelberg, 2003
+    <http://www.gaussianprocess.org/gpml/chapters/RW.pdf>`_.
 """
 
 print(__doc__)
 
-# Authors: Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-#          Guillaume Lemaitre <g.lemaitre58@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Build the dataset
@@ -33,24 +31,25 @@
 # We will derive a dataset from the Mauna Loa Observatory that collected air
 # samples. We are interested in estimating the concentration of CO2 and
 # extrapolate it for further year. First, we load the original dataset available
-# in OpenML.
+# in OpenML as a pandas dataframe. This will be replaced with Polars
+# once `fetch_openml` adds a native support for it.
 from sklearn.datasets import fetch_openml
 
 co2 = fetch_openml(data_id=41187, as_frame=True)
 co2.frame.head()
 
 # %%
-# First, we process the original dataframe to create a date index and select
-# only the CO2 column.
-import pandas as pd
+# First, we process the original dataframe to create a date column and select
+# it along with the CO2 column.
+import polars as pl
 
-co2_data = co2.frame
-co2_data["date"] = pd.to_datetime(co2_data[["year", "month", "day"]])
-co2_data = co2_data[["date", "co2"]].set_index("date")
+co2_data = pl.DataFrame(co2.frame[["year", "month", "day", "co2"]]).select(
+    pl.date("year", "month", "day"), "co2"
+)
 co2_data.head()
 
 # %%
-co2_data.index.min(), co2_data.index.max()
+co2_data["date"].min(), co2_data["date"].max()
 
 # %%
 # We see that we get CO2 concentration for some days from March, 1958 to
@@ -58,7 +57,8 @@
 # understanding.
 import matplotlib.pyplot as plt
 
-co2_data.plot()
+plt.plot(co2_data["date"], co2_data["co2"])
+plt.xlabel("date")
 plt.ylabel("CO$_2$ concentration (ppm)")
 _ = plt.title("Raw air samples measurements from the Mauna Loa Observatory")
 
@@ -67,15 +67,14 @@
 # for which no measurements were collected. Such a processing will have an
 # smoothing effect on the data.
 
-try:
-    co2_data_resampled_monthly = co2_data.resample("ME")
-except ValueError:
-    # pandas < 2.2 uses M instead of ME
-    co2_data_resampled_monthly = co2_data.resample("M")
-
-
-co2_data = co2_data_resampled_monthly.mean().dropna(axis="index", how="any")
-co2_data.plot()
+co2_data = (
+    co2_data.sort(by="date")
+    .group_by_dynamic("date", every="1mo")
+    .agg(pl.col("co2").mean())
+    .drop_nulls()
+)
+plt.plot(co2_data["date"], co2_data["co2"])
+plt.xlabel("date")
 plt.ylabel("Monthly average of CO$_2$ concentration (ppm)")
 _ = plt.title(
     "Monthly average of air samples measurements\nfrom the Mauna Loa Observatory"
@@ -88,7 +87,9 @@
 #
 # As a first step, we will divide the data and the target to estimate. The data
 # being a date, we will convert it into a numeric.
-X = (co2_data.index.year + co2_data.index.month / 12).to_numpy().reshape(-1, 1)
+X = co2_data.select(
+    pl.col("date").dt.year() + pl.col("date").dt.month() / 12
+).to_numpy()
 y = co2_data["co2"].to_numpy()
 
 # %%
diff --git a/examples/gaussian_process/plot_gpr_noisy.py b/examples/gaussian_process/plot_gpr_noisy.py
index 31d3b149aa47f..db05172b8ba52 100644
--- a/examples/gaussian_process/plot_gpr_noisy.py
+++ b/examples/gaussian_process/plot_gpr_noisy.py
@@ -9,9 +9,8 @@
 initialization.
 """
 
-# Authors: Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-#          Guillaume Lemaitre <guillaume.lemaitre@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Data generation
diff --git a/examples/gaussian_process/plot_gpr_noisy_targets.py b/examples/gaussian_process/plot_gpr_noisy_targets.py
index b8c3be558831e..48160f48f6f32 100644
--- a/examples/gaussian_process/plot_gpr_noisy_targets.py
+++ b/examples/gaussian_process/plot_gpr_noisy_targets.py
@@ -19,11 +19,8 @@
 regularization on the assumed training points' covariance matrix.
 """
 
-# Author: Vincent Dubourg <vincent.dubourg@gmail.com>
-#         Jake Vanderplas <vanderplas@astro.washington.edu>
-#         Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-#         Guillaume Lemaitre <g.lemaitre58@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Dataset generation
diff --git a/examples/gaussian_process/plot_gpr_prior_posterior.py b/examples/gaussian_process/plot_gpr_prior_posterior.py
index f889eba202748..df4ab89719678 100644
--- a/examples/gaussian_process/plot_gpr_prior_posterior.py
+++ b/examples/gaussian_process/plot_gpr_prior_posterior.py
@@ -13,9 +13,8 @@
 
 """
 
-# Authors: Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-#          Guillaume Lemaitre <g.lemaitre58@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Helper function
@@ -127,8 +126,8 @@ def plot_gpr_samples(gpr_model, n_samples, ax):
 )
 
 # %%
-# Rational Quadradtic kernel
-# ..........................
+# Rational Quadratic kernel
+# .........................
 from sklearn.gaussian_process.kernels import RationalQuadratic
 
 kernel = 1.0 * RationalQuadratic(length_scale=1.0, alpha=0.1, alpha_bounds=(1e-5, 1e15))
@@ -201,7 +200,7 @@ def plot_gpr_samples(gpr_model, n_samples, ax):
 kernel = ConstantKernel(0.1, (0.01, 10.0)) * (
     DotProduct(sigma_0=1.0, sigma_0_bounds=(0.1, 10.0)) ** 2
 )
-gpr = GaussianProcessRegressor(kernel=kernel, random_state=0)
+gpr = GaussianProcessRegressor(kernel=kernel, random_state=0, normalize_y=True)
 
 fig, axs = plt.subplots(nrows=2, sharex=True, sharey=True, figsize=(10, 8))
 
diff --git a/examples/impute/plot_missing_values.py b/examples/impute/plot_missing_values.py
index 4b9f8ae079d8a..35e142d7123f4 100644
--- a/examples/impute/plot_missing_values.py
+++ b/examples/impute/plot_missing_values.py
@@ -28,8 +28,8 @@
 
 """
 
-# Authors: Maria Telenczuk  <https://github.com/maikia>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Download the data and make missing values sets
diff --git a/examples/inspection/plot_linear_model_coefficient_interpretation.py b/examples/inspection/plot_linear_model_coefficient_interpretation.py
index 9ab71dfa500f8..0e11f01937ebc 100644
--- a/examples/inspection/plot_linear_model_coefficient_interpretation.py
+++ b/examples/inspection/plot_linear_model_coefficient_interpretation.py
@@ -306,6 +306,34 @@
 # Also, AGE, EXPERIENCE and EDUCATION are the three variables that most
 # influence the model.
 #
+# Interpreting coefficients: being cautious about causality
+# ---------------------------------------------------------
+#
+# Linear models are a great tool for measuring statistical association, but we
+# should be cautious when making statements about causality, after all
+# correlation doesn't always imply causation. This is particularly difficult in
+# the social sciences because the variables we observe only function as proxies
+# for the underlying causal process.
+#
+# In our particular case we can think of the EDUCATION of an individual as a
+# proxy for their professional aptitude, the real variable we're interested in
+# but can't observe. We'd certainly like to think that staying in school for
+# longer would increase technical competency, but it's also quite possible that
+# causality goes the other way too. That is, those who are technically
+# competent tend to stay in school for longer.
+#
+# An employer is unlikely to care which case it is (or if it's a mix of both),
+# as long as they remain convinced that a person with more EDUCATION is better
+# suited for the job, they will be happy to pay out a higher WAGE.
+#
+# This confounding of effects becomes problematic when thinking about some
+# form of intervention e.g. government subsidies of university degrees or
+# promotional material encouraging individuals to take up higher education.
+# The usefulness of these measures could end up being overstated, especially if
+# the degree of confounding is strong. Our model predicts a :math:`0.054699`
+# increase in hourly wage for each year of education. The actual causal effect
+# might be lower because of this confounding.
+#
 # Checking the variability of the coefficients
 # --------------------------------------------
 #
@@ -742,6 +770,9 @@
 # * Coefficients must be scaled to the same unit of measure to retrieve
 #   feature importance. Scaling them with the standard-deviation of the
 #   feature is a useful proxy.
+# * Interpreting causality is difficult when there are confounding effects. If
+#   the relationship between two variables is also affected by something
+#   unobserved, we should be careful when making conclusions about causality.
 # * Coefficients in multivariate linear models represent the dependency
 #   between a given feature and the target, **conditional** on the other
 #   features.
diff --git a/examples/inspection/plot_permutation_importance.py b/examples/inspection/plot_permutation_importance.py
index 8cf63dd80fd4d..66b40fcd25bc8 100644
--- a/examples/inspection/plot_permutation_importance.py
+++ b/examples/inspection/plot_permutation_importance.py
@@ -18,10 +18,10 @@
 This example shows how to use Permutation Importances as an alternative that
 can mitigate those limitations.
 
-.. topic:: References:
+.. rubric:: References
 
-   * :doi:`L. Breiman, "Random Forests", Machine Learning, 45(1), 5-32,
-     2001. <10.1023/A:1010933404324>`
+* :doi:`L. Breiman, "Random Forests", Machine Learning, 45(1), 5-32,
+  2001. <10.1023/A:1010933404324>`
 
 """
 
diff --git a/examples/inspection/plot_permutation_importance_multicollinear.py b/examples/inspection/plot_permutation_importance_multicollinear.py
index a8fe52b1565d9..1ecf95d9d61d8 100644
--- a/examples/inspection/plot_permutation_importance_multicollinear.py
+++ b/examples/inspection/plot_permutation_importance_multicollinear.py
@@ -66,7 +66,6 @@ def plot_permutation_importance(clf, X, y, ax):
 
 mdi_importances = pd.Series(clf.feature_importances_, index=X_train.columns)
 tree_importance_sorted_idx = np.argsort(clf.feature_importances_)
-tree_indices = np.arange(0, len(clf.feature_importances_)) + 0.5
 
 fig, (ax1, ax2) = plt.subplots(1, 2, figsize=(12, 8))
 mdi_importances.sort_values().plot.barh(ax=ax1)
diff --git a/examples/kernel_approximation/plot_scalable_poly_kernels.py b/examples/kernel_approximation/plot_scalable_poly_kernels.py
index c3fe5b405d0d0..764ca9ae8413b 100644
--- a/examples/kernel_approximation/plot_scalable_poly_kernels.py
+++ b/examples/kernel_approximation/plot_scalable_poly_kernels.py
@@ -21,8 +21,8 @@
 
 """
 
-# Author: Daniel Lopez-Sanchez <lope@usal.es>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Preparing the data
@@ -85,7 +85,7 @@
 
 results = {}
 
-lsvm = LinearSVC(dual="auto")
+lsvm = LinearSVC()
 start = time.time()
 lsvm.fit(X_train, y_train)
 lsvm_time = time.time() - start
@@ -126,7 +126,7 @@
     for _ in range(n_runs):
         pipeline = make_pipeline(
             PolynomialCountSketch(n_components=n_components, degree=4),
-            LinearSVC(dual="auto"),
+            LinearSVC(),
         )
 
         start = time.time()
diff --git a/examples/linear_model/plot_huber_vs_ridge.py b/examples/linear_model/plot_huber_vs_ridge.py
index 7c0222b71a721..e4dd6b502881e 100644
--- a/examples/linear_model/plot_huber_vs_ridge.py
+++ b/examples/linear_model/plot_huber_vs_ridge.py
@@ -13,8 +13,8 @@
 
 """
 
-# Authors: Manoj Kumar mks542@nyu.edu
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/linear_model/plot_iris_logistic.py b/examples/linear_model/plot_iris_logistic.py
index b1e4d76c7f221..ca7cb00d5f878 100644
--- a/examples/linear_model/plot_iris_logistic.py
+++ b/examples/linear_model/plot_iris_logistic.py
@@ -12,7 +12,7 @@
 
 # Code source: Gaël Varoquaux
 # Modified for documentation by Jaques Grobler
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 
diff --git a/examples/linear_model/plot_lasso_coordinate_descent_path.py b/examples/linear_model/plot_lasso_coordinate_descent_path.py
index ee2f09f000d23..cb260b944543e 100644
--- a/examples/linear_model/plot_lasso_coordinate_descent_path.py
+++ b/examples/linear_model/plot_lasso_coordinate_descent_path.py
@@ -10,13 +10,12 @@
 
 """
 
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from itertools import cycle
 
 import matplotlib.pyplot as plt
-import numpy as np
 
 from sklearn import datasets
 from sklearn.linear_model import enet_path, lasso_path
@@ -49,41 +48,37 @@
 
 plt.figure(1)
 colors = cycle(["b", "r", "g", "c", "k"])
-neg_log_alphas_lasso = -np.log10(alphas_lasso)
-neg_log_alphas_enet = -np.log10(alphas_enet)
 for coef_l, coef_e, c in zip(coefs_lasso, coefs_enet, colors):
-    l1 = plt.plot(neg_log_alphas_lasso, coef_l, c=c)
-    l2 = plt.plot(neg_log_alphas_enet, coef_e, linestyle="--", c=c)
+    l1 = plt.semilogx(alphas_lasso, coef_l, c=c)
+    l2 = plt.semilogx(alphas_enet, coef_e, linestyle="--", c=c)
 
-plt.xlabel("-Log(alpha)")
+plt.xlabel("alpha")
 plt.ylabel("coefficients")
 plt.title("Lasso and Elastic-Net Paths")
-plt.legend((l1[-1], l2[-1]), ("Lasso", "Elastic-Net"), loc="lower left")
+plt.legend((l1[-1], l2[-1]), ("Lasso", "Elastic-Net"), loc="lower right")
 plt.axis("tight")
 
 
 plt.figure(2)
-neg_log_alphas_positive_lasso = -np.log10(alphas_positive_lasso)
 for coef_l, coef_pl, c in zip(coefs_lasso, coefs_positive_lasso, colors):
-    l1 = plt.plot(neg_log_alphas_lasso, coef_l, c=c)
-    l2 = plt.plot(neg_log_alphas_positive_lasso, coef_pl, linestyle="--", c=c)
+    l1 = plt.semilogy(alphas_lasso, coef_l, c=c)
+    l2 = plt.semilogy(alphas_positive_lasso, coef_pl, linestyle="--", c=c)
 
-plt.xlabel("-Log(alpha)")
+plt.xlabel("alpha")
 plt.ylabel("coefficients")
 plt.title("Lasso and positive Lasso")
-plt.legend((l1[-1], l2[-1]), ("Lasso", "positive Lasso"), loc="lower left")
+plt.legend((l1[-1], l2[-1]), ("Lasso", "positive Lasso"), loc="lower right")
 plt.axis("tight")
 
 
 plt.figure(3)
-neg_log_alphas_positive_enet = -np.log10(alphas_positive_enet)
 for coef_e, coef_pe, c in zip(coefs_enet, coefs_positive_enet, colors):
-    l1 = plt.plot(neg_log_alphas_enet, coef_e, c=c)
-    l2 = plt.plot(neg_log_alphas_positive_enet, coef_pe, linestyle="--", c=c)
+    l1 = plt.semilogx(alphas_enet, coef_e, c=c)
+    l2 = plt.semilogx(alphas_positive_enet, coef_pe, linestyle="--", c=c)
 
-plt.xlabel("-Log(alpha)")
+plt.xlabel("alpha")
 plt.ylabel("coefficients")
 plt.title("Elastic-Net and positive Elastic-Net")
-plt.legend((l1[-1], l2[-1]), ("Elastic-Net", "positive Elastic-Net"), loc="lower left")
+plt.legend((l1[-1], l2[-1]), ("Elastic-Net", "positive Elastic-Net"), loc="lower right")
 plt.axis("tight")
 plt.show()
diff --git a/examples/linear_model/plot_lasso_lars.py b/examples/linear_model/plot_lasso_lars.py
index 5444aeec90c65..d03a7e8841061 100644
--- a/examples/linear_model/plot_lasso_lars.py
+++ b/examples/linear_model/plot_lasso_lars.py
@@ -10,9 +10,8 @@
 
 """
 
-# Author: Fabian Pedregosa <fabian.pedregosa@inria.fr>
-#         Alexandre Gramfort <alexandre.gramfort@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/linear_model/plot_lasso_lars_ic.py b/examples/linear_model/plot_lasso_lars_ic.py
index 8f1e7034a108a..3e1d268c05e03 100644
--- a/examples/linear_model/plot_lasso_lars_ic.py
+++ b/examples/linear_model/plot_lasso_lars_ic.py
@@ -16,17 +16,16 @@
     of the two approaches, you can refer to the following example:
     :ref:`sphx_glr_auto_examples_linear_model_plot_lasso_model_selection.py`.
 
-.. topic:: References
+.. rubric:: References
 
-    .. [ZHT2007] :arxiv:`Zou, Hui, Trevor Hastie, and Robert Tibshirani.
-       "On the degrees of freedom of the lasso."
-       The Annals of Statistics 35.5 (2007): 2173-2192.
-       <0712.0881>`
+.. [ZHT2007] :arxiv:`Zou, Hui, Trevor Hastie, and Robert Tibshirani.
+    "On the degrees of freedom of the lasso."
+    The Annals of Statistics 35.5 (2007): 2173-2192.
+    <0712.0881>`
 """
 
-# Author: Alexandre Gramfort
-#         Guillaume Lemaitre
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # We will use the diabetes dataset.
diff --git a/examples/linear_model/plot_lasso_model_selection.py b/examples/linear_model/plot_lasso_model_selection.py
index 169d85ed81644..3f8baa901f399 100644
--- a/examples/linear_model/plot_lasso_model_selection.py
+++ b/examples/linear_model/plot_lasso_model_selection.py
@@ -13,11 +13,8 @@
 In what follows, we will discuss in details the different strategies.
 """
 
-# Author: Olivier Grisel
-#         Gael Varoquaux
-#         Alexandre Gramfort
-#         Guillaume Lemaitre
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Dataset
diff --git a/examples/linear_model/plot_logistic.py b/examples/linear_model/plot_logistic.py
index 6ed3c86e8c27b..a22bc5cb39119 100644
--- a/examples/linear_model/plot_logistic.py
+++ b/examples/linear_model/plot_logistic.py
@@ -10,7 +10,7 @@
 """
 
 # Code source: Gael Varoquaux
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/linear_model/plot_logistic_l1_l2_sparsity.py b/examples/linear_model/plot_logistic_l1_l2_sparsity.py
index c53c2fe881cff..f642dfade5db8 100644
--- a/examples/linear_model/plot_logistic_l1_l2_sparsity.py
+++ b/examples/linear_model/plot_logistic_l1_l2_sparsity.py
@@ -15,10 +15,8 @@
 
 """
 
-# Authors: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#          Mathieu Blondel <mathieu@mblondel.org>
-#          Andreas Mueller <amueller@ais.uni-bonn.de>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/linear_model/plot_logistic_multinomial.py b/examples/linear_model/plot_logistic_multinomial.py
index 791a788b2238b..ca9f1717fe346 100644
--- a/examples/linear_model/plot_logistic_multinomial.py
+++ b/examples/linear_model/plot_logistic_multinomial.py
@@ -9,8 +9,8 @@
 
 """
 
-# Authors: Tom Dupre la Tour <tom.dupre-la-tour@m4x.org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
@@ -18,6 +18,7 @@
 from sklearn.datasets import make_blobs
 from sklearn.inspection import DecisionBoundaryDisplay
 from sklearn.linear_model import LogisticRegression
+from sklearn.multiclass import OneVsRestClassifier
 
 # make 3-class dataset for classification
 centers = [[-5, 0], [0, 1.5], [5, -1]]
@@ -26,9 +27,10 @@
 X = np.dot(X, transformation)
 
 for multi_class in ("multinomial", "ovr"):
-    clf = LogisticRegression(
-        solver="sag", max_iter=100, random_state=42, multi_class=multi_class
-    ).fit(X, y)
+    clf = LogisticRegression(solver="sag", max_iter=100, random_state=42)
+    if multi_class == "ovr":
+        clf = OneVsRestClassifier(clf)
+    clf.fit(X, y)
 
     # print the training scores
     print("training score : %.3f (%s)" % (clf.score(X, y), multi_class))
@@ -44,15 +46,17 @@
     colors = "bry"
     for i, color in zip(clf.classes_, colors):
         idx = np.where(y == i)
-        plt.scatter(
-            X[idx, 0], X[idx, 1], c=color, cmap=plt.cm.Paired, edgecolor="black", s=20
-        )
+        plt.scatter(X[idx, 0], X[idx, 1], c=color, edgecolor="black", s=20)
 
     # Plot the three one-against-all classifiers
     xmin, xmax = plt.xlim()
     ymin, ymax = plt.ylim()
-    coef = clf.coef_
-    intercept = clf.intercept_
+    if multi_class == "ovr":
+        coef = np.concatenate([est.coef_ for est in clf.estimators_])
+        intercept = np.concatenate([est.intercept_ for est in clf.estimators_])
+    else:
+        coef = clf.coef_
+        intercept = clf.intercept_
 
     def plot_hyperplane(c, color):
         def line(x0):
diff --git a/examples/linear_model/plot_logistic_path.py b/examples/linear_model/plot_logistic_path.py
index 52cf2c6587237..983013232e654 100644
--- a/examples/linear_model/plot_logistic_path.py
+++ b/examples/linear_model/plot_logistic_path.py
@@ -25,8 +25,8 @@
 
 """
 
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Load data
diff --git a/examples/linear_model/plot_multi_task_lasso_support.py b/examples/linear_model/plot_multi_task_lasso_support.py
index 9b6ea64ce4d85..433176145e414 100644
--- a/examples/linear_model/plot_multi_task_lasso_support.py
+++ b/examples/linear_model/plot_multi_task_lasso_support.py
@@ -13,8 +13,8 @@
 
 """
 
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Generate data
diff --git a/examples/linear_model/plot_ols.py b/examples/linear_model/plot_ols.py
index 244bd86387474..d94bfadf435a9 100644
--- a/examples/linear_model/plot_ols.py
+++ b/examples/linear_model/plot_ols.py
@@ -15,7 +15,7 @@
 """
 
 # Code source: Jaques Grobler
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/linear_model/plot_ols_3d.py b/examples/linear_model/plot_ols_3d.py
index 0c95d483f1bf3..328131a3b81c0 100644
--- a/examples/linear_model/plot_ols_3d.py
+++ b/examples/linear_model/plot_ols_3d.py
@@ -11,7 +11,7 @@
 
 # Code source: Gaël Varoquaux
 # Modified for documentation by Jaques Grobler
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # First we load the diabetes dataset.
diff --git a/examples/linear_model/plot_ols_ridge_variance.py b/examples/linear_model/plot_ols_ridge_variance.py
index a03d9c253c1cf..324770887afcf 100644
--- a/examples/linear_model/plot_ols_ridge_variance.py
+++ b/examples/linear_model/plot_ols_ridge_variance.py
@@ -21,7 +21,7 @@
 
 # Code source: Gaël Varoquaux
 # Modified for documentation by Jaques Grobler
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 import matplotlib.pyplot as plt
diff --git a/examples/linear_model/plot_poisson_regression_non_normal_loss.py b/examples/linear_model/plot_poisson_regression_non_normal_loss.py
index 2999d46596518..180ee3b70671c 100644
--- a/examples/linear_model/plot_poisson_regression_non_normal_loss.py
+++ b/examples/linear_model/plot_poisson_regression_non_normal_loss.py
@@ -1,3 +1,5 @@
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 """
 ======================================
 Poisson regression and non-normal loss
@@ -36,11 +38,6 @@
 
 """
 
-# Authors: Christian Lorentzen <lorentzen.ch@gmail.com>
-#          Roman Yurchak <rth.yurchak@gmail.com>
-#          Olivier Grisel <olivier.grisel@ensta.org>
-# License: BSD 3 clause
-
 import matplotlib.pyplot as plt
 import numpy as np
 import pandas as pd
@@ -112,7 +109,7 @@
         ("passthrough_numeric", "passthrough", ["BonusMalus"]),
         (
             "binned_numeric",
-            KBinsDiscretizer(n_bins=10, subsample=int(2e5), random_state=0),
+            KBinsDiscretizer(n_bins=10, random_state=0),
             ["VehAge", "DrivAge"],
         ),
         ("log_scaled_numeric", log_scale_transformer, ["Density"]),
diff --git a/examples/linear_model/plot_polynomial_interpolation.py b/examples/linear_model/plot_polynomial_interpolation.py
index f648b7aea762d..e14fd61ee3d75 100644
--- a/examples/linear_model/plot_polynomial_interpolation.py
+++ b/examples/linear_model/plot_polynomial_interpolation.py
@@ -36,11 +36,8 @@
 
 """
 
-# Author: Mathieu Blondel
-#         Jake Vanderplas
-#         Christian Lorentzen
-#         Malte Londschien
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/linear_model/plot_quantile_regression.py b/examples/linear_model/plot_quantile_regression.py
index 70dda86fabd60..61fd3f1c91804 100644
--- a/examples/linear_model/plot_quantile_regression.py
+++ b/examples/linear_model/plot_quantile_regression.py
@@ -14,10 +14,8 @@
 
 """
 
-# Authors: David Dale <dale.david@mail.ru>
-#          Christian Lorentzen <lorentzen.ch@gmail.com>
-#          Guillaume Lemaitre <glemaitre58@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Dataset generation
@@ -111,11 +109,6 @@
 #
 # We will use the quantiles at 5% and 95% to find the outliers in the training
 # sample beyond the central 90% interval.
-from sklearn.utils.fixes import parse_version, sp_version
-
-# This is line is to avoid incompatibility if older SciPy version.
-# You should use `solver="highs"` with recent version of SciPy.
-solver = "highs" if sp_version >= parse_version("1.6.0") else "interior-point"
 
 # %%
 from sklearn.linear_model import QuantileRegressor
@@ -124,7 +117,7 @@
 predictions = {}
 out_bounds_predictions = np.zeros_like(y_true_mean, dtype=np.bool_)
 for quantile in quantiles:
-    qr = QuantileRegressor(quantile=quantile, alpha=0, solver=solver)
+    qr = QuantileRegressor(quantile=quantile, alpha=0)
     y_pred = qr.fit(X, y_normal).predict(X)
     predictions[quantile] = y_pred
 
@@ -186,7 +179,7 @@
 predictions = {}
 out_bounds_predictions = np.zeros_like(y_true_mean, dtype=np.bool_)
 for quantile in quantiles:
-    qr = QuantileRegressor(quantile=quantile, alpha=0, solver=solver)
+    qr = QuantileRegressor(quantile=quantile, alpha=0)
     y_pred = qr.fit(X, y_pareto).predict(X)
     predictions[quantile] = y_pred
 
@@ -256,7 +249,7 @@
 from sklearn.metrics import mean_absolute_error, mean_squared_error
 
 linear_regression = LinearRegression()
-quantile_regression = QuantileRegressor(quantile=0.5, alpha=0, solver=solver)
+quantile_regression = QuantileRegressor(quantile=0.5, alpha=0)
 
 y_pred_lr = linear_regression.fit(X, y_pareto).predict(X)
 y_pred_qr = quantile_regression.fit(X, y_pareto).predict(X)
diff --git a/examples/linear_model/plot_ridge_path.py b/examples/linear_model/plot_ridge_path.py
index 01f9d45a63f8d..d3c19acd9e18c 100644
--- a/examples/linear_model/plot_ridge_path.py
+++ b/examples/linear_model/plot_ridge_path.py
@@ -27,8 +27,8 @@
 
 """
 
-# Author: Fabian Pedregosa -- <fabian.pedregosa@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/linear_model/plot_sgd_comparison.py b/examples/linear_model/plot_sgd_comparison.py
index 0477e42cf5947..c24ad14a79532 100644
--- a/examples/linear_model/plot_sgd_comparison.py
+++ b/examples/linear_model/plot_sgd_comparison.py
@@ -6,8 +6,8 @@
 on the hand-written digits dataset.
 """
 
-# Author: Rob Zinkov <rob at zinkov dot com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/linear_model/plot_sgd_early_stopping.py b/examples/linear_model/plot_sgd_early_stopping.py
index e740ac5031715..a9a5f111dbc18 100644
--- a/examples/linear_model/plot_sgd_early_stopping.py
+++ b/examples/linear_model/plot_sgd_early_stopping.py
@@ -37,9 +37,8 @@
 
 """
 
-# Authors: Tom Dupre la Tour
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import sys
 import time
diff --git a/examples/linear_model/plot_sgd_iris.py b/examples/linear_model/plot_sgd_iris.py
index 5d9b923f9b444..838f612d4659c 100644
--- a/examples/linear_model/plot_sgd_iris.py
+++ b/examples/linear_model/plot_sgd_iris.py
@@ -58,7 +58,6 @@
         X[idx, 1],
         c=color,
         label=iris.target_names[i],
-        cmap=plt.cm.Paired,
         edgecolor="black",
         s=20,
     )
diff --git a/examples/linear_model/plot_sparse_logistic_regression_20newsgroups.py b/examples/linear_model/plot_sparse_logistic_regression_20newsgroups.py
index f62208aab154a..404250a855e0a 100644
--- a/examples/linear_model/plot_sparse_logistic_regression_20newsgroups.py
+++ b/examples/linear_model/plot_sparse_logistic_regression_20newsgroups.py
@@ -32,6 +32,7 @@
 from sklearn.exceptions import ConvergenceWarning
 from sklearn.linear_model import LogisticRegression
 from sklearn.model_selection import train_test_split
+from sklearn.multiclass import OneVsRestClassifier
 
 warnings.filterwarnings("ignore", category=ConvergenceWarning, module="sklearn")
 t0 = timeit.default_timer()
@@ -76,20 +77,25 @@
             "[model=%s, solver=%s] Number of epochs: %s"
             % (model_params["name"], solver, this_max_iter)
         )
-        lr = LogisticRegression(
+        clf = LogisticRegression(
             solver=solver,
-            multi_class=model,
             penalty="l1",
             max_iter=this_max_iter,
             random_state=42,
         )
+        if model == "ovr":
+            clf = OneVsRestClassifier(clf)
         t1 = timeit.default_timer()
-        lr.fit(X_train, y_train)
+        clf.fit(X_train, y_train)
         train_time = timeit.default_timer() - t1
 
-        y_pred = lr.predict(X_test)
+        y_pred = clf.predict(X_test)
         accuracy = np.sum(y_pred == y_test) / y_test.shape[0]
-        density = np.mean(lr.coef_ != 0, axis=1) * 100
+        if model == "ovr":
+            coef = np.concatenate([est.coef_ for est in clf.estimators_])
+        else:
+            coef = clf.coef_
+        density = np.mean(coef != 0, axis=1) * 100
         accuracies.append(accuracy)
         densities.append(density)
         times.append(train_time)
diff --git a/examples/linear_model/plot_sparse_logistic_regression_mnist.py b/examples/linear_model/plot_sparse_logistic_regression_mnist.py
index 119d30a6b3bff..22e4e9cd48e60 100644
--- a/examples/linear_model/plot_sparse_logistic_regression_mnist.py
+++ b/examples/linear_model/plot_sparse_logistic_regression_mnist.py
@@ -17,8 +17,8 @@
 
 """
 
-# Author: Arthur Mensch <arthur.mensch@m4x.org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import time
 
diff --git a/examples/linear_model/plot_theilsen.py b/examples/linear_model/plot_theilsen.py
index eb0ac4966841d..334c94a213a6a 100644
--- a/examples/linear_model/plot_theilsen.py
+++ b/examples/linear_model/plot_theilsen.py
@@ -35,8 +35,8 @@
 
 """
 
-# Author: Florian Wilhelm -- <florian.wilhelm@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import time
 
diff --git a/examples/linear_model/plot_tweedie_regression_insurance_claims.py b/examples/linear_model/plot_tweedie_regression_insurance_claims.py
index 9e5ebb7c1b29b..31a91fb37c766 100644
--- a/examples/linear_model/plot_tweedie_regression_insurance_claims.py
+++ b/examples/linear_model/plot_tweedie_regression_insurance_claims.py
@@ -1,3 +1,5 @@
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 """
 ======================================
 Tweedie regression on insurance claims
@@ -37,11 +39,6 @@
     <https://doi.org/10.2139/ssrn.3164764>`_
 """
 
-# Authors: Christian Lorentzen <lorentzen.ch@gmail.com>
-#          Roman Yurchak <rth.yurchak@gmail.com>
-#          Olivier Grisel <olivier.grisel@ensta.org>
-# License: BSD 3 clause
-
 # %%
 
 from functools import partial
@@ -241,7 +238,7 @@ def score_estimator(
     [
         (
             "binned_numeric",
-            KBinsDiscretizer(n_bins=10, subsample=int(2e5), random_state=0),
+            KBinsDiscretizer(n_bins=10, random_state=0),
             ["VehAge", "DrivAge"],
         ),
         (
diff --git a/examples/manifold/plot_lle_digits.py b/examples/manifold/plot_lle_digits.py
index c5c866d287d17..34b221ca0cd1d 100644
--- a/examples/manifold/plot_lle_digits.py
+++ b/examples/manifold/plot_lle_digits.py
@@ -7,12 +7,8 @@
 
 """
 
-# Authors: Fabian Pedregosa <fabian.pedregosa@inria.fr>
-#          Olivier Grisel <olivier.grisel@ensta.org>
-#          Mathieu Blondel <mathieu@mblondel.org>
-#          Gael Varoquaux
-#          Guillaume Lemaitre <g.lemaitre58@gmail.com>
-# License: BSD 3 clause (C) INRIA 2011
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 # %%
diff --git a/examples/manifold/plot_manifold_sphere.py b/examples/manifold/plot_manifold_sphere.py
index 1e69c4ef8145c..7c666c4b7fb7b 100644
--- a/examples/manifold/plot_manifold_sphere.py
+++ b/examples/manifold/plot_manifold_sphere.py
@@ -25,8 +25,8 @@
 
 """
 
-# Author: Jaques Grobler <jaques.grobler@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from time import time
 
diff --git a/examples/manifold/plot_mds.py b/examples/manifold/plot_mds.py
index 87db0f5ad3a50..c572e792ac71b 100644
--- a/examples/manifold/plot_mds.py
+++ b/examples/manifold/plot_mds.py
@@ -10,8 +10,8 @@
 
 """
 
-# Author: Nelle Varoquaux <nelle.varoquaux@gmail.com>
-# License: BSD
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 from matplotlib import pyplot as plt
diff --git a/examples/manifold/plot_t_sne_perplexity.py b/examples/manifold/plot_t_sne_perplexity.py
index 01505dbacf685..0a4ecd4897a56 100644
--- a/examples/manifold/plot_t_sne_perplexity.py
+++ b/examples/manifold/plot_t_sne_perplexity.py
@@ -24,8 +24,8 @@
 
 """
 
-# Author: Narine Kokhlikyan <narine@slice.com>
-# License: BSD
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from time import time
 
diff --git a/examples/miscellaneous/plot_anomaly_comparison.py b/examples/miscellaneous/plot_anomaly_comparison.py
index 7fb6b71e2a5c6..819a775724e64 100644
--- a/examples/miscellaneous/plot_anomaly_comparison.py
+++ b/examples/miscellaneous/plot_anomaly_comparison.py
@@ -62,9 +62,8 @@
 
 """
 
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#         Albert Thomas <albert.thomas@telecom-paristech.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import time
 
diff --git a/examples/miscellaneous/plot_isotonic_regression.py b/examples/miscellaneous/plot_isotonic_regression.py
index a1c1174c9e9de..4ca352e882f36 100644
--- a/examples/miscellaneous/plot_isotonic_regression.py
+++ b/examples/miscellaneous/plot_isotonic_regression.py
@@ -19,9 +19,8 @@
 
 """
 
-# Author: Nelle Varoquaux <nelle.varoquaux@gmail.com>
-#         Alexandre Gramfort <alexandre.gramfort@inria.fr>
-# License: BSD
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/miscellaneous/plot_kernel_approximation.py b/examples/miscellaneous/plot_kernel_approximation.py
index 199739016efa8..4c994af033080 100644
--- a/examples/miscellaneous/plot_kernel_approximation.py
+++ b/examples/miscellaneous/plot_kernel_approximation.py
@@ -34,9 +34,8 @@
 # ---------------------------------------------------
 
 
-# Author: Gael Varoquaux <gael dot varoquaux at normalesup dot org>
-#         Andreas Mueller <amueller@ais.uni-bonn.de>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # Standard scientific Python imports
 from time import time
@@ -72,7 +71,7 @@
 
 # Create a classifier: a support vector classifier
 kernel_svm = svm.SVC(gamma=0.2)
-linear_svm = svm.LinearSVC(dual="auto", random_state=42)
+linear_svm = svm.LinearSVC(random_state=42)
 
 # create pipeline from kernel approximation
 # and linear svm
@@ -81,14 +80,14 @@
 fourier_approx_svm = pipeline.Pipeline(
     [
         ("feature_map", feature_map_fourier),
-        ("svm", svm.LinearSVC(dual="auto", random_state=42)),
+        ("svm", svm.LinearSVC(random_state=42)),
     ]
 )
 
 nystroem_approx_svm = pipeline.Pipeline(
     [
         ("feature_map", feature_map_nystroem),
-        ("svm", svm.LinearSVC(dual="auto", random_state=42)),
+        ("svm", svm.LinearSVC(random_state=42)),
     ]
 )
 
diff --git a/examples/miscellaneous/plot_kernel_ridge_regression.py b/examples/miscellaneous/plot_kernel_ridge_regression.py
index b865778156c3c..13c2b184c2d30 100644
--- a/examples/miscellaneous/plot_kernel_ridge_regression.py
+++ b/examples/miscellaneous/plot_kernel_ridge_regression.py
@@ -19,8 +19,8 @@
 """
 
 # %%
-# Authors: Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Generate sample data
diff --git a/examples/miscellaneous/plot_metadata_routing.py b/examples/miscellaneous/plot_metadata_routing.py
index b9683d114e257..e96b54436cf30 100644
--- a/examples/miscellaneous/plot_metadata_routing.py
+++ b/examples/miscellaneous/plot_metadata_routing.py
@@ -6,17 +6,23 @@
 .. currentmodule:: sklearn
 
 This document shows how you can use the :ref:`metadata routing mechanism
-<metadata_routing>` in scikit-learn to route metadata through meta-estimators
-to the estimators consuming them. To better understand the rest of the
-document, we need to introduce two concepts: routers and consumers. A router is
-an object, in most cases a meta-estimator, which forwards given data and
-metadata to other objects and estimators. A consumer, on the other hand, is an
-object which accepts and uses a certain given metadata. For instance, an
-estimator taking into account ``sample_weight`` in its :term:`fit` method is a
-consumer of ``sample_weight``. It is possible for an object to be both a router
-and a consumer. For instance, a meta-estimator may take into account
-``sample_weight`` in certain calculations, but it may also route it to the
-underlying estimator.
+<metadata_routing>` in scikit-learn to route metadata to the estimators,
+scorers, and CV splitters consuming them.
+
+To better understand the following document, we need to introduce two concepts:
+routers and consumers. A router is an object which forwards some given data and
+metadata to other objects. In most cases, a router is a :term:`meta-estimator`,
+i.e. an estimator which takes another estimator as a parameter. A function such
+as :func:`sklearn.model_selection.cross_validate` which takes an estimator as a
+parameter and forwards data and metadata, is also a router.
+
+A consumer, on the other hand, is an object which accepts and uses some given
+metadata. For instance, an estimator taking into account ``sample_weight`` in
+its :term:`fit` method is a consumer of ``sample_weight``.
+
+It is possible for an object to be both a router and a consumer. For instance,
+a meta-estimator may take into account ``sample_weight`` in certain
+calculations, but it may also route it to the underlying estimator.
 
 First a few imports and some random data for the rest of the script.
 """
@@ -56,13 +62,12 @@
 my_other_weights = rng.rand(n_samples)
 
 # %%
-# This feature is only available if explicitly enabled:
+# Metadata routing is only available if explicitly enabled:
 set_config(enable_metadata_routing=True)
 
-# %%
-# This utility function is a dummy to check if a metadata is passed.
-
 
+# %%
+# This utility function is a dummy to check if a metadata is passed:
 def check_metadata(obj, **kwargs):
     for key, value in kwargs.items():
         if value is not None:
@@ -74,14 +79,14 @@ def check_metadata(obj, **kwargs):
 
 
 # %%
-# A utility function to nicely print the routing information of an object
+# A utility function to nicely print the routing information of an object:
 def print_routing(obj):
     pprint(obj.get_metadata_routing()._serialize())
 
 
 # %%
-# Estimators
-# ----------
+# Consuming Estimator
+# -------------------
 # Here we demonstrate how an estimator can expose the required API to support
 # metadata routing as a consumer. Imagine a simple classifier accepting
 # ``sample_weight`` as a metadata on its ``fit`` and ``groups`` in its
@@ -117,11 +122,11 @@ def predict(self, X, groups=None):
 
 # %%
 # The above output means that ``sample_weight`` and ``groups`` are not
-# requested, but if a router is given those metadata, it should raise an error,
-# since the user has not explicitly set whether they are required or not. The
-# same is true for ``sample_weight`` in the ``score`` method, which is
-# inherited from :class:`~base.ClassifierMixin`. In order to explicitly set
-# request values for those metadata, we can use these methods:
+# requested by `ExampleClassifier`, and if a router is given those metadata, it
+# should raise an error, since the user has not explicitly set whether they are
+# required or not. The same is true for ``sample_weight`` in the ``score``
+# method, which is inherited from :class:`~base.ClassifierMixin`. In order to
+# explicitly set request values for those metadata, we can use these methods:
 
 est = (
     ExampleClassifier()
@@ -133,7 +138,7 @@ def predict(self, X, groups=None):
 
 # %%
 # .. note ::
-#     Please note that as long as the above estimator is not used in another
+#     Please note that as long as the above estimator is not used in a
 #     meta-estimator, the user does not need to set any requests for the
 #     metadata and the set values are ignored, since a consumer does not
 #     validate or route given metadata. A simple usage of the above estimator
@@ -144,8 +149,11 @@ def predict(self, X, groups=None):
 est.predict(X[:3, :], groups=my_groups)
 
 # %%
-# Now let's have a meta-estimator, which doesn't do much other than routing the
-# metadata.
+# Routing Meta-Estimator
+# ----------------------
+# Now, we show how to design a meta-estimator to be a router. As a simplified
+# example, here is a meta-estimator, which doesn't do much other than routing
+# the metadata.
 
 
 class MetaClassifier(MetaEstimatorMixin, ClassifierMixin, BaseEstimator):
@@ -155,35 +163,43 @@ def __init__(self, estimator):
     def get_metadata_routing(self):
         # This method defines the routing for this meta-estimator.
         # In order to do so, a `MetadataRouter` instance is created, and the
-        # right routing is added to it. More explanations follow.
+        # routing is added to it. More explanations follow below.
         router = MetadataRouter(owner=self.__class__.__name__).add(
-            estimator=self.estimator, method_mapping="one-to-one"
+            estimator=self.estimator,
+            method_mapping=MethodMapping()
+            .add(caller="fit", callee="fit")
+            .add(caller="predict", callee="predict")
+            .add(caller="score", callee="score"),
         )
         return router
 
     def fit(self, X, y, **fit_params):
-        # meta-estimators are responsible for validating the given metadata.
-        # `get_routing_for_object` is a safe way to construct a
-        # `MetadataRouter` or a `MetadataRequest` from the given object.
+        # `get_routing_for_object` returns a copy of the `MetadataRouter`
+        # constructed by the above `get_metadata_routing` method, that is
+        # internally called.
         request_router = get_routing_for_object(self)
+        # Meta-estimators are responsible for validating the given metadata.
+        # `method` refers to the parent's method, i.e. `fit` in this example.
         request_router.validate_metadata(params=fit_params, method="fit")
-        # we can use provided utility methods to map the given metadata to what
-        # is required by the underlying estimator. Here `method` refers to the
-        # parent's method, i.e. `fit` in this example.
+        # `MetadataRouter.route_params` maps the given metadata to the metadata
+        # required by the underlying estimator based on the routing information
+        # defined by the MetadataRouter. The output of type `Bunch` has a key
+        # for each consuming object and those hold keys for their consuming
+        # methods, which then contain key for the metadata which should be
+        # routed to them.
         routed_params = request_router.route_params(params=fit_params, caller="fit")
 
-        # the output has a key for each object's method which is used here,
-        # i.e. parent's `fit` method, containing the metadata which should be
-        # routed to them, based on the information provided in
-        # `get_metadata_routing`.
+        # A sub-estimator is fitted and its classes are attributed to the
+        # meta-estimator.
         self.estimator_ = clone(self.estimator).fit(X, y, **routed_params.estimator.fit)
         self.classes_ = self.estimator_.classes_
         return self
 
     def predict(self, X, **predict_params):
         check_is_fitted(self)
-        # same as in `fit`, we validate the given metadata
+        # As in `fit`, we get a copy of the object's MetadataRouter,
         request_router = get_routing_for_object(self)
+        # then we validate the given metadata,
         request_router.validate_metadata(params=predict_params, method="predict")
         # and then prepare the input to the underlying `predict` method.
         routed_params = request_router.route_params(
@@ -195,77 +211,82 @@ def predict(self, X, **predict_params):
 # %%
 # Let's break down different parts of the above code.
 #
-# First, the :meth:`~utils.metadata_routing.get_routing_for_object` takes an
-# estimator (``self``) and returns a
-# :class:`~utils.metadata_routing.MetadataRouter` or a
-# :class:`~utils.metadata_routing.MetadataRequest` based on the output of the
-# estimator's ``get_metadata_routing`` method.
+# First, the :meth:`~utils.metadata_routing.get_routing_for_object` takes our
+# meta-estimator (``self``) and returns a
+# :class:`~utils.metadata_routing.MetadataRouter` or, a
+# :class:`~utils.metadata_routing.MetadataRequest` if the object is a consumer,
+# based on the output of the estimator's ``get_metadata_routing`` method.
 #
 # Then in each method, we use the ``route_params`` method to construct a
 # dictionary of the form ``{"object_name": {"method_name": {"metadata":
 # value}}}`` to pass to the underlying estimator's method. The ``object_name``
 # (``estimator`` in the above ``routed_params.estimator.fit`` example) is the
 # same as the one added in the ``get_metadata_routing``. ``validate_metadata``
-# makes sure all given metadata are requested to avoid silent bugs. Now, we
-# illustrate the different behaviors and notably the type of errors raised:
+# makes sure all given metadata are requested to avoid silent bugs.
+#
+# Next, we illustrate the different behaviors and notably the type of errors
+# raised.
 
-est = MetaClassifier(estimator=ExampleClassifier().set_fit_request(sample_weight=True))
-est.fit(X, y, sample_weight=my_weights)
+meta_est = MetaClassifier(
+    estimator=ExampleClassifier().set_fit_request(sample_weight=True)
+)
+meta_est.fit(X, y, sample_weight=my_weights)
 
 # %%
-# Note that the above example checks that ``sample_weight`` is correctly passed
-# to ``ExampleClassifier``, or else it would print that ``sample_weight`` is
-# ``None``:
+# Note that the above example is calling our utility function
+# `check_metadata()` via the `ExampleClassifier`. It checks that
+# ``sample_weight`` is correctly passed to it. If it is not, like in the
+# following example, it would print that ``sample_weight`` is ``None``:
 
-est.fit(X, y)
+meta_est.fit(X, y)
 
 # %%
 # If we pass an unknown metadata, an error is raised:
 try:
-    est.fit(X, y, test=my_weights)
+    meta_est.fit(X, y, test=my_weights)
 except TypeError as e:
     print(e)
 
 # %%
 # And if we pass a metadata which is not explicitly requested:
 try:
-    est.fit(X, y, sample_weight=my_weights).predict(X, groups=my_groups)
+    meta_est.fit(X, y, sample_weight=my_weights).predict(X, groups=my_groups)
 except ValueError as e:
     print(e)
 
 # %%
 # Also, if we explicitly set it as not requested, but it is provided:
-est = MetaClassifier(
+meta_est = MetaClassifier(
     estimator=ExampleClassifier()
     .set_fit_request(sample_weight=True)
     .set_predict_request(groups=False)
 )
 try:
-    est.fit(X, y, sample_weight=my_weights).predict(X[:3, :], groups=my_groups)
+    meta_est.fit(X, y, sample_weight=my_weights).predict(X[:3, :], groups=my_groups)
 except TypeError as e:
     print(e)
 
 # %%
-# Another concept to introduce is **aliased metadata**. This is when an estimator
-# requests a metadata with a different name than the default value. For
-# instance, in a setting where there are two estimators in a pipeline, one
-# could request ``sample_weight1`` and the other ``sample_weight2``. Note that
-# this doesn't change what the estimator expects, it only tells the
-# meta-estimator how to map the provided metadata to what's required. Here's an
-# example, where we pass ``aliased_sample_weight`` to the meta-estimator, but
-# the meta-estimator understands that ``aliased_sample_weight`` is an alias for
-# ``sample_weight``, and passes it as ``sample_weight`` to the underlying
-# estimator:
-est = MetaClassifier(
+# Another concept to introduce is **aliased metadata**. This is when an
+# estimator requests a metadata with a different variable name than the default
+# variable name. For instance, in a setting where there are two estimators in a
+# pipeline, one could request ``sample_weight1`` and the other
+# ``sample_weight2``. Note that this doesn't change what the estimator expects,
+# it only tells the meta-estimator how to map the provided metadata to what is
+# required. Here's an example, where we pass ``aliased_sample_weight`` to the
+# meta-estimator, but the meta-estimator understands that
+# ``aliased_sample_weight`` is an alias for ``sample_weight``, and passes it as
+# ``sample_weight`` to the underlying estimator:
+meta_est = MetaClassifier(
     estimator=ExampleClassifier().set_fit_request(sample_weight="aliased_sample_weight")
 )
-est.fit(X, y, aliased_sample_weight=my_weights)
+meta_est.fit(X, y, aliased_sample_weight=my_weights)
 
 # %%
-# And passing ``sample_weight`` here will fail since it is requested with an
+# Passing ``sample_weight`` here will fail since it is requested with an
 # alias and ``sample_weight`` with that name is not requested:
 try:
-    est.fit(X, y, sample_weight=my_weights)
+    meta_est.fit(X, y, sample_weight=my_weights)
 except TypeError as e:
     print(e)
 
@@ -280,41 +301,46 @@ def predict(self, X, **predict_params):
 # corresponding method routings, i.e. which method of a sub-estimator is used
 # in which method of a meta-estimator:
 
-print_routing(est)
+print_routing(meta_est)
 
 # %%
 # As you can see, the only metadata requested for method ``fit`` is
 # ``"sample_weight"`` with ``"aliased_sample_weight"`` as the alias. The
 # ``~utils.metadata_routing.MetadataRouter`` class enables us to easily create
 # the routing object which would create the output we need for our
-# ``get_metadata_routing``. In the above implementation,
-# ``mapping="one-to-one"`` means there is a one to one mapping between
-# sub-estimator's methods and meta-estimator's ones, i.e. ``fit`` used in
-# ``fit`` and so on. In order to understand how aliases work in
-# meta-estimators, imagine our meta-estimator inside another one:
+# ``get_metadata_routing``.
+#
+# In order to understand how aliases work in meta-estimators, imagine our
+# meta-estimator inside another one:
 
-meta_est = MetaClassifier(estimator=est).fit(X, y, aliased_sample_weight=my_weights)
+meta_meta_est = MetaClassifier(estimator=meta_est).fit(
+    X, y, aliased_sample_weight=my_weights
+)
 
 # %%
-# In the above example, this is how each ``fit`` method will call the
-# sub-estimator's ``fit``::
+# In the above example, this is how the ``fit`` method of `meta_meta_est`
+# will call their sub-estimator's ``fit`` methods::
+#
+#     # user feeds `my_weights` as `aliased_sample_weight` into `meta_meta_est`:
+#     meta_meta_est.fit(X, y, aliased_sample_weight=my_weights):
+#         ...
 #
-#     meta_est.fit(X, y, aliased_sample_weight=my_weights):
-#         ...  # this estimator (est), expects aliased_sample_weight as seen above
+#         # the first sub-estimator (`meta_est`) expects `aliased_sample_weight`
 #         self.estimator_.fit(X, y, aliased_sample_weight=aliased_sample_weight):
-#             ...  # now est passes aliased_sample_weight's value as sample_weight,
-#                  # which is expected by the sub-estimator
-#             self.estimator_.fit(X, y, sample_weight=aliased_sample_weight)
-#    ...
+#             ...
+#
+#             # the second sub-estimator (`est`) expects `sample_weight`
+#             self.estimator_.fit(X, y, sample_weight=aliased_sample_weight):
+#                 ...
 
 # %%
-# Router and Consumer
-# -------------------
-# To show how a slightly more complex case would work, consider a case
-# where a meta-estimator uses some metadata, but it also routes them to an
-# underlying estimator. In this case, this meta-estimator is a consumer and a
-# router at the same time. This is how we can implement one, and it is very
-# similar to what we had before, with a few tweaks.
+# Consuming and routing Meta-Estimator
+# ------------------------------------
+# For a slightly more complex example, consider a meta-estimator that routes
+# metadata to an underlying estimator as before, but it also uses some metadata
+# in its own methods. This meta-estimator is a consumer and a router at the
+# same time. Implementing one is very similar to what we had before, but with a
+# few tweaks.
 
 
 class RouterConsumerClassifier(MetaEstimatorMixin, ClassifierMixin, BaseEstimator):
@@ -324,47 +350,59 @@ def __init__(self, estimator):
     def get_metadata_routing(self):
         router = (
             MetadataRouter(owner=self.__class__.__name__)
+            # defining metadata routing request values for usage in the meta-estimator
             .add_self_request(self)
-            .add(estimator=self.estimator, method_mapping="one-to-one")
+            # defining metadata routing request values for usage in the sub-estimator
+            .add(
+                estimator=self.estimator,
+                method_mapping=MethodMapping()
+                .add(caller="fit", callee="fit")
+                .add(caller="predict", callee="predict")
+                .add(caller="score", callee="score"),
+            )
         )
         return router
 
+    # Since `sample_weight` is used and consumed here, it should be defined as
+    # an explicit argument in the method's signature. All other metadata which
+    # are only routed, will be passed as `**fit_params`:
     def fit(self, X, y, sample_weight, **fit_params):
         if self.estimator is None:
             raise ValueError("estimator cannot be None!")
 
         check_metadata(self, sample_weight=sample_weight)
 
+        # We add `sample_weight` to the `fit_params` dictionary.
         if sample_weight is not None:
             fit_params["sample_weight"] = sample_weight
 
-        # meta-estimators are responsible for validating the given metadata
         request_router = get_routing_for_object(self)
         request_router.validate_metadata(params=fit_params, method="fit")
-        # we can use provided utility methods to map the given metadata to what
-        # is required by the underlying estimator
-        params = request_router.route_params(params=fit_params, caller="fit")
-        self.estimator_ = clone(self.estimator).fit(X, y, **params.estimator.fit)
+        routed_params = request_router.route_params(params=fit_params, caller="fit")
+        self.estimator_ = clone(self.estimator).fit(X, y, **routed_params.estimator.fit)
         self.classes_ = self.estimator_.classes_
         return self
 
     def predict(self, X, **predict_params):
         check_is_fitted(self)
-        # same as in ``fit``, we validate the given metadata
+        # As in `fit`, we get a copy of the object's MetadataRouter,
         request_router = get_routing_for_object(self)
+        # we validate the given metadata,
         request_router.validate_metadata(params=predict_params, method="predict")
         # and then prepare the input to the underlying ``predict`` method.
-        params = request_router.route_params(params=predict_params, caller="predict")
-        return self.estimator_.predict(X, **params.estimator.predict)
+        routed_params = request_router.route_params(
+            params=predict_params, caller="predict"
+        )
+        return self.estimator_.predict(X, **routed_params.estimator.predict)
 
 
 # %%
-# The key parts where the above estimator differs from our previous
+# The key parts where the above meta-estimator differs from our previous
 # meta-estimator is accepting ``sample_weight`` explicitly in ``fit`` and
-# including it in ``fit_params``. Making ``sample_weight`` an explicit argument
-# makes sure ``set_fit_request(sample_weight=...)`` is present for this class.
-# In a sense, this means the estimator is both a consumer, as well as a router
-# of ``sample_weight``.
+# including it in ``fit_params``. Since ``sample_weight`` is an explicit
+# argument, we can be sure that ``set_fit_request(sample_weight=...)`` is
+# present for this method. The meta-estimator is both a consumer, as well as a
+# router of ``sample_weight``.
 #
 # In ``get_metadata_routing``, we add ``self`` to the routing using
 # ``add_self_request`` to indicate this estimator is consuming
@@ -374,61 +412,68 @@ def predict(self, X, **predict_params):
 
 # %%
 # - No metadata requested
-est = RouterConsumerClassifier(estimator=ExampleClassifier())
-print_routing(est)
+meta_est = RouterConsumerClassifier(estimator=ExampleClassifier())
+print_routing(meta_est)
 
 
 # %%
-# - ``sample_weight`` requested by underlying estimator
-est = RouterConsumerClassifier(
+# - ``sample_weight`` requested by sub-estimator
+meta_est = RouterConsumerClassifier(
     estimator=ExampleClassifier().set_fit_request(sample_weight=True)
 )
-print_routing(est)
+print_routing(meta_est)
 
 # %%
 # - ``sample_weight`` requested by meta-estimator
-est = RouterConsumerClassifier(estimator=ExampleClassifier()).set_fit_request(
+meta_est = RouterConsumerClassifier(estimator=ExampleClassifier()).set_fit_request(
     sample_weight=True
 )
-print_routing(est)
+print_routing(meta_est)
 
 # %%
 # Note the difference in the requested metadata representations above.
 #
-# - We can also alias the metadata to pass different values to them:
+# - We can also alias the metadata to pass different values to the fit methods
+#   of the meta- and the sub-estimator:
 
-est = RouterConsumerClassifier(
+meta_est = RouterConsumerClassifier(
     estimator=ExampleClassifier().set_fit_request(sample_weight="clf_sample_weight"),
 ).set_fit_request(sample_weight="meta_clf_sample_weight")
-print_routing(est)
+print_routing(meta_est)
 
 # %%
 # However, ``fit`` of the meta-estimator only needs the alias for the
-# sub-estimator, since it doesn't validate and route its own required metadata:
-est.fit(X, y, sample_weight=my_weights, clf_sample_weight=my_other_weights)
+# sub-estimator and addresses their own sample weight as `sample_weight`, since
+# it doesn't validate and route its own required metadata:
+meta_est.fit(X, y, sample_weight=my_weights, clf_sample_weight=my_other_weights)
 
 # %%
-# - Alias only on the sub-estimator. This is useful if we don't want the
-#   meta-estimator to use the metadata, and we only want the metadata to be used
-#   by the sub-estimator.
-est = RouterConsumerClassifier(
+# - Alias only on the sub-estimator:
+#
+# This is useful when we don't want the meta-estimator to use the metadata, but
+# the sub-estimator should.
+meta_est = RouterConsumerClassifier(
     estimator=ExampleClassifier().set_fit_request(sample_weight="aliased_sample_weight")
-).set_fit_request(sample_weight=True)
-print_routing(est)
-
+)
+print_routing(meta_est)
+# %%
+# The meta-estimator cannot use `aliased_sample_weight`, because it expects
+# it passed as `sample_weight`. This would apply even if
+# `set_fit_request(sample_weight=True)` was set on it.
 
 # %%
 # Simple Pipeline
 # ---------------
-# A slightly more complicated use-case is a meta-estimator which does something
-# similar to the :class:`~pipeline.Pipeline`. Here is a meta-estimator, which
-# accepts a transformer and a classifier, and applies the transformer before
-# running the classifier.
+# A slightly more complicated use-case is a meta-estimator resembling a
+# :class:`~pipeline.Pipeline`. Here is a meta-estimator, which accepts a
+# transformer and a classifier. When calling its `fit` method, it applies the
+# transformer's `fit` and `transform` before running the classifier on the
+# transformed data. Upon `predict`, it applies the transformer's `transform`
+# before predicting with the classifier's `predict` method on the transformed
+# new data.
 
 
 class SimplePipeline(ClassifierMixin, BaseEstimator):
-    _required_parameters = ["estimator"]
-
     def __init__(self, transformer, classifier):
         self.transformer = transformer
         self.classifier = classifier
@@ -436,48 +481,66 @@ def __init__(self, transformer, classifier):
     def get_metadata_routing(self):
         router = (
             MetadataRouter(owner=self.__class__.__name__)
+            # We add the routing for the transformer.
             .add(
                 transformer=self.transformer,
                 method_mapping=MethodMapping()
-                .add(callee="fit", caller="fit")
-                .add(callee="transform", caller="fit")
-                .add(callee="transform", caller="predict"),
+                # The metadata is routed such that it retraces how
+                # `SimplePipeline` internally calls the transformer's `fit` and
+                # `transform` methods in its own methods (`fit` and `predict`).
+                .add(caller="fit", callee="fit")
+                .add(caller="fit", callee="transform")
+                .add(caller="predict", callee="transform"),
+            )
+            # We add the routing for the classifier.
+            .add(
+                classifier=self.classifier,
+                method_mapping=MethodMapping()
+                .add(caller="fit", callee="fit")
+                .add(caller="predict", callee="predict"),
             )
-            .add(classifier=self.classifier, method_mapping="one-to-one")
         )
         return router
 
     def fit(self, X, y, **fit_params):
-        params = process_routing(self, "fit", **fit_params)
+        routed_params = process_routing(self, "fit", **fit_params)
 
-        self.transformer_ = clone(self.transformer).fit(X, y, **params.transformer.fit)
-        X_transformed = self.transformer_.transform(X, **params.transformer.transform)
+        self.transformer_ = clone(self.transformer).fit(
+            X, y, **routed_params.transformer.fit
+        )
+        X_transformed = self.transformer_.transform(
+            X, **routed_params.transformer.transform
+        )
 
         self.classifier_ = clone(self.classifier).fit(
-            X_transformed, y, **params.classifier.fit
+            X_transformed, y, **routed_params.classifier.fit
         )
         return self
 
     def predict(self, X, **predict_params):
-        params = process_routing(self, "predict", **predict_params)
+        routed_params = process_routing(self, "predict", **predict_params)
 
-        X_transformed = self.transformer_.transform(X, **params.transformer.transform)
-        return self.classifier_.predict(X_transformed, **params.classifier.predict)
+        X_transformed = self.transformer_.transform(
+            X, **routed_params.transformer.transform
+        )
+        return self.classifier_.predict(
+            X_transformed, **routed_params.classifier.predict
+        )
 
 
 # %%
-# Note the usage of :class:`~utils.metadata_routing.MethodMapping` to declare
-# which methods of the child estimator (callee) are used in which methods of
-# the meta estimator (caller). As you can see, we use the transformer's
-# ``transform`` and ``fit`` methods in ``fit``, and its ``transform`` method in
-# ``predict``, and that's what you see implemented in the routing structure of
-# the pipeline class.
+# Note the usage of :class:`~utils.metadata_routing.MethodMapping` to
+# declare which methods of the child estimator (callee) are used in which
+# methods of the meta estimator (caller). As you can see, `SimplePipeline` uses
+# the transformer's ``transform`` and ``fit`` methods in ``fit``, and its
+# ``transform`` method in ``predict``, and that's what you see implemented in
+# the routing structure of the pipeline class.
 #
 # Another difference in the above example with the previous ones is the usage
 # of :func:`~utils.metadata_routing.process_routing`, which processes the input
-# parameters, does the required validation, and returns the `params` which we
-# had created in previous examples. This reduces the boilerplate code a
-# developer needs to write in each meta-estimator's method. Developers are
+# parameters, does the required validation, and returns the `routed_params`
+# which we had created in previous examples. This reduces the boilerplate code
+# a developer needs to write in each meta-estimator's method. Developers are
 # strongly recommended to use this function unless there is a good reason
 # against it.
 #
@@ -505,14 +568,14 @@ def fit_transform(self, X, y, sample_weight=None, groups=None):
 # ``transform``.
 #
 # Now we can test our pipeline, and see if metadata is correctly passed around.
-# This example uses our simple pipeline, and our transformer, and our
-# consumer+router estimator which uses our simple classifier.
+# This example uses our `SimplePipeline`, our `ExampleTransformer`, and our
+# `RouterConsumerClassifier` which uses our `ExampleClassifier`.
 
-est = SimplePipeline(
+pipe = SimplePipeline(
     transformer=ExampleTransformer()
-    # we transformer's fit to receive sample_weight
+    # we set transformer's fit to receive sample_weight
     .set_fit_request(sample_weight=True)
-    # we want transformer's transform to receive groups
+    # we set transformer's transform to receive groups
     .set_transform_request(groups=True),
     classifier=RouterConsumerClassifier(
         estimator=ExampleClassifier()
@@ -520,12 +583,11 @@ def fit_transform(self, X, y, sample_weight=None, groups=None):
         .set_fit_request(sample_weight=True)
         # but not groups in predict
         .set_predict_request(groups=False),
-    ).set_fit_request(
-        # and we want the meta-estimator to receive sample_weight as well
-        sample_weight=True
-    ),
+    )
+    # and we want the meta-estimator to receive sample_weight as well
+    .set_fit_request(sample_weight=True),
 )
-est.fit(X, y, sample_weight=my_weights, groups=my_groups).predict(
+pipe.fit(X, y, sample_weight=my_weights, groups=my_groups).predict(
     X[:3], groups=my_groups
 )
 
@@ -544,18 +606,20 @@ def __init__(self, estimator):
         self.estimator = estimator
 
     def fit(self, X, y, **fit_params):
-        params = process_routing(self, "fit", **fit_params)
-        self.estimator_ = clone(self.estimator).fit(X, y, **params.estimator.fit)
+        routed_params = process_routing(self, "fit", **fit_params)
+        self.estimator_ = clone(self.estimator).fit(X, y, **routed_params.estimator.fit)
 
     def get_metadata_routing(self):
         router = MetadataRouter(owner=self.__class__.__name__).add(
-            estimator=self.estimator, method_mapping="one-to-one"
+            estimator=self.estimator,
+            method_mapping=MethodMapping().add(caller="fit", callee="fit"),
         )
         return router
 
 
 # %%
-# As explained above, this is now a valid usage:
+# As explained above, this is a valid usage if `my_weights` aren't supposed
+# to be passed as `sample_weight` to `MetaRegressor`:
 
 reg = MetaRegressor(estimator=LinearRegression().set_fit_request(sample_weight=True))
 reg.fit(X, y, sample_weight=my_weights)
@@ -567,29 +631,36 @@ def get_metadata_routing(self):
 
 
 class WeightedMetaRegressor(MetaEstimatorMixin, RegressorMixin, BaseEstimator):
+    # show warning to remind user to explicitly set the value with
+    # `.set_{method}_request(sample_weight={boolean})`
     __metadata_request__fit = {"sample_weight": metadata_routing.WARN}
 
     def __init__(self, estimator):
         self.estimator = estimator
 
     def fit(self, X, y, sample_weight=None, **fit_params):
-        params = process_routing(self, "fit", sample_weight=sample_weight, **fit_params)
+        routed_params = process_routing(
+            self, "fit", sample_weight=sample_weight, **fit_params
+        )
         check_metadata(self, sample_weight=sample_weight)
-        self.estimator_ = clone(self.estimator).fit(X, y, **params.estimator.fit)
+        self.estimator_ = clone(self.estimator).fit(X, y, **routed_params.estimator.fit)
 
     def get_metadata_routing(self):
         router = (
             MetadataRouter(owner=self.__class__.__name__)
             .add_self_request(self)
-            .add(estimator=self.estimator, method_mapping="one-to-one")
+            .add(
+                estimator=self.estimator,
+                method_mapping=MethodMapping().add(caller="fit", callee="fit"),
+            )
         )
         return router
 
 
 # %%
-# The above implementation is almost no different than ``MetaRegressor``, and
+# The above implementation is almost the same as ``MetaRegressor``, and
 # because of the default request value defined in ``__metadata_request__fit``
-# there is a warning raised.
+# there is a warning raised when fitted.
 
 with warnings.catch_warnings(record=True) as record:
     WeightedMetaRegressor(
@@ -600,7 +671,7 @@ def get_metadata_routing(self):
 
 
 # %%
-# When an estimator supports a metadata which wasn't supported before, the
+# When an estimator consumes a metadata which it didn't consume before, the
 # following pattern can be used to warn the users about it.
 
 
@@ -621,7 +692,7 @@ def predict(self, X):
     print(w.message)
 
 # %%
-# In the end, we disable the configuration flag for metadata routing:
+# At the end we disable the configuration flag for metadata routing:
 
 set_config(enable_metadata_routing=False)
 
@@ -634,12 +705,12 @@ def predict(self, X):
 # :class:`~utils.metadata_routing.MetadataRouter`. It is strongly not advised,
 # but possible to vendor the tools related to metadata-routing if you strictly
 # want to have a scikit-learn compatible estimator, without depending on the
-# scikit-learn package. If the following conditions are met, you do NOT need to
-# modify your code at all:
+# scikit-learn package. If all of the following conditions are met, you do NOT
+# need to modify your code at all:
 #
 # - your estimator inherits from :class:`~base.BaseEstimator`
 # - the parameters consumed by your estimator's methods, e.g. ``fit``, are
 #   explicitly defined in the method's signature, as opposed to being
 #   ``*args`` or ``*kwargs``.
-# - you do not route any metadata to the underlying objects, i.e. you're not a
-#   *router*.
+# - your estimator does not route any metadata to the underlying objects, i.e.
+#   it's not a *router*.
diff --git a/examples/miscellaneous/plot_multilabel.py b/examples/miscellaneous/plot_multilabel.py
index b424c3253104a..e916d871b4793 100644
--- a/examples/miscellaneous/plot_multilabel.py
+++ b/examples/miscellaneous/plot_multilabel.py
@@ -29,8 +29,8 @@
 
 """
 
-# Authors: Vlad Niculae, Mathieu Blondel
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/miscellaneous/plot_outlier_detection_bench.py b/examples/miscellaneous/plot_outlier_detection_bench.py
index 7af47fe282ec0..cef58e20d75eb 100644
--- a/examples/miscellaneous/plot_outlier_detection_bench.py
+++ b/examples/miscellaneous/plot_outlier_detection_bench.py
@@ -18,9 +18,8 @@
 2. The performance is assessed in terms of the ROC-AUC.
 """
 
-# Author: Pharuj Rajborirug <pharuj.ra@kmitl.ac.th>
-#         Arturo Amor <david-arturo.amor-quiroz@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Dataset preprocessing and model training
diff --git a/examples/miscellaneous/plot_set_output.py b/examples/miscellaneous/plot_set_output.py
index 9baa71a1b3648..e74d94957c685 100644
--- a/examples/miscellaneous/plot_set_output.py
+++ b/examples/miscellaneous/plot_set_output.py
@@ -63,6 +63,21 @@
 # means that the final logistic regression step contains the feature names of the input.
 clf[-1].feature_names_in_
 
+# %%
+# .. note:: If one uses the method `set_params`, the transformer will be
+#    replaced by a new one with the default output format.
+clf.set_params(standardscaler=StandardScaler())
+clf.fit(X_train, y_train)
+clf[-1].feature_names_in_
+
+# %%
+# To keep the intended behavior, use `set_output` on the new transformer
+# beforehand
+scaler = StandardScaler().set_output(transform="pandas")
+clf.set_params(standardscaler=scaler)
+clf.fit(X_train, y_train)
+clf[-1].feature_names_in_
+
 # %%
 # Next we load the titanic dataset to demonstrate `set_output` with
 # :class:`compose.ColumnTransformer` and heterogeneous data.
diff --git a/examples/mixture/plot_concentration_prior.py b/examples/mixture/plot_concentration_prior.py
index 6561186adb119..4d6a0822bff38 100644
--- a/examples/mixture/plot_concentration_prior.py
+++ b/examples/mixture/plot_concentration_prior.py
@@ -29,8 +29,8 @@
 
 """
 
-# Author: Thierry Guillemot <thierry.guillemot.work@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib as mpl
 import matplotlib.gridspec as gridspec
diff --git a/examples/mixture/plot_gmm_covariances.py b/examples/mixture/plot_gmm_covariances.py
index 9466e11749966..91a26f518f332 100644
--- a/examples/mixture/plot_gmm_covariances.py
+++ b/examples/mixture/plot_gmm_covariances.py
@@ -27,9 +27,8 @@
 
 """
 
-# Author: Ron Weiss <ronweiss@gmail.com>, Gael Varoquaux
-# Modified by Thierry Guillemot <thierry.guillemot.work@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib as mpl
 import matplotlib.pyplot as plt
diff --git a/examples/mixture/plot_gmm_selection.py b/examples/mixture/plot_gmm_selection.py
index cd84c03ab7d13..4b4c52334eeca 100644
--- a/examples/mixture/plot_gmm_selection.py
+++ b/examples/mixture/plot_gmm_selection.py
@@ -56,33 +56,11 @@
 # - `"diag"`: each component has its own diagonal covariance matrix.
 # - `"spherical"`: each component has its own single variance.
 #
-# We score the different models and keep the best model (the lowest BIC). This
-# is done by using :class:`~sklearn.model_selection.GridSearchCV` and a
-# user-defined score function which returns the negative BIC score, as
-# :class:`~sklearn.model_selection.GridSearchCV` is designed to **maximize** a
-# score (maximizing the negative BIC is equivalent to minimizing the BIC).
-#
-# The best set of parameters and estimator are stored in `best_parameters_` and
-# `best_estimator_`, respectively.
-
-from sklearn.mixture import GaussianMixture
-from sklearn.model_selection import GridSearchCV
 
+from sklearn.mixture import GaussianMixtureIC
 
-def gmm_bic_score(estimator, X):
-    """Callable to pass to GridSearchCV that will use the BIC score."""
-    # Make it negative since GridSearchCV expects a score to maximize
-    return -estimator.bic(X)
-
-
-param_grid = {
-    "n_components": range(1, 7),
-    "covariance_type": ["spherical", "tied", "diag", "full"],
-}
-grid_search = GridSearchCV(
-    GaussianMixture(), param_grid=param_grid, scoring=gmm_bic_score
-)
-grid_search.fit(X)
+gm_ic = GaussianMixtureIC(min_components=1, max_components=6, covariance_type="all")
+gm_ic.fit(X)
 
 # %%
 # Plot the BIC scores
@@ -94,17 +72,19 @@ def gmm_bic_score(estimator, X):
 
 import pandas as pd
 
-df = pd.DataFrame(grid_search.cv_results_)[
-    ["param_n_components", "param_covariance_type", "mean_test_score"]
-]
-df["mean_test_score"] = -df["mean_test_score"]
-df = df.rename(
-    columns={
-        "param_n_components": "Number of components",
-        "param_covariance_type": "Type of covariance",
-        "mean_test_score": "BIC score",
-    }
+from sklearn.model_selection import ParameterGrid
+
+param_grid = list(
+    ParameterGrid(
+        {
+            "n_components": range(1, 7),
+            "covariance_type": ["spherical", "tied", "diag", "full"],
+        }
+    )
 )
+df = pd.DataFrame(param_grid)
+df.columns = ["Type of covariance", "Number of components"]
+df["BIC score"] = gm_ic.criterion_
 df.sort_values(by="BIC score").head()
 
 # %%
@@ -141,14 +121,14 @@ def gmm_bic_score(estimator, X):
 from scipy import linalg
 
 color_iter = sns.color_palette("tab10", 2)[::-1]
-Y_ = grid_search.predict(X)
+Y_ = gm_ic.predict(X)
 
 fig, ax = plt.subplots()
 
 for i, (mean, cov, color) in enumerate(
     zip(
-        grid_search.best_estimator_.means_,
-        grid_search.best_estimator_.covariances_,
+        gm_ic.means_,
+        gm_ic.covariances_,
         color_iter,
     )
 ):
@@ -166,8 +146,7 @@ def gmm_bic_score(estimator, X):
     ax.add_artist(ellipse)
 
 plt.title(
-    f"Selected GMM: {grid_search.best_params_['covariance_type']} model, "
-    f"{grid_search.best_params_['n_components']} components"
+    f"Selected GMM: {gm_ic.covariance_type_} model, {gm_ic.n_components_} components"
 )
 plt.axis("equal")
 plt.show()
diff --git a/examples/model_selection/plot_cost_sensitive_learning.py b/examples/model_selection/plot_cost_sensitive_learning.py
new file mode 100644
index 0000000000000..55707e78e137a
--- /dev/null
+++ b/examples/model_selection/plot_cost_sensitive_learning.py
@@ -0,0 +1,685 @@
+"""
+==============================================================
+Post-tuning the decision threshold for cost-sensitive learning
+==============================================================
+
+Once a classifier is trained, the output of the :term:`predict` method outputs class
+label predictions corresponding to a thresholding of either the
+:term:`decision_function` or the :term:`predict_proba` output. For a binary classifier,
+the default threshold is defined as a posterior probability estimate of 0.5 or a
+decision score of 0.0.
+
+However, this default strategy is most likely not optimal for the task at hand.
+Here, we use the "Statlog" German credit dataset [1]_ to illustrate a use case.
+In this dataset, the task is to predict whether a person has a "good" or "bad" credit.
+In addition, a cost-matrix is provided that specifies the cost of
+misclassification. Specifically, misclassifying a "bad" credit as "good" is five
+times more costly on average than misclassifying a "good" credit as "bad".
+
+We use the :class:`~sklearn.model_selection.TunedThresholdClassifierCV` to select the
+cut-off point of the decision function that minimizes the provided business
+cost.
+
+In the second part of the example, we further extend this approach by
+considering the problem of fraud detection in credit card transactions: in this
+case, the business metric depends on the amount of each individual transaction.
+
+.. rubric :: References
+
+.. [1] "Statlog (German Credit Data) Data Set", UCI Machine Learning Repository,
+    `Link <https://archive.ics.uci.edu/ml/datasets/Statlog+%28German+Credit+Data%29>`_.
+
+.. [2] `Charles Elkan, "The Foundations of Cost-Sensitive Learning",
+    International joint conference on artificial intelligence.
+    Vol. 17. No. 1. Lawrence Erlbaum Associates Ltd, 2001.
+    <https://cseweb.ucsd.edu/~elkan/rescale.pdf>`_
+"""
+
+# %%
+# Cost-sensitive learning with constant gains and costs
+# -----------------------------------------------------
+#
+# In this first section, we illustrate the use of the
+# :class:`~sklearn.model_selection.TunedThresholdClassifierCV` in a setting of
+# cost-sensitive learning when the gains and costs associated to each entry of the
+# confusion matrix are constant. We use the problematic presented in [2]_ using the
+# "Statlog" German credit dataset [1]_.
+#
+# "Statlog" German credit dataset
+# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+#
+# We fetch the German credit dataset from OpenML.
+import sklearn
+from sklearn.datasets import fetch_openml
+
+sklearn.set_config(transform_output="pandas")
+
+german_credit = fetch_openml(data_id=31, as_frame=True, parser="pandas")
+X, y = german_credit.data, german_credit.target
+
+# %%
+# We check the feature types available in `X`.
+X.info()
+
+# %%
+# Many features are categorical and usually string-encoded. We need to encode
+# these categories when we develop our predictive model. Let's check the targets.
+y.value_counts()
+
+# %%
+# Another observation is that the dataset is imbalanced. We would need to be careful
+# when evaluating our predictive model and use a family of metrics that are adapted
+# to this setting.
+#
+# In addition, we observe that the target is string-encoded. Some metrics
+# (e.g. precision and recall) require to provide the label of interest also called
+# the "positive label". Here, we define that our goal is to predict whether or not
+# a sample is a "bad" credit.
+pos_label, neg_label = "bad", "good"
+
+# %%
+# To carry our analysis, we split our dataset using a single stratified split.
+from sklearn.model_selection import train_test_split
+
+X_train, X_test, y_train, y_test = train_test_split(X, y, stratify=y, random_state=0)
+
+# %%
+# We are ready to design our predictive model and the associated evaluation strategy.
+#
+# Evaluation metrics
+# ^^^^^^^^^^^^^^^^^^
+#
+# In this section, we define a set of metrics that we use later. To see
+# the effect of tuning the cut-off point, we evaluate the predictive model using
+# the Receiver Operating Characteristic (ROC) curve and the Precision-Recall curve.
+# The values reported on these plots are therefore the true positive rate (TPR),
+# also known as the recall or the sensitivity, and the false positive rate (FPR),
+# also known as the specificity, for the ROC curve and the precision and recall for
+# the Precision-Recall curve.
+#
+# From these four metrics, scikit-learn does not provide a scorer for the FPR. We
+# therefore need to define a small custom function to compute it.
+from sklearn.metrics import confusion_matrix
+
+
+def fpr_score(y, y_pred, neg_label, pos_label):
+    cm = confusion_matrix(y, y_pred, labels=[neg_label, pos_label])
+    tn, fp, _, _ = cm.ravel()
+    tnr = tn / (tn + fp)
+    return 1 - tnr
+
+
+# %%
+# As previously stated, the "positive label" is not defined as the value "1" and calling
+# some of the metrics with this non-standard value raise an error. We need to
+# provide the indication of the "positive label" to the metrics.
+#
+# We therefore need to define a scikit-learn scorer using
+# :func:`~sklearn.metrics.make_scorer` where the information is passed. We store all
+# the custom scorers in a dictionary. To use them, we need to pass the fitted model,
+# the data and the target on which we want to evaluate the predictive model.
+from sklearn.metrics import make_scorer, precision_score, recall_score
+
+tpr_score = recall_score  # TPR and recall are the same metric
+scoring = {
+    "precision": make_scorer(precision_score, pos_label=pos_label),
+    "recall": make_scorer(recall_score, pos_label=pos_label),
+    "fpr": make_scorer(fpr_score, neg_label=neg_label, pos_label=pos_label),
+    "tpr": make_scorer(tpr_score, pos_label=pos_label),
+}
+
+# %%
+# In addition, the original research [1]_ defines a custom business metric. We
+# call a "business metric" any metric function that aims at quantifying how the
+# predictions (correct or wrong) might impact the business value of deploying a
+# given machine learning model in a specific application context. For our
+# credit prediction task, the authors provide a custom cost-matrix which
+# encodes that classifying a a "bad" credit as "good" is 5 times more costly on
+# average than the opposite: it is less costly for the financing institution to
+# not grant a credit to a potential customer that will not default (and
+# therefore miss a good customer that would have otherwise both reimbursed the
+# credit and payed interests) than to grant a credit to a customer that will
+# default.
+#
+# We define a python function that weight the confusion matrix and return the
+# overall cost.
+import numpy as np
+
+
+def credit_gain_score(y, y_pred, neg_label, pos_label):
+    cm = confusion_matrix(y, y_pred, labels=[neg_label, pos_label])
+    # The rows of the confusion matrix hold the counts of observed classes
+    # while the columns hold counts of predicted classes. Recall that here we
+    # consider "bad" as the positive class (second row and column).
+    # Scikit-learn model selection tools expect that we follow a convention
+    # that "higher" means "better", hence the following gain matrix assigns
+    # negative gains (costs) to the two kinds of prediction errors:
+    # - a gain of -1 for each false positive ("good" credit labeled as "bad"),
+    # - a gain of -5 for each false negative ("bad" credit labeled as "good"),
+    # The true positives and true negatives are assigned null gains in this
+    # metric.
+    #
+    # Note that theoretically, given that our model is calibrated and our data
+    # set representative and large enough, we do not need to tune the
+    # threshold, but can safely set it to the cost ration 1/5, as stated by Eq.
+    # (2) in Elkan paper [2]_.
+    gain_matrix = np.array(
+        [
+            [0, -1],  # -1 gain for false positives
+            [-5, 0],  # -5 gain for false negatives
+        ]
+    )
+    return np.sum(cm * gain_matrix)
+
+
+scoring["credit_gain"] = make_scorer(
+    credit_gain_score, neg_label=neg_label, pos_label=pos_label
+)
+# %%
+# Vanilla predictive model
+# ^^^^^^^^^^^^^^^^^^^^^^^^
+#
+# We use :class:`~sklearn.ensemble.HistGradientBoostingClassifier` as a predictive model
+# that natively handles categorical features and missing values.
+from sklearn.ensemble import HistGradientBoostingClassifier
+
+model = HistGradientBoostingClassifier(
+    categorical_features="from_dtype", random_state=0
+).fit(X_train, y_train)
+model
+
+# %%
+# We evaluate the performance of our predictive model using the ROC and Precision-Recall
+# curves.
+import matplotlib.pyplot as plt
+
+from sklearn.metrics import PrecisionRecallDisplay, RocCurveDisplay
+
+fig, axs = plt.subplots(nrows=1, ncols=2, figsize=(14, 6))
+
+PrecisionRecallDisplay.from_estimator(
+    model, X_test, y_test, pos_label=pos_label, ax=axs[0], name="GBDT"
+)
+axs[0].plot(
+    scoring["recall"](model, X_test, y_test),
+    scoring["precision"](model, X_test, y_test),
+    marker="o",
+    markersize=10,
+    color="tab:blue",
+    label="Default cut-off point at a probability of 0.5",
+)
+axs[0].set_title("Precision-Recall curve")
+axs[0].legend()
+
+RocCurveDisplay.from_estimator(
+    model,
+    X_test,
+    y_test,
+    pos_label=pos_label,
+    ax=axs[1],
+    name="GBDT",
+    plot_chance_level=True,
+)
+axs[1].plot(
+    scoring["fpr"](model, X_test, y_test),
+    scoring["tpr"](model, X_test, y_test),
+    marker="o",
+    markersize=10,
+    color="tab:blue",
+    label="Default cut-off point at a probability of 0.5",
+)
+axs[1].set_title("ROC curve")
+axs[1].legend()
+_ = fig.suptitle("Evaluation of the vanilla GBDT model")
+
+# %%
+# We recall that these curves give insights on the statistical performance of the
+# predictive model for different cut-off points. For the Precision-Recall curve, the
+# reported metrics are the precision and recall and for the ROC curve, the reported
+# metrics are the TPR (same as recall) and FPR.
+#
+# Here, the different cut-off points correspond to different levels of posterior
+# probability estimates ranging between 0 and 1. By default, `model.predict` uses a
+# cut-off point at a probability estimate of 0.5. The metrics for such a cut-off point
+# are reported with the blue dot on the curves: it corresponds to the statistical
+# performance of the model when using `model.predict`.
+#
+# However, we recall that the original aim was to minimize the cost (or maximize the
+# gain) as defined by the business metric. We can compute the value of the business
+# metric:
+print(f"Business defined metric: {scoring['credit_gain'](model, X_test, y_test)}")
+
+# %%
+# At this stage we don't know if any other cut-off can lead to a greater gain. To find
+# the optimal one, we need to compute the cost-gain using the business metric for all
+# possible cut-off points and choose the best. This strategy can be quite tedious to
+# implement by hand, but the
+# :class:`~sklearn.model_selection.TunedThresholdClassifierCV` class is here to help us.
+# It automatically computes the cost-gain for all possible cut-off points and optimizes
+# for the `scoring`.
+#
+# .. _cost_sensitive_learning_example:
+#
+# Tuning the cut-off point
+# ^^^^^^^^^^^^^^^^^^^^^^^^
+#
+# We use :class:`~sklearn.model_selection.TunedThresholdClassifierCV` to tune the
+# cut-off point. We need to provide the business metric to optimize as well as the
+# positive label. Internally, the optimum cut-off point is chosen such that it maximizes
+# the business metric via cross-validation. By default a 5-fold stratified
+# cross-validation is used.
+from sklearn.model_selection import TunedThresholdClassifierCV
+
+tuned_model = TunedThresholdClassifierCV(
+    estimator=model,
+    scoring=scoring["credit_gain"],
+    store_cv_results=True,  # necessary to inspect all results
+)
+tuned_model.fit(X_train, y_train)
+print(f"{tuned_model.best_threshold_=:0.2f}")
+
+# %%
+# We plot the ROC and Precision-Recall curves for the vanilla model and the tuned model.
+# Also we plot the cut-off points that would be used by each model. Because, we are
+# reusing the same code later, we define a function that generates the plots.
+
+
+def plot_roc_pr_curves(vanilla_model, tuned_model, *, title):
+    fig, axs = plt.subplots(nrows=1, ncols=3, figsize=(21, 6))
+
+    linestyles = ("dashed", "dotted")
+    markerstyles = ("o", ">")
+    colors = ("tab:blue", "tab:orange")
+    names = ("Vanilla GBDT", "Tuned GBDT")
+    for idx, (est, linestyle, marker, color, name) in enumerate(
+        zip((vanilla_model, tuned_model), linestyles, markerstyles, colors, names)
+    ):
+        decision_threshold = getattr(est, "best_threshold_", 0.5)
+        PrecisionRecallDisplay.from_estimator(
+            est,
+            X_test,
+            y_test,
+            pos_label=pos_label,
+            linestyle=linestyle,
+            color=color,
+            ax=axs[0],
+            name=name,
+        )
+        axs[0].plot(
+            scoring["recall"](est, X_test, y_test),
+            scoring["precision"](est, X_test, y_test),
+            marker,
+            markersize=10,
+            color=color,
+            label=f"Cut-off point at probability of {decision_threshold:.2f}",
+        )
+        RocCurveDisplay.from_estimator(
+            est,
+            X_test,
+            y_test,
+            pos_label=pos_label,
+            linestyle=linestyle,
+            color=color,
+            ax=axs[1],
+            name=name,
+            plot_chance_level=idx == 1,
+        )
+        axs[1].plot(
+            scoring["fpr"](est, X_test, y_test),
+            scoring["tpr"](est, X_test, y_test),
+            marker,
+            markersize=10,
+            color=color,
+            label=f"Cut-off point at probability of {decision_threshold:.2f}",
+        )
+
+    axs[0].set_title("Precision-Recall curve")
+    axs[0].legend()
+    axs[1].set_title("ROC curve")
+    axs[1].legend()
+
+    axs[2].plot(
+        tuned_model.cv_results_["thresholds"],
+        tuned_model.cv_results_["scores"],
+        color="tab:orange",
+    )
+    axs[2].plot(
+        tuned_model.best_threshold_,
+        tuned_model.best_score_,
+        "o",
+        markersize=10,
+        color="tab:orange",
+        label="Optimal cut-off point for the business metric",
+    )
+    axs[2].legend()
+    axs[2].set_xlabel("Decision threshold (probability)")
+    axs[2].set_ylabel("Objective score (using cost-matrix)")
+    axs[2].set_title("Objective score as a function of the decision threshold")
+    fig.suptitle(title)
+
+
+# %%
+title = "Comparison of the cut-off point for the vanilla and tuned GBDT model"
+plot_roc_pr_curves(model, tuned_model, title=title)
+
+# %%
+# The first remark is that both classifiers have exactly the same ROC and
+# Precision-Recall curves. It is expected because by default, the classifier is fitted
+# on the same training data. In a later section, we discuss more in detail the
+# available options regarding model refitting and cross-validation.
+#
+# The second remark is that the cut-off points of the vanilla and tuned model are
+# different. To understand why the tuned model has chosen this cut-off point, we can
+# look at the right-hand side plot that plots the objective score that is our exactly
+# the same as our business metric. We see that the optimum threshold corresponds to the
+# maximum of the objective score. This maximum is reached for a decision threshold
+# much lower than 0.5: the tuned model enjoys a much higher recall at the cost of
+# of significantly lower precision: the tuned model is much more eager to
+# predict the "bad" class label to larger fraction of individuals.
+#
+# We can now check if choosing this cut-off point leads to a better score on the testing
+# set:
+print(f"Business defined metric: {scoring['credit_gain'](tuned_model, X_test, y_test)}")
+
+# %%
+# We observe that tuning the decision threshold almost improves our business gains
+# by factor of 2.
+#
+# .. _TunedThresholdClassifierCV_no_cv:
+#
+# Consideration regarding model refitting and cross-validation
+# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+#
+# In the above experiment, we used the default setting of the
+# :class:`~sklearn.model_selection.TunedThresholdClassifierCV`. In particular, the
+# cut-off point is tuned using a 5-fold stratified cross-validation. Also, the
+# underlying predictive model is refitted on the entire training data once the cut-off
+# point is chosen.
+#
+# These two strategies can be changed by providing the `refit` and `cv` parameters.
+# For instance, one could provide a fitted `estimator` and set `cv="prefit"`, in which
+# case the cut-off point is found on the entire dataset provided at fitting time.
+# Also, the underlying classifier is not be refitted by setting `refit=False`. Here, we
+# can try to do such experiment.
+model.fit(X_train, y_train)
+tuned_model.set_params(cv="prefit", refit=False).fit(X_train, y_train)
+print(f"{tuned_model.best_threshold_=:0.2f}")
+
+
+# %%
+# Then, we evaluate our model with the same approach as before:
+title = "Tuned GBDT model without refitting and using the entire dataset"
+plot_roc_pr_curves(model, tuned_model, title=title)
+
+# %%
+# We observe the that the optimum cut-off point is different from the one found
+# in the previous experiment. If we look at the right-hand side plot, we
+# observe that the business gain has large plateau of near-optimal 0 gain for a
+# large span of decision thresholds. This behavior is symptomatic of an
+# overfitting. Because we disable cross-validation, we tuned the cut-off point
+# on the same set as the model was trained on, and this is the reason for the
+# observed overfitting.
+#
+# This option should therefore be used with caution. One needs to make sure that the
+# data provided at fitting time to the
+# :class:`~sklearn.model_selection.TunedThresholdClassifierCV` is not the same as the
+# data used to train the underlying classifier. This could happen sometimes when the
+# idea is just to tune the predictive model on a completely new validation set without a
+# costly complete refit.
+#
+# When cross-validation is too costly, a potential alternative is to use a
+# single train-test split by providing a floating number in range `[0, 1]` to the `cv`
+# parameter. It splits the data into a training and testing set. Let's explore this
+# option:
+tuned_model.set_params(cv=0.75).fit(X_train, y_train)
+
+# %%
+title = "Tuned GBDT model without refitting and using the entire dataset"
+plot_roc_pr_curves(model, tuned_model, title=title)
+
+# %%
+# Regarding the cut-off point, we observe that the optimum is similar to the multiple
+# repeated cross-validation case. However, be aware that a single split does not account
+# for the variability of the fit/predict process and thus we are unable to know if there
+# is any variance in the cut-off point. The repeated cross-validation averages out
+# this effect.
+#
+# Another observation concerns the ROC and Precision-Recall curves of the tuned model.
+# As expected, these curves differ from those of the vanilla model, given that we
+# trained the underlying classifier on a subset of the data provided during fitting and
+# reserved a validation set for tuning the cut-off point.
+#
+# Cost-sensitive learning when gains and costs are not constant
+# -------------------------------------------------------------
+#
+# As stated in [2]_, gains and costs are generally not constant in real-world problems.
+# In this section, we use a similar example as in [2]_ for the problem of
+# detecting fraud in credit card transaction records.
+#
+# The credit card dataset
+# ^^^^^^^^^^^^^^^^^^^^^^^
+credit_card = fetch_openml(data_id=1597, as_frame=True, parser="pandas")
+credit_card.frame.info()
+
+# %%
+# The dataset contains information about credit card records from which some are
+# fraudulent and others are legitimate. The goal is therefore to predict whether or
+# not a credit card record is fraudulent.
+columns_to_drop = ["Class"]
+data = credit_card.frame.drop(columns=columns_to_drop)
+target = credit_card.frame["Class"].astype(int)
+
+# %%
+# First, we check the class distribution of the datasets.
+target.value_counts(normalize=True)
+
+# %%
+# The dataset is highly imbalanced with fraudulent transaction representing only 0.17%
+# of the data. Since we are interested in training a machine learning model, we should
+# also make sure that we have enough samples in the minority class to train the model.
+target.value_counts()
+
+# %%
+# We observe that we have around 500 samples that is on the low end of the number of
+# samples required to train a machine learning model. In addition of the target
+# distribution, we check the distribution of the amount of the
+# fraudulent transactions.
+fraud = target == 1
+amount_fraud = data["Amount"][fraud]
+_, ax = plt.subplots()
+ax.hist(amount_fraud, bins=30)
+ax.set_title("Amount of fraud transaction")
+_ = ax.set_xlabel("Amount (€)")
+
+# %%
+# Addressing the problem with a business metric
+# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+#
+# Now, we create the business metric that depends on the amount of each transaction. We
+# define the cost matrix similarly to [2]_. Accepting a legitimate transaction provides
+# a gain of 2% of the amount of the transaction. However, accepting a fraudulent
+# transaction result in a loss of the amount of the transaction. As stated in [2]_, the
+# gain and loss related to refusals (of fraudulent and legitimate transactions) are not
+# trivial to define. Here, we define that a refusal of a legitimate transaction
+# is estimated to a loss of 5€ while the refusal of a fraudulent transaction is
+# estimated to a gain of 50€. Therefore, we define the following function to
+# compute the total benefit of a given decision:
+
+
+def business_metric(y_true, y_pred, amount):
+    mask_true_positive = (y_true == 1) & (y_pred == 1)
+    mask_true_negative = (y_true == 0) & (y_pred == 0)
+    mask_false_positive = (y_true == 0) & (y_pred == 1)
+    mask_false_negative = (y_true == 1) & (y_pred == 0)
+    fraudulent_refuse = mask_true_positive.sum() * 50
+    fraudulent_accept = -amount[mask_false_negative].sum()
+    legitimate_refuse = mask_false_positive.sum() * -5
+    legitimate_accept = (amount[mask_true_negative] * 0.02).sum()
+    return fraudulent_refuse + fraudulent_accept + legitimate_refuse + legitimate_accept
+
+
+# %%
+# From this business metric, we create a scikit-learn scorer that given a fitted
+# classifier and a test set compute the business metric. In this regard, we use
+# the :func:`~sklearn.metrics.make_scorer` factory. The variable `amount` is an
+# additional metadata to be passed to the scorer and we need to use
+# :ref:`metadata routing <metadata_routing>` to take into account this information.
+sklearn.set_config(enable_metadata_routing=True)
+business_scorer = make_scorer(business_metric).set_score_request(amount=True)
+
+# %%
+# So at this stage, we observe that the amount of the transaction is used twice: once
+# as a feature to train our predictive model and once as a metadata to compute the
+# the business metric and thus the statistical performance of our model. When used as a
+# feature, we are only required to have a column in `data` that contains the amount of
+# each transaction. To use this information as metadata, we need to have an external
+# variable that we can pass to the scorer or the model that internally routes this
+# metadata to the scorer. So let's create this variable.
+amount = credit_card.frame["Amount"].to_numpy()
+
+# %%
+from sklearn.model_selection import train_test_split
+
+data_train, data_test, target_train, target_test, amount_train, amount_test = (
+    train_test_split(
+        data, target, amount, stratify=target, test_size=0.5, random_state=42
+    )
+)
+
+# %%
+# We first evaluate some baseline policies to serve as reference. Recall that
+# class "0" is the legitimate class and class "1" is the fraudulent class.
+from sklearn.dummy import DummyClassifier
+
+always_accept_policy = DummyClassifier(strategy="constant", constant=0)
+always_accept_policy.fit(data_train, target_train)
+benefit = business_scorer(
+    always_accept_policy, data_test, target_test, amount=amount_test
+)
+print(f"Benefit of the 'always accept' policy: {benefit:,.2f}€")
+
+# %%
+# A policy that considers all transactions as legitimate would create a profit of
+# around 220,000€. We make the same evaluation for a classifier that predicts all
+# transactions as fraudulent.
+always_reject_policy = DummyClassifier(strategy="constant", constant=1)
+always_reject_policy.fit(data_train, target_train)
+benefit = business_scorer(
+    always_reject_policy, data_test, target_test, amount=amount_test
+)
+print(f"Benefit of the 'always reject' policy: {benefit:,.2f}€")
+
+
+# %%
+# Such a policy would entail a catastrophic loss: around 670,000€. This is
+# expected since the vast majority of the transactions are legitimate and the
+# policy would refuse them at a non-trivial cost.
+#
+# A predictive model that adapts the accept/reject decisions on a per
+# transaction basis should ideally allow us to make a profit larger than the
+# 220,000€ of the best of our constant baseline policies.
+#
+# We start with a logistic regression model with the default decision threshold
+# at 0.5. Here we tune the hyperparameter `C` of the logistic regression with a
+# proper scoring rule (the log loss) to ensure that the model's probabilistic
+# predictions returned by its `predict_proba` method are as accurate as
+# possible, irrespectively of the choice of the value of the decision
+# threshold.
+from sklearn.linear_model import LogisticRegression
+from sklearn.model_selection import GridSearchCV
+from sklearn.pipeline import make_pipeline
+from sklearn.preprocessing import StandardScaler
+
+logistic_regression = make_pipeline(StandardScaler(), LogisticRegression())
+param_grid = {"logisticregression__C": np.logspace(-6, 6, 13)}
+model = GridSearchCV(logistic_regression, param_grid, scoring="neg_log_loss").fit(
+    data_train, target_train
+)
+model
+
+# %%
+print(
+    "Benefit of logistic regression with default threshold: "
+    f"{business_scorer(model, data_test, target_test, amount=amount_test):,.2f}€"
+)
+
+# %%
+# The business metric shows that our predictive model with a default decision
+# threshold is already winning over the baseline in terms of profit and it would be
+# already beneficial to use it to accept or reject transactions instead of
+# accepting all transactions.
+#
+# Tuning the decision threshold
+# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+#
+# Now the question is: is our model optimum for the type of decision that we want to do?
+# Up to now, we did not optimize the decision threshold. We use the
+# :class:`~sklearn.model_selection.TunedThresholdClassifierCV` to optimize the decision
+# given our business scorer. To avoid a nested cross-validation, we will use the
+# best estimator found during the previous grid-search.
+tuned_model = TunedThresholdClassifierCV(
+    estimator=model.best_estimator_,
+    scoring=business_scorer,
+    thresholds=100,
+    n_jobs=2,
+)
+
+# %%
+# Since our business scorer requires the amount of each transaction, we need to pass
+# this information in the `fit` method. The
+# :class:`~sklearn.model_selection.TunedThresholdClassifierCV` is in charge of
+# automatically dispatching this metadata to the underlying scorer.
+tuned_model.fit(data_train, target_train, amount=amount_train)
+
+# %%
+# We observe that the tuned decision threshold is far away from the default 0.5:
+print(f"Tuned decision threshold: {tuned_model.best_threshold_:.2f}")
+
+# %%
+print(
+    "Benefit of logistic regression with a tuned threshold: "
+    f"{business_scorer(tuned_model, data_test, target_test, amount=amount_test):,.2f}€"
+)
+
+# %%
+# We observe that tuning the decision threshold increases the expected profit
+# when deploying our model - as indicated by the business metric. It is therefore
+# valuable, whenever possible, to optimize the decision threshold with respect
+# to the business metric.
+#
+# Manually setting the decision threshold instead of tuning it
+# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+#
+# In the previous example, we used the
+# :class:`~sklearn.model_selection.TunedThresholdClassifierCV` to find the optimal
+# decision threshold. However, in some cases, we might have some prior knowledge about
+# the problem at hand and we might be happy to set the decision threshold manually.
+#
+# The class :class:`~sklearn.model_selection.FixedThresholdClassifier` allows us to
+# manually set the decision threshold. At prediction time, it behave as the previous
+# tuned model but no search is performed during the fitting process.
+#
+# Here, we will reuse the decision threshold found in the previous section to create a
+# new model and check that it gives the same results.
+from sklearn.model_selection import FixedThresholdClassifier
+
+model_fixed_threshold = FixedThresholdClassifier(
+    estimator=model, threshold=tuned_model.best_threshold_, prefit=True
+).fit(data_train, target_train)
+
+# %%
+business_score = business_scorer(
+    model_fixed_threshold, data_test, target_test, amount=amount_test
+)
+print(f"Benefit of logistic regression with a tuned threshold:  {business_score:,.2f}€")
+
+# %%
+# We observe that we obtained the exact same results but the fitting process
+# was much faster since we did not perform any hyper-parameter search.
+#
+# Finally, the estimate of the (average) business metric itself can be unreliable, in
+# particular when the number of data points in the minority class is very small.
+# Any business impact estimated by cross-validation of a business metric on
+# historical data (offline evaluation) should ideally be confirmed by A/B testing
+# on live data (online evaluation). Note however that A/B testing models is
+# beyond the scope of the scikit-learn library itself.
diff --git a/examples/model_selection/plot_cv_indices.py b/examples/model_selection/plot_cv_indices.py
index e6c3580c787f0..d456546891069 100644
--- a/examples/model_selection/plot_cv_indices.py
+++ b/examples/model_selection/plot_cv_indices.py
@@ -99,9 +99,10 @@ def visualize_groups(classes, groups, name):
 
 def plot_cv_indices(cv, X, y, group, ax, n_splits, lw=10):
     """Create a sample plot for indices of a cross-validation object."""
-
+    use_groups = "Group" in type(cv).__name__
+    groups = group if use_groups else None
     # Generate the training/testing visualizations for each CV split
-    for ii, (tr, tt) in enumerate(cv.split(X=X, y=y, groups=group)):
+    for ii, (tr, tt) in enumerate(cv.split(X=X, y=y, groups=groups)):
         # Fill in indices with the training/test groups
         indices = np.array([np.nan] * len(X))
         indices[tt] = 1
diff --git a/examples/model_selection/plot_det.py b/examples/model_selection/plot_det.py
index 7c347651c73a8..3e56b8bd35d31 100644
--- a/examples/model_selection/plot_det.py
+++ b/examples/model_selection/plot_det.py
@@ -66,7 +66,7 @@
 from sklearn.svm import LinearSVC
 
 classifiers = {
-    "Linear SVM": make_pipeline(StandardScaler(), LinearSVC(C=0.025, dual="auto")),
+    "Linear SVM": make_pipeline(StandardScaler(), LinearSVC(C=0.025)),
     "Random Forest": RandomForestClassifier(
         max_depth=5, n_estimators=10, max_features=1
     ),
diff --git a/examples/model_selection/plot_grid_search_refit_callable.py b/examples/model_selection/plot_grid_search_refit_callable.py
index a8dab986a48d2..a851ee5f9bb19 100644
--- a/examples/model_selection/plot_grid_search_refit_callable.py
+++ b/examples/model_selection/plot_grid_search_refit_callable.py
@@ -81,7 +81,7 @@ def best_low_complexity(cv_results):
 pipe = Pipeline(
     [
         ("reduce_dim", PCA(random_state=42)),
-        ("classify", LinearSVC(random_state=42, C=0.01, dual="auto")),
+        ("classify", LinearSVC(random_state=42, C=0.01)),
     ]
 )
 
diff --git a/examples/model_selection/plot_grid_search_stats.py b/examples/model_selection/plot_grid_search_stats.py
index fbeb485d8db44..9335b12055515 100644
--- a/examples/model_selection/plot_grid_search_stats.py
+++ b/examples/model_selection/plot_grid_search_stats.py
@@ -540,27 +540,27 @@ def compute_corrected_ttest(differences, df, n_train, n_test):
 #   correction is needed when using the frequentist approach.
 
 # %%
-# .. topic:: References
-#
-#    .. [1] Dietterich, T. G. (1998). `Approximate statistical tests for
-#           comparing supervised classification learning algorithms
-#           <http://web.cs.iastate.edu/~jtian/cs573/Papers/Dietterich-98.pdf>`_.
-#           Neural computation, 10(7).
-#    .. [2] Nadeau, C., & Bengio, Y. (2000). `Inference for the generalization
-#           error
-#           <https://papers.nips.cc/paper/1661-inference-for-the-generalization-error.pdf>`_.
-#           In Advances in neural information processing systems.
-#    .. [3] Bouckaert, R. R., & Frank, E. (2004). `Evaluating the replicability
-#           of significance tests for comparing learning algorithms
-#           <https://www.cms.waikato.ac.nz/~ml/publications/2004/bouckaert-frank.pdf>`_.
-#           In Pacific-Asia Conference on Knowledge Discovery and Data Mining.
-#    .. [4] Benavoli, A., Corani, G., Demšar, J., & Zaffalon, M. (2017). `Time
-#           for a change: a tutorial for comparing multiple classifiers through
-#           Bayesian analysis
-#           <http://www.jmlr.org/papers/volume18/16-305/16-305.pdf>`_.
-#           The Journal of Machine Learning Research, 18(1). See the Python
-#           library that accompanies this paper `here
-#           <https://github.com/janezd/baycomp>`_.
-#    .. [5] Diebold, F.X. & Mariano R.S. (1995). `Comparing predictive accuracy
-#           <http://www.est.uc3m.es/esp/nueva_docencia/comp_col_get/lade/tecnicas_prediccion/Practicas0708/Comparing%20Predictive%20Accuracy%20(Dielbold).pdf>`_
-#           Journal of Business & economic statistics, 20(1), 134-144.
+# .. rubric:: References
+#
+# .. [1] Dietterich, T. G. (1998). `Approximate statistical tests for
+#        comparing supervised classification learning algorithms
+#        <http://web.cs.iastate.edu/~jtian/cs573/Papers/Dietterich-98.pdf>`_.
+#        Neural computation, 10(7).
+# .. [2] Nadeau, C., & Bengio, Y. (2000). `Inference for the generalization
+#        error
+#        <https://papers.nips.cc/paper/1661-inference-for-the-generalization-error.pdf>`_.
+#        In Advances in neural information processing systems.
+# .. [3] Bouckaert, R. R., & Frank, E. (2004). `Evaluating the replicability
+#        of significance tests for comparing learning algorithms
+#        <https://www.cms.waikato.ac.nz/~ml/publications/2004/bouckaert-frank.pdf>`_.
+#        In Pacific-Asia Conference on Knowledge Discovery and Data Mining.
+# .. [4] Benavoli, A., Corani, G., Demšar, J., & Zaffalon, M. (2017). `Time
+#        for a change: a tutorial for comparing multiple classifiers through
+#        Bayesian analysis
+#        <http://www.jmlr.org/papers/volume18/16-305/16-305.pdf>`_.
+#        The Journal of Machine Learning Research, 18(1). See the Python
+#        library that accompanies this paper `here
+#        <https://github.com/janezd/baycomp>`_.
+# .. [5] Diebold, F.X. & Mariano R.S. (1995). `Comparing predictive accuracy
+#        <http://www.est.uc3m.es/esp/nueva_docencia/comp_col_get/lade/tecnicas_prediccion/Practicas0708/Comparing%20Predictive%20Accuracy%20(Dielbold).pdf>`_
+#        Journal of Business & economic statistics, 20(1), 134-144.
diff --git a/examples/model_selection/plot_grid_search_text_feature_extraction.py b/examples/model_selection/plot_grid_search_text_feature_extraction.py
index f82cd82b13112..8eb7b2f424896 100644
--- a/examples/model_selection/plot_grid_search_text_feature_extraction.py
+++ b/examples/model_selection/plot_grid_search_text_feature_extraction.py
@@ -14,11 +14,8 @@
 notebook.
 """
 
-# Author: Olivier Grisel <olivier.grisel@ensta.org>
-#         Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#         Mathieu Blondel <mathieu@mblondel.org>
-#         Arturo Amor <david-arturo.amor-quiroz@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Data loading
diff --git a/examples/model_selection/plot_multi_metric_evaluation.py b/examples/model_selection/plot_multi_metric_evaluation.py
index 674bf8bc1b07c..14d8c52dd82a9 100644
--- a/examples/model_selection/plot_multi_metric_evaluation.py
+++ b/examples/model_selection/plot_multi_metric_evaluation.py
@@ -16,8 +16,8 @@
 
 """
 
-# Author: Raghav RV <rvraghav93@gmail.com>
-# License: BSD
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 from matplotlib import pyplot as plt
diff --git a/examples/model_selection/plot_nested_cross_validation_iris.py b/examples/model_selection/plot_nested_cross_validation_iris.py
index 7513a078b68ce..38defdadf4165 100644
--- a/examples/model_selection/plot_nested_cross_validation_iris.py
+++ b/examples/model_selection/plot_nested_cross_validation_iris.py
@@ -30,17 +30,17 @@
 performance of non-nested and nested CV strategies by taking the difference
 between their scores.
 
-.. topic:: See Also:
+.. seealso::
 
     - :ref:`cross_validation`
     - :ref:`grid_search`
 
-.. topic:: References:
+.. rubric:: References
 
-    .. [1] `Cawley, G.C.; Talbot, N.L.C. On over-fitting in model selection and
-     subsequent selection bias in performance evaluation.
-     J. Mach. Learn. Res 2010,11, 2079-2107.
-     <http://jmlr.csail.mit.edu/papers/volume11/cawley10a/cawley10a.pdf>`_
+.. [1] `Cawley, G.C.; Talbot, N.L.C. On over-fitting in model selection and
+    subsequent selection bias in performance evaluation.
+    J. Mach. Learn. Res 2010,11, 2079-2107.
+    <http://jmlr.csail.mit.edu/papers/volume11/cawley10a/cawley10a.pdf>`_
 
 """
 
diff --git a/examples/model_selection/plot_permutation_tests_for_classification.py b/examples/model_selection/plot_permutation_tests_for_classification.py
index a02f6d188f006..ffd1c16606dff 100644
--- a/examples/model_selection/plot_permutation_tests_for_classification.py
+++ b/examples/model_selection/plot_permutation_tests_for_classification.py
@@ -9,9 +9,8 @@
 
 """
 
-# Authors:  Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#           Lucy Liu
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Dataset
@@ -128,10 +127,10 @@
 # Finally, note that this test has been shown to produce low p-values even
 # if there is only weak structure in the data [1]_.
 #
-# .. topic:: References:
+# .. rubric:: References
 #
-#   .. [1] Ojala and Garriga. `Permutation Tests for Studying Classifier
-#          Performance
-#          <http://www.jmlr.org/papers/volume11/ojala10a/ojala10a.pdf>`_. The
-#          Journal of Machine Learning Research (2010) vol. 11
+# .. [1] Ojala and Garriga. `Permutation Tests for Studying Classifier
+#        Performance
+#        <http://www.jmlr.org/papers/volume11/ojala10a/ojala10a.pdf>`_. The
+#        Journal of Machine Learning Research (2010) vol. 11
 #
diff --git a/examples/model_selection/plot_precision_recall.py b/examples/model_selection/plot_precision_recall.py
index 03b273de66b7f..6934f0f49ddde 100644
--- a/examples/model_selection/plot_precision_recall.py
+++ b/examples/model_selection/plot_precision_recall.py
@@ -7,44 +7,42 @@
 
 Precision-Recall is a useful measure of success of prediction when the
 classes are very imbalanced. In information retrieval, precision is a
-measure of result relevancy, while recall is a measure of how many truly
-relevant results are returned.
-
-The precision-recall curve shows the tradeoff between precision and
-recall for different threshold. A high area under the curve represents
-both high recall and high precision, where high precision relates to a
-low false positive rate, and high recall relates to a low false negative
-rate. High scores for both show that the classifier is returning accurate
-results (high precision), as well as returning a majority of all positive
-results (high recall).
-
-A system with high recall but low precision returns many results, but most of
-its predicted labels are incorrect when compared to the training labels. A
-system with high precision but low recall is just the opposite, returning very
-few results, but most of its predicted labels are correct when compared to the
-training labels. An ideal system with high precision and high recall will
-return many results, with all results labeled correctly.
+measure of the fraction of relevant items among actually returned items while recall
+is a measure of the fraction of items that were returned among all items that should
+have been returned. 'Relevancy' here refers to items that are
+postively labeled, i.e., true positives and false negatives.
 
 Precision (:math:`P`) is defined as the number of true positives (:math:`T_p`)
 over the number of true positives plus the number of false positives
 (:math:`F_p`).
 
-:math:`P = \\frac{T_p}{T_p+F_p}`
+.. math::
+    P = \\frac{T_p}{T_p+F_p}
 
 Recall (:math:`R`) is defined as the number of true positives (:math:`T_p`)
 over the number of true positives plus the number of false negatives
 (:math:`F_n`).
 
-:math:`R = \\frac{T_p}{T_p + F_n}`
+.. math::
+    R = \\frac{T_p}{T_p + F_n}
 
-These quantities are also related to the :math:`F_1` score, which is the
-harmonic mean of precision and recall. Thus, we can compute the :math:`F_1`
-using the following formula:
+The precision-recall curve shows the tradeoff between precision and
+recall for different thresholds. A high area under the curve represents
+both high recall and high precision. High precision is achieved by having
+few false positives in the returned results, and high recall is achieved by
+having few false negatives in the relevant results.
+High scores for both show that the classifier is returning
+accurate results (high precision), as well as returning a majority of all relevant
+results (high recall).
 
-:math:`F_1 = \\frac{2T_p}{2T_p + F_p + F_n}`
+A system with high recall but low precision returns most of the relevant items, but
+the proportion of returned results that are incorrectly labeled is high. A
+system with high precision but low recall is just the opposite, returning very
+few of the relevant items, but most of its predicted labels are correct when compared
+to the actual labels. An ideal system with high precision and high recall will
+return most of the relevant items, with most results labeled correctly.
 
-Note that the precision may not decrease with recall. The
-definition of precision (:math:`\\frac{T_p}{T_p + F_p}`) shows that lowering
+The definition of precision (:math:`\\frac{T_p}{T_p + F_p}`) shows that lowering
 the threshold of a classifier may increase the denominator, by increasing the
 number of results returned. If the threshold was previously set too high, the
 new results may all be true positives, which will increase precision. If the
@@ -52,10 +50,12 @@
 will introduce false positives, decreasing precision.
 
 Recall is defined as :math:`\\frac{T_p}{T_p+F_n}`, where :math:`T_p+F_n` does
-not depend on the classifier threshold. This means that lowering the classifier
+not depend on the classifier threshold. Changing the classifier threshold can only
+change the numerator, :math:`T_p`. Lowering the classifier
 threshold may increase recall, by increasing the number of true positive
 results. It is also possible that lowering the threshold may leave recall
-unchanged, while the precision fluctuates.
+unchanged, while the precision fluctuates. Thus, precision does not necessarily
+decrease with recall.
 
 The relationship between recall and precision can be observed in the
 stairstep area of the plot - at the edges of these steps a small change
@@ -82,7 +82,7 @@
 average precision to multi-class or multi-label classification, it is necessary
 to binarize the output. One curve can be drawn per label, but one can also draw
 a precision-recall curve by considering each element of the label indicator
-matrix as a binary prediction (micro-averaging).
+matrix as a binary prediction (:ref:`micro-averaging <average>`).
 
 .. note::
 
@@ -125,9 +125,7 @@
 from sklearn.preprocessing import StandardScaler
 from sklearn.svm import LinearSVC
 
-classifier = make_pipeline(
-    StandardScaler(), LinearSVC(random_state=random_state, dual="auto")
-)
+classifier = make_pipeline(StandardScaler(), LinearSVC(random_state=random_state))
 classifier.fit(X_train, y_train)
 
 # %%
@@ -191,7 +189,7 @@
 from sklearn.multiclass import OneVsRestClassifier
 
 classifier = OneVsRestClassifier(
-    make_pipeline(StandardScaler(), LinearSVC(random_state=random_state, dual="auto"))
+    make_pipeline(StandardScaler(), LinearSVC(random_state=random_state))
 )
 classifier.fit(X_train, Y_train)
 y_score = classifier.decision_function(X_test)
diff --git a/examples/model_selection/plot_train_error_vs_test_error.py b/examples/model_selection/plot_train_error_vs_test_error.py
index af7e7d14cdac0..dc370383b2ef7 100644
--- a/examples/model_selection/plot_train_error_vs_test_error.py
+++ b/examples/model_selection/plot_train_error_vs_test_error.py
@@ -12,8 +12,8 @@
 
 """
 
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Generate sample data
diff --git a/examples/model_selection/plot_tuned_decision_threshold.py b/examples/model_selection/plot_tuned_decision_threshold.py
new file mode 100644
index 0000000000000..7e997ee255e4d
--- /dev/null
+++ b/examples/model_selection/plot_tuned_decision_threshold.py
@@ -0,0 +1,184 @@
+"""
+======================================================
+Post-hoc tuning the cut-off point of decision function
+======================================================
+
+Once a binary classifier is trained, the :term:`predict` method outputs class label
+predictions corresponding to a thresholding of either the :term:`decision_function` or
+the :term:`predict_proba` output. The default threshold is defined as a posterior
+probability estimate of 0.5 or a decision score of 0.0. However, this default strategy
+may not be optimal for the task at hand.
+
+This example shows how to use the
+:class:`~sklearn.model_selection.TunedThresholdClassifierCV` to tune the decision
+threshold, depending on a metric of interest.
+"""
+
+# %%
+# The diabetes dataset
+# --------------------
+#
+# To illustrate the tuning of the decision threshold, we will use the diabetes dataset.
+# This dataset is available on OpenML: https://www.openml.org/d/37. We use the
+# :func:`~sklearn.datasets.fetch_openml` function to fetch this dataset.
+from sklearn.datasets import fetch_openml
+
+diabetes = fetch_openml(data_id=37, as_frame=True, parser="pandas")
+data, target = diabetes.data, diabetes.target
+
+# %%
+# We look at the target to understand the type of problem we are dealing with.
+target.value_counts()
+
+# %%
+# We can see that we are dealing with a binary classification problem. Since the
+# labels are not encoded as 0 and 1, we make it explicit that we consider the class
+# labeled "tested_negative" as the negative class (which is also the most frequent)
+# and the class labeled "tested_positive" the positive as the positive class:
+neg_label, pos_label = target.value_counts().index
+
+# %%
+# We can also observe that this binary problem is slightly imbalanced where we have
+# around twice more samples from the negative class than from the positive class. When
+# it comes to evaluation, we should consider this aspect to interpret the results.
+#
+# Our vanilla classifier
+# ----------------------
+#
+# We define a basic predictive model composed of a scaler followed by a logistic
+# regression classifier.
+from sklearn.linear_model import LogisticRegression
+from sklearn.pipeline import make_pipeline
+from sklearn.preprocessing import StandardScaler
+
+model = make_pipeline(StandardScaler(), LogisticRegression())
+model
+
+# %%
+# We evaluate our model using cross-validation. We use the accuracy and the balanced
+# accuracy to report the performance of our model. The balanced accuracy is a metric
+# that is less sensitive to class imbalance and will allow us to put the accuracy
+# score in perspective.
+#
+# Cross-validation allows us to study the variance of the decision threshold across
+# different splits of the data. However, the dataset is rather small and it would be
+# detrimental to use more than 5 folds to evaluate the dispersion. Therefore, we use
+# a :class:`~sklearn.model_selection.RepeatedStratifiedKFold` where we apply several
+# repetitions of 5-fold cross-validation.
+import pandas as pd
+
+from sklearn.model_selection import RepeatedStratifiedKFold, cross_validate
+
+scoring = ["accuracy", "balanced_accuracy"]
+cv_scores = [
+    "train_accuracy",
+    "test_accuracy",
+    "train_balanced_accuracy",
+    "test_balanced_accuracy",
+]
+cv = RepeatedStratifiedKFold(n_splits=5, n_repeats=10, random_state=42)
+cv_results_vanilla_model = pd.DataFrame(
+    cross_validate(
+        model,
+        data,
+        target,
+        scoring=scoring,
+        cv=cv,
+        return_train_score=True,
+        return_estimator=True,
+    )
+)
+cv_results_vanilla_model[cv_scores].aggregate(["mean", "std"]).T
+
+# %%
+# Our predictive model succeeds to grasp the relationship between the data and the
+# target. The training and testing scores are close to each other, meaning that our
+# predictive model is not overfitting. We can also observe that the balanced accuracy is
+# lower than the accuracy, due to the class imbalance previously mentioned.
+#
+# For this classifier, we let the decision threshold, used convert the probability of
+# the positive class into a class prediction, to its default value: 0.5. However, this
+# threshold might not be optimal. If our interest is to maximize the balanced accuracy,
+# we should select another threshold that would maximize this metric.
+#
+# The :class:`~sklearn.model_selection.TunedThresholdClassifierCV` meta-estimator allows
+# to tune the decision threshold of a classifier given a metric of interest.
+#
+# Tuning the decision threshold
+# -----------------------------
+#
+# We create a :class:`~sklearn.model_selection.TunedThresholdClassifierCV` and
+# configure it to maximize the balanced accuracy. We evaluate the model using the same
+# cross-validation strategy as previously.
+from sklearn.model_selection import TunedThresholdClassifierCV
+
+tuned_model = TunedThresholdClassifierCV(estimator=model, scoring="balanced_accuracy")
+cv_results_tuned_model = pd.DataFrame(
+    cross_validate(
+        tuned_model,
+        data,
+        target,
+        scoring=scoring,
+        cv=cv,
+        return_train_score=True,
+        return_estimator=True,
+    )
+)
+cv_results_tuned_model[cv_scores].aggregate(["mean", "std"]).T
+
+# %%
+# In comparison with the vanilla model, we observe that the balanced accuracy score
+# increased. Of course, it comes at the cost of a lower accuracy score. It means that
+# our model is now more sensitive to the positive class but makes more mistakes on the
+# negative class.
+#
+# However, it is important to note that this tuned predictive model is internally the
+# same model as the vanilla model: they have the same fitted coefficients.
+import matplotlib.pyplot as plt
+
+vanilla_model_coef = pd.DataFrame(
+    [est[-1].coef_.ravel() for est in cv_results_vanilla_model["estimator"]],
+    columns=diabetes.feature_names,
+)
+tuned_model_coef = pd.DataFrame(
+    [est.estimator_[-1].coef_.ravel() for est in cv_results_tuned_model["estimator"]],
+    columns=diabetes.feature_names,
+)
+
+fig, ax = plt.subplots(ncols=2, figsize=(12, 4), sharex=True, sharey=True)
+vanilla_model_coef.boxplot(ax=ax[0])
+ax[0].set_ylabel("Coefficient value")
+ax[0].set_title("Vanilla model")
+tuned_model_coef.boxplot(ax=ax[1])
+ax[1].set_title("Tuned model")
+_ = fig.suptitle("Coefficients of the predictive models")
+
+# %%
+# Only the decision threshold of each model was changed during the cross-validation.
+decision_threshold = pd.Series(
+    [est.best_threshold_ for est in cv_results_tuned_model["estimator"]],
+)
+ax = decision_threshold.plot.kde()
+ax.axvline(
+    decision_threshold.mean(),
+    color="k",
+    linestyle="--",
+    label=f"Mean decision threshold: {decision_threshold.mean():.2f}",
+)
+ax.set_xlabel("Decision threshold")
+ax.legend(loc="upper right")
+_ = ax.set_title(
+    "Distribution of the decision threshold \nacross different cross-validation folds"
+)
+
+# %%
+# In average, a decision threshold around 0.32 maximizes the balanced accuracy, which is
+# different from the default decision threshold of 0.5. Thus tuning the decision
+# threshold is particularly important when the output of the predictive model
+# is used to make decisions. Besides, the metric used to tune the decision threshold
+# should be chosen carefully. Here, we used the balanced accuracy but it might not be
+# the most appropriate metric for the problem at hand. The choice of the "right" metric
+# is usually problem-dependent and might require some domain knowledge. Refer to the
+# example entitled,
+# :ref:`sphx_glr_auto_examples_model_selection_plot_cost_sensitive_learning.py`,
+# for more details.
diff --git a/examples/multioutput/plot_classifier_chain_yeast.py b/examples/multioutput/plot_classifier_chain_yeast.py
index eb40b1ef83d04..9d6e7d411c289 100644
--- a/examples/multioutput/plot_classifier_chain_yeast.py
+++ b/examples/multioutput/plot_classifier_chain_yeast.py
@@ -20,8 +20,8 @@
 greater than that of the set independent base models.
 """
 
-# Author: Adam Kleczewski
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Loading a dataset
diff --git a/examples/neighbors/approximate_nearest_neighbors.py b/examples/neighbors/approximate_nearest_neighbors.py
index 97ae3ec5663dd..a2da69f62fb10 100644
--- a/examples/neighbors/approximate_nearest_neighbors.py
+++ b/examples/neighbors/approximate_nearest_neighbors.py
@@ -14,8 +14,8 @@
 Please note that we do the same in the proposed `nmslib` wrapper.
 """
 
-# Author: Tom Dupre la Tour
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # First we try to import the packages and warn the user in case they are
diff --git a/examples/neighbors/plot_caching_nearest_neighbors.py b/examples/neighbors/plot_caching_nearest_neighbors.py
index 10c0d315da7af..f5c3ea200943f 100644
--- a/examples/neighbors/plot_caching_nearest_neighbors.py
+++ b/examples/neighbors/plot_caching_nearest_neighbors.py
@@ -18,9 +18,8 @@
 
 """
 
-# Author: Tom Dupre la Tour
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 from tempfile import TemporaryDirectory
 
 import matplotlib.pyplot as plt
diff --git a/examples/neighbors/plot_nca_classification.py b/examples/neighbors/plot_nca_classification.py
index f76770640ed03..0703caf90056e 100644
--- a/examples/neighbors/plot_nca_classification.py
+++ b/examples/neighbors/plot_nca_classification.py
@@ -15,7 +15,7 @@
 
 """
 
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 from matplotlib.colors import ListedColormap
diff --git a/examples/neighbors/plot_nca_dim_reduction.py b/examples/neighbors/plot_nca_dim_reduction.py
index 82fd35616929e..415618f6bc4c7 100644
--- a/examples/neighbors/plot_nca_dim_reduction.py
+++ b/examples/neighbors/plot_nca_dim_reduction.py
@@ -28,7 +28,7 @@
 
 """
 
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/neighbors/plot_nca_illustration.py b/examples/neighbors/plot_nca_illustration.py
index e5fd2f9cb67bd..7085817f4e9fa 100644
--- a/examples/neighbors/plot_nca_illustration.py
+++ b/examples/neighbors/plot_nca_illustration.py
@@ -10,7 +10,7 @@
 
 """
 
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/neighbors/plot_regression.py b/examples/neighbors/plot_regression.py
index d5ceba8a34860..431540e81761b 100644
--- a/examples/neighbors/plot_regression.py
+++ b/examples/neighbors/plot_regression.py
@@ -6,27 +6,26 @@
 Demonstrate the resolution of a regression problem
 using a k-Nearest Neighbor and the interpolation of the
 target using both barycenter and constant weights.
-
 """
 
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#         Fabian Pedregosa <fabian.pedregosa@inria.fr>
-#
-# License: BSD 3 clause (C) INRIA
-
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Generate sample data
 # --------------------
+# Here we generate a few data points to use to train the model. We also generate
+# data in the whole range of the training data to visualize how the model would
+# react in that whole region.
 import matplotlib.pyplot as plt
 import numpy as np
 
 from sklearn import neighbors
 
-np.random.seed(0)
-X = np.sort(5 * np.random.rand(40, 1), axis=0)
-T = np.linspace(0, 5, 500)[:, np.newaxis]
-y = np.sin(X).ravel()
+rng = np.random.RandomState(0)
+X_train = np.sort(5 * rng.rand(40, 1), axis=0)
+X_test = np.linspace(0, 5, 500)[:, np.newaxis]
+y = np.sin(X_train).ravel()
 
 # Add noise to targets
 y[::5] += 1 * (0.5 - np.random.rand(8))
@@ -34,15 +33,17 @@
 # %%
 # Fit regression model
 # --------------------
+# Here we train a model and visualize how `uniform` and `distance`
+# weights in prediction effect predicted values.
 n_neighbors = 5
 
 for i, weights in enumerate(["uniform", "distance"]):
     knn = neighbors.KNeighborsRegressor(n_neighbors, weights=weights)
-    y_ = knn.fit(X, y).predict(T)
+    y_ = knn.fit(X_train, y).predict(X_test)
 
     plt.subplot(2, 1, i + 1)
-    plt.scatter(X, y, color="darkorange", label="data")
-    plt.plot(T, y_, color="navy", label="prediction")
+    plt.scatter(X_train, y, color="darkorange", label="data")
+    plt.plot(X_test, y_, color="navy", label="prediction")
     plt.axis("tight")
     plt.legend()
     plt.title("KNeighborsRegressor (k = %i, weights = '%s')" % (n_neighbors, weights))
diff --git a/examples/neighbors/plot_species_kde.py b/examples/neighbors/plot_species_kde.py
index 3783138dfcb76..0d4e8f4af95b2 100644
--- a/examples/neighbors/plot_species_kde.py
+++ b/examples/neighbors/plot_species_kde.py
@@ -36,9 +36,8 @@
    190:231-259, 2006.
 """  # noqa: E501
 
-# Author: Jake Vanderplas <jakevdp@cs.washington.edu>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/neural_networks/plot_mlp_alpha.py b/examples/neural_networks/plot_mlp_alpha.py
index b53beef54c115..d5f35ea88ff96 100644
--- a/examples/neural_networks/plot_mlp_alpha.py
+++ b/examples/neural_networks/plot_mlp_alpha.py
@@ -17,8 +17,8 @@
 
 """
 
-# Author: Issam H. Laradji
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 from matplotlib import pyplot as plt
diff --git a/examples/neural_networks/plot_rbm_logistic_classification.py b/examples/neural_networks/plot_rbm_logistic_classification.py
index 3ba878d4ad191..c42735bea8684 100644
--- a/examples/neural_networks/plot_rbm_logistic_classification.py
+++ b/examples/neural_networks/plot_rbm_logistic_classification.py
@@ -11,8 +11,8 @@
 
 """
 
-# Authors: Yann N. Dauphin, Vlad Niculae, Gabriel Synnaeve
-# License: BSD
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Generate data
diff --git a/examples/preprocessing/plot_all_scaling.py b/examples/preprocessing/plot_all_scaling.py
index f53c50e33875a..09b099067da14 100644
--- a/examples/preprocessing/plot_all_scaling.py
+++ b/examples/preprocessing/plot_all_scaling.py
@@ -40,10 +40,8 @@
 
 """
 
-# Author:  Raghav RV <rvraghav93@gmail.com>
-#          Guillaume Lemaitre <g.lemaitre58@gmail.com>
-#          Thomas Unterthiner
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib as mpl
 import numpy as np
diff --git a/examples/preprocessing/plot_discretization.py b/examples/preprocessing/plot_discretization.py
index 002d606da0c9d..0e64a3efd4465 100644
--- a/examples/preprocessing/plot_discretization.py
+++ b/examples/preprocessing/plot_discretization.py
@@ -27,9 +27,8 @@
 
 """
 
-# Author: Andreas Müller
-#         Hanmin Qin <qinhanmin2005@sina.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/preprocessing/plot_discretization_classification.py b/examples/preprocessing/plot_discretization_classification.py
index f3edcac0011d7..04a461a61799f 100644
--- a/examples/preprocessing/plot_discretization_classification.py
+++ b/examples/preprocessing/plot_discretization_classification.py
@@ -31,7 +31,7 @@
 # Code source: Tom Dupré la Tour
 # Adapted from plot_classifier_comparison by Gaël Varoquaux and Andreas Müller
 #
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
@@ -68,7 +68,7 @@ def get_name(estimator):
         {"logisticregression__C": np.logspace(-1, 1, 3)},
     ),
     (
-        make_pipeline(StandardScaler(), LinearSVC(random_state=0, dual="auto")),
+        make_pipeline(StandardScaler(), LinearSVC(random_state=0)),
         {"linearsvc__C": np.logspace(-1, 1, 3)},
     ),
     (
@@ -86,7 +86,7 @@ def get_name(estimator):
         make_pipeline(
             StandardScaler(),
             KBinsDiscretizer(encode="onehot", random_state=0),
-            LinearSVC(random_state=0, dual="auto"),
+            LinearSVC(random_state=0),
         ),
         {
             "kbinsdiscretizer__n_bins": np.arange(5, 8),
diff --git a/examples/preprocessing/plot_discretization_strategies.py b/examples/preprocessing/plot_discretization_strategies.py
index 105fcdb3b4868..d2a967e884eee 100644
--- a/examples/preprocessing/plot_discretization_strategies.py
+++ b/examples/preprocessing/plot_discretization_strategies.py
@@ -16,8 +16,8 @@
 
 """
 
-# Author: Tom Dupré la Tour
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
@@ -76,9 +76,7 @@
     i += 1
     # transform the dataset with KBinsDiscretizer
     for strategy in strategies:
-        enc = KBinsDiscretizer(
-            n_bins=4, encode="ordinal", strategy=strategy, subsample=200_000
-        )
+        enc = KBinsDiscretizer(n_bins=4, encode="ordinal", strategy=strategy)
         enc.fit(X)
         grid_encoded = enc.transform(grid)
 
diff --git a/examples/preprocessing/plot_map_data_to_normal.py b/examples/preprocessing/plot_map_data_to_normal.py
index a521039098871..399c528a69f46 100644
--- a/examples/preprocessing/plot_map_data_to_normal.py
+++ b/examples/preprocessing/plot_map_data_to_normal.py
@@ -34,9 +34,8 @@
 
 """
 
-# Author: Eric Chang <ericchang2017@u.northwestern.edu>
-#         Nicolas Hug <contact@nicolas-hug.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/preprocessing/plot_scaling_importance.py b/examples/preprocessing/plot_scaling_importance.py
index 138bc9c57b4a2..55b133576b540 100644
--- a/examples/preprocessing/plot_scaling_importance.py
+++ b/examples/preprocessing/plot_scaling_importance.py
@@ -26,10 +26,8 @@
 
 """
 
-# Author: Tyler Lanigan <tylerlanigan@gmail.com>
-#         Sebastian Raschka <mail@sebastianraschka.com>
-#         Arturo Amor <david-arturo.amor-quiroz@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Load and prepare data
diff --git a/examples/release_highlights/plot_release_highlights_1_1_0.py b/examples/release_highlights/plot_release_highlights_1_1_0.py
index 44f85a8bbdf8b..16b359a9b03e7 100644
--- a/examples/release_highlights/plot_release_highlights_1_1_0.py
+++ b/examples/release_highlights/plot_release_highlights_1_1_0.py
@@ -24,8 +24,8 @@
 # %%
 # .. _quantile_support_hgbdt:
 #
-# Quantile loss in :class:`ensemble.HistGradientBoostingRegressor`
-# ----------------------------------------------------------------
+# Quantile loss in :class:`~ensemble.HistGradientBoostingRegressor`
+# -----------------------------------------------------------------
 # :class:`~ensemble.HistGradientBoostingRegressor` can model quantiles with
 # `loss="quantile"` and the new parameter `quantile`.
 from sklearn.ensemble import HistGradientBoostingRegressor
diff --git a/examples/release_highlights/plot_release_highlights_1_3_0.py b/examples/release_highlights/plot_release_highlights_1_3_0.py
index 8521ac3554c46..ebb109e524f1d 100644
--- a/examples/release_highlights/plot_release_highlights_1_3_0.py
+++ b/examples/release_highlights/plot_release_highlights_1_3_0.py
@@ -101,8 +101,8 @@
 tree.predict(X)
 
 # %%
-# New display `model_selection.ValidationCurveDisplay`
-# ----------------------------------------------------
+# New display :class:`~model_selection.ValidationCurveDisplay`
+# ------------------------------------------------------------
 # :class:`model_selection.ValidationCurveDisplay` is now available to plot results
 # from :func:`model_selection.validation_curve`.
 from sklearn.datasets import make_classification
@@ -141,8 +141,8 @@
 cross_val_score(gbdt, X, y).mean()
 
 # %%
-# Grouping infrequent categories in :class:`preprocessing.OrdinalEncoder`
-# -----------------------------------------------------------------------
+# Grouping infrequent categories in :class:`~preprocessing.OrdinalEncoder`
+# ------------------------------------------------------------------------
 # Similarly to :class:`preprocessing.OneHotEncoder`, the class
 # :class:`preprocessing.OrdinalEncoder` now supports aggregating infrequent categories
 # into a single output for each feature. The parameters to enable the gathering of
diff --git a/examples/release_highlights/plot_release_highlights_1_5_0.py b/examples/release_highlights/plot_release_highlights_1_5_0.py
new file mode 100644
index 0000000000000..20ca85a8002da
--- /dev/null
+++ b/examples/release_highlights/plot_release_highlights_1_5_0.py
@@ -0,0 +1,230 @@
+# ruff: noqa
+"""
+=======================================
+Release Highlights for scikit-learn 1.5
+=======================================
+
+.. currentmodule:: sklearn
+
+We are pleased to announce the release of scikit-learn 1.5! Many bug fixes
+and improvements were added, as well as some key new features. Below we
+detail the highlights of this release. **For an exhaustive list of
+all the changes**, please refer to the :ref:`release notes <release_notes_1_5>`.
+
+To install the latest version (with pip)::
+
+    pip install --upgrade scikit-learn
+
+or with conda::
+
+    conda install -c conda-forge scikit-learn
+
+"""
+
+# %%
+# FixedThresholdClassifier: Setting the decision threshold of a binary classifier
+# -------------------------------------------------------------------------------
+# All binary classifiers of scikit-learn use a fixed decision threshold of 0.5
+# to convert probability estimates (i.e. output of `predict_proba`) into class
+# predictions. However, 0.5 is almost never the desired threshold for a given
+# problem. :class:`~model_selection.FixedThresholdClassifier` allows wrapping any
+# binary classifier and setting a custom decision threshold.
+from sklearn.datasets import make_classification
+from sklearn.model_selection import train_test_split
+from sklearn.linear_model import LogisticRegression
+from sklearn.metrics import ConfusionMatrixDisplay
+
+
+X, y = make_classification(n_samples=10_000, weights=[0.9, 0.1], random_state=0)
+X_train, X_test, y_train, y_test = train_test_split(X, y, random_state=0)
+
+classifier_05 = LogisticRegression(C=1e6, random_state=0).fit(X_train, y_train)
+_ = ConfusionMatrixDisplay.from_estimator(classifier_05, X_test, y_test)
+
+# %%
+# Lowering the threshold, i.e. allowing more samples to be classified as the positive
+# class, increases the number of true positives at the cost of more false positives
+# (as is well known from the concavity of the ROC curve).
+from sklearn.model_selection import FixedThresholdClassifier
+
+classifier_01 = FixedThresholdClassifier(classifier_05, threshold=0.1)
+classifier_01.fit(X_train, y_train)
+_ = ConfusionMatrixDisplay.from_estimator(classifier_01, X_test, y_test)
+
+# %%
+# TunedThresholdClassifierCV: Tuning the decision threshold of a binary classifier
+# --------------------------------------------------------------------------------
+# The decision threshold of a binary classifier can be tuned to optimize a
+# given metric, using :class:`~model_selection.TunedThresholdClassifierCV`.
+#
+# It is particularly useful to find the best decision threshold when the model
+# is meant to be deployed in a specific application context where we can assign
+# different gains or costs for true positives, true negatives, false positives,
+# and false negatives.
+#
+# Let's illustrate this by considering an arbitrary case where:
+#
+# - each true positive gains 1 unit of profit, e.g. euro, year of life in good
+#   health, etc.;
+# - true negatives gain or cost nothing;
+# - each false negative costs 2;
+# - each false positive costs 0.1.
+#
+# Our metric quantifies the average profit per sample, which is defined by the
+# following Python function:
+from sklearn.metrics import confusion_matrix
+
+
+def custom_score(y_observed, y_pred):
+    tn, fp, fn, tp = confusion_matrix(y_observed, y_pred, normalize="all").ravel()
+    return tp - 2 * fn - 0.1 * fp
+
+
+print("Untuned decision threshold: 0.5")
+print(f"Custom score: {custom_score(y_test, classifier_05.predict(X_test)):.2f}")
+
+# %%
+# It is interesting to observe that the average gain per prediction is negative
+# which means that this decision system is making a loss on average.
+#
+# Tuning the threshold to optimize this custom metric gives a smaller threshold
+# that allows more samples to be classified as the positive class. As a result,
+# the average gain per prediction improves.
+from sklearn.model_selection import TunedThresholdClassifierCV
+from sklearn.metrics import make_scorer
+
+custom_scorer = make_scorer(
+    custom_score, response_method="predict", greater_is_better=True
+)
+tuned_classifier = TunedThresholdClassifierCV(
+    classifier_05, cv=5, scoring=custom_scorer
+).fit(X, y)
+
+print(f"Tuned decision threshold: {tuned_classifier.best_threshold_:.3f}")
+print(f"Custom score: {custom_score(y_test, tuned_classifier.predict(X_test)):.2f}")
+
+# %%
+# We observe that tuning the decision threshold can turn a machine
+# learning-based system that makes a loss on average into a beneficial one.
+#
+# In practice, defining a meaningful application-specific metric might involve
+# making those costs for bad predictions and gains for good predictions depend on
+# auxiliary metadata specific to each individual data point such as the amount
+# of a transaction in a fraud detection system.
+#
+# To achieve this, :class:`~model_selection.TunedThresholdClassifierCV`
+# leverages metadata routing support (:ref:`Metadata Routing User
+# Guide<metadata_routing>`) allowing to optimize complex business metrics as
+# detailed in :ref:`Post-tuning the decision threshold for cost-sensitive
+# learning
+# <sphx_glr_auto_examples_model_selection_plot_cost_sensitive_learning.py>`.
+
+# %%
+# Performance improvements in PCA
+# -------------------------------
+# :class:`~decomposition.PCA` has a new solver, `"covariance_eigh"`, which is
+# up to an order of magnitude faster and more memory efficient than the other
+# solvers for datasets with many data points and few features.
+from sklearn.datasets import make_low_rank_matrix
+from sklearn.decomposition import PCA
+
+X = make_low_rank_matrix(
+    n_samples=10_000, n_features=100, tail_strength=0.1, random_state=0
+)
+
+pca = PCA(n_components=10, svd_solver="covariance_eigh").fit(X)
+print(f"Explained variance: {pca.explained_variance_ratio_.sum():.2f}")
+
+
+# %%
+# The new solver also accepts sparse input data:
+from scipy.sparse import random
+
+X = random(10_000, 100, format="csr", random_state=0)
+
+pca = PCA(n_components=10, svd_solver="covariance_eigh").fit(X)
+print(f"Explained variance: {pca.explained_variance_ratio_.sum():.2f}")
+
+# %%
+# The `"full"` solver has also been improved to use less memory and allows
+# faster transformation. The default `svd_solver="auto"`` option takes
+# advantage of the new solver and is now able to select an appropriate solver
+# for sparse datasets.
+#
+# Similarly to most other PCA solvers, the new `"covariance_eigh"` solver can leverage
+# GPU computation if the input data is passed as a PyTorch or CuPy array by
+# enabling the experimental support for :ref:`Array API <array_api>`.
+
+# %%
+# ColumnTransformer is subscriptable
+# ----------------------------------
+# The transformers of a :class:`~compose.ColumnTransformer` can now be directly
+# accessed using indexing by name.
+import numpy as np
+from sklearn.compose import ColumnTransformer
+from sklearn.preprocessing import StandardScaler, OneHotEncoder
+
+X = np.array([[0, 1, 2], [3, 4, 5]])
+column_transformer = ColumnTransformer(
+    [("std_scaler", StandardScaler(), [0]), ("one_hot", OneHotEncoder(), [1, 2])]
+)
+
+column_transformer.fit(X)
+
+print(column_transformer["std_scaler"])
+print(column_transformer["one_hot"])
+
+# %%
+# Custom imputation strategies for the SimpleImputer
+# --------------------------------------------------
+# :class:`~impute.SimpleImputer` now supports custom strategies for imputation,
+# using a callable that computes a scalar value from the non missing values of
+# a column vector.
+from sklearn.impute import SimpleImputer
+
+X = np.array(
+    [
+        [-1.1, 1.1, 1.1],
+        [3.9, -1.2, np.nan],
+        [np.nan, 1.3, np.nan],
+        [-0.1, -1.4, -1.4],
+        [-4.9, 1.5, -1.5],
+        [np.nan, 1.6, 1.6],
+    ]
+)
+
+
+def smallest_abs(arr):
+    """Return the smallest absolute value of a 1D array."""
+    return np.min(np.abs(arr))
+
+
+imputer = SimpleImputer(strategy=smallest_abs)
+
+imputer.fit_transform(X)
+
+# %%
+# Pairwise distances with non-numeric arrays
+# ------------------------------------------
+# :func:`~metrics.pairwise_distances` can now compute distances between
+# non-numeric arrays using a callable metric.
+from sklearn.metrics import pairwise_distances
+
+X = ["cat", "dog"]
+Y = ["cat", "fox"]
+
+
+def levenshtein_distance(x, y):
+    """Return the Levenshtein distance between two strings."""
+    if x == "" or y == "":
+        return max(len(x), len(y))
+    if x[0] == y[0]:
+        return levenshtein_distance(x[1:], y[1:])
+    return 1 + min(
+        levenshtein_distance(x[1:], y),
+        levenshtein_distance(x, y[1:]),
+        levenshtein_distance(x[1:], y[1:]),
+    )
+
+
+pairwise_distances(X, Y, metric=levenshtein_distance)
diff --git a/examples/semi_supervised/plot_label_propagation_digits.py b/examples/semi_supervised/plot_label_propagation_digits.py
index bfdff8e362e47..b8b544005c1b2 100644
--- a/examples/semi_supervised/plot_label_propagation_digits.py
+++ b/examples/semi_supervised/plot_label_propagation_digits.py
@@ -16,8 +16,8 @@ class will be very good.
 
 """
 
-# Authors: Clay Woolam <clay@woolam.org>
-# License: BSD
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Data generation
diff --git a/examples/semi_supervised/plot_label_propagation_digits_active_learning.py b/examples/semi_supervised/plot_label_propagation_digits_active_learning.py
index 45af1d7891b2e..1e03f528acdb8 100644
--- a/examples/semi_supervised/plot_label_propagation_digits_active_learning.py
+++ b/examples/semi_supervised/plot_label_propagation_digits_active_learning.py
@@ -20,8 +20,8 @@
 
 """
 
-# Authors: Clay Woolam <clay@woolam.org>
-# License: BSD
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/semi_supervised/plot_label_propagation_structure.py b/examples/semi_supervised/plot_label_propagation_structure.py
index cfcd1c1bf5a54..8a1798c84edf4 100644
--- a/examples/semi_supervised/plot_label_propagation_structure.py
+++ b/examples/semi_supervised/plot_label_propagation_structure.py
@@ -11,9 +11,8 @@
 
 """
 
-# Authors: Clay Woolam <clay@woolam.org>
-#          Andreas Mueller <amueller@ais.uni-bonn.de>
-# License: BSD
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # We generate a dataset with two concentric circles. In addition, a label
diff --git a/examples/semi_supervised/plot_self_training_varying_threshold.py b/examples/semi_supervised/plot_self_training_varying_threshold.py
index 2c7a485d06eb0..bbdaeb634f570 100644
--- a/examples/semi_supervised/plot_self_training_varying_threshold.py
+++ b/examples/semi_supervised/plot_self_training_varying_threshold.py
@@ -29,8 +29,8 @@
 
 """
 
-# Authors: Oliver Rausch <rauscho@ethz.ch>
-# License: BSD
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/semi_supervised/plot_semi_supervised_versus_svm_iris.py b/examples/semi_supervised/plot_semi_supervised_versus_svm_iris.py
index 766f7ea0a79c6..3872a59377cab 100644
--- a/examples/semi_supervised/plot_semi_supervised_versus_svm_iris.py
+++ b/examples/semi_supervised/plot_semi_supervised_versus_svm_iris.py
@@ -14,9 +14,8 @@
 
 """
 
-# Authors: Clay Woolam   <clay@woolam.org>
-#          Oliver Rausch <rauscho@ethz.ch>
-# License: BSD
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/svm/plot_iris_svc.py b/examples/svm/plot_iris_svc.py
index 61aba3cc06602..d13a9fe49c803 100644
--- a/examples/svm/plot_iris_svc.py
+++ b/examples/svm/plot_iris_svc.py
@@ -50,7 +50,7 @@
 C = 1.0  # SVM regularization parameter
 models = (
     svm.SVC(kernel="linear", C=C),
-    svm.LinearSVC(C=C, max_iter=10000, dual="auto"),
+    svm.LinearSVC(C=C, max_iter=10000),
     svm.SVC(kernel="rbf", gamma=0.7, C=C),
     svm.SVC(kernel="poly", degree=3, gamma="auto", C=C),
 )
diff --git a/examples/svm/plot_linearsvc_support_vectors.py b/examples/svm/plot_linearsvc_support_vectors.py
index 60e9a3e6f32f9..7f82b6c8bb0fe 100644
--- a/examples/svm/plot_linearsvc_support_vectors.py
+++ b/examples/svm/plot_linearsvc_support_vectors.py
@@ -21,7 +21,7 @@
 plt.figure(figsize=(10, 5))
 for i, C in enumerate([1, 100]):
     # "hinge" is the standard SVM loss
-    clf = LinearSVC(C=C, loss="hinge", random_state=42, dual="auto").fit(X, y)
+    clf = LinearSVC(C=C, loss="hinge", random_state=42).fit(X, y)
     # obtain the support vectors through the decision function
     decision_function = clf.decision_function(X)
     # we can also calculate the decision function manually
diff --git a/examples/svm/plot_svm_kernels.py b/examples/svm/plot_svm_kernels.py
index d801e2477e682..9d859864084f0 100644
--- a/examples/svm/plot_svm_kernels.py
+++ b/examples/svm/plot_svm_kernels.py
@@ -37,7 +37,7 @@
 """
 
 # Code source: Gaël Varoquaux
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Creating a dataset
@@ -110,12 +110,15 @@
 from sklearn.inspection import DecisionBoundaryDisplay
 
 
-def plot_training_data_with_decision_boundary(kernel):
+def plot_training_data_with_decision_boundary(
+    kernel, ax=None, long_title=True, support_vectors=True
+):
     # Train the SVC
     clf = svm.SVC(kernel=kernel, gamma=2).fit(X, y)
 
     # Settings for plotting
-    _, ax = plt.subplots(figsize=(4, 3))
+    if ax is None:
+        _, ax = plt.subplots(figsize=(4, 3))
     x_min, x_max, y_min, y_max = -3, 3, -3, 3
     ax.set(xlim=(x_min, x_max), ylim=(y_min, y_max))
 
@@ -136,20 +139,26 @@ def plot_training_data_with_decision_boundary(kernel):
         linestyles=["--", "-", "--"],
     )
 
-    # Plot bigger circles around samples that serve as support vectors
-    ax.scatter(
-        clf.support_vectors_[:, 0],
-        clf.support_vectors_[:, 1],
-        s=250,
-        facecolors="none",
-        edgecolors="k",
-    )
+    if support_vectors:
+        # Plot bigger circles around samples that serve as support vectors
+        ax.scatter(
+            clf.support_vectors_[:, 0],
+            clf.support_vectors_[:, 1],
+            s=150,
+            facecolors="none",
+            edgecolors="k",
+        )
+
     # Plot samples by color and add legend
-    ax.scatter(X[:, 0], X[:, 1], c=y, s=150, edgecolors="k")
+    ax.scatter(X[:, 0], X[:, 1], c=y, s=30, edgecolors="k")
     ax.legend(*scatter.legend_elements(), loc="upper right", title="Classes")
-    ax.set_title(f" Decision boundaries of {kernel} kernel in SVC")
+    if long_title:
+        ax.set_title(f" Decision boundaries of {kernel} kernel in SVC")
+    else:
+        ax.set_title(kernel)
 
-    _ = plt.show()
+    if ax is None:
+        plt.show()
 
 
 # %%
@@ -237,7 +246,6 @@ def plot_training_data_with_decision_boundary(kernel):
 # using the hyperbolic tangent function (:math:`\tanh`). The kernel function
 # scales and possibly shifts the dot product of the two points
 # (:math:`\mathbf{x}_1` and :math:`\mathbf{x}_2`).
-
 plot_training_data_with_decision_boundary("sigmoid")
 
 # %%
@@ -271,3 +279,26 @@ def plot_training_data_with_decision_boundary(kernel):
 # parameters using techniques such as
 # :class:`~sklearn.model_selection.GridSearchCV` is recommended to capture the
 # underlying structures within the data.
+
+# %%
+# XOR dataset
+# -----------
+# A classical example of a dataset which is not linearly separable is the XOR
+# pattern. HEre we demonstrate how different kernels work on such a dataset.
+
+xx, yy = np.meshgrid(np.linspace(-3, 3, 500), np.linspace(-3, 3, 500))
+np.random.seed(0)
+X = np.random.randn(300, 2)
+y = np.logical_xor(X[:, 0] > 0, X[:, 1] > 0)
+
+_, ax = plt.subplots(2, 2, figsize=(8, 8))
+args = dict(long_title=False, support_vectors=False)
+plot_training_data_with_decision_boundary("linear", ax[0, 0], **args)
+plot_training_data_with_decision_boundary("poly", ax[0, 1], **args)
+plot_training_data_with_decision_boundary("rbf", ax[1, 0], **args)
+plot_training_data_with_decision_boundary("sigmoid", ax[1, 1], **args)
+plt.show()
+
+# %%
+# As you can see from the plots above, only the `rbf` kernel can find a
+# reasonable decision boundary for the above dataset.
diff --git a/examples/svm/plot_svm_margin.py b/examples/svm/plot_svm_margin.py
index b8253264a4ad0..de293f61b848d 100644
--- a/examples/svm/plot_svm_margin.py
+++ b/examples/svm/plot_svm_margin.py
@@ -15,7 +15,7 @@
 
 # Code source: Gaël Varoquaux
 # Modified for documentation by Jaques Grobler
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
@@ -63,7 +63,6 @@
         facecolors="none",
         zorder=10,
         edgecolors="k",
-        cmap=plt.get_cmap("RdBu"),
     )
     plt.scatter(
         X[:, 0], X[:, 1], c=Y, zorder=10, cmap=plt.get_cmap("RdBu"), edgecolors="k"
diff --git a/examples/svm/plot_svm_nonlinear.py b/examples/svm/plot_svm_nonlinear.py
deleted file mode 100644
index 4990e509661a1..0000000000000
--- a/examples/svm/plot_svm_nonlinear.py
+++ /dev/null
@@ -1,45 +0,0 @@
-"""
-==============
-Non-linear SVM
-==============
-
-Perform binary classification using non-linear SVC
-with RBF kernel. The target to predict is a XOR of the
-inputs.
-
-The color map illustrates the decision function learned by the SVC.
-
-"""
-
-import matplotlib.pyplot as plt
-import numpy as np
-
-from sklearn import svm
-
-xx, yy = np.meshgrid(np.linspace(-3, 3, 500), np.linspace(-3, 3, 500))
-np.random.seed(0)
-X = np.random.randn(300, 2)
-Y = np.logical_xor(X[:, 0] > 0, X[:, 1] > 0)
-
-# fit the model
-clf = svm.NuSVC(gamma="auto")
-clf.fit(X, Y)
-
-# plot the decision function for each datapoint on the grid
-Z = clf.decision_function(np.c_[xx.ravel(), yy.ravel()])
-Z = Z.reshape(xx.shape)
-
-plt.imshow(
-    Z,
-    interpolation="nearest",
-    extent=(xx.min(), xx.max(), yy.min(), yy.max()),
-    aspect="auto",
-    origin="lower",
-    cmap=plt.cm.PuOr_r,
-)
-contours = plt.contour(xx, yy, Z, levels=[0], linewidths=2, linestyles="dashed")
-plt.scatter(X[:, 0], X[:, 1], s=30, c=Y, cmap=plt.cm.Paired, edgecolors="k")
-plt.xticks(())
-plt.yticks(())
-plt.axis([-3, 3, -3, 3])
-plt.show()
diff --git a/examples/svm/plot_svm_scale_c.py b/examples/svm/plot_svm_scale_c.py
index ea09f03ec7f95..319258e3e3143 100644
--- a/examples/svm/plot_svm_scale_c.py
+++ b/examples/svm/plot_svm_scale_c.py
@@ -34,9 +34,8 @@
 optimally adjust C to account for the different amount of training samples?"
 """
 
-# Author: Andreas Mueller <amueller@ais.uni-bonn.de>
-#         Jaques Grobler <jaques.grobler@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Data generation
diff --git a/examples/svm/plot_svm_tie_breaking.py b/examples/svm/plot_svm_tie_breaking.py
index 848b81dee9c69..0a43d4125aec5 100644
--- a/examples/svm/plot_svm_tie_breaking.py
+++ b/examples/svm/plot_svm_tie_breaking.py
@@ -15,7 +15,7 @@
 """
 
 # Code source: Andreas Mueller, Adrin Jalali
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import matplotlib.pyplot as plt
 import numpy as np
diff --git a/examples/text/plot_document_classification_20newsgroups.py b/examples/text/plot_document_classification_20newsgroups.py
index 04aad46c8451a..aa80b7c1b630b 100644
--- a/examples/text/plot_document_classification_20newsgroups.py
+++ b/examples/text/plot_document_classification_20newsgroups.py
@@ -14,12 +14,8 @@
 
 """
 
-# Author: Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#         Olivier Grisel <olivier.grisel@ensta.org>
-#         Mathieu Blondel <mathieu@mblondel.org>
-#         Arturo Amor <david-arturo.amor-quiroz@inria.fr>
-#         Lars Buitinck
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 # %%
diff --git a/examples/text/plot_document_clustering.py b/examples/text/plot_document_clustering.py
index 2c3506f4ec32e..43dcd4f443bf5 100644
--- a/examples/text/plot_document_clustering.py
+++ b/examples/text/plot_document_clustering.py
@@ -23,11 +23,8 @@
 
 """
 
-# Author: Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#         Lars Buitinck
-#         Olivier Grisel <olivier.grisel@ensta.org>
-#         Arturo Amor <david-arturo.amor-quiroz@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Loading text data
diff --git a/examples/text/plot_hashing_vs_dict_vectorizer.py b/examples/text/plot_hashing_vs_dict_vectorizer.py
index 6c08f947e4a2f..4c59c7045bb19 100644
--- a/examples/text/plot_hashing_vs_dict_vectorizer.py
+++ b/examples/text/plot_hashing_vs_dict_vectorizer.py
@@ -26,10 +26,8 @@
 
 """
 
-# Author: Lars Buitinck
-#         Olivier Grisel <olivier.grisel@ensta.org>
-#         Arturo Amor <david-arturo.amor-quiroz@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # %%
 # Load Data
diff --git a/examples/tree/plot_iris_dtc.py b/examples/tree/plot_iris_dtc.py
index 4c54a4119ced3..61c3bec3460ed 100644
--- a/examples/tree/plot_iris_dtc.py
+++ b/examples/tree/plot_iris_dtc.py
@@ -66,7 +66,6 @@
             X[idx, 1],
             c=color,
             label=iris.target_names[i],
-            cmap=plt.cm.RdYlBu,
             edgecolor="black",
             s=15,
         )
diff --git a/examples/tree/plot_unveil_tree_structure.py b/examples/tree/plot_unveil_tree_structure.py
index 19b7c643ec0f7..508c3c304f4d9 100644
--- a/examples/tree/plot_unveil_tree_structure.py
+++ b/examples/tree/plot_unveil_tree_structure.py
@@ -68,7 +68,8 @@
 #   - ``weighted_n_node_samples[i]``: the weighted number of training samples
 #     reaching node ``i``
 #   - ``value[i, j, k]``: the summary of the training samples that reached node i for
-#     output j and class k (for regression tree, class is set to 1).
+#     output j and class k (for regression tree, class is set to 1). See below
+#     for more information about ``value``.
 #
 # Using the arrays, we can traverse the tree structure to compute various
 # properties. Below, we will compute the depth of each node and whether or not
@@ -108,7 +109,7 @@
     if is_leaves[i]:
         print(
             "{space}node={node} is a leaf node with value={value}.".format(
-                space=node_depth[i] * "\t", node=i, value=values[i]
+                space=node_depth[i] * "\t", node=i, value=np.around(values[i], 3)
             )
         )
     else:
@@ -122,7 +123,7 @@
                 feature=feature[i],
                 threshold=threshold[i],
                 right=children_right[i],
-                value=values[i],
+                value=np.around(values[i], 3),
             )
         )
 
@@ -130,16 +131,28 @@
 # What is the values array used here?
 # -----------------------------------
 # The `tree_.value` array is a 3D array of shape
-# [``n_nodes``, ``n_classes``, ``n_outputs``] which provides the count of samples
-# reaching a node for each class and for each output. Each node has a ``value``
-# array which is the number of weighted samples reaching this
-# node for each output and class.
+# [``n_nodes``, ``n_classes``, ``n_outputs``] which provides the proportion of samples
+# reaching a node for each class and for each output.
+# Each node has a ``value`` array which is the proportion of weighted samples reaching
+# this node for each output and class with respect to the parent node.
+#
+# One could convert this to the absolute weighted number of samples reaching a node,
+# by multiplying this number by `tree_.weighted_n_node_samples[node_idx]` for the
+# given node. Note sample weights are not used in this example, so the weighted
+# number of samples is the number of samples reaching the node because each sample
+# has a weight of 1 by default.
 #
 # For example, in the above tree built on the iris dataset, the root node has
-# ``value = [37, 34, 41]``, indicating there are 37 samples
+# ``value = [0.33, 0.304, 0.366]`` indicating there are 33% of class 0 samples,
+# 30.4% of class 1 samples, and 36.6% of class 2 samples at the root node. One can
+# convert this to the absolute number of samples by multiplying by the number of
+# samples reaching the root node, which is `tree_.weighted_n_node_samples[0]`.
+# Then the root node has ``value = [37, 34, 41]``, indicating there are 37 samples
 # of class 0, 34 samples of class 1, and 41 samples of class 2 at the root node.
+#
 # Traversing the tree, the samples are split and as a result, the ``value`` array
-# reaching each node changes. The left child of the root node has ``value = [37, 0, 0]``
+# reaching each node changes. The left child of the root node has ``value = [1., 0, 0]``
+# (or ``value = [37, 0, 0]`` when converted to the absolute number of samples)
 # because all 37 samples in the left child node are from class 0.
 #
 # Note: In this example, `n_outputs=1`, but the tree classifier can also handle
@@ -148,8 +161,10 @@
 
 ##############################################################################
 # We can compare the above output to the plot of the decision tree.
+# Here, we show the proportions of samples of each class that reach each
+# node corresponding to the actual elements of `tree_.value` array.
 
-tree.plot_tree(clf)
+tree.plot_tree(clf, proportion=True)
 plt.show()
 
 ##############################################################################
diff --git a/maint_tools/check_pxd_in_installation.py b/maint_tools/check_pxd_in_installation.py
deleted file mode 100644
index 380edbd6350b6..0000000000000
--- a/maint_tools/check_pxd_in_installation.py
+++ /dev/null
@@ -1,60 +0,0 @@
-"""Utility for testing presence and usability of .pxd files in the installation
-
-Usage:
-------
-python check_pxd_in_installation.py path/to/install_dir/of/scikit-learn
-"""
-
-import os
-import pathlib
-import subprocess
-import sys
-import tempfile
-import textwrap
-
-sklearn_dir = pathlib.Path(sys.argv[1])
-pxd_files = list(sklearn_dir.glob("**/*.pxd"))
-
-print("> Found pxd files:")
-for pxd_file in pxd_files:
-    print(" -", pxd_file)
-
-print("\n> Trying to compile a cython extension cimporting all corresponding modules\n")
-with tempfile.TemporaryDirectory() as tmpdir:
-    tmpdir = pathlib.Path(tmpdir)
-    # A cython test file which cimports all modules corresponding to found
-    # pxd files.
-    # e.g. sklearn/tree/_utils.pxd becomes `cimport sklearn.tree._utils`
-    with open(tmpdir / "tst.pyx", "w") as f:
-        for pxd_file in pxd_files:
-            to_import = str(pxd_file.relative_to(sklearn_dir))
-            to_import = to_import.replace(os.path.sep, ".")
-            to_import = to_import.replace(".pxd", "")
-            f.write("cimport sklearn." + to_import + "\n")
-
-    # A basic setup file to build the test file.
-    # We set the language to c++ and we use numpy.get_include() because
-    # some modules require it.
-    with open(tmpdir / "setup_tst.py", "w") as f:
-        f.write(
-            textwrap.dedent(
-                """
-            from setuptools import setup, Extension
-            from Cython.Build import cythonize
-            import numpy
-
-            extensions = [Extension("tst",
-                                    sources=["tst.pyx"],
-                                    language="c++",
-                                    include_dirs=[numpy.get_include()])]
-
-            setup(ext_modules=cythonize(extensions))
-            """
-            )
-        )
-
-    subprocess.run(
-        ["python", "setup_tst.py", "build_ext", "-i"], check=True, cwd=tmpdir
-    )
-
-    print("\n> Compilation succeeded !")
diff --git a/maint_tools/update_tracking_issue.py b/maint_tools/update_tracking_issue.py
index 46d9e56a190e8..b40e8222fefae 100644
--- a/maint_tools/update_tracking_issue.py
+++ b/maint_tools/update_tracking_issue.py
@@ -59,7 +59,7 @@
 issue_repo = gh.get_repo(args.issue_repo)
 dt_now = datetime.now(tz=timezone.utc)
 date_str = dt_now.strftime("%b %d, %Y")
-title_query = "CI failed on {args.ci_name}"
+title_query = f"CI failed on {args.ci_name}"
 title = f"⚠️ {title_query} (last failure: {date_str}) ⚠️"
 
 
diff --git a/meson.build b/meson.build
index 3835a5099abb0..b6b3652a82268 100644
--- a/meson.build
+++ b/meson.build
@@ -6,7 +6,7 @@ project(
   meson_version: '>= 1.1.0',
   default_options: [
     'buildtype=debugoptimized',
-    'c_std=c99',
+    'c_std=c11',
     'cpp_std=c++14',
   ],
 )
diff --git a/pyproject.toml b/pyproject.toml
index 33b8a32909d09..1b613ae561b27 100644
--- a/pyproject.toml
+++ b/pyproject.toml
@@ -1,6 +1,6 @@
 [project]
 name = "scikit-learn"
-version = "1.5.dev0"
+dynamic = ["version"]
 description = "A set of python modules for machine learning and data mining"
 readme = "README.rst"
 maintainers = [
@@ -10,7 +10,7 @@ dependencies = [
   "numpy>=1.19.5",
   "scipy>=1.6.0",
   "joblib>=1.2.0",
-  "threadpoolctl>=2.0.0",
+  "threadpoolctl>=3.1.0",
 ]
 requires-python = ">=3.9"
 license = {text = "new BSD"}
@@ -33,7 +33,6 @@ classifiers=[
   "Programming Language :: Python :: 3.11",
   "Programming Language :: Python :: 3.12",
   "Programming Language :: Python :: Implementation :: CPython",
-  "Programming Language :: Python :: Implementation :: PyPy",
 ]
 
 [project.urls]
@@ -44,8 +43,8 @@ tracker = "https://github.com/scikit-learn/scikit-learn/issues"
 "release notes" = "https://scikit-learn.org/stable/whats_new"
 
 [project.optional-dependencies]
-build = ["numpy>=1.19.5", "scipy>=1.6.0", "cython>=3.0.10", "meson-python>=0.15.0"]
-install = ["numpy>=1.19.5", "scipy>=1.6.0", "joblib>=1.2.0", "threadpoolctl>=2.0.0"]
+build = ["numpy>=1.19.5", "scipy>=1.6.0", "cython>=3.0.10", "meson-python>=0.16.0"]
+install = ["numpy>=1.19.5", "scipy>=1.6.0", "joblib>=1.2.0", "threadpoolctl>=3.1.0"]
 benchmark = ["matplotlib>=3.3.4", "pandas>=1.1.5", "memory_profiler>=0.57.0"]
 docs = [
     "matplotlib>=3.3.4",
@@ -53,16 +52,20 @@ docs = [
     "pandas>=1.1.5",
     "seaborn>=0.9.0",
     "memory_profiler>=0.57.0",
-    "sphinx>=6.0.0",
+    "sphinx>=7.3.7",
     "sphinx-copybutton>=0.5.2",
-    "sphinx-gallery>=0.15.0",
+    "sphinx-gallery>=0.16.0",
     "numpydoc>=1.2.0",
     "Pillow>=7.1.2",
     "pooch>=1.6.0",
-    "sphinx-prompt>=1.3.0",
-    "sphinxext-opengraph>=0.4.2",
+    "sphinx-prompt>=1.4.0",
+    "sphinxext-opengraph>=0.9.1",
     "plotly>=5.14.0",
-    "polars>=0.19.12"
+    "polars>=0.20.23",
+    "sphinx-design>=0.5.0",
+    "sphinxcontrib-sass>=0.3.4",
+    "pydata-sphinx-theme>=0.15.3",
+    "sphinx-remove-toctrees>=1.0.0.post1",
 ]
 examples = [
     "matplotlib>=3.3.4",
@@ -80,9 +83,9 @@ tests = [
     "pytest-cov>=2.9.0",
     "ruff>=0.2.1",
     "black>=24.3.0",
-    "mypy>=1.3",
+    "mypy>=1.9",
     "pyamg>=4.0.0",
-    "polars>=0.19.12",
+    "polars>=0.20.23",
     "pyarrow>=12.0.0",
     "numpydoc>=1.2.0",
     "pooch>=1.6.0",
@@ -93,7 +96,7 @@ maintenance = ["conda-lock==2.5.6"]
 build-backend = "mesonpy"
 # Minimum requirements for the build system to execute.
 requires = [
-    "meson-python>=0.15.0",
+    "meson-python>=0.16.0",
     "Cython>=3.0.10",
     "numpy>=1.25",
     "scipy>=1.6.0",
@@ -101,7 +104,7 @@ requires = [
 
 [tool.black]
 line-length = 88
-target_version = ['py39', 'py310', 'py311']
+target-version = ['py39', 'py310', 'py311']
 preview = true
 exclude = '''
 /(
@@ -111,7 +114,6 @@ exclude = '''
   | \.vscode
   | build
   | dist
-  | doc/tutorial
   | doc/_build
   | doc/auto_examples
   | sklearn/externals
@@ -130,7 +132,6 @@ exclude=[
     "sklearn/externals",
     "doc/_build",
     "doc/auto_examples",
-    "doc/tutorial",
     "build",
     "asv_benchmarks/env",
     "asv_benchmarks/html",
diff --git a/setup.cfg b/setup.cfg
index f2052de285ed6..5e21405c7fb46 100644
--- a/setup.cfg
+++ b/setup.cfg
@@ -16,10 +16,6 @@ addopts =
     --doctest-modules
     --disable-pytest-warnings
     --color=yes
-    # Activate the plugin explicitly to ensure that the seed is reported
-    # correctly on the CI when running `pytest --pyargs sklearn` from the
-    # source folder.
-    -p sklearn.tests.random_seed
 
 [mypy]
 ignore_missing_imports = True
@@ -60,5 +56,5 @@ ignore =
 
 
 [codespell]
-skip = ./.git,./.mypy_cache,./doc/themes/scikit-learn-modern/static/js,./sklearn/feature_extraction/_stop_words.py,./doc/_build,./doc/auto_examples,./doc/modules/generated
+skip = ./.git,./.mypy_cache,./sklearn/feature_extraction/_stop_words.py,./doc/_build,./doc/auto_examples,./doc/modules/generated
 ignore-words = build_tools/codespell_ignore_words.txt
diff --git a/setup.py b/setup.py
deleted file mode 100755
index 0f08cc5faddee..0000000000000
--- a/setup.py
+++ /dev/null
@@ -1,629 +0,0 @@
-#! /usr/bin/env python
-#
-# Copyright (C) 2007-2009 Cournapeau David <cournape@gmail.com>
-#               2010 Fabian Pedregosa <fabian.pedregosa@inria.fr>
-# License: 3-clause BSD
-
-import importlib
-import os
-import platform
-import shutil
-import sys
-import traceback
-from os.path import join
-
-from setuptools import Command, Extension, setup
-from setuptools.command.build_ext import build_ext
-
-try:
-    import builtins
-except ImportError:
-    # Python 2 compat: just to be able to declare that Python >=3.8 is needed.
-    import __builtin__ as builtins
-
-# This is a bit (!) hackish: we are setting a global variable so that the main
-# sklearn __init__ can detect if it is being loaded by the setup routine, to
-# avoid attempting to load components that aren't built yet.
-# TODO: can this be simplified or removed since the switch to setuptools
-# away from numpy.distutils?
-builtins.__SKLEARN_SETUP__ = True
-
-
-DISTNAME = "scikit-learn"
-DESCRIPTION = "A set of python modules for machine learning and data mining"
-with open("README.rst") as f:
-    LONG_DESCRIPTION = f.read()
-MAINTAINER = "scikit-learn developers"
-MAINTAINER_EMAIL = "scikit-learn@python.org"
-URL = "https://scikit-learn.org"
-DOWNLOAD_URL = "https://pypi.org/project/scikit-learn/#files"
-LICENSE = "new BSD"
-PROJECT_URLS = {
-    "Bug Tracker": "https://github.com/scikit-learn/scikit-learn/issues",
-    "Documentation": "https://scikit-learn.org/stable/documentation.html",
-    "Source Code": "https://github.com/scikit-learn/scikit-learn",
-}
-
-# We can actually import a restricted version of sklearn that
-# does not need the compiled code
-import sklearn  # noqa
-import sklearn._min_dependencies as min_deps  # noqa
-from sklearn._build_utils import _check_cython_version  # noqa
-from sklearn.externals._packaging.version import parse as parse_version  # noqa
-
-
-VERSION = sklearn.__version__
-
-# Custom clean command to remove build artifacts
-
-
-class CleanCommand(Command):
-    description = "Remove build artifacts from the source tree"
-
-    user_options = []
-
-    def initialize_options(self):
-        pass
-
-    def finalize_options(self):
-        pass
-
-    def run(self):
-        # Remove c files if we are not within a sdist package
-        cwd = os.path.abspath(os.path.dirname(__file__))
-        remove_c_files = not os.path.exists(os.path.join(cwd, "PKG-INFO"))
-        if remove_c_files:
-            print("Will remove generated .c files")
-        if os.path.exists("build"):
-            shutil.rmtree("build")
-        for dirpath, dirnames, filenames in os.walk("sklearn"):
-            for filename in filenames:
-                root, extension = os.path.splitext(filename)
-
-                if extension in [".so", ".pyd", ".dll", ".pyc"]:
-                    os.unlink(os.path.join(dirpath, filename))
-
-                if remove_c_files and extension in [".c", ".cpp"]:
-                    pyx_file = str.replace(filename, extension, ".pyx")
-                    if os.path.exists(os.path.join(dirpath, pyx_file)):
-                        os.unlink(os.path.join(dirpath, filename))
-
-                if remove_c_files and extension == ".tp":
-                    if os.path.exists(os.path.join(dirpath, root)):
-                        os.unlink(os.path.join(dirpath, root))
-
-            for dirname in dirnames:
-                if dirname == "__pycache__":
-                    shutil.rmtree(os.path.join(dirpath, dirname))
-
-
-# Custom build_ext command to set OpenMP compile flags depending on os and
-# compiler. Also makes it possible to set the parallelism level via
-# and environment variable (useful for the wheel building CI).
-# build_ext has to be imported after setuptools
-
-
-class build_ext_subclass(build_ext):
-    def finalize_options(self):
-        build_ext.finalize_options(self)
-        if self.parallel is None:
-            # Do not override self.parallel if already defined by
-            # command-line flag (--parallel or -j)
-
-            parallel = os.environ.get("SKLEARN_BUILD_PARALLEL")
-            if parallel:
-                self.parallel = int(parallel)
-        if self.parallel:
-            print("setting parallel=%d " % self.parallel)
-
-    def build_extensions(self):
-        from sklearn._build_utils.openmp_helpers import get_openmp_flag
-
-        # Always use NumPy 1.7 C API for all compiled extensions.
-        # See: https://numpy.org/doc/stable/reference/c-api/deprecations.html
-        DEFINE_MACRO_NUMPY_C_API = (
-            "NPY_NO_DEPRECATED_API",
-            "NPY_1_7_API_VERSION",
-        )
-        for ext in self.extensions:
-            ext.define_macros.append(DEFINE_MACRO_NUMPY_C_API)
-
-        if sklearn._OPENMP_SUPPORTED:
-            openmp_flag = get_openmp_flag()
-
-            for e in self.extensions:
-                e.extra_compile_args += openmp_flag
-                e.extra_link_args += openmp_flag
-
-        build_ext.build_extensions(self)
-
-    def run(self):
-        # Specifying `build_clib` allows running `python setup.py develop`
-        # fully from a fresh clone.
-        self.run_command("build_clib")
-        build_ext.run(self)
-
-
-cmdclass = {
-    "clean": CleanCommand,
-    "build_ext": build_ext_subclass,
-}
-
-
-def check_package_status(package, min_version):
-    """
-    Returns a dictionary containing a boolean specifying whether given package
-    is up-to-date, along with the version string (empty string if
-    not installed).
-    """
-    package_status = {}
-    try:
-        module = importlib.import_module(package)
-        package_version = module.__version__
-        package_status["up_to_date"] = parse_version(package_version) >= parse_version(
-            min_version
-        )
-        package_status["version"] = package_version
-    except ImportError:
-        traceback.print_exc()
-        package_status["up_to_date"] = False
-        package_status["version"] = ""
-
-    req_str = "scikit-learn requires {} >= {}.\n".format(package, min_version)
-
-    instructions = (
-        "Installation instructions are available on the "
-        "scikit-learn website: "
-        "https://scikit-learn.org/stable/install.html\n"
-    )
-
-    if package_status["up_to_date"] is False:
-        if package_status["version"]:
-            raise ImportError(
-                "Your installation of {} {} is out-of-date.\n{}{}".format(
-                    package, package_status["version"], req_str, instructions
-                )
-            )
-        else:
-            raise ImportError(
-                "{} is not installed.\n{}{}".format(package, req_str, instructions)
-            )
-
-
-extension_config = {
-    "__check_build": [
-        {"sources": ["_check_build.pyx"]},
-    ],
-    "": [
-        {"sources": ["_isotonic.pyx"]},
-    ],
-    "_loss": [
-        {"sources": ["_loss.pyx.tp"]},
-    ],
-    "cluster": [
-        {"sources": ["_dbscan_inner.pyx"], "language": "c++"},
-        {"sources": ["_hierarchical_fast.pyx"], "language": "c++", "include_np": True},
-        {"sources": ["_k_means_common.pyx"], "include_np": True},
-        {"sources": ["_k_means_lloyd.pyx"], "include_np": True},
-        {"sources": ["_k_means_elkan.pyx"], "include_np": True},
-        {"sources": ["_k_means_minibatch.pyx"], "include_np": True},
-    ],
-    "cluster._hdbscan": [
-        {"sources": ["_linkage.pyx"], "include_np": True},
-        {"sources": ["_reachability.pyx"], "include_np": True},
-        {"sources": ["_tree.pyx"], "include_np": True},
-    ],
-    "datasets": [
-        {
-            "sources": ["_svmlight_format_fast.pyx"],
-            "include_np": True,
-            "compile_for_pypy": False,
-        }
-    ],
-    "decomposition": [
-        {"sources": ["_online_lda_fast.pyx"]},
-        {"sources": ["_cdnmf_fast.pyx"], "include_np": True},
-    ],
-    "ensemble": [
-        {"sources": ["_gradient_boosting.pyx"], "include_np": True},
-    ],
-    "ensemble._hist_gradient_boosting": [
-        {"sources": ["_gradient_boosting.pyx"]},
-        {"sources": ["histogram.pyx"]},
-        {"sources": ["splitting.pyx"]},
-        {"sources": ["_binning.pyx"]},
-        {"sources": ["_predictor.pyx"]},
-        {"sources": ["_bitset.pyx"]},
-        {"sources": ["common.pyx"]},
-    ],
-    "feature_extraction": [
-        {"sources": ["_hashing_fast.pyx"], "language": "c++", "include_np": True},
-    ],
-    "linear_model": [
-        {"sources": ["_cd_fast.pyx"]},
-        {"sources": ["_sgd_fast.pyx.tp"]},
-        {"sources": ["_sag_fast.pyx.tp"]},
-    ],
-    "manifold": [
-        {"sources": ["_utils.pyx"]},
-        {"sources": ["_barnes_hut_tsne.pyx"], "include_np": True},
-    ],
-    "metrics": [
-        {"sources": ["_pairwise_fast.pyx"]},
-        {
-            "sources": ["_dist_metrics.pyx.tp", "_dist_metrics.pxd.tp"],
-            "include_np": True,
-        },
-    ],
-    "metrics.cluster": [
-        {"sources": ["_expected_mutual_info_fast.pyx"]},
-    ],
-    "metrics._pairwise_distances_reduction": [
-        {
-            "sources": ["_datasets_pair.pyx.tp", "_datasets_pair.pxd.tp"],
-            "language": "c++",
-            "include_np": True,
-            "extra_compile_args": ["-std=c++11"],
-        },
-        {
-            "sources": ["_middle_term_computer.pyx.tp", "_middle_term_computer.pxd.tp"],
-            "language": "c++",
-            "extra_compile_args": ["-std=c++11"],
-        },
-        {
-            "sources": ["_base.pyx.tp", "_base.pxd.tp"],
-            "language": "c++",
-            "include_np": True,
-            "extra_compile_args": ["-std=c++11"],
-        },
-        {
-            "sources": ["_argkmin.pyx.tp", "_argkmin.pxd.tp"],
-            "language": "c++",
-            "include_np": True,
-            "extra_compile_args": ["-std=c++11"],
-        },
-        {
-            "sources": ["_argkmin_classmode.pyx.tp"],
-            "language": "c++",
-            "include_np": True,
-            "extra_compile_args": ["-std=c++11"],
-        },
-        {
-            "sources": ["_radius_neighbors.pyx.tp", "_radius_neighbors.pxd.tp"],
-            "language": "c++",
-            "include_np": True,
-            "extra_compile_args": ["-std=c++11"],
-        },
-        {
-            "sources": ["_radius_neighbors_classmode.pyx.tp"],
-            "language": "c++",
-            "include_np": True,
-            "extra_compile_args": ["-std=c++11"],
-        },
-    ],
-    "preprocessing": [
-        {"sources": ["_csr_polynomial_expansion.pyx"]},
-        {
-            "sources": ["_target_encoder_fast.pyx"],
-            "language": "c++",
-            "extra_compile_args": ["-std=c++11"],
-        },
-    ],
-    "neighbors": [
-        {"sources": ["_binary_tree.pxi.tp"], "include_np": True},
-        {"sources": ["_ball_tree.pyx.tp"], "include_np": True},
-        {"sources": ["_kd_tree.pyx.tp"], "include_np": True},
-        {"sources": ["_partition_nodes.pyx"], "language": "c++", "include_np": True},
-        {"sources": ["_quad_tree.pyx"], "include_np": True},
-    ],
-    "svm": [
-        {
-            "sources": ["_newrand.pyx"],
-            "include_dirs": [join("src", "newrand")],
-            "language": "c++",
-            # Use C++11 random number generator fix
-            "extra_compile_args": ["-std=c++11"],
-        },
-        {
-            "sources": ["_libsvm.pyx"],
-            "depends": [
-                join("src", "libsvm", "libsvm_helper.c"),
-                join("src", "libsvm", "libsvm_template.cpp"),
-                join("src", "libsvm", "svm.cpp"),
-                join("src", "libsvm", "svm.h"),
-                join("src", "newrand", "newrand.h"),
-            ],
-            "include_dirs": [
-                join("src", "libsvm"),
-                join("src", "newrand"),
-            ],
-            "libraries": ["libsvm-skl"],
-            "extra_link_args": ["-lstdc++"],
-        },
-        {
-            "sources": ["_liblinear.pyx"],
-            "libraries": ["liblinear-skl"],
-            "include_dirs": [
-                join("src", "liblinear"),
-                join("src", "newrand"),
-                join("..", "utils"),
-            ],
-            "depends": [
-                join("src", "liblinear", "tron.h"),
-                join("src", "liblinear", "linear.h"),
-                join("src", "liblinear", "liblinear_helper.c"),
-                join("src", "newrand", "newrand.h"),
-            ],
-            "extra_link_args": ["-lstdc++"],
-        },
-        {
-            "sources": ["_libsvm_sparse.pyx"],
-            "libraries": ["libsvm-skl"],
-            "include_dirs": [
-                join("src", "libsvm"),
-                join("src", "newrand"),
-            ],
-            "depends": [
-                join("src", "libsvm", "svm.h"),
-                join("src", "newrand", "newrand.h"),
-                join("src", "libsvm", "libsvm_sparse_helper.c"),
-            ],
-            "extra_link_args": ["-lstdc++"],
-        },
-    ],
-    "tree": [
-        {
-            "sources": ["_tree.pyx"],
-            "language": "c++",
-            "include_np": True,
-            "optimization_level": "O3",
-        },
-        {"sources": ["_splitter.pyx"], "include_np": True, "optimization_level": "O3"},
-        {"sources": ["_criterion.pyx"], "include_np": True, "optimization_level": "O3"},
-        {"sources": ["_utils.pyx"], "include_np": True, "optimization_level": "O3"},
-    ],
-    "utils": [
-        {"sources": ["sparsefuncs_fast.pyx"]},
-        {"sources": ["_cython_blas.pyx"]},
-        {"sources": ["arrayfuncs.pyx"]},
-        {
-            "sources": ["murmurhash.pyx", join("src", "MurmurHash3.cpp")],
-            "include_dirs": ["src"],
-        },
-        {"sources": ["_fast_dict.pyx"], "language": "c++"},
-        {"sources": ["_openmp_helpers.pyx"]},
-        {"sources": ["_seq_dataset.pyx.tp", "_seq_dataset.pxd.tp"]},
-        {"sources": ["_weight_vector.pyx.tp", "_weight_vector.pxd.tp"]},
-        {"sources": ["_random.pyx"]},
-        {"sources": ["_typedefs.pyx"]},
-        {"sources": ["_heap.pyx"]},
-        {"sources": ["_sorting.pyx"]},
-        {"sources": ["_vector_sentinel.pyx"], "language": "c++", "include_np": True},
-        {"sources": ["_isfinite.pyx"]},
-    ],
-}
-
-# Paths in `libraries` must be relative to the root directory because `libraries` is
-# passed directly to `setup`
-libraries = [
-    (
-        "libsvm-skl",
-        {
-            "sources": [
-                join("sklearn", "svm", "src", "libsvm", "libsvm_template.cpp"),
-            ],
-            "depends": [
-                join("sklearn", "svm", "src", "libsvm", "svm.cpp"),
-                join("sklearn", "svm", "src", "libsvm", "svm.h"),
-                join("sklearn", "svm", "src", "newrand", "newrand.h"),
-            ],
-            # Use C++11 to use the random number generator fix
-            "extra_compiler_args": ["-std=c++11"],
-            "extra_link_args": ["-lstdc++"],
-        },
-    ),
-    (
-        "liblinear-skl",
-        {
-            "sources": [
-                join("sklearn", "svm", "src", "liblinear", "linear.cpp"),
-                join("sklearn", "svm", "src", "liblinear", "tron.cpp"),
-            ],
-            "depends": [
-                join("sklearn", "svm", "src", "liblinear", "linear.h"),
-                join("sklearn", "svm", "src", "liblinear", "tron.h"),
-                join("sklearn", "svm", "src", "newrand", "newrand.h"),
-            ],
-            # Use C++11 to use the random number generator fix
-            "extra_compiler_args": ["-std=c++11"],
-            "extra_link_args": ["-lstdc++"],
-        },
-    ),
-]
-
-
-def configure_extension_modules():
-    # Skip cythonization as we do not want to include the generated
-    # C/C++ files in the release tarballs as they are not necessarily
-    # forward compatible with future versions of Python for instance.
-    if "sdist" in sys.argv or "--help" in sys.argv:
-        return []
-
-    import numpy
-
-    from sklearn._build_utils import cythonize_extensions, gen_from_templates
-
-    is_pypy = platform.python_implementation() == "PyPy"
-    np_include = numpy.get_include()
-    default_optimization_level = "O2"
-
-    if os.name == "posix":
-        default_libraries = ["m"]
-    else:
-        default_libraries = []
-
-    default_extra_compile_args = []
-    build_with_debug_symbols = (
-        os.environ.get("SKLEARN_BUILD_ENABLE_DEBUG_SYMBOLS", "0") != "0"
-    )
-    if os.name == "posix":
-        if build_with_debug_symbols:
-            default_extra_compile_args.append("-g")
-        else:
-            # Setting -g0 will strip symbols, reducing the binary size of extensions
-            default_extra_compile_args.append("-g0")
-
-    cython_exts = []
-    for submodule, extensions in extension_config.items():
-        submodule_parts = submodule.split(".")
-        parent_dir = join("sklearn", *submodule_parts)
-        for extension in extensions:
-            if is_pypy and not extension.get("compile_for_pypy", True):
-                continue
-
-            # Generate files with Tempita
-            tempita_sources = []
-            sources = []
-            for source in extension["sources"]:
-                source = join(parent_dir, source)
-                new_source_path, path_ext = os.path.splitext(source)
-
-                if path_ext != ".tp":
-                    sources.append(source)
-                    continue
-
-                # `source` is a Tempita file
-                tempita_sources.append(source)
-
-                # Only include source files that are pyx files
-                if os.path.splitext(new_source_path)[-1] == ".pyx":
-                    sources.append(new_source_path)
-
-            gen_from_templates(tempita_sources)
-
-            # Do not progress if we only have a tempita file which we don't
-            # want to include like the .pxi.tp extension. In such a case
-            # sources would be empty.
-            if not sources:
-                continue
-
-            # By convention, our extensions always use the name of the first source
-            source_name = os.path.splitext(os.path.basename(sources[0]))[0]
-            if submodule:
-                name_parts = ["sklearn", submodule, source_name]
-            else:
-                name_parts = ["sklearn", source_name]
-            name = ".".join(name_parts)
-
-            # Make paths start from the root directory
-            include_dirs = [
-                join(parent_dir, include_dir)
-                for include_dir in extension.get("include_dirs", [])
-            ]
-            if extension.get("include_np", False):
-                include_dirs.append(np_include)
-
-            depends = [
-                join(parent_dir, depend) for depend in extension.get("depends", [])
-            ]
-
-            extra_compile_args = (
-                extension.get("extra_compile_args", []) + default_extra_compile_args
-            )
-            optimization_level = extension.get(
-                "optimization_level", default_optimization_level
-            )
-            if os.name == "posix":
-                extra_compile_args.append(f"-{optimization_level}")
-            else:
-                extra_compile_args.append(f"/{optimization_level}")
-
-            libraries_ext = extension.get("libraries", []) + default_libraries
-
-            new_ext = Extension(
-                name=name,
-                sources=sources,
-                language=extension.get("language", None),
-                include_dirs=include_dirs,
-                libraries=libraries_ext,
-                depends=depends,
-                extra_link_args=extension.get("extra_link_args", None),
-                extra_compile_args=extra_compile_args,
-            )
-            cython_exts.append(new_ext)
-
-    return cythonize_extensions(cython_exts)
-
-
-def setup_package():
-    python_requires = ">=3.9"
-    required_python_version = (3, 9)
-
-    metadata = dict(
-        name=DISTNAME,
-        maintainer=MAINTAINER,
-        maintainer_email=MAINTAINER_EMAIL,
-        description=DESCRIPTION,
-        license=LICENSE,
-        url=URL,
-        download_url=DOWNLOAD_URL,
-        project_urls=PROJECT_URLS,
-        version=VERSION,
-        long_description=LONG_DESCRIPTION,
-        classifiers=[
-            "Intended Audience :: Science/Research",
-            "Intended Audience :: Developers",
-            "License :: OSI Approved :: BSD License",
-            "Programming Language :: C",
-            "Programming Language :: Python",
-            "Topic :: Software Development",
-            "Topic :: Scientific/Engineering",
-            "Development Status :: 5 - Production/Stable",
-            "Operating System :: Microsoft :: Windows",
-            "Operating System :: POSIX",
-            "Operating System :: Unix",
-            "Operating System :: MacOS",
-            "Programming Language :: Python :: 3",
-            "Programming Language :: Python :: 3.9",
-            "Programming Language :: Python :: 3.10",
-            "Programming Language :: Python :: 3.11",
-            "Programming Language :: Python :: 3.12",
-            "Programming Language :: Python :: Implementation :: CPython",
-            "Programming Language :: Python :: Implementation :: PyPy",
-        ],
-        cmdclass=cmdclass,
-        python_requires=python_requires,
-        install_requires=min_deps.tag_to_packages["install"],
-        package_data={
-            "": ["*.csv", "*.gz", "*.txt", "*.pxd", "*.rst", "*.jpg", "*.css"]
-        },
-        zip_safe=False,  # the package can run out of an .egg file
-        extras_require={
-            key: min_deps.tag_to_packages[key]
-            for key in ["examples", "docs", "tests", "benchmark"]
-        },
-    )
-
-    commands = [arg for arg in sys.argv[1:] if not arg.startswith("-")]
-    if not all(
-        command in ("egg_info", "dist_info", "clean", "check") for command in commands
-    ):
-        if sys.version_info < required_python_version:
-            required_version = "%d.%d" % required_python_version
-            raise RuntimeError(
-                "Scikit-learn requires Python %s or later. The current"
-                " Python version is %s installed in %s."
-                % (required_version, platform.python_version(), sys.executable)
-            )
-
-        check_package_status("numpy", min_deps.NUMPY_MIN_VERSION)
-        check_package_status("scipy", min_deps.SCIPY_MIN_VERSION)
-
-        _check_cython_version()
-        metadata["ext_modules"] = configure_extension_modules()
-        metadata["libraries"] = libraries
-    setup(**metadata)
-
-
-if __name__ == "__main__":
-    setup_package()
diff --git a/sklearn/__check_build/__init__.py b/sklearn/__check_build/__init__.py
index ad1a3a818b14d..f8a739b694579 100644
--- a/sklearn/__check_build/__init__.py
+++ b/sklearn/__check_build/__init__.py
@@ -38,8 +38,8 @@ def raise_build_error(e):
 It seems that scikit-learn has not been built correctly.
 
 If you have installed scikit-learn from source, please do not forget
-to build the package before using it: run `python setup.py install` or
-`make` in the source directory.
+to build the package before using it. For detailed instructions, see:
+https://scikit-learn.org/dev/developers/advanced_installation.html#building-from-source
 %s"""
         % (e, local_dir, "".join(dir_content).strip(), msg)
     )
diff --git a/sklearn/__init__.py b/sklearn/__init__.py
index 30a3bbcdcbf66..a61a2afde8855 100644
--- a/sklearn/__init__.py
+++ b/sklearn/__init__.py
@@ -1,7 +1,4 @@
-"""
-The :mod:`sklearn` module includes functions to configure global settings and
-get information about the working environment.
-"""
+"""Configure global settings and get information about the working environment."""
 
 # Machine learning module for Python
 # ==================================
@@ -42,7 +39,7 @@
 # Dev branch marker is: 'X.Y.dev' or 'X.Y.devN' where N is an integer.
 # 'X.Y.dev0' is the canonical version of 'X.Y.dev'
 #
-__version__ = "1.5.dev0"
+__version__ = "1.6.dev0"
 
 
 # On OSX, we can get a runtime error due to multiple OpenMP libraries loaded
diff --git a/sklearn/_build_utils/__init__.py b/sklearn/_build_utils/__init__.py
index ceb72441000c3..e69de29bb2d1d 100644
--- a/sklearn/_build_utils/__init__.py
+++ b/sklearn/_build_utils/__init__.py
@@ -1,116 +0,0 @@
-"""
-Utilities useful during the build.
-"""
-
-# author: Andy Mueller, Gael Varoquaux
-# license: BSD
-
-
-import contextlib
-import os
-
-import sklearn
-
-from .._min_dependencies import CYTHON_MIN_VERSION
-from ..externals._packaging.version import parse
-from .openmp_helpers import check_openmp_support
-from .pre_build_helpers import basic_check_build
-
-DEFAULT_ROOT = "sklearn"
-
-
-def _check_cython_version():
-    message = (
-        "Please install Cython with a version >= {0} in order "
-        "to build a scikit-learn from source."
-    ).format(CYTHON_MIN_VERSION)
-    try:
-        import Cython
-    except ModuleNotFoundError as e:
-        # Re-raise with more informative error message instead:
-        raise ModuleNotFoundError(message) from e
-
-    if parse(Cython.__version__) < parse(CYTHON_MIN_VERSION):
-        message += " The current version of Cython is {} installed in {}.".format(
-            Cython.__version__, Cython.__path__
-        )
-        raise ValueError(message)
-
-
-def cythonize_extensions(extension):
-    """Check that a recent Cython is available and cythonize extensions"""
-    _check_cython_version()
-    from Cython.Build import cythonize
-
-    # Fast fail before cythonization if compiler fails compiling basic test
-    # code even without OpenMP
-    basic_check_build()
-
-    # check simple compilation with OpenMP. If it fails scikit-learn will be
-    # built without OpenMP and the test test_openmp_supported in the test suite
-    # will fail.
-    # `check_openmp_support` compiles a small test program to see if the
-    # compilers are properly configured to build with OpenMP. This is expensive
-    # and we only want to call this function once.
-    # The result of this check is cached as a private attribute on the sklearn
-    # module (only at build-time) to be used in the build_ext subclass defined
-    # in the top-level setup.py file to actually build the compiled extensions
-    # with OpenMP flags if needed.
-    sklearn._OPENMP_SUPPORTED = check_openmp_support()
-
-    n_jobs = 1
-    with contextlib.suppress(ImportError):
-        import joblib
-
-        n_jobs = joblib.cpu_count()
-
-    # Additional checks for Cython
-    cython_enable_debug_directives = (
-        os.environ.get("SKLEARN_ENABLE_DEBUG_CYTHON_DIRECTIVES", "0") != "0"
-    )
-
-    compiler_directives = {
-        "language_level": 3,
-        "boundscheck": cython_enable_debug_directives,
-        "wraparound": False,
-        "initializedcheck": False,
-        "nonecheck": False,
-        "cdivision": True,
-        "profile": False,
-    }
-
-    return cythonize(
-        extension,
-        nthreads=n_jobs,
-        compiler_directives=compiler_directives,
-        annotate=False,
-    )
-
-
-def gen_from_templates(templates):
-    """Generate cython files from a list of templates"""
-    # Lazy import because cython is not a runtime dependency.
-    from Cython import Tempita
-
-    for template in templates:
-        outfile = template.replace(".tp", "")
-
-        # if the template is not updated, no need to output the cython file
-        if not (
-            os.path.exists(outfile)
-            and os.stat(template).st_mtime < os.stat(outfile).st_mtime
-        ):
-            with open(template, "r") as f:
-                tmpl = f.read()
-
-            tmpl_ = Tempita.sub(tmpl)
-
-            warn_msg = (
-                "# WARNING: Do not edit this file directly.\n"
-                f"# It is automatically generated from {template!r}.\n"
-                "# Changes must be made there.\n\n"
-            )
-
-            with open(outfile, "w") as f:
-                f.write(warn_msg)
-                f.write(tmpl_)
diff --git a/sklearn/_build_utils/openmp_helpers.py b/sklearn/_build_utils/openmp_helpers.py
deleted file mode 100644
index ed9bf0ea3eea0..0000000000000
--- a/sklearn/_build_utils/openmp_helpers.py
+++ /dev/null
@@ -1,127 +0,0 @@
-"""Helpers for OpenMP support during the build."""
-
-# This code is adapted for a large part from the astropy openmp helpers, which
-# can be found at: https://github.com/astropy/extension-helpers/blob/master/extension_helpers/_openmp_helpers.py  # noqa
-
-
-import os
-import sys
-import textwrap
-import warnings
-
-from .pre_build_helpers import compile_test_program
-
-
-def get_openmp_flag():
-    if sys.platform == "win32":
-        return ["/openmp"]
-    elif sys.platform == "darwin" and "openmp" in os.getenv("CPPFLAGS", ""):
-        # -fopenmp can't be passed as compile flag when using Apple-clang.
-        # OpenMP support has to be enabled during preprocessing.
-        #
-        # For example, our macOS wheel build jobs use the following environment
-        # variables to build with Apple-clang and the brew installed "libomp":
-        #
-        # export CPPFLAGS="$CPPFLAGS -Xpreprocessor -fopenmp"
-        # export CFLAGS="$CFLAGS -I/usr/local/opt/libomp/include"
-        # export CXXFLAGS="$CXXFLAGS -I/usr/local/opt/libomp/include"
-        # export LDFLAGS="$LDFLAGS -Wl,-rpath,/usr/local/opt/libomp/lib
-        #                          -L/usr/local/opt/libomp/lib -lomp"
-        return []
-    # Default flag for GCC and clang:
-    return ["-fopenmp"]
-
-
-def check_openmp_support():
-    """Check whether OpenMP test code can be compiled and run"""
-    if "PYODIDE_PACKAGE_ABI" in os.environ:
-        # Pyodide doesn't support OpenMP
-        return False
-
-    code = textwrap.dedent(
-        """\
-        #include <omp.h>
-        #include <stdio.h>
-        int main(void) {
-        #pragma omp parallel
-        printf("nthreads=%d\\n", omp_get_num_threads());
-        return 0;
-        }
-        """
-    )
-
-    extra_preargs = os.getenv("LDFLAGS", None)
-    if extra_preargs is not None:
-        extra_preargs = extra_preargs.strip().split(" ")
-        # FIXME: temporary fix to link against system libraries on linux
-        # "-Wl,--sysroot=/" should be removed
-        extra_preargs = [
-            flag
-            for flag in extra_preargs
-            if flag.startswith(("-L", "-Wl,-rpath", "-l", "-Wl,--sysroot=/"))
-        ]
-
-    extra_postargs = get_openmp_flag()
-
-    openmp_exception = None
-    try:
-        output = compile_test_program(
-            code, extra_preargs=extra_preargs, extra_postargs=extra_postargs
-        )
-
-        if output and "nthreads=" in output[0]:
-            nthreads = int(output[0].strip().split("=")[1])
-            openmp_supported = len(output) == nthreads
-        elif "PYTHON_CROSSENV" in os.environ:
-            # Since we can't run the test program when cross-compiling
-            # assume that openmp is supported if the program can be
-            # compiled.
-            openmp_supported = True
-        else:
-            openmp_supported = False
-
-    except Exception as exception:
-        # We could be more specific and only catch: CompileError, LinkError,
-        # and subprocess.CalledProcessError.
-        # setuptools introduced CompileError and LinkError, but that requires
-        # version 61.1. Even the latest version of Ubuntu (22.04LTS) only
-        # ships with 59.6. So for now we catch all exceptions and reraise a
-        # generic exception with the original error message instead:
-        openmp_supported = False
-        openmp_exception = exception
-
-    if not openmp_supported:
-        if os.getenv("SKLEARN_FAIL_NO_OPENMP"):
-            raise Exception(
-                "Failed to build scikit-learn with OpenMP support"
-            ) from openmp_exception
-        else:
-            message = textwrap.dedent(
-                """
-
-                                ***********
-                                * WARNING *
-                                ***********
-
-                It seems that scikit-learn cannot be built with OpenMP.
-
-                - Make sure you have followed the installation instructions:
-
-                    https://scikit-learn.org/dev/developers/advanced_installation.html
-
-                - If your compiler supports OpenMP but you still see this
-                  message, please submit a bug report at:
-
-                    https://github.com/scikit-learn/scikit-learn/issues
-
-                - The build will continue with OpenMP-based parallelism
-                  disabled. Note however that some estimators will run in
-                  sequential mode instead of leveraging thread-based
-                  parallelism.
-
-                                    ***
-                """
-            )
-            warnings.warn(message)
-
-    return openmp_supported
diff --git a/sklearn/_build_utils/pre_build_helpers.py b/sklearn/_build_utils/pre_build_helpers.py
deleted file mode 100644
index b73fa8658739f..0000000000000
--- a/sklearn/_build_utils/pre_build_helpers.py
+++ /dev/null
@@ -1,75 +0,0 @@
-"""Helpers to check build environment before actual build of scikit-learn"""
-
-import glob
-import os
-import subprocess
-import sys
-import tempfile
-import textwrap
-
-from setuptools.command.build_ext import customize_compiler, new_compiler
-
-
-def compile_test_program(code, extra_preargs=None, extra_postargs=None):
-    """Check that some C code can be compiled and run"""
-    ccompiler = new_compiler()
-    customize_compiler(ccompiler)
-
-    start_dir = os.path.abspath(".")
-
-    with tempfile.TemporaryDirectory() as tmp_dir:
-        try:
-            os.chdir(tmp_dir)
-
-            # Write test program
-            with open("test_program.c", "w") as f:
-                f.write(code)
-
-            os.mkdir("objects")
-
-            # Compile, test program
-            ccompiler.compile(
-                ["test_program.c"], output_dir="objects", extra_postargs=extra_postargs
-            )
-
-            # Link test program
-            objects = glob.glob(os.path.join("objects", "*" + ccompiler.obj_extension))
-            ccompiler.link_executable(
-                objects,
-                "test_program",
-                extra_preargs=extra_preargs,
-                extra_postargs=extra_postargs,
-            )
-
-            if "PYTHON_CROSSENV" not in os.environ:
-                # Run test program if not cross compiling
-                # will raise a CalledProcessError if return code was non-zero
-                output = subprocess.check_output("./test_program")
-                output = output.decode(sys.stdout.encoding or "utf-8").splitlines()
-            else:
-                # Return an empty output if we are cross compiling
-                # as we cannot run the test_program
-                output = []
-        except Exception:
-            raise
-        finally:
-            os.chdir(start_dir)
-
-    return output
-
-
-def basic_check_build():
-    """Check basic compilation and linking of C code"""
-    if "PYODIDE_PACKAGE_ABI" in os.environ:
-        # The following check won't work in pyodide
-        return
-
-    code = textwrap.dedent(
-        """\
-        #include <stdio.h>
-        int main(void) {
-        return 0;
-        }
-        """
-    )
-    compile_test_program(code)
diff --git a/sklearn/_build_utils/version.py b/sklearn/_build_utils/version.py
index 49a3cfb82bebd..124c6cc3a0cdc 100644
--- a/sklearn/_build_utils/version.py
+++ b/sklearn/_build_utils/version.py
@@ -1,4 +1,4 @@
-#!/usr/bin/env python
+#!/usr/bin/env python3
 """Extract version number from __init__.py"""
 
 import os
diff --git a/sklearn/_loss/_loss.pyx.tp b/sklearn/_loss/_loss.pyx.tp
index cdfea45058bb2..802ffdcc28c38 100644
--- a/sklearn/_loss/_loss.pyx.tp
+++ b/sklearn/_loss/_loss.pyx.tp
@@ -7,7 +7,7 @@ Template file to easily generate loops over samples using Tempita
 Generated file: _loss.pyx
 
 Each loss class is generated by a cdef functions on single samples.
-The keywords between double braces are substituted in setup.py.
+The keywords between double braces are substituted during the build.
 """
 
 doc_HalfSquaredError = (
diff --git a/sklearn/_loss/meson.build b/sklearn/_loss/meson.build
index 7802d1643df18..7978fa56139c6 100644
--- a/sklearn/_loss/meson.build
+++ b/sklearn/_loss/meson.build
@@ -8,11 +8,15 @@ _loss_pyx = custom_target(
   output: '_loss.pyx',
   input: '_loss.pyx.tp',
   command: [py, tempita, '@INPUT@', '-o', '@OUTDIR@'],
+  # TODO in principle this should go in py.exension_module below. This is
+  # temporary work-around for dependency issue with .pyx.tp files. For more
+  # details, see https://github.com/mesonbuild/meson/issues/13212
+  depends: _loss_cython_tree,
 )
 
 py.extension_module(
   '_loss',
-  [_loss_pyx, _loss_cython_tree],
+  _loss_pyx,
   cython_args: cython_args,
   install: true,
   subdir: 'sklearn/_loss',
diff --git a/sklearn/_min_dependencies.py b/sklearn/_min_dependencies.py
index b6e6e0792d0c5..9c108791b45bc 100644
--- a/sklearn/_min_dependencies.py
+++ b/sklearn/_min_dependencies.py
@@ -7,7 +7,7 @@
 NUMPY_MIN_VERSION = "1.19.5"
 SCIPY_MIN_VERSION = "1.6.0"
 JOBLIB_MIN_VERSION = "1.2.0"
-THREADPOOLCTL_MIN_VERSION = "2.0.0"
+THREADPOOLCTL_MIN_VERSION = "3.1.0"
 PYTEST_MIN_VERSION = "7.1.2"
 CYTHON_MIN_VERSION = "3.0.10"
 
@@ -21,7 +21,7 @@
     "joblib": (JOBLIB_MIN_VERSION, "install"),
     "threadpoolctl": (THREADPOOLCTL_MIN_VERSION, "install"),
     "cython": (CYTHON_MIN_VERSION, "build"),
-    "meson-python": ("0.15.0", "build"),
+    "meson-python": ("0.16.0", "build"),
     "matplotlib": ("3.3.4", "benchmark, docs, examples, tests"),
     "scikit-image": ("0.17.2", "docs, examples, tests"),
     "pandas": ("1.1.5", "benchmark, docs, examples, tests"),
@@ -31,19 +31,23 @@
     "pytest-cov": ("2.9.0", "tests"),
     "ruff": ("0.2.1", "tests"),
     "black": ("24.3.0", "tests"),
-    "mypy": ("1.3", "tests"),
+    "mypy": ("1.9", "tests"),
     "pyamg": ("4.0.0", "tests"),
-    "polars": ("0.19.12", "docs, tests"),
+    "polars": ("0.20.23", "docs, tests"),
     "pyarrow": ("12.0.0", "tests"),
-    "sphinx": ("6.0.0", "docs"),
+    "sphinx": ("7.3.7", "docs"),
     "sphinx-copybutton": ("0.5.2", "docs"),
-    "sphinx-gallery": ("0.15.0", "docs"),
+    "sphinx-gallery": ("0.16.0", "docs"),
     "numpydoc": ("1.2.0", "docs, tests"),
     "Pillow": ("7.1.2", "docs"),
     "pooch": ("1.6.0", "docs, examples, tests"),
-    "sphinx-prompt": ("1.3.0", "docs"),
-    "sphinxext-opengraph": ("0.4.2", "docs"),
+    "sphinx-prompt": ("1.4.0", "docs"),
+    "sphinxext-opengraph": ("0.9.1", "docs"),
     "plotly": ("5.14.0", "docs, examples"),
+    "sphinxcontrib-sass": ("0.3.4", "docs"),
+    "sphinx-remove-toctrees": ("1.0.0.post1", "docs"),
+    "sphinx-design": ("0.5.0", "docs"),
+    "pydata-sphinx-theme": ("0.15.3", "docs"),
     # XXX: Pin conda-lock to the latest released version (needs manual update
     # from time to time)
     "conda-lock": ("2.5.6", "maintenance"),
diff --git a/sklearn/base.py b/sklearn/base.py
index d0f861bd2278f..48b9081b8ade3 100644
--- a/sklearn/base.py
+++ b/sklearn/base.py
@@ -1,7 +1,7 @@
-"""Base classes for all estimators."""
+"""Base classes for all estimators and various utility functions."""
 
-# Author: Gael Varoquaux <gael.varoquaux@normalesup.org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import copy
 import functools
@@ -1374,13 +1374,17 @@ def is_classifier(estimator):
     Examples
     --------
     >>> from sklearn.base import is_classifier
+    >>> from sklearn.cluster import KMeans
     >>> from sklearn.svm import SVC, SVR
     >>> classifier = SVC()
     >>> regressor = SVR()
+    >>> kmeans = KMeans()
     >>> is_classifier(classifier)
     True
     >>> is_classifier(regressor)
     False
+    >>> is_classifier(kmeans)
+    False
     """
     return getattr(estimator, "_estimator_type", None) == "classifier"
 
@@ -1401,17 +1405,54 @@ def is_regressor(estimator):
     Examples
     --------
     >>> from sklearn.base import is_regressor
+    >>> from sklearn.cluster import KMeans
     >>> from sklearn.svm import SVC, SVR
     >>> classifier = SVC()
     >>> regressor = SVR()
+    >>> kmeans = KMeans()
     >>> is_regressor(classifier)
     False
     >>> is_regressor(regressor)
     True
+    >>> is_regressor(kmeans)
+    False
     """
     return getattr(estimator, "_estimator_type", None) == "regressor"
 
 
+def is_clusterer(estimator):
+    """Return True if the given estimator is (probably) a clusterer.
+
+    .. versionadded:: 1.6
+
+    Parameters
+    ----------
+    estimator : object
+        Estimator object to test.
+
+    Returns
+    -------
+    out : bool
+        True if estimator is a clusterer and False otherwise.
+
+    Examples
+    --------
+    >>> from sklearn.base import is_clusterer
+    >>> from sklearn.cluster import KMeans
+    >>> from sklearn.svm import SVC, SVR
+    >>> classifier = SVC()
+    >>> regressor = SVR()
+    >>> kmeans = KMeans()
+    >>> is_clusterer(classifier)
+    False
+    >>> is_clusterer(regressor)
+    False
+    >>> is_clusterer(kmeans)
+    True
+    """
+    return getattr(estimator, "_estimator_type", None) == "clusterer"
+
+
 def is_outlier_detector(estimator):
     """Return True if the given estimator is (probably) an outlier detector.
 
diff --git a/sklearn/calibration.py b/sklearn/calibration.py
index c3f0b8ec59551..bc5ed634a3be4 100644
--- a/sklearn/calibration.py
+++ b/sklearn/calibration.py
@@ -1,11 +1,7 @@
-"""Calibration of predicted probabilities."""
+"""Methods for calibrating predicted probabilities."""
 
-# Author: Alexandre Gramfort <alexandre.gramfort@telecom-paristech.fr>
-#         Balazs Kegl <balazs.kegl@gmail.com>
-#         Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-#         Mathieu Blondel <mathieu@mblondel.org>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from inspect import signature
@@ -280,7 +276,7 @@ def _get_estimator(self):
         if self.estimator is None:
             # we want all classifiers that don't expose a random_state
             # to be deterministic (and we don't want to expose this one).
-            estimator = LinearSVC(random_state=0, dual="auto")
+            estimator = LinearSVC(random_state=0)
             if _routing_enabled():
                 estimator.set_fit_request(sample_weight=True)
         else:
@@ -388,9 +384,7 @@ def fit(self, X, y, sample_weight=None, **fit_params):
                 n_folds = self.cv.n_splits
             else:
                 n_folds = None
-            if n_folds and np.any(
-                [np.sum(y == class_) < n_folds for class_ in self.classes_]
-            ):
+            if n_folds and np.any(np.unique(y, return_counts=True)[1] < n_folds):
                 raise ValueError(
                     f"Requesting {n_folds}-fold "
                     "cross-validation but provided less than "
@@ -525,11 +519,11 @@ def get_metadata_routing(self):
             .add_self_request(self)
             .add(
                 estimator=self._get_estimator(),
-                method_mapping=MethodMapping().add(callee="fit", caller="fit"),
+                method_mapping=MethodMapping().add(caller="fit", callee="fit"),
             )
             .add(
                 splitter=self.cv,
-                method_mapping=MethodMapping().add(callee="split", caller="fit"),
+                method_mapping=MethodMapping().add(caller="fit", callee="split"),
             )
         )
         return router
diff --git a/sklearn/cluster/__init__.py b/sklearn/cluster/__init__.py
index f5d3104d816bf..5d497d2976ad1 100644
--- a/sklearn/cluster/__init__.py
+++ b/sklearn/cluster/__init__.py
@@ -1,7 +1,4 @@
-"""
-The :mod:`sklearn.cluster` module gathers popular unsupervised clustering
-algorithms.
-"""
+"""Popular unsupervised clustering algorithms."""
 
 from ._affinity_propagation import AffinityPropagation, affinity_propagation
 from ._agglomerative import (
diff --git a/sklearn/cluster/_affinity_propagation.py b/sklearn/cluster/_affinity_propagation.py
index 735e30d3ea4b2..fa5a3513ed899 100644
--- a/sklearn/cluster/_affinity_propagation.py
+++ b/sklearn/cluster/_affinity_propagation.py
@@ -1,9 +1,7 @@
 """Affinity Propagation clustering algorithm."""
 
-# Author: Alexandre Gramfort alexandre.gramfort@inria.fr
-#        Gael Varoquaux gael.varoquaux@normalesup.org
-
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from numbers import Integral, Real
@@ -504,13 +502,10 @@ def fit(self, X, y=None):
             Returns the instance itself.
         """
         if self.affinity == "precomputed":
-            accept_sparse = False
-        else:
-            accept_sparse = "csr"
-        X = self._validate_data(X, accept_sparse=accept_sparse)
-        if self.affinity == "precomputed":
-            self.affinity_matrix_ = X.copy() if self.copy else X
+            X = self._validate_data(X, copy=self.copy, force_writeable=True)
+            self.affinity_matrix_ = X
         else:  # self.affinity == "euclidean"
+            X = self._validate_data(X, accept_sparse="csr")
             self.affinity_matrix_ = -euclidean_distances(X, squared=True)
 
         if self.affinity_matrix_.shape[0] != self.affinity_matrix_.shape[1]:
diff --git a/sklearn/cluster/_agglomerative.py b/sklearn/cluster/_agglomerative.py
index fcecacc9ca57c..55215d2a0312c 100644
--- a/sklearn/cluster/_agglomerative.py
+++ b/sklearn/cluster/_agglomerative.py
@@ -755,8 +755,7 @@ def _hc_cut(n_clusters, children, n_leaves):
     if n_clusters > n_leaves:
         raise ValueError(
             "Cannot extract more clusters than samples: "
-            "%s clusters where given for a tree with %s leaves."
-            % (n_clusters, n_leaves)
+            f"{n_clusters} clusters were given for a tree with {n_leaves} leaves."
         )
     # In this function, we store nodes as a heap to avoid recomputing
     # the max of the nodes: the first element is always the smallest
@@ -818,6 +817,10 @@ class AgglomerativeClustering(ClusterMixin, BaseEstimator):
         `kneighbors_graph`. Default is ``None``, i.e, the
         hierarchical clustering algorithm is unstructured.
 
+        For an example of connectivity matrix using
+        :class:`~sklearn.neighbors.kneighbors_graph`, see
+        :ref:`sphx_glr_auto_examples_cluster_plot_agglomerative_clustering.py`.
+
     compute_full_tree : 'auto' or bool, default='auto'
         Stop early the construction of the tree at ``n_clusters``. This is
         useful to decrease computation time if the number of clusters is not
@@ -846,6 +849,9 @@ class AgglomerativeClustering(ClusterMixin, BaseEstimator):
         .. versionadded:: 0.20
             Added the 'single' option
 
+        For examples comparing different `linkage` criteria, see
+        :ref:`sphx_glr_auto_examples_cluster_plot_linkage_comparison.py`.
+
     distance_threshold : float, default=None
         The linkage distance threshold at or above which clusters will not be
         merged. If not ``None``, ``n_clusters`` must be ``None`` and
@@ -860,6 +866,9 @@ class AgglomerativeClustering(ClusterMixin, BaseEstimator):
 
         .. versionadded:: 0.24
 
+        For an example of dendrogram visualization, see
+        :ref:`sphx_glr_auto_examples_cluster_plot_agglomerative_dendrogram.py`.
+
     Attributes
     ----------
     n_clusters_ : int
diff --git a/sklearn/cluster/_bicluster.py b/sklearn/cluster/_bicluster.py
index b22f6a369fcc1..18d11e614509f 100644
--- a/sklearn/cluster/_bicluster.py
+++ b/sklearn/cluster/_bicluster.py
@@ -1,7 +1,7 @@
 """Spectral biclustering algorithms."""
 
-# Authors : Kemal Eren
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from abc import ABCMeta, abstractmethod
 from numbers import Integral
@@ -486,6 +486,9 @@ class SpectralBiclustering(BaseSpectral):
     array([1, 0], dtype=int32)
     >>> clustering
     SpectralBiclustering(n_clusters=2, random_state=0)
+
+    For a more detailed example, see
+    :ref:`sphx_glr_auto_examples_bicluster_plot_spectral_biclustering.py`
     """
 
     _parameter_constraints: dict = {
diff --git a/sklearn/cluster/_birch.py b/sklearn/cluster/_birch.py
index d62fb880ba8b2..81c26d51bbb71 100644
--- a/sklearn/cluster/_birch.py
+++ b/sklearn/cluster/_birch.py
@@ -1,7 +1,5 @@
-# Authors: Manoj Kumar <manojkumarsivaraj334@gmail.com>
-#          Alexandre Gramfort <alexandre.gramfort@telecom-paristech.fr>
-#          Joel Nothman <joel.nothman@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from math import sqrt
@@ -21,7 +19,7 @@
 from ..exceptions import ConvergenceWarning
 from ..metrics import pairwise_distances_argmin
 from ..metrics.pairwise import euclidean_distances
-from ..utils._param_validation import Interval
+from ..utils._param_validation import Hidden, Interval, StrOptions
 from ..utils.extmath import row_norms
 from ..utils.validation import check_is_fitted
 from . import AgglomerativeClustering
@@ -409,6 +407,10 @@ class Birch(
         Whether or not to make a copy of the given data. If set to False,
         the initial data will be overwritten.
 
+        .. deprecated:: 1.6
+            `copy` was deprecated in 1.6 and will be removed in 1.8. It has no effect
+            as the estimator does not perform in-place operations on the input data.
+
     Attributes
     ----------
     root_ : _CFNode
@@ -485,7 +487,7 @@ class Birch(
         "branching_factor": [Interval(Integral, 1, None, closed="neither")],
         "n_clusters": [None, ClusterMixin, Interval(Integral, 1, None, closed="left")],
         "compute_labels": ["boolean"],
-        "copy": ["boolean"],
+        "copy": ["boolean", Hidden(StrOptions({"deprecated"}))],
     }
 
     def __init__(
@@ -495,7 +497,7 @@ def __init__(
         branching_factor=50,
         n_clusters=3,
         compute_labels=True,
-        copy=True,
+        copy="deprecated",
     ):
         self.threshold = threshold
         self.branching_factor = branching_factor
@@ -527,10 +529,17 @@ def _fit(self, X, partial):
         has_root = getattr(self, "root_", None)
         first_call = not (partial and has_root)
 
+        if self.copy != "deprecated" and first_call:
+            warnings.warn(
+                "`copy` was deprecated in 1.6 and will be removed in 1.8 since it "
+                "has no effect internally. Simply leave this parameter to its default "
+                "value to avoid this warning.",
+                FutureWarning,
+            )
+
         X = self._validate_data(
             X,
             accept_sparse="csr",
-            copy=self.copy,
             reset=first_call,
             dtype=[np.float64, np.float32],
         )
@@ -637,17 +646,6 @@ def partial_fit(self, X=None, y=None):
         else:
             return self._fit(X, partial=True)
 
-    def _check_fit(self, X):
-        check_is_fitted(self)
-
-        if (
-            hasattr(self, "subcluster_centers_")
-            and X.shape[1] != self.subcluster_centers_.shape[1]
-        ):
-            raise ValueError(
-                "Training data and predicted data do not have same number of features."
-            )
-
     def predict(self, X):
         """
         Predict data using the ``centroids_`` of subclusters.
diff --git a/sklearn/cluster/_dbscan.py b/sklearn/cluster/_dbscan.py
index 0b117717297de..e94f8e113f43a 100644
--- a/sklearn/cluster/_dbscan.py
+++ b/sklearn/cluster/_dbscan.py
@@ -2,11 +2,8 @@
 DBSCAN: Density-Based Spatial Clustering of Applications with Noise
 """
 
-# Author: Robert Layton <robertlayton@gmail.com>
-#         Joel Nothman <joel.nothman@gmail.com>
-#         Lars Buitinck
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from numbers import Integral, Real
diff --git a/sklearn/cluster/_feature_agglomeration.py b/sklearn/cluster/_feature_agglomeration.py
index 218db48ad2331..fccc6c1931cf0 100644
--- a/sklearn/cluster/_feature_agglomeration.py
+++ b/sklearn/cluster/_feature_agglomeration.py
@@ -3,16 +3,16 @@
 agglomeration.
 """
 
-# Author: V. Michel, A. Gramfort
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
-import warnings
 
 import numpy as np
 from scipy.sparse import issparse
 
 from ..base import TransformerMixin
 from ..utils import metadata_routing
+from ..utils.deprecation import _deprecate_Xt_in_inverse_transform
 from ..utils.validation import check_is_fitted
 
 ###############################################################################
@@ -25,9 +25,9 @@ class AgglomerationTransform(TransformerMixin):
     """
 
     # This prevents ``set_split_inverse_transform`` to be generated for the
-    # non-standard ``Xred`` arg on ``inverse_transform``.
-    # TODO(1.5): remove when Xred is removed for inverse_transform.
-    __metadata_request__inverse_transform = {"Xred": metadata_routing.UNUSED}
+    # non-standard ``Xt`` arg on ``inverse_transform``.
+    # TODO(1.7): remove when Xt is removed for inverse_transform.
+    __metadata_request__inverse_transform = {"Xt": metadata_routing.UNUSED}
 
     def transform(self, X):
         """
@@ -63,19 +63,20 @@ def transform(self, X):
             nX = np.array(nX).T
         return nX
 
-    def inverse_transform(self, Xt=None, Xred=None):
+    def inverse_transform(self, X=None, *, Xt=None):
         """
         Inverse the transformation and return a vector of size `n_features`.
 
         Parameters
         ----------
-        Xt : array-like of shape (n_samples, n_clusters) or (n_clusters,)
+        X : array-like of shape (n_samples, n_clusters) or (n_clusters,)
             The values to be assigned to each cluster of samples.
 
-        Xred : deprecated
-            Use `Xt` instead.
+        Xt : array-like of shape (n_samples, n_clusters) or (n_clusters,)
+            The values to be assigned to each cluster of samples.
 
-            .. deprecated:: 1.3
+            .. deprecated:: 1.5
+                `Xt` was deprecated in 1.5 and will be removed in 1.7. Use `X` instead.
 
         Returns
         -------
@@ -83,23 +84,9 @@ def inverse_transform(self, Xt=None, Xred=None):
             A vector of size `n_samples` with the values of `Xred` assigned to
             each of the cluster of samples.
         """
-        if Xt is None and Xred is None:
-            raise TypeError("Missing required positional argument: Xt")
-
-        if Xred is not None and Xt is not None:
-            raise ValueError("Please provide only `Xt`, and not `Xred`.")
-
-        if Xred is not None:
-            warnings.warn(
-                (
-                    "Input argument `Xred` was renamed to `Xt` in v1.3 and will be"
-                    " removed in v1.5."
-                ),
-                FutureWarning,
-            )
-            Xt = Xred
+        X = _deprecate_Xt_in_inverse_transform(X, Xt)
 
         check_is_fitted(self)
 
         unil, inverse = np.unique(self.labels_, return_inverse=True)
-        return Xt[..., inverse]
+        return X[..., inverse]
diff --git a/sklearn/cluster/_hdbscan/_reachability.pyx b/sklearn/cluster/_hdbscan/_reachability.pyx
index 7c37b795cbd14..86eb4612acc01 100644
--- a/sklearn/cluster/_hdbscan/_reachability.pyx
+++ b/sklearn/cluster/_hdbscan/_reachability.pyx
@@ -62,8 +62,8 @@ def mutual_reachability_graph(
         `CSR` format.
 
     min_samples : int, default=5
-        The number of points in a neighbourhood for a point to be considered
-        a core point.
+        The parameter `k` used to calculate the distance between a point
+        `x_p` and its k-th nearest neighbor.
 
     max_distance : float, default=0.0
         The distance which `np.inf` is replaced with. When the true mutual-
diff --git a/sklearn/cluster/_hdbscan/hdbscan.py b/sklearn/cluster/_hdbscan/hdbscan.py
index e77baaf4b1146..8caa639a6de69 100644
--- a/sklearn/cluster/_hdbscan/hdbscan.py
+++ b/sklearn/cluster/_hdbscan/hdbscan.py
@@ -45,6 +45,7 @@
 from ...base import BaseEstimator, ClusterMixin, _fit_context
 from ...metrics import pairwise_distances
 from ...metrics._dist_metrics import DistanceMetric
+from ...metrics.pairwise import _VALID_METRICS
 from ...neighbors import BallTree, KDTree, NearestNeighbors
 from ...utils._param_validation import Interval, StrOptions
 from ...utils.validation import _allclose_dense_sparse, _assert_all_finite
@@ -440,8 +441,8 @@ class HDBSCAN(ClusterMixin, BaseEstimator):
         as noise.
 
     min_samples : int, default=None
-        The number of samples in a neighborhood for a point
-        to be considered as a core point. This includes the point itself.
+        The parameter `k` used to calculate the distance between a point
+        `x_p` and its k-th nearest neighbor.
         When `None`, defaults to `min_cluster_size`.
 
     cluster_selection_epsilon : float, default=0.0
@@ -647,7 +648,10 @@ class HDBSCAN(ClusterMixin, BaseEstimator):
             None,
             Interval(Integral, left=1, right=None, closed="left"),
         ],
-        "metric": [StrOptions(FAST_METRICS | {"precomputed"}), callable],
+        "metric": [
+            StrOptions(FAST_METRICS | set(_VALID_METRICS) | {"precomputed"}),
+            callable,
+        ],
         "metric_params": [dict, None],
         "alpha": [Interval(Real, left=0, right=None, closed="neither")],
         # TODO(1.6): Remove "kdtree" and "balltree"  option
@@ -766,6 +770,7 @@ def fit(self, X, y=None):
                 X,
                 accept_sparse=["csr", "lil"],
                 dtype=np.float64,
+                force_writeable=True,
             )
         else:
             # Only non-sparse, precomputed distance matrices are handled here
@@ -773,7 +778,9 @@ def fit(self, X, y=None):
 
             # Perform data validation after removing infinite values (numpy.inf)
             # from the given distance matrix.
-            X = self._validate_data(X, force_all_finite=False, dtype=np.float64)
+            X = self._validate_data(
+                X, force_all_finite=False, dtype=np.float64, force_writeable=True
+            )
             if np.isnan(X).any():
                 # TODO: Support np.nan in Cython implementation for precomputed
                 # dense HDBSCAN
diff --git a/sklearn/cluster/_hdbscan/meson.build b/sklearn/cluster/_hdbscan/meson.build
index 85a61a73a1ed3..b6a11eda8bb71 100644
--- a/sklearn/cluster/_hdbscan/meson.build
+++ b/sklearn/cluster/_hdbscan/meson.build
@@ -1,5 +1,5 @@
 cluster_hdbscan_extension_metadata = {
-  '_linkage': {'sources': ['_linkage.pyx'] + metrics_cython_tree},
+  '_linkage': {'sources': ['_linkage.pyx', metrics_cython_tree]},
   '_reachability': {'sources': ['_reachability.pyx']},
   '_tree': {'sources': ['_tree.pyx']}
 }
diff --git a/sklearn/cluster/_k_means_common.pyx b/sklearn/cluster/_k_means_common.pyx
index 7c9c1bb54eaae..674d4026a6756 100644
--- a/sklearn/cluster/_k_means_common.pyx
+++ b/sklearn/cluster/_k_means_common.pyx
@@ -1,8 +1,5 @@
-# Author: Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#         Olivier Grisel <olivier.grisel@ensta.org>
-#         Lars Buitinck
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 from cython cimport floating
diff --git a/sklearn/cluster/_kmeans.py b/sklearn/cluster/_kmeans.py
index 178242e60be57..04ebf489dcdb3 100644
--- a/sklearn/cluster/_kmeans.py
+++ b/sklearn/cluster/_kmeans.py
@@ -1,15 +1,7 @@
 """K-means clustering."""
 
-# Authors: Gael Varoquaux <gael.varoquaux@normalesup.org>
-#          Thomas Rueckstiess <ruecksti@in.tum.de>
-#          James Bergstra <james.bergstra@umontreal.ca>
-#          Jan Schlueter <scikit-learn@jan-schlueter.de>
-#          Nelle Varoquaux
-#          Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#          Olivier Grisel <olivier.grisel@ensta.org>
-#          Mathieu Blondel <mathieu@mblondel.org>
-#          Robert Layton <robertlayton@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from abc import ABC, abstractmethod
@@ -31,7 +23,10 @@
 from ..utils._openmp_helpers import _openmp_effective_n_threads
 from ..utils._param_validation import Interval, StrOptions, validate_params
 from ..utils.extmath import row_norms, stable_cumsum
-from ..utils.fixes import threadpool_info, threadpool_limits
+from ..utils.parallel import (
+    _get_threadpool_controller,
+    _threadpool_controller_decorator,
+)
 from ..utils.sparsefuncs import mean_variance_axis
 from ..utils.sparsefuncs_fast import assign_rows_csr
 from ..utils.validation import (
@@ -622,6 +617,9 @@ def _kmeans_single_elkan(
     return labels, inertia, centers, i + 1
 
 
+# Threadpoolctl context to limit the number of threads in second level of
+# nested parallelism (i.e. BLAS) to avoid oversubscription.
+@_threadpool_controller_decorator(limits=1, user_api="blas")
 def _kmeans_single_lloyd(
     X,
     sample_weight,
@@ -697,59 +695,56 @@ def _kmeans_single_lloyd(
 
     strict_convergence = False
 
-    # Threadpoolctl context to limit the number of threads in second level of
-    # nested parallelism (i.e. BLAS) to avoid oversubscription.
-    with threadpool_limits(limits=1, user_api="blas"):
-        for i in range(max_iter):
-            lloyd_iter(
-                X,
-                sample_weight,
-                centers,
-                centers_new,
-                weight_in_clusters,
-                labels,
-                center_shift,
-                n_threads,
-            )
+    for i in range(max_iter):
+        lloyd_iter(
+            X,
+            sample_weight,
+            centers,
+            centers_new,
+            weight_in_clusters,
+            labels,
+            center_shift,
+            n_threads,
+        )
 
-            if verbose:
-                inertia = _inertia(X, sample_weight, centers, labels, n_threads)
-                print(f"Iteration {i}, inertia {inertia}.")
+        if verbose:
+            inertia = _inertia(X, sample_weight, centers, labels, n_threads)
+            print(f"Iteration {i}, inertia {inertia}.")
 
-            centers, centers_new = centers_new, centers
+        centers, centers_new = centers_new, centers
 
-            if np.array_equal(labels, labels_old):
-                # First check the labels for strict convergence.
+        if np.array_equal(labels, labels_old):
+            # First check the labels for strict convergence.
+            if verbose:
+                print(f"Converged at iteration {i}: strict convergence.")
+            strict_convergence = True
+            break
+        else:
+            # No strict convergence, check for tol based convergence.
+            center_shift_tot = (center_shift**2).sum()
+            if center_shift_tot <= tol:
                 if verbose:
-                    print(f"Converged at iteration {i}: strict convergence.")
-                strict_convergence = True
+                    print(
+                        f"Converged at iteration {i}: center shift "
+                        f"{center_shift_tot} within tolerance {tol}."
+                    )
                 break
-            else:
-                # No strict convergence, check for tol based convergence.
-                center_shift_tot = (center_shift**2).sum()
-                if center_shift_tot <= tol:
-                    if verbose:
-                        print(
-                            f"Converged at iteration {i}: center shift "
-                            f"{center_shift_tot} within tolerance {tol}."
-                        )
-                    break
 
-            labels_old[:] = labels
+        labels_old[:] = labels
 
-        if not strict_convergence:
-            # rerun E-step so that predicted labels match cluster centers
-            lloyd_iter(
-                X,
-                sample_weight,
-                centers,
-                centers,
-                weight_in_clusters,
-                labels,
-                center_shift,
-                n_threads,
-                update_centers=False,
-            )
+    if not strict_convergence:
+        # rerun E-step so that predicted labels match cluster centers
+        lloyd_iter(
+            X,
+            sample_weight,
+            centers,
+            centers,
+            weight_in_clusters,
+            labels,
+            center_shift,
+            n_threads,
+            update_centers=False,
+        )
 
     inertia = _inertia(X, sample_weight, centers, labels, n_threads)
 
@@ -826,14 +821,10 @@ def _labels_inertia(X, sample_weight, centers, n_threads=1, return_inertia=True)
     return labels
 
 
-def _labels_inertia_threadpool_limit(
-    X, sample_weight, centers, n_threads=1, return_inertia=True
-):
-    """Same as _labels_inertia but in a threadpool_limits context."""
-    with threadpool_limits(limits=1, user_api="blas"):
-        result = _labels_inertia(X, sample_weight, centers, n_threads, return_inertia)
-
-    return result
+# Same as _labels_inertia but in a threadpool_limits context.
+_labels_inertia_threadpool_limit = _threadpool_controller_decorator(
+    limits=1, user_api="blas"
+)(_labels_inertia)
 
 
 class _BaseKMeans(
@@ -926,7 +917,7 @@ def _check_mkl_vcomp(self, X, n_samples):
 
         n_active_threads = int(np.ceil(n_samples / CHUNK_SIZE))
         if n_active_threads < self._n_threads:
-            modules = threadpool_info()
+            modules = _get_threadpool_controller().info()
             has_vcomp = "vcomp" in [module["prefix"] for module in modules]
             has_mkl = ("mkl", "intel") in [
                 (module["internal_api"], module.get("threading_layer", None))
@@ -1070,7 +1061,7 @@ def fit_predict(self, X, y=None, sample_weight=None):
         """
         return self.fit(X, sample_weight=sample_weight).labels_
 
-    def predict(self, X, sample_weight="deprecated"):
+    def predict(self, X):
         """Predict the closest cluster each sample in X belongs to.
 
         In the vector quantization literature, `cluster_centers_` is called
@@ -1082,14 +1073,6 @@ def predict(self, X, sample_weight="deprecated"):
         X : {array-like, sparse matrix} of shape (n_samples, n_features)
             New data to predict.
 
-        sample_weight : array-like of shape (n_samples,), default=None
-            The weights for each observation in X. If None, all observations
-            are assigned equal weight.
-
-            .. deprecated:: 1.3
-               The parameter `sample_weight` is deprecated in version 1.3
-               and will be removed in 1.5.
-
         Returns
         -------
         labels : ndarray of shape (n_samples,)
@@ -1098,17 +1081,9 @@ def predict(self, X, sample_weight="deprecated"):
         check_is_fitted(self)
 
         X = self._check_test_data(X)
-        if not (isinstance(sample_weight, str) and sample_weight == "deprecated"):
-            warnings.warn(
-                (
-                    "'sample_weight' was deprecated in version 1.3 and "
-                    "will be removed in 1.5."
-                ),
-                FutureWarning,
-            )
-            sample_weight = _check_sample_weight(sample_weight, X, dtype=X.dtype)
-        else:
-            sample_weight = _check_sample_weight(None, X, dtype=X.dtype)
+
+        # sample weights are not used by predict but cython helpers expect an array
+        sample_weight = np.ones(X.shape[0], dtype=X.dtype)
 
         labels = _labels_inertia_threadpool_limit(
             X,
@@ -2164,7 +2139,7 @@ def fit(self, X, y=None, sample_weight=None):
 
         n_steps = (self.max_iter * n_samples) // self._batch_size
 
-        with threadpool_limits(limits=1, user_api="blas"):
+        with _get_threadpool_controller().limit(limits=1, user_api="blas"):
             # Perform the iterative optimization until convergence
             for i in range(n_steps):
                 # Sample a minibatch from the full dataset
@@ -2290,7 +2265,7 @@ def partial_fit(self, X, y=None, sample_weight=None):
             # Initialize number of samples seen since last reassignment
             self._n_since_last_reassign = 0
 
-        with threadpool_limits(limits=1, user_api="blas"):
+        with _get_threadpool_controller().limit(limits=1, user_api="blas"):
             _mini_batch_step(
                 X,
                 sample_weight=sample_weight,
diff --git a/sklearn/cluster/_mean_shift.py b/sklearn/cluster/_mean_shift.py
index fae11cca7df23..a99a607f3cf0d 100644
--- a/sklearn/cluster/_mean_shift.py
+++ b/sklearn/cluster/_mean_shift.py
@@ -122,7 +122,7 @@ def _mean_shift_single_seed(my_mean, X, nbrs, max_iter):
         my_mean = np.mean(points_within, axis=0)
         # If converged or at max_iter, adds the cluster
         if (
-            np.linalg.norm(my_mean - my_old_mean) < stop_thresh
+            np.linalg.norm(my_mean - my_old_mean) <= stop_thresh
             or completed_iterations == max_iter
         ):
             break
diff --git a/sklearn/cluster/_spectral.py b/sklearn/cluster/_spectral.py
index 91606056c17aa..6495ff883014b 100644
--- a/sklearn/cluster/_spectral.py
+++ b/sklearn/cluster/_spectral.py
@@ -1,10 +1,7 @@
 """Algorithms for spectral clustering"""
 
-# Author: Gael Varoquaux <gael.varoquaux@normalesup.org>
-#         Brian Cheung
-#         Wei LI <kuantkid@gmail.com>
-#         Andrew Knyazev <Andrew.Knyazev@ucdenver.edu>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from numbers import Integral, Real
diff --git a/sklearn/cluster/meson.build b/sklearn/cluster/meson.build
index 0e7113f59fd51..afc066797a659 100644
--- a/sklearn/cluster/meson.build
+++ b/sklearn/cluster/meson.build
@@ -2,7 +2,8 @@ cluster_extension_metadata = {
   '_dbscan_inner':
     {'sources': ['_dbscan_inner.pyx'], 'override_options': ['cython_language=cpp']},
   '_hierarchical_fast':
-    {'sources': ['_hierarchical_fast.pyx'] + metrics_cython_tree, 'override_options': ['cython_language=cpp']},
+    {'sources': ['_hierarchical_fast.pyx', metrics_cython_tree],
+     'override_options': ['cython_language=cpp']},
   '_k_means_common':
     {'sources': ['_k_means_common.pyx']},
   '_k_means_lloyd':
@@ -16,7 +17,7 @@ cluster_extension_metadata = {
 foreach ext_name, ext_dict : cluster_extension_metadata
   py.extension_module(
     ext_name,
-    ext_dict.get('sources') + [utils_cython_tree],
+    [ext_dict.get('sources'), utils_cython_tree],
     dependencies: [np_dep, openmp_dep],
     override_options : ext_dict.get('override_options', []),
     cython_args: cython_args,
diff --git a/sklearn/cluster/tests/test_birch.py b/sklearn/cluster/tests/test_birch.py
index fc1c702d1f462..bc87934adaecd 100644
--- a/sklearn/cluster/tests/test_birch.py
+++ b/sklearn/cluster/tests/test_birch.py
@@ -240,3 +240,11 @@ def test_both_subclusters_updated():
 
     # no error
     Birch(branching_factor=5, threshold=1e-5, n_clusters=None).fit(X)
+
+
+# TODO(1.8): Remove
+def test_birch_copy_deprecated():
+    X, _ = make_blobs(n_samples=80, n_features=4, random_state=0)
+    brc = Birch(n_clusters=4, copy=True)
+    with pytest.warns(FutureWarning, match="`copy` was deprecated"):
+        brc.fit(X)
diff --git a/sklearn/cluster/tests/test_feature_agglomeration.py b/sklearn/cluster/tests/test_feature_agglomeration.py
index abeb81dca50aa..488dd638ad125 100644
--- a/sklearn/cluster/tests/test_feature_agglomeration.py
+++ b/sklearn/cluster/tests/test_feature_agglomeration.py
@@ -59,23 +59,23 @@ def test_feature_agglomeration_feature_names_out():
     )
 
 
-# TODO(1.5): remove this test
-def test_inverse_transform_Xred_deprecation():
+# TODO(1.7): remove this test
+def test_inverse_transform_Xt_deprecation():
     X = np.array([0, 0, 1]).reshape(1, 3)  # (n_samples, n_features)
 
     est = FeatureAgglomeration(n_clusters=1, pooling_func=np.mean)
     est.fit(X)
-    Xt = est.transform(X)
+    X = est.transform(X)
 
     with pytest.raises(TypeError, match="Missing required positional argument"):
         est.inverse_transform()
 
-    with pytest.raises(ValueError, match="Please provide only"):
-        est.inverse_transform(Xt=Xt, Xred=Xt)
+    with pytest.raises(TypeError, match="Cannot use both X and Xt. Use X only."):
+        est.inverse_transform(X=X, Xt=X)
 
     with warnings.catch_warnings(record=True):
         warnings.simplefilter("error")
-        est.inverse_transform(Xt)
+        est.inverse_transform(X)
 
-    with pytest.warns(FutureWarning, match="Input argument `Xred` was renamed to `Xt`"):
-        est.inverse_transform(Xred=Xt)
+    with pytest.warns(FutureWarning, match="Xt was renamed X in version 1.5"):
+        est.inverse_transform(Xt=X)
diff --git a/sklearn/cluster/tests/test_hdbscan.py b/sklearn/cluster/tests/test_hdbscan.py
index d586d203747c2..f5a0cddb0187d 100644
--- a/sklearn/cluster/tests/test_hdbscan.py
+++ b/sklearn/cluster/tests/test_hdbscan.py
@@ -580,3 +580,23 @@ def test_hdbscan_error_precomputed_and_store_centers(store_centers):
     err_msg = "Cannot store centers when using a precomputed distance matrix."
     with pytest.raises(ValueError, match=err_msg):
         HDBSCAN(metric="precomputed", store_centers=store_centers).fit(X_dist)
+
+
+@pytest.mark.parametrize("valid_algo", ["auto", "brute"])
+def test_hdbscan_cosine_metric_valid_algorithm(valid_algo):
+    """Test that HDBSCAN works with the "cosine" metric when the algorithm is set
+    to "brute" or "auto".
+
+    Non-regression test for issue #28631
+    """
+    HDBSCAN(metric="cosine", algorithm=valid_algo).fit_predict(X)
+
+
+@pytest.mark.parametrize("invalid_algo", ["kd_tree", "ball_tree"])
+def test_hdbscan_cosine_metric_invalid_algorithm(invalid_algo):
+    """Test that HDBSCAN raises an informative error is raised when an unsupported
+    algorithm is used with the "cosine" metric.
+    """
+    hdbscan = HDBSCAN(metric="cosine", algorithm=invalid_algo)
+    with pytest.raises(ValueError, match="cosine is not a valid metric"):
+        hdbscan.fit_predict(X)
diff --git a/sklearn/cluster/tests/test_hierarchical.py b/sklearn/cluster/tests/test_hierarchical.py
index 0a139bf3c4571..a36e5537a3636 100644
--- a/sklearn/cluster/tests/test_hierarchical.py
+++ b/sklearn/cluster/tests/test_hierarchical.py
@@ -3,9 +3,8 @@
 
 """
 
-# Authors: Vincent Michel, 2010, Gael Varoquaux 2012,
-#          Matteo Visconti di Oleggio Castello 2014
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import itertools
 import shutil
 from functools import partial
diff --git a/sklearn/cluster/tests/test_k_means.py b/sklearn/cluster/tests/test_k_means.py
index 1f2f8c390c909..0ab602d32d133 100644
--- a/sklearn/cluster/tests/test_k_means.py
+++ b/sklearn/cluster/tests/test_k_means.py
@@ -31,7 +31,8 @@
     create_memmap_backed_data,
 )
 from sklearn.utils.extmath import row_norms
-from sklearn.utils.fixes import CSR_CONTAINERS, threadpool_limits
+from sklearn.utils.fixes import CSR_CONTAINERS
+from sklearn.utils.parallel import _get_threadpool_controller
 
 # non centered, sparse centers to check the
 centers = np.array(
@@ -201,19 +202,6 @@ def test_kmeans_convergence(algorithm, global_random_seed):
     assert km.n_iter_ < max_iter
 
 
-@pytest.mark.parametrize("Estimator", [KMeans, MiniBatchKMeans])
-def test_predict_sample_weight_deprecation_warning(Estimator):
-    X = np.random.rand(100, 2)
-    sample_weight = np.random.uniform(size=100)
-    kmeans = Estimator()
-    kmeans.fit(X, sample_weight=sample_weight)
-    warn_msg = (
-        "'sample_weight' was deprecated in version 1.3 and will be removed in 1.5."
-    )
-    with pytest.warns(FutureWarning, match=warn_msg):
-        kmeans.predict(X, sample_weight=sample_weight)
-
-
 @pytest.mark.parametrize("X_csr", X_as_any_csr)
 def test_minibatch_update_consistency(X_csr, global_random_seed):
     # Check that dense and sparse minibatch update give the same results
@@ -449,21 +437,24 @@ def test_minibatch_sensible_reassign(global_random_seed):
         n_clusters=20, batch_size=10, random_state=global_random_seed, init="random"
     ).fit(zeroed_X)
     # there should not be too many exact zero cluster centers
-    assert km.cluster_centers_.any(axis=1).sum() > 10
+    num_non_zero_clusters = km.cluster_centers_.any(axis=1).sum()
+    assert num_non_zero_clusters > 9, f"{num_non_zero_clusters=} is too small"
 
     # do the same with batch-size > X.shape[0] (regression test)
     km = MiniBatchKMeans(
         n_clusters=20, batch_size=200, random_state=global_random_seed, init="random"
     ).fit(zeroed_X)
     # there should not be too many exact zero cluster centers
-    assert km.cluster_centers_.any(axis=1).sum() > 10
+    num_non_zero_clusters = km.cluster_centers_.any(axis=1).sum()
+    assert num_non_zero_clusters > 9, f"{num_non_zero_clusters=} is too small"
 
     # do the same with partial_fit API
     km = MiniBatchKMeans(n_clusters=20, random_state=global_random_seed, init="random")
     for i in range(100):
         km.partial_fit(zeroed_X)
     # there should not be too many exact zero cluster centers
-    assert km.cluster_centers_.any(axis=1).sum() > 10
+    num_non_zero_clusters = km.cluster_centers_.any(axis=1).sum()
+    assert num_non_zero_clusters > 9, f"{num_non_zero_clusters=} is too small"
 
 
 @pytest.mark.parametrize(
@@ -980,13 +971,13 @@ def test_result_equal_in_diff_n_threads(Estimator, global_random_seed):
     rnd = np.random.RandomState(global_random_seed)
     X = rnd.normal(size=(50, 10))
 
-    with threadpool_limits(limits=1, user_api="openmp"):
+    with _get_threadpool_controller().limit(limits=1, user_api="openmp"):
         result_1 = (
             Estimator(n_clusters=n_clusters, random_state=global_random_seed)
             .fit(X)
             .labels_
         )
-    with threadpool_limits(limits=2, user_api="openmp"):
+    with _get_threadpool_controller().limit(limits=2, user_api="openmp"):
         result_2 = (
             Estimator(n_clusters=n_clusters, random_state=global_random_seed)
             .fit(X)
diff --git a/sklearn/cluster/tests/test_mean_shift.py b/sklearn/cluster/tests/test_mean_shift.py
index 265c72d0c4ce1..d2d73ba11a3ec 100644
--- a/sklearn/cluster/tests/test_mean_shift.py
+++ b/sklearn/cluster/tests/test_mean_shift.py
@@ -25,6 +25,15 @@
 )
 
 
+def test_convergence_of_1d_constant_data():
+    # Test convergence using 1D constant data
+    # Non-regression test for:
+    # https://github.com/scikit-learn/scikit-learn/issues/28926
+    model = MeanShift()
+    n_iter = model.fit(np.ones(10).reshape(-1, 1)).n_iter_
+    assert n_iter < model.max_iter
+
+
 def test_estimate_bandwidth():
     # Test estimate_bandwidth
     bandwidth = estimate_bandwidth(X, n_samples=200)
diff --git a/sklearn/cluster/tests/test_optics.py b/sklearn/cluster/tests/test_optics.py
index e2140cf0f8b2c..9c1c13a9e12e0 100644
--- a/sklearn/cluster/tests/test_optics.py
+++ b/sklearn/cluster/tests/test_optics.py
@@ -1,6 +1,5 @@
-# Authors: Shane Grigsby <refuge@rocktalus.com>
-#          Adrin Jalali <adrin.jalali@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import warnings
 
 import numpy as np
diff --git a/sklearn/compose/__init__.py b/sklearn/compose/__init__.py
index 7b137cdf9e07f..e6e8fc6fd2c1b 100644
--- a/sklearn/compose/__init__.py
+++ b/sklearn/compose/__init__.py
@@ -1,8 +1,8 @@
-"""Meta-estimators for building composite models with transformers
+"""Meta-estimators for building composite models with transformers.
 
 In addition to its current contents, this module will eventually be home to
-refurbished versions of Pipeline and FeatureUnion.
-
+refurbished versions of :class:`~sklearn.pipeline.Pipeline` and
+:class:`~sklearn.pipeline.FeatureUnion`.
 """
 
 from ._column_transformer import (
diff --git a/sklearn/compose/_column_transformer.py b/sklearn/compose/_column_transformer.py
index 96b0ff527b1f8..a5aa7db17d4ae 100644
--- a/sklearn/compose/_column_transformer.py
+++ b/sklearn/compose/_column_transformer.py
@@ -4,11 +4,10 @@
 different columns.
 """
 
-# Author: Andreas Mueller
-#         Joris Van den Bossche
-# License: BSD
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import warnings
-from collections import Counter
+from collections import Counter, UserList
 from itertools import chain
 from numbers import Integral, Real
 
@@ -18,9 +17,9 @@
 from ..base import TransformerMixin, _fit_context, clone
 from ..pipeline import _fit_transform_one, _name_estimators, _transform_one
 from ..preprocessing import FunctionTransformer
-from ..utils import Bunch, _safe_indexing
+from ..utils import Bunch
 from ..utils._estimator_html_repr import _VisualBlock
-from ..utils._indexing import _get_column_indices
+from ..utils._indexing import _determine_key_type, _get_column_indices, _safe_indexing
 from ..utils._metadata_requests import METHODS
 from ..utils._param_validation import HasMethods, Hidden, Interval, StrOptions
 from ..utils._set_output import (
@@ -143,6 +142,23 @@ class ColumnTransformer(TransformerMixin, _BaseComposition):
 
         .. versionadded:: 1.0
 
+    force_int_remainder_cols : bool, default=True
+        Force the columns of the last entry of `transformers_`, which
+        corresponds to the "remainder" transformer, to always be stored as
+        indices (int) rather than column names (str). See description of the
+        `transformers_` attribute for details.
+
+        .. note::
+            If you do not access the list of columns for the remainder columns
+            in the `transformers_` fitted attribute, you do not need to set
+            this parameter.
+
+        .. versionadded:: 1.5
+
+        .. versionchanged:: 1.7
+           The default value for `force_int_remainder_cols` will change from
+           `True` to `False` in version 1.7.
+
     Attributes
     ----------
     transformers_ : list
@@ -157,6 +173,17 @@ class ColumnTransformer(TransformerMixin, _BaseComposition):
         ``len(transformers_)==len(transformers)+1``, otherwise
         ``len(transformers_)==len(transformers)``.
 
+        .. versionchanged:: 1.5
+            If there are remaining columns and `force_int_remainder_cols` is
+            True, the remaining columns are always represented by their
+            positional indices in the input `X` (as in older versions). If
+            `force_int_remainder_cols` is False, the format attempts to match
+            that of the other transformers: if all columns were provided as
+            column names (`str`), the remaining columns are stored as column
+            names; if all columns were provided as mask arrays (`bool`), so are
+            the remaining columns; in all other cases the remaining columns are
+            stored as indices (`int`).
+
     named_transformers_ : :class:`~sklearn.utils.Bunch`
         Read-only attribute to access any transformer by given name.
         Keys are transformer names and values are the fitted transformer
@@ -256,6 +283,7 @@ class ColumnTransformer(TransformerMixin, _BaseComposition):
         "transformer_weights": [dict, None],
         "verbose": ["verbose"],
         "verbose_feature_names_out": ["boolean"],
+        "force_int_remainder_cols": ["boolean"],
     }
 
     def __init__(
@@ -268,6 +296,7 @@ def __init__(
         transformer_weights=None,
         verbose=False,
         verbose_feature_names_out=True,
+        force_int_remainder_cols=True,
     ):
         self.transformers = transformers
         self.remainder = remainder
@@ -276,6 +305,7 @@ def __init__(
         self.transformer_weights = transformer_weights
         self.verbose = verbose
         self.verbose_feature_names_out = verbose_feature_names_out
+        self.force_int_remainder_cols = force_int_remainder_cols
 
     @property
     def _transformers(self):
@@ -314,7 +344,7 @@ def set_output(self, *, transform=None):
 
         Parameters
         ----------
-        transform : {"default", "pandas"}, default=None
+        transform : {"default", "pandas", "polars"}, default=None
             Configure output of `transform` and `fit_transform`.
 
             - `"default"`: Default output format of a transformer
@@ -389,7 +419,7 @@ def set_params(self, **kwargs):
 
     def _iter(self, fitted, column_as_labels, skip_drop, skip_empty_columns):
         """
-        Generate (name, trans, column, weight) tuples.
+        Generate (name, trans, columns, weight) tuples.
 
 
         Parameters
@@ -429,6 +459,14 @@ def _iter(self, fitted, column_as_labels, skip_drop, skip_empty_columns):
             # add transformer tuple for remainder
             if self._remainder[2]:
                 transformers = chain(transformers, [self._remainder])
+
+        # We want the warning about the future change of the remainder
+        # columns dtype to be shown only when a user accesses them
+        # directly, not when they are used by the ColumnTransformer itself.
+        # We disable warnings here; they are enabled when setting
+        # self.transformers_.
+        transformers = _with_dtype_warning_enabled_set_to(False, transformers)
+
         get_weight = (self.transformer_weights or {}).get
 
         for name, trans, columns in transformers:
@@ -506,8 +544,30 @@ def _validate_remainder(self, X):
         """
         cols = set(chain(*self._transformer_to_input_indices.values()))
         remaining = sorted(set(range(self.n_features_in_)) - cols)
-        self._remainder = ("remainder", self.remainder, remaining)
         self._transformer_to_input_indices["remainder"] = remaining
+        remainder_cols = self._get_remainder_cols(remaining)
+        self._remainder = ("remainder", self.remainder, remainder_cols)
+
+    def _get_remainder_cols_dtype(self):
+        try:
+            all_dtypes = {_determine_key_type(c) for (*_, c) in self.transformers}
+            if len(all_dtypes) == 1:
+                return next(iter(all_dtypes))
+        except ValueError:
+            # _determine_key_type raises a ValueError if some transformer
+            # columns are Callables
+            return "int"
+        return "int"
+
+    def _get_remainder_cols(self, indices):
+        dtype = self._get_remainder_cols_dtype()
+        if self.force_int_remainder_cols and dtype != "int":
+            return _RemainderColsList(indices, future_dtype=dtype)
+        if dtype == "str":
+            return list(self.feature_names_in_[indices])
+        if dtype == "bool":
+            return [i in indices for i in range(self.n_features_in_)]
+        return indices
 
     @property
     def named_transformers_(self):
@@ -662,7 +722,7 @@ def _update_fitted_transformers(self, transformers):
 
         # sanity check that transformers is exhausted
         assert not list(fitted_transformers)
-        self.transformers_ = transformers_
+        self.transformers_ = _with_dtype_warning_enabled_set_to(True, transformers_)
 
     def _validate_output(self, result):
         """
@@ -794,7 +854,7 @@ def _call_func_on_transformers(self, X, y, func, column_as_labels, routed_params
         )
         try:
             jobs = []
-            for idx, (name, trans, column, weight) in enumerate(transformers, start=1):
+            for idx, (name, trans, columns, weight) in enumerate(transformers, start=1):
                 if func is _fit_transform_one:
                     if trans == "passthrough":
                         output_config = _get_output_config("transform", self)
@@ -813,7 +873,7 @@ def _call_func_on_transformers(self, X, y, func, column_as_labels, routed_params
                 jobs.append(
                     delayed(func)(
                         transformer=clone(trans) if not fitted else trans,
-                        X=_safe_indexing(X, column, axis=1),
+                        X=_safe_indexing(X, columns, axis=1),
                         y=y,
                         weight=weight,
                         **extra_args,
@@ -1277,6 +1337,7 @@ def make_column_transformer(
     n_jobs=None,
     verbose=False,
     verbose_feature_names_out=True,
+    force_int_remainder_cols=True,
 ):
     """Construct a ColumnTransformer from the given transformers.
 
@@ -1349,6 +1410,23 @@ def make_column_transformer(
 
         .. versionadded:: 1.0
 
+    force_int_remainder_cols : bool, default=True
+        Force the columns of the last entry of `transformers_`, which
+        corresponds to the "remainder" transformer, to always be stored as
+        indices (int) rather than column names (str). See description of the
+        :attr:`ColumnTransformer.transformers_` attribute for details.
+
+        .. note::
+            If you do not access the list of columns for the remainder columns
+            in the :attr:`ColumnTransformer.transformers_` fitted attribute,
+            you do not need to set this parameter.
+
+        .. versionadded:: 1.5
+
+        .. versionchanged:: 1.7
+           The default value for `force_int_remainder_cols` will change from
+           `True` to `False` in version 1.7.
+
     Returns
     -------
     ct : ColumnTransformer
@@ -1382,6 +1460,7 @@ def make_column_transformer(
         sparse_threshold=sparse_threshold,
         verbose=verbose,
         verbose_feature_names_out=verbose_feature_names_out,
+        force_int_remainder_cols=force_int_remainder_cols,
     )
 
 
@@ -1472,3 +1551,102 @@ def __call__(self, df):
         if self.pattern is not None:
             cols = cols[cols.str.contains(self.pattern, regex=True)]
         return cols.tolist()
+
+
+class _RemainderColsList(UserList):
+    """A list that raises a warning whenever items are accessed.
+
+    It is used to store the columns handled by the "remainder" entry of
+    ``ColumnTransformer.transformers_``, ie ``transformers_[-1][-1]``.
+
+    For some values of the ``ColumnTransformer`` ``transformers`` parameter,
+    this list of indices will be replaced by either a list of column names or a
+    boolean mask; in those cases we emit a ``FutureWarning`` the first time an
+    element is accessed.
+
+    Parameters
+    ----------
+    columns : list of int
+        The remainder columns.
+
+    future_dtype : {'str', 'bool'}, default=None
+        The dtype that will be used by a ColumnTransformer with the same inputs
+        in a future release. There is a default value because providing a
+        constructor that takes a single argument is a requirement for
+        subclasses of UserList, but we do not use it in practice. It would only
+        be used if a user called methods that return a new list such are
+        copying or concatenating `_RemainderColsList`.
+
+    warning_was_emitted : bool, default=False
+       Whether the warning for that particular list was already shown, so we
+       only emit it once.
+
+    warning_enabled : bool, default=True
+        When False, the list never emits the warning nor updates
+        `warning_was_emitted``. This is used to obtain a quiet copy of the list
+        for use by the `ColumnTransformer` itself, so that the warning is only
+        shown when a user accesses it directly.
+    """
+
+    def __init__(
+        self,
+        columns,
+        *,
+        future_dtype=None,
+        warning_was_emitted=False,
+        warning_enabled=True,
+    ):
+        super().__init__(columns)
+        self.future_dtype = future_dtype
+        self.warning_was_emitted = warning_was_emitted
+        self.warning_enabled = warning_enabled
+
+    def __getitem__(self, index):
+        self._show_remainder_cols_warning()
+        return super().__getitem__(index)
+
+    def _show_remainder_cols_warning(self):
+        if self.warning_was_emitted or not self.warning_enabled:
+            return
+        self.warning_was_emitted = True
+        future_dtype_description = {
+            "str": "column names (of type str)",
+            "bool": "a mask array (of type bool)",
+            # shouldn't happen because we always initialize it with a
+            # non-default future_dtype
+            None: "a different type depending on the ColumnTransformer inputs",
+        }.get(self.future_dtype, self.future_dtype)
+
+        # TODO(1.7) Update the warning to say that the old behavior will be
+        # removed in 1.9.
+        warnings.warn(
+            (
+                "\nThe format of the columns of the 'remainder' transformer in"
+                " ColumnTransformer.transformers_ will change in version 1.7 to"
+                " match the format of the other transformers.\nAt the moment the"
+                " remainder columns are stored as indices (of type int). With the same"
+                " ColumnTransformer configuration, in the future they will be stored"
+                f" as {future_dtype_description}.\nTo use the new behavior now and"
+                " suppress this warning, use"
+                " ColumnTransformer(force_int_remainder_cols=False).\n"
+            ),
+            category=FutureWarning,
+        )
+
+    def _repr_pretty_(self, printer, *_):
+        """Override display in ipython console, otherwise the class name is shown."""
+        printer.text(repr(self.data))
+
+
+def _with_dtype_warning_enabled_set_to(warning_enabled, transformers):
+    result = []
+    for name, trans, columns in transformers:
+        if isinstance(columns, _RemainderColsList):
+            columns = _RemainderColsList(
+                columns.data,
+                future_dtype=columns.future_dtype,
+                warning_was_emitted=columns.warning_was_emitted,
+                warning_enabled=warning_enabled,
+            )
+        result.append((name, trans, columns))
+    return result
diff --git a/sklearn/compose/_target.py b/sklearn/compose/_target.py
index 3e6c94df8267a..c2ef2572ab786 100644
--- a/sklearn/compose/_target.py
+++ b/sklearn/compose/_target.py
@@ -1,6 +1,5 @@
-# Authors: Andreas Mueller <andreas.mueller@columbia.edu>
-#          Guillaume Lemaitre <guillaume.lemaitre@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 
@@ -8,22 +7,23 @@
 
 from ..base import BaseEstimator, RegressorMixin, _fit_context, clone
 from ..exceptions import NotFittedError
+from ..linear_model import LinearRegression
 from ..preprocessing import FunctionTransformer
-from ..utils import _safe_indexing, check_array
+from ..utils import Bunch, _safe_indexing, check_array
+from ..utils._metadata_requests import (
+    MetadataRouter,
+    MethodMapping,
+    _routing_enabled,
+    process_routing,
+)
 from ..utils._param_validation import HasMethods
 from ..utils._tags import _safe_tags
-from ..utils.metadata_routing import (
-    _raise_for_unsupported_routing,
-    _RoutingNotSupportedMixin,
-)
 from ..utils.validation import check_is_fitted
 
 __all__ = ["TransformedTargetRegressor"]
 
 
-class TransformedTargetRegressor(
-    _RoutingNotSupportedMixin, RegressorMixin, BaseEstimator
-):
+class TransformedTargetRegressor(RegressorMixin, BaseEstimator):
     """Meta-estimator to regress on a transformed target.
 
     Useful for applying a non-linear transformation to the target `y` in
@@ -193,6 +193,10 @@ def _fit_transformer(self, y):
                 validate=True,
                 check_inverse=self.check_inverse,
             )
+            # We are transforming the target here and not the features, so we set the
+            # output of FunctionTransformer() to be a numpy array (default) and to not
+            # depend on the global configuration:
+            self.transformer_.set_output(transform="default")
         # XXX: sample_weight is not currently passed to the
         # transformer. However, if transformer starts using sample_weight, the
         # code should be modified accordingly. At the time to consider the
@@ -230,15 +234,25 @@ def fit(self, X, y, **fit_params):
             Target values.
 
         **fit_params : dict
-            Parameters passed to the `fit` method of the underlying
-            regressor.
+            - If `enable_metadata_routing=False` (default):
+
+                Parameters directly passed to the `fit` method of the
+                underlying regressor.
+
+            - If `enable_metadata_routing=True`:
+
+                Parameters safely routed to the `fit` method of the
+                underlying regressor.
+
+                .. versionchanged:: 1.6
+                    See :ref:`Metadata Routing User Guide <metadata_routing>` for
+                    more details.
 
         Returns
         -------
         self : object
             Fitted estimator.
         """
-        _raise_for_unsupported_routing(self, "fit", **fit_params)
         if y is None:
             raise ValueError(
                 f"This {self.__class__.__name__} estimator "
@@ -274,14 +288,13 @@ def fit(self, X, y, **fit_params):
         if y_trans.ndim == 2 and y_trans.shape[1] == 1:
             y_trans = y_trans.squeeze(axis=1)
 
-        if self.regressor is None:
-            from ..linear_model import LinearRegression
-
-            self.regressor_ = LinearRegression()
+        self.regressor_ = self._get_regressor(get_clone=True)
+        if _routing_enabled():
+            routed_params = process_routing(self, "fit", **fit_params)
         else:
-            self.regressor_ = clone(self.regressor)
+            routed_params = Bunch(regressor=Bunch(fit=fit_params))
 
-        self.regressor_.fit(X, y_trans, **fit_params)
+        self.regressor_.fit(X, y_trans, **routed_params.regressor.fit)
 
         if hasattr(self.regressor_, "feature_names_in_"):
             self.feature_names_in_ = self.regressor_.feature_names_in_
@@ -300,8 +313,19 @@ def predict(self, X, **predict_params):
             Samples.
 
         **predict_params : dict of str -> object
-            Parameters passed to the `predict` method of the underlying
-            regressor.
+            - If `enable_metadata_routing=False` (default):
+
+                Parameters directly passed to the `predict` method of the
+                underlying regressor.
+
+            - If `enable_metadata_routing=True`:
+
+                Parameters safely routed to the `predict` method of the
+                underlying regressor.
+
+                .. versionchanged:: 1.6
+                    See :ref:`Metadata Routing User Guide <metadata_routing>`
+                    for more details.
 
         Returns
         -------
@@ -309,7 +333,12 @@ def predict(self, X, **predict_params):
             Predicted values.
         """
         check_is_fitted(self)
-        pred = self.regressor_.predict(X, **predict_params)
+        if _routing_enabled():
+            routed_params = process_routing(self, "predict", **predict_params)
+        else:
+            routed_params = Bunch(regressor=Bunch(predict=predict_params))
+
+        pred = self.regressor_.predict(X, **routed_params.regressor.predict)
         if pred.ndim == 1:
             pred_trans = self.transformer_.inverse_transform(pred.reshape(-1, 1))
         else:
@@ -324,11 +353,7 @@ def predict(self, X, **predict_params):
         return pred_trans
 
     def _more_tags(self):
-        regressor = self.regressor
-        if regressor is None:
-            from ..linear_model import LinearRegression
-
-            regressor = LinearRegression()
+        regressor = self._get_regressor()
 
         return {
             "poor_score": True,
@@ -350,3 +375,31 @@ def n_features_in_(self):
             ) from nfe
 
         return self.regressor_.n_features_in_
+
+    def get_metadata_routing(self):
+        """Get metadata routing of this object.
+
+        Please check :ref:`User Guide <metadata_routing>` on how the routing
+        mechanism works.
+
+        .. versionadded:: 1.6
+
+        Returns
+        -------
+        routing : MetadataRouter
+            A :class:`~sklearn.utils.metadata_routing.MetadataRouter` encapsulating
+            routing information.
+        """
+        router = MetadataRouter(owner=self.__class__.__name__).add(
+            regressor=self._get_regressor(),
+            method_mapping=MethodMapping()
+            .add(caller="fit", callee="fit")
+            .add(caller="predict", callee="predict"),
+        )
+        return router
+
+    def _get_regressor(self, get_clone=False):
+        if self.regressor is None:
+            return LinearRegression()
+
+        return clone(self.regressor) if get_clone else self.regressor
diff --git a/sklearn/compose/tests/test_column_transformer.py b/sklearn/compose/tests/test_column_transformer.py
index 56c4cd459aab5..0f187b78405f8 100644
--- a/sklearn/compose/tests/test_column_transformer.py
+++ b/sklearn/compose/tests/test_column_transformer.py
@@ -5,7 +5,9 @@
 import pickle
 import re
 import warnings
+from unittest.mock import Mock
 
+import joblib
 import numpy as np
 import pytest
 from numpy.testing import assert_allclose
@@ -17,6 +19,7 @@
     make_column_selector,
     make_column_transformer,
 )
+from sklearn.compose._column_transformer import _RemainderColsList
 from sklearn.exceptions import NotFittedError
 from sklearn.feature_selection import VarianceThreshold
 from sklearn.preprocessing import (
@@ -30,13 +33,14 @@
     _Registry,
     check_recorded_metadata,
 )
+from sklearn.utils._indexing import _safe_indexing
 from sklearn.utils._testing import (
     _convert_container,
     assert_allclose_dense_sparse,
     assert_almost_equal,
     assert_array_equal,
 )
-from sklearn.utils.fixes import CSR_CONTAINERS
+from sklearn.utils.fixes import CSR_CONTAINERS, parse_version
 
 
 class Trans(TransformerMixin, BaseEstimator):
@@ -787,6 +791,7 @@ def test_column_transformer_get_set_params():
         "transformer_weights": None,
         "verbose_feature_names_out": True,
         "verbose": False,
+        "force_int_remainder_cols": True,
     }
 
     assert ct.get_params() == exp
@@ -808,6 +813,7 @@ def test_column_transformer_get_set_params():
         "transformer_weights": None,
         "verbose_feature_names_out": True,
         "verbose": False,
+        "force_int_remainder_cols": True,
     }
 
     assert ct.get_params() == exp
@@ -937,38 +943,135 @@ def test_column_transformer_remainder():
     assert ct.remainder == "drop"
 
 
+# TODO(1.7): check for deprecated force_int_remainder_cols
+# TODO(1.9): remove force_int but keep the test
 @pytest.mark.parametrize(
-    "key", [[0], np.array([0]), slice(0, 1), np.array([True, False])]
+    "cols1, cols2",
+    [
+        ([0], [False, True, False]),  # mix types
+        ([0], [1]),  # ints
+        (lambda x: [0], lambda x: [1]),  # callables
+    ],
 )
-def test_column_transformer_remainder_numpy(key):
+@pytest.mark.parametrize("force_int", [False, True])
+def test_column_transformer_remainder_dtypes_ints(force_int, cols1, cols2):
+    """Check that the remainder columns are always stored as indices when
+    other columns are not all specified as column names or masks, regardless of
+    `force_int_remainder_cols`.
+    """
+    X = np.ones((1, 3))
+
+    ct = make_column_transformer(
+        (Trans(), cols1),
+        (Trans(), cols2),
+        remainder="passthrough",
+        force_int_remainder_cols=force_int,
+    )
+    with warnings.catch_warnings():
+        warnings.simplefilter("error")
+        ct.fit_transform(X)
+        assert ct.transformers_[-1][-1][0] == 2
+
+
+# TODO(1.7): check for deprecated force_int_remainder_cols
+# TODO(1.9): remove force_int but keep the test
+@pytest.mark.parametrize(
+    "force_int, cols1, cols2, expected_cols",
+    [
+        (True, ["A"], ["B"], [2]),
+        (False, ["A"], ["B"], ["C"]),
+        (True, [True, False, False], [False, True, False], [2]),
+        (False, [True, False, False], [False, True, False], [False, False, True]),
+    ],
+)
+def test_column_transformer_remainder_dtypes(force_int, cols1, cols2, expected_cols):
+    """Check that the remainder columns format matches the format of the other
+    columns when they're all strings or masks, unless `force_int = True`.
+    """
+    X = np.ones((1, 3))
+
+    if isinstance(cols1[0], str):
+        pd = pytest.importorskip("pandas")
+        X = pd.DataFrame(X, columns=["A", "B", "C"])
+
+    # if inputs are column names store remainder columns as column names unless
+    # force_int_remainder_cols is True
+    ct = make_column_transformer(
+        (Trans(), cols1),
+        (Trans(), cols2),
+        remainder="passthrough",
+        force_int_remainder_cols=force_int,
+    )
+    with warnings.catch_warnings():
+        warnings.simplefilter("error")
+        ct.fit_transform(X)
+
+    if force_int:
+        # If we forced using ints and we access the remainder columns a warning is shown
+        match = "The format of the columns of the 'remainder' transformer"
+        cols = ct.transformers_[-1][-1]
+        with pytest.warns(FutureWarning, match=match):
+            cols[0]
+    else:
+        with warnings.catch_warnings():
+            warnings.simplefilter("error")
+            cols = ct.transformers_[-1][-1]
+            cols[0]
+
+    assert cols == expected_cols
+
+
+def test_remainder_list_repr():
+    cols = _RemainderColsList([0, 1], warning_enabled=False)
+    assert str(cols) == "[0, 1]"
+    assert repr(cols) == "[0, 1]"
+    mock = Mock()
+    cols._repr_pretty_(mock, False)
+    mock.text.assert_called_once_with("[0, 1]")
+
+
+@pytest.mark.parametrize(
+    "key, expected_cols",
+    [
+        ([0], [1]),
+        (np.array([0]), [1]),
+        (slice(0, 1), [1]),
+        (np.array([True, False]), [False, True]),
+    ],
+)
+def test_column_transformer_remainder_numpy(key, expected_cols):
     # test different ways that columns are specified with passthrough
     X_array = np.array([[0, 1, 2], [2, 4, 6]]).T
     X_res_both = X_array
 
-    ct = ColumnTransformer([("trans1", Trans(), key)], remainder="passthrough")
+    ct = ColumnTransformer(
+        [("trans1", Trans(), key)],
+        remainder="passthrough",
+        force_int_remainder_cols=False,
+    )
     assert_array_equal(ct.fit_transform(X_array), X_res_both)
     assert_array_equal(ct.fit(X_array).transform(X_array), X_res_both)
     assert len(ct.transformers_) == 2
     assert ct.transformers_[-1][0] == "remainder"
     assert isinstance(ct.transformers_[-1][1], FunctionTransformer)
-    assert_array_equal(ct.transformers_[-1][2], [1])
+    assert ct.transformers_[-1][2] == expected_cols
 
 
 @pytest.mark.parametrize(
-    "key",
+    "key, expected_cols",
     [
-        [0],
-        slice(0, 1),
-        np.array([True, False]),
-        ["first"],
-        "pd-index",
-        np.array(["first"]),
-        np.array(["first"], dtype=object),
-        slice(None, "first"),
-        slice("first", "first"),
+        ([0], [1]),
+        (slice(0, 1), [1]),
+        (np.array([True, False]), [False, True]),
+        (["first"], ["second"]),
+        ("pd-index", ["second"]),
+        (np.array(["first"]), ["second"]),
+        (np.array(["first"], dtype=object), ["second"]),
+        (slice(None, "first"), ["second"]),
+        (slice("first", "first"), ["second"]),
     ],
 )
-def test_column_transformer_remainder_pandas(key):
+def test_column_transformer_remainder_pandas(key, expected_cols):
     # test different ways that columns are specified with passthrough
     pd = pytest.importorskip("pandas")
     if isinstance(key, str) and key == "pd-index":
@@ -978,33 +1081,47 @@ def test_column_transformer_remainder_pandas(key):
     X_df = pd.DataFrame(X_array, columns=["first", "second"])
     X_res_both = X_array
 
-    ct = ColumnTransformer([("trans1", Trans(), key)], remainder="passthrough")
+    ct = ColumnTransformer(
+        [("trans1", Trans(), key)],
+        remainder="passthrough",
+        force_int_remainder_cols=False,
+    )
     assert_array_equal(ct.fit_transform(X_df), X_res_both)
     assert_array_equal(ct.fit(X_df).transform(X_df), X_res_both)
     assert len(ct.transformers_) == 2
     assert ct.transformers_[-1][0] == "remainder"
     assert isinstance(ct.transformers_[-1][1], FunctionTransformer)
-    assert_array_equal(ct.transformers_[-1][2], [1])
+    assert ct.transformers_[-1][2] == expected_cols
 
 
 @pytest.mark.parametrize(
-    "key", [[0], np.array([0]), slice(0, 1), np.array([True, False, False])]
+    "key, expected_cols",
+    [
+        ([0], [1, 2]),
+        (np.array([0]), [1, 2]),
+        (slice(0, 1), [1, 2]),
+        (np.array([True, False, False]), [False, True, True]),
+    ],
 )
-def test_column_transformer_remainder_transformer(key):
+def test_column_transformer_remainder_transformer(key, expected_cols):
     X_array = np.array([[0, 1, 2], [2, 4, 6], [8, 6, 4]]).T
     X_res_both = X_array.copy()
 
     # second and third columns are doubled when remainder = DoubleTrans
     X_res_both[:, 1:3] *= 2
 
-    ct = ColumnTransformer([("trans1", Trans(), key)], remainder=DoubleTrans())
+    ct = ColumnTransformer(
+        [("trans1", Trans(), key)],
+        remainder=DoubleTrans(),
+        force_int_remainder_cols=False,
+    )
 
     assert_array_equal(ct.fit_transform(X_array), X_res_both)
     assert_array_equal(ct.fit(X_array).transform(X_array), X_res_both)
     assert len(ct.transformers_) == 2
     assert ct.transformers_[-1][0] == "remainder"
     assert isinstance(ct.transformers_[-1][1], DoubleTrans)
-    assert_array_equal(ct.transformers_[-1][2], [1, 2])
+    assert ct.transformers_[-1][2] == expected_cols
 
 
 def test_column_transformer_no_remaining_remainder_transformer():
@@ -1099,6 +1216,7 @@ def test_column_transformer_get_set_params_with_remainder():
         "transformer_weights": None,
         "verbose_feature_names_out": True,
         "verbose": False,
+        "force_int_remainder_cols": True,
     }
 
     assert ct.get_params() == exp
@@ -1119,6 +1237,7 @@ def test_column_transformer_get_set_params_with_remainder():
         "transformer_weights": None,
         "verbose_feature_names_out": True,
         "verbose": False,
+        "force_int_remainder_cols": True,
     }
     assert ct.get_params() == exp
 
@@ -1475,7 +1594,9 @@ def test_sk_visual_block_remainder_fitted_pandas(remainder):
     pd = pytest.importorskip("pandas")
     ohe = OneHotEncoder()
     ct = ColumnTransformer(
-        transformers=[("ohe", ohe, ["col1", "col2"])], remainder=remainder
+        transformers=[("ohe", ohe, ["col1", "col2"])],
+        remainder=remainder,
+        force_int_remainder_cols=False,
     )
     df = pd.DataFrame(
         {
@@ -2401,8 +2522,12 @@ def test_column_transformer_column_renaming(dataframe_lib):
             ("A", "passthrough", ["x1", "x2", "x3"]),
             ("B", FunctionTransformer(), ["x1", "x2"]),
             ("C", StandardScaler(), ["x1", "x3"]),
-            # special case of empty transformer
-            ("D", FunctionTransformer(lambda x: x[[]]), ["x1", "x2", "x3"]),
+            # special case of a transformer returning 0-columns, e.g feature selector
+            (
+                "D",
+                FunctionTransformer(lambda x: _safe_indexing(x, [], axis=1)),
+                ["x1", "x2", "x3"],
+            ),
         ],
         verbose_feature_names_out=True,
     ).set_output(transform=dataframe_lib)
@@ -2431,8 +2556,12 @@ def test_column_transformer_error_with_duplicated_columns(dataframe_lib):
             ("A", "passthrough", ["x1", "x2", "x3"]),
             ("B", FunctionTransformer(), ["x1", "x2"]),
             ("C", StandardScaler(), ["x1", "x3"]),
-            # special case of empty transformer
-            ("D", FunctionTransformer(lambda x: x[[]]), ["x1", "x2", "x3"]),
+            # special case of a transformer returning 0-columns, e.g feature selector
+            (
+                "D",
+                FunctionTransformer(lambda x: _safe_indexing(x, [], axis=1)),
+                ["x1", "x2", "x3"],
+            ),
         ],
         verbose_feature_names_out=False,
     ).set_output(transform=dataframe_lib)
@@ -2447,6 +2576,30 @@ def test_column_transformer_error_with_duplicated_columns(dataframe_lib):
         transformer.fit_transform(df)
 
 
+@pytest.mark.skipif(
+    parse_version(joblib.__version__) < parse_version("1.3"),
+    reason="requires joblib >= 1.3",
+)
+def test_column_transformer_auto_memmap():
+    """Check that ColumnTransformer works in parallel with joblib's auto-memmapping.
+
+    non-regression test for issue #28781
+    """
+    X = np.random.RandomState(0).uniform(size=(3, 4))
+
+    scaler = StandardScaler(copy=False)
+
+    transformer = ColumnTransformer(
+        transformers=[("scaler", scaler, [0])],
+        n_jobs=2,
+    )
+
+    with joblib.parallel_backend("loky", max_nbytes=1):
+        Xt = transformer.fit_transform(X)
+
+    assert_allclose(Xt, StandardScaler().fit_transform(X[:, [0]]))
+
+
 # Metadata Routing Tests
 # ======================
 
@@ -2487,7 +2640,7 @@ def test_metadata_routing_for_column_transformer(method):
     )
 
     if method == "transform":
-        trs.fit(X, y)
+        trs.fit(X, y, sample_weight=sample_weight, metadata=metadata)
         trs.transform(X, sample_weight=sample_weight, metadata=metadata)
     else:
         getattr(trs, method)(X, y, sample_weight=sample_weight, metadata=metadata)
@@ -2495,7 +2648,11 @@ def test_metadata_routing_for_column_transformer(method):
     assert len(registry)
     for _trs in registry:
         check_recorded_metadata(
-            obj=_trs, method=method, sample_weight=sample_weight, metadata=metadata
+            obj=_trs,
+            method=method,
+            parent=method,
+            sample_weight=sample_weight,
+            metadata=metadata,
         )
 
 
diff --git a/sklearn/compose/tests/test_target.py b/sklearn/compose/tests/test_target.py
index a971553b64739..fd885459e76d1 100644
--- a/sklearn/compose/tests/test_target.py
+++ b/sklearn/compose/tests/test_target.py
@@ -1,7 +1,9 @@
+import warnings
+
 import numpy as np
 import pytest
 
-from sklearn import datasets
+from sklearn import config_context, datasets
 from sklearn.base import BaseEstimator, TransformerMixin, clone
 from sklearn.compose import TransformedTargetRegressor
 from sklearn.dummy import DummyRegressor
@@ -393,3 +395,18 @@ def test_transform_target_regressor_pass_extra_predict_parameters():
     regr.fit(X, y)
     regr.predict(X, check_input=False)
     assert regr.regressor_.predict_called
+
+
+@pytest.mark.parametrize("output_format", ["pandas", "polars"])
+def test_transform_target_regressor_not_warns_with_global_output_set(output_format):
+    """Test that TransformedTargetRegressor will not raise warnings if
+    set_config(transform_output="pandas"/"polars") is set globally; regression test for
+    issue #29361."""
+    X, y = datasets.make_regression()
+    y = np.abs(y) + 1
+    with config_context(transform_output=output_format):
+        with warnings.catch_warnings():
+            warnings.simplefilter("error")
+            TransformedTargetRegressor(
+                regressor=LinearRegression(), func=np.log, inverse_func=np.exp
+            ).fit(X, y)
diff --git a/sklearn/conftest.py b/sklearn/conftest.py
index 203c524561fdd..47b6c2887acef 100644
--- a/sklearn/conftest.py
+++ b/sklearn/conftest.py
@@ -26,7 +26,6 @@
     fetch_rcv1,
     fetch_species_distributions,
 )
-from sklearn.tests import random_seed
 from sklearn.utils._testing import get_pytest_filterwarning_lines
 from sklearn.utils.fixes import (
     _IS_32BIT,
@@ -211,6 +210,10 @@ def pytest_collection_modifyitems(config, items):
         reason = "Due to NEP 51 numpy scalar repr has changed in numpy 2"
         skip_doctests = True
 
+    if sp_version < parse_version("1.14"):
+        reason = "Scipy sparse matrix repr has changed in scipy 1.14"
+        skip_doctests = True
+
     # Normally doctest has the entire module's scope. Here we set globs to an empty dict
     # to remove the module's scope:
     # https://docs.python.org/3/library/doctest.html#what-s-the-execution-context
@@ -265,6 +268,51 @@ def pyplot():
     pyplot.close("all")
 
 
+def pytest_generate_tests(metafunc):
+    """Parametrization of global_random_seed fixture
+
+    based on the SKLEARN_TESTS_GLOBAL_RANDOM_SEED environment variable.
+
+    The goal of this fixture is to prevent tests that use it to be sensitive
+    to a specific seed value while still being deterministic by default.
+
+    See the documentation for the SKLEARN_TESTS_GLOBAL_RANDOM_SEED
+    variable for instructions on how to use this fixture.
+
+    https://scikit-learn.org/dev/computing/parallelism.html#sklearn-tests-global-random-seed
+
+    """
+    # When using pytest-xdist this function is called in the xdist workers.
+    # We rely on SKLEARN_TESTS_GLOBAL_RANDOM_SEED environment variable which is
+    # set in before running pytest and is available in xdist workers since they
+    # are subprocesses.
+    RANDOM_SEED_RANGE = list(range(100))  # All seeds in [0, 99] should be valid.
+    random_seed_var = environ.get("SKLEARN_TESTS_GLOBAL_RANDOM_SEED")
+
+    default_random_seeds = [42]
+
+    if random_seed_var is None:
+        random_seeds = default_random_seeds
+    elif random_seed_var == "all":
+        random_seeds = RANDOM_SEED_RANGE
+    else:
+        if "-" in random_seed_var:
+            start, stop = random_seed_var.split("-")
+            random_seeds = list(range(int(start), int(stop) + 1))
+        else:
+            random_seeds = [int(random_seed_var)]
+
+        if min(random_seeds) < 0 or max(random_seeds) > 99:
+            raise ValueError(
+                "The value(s) of the environment variable "
+                "SKLEARN_TESTS_GLOBAL_RANDOM_SEED must be in the range [0, 99] "
+                f"(or 'all'), got: {random_seed_var}"
+            )
+
+    if "global_random_seed" in metafunc.fixturenames:
+        metafunc.parametrize("global_random_seed", random_seeds)
+
+
 def pytest_configure(config):
     # Use matplotlib agg backend during the tests including doctests
     try:
@@ -282,10 +330,6 @@ def pytest_configure(config):
         allowed_parallelism = max(allowed_parallelism // int(xdist_worker_count), 1)
     threadpool_limits(allowed_parallelism)
 
-    # Register global_random_seed plugin if it is not already registered
-    if not config.pluginmanager.hasplugin("sklearn.tests.random_seed"):
-        config.pluginmanager.register(random_seed)
-
     if environ.get("SKLEARN_WARNINGS_AS_ERRORS", "0") != "0":
         # This seems like the only way to programmatically change the config
         # filterwarnings. This was suggested in
diff --git a/sklearn/covariance/__init__.py b/sklearn/covariance/__init__.py
index 8fcf8c68444e5..19ee1d8a09759 100644
--- a/sklearn/covariance/__init__.py
+++ b/sklearn/covariance/__init__.py
@@ -1,9 +1,8 @@
-"""
-The :mod:`sklearn.covariance` module includes methods and algorithms to
-robustly estimate the covariance of features given a set of points. The
-precision matrix defined as the inverse of the covariance is also estimated.
-Covariance estimation is closely related to the theory of Gaussian Graphical
-Models.
+"""Methods and algorithms to robustly estimate covariance.
+
+They estimate the covariance of features at given sets of points, as well as the
+precision matrix defined as the inverse of the covariance. Covariance estimation is
+closely related to the theory of Gaussian graphical models.
 """
 
 from ._elliptic_envelope import EllipticEnvelope
diff --git a/sklearn/covariance/_elliptic_envelope.py b/sklearn/covariance/_elliptic_envelope.py
index ed99a38c0ee56..81ae86b4ad76e 100644
--- a/sklearn/covariance/_elliptic_envelope.py
+++ b/sklearn/covariance/_elliptic_envelope.py
@@ -1,6 +1,5 @@
-# Author: Virgile Fritsch <virgile.fritsch@inria.fr>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from numbers import Real
 
diff --git a/sklearn/covariance/_empirical_covariance.py b/sklearn/covariance/_empirical_covariance.py
index db52bfa05ded3..1e194857c64a2 100644
--- a/sklearn/covariance/_empirical_covariance.py
+++ b/sklearn/covariance/_empirical_covariance.py
@@ -3,11 +3,8 @@
 
 """
 
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#         Gael Varoquaux <gael.varoquaux@normalesup.org>
-#         Virgile Fritsch <virgile.fritsch@inria.fr>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # avoid division truncation
 import warnings
diff --git a/sklearn/covariance/_graph_lasso.py b/sklearn/covariance/_graph_lasso.py
index 75f79bf06ae91..2007aa4085bd2 100644
--- a/sklearn/covariance/_graph_lasso.py
+++ b/sklearn/covariance/_graph_lasso.py
@@ -2,9 +2,8 @@
 estimator.
 """
 
-# Author: Gael Varoquaux <gael.varoquaux@normalesup.org>
-# License: BSD 3 clause
-# Copyright: INRIA
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import operator
 import sys
 import time
@@ -222,7 +221,6 @@ def alpha_max(emp_cov):
 @validate_params(
     {
         "emp_cov": ["array-like"],
-        "cov_init": ["array-like", None],
         "return_costs": ["boolean"],
         "return_n_iter": ["boolean"],
     },
@@ -232,7 +230,6 @@ def graphical_lasso(
     emp_cov,
     alpha,
     *,
-    cov_init=None,
     mode="cd",
     tol=1e-4,
     enet_tol=1e-4,
@@ -259,14 +256,6 @@ def graphical_lasso(
         regularization, the sparser the inverse covariance.
         Range is (0, inf].
 
-    cov_init : array of shape (n_features, n_features), default=None
-        The initial guess for the covariance. If None, then the empirical
-        covariance is used.
-
-        .. deprecated:: 1.3
-           `cov_init` is deprecated in 1.3 and will be removed in 1.5.
-           It currently has no effect.
-
     mode : {'cd', 'lars'}, default='cd'
         The Lasso solver to use: coordinate descent or LARS. Use LARS for
         very sparse underlying graphs, where p > n. Elsewhere prefer cd
@@ -347,16 +336,6 @@ def graphical_lasso(
            [ 0.21...,  0.22..., -0.08...],
            [-0.20..., -0.08...,  0.23...]])
     """
-
-    if cov_init is not None:
-        warnings.warn(
-            (
-                "The cov_init parameter is deprecated in 1.3 and will be removed in "
-                "1.5. It does not have any effect."
-            ),
-            FutureWarning,
-        )
-
     model = GraphicalLasso(
         alpha=alpha,
         mode=mode,
diff --git a/sklearn/covariance/_robust_covariance.py b/sklearn/covariance/_robust_covariance.py
index 980bf964e6dfa..614a0aaaa0a7e 100644
--- a/sklearn/covariance/_robust_covariance.py
+++ b/sklearn/covariance/_robust_covariance.py
@@ -5,9 +5,8 @@
 
 """
 
-# Author: Virgile Fritsch <virgile.fritsch@inria.fr>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from numbers import Integral, Real
diff --git a/sklearn/covariance/_shrunk_covariance.py b/sklearn/covariance/_shrunk_covariance.py
index 2c8248d0f6502..9686455b5c0cf 100644
--- a/sklearn/covariance/_shrunk_covariance.py
+++ b/sklearn/covariance/_shrunk_covariance.py
@@ -6,11 +6,8 @@
 
 """
 
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#         Gael Varoquaux <gael.varoquaux@normalesup.org>
-#         Virgile Fritsch <virgile.fritsch@inria.fr>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # avoid division truncation
 import warnings
@@ -617,7 +614,7 @@ def fit(self, X, y=None):
     prefer_skip_nested_validation=False,
 )
 def oas(X, *, assume_centered=False):
-    """Estimate covariance with the Oracle Approximating Shrinkage as proposed in [1]_.
+    """Estimate covariance with the Oracle Approximating Shrinkage.
 
     Read more in the :ref:`User Guide <shrunk_covariance>`.
 
@@ -684,7 +681,7 @@ def oas(X, *, assume_centered=False):
 
 
 class OAS(EmpiricalCovariance):
-    """Oracle Approximating Shrinkage Estimator as proposed in [1]_.
+    """Oracle Approximating Shrinkage Estimator.
 
     Read more in the :ref:`User Guide <shrunk_covariance>`.
 
diff --git a/sklearn/covariance/tests/test_covariance.py b/sklearn/covariance/tests/test_covariance.py
index ef4bd63149d60..9c55012c158e1 100644
--- a/sklearn/covariance/tests/test_covariance.py
+++ b/sklearn/covariance/tests/test_covariance.py
@@ -1,8 +1,5 @@
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#         Gael Varoquaux <gael.varoquaux@normalesup.org>
-#         Virgile Fritsch <virgile.fritsch@inria.fr>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 import pytest
diff --git a/sklearn/covariance/tests/test_graphical_lasso.py b/sklearn/covariance/tests/test_graphical_lasso.py
index 7be2f3ce95e14..63782a67ebaa8 100644
--- a/sklearn/covariance/tests/test_graphical_lasso.py
+++ b/sklearn/covariance/tests/test_graphical_lasso.py
@@ -263,20 +263,6 @@ def test_graphical_lasso_cv_scores():
     )
 
 
-# TODO(1.5): remove in 1.5
-def test_graphical_lasso_cov_init_deprecation():
-    """Check that we raise a deprecation warning if providing `cov_init` in
-    `graphical_lasso`."""
-    rng, dim, n_samples = np.random.RandomState(0), 20, 100
-    prec = make_sparse_spd_matrix(dim, alpha=0.95, random_state=0)
-    cov = linalg.inv(prec)
-    X = rng.multivariate_normal(np.zeros(dim), cov, size=n_samples)
-
-    emp_cov = empirical_covariance(X)
-    with pytest.warns(FutureWarning, match="cov_init parameter is deprecated"):
-        graphical_lasso(emp_cov, alpha=0.1, cov_init=emp_cov)
-
-
 @pytest.mark.usefixtures("enable_slep006")
 def test_graphical_lasso_cv_scores_with_routing(global_random_seed):
     """Check that `GraphicalLassoCV` internally dispatches metadata to
diff --git a/sklearn/covariance/tests/test_robust_covariance.py b/sklearn/covariance/tests/test_robust_covariance.py
index 44dcdbbbf8249..ebeb2c6e5aa6b 100644
--- a/sklearn/covariance/tests/test_robust_covariance.py
+++ b/sklearn/covariance/tests/test_robust_covariance.py
@@ -1,8 +1,5 @@
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#         Gael Varoquaux <gael.varoquaux@normalesup.org>
-#         Virgile Fritsch <virgile.fritsch@inria.fr>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import itertools
 
diff --git a/sklearn/cross_decomposition/__init__.py b/sklearn/cross_decomposition/__init__.py
index 47b78783caf9c..15eb21467daee 100644
--- a/sklearn/cross_decomposition/__init__.py
+++ b/sklearn/cross_decomposition/__init__.py
@@ -1,3 +1,5 @@
+"""Algorithms for cross decomposition."""
+
 from ._pls import CCA, PLSSVD, PLSCanonical, PLSRegression
 
 __all__ = ["PLSCanonical", "PLSRegression", "PLSSVD", "CCA"]
diff --git a/sklearn/cross_decomposition/_pls.py b/sklearn/cross_decomposition/_pls.py
index 858f123427fab..16024cf961d27 100644
--- a/sklearn/cross_decomposition/_pls.py
+++ b/sklearn/cross_decomposition/_pls.py
@@ -2,8 +2,8 @@
 The :mod:`sklearn.pls` module implements Partial Least Squares (PLS).
 """
 
-# Author: Edouard Duchesnay <edouard.duchesnay@cea.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from abc import ABCMeta, abstractmethod
@@ -263,10 +263,19 @@ def fit(self, X, y=None, Y=None):
 
         check_consistent_length(X, y)
         X = self._validate_data(
-            X, dtype=np.float64, copy=self.copy, ensure_min_samples=2
+            X,
+            dtype=np.float64,
+            force_writeable=True,
+            copy=self.copy,
+            ensure_min_samples=2,
         )
         y = check_array(
-            y, input_name="y", dtype=np.float64, copy=self.copy, ensure_2d=False
+            y,
+            input_name="y",
+            dtype=np.float64,
+            force_writeable=True,
+            copy=self.copy,
+            ensure_2d=False,
         )
         if y.ndim == 1:
             self._predict_1d = True
@@ -388,7 +397,7 @@ def fit(self, X, y=None, Y=None):
             pinv2(np.dot(self.y_loadings_.T, self.y_weights_), check_finite=False),
         )
         self.coef_ = np.dot(self.x_rotations_, self.y_loadings_.T)
-        self.coef_ = (self.coef_ * self._y_std).T
+        self.coef_ = (self.coef_ * self._y_std).T / self._x_std
         self.intercept_ = self._y_mean
         self._n_features_out = self.x_rotations_.shape[1]
         return self
@@ -517,9 +526,8 @@ def predict(self, X, copy=True):
         """
         check_is_fitted(self)
         X = self._validate_data(X, copy=copy, dtype=FLOAT_DTYPES, reset=False)
-        # Normalize
+        # Only center X but do not scale it since the coefficients are already scaled
         X -= self._x_mean
-        X /= self._x_std
         Ypred = X @ self.coef_.T + self.intercept_
         return Ypred.ravel() if self._predict_1d else Ypred
 
@@ -1057,10 +1065,19 @@ def fit(self, X, y=None, Y=None):
         y = _deprecate_Y_when_required(y, Y)
         check_consistent_length(X, y)
         X = self._validate_data(
-            X, dtype=np.float64, copy=self.copy, ensure_min_samples=2
+            X,
+            dtype=np.float64,
+            force_writeable=True,
+            copy=self.copy,
+            ensure_min_samples=2,
         )
         y = check_array(
-            y, input_name="y", dtype=np.float64, copy=self.copy, ensure_2d=False
+            y,
+            input_name="y",
+            dtype=np.float64,
+            force_writeable=True,
+            copy=self.copy,
+            ensure_2d=False,
         )
         if y.ndim == 1:
             y = y.reshape(-1, 1)
diff --git a/sklearn/cross_decomposition/tests/test_pls.py b/sklearn/cross_decomposition/tests/test_pls.py
index 12d60cfef3194..c8de4ad8a78de 100644
--- a/sklearn/cross_decomposition/tests/test_pls.py
+++ b/sklearn/cross_decomposition/tests/test_pls.py
@@ -589,8 +589,6 @@ def test_pls_prediction(PLSEstimator, scale):
 
     y_mean = Y.mean(axis=0)
     X_trans = X - X.mean(axis=0)
-    if scale:
-        X_trans /= X.std(axis=0, ddof=1)
 
     assert_allclose(pls.intercept_, y_mean)
     assert_allclose(Y_pred, X_trans @ pls.coef_.T + pls.intercept_)
@@ -646,6 +644,28 @@ def test_pls_regression_fit_1d_y():
     assert_allclose(y_pred, expected)
 
 
+def test_pls_regression_scaling_coef():
+    """Check that when using `scale=True`, the coefficients are using the std. dev. from
+    both `X` and `Y`.
+
+    Non-regression test for:
+    https://github.com/scikit-learn/scikit-learn/issues/27964
+    """
+    # handcrafted data where we can predict Y from X with an additional scaling factor
+    rng = np.random.RandomState(0)
+    coef = rng.uniform(size=(3, 5))
+    X = rng.normal(scale=10, size=(30, 5))  # add a std of 10
+    Y = X @ coef.T
+
+    # we need to make sure that the dimension of the latent space is large enough to
+    # perfectly predict `Y` from `X` (no information loss)
+    pls = PLSRegression(n_components=5, scale=True).fit(X, Y)
+    assert_allclose(pls.coef_, coef)
+
+    # we therefore should be able to predict `Y` from `X`
+    assert_allclose(pls.predict(X), Y)
+
+
 # TODO(1.7): Remove
 @pytest.mark.parametrize("Klass", [PLSRegression, CCA, PLSSVD, PLSCanonical])
 def test_pls_fit_warning_on_deprecated_Y_argument(Klass):
diff --git a/sklearn/datasets/__init__.py b/sklearn/datasets/__init__.py
index 6f61e027dceaa..f41b8fa7e73fb 100644
--- a/sklearn/datasets/__init__.py
+++ b/sklearn/datasets/__init__.py
@@ -1,13 +1,10 @@
-"""
-The :mod:`sklearn.datasets` module includes utilities to load datasets,
-including methods to load and fetch popular reference datasets. It also
-features some artificial data generators.
-"""
+"""Utilities to load popular datasets and artificial data generators."""
 
 import textwrap
 
 from ._base import (
     clear_data_home,
+    fetch_file,
     get_data_home,
     load_breast_cancer,
     load_diabetes,
@@ -61,6 +58,7 @@
     "dump_svmlight_file",
     "fetch_20newsgroups",
     "fetch_20newsgroups_vectorized",
+    "fetch_file",
     "fetch_lfw_pairs",
     "fetch_lfw_people",
     "fetch_olivetti_faces",
diff --git a/sklearn/datasets/_base.py b/sklearn/datasets/_base.py
index aa145384c042d..62055d296402b 100644
--- a/sklearn/datasets/_base.py
+++ b/sklearn/datasets/_base.py
@@ -2,16 +2,16 @@
 Base IO code for all datasets
 """
 
-# Copyright (c) 2007 David Cournapeau <cournape@gmail.com>
-#               2010 Fabian Pedregosa <fabian.pedregosa@inria.fr>
-#               2010 Olivier Grisel <olivier.grisel@ensta.org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import csv
 import gzip
 import hashlib
 import os
+import re
 import shutil
 import time
+import unicodedata
 import warnings
 from collections import namedtuple
 from importlib import resources
@@ -19,7 +19,9 @@
 from os import environ, listdir, makedirs
 from os.path import expanduser, isdir, join, splitext
 from pathlib import Path
+from tempfile import NamedTemporaryFile
 from urllib.error import URLError
+from urllib.parse import urlparse
 from urllib.request import urlretrieve
 
 import numpy as np
@@ -1429,20 +1431,26 @@ def _sha256(path):
 
 
 def _fetch_remote(remote, dirname=None, n_retries=3, delay=1):
-    """Helper function to download a remote dataset into path
+    """Helper function to download a remote dataset.
 
     Fetch a dataset pointed by remote's url, save into path using remote's
-    filename and ensure its integrity based on the SHA256 Checksum of the
+    filename and ensure its integrity based on the SHA256 checksum of the
     downloaded file.
 
+    .. versionchanged:: 1.6
+
+        If the file already exists locally and the SHA256 checksums match, the
+        path to the local file is returned without re-downloading.
+
     Parameters
     ----------
     remote : RemoteFileMetadata
         Named tuple containing remote dataset meta information: url, filename
-        and checksum
+        and checksum.
 
-    dirname : str
-        Directory to save the file to.
+    dirname : str or Path, default=None
+        Directory to save the file to. If None, the current working directory
+        is used.
 
     n_retries : int, default=3
         Number of retries when HTTP errors are encountered.
@@ -1456,28 +1464,173 @@ def _fetch_remote(remote, dirname=None, n_retries=3, delay=1):
 
     Returns
     -------
-    file_path: str
+    file_path: Path
         Full path of the created file.
     """
+    if dirname is None:
+        folder_path = Path(".")
+    else:
+        folder_path = Path(dirname)
+
+    file_path = folder_path / remote.filename
+
+    if file_path.exists():
+        if remote.checksum is None:
+            return file_path
+
+        checksum = _sha256(file_path)
+        if checksum == remote.checksum:
+            return file_path
+        else:
+            warnings.warn(
+                f"SHA256 checksum of existing local file {file_path.name} "
+                f"({checksum}) differs from expected ({remote.checksum}): "
+                f"re-downloading from {remote.url} ."
+            )
+
+    # We create a temporary file dedicated to this particular download to avoid
+    # conflicts with parallel downloads. If the download is successful, the
+    # temporary file is atomically renamed to the final file path (with
+    # `shutil.move`). We therefore pass `delete=False` to `NamedTemporaryFile`.
+    # Otherwise, garbage collecting temp_file would raise an error when
+    # attempting to delete a file that was already renamed. If the download
+    # fails or the result does not match the expected SHA256 digest, the
+    # temporary file is removed manually in the except block.
+    temp_file = NamedTemporaryFile(
+        prefix=remote.filename + ".part_", dir=folder_path, delete=False
+    )
+    # Note that Python 3.12's `delete_on_close=True` is ignored as we set
+    # `delete=False` explicitly. So after this line the empty temporary file still
+    # exists on disk to make sure that it's uniquely reserved for this specific call of
+    # `_fetch_remote` and therefore it protects against any corruption by parallel
+    # calls.
+    temp_file.close()
+    try:
+        temp_file_path = Path(temp_file.name)
+        while True:
+            try:
+                urlretrieve(remote.url, temp_file_path)
+                break
+            except (URLError, TimeoutError):
+                if n_retries == 0:
+                    # If no more retries are left, re-raise the caught exception.
+                    raise
+                warnings.warn(f"Retry downloading from url: {remote.url}")
+                n_retries -= 1
+                time.sleep(delay)
+
+        checksum = _sha256(temp_file_path)
+        if remote.checksum is not None and remote.checksum != checksum:
+            raise OSError(
+                f"The SHA256 checksum of {remote.filename} ({checksum}) "
+                f"differs from expected ({remote.checksum})."
+            )
+    except (Exception, KeyboardInterrupt):
+        os.unlink(temp_file.name)
+        raise
+
+    # The following renaming is atomic whenever temp_file_path and
+    # file_path are on the same filesystem. This should be the case most of
+    # the time, but we still use shutil.move instead of os.rename in case
+    # they are not.
+    shutil.move(temp_file_path, file_path)
 
-    file_path = remote.filename if dirname is None else join(dirname, remote.filename)
-    while True:
-        try:
-            urlretrieve(remote.url, file_path)
-            break
-        except (URLError, TimeoutError):
-            if n_retries == 0:
-                # If no more retries are left, re-raise the caught exception.
-                raise
-            warnings.warn(f"Retry downloading from url: {remote.url}")
-            n_retries -= 1
-            time.sleep(delay)
-
-    checksum = _sha256(file_path)
-    if remote.checksum != checksum:
-        raise OSError(
-            "{} has an SHA256 checksum ({}) "
-            "differing from expected ({}), "
-            "file may be corrupted.".format(file_path, checksum, remote.checksum)
-        )
     return file_path
+
+
+def _filter_filename(value, filter_dots=True):
+    """Derive a name that is safe to use as filename from the given string.
+
+    Adapted from the `slugify` function of django:
+    https://github.com/django/django/blob/master/django/utils/text.py
+
+    Convert spaces or repeated dashes to single dashes. Replace characters that
+    aren't alphanumerics, underscores, hyphens or dots by underscores. Convert
+    to lowercase. Also strip leading and trailing whitespace, dashes, and
+    underscores.
+    """
+    value = unicodedata.normalize("NFKD", value).lower()
+    if filter_dots:
+        value = re.sub(r"[^\w\s-]+", "_", value)
+    else:
+        value = re.sub(r"[^.\w\s-]+", "_", value)
+    value = re.sub(r"[\s-]+", "-", value)
+    return value.strip("-_.")
+
+
+def _derive_folder_and_filename_from_url(url):
+    parsed_url = urlparse(url)
+    if not parsed_url.hostname:
+        raise ValueError(f"Invalid URL: {url}")
+    folder_components = [_filter_filename(parsed_url.hostname, filter_dots=False)]
+    path = parsed_url.path
+
+    if "/" in path:
+        base_folder, raw_filename = path.rsplit("/", 1)
+
+        base_folder = _filter_filename(base_folder)
+        if base_folder:
+            folder_components.append(base_folder)
+    else:
+        raw_filename = path
+
+    filename = _filter_filename(raw_filename, filter_dots=False)
+    if not filename:
+        filename = "downloaded_file"
+
+    return "/".join(folder_components), filename
+
+
+def fetch_file(
+    url, folder=None, local_filename=None, sha256=None, n_retries=3, delay=1
+):
+    """Fetch a file from the web if not already present in the local folder.
+
+    If the file already exists locally (and the SHA256 checksums match when
+    provided), the path to the local file is returned without re-downloading.
+
+    .. versionadded:: 1.6
+
+    Parameters
+    ----------
+    url : str
+        URL of the file to download.
+
+    folder : str or Path, default=None
+        Directory to save the file to. If None, the file is downloaded in a
+        folder with a name derived from the URL host name and path under
+        scikit-learn data home folder.
+
+    local_filename : str, default=None
+        Name of the file to save. If None, the filename is inferred from the
+        URL.
+
+    sha256 : str, default=None
+        SHA256 checksum of the file. If None, no checksum is verified.
+
+    n_retries : int, default=3
+        Number of retries when HTTP errors are encountered.
+
+    delay : int, default=1
+        Number of seconds between retries.
+
+    Returns
+    -------
+    file_path : Path
+        Full path of the downloaded file.
+    """
+    folder_from_url, filename_from_url = _derive_folder_and_filename_from_url(url)
+
+    if local_filename is None:
+        local_filename = filename_from_url
+
+    if folder is None:
+        folder = Path(get_data_home()) / folder_from_url
+        makedirs(folder, exist_ok=True)
+
+    remote_metadata = RemoteFileMetadata(
+        filename=local_filename, url=url, checksum=sha256
+    )
+    return _fetch_remote(
+        remote_metadata, dirname=folder, n_retries=n_retries, delay=delay
+    )
diff --git a/sklearn/datasets/_california_housing.py b/sklearn/datasets/_california_housing.py
index a1e4b911f1bef..971d01b9c928b 100644
--- a/sklearn/datasets/_california_housing.py
+++ b/sklearn/datasets/_california_housing.py
@@ -19,8 +19,8 @@
 
 """
 
-# Authors: Peter Prettenhofer
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import logging
 import tarfile
diff --git a/sklearn/datasets/_covtype.py b/sklearn/datasets/_covtype.py
index 5d2055227141d..6a0138bafa9c5 100644
--- a/sklearn/datasets/_covtype.py
+++ b/sklearn/datasets/_covtype.py
@@ -10,9 +10,8 @@
 Courtesy of Jock A. Blackard and Colorado State University.
 """
 
-# Author: Lars Buitinck
-#         Peter Prettenhofer <peter.prettenhofer@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import logging
 import os
diff --git a/sklearn/datasets/_lfw.py b/sklearn/datasets/_lfw.py
index cb62288646d23..f504ed13203f6 100644
--- a/sklearn/datasets/_lfw.py
+++ b/sklearn/datasets/_lfw.py
@@ -6,8 +6,8 @@
     http://vis-www.cs.umass.edu/lfw/
 """
 
-# Copyright (c) 2011 Olivier Grisel <olivier.grisel@ensta.org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import logging
 from numbers import Integral, Real
@@ -281,6 +281,9 @@ def fetch_lfw_people(
     Features            real, between 0 and 255
     =================   =======================
 
+    For a usage example of this dataset, see
+    :ref:`sphx_glr_auto_examples_applications_plot_face_recognition.py`.
+
     Read more in the :ref:`User Guide <labeled_faces_in_the_wild_dataset>`.
 
     Parameters
diff --git a/sklearn/datasets/_olivetti_faces.py b/sklearn/datasets/_olivetti_faces.py
index b0051c1520169..efb382b1dcdda 100644
--- a/sklearn/datasets/_olivetti_faces.py
+++ b/sklearn/datasets/_olivetti_faces.py
@@ -10,8 +10,8 @@
     https://cs.nyu.edu/~roweis/
 """
 
-# Copyright (c) 2011 David Warde-Farley <wardefar at iro dot umontreal dot ca>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from numbers import Integral, Real
 from os import PathLike, makedirs, remove
diff --git a/sklearn/datasets/_rcv1.py b/sklearn/datasets/_rcv1.py
index c1b59b0a2c7cf..b673f938f0e46 100644
--- a/sklearn/datasets/_rcv1.py
+++ b/sklearn/datasets/_rcv1.py
@@ -5,8 +5,8 @@
     http://jmlr.csail.mit.edu/papers/volume5/lewis04a/
 """
 
-# Author: Tom Dupre la Tour
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import logging
 from gzip import GzipFile
diff --git a/sklearn/datasets/_samples_generator.py b/sklearn/datasets/_samples_generator.py
index 224978bd70770..1c9eed51c503f 100644
--- a/sklearn/datasets/_samples_generator.py
+++ b/sklearn/datasets/_samples_generator.py
@@ -2,9 +2,8 @@
 Generate samples of synthetic data sets.
 """
 
-# Authors: B. Thirion, G. Varoquaux, A. Gramfort, V. Michel, O. Grisel,
-#          G. Louppe, J. Nothman
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import array
 import numbers
@@ -1466,7 +1465,6 @@ def make_low_rank_matrix(
         "n_features": [Interval(Integral, 1, None, closed="left")],
         "n_nonzero_coefs": [Interval(Integral, 1, None, closed="left")],
         "random_state": ["random_state"],
-        "data_transposed": ["boolean", Hidden(StrOptions({"deprecated"}))],
     },
     prefer_skip_nested_validation=True,
 )
@@ -1477,13 +1475,12 @@ def make_sparse_coded_signal(
     n_features,
     n_nonzero_coefs,
     random_state=None,
-    data_transposed="deprecated",
 ):
     """Generate a signal as a sparse combination of dictionary elements.
 
-    Returns a matrix `Y = DX`, such that `D` is of shape `(n_features, n_components)`,
-    `X` is of shape `(n_components, n_samples)` and each column of `X` has exactly
-    `n_nonzero_coefs` non-zero elements.
+    Returns matrices `Y`, `D` and `X` such that `Y = XD` where `X` is of shape
+    `(n_samples, n_components)`, `D` is of shape `(n_components, n_features)`, and
+    each row of `X` has exactly `n_nonzero_coefs` non-zero elements.
 
     Read more in the :ref:`User Guide <sample_generators>`.
 
@@ -1506,33 +1503,17 @@ def make_sparse_coded_signal(
         for reproducible output across multiple function calls.
         See :term:`Glossary <random_state>`.
 
-    data_transposed : bool, default=False
-        By default, Y, D and X are not transposed.
-
-        .. versionadded:: 1.1
-
-        .. versionchanged:: 1.3
-            Default value changed from True to False.
-
-        .. deprecated:: 1.3
-            `data_transposed` is deprecated and will be removed in 1.5.
-
     Returns
     -------
-    data : ndarray of shape (n_features, n_samples) or (n_samples, n_features)
-        The encoded signal (Y). The shape is `(n_samples, n_features)` if
-        `data_transposed` is False, otherwise it's `(n_features, n_samples)`.
+    data : ndarray of shape (n_samples, n_features)
+        The encoded signal (Y).
 
-    dictionary : ndarray of shape (n_features, n_components) or \
-            (n_components, n_features)
-        The dictionary with normalized components (D). The shape is
-        `(n_components, n_features)` if `data_transposed` is False, otherwise it's
-        `(n_features, n_components)`.
+    dictionary : ndarray of shape (n_components, n_features)
+        The dictionary with normalized components (D).
 
-    code : ndarray of shape (n_components, n_samples) or (n_samples, n_components)
+    code : ndarray of shape (n_samples, n_components)
         The sparse code such that each column of this matrix has exactly
-        n_nonzero_coefs non-zero items (X). The shape is `(n_samples, n_components)`
-        if `data_transposed` is False, otherwise it's `(n_components, n_samples)`.
+        n_nonzero_coefs non-zero items (X).
 
     Examples
     --------
@@ -1568,19 +1549,8 @@ def make_sparse_coded_signal(
     # encode signal
     Y = np.dot(D, X)
 
-    # TODO(1.5) remove data_transposed
-    # raise warning if data_transposed is not passed explicitly
-    if data_transposed != "deprecated":
-        warnings.warn(
-            "data_transposed was deprecated in version 1.3 and will be removed in 1.5.",
-            FutureWarning,
-        )
-    else:
-        data_transposed = False
-
-    # transpose if needed
-    if not data_transposed:
-        Y, D, X = Y.T, D.T, X.T
+    # Transpose to have shapes consistent with the rest of the API
+    Y, D, X = Y.T, D.T, X.T
 
     return map(np.squeeze, (Y, D, X))
 
diff --git a/sklearn/datasets/_species_distributions.py b/sklearn/datasets/_species_distributions.py
index 2bd6f0207b069..ba1ebde0711f1 100644
--- a/sklearn/datasets/_species_distributions.py
+++ b/sklearn/datasets/_species_distributions.py
@@ -32,10 +32,8 @@
 <sphx_glr_auto_examples_applications_plot_species_distribution_modeling.py>`.
 """
 
-# Authors: Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#          Jake Vanderplas <vanderplas@astro.washington.edu>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import logging
 from io import BytesIO
diff --git a/sklearn/datasets/_svmlight_format_fast.pyx b/sklearn/datasets/_svmlight_format_fast.pyx
index 103d43bf88965..76a595407c11b 100644
--- a/sklearn/datasets/_svmlight_format_fast.pyx
+++ b/sklearn/datasets/_svmlight_format_fast.pyx
@@ -1,9 +1,7 @@
 # Optimized inner loop of load_svmlight_file.
 #
-# Authors: Mathieu Blondel <mathieu@mblondel.org>
-#          Lars Buitinck
-#          Olivier Grisel <olivier.grisel@ensta.org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import array
 from cpython cimport array
diff --git a/sklearn/datasets/_svmlight_format_io.py b/sklearn/datasets/_svmlight_format_io.py
index 795ef050e93dc..6db3842150132 100644
--- a/sklearn/datasets/_svmlight_format_io.py
+++ b/sklearn/datasets/_svmlight_format_io.py
@@ -10,10 +10,8 @@
 libsvm command line programs.
 """
 
-# Authors: Mathieu Blondel <mathieu@mblondel.org>
-#          Lars Buitinck
-#          Olivier Grisel <olivier.grisel@ensta.org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import os.path
 from contextlib import closing
@@ -25,22 +23,10 @@
 from .. import __version__
 from ..utils import check_array
 from ..utils._param_validation import HasMethods, Interval, StrOptions, validate_params
-from ..utils.fixes import _IS_PYPY
-
-if not _IS_PYPY:
-    from ._svmlight_format_fast import (
-        _dump_svmlight_file,
-        _load_svmlight_file,
-    )
-else:
-
-    def _load_svmlight_file(*args, **kwargs):
-        raise NotImplementedError(
-            "load_svmlight_file is currently not "
-            "compatible with PyPy (see "
-            "https://github.com/scikit-learn/scikit-learn/issues/11543 "
-            "for the status updates)."
-        )
+from ._svmlight_format_fast import (
+    _dump_svmlight_file,
+    _load_svmlight_file,
+)
 
 
 @validate_params(
diff --git a/sklearn/datasets/_twenty_newsgroups.py b/sklearn/datasets/_twenty_newsgroups.py
index 9156bb0018ff4..c8d8dd0960ff6 100644
--- a/sklearn/datasets/_twenty_newsgroups.py
+++ b/sklearn/datasets/_twenty_newsgroups.py
@@ -22,8 +22,8 @@
 uncompressed the train set is 52 MB and the test set is 34 MB.
 """
 
-# Copyright (c) 2011 Olivier Grisel <olivier.grisel@ensta.org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import codecs
 import logging
diff --git a/sklearn/datasets/descr/breast_cancer.rst b/sklearn/datasets/descr/breast_cancer.rst
index ceabd33e14ddc..cedfa9b4ff0f4 100644
--- a/sklearn/datasets/descr/breast_cancer.rst
+++ b/sklearn/datasets/descr/breast_cancer.rst
@@ -104,19 +104,15 @@ This database is also available through the UW CS ftp server:
 ftp ftp.cs.wisc.edu
 cd math-prog/cpo-dataset/machine-learn/WDBC/
 
-|details-start|
-**References**
-|details-split|
-
-- W.N. Street, W.H. Wolberg and O.L. Mangasarian. Nuclear feature extraction
-  for breast tumor diagnosis. IS&T/SPIE 1993 International Symposium on
-  Electronic Imaging: Science and Technology, volume 1905, pages 861-870,
-  San Jose, CA, 1993.
-- O.L. Mangasarian, W.N. Street and W.H. Wolberg. Breast cancer diagnosis and
-  prognosis via linear programming. Operations Research, 43(4), pages 570-577,
-  July-August 1995.
-- W.H. Wolberg, W.N. Street, and O.L. Mangasarian. Machine learning techniques
-  to diagnose breast cancer from fine-needle aspirates. Cancer Letters 77 (1994)
-  163-171.
-
-|details-end|
+.. dropdown:: References
+
+  - W.N. Street, W.H. Wolberg and O.L. Mangasarian. Nuclear feature extraction
+    for breast tumor diagnosis. IS&T/SPIE 1993 International Symposium on
+    Electronic Imaging: Science and Technology, volume 1905, pages 861-870,
+    San Jose, CA, 1993.
+  - O.L. Mangasarian, W.N. Street and W.H. Wolberg. Breast cancer diagnosis and
+    prognosis via linear programming. Operations Research, 43(4), pages 570-577,
+    July-August 1995.
+  - W.H. Wolberg, W.N. Street, and O.L. Mangasarian. Machine learning techniques
+    to diagnose breast cancer from fine-needle aspirates. Cancer Letters 77 (1994)
+    163-171.
diff --git a/sklearn/datasets/descr/california_housing.rst b/sklearn/datasets/descr/california_housing.rst
index 33ff111fef541..3173a057d1d5a 100644
--- a/sklearn/datasets/descr/california_housing.rst
+++ b/sklearn/datasets/descr/california_housing.rst
@@ -40,7 +40,7 @@ and many empty houses, such as vacation resorts.
 It can be downloaded/loaded using the
 :func:`sklearn.datasets.fetch_california_housing` function.
 
-.. topic:: References
+.. rubric:: References
 
-    - Pace, R. Kelley and Ronald Barry, Sparse Spatial Autoregressions,
-      Statistics and Probability Letters, 33 (1997) 291-297
+- Pace, R. Kelley and Ronald Barry, Sparse Spatial Autoregressions,
+  Statistics and Probability Letters, 33 (1997) 291-297
diff --git a/sklearn/datasets/descr/digits.rst b/sklearn/datasets/descr/digits.rst
index 3b07233721d69..7297584a1b4ac 100644
--- a/sklearn/datasets/descr/digits.rst
+++ b/sklearn/datasets/descr/digits.rst
@@ -32,19 +32,15 @@ T. Candela, D. L. Dimmick, J. Geist, P. J. Grother, S. A. Janet, and C.
 L. Wilson, NIST Form-Based Handprint Recognition System, NISTIR 5469,
 1994.
 
-|details-start|
-**References**
-|details-split|
-
-- C. Kaynak (1995) Methods of Combining Multiple Classifiers and Their
-  Applications to Handwritten Digit Recognition, MSc Thesis, Institute of
-  Graduate Studies in Science and Engineering, Bogazici University.
-- E. Alpaydin, C. Kaynak (1998) Cascading Classifiers, Kybernetika.
-- Ken Tang and Ponnuthurai N. Suganthan and Xi Yao and A. Kai Qin.
-  Linear dimensionalityreduction using relevance weighted LDA. School of
-  Electrical and Electronic Engineering Nanyang Technological University.
-  2005.
-- Claudio Gentile. A New Approximate Maximal Margin Classification
-  Algorithm. NIPS. 2000.
-
-|details-end|
+.. dropdown:: References
+
+  - C. Kaynak (1995) Methods of Combining Multiple Classifiers and Their
+    Applications to Handwritten Digit Recognition, MSc Thesis, Institute of
+    Graduate Studies in Science and Engineering, Bogazici University.
+  - E. Alpaydin, C. Kaynak (1998) Cascading Classifiers, Kybernetika.
+  - Ken Tang and Ponnuthurai N. Suganthan and Xi Yao and A. Kai Qin.
+    Linear dimensionalityreduction using relevance weighted LDA. School of
+    Electrical and Electronic Engineering Nanyang Technological University.
+    2005.
+  - Claudio Gentile. A New Approximate Maximal Margin Classification
+    Algorithm. NIPS. 2000.
diff --git a/sklearn/datasets/descr/iris.rst b/sklearn/datasets/descr/iris.rst
index 771c92faa9899..98651543620e6 100644
--- a/sklearn/datasets/descr/iris.rst
+++ b/sklearn/datasets/descr/iris.rst
@@ -45,23 +45,19 @@ data set contains 3 classes of 50 instances each, where each class refers to a
 type of iris plant.  One class is linearly separable from the other 2; the
 latter are NOT linearly separable from each other.
 
-|details-start|
-**References**
-|details-split|
-
-- Fisher, R.A. "The use of multiple measurements in taxonomic problems"
-  Annual Eugenics, 7, Part II, 179-188 (1936); also in "Contributions to
-  Mathematical Statistics" (John Wiley, NY, 1950).
-- Duda, R.O., & Hart, P.E. (1973) Pattern Classification and Scene Analysis.
-  (Q327.D83) John Wiley & Sons.  ISBN 0-471-22361-1.  See page 218.
-- Dasarathy, B.V. (1980) "Nosing Around the Neighborhood: A New System
-  Structure and Classification Rule for Recognition in Partially Exposed
-  Environments".  IEEE Transactions on Pattern Analysis and Machine
-  Intelligence, Vol. PAMI-2, No. 1, 67-71.
-- Gates, G.W. (1972) "The Reduced Nearest Neighbor Rule".  IEEE Transactions
-  on Information Theory, May 1972, 431-433.
-- See also: 1988 MLC Proceedings, 54-64.  Cheeseman et al"s AUTOCLASS II
-  conceptual clustering system finds 3 classes in the data.
-- Many, many more ...
-
-|details-end|
+.. dropdown:: References
+
+  - Fisher, R.A. "The use of multiple measurements in taxonomic problems"
+    Annual Eugenics, 7, Part II, 179-188 (1936); also in "Contributions to
+    Mathematical Statistics" (John Wiley, NY, 1950).
+  - Duda, R.O., & Hart, P.E. (1973) Pattern Classification and Scene Analysis.
+    (Q327.D83) John Wiley & Sons.  ISBN 0-471-22361-1.  See page 218.
+  - Dasarathy, B.V. (1980) "Nosing Around the Neighborhood: A New System
+    Structure and Classification Rule for Recognition in Partially Exposed
+    Environments".  IEEE Transactions on Pattern Analysis and Machine
+    Intelligence, Vol. PAMI-2, No. 1, 67-71.
+  - Gates, G.W. (1972) "The Reduced Nearest Neighbor Rule".  IEEE Transactions
+    on Information Theory, May 1972, 431-433.
+  - See also: 1988 MLC Proceedings, 54-64.  Cheeseman et al"s AUTOCLASS II
+    conceptual clustering system finds 3 classes in the data.
+  - Many, many more ...
diff --git a/sklearn/datasets/descr/kddcup99.rst b/sklearn/datasets/descr/kddcup99.rst
index fe8a0c8f4168c..0eae813be27a9 100644
--- a/sklearn/datasets/descr/kddcup99.rst
+++ b/sklearn/datasets/descr/kddcup99.rst
@@ -81,14 +81,14 @@ and the target values in ``target``. The "as_frame" optional argument converts
 ``data`` into a pandas DataFrame and ``target`` into a pandas Series. The
 dataset will be downloaded from the web if necessary.
 
-.. topic:: References
+.. rubric:: References
 
-    .. [2] Analysis and Results of the 1999 DARPA Off-Line Intrusion
-           Detection Evaluation, Richard Lippmann, Joshua W. Haines,
-           David J. Fried, Jonathan Korba, Kumar Das.
+.. [2] Analysis and Results of the 1999 DARPA Off-Line Intrusion
+       Detection Evaluation, Richard Lippmann, Joshua W. Haines,
+       David J. Fried, Jonathan Korba, Kumar Das.
 
-    .. [3] K. Yamanishi, J.-I. Takeuchi, G. Williams, and P. Milne. Online
-           unsupervised outlier detection using finite mixtures with
-           discounting learning algorithms. In Proceedings of the sixth
-           ACM SIGKDD international conference on Knowledge discovery
-           and data mining, pages 320-324. ACM Press, 2000.
+.. [3] K. Yamanishi, J.-I. Takeuchi, G. Williams, and P. Milne. Online
+       unsupervised outlier detection using finite mixtures with
+       discounting learning algorithms. In Proceedings of the sixth
+       ACM SIGKDD international conference on Knowledge discovery
+       and data mining, pages 320-324. ACM Press, 2000.
diff --git a/sklearn/datasets/descr/lfw.rst b/sklearn/datasets/descr/lfw.rst
index f7d80558be373..fc23c9566bd64 100644
--- a/sklearn/datasets/descr/lfw.rst
+++ b/sklearn/datasets/descr/lfw.rst
@@ -32,97 +32,93 @@ Dimensionality                         5828
 Features            real, between 0 and 255
 =================   =======================
 
-|details-start|
-**Usage**
-|details-split|
+.. dropdown:: Usage
 
-``scikit-learn`` provides two loaders that will automatically download,
-cache, parse the metadata files, decode the jpeg and convert the
-interesting slices into memmapped numpy arrays. This dataset size is more
-than 200 MB. The first load typically takes more than a couple of minutes
-to fully decode the relevant part of the JPEG files into numpy arrays. If
-the dataset has  been loaded once, the following times the loading times
-less than 200ms by using a memmapped version memoized on the disk in the
-``~/scikit_learn_data/lfw_home/`` folder using ``joblib``.
+  ``scikit-learn`` provides two loaders that will automatically download,
+  cache, parse the metadata files, decode the jpeg and convert the
+  interesting slices into memmapped numpy arrays. This dataset size is more
+  than 200 MB. The first load typically takes more than a couple of minutes
+  to fully decode the relevant part of the JPEG files into numpy arrays. If
+  the dataset has  been loaded once, the following times the loading times
+  less than 200ms by using a memmapped version memoized on the disk in the
+  ``~/scikit_learn_data/lfw_home/`` folder using ``joblib``.
 
-The first loader is used for the Face Identification task: a multi-class
-classification task (hence supervised learning)::
+  The first loader is used for the Face Identification task: a multi-class
+  classification task (hence supervised learning)::
 
-  >>> from sklearn.datasets import fetch_lfw_people
-  >>> lfw_people = fetch_lfw_people(min_faces_per_person=70, resize=0.4)
+    >>> from sklearn.datasets import fetch_lfw_people
+    >>> lfw_people = fetch_lfw_people(min_faces_per_person=70, resize=0.4)
 
-  >>> for name in lfw_people.target_names:
-  ...     print(name)
-  ...
-  Ariel Sharon
-  Colin Powell
-  Donald Rumsfeld
-  George W Bush
-  Gerhard Schroeder
-  Hugo Chavez
-  Tony Blair
+    >>> for name in lfw_people.target_names:
+    ...     print(name)
+    ...
+    Ariel Sharon
+    Colin Powell
+    Donald Rumsfeld
+    George W Bush
+    Gerhard Schroeder
+    Hugo Chavez
+    Tony Blair
 
-The default slice is a rectangular shape around the face, removing
-most of the background::
+  The default slice is a rectangular shape around the face, removing
+  most of the background::
 
-  >>> lfw_people.data.dtype
-  dtype('float32')
+    >>> lfw_people.data.dtype
+    dtype('float32')
 
-  >>> lfw_people.data.shape
-  (1288, 1850)
+    >>> lfw_people.data.shape
+    (1288, 1850)
 
-  >>> lfw_people.images.shape
-  (1288, 50, 37)
+    >>> lfw_people.images.shape
+    (1288, 50, 37)
 
-Each of the ``1140`` faces is assigned to a single person id in the ``target``
-array::
+  Each of the ``1140`` faces is assigned to a single person id in the ``target``
+  array::
 
-  >>> lfw_people.target.shape
-  (1288,)
+    >>> lfw_people.target.shape
+    (1288,)
 
-  >>> list(lfw_people.target[:10])
-  [5, 6, 3, 1, 0, 1, 3, 4, 3, 0]
+    >>> list(lfw_people.target[:10])
+    [5, 6, 3, 1, 0, 1, 3, 4, 3, 0]
 
-The second loader is typically used for the face verification task: each sample
-is a pair of two picture belonging or not to the same person::
+  The second loader is typically used for the face verification task: each sample
+  is a pair of two picture belonging or not to the same person::
 
-  >>> from sklearn.datasets import fetch_lfw_pairs
-  >>> lfw_pairs_train = fetch_lfw_pairs(subset='train')
+    >>> from sklearn.datasets import fetch_lfw_pairs
+    >>> lfw_pairs_train = fetch_lfw_pairs(subset='train')
 
-  >>> list(lfw_pairs_train.target_names)
-  ['Different persons', 'Same person']
+    >>> list(lfw_pairs_train.target_names)
+    ['Different persons', 'Same person']
 
-  >>> lfw_pairs_train.pairs.shape
-  (2200, 2, 62, 47)
+    >>> lfw_pairs_train.pairs.shape
+    (2200, 2, 62, 47)
 
-  >>> lfw_pairs_train.data.shape
-  (2200, 5828)
+    >>> lfw_pairs_train.data.shape
+    (2200, 5828)
 
-  >>> lfw_pairs_train.target.shape
-  (2200,)
+    >>> lfw_pairs_train.target.shape
+    (2200,)
 
-Both for the :func:`sklearn.datasets.fetch_lfw_people` and
-:func:`sklearn.datasets.fetch_lfw_pairs` function it is
-possible to get an additional dimension with the RGB color channels by
-passing ``color=True``, in that case the shape will be
-``(2200, 2, 62, 47, 3)``.
+  Both for the :func:`sklearn.datasets.fetch_lfw_people` and
+  :func:`sklearn.datasets.fetch_lfw_pairs` function it is
+  possible to get an additional dimension with the RGB color channels by
+  passing ``color=True``, in that case the shape will be
+  ``(2200, 2, 62, 47, 3)``.
 
-The :func:`sklearn.datasets.fetch_lfw_pairs` datasets is subdivided into
-3 subsets: the development ``train`` set, the development ``test`` set and
-an evaluation ``10_folds`` set meant to compute performance metrics using a
-10-folds cross validation scheme.
+  The :func:`sklearn.datasets.fetch_lfw_pairs` datasets is subdivided into
+  3 subsets: the development ``train`` set, the development ``test`` set and
+  an evaluation ``10_folds`` set meant to compute performance metrics using a
+  10-folds cross validation scheme.
 
-|details-end|
+.. rubric:: References
 
-.. topic:: References:
+* `Labeled Faces in the Wild: A Database for Studying Face Recognition
+  in Unconstrained Environments.
+  <http://vis-www.cs.umass.edu/lfw/lfw.pdf>`_
+  Gary B. Huang, Manu Ramesh, Tamara Berg, and Erik Learned-Miller.
+  University of Massachusetts, Amherst, Technical Report 07-49, October, 2007.
 
- * `Labeled Faces in the Wild: A Database for Studying Face Recognition
-   in Unconstrained Environments.
-   <http://vis-www.cs.umass.edu/lfw/lfw.pdf>`_
-   Gary B. Huang, Manu Ramesh, Tamara Berg, and Erik Learned-Miller.
-   University of Massachusetts, Amherst, Technical Report 07-49, October, 2007.
 
+.. rubric:: Examples
 
-.. topic:: Examples:
-
-   * :ref:`sphx_glr_auto_examples_applications_plot_face_recognition.py`
+* :ref:`sphx_glr_auto_examples_applications_plot_face_recognition.py`
diff --git a/sklearn/datasets/descr/linnerud.rst b/sklearn/datasets/descr/linnerud.rst
index 108611a4722ad..6deb231fe67a9 100644
--- a/sklearn/datasets/descr/linnerud.rst
+++ b/sklearn/datasets/descr/linnerud.rst
@@ -18,11 +18,7 @@ twenty middle-aged men in a fitness club:
 - *exercise* - CSV containing 20 observations on 3 exercise variables:
    Chins, Situps and Jumps.
 
-|details-start|
-**References**
-|details-split|
+.. dropdown:: References
 
-* Tenenhaus, M. (1998). La regression PLS: theorie et pratique. Paris:
-  Editions Technic.
-
-|details-end|
+   * Tenenhaus, M. (1998). La regression PLS: theorie et pratique. Paris:
+     Editions Technic.
diff --git a/sklearn/datasets/descr/rcv1.rst b/sklearn/datasets/descr/rcv1.rst
index 7cf3730a17554..3f14cf01934a0 100644
--- a/sklearn/datasets/descr/rcv1.rst
+++ b/sklearn/datasets/descr/rcv1.rst
@@ -65,8 +65,8 @@ The compressed size is about 656 MB.
 .. _rcv1 homepage: http://jmlr.csail.mit.edu/papers/volume5/lewis04a/
 
 
-.. topic:: References
+.. rubric:: References
 
-    .. [1] Lewis, D. D., Yang, Y., Rose, T. G., & Li, F. (2004).
-           RCV1: A new benchmark collection for text categorization research.
-           The Journal of Machine Learning Research, 5, 361-397.
+.. [1] Lewis, D. D., Yang, Y., Rose, T. G., & Li, F. (2004).
+       RCV1: A new benchmark collection for text categorization research.
+       The Journal of Machine Learning Research, 5, 361-397.
diff --git a/sklearn/datasets/descr/species_distributions.rst b/sklearn/datasets/descr/species_distributions.rst
index a2c2243de5567..c2c0014b875e9 100644
--- a/sklearn/datasets/descr/species_distributions.rst
+++ b/sklearn/datasets/descr/species_distributions.rst
@@ -29,8 +29,8 @@ of a species at a specific location.
 
 The dataset is provided by Phillips et. al. (2006).
 
-.. topic:: References
+.. rubric:: References
 
- * `"Maximum entropy modeling of species geographic distributions"
-   <http://rob.schapire.net/papers/ecolmod.pdf>`_ S. J. Phillips,
-   R. P. Anderson, R. E. Schapire - Ecological Modelling, 190:231-259, 2006.
+* `"Maximum entropy modeling of species geographic distributions"
+  <http://rob.schapire.net/papers/ecolmod.pdf>`_ S. J. Phillips,
+  R. P. Anderson, R. E. Schapire - Ecological Modelling, 190:231-259, 2006.
diff --git a/sklearn/datasets/descr/twenty_newsgroups.rst b/sklearn/datasets/descr/twenty_newsgroups.rst
index d1a049869dd7f..182272b888d45 100644
--- a/sklearn/datasets/descr/twenty_newsgroups.rst
+++ b/sklearn/datasets/descr/twenty_newsgroups.rst
@@ -27,204 +27,191 @@ Dimensionality               1
 Features                  text
 =================   ==========
 
-|details-start|
-**Usage**
-|details-split|
-
-The :func:`sklearn.datasets.fetch_20newsgroups` function is a data
-fetching / caching functions that downloads the data archive from
-the original `20 newsgroups website`_, extracts the archive contents
-in the ``~/scikit_learn_data/20news_home`` folder and calls the
-:func:`sklearn.datasets.load_files` on either the training or
-testing set folder, or both of them::
-
-  >>> from sklearn.datasets import fetch_20newsgroups
-  >>> newsgroups_train = fetch_20newsgroups(subset='train')
-
-  >>> from pprint import pprint
-  >>> pprint(list(newsgroups_train.target_names))
-  ['alt.atheism',
-   'comp.graphics',
-   'comp.os.ms-windows.misc',
-   'comp.sys.ibm.pc.hardware',
-   'comp.sys.mac.hardware',
-   'comp.windows.x',
-   'misc.forsale',
-   'rec.autos',
-   'rec.motorcycles',
-   'rec.sport.baseball',
-   'rec.sport.hockey',
-   'sci.crypt',
-   'sci.electronics',
-   'sci.med',
-   'sci.space',
-   'soc.religion.christian',
-   'talk.politics.guns',
-   'talk.politics.mideast',
-   'talk.politics.misc',
-   'talk.religion.misc']
-
-The real data lies in the ``filenames`` and ``target`` attributes. The target
-attribute is the integer index of the category::
-
-  >>> newsgroups_train.filenames.shape
-  (11314,)
-  >>> newsgroups_train.target.shape
-  (11314,)
-  >>> newsgroups_train.target[:10]
-  array([ 7,  4,  4,  1, 14, 16, 13,  3,  2,  4])
-
-It is possible to load only a sub-selection of the categories by passing the
-list of the categories to load to the
-:func:`sklearn.datasets.fetch_20newsgroups` function::
-
-  >>> cats = ['alt.atheism', 'sci.space']
-  >>> newsgroups_train = fetch_20newsgroups(subset='train', categories=cats)
-
-  >>> list(newsgroups_train.target_names)
-  ['alt.atheism', 'sci.space']
-  >>> newsgroups_train.filenames.shape
-  (1073,)
-  >>> newsgroups_train.target.shape
-  (1073,)
-  >>> newsgroups_train.target[:10]
-  array([0, 1, 1, 1, 0, 1, 1, 0, 0, 0])
-
-|details-end|
-
-|details-start|
-**Converting text to vectors**
-|details-split|
-
-In order to feed predictive or clustering models with the text data,
-one first need to turn the text into vectors of numerical values suitable
-for statistical analysis. This can be achieved with the utilities of the
-``sklearn.feature_extraction.text`` as demonstrated in the following
-example that extract `TF-IDF`_ vectors of unigram tokens
-from a subset of 20news::
-
-  >>> from sklearn.feature_extraction.text import TfidfVectorizer
-  >>> categories = ['alt.atheism', 'talk.religion.misc',
-  ...               'comp.graphics', 'sci.space']
-  >>> newsgroups_train = fetch_20newsgroups(subset='train',
-  ...                                       categories=categories)
-  >>> vectorizer = TfidfVectorizer()
-  >>> vectors = vectorizer.fit_transform(newsgroups_train.data)
-  >>> vectors.shape
-  (2034, 34118)
-
-The extracted TF-IDF vectors are very sparse, with an average of 159 non-zero
-components by sample in a more than 30000-dimensional space
-(less than .5% non-zero features)::
-
-  >>> vectors.nnz / float(vectors.shape[0])
-  159.01327...
-
-:func:`sklearn.datasets.fetch_20newsgroups_vectorized` is a function which
-returns ready-to-use token counts features instead of file names.
-
-.. _`20 newsgroups website`: http://people.csail.mit.edu/jrennie/20Newsgroups/
-.. _`TF-IDF`: https://en.wikipedia.org/wiki/Tf-idf
-
-|details-end|
-
-|details-start|
-**Filtering text for more realistic training**
-|details-split|
-
-It is easy for a classifier to overfit on particular things that appear in the
-20 Newsgroups data, such as newsgroup headers. Many classifiers achieve very
-high F-scores, but their results would not generalize to other documents that
-aren't from this window of time.
-
-For example, let's look at the results of a multinomial Naive Bayes classifier,
-which is fast to train and achieves a decent F-score::
-
-  >>> from sklearn.naive_bayes import MultinomialNB
-  >>> from sklearn import metrics
-  >>> newsgroups_test = fetch_20newsgroups(subset='test',
-  ...                                      categories=categories)
-  >>> vectors_test = vectorizer.transform(newsgroups_test.data)
-  >>> clf = MultinomialNB(alpha=.01)
-  >>> clf.fit(vectors, newsgroups_train.target)
-  MultinomialNB(alpha=0.01, class_prior=None, fit_prior=True)
-
-  >>> pred = clf.predict(vectors_test)
-  >>> metrics.f1_score(newsgroups_test.target, pred, average='macro')
-  0.88213...
-
-(The example :ref:`sphx_glr_auto_examples_text_plot_document_classification_20newsgroups.py` shuffles
-the training and test data, instead of segmenting by time, and in that case
-multinomial Naive Bayes gets a much higher F-score of 0.88. Are you suspicious
-yet of what's going on inside this classifier?)
-
-Let's take a look at what the most informative features are:
-
-  >>> import numpy as np
-  >>> def show_top10(classifier, vectorizer, categories):
-  ...     feature_names = vectorizer.get_feature_names_out()
-  ...     for i, category in enumerate(categories):
-  ...         top10 = np.argsort(classifier.coef_[i])[-10:]
-  ...         print("%s: %s" % (category, " ".join(feature_names[top10])))
-  ...
-  >>> show_top10(clf, vectorizer, newsgroups_train.target_names)
-  alt.atheism: edu it and in you that is of to the
-  comp.graphics: edu in graphics it is for and of to the
-  sci.space: edu it that is in and space to of the
-  talk.religion.misc: not it you in is that and to of the
-
-
-You can now see many things that these features have overfit to:
-
-- Almost every group is distinguished by whether headers such as
-  ``NNTP-Posting-Host:`` and ``Distribution:`` appear more or less often.
-- Another significant feature involves whether the sender is affiliated with
-  a university, as indicated either by their headers or their signature.
-- The word "article" is a significant feature, based on how often people quote
-  previous posts like this: "In article [article ID], [name] <[e-mail address]>
-  wrote:"
-- Other features match the names and e-mail addresses of particular people who
-  were posting at the time.
-
-With such an abundance of clues that distinguish newsgroups, the classifiers
-barely have to identify topics from text at all, and they all perform at the
-same high level.
-
-For this reason, the functions that load 20 Newsgroups data provide a
-parameter called **remove**, telling it what kinds of information to strip out
-of each file. **remove** should be a tuple containing any subset of
-``('headers', 'footers', 'quotes')``, telling it to remove headers, signature
-blocks, and quotation blocks respectively.
-
-  >>> newsgroups_test = fetch_20newsgroups(subset='test',
-  ...                                      remove=('headers', 'footers', 'quotes'),
-  ...                                      categories=categories)
-  >>> vectors_test = vectorizer.transform(newsgroups_test.data)
-  >>> pred = clf.predict(vectors_test)
-  >>> metrics.f1_score(pred, newsgroups_test.target, average='macro')
-  0.77310...
-
-This classifier lost over a lot of its F-score, just because we removed
-metadata that has little to do with topic classification.
-It loses even more if we also strip this metadata from the training data:
-
-  >>> newsgroups_train = fetch_20newsgroups(subset='train',
-  ...                                       remove=('headers', 'footers', 'quotes'),
-  ...                                       categories=categories)
-  >>> vectors = vectorizer.fit_transform(newsgroups_train.data)
-  >>> clf = MultinomialNB(alpha=.01)
-  >>> clf.fit(vectors, newsgroups_train.target)
-  MultinomialNB(alpha=0.01, class_prior=None, fit_prior=True)
-
-  >>> vectors_test = vectorizer.transform(newsgroups_test.data)
-  >>> pred = clf.predict(vectors_test)
-  >>> metrics.f1_score(newsgroups_test.target, pred, average='macro')
-  0.76995...
-
-Some other classifiers cope better with this harder version of the task. Try the
-:ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_text_feature_extraction.py`
-example with and without the `remove` option to compare the results.
-|details-end|
+.. dropdown:: Usage
+
+  The :func:`sklearn.datasets.fetch_20newsgroups` function is a data
+  fetching / caching functions that downloads the data archive from
+  the original `20 newsgroups website <http://people.csail.mit.edu/jrennie/20Newsgroups/>`__,
+  extracts the archive contents
+  in the ``~/scikit_learn_data/20news_home`` folder and calls the
+  :func:`sklearn.datasets.load_files` on either the training or
+  testing set folder, or both of them::
+
+    >>> from sklearn.datasets import fetch_20newsgroups
+    >>> newsgroups_train = fetch_20newsgroups(subset='train')
+
+    >>> from pprint import pprint
+    >>> pprint(list(newsgroups_train.target_names))
+    ['alt.atheism',
+     'comp.graphics',
+     'comp.os.ms-windows.misc',
+     'comp.sys.ibm.pc.hardware',
+     'comp.sys.mac.hardware',
+     'comp.windows.x',
+     'misc.forsale',
+     'rec.autos',
+     'rec.motorcycles',
+     'rec.sport.baseball',
+     'rec.sport.hockey',
+     'sci.crypt',
+     'sci.electronics',
+     'sci.med',
+     'sci.space',
+     'soc.religion.christian',
+     'talk.politics.guns',
+     'talk.politics.mideast',
+     'talk.politics.misc',
+     'talk.religion.misc']
+
+  The real data lies in the ``filenames`` and ``target`` attributes. The target
+  attribute is the integer index of the category::
+
+    >>> newsgroups_train.filenames.shape
+    (11314,)
+    >>> newsgroups_train.target.shape
+    (11314,)
+    >>> newsgroups_train.target[:10]
+    array([ 7,  4,  4,  1, 14, 16, 13,  3,  2,  4])
+
+  It is possible to load only a sub-selection of the categories by passing the
+  list of the categories to load to the
+  :func:`sklearn.datasets.fetch_20newsgroups` function::
+
+    >>> cats = ['alt.atheism', 'sci.space']
+    >>> newsgroups_train = fetch_20newsgroups(subset='train', categories=cats)
+
+    >>> list(newsgroups_train.target_names)
+    ['alt.atheism', 'sci.space']
+    >>> newsgroups_train.filenames.shape
+    (1073,)
+    >>> newsgroups_train.target.shape
+    (1073,)
+    >>> newsgroups_train.target[:10]
+    array([0, 1, 1, 1, 0, 1, 1, 0, 0, 0])
+
+.. dropdown:: Converting text to vectors
+
+  In order to feed predictive or clustering models with the text data,
+  one first need to turn the text into vectors of numerical values suitable
+  for statistical analysis. This can be achieved with the utilities of the
+  ``sklearn.feature_extraction.text`` as demonstrated in the following
+  example that extract `TF-IDF <https://en.wikipedia.org/wiki/Tf-idf>`__ vectors
+  of unigram tokens from a subset of 20news::
+
+    >>> from sklearn.feature_extraction.text import TfidfVectorizer
+    >>> categories = ['alt.atheism', 'talk.religion.misc',
+    ...               'comp.graphics', 'sci.space']
+    >>> newsgroups_train = fetch_20newsgroups(subset='train',
+    ...                                       categories=categories)
+    >>> vectorizer = TfidfVectorizer()
+    >>> vectors = vectorizer.fit_transform(newsgroups_train.data)
+    >>> vectors.shape
+    (2034, 34118)
+
+  The extracted TF-IDF vectors are very sparse, with an average of 159 non-zero
+  components by sample in a more than 30000-dimensional space
+  (less than .5% non-zero features)::
+
+    >>> vectors.nnz / float(vectors.shape[0])
+    159.01327...
+
+  :func:`sklearn.datasets.fetch_20newsgroups_vectorized` is a function which
+  returns ready-to-use token counts features instead of file names.
+
+.. dropdown:: Filtering text for more realistic training
+
+  It is easy for a classifier to overfit on particular things that appear in the
+  20 Newsgroups data, such as newsgroup headers. Many classifiers achieve very
+  high F-scores, but their results would not generalize to other documents that
+  aren't from this window of time.
+
+  For example, let's look at the results of a multinomial Naive Bayes classifier,
+  which is fast to train and achieves a decent F-score::
+
+    >>> from sklearn.naive_bayes import MultinomialNB
+    >>> from sklearn import metrics
+    >>> newsgroups_test = fetch_20newsgroups(subset='test',
+    ...                                      categories=categories)
+    >>> vectors_test = vectorizer.transform(newsgroups_test.data)
+    >>> clf = MultinomialNB(alpha=.01)
+    >>> clf.fit(vectors, newsgroups_train.target)
+    MultinomialNB(alpha=0.01, class_prior=None, fit_prior=True)
+
+    >>> pred = clf.predict(vectors_test)
+    >>> metrics.f1_score(newsgroups_test.target, pred, average='macro')
+    0.88213...
+
+  (The example :ref:`sphx_glr_auto_examples_text_plot_document_classification_20newsgroups.py` shuffles
+  the training and test data, instead of segmenting by time, and in that case
+  multinomial Naive Bayes gets a much higher F-score of 0.88. Are you suspicious
+  yet of what's going on inside this classifier?)
+
+  Let's take a look at what the most informative features are:
+
+    >>> import numpy as np
+    >>> def show_top10(classifier, vectorizer, categories):
+    ...     feature_names = vectorizer.get_feature_names_out()
+    ...     for i, category in enumerate(categories):
+    ...         top10 = np.argsort(classifier.coef_[i])[-10:]
+    ...         print("%s: %s" % (category, " ".join(feature_names[top10])))
+    ...
+    >>> show_top10(clf, vectorizer, newsgroups_train.target_names)
+    alt.atheism: edu it and in you that is of to the
+    comp.graphics: edu in graphics it is for and of to the
+    sci.space: edu it that is in and space to of the
+    talk.religion.misc: not it you in is that and to of the
+
+
+  You can now see many things that these features have overfit to:
+
+  - Almost every group is distinguished by whether headers such as
+    ``NNTP-Posting-Host:`` and ``Distribution:`` appear more or less often.
+  - Another significant feature involves whether the sender is affiliated with
+    a university, as indicated either by their headers or their signature.
+  - The word "article" is a significant feature, based on how often people quote
+    previous posts like this: "In article [article ID], [name] <[e-mail address]>
+    wrote:"
+  - Other features match the names and e-mail addresses of particular people who
+    were posting at the time.
+
+  With such an abundance of clues that distinguish newsgroups, the classifiers
+  barely have to identify topics from text at all, and they all perform at the
+  same high level.
+
+  For this reason, the functions that load 20 Newsgroups data provide a
+  parameter called **remove**, telling it what kinds of information to strip out
+  of each file. **remove** should be a tuple containing any subset of
+  ``('headers', 'footers', 'quotes')``, telling it to remove headers, signature
+  blocks, and quotation blocks respectively.
+
+    >>> newsgroups_test = fetch_20newsgroups(subset='test',
+    ...                                      remove=('headers', 'footers', 'quotes'),
+    ...                                      categories=categories)
+    >>> vectors_test = vectorizer.transform(newsgroups_test.data)
+    >>> pred = clf.predict(vectors_test)
+    >>> metrics.f1_score(pred, newsgroups_test.target, average='macro')
+    0.77310...
+
+  This classifier lost over a lot of its F-score, just because we removed
+  metadata that has little to do with topic classification.
+  It loses even more if we also strip this metadata from the training data:
+
+    >>> newsgroups_train = fetch_20newsgroups(subset='train',
+    ...                                       remove=('headers', 'footers', 'quotes'),
+    ...                                       categories=categories)
+    >>> vectors = vectorizer.fit_transform(newsgroups_train.data)
+    >>> clf = MultinomialNB(alpha=.01)
+    >>> clf.fit(vectors, newsgroups_train.target)
+    MultinomialNB(alpha=0.01, class_prior=None, fit_prior=True)
+
+    >>> vectors_test = vectorizer.transform(newsgroups_test.data)
+    >>> pred = clf.predict(vectors_test)
+    >>> metrics.f1_score(newsgroups_test.target, pred, average='macro')
+    0.76995...
+
+  Some other classifiers cope better with this harder version of the task. Try the
+  :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_text_feature_extraction.py`
+  example with and without the `remove` option to compare the results.
 
 .. topic:: Data Considerations
 
@@ -253,12 +240,9 @@ example with and without the `remove` option to compare the results.
     should be taken into consideration when using the dataset, reviewing the
     output, and the bias should be documented.
 
-.. topic:: Examples
+.. rubric:: Examples
 
-   * :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_text_feature_extraction.py`
-
-   * :ref:`sphx_glr_auto_examples_text_plot_document_classification_20newsgroups.py`
-
-   * :ref:`sphx_glr_auto_examples_text_plot_hashing_vs_dict_vectorizer.py`
-
-   * :ref:`sphx_glr_auto_examples_text_plot_document_clustering.py`
+* :ref:`sphx_glr_auto_examples_model_selection_plot_grid_search_text_feature_extraction.py`
+* :ref:`sphx_glr_auto_examples_text_plot_document_classification_20newsgroups.py`
+* :ref:`sphx_glr_auto_examples_text_plot_hashing_vs_dict_vectorizer.py`
+* :ref:`sphx_glr_auto_examples_text_plot_document_clustering.py`
diff --git a/sklearn/datasets/descr/wine_data.rst b/sklearn/datasets/descr/wine_data.rst
index 0325af6233c17..64efe49900ebf 100644
--- a/sklearn/datasets/descr/wine_data.rst
+++ b/sklearn/datasets/descr/wine_data.rst
@@ -73,26 +73,22 @@ Lichman, M. (2013). UCI Machine Learning Repository
 [https://archive.ics.uci.edu/ml]. Irvine, CA: University of California,
 School of Information and Computer Science.
 
-|details-start|
-**References**
-|details-split|
-
-(1) S. Aeberhard, D. Coomans and O. de Vel,
-Comparison of Classifiers in High Dimensional Settings,
-Tech. Rep. no. 92-02, (1992), Dept. of Computer Science and Dept. of
-Mathematics and Statistics, James Cook University of North Queensland.
-(Also submitted to Technometrics).
-
-The data was used with many others for comparing various
-classifiers. The classes are separable, though only RDA
-has achieved 100% correct classification.
-(RDA : 100%, QDA 99.4%, LDA 98.9%, 1NN 96.1% (z-transformed data))
-(All results using the leave-one-out technique)
-
-(2) S. Aeberhard, D. Coomans and O. de Vel,
-"THE CLASSIFICATION PERFORMANCE OF RDA"
-Tech. Rep. no. 92-01, (1992), Dept. of Computer Science and Dept. of
-Mathematics and Statistics, James Cook University of North Queensland.
-(Also submitted to Journal of Chemometrics).
-
-|details-end|
+.. dropdown:: References
+
+    (1) S. Aeberhard, D. Coomans and O. de Vel,
+    Comparison of Classifiers in High Dimensional Settings,
+    Tech. Rep. no. 92-02, (1992), Dept. of Computer Science and Dept. of
+    Mathematics and Statistics, James Cook University of North Queensland.
+    (Also submitted to Technometrics).
+
+    The data was used with many others for comparing various
+    classifiers. The classes are separable, though only RDA
+    has achieved 100% correct classification.
+    (RDA : 100%, QDA 99.4%, LDA 98.9%, 1NN 96.1% (z-transformed data))
+    (All results using the leave-one-out technique)
+
+    (2) S. Aeberhard, D. Coomans and O. de Vel,
+    "THE CLASSIFICATION PERFORMANCE OF RDA"
+    Tech. Rep. no. 92-01, (1992), Dept. of Computer Science and Dept. of
+    Mathematics and Statistics, James Cook University of North Queensland.
+    (Also submitted to Journal of Chemometrics).
diff --git a/sklearn/datasets/tests/test_base.py b/sklearn/datasets/tests/test_base.py
index b79f8c47c55c5..8b5231f68abdd 100644
--- a/sklearn/datasets/tests/test_base.py
+++ b/sklearn/datasets/tests/test_base.py
@@ -1,5 +1,7 @@
+import hashlib
 import io
 import os
+import re
 import shutil
 import tempfile
 import warnings
@@ -9,12 +11,14 @@
 from pickle import dumps, loads
 from unittest.mock import Mock
 from urllib.error import HTTPError
+from urllib.parse import urlparse
 
 import numpy as np
 import pytest
 
 from sklearn.datasets import (
     clear_data_home,
+    fetch_file,
     get_data_home,
     load_breast_cancer,
     load_diabetes,
@@ -28,6 +32,7 @@
 )
 from sklearn.datasets._base import (
     RemoteFileMetadata,
+    _derive_folder_and_filename_from_url,
     _fetch_remote,
     load_csv_data,
     load_gzip_compressed_csv_data,
@@ -391,3 +396,263 @@ def test_fetch_remote_raise_warnings_with_invalid_url(monkeypatch):
         for r in record:
             assert str(r.message) == f"Retry downloading from url: {url}"
         assert len(record) == 3
+
+
+def test_derive_folder_and_filename_from_url():
+    folder, filename = _derive_folder_and_filename_from_url(
+        "https://example.com/file.tar.gz"
+    )
+    assert folder == "example.com"
+    assert filename == "file.tar.gz"
+
+    folder, filename = _derive_folder_and_filename_from_url(
+        "https://example.com/نمونه نماینده.data"
+    )
+    assert folder == "example.com"
+    assert filename == "نمونه-نماینده.data"
+
+    folder, filename = _derive_folder_and_filename_from_url(
+        "https://example.com/path/to-/.file.tar.gz"
+    )
+    assert folder == "example.com/path_to"
+    assert filename == "file.tar.gz"
+
+    folder, filename = _derive_folder_and_filename_from_url("https://example.com/")
+    assert folder == "example.com"
+    assert filename == "downloaded_file"
+
+    folder, filename = _derive_folder_and_filename_from_url("https://example.com")
+    assert folder == "example.com"
+    assert filename == "downloaded_file"
+
+    folder, filename = _derive_folder_and_filename_from_url(
+        "https://example.com/path/@to/data.json?param=value"
+    )
+    assert folder == "example.com/path_to"
+    assert filename == "data.json"
+
+    folder, filename = _derive_folder_and_filename_from_url(
+        "https://example.com/path/@@to._/-_.data.json.#anchor"
+    )
+    assert folder == "example.com/path_to"
+    assert filename == "data.json"
+
+    folder, filename = _derive_folder_and_filename_from_url(
+        "https://example.com//some_file.txt"
+    )
+    assert folder == "example.com"
+    assert filename == "some_file.txt"
+
+    folder, filename = _derive_folder_and_filename_from_url(
+        "http://example/../some_file.txt"
+    )
+    assert folder == "example"
+    assert filename == "some_file.txt"
+
+    folder, filename = _derive_folder_and_filename_from_url(
+        "https://example.com/!.'.,/some_file.txt"
+    )
+    assert folder == "example.com"
+    assert filename == "some_file.txt"
+
+    folder, filename = _derive_folder_and_filename_from_url(
+        "https://example.com/a/!.'.,/b/some_file.txt"
+    )
+    assert folder == "example.com/a_b"
+    assert filename == "some_file.txt"
+
+    folder, filename = _derive_folder_and_filename_from_url("https://example.com/!.'.,")
+    assert folder == "example.com"
+    assert filename == "downloaded_file"
+
+    with pytest.raises(ValueError, match="Invalid URL"):
+        _derive_folder_and_filename_from_url("https:/../")
+
+
+def _mock_urlretrieve(server_side):
+    def _urlretrieve_mock(url, local_path):
+        server_root = Path(server_side)
+        file_path = urlparse(url).path.strip("/")
+        if not (server_root / file_path).exists():
+            raise HTTPError(url, 404, "Not Found", None, None)
+        shutil.copy(server_root / file_path, local_path)
+
+    return Mock(side_effect=_urlretrieve_mock)
+
+
+def test_fetch_file_using_data_home(monkeypatch, tmpdir):
+    tmpdir = Path(tmpdir)
+    server_side = tmpdir / "server_side"
+    server_side.mkdir()
+    data_file = server_side / "data.jsonl"
+    server_data = '{"a": 1, "b": 2}\n'
+    data_file.write_text(server_data, encoding="utf-8")
+
+    server_subfolder = server_side / "subfolder"
+    server_subfolder.mkdir()
+    other_data_file = server_subfolder / "other_file.txt"
+    other_data_file.write_text("Some important text data.", encoding="utf-8")
+
+    data_home = tmpdir / "data_home"
+    data_home.mkdir()
+
+    urlretrieve_mock = _mock_urlretrieve(server_side)
+    monkeypatch.setattr("sklearn.datasets._base.urlretrieve", urlretrieve_mock)
+
+    monkeypatch.setattr(
+        "sklearn.datasets._base.get_data_home", Mock(return_value=data_home)
+    )
+    fetched_file_path = fetch_file(
+        "https://example.com/data.jsonl",
+    )
+    assert fetched_file_path == data_home / "example.com" / "data.jsonl"
+    assert fetched_file_path.read_text(encoding="utf-8") == server_data
+
+    fetched_file_path = fetch_file(
+        "https://example.com/subfolder/other_file.txt",
+    )
+    assert (
+        fetched_file_path == data_home / "example.com" / "subfolder" / "other_file.txt"
+    )
+    assert fetched_file_path.read_text(encoding="utf-8") == other_data_file.read_text(
+        "utf-8"
+    )
+
+    expected_warning_msg = re.escape(
+        "Retry downloading from url: https://example.com/subfolder/invalid.txt"
+    )
+    with pytest.raises(HTTPError):
+        with pytest.warns(match=expected_warning_msg):
+            fetch_file(
+                "https://example.com/subfolder/invalid.txt",
+                delay=0,
+            )
+
+    local_subfolder = data_home / "example.com" / "subfolder"
+    assert sorted(local_subfolder.iterdir()) == [local_subfolder / "other_file.txt"]
+
+
+def test_fetch_file_without_sha256(monkeypatch, tmpdir):
+    server_side = tmpdir.mkdir("server_side")
+    data_file = Path(server_side / "data.jsonl")
+    server_data = '{"a": 1, "b": 2}\n'
+    data_file.write_text(server_data, encoding="utf-8")
+
+    client_side = tmpdir.mkdir("client_side")
+
+    urlretrieve_mock = _mock_urlretrieve(server_side)
+    monkeypatch.setattr("sklearn.datasets._base.urlretrieve", urlretrieve_mock)
+
+    # The first call should trigger a download:
+    fetched_file_path = fetch_file(
+        "https://example.com/data.jsonl",
+        folder=client_side,
+    )
+    assert fetched_file_path == client_side / "data.jsonl"
+    assert fetched_file_path.read_text(encoding="utf-8") == server_data
+    assert urlretrieve_mock.call_count == 1
+
+    # Fetching again the same file to the same folder should do nothing:
+    fetched_file_path = fetch_file(
+        "https://example.com/data.jsonl",
+        folder=client_side,
+    )
+    assert fetched_file_path == client_side / "data.jsonl"
+    assert fetched_file_path.read_text(encoding="utf-8") == server_data
+    assert urlretrieve_mock.call_count == 1
+
+    # Deleting and calling again should re-download
+    fetched_file_path.unlink()
+    fetched_file_path = fetch_file(
+        "https://example.com/data.jsonl",
+        folder=client_side,
+    )
+    assert fetched_file_path == client_side / "data.jsonl"
+    assert fetched_file_path.read_text(encoding="utf-8") == server_data
+    assert urlretrieve_mock.call_count == 2
+
+
+def test_fetch_file_with_sha256(monkeypatch, tmpdir):
+    server_side = tmpdir.mkdir("server_side")
+    data_file = Path(server_side / "data.jsonl")
+    server_data = '{"a": 1, "b": 2}\n'
+    data_file.write_text(server_data, encoding="utf-8")
+    expected_sha256 = hashlib.sha256(data_file.read_bytes()).hexdigest()
+
+    client_side = tmpdir.mkdir("client_side")
+
+    urlretrieve_mock = _mock_urlretrieve(server_side)
+    monkeypatch.setattr("sklearn.datasets._base.urlretrieve", urlretrieve_mock)
+
+    # The first call should trigger a download.
+    fetched_file_path = fetch_file(
+        "https://example.com/data.jsonl", folder=client_side, sha256=expected_sha256
+    )
+    assert fetched_file_path == client_side / "data.jsonl"
+    assert fetched_file_path.read_text(encoding="utf-8") == server_data
+    assert urlretrieve_mock.call_count == 1
+
+    # Fetching again the same file to the same folder should do nothing when
+    # the sha256 match:
+    fetched_file_path = fetch_file(
+        "https://example.com/data.jsonl", folder=client_side, sha256=expected_sha256
+    )
+    assert fetched_file_path == client_side / "data.jsonl"
+    assert fetched_file_path.read_text(encoding="utf-8") == server_data
+    assert urlretrieve_mock.call_count == 1
+
+    # Corrupting the local data should yield a warning and trigger a new download:
+    fetched_file_path.write_text("corrupted contents", encoding="utf-8")
+    expected_msg = (
+        r"SHA256 checksum of existing local file data.jsonl "
+        rf"\(.*\) differs from expected \({expected_sha256}\): "
+        r"re-downloading from https://example.com/data.jsonl \."
+    )
+    with pytest.warns(match=expected_msg):
+        fetched_file_path = fetch_file(
+            "https://example.com/data.jsonl", folder=client_side, sha256=expected_sha256
+        )
+        assert fetched_file_path == client_side / "data.jsonl"
+        assert fetched_file_path.read_text(encoding="utf-8") == server_data
+        assert urlretrieve_mock.call_count == 2
+
+    # Calling again should do nothing:
+    fetched_file_path = fetch_file(
+        "https://example.com/data.jsonl", folder=client_side, sha256=expected_sha256
+    )
+    assert fetched_file_path == client_side / "data.jsonl"
+    assert fetched_file_path.read_text(encoding="utf-8") == server_data
+    assert urlretrieve_mock.call_count == 2
+
+    # Deleting the local file and calling again should redownload without warning:
+    fetched_file_path.unlink()
+    fetched_file_path = fetch_file(
+        "https://example.com/data.jsonl", folder=client_side, sha256=expected_sha256
+    )
+    assert fetched_file_path == client_side / "data.jsonl"
+    assert fetched_file_path.read_text(encoding="utf-8") == server_data
+    assert urlretrieve_mock.call_count == 3
+
+    # Calling without a sha256 should also work without redownloading:
+    fetched_file_path = fetch_file(
+        "https://example.com/data.jsonl",
+        folder=client_side,
+    )
+    assert fetched_file_path == client_side / "data.jsonl"
+    assert fetched_file_path.read_text(encoding="utf-8") == server_data
+    assert urlretrieve_mock.call_count == 3
+
+    # Calling with a wrong sha256 should raise an informative exception:
+    non_matching_sha256 = "deadbabecafebeef"
+    expected_warning_msg = "differs from expected"
+    expected_error_msg = re.escape(
+        f"The SHA256 checksum of data.jsonl ({expected_sha256}) differs from "
+        f"expected ({non_matching_sha256})."
+    )
+    with pytest.raises(OSError, match=expected_error_msg):
+        with pytest.warns(match=expected_warning_msg):
+            fetch_file(
+                "https://example.com/data.jsonl",
+                folder=client_side,
+                sha256=non_matching_sha256,
+            )
diff --git a/sklearn/datasets/tests/test_openml.py b/sklearn/datasets/tests/test_openml.py
index 70bb33e22adb7..ee6d75861ada8 100644
--- a/sklearn/datasets/tests/test_openml.py
+++ b/sklearn/datasets/tests/test_openml.py
@@ -28,7 +28,6 @@
     SkipTest,
     assert_allclose,
     assert_array_equal,
-    fails_if_pypy,
 )
 
 OPENML_TEST_DATA_MODULE = "sklearn.datasets.tests.data.openml"
@@ -192,9 +191,6 @@ def _mock_urlopen(request, *args, **kwargs):
 # Test the behaviour of `fetch_openml` depending of the input parameters.
 
 
-# Known failure of PyPy for OpenML. See the following issue:
-# https://github.com/scikit-learn/scikit-learn/issues/18906
-@fails_if_pypy
 @pytest.mark.parametrize(
     "data_id, dataset_params, n_samples, n_features, n_targets",
     [
@@ -264,9 +260,6 @@ def test_fetch_openml_as_frame_true(
     assert bunch.categories is None
 
 
-# Known failure of PyPy for OpenML. See the following issue:
-# https://github.com/scikit-learn/scikit-learn/issues/18906
-@fails_if_pypy
 @pytest.mark.parametrize(
     "data_id, dataset_params, n_samples, n_features, n_targets",
     [
@@ -329,9 +322,6 @@ def test_fetch_openml_as_frame_false(
     assert isinstance(bunch.categories, dict)
 
 
-# Known failure of PyPy for OpenML. See the following issue:
-# https://github.com/scikit-learn/scikit-learn/issues/18906
-@fails_if_pypy
 @pytest.mark.parametrize("data_id", [61, 1119, 40945])
 def test_fetch_openml_consistency_parser(monkeypatch, data_id):
     """Check the consistency of the LIAC-ARFF and pandas parsers."""
@@ -396,9 +386,6 @@ def convert_numerical_and_categorical_dtypes(series):
     pd.testing.assert_frame_equal(frame_liac_with_fixed_dtypes, frame_pandas)
 
 
-# Known failure of PyPy for OpenML. See the following issue:
-# https://github.com/scikit-learn/scikit-learn/issues/18906
-@fails_if_pypy
 @pytest.mark.parametrize("parser", ["liac-arff", "pandas"])
 def test_fetch_openml_equivalence_array_dataframe(monkeypatch, parser):
     """Check the equivalence of the dataset when using `as_frame=False` and
@@ -426,9 +413,6 @@ def test_fetch_openml_equivalence_array_dataframe(monkeypatch, parser):
     assert_array_equal(bunch_as_frame_false.target, bunch_as_frame_true.target)
 
 
-# Known failure of PyPy for OpenML. See the following issue:
-# https://github.com/scikit-learn/scikit-learn/issues/18906
-@fails_if_pypy
 @pytest.mark.parametrize("parser", ["liac-arff", "pandas"])
 def test_fetch_openml_iris_pandas(monkeypatch, parser):
     """Check fetching on a numerical only dataset with string labels."""
@@ -477,9 +461,6 @@ def test_fetch_openml_iris_pandas(monkeypatch, parser):
     assert frame.index.is_unique
 
 
-# Known failure of PyPy for OpenML. See the following issue:
-# https://github.com/scikit-learn/scikit-learn/issues/18906
-@fails_if_pypy
 @pytest.mark.parametrize("parser", ["liac-arff", "pandas"])
 @pytest.mark.parametrize("target_column", ["petalwidth", ["petalwidth", "petallength"]])
 def test_fetch_openml_forcing_targets(monkeypatch, parser, target_column):
@@ -513,9 +494,6 @@ def test_fetch_openml_forcing_targets(monkeypatch, parser, target_column):
         assert bunch_forcing_target.data.shape == (150, 4)
 
 
-# Known failure of PyPy for OpenML. See the following issue:
-# https://github.com/scikit-learn/scikit-learn/issues/18906
-@fails_if_pypy
 @pytest.mark.parametrize("data_id", [61, 2, 561, 40589, 1119])
 @pytest.mark.parametrize("parser", ["liac-arff", "pandas"])
 def test_fetch_openml_equivalence_frame_return_X_y(monkeypatch, data_id, parser):
@@ -545,9 +523,6 @@ def test_fetch_openml_equivalence_frame_return_X_y(monkeypatch, data_id, parser)
         pd.testing.assert_frame_equal(bunch.target, y)
 
 
-# Known failure of PyPy for OpenML. See the following issue:
-# https://github.com/scikit-learn/scikit-learn/issues/18906
-@fails_if_pypy
 @pytest.mark.parametrize("data_id", [61, 561, 40589, 1119])
 @pytest.mark.parametrize("parser", ["liac-arff", "pandas"])
 def test_fetch_openml_equivalence_array_return_X_y(monkeypatch, data_id, parser):
@@ -574,9 +549,6 @@ def test_fetch_openml_equivalence_array_return_X_y(monkeypatch, data_id, parser)
     assert_array_equal(bunch.target, y)
 
 
-# Known failure of PyPy for OpenML. See the following issue:
-# https://github.com/scikit-learn/scikit-learn/issues/18906
-@fails_if_pypy
 def test_fetch_openml_difference_parsers(monkeypatch):
     """Check the difference between liac-arff and pandas parser."""
     pytest.importorskip("pandas")
@@ -900,9 +872,6 @@ def datasets_missing_values():
     }
 
 
-# Known failure of PyPy for OpenML. See the following issue:
-# https://github.com/scikit-learn/scikit-learn/issues/18906
-@fails_if_pypy
 @pytest.mark.parametrize(
     "data_id, parser, expected_n_categories, expected_n_floats, expected_n_ints",
     [
@@ -1055,9 +1024,6 @@ def test_fetch_openml_sparse_arff_error(monkeypatch, params, err_msg):
         )
 
 
-# Known failure of PyPy for OpenML. See the following issue:
-# https://github.com/scikit-learn/scikit-learn/issues/18906
-@fails_if_pypy
 @pytest.mark.filterwarnings("ignore:Version 1 of dataset Australian is inactive")
 @pytest.mark.parametrize(
     "data_id, data_type",
@@ -1076,9 +1042,6 @@ def test_fetch_openml_auto_mode(monkeypatch, data_id, data_type):
     assert isinstance(data.data, klass)
 
 
-# Known failure of PyPy for OpenML. See the following issue:
-# https://github.com/scikit-learn/scikit-learn/issues/18906
-@fails_if_pypy
 def test_convert_arff_data_dataframe_warning_low_memory_pandas(monkeypatch):
     """Check that we raise a warning regarding the working memory when using
     LIAC-ARFF parser."""
@@ -1487,9 +1450,6 @@ def _mock_urlopen_raise(request, *args, **kwargs):
     np.testing.assert_array_equal(y_fetched, y_cached)
 
 
-# Known failure of PyPy for OpenML. See the following issue:
-# https://github.com/scikit-learn/scikit-learn/issues/18906
-@fails_if_pypy
 @pytest.mark.parametrize(
     "as_frame, parser",
     [
diff --git a/sklearn/datasets/tests/test_samples_generator.py b/sklearn/datasets/tests/test_samples_generator.py
index 9a9cc41d7229c..a2524fd7561fe 100644
--- a/sklearn/datasets/tests/test_samples_generator.py
+++ b/sklearn/datasets/tests/test_samples_generator.py
@@ -33,7 +33,6 @@
     assert_almost_equal,
     assert_array_almost_equal,
     assert_array_equal,
-    ignore_warnings,
 )
 from sklearn.utils.validation import assert_all_finite
 
@@ -500,41 +499,6 @@ def test_make_sparse_coded_signal():
     assert_allclose(np.sqrt((D**2).sum(axis=1)), np.ones(D.shape[0]))
 
 
-# TODO(1.5): remove
-@ignore_warnings(category=FutureWarning)
-def test_make_sparse_coded_signal_transposed():
-    Y, D, X = make_sparse_coded_signal(
-        n_samples=5,
-        n_components=8,
-        n_features=10,
-        n_nonzero_coefs=3,
-        random_state=0,
-        data_transposed=True,
-    )
-    assert Y.shape == (10, 5), "Y shape mismatch"
-    assert D.shape == (10, 8), "D shape mismatch"
-    assert X.shape == (8, 5), "X shape mismatch"
-    for col in X.T:
-        assert len(np.flatnonzero(col)) == 3, "Non-zero coefs mismatch"
-    assert_allclose(Y, D @ X)
-    assert_allclose(np.sqrt((D**2).sum(axis=0)), np.ones(D.shape[1]))
-
-
-# TODO(1.5): remove
-def test_make_sparse_code_signal_deprecation_warning():
-    """Check the message for future deprecation."""
-    warn_msg = "data_transposed was deprecated in version 1.3"
-    with pytest.warns(FutureWarning, match=warn_msg):
-        make_sparse_coded_signal(
-            n_samples=1,
-            n_components=1,
-            n_features=1,
-            n_nonzero_coefs=1,
-            random_state=0,
-            data_transposed=True,
-        )
-
-
 def test_make_sparse_uncorrelated():
     X, y = make_sparse_uncorrelated(n_samples=5, n_features=10, random_state=0)
 
diff --git a/sklearn/datasets/tests/test_svmlight_format.py b/sklearn/datasets/tests/test_svmlight_format.py
index 5c641dd79cc63..ce19cc71da51c 100644
--- a/sklearn/datasets/tests/test_svmlight_format.py
+++ b/sklearn/datasets/tests/test_svmlight_format.py
@@ -17,7 +17,6 @@
     assert_array_almost_equal,
     assert_array_equal,
     create_memmap_backed_data,
-    fails_if_pypy,
 )
 from sklearn.utils.fixes import CSR_CONTAINERS
 
@@ -27,8 +26,6 @@
 invalidfile = "svmlight_invalid.txt"
 invalidfile2 = "svmlight_invalid_order.txt"
 
-pytestmark = fails_if_pypy
-
 
 def _svmlight_local_test_file_path(filename):
     return resources.files(TEST_DATA_MODULE) / filename
diff --git a/sklearn/decomposition/__init__.py b/sklearn/decomposition/__init__.py
index 3d33938a755a7..4730bda31ebbd 100644
--- a/sklearn/decomposition/__init__.py
+++ b/sklearn/decomposition/__init__.py
@@ -1,7 +1,7 @@
-"""
-The :mod:`sklearn.decomposition` module includes matrix decomposition
-algorithms, including among others PCA, NMF or ICA. Most of the algorithms of
-this module can be regarded as dimensionality reduction techniques.
+"""Matrix decomposition algorithms.
+
+These include PCA, NMF, ICA, and more. Most of the algorithms of this module can be
+regarded as dimensionality reduction techniques.
 """
 
 from ..utils.extmath import randomized_svd
diff --git a/sklearn/decomposition/_base.py b/sklearn/decomposition/_base.py
index 9fa720751774f..970294efe0184 100644
--- a/sklearn/decomposition/_base.py
+++ b/sklearn/decomposition/_base.py
@@ -1,22 +1,15 @@
 """Principal Component Analysis Base Classes"""
 
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#         Olivier Grisel <olivier.grisel@ensta.org>
-#         Mathieu Blondel <mathieu@mblondel.org>
-#         Denis A. Engemann <denis-alexander.engemann@inria.fr>
-#         Kyle Kastner <kastnerkyle@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from abc import ABCMeta, abstractmethod
 
 import numpy as np
 from scipy import linalg
-from scipy.sparse import issparse
 
 from ..base import BaseEstimator, ClassNamePrefixFeaturesOutMixin, TransformerMixin
-from ..utils._array_api import _add_to_diagonal, device, get_namespace
-from ..utils.sparsefuncs import _implicit_column_offset
+from ..utils._array_api import _fill_or_add_to_diagonal, device, get_namespace
 from ..utils.validation import check_is_fitted
 
 
@@ -54,7 +47,7 @@ def get_covariance(self):
             xp.asarray(0.0, device=device(exp_var)),
         )
         cov = (components_.T * exp_var_diff) @ components_
-        _add_to_diagonal(cov, self.noise_variance_, xp)
+        _fill_or_add_to_diagonal(cov, self.noise_variance_, xp)
         return cov
 
     def get_precision(self):
@@ -96,10 +89,10 @@ def get_precision(self):
             xp.asarray(0.0, device=device(exp_var)),
         )
         precision = components_ @ components_.T / self.noise_variance_
-        _add_to_diagonal(precision, 1.0 / exp_var_diff, xp)
+        _fill_or_add_to_diagonal(precision, 1.0 / exp_var_diff, xp)
         precision = components_.T @ linalg_inv(precision) @ components_
         precision /= -(self.noise_variance_**2)
-        _add_to_diagonal(precision, 1.0 / self.noise_variance_, xp)
+        _fill_or_add_to_diagonal(precision, 1.0 / self.noise_variance_, xp)
         return precision
 
     @abstractmethod
@@ -138,21 +131,33 @@ def transform(self, X):
             Projection of X in the first principal components, where `n_samples`
             is the number of samples and `n_components` is the number of the components.
         """
-        xp, _ = get_namespace(X)
+        xp, _ = get_namespace(X, self.components_, self.explained_variance_)
 
         check_is_fitted(self)
 
         X = self._validate_data(
-            X, accept_sparse=("csr", "csc"), dtype=[xp.float64, xp.float32], reset=False
+            X, dtype=[xp.float64, xp.float32], accept_sparse=("csr", "csc"), reset=False
         )
-        if self.mean_ is not None:
-            if issparse(X):
-                X = _implicit_column_offset(X, self.mean_)
-            else:
-                X = X - self.mean_
+        return self._transform(X, xp=xp, x_is_centered=False)
+
+    def _transform(self, X, xp, x_is_centered=False):
         X_transformed = X @ self.components_.T
+        if not x_is_centered:
+            # Apply the centering after the projection.
+            # For dense X this avoids copying or mutating the data passed by
+            # the caller.
+            # For sparse X it keeps sparsity and avoids having to wrap X into
+            # a linear operator.
+            X_transformed -= xp.reshape(self.mean_, (1, -1)) @ self.components_.T
         if self.whiten:
-            X_transformed /= xp.sqrt(self.explained_variance_)
+            # For some solvers (such as "arpack" and "covariance_eigh"), on
+            # rank deficient data, some components can have a variance
+            # arbitrarily close to zero, leading to non-finite results when
+            # whitening. To avoid this problem we clip the variance below.
+            scale = xp.sqrt(self.explained_variance_)
+            min_scale = xp.finfo(scale.dtype).eps
+            scale[scale < min_scale] = min_scale
+            X_transformed /= scale
         return X_transformed
 
     def inverse_transform(self, X):
diff --git a/sklearn/decomposition/_cdnmf_fast.pyx b/sklearn/decomposition/_cdnmf_fast.pyx
index 65db92171c75d..b2a07fb275bde 100644
--- a/sklearn/decomposition/_cdnmf_fast.pyx
+++ b/sklearn/decomposition/_cdnmf_fast.pyx
@@ -1,5 +1,5 @@
-# Author: Mathieu Blondel, Tom Dupre la Tour
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from cython cimport floating
 from libc.math cimport fabs
diff --git a/sklearn/decomposition/_dict_learning.py b/sklearn/decomposition/_dict_learning.py
index 267e1cbfe756b..f20d9bf42f52f 100644
--- a/sklearn/decomposition/_dict_learning.py
+++ b/sklearn/decomposition/_dict_learning.py
@@ -1,7 +1,7 @@
 """Dictionary learning."""
 
-# Author: Vlad Niculae, Gael Varoquaux, Alexandre Gramfort
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import itertools
 import sys
diff --git a/sklearn/decomposition/_factor_analysis.py b/sklearn/decomposition/_factor_analysis.py
index af3498d534483..df45606fe3de4 100644
--- a/sklearn/decomposition/_factor_analysis.py
+++ b/sklearn/decomposition/_factor_analysis.py
@@ -13,11 +13,8 @@
 Algorithm 21.1
 """
 
-# Author: Christian Osendorfer <osendorf@gmail.com>
-#         Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#         Denis A. Engemann <denis-alexander.engemann@inria.fr>
-
-# License: BSD3
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from math import log, sqrt
@@ -219,7 +216,9 @@ def fit(self, X, y=None):
         self : object
             FactorAnalysis class instance.
         """
-        X = self._validate_data(X, copy=self.copy, dtype=np.float64)
+        X = self._validate_data(
+            X, copy=self.copy, dtype=np.float64, force_writeable=True
+        )
 
         n_samples, n_features = X.shape
         n_components = self.n_components
diff --git a/sklearn/decomposition/_fastica.py b/sklearn/decomposition/_fastica.py
index a4f36e5ba87db..c923f66416a20 100644
--- a/sklearn/decomposition/_fastica.py
+++ b/sklearn/decomposition/_fastica.py
@@ -5,9 +5,8 @@
 Independent Component Analysis, by  Hyvarinen et al.
 """
 
-# Authors: Pierre Lafaye de Micheaux, Stefan van der Walt, Gael Varoquaux,
-#          Bertrand Thirion, Alexandre Gramfort, Denis A. Engemann
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from numbers import Integral, Real
diff --git a/sklearn/decomposition/_incremental_pca.py b/sklearn/decomposition/_incremental_pca.py
index 1089b2c54e086..8b345a797e452 100644
--- a/sklearn/decomposition/_incremental_pca.py
+++ b/sklearn/decomposition/_incremental_pca.py
@@ -1,8 +1,7 @@
 """Incremental Principal Components Analysis."""
 
-# Author: Kyle Kastner <kastnerkyle@gmail.com>
-#         Giorgio Patrini
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from numbers import Integral
 
@@ -229,6 +228,7 @@ def fit(self, X, y=None):
             accept_sparse=["csr", "csc", "lil"],
             copy=self.copy,
             dtype=[np.float64, np.float32],
+            force_writeable=True,
         )
         n_samples, n_features = X.shape
 
@@ -278,7 +278,11 @@ def partial_fit(self, X, y=None, check_input=True):
                     "or use IncrementalPCA.fit to do so in batches."
                 )
             X = self._validate_data(
-                X, copy=self.copy, dtype=[np.float64, np.float32], reset=first_pass
+                X,
+                copy=self.copy,
+                dtype=[np.float64, np.float32],
+                force_writeable=True,
+                reset=first_pass,
             )
         n_samples, n_features = X.shape
         if first_pass:
diff --git a/sklearn/decomposition/_kernel_pca.py b/sklearn/decomposition/_kernel_pca.py
index 8fc4aa26a6dfb..d8910f8f49e5d 100644
--- a/sklearn/decomposition/_kernel_pca.py
+++ b/sklearn/decomposition/_kernel_pca.py
@@ -1,8 +1,7 @@
 """Kernel Principal Components Analysis."""
 
-# Author: Mathieu Blondel <mathieu@mblondel.org>
-#         Sylvain Marie <sylvain.marie@schneider-electric.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from numbers import Integral, Real
 
@@ -30,10 +29,10 @@
 
 
 class KernelPCA(ClassNamePrefixFeaturesOutMixin, TransformerMixin, BaseEstimator):
-    """Kernel Principal component analysis (KPCA) [1]_.
+    """Kernel Principal component analysis (KPCA).
 
-    Non-linear dimensionality reduction through the use of kernels (see
-    :ref:`metrics`).
+    Non-linear dimensionality reduction through the use of kernels [1]_, see also
+    :ref:`metrics`.
 
     It uses the :func:`scipy.linalg.eigh` LAPACK implementation of the full SVD
     or the :func:`scipy.sparse.linalg.eigsh` ARPACK implementation of the
@@ -41,9 +40,13 @@ class KernelPCA(ClassNamePrefixFeaturesOutMixin, TransformerMixin, BaseEstimator
     components to extract. It can also use a randomized truncated SVD by the
     method proposed in [3]_, see `eigen_solver`.
 
-    For a usage example, see
+    For a usage example and comparison between
+    Principal Components Analysis (PCA) and its kernelized version (KPCA), see
     :ref:`sphx_glr_auto_examples_decomposition_plot_kernel_pca.py`.
 
+    For a usage example in denoising images using KPCA, see
+    :ref:`sphx_glr_auto_examples_applications_plot_digits_denoising.py`.
+
     Read more in the :ref:`User Guide <kernel_PCA>`.
 
     Parameters
@@ -321,10 +324,10 @@ def _get_kernel(self, X, Y=None):
             X, Y, metric=self.kernel, filter_params=True, n_jobs=self.n_jobs, **params
         )
 
-    def _fit_transform(self, K):
+    def _fit_transform_in_place(self, K):
         """Fit's using kernel K"""
-        # center kernel
-        K = self._centerer.fit_transform(K)
+        # center kernel in place
+        K = self._centerer.fit(K).transform(K, copy=False)
 
         # adjust n_components according to user inputs
         if self.n_components is None:
@@ -366,9 +369,7 @@ def _fit_transform(self, K):
         )
 
         # flip eigenvectors' sign to enforce deterministic output
-        self.eigenvectors_, _ = svd_flip(
-            self.eigenvectors_, np.zeros_like(self.eigenvectors_).T
-        )
+        self.eigenvectors_, _ = svd_flip(u=self.eigenvectors_, v=None)
 
         # sort eigenvectors in descending order
         indices = self.eigenvalues_.argsort()[::-1]
@@ -437,7 +438,9 @@ def fit(self, X, y=None):
         self.gamma_ = 1 / X.shape[1] if self.gamma is None else self.gamma
         self._centerer = KernelCenterer().set_output(transform="default")
         K = self._get_kernel(X)
-        self._fit_transform(K)
+        # When kernel="precomputed", K is X but it's safe to perform in place operations
+        # on K because a copy was made before if requested by copy_X.
+        self._fit_transform_in_place(K)
 
         if self.fit_inverse_transform:
             # no need to use the kernel to transform X, use shortcut expression
diff --git a/sklearn/decomposition/_lda.py b/sklearn/decomposition/_lda.py
index 4f91483a468a9..37b425a727a88 100644
--- a/sklearn/decomposition/_lda.py
+++ b/sklearn/decomposition/_lda.py
@@ -194,15 +194,14 @@ class LatentDirichletAllocation(
         In general, if the data size is large, the online update will be much
         faster than the batch update.
 
-        Valid options::
-
-            'batch': Batch variational Bayes method. Use all training data in
-                each EM update.
-                Old `components_` will be overwritten in each iteration.
-            'online': Online variational Bayes method. In each EM update, use
-                mini-batch of training data to update the ``components_``
-                variable incrementally. The learning rate is controlled by the
-                ``learning_decay`` and the ``learning_offset`` parameters.
+        Valid options:
+
+        - 'batch': Batch variational Bayes method. Use all training data in each EM
+          update. Old `components_` will be overwritten in each iteration.
+        - 'online': Online variational Bayes method. In each EM update, use mini-batch
+          of training data to update the ``components_`` variable incrementally. The
+          learning rate is controlled by the ``learning_decay`` and the
+          ``learning_offset`` parameters.
 
         .. versionchanged:: 0.20
             The default learning method is now ``"batch"``.
diff --git a/sklearn/decomposition/_nmf.py b/sklearn/decomposition/_nmf.py
index 75266c5f64b2b..76eff48de44d8 100644
--- a/sklearn/decomposition/_nmf.py
+++ b/sklearn/decomposition/_nmf.py
@@ -1,10 +1,7 @@
 """Non-negative matrix factorization."""
 
-# Author: Vlad Niculae
-#         Lars Buitinck
-#         Mathieu Blondel <mathieu@mblondel.org>
-#         Tom Dupre la Tour
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import itertools
 import time
@@ -32,6 +29,7 @@
     StrOptions,
     validate_params,
 )
+from ..utils.deprecation import _deprecate_Xt_in_inverse_transform
 from ..utils.extmath import randomized_svd, safe_sparse_dot, squared_norm
 from ..utils.validation import (
     check_is_fitted,
@@ -1139,9 +1137,9 @@ class _BaseNMF(ClassNamePrefixFeaturesOutMixin, TransformerMixin, BaseEstimator,
     """Base class for NMF and MiniBatchNMF."""
 
     # This prevents ``set_split_inverse_transform`` to be generated for the
-    # non-standard ``W`` arg on ``inverse_transform``.
-    # TODO: remove when W is removed in v1.5 for inverse_transform
-    __metadata_request__inverse_transform = {"W": metadata_routing.UNUSED}
+    # non-standard ``Xt`` arg on ``inverse_transform``.
+    # TODO(1.7): remove when Xt is removed in v1.7 for inverse_transform
+    __metadata_request__inverse_transform = {"Xt": metadata_routing.UNUSED}
 
     _parameter_constraints: dict = {
         "n_components": [
@@ -1310,44 +1308,32 @@ def fit(self, X, y=None, **params):
         self.fit_transform(X, **params)
         return self
 
-    def inverse_transform(self, Xt=None, W=None):
+    def inverse_transform(self, X=None, *, Xt=None):
         """Transform data back to its original space.
 
         .. versionadded:: 0.18
 
         Parameters
         ----------
-        Xt : {ndarray, sparse matrix} of shape (n_samples, n_components)
+        X : {ndarray, sparse matrix} of shape (n_samples, n_components)
             Transformed data matrix.
 
-        W : deprecated
-            Use `Xt` instead.
+        Xt : {ndarray, sparse matrix} of shape (n_samples, n_components)
+            Transformed data matrix.
 
-            .. deprecated:: 1.3
+            .. deprecated:: 1.5
+                `Xt` was deprecated in 1.5 and will be removed in 1.7. Use `X` instead.
 
         Returns
         -------
         X : ndarray of shape (n_samples, n_features)
             Returns a data matrix of the original shape.
         """
-        if Xt is None and W is None:
-            raise TypeError("Missing required positional argument: Xt")
 
-        if W is not None and Xt is not None:
-            raise ValueError("Please provide only `Xt`, and not `W`.")
-
-        if W is not None:
-            warnings.warn(
-                (
-                    "Input argument `W` was renamed to `Xt` in v1.3 and will be removed"
-                    " in v1.5."
-                ),
-                FutureWarning,
-            )
-            Xt = W
+        X = _deprecate_Xt_in_inverse_transform(X, Xt)
 
         check_is_fitted(self)
-        return Xt @ self.components_
+        return X @ self.components_
 
     @property
     def _n_features_out(self):
diff --git a/sklearn/decomposition/_pca.py b/sklearn/decomposition/_pca.py
index 4c49337e88093..ffbf42d32b2bc 100644
--- a/sklearn/decomposition/_pca.py
+++ b/sklearn/decomposition/_pca.py
@@ -1,13 +1,7 @@
 """Principal Component Analysis."""
 
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#         Olivier Grisel <olivier.grisel@ensta.org>
-#         Mathieu Blondel <mathieu@mblondel.org>
-#         Denis A. Engemann <denis-alexander.engemann@inria.fr>
-#         Michael Eickenberg <michael.eickenberg@inria.fr>
-#         Giorgio Patrini <giorgio.patrini@anu.edu.au>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from math import log, sqrt
 from numbers import Integral, Real
@@ -133,6 +127,10 @@ class PCA(_BasePCA):
     used (i.e. through :func:`scipy.sparse.linalg.svds`). Alternatively, one
     may consider :class:`TruncatedSVD` where the data are not centered.
 
+    Notice that this class only supports sparse inputs for some solvers such as
+    "arpack" and "covariance_eigh". See :class:`TruncatedSVD` for an
+    alternative with sparse data.
+
     For a usage example, see
     :ref:`sphx_glr_auto_examples_decomposition_plot_pca_iris.py`
 
@@ -176,26 +174,43 @@ class PCA(_BasePCA):
         improve the predictive accuracy of the downstream estimators by
         making their data respect some hard-wired assumptions.
 
-    svd_solver : {'auto', 'full', 'arpack', 'randomized'}, default='auto'
-        If auto :
-            The solver is selected by a default policy based on `X.shape` and
-            `n_components`: if the input data is larger than 500x500 and the
-            number of components to extract is lower than 80% of the smallest
-            dimension of the data, then the more efficient 'randomized'
-            method is enabled. Otherwise the exact full SVD is computed and
-            optionally truncated afterwards.
-        If full :
-            run exact full SVD calling the standard LAPACK solver via
+    svd_solver : {'auto', 'full', 'covariance_eigh', 'arpack', 'randomized'},\
+            default='auto'
+        "auto" :
+            The solver is selected by a default 'auto' policy is based on `X.shape` and
+            `n_components`: if the input data has fewer than 1000 features and
+            more than 10 times as many samples, then the "covariance_eigh"
+            solver is used. Otherwise, if the input data is larger than 500x500
+            and the number of components to extract is lower than 80% of the
+            smallest dimension of the data, then the more efficient
+            "randomized" method is selected. Otherwise the exact "full" SVD is
+            computed and optionally truncated afterwards.
+        "full" :
+            Run exact full SVD calling the standard LAPACK solver via
             `scipy.linalg.svd` and select the components by postprocessing
-        If arpack :
-            run SVD truncated to n_components calling ARPACK solver via
+        "covariance_eigh" :
+            Precompute the covariance matrix (on centered data), run a
+            classical eigenvalue decomposition on the covariance matrix
+            typically using LAPACK and select the components by postprocessing.
+            This solver is very efficient for n_samples >> n_features and small
+            n_features. It is, however, not tractable otherwise for large
+            n_features (large memory footprint required to materialize the
+            covariance matrix). Also note that compared to the "full" solver,
+            this solver effectively doubles the condition number and is
+            therefore less numerical stable (e.g. on input data with a large
+            range of singular values).
+        "arpack" :
+            Run SVD truncated to `n_components` calling ARPACK solver via
             `scipy.sparse.linalg.svds`. It requires strictly
-            0 < n_components < min(X.shape)
-        If randomized :
-            run randomized SVD by the method of Halko et al.
+            `0 < n_components < min(X.shape)`
+        "randomized" :
+            Run randomized SVD by the method of Halko et al.
 
         .. versionadded:: 0.18.0
 
+        .. versionchanged:: 1.5
+            Added the 'covariance_eigh' solver.
+
     tol : float, default=0.0
         Tolerance for singular values computed by svd_solver == 'arpack'.
         Must be of range [0.0, infinity).
@@ -370,7 +385,9 @@ class PCA(_BasePCA):
         ],
         "copy": ["boolean"],
         "whiten": ["boolean"],
-        "svd_solver": [StrOptions({"auto", "full", "arpack", "randomized"})],
+        "svd_solver": [
+            StrOptions({"auto", "full", "covariance_eigh", "arpack", "randomized"})
+        ],
         "tol": [Interval(Real, 0, None, closed="left")],
         "iterated_power": [
             StrOptions({"auto"}),
@@ -448,39 +465,50 @@ def fit_transform(self, X, y=None):
         This method returns a Fortran-ordered array. To convert it to a
         C-ordered array, use 'np.ascontiguousarray'.
         """
-        U, S, Vt = self._fit(X)
-        U = U[:, : self.n_components_]
+        U, S, _, X, x_is_centered, xp = self._fit(X)
+        if U is not None:
+            U = U[:, : self.n_components_]
 
-        if self.whiten:
-            # X_new = X * V / S * sqrt(n_samples) = U * sqrt(n_samples)
-            U *= sqrt(X.shape[0] - 1)
-        else:
-            # X_new = X * V = U * S * Vt * V = U * S
-            U *= S[: self.n_components_]
+            if self.whiten:
+                # X_new = X * V / S * sqrt(n_samples) = U * sqrt(n_samples)
+                U *= sqrt(X.shape[0] - 1)
+            else:
+                # X_new = X * V = U * S * Vt * V = U * S
+                U *= S[: self.n_components_]
 
-        return U
+            return U
+        else:  # solver="covariance_eigh" does not compute U at fit time.
+            return self._transform(X, xp, x_is_centered=x_is_centered)
 
     def _fit(self, X):
         """Dispatch to the right submethod depending on the chosen solver."""
         xp, is_array_api_compliant = get_namespace(X)
 
-        if issparse(X) and self.svd_solver not in {"arpack", "auto"}:
+        # Raise an error for sparse input and unsupported svd_solver
+        if issparse(X) and self.svd_solver not in ["auto", "arpack", "covariance_eigh"]:
             raise TypeError(
-                'PCA only support sparse inputs with the "arpack" solver, while '
-                f'"{self.svd_solver}" was passed. See TruncatedSVD for a possible'
-                " alternative."
+                'PCA only support sparse inputs with the "arpack" and'
+                f' "covariance_eigh" solvers, while "{self.svd_solver}" was passed. See'
+                " TruncatedSVD for a possible alternative."
             )
         if self.svd_solver == "arpack" and is_array_api_compliant:
             raise ValueError(
                 "PCA with svd_solver='arpack' is not supported for Array API inputs."
             )
 
+        # Validate the data, without ever forcing a copy as any solver that
+        # supports sparse input data and the `covariance_eigh` solver are
+        # written in a way to avoid the need for any inplace modification of
+        # the input data contrary to the other solvers.
+        # The copy will happen
+        # later, only if needed, once the solver negotiation below is done.
         X = self._validate_data(
             X,
             dtype=[xp.float64, xp.float32],
+            force_writeable=True,
             accept_sparse=("csr", "csc"),
             ensure_2d=True,
-            copy=self.copy,
+            copy=False,
         )
         self._fit_svd_solver = self.svd_solver
         if self._fit_svd_solver == "auto" and issparse(X):
@@ -495,8 +523,12 @@ def _fit(self, X):
             n_components = self.n_components
 
         if self._fit_svd_solver == "auto":
+            # Tall and skinny problems are best handled by precomputing the
+            # covariance matrix.
+            if X.shape[1] <= 1_000 and X.shape[0] >= 10 * X.shape[1]:
+                self._fit_svd_solver = "covariance_eigh"
             # Small problem or n_components == 'mle', just call full PCA
-            if max(X.shape) <= 500 or n_components == "mle":
+            elif max(X.shape) <= 500 or n_components == "mle":
                 self._fit_svd_solver = "full"
             elif 1 <= n_components < 0.8 * min(X.shape):
                 self._fit_svd_solver = "randomized"
@@ -504,15 +536,14 @@ def _fit(self, X):
             else:
                 self._fit_svd_solver = "full"
 
-        if self._fit_svd_solver == "full":
-            return self._fit_full(X, n_components)
+        # Call different fits for either full or truncated SVD
+        if self._fit_svd_solver in ("full", "covariance_eigh"):
+            return self._fit_full(X, n_components, xp, is_array_api_compliant)
         elif self._fit_svd_solver in ["arpack", "randomized"]:
-            return self._fit_truncated(X, n_components, self._fit_svd_solver)
+            return self._fit_truncated(X, n_components, xp)
 
-    def _fit_full(self, X, n_components):
+    def _fit_full(self, X, n_components, xp, is_array_api_compliant):
         """Fit the model by computing full SVD on X."""
-        xp, is_array_api_compliant = get_namespace(X)
-
         n_samples, n_features = X.shape
 
         if n_components == "mle":
@@ -522,33 +553,96 @@ def _fit_full(self, X, n_components):
                 )
         elif not 0 <= n_components <= min(n_samples, n_features):
             raise ValueError(
-                "n_components=%r must be between 0 and "
-                "min(n_samples, n_features)=%r with "
-                "svd_solver='full'" % (n_components, min(n_samples, n_features))
+                f"n_components={n_components} must be between 0 and "
+                f"min(n_samples, n_features)={min(n_samples, n_features)} with "
+                f"svd_solver={self._fit_svd_solver!r}"
             )
 
-        # Center data
         self.mean_ = xp.mean(X, axis=0)
-        X -= self.mean_
-
-        if not is_array_api_compliant:
-            # Use scipy.linalg with NumPy/SciPy inputs for the sake of not
-            # introducing unanticipated behavior changes. In the long run we
-            # could instead decide to always use xp.linalg.svd for all inputs,
-            # but that would make this code rely on numpy's SVD instead of
-            # scipy's. It's not 100% clear whether they use the same LAPACK
-            # solver by default though (assuming both are built against the
-            # same BLAS).
-            U, S, Vt = linalg.svd(X, full_matrices=False)
+        # When X is a scipy sparse matrix, self.mean_ is a numpy matrix, so we need
+        # to transform it to a 1D array. Note that this is not the case when X
+        # is a scipy sparse array.
+        # TODO: remove the following two lines when scikit-learn only depends
+        # on scipy versions that no longer support scipy.sparse matrices.
+        self.mean_ = xp.reshape(xp.asarray(self.mean_), (-1,))
+
+        if self._fit_svd_solver == "full":
+            X_centered = xp.asarray(X, copy=True) if self.copy else X
+            X_centered -= self.mean_
+            x_is_centered = not self.copy
+
+            if not is_array_api_compliant:
+                # Use scipy.linalg with NumPy/SciPy inputs for the sake of not
+                # introducing unanticipated behavior changes. In the long run we
+                # could instead decide to always use xp.linalg.svd for all inputs,
+                # but that would make this code rely on numpy's SVD instead of
+                # scipy's. It's not 100% clear whether they use the same LAPACK
+                # solver by default though (assuming both are built against the
+                # same BLAS).
+                U, S, Vt = linalg.svd(X_centered, full_matrices=False)
+            else:
+                U, S, Vt = xp.linalg.svd(X_centered, full_matrices=False)
+            explained_variance_ = (S**2) / (n_samples - 1)
+
         else:
-            U, S, Vt = xp.linalg.svd(X, full_matrices=False)
+            assert self._fit_svd_solver == "covariance_eigh"
+            # In the following, we center the covariance matrix C afterwards
+            # (without centering the data X first) to avoid an unnecessary copy
+            # of X. Note that the mean_ attribute is still needed to center
+            # test data in the transform method.
+            #
+            # Note: at the time of writing, `xp.cov` does not exist in the
+            # Array API standard:
+            # https://github.com/data-apis/array-api/issues/43
+            #
+            # Besides, using `numpy.cov`, as of numpy 1.26.0, would not be
+            # memory efficient for our use case when `n_samples >> n_features`:
+            # `numpy.cov` centers a copy of the data before computing the
+            # matrix product instead of subtracting a small `(n_features,
+            # n_features)` square matrix from the gram matrix X.T @ X, as we do
+            # below.
+            x_is_centered = False
+            C = X.T @ X
+            C -= (
+                n_samples
+                * xp.reshape(self.mean_, (-1, 1))
+                * xp.reshape(self.mean_, (1, -1))
+            )
+            C /= n_samples - 1
+            eigenvals, eigenvecs = xp.linalg.eigh(C)
+
+            # When X is a scipy sparse matrix, the following two datastructures
+            # are returned as instances of the soft-deprecated numpy.matrix
+            # class. Note that this problem does not occur when X is a scipy
+            # sparse array (or another other kind of supported array).
+            # TODO: remove the following two lines when scikit-learn only
+            # depends on scipy versions that no longer support scipy.sparse
+            # matrices.
+            eigenvals = xp.reshape(xp.asarray(eigenvals), (-1,))
+            eigenvecs = xp.asarray(eigenvecs)
+
+            eigenvals = xp.flip(eigenvals, axis=0)
+            eigenvecs = xp.flip(eigenvecs, axis=1)
+
+            # The covariance matrix C is positive semi-definite by
+            # construction. However, the eigenvalues returned by xp.linalg.eigh
+            # can be slightly negative due to numerical errors. This would be
+            # an issue for the subsequent sqrt, hence the manual clipping.
+            eigenvals[eigenvals < 0.0] = 0.0
+            explained_variance_ = eigenvals
+
+            # Re-construct SVD of centered X indirectly and make it consistent
+            # with the other solvers.
+            S = xp.sqrt(eigenvals * (n_samples - 1))
+            Vt = eigenvecs.T
+            U = None
+
         # flip eigenvectors' sign to enforce deterministic output
-        U, Vt = svd_flip(U, Vt)
+        U, Vt = svd_flip(U, Vt, u_based_decision=False)
 
         components_ = Vt
 
         # Get variance explained by singular values
-        explained_variance_ = (S**2) / (n_samples - 1)
         total_var = xp.sum(explained_variance_)
         explained_variance_ratio_ = explained_variance_ / total_var
         singular_values_ = xp.asarray(S, copy=True)  # Store the singular values.
@@ -588,22 +682,33 @@ def _fit_full(self, X, n_components):
             self.noise_variance_ = 0.0
 
         self.n_samples_ = n_samples
-        self.components_ = components_[:n_components, :]
         self.n_components_ = n_components
-        self.explained_variance_ = explained_variance_[:n_components]
-        self.explained_variance_ratio_ = explained_variance_ratio_[:n_components]
-        self.singular_values_ = singular_values_[:n_components]
+        # Assign a copy of the result of the truncation of the components in
+        # order to:
+        # - release the memory used by the discarded components,
+        # - ensure that the kept components are allocated contiguously in
+        #   memory to make the transform method faster by leveraging cache
+        #   locality.
+        self.components_ = xp.asarray(components_[:n_components, :], copy=True)
+
+        # We do the same for the other arrays for the sake of consistency.
+        self.explained_variance_ = xp.asarray(
+            explained_variance_[:n_components], copy=True
+        )
+        self.explained_variance_ratio_ = xp.asarray(
+            explained_variance_ratio_[:n_components], copy=True
+        )
+        self.singular_values_ = xp.asarray(singular_values_[:n_components], copy=True)
 
-        return U, S, Vt
+        return U, S, Vt, X, x_is_centered, xp
 
-    def _fit_truncated(self, X, n_components, svd_solver):
+    def _fit_truncated(self, X, n_components, xp):
         """Fit the model by computing truncated SVD (by ARPACK or randomized)
         on X.
         """
-        xp, _ = get_namespace(X)
-
         n_samples, n_features = X.shape
 
+        svd_solver = self._fit_svd_solver
         if isinstance(n_components, str):
             raise ValueError(
                 "n_components=%r cannot be a string with svd_solver='%s'"
@@ -631,31 +736,35 @@ def _fit_truncated(self, X, n_components, svd_solver):
         if issparse(X):
             self.mean_, var = mean_variance_axis(X, axis=0)
             total_var = var.sum() * n_samples / (n_samples - 1)  # ddof=1
-            X = _implicit_column_offset(X, self.mean_)
+            X_centered = _implicit_column_offset(X, self.mean_)
+            x_is_centered = False
         else:
             self.mean_ = xp.mean(X, axis=0)
-            X -= self.mean_
+            X_centered = xp.asarray(X, copy=True) if self.copy else X
+            X_centered -= self.mean_
+            x_is_centered = not self.copy
 
         if svd_solver == "arpack":
             v0 = _init_arpack_v0(min(X.shape), random_state)
-            U, S, Vt = svds(X, k=n_components, tol=self.tol, v0=v0)
+            U, S, Vt = svds(X_centered, k=n_components, tol=self.tol, v0=v0)
             # svds doesn't abide by scipy.linalg.svd/randomized_svd
             # conventions, so reverse its outputs.
             S = S[::-1]
             # flip eigenvectors' sign to enforce deterministic output
-            U, Vt = svd_flip(U[:, ::-1], Vt[::-1])
+            U, Vt = svd_flip(U[:, ::-1], Vt[::-1], u_based_decision=False)
 
         elif svd_solver == "randomized":
             # sign flipping is done inside
             U, S, Vt = randomized_svd(
-                X,
+                X_centered,
                 n_components=n_components,
                 n_oversamples=self.n_oversamples,
                 n_iter=self.iterated_power,
                 power_iteration_normalizer=self.power_iteration_normalizer,
-                flip_sign=True,
+                flip_sign=False,
                 random_state=random_state,
             )
+            U, Vt = svd_flip(U, Vt, u_based_decision=False)
 
         self.n_samples_ = n_samples
         self.components_ = Vt
@@ -673,8 +782,8 @@ def _fit_truncated(self, X, n_components, svd_solver):
         # See: https://github.com/scikit-learn/scikit-learn/pull/18689#discussion_r1335540991
         if total_var is None:
             N = X.shape[0] - 1
-            X **= 2
-            total_var = xp.sum(X) / N
+            X_centered **= 2
+            total_var = xp.sum(X_centered) / N
 
         self.explained_variance_ratio_ = self.explained_variance_ / total_var
         self.singular_values_ = xp.asarray(S, copy=True)  # Store the singular values.
@@ -685,7 +794,7 @@ def _fit_truncated(self, X, n_components, svd_solver):
         else:
             self.noise_variance_ = 0.0
 
-        return U, S, Vt
+        return U, S, Vt, X, x_is_centered, xp
 
     def score_samples(self, X):
         """Return the log-likelihood of each sample.
diff --git a/sklearn/decomposition/_sparse_pca.py b/sklearn/decomposition/_sparse_pca.py
index fa711ce8c0703..b33cbf03f8eed 100644
--- a/sklearn/decomposition/_sparse_pca.py
+++ b/sklearn/decomposition/_sparse_pca.py
@@ -1,7 +1,7 @@
 """Matrix factorization with Sparse PCA."""
 
-# Author: Vlad Niculae, Gael Varoquaux, Alexandre Gramfort
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from numbers import Integral, Real
 
@@ -325,7 +325,7 @@ def _fit(self, X, n_components, random_state):
             return_n_iter=True,
         )
         # flip eigenvectors' sign to enforce deterministic output
-        code, dictionary = svd_flip(code, dictionary, u_based_decision=False)
+        code, dictionary = svd_flip(code, dictionary, u_based_decision=True)
         self.components_ = code.T
         components_norm = np.linalg.norm(self.components_, axis=1)[:, np.newaxis]
         components_norm[components_norm == 0] = 1
diff --git a/sklearn/decomposition/_truncated_svd.py b/sklearn/decomposition/_truncated_svd.py
index d238f35cb2167..d978191f104f7 100644
--- a/sklearn/decomposition/_truncated_svd.py
+++ b/sklearn/decomposition/_truncated_svd.py
@@ -234,7 +234,8 @@ def fit_transform(self, X, y=None):
             # svds doesn't abide by scipy.linalg.svd/randomized_svd
             # conventions, so reverse its outputs.
             Sigma = Sigma[::-1]
-            U, VT = svd_flip(U[:, ::-1], VT[::-1])
+            # u_based_decision=False is needed to be consistent with PCA.
+            U, VT = svd_flip(U[:, ::-1], VT[::-1], u_based_decision=False)
 
         elif self.algorithm == "randomized":
             if self.n_components > X.shape[1]:
@@ -249,7 +250,9 @@ def fit_transform(self, X, y=None):
                 n_oversamples=self.n_oversamples,
                 power_iteration_normalizer=self.power_iteration_normalizer,
                 random_state=random_state,
+                flip_sign=False,
             )
+            U, VT = svd_flip(U, VT, u_based_decision=False)
 
         self.components_ = VT
 
diff --git a/sklearn/decomposition/meson.build b/sklearn/decomposition/meson.build
index e9f6a75e9ec9c..93dc6dff06e90 100644
--- a/sklearn/decomposition/meson.build
+++ b/sklearn/decomposition/meson.build
@@ -1,6 +1,6 @@
 py.extension_module(
   '_online_lda_fast',
-  '_online_lda_fast.pyx',
+  ['_online_lda_fast.pyx', utils_cython_tree],
   cython_args: cython_args,
   subdir: 'sklearn/decomposition',
   install: true
diff --git a/sklearn/decomposition/tests/test_factor_analysis.py b/sklearn/decomposition/tests/test_factor_analysis.py
index 2ff14f8d71722..76af7f8181598 100644
--- a/sklearn/decomposition/tests/test_factor_analysis.py
+++ b/sklearn/decomposition/tests/test_factor_analysis.py
@@ -1,6 +1,5 @@
-# Author: Christian Osendorfer <osendorf@gmail.com>
-#         Alexandre Gramfort <alexandre.gramfort@inria.fr>
-# License: BSD3
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from itertools import combinations
 
@@ -19,9 +18,9 @@
 
 # Ignore warnings from switching to more power iterations in randomized_svd
 @ignore_warnings
-def test_factor_analysis():
+def test_factor_analysis(global_random_seed):
     # Test FactorAnalysis ability to recover the data covariance structure
-    rng = np.random.RandomState(0)
+    rng = np.random.RandomState(global_random_seed)
     n_samples, n_features, n_components = 20, 5, 3
 
     # Some random settings for the generative model
@@ -57,7 +56,7 @@ def test_factor_analysis():
         # Model Covariance
         mcov = fa.get_covariance()
         diff = np.sum(np.abs(scov - mcov)) / W.size
-        assert diff < 0.1, "Mean absolute difference is %f" % diff
+        assert diff < 0.2, "Mean absolute difference is %f" % diff
         fa = FactorAnalysis(
             n_components=n_components, noise_variance_init=np.ones(n_features)
         )
diff --git a/sklearn/decomposition/tests/test_incremental_pca.py b/sklearn/decomposition/tests/test_incremental_pca.py
index 646aad2db795d..50ddf39b04503 100644
--- a/sklearn/decomposition/tests/test_incremental_pca.py
+++ b/sklearn/decomposition/tests/test_incremental_pca.py
@@ -4,7 +4,7 @@
 
 import numpy as np
 import pytest
-from numpy.testing import assert_array_equal
+from numpy.testing import assert_allclose, assert_array_equal
 
 from sklearn import datasets
 from sklearn.decomposition import PCA, IncrementalPCA
@@ -384,25 +384,38 @@ def test_singular_values():
     assert_array_almost_equal(ipca.singular_values_, [3.142, 2.718, 1.0], 14)
 
 
-def test_whitening():
+def test_whitening(global_random_seed):
     # Test that PCA and IncrementalPCA transforms match to sign flip.
     X = datasets.make_low_rank_matrix(
-        1000, 10, tail_strength=0.0, effective_rank=2, random_state=1999
+        1000, 10, tail_strength=0.0, effective_rank=2, random_state=global_random_seed
     )
-    prec = 3
-    n_samples, n_features = X.shape
+    atol = 1e-3
     for nc in [None, 9]:
         pca = PCA(whiten=True, n_components=nc).fit(X)
         ipca = IncrementalPCA(whiten=True, n_components=nc, batch_size=250).fit(X)
 
+        # Since the data is rank deficient, some components are pure noise. We
+        # should not expect those dimensions to carry any signal and their
+        # values might be arbitrarily changed by implementation details of the
+        # internal SVD solver. We therefore filter them out before comparison.
+        stable_mask = pca.explained_variance_ratio_ > 1e-12
+
         Xt_pca = pca.transform(X)
         Xt_ipca = ipca.transform(X)
-        assert_almost_equal(np.abs(Xt_pca), np.abs(Xt_ipca), decimal=prec)
+        assert_allclose(
+            np.abs(Xt_pca)[:, stable_mask],
+            np.abs(Xt_ipca)[:, stable_mask],
+            atol=atol,
+        )
+
+        # The noisy dimensions are in the null space of the inverse transform,
+        # so they are not influencing the reconstruction. We therefore don't
+        # need to apply the mask here.
         Xinv_ipca = ipca.inverse_transform(Xt_ipca)
         Xinv_pca = pca.inverse_transform(Xt_pca)
-        assert_almost_equal(X, Xinv_ipca, decimal=prec)
-        assert_almost_equal(X, Xinv_pca, decimal=prec)
-        assert_almost_equal(Xinv_pca, Xinv_ipca, decimal=prec)
+        assert_allclose(X, Xinv_ipca, atol=atol)
+        assert_allclose(X, Xinv_pca, atol=atol)
+        assert_allclose(Xinv_pca, Xinv_ipca, atol=atol)
 
 
 def test_incremental_pca_partial_fit_float_division():
diff --git a/sklearn/decomposition/tests/test_nmf.py b/sklearn/decomposition/tests/test_nmf.py
index 2112b59129e25..b6eb4f9b1becc 100644
--- a/sklearn/decomposition/tests/test_nmf.py
+++ b/sklearn/decomposition/tests/test_nmf.py
@@ -933,30 +933,31 @@ def test_minibatch_nmf_verbose():
         sys.stdout = old_stdout
 
 
-# TODO(1.5): remove this test
-def test_NMF_inverse_transform_W_deprecation():
-    rng = np.random.mtrand.RandomState(42)
+# TODO(1.7): remove this test
+@pytest.mark.parametrize("Estimator", [NMF, MiniBatchNMF])
+def test_NMF_inverse_transform_Xt_deprecation(Estimator):
+    rng = np.random.RandomState(42)
     A = np.abs(rng.randn(6, 5))
-    est = NMF(
+    est = Estimator(
         n_components=3,
         init="random",
         random_state=0,
         tol=1e-6,
     )
-    Xt = est.fit_transform(A)
+    X = est.fit_transform(A)
 
     with pytest.raises(TypeError, match="Missing required positional argument"):
         est.inverse_transform()
 
-    with pytest.raises(ValueError, match="Please provide only"):
-        est.inverse_transform(Xt=Xt, W=Xt)
+    with pytest.raises(TypeError, match="Cannot use both X and Xt. Use X only"):
+        est.inverse_transform(X=X, Xt=X)
 
     with warnings.catch_warnings(record=True):
         warnings.simplefilter("error")
-        est.inverse_transform(Xt)
+        est.inverse_transform(X)
 
-    with pytest.warns(FutureWarning, match="Input argument `W` was renamed to `Xt`"):
-        est.inverse_transform(W=Xt)
+    with pytest.warns(FutureWarning, match="Xt was renamed X in version 1.5"):
+        est.inverse_transform(Xt=X)
 
 
 @pytest.mark.parametrize("Estimator", [NMF, MiniBatchNMF])
diff --git a/sklearn/decomposition/tests/test_pca.py b/sklearn/decomposition/tests/test_pca.py
index b0fd32d1cbf62..bd7f60061abdc 100644
--- a/sklearn/decomposition/tests/test_pca.py
+++ b/sklearn/decomposition/tests/test_pca.py
@@ -8,7 +8,7 @@
 
 from sklearn import config_context, datasets
 from sklearn.base import clone
-from sklearn.datasets import load_iris, make_classification
+from sklearn.datasets import load_iris, make_classification, make_low_rank_matrix
 from sklearn.decomposition import PCA
 from sklearn.decomposition._pca import _assess_dimension, _infer_dimension
 from sklearn.utils._array_api import (
@@ -25,7 +25,7 @@
 from sklearn.utils.fixes import CSC_CONTAINERS, CSR_CONTAINERS
 
 iris = datasets.load_iris()
-PCA_SOLVERS = ["full", "arpack", "randomized", "auto"]
+PCA_SOLVERS = ["full", "covariance_eigh", "arpack", "randomized", "auto"]
 
 # `SPARSE_M` and `SPARSE_N` could be larger, but be aware:
 # * SciPy's generation of random sparse matrix can be costly
@@ -34,15 +34,18 @@
 SPARSE_MAX_COMPONENTS = min(SPARSE_M, SPARSE_N)
 
 
-def _check_fitted_pca_close(pca1, pca2, rtol):
-    assert_allclose(pca1.components_, pca2.components_, rtol=rtol)
-    assert_allclose(pca1.explained_variance_, pca2.explained_variance_, rtol=rtol)
-    assert_allclose(pca1.singular_values_, pca2.singular_values_, rtol=rtol)
-    assert_allclose(pca1.mean_, pca2.mean_, rtol=rtol)
-    assert_allclose(pca1.n_components_, pca2.n_components_, rtol=rtol)
-    assert_allclose(pca1.n_samples_, pca2.n_samples_, rtol=rtol)
-    assert_allclose(pca1.noise_variance_, pca2.noise_variance_, rtol=rtol)
-    assert_allclose(pca1.n_features_in_, pca2.n_features_in_, rtol=rtol)
+def _check_fitted_pca_close(pca1, pca2, rtol=1e-7, atol=1e-12):
+    assert_allclose(pca1.components_, pca2.components_, rtol=rtol, atol=atol)
+    assert_allclose(
+        pca1.explained_variance_, pca2.explained_variance_, rtol=rtol, atol=atol
+    )
+    assert_allclose(pca1.singular_values_, pca2.singular_values_, rtol=rtol, atol=atol)
+    assert_allclose(pca1.mean_, pca2.mean_, rtol=rtol, atol=atol)
+    assert_allclose(pca1.noise_variance_, pca2.noise_variance_, rtol=rtol, atol=atol)
+
+    assert pca1.n_components_ == pca2.n_components_
+    assert pca1.n_samples_ == pca2.n_samples_
+    assert pca1.n_features_in_ == pca2.n_features_in_
 
 
 @pytest.mark.parametrize("svd_solver", PCA_SOLVERS)
@@ -70,14 +73,17 @@ def test_pca(svd_solver, n_components):
 @pytest.mark.parametrize("density", [0.01, 0.1, 0.30])
 @pytest.mark.parametrize("n_components", [1, 2, 10])
 @pytest.mark.parametrize("sparse_container", CSR_CONTAINERS + CSC_CONTAINERS)
-@pytest.mark.parametrize("svd_solver", ["arpack"])
+@pytest.mark.parametrize("svd_solver", ["arpack", "covariance_eigh"])
 @pytest.mark.parametrize("scale", [1, 10, 100])
 def test_pca_sparse(
     global_random_seed, svd_solver, sparse_container, n_components, density, scale
 ):
-    # Make sure any tolerance changes pass with SKLEARN_TESTS_GLOBAL_RANDOM_SEED="all"
-    rtol = 5e-07
-    transform_rtol = 3e-05
+    """Check that the results are the same for sparse and dense input."""
+
+    # Set atol in addition of the default rtol to account for the very wide range of
+    # result values (1e-8 to 1e0).
+    atol = 1e-12
+    transform_atol = 1e-10
 
     random_state = np.random.default_rng(global_random_seed)
     X = sparse_container(
@@ -108,7 +114,7 @@ def test_pca_sparse(
     pcad.fit(Xd)
 
     # Fitted attributes equality
-    _check_fitted_pca_close(pca, pcad, rtol=rtol)
+    _check_fitted_pca_close(pca, pcad, atol=atol)
 
     # Test transform
     X2 = sparse_container(
@@ -121,8 +127,8 @@ def test_pca_sparse(
     )
     X2d = X2.toarray()
 
-    assert_allclose(pca.transform(X2), pca.transform(X2d), rtol=transform_rtol)
-    assert_allclose(pca.transform(X2), pcad.transform(X2d), rtol=transform_rtol)
+    assert_allclose(pca.transform(X2), pca.transform(X2d), atol=transform_atol)
+    assert_allclose(pca.transform(X2), pcad.transform(X2d), atol=transform_atol)
 
 
 @pytest.mark.parametrize("sparse_container", CSR_CONTAINERS + CSC_CONTAINERS)
@@ -153,10 +159,10 @@ def test_pca_sparse_fit_transform(global_random_seed, sparse_container):
     pca_fit.fit(X)
     transformed_X = pca_fit_transform.fit_transform(X)
 
-    _check_fitted_pca_close(pca_fit, pca_fit_transform, rtol=1e-10)
-    assert_allclose(transformed_X, pca_fit_transform.transform(X), rtol=2e-9)
-    assert_allclose(transformed_X, pca_fit.transform(X), rtol=2e-9)
-    assert_allclose(pca_fit.transform(X2), pca_fit_transform.transform(X2), rtol=2e-9)
+    _check_fitted_pca_close(pca_fit, pca_fit_transform)
+    assert_allclose(transformed_X, pca_fit_transform.transform(X))
+    assert_allclose(transformed_X, pca_fit.transform(X))
+    assert_allclose(pca_fit.transform(X2), pca_fit_transform.transform(X2))
 
 
 @pytest.mark.parametrize("svd_solver", ["randomized", "full"])
@@ -172,8 +178,8 @@ def test_sparse_pca_solver_error(global_random_seed, svd_solver, sparse_containe
     )
     pca = PCA(n_components=30, svd_solver=svd_solver)
     error_msg_pattern = (
-        f'PCA only support sparse inputs with the "arpack" solver, while "{svd_solver}"'
-        " was passed"
+        'PCA only support sparse inputs with the "arpack" and "covariance_eigh"'
+        f' solvers, while "{svd_solver}" was passed'
     )
     with pytest.raises(TypeError, match=error_msg_pattern):
         pca.fit(X)
@@ -263,35 +269,154 @@ def test_whitening(solver, copy):
     # we always center, so no test for non-centering.
 
 
-@pytest.mark.parametrize("svd_solver", ["arpack", "randomized"])
-def test_pca_explained_variance_equivalence_solver(svd_solver):
-    rng = np.random.RandomState(0)
-    n_samples, n_features = 100, 80
-    X = rng.randn(n_samples, n_features)
-
-    pca_full = PCA(n_components=2, svd_solver="full")
-    pca_other = PCA(n_components=2, svd_solver=svd_solver, random_state=0)
-
-    pca_full.fit(X)
-    pca_other.fit(X)
-
-    assert_allclose(
-        pca_full.explained_variance_, pca_other.explained_variance_, rtol=5e-2
+@pytest.mark.parametrize(
+    "other_svd_solver", sorted(list(set(PCA_SOLVERS) - {"full", "auto"}))
+)
+@pytest.mark.parametrize("data_shape", ["tall", "wide"])
+@pytest.mark.parametrize("rank_deficient", [False, True])
+@pytest.mark.parametrize("whiten", [False, True])
+def test_pca_solver_equivalence(
+    other_svd_solver,
+    data_shape,
+    rank_deficient,
+    whiten,
+    global_random_seed,
+    global_dtype,
+):
+    if data_shape == "tall":
+        n_samples, n_features = 100, 30
+    else:
+        n_samples, n_features = 30, 100
+    n_samples_test = 10
+
+    if rank_deficient:
+        rng = np.random.default_rng(global_random_seed)
+        rank = min(n_samples, n_features) // 2
+        X = rng.standard_normal(
+            size=(n_samples + n_samples_test, rank)
+        ) @ rng.standard_normal(size=(rank, n_features))
+    else:
+        X = make_low_rank_matrix(
+            n_samples=n_samples + n_samples_test,
+            n_features=n_features,
+            tail_strength=0.5,
+            random_state=global_random_seed,
+        )
+        # With a non-zero tail strength, the data is actually full-rank.
+        rank = min(n_samples, n_features)
+
+    X = X.astype(global_dtype, copy=False)
+    X_train, X_test = X[:n_samples], X[n_samples:]
+
+    if global_dtype == np.float32:
+        tols = dict(atol=3e-2, rtol=1e-5)
+        variance_threshold = 1e-5
+    else:
+        tols = dict(atol=1e-10, rtol=1e-12)
+        variance_threshold = 1e-12
+
+    extra_other_kwargs = {}
+    if other_svd_solver == "randomized":
+        # Only check for a truncated result with a large number of iterations
+        # to make sure that we can recover precise results.
+        n_components = 10
+        extra_other_kwargs = {"iterated_power": 50}
+    elif other_svd_solver == "arpack":
+        # Test all components except the last one which cannot be estimated by
+        # arpack.
+        n_components = np.minimum(n_samples, n_features) - 1
+    else:
+        # Test all components to high precision.
+        n_components = None
+
+    pca_full = PCA(n_components=n_components, svd_solver="full", whiten=whiten)
+    pca_other = PCA(
+        n_components=n_components,
+        svd_solver=other_svd_solver,
+        whiten=whiten,
+        random_state=global_random_seed,
+        **extra_other_kwargs,
     )
+    X_trans_full_train = pca_full.fit_transform(X_train)
+    assert np.isfinite(X_trans_full_train).all()
+    assert X_trans_full_train.dtype == global_dtype
+    X_trans_other_train = pca_other.fit_transform(X_train)
+    assert np.isfinite(X_trans_other_train).all()
+    assert X_trans_other_train.dtype == global_dtype
+
+    assert (pca_full.explained_variance_ >= 0).all()
+    assert_allclose(pca_full.explained_variance_, pca_other.explained_variance_, **tols)
     assert_allclose(
         pca_full.explained_variance_ratio_,
         pca_other.explained_variance_ratio_,
-        rtol=5e-2,
+        **tols,
+    )
+    reference_components = pca_full.components_
+    assert np.isfinite(reference_components).all()
+    other_components = pca_other.components_
+    assert np.isfinite(other_components).all()
+
+    # For some choice of n_components and data distribution, some components
+    # might be pure noise, let's ignore them in the comparison:
+    stable = pca_full.explained_variance_ > variance_threshold
+    assert stable.sum() > 1
+    assert_allclose(reference_components[stable], other_components[stable], **tols)
+
+    # As a result the output of fit_transform should be the same:
+    assert_allclose(
+        X_trans_other_train[:, stable], X_trans_full_train[:, stable], **tols
     )
 
+    # And similarly for the output of transform on new data (except for the
+    # last component that can be underdetermined):
+    X_trans_full_test = pca_full.transform(X_test)
+    assert np.isfinite(X_trans_full_test).all()
+    assert X_trans_full_test.dtype == global_dtype
+    X_trans_other_test = pca_other.transform(X_test)
+    assert np.isfinite(X_trans_other_test).all()
+    assert X_trans_other_test.dtype == global_dtype
+    assert_allclose(X_trans_other_test[:, stable], X_trans_full_test[:, stable], **tols)
+
+    # Check that inverse transform reconstructions for both solvers are
+    # compatible.
+    X_recons_full_test = pca_full.inverse_transform(X_trans_full_test)
+    assert np.isfinite(X_recons_full_test).all()
+    assert X_recons_full_test.dtype == global_dtype
+    X_recons_other_test = pca_other.inverse_transform(X_trans_other_test)
+    assert np.isfinite(X_recons_other_test).all()
+    assert X_recons_other_test.dtype == global_dtype
+
+    if pca_full.components_.shape[0] == pca_full.components_.shape[1]:
+        # In this case, the models should have learned the same invertible
+        # transform. They should therefore both be able to reconstruct the test
+        # data.
+        assert_allclose(X_recons_full_test, X_test, **tols)
+        assert_allclose(X_recons_other_test, X_test, **tols)
+    elif pca_full.components_.shape[0] < rank:
+        # In the absence of noisy components, both models should be able to
+        # reconstruct the same low-rank approximation of the original data.
+        assert pca_full.explained_variance_.min() > variance_threshold
+        assert_allclose(X_recons_full_test, X_recons_other_test, **tols)
+    else:
+        # When n_features > n_samples and n_components is larger than the rank
+        # of the training set, the output of the `inverse_transform` function
+        # is ill-defined. We can only check that we reach the same fixed point
+        # after another round of transform:
+        assert_allclose(
+            pca_full.transform(X_recons_full_test)[:, stable],
+            pca_other.transform(X_recons_other_test)[:, stable],
+            **tols,
+        )
+
 
 @pytest.mark.parametrize(
     "X",
     [
         np.random.RandomState(0).randn(100, 80),
         datasets.make_classification(100, 80, n_informative=78, random_state=0)[0],
+        np.random.RandomState(0).randn(10, 100),
     ],
-    ids=["random-data", "correlated-data"],
+    ids=["random-tall", "correlated-tall", "random-wide"],
 )
 @pytest.mark.parametrize("svd_solver", PCA_SOLVERS)
 def test_pca_explained_variance_empirical(X, svd_solver):
@@ -629,23 +754,28 @@ def test_pca_zero_noise_variance_edge_cases(svd_solver):
 
 
 @pytest.mark.parametrize(
-    "data, n_components, expected_solver",
-    [  # case: n_components in (0,1) => 'full'
-        (np.random.RandomState(0).uniform(size=(1000, 50)), 0.5, "full"),
-        # case: max(X.shape) <= 500 => 'full'
-        (np.random.RandomState(0).uniform(size=(10, 50)), 5, "full"),
+    "n_samples, n_features, n_components, expected_solver",
+    [
+        # case: n_samples < 10 * n_features and max(X.shape) <= 500 => 'full'
+        (10, 50, 5, "full"),
+        # case: n_samples > 10 * n_features and n_features < 500 => 'covariance_eigh'
+        (1000, 50, 50, "covariance_eigh"),
         # case: n_components >= .8 * min(X.shape) => 'full'
-        (np.random.RandomState(0).uniform(size=(1000, 50)), 50, "full"),
+        (1000, 500, 400, "full"),
         # n_components >= 1 and n_components < .8*min(X.shape) => 'randomized'
-        (np.random.RandomState(0).uniform(size=(1000, 50)), 10, "randomized"),
+        (1000, 500, 10, "randomized"),
+        # case: n_components in (0,1) => 'full'
+        (1000, 500, 0.5, "full"),
     ],
 )
-def test_pca_svd_solver_auto(data, n_components, expected_solver):
+def test_pca_svd_solver_auto(n_samples, n_features, n_components, expected_solver):
+    data = np.random.RandomState(0).uniform(size=(n_samples, n_features))
     pca_auto = PCA(n_components=n_components, random_state=0)
     pca_test = PCA(
         n_components=n_components, svd_solver=expected_solver, random_state=0
     )
     pca_auto.fit(data)
+    assert pca_auto._fit_svd_solver == expected_solver
     pca_test.fit(data)
     assert_allclose(pca_auto.components_, pca_test.components_)
 
@@ -663,28 +793,33 @@ def test_pca_deterministic_output(svd_solver):
 
 
 @pytest.mark.parametrize("svd_solver", PCA_SOLVERS)
-def test_pca_dtype_preservation(svd_solver):
-    check_pca_float_dtype_preservation(svd_solver)
+def test_pca_dtype_preservation(svd_solver, global_random_seed):
+    check_pca_float_dtype_preservation(svd_solver, global_random_seed)
     check_pca_int_dtype_upcast_to_double(svd_solver)
 
 
-def check_pca_float_dtype_preservation(svd_solver):
+def check_pca_float_dtype_preservation(svd_solver, seed):
     # Ensure that PCA does not upscale the dtype when input is float32
-    X_64 = np.random.RandomState(0).rand(1000, 4).astype(np.float64, copy=False)
-    X_32 = X_64.astype(np.float32)
+    X = np.random.RandomState(seed).rand(1000, 4)
+    X_float64 = X.astype(np.float64, copy=False)
+    X_float32 = X.astype(np.float32)
 
-    pca_64 = PCA(n_components=3, svd_solver=svd_solver, random_state=0).fit(X_64)
-    pca_32 = PCA(n_components=3, svd_solver=svd_solver, random_state=0).fit(X_32)
+    pca_64 = PCA(n_components=3, svd_solver=svd_solver, random_state=seed).fit(
+        X_float64
+    )
+    pca_32 = PCA(n_components=3, svd_solver=svd_solver, random_state=seed).fit(
+        X_float32
+    )
 
     assert pca_64.components_.dtype == np.float64
     assert pca_32.components_.dtype == np.float32
-    assert pca_64.transform(X_64).dtype == np.float64
-    assert pca_32.transform(X_32).dtype == np.float32
+    assert pca_64.transform(X_float64).dtype == np.float64
+    assert pca_32.transform(X_float32).dtype == np.float32
 
-    # the rtol is set such that the test passes on all platforms tested on
-    # conda-forge: PR#15775
-    # see: https://github.com/conda-forge/scikit-learn-feedstock/pull/113
-    assert_allclose(pca_64.components_, pca_32.components_, rtol=2e-4)
+    # The atol and rtol are set such that the test passes for all random seeds
+    # on all supported platforms on our CI and conda-forge with the default
+    # random seed.
+    assert_allclose(pca_64.components_, pca_32.components_, rtol=1e-3, atol=1e-3)
 
 
 def check_pca_int_dtype_upcast_to_double(svd_solver):
@@ -844,6 +979,7 @@ def check_array_api_get_precision(name, estimator, array_namespace, device, dtyp
     precision_np = estimator.get_precision()
     covariance_np = estimator.get_covariance()
 
+    rtol = 2e-4 if iris_np.dtype == "float32" else 2e-7
     with config_context(array_api_dispatch=True):
         estimator_xp = clone(estimator).fit(iris_xp)
         precision_xp = estimator_xp.get_precision()
@@ -853,6 +989,7 @@ def check_array_api_get_precision(name, estimator, array_namespace, device, dtyp
         assert_allclose(
             _convert_to_numpy(precision_xp, xp=xp),
             precision_np,
+            rtol=rtol,
             atol=_atol_for_type(dtype_name),
         )
         covariance_xp = estimator_xp.get_covariance()
@@ -862,6 +999,7 @@ def check_array_api_get_precision(name, estimator, array_namespace, device, dtyp
         assert_allclose(
             _convert_to_numpy(covariance_xp, xp=xp),
             covariance_np,
+            rtol=rtol,
             atol=_atol_for_type(dtype_name),
         )
 
@@ -878,7 +1016,10 @@ def check_array_api_get_precision(name, estimator, array_namespace, device, dtyp
     "estimator",
     [
         PCA(n_components=2, svd_solver="full"),
+        PCA(n_components=2, svd_solver="full", whiten=True),
         PCA(n_components=0.1, svd_solver="full", whiten=True),
+        PCA(n_components=2, svd_solver="covariance_eigh"),
+        PCA(n_components=2, svd_solver="covariance_eigh", whiten=True),
         PCA(
             n_components=2,
             svd_solver="randomized",
diff --git a/sklearn/decomposition/tests/test_sparse_pca.py b/sklearn/decomposition/tests/test_sparse_pca.py
index 3797970e3d6ba..a8be5979d4aff 100644
--- a/sklearn/decomposition/tests/test_sparse_pca.py
+++ b/sklearn/decomposition/tests/test_sparse_pca.py
@@ -1,5 +1,5 @@
-# Author: Vlad Niculae
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import sys
 
@@ -14,6 +14,7 @@
     assert_array_almost_equal,
     if_safe_multiprocessing_with_blas,
 )
+from sklearn.utils.extmath import svd_flip
 
 
 def generate_toy_data(n_components, n_samples, image_size, random_state=None):
@@ -114,7 +115,10 @@ def test_initialization():
         n_components=3, U_init=U_init, V_init=V_init, max_iter=0, random_state=rng
     )
     model.fit(rng.randn(5, 4))
-    assert_allclose(model.components_, V_init / np.linalg.norm(V_init, axis=1)[:, None])
+
+    expected_components = V_init / np.linalg.norm(V_init, axis=1, keepdims=True)
+    expected_components = svd_flip(u=expected_components.T, v=None)[0].T
+    assert_allclose(model.components_, expected_components)
 
 
 def test_mini_batch_correct_shapes():
diff --git a/sklearn/discriminant_analysis.py b/sklearn/discriminant_analysis.py
index 01a1004012787..caad2de01b135 100644
--- a/sklearn/discriminant_analysis.py
+++ b/sklearn/discriminant_analysis.py
@@ -1,13 +1,7 @@
-"""
-Linear Discriminant Analysis and Quadratic Discriminant Analysis
-"""
+"""Linear and quadratic discriminant analysis."""
 
-# Authors: Clemens Brunner
-#          Martin Billinger
-#          Matthieu Perrot
-#          Mathieu Blondel
-
-# License: BSD 3-Clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from numbers import Integral, Real
@@ -801,11 +795,11 @@ class QuadraticDiscriminantAnalysis(ClassifierMixin, BaseEstimator):
         .. versionadded:: 0.17
 
     tol : float, default=1.0e-4
-        Absolute threshold for a singular value to be considered significant,
-        used to estimate the rank of `Xk` where `Xk` is the centered matrix
-        of samples in class k. This parameter does not affect the
-        predictions. It only controls a warning that is raised when features
-        are considered to be colinear.
+        Absolute threshold for the covariance matrix to be considered rank
+        deficient after applying some regularization (see `reg_param`) to each
+        `Sk` where `Sk` represents covariance matrix for k-th class. This
+        parameter does not affect the predictions. It controls when a warning
+        is raised if the covariance matrix is not full rank.
 
         .. versionadded:: 0.17
 
@@ -944,11 +938,16 @@ def fit(self, X, y):
             Xgc = Xg - meang
             # Xgc = U * S * V.T
             _, S, Vt = np.linalg.svd(Xgc, full_matrices=False)
-            rank = np.sum(S > self.tol)
-            if rank < n_features:
-                warnings.warn("Variables are collinear")
             S2 = (S**2) / (len(Xg) - 1)
             S2 = ((1 - self.reg_param) * S2) + self.reg_param
+            rank = np.sum(S2 > self.tol)
+            if rank < n_features:
+                warnings.warn(
+                    f"The covariance matrix of class {ind} is not full rank. "
+                    "Increasing the value of parameter `reg_param` might help"
+                    " reducing the collinearity.",
+                    linalg.LinAlgWarning,
+                )
             if self.store_covariance or store_covariance:
                 # cov = V * (S^2 / (n-1)) * V.T
                 cov.append(np.dot(S2 * Vt.T, Vt))
diff --git a/sklearn/dummy.py b/sklearn/dummy.py
index 17812fe1b3d05..d5bb38cc61a59 100644
--- a/sklearn/dummy.py
+++ b/sklearn/dummy.py
@@ -1,7 +1,7 @@
-# Author: Mathieu Blondel <mathieu@mblondel.org>
-#         Arnaud Joly <a.joly@ulg.ac.be>
-#         Maheshakya Wijewardena <maheshakya.10@cse.mrt.ac.lk>
-# License: BSD 3 clause
+"""Dummy estimators that implement simple rules of thumb."""
+
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from numbers import Integral, Real
diff --git a/sklearn/ensemble/__init__.py b/sklearn/ensemble/__init__.py
index 8ddf05084f1be..e49d744ed6391 100644
--- a/sklearn/ensemble/__init__.py
+++ b/sklearn/ensemble/__init__.py
@@ -1,7 +1,4 @@
-"""
-The :mod:`sklearn.ensemble` module includes ensemble-based methods for
-classification, regression and anomaly detection.
-"""
+"""Ensemble-based methods for classification, regression and anomaly detection."""
 
 from ._bagging import BaggingClassifier, BaggingRegressor
 from ._base import BaseEnsemble
diff --git a/sklearn/ensemble/_bagging.py b/sklearn/ensemble/_bagging.py
index 7f278cb06f2ba..81d3163556626 100644
--- a/sklearn/ensemble/_bagging.py
+++ b/sklearn/ensemble/_bagging.py
@@ -1,7 +1,7 @@
 """Bagging meta-estimator."""
 
-# Author: Gilles Louppe <g.louppe@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 import itertools
diff --git a/sklearn/ensemble/_base.py b/sklearn/ensemble/_base.py
index 5483206de51d5..289c7c9b46f4a 100644
--- a/sklearn/ensemble/_base.py
+++ b/sklearn/ensemble/_base.py
@@ -1,7 +1,7 @@
 """Base class for ensemble-based estimators."""
 
-# Authors: Gilles Louppe
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from abc import ABCMeta, abstractmethod
 from typing import List
@@ -21,7 +21,7 @@ def _fit_single_estimator(
     estimator, X, y, fit_params, message_clsname=None, message=None
 ):
     """Private function used to fit an estimator within a job."""
-    # TODO(SLEP6): remove if condition for unrouted sample_weight when metadata
+    # TODO(SLEP6): remove if-condition for unrouted sample_weight when metadata
     # routing can't be disabled.
     if not _routing_enabled() and "sample_weight" in fit_params:
         try:
diff --git a/sklearn/ensemble/_forest.py b/sklearn/ensemble/_forest.py
index 6b1b842f5367b..d55a0c645e929 100644
--- a/sklearn/ensemble/_forest.py
+++ b/sklearn/ensemble/_forest.py
@@ -32,12 +32,8 @@ class calls the ``fit`` method of each sub-estimator on random samples
 Single and multi-output problems are both handled.
 """
 
-# Authors: Gilles Louppe <g.louppe@gmail.com>
-#          Brian Holt <bdholt1@gmail.com>
-#          Joly Arnaud <arnaud.v.joly@gmail.com>
-#          Fares Hedayati <fares.hedayati@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 import threading
@@ -1308,7 +1304,7 @@ class RandomForestClassifier(ForestClassifier):
         When set to ``True``, reuse the solution of the previous call to fit
         and add more estimators to the ensemble, otherwise, just fit a whole
         new forest. See :term:`Glossary <warm_start>` and
-        :ref:`gradient_boosting_warm_start` for details.
+        :ref:`tree_ensemble_warm_start` for details.
 
     class_weight : {"balanced", "balanced_subsample"}, dict or list of dicts, \
             default=None
@@ -1710,7 +1706,7 @@ class RandomForestRegressor(ForestRegressor):
         When set to ``True``, reuse the solution of the previous call to fit
         and add more estimators to the ensemble, otherwise, just fit a whole
         new forest. See :term:`Glossary <warm_start>` and
-        :ref:`gradient_boosting_warm_start` for details.
+        :ref:`tree_ensemble_warm_start` for details.
 
     ccp_alpha : non-negative float, default=0.0
         Complexity parameter used for Minimal Cost-Complexity Pruning. The
@@ -2049,7 +2045,7 @@ class ExtraTreesClassifier(ForestClassifier):
         When set to ``True``, reuse the solution of the previous call to fit
         and add more estimators to the ensemble, otherwise, just fit a whole
         new forest. See :term:`Glossary <warm_start>` and
-        :ref:`gradient_boosting_warm_start` for details.
+        :ref:`tree_ensemble_warm_start` for details.
 
     class_weight : {"balanced", "balanced_subsample"}, dict or list of dicts, \
             default=None
@@ -2434,7 +2430,7 @@ class ExtraTreesRegressor(ForestRegressor):
         When set to ``True``, reuse the solution of the previous call to fit
         and add more estimators to the ensemble, otherwise, just fit a whole
         new forest. See :term:`Glossary <warm_start>` and
-        :ref:`gradient_boosting_warm_start` for details.
+        :ref:`tree_ensemble_warm_start` for details.
 
     ccp_alpha : non-negative float, default=0.0
         Complexity parameter used for Minimal Cost-Complexity Pruning. The
@@ -2727,7 +2723,7 @@ class RandomTreesEmbedding(TransformerMixin, BaseForest):
         When set to ``True``, reuse the solution of the previous call to fit
         and add more estimators to the ensemble, otherwise, just fit a whole
         new forest. See :term:`Glossary <warm_start>` and
-        :ref:`gradient_boosting_warm_start` for details.
+        :ref:`tree_ensemble_warm_start` for details.
 
     Attributes
     ----------
diff --git a/sklearn/ensemble/_gb.py b/sklearn/ensemble/_gb.py
index 960e469a090cd..c280ca695bcfd 100644
--- a/sklearn/ensemble/_gb.py
+++ b/sklearn/ensemble/_gb.py
@@ -16,9 +16,8 @@
   regression problems.
 """
 
-# Authors: Peter Prettenhofer, Scott White, Gilles Louppe, Emanuele Olivetti,
-#          Arnaud Joly, Jacob Schreiber
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import math
 import warnings
@@ -2032,6 +2031,11 @@ class GradientBoostingRegressor(RegressorMixin, BaseGradientBoosting):
     array([-61...])
     >>> reg.score(X_test, y_test)
     0.4...
+
+    For a detailed example of utilizing
+    :class:`~sklearn.ensemble.GradientBoostingRegressor`
+    to fit an ensemble of weak predictive models, please refer to
+    :ref:`sphx_glr_auto_examples_ensemble_plot_gradient_boosting_regression.py`.
     """
 
     _parameter_constraints: dict = {
diff --git a/sklearn/ensemble/_gradient_boosting.pyx b/sklearn/ensemble/_gradient_boosting.pyx
index 034f3c45be8a7..cd9845a217c7d 100644
--- a/sklearn/ensemble/_gradient_boosting.pyx
+++ b/sklearn/ensemble/_gradient_boosting.pyx
@@ -1,6 +1,5 @@
-# Author: Peter Prettenhofer
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from libc.stdlib cimport free
 from libc.string cimport memset
@@ -10,7 +9,7 @@ from scipy.sparse import issparse
 
 from ..utils._typedefs cimport float32_t, float64_t, intp_t, int32_t, uint8_t
 # Note: _tree uses cimport numpy, cnp.import_array, so we need to include
-# numpy headers, see setup.py.
+# numpy headers in the build configuration of this extension
 from ..tree._tree cimport Node
 from ..tree._tree cimport Tree
 from ..tree._utils cimport safe_realloc
diff --git a/sklearn/ensemble/_hist_gradient_boosting/binning.py b/sklearn/ensemble/_hist_gradient_boosting/binning.py
index d23f6e7b00a82..8e37d70a6b2f7 100644
--- a/sklearn/ensemble/_hist_gradient_boosting/binning.py
+++ b/sklearn/ensemble/_hist_gradient_boosting/binning.py
@@ -14,6 +14,7 @@
 from ...utils import check_array, check_random_state
 from ...utils._openmp_helpers import _openmp_effective_n_threads
 from ...utils.fixes import percentile
+from ...utils.parallel import Parallel, delayed
 from ...utils.validation import check_is_fitted
 from ._binning import _map_to_bins
 from ._bitset import set_bitset_memoryview
@@ -226,22 +227,29 @@ def fit(self, X, y=None):
 
         self.missing_values_bin_idx_ = self.n_bins - 1
 
-        self.bin_thresholds_ = []
-        n_bins_non_missing = []
+        self.bin_thresholds_ = [None] * n_features
+        n_bins_non_missing = [None] * n_features
 
+        non_cat_thresholds = Parallel(n_jobs=self.n_threads, backend="threading")(
+            delayed(_find_binning_thresholds)(X[:, f_idx], max_bins)
+            for f_idx in range(n_features)
+            if not self.is_categorical_[f_idx]
+        )
+
+        non_cat_idx = 0
         for f_idx in range(n_features):
-            if not self.is_categorical_[f_idx]:
-                thresholds = _find_binning_thresholds(X[:, f_idx], max_bins)
-                n_bins_non_missing.append(thresholds.shape[0] + 1)
-            else:
+            if self.is_categorical_[f_idx]:
                 # Since categories are assumed to be encoded in
                 # [0, n_cats] and since n_cats <= max_bins,
                 # the thresholds *are* the unique categorical values. This will
                 # lead to the correct mapping in transform()
                 thresholds = known_categories[f_idx]
-                n_bins_non_missing.append(thresholds.shape[0])
-
-            self.bin_thresholds_.append(thresholds)
+                n_bins_non_missing[f_idx] = thresholds.shape[0]
+                self.bin_thresholds_[f_idx] = thresholds
+            else:
+                self.bin_thresholds_[f_idx] = non_cat_thresholds[non_cat_idx]
+                n_bins_non_missing[f_idx] = self.bin_thresholds_[f_idx].shape[0] + 1
+                non_cat_idx += 1
 
         self.n_bins_non_missing_ = np.array(n_bins_non_missing, dtype=np.uint32)
         return self
diff --git a/sklearn/ensemble/_hist_gradient_boosting/gradient_boosting.py b/sklearn/ensemble/_hist_gradient_boosting/gradient_boosting.py
index d3929480552f9..990834a626f89 100644
--- a/sklearn/ensemble/_hist_gradient_boosting/gradient_boosting.py
+++ b/sklearn/ensemble/_hist_gradient_boosting/gradient_boosting.py
@@ -583,6 +583,17 @@ def fit(self, X, y, sample_weight=None):
 
         self._validate_parameters()
         monotonic_cst = _check_monotonic_cst(self, self.monotonic_cst)
+        # _preprocess_X places the categorical features at the beginning,
+        # change the order of monotonic_cst accordingly
+        if self.is_categorical_ is not None:
+            monotonic_cst_remapped = np.concatenate(
+                (
+                    monotonic_cst[self.is_categorical_],
+                    monotonic_cst[~self.is_categorical_],
+                )
+            )
+        else:
+            monotonic_cst_remapped = monotonic_cst
 
         # used for validation in predict
         n_samples, self._n_features = X.shape
@@ -846,7 +857,7 @@ def fit(self, X, y, sample_weight=None):
         )
 
         for iteration in range(begin_at_stage, self.max_iter):
-            if self.verbose:
+            if self.verbose >= 2:
                 iteration_start_time = time()
                 print(
                     "[{}/{}] ".format(iteration + 1, self.max_iter), end="", flush=True
@@ -895,7 +906,7 @@ def fit(self, X, y, sample_weight=None):
                     n_bins_non_missing=self._bin_mapper.n_bins_non_missing_,
                     has_missing_values=has_missing_values,
                     is_categorical=self._is_categorical_remapped,
-                    monotonic_cst=monotonic_cst,
+                    monotonic_cst=monotonic_cst_remapped,
                     interaction_cst=interaction_cst,
                     max_leaf_nodes=self.max_leaf_nodes,
                     max_depth=self.max_depth,
@@ -976,7 +987,7 @@ def fit(self, X, y, sample_weight=None):
                         raw_predictions_val=raw_predictions_val,
                     )
 
-            if self.verbose:
+            if self.verbose >= 2:
                 self._print_iteration_stats(iteration_start_time)
 
             # maybe we could also early stop if all the trees are stumps?
@@ -1606,7 +1617,8 @@ class HistGradientBoostingRegressor(RegressorMixin, BaseHistGradientBoosting):
         iterations to be considered an improvement upon the reference score.
     verbose : int, default=0
         The verbosity level. If not zero, print some information about the
-        fitting process.
+        fitting process. ``1`` prints only summary info, ``2`` prints info per
+        iteration.
     random_state : int, RandomState instance or None, default=None
         Pseudo-random number generator to control the subsampling in the
         binning process, and the train/validation data split if early stopping
@@ -1985,7 +1997,8 @@ class HistGradientBoostingClassifier(ClassifierMixin, BaseHistGradientBoosting):
         considered an improvement upon the reference score.
     verbose : int, default=0
         The verbosity level. If not zero, print some information about the
-        fitting process.
+        fitting process. ``1`` prints only summary info, ``2`` prints info per
+        iteration.
     random_state : int, RandomState instance or None, default=None
         Pseudo-random number generator to control the subsampling in the
         binning process, and the train/validation data split if early stopping
diff --git a/sklearn/ensemble/_hist_gradient_boosting/tests/test_gradient_boosting.py b/sklearn/ensemble/_hist_gradient_boosting/tests/test_gradient_boosting.py
index eedf5e73549c2..b5711413f9b75 100644
--- a/sklearn/ensemble/_hist_gradient_boosting/tests/test_gradient_boosting.py
+++ b/sklearn/ensemble/_hist_gradient_boosting/tests/test_gradient_boosting.py
@@ -160,7 +160,7 @@ def test_early_stopping_classification(
     X, y = data
 
     gb = HistGradientBoostingClassifier(
-        verbose=1,  # just for coverage
+        verbose=2,  # just for coverage
         min_samples_leaf=5,  # easier to overfit fast
         scoring=scoring,
         tol=tol,
diff --git a/sklearn/ensemble/_hist_gradient_boosting/tests/test_monotonic_contraints.py b/sklearn/ensemble/_hist_gradient_boosting/tests/test_monotonic_contraints.py
index 7782b5b32eb68..56b6068d794e8 100644
--- a/sklearn/ensemble/_hist_gradient_boosting/tests/test_monotonic_contraints.py
+++ b/sklearn/ensemble/_hist_gradient_boosting/tests/test_monotonic_contraints.py
@@ -206,9 +206,9 @@ def test_nodes_values(monotonic_cst, seed):
 
 @pytest.mark.parametrize("use_feature_names", (True, False))
 def test_predictions(global_random_seed, use_feature_names):
-    # Train a model with a POS constraint on the first feature and a NEG
-    # constraint on the second feature, and make sure the constraints are
-    # respected by checking the predictions.
+    # Train a model with a POS constraint on the first non-categorical feature
+    # and a NEG constraint on the second non-categorical feature, and make sure
+    # the constraints are respected by checking the predictions.
     # test adapted from lightgbm's test_monotone_constraint(), itself inspired
     # by https://xgboost.readthedocs.io/en/latest/tutorials/monotonic.html
 
@@ -216,9 +216,16 @@ def test_predictions(global_random_seed, use_feature_names):
 
     n_samples = 1000
     f_0 = rng.rand(n_samples)  # positive correlation with y
-    f_1 = rng.rand(n_samples)  # negative correslation with y
-    X = np.c_[f_0, f_1]
-    columns_name = ["f_0", "f_1"]
+    f_1 = rng.rand(n_samples)  # negative correlation with y
+
+    # extra categorical features, no correlation with y,
+    # to check the correctness of monotonicity constraint remapping, see issue #28898
+    f_a = rng.randint(low=0, high=9, size=n_samples)
+    f_b = rng.randint(low=0, high=9, size=n_samples)
+    f_c = rng.randint(low=0, high=9, size=n_samples)
+
+    X = np.c_[f_a, f_0, f_b, f_1, f_c]
+    columns_name = ["f_a", "f_0", "f_b", "f_1", "f_c"]
     constructor_name = "dataframe" if use_feature_names else "array"
     X = _convert_container(X, constructor_name, columns_name=columns_name)
 
@@ -227,10 +234,14 @@ def test_predictions(global_random_seed, use_feature_names):
 
     if use_feature_names:
         monotonic_cst = {"f_0": +1, "f_1": -1}
+        categorical_features = ["f_a", "f_b", "f_c"]
     else:
-        monotonic_cst = [+1, -1]
+        monotonic_cst = [0, +1, 0, -1, 0]
+        categorical_features = [0, 2, 4]
 
-    gbdt = HistGradientBoostingRegressor(monotonic_cst=monotonic_cst)
+    gbdt = HistGradientBoostingRegressor(
+        monotonic_cst=monotonic_cst, categorical_features=categorical_features
+    )
     gbdt.fit(X, y)
 
     linspace = np.linspace(0, 1, 100)
@@ -247,26 +258,26 @@ def test_predictions(global_random_seed, use_feature_names):
     # The constraint does not guanrantee that
     # x0 < x0' => f(x0, x1) < f(x0', x1')
 
-    # First feature (POS)
+    # First non-categorical feature (POS)
     # assert pred is all increasing when f_0 is all increasing
-    X = np.c_[linspace, constant]
+    X = np.c_[constant, linspace, constant, constant, constant]
     X = _convert_container(X, constructor_name, columns_name=columns_name)
     pred = gbdt.predict(X)
     assert is_increasing(pred)
     # assert pred actually follows the variations of f_0
-    X = np.c_[sin, constant]
+    X = np.c_[constant, sin, constant, constant, constant]
     X = _convert_container(X, constructor_name, columns_name=columns_name)
     pred = gbdt.predict(X)
     assert np.all((np.diff(pred) >= 0) == (np.diff(sin) >= 0))
 
-    # Second feature (NEG)
+    # Second non-categorical feature (NEG)
     # assert pred is all decreasing when f_1 is all increasing
-    X = np.c_[constant, linspace]
+    X = np.c_[constant, constant, constant, linspace, constant]
     X = _convert_container(X, constructor_name, columns_name=columns_name)
     pred = gbdt.predict(X)
     assert is_decreasing(pred)
     # assert pred actually follows the inverse variations of f_1
-    X = np.c_[constant, sin]
+    X = np.c_[constant, constant, constant, sin, constant]
     X = _convert_container(X, constructor_name, columns_name=columns_name)
     pred = gbdt.predict(X)
     assert ((np.diff(pred) <= 0) == (np.diff(sin) >= 0)).all()
diff --git a/sklearn/ensemble/_iforest.py b/sklearn/ensemble/_iforest.py
index 480d1f2d3e4ef..b8df148f20a1a 100644
--- a/sklearn/ensemble/_iforest.py
+++ b/sklearn/ensemble/_iforest.py
@@ -1,8 +1,8 @@
-# Authors: Nicolas Goix <nicolas.goix@telecom-paristech.fr>
-#          Alexandre Gramfort <alexandre.gramfort@telecom-paristech.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numbers
+import threading
 from numbers import Integral, Real
 from warnings import warn
 
@@ -19,12 +19,39 @@
 )
 from ..utils._chunking import get_chunk_n_rows
 from ..utils._param_validation import Interval, RealNotInt, StrOptions
+from ..utils.parallel import Parallel, delayed
 from ..utils.validation import _num_samples, check_is_fitted
 from ._bagging import BaseBagging
+from ._base import _partition_estimators
 
 __all__ = ["IsolationForest"]
 
 
+def _parallel_compute_tree_depths(
+    tree,
+    X,
+    features,
+    tree_decision_path_lengths,
+    tree_avg_path_lengths,
+    depths,
+    lock,
+):
+    """Parallel computation of isolation tree depth."""
+    if features is None:
+        X_subset = X
+    else:
+        X_subset = X[:, features]
+
+    leaves_index = tree.apply(X_subset, check_input=False)
+
+    with lock:
+        depths += (
+            tree_decision_path_lengths[leaves_index]
+            + tree_avg_path_lengths[leaves_index]
+            - 1.0
+        )
+
+
 class IsolationForest(OutlierMixin, BaseBagging):
     """
     Isolation Forest Algorithm.
@@ -262,7 +289,7 @@ def _parallel_args(self):
         # ExtraTreeRegressor releases the GIL, so it's more efficient to use
         # a thread-based backend rather than a process-based backend so as
         # to avoid suffering from communication overhead and extra memory
-        # copies.
+        # copies. This is only used in the fit method.
         return {"prefer": "threads"}
 
     @_fit_context(prefer_skip_nested_validation=True)
@@ -288,7 +315,9 @@ def fit(self, X, y=None, sample_weight=None):
         self : object
             Fitted estimator.
         """
-        X = self._validate_data(X, accept_sparse=["csc"], dtype=tree_dtype)
+        X = self._validate_data(
+            X, accept_sparse=["csc"], dtype=tree_dtype, force_all_finite=False
+        )
         if issparse(X):
             # Pre-sort indices to avoid that each individual tree of the
             # ensemble sorts the indices.
@@ -370,6 +399,23 @@ def predict(self, X):
         is_inlier : ndarray of shape (n_samples,)
             For each observation, tells whether or not (+1 or -1) it should
             be considered as an inlier according to the fitted model.
+
+        Notes
+        -----
+        The predict method can be parallelized by setting a joblib context. This
+        inherently does NOT use the ``n_jobs`` parameter initialized in the class,
+        which is used during ``fit``. This is because, predict may actually be faster
+        without parallelization for a small number of samples,
+        such as for 1000 samples or less. The user can set the
+        number of jobs in the joblib context to control the number of parallel jobs.
+
+        .. code-block:: python
+
+            from joblib import parallel_backend
+
+            # Note, we use threading here as the predict method is not CPU bound.
+            with parallel_backend("threading", n_jobs=4):
+                model.predict(X)
         """
         check_is_fitted(self)
         decision_func = self.decision_function(X)
@@ -403,6 +449,25 @@ def decision_function(self, X):
             The anomaly score of the input samples.
             The lower, the more abnormal. Negative scores represent outliers,
             positive scores represent inliers.
+
+        Notes
+        -----
+        The decision_function method can be parallelized by setting a joblib context.
+        This inherently does NOT use the ``n_jobs`` parameter initialized in the class,
+        which is used during ``fit``. This is because, calculating the score may
+        actually be faster without parallelization for a small number of samples,
+        such as for 1000 samples or less.
+        The user can set the number of jobs in the joblib context to control the
+        number of parallel jobs.
+
+        .. code-block:: python
+
+            from joblib import parallel_backend
+
+            # Note, we use threading here as the decision_function method is
+            # not CPU bound.
+            with parallel_backend("threading", n_jobs=4):
+                model.decision_function(X)
         """
         # We subtract self.offset_ to make 0 be the threshold value for being
         # an outlier:
@@ -432,9 +497,33 @@ def score_samples(self, X):
         scores : ndarray of shape (n_samples,)
             The anomaly score of the input samples.
             The lower, the more abnormal.
+
+        Notes
+        -----
+        The score function method can be parallelized by setting a joblib context. This
+        inherently does NOT use the ``n_jobs`` parameter initialized in the class,
+        which is used during ``fit``. This is because, calculating the score may
+        actually be faster without parallelization for a small number of samples,
+        such as for 1000 samples or less.
+        The user can set the number of jobs in the joblib context to control the
+        number of parallel jobs.
+
+        .. code-block:: python
+
+            from joblib import parallel_backend
+
+            # Note, we use threading here as the score_samples method is not CPU bound.
+            with parallel_backend("threading", n_jobs=4):
+                model.score(X)
         """
         # Check data
-        X = self._validate_data(X, accept_sparse="csr", dtype=tree_dtype, reset=False)
+        X = self._validate_data(
+            X,
+            accept_sparse="csr",
+            dtype=tree_dtype,
+            reset=False,
+            force_all_finite=False,
+        )
 
         return self._score_samples(X)
 
@@ -493,6 +582,11 @@ def _compute_score_samples(self, X, subsample_features):
 
         subsample_features : bool
             Whether features should be subsampled.
+
+        Returns
+        -------
+        scores : ndarray of shape (n_samples,)
+            The score of each sample in X.
         """
         n_samples = X.shape[0]
 
@@ -500,18 +594,31 @@ def _compute_score_samples(self, X, subsample_features):
 
         average_path_length_max_samples = _average_path_length([self._max_samples])
 
-        for tree_idx, (tree, features) in enumerate(
-            zip(self.estimators_, self.estimators_features_)
-        ):
-            X_subset = X[:, features] if subsample_features else X
-
-            leaves_index = tree.apply(X_subset, check_input=False)
-
-            depths += (
-                self._decision_path_lengths[tree_idx][leaves_index]
-                + self._average_path_length_per_tree[tree_idx][leaves_index]
-                - 1.0
+        # Note: using joblib.parallel_backend allows for setting the number of jobs
+        # separately from the n_jobs parameter specified during fit. This is useful for
+        # parallelizing  the computation of the scores, which will not require a high
+        # n_jobs value for e.g. < 1k samples.
+        n_jobs, _, _ = _partition_estimators(self.n_estimators, None)
+        lock = threading.Lock()
+        Parallel(
+            n_jobs=n_jobs,
+            verbose=self.verbose,
+            require="sharedmem",
+        )(
+            delayed(_parallel_compute_tree_depths)(
+                tree,
+                X,
+                features if subsample_features else None,
+                self._decision_path_lengths[tree_idx],
+                self._average_path_length_per_tree[tree_idx],
+                depths,
+                lock,
             )
+            for tree_idx, (tree, features) in enumerate(
+                zip(self.estimators_, self.estimators_features_)
+            )
+        )
+
         denominator = len(self.estimators_) * average_path_length_max_samples
         scores = 2 ** (
             # For a single training sample, denominator and depth are 0.
@@ -528,7 +635,8 @@ def _more_tags(self):
                 "check_sample_weights_invariance": (
                     "zero sample_weight is not equivalent to removing samples"
                 ),
-            }
+            },
+            "allow_nan": True,
         }
 
 
diff --git a/sklearn/ensemble/_stacking.py b/sklearn/ensemble/_stacking.py
index 0f093e8a6b51d..646cc1d57a38e 100644
--- a/sklearn/ensemble/_stacking.py
+++ b/sklearn/ensemble/_stacking.py
@@ -1,7 +1,7 @@
 """Stacking classifier and regressor."""
 
-# Authors: Guillaume Lemaitre <g.lemaitre58@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from abc import ABCMeta, abstractmethod
 from copy import deepcopy
@@ -27,8 +27,11 @@
 from ..utils._estimator_html_repr import _VisualBlock
 from ..utils._param_validation import HasMethods, StrOptions
 from ..utils.metadata_routing import (
-    _raise_for_unsupported_routing,
-    _RoutingNotSupportedMixin,
+    MetadataRouter,
+    MethodMapping,
+    _raise_for_params,
+    _routing_enabled,
+    process_routing,
 )
 from ..utils.metaestimators import available_if
 from ..utils.multiclass import check_classification_targets, type_of_target
@@ -36,6 +39,7 @@
 from ..utils.validation import (
     _check_feature_names_in,
     _check_response_method,
+    _deprecate_positional_args,
     check_is_fitted,
     column_or_1d,
 )
@@ -171,7 +175,7 @@ def _method_name(name, estimator, method):
         # estimators in Stacking*.estimators are not validated yet
         prefer_skip_nested_validation=False
     )
-    def fit(self, X, y, sample_weight=None):
+    def fit(self, X, y, **fit_params):
         """Fit the estimators.
 
         Parameters
@@ -183,14 +187,13 @@ def fit(self, X, y, sample_weight=None):
         y : array-like of shape (n_samples,)
             Target values.
 
-        sample_weight : array-like of shape (n_samples,) or default=None
-            Sample weights. If None, then samples are equally weighted.
-            Note that this is supported only if all underlying estimators
-            support sample weights.
+        **fit_params : dict
+            Dict of metadata, potentially containing sample_weight as a
+            key-value pair. If sample_weight is not present, then samples are
+            equally weighted. Note that sample_weight is supported only if all
+            underlying estimators support sample weights.
 
-            .. versionchanged:: 0.23
-               when not None, `sample_weight` is passed to all underlying
-               estimators
+            .. versionadded:: 1.6
 
         Returns
         -------
@@ -201,16 +204,19 @@ def fit(self, X, y, sample_weight=None):
         names, all_estimators = self._validate_estimators()
         self._validate_final_estimator()
 
-        # FIXME: when adding support for metadata routing in Stacking*.
-        # This is a hotfix to make StackingClassifier and StackingRegressor
-        # pass the tests despite not supporting metadata routing but sharing
-        # the same base class with VotingClassifier and VotingRegressor.
-        fit_params = dict()
-        if sample_weight is not None:
-            fit_params["sample_weight"] = sample_weight
-
         stack_method = [self.stack_method] * len(all_estimators)
 
+        if _routing_enabled():
+            routed_params = process_routing(self, "fit", **fit_params)
+        else:
+            routed_params = Bunch()
+            for name in names:
+                routed_params[name] = Bunch(fit={})
+                if "sample_weight" in fit_params:
+                    routed_params[name].fit["sample_weight"] = fit_params[
+                        "sample_weight"
+                    ]
+
         if self.cv == "prefit":
             self.estimators_ = []
             for estimator in all_estimators:
@@ -222,8 +228,10 @@ def fit(self, X, y, sample_weight=None):
             # base estimators will be used in transform, predict, and
             # predict_proba. They are exposed publicly.
             self.estimators_ = Parallel(n_jobs=self.n_jobs)(
-                delayed(_fit_single_estimator)(clone(est), X, y, fit_params)
-                for est in all_estimators
+                delayed(_fit_single_estimator)(
+                    clone(est), X, y, routed_params[name]["fit"]
+                )
+                for name, est in zip(names, all_estimators)
                 if est != "drop"
             )
 
@@ -269,10 +277,10 @@ def fit(self, X, y, sample_weight=None):
                     cv=deepcopy(cv),
                     method=meth,
                     n_jobs=self.n_jobs,
-                    params=fit_params,
+                    params=routed_params[name]["fit"],
                     verbose=self.verbose,
                 )
-                for est, meth in zip(all_estimators, self.stack_method_)
+                for name, est, meth in zip(names, all_estimators, self.stack_method_)
                 if est != "drop"
             )
 
@@ -370,7 +378,7 @@ def predict(self, X, **predict_params):
             Parameters to the `predict` called by the `final_estimator`. Note
             that this may be used to return uncertainties from some estimators
             with `return_std` or `return_cov`. Be aware that it will only
-            accounts for uncertainty in the final estimator.
+            account for uncertainty in the final estimator.
 
         Returns
         -------
@@ -392,8 +400,43 @@ def _sk_visual_block_with_final_estimator(self, final_estimator):
         )
         return _VisualBlock("serial", (parallel, final_block), dash_wrapped=False)
 
+    def get_metadata_routing(self):
+        """Get metadata routing of this object.
+
+        Please check :ref:`User Guide <metadata_routing>` on how the routing
+        mechanism works.
+
+        .. versionadded:: 1.6
+
+        Returns
+        -------
+        routing : MetadataRouter
+            A :class:`~sklearn.utils.metadata_routing.MetadataRouter` encapsulating
+            routing information.
+        """
+        router = MetadataRouter(owner=self.__class__.__name__)
+
+        # `self.estimators` is a list of (name, est) tuples
+        for name, estimator in self.estimators:
+            router.add(
+                **{name: estimator},
+                method_mapping=MethodMapping().add(callee="fit", caller="fit"),
+            )
+
+        try:
+            final_estimator_ = self.final_estimator_
+        except AttributeError:
+            final_estimator_ = self.final_estimator
+
+        router.add(
+            final_estimator_=final_estimator_,
+            method_mapping=MethodMapping().add(caller="predict", callee="predict"),
+        )
+
+        return router
+
 
-class StackingClassifier(_RoutingNotSupportedMixin, ClassifierMixin, _BaseStacking):
+class StackingClassifier(ClassifierMixin, _BaseStacking):
     """Stack of estimators with a final classifier.
 
     Stacked generalization consists in stacking the output of individual
@@ -528,7 +571,7 @@ class StackingClassifier(_RoutingNotSupportedMixin, ClassifierMixin, _BaseStacki
     -----
     When `predict_proba` is used by each estimator (i.e. most of the time for
     `stack_method='auto'` or specifically for `stack_method='predict_proba'`),
-    The first column predicted by each estimator will be dropped in the case
+    the first column predicted by each estimator will be dropped in the case
     of a binary classification problem. Indeed, both feature will be perfectly
     collinear.
 
@@ -556,7 +599,7 @@ class StackingClassifier(_RoutingNotSupportedMixin, ClassifierMixin, _BaseStacki
     >>> estimators = [
     ...     ('rf', RandomForestClassifier(n_estimators=10, random_state=42)),
     ...     ('svr', make_pipeline(StandardScaler(),
-    ...                           LinearSVC(dual="auto", random_state=42)))
+    ...                           LinearSVC(random_state=42)))
     ... ]
     >>> clf = StackingClassifier(
     ...     estimators=estimators, final_estimator=LogisticRegression()
@@ -629,7 +672,11 @@ def _validate_estimators(self):
 
         return names, estimators
 
-    def fit(self, X, y, sample_weight=None):
+    # TODO(1.7): remove `sample_weight` from the signature after deprecation
+    # cycle; pop it from `fit_params` before the `_raise_for_params` check and
+    # reinsert afterwards, for backwards compatibility
+    @_deprecate_positional_args(version="1.7")
+    def fit(self, X, y, *, sample_weight=None, **fit_params):
         """Fit the estimators.
 
         Parameters
@@ -649,12 +696,22 @@ def fit(self, X, y, sample_weight=None):
             Note that this is supported only if all underlying estimators
             support sample weights.
 
+        **fit_params : dict
+            Parameters to pass to the underlying estimators.
+
+            .. versionadded:: 1.6
+
+                Only available if `enable_metadata_routing=True`, which can be
+                set by using ``sklearn.set_config(enable_metadata_routing=True)``.
+                See :ref:`Metadata Routing User Guide <metadata_routing>` for
+                more details.
+
         Returns
         -------
         self : object
             Returns a fitted instance of estimator.
         """
-        _raise_for_unsupported_routing(self, "fit", sample_weight=sample_weight)
+        _raise_for_params(fit_params, self, "fit")
         check_classification_targets(y)
         if type_of_target(y) == "multilabel-indicator":
             self._label_encoder = [LabelEncoder().fit(yk) for yk in y.T]
@@ -669,7 +726,10 @@ def fit(self, X, y, sample_weight=None):
             self._label_encoder = LabelEncoder().fit(y)
             self.classes_ = self._label_encoder.classes_
             y_encoded = self._label_encoder.transform(y)
-        return super().fit(X, y_encoded, sample_weight)
+
+        if sample_weight is not None:
+            fit_params["sample_weight"] = sample_weight
+        return super().fit(X, y_encoded, **fit_params)
 
     @available_if(_estimator_has("predict"))
     def predict(self, X, **predict_params):
@@ -685,14 +745,33 @@ def predict(self, X, **predict_params):
             Parameters to the `predict` called by the `final_estimator`. Note
             that this may be used to return uncertainties from some estimators
             with `return_std` or `return_cov`. Be aware that it will only
-            accounts for uncertainty in the final estimator.
+            account for uncertainty in the final estimator.
+
+            - If `enable_metadata_routing=False` (default):
+              Parameters directly passed to the `predict` method of the
+              `final_estimator`.
+
+            - If `enable_metadata_routing=True`: Parameters safely routed to
+              the `predict` method of the `final_estimator`. See :ref:`Metadata
+              Routing User Guide <metadata_routing>` for more details.
+
+            .. versionchanged:: 1.6
+                `**predict_params` can be routed via metadata routing API.
 
         Returns
         -------
         y_pred : ndarray of shape (n_samples,) or (n_samples, n_output)
             Predicted targets.
         """
-        y_pred = super().predict(X, **predict_params)
+        if _routing_enabled():
+            routed_params = process_routing(self, "predict", **predict_params)
+        else:
+            # TODO(SLEP6): remove when metadata routing cannot be disabled.
+            routed_params = Bunch()
+            routed_params.final_estimator_ = Bunch(predict={})
+            routed_params.final_estimator_.predict = predict_params
+
+        y_pred = super().predict(X, **routed_params.final_estimator_["predict"])
         if isinstance(self._label_encoder, list):
             # Handle the multilabel-indicator case
             y_pred = np.array(
@@ -775,7 +854,7 @@ def _sk_visual_block_(self):
         return super()._sk_visual_block_with_final_estimator(final_estimator)
 
 
-class StackingRegressor(_RoutingNotSupportedMixin, RegressorMixin, _BaseStacking):
+class StackingRegressor(RegressorMixin, _BaseStacking):
     """Stack of estimators with a final regressor.
 
     Stacked generalization consists in stacking the output of individual
@@ -900,7 +979,7 @@ class StackingRegressor(_RoutingNotSupportedMixin, RegressorMixin, _BaseStacking
     >>> X, y = load_diabetes(return_X_y=True)
     >>> estimators = [
     ...     ('lr', RidgeCV()),
-    ...     ('svr', LinearSVR(dual="auto", random_state=42))
+    ...     ('svr', LinearSVR(random_state=42))
     ... ]
     >>> reg = StackingRegressor(
     ...     estimators=estimators,
@@ -944,7 +1023,11 @@ def _validate_final_estimator(self):
                 )
             )
 
-    def fit(self, X, y, sample_weight=None):
+    # TODO(1.7): remove `sample_weight` from the signature after deprecation
+    # cycle; pop it from `fit_params` before the `_raise_for_params` check and
+    # reinsert afterwards, for backwards compatibility
+    @_deprecate_positional_args(version="1.7")
+    def fit(self, X, y, *, sample_weight=None, **fit_params):
         """Fit the estimators.
 
         Parameters
@@ -961,14 +1044,26 @@ def fit(self, X, y, sample_weight=None):
             Note that this is supported only if all underlying estimators
             support sample weights.
 
+        **fit_params : dict
+            Parameters to pass to the underlying estimators.
+
+            .. versionadded:: 1.6
+
+                Only available if `enable_metadata_routing=True`, which can be
+                set by using ``sklearn.set_config(enable_metadata_routing=True)``.
+                See :ref:`Metadata Routing User Guide <metadata_routing>` for
+                more details.
+
         Returns
         -------
         self : object
             Returns a fitted instance.
         """
-        _raise_for_unsupported_routing(self, "fit", sample_weight=sample_weight)
+        _raise_for_params(fit_params, self, "fit")
         y = column_or_1d(y, warn=True)
-        return super().fit(X, y, sample_weight)
+        if sample_weight is not None:
+            fit_params["sample_weight"] = sample_weight
+        return super().fit(X, y, **fit_params)
 
     def transform(self, X):
         """Return the predictions for X for each estimator.
@@ -986,7 +1081,11 @@ def transform(self, X):
         """
         return self._transform(X)
 
-    def fit_transform(self, X, y, sample_weight=None):
+    # TODO(1.7): remove `sample_weight` from the signature after deprecation
+    # cycle; pop it from `fit_params` before the `_raise_for_params` check and
+    # reinsert afterwards, for backwards compatibility
+    @_deprecate_positional_args(version="1.7")
+    def fit_transform(self, X, y, *, sample_weight=None, **fit_params):
         """Fit the estimators and return the predictions for X for each estimator.
 
         Parameters
@@ -1003,12 +1102,69 @@ def fit_transform(self, X, y, sample_weight=None):
             Note that this is supported only if all underlying estimators
             support sample weights.
 
+        **fit_params : dict
+            Parameters to pass to the underlying estimators.
+
+            .. versionadded:: 1.6
+
+                Only available if `enable_metadata_routing=True`, which can be
+                set by using ``sklearn.set_config(enable_metadata_routing=True)``.
+                See :ref:`Metadata Routing User Guide <metadata_routing>` for
+                more details.
+
         Returns
         -------
         y_preds : ndarray of shape (n_samples, n_estimators)
             Prediction outputs for each estimator.
         """
-        return super().fit_transform(X, y, sample_weight=sample_weight)
+        _raise_for_params(fit_params, self, "fit")
+        if sample_weight is not None:
+            fit_params["sample_weight"] = sample_weight
+        return super().fit_transform(X, y, **fit_params)
+
+    @available_if(_estimator_has("predict"))
+    def predict(self, X, **predict_params):
+        """Predict target for X.
+
+        Parameters
+        ----------
+        X : {array-like, sparse matrix} of shape (n_samples, n_features)
+            Training vectors, where `n_samples` is the number of samples and
+            `n_features` is the number of features.
+
+        **predict_params : dict of str -> obj
+            Parameters to the `predict` called by the `final_estimator`. Note
+            that this may be used to return uncertainties from some estimators
+            with `return_std` or `return_cov`. Be aware that it will only
+            account for uncertainty in the final estimator.
+
+            - If `enable_metadata_routing=False` (default):
+              Parameters directly passed to the `predict` method of the
+              `final_estimator`.
+
+            - If `enable_metadata_routing=True`: Parameters safely routed to
+              the `predict` method of the `final_estimator`. See :ref:`Metadata
+              Routing User Guide <metadata_routing>` for more details.
+
+            .. versionchanged:: 1.6
+                `**predict_params` can be routed via metadata routing API.
+
+        Returns
+        -------
+        y_pred : ndarray of shape (n_samples,) or (n_samples, n_output)
+            Predicted targets.
+        """
+        if _routing_enabled():
+            routed_params = process_routing(self, "predict", **predict_params)
+        else:
+            # TODO(SLEP6): remove when metadata routing cannot be disabled.
+            routed_params = Bunch()
+            routed_params.final_estimator_ = Bunch(predict={})
+            routed_params.final_estimator_.predict = predict_params
+
+        y_pred = super().predict(X, **routed_params.final_estimator_["predict"])
+
+        return y_pred
 
     def _sk_visual_block_(self):
         # If final_estimator's default changes then this should be
diff --git a/sklearn/ensemble/_voting.py b/sklearn/ensemble/_voting.py
index 4e7c7af369ab0..f880bfe2a086f 100644
--- a/sklearn/ensemble/_voting.py
+++ b/sklearn/ensemble/_voting.py
@@ -6,12 +6,8 @@
  - A Voting regressor for regression estimators.
 """
 
-# Authors: Sebastian Raschka <se.raschka@gmail.com>,
-#          Gilles Louppe <g.louppe@gmail.com>,
-#          Ramil Nugmanov <stsouko@live.ru>
-#          Mohamed Ali Jamaoui <m.ali.jamaoui@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from abc import abstractmethod
 from numbers import Integral
@@ -287,7 +283,7 @@ class VotingClassifier(ClassifierMixin, _BaseVoting):
     >>> from sklearn.linear_model import LogisticRegression
     >>> from sklearn.naive_bayes import GaussianNB
     >>> from sklearn.ensemble import RandomForestClassifier, VotingClassifier
-    >>> clf1 = LogisticRegression(multi_class='multinomial', random_state=1)
+    >>> clf1 = LogisticRegression(random_state=1)
     >>> clf2 = RandomForestClassifier(n_estimators=50, random_state=1)
     >>> clf3 = GaussianNB()
     >>> X = np.array([[-1, -1], [-2, -1], [-3, -2], [1, 1], [2, 1], [3, 2]])
diff --git a/sklearn/ensemble/_weight_boosting.py b/sklearn/ensemble/_weight_boosting.py
index 0461a397983be..e18bafb450d49 100644
--- a/sklearn/ensemble/_weight_boosting.py
+++ b/sklearn/ensemble/_weight_boosting.py
@@ -16,12 +16,8 @@
   (AdaBoost.R2) for regression problems.
 """
 
-# Authors: Noel Dawe <noel@dawe.me>
-#          Gilles Louppe <g.louppe@gmail.com>
-#          Hamzeh Alsalhi <ha258@cornell.edu>
-#          Arnaud Joly <arnaud.v.joly@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from abc import ABCMeta, abstractmethod
@@ -482,6 +478,10 @@ class AdaBoostClassifier(
     For a detailed example of using AdaBoost to fit a sequence of DecisionTrees
     as weaklearners, please refer to
     :ref:`sphx_glr_auto_examples_ensemble_plot_adaboost_multiclass.py`.
+
+    For a detailed example of using AdaBoost to fit a non-linearly seperable
+    classification dataset composed of two Gaussian quantiles clusters, please
+    refer to :ref:`sphx_glr_auto_examples_ensemble_plot_adaboost_twoclass.py`.
     """
 
     # TODO(1.6): Modify _parameter_constraints for "algorithm" to only check
@@ -1076,6 +1076,10 @@ class AdaBoostRegressor(_RoutingNotSupportedMixin, RegressorMixin, BaseWeightBoo
     array([4.7972...])
     >>> regr.score(X, y)
     0.9771...
+
+    For a detailed example of utilizing :class:`~sklearn.ensemble.AdaBoostRegressor`
+    to fit a sequence of decision trees as weak learners, please refer to
+    :ref:`sphx_glr_auto_examples_ensemble_plot_adaboost_regression.py`.
     """
 
     _parameter_constraints: dict = {
diff --git a/sklearn/ensemble/tests/test_bagging.py b/sklearn/ensemble/tests/test_bagging.py
index da855a568b402..e0558917c59ba 100644
--- a/sklearn/ensemble/tests/test_bagging.py
+++ b/sklearn/ensemble/tests/test_bagging.py
@@ -2,8 +2,8 @@
 Testing for the bagging ensemble module (sklearn.ensemble.bagging).
 """
 
-# Author: Gilles Louppe
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 from itertools import cycle, product
 
 import joblib
diff --git a/sklearn/ensemble/tests/test_base.py b/sklearn/ensemble/tests/test_base.py
index aa06edc19e756..95a852b8a7cc5 100644
--- a/sklearn/ensemble/tests/test_base.py
+++ b/sklearn/ensemble/tests/test_base.py
@@ -2,8 +2,8 @@
 Testing for the base module (sklearn.ensemble.base).
 """
 
-# Authors: Gilles Louppe
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from collections import OrderedDict
 
diff --git a/sklearn/ensemble/tests/test_common.py b/sklearn/ensemble/tests/test_common.py
index 7e14b34993d6f..6e83512ccd1d6 100644
--- a/sklearn/ensemble/tests/test_common.py
+++ b/sklearn/ensemble/tests/test_common.py
@@ -34,7 +34,7 @@
             StackingClassifier(
                 estimators=[
                     ("lr", LogisticRegression()),
-                    ("svm", LinearSVC(dual="auto")),
+                    ("svm", LinearSVC()),
                     ("rf", RandomForestClassifier(n_estimators=5, max_depth=3)),
                 ],
                 cv=2,
@@ -45,7 +45,7 @@
             VotingClassifier(
                 estimators=[
                     ("lr", LogisticRegression()),
-                    ("svm", LinearSVC(dual="auto")),
+                    ("svm", LinearSVC()),
                     ("rf", RandomForestClassifier(n_estimators=5, max_depth=3)),
                 ]
             ),
@@ -55,7 +55,7 @@
             StackingRegressor(
                 estimators=[
                     ("lr", LinearRegression()),
-                    ("svm", LinearSVR(dual="auto")),
+                    ("svm", LinearSVR()),
                     ("rf", RandomForestRegressor(n_estimators=5, max_depth=3)),
                 ],
                 cv=2,
@@ -66,7 +66,7 @@
             VotingRegressor(
                 estimators=[
                     ("lr", LinearRegression()),
-                    ("svm", LinearSVR(dual="auto")),
+                    ("svm", LinearSVR()),
                     ("rf", RandomForestRegressor(n_estimators=5, max_depth=3)),
                 ]
             ),
diff --git a/sklearn/ensemble/tests/test_forest.py b/sklearn/ensemble/tests/test_forest.py
index 2468f8fc5b590..a750282a3139c 100644
--- a/sklearn/ensemble/tests/test_forest.py
+++ b/sklearn/ensemble/tests/test_forest.py
@@ -2,11 +2,8 @@
 Testing for the forest module (sklearn.ensemble.forest).
 """
 
-# Authors: Gilles Louppe,
-#          Brian Holt,
-#          Andreas Mueller,
-#          Arnaud Joly
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import itertools
 import math
@@ -515,7 +512,8 @@ def test_forest_classifier_oob(
         test_score = classifier.score(X_test, y_test)
         assert classifier.oob_score_ >= lower_bound_accuracy
 
-    assert abs(test_score - classifier.oob_score_) <= 0.1
+    abs_diff = abs(test_score - classifier.oob_score_)
+    assert abs_diff <= 0.11, f"{abs_diff=} is greater than 0.11"
 
     assert hasattr(classifier, "oob_score_")
     assert not hasattr(classifier, "oob_prediction_")
@@ -1770,6 +1768,8 @@ def test_estimators_samples(ForestClass, bootstrap, seed):
     [
         (datasets.make_regression, RandomForestRegressor),
         (datasets.make_classification, RandomForestClassifier),
+        (datasets.make_regression, ExtraTreesRegressor),
+        (datasets.make_classification, ExtraTreesClassifier),
     ],
 )
 def test_missing_values_is_resilient(make_data, Forest):
@@ -1803,12 +1803,21 @@ def test_missing_values_is_resilient(make_data, Forest):
     assert score_with_missing >= 0.80 * score_without_missing
 
 
-@pytest.mark.parametrize("Forest", [RandomForestClassifier, RandomForestRegressor])
+@pytest.mark.parametrize(
+    "Forest",
+    [
+        RandomForestClassifier,
+        RandomForestRegressor,
+        ExtraTreesRegressor,
+        ExtraTreesClassifier,
+    ],
+)
 def test_missing_value_is_predictive(Forest):
     """Check that the forest learns when missing values are only present for
     a predictive feature."""
     rng = np.random.RandomState(0)
     n_samples = 300
+    expected_score = 0.75
 
     X_non_predictive = rng.standard_normal(size=(n_samples, 10))
     y = rng.randint(0, high=2, size=n_samples)
@@ -1838,19 +1847,20 @@ def test_missing_value_is_predictive(Forest):
 
     predictive_test_score = forest_predictive.score(X_predictive_test, y_test)
 
-    assert predictive_test_score >= 0.75
+    assert predictive_test_score >= expected_score
     assert predictive_test_score >= forest_non_predictive.score(
         X_non_predictive_test, y_test
     )
 
 
-def test_non_supported_criterion_raises_error_with_missing_values():
+@pytest.mark.parametrize("Forest", FOREST_REGRESSORS.values())
+def test_non_supported_criterion_raises_error_with_missing_values(Forest):
     """Raise error for unsupported criterion when there are missing values."""
     X = np.array([[0, 1, 2], [np.nan, 0, 2.0]])
     y = [0.5, 1.0]
 
-    forest = RandomForestRegressor(criterion="absolute_error")
+    forest = Forest(criterion="absolute_error")
 
-    msg = "RandomForestRegressor does not accept missing values"
+    msg = ".*does not accept missing values"
     with pytest.raises(ValueError, match=msg):
         forest.fit(X, y)
diff --git a/sklearn/ensemble/tests/test_iforest.py b/sklearn/ensemble/tests/test_iforest.py
index 22dcc92906a6b..19e34bbf51808 100644
--- a/sklearn/ensemble/tests/test_iforest.py
+++ b/sklearn/ensemble/tests/test_iforest.py
@@ -2,15 +2,15 @@
 Testing for Isolation Forest algorithm (sklearn.ensemble.iforest).
 """
 
-# Authors: Nicolas Goix <nicolas.goix@telecom-paristech.fr>
-#          Alexandre Gramfort <alexandre.gramfort@telecom-paristech.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from unittest.mock import Mock, patch
 
 import numpy as np
 import pytest
+from joblib import parallel_backend
 
 from sklearn.datasets import load_diabetes, load_iris, make_classification
 from sklearn.ensemble import IsolationForest
@@ -361,3 +361,33 @@ def test_iforest_sparse_input_float_contamination(sparse_container):
 
     X_decision = iforest.decision_function(X)
     assert (X_decision < 0).sum() / X.shape[0] == pytest.approx(contamination)
+
+
+@pytest.mark.parametrize("n_jobs", [1, 2])
+@pytest.mark.parametrize("contamination", [0.25, "auto"])
+def test_iforest_predict_parallel(global_random_seed, contamination, n_jobs):
+    """Check that `IsolationForest.predict` is parallelized."""
+    # toy sample (the last two samples are outliers)
+    X = [[-2, -1], [-1, -1], [-1, -2], [1, 1], [1, 2], [2, 1], [7, 4], [-5, 9]]
+
+    # Test IsolationForest
+    clf = IsolationForest(
+        random_state=global_random_seed, contamination=contamination, n_jobs=None
+    )
+    clf.fit(X)
+    decision_func = -clf.decision_function(X)
+    pred = clf.predict(X)
+
+    # assert detect outliers:
+    assert np.min(decision_func[-2:]) > np.max(decision_func[:-2])
+    assert_array_equal(pred, 6 * [1] + 2 * [-1])
+
+    clf_parallel = IsolationForest(
+        random_state=global_random_seed, contamination=contamination, n_jobs=-1
+    )
+    clf_parallel.fit(X)
+    with parallel_backend("threading", n_jobs=n_jobs):
+        pred_paralell = clf_parallel.predict(X)
+
+    # assert the same results as non-parallel
+    assert_array_equal(pred, pred_paralell)
diff --git a/sklearn/ensemble/tests/test_stacking.py b/sklearn/ensemble/tests/test_stacking.py
index 0d1493529e318..1f4f23b51d540 100644
--- a/sklearn/ensemble/tests/test_stacking.py
+++ b/sklearn/ensemble/tests/test_stacking.py
@@ -1,8 +1,9 @@
 """Test the stacking classifier and regressor."""
 
-# Authors: Guillaume Lemaitre <g.lemaitre58@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
+import re
 from unittest.mock import Mock
 
 import numpy as np
@@ -38,6 +39,12 @@
 from sklearn.neural_network import MLPClassifier
 from sklearn.preprocessing import scale
 from sklearn.svm import SVC, LinearSVC, LinearSVR
+from sklearn.tests.metadata_routing_common import (
+    ConsumingClassifier,
+    ConsumingRegressor,
+    _Registry,
+    check_recorded_metadata,
+)
 from sklearn.utils._mocking import CheckingClassifier
 from sklearn.utils._testing import (
     assert_allclose,
@@ -69,7 +76,7 @@ def test_stacking_classifier_iris(cv, final_estimator, passthrough):
     X_train, X_test, y_train, y_test = train_test_split(
         scale(X_iris), y_iris, stratify=y_iris, random_state=42
     )
-    estimators = [("lr", LogisticRegression()), ("svc", LinearSVC(dual="auto"))]
+    estimators = [("lr", LogisticRegression()), ("svc", LinearSVC())]
     clf = StackingClassifier(
         estimators=estimators,
         final_estimator=final_estimator,
@@ -121,7 +128,7 @@ def test_stacking_classifier_drop_column_binary_classification():
     assert X_trans.shape[1] == 2
 
     # LinearSVC does not implement 'predict_proba' and will not drop one column
-    estimators = [("lr", LogisticRegression()), ("svc", LinearSVC(dual="auto"))]
+    estimators = [("lr", LogisticRegression()), ("svc", LinearSVC())]
     clf.set_params(estimators=estimators)
 
     clf.fit(X_train, y_train)
@@ -135,10 +142,10 @@ def test_stacking_classifier_drop_estimator():
     X_train, X_test, y_train, _ = train_test_split(
         scale(X_iris), y_iris, stratify=y_iris, random_state=42
     )
-    estimators = [("lr", "drop"), ("svc", LinearSVC(dual="auto", random_state=0))]
+    estimators = [("lr", "drop"), ("svc", LinearSVC(random_state=0))]
     rf = RandomForestClassifier(n_estimators=10, random_state=42)
     clf = StackingClassifier(
-        estimators=[("svc", LinearSVC(dual="auto", random_state=0))],
+        estimators=[("svc", LinearSVC(random_state=0))],
         final_estimator=rf,
         cv=5,
     )
@@ -157,10 +164,10 @@ def test_stacking_regressor_drop_estimator():
     X_train, X_test, y_train, _ = train_test_split(
         scale(X_diabetes), y_diabetes, random_state=42
     )
-    estimators = [("lr", "drop"), ("svr", LinearSVR(dual="auto", random_state=0))]
+    estimators = [("lr", "drop"), ("svr", LinearSVR(random_state=0))]
     rf = RandomForestRegressor(n_estimators=10, random_state=42)
     reg = StackingRegressor(
-        estimators=[("svr", LinearSVR(dual="auto", random_state=0))],
+        estimators=[("svr", LinearSVR(random_state=0))],
         final_estimator=rf,
         cv=5,
     )
@@ -188,7 +195,7 @@ def test_stacking_regressor_diabetes(cv, final_estimator, predict_params, passth
     X_train, X_test, y_train, _ = train_test_split(
         scale(X_diabetes), y_diabetes, random_state=42
     )
-    estimators = [("lr", LinearRegression()), ("svr", LinearSVR(dual="auto"))]
+    estimators = [("lr", LinearRegression()), ("svr", LinearSVR())]
     reg = StackingRegressor(
         estimators=estimators,
         final_estimator=final_estimator,
@@ -226,7 +233,7 @@ def test_stacking_regressor_sparse_passthrough(sparse_container):
     X_train, X_test, y_train, _ = train_test_split(
         sparse_container(scale(X_diabetes)), y_diabetes, random_state=42
     )
-    estimators = [("lr", LinearRegression()), ("svr", LinearSVR(dual="auto"))]
+    estimators = [("lr", LinearRegression()), ("svr", LinearSVR())]
     rf = RandomForestRegressor(n_estimators=10, random_state=42)
     clf = StackingRegressor(
         estimators=estimators, final_estimator=rf, cv=5, passthrough=True
@@ -246,7 +253,7 @@ def test_stacking_classifier_sparse_passthrough(sparse_container):
     X_train, X_test, y_train, _ = train_test_split(
         sparse_container(scale(X_iris)), y_iris, random_state=42
     )
-    estimators = [("lr", LogisticRegression()), ("svc", LinearSVC(dual="auto"))]
+    estimators = [("lr", LogisticRegression()), ("svc", LinearSVC())]
     rf = RandomForestClassifier(n_estimators=10, random_state=42)
     clf = StackingClassifier(
         estimators=estimators, final_estimator=rf, cv=5, passthrough=True
@@ -319,7 +326,7 @@ def fit(self, X, y):
             {
                 "estimators": [
                     ("lr", LogisticRegression()),
-                    ("cor", LinearSVC(dual="auto", max_iter=50_000)),
+                    ("cor", LinearSVC(max_iter=50_000)),
                 ],
                 "final_estimator": NoWeightClassifier(),
             },
@@ -349,7 +356,7 @@ def test_stacking_classifier_error(y, params, type_err, msg_err):
             {
                 "estimators": [
                     ("lr", LinearRegression()),
-                    ("cor", LinearSVR(dual="auto")),
+                    ("cor", LinearSVR()),
                 ],
                 "final_estimator": NoWeightRegressor(),
             },
@@ -371,7 +378,7 @@ def test_stacking_regressor_error(y, params, type_err, msg_err):
             StackingClassifier(
                 estimators=[
                     ("lr", LogisticRegression(random_state=0)),
-                    ("svm", LinearSVC(dual="auto", random_state=0)),
+                    ("svm", LinearSVC(random_state=0)),
                 ]
             ),
             X_iris[:100],
@@ -381,7 +388,7 @@ def test_stacking_regressor_error(y, params, type_err, msg_err):
             StackingRegressor(
                 estimators=[
                     ("lr", LinearRegression()),
-                    ("svm", LinearSVR(dual="auto", random_state=0)),
+                    ("svm", LinearSVR(random_state=0)),
                 ]
             ),
             X_diabetes,
@@ -415,7 +422,7 @@ def test_stacking_classifier_stratify_default():
     clf = StackingClassifier(
         estimators=[
             ("lr", LogisticRegression(max_iter=10_000)),
-            ("svm", LinearSVC(dual="auto", max_iter=10_000)),
+            ("svm", LinearSVC(max_iter=10_000)),
         ]
     )
     # since iris is not shuffled, a simple k-fold would not contain the
@@ -430,7 +437,7 @@ def test_stacking_classifier_stratify_default():
             StackingClassifier(
                 estimators=[
                     ("lr", LogisticRegression()),
-                    ("svm", LinearSVC(dual="auto", random_state=42)),
+                    ("svm", LinearSVC(random_state=42)),
                 ],
                 final_estimator=LogisticRegression(),
                 cv=KFold(shuffle=True, random_state=42),
@@ -441,7 +448,7 @@ def test_stacking_classifier_stratify_default():
             StackingRegressor(
                 estimators=[
                     ("lr", LinearRegression()),
-                    ("svm", LinearSVR(dual="auto", random_state=42)),
+                    ("svm", LinearSVR(random_state=42)),
                 ],
                 final_estimator=LinearRegression(),
                 cv=KFold(shuffle=True, random_state=42),
@@ -498,7 +505,7 @@ def test_stacking_classifier_sample_weight_fit_param():
             StackingClassifier(
                 estimators=[
                     ("lr", LogisticRegression()),
-                    ("svm", LinearSVC(dual="auto", random_state=42)),
+                    ("svm", LinearSVC(random_state=42)),
                 ],
                 final_estimator=LogisticRegression(),
             ),
@@ -508,7 +515,7 @@ def test_stacking_classifier_sample_weight_fit_param():
             StackingRegressor(
                 estimators=[
                     ("lr", LinearRegression()),
-                    ("svm", LinearSVR(dual="auto", random_state=42)),
+                    ("svm", LinearSVR(random_state=42)),
                 ],
                 final_estimator=LinearRegression(),
             ),
@@ -614,7 +621,7 @@ def test_stacking_prefit(Stacker, Estimator, stack_method, final_estimator, X, y
             StackingRegressor(
                 estimators=[
                     ("lr", LinearRegression()),
-                    ("svm", LinearSVR(dual="auto")),
+                    ("svm", LinearSVR()),
                 ],
                 cv="prefit",
             ),
@@ -780,7 +787,7 @@ def test_stacking_classifier_multilabel_auto_predict(stack_method, passthrough):
             StackingClassifier(
                 estimators=[
                     ("lr", LogisticRegression(random_state=0)),
-                    ("svm", LinearSVC(dual="auto", random_state=0)),
+                    ("svm", LinearSVC(random_state=0)),
                 ]
             ),
             iris.feature_names,
@@ -800,7 +807,7 @@ def test_stacking_classifier_multilabel_auto_predict(stack_method, passthrough):
                 estimators=[
                     ("lr", LogisticRegression(random_state=0)),
                     ("other", "drop"),
-                    ("svm", LinearSVC(dual="auto", random_state=0)),
+                    ("svm", LinearSVC(random_state=0)),
                 ]
             ),
             iris.feature_names,
@@ -815,7 +822,7 @@ def test_stacking_classifier_multilabel_auto_predict(stack_method, passthrough):
             StackingRegressor(
                 estimators=[
                     ("lr", LinearRegression()),
-                    ("svm", LinearSVR(dual="auto", random_state=0)),
+                    ("svm", LinearSVR(random_state=0)),
                 ]
             ),
             diabetes.feature_names,
@@ -888,3 +895,124 @@ def test_stacking_final_estimator_attribute_error():
         clf.fit(X, y).decision_function(X)
     assert isinstance(exec_info.value.__cause__, AttributeError)
     assert inner_msg in str(exec_info.value.__cause__)
+
+
+# Metadata Routing Tests
+# ======================
+
+
+@pytest.mark.parametrize(
+    "Estimator, Child",
+    [
+        (StackingClassifier, ConsumingClassifier),
+        (StackingRegressor, ConsumingRegressor),
+    ],
+)
+def test_routing_passed_metadata_not_supported(Estimator, Child):
+    """Test that the right error message is raised when metadata is passed while
+    not supported when `enable_metadata_routing=False`."""
+
+    with pytest.raises(
+        ValueError, match="is only supported if enable_metadata_routing=True"
+    ):
+        Estimator(["clf", Child()]).fit(
+            X_iris, y_iris, sample_weight=[1, 1, 1, 1, 1], metadata="a"
+        )
+
+
+@pytest.mark.usefixtures("enable_slep006")
+@pytest.mark.parametrize(
+    "Estimator, Child",
+    [
+        (StackingClassifier, ConsumingClassifier),
+        (StackingRegressor, ConsumingRegressor),
+    ],
+)
+def test_get_metadata_routing_without_fit(Estimator, Child):
+    # Test that metadata_routing() doesn't raise when called before fit.
+    est = Estimator([("sub_est", Child())])
+    est.get_metadata_routing()
+
+
+@pytest.mark.usefixtures("enable_slep006")
+@pytest.mark.parametrize(
+    "Estimator, Child",
+    [
+        (StackingClassifier, ConsumingClassifier),
+        (StackingRegressor, ConsumingRegressor),
+    ],
+)
+@pytest.mark.parametrize(
+    "prop, prop_value", [("sample_weight", np.ones(X_iris.shape[0])), ("metadata", "a")]
+)
+def test_metadata_routing_for_stacking_estimators(Estimator, Child, prop, prop_value):
+    """Test that metadata is routed correctly for Stacking*."""
+
+    est = Estimator(
+        [
+            (
+                "sub_est1",
+                Child(registry=_Registry()).set_fit_request(**{prop: True}),
+            ),
+            (
+                "sub_est2",
+                Child(registry=_Registry()).set_fit_request(**{prop: True}),
+            ),
+        ],
+        final_estimator=Child(registry=_Registry()).set_predict_request(**{prop: True}),
+    )
+
+    est.fit(X_iris, y_iris, **{prop: prop_value})
+    est.fit_transform(X_iris, y_iris, **{prop: prop_value})
+
+    est.predict(X_iris, **{prop: prop_value})
+
+    for estimator in est.estimators:
+        # access sub-estimator in (name, est) with estimator[1]:
+        registry = estimator[1].registry
+        assert len(registry)
+        for sub_est in registry:
+            check_recorded_metadata(
+                obj=sub_est,
+                method="fit",
+                parent="fit",
+                split_params=(prop),
+                **{prop: prop_value},
+            )
+    # access final_estimator:
+    registry = est.final_estimator_.registry
+    assert len(registry)
+    check_recorded_metadata(
+        obj=registry[-1],
+        method="predict",
+        parent="predict",
+        split_params=(prop),
+        **{prop: prop_value},
+    )
+
+
+@pytest.mark.usefixtures("enable_slep006")
+@pytest.mark.parametrize(
+    "Estimator, Child",
+    [
+        (StackingClassifier, ConsumingClassifier),
+        (StackingRegressor, ConsumingRegressor),
+    ],
+)
+def test_metadata_routing_error_for_stacking_estimators(Estimator, Child):
+    """Test that the right error is raised when metadata is not requested."""
+    sample_weight, metadata = np.ones(X_iris.shape[0]), "a"
+
+    est = Estimator([("sub_est", Child())])
+
+    error_message = (
+        "[sample_weight, metadata] are passed but are not explicitly set as requested"
+        f" or not requested for {Child.__name__}.fit"
+    )
+
+    with pytest.raises(ValueError, match=re.escape(error_message)):
+        est.fit(X_iris, y_iris, sample_weight=sample_weight, metadata=metadata)
+
+
+# End of Metadata Routing Tests
+# =============================
diff --git a/sklearn/ensemble/tests/test_voting.py b/sklearn/ensemble/tests/test_voting.py
index 4b2c365752b72..3800925fa17d0 100644
--- a/sklearn/ensemble/tests/test_voting.py
+++ b/sklearn/ensemble/tests/test_voting.py
@@ -759,7 +759,7 @@ def test_metadata_routing_for_voting_estimators(Estimator, Child, prop):
         registry = estimator[1].registry
         assert len(registry)
         for sub_est in registry:
-            check_recorded_metadata(obj=sub_est, method="fit", **kwargs)
+            check_recorded_metadata(obj=sub_est, method="fit", parent="fit", **kwargs)
 
 
 @pytest.mark.usefixtures("enable_slep006")
diff --git a/sklearn/exceptions.py b/sklearn/exceptions.py
index 1466ce783ee00..7f6b26163cc87 100644
--- a/sklearn/exceptions.py
+++ b/sklearn/exceptions.py
@@ -1,7 +1,4 @@
-"""
-The :mod:`sklearn.exceptions` module includes all custom warnings and error
-classes used across scikit-learn.
-"""
+"""Custom warnings and errors used across scikit-learn."""
 
 __all__ = [
     "NotFittedError",
diff --git a/sklearn/experimental/__init__.py b/sklearn/experimental/__init__.py
index 0effaf5b05fa0..205a11a3d524b 100644
--- a/sklearn/experimental/__init__.py
+++ b/sklearn/experimental/__init__.py
@@ -1,7 +1,7 @@
-"""
-The :mod:`sklearn.experimental` module provides importable modules that enable
-the use of experimental features or estimators.
+"""Importable modules that enable the use of experimental features or estimators.
+
+.. warning::
 
-The features and estimators that are experimental aren't subject to
-deprecation cycles. Use them at your own risks!
+    The features and estimators that are experimental aren't subject to
+    deprecation cycles. Use them at your own risks!
 """
diff --git a/sklearn/externals/_scipy/sparse/csgraph/_laplacian.py b/sklearn/externals/_scipy/sparse/csgraph/_laplacian.py
index f862d261d66de..34c816628ee73 100644
--- a/sklearn/externals/_scipy/sparse/csgraph/_laplacian.py
+++ b/sklearn/externals/_scipy/sparse/csgraph/_laplacian.py
@@ -8,7 +8,7 @@
 Laplacian of a compressed-sparse graph
 """
 
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 from scipy.sparse import issparse
diff --git a/sklearn/feature_extraction/__init__.py b/sklearn/feature_extraction/__init__.py
index f4db85303f4b6..dced9d46b4cc7 100644
--- a/sklearn/feature_extraction/__init__.py
+++ b/sklearn/feature_extraction/__init__.py
@@ -1,8 +1,4 @@
-"""
-The :mod:`sklearn.feature_extraction` module deals with feature extraction
-from raw data. It currently includes methods to extract features from text and
-images.
-"""
+"""Feature extraction from raw data."""
 
 from . import text
 from ._dict_vectorizer import DictVectorizer
diff --git a/sklearn/feature_extraction/_dict_vectorizer.py b/sklearn/feature_extraction/_dict_vectorizer.py
index 9855684b550c4..6f4f0890c327e 100644
--- a/sklearn/feature_extraction/_dict_vectorizer.py
+++ b/sklearn/feature_extraction/_dict_vectorizer.py
@@ -1,6 +1,5 @@
-# Authors: Lars Buitinck
-#          Dan Blanchard <dblanchard@ets.org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from array import array
 from collections.abc import Iterable, Mapping
diff --git a/sklearn/feature_extraction/_hash.py b/sklearn/feature_extraction/_hash.py
index 9874bc0a02835..a7cad9d33695b 100644
--- a/sklearn/feature_extraction/_hash.py
+++ b/sklearn/feature_extraction/_hash.py
@@ -1,5 +1,5 @@
-# Author: Lars Buitinck
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from itertools import chain
 from numbers import Integral
diff --git a/sklearn/feature_extraction/_hashing_fast.pyx b/sklearn/feature_extraction/_hashing_fast.pyx
index 93e7ac7e88540..5069d555d60ea 100644
--- a/sklearn/feature_extraction/_hashing_fast.pyx
+++ b/sklearn/feature_extraction/_hashing_fast.pyx
@@ -1,5 +1,5 @@
-# Author: Lars Buitinck
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from libc.stdlib cimport abs
 from libcpp.vector cimport vector
diff --git a/sklearn/feature_extraction/image.py b/sklearn/feature_extraction/image.py
index 3f64ff11e246f..1189618f07feb 100644
--- a/sklearn/feature_extraction/image.py
+++ b/sklearn/feature_extraction/image.py
@@ -1,13 +1,7 @@
-"""
-The :mod:`sklearn.feature_extraction.image` submodule gathers utilities to
-extract features from images.
-"""
+"""Utilities to extract features from images."""
 
-# Authors: Emmanuelle Gouillart <emmanuelle.gouillart@normalesup.org>
-#          Gael Varoquaux <gael.varoquaux@normalesup.org>
-#          Olivier Grisel
-#          Vlad Niculae
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from itertools import product
 from numbers import Integral, Number, Real
@@ -240,6 +234,9 @@ def grid_to_graph(
     >>> mask[[1, 2], [1, 2], :] = True
     >>> graph = grid_to_graph(*shape_img, mask=mask)
     >>> print(graph)
+    <COOrdinate sparse matrix of dtype 'int64'
+      with 2 stored elements and shape (2, 2)>
+      Coords	Values
       (0, 0)    1
       (1, 1)    1
     """
diff --git a/sklearn/feature_extraction/meson.build b/sklearn/feature_extraction/meson.build
index 5499cea908d79..81732474de3b2 100644
--- a/sklearn/feature_extraction/meson.build
+++ b/sklearn/feature_extraction/meson.build
@@ -1,6 +1,6 @@
 py.extension_module(
   '_hashing_fast',
-  '_hashing_fast.pyx',
+  ['_hashing_fast.pyx', utils_cython_tree],
   dependencies: [np_dep],
   override_options: ['cython_language=cpp'],
   cython_args: cython_args,
diff --git a/sklearn/feature_extraction/tests/test_dict_vectorizer.py b/sklearn/feature_extraction/tests/test_dict_vectorizer.py
index e9784d68d7199..7a539942d1e46 100644
--- a/sklearn/feature_extraction/tests/test_dict_vectorizer.py
+++ b/sklearn/feature_extraction/tests/test_dict_vectorizer.py
@@ -1,6 +1,5 @@
-# Authors: Lars Buitinck
-#          Dan Blanchard <dblanchard@ets.org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from random import Random
 
diff --git a/sklearn/feature_extraction/tests/test_image.py b/sklearn/feature_extraction/tests/test_image.py
index 375652c848db6..2edf1a22d676a 100644
--- a/sklearn/feature_extraction/tests/test_image.py
+++ b/sklearn/feature_extraction/tests/test_image.py
@@ -1,6 +1,5 @@
-# Authors: Emmanuelle Gouillart <emmanuelle.gouillart@normalesup.org>
-#          Gael Varoquaux <gael.varoquaux@normalesup.org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 import pytest
diff --git a/sklearn/feature_extraction/tests/test_text.py b/sklearn/feature_extraction/tests/test_text.py
index 16b17fe5541c6..b064606542236 100644
--- a/sklearn/feature_extraction/tests/test_text.py
+++ b/sklearn/feature_extraction/tests/test_text.py
@@ -29,10 +29,9 @@
 from sklearn.utils._testing import (
     assert_allclose_dense_sparse,
     assert_almost_equal,
-    fails_if_pypy,
     skip_if_32bit,
 )
-from sklearn.utils.fixes import _IS_PYPY, _IS_WASM, CSC_CONTAINERS, CSR_CONTAINERS
+from sklearn.utils.fixes import _IS_WASM, CSC_CONTAINERS, CSR_CONTAINERS
 
 JUNK_FOOD_DOCS = (
     "the pizza pizza beer copyright",
@@ -643,7 +642,6 @@ def test_tfidf_vectorizer_setters():
     assert tv._tfidf.sublinear_tf == tv.sublinear_tf
 
 
-@fails_if_pypy
 def test_hashing_vectorizer():
     v = HashingVectorizer()
     X = v.transform(ALL_FOOD_DOCS)
@@ -756,21 +754,11 @@ def test_feature_names():
 @pytest.mark.parametrize("Vectorizer", (CountVectorizer, TfidfVectorizer))
 def test_vectorizer_max_features(Vectorizer):
     expected_vocabulary = {"burger", "beer", "salad", "pizza"}
-    expected_stop_words = {
-        "celeri",
-        "tomato",
-        "copyright",
-        "coke",
-        "sparkling",
-        "water",
-        "the",
-    }
 
     # test bounded number of extracted features
     vectorizer = Vectorizer(max_df=0.6, max_features=4)
     vectorizer.fit(ALL_FOOD_DOCS)
     assert set(vectorizer.vocabulary_) == expected_vocabulary
-    assert vectorizer.stop_words_ == expected_stop_words
 
 
 def test_count_vectorizer_max_features():
@@ -805,21 +793,16 @@ def test_vectorizer_max_df():
     vect.fit(test_data)
     assert "a" in vect.vocabulary_.keys()
     assert len(vect.vocabulary_.keys()) == 6
-    assert len(vect.stop_words_) == 0
 
     vect.max_df = 0.5  # 0.5 * 3 documents -> max_doc_count == 1.5
     vect.fit(test_data)
     assert "a" not in vect.vocabulary_.keys()  # {ae} ignored
     assert len(vect.vocabulary_.keys()) == 4  # {bcdt} remain
-    assert "a" in vect.stop_words_
-    assert len(vect.stop_words_) == 2
 
     vect.max_df = 1
     vect.fit(test_data)
     assert "a" not in vect.vocabulary_.keys()  # {ae} ignored
     assert len(vect.vocabulary_.keys()) == 4  # {bcdt} remain
-    assert "a" in vect.stop_words_
-    assert len(vect.stop_words_) == 2
 
 
 def test_vectorizer_min_df():
@@ -828,21 +811,16 @@ def test_vectorizer_min_df():
     vect.fit(test_data)
     assert "a" in vect.vocabulary_.keys()
     assert len(vect.vocabulary_.keys()) == 6
-    assert len(vect.stop_words_) == 0
 
     vect.min_df = 2
     vect.fit(test_data)
     assert "c" not in vect.vocabulary_.keys()  # {bcdt} ignored
     assert len(vect.vocabulary_.keys()) == 2  # {ae} remain
-    assert "c" in vect.stop_words_
-    assert len(vect.stop_words_) == 4
 
     vect.min_df = 0.8  # 0.8 * 3 documents -> min_doc_count == 2.4
     vect.fit(test_data)
     assert "c" not in vect.vocabulary_.keys()  # {bcdet} ignored
     assert len(vect.vocabulary_.keys()) == 1  # {a} remains
-    assert "c" in vect.stop_words_
-    assert len(vect.stop_words_) == 5
 
 
 def test_count_binary_occurrences():
@@ -865,7 +843,6 @@ def test_count_binary_occurrences():
     assert X_sparse.dtype == np.float32
 
 
-@fails_if_pypy
 def test_hashed_binary_occurrences():
     # by default multiple occurrences are counted as longs
     test_data = ["aaabc", "abbde"]
@@ -936,7 +913,7 @@ def test_count_vectorizer_pipeline_grid_selection():
         data, target, test_size=0.2, random_state=0
     )
 
-    pipeline = Pipeline([("vect", CountVectorizer()), ("svc", LinearSVC(dual="auto"))])
+    pipeline = Pipeline([("vect", CountVectorizer()), ("svc", LinearSVC())])
 
     parameters = {
         "vect__ngram_range": [(1, 1), (1, 2)],
@@ -972,7 +949,7 @@ def test_vectorizer_pipeline_grid_selection():
         data, target, test_size=0.1, random_state=0
     )
 
-    pipeline = Pipeline([("vect", TfidfVectorizer()), ("svc", LinearSVC(dual="auto"))])
+    pipeline = Pipeline([("vect", TfidfVectorizer()), ("svc", LinearSVC())])
 
     parameters = {
         "vect__ngram_range": [(1, 1), (1, 2)],
@@ -1006,13 +983,12 @@ def test_vectorizer_pipeline_cross_validation():
     # label junk food as -1, the others as +1
     target = [-1] * len(JUNK_FOOD_DOCS) + [1] * len(NOTJUNK_FOOD_DOCS)
 
-    pipeline = Pipeline([("vect", TfidfVectorizer()), ("svc", LinearSVC(dual="auto"))])
+    pipeline = Pipeline([("vect", TfidfVectorizer()), ("svc", LinearSVC())])
 
     cv_scores = cross_val_score(pipeline, data, target, cv=3)
     assert_array_equal(cv_scores, [1.0, 1.0, 1.0])
 
 
-@fails_if_pypy
 def test_vectorizer_unicode():
     # tests that the count vectorizer works with cyrillic.
     document = (
@@ -1068,13 +1044,10 @@ def test_pickling_vectorizer():
         copy = pickle.loads(s)
         assert type(copy) == orig.__class__
         assert copy.get_params() == orig.get_params()
-        if _IS_PYPY and isinstance(orig, HashingVectorizer):
-            continue
-        else:
-            assert_allclose_dense_sparse(
-                copy.fit_transform(JUNK_FOOD_DOCS),
-                orig.fit_transform(JUNK_FOOD_DOCS),
-            )
+        assert_allclose_dense_sparse(
+            copy.fit_transform(JUNK_FOOD_DOCS),
+            orig.fit_transform(JUNK_FOOD_DOCS),
+        )
 
 
 @pytest.mark.parametrize(
@@ -1155,28 +1128,6 @@ def test_countvectorizer_vocab_dicts_when_pickling():
         )
 
 
-def test_stop_words_removal():
-    # Ensure that deleting the stop_words_ attribute doesn't affect transform
-
-    fitted_vectorizers = (
-        TfidfVectorizer().fit(JUNK_FOOD_DOCS),
-        CountVectorizer(preprocessor=strip_tags).fit(JUNK_FOOD_DOCS),
-        CountVectorizer(strip_accents=strip_eacute).fit(JUNK_FOOD_DOCS),
-    )
-
-    for vect in fitted_vectorizers:
-        vect_transform = vect.transform(JUNK_FOOD_DOCS).toarray()
-
-        vect.stop_words_ = None
-        stop_None_transform = vect.transform(JUNK_FOOD_DOCS).toarray()
-
-        delattr(vect, "stop_words_")
-        stop_del_transform = vect.transform(JUNK_FOOD_DOCS).toarray()
-
-        assert_array_equal(stop_None_transform, vect_transform)
-        assert_array_equal(stop_del_transform, vect_transform)
-
-
 def test_pickling_transformer():
     X = CountVectorizer().fit_transform(JUNK_FOOD_DOCS)
     orig = TfidfTransformer().fit(X)
@@ -1227,7 +1178,6 @@ def test_non_unique_vocab():
         vect.fit([])
 
 
-@fails_if_pypy
 def test_hashingvectorizer_nan_in_docs():
     # np.nan can appear when using pandas to load text fields from a csv file
     # with missing values.
@@ -1346,8 +1296,6 @@ def test_vectorizers_invalid_ngram_range(vec):
         f"Invalid value for ngram_range={invalid_range} "
         "lower boundary larger than the upper boundary."
     )
-    if isinstance(vec, HashingVectorizer) and _IS_PYPY:
-        pytest.xfail(reason="HashingVectorizer is not supported on PyPy")
 
     with pytest.raises(ValueError, match=message):
         vec.fit(["good news everyone"])
@@ -1367,7 +1315,6 @@ def _check_stop_words_consistency(estimator):
     return estimator._check_stop_words_consistency(stop_words, preprocess, tokenize)
 
 
-@fails_if_pypy
 def test_vectorizer_stop_words_inconsistent():
     lstr = r"\['and', 'll', 've'\]"
     message = (
@@ -1421,7 +1368,6 @@ def test_countvectorizer_sort_features_64bit_sparse_indices(csr_container):
     assert INDICES_DTYPE == Xs.indices.dtype
 
 
-@fails_if_pypy
 @pytest.mark.parametrize(
     "Estimator", [CountVectorizer, TfidfVectorizer, HashingVectorizer]
 )
@@ -1461,8 +1407,6 @@ def build_preprocessor(self):
     ],
 )
 def test_callable_analyzer_error(Estimator, input_type, err_type, err_msg):
-    if issubclass(Estimator, HashingVectorizer) and _IS_PYPY:
-        pytest.xfail("HashingVectorizer is not supported on PyPy")
     data = ["this is text, not file or filename"]
     with pytest.raises(err_type, match=err_msg):
         Estimator(analyzer=lambda x: x.split(), input=input_type).fit_transform(data)
@@ -1473,7 +1417,7 @@ def test_callable_analyzer_error(Estimator, input_type, err_type, err_msg):
     [
         CountVectorizer,
         TfidfVectorizer,
-        pytest.param(HashingVectorizer, marks=fails_if_pypy),
+        pytest.param(HashingVectorizer),
     ],
 )
 @pytest.mark.parametrize(
@@ -1494,9 +1438,6 @@ def test_callable_analyzer_reraise_error(tmpdir, Estimator):
     def analyzer(doc):
         raise Exception("testing")
 
-    if issubclass(Estimator, HashingVectorizer) and _IS_PYPY:
-        pytest.xfail("HashingVectorizer is not supported on PyPy")
-
     f = tmpdir.join("file.txt")
     f.write("sample content\n")
 
@@ -1637,7 +1578,6 @@ def test_tie_breaking_sample_order_invariance():
     assert vocab1 == vocab2
 
 
-@fails_if_pypy
 def test_nonnegative_hashing_vectorizer_result_indices():
     # add test for pr 19035
     hashing = HashingVectorizer(n_features=1000000, ngram_range=(2, 3))
diff --git a/sklearn/feature_extraction/text.py b/sklearn/feature_extraction/text.py
index c8cf37ac322e9..ff536fa94d983 100644
--- a/sklearn/feature_extraction/text.py
+++ b/sklearn/feature_extraction/text.py
@@ -1,15 +1,7 @@
-# Authors: Olivier Grisel <olivier.grisel@ensta.org>
-#          Mathieu Blondel <mathieu@mblondel.org>
-#          Lars Buitinck
-#          Robert Layton <robertlayton@gmail.com>
-#          Jochen Wersdörfer <jochen@wersdoerfer.de>
-#          Roman Sinayev <roman.sinayev@gmail.com>
-#
-# License: BSD 3 clause
-"""
-The :mod:`sklearn.feature_extraction.text` submodule gathers utilities to
-build feature vectors from text documents.
-"""
+"""Utilities to build feature vectors from text documents."""
+
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import array
 import re
@@ -603,6 +595,10 @@ class HashingVectorizer(
     For an efficiency comparison of the different feature extractors, see
     :ref:`sphx_glr_auto_examples_text_plot_hashing_vs_dict_vectorizer.py`.
 
+    For an example of document clustering and comparison with
+    :class:`~sklearn.feature_extraction.text.TfidfVectorizer`, see
+    :ref:`sphx_glr_auto_examples_text_plot_document_clustering.py`.
+
     Read more in the :ref:`User Guide <text_feature_extraction>`.
 
     Parameters
@@ -1079,15 +1075,6 @@ class CountVectorizer(_VectorizerMixin, BaseEstimator):
         True if a fixed vocabulary of term to indices mapping
         is provided by the user.
 
-    stop_words_ : set
-        Terms that were ignored because they either:
-
-          - occurred in too many documents (`max_df`)
-          - occurred in too few documents (`min_df`)
-          - were cut off by feature selection (`max_features`).
-
-        This is only available if no vocabulary was given.
-
     See Also
     --------
     HashingVectorizer : Convert a collection of text documents to a
@@ -1096,12 +1083,6 @@ class CountVectorizer(_VectorizerMixin, BaseEstimator):
     TfidfVectorizer : Convert a collection of raw documents to a matrix
         of TF-IDF features.
 
-    Notes
-    -----
-    The ``stop_words_`` attribute can get large and increase the model size
-    when pickling. This attribute is provided only for introspection and can
-    be safely removed using delattr or set to None before pickling.
-
     Examples
     --------
     >>> from sklearn.feature_extraction.text import CountVectorizer
@@ -1240,19 +1221,17 @@ def _limit_features(self, X, vocabulary, high=None, low=None, limit=None):
             mask = new_mask
 
         new_indices = np.cumsum(mask) - 1  # maps old indices to new
-        removed_terms = set()
         for term, old_index in list(vocabulary.items()):
             if mask[old_index]:
                 vocabulary[term] = new_indices[old_index]
             else:
                 del vocabulary[term]
-                removed_terms.add(term)
         kept_indices = np.where(mask)[0]
         if len(kept_indices) == 0:
             raise ValueError(
                 "After pruning, no terms remain. Try a lower min_df or a higher max_df."
             )
-        return X[:, kept_indices], removed_terms
+        return X[:, kept_indices]
 
     def _count_vocab(self, raw_documents, fixed_vocab):
         """Create sparse feature matrix, and vocabulary where fixed_vocab=False"""
@@ -1397,7 +1376,7 @@ def fit_transform(self, raw_documents, y=None):
                 raise ValueError("max_df corresponds to < documents than min_df")
             if max_features is not None:
                 X = self._sort_features(X, vocabulary)
-            X, self.stop_words_ = self._limit_features(
+            X = self._limit_features(
                 X, vocabulary, max_doc_count, min_doc_count, max_features
             )
             if max_features is None:
@@ -1745,6 +1724,10 @@ class TfidfVectorizer(CountVectorizer):
     For an efficiency comparison of the different feature extractors, see
     :ref:`sphx_glr_auto_examples_text_plot_hashing_vs_dict_vectorizer.py`.
 
+    For an example of document clustering and comparison with
+    :class:`~sklearn.feature_extraction.text.HashingVectorizer`, see
+    :ref:`sphx_glr_auto_examples_text_plot_document_clustering.py`.
+
     Read more in the :ref:`User Guide <text_feature_extraction>`.
 
     Parameters
@@ -1911,15 +1894,6 @@ class TfidfVectorizer(CountVectorizer):
         The inverse document frequency (IDF) vector; only defined
         if ``use_idf`` is True.
 
-    stop_words_ : set
-        Terms that were ignored because they either:
-
-          - occurred in too many documents (`max_df`)
-          - occurred in too few documents (`min_df`)
-          - were cut off by feature selection (`max_features`).
-
-        This is only available if no vocabulary was given.
-
     See Also
     --------
     CountVectorizer : Transforms text into a sparse matrix of n-gram counts.
@@ -1927,12 +1901,6 @@ class TfidfVectorizer(CountVectorizer):
     TfidfTransformer : Performs the TF-IDF transformation from a provided
         matrix of counts.
 
-    Notes
-    -----
-    The ``stop_words_`` attribute can get large and increase the model size
-    when pickling. This attribute is provided only for introspection and can
-    be safely removed using delattr or set to None before pickling.
-
     Examples
     --------
     >>> from sklearn.feature_extraction.text import TfidfVectorizer
diff --git a/sklearn/feature_selection/__init__.py b/sklearn/feature_selection/__init__.py
index 4fbc631155078..d431a5b016807 100644
--- a/sklearn/feature_selection/__init__.py
+++ b/sklearn/feature_selection/__init__.py
@@ -1,7 +1,7 @@
-"""
-The :mod:`sklearn.feature_selection` module implements feature selection
-algorithms. It currently includes univariate filter selection methods and the
-recursive feature elimination algorithm.
+"""Feature selection algorithms.
+
+These include univariate filter selection methods and the recursive feature elimination
+algorithm.
 """
 
 from ._base import SelectorMixin
diff --git a/sklearn/feature_selection/_base.py b/sklearn/feature_selection/_base.py
index 666550c196b97..12553403f4b90 100644
--- a/sklearn/feature_selection/_base.py
+++ b/sklearn/feature_selection/_base.py
@@ -1,7 +1,7 @@
 """Generic feature selection mixin"""
 
-# Authors: G. Varoquaux, A. Gramfort, L. Buitinck, J. Nothman
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from abc import ABCMeta, abstractmethod
diff --git a/sklearn/feature_selection/_from_model.py b/sklearn/feature_selection/_from_model.py
index 5610121f152bf..831c34b8dcec6 100644
--- a/sklearn/feature_selection/_from_model.py
+++ b/sklearn/feature_selection/_from_model.py
@@ -1,5 +1,5 @@
-# Authors: Gilles Louppe, Mathieu Blondel, Maheshakya Wijewardena
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from copy import deepcopy
 from numbers import Integral, Real
@@ -513,8 +513,8 @@ def get_metadata_routing(self):
         router = MetadataRouter(owner=self.__class__.__name__).add(
             estimator=self.estimator,
             method_mapping=MethodMapping()
-            .add(callee="partial_fit", caller="partial_fit")
-            .add(callee="fit", caller="fit"),
+            .add(caller="partial_fit", callee="partial_fit")
+            .add(caller="fit", callee="fit"),
         )
         return router
 
diff --git a/sklearn/feature_selection/_rfe.py b/sklearn/feature_selection/_rfe.py
index 44764655e988d..be71efaf27a0e 100644
--- a/sklearn/feature_selection/_rfe.py
+++ b/sklearn/feature_selection/_rfe.py
@@ -1,11 +1,9 @@
-# Authors: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#          Vincent Michel <vincent.michel@inria.fr>
-#          Gilles Louppe <g.louppe@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 """Recursive feature elimination for feature ranking"""
 
+import warnings
 from numbers import Integral
 
 import numpy as np
@@ -286,6 +284,14 @@ def _fit(self, X, y, step_score=None, **fit_params):
             n_features_to_select = n_features // 2
         elif isinstance(self.n_features_to_select, Integral):  # int
             n_features_to_select = self.n_features_to_select
+            if n_features_to_select > n_features:
+                warnings.warn(
+                    (
+                        f"Found {n_features_to_select=} > {n_features=}. There will be"
+                        " no feature selection and all features will be kept."
+                    ),
+                    UserWarning,
+                )
         else:  # float
             n_features_to_select = int(n_features * self.n_features_to_select)
 
@@ -530,7 +536,7 @@ class RFECV(RFE):
             ``cv`` default value of None changed from 3-fold to 5-fold.
 
     scoring : str, callable or None, default=None
-        A string (see model evaluation documentation) or
+        A string (see :ref:`scoring_parameter`) or
         a scorer callable object / function with signature
         ``scorer(estimator, X, y)``.
 
@@ -729,9 +735,19 @@ def fit(self, X, y, groups=None):
 
         # Build an RFE object, which will evaluate and score each possible
         # feature count, down to self.min_features_to_select
+        n_features = X.shape[1]
+        if self.min_features_to_select > n_features:
+            warnings.warn(
+                (
+                    f"Found min_features_to_select={self.min_features_to_select} > "
+                    f"{n_features=}. There will be no feature selection and all "
+                    "features will be kept."
+                ),
+                UserWarning,
+            )
         rfe = RFE(
             estimator=self.estimator,
-            n_features_to_select=self.min_features_to_select,
+            n_features_to_select=min(self.min_features_to_select, n_features),
             importance_getter=self.importance_getter,
             step=self.step,
             verbose=self.verbose,
diff --git a/sklearn/feature_selection/_univariate_selection.py b/sklearn/feature_selection/_univariate_selection.py
index df1b5072ce741..38ed63aaddb9d 100644
--- a/sklearn/feature_selection/_univariate_selection.py
+++ b/sklearn/feature_selection/_univariate_selection.py
@@ -1,8 +1,7 @@
 """Univariate features selection."""
 
-# Authors: V. Michel, B. Thirion, G. Varoquaux, A. Gramfort, E. Duchesnay.
-#          L. Buitinck, A. Joly
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 import warnings
diff --git a/sklearn/feature_selection/tests/test_from_model.py b/sklearn/feature_selection/tests/test_from_model.py
index 3573b7a078294..4f8e97948ee7c 100644
--- a/sklearn/feature_selection/tests/test_from_model.py
+++ b/sklearn/feature_selection/tests/test_from_model.py
@@ -408,7 +408,7 @@ def test_partial_fit():
 
 
 def test_calling_fit_reinitializes():
-    est = LinearSVC(dual="auto", random_state=0)
+    est = LinearSVC(random_state=0)
     transformer = SelectFromModel(estimator=est)
     transformer.fit(data, y)
     transformer.set_params(estimator__C=100)
diff --git a/sklearn/feature_selection/tests/test_rfe.py b/sklearn/feature_selection/tests/test_rfe.py
index 01c6194493ab6..a0610e990054f 100644
--- a/sklearn/feature_selection/tests/test_rfe.py
+++ b/sklearn/feature_selection/tests/test_rfe.py
@@ -464,7 +464,7 @@ def test_rfe_wrapped_estimator(importance_getter, selector, expected_n_features)
     # Non-regression test for
     # https://github.com/scikit-learn/scikit-learn/issues/15312
     X, y = make_friedman1(n_samples=50, n_features=10, random_state=0)
-    estimator = LinearSVR(dual="auto", random_state=0)
+    estimator = LinearSVR(random_state=0)
 
     log_estimator = TransformedTargetRegressor(
         regressor=estimator, func=np.log, inverse_func=np.exp
@@ -486,7 +486,7 @@ def test_rfe_wrapped_estimator(importance_getter, selector, expected_n_features)
 @pytest.mark.parametrize("Selector", [RFE, RFECV])
 def test_rfe_importance_getter_validation(importance_getter, err_type, Selector):
     X, y = make_friedman1(n_samples=50, n_features=10, random_state=42)
-    estimator = LinearSVR(dual="auto")
+    estimator = LinearSVR()
     log_estimator = TransformedTargetRegressor(
         regressor=estimator, func=np.log, inverse_func=np.exp
     )
@@ -649,3 +649,20 @@ def test_rfe_estimator_attribute_error():
         rfe.fit(iris.data, iris.target).decision_function(iris.data)
     assert isinstance(exec_info.value.__cause__, AttributeError)
     assert inner_msg in str(exec_info.value.__cause__)
+
+
+@pytest.mark.parametrize(
+    "ClsRFE, param", [(RFE, "n_features_to_select"), (RFECV, "min_features_to_select")]
+)
+def test_rfe_n_features_to_select_warning(ClsRFE, param):
+    """Check if the correct warning is raised when trying to initialize a RFE
+    object with a n_features_to_select attribute larger than the number of
+    features present in the X variable that is passed to the fit method
+    """
+    X, y = make_classification(n_features=20, random_state=0)
+
+    with pytest.warns(UserWarning, match=f"{param}=21 > n_features=20"):
+        # Create RFE/RFECV with n_features_to_select/min_features_to_select
+        # larger than the number of features present in the X variable
+        clsrfe = ClsRFE(estimator=LogisticRegression(), **{param: 21})
+        clsrfe.fit(X, y)
diff --git a/sklearn/gaussian_process/__init__.py b/sklearn/gaussian_process/__init__.py
index bc0d902b45b18..8dcbe3140415a 100644
--- a/sklearn/gaussian_process/__init__.py
+++ b/sklearn/gaussian_process/__init__.py
@@ -1,12 +1,7 @@
-# Author: Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-#         Vincent Dubourg <vincent.dubourg@gmail.com>
-#         (mostly translation, see implementation details)
-# License: BSD 3 clause
+"""Gaussian process based regression and classification."""
 
-"""
-The :mod:`sklearn.gaussian_process` module implements Gaussian Process
-based regression and classification.
-"""
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from . import kernels
 from ._gpc import GaussianProcessClassifier
diff --git a/sklearn/gaussian_process/_gpc.py b/sklearn/gaussian_process/_gpc.py
index 013815795a853..6edc45790fe71 100644
--- a/sklearn/gaussian_process/_gpc.py
+++ b/sklearn/gaussian_process/_gpc.py
@@ -1,8 +1,7 @@
 """Gaussian processes classification."""
 
-# Authors: Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from numbers import Integral
 from operator import itemgetter
diff --git a/sklearn/gaussian_process/_gpr.py b/sklearn/gaussian_process/_gpr.py
index 67bba2e29c857..4221bbe7f6b54 100644
--- a/sklearn/gaussian_process/_gpr.py
+++ b/sklearn/gaussian_process/_gpr.py
@@ -1,8 +1,7 @@
 """Gaussian processes regression."""
 
-# Authors: Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-# Modified by: Pete Green <p.l.green@liverpool.ac.uk>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from numbers import Integral, Real
@@ -384,7 +383,7 @@ def predict(self, X, return_std=False, return_cov=False):
         Returns
         -------
         y_mean : ndarray of shape (n_samples,) or (n_samples, n_targets)
-            Mean of predictive distribution a query points.
+            Mean of predictive distribution at query points.
 
         y_std : ndarray of shape (n_samples,) or (n_samples, n_targets), optional
             Standard deviation of predictive distribution at query points.
@@ -392,7 +391,7 @@ def predict(self, X, return_std=False, return_cov=False):
 
         y_cov : ndarray of shape (n_samples, n_samples) or \
                 (n_samples, n_samples, n_targets), optional
-            Covariance of joint predictive distribution a query points.
+            Covariance of joint predictive distribution at query points.
             Only returned when `return_cov` is True.
         """
         if return_std and return_cov:
diff --git a/sklearn/gaussian_process/kernels.py b/sklearn/gaussian_process/kernels.py
index c31335696944c..07db98d69289b 100644
--- a/sklearn/gaussian_process/kernels.py
+++ b/sklearn/gaussian_process/kernels.py
@@ -1,7 +1,4 @@
-"""
-The :mod:`sklearn.gaussian_process.kernels` module implements a set of kernels that
-can be combined by operators and used in Gaussian processes.
-"""
+"""A set of kernels that can be combined by operators and used in Gaussian processes."""
 
 # Kernels for Gaussian process regression and classification.
 #
@@ -18,8 +15,8 @@
 # optimization.
 
 
-# Author: Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # Note: this module is strongly inspired by the kernel module of the george
 #       package.
diff --git a/sklearn/gaussian_process/tests/test_gpc.py b/sklearn/gaussian_process/tests/test_gpc.py
index bd8bd39e1cc01..3ce2229f9e80f 100644
--- a/sklearn/gaussian_process/tests/test_gpc.py
+++ b/sklearn/gaussian_process/tests/test_gpc.py
@@ -1,7 +1,7 @@
 """Testing for Gaussian process classification"""
 
-# Author: Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 
diff --git a/sklearn/gaussian_process/tests/test_gpr.py b/sklearn/gaussian_process/tests/test_gpr.py
index e280827926d28..f49ed71231ad9 100644
--- a/sklearn/gaussian_process/tests/test_gpr.py
+++ b/sklearn/gaussian_process/tests/test_gpr.py
@@ -1,8 +1,7 @@
 """Testing for Gaussian process regression"""
 
-# Author: Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-# Modified by: Pete Green <p.l.green@liverpool.ac.uk>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import re
 import sys
diff --git a/sklearn/gaussian_process/tests/test_kernels.py b/sklearn/gaussian_process/tests/test_kernels.py
index 8733f94c94e06..3b9a0114542ec 100644
--- a/sklearn/gaussian_process/tests/test_kernels.py
+++ b/sklearn/gaussian_process/tests/test_kernels.py
@@ -1,7 +1,7 @@
 """Testing for kernels for Gaussian processes."""
 
-# Author: Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from inspect import signature
 
diff --git a/sklearn/impute/__init__.py b/sklearn/impute/__init__.py
index 380bcecaf65b5..a40c6b432d6d5 100644
--- a/sklearn/impute/__init__.py
+++ b/sklearn/impute/__init__.py
@@ -1,4 +1,4 @@
-"""Transformers for missing value imputation"""
+"""Transformers for missing value imputation."""
 
 import typing
 
diff --git a/sklearn/impute/_base.py b/sklearn/impute/_base.py
index 04a4dffd10e68..6109e3fde7b2a 100644
--- a/sklearn/impute/_base.py
+++ b/sklearn/impute/_base.py
@@ -1,6 +1,5 @@
-# Authors: Nicolas Tresegnie <nicolas.tresegnie@gmail.com>
-#          Sergey Feldman <sergeyfeldman@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numbers
 import warnings
@@ -334,6 +333,7 @@ def _validate_input(self, X, in_fit):
                 reset=in_fit,
                 accept_sparse="csc",
                 dtype=dtype,
+                force_writeable=True if not in_fit else None,
                 force_all_finite=force_all_finite,
                 copy=self.copy,
             )
diff --git a/sklearn/impute/_knn.py b/sklearn/impute/_knn.py
index 64f55693356d6..2e18246b4b9bb 100644
--- a/sklearn/impute/_knn.py
+++ b/sklearn/impute/_knn.py
@@ -1,6 +1,5 @@
-# Authors: Ashim Bhattarai <ashimb9@gmail.com>
-#          Thomas J Fan <thomasjpfan@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from numbers import Integral
 
@@ -195,6 +194,9 @@ def _calc_impute(self, dist_pot_donors, n_neighbors, fit_X_col, mask_fit_X_col):
         # fill nans with zeros
         if weight_matrix is not None:
             weight_matrix[np.isnan(weight_matrix)] = 0.0
+        else:
+            weight_matrix = np.ones_like(donors_dist)
+            weight_matrix[np.isnan(donors_dist)] = 0.0
 
         # Retrieve donor values and calculate kNN average
         donors = fit_X_col.take(donors_idx)
@@ -267,6 +269,7 @@ def transform(self, X):
             X,
             accept_sparse=False,
             dtype=FLOAT_DTYPES,
+            force_writeable=True,
             force_all_finite=force_all_finite,
             copy=self.copy,
             reset=False,
diff --git a/sklearn/impute/tests/test_knn.py b/sklearn/impute/tests/test_knn.py
index 141c2ea90dbd9..dc516e04b9402 100644
--- a/sklearn/impute/tests/test_knn.py
+++ b/sklearn/impute/tests/test_knn.py
@@ -239,7 +239,9 @@ def test_knn_imputer_one_n_neighbors(na):
 def test_knn_imputer_all_samples_are_neighbors(na):
     X = np.array([[0, 0], [na, 2], [4, 3], [5, na], [7, 7], [na, 8], [14, 13]])
 
-    X_imputed = np.array([[0, 0], [6, 2], [4, 3], [5, 5.5], [7, 7], [6, 8], [14, 13]])
+    X_imputed = np.array(
+        [[0, 0], [6.25, 2], [4, 3], [5, 5.75], [7, 7], [6.25, 8], [14, 13]]
+    )
 
     n_neighbors = X.shape[0] - 1
     imputer = KNNImputer(n_neighbors=n_neighbors, missing_values=na)
@@ -505,6 +507,27 @@ def test_knn_imputer_not_enough_valid_distances(na, weights):
     assert_allclose(knn.transform(X2), X2_imputed)
 
 
+@pytest.mark.parametrize("na", [-1, np.nan])
+@pytest.mark.parametrize("weights", ["uniform", "distance"])
+def test_knn_imputer_nan_distance(na, weights):
+    # Samples with nan distance should be excluded from the mean computation
+    X1_train = np.array([[1, 1], [na, 2]])
+    X1_test = np.array([[0, na]])
+    X1_test_expected = np.array([[0, 1]])
+
+    knn1 = KNNImputer(n_neighbors=2, missing_values=na, weights=weights)
+    knn1.fit(X1_train)
+    assert_allclose(knn1.transform(X1_test), X1_test_expected)
+
+    X2_train = np.array([[na, 1, 1], [2, na, 2], [3, 3, na]])
+    X2_test = np.array([[na, 0, na], [0, na, na], [na, na, 0]])
+    X2_test_expected = np.array([[3, 0, 1], [0, 3, 2], [2, 1, 0]])
+
+    knn2 = KNNImputer(n_neighbors=2, missing_values=na, weights=weights)
+    knn2.fit(X2_train)
+    assert_allclose(knn2.transform(X2_test), X2_test_expected)
+
+
 @pytest.mark.parametrize("na", [-1, np.nan])
 def test_knn_imputer_drops_all_nan_features(na):
     X1 = np.array([[na, 1], [na, 2]])
diff --git a/sklearn/inspection/__init__.py b/sklearn/inspection/__init__.py
index f254967f96166..312a19d2c9bce 100644
--- a/sklearn/inspection/__init__.py
+++ b/sklearn/inspection/__init__.py
@@ -1,4 +1,4 @@
-"""The :mod:`sklearn.inspection` module includes tools for model inspection."""
+"""Tools for model inspection."""
 
 from ._partial_dependence import partial_dependence
 from ._permutation_importance import permutation_importance
diff --git a/sklearn/inspection/_partial_dependence.py b/sklearn/inspection/_partial_dependence.py
index 8fbfd6fd5c5f7..b74258615a447 100644
--- a/sklearn/inspection/_partial_dependence.py
+++ b/sklearn/inspection/_partial_dependence.py
@@ -1,9 +1,7 @@
 """Partial dependence plots for regression and classification models."""
 
-# Authors: Peter Prettenhofer
-#          Trevor Stephens
-#          Nicolas Hug
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from collections.abc import Iterable
 
@@ -528,14 +526,6 @@ def partial_dependence(
             `method` is 'recursion').
             Only available when `kind='average'` or `kind='both'`.
 
-        values : seq of 1d ndarrays
-            The values with which the grid has been created.
-
-            .. deprecated:: 1.3
-                The key `values` has been deprecated in 1.3 and will be removed
-                in 1.5 in favor of `grid_values`. See `grid_values` for details
-                about the `values` attribute.
-
         grid_values : seq of 1d ndarrays
             The values with which the grid has been created. The generated
             grid is a cartesian product of the arrays in `grid_values` where
@@ -716,15 +706,7 @@ def partial_dependence(
     averaged_predictions = averaged_predictions.reshape(
         -1, *[val.shape[0] for val in values]
     )
-    pdp_results = Bunch()
-
-    msg = (
-        "Key: 'values', is deprecated in 1.3 and will be removed in 1.5. "
-        "Please use 'grid_values' instead."
-    )
-    pdp_results._set_deprecated(
-        values, new_key="grid_values", deprecated_key="values", warning_message=msg
-    )
+    pdp_results = Bunch(grid_values=values)
 
     if kind == "average":
         pdp_results["average"] = averaged_predictions
diff --git a/sklearn/inspection/tests/test_partial_dependence.py b/sklearn/inspection/tests/test_partial_dependence.py
index a98b97fbcbe47..58d71def0252d 100644
--- a/sklearn/inspection/tests/test_partial_dependence.py
+++ b/sklearn/inspection/tests/test_partial_dependence.py
@@ -2,8 +2,6 @@
 Testing for the partial dependence module.
 """
 
-import warnings
-
 import numpy as np
 import pytest
 
@@ -915,34 +913,6 @@ def test_partial_dependence_sample_weight_with_recursion():
         )
 
 
-# TODO(1.5): Remove when bunch values is deprecated in 1.5
-def test_partial_dependence_bunch_values_deprecated():
-    """Test that deprecation warning is raised when values is accessed."""
-
-    est = LogisticRegression()
-    (X, y), _ = binary_classification_data
-    est.fit(X, y)
-
-    pdp_avg = partial_dependence(est, X=X, features=[1, 2], kind="average")
-
-    msg = (
-        "Key: 'values', is deprecated in 1.3 and will be "
-        "removed in 1.5. Please use 'grid_values' instead"
-    )
-
-    with warnings.catch_warnings():
-        # Does not raise warnings with "grid_values"
-        warnings.simplefilter("error", FutureWarning)
-        grid_values = pdp_avg["grid_values"]
-
-    with pytest.warns(FutureWarning, match=msg):
-        # Warns for "values"
-        values = pdp_avg["values"]
-
-    # "values" and "grid_values" are the same object
-    assert values is grid_values
-
-
 def test_mixed_type_categorical():
     """Check that we raise a proper error when a column has mixed types and
     the sorting of `np.unique` will fail."""
diff --git a/sklearn/inspection/tests/test_permutation_importance.py b/sklearn/inspection/tests/test_permutation_importance.py
index 8b3ed78cdd368..478a10515aa01 100644
--- a/sklearn/inspection/tests/test_permutation_importance.py
+++ b/sklearn/inspection/tests/test_permutation_importance.py
@@ -1,5 +1,6 @@
 import numpy as np
 import pytest
+from joblib import parallel_backend
 from numpy.testing import assert_allclose
 
 from sklearn.compose import ColumnTransformer
@@ -22,7 +23,6 @@
 from sklearn.model_selection import train_test_split
 from sklearn.pipeline import make_pipeline
 from sklearn.preprocessing import KBinsDiscretizer, OneHotEncoder, StandardScaler, scale
-from sklearn.utils import parallel_backend
 from sklearn.utils._testing import _convert_container
 
 
diff --git a/sklearn/isotonic.py b/sklearn/isotonic.py
index 04456b1763791..dc23e9c50026c 100644
--- a/sklearn/isotonic.py
+++ b/sklearn/isotonic.py
@@ -1,20 +1,21 @@
-# Authors: Fabian Pedregosa <fabian@fseoane.net>
-#          Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#          Nelle Varoquaux <nelle.varoquaux@gmail.com>
-# License: BSD 3 clause
+"""Isotonic regression for obtaining monotonic fit to data."""
+
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import math
 import warnings
 from numbers import Real
 
 import numpy as np
-from scipy import interpolate
+from scipy import interpolate, optimize
 from scipy.stats import spearmanr
 
 from ._isotonic import _inplace_contiguous_isotonic_regression, _make_unique
 from .base import BaseEstimator, RegressorMixin, TransformerMixin, _fit_context
 from .utils import check_array, check_consistent_length
 from .utils._param_validation import Interval, StrOptions, validate_params
+from .utils.fixes import parse_version, sp_base_version
 from .utils.validation import _check_sample_weight, check_is_fitted
 
 __all__ = ["check_increasing", "isotonic_regression", "IsotonicRegression"]
@@ -151,13 +152,22 @@ def isotonic_regression(
     array([2.75   , 2.75   , 2.75   , 2.75   , 7.33...,
            7.33..., 7.33..., 7.33..., 7.33..., 7.33...])
     """
-    order = np.s_[:] if increasing else np.s_[::-1]
     y = check_array(y, ensure_2d=False, input_name="y", dtype=[np.float64, np.float32])
-    y = np.array(y[order], dtype=y.dtype)
-    sample_weight = _check_sample_weight(sample_weight, y, dtype=y.dtype, copy=True)
-    sample_weight = np.ascontiguousarray(sample_weight[order])
+    if sp_base_version >= parse_version("1.12.0"):
+        res = optimize.isotonic_regression(
+            y=y, weights=sample_weight, increasing=increasing
+        )
+        y = np.asarray(res.x, dtype=y.dtype)
+    else:
+        # TODO: remove this branch when Scipy 1.12 is the minimum supported version
+        # Also remove _inplace_contiguous_isotonic_regression.
+        order = np.s_[:] if increasing else np.s_[::-1]
+        y = np.array(y[order], dtype=y.dtype)
+        sample_weight = _check_sample_weight(sample_weight, y, dtype=y.dtype, copy=True)
+        sample_weight = np.ascontiguousarray(sample_weight[order])
+        _inplace_contiguous_isotonic_regression(y, sample_weight)
+        y = y[order]
 
-    _inplace_contiguous_isotonic_regression(y, sample_weight)
     if y_min is not None or y_max is not None:
         # Older versions of np.clip don't accept None as a bound, so use np.inf
         if y_min is None:
@@ -165,7 +175,7 @@ def isotonic_regression(
         if y_max is None:
             y_max = np.inf
         np.clip(y, y_min, y_max, y)
-    return y[order]
+    return y
 
 
 class IsotonicRegression(RegressorMixin, TransformerMixin, BaseEstimator):
diff --git a/sklearn/kernel_approximation.py b/sklearn/kernel_approximation.py
index bcb1e99520e5b..2c1981295dffa 100644
--- a/sklearn/kernel_approximation.py
+++ b/sklearn/kernel_approximation.py
@@ -1,25 +1,16 @@
-"""
-The :mod:`sklearn.kernel_approximation` module implements several
-approximate kernel feature maps based on Fourier transforms and Count Sketches.
-"""
+"""Approximate kernel feature maps based on Fourier transforms and count sketches."""
 
-# Author: Andreas Mueller <amueller@ais.uni-bonn.de>
-#         Daniel Lopez-Sanchez (TensorSketch) <lope@usal.es>
-
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from numbers import Integral, Real
 
 import numpy as np
 import scipy.sparse as sp
+from scipy.fft import fft, ifft
 from scipy.linalg import svd
 
-try:
-    from scipy.fft import fft, ifft
-except ImportError:  # scipy < 1.4
-    from scipy.fftpack import fft, ifft
-
 from .base import (
     BaseEstimator,
     ClassNamePrefixFeaturesOutMixin,
@@ -27,7 +18,7 @@
     _fit_context,
 )
 from .metrics.pairwise import KERNEL_PARAMS, PAIRWISE_KERNEL_FUNCTIONS, pairwise_kernels
-from .utils import check_random_state, deprecated
+from .utils import check_random_state
 from .utils._param_validation import Interval, StrOptions
 from .utils.extmath import safe_sparse_dot
 from .utils.validation import (
@@ -600,13 +591,6 @@ class AdditiveChi2Sampler(TransformerMixin, BaseEstimator):
 
     Attributes
     ----------
-    sample_interval_ : float
-        Stored sampling interval. Specified as a parameter if `sample_steps`
-        not in {1,2,3}.
-
-        .. deprecated:: 1.3
-           `sample_interval_` serves internal purposes only and will be removed in 1.5.
-
     n_features_in_ : int
         Number of features seen during :term:`fit`.
 
@@ -693,37 +677,14 @@ def fit(self, X, y=None):
         X = self._validate_data(X, accept_sparse="csr")
         check_non_negative(X, "X in AdditiveChi2Sampler.fit")
 
-        # TODO(1.5): remove the setting of _sample_interval from fit
-        if self.sample_interval is None:
-            # See figure 2 c) of "Efficient additive kernels via explicit feature maps"
-            # <http://www.robots.ox.ac.uk/~vedaldi/assets/pubs/vedaldi11efficient.pdf>
-            # A. Vedaldi and A. Zisserman, Pattern Analysis and Machine Intelligence,
-            # 2011
-            if self.sample_steps == 1:
-                self._sample_interval = 0.8
-            elif self.sample_steps == 2:
-                self._sample_interval = 0.5
-            elif self.sample_steps == 3:
-                self._sample_interval = 0.4
-            else:
-                raise ValueError(
-                    "If sample_steps is not in [1, 2, 3],"
-                    " you need to provide sample_interval"
-                )
-        else:
-            self._sample_interval = self.sample_interval
+        if self.sample_interval is None and self.sample_steps not in (1, 2, 3):
+            raise ValueError(
+                "If sample_steps is not in [1, 2, 3],"
+                " you need to provide sample_interval"
+            )
 
         return self
 
-    # TODO(1.5): remove
-    @deprecated(  # type: ignore
-        "The ``sample_interval_`` attribute was deprecated in version 1.3 and "
-        "will be removed 1.5."
-    )
-    @property
-    def sample_interval_(self):
-        return self._sample_interval
-
     def transform(self, X):
         """Apply approximate feature map to X.
 
@@ -744,29 +705,24 @@ def transform(self, X):
         check_non_negative(X, "X in AdditiveChi2Sampler.transform")
         sparse = sp.issparse(X)
 
-        if hasattr(self, "_sample_interval"):
-            # TODO(1.5): remove this branch
-            sample_interval = self._sample_interval
-
-        else:
-            if self.sample_interval is None:
-                # See figure 2 c) of "Efficient additive kernels via explicit feature maps" # noqa
-                # <http://www.robots.ox.ac.uk/~vedaldi/assets/pubs/vedaldi11efficient.pdf>
-                # A. Vedaldi and A. Zisserman, Pattern Analysis and Machine Intelligence, # noqa
-                # 2011
-                if self.sample_steps == 1:
-                    sample_interval = 0.8
-                elif self.sample_steps == 2:
-                    sample_interval = 0.5
-                elif self.sample_steps == 3:
-                    sample_interval = 0.4
-                else:
-                    raise ValueError(
-                        "If sample_steps is not in [1, 2, 3],"
-                        " you need to provide sample_interval"
-                    )
+        if self.sample_interval is None:
+            # See figure 2 c) of "Efficient additive kernels via explicit feature maps" # noqa
+            # <http://www.robots.ox.ac.uk/~vedaldi/assets/pubs/vedaldi11efficient.pdf>
+            # A. Vedaldi and A. Zisserman, Pattern Analysis and Machine Intelligence, # noqa
+            # 2011
+            if self.sample_steps == 1:
+                sample_interval = 0.8
+            elif self.sample_steps == 2:
+                sample_interval = 0.5
+            elif self.sample_steps == 3:
+                sample_interval = 0.4
             else:
-                sample_interval = self.sample_interval
+                raise ValueError(
+                    "If sample_steps is not in [1, 2, 3],"
+                    " you need to provide sample_interval"
+                )
+        else:
+            sample_interval = self.sample_interval
 
         # zeroth component
         # 1/cosh = sech
@@ -968,13 +924,13 @@ class Nystroem(ClassNamePrefixFeaturesOutMixin, TransformerMixin, BaseEstimator)
     >>> from sklearn.kernel_approximation import Nystroem
     >>> X, y = datasets.load_digits(n_class=9, return_X_y=True)
     >>> data = X / 16.
-    >>> clf = svm.LinearSVC(dual="auto")
+    >>> clf = svm.LinearSVC()
     >>> feature_map_nystroem = Nystroem(gamma=.2,
     ...                                 random_state=1,
     ...                                 n_components=300)
     >>> data_transformed = feature_map_nystroem.fit_transform(data)
     >>> clf.fit(data_transformed, y)
-    LinearSVC(dual='auto')
+    LinearSVC()
     >>> clf.score(data_transformed, y)
     0.9987...
     """
diff --git a/sklearn/kernel_ridge.py b/sklearn/kernel_ridge.py
index 23890f3a68cd7..31eade5255e75 100644
--- a/sklearn/kernel_ridge.py
+++ b/sklearn/kernel_ridge.py
@@ -1,8 +1,7 @@
-"""Module :mod:`sklearn.kernel_ridge` implements kernel ridge regression."""
+"""Kernel ridge regression."""
 
-# Authors: Mathieu Blondel <mathieu@mblondel.org>
-#          Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 from numbers import Real
 
 import numpy as np
diff --git a/sklearn/linear_model/__init__.py b/sklearn/linear_model/__init__.py
index 45c99d4d36df1..a2b0ffba0e728 100644
--- a/sklearn/linear_model/__init__.py
+++ b/sklearn/linear_model/__init__.py
@@ -1,6 +1,4 @@
-"""
-The :mod:`sklearn.linear_model` module implements a variety of linear models.
-"""
+"""A variety of linear models."""
 
 # See http://scikit-learn.sourceforge.net/modules/sgd.html and
 # http://scikit-learn.sourceforge.net/modules/linear_model.html for
diff --git a/sklearn/linear_model/_base.py b/sklearn/linear_model/_base.py
index be8c9097332eb..0ca59d97948bc 100644
--- a/sklearn/linear_model/_base.py
+++ b/sklearn/linear_model/_base.py
@@ -2,17 +2,8 @@
 Generalized Linear Models.
 """
 
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-# Fabian Pedregosa <fabian.pedregosa@inria.fr>
-# Olivier Grisel <olivier.grisel@ensta.org>
-#         Vincent Michel <vincent.michel@inria.fr>
-#         Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#         Mathieu Blondel <mathieu@mblondel.org>
-#         Lars Buitinck
-#         Maryan Morel <maryan.morel@polytechnique.edu>
-#         Giorgio Patrini <giorgio.patrini@anu.edu.au>
-#         Maria Telenczuk <https://github.com/maikia>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numbers
 import warnings
@@ -33,7 +24,14 @@
     _fit_context,
 )
 from ..utils import check_array, check_random_state
-from ..utils._array_api import get_namespace, indexing_dtype
+from ..utils._array_api import (
+    _asarray_with_order,
+    _average,
+    get_namespace,
+    get_namespace_and_device,
+    indexing_dtype,
+    supported_float_dtypes,
+)
 from ..utils._seq_dataset import (
     ArrayDataset32,
     ArrayDataset64,
@@ -43,7 +41,7 @@
 from ..utils.extmath import safe_sparse_dot
 from ..utils.parallel import Parallel, delayed
 from ..utils.sparsefuncs import mean_variance_axis
-from ..utils.validation import FLOAT_DTYPES, _check_sample_weight, check_is_fitted
+from ..utils.validation import _check_sample_weight, check_is_fitted
 
 # TODO: bayesian_ridge_regression and bayesian_regression_ard
 # should be squashed into its respective objects.
@@ -155,43 +153,51 @@ def _preprocess_data(
         Always an array of ones. TODO: refactor the code base to make it
         possible to remove this unused variable.
     """
+    xp, _, device_ = get_namespace_and_device(X, y, sample_weight)
+    n_samples, n_features = X.shape
+    X_is_sparse = sp.issparse(X)
+
     if isinstance(sample_weight, numbers.Number):
         sample_weight = None
     if sample_weight is not None:
-        sample_weight = np.asarray(sample_weight)
+        sample_weight = xp.asarray(sample_weight)
 
     if check_input:
-        X = check_array(X, copy=copy, accept_sparse=["csr", "csc"], dtype=FLOAT_DTYPES)
+        X = check_array(
+            X, copy=copy, accept_sparse=["csr", "csc"], dtype=supported_float_dtypes(xp)
+        )
         y = check_array(y, dtype=X.dtype, copy=copy_y, ensure_2d=False)
     else:
-        y = y.astype(X.dtype, copy=copy_y)
+        y = xp.astype(y, X.dtype, copy=copy_y)
         if copy:
-            if sp.issparse(X):
+            if X_is_sparse:
                 X = X.copy()
             else:
-                X = X.copy(order="K")
+                X = _asarray_with_order(X, order="K", copy=True, xp=xp)
+
+    dtype_ = X.dtype
 
     if fit_intercept:
-        if sp.issparse(X):
+        if X_is_sparse:
             X_offset, X_var = mean_variance_axis(X, axis=0, weights=sample_weight)
         else:
-            X_offset = np.average(X, axis=0, weights=sample_weight)
+            X_offset = _average(X, axis=0, weights=sample_weight, xp=xp)
 
-            X_offset = X_offset.astype(X.dtype, copy=False)
+            X_offset = xp.astype(X_offset, X.dtype, copy=False)
             X -= X_offset
 
-        y_offset = np.average(y, axis=0, weights=sample_weight)
+        y_offset = _average(y, axis=0, weights=sample_weight, xp=xp)
         y -= y_offset
     else:
-        X_offset = np.zeros(X.shape[1], dtype=X.dtype)
+        X_offset = xp.zeros(n_features, dtype=X.dtype, device=device_)
         if y.ndim == 1:
-            y_offset = X.dtype.type(0)
+            y_offset = xp.asarray(0.0, dtype=dtype_, device=device_)
         else:
-            y_offset = np.zeros(y.shape[1], dtype=X.dtype)
+            y_offset = xp.zeros(y.shape[1], dtype=dtype_, device=device_)
 
     # XXX: X_scale is no longer needed. It is an historic artifact from the
     # time where linear model exposed the normalize parameter.
-    X_scale = np.ones(X.shape[1], dtype=X.dtype)
+    X_scale = xp.ones(n_features, dtype=X.dtype, device=device_)
     return X, y, X_offset, y_offset, X_scale
 
 
@@ -224,8 +230,9 @@ def _rescale_data(X, y, sample_weight, inplace=False):
     """
     # Assume that _validate_data and _check_sample_weight have been called by
     # the caller.
+    xp, _ = get_namespace(X, y, sample_weight)
     n_samples = X.shape[0]
-    sample_weight_sqrt = np.sqrt(sample_weight)
+    sample_weight_sqrt = xp.sqrt(sample_weight)
 
     if sp.issparse(X) or sp.issparse(y):
         sw_matrix = sparse.dia_matrix(
@@ -236,9 +243,9 @@ def _rescale_data(X, y, sample_weight, inplace=False):
         X = safe_sparse_dot(sw_matrix, X)
     else:
         if inplace:
-            X *= sample_weight_sqrt[:, np.newaxis]
+            X *= sample_weight_sqrt[:, None]
         else:
-            X = X * sample_weight_sqrt[:, np.newaxis]
+            X = X * sample_weight_sqrt[:, None]
 
     if sp.issparse(y):
         y = safe_sparse_dot(sw_matrix, y)
@@ -247,12 +254,12 @@ def _rescale_data(X, y, sample_weight, inplace=False):
             if y.ndim == 1:
                 y *= sample_weight_sqrt
             else:
-                y *= sample_weight_sqrt[:, np.newaxis]
+                y *= sample_weight_sqrt[:, None]
         else:
             if y.ndim == 1:
                 y = y * sample_weight_sqrt
             else:
-                y = y * sample_weight_sqrt[:, np.newaxis]
+                y = y * sample_weight_sqrt[:, None]
     return X, y, sample_weight_sqrt
 
 
@@ -267,7 +274,11 @@ def _decision_function(self, X):
         check_is_fitted(self)
 
         X = self._validate_data(X, accept_sparse=["csr", "csc", "coo"], reset=False)
-        return safe_sparse_dot(X, self.coef_.T, dense_output=True) + self.intercept_
+        coef_ = self.coef_
+        if coef_.ndim == 1:
+            return X @ coef_ + self.intercept_
+        else:
+            return X @ coef_.T + self.intercept_
 
     def predict(self, X):
         """
@@ -287,11 +298,22 @@ def predict(self, X):
 
     def _set_intercept(self, X_offset, y_offset, X_scale):
         """Set the intercept_"""
+
+        xp, _ = get_namespace(X_offset, y_offset, X_scale)
+
         if self.fit_intercept:
             # We always want coef_.dtype=X.dtype. For instance, X.dtype can differ from
             # coef_.dtype if warm_start=True.
-            self.coef_ = np.divide(self.coef_, X_scale, dtype=X_scale.dtype)
-            self.intercept_ = y_offset - np.dot(X_offset, self.coef_.T)
+            coef_ = xp.astype(self.coef_, X_scale.dtype, copy=False)
+            coef_ = self.coef_ = xp.divide(coef_, X_scale)
+
+            if coef_.ndim == 1:
+                intercept_ = y_offset - X_offset @ coef_
+            else:
+                intercept_ = y_offset - X_offset @ coef_.T
+
+            self.intercept_ = intercept_
+
         else:
             self.intercept_ = 0.0
 
@@ -576,7 +598,12 @@ def fit(self, X, y, sample_weight=None):
         accept_sparse = False if self.positive else ["csr", "csc", "coo"]
 
         X, y = self._validate_data(
-            X, y, accept_sparse=accept_sparse, y_numeric=True, multi_output=True
+            X,
+            y,
+            accept_sparse=accept_sparse,
+            y_numeric=True,
+            multi_output=True,
+            force_writeable=True,
         )
 
         has_sw = sample_weight is not None
diff --git a/sklearn/linear_model/_bayes.py b/sklearn/linear_model/_bayes.py
index 5ea9c7a0fa66a..dfdcdf23599c9 100644
--- a/sklearn/linear_model/_bayes.py
+++ b/sklearn/linear_model/_bayes.py
@@ -2,10 +2,9 @@
 Various bayesian regression
 """
 
-# Authors: V. Michel, F. Pedregosa, A. Gramfort
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
-import warnings
 from math import log
 from numbers import Integral, Real
 
@@ -15,55 +14,11 @@
 
 from ..base import RegressorMixin, _fit_context
 from ..utils import _safe_indexing
-from ..utils._param_validation import Hidden, Interval, StrOptions
+from ..utils._param_validation import Interval
 from ..utils.extmath import fast_logdet
 from ..utils.validation import _check_sample_weight
 from ._base import LinearModel, _preprocess_data, _rescale_data
 
-
-# TODO(1.5) Remove
-def _deprecate_n_iter(n_iter, max_iter):
-    """Deprecates n_iter in favour of max_iter. Checks if the n_iter has been
-    used instead of max_iter and generates a deprecation warning if True.
-
-    Parameters
-    ----------
-    n_iter : int,
-        Value of n_iter attribute passed by the estimator.
-
-    max_iter : int, default=None
-        Value of max_iter attribute passed by the estimator.
-        If `None`, it corresponds to `max_iter=300`.
-
-    Returns
-    -------
-    max_iter : int,
-        Value of max_iter which shall further be used by the estimator.
-
-    Notes
-    -----
-    This function should be completely removed in 1.5.
-    """
-    if n_iter != "deprecated":
-        if max_iter is not None:
-            raise ValueError(
-                "Both `n_iter` and `max_iter` attributes were set. Attribute"
-                " `n_iter` was deprecated in version 1.3 and will be removed in"
-                " 1.5. To avoid this error, only set the `max_iter` attribute."
-            )
-        warnings.warn(
-            (
-                "'n_iter' was renamed to 'max_iter' in version 1.3 and "
-                "will be removed in 1.5"
-            ),
-            FutureWarning,
-        )
-        max_iter = n_iter
-    elif max_iter is None:
-        max_iter = 300
-    return max_iter
-
-
 ###############################################################################
 # BayesianRidge regression
 
@@ -76,6 +31,9 @@ class BayesianRidge(RegressorMixin, LinearModel):
     lambda (precision of the weights) and alpha (precision of the noise).
 
     Read more in the :ref:`User Guide <bayesian_regression>`.
+    For an intuitive visualization of how the sinusoid is approximated by
+    a polynomial using different pairs of initial values, see
+    :ref:`sphx_glr_auto_examples_linear_model_plot_bayesian_ridge_curvefit.py`.
 
     Parameters
     ----------
@@ -133,13 +91,6 @@ class BayesianRidge(RegressorMixin, LinearModel):
     verbose : bool, default=False
         Verbose mode when fitting the model.
 
-    n_iter : int
-        Maximum number of iterations. Should be greater than or equal to 1.
-
-        .. deprecated:: 1.3
-           `n_iter` is deprecated in 1.3 and will be removed in 1.5. Use
-           `max_iter` instead.
-
     Attributes
     ----------
     coef_ : array-like of shape (n_features,)
@@ -219,7 +170,7 @@ class BayesianRidge(RegressorMixin, LinearModel):
     """
 
     _parameter_constraints: dict = {
-        "max_iter": [Interval(Integral, 1, None, closed="left"), None],
+        "max_iter": [Interval(Integral, 1, None, closed="left")],
         "tol": [Interval(Real, 0, None, closed="neither")],
         "alpha_1": [Interval(Real, 0, None, closed="left")],
         "alpha_2": [Interval(Real, 0, None, closed="left")],
@@ -231,16 +182,12 @@ class BayesianRidge(RegressorMixin, LinearModel):
         "fit_intercept": ["boolean"],
         "copy_X": ["boolean"],
         "verbose": ["verbose"],
-        "n_iter": [
-            Interval(Integral, 1, None, closed="left"),
-            Hidden(StrOptions({"deprecated"})),
-        ],
     }
 
     def __init__(
         self,
         *,
-        max_iter=None,  # TODO(1.5): Set to 300
+        max_iter=300,
         tol=1.0e-3,
         alpha_1=1.0e-6,
         alpha_2=1.0e-6,
@@ -252,7 +199,6 @@ def __init__(
         fit_intercept=True,
         copy_X=True,
         verbose=False,
-        n_iter="deprecated",  # TODO(1.5): Remove
     ):
         self.max_iter = max_iter
         self.tol = tol
@@ -266,7 +212,6 @@ def __init__(
         self.fit_intercept = fit_intercept
         self.copy_X = copy_X
         self.verbose = verbose
-        self.n_iter = n_iter
 
     @_fit_context(prefer_skip_nested_validation=True)
     def fit(self, X, y, sample_weight=None):
@@ -290,9 +235,9 @@ def fit(self, X, y, sample_weight=None):
         self : object
             Returns the instance itself.
         """
-        max_iter = _deprecate_n_iter(self.n_iter, self.max_iter)
-
-        X, y = self._validate_data(X, y, dtype=[np.float64, np.float32], y_numeric=True)
+        X, y = self._validate_data(
+            X, y, dtype=[np.float64, np.float32], force_writeable=True, y_numeric=True
+        )
         dtype = X.dtype
 
         if sample_weight is not None:
@@ -343,7 +288,7 @@ def fit(self, X, y, sample_weight=None):
         eigen_vals_ = S**2
 
         # Convergence loop of the bayesian ridge regression
-        for iter_ in range(max_iter):
+        for iter_ in range(self.max_iter):
             # update posterior mean coef_ based on alpha_ and lambda_ and
             # compute corresponding rmse
             coef_, rmse_ = self._update_coef_(
@@ -540,13 +485,6 @@ class ARDRegression(RegressorMixin, LinearModel):
     verbose : bool, default=False
         Verbose mode when fitting the model.
 
-    n_iter : int
-        Maximum number of iterations.
-
-        .. deprecated:: 1.3
-           `n_iter` is deprecated in 1.3 and will be removed in 1.5. Use
-           `max_iter` instead.
-
     Attributes
     ----------
     coef_ : array-like of shape (n_features,)
@@ -624,7 +562,7 @@ class ARDRegression(RegressorMixin, LinearModel):
     """
 
     _parameter_constraints: dict = {
-        "max_iter": [Interval(Integral, 1, None, closed="left"), None],
+        "max_iter": [Interval(Integral, 1, None, closed="left")],
         "tol": [Interval(Real, 0, None, closed="left")],
         "alpha_1": [Interval(Real, 0, None, closed="left")],
         "alpha_2": [Interval(Real, 0, None, closed="left")],
@@ -635,16 +573,12 @@ class ARDRegression(RegressorMixin, LinearModel):
         "fit_intercept": ["boolean"],
         "copy_X": ["boolean"],
         "verbose": ["verbose"],
-        "n_iter": [
-            Interval(Integral, 1, None, closed="left"),
-            Hidden(StrOptions({"deprecated"})),
-        ],
     }
 
     def __init__(
         self,
         *,
-        max_iter=None,  # TODO(1.5): Set to 300
+        max_iter=300,
         tol=1.0e-3,
         alpha_1=1.0e-6,
         alpha_2=1.0e-6,
@@ -655,7 +589,6 @@ def __init__(
         fit_intercept=True,
         copy_X=True,
         verbose=False,
-        n_iter="deprecated",  # TODO(1.5): Remove
     ):
         self.max_iter = max_iter
         self.tol = tol
@@ -668,7 +601,6 @@ def __init__(
         self.threshold_lambda = threshold_lambda
         self.copy_X = copy_X
         self.verbose = verbose
-        self.n_iter = n_iter
 
     @_fit_context(prefer_skip_nested_validation=True)
     def fit(self, X, y):
@@ -689,10 +621,13 @@ def fit(self, X, y):
         self : object
             Fitted estimator.
         """
-        max_iter = _deprecate_n_iter(self.n_iter, self.max_iter)
-
         X, y = self._validate_data(
-            X, y, dtype=[np.float64, np.float32], y_numeric=True, ensure_min_samples=2
+            X,
+            y,
+            dtype=[np.float64, np.float32],
+            force_writeable=True,
+            y_numeric=True,
+            ensure_min_samples=2,
         )
         dtype = X.dtype
 
@@ -738,7 +673,7 @@ def update_coeff(X, y, coef_, alpha_, keep_lambda, sigma_):
             else self._update_sigma_woodbury
         )
         # Iterative procedure of ARDRegression
-        for iter_ in range(max_iter):
+        for iter_ in range(self.max_iter):
             sigma_ = update_sigma(X, alpha_, lambda_, keep_lambda)
             coef_ = update_coeff(X, y, coef_, alpha_, keep_lambda, sigma_)
 
diff --git a/sklearn/linear_model/_cd_fast.pyx b/sklearn/linear_model/_cd_fast.pyx
index 66656a7c1a5b7..c4c530d907e26 100644
--- a/sklearn/linear_model/_cd_fast.pyx
+++ b/sklearn/linear_model/_cd_fast.pyx
@@ -1,10 +1,5 @@
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#         Fabian Pedregosa <fabian.pedregosa@inria.fr>
-#         Olivier Grisel <olivier.grisel@ensta.org>
-#         Alexis Mignon <alexis.mignon@gmail.com>
-#         Manoj Kumar <manojkumarsivaraj334@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from libc.math cimport fabs
 import numpy as np
@@ -749,7 +744,7 @@ def enet_coordinate_descent_multi_task(
     bint random=0
 ):
     """Cython version of the coordinate descent algorithm
-        for Elastic-Net mult-task regression
+        for Elastic-Net multi-task regression
 
         We minimize
 
@@ -947,7 +942,7 @@ def enet_coordinate_descent_multi_task(
                     + 0.5 * l2_reg * (1 + const ** 2) * (w_norm ** 2)
                 )
 
-                if gap < tol:
+                if gap <= tol:
                     # return if we reached desired tolerance
                     break
         else:
diff --git a/sklearn/linear_model/_coordinate_descent.py b/sklearn/linear_model/_coordinate_descent.py
index 05d7b93f3e090..c23527de9e07b 100644
--- a/sklearn/linear_model/_coordinate_descent.py
+++ b/sklearn/linear_model/_coordinate_descent.py
@@ -1,9 +1,5 @@
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#         Fabian Pedregosa <fabian.pedregosa@inria.fr>
-#         Olivier Grisel <olivier.grisel@ensta.org>
-#         Gael Varoquaux <gael.varoquaux@inria.fr>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numbers
 import sys
@@ -776,6 +772,9 @@ class ElasticNet(MultiOutputMixin, RegressorMixin, LinearModel):
         Whether to use a precomputed Gram matrix to speed up
         calculations. The Gram matrix can also be passed as argument.
         For sparse input this option is always ``False`` to preserve sparsity.
+        Check :ref:`an example on how to use a precomputed Gram Matrix in ElasticNet
+        <sphx_glr_auto_examples_linear_model_plot_elastic_net_precomputed_gram_matrix_with_weighted_samples.py>`
+        for details.
 
     max_iter : int, default=1000
         The maximum number of iterations.
@@ -980,6 +979,7 @@ def fit(self, X, y, sample_weight=None, check_input=True):
                 accept_sparse="csc",
                 order="F",
                 dtype=[np.float64, np.float32],
+                force_writeable=True,
                 accept_large_sparse=False,
                 copy=X_copied,
                 multi_output=True,
@@ -1608,6 +1608,7 @@ def fit(self, X, y, sample_weight=None, **params):
             check_X_params = dict(
                 accept_sparse="csc",
                 dtype=[np.float64, np.float32],
+                force_writeable=True,
                 copy=False,
                 accept_large_sparse=False,
             )
@@ -1633,6 +1634,7 @@ def fit(self, X, y, sample_weight=None, **params):
                 accept_sparse="csc",
                 dtype=[np.float64, np.float32],
                 order="F",
+                force_writeable=True,
                 copy=copy_X,
             )
             X, y = self._validate_data(
@@ -1860,7 +1862,7 @@ def get_metadata_routing(self):
             .add_self_request(self)
             .add(
                 splitter=check_cv(self.cv),
-                method_mapping=MethodMapping().add(callee="split", caller="fit"),
+                method_mapping=MethodMapping().add(caller="fit", callee="split"),
             )
         )
         return router
@@ -2509,6 +2511,7 @@ def fit(self, X, y):
         check_X_params = dict(
             dtype=[np.float64, np.float32],
             order="F",
+            force_writeable=True,
             copy=self.copy_X and self.fit_intercept,
         )
         check_y_params = dict(ensure_2d=False, order="F")
diff --git a/sklearn/linear_model/_glm/__init__.py b/sklearn/linear_model/_glm/__init__.py
index 1b82bbd77bcf9..199b938b023d0 100644
--- a/sklearn/linear_model/_glm/__init__.py
+++ b/sklearn/linear_model/_glm/__init__.py
@@ -1,5 +1,5 @@
-# License: BSD 3 clause
-
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 from .glm import (
     GammaRegressor,
     PoissonRegressor,
diff --git a/sklearn/linear_model/_glm/_newton_solver.py b/sklearn/linear_model/_glm/_newton_solver.py
index 0b6adbe44e686..b2be604d931c5 100644
--- a/sklearn/linear_model/_glm/_newton_solver.py
+++ b/sklearn/linear_model/_glm/_newton_solver.py
@@ -1,10 +1,9 @@
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 """
 Newton solver for Generalized Linear Models
 """
 
-# Author: Christian Lorentzen <lorentzen.ch@gmail.com>
-# License: BSD 3 clause
-
 import warnings
 from abc import ABC, abstractmethod
 
@@ -230,7 +229,7 @@ def line_search(self, X, y, sample_weight):
         is_verbose = self.verbose >= 2
         if is_verbose:
             print("  Backtracking Line Search")
-            print(f"    eps=10 * finfo.eps={eps}")
+            print(f"    eps=16 * finfo.eps={eps}")
 
         for i in range(21):  # until and including t = beta**20 ~ 1e-6
             self.coef = self.coef_old + t * self.coef_newton
diff --git a/sklearn/linear_model/_glm/glm.py b/sklearn/linear_model/_glm/glm.py
index 4cac889a4da51..14caa4fd733c2 100644
--- a/sklearn/linear_model/_glm/glm.py
+++ b/sklearn/linear_model/_glm/glm.py
@@ -1,11 +1,9 @@
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 """
 Generalized Linear Models with Exponential Dispersion Family
 """
 
-# Author: Christian Lorentzen <lorentzen.ch@gmail.com>
-# some parts and tricks stolen from other sklearn files.
-# License: BSD 3 clause
-
 from numbers import Integral, Real
 
 import numpy as np
diff --git a/sklearn/linear_model/_glm/tests/__init__.py b/sklearn/linear_model/_glm/tests/__init__.py
index 588cf7e93eef0..67dd18fb94b59 100644
--- a/sklearn/linear_model/_glm/tests/__init__.py
+++ b/sklearn/linear_model/_glm/tests/__init__.py
@@ -1 +1,2 @@
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
diff --git a/sklearn/linear_model/_glm/tests/test_glm.py b/sklearn/linear_model/_glm/tests/test_glm.py
index 26f6bdc08d254..7f6ec64c15ad4 100644
--- a/sklearn/linear_model/_glm/tests/test_glm.py
+++ b/sklearn/linear_model/_glm/tests/test_glm.py
@@ -1,7 +1,5 @@
-# Authors: Christian Lorentzen <lorentzen.ch@gmail.com>
-#
-# License: BSD 3 clause
-
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import itertools
 import warnings
 from functools import partial
diff --git a/sklearn/linear_model/_huber.py b/sklearn/linear_model/_huber.py
index 4c60a2de8cb86..c21ae177f1190 100644
--- a/sklearn/linear_model/_huber.py
+++ b/sklearn/linear_model/_huber.py
@@ -1,5 +1,5 @@
-# Authors: Manoj Kumar mks542@nyu.edu
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from numbers import Integral, Real
 
diff --git a/sklearn/linear_model/_least_angle.py b/sklearn/linear_model/_least_angle.py
index f29bcb4c8915c..378010c7cdb58 100644
--- a/sklearn/linear_model/_least_angle.py
+++ b/sklearn/linear_model/_least_angle.py
@@ -3,11 +3,8 @@
 Generalized Linear Model for a complete discussion.
 """
 
-# Author: Fabian Pedregosa <fabian.pedregosa@inria.fr>
-#         Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#         Gael Varoquaux
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import sys
 import warnings
@@ -79,14 +76,14 @@ def lars_path(
     return_n_iter=False,
     positive=False,
 ):
-    """Compute Least Angle Regression or Lasso path using the LARS algorithm [1].
+    """Compute Least Angle Regression or Lasso path using the LARS algorithm.
 
     The optimization objective for the case method='lasso' is::
 
     (1 / (2 * n_samples)) * ||y - Xw||^2_2 + alpha * ||w||_1
 
     in the case of method='lar', the objective function is only known in
-    the form of an implicit equation (see discussion in [1]).
+    the form of an implicit equation (see discussion in [1]_).
 
     Read more in the :ref:`User Guide <least_angle_regression>`.
 
@@ -268,14 +265,14 @@ def lars_path_gram(
     return_n_iter=False,
     positive=False,
 ):
-    """The lars_path in the sufficient stats mode [1].
+    """The lars_path in the sufficient stats mode.
 
     The optimization objective for the case method='lasso' is::
 
     (1 / (2 * n_samples)) * ||y - Xw||^2_2 + alpha * ||w||_1
 
     in the case of method='lar', the objective function is only known in
-    the form of an implicit equation (see discussion in [1])
+    the form of an implicit equation (see discussion in [1]_).
 
     Read more in the :ref:`User Guide <least_angle_regression>`.
 
@@ -1180,7 +1177,9 @@ def fit(self, X, y, Xy=None):
         self : object
             Returns an instance of self.
         """
-        X, y = self._validate_data(X, y, y_numeric=True, multi_output=True)
+        X, y = self._validate_data(
+            X, y, force_writeable=True, y_numeric=True, multi_output=True
+        )
 
         alpha = getattr(self, "alpha", 0.0)
         if hasattr(self, "n_nonzero_coefs"):
@@ -1721,7 +1720,7 @@ def fit(self, X, y, **params):
         """
         _raise_for_params(params, self, "fit")
 
-        X, y = self._validate_data(X, y, y_numeric=True)
+        X, y = self._validate_data(X, y, force_writeable=True, y_numeric=True)
         X = as_float_array(X, copy=self.copy_X)
         y = as_float_array(y, copy=self.copy_X)
 
@@ -1821,7 +1820,7 @@ def get_metadata_routing(self):
         """
         router = MetadataRouter(owner=self.__class__.__name__).add(
             splitter=check_cv(self.cv),
-            method_mapping=MethodMapping().add(callee="split", caller="fit"),
+            method_mapping=MethodMapping().add(caller="fit", callee="split"),
         )
         return router
 
@@ -2238,7 +2237,7 @@ def fit(self, X, y, copy_X=None):
         """
         if copy_X is None:
             copy_X = self.copy_X
-        X, y = self._validate_data(X, y, y_numeric=True)
+        X, y = self._validate_data(X, y, force_writeable=True, y_numeric=True)
 
         X, y, Xmean, ymean, Xstd = _preprocess_data(
             X, y, fit_intercept=self.fit_intercept, copy=copy_X
diff --git a/sklearn/linear_model/_logistic.py b/sklearn/linear_model/_logistic.py
index a8ecc29715886..23daa86f2146d 100644
--- a/sklearn/linear_model/_logistic.py
+++ b/sklearn/linear_model/_logistic.py
@@ -33,7 +33,7 @@
     check_random_state,
     compute_class_weight,
 )
-from ..utils._param_validation import Interval, StrOptions
+from ..utils._param_validation import Hidden, Interval, StrOptions
 from ..utils.extmath import row_norms, softmax
 from ..utils.metadata_routing import (
     MetadataRouter,
@@ -477,7 +477,14 @@ def _logistic_regression_path(
             l2_reg_strength = 1.0 / (C * sw_sum)
             args = (X, target, sample_weight, l2_reg_strength, n_threads)
             w0, n_iter_i = _newton_cg(
-                hess, func, grad, w0, args=args, maxiter=max_iter, tol=tol
+                grad_hess=hess,
+                func=func,
+                grad=grad,
+                x0=w0,
+                args=args,
+                maxiter=max_iter,
+                tol=tol,
+                verbose=verbose,
             )
         elif solver == "newton-cholesky":
             l2_reg_strength = 1.0 / (C * sw_sum)
@@ -629,7 +636,7 @@ def _log_reg_scoring_path(
         values are chosen in a logarithmic scale between 1e-4 and 1e4.
 
     scoring : callable
-        A string (see model evaluation documentation) or
+        A string (see :ref:`scoring_parameter`) or
         a scorer callable object / function with signature
         ``scorer(estimator, X, y)``. For a list of scoring functions
         that can be used, look at :mod:`sklearn.metrics`.
@@ -898,28 +905,33 @@ class LogisticRegression(LinearClassifierMixin, SparseCoefMixin, BaseEstimator):
         Algorithm to use in the optimization problem. Default is 'lbfgs'.
         To choose a solver, you might want to consider the following aspects:
 
-            - For small datasets, 'liblinear' is a good choice, whereas 'sag'
-              and 'saga' are faster for large ones;
-            - For multiclass problems, only 'newton-cg', 'sag', 'saga' and
-              'lbfgs' handle multinomial loss;
-            - 'liblinear' is limited to one-versus-rest schemes.
-            - 'newton-cholesky' is a good choice for `n_samples` >> `n_features`,
-              especially with one-hot encoded categorical features with rare
-              categories. Note that it is limited to binary classification and the
-              one-versus-rest reduction for multiclass classification. Be aware that
-              the memory usage of this solver has a quadratic dependency on
-              `n_features` because it explicitly computes the Hessian matrix.
+        - For small datasets, 'liblinear' is a good choice, whereas 'sag'
+          and 'saga' are faster for large ones;
+        - For multiclass problems, only 'newton-cg', 'sag', 'saga' and
+          'lbfgs' handle multinomial loss;
+        - 'liblinear' and 'newton-cholesky' can only handle binary classification
+          by default. To apply a one-versus-rest scheme for the multiclass setting
+          one can wrapt it with the `OneVsRestClassifier`.
+        - 'newton-cholesky' is a good choice for `n_samples` >> `n_features`,
+          especially with one-hot encoded categorical features with rare
+          categories. Be aware that the memory usage of this solver has a quadratic
+          dependency on `n_features` because it explicitly computes the Hessian
+          matrix.
 
         .. warning::
-           The choice of the algorithm depends on the penalty chosen.
-           Supported penalties by solver:
-
-           - 'lbfgs'           -   ['l2', None]
-           - 'liblinear'       -   ['l1', 'l2']
-           - 'newton-cg'       -   ['l2', None]
-           - 'newton-cholesky' -   ['l2', None]
-           - 'sag'             -   ['l2', None]
-           - 'saga'            -   ['elasticnet', 'l1', 'l2', None]
+           The choice of the algorithm depends on the penalty chosen and on
+           (multinomial) multiclass support:
+
+           ================= ============================== ======================
+           solver            penalty                        multinomial multiclass
+           ================= ============================== ======================
+           'lbfgs'           'l2', None                     yes
+           'liblinear'       'l1', 'l2'                     no
+           'newton-cg'       'l2', None                     yes
+           'newton-cholesky' 'l2', None                     no
+           'sag'             'l2', None                     yes
+           'saga'            'elasticnet', 'l1', 'l2', None yes
+           ================= ============================== ======================
 
         .. note::
            'sag' and 'saga' fast convergence is only guaranteed on features
@@ -956,6 +968,13 @@ class LogisticRegression(LinearClassifierMixin, SparseCoefMixin, BaseEstimator):
            Stochastic Average Gradient descent solver for 'multinomial' case.
         .. versionchanged:: 0.22
             Default changed from 'ovr' to 'auto' in 0.22.
+        .. deprecated:: 1.5
+           ``multi_class`` was deprecated in version 1.5 and will be removed in 1.7.
+           From then on, the recommended 'multinomial' will always be used for
+           `n_classes >= 3`.
+           Solvers that do not support 'multinomial' will raise an error.
+           Use `sklearn.multiclass.OneVsRestClassifier(LogisticRegression())` if you
+           still want to use OvR.
 
     verbose : int, default=0
         For the liblinear and lbfgs solvers set verbose to any positive
@@ -1097,11 +1116,14 @@ class LogisticRegression(LinearClassifierMixin, SparseCoefMixin, BaseEstimator):
             )
         ],
         "max_iter": [Interval(Integral, 0, None, closed="left")],
-        "multi_class": [StrOptions({"auto", "ovr", "multinomial"})],
         "verbose": ["verbose"],
         "warm_start": ["boolean"],
         "n_jobs": [None, Integral],
         "l1_ratio": [Interval(Real, 0, 1, closed="both"), None],
+        "multi_class": [
+            StrOptions({"auto", "ovr", "multinomial"}),
+            Hidden(StrOptions({"deprecated"})),
+        ],
     }
 
     def __init__(
@@ -1117,7 +1139,7 @@ def __init__(
         random_state=None,
         solver="lbfgs",
         max_iter=100,
-        multi_class="auto",
+        multi_class="deprecated",
         verbose=0,
         warm_start=False,
         n_jobs=None,
@@ -1209,7 +1231,40 @@ def fit(self, X, y, sample_weight=None):
         check_classification_targets(y)
         self.classes_ = np.unique(y)
 
-        multi_class = _check_multi_class(self.multi_class, solver, len(self.classes_))
+        # TODO(1.7) remove multi_class
+        multi_class = self.multi_class
+        if self.multi_class == "multinomial" and len(self.classes_) == 2:
+            warnings.warn(
+                (
+                    "'multi_class' was deprecated in version 1.5 and will be removed in"
+                    " 1.7. From then on, binary problems will be fit as proper binary "
+                    " logistic regression models (as if multi_class='ovr' were set)."
+                    " Leave it to its default value to avoid this warning."
+                ),
+                FutureWarning,
+            )
+        elif self.multi_class in ("multinomial", "auto"):
+            warnings.warn(
+                (
+                    "'multi_class' was deprecated in version 1.5 and will be removed in"
+                    " 1.7. From then on, it will always use 'multinomial'."
+                    " Leave it to its default value to avoid this warning."
+                ),
+                FutureWarning,
+            )
+        elif self.multi_class == "ovr":
+            warnings.warn(
+                (
+                    "'multi_class' was deprecated in version 1.5 and will be removed in"
+                    " 1.7. Use OneVsRestClassifier(LogisticRegression(..)) instead."
+                    " Leave it to its default value to avoid this warning."
+                ),
+                FutureWarning,
+            )
+        else:
+            # Set to old default value.
+            multi_class = "auto"
+        multi_class = _check_multi_class(multi_class, solver, len(self.classes_))
 
         if solver == "liblinear":
             if effective_n_jobs(self.n_jobs) != 1:
@@ -1348,7 +1403,7 @@ def predict_proba(self, X):
         the softmax function is used to find the predicted probability of
         each class.
         Else use a one-vs-rest approach, i.e. calculate the probability
-        of each class assuming it to be positive using the logistic function.
+        of each class assuming it to be positive using the logistic function
         and normalize these values across all the classes.
 
         Parameters
@@ -1366,7 +1421,7 @@ def predict_proba(self, X):
         check_is_fitted(self)
 
         ovr = self.multi_class in ["ovr", "warn"] or (
-            self.multi_class == "auto"
+            self.multi_class in ["auto", "deprecated"]
             and (
                 self.classes_.size <= 2
                 or self.solver in ("liblinear", "newton-cholesky")
@@ -1466,7 +1521,7 @@ class LogisticRegressionCV(LogisticRegression, LinearClassifierMixin, BaseEstima
            solver.
 
     scoring : str or callable, default=None
-        A string (see model evaluation documentation) or
+        A string (see :ref:`scoring_parameter`) or
         a scorer callable object / function with signature
         ``scorer(estimator, X, y)``. For a list of scoring functions
         that can be used, look at :mod:`sklearn.metrics`. The
@@ -1478,30 +1533,35 @@ class LogisticRegressionCV(LogisticRegression, LinearClassifierMixin, BaseEstima
         Algorithm to use in the optimization problem. Default is 'lbfgs'.
         To choose a solver, you might want to consider the following aspects:
 
-            - For small datasets, 'liblinear' is a good choice, whereas 'sag'
-              and 'saga' are faster for large ones;
-            - For multiclass problems, only 'newton-cg', 'sag', 'saga' and
-              'lbfgs' handle multinomial loss;
-            - 'liblinear' might be slower in :class:`LogisticRegressionCV`
-              because it does not handle warm-starting. 'liblinear' is
-              limited to one-versus-rest schemes.
-            - 'newton-cholesky' is a good choice for `n_samples` >> `n_features`,
-              especially with one-hot encoded categorical features with rare
-              categories. Note that it is limited to binary classification and the
-              one-versus-rest reduction for multiclass classification. Be aware that
-              the memory usage of this solver has a quadratic dependency on
-              `n_features` because it explicitly computes the Hessian matrix.
+        - For small datasets, 'liblinear' is a good choice, whereas 'sag'
+          and 'saga' are faster for large ones;
+        - For multiclass problems, only 'newton-cg', 'sag', 'saga' and
+          'lbfgs' handle multinomial loss;
+        - 'liblinear' might be slower in :class:`LogisticRegressionCV`
+          because it does not handle warm-starting.
+        - 'liblinear' and 'newton-cholesky' can only handle binary classification
+          by default. To apply a one-versus-rest scheme for the multiclass setting
+          one can wrapt it with the `OneVsRestClassifier`.
+        - 'newton-cholesky' is a good choice for `n_samples` >> `n_features`,
+          especially with one-hot encoded categorical features with rare
+          categories. Be aware that the memory usage of this solver has a quadratic
+          dependency on `n_features` because it explicitly computes the Hessian
+          matrix.
 
         .. warning::
-           The choice of the algorithm depends on the penalty chosen.
-           Supported penalties by solver:
-
-           - 'lbfgs'           -   ['l2']
-           - 'liblinear'       -   ['l1', 'l2']
-           - 'newton-cg'       -   ['l2']
-           - 'newton-cholesky' -   ['l2']
-           - 'sag'             -   ['l2']
-           - 'saga'            -   ['elasticnet', 'l1', 'l2']
+           The choice of the algorithm depends on the penalty chosen and on
+           (multinomial) multiclass support:
+
+           ================= ============================== ======================
+           solver            penalty                        multinomial multiclass
+           ================= ============================== ======================
+           'lbfgs'           'l2'                           yes
+           'liblinear'       'l1', 'l2'                     no
+           'newton-cg'       'l2'                           yes
+           'newton-cholesky' 'l2',                          no
+           'sag'             'l2',                          yes
+           'saga'            'elasticnet', 'l1', 'l2'       yes
+           ================= ============================== ======================
 
         .. note::
            'sag' and 'saga' fast convergence is only guaranteed on features
@@ -1577,6 +1637,13 @@ class LogisticRegressionCV(LogisticRegression, LinearClassifierMixin, BaseEstima
            Stochastic Average Gradient descent solver for 'multinomial' case.
         .. versionchanged:: 0.22
             Default changed from 'ovr' to 'auto' in 0.22.
+        .. deprecated:: 1.5
+           ``multi_class`` was deprecated in version 1.5 and will be removed in 1.7.
+           From then on, the recommended 'multinomial' will always be used for
+           `n_classes >= 3`.
+           Solvers that do not support 'multinomial' will raise an error.
+           Use `sklearn.multiclass.OneVsRestClassifier(LogisticRegressionCV())` if you
+           still want to use OvR.
 
     random_state : int, RandomState instance, default=None
         Used when `solver='sag'`, 'saga' or 'liblinear' to shuffle the data.
@@ -1718,7 +1785,7 @@ def __init__(
         verbose=0,
         refit=True,
         intercept_scaling=1.0,
-        multi_class="auto",
+        multi_class="deprecated",
         random_state=None,
         l1_ratios=None,
     ):
@@ -1822,7 +1889,40 @@ def fit(self, X, y, sample_weight=None, **params):
         classes = self.classes_ = label_encoder.classes_
         encoded_labels = label_encoder.transform(label_encoder.classes_)
 
-        multi_class = _check_multi_class(self.multi_class, solver, len(classes))
+        # TODO(1.7) remove multi_class
+        multi_class = self.multi_class
+        if self.multi_class == "multinomial" and len(self.classes_) == 2:
+            warnings.warn(
+                (
+                    "'multi_class' was deprecated in version 1.5 and will be removed in"
+                    " 1.7. From then on, binary problems will be fit as proper binary "
+                    " logistic regression models (as if multi_class='ovr' were set)."
+                    " Leave it to its default value to avoid this warning."
+                ),
+                FutureWarning,
+            )
+        elif self.multi_class in ("multinomial", "auto"):
+            warnings.warn(
+                (
+                    "'multi_class' was deprecated in version 1.5 and will be removed in"
+                    " 1.7. From then on, it will always use 'multinomial'."
+                    " Leave it to its default value to avoid this warning."
+                ),
+                FutureWarning,
+            )
+        elif self.multi_class == "ovr":
+            warnings.warn(
+                (
+                    "'multi_class' was deprecated in version 1.5 and will be removed in"
+                    " 1.7. Use OneVsRestClassifier(LogisticRegressionCV(..)) instead."
+                    " Leave it to its default value to avoid this warning."
+                ),
+                FutureWarning,
+            )
+        else:
+            # Set to old default value.
+            multi_class = "auto"
+        multi_class = _check_multi_class(multi_class, solver, len(classes))
 
         if solver in ["sag", "saga"]:
             max_squared_sum = row_norms(X, squared=True).max()
@@ -2159,13 +2259,13 @@ def get_metadata_routing(self):
             .add_self_request(self)
             .add(
                 splitter=self.cv,
-                method_mapping=MethodMapping().add(callee="split", caller="fit"),
+                method_mapping=MethodMapping().add(caller="fit", callee="split"),
             )
             .add(
                 scorer=self._get_scorer(),
                 method_mapping=MethodMapping()
-                .add(callee="score", caller="score")
-                .add(callee="score", caller="fit"),
+                .add(caller="score", callee="score")
+                .add(caller="fit", callee="score"),
             )
         )
         return router
diff --git a/sklearn/linear_model/_omp.py b/sklearn/linear_model/_omp.py
index 2d6fe48869742..eb4e52be2656c 100644
--- a/sklearn/linear_model/_omp.py
+++ b/sklearn/linear_model/_omp.py
@@ -1,8 +1,7 @@
 """Orthogonal matching pursuit algorithms"""
 
-# Author: Vlad Niculae
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from math import sqrt
@@ -1116,6 +1115,6 @@ def get_metadata_routing(self):
 
         router = MetadataRouter(owner=self.__class__.__name__).add(
             splitter=self.cv,
-            method_mapping=MethodMapping().add(callee="split", caller="fit"),
+            method_mapping=MethodMapping().add(caller="fit", callee="split"),
         )
         return router
diff --git a/sklearn/linear_model/_passive_aggressive.py b/sklearn/linear_model/_passive_aggressive.py
index 2de019b6d986c..8d4dc2d3a2c23 100644
--- a/sklearn/linear_model/_passive_aggressive.py
+++ b/sklearn/linear_model/_passive_aggressive.py
@@ -1,5 +1,5 @@
-# Authors: Rob Zinkov, Mathieu Blondel
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 from numbers import Real
 
 from ..base import _fit_context
@@ -142,9 +142,6 @@ class PassiveAggressiveClassifier(BaseSGDClassifier):
         Number of weight updates performed during training.
         Same as ``(n_iter_ * n_samples + 1)``.
 
-    loss_function_ : callable
-        Loss function used by the algorithm.
-
     See Also
     --------
     SGDClassifier : Incrementally trained logistic regression.
diff --git a/sklearn/linear_model/_perceptron.py b/sklearn/linear_model/_perceptron.py
index b97550fa52e8c..d15668bebfef1 100644
--- a/sklearn/linear_model/_perceptron.py
+++ b/sklearn/linear_model/_perceptron.py
@@ -1,5 +1,5 @@
-# Author: Mathieu Blondel
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 from numbers import Real
 
 from ..utils._param_validation import Interval, StrOptions
@@ -123,10 +123,6 @@ class Perceptron(BaseSGDClassifier):
     intercept_ : ndarray of shape (1,) if n_classes == 2 else (n_classes,)
         Constants in decision function.
 
-    loss_function_ : concrete LossFunction
-        The function that determines the loss, or difference between the
-        output of the algorithm and the target values.
-
     n_features_in_ : int
         Number of features seen during :term:`fit`.
 
diff --git a/sklearn/linear_model/_quantile.py b/sklearn/linear_model/_quantile.py
index 33451d8640bff..79d2e6b67ca5e 100644
--- a/sklearn/linear_model/_quantile.py
+++ b/sklearn/linear_model/_quantile.py
@@ -1,6 +1,5 @@
-# Authors: David Dale <dale.david@mail.ru>
-#          Christian Lorentzen <lorentzen.ch@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import warnings
 from numbers import Real
 
@@ -48,7 +47,7 @@ class QuantileRegressor(LinearModel, RegressorMixin, BaseEstimator):
         Method used by :func:`scipy.optimize.linprog` to solve the linear
         programming formulation.
 
-        From `scipy>=1.6.0`, it is recommended to use the highs methods because
+        It is recommended to use the highs methods because
         they are the fastest ones. Solvers "highs-ds", "highs-ipm" and "highs"
         support sparse input data and, in fact, always convert to sparse csc.
 
@@ -101,8 +100,7 @@ class QuantileRegressor(LinearModel, RegressorMixin, BaseEstimator):
     >>> X = rng.randn(n_samples, n_features)
     >>> # the two following lines are optional in practice
     >>> from sklearn.utils.fixes import sp_version, parse_version
-    >>> solver = "highs" if sp_version >= parse_version("1.6.0") else "interior-point"
-    >>> reg = QuantileRegressor(quantile=0.8, solver=solver).fit(X, y)
+    >>> reg = QuantileRegressor(quantile=0.8).fit(X, y)
     >>> np.mean(y <= reg.predict(X))
     0.8
     """
@@ -181,30 +179,18 @@ def fit(self, X, y, sample_weight=None):
         # So we rescale the penalty term, which is equivalent.
         alpha = np.sum(sample_weight) * self.alpha
 
-        if self.solver in (
-            "highs-ds",
-            "highs-ipm",
-            "highs",
-        ) and sp_version < parse_version("1.6.0"):
+        if self.solver == "interior-point" and sp_version >= parse_version("1.11.0"):
             raise ValueError(
-                f"Solver {self.solver} is only available "
-                f"with scipy>=1.6.0, got {sp_version}"
-            )
-        else:
-            solver = self.solver
-
-        if solver == "interior-point" and sp_version >= parse_version("1.11.0"):
-            raise ValueError(
-                f"Solver {solver} is not anymore available in SciPy >= 1.11.0."
+                f"Solver {self.solver} is not anymore available in SciPy >= 1.11.0."
             )
 
-        if sparse.issparse(X) and solver not in ["highs", "highs-ds", "highs-ipm"]:
+        if sparse.issparse(X) and self.solver not in ["highs", "highs-ds", "highs-ipm"]:
             raise ValueError(
                 f"Solver {self.solver} does not support sparse X. "
                 "Use solver 'highs' for example."
             )
         # make default solver more stable
-        if self.solver_options is None and solver == "interior-point":
+        if self.solver_options is None and self.solver == "interior-point":
             solver_options = {"lstsq": True}
         else:
             solver_options = self.solver_options
@@ -247,7 +233,7 @@ def fit(self, X, y, sample_weight=None):
             c[0] = 0
             c[n_params] = 0
 
-        if solver in ["highs", "highs-ds", "highs-ipm"]:
+        if self.solver in ["highs", "highs-ds", "highs-ipm"]:
             # Note that highs methods always use a sparse CSC memory layout internally,
             # even for optimization problems parametrized using dense numpy arrays.
             # Therefore, we work with CSC matrices as early as possible to limit
@@ -272,7 +258,7 @@ def fit(self, X, y, sample_weight=None):
             c=c,
             A_eq=A_eq,
             b_eq=b_eq,
-            method=solver,
+            method=self.solver,
             options=solver_options,
         )
         solution = result.x
diff --git a/sklearn/linear_model/_ransac.py b/sklearn/linear_model/_ransac.py
index b6bf7b082fc5e..631a2c1c66815 100644
--- a/sklearn/linear_model/_ransac.py
+++ b/sklearn/linear_model/_ransac.py
@@ -1,6 +1,5 @@
-# Author: Johannes Schönberger
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from numbers import Integral, Real
diff --git a/sklearn/linear_model/_ridge.py b/sklearn/linear_model/_ridge.py
index 584302f927ab6..c9143389739af 100644
--- a/sklearn/linear_model/_ridge.py
+++ b/sklearn/linear_model/_ridge.py
@@ -2,11 +2,8 @@
 Ridge regression
 """
 
-# Author: Mathieu Blondel <mathieu@mblondel.org>
-#         Reuben Fletcher-Costin <reuben.fletchercostin@gmail.com>
-#         Fabian Pedregosa <fabian@fseoane.net>
-#         Michael Eickenberg <michael.eickenberg@nsup.org>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 import numbers
@@ -31,8 +28,16 @@
     check_scalar,
     column_or_1d,
     compute_sample_weight,
+    deprecated,
 )
-from ..utils._param_validation import Interval, StrOptions, validate_params
+from ..utils._array_api import (
+    _is_numpy_namespace,
+    _ravel,
+    device,
+    get_namespace,
+    get_namespace_and_device,
+)
+from ..utils._param_validation import Hidden, Interval, StrOptions, validate_params
 from ..utils.extmath import row_norms, safe_sparse_dot
 from ..utils.fixes import _sparse_linalg_cg
 from ..utils.metadata_routing import (
@@ -277,15 +282,16 @@ def _solve_cholesky_kernel(K, y, alpha, sample_weight=None, copy=False):
         return dual_coefs.T
 
 
-def _solve_svd(X, y, alpha):
-    U, s, Vt = linalg.svd(X, full_matrices=False)
+def _solve_svd(X, y, alpha, xp=None):
+    xp, _ = get_namespace(X, xp=xp)
+    U, s, Vt = xp.linalg.svd(X, full_matrices=False)
     idx = s > 1e-15  # same default value as scipy.linalg.pinv
-    s_nnz = s[idx][:, np.newaxis]
-    UTy = np.dot(U.T, y)
-    d = np.zeros((s.size, alpha.size), dtype=X.dtype)
+    s_nnz = s[idx][:, None]
+    UTy = U.T @ y
+    d = xp.zeros((s.shape[0], alpha.shape[0]), dtype=X.dtype, device=device(X))
     d[idx] = s_nnz / (s_nnz**2 + alpha)
     d_UT_y = d * UTy
-    return np.dot(Vt.T, d_UT_y).T
+    return (Vt.T @ d_UT_y).T
 
 
 def _solve_lbfgs(
@@ -600,28 +606,29 @@ def _ridge_regression(
     random_state=None,
     return_n_iter=False,
     return_intercept=False,
+    return_solver=False,
     X_scale=None,
     X_offset=None,
     check_input=True,
     fit_intercept=False,
 ):
+    xp, is_array_api_compliant, device_ = get_namespace_and_device(
+        X, y, sample_weight, X_scale, X_offset
+    )
+    is_numpy_namespace = _is_numpy_namespace(xp)
+    X_is_sparse = sparse.issparse(X)
+
     has_sw = sample_weight is not None
 
-    if solver == "auto":
-        if positive:
-            solver = "lbfgs"
-        elif return_intercept:
-            # sag supports fitting intercept directly
-            solver = "sag"
-        elif not sparse.issparse(X):
-            solver = "cholesky"
-        else:
-            solver = "sparse_cg"
+    solver = resolve_solver(solver, positive, return_intercept, X_is_sparse, xp)
 
-    if solver not in ("sparse_cg", "cholesky", "svd", "lsqr", "sag", "saga", "lbfgs"):
+    if is_numpy_namespace and not X_is_sparse:
+        X = np.asarray(X)
+
+    if not is_numpy_namespace and solver != "svd":
         raise ValueError(
-            "Known solvers are 'sparse_cg', 'cholesky', 'svd'"
-            " 'lsqr', 'sag', 'saga' or 'lbfgs'. Got %s." % solver
+            f"Array API dispatch to namespace {xp.__name__} only supports "
+            f"solver 'svd'. Got '{solver}'."
         )
 
     if positive and solver != "lbfgs":
@@ -645,8 +652,8 @@ def _ridge_regression(
         )
 
     if check_input:
-        _dtype = [np.float64, np.float32]
-        _accept_sparse = _get_valid_accept_sparse(sparse.issparse(X), solver)
+        _dtype = [xp.float64, xp.float32]
+        _accept_sparse = _get_valid_accept_sparse(X_is_sparse, solver)
         X = check_array(X, accept_sparse=_accept_sparse, dtype=_dtype, order="C")
         y = check_array(y, dtype=X.dtype, ensure_2d=False, order=None)
     check_consistent_length(X, y)
@@ -658,7 +665,7 @@ def _ridge_regression(
 
     ravel = False
     if y.ndim == 1:
-        y = y.reshape(-1, 1)
+        y = xp.reshape(y, (-1, 1))
         ravel = True
 
     n_samples_, n_targets = y.shape
@@ -679,7 +686,7 @@ def _ridge_regression(
 
     # Some callers of this method might pass alpha as single
     # element array which already has been validated.
-    if alpha is not None and not isinstance(alpha, np.ndarray):
+    if alpha is not None and not isinstance(alpha, type(xp.asarray([0.0]))):
         alpha = check_scalar(
             alpha,
             "alpha",
@@ -689,15 +696,17 @@ def _ridge_regression(
         )
 
     # There should be either 1 or n_targets penalties
-    alpha = np.asarray(alpha, dtype=X.dtype).ravel()
-    if alpha.size not in [1, n_targets]:
+    alpha = _ravel(xp.asarray(alpha, device=device_, dtype=X.dtype), xp=xp)
+    if alpha.shape[0] not in [1, n_targets]:
         raise ValueError(
             "Number of targets and number of penalties do not correspond: %d != %d"
-            % (alpha.size, n_targets)
+            % (alpha.shape[0], n_targets)
         )
 
-    if alpha.size == 1 and n_targets > 1:
-        alpha = np.repeat(alpha, n_targets)
+    if alpha.shape[0] == 1 and n_targets > 1:
+        alpha = xp.full(
+            shape=(n_targets,), fill_value=alpha[0], dtype=alpha.dtype, device=device_
+        )
 
     n_iter = None
     if solver == "sparse_cg":
@@ -779,7 +788,6 @@ def _ridge_regression(
 
         if intercept.shape[0] == 1:
             intercept = intercept[0]
-        coef = np.asarray(coef)
 
     elif solver == "lbfgs":
         coef = _solve_lbfgs(
@@ -795,22 +803,71 @@ def _ridge_regression(
         )
 
     if solver == "svd":
-        if sparse.issparse(X):
+        if X_is_sparse:
             raise TypeError("SVD solver does not support sparse inputs currently")
-        coef = _solve_svd(X, y, alpha)
+        coef = _solve_svd(X, y, alpha, xp)
 
     if ravel:
-        # When y was passed as a 1d-array, we flatten the coefficients.
-        coef = coef.ravel()
+        coef = _ravel(coef)
+
+    coef = xp.asarray(coef)
 
     if return_n_iter and return_intercept:
-        return coef, n_iter, intercept
+        res = coef, n_iter, intercept
     elif return_intercept:
-        return coef, intercept
+        res = coef, intercept
     elif return_n_iter:
-        return coef, n_iter
+        res = coef, n_iter
     else:
-        return coef
+        res = coef
+
+    return (*res, solver) if return_solver else res
+
+
+def resolve_solver(solver, positive, return_intercept, is_sparse, xp):
+    if solver != "auto":
+        return solver
+
+    is_numpy_namespace = _is_numpy_namespace(xp)
+
+    auto_solver_np = resolve_solver_for_numpy(positive, return_intercept, is_sparse)
+    if is_numpy_namespace:
+        return auto_solver_np
+
+    if positive:
+        raise ValueError(
+            "The solvers that support positive fitting do not support "
+            f"Array API dispatch to namespace {xp.__name__}. Please "
+            "either disable Array API dispatch, or use a numpy-like "
+            "namespace, or set `positive=False`."
+        )
+
+    # At the moment, Array API dispatch only supports the "svd" solver.
+    solver = "svd"
+    if solver != auto_solver_np:
+        warnings.warn(
+            f"Using Array API dispatch to namespace {xp.__name__} with "
+            f"`solver='auto'` will result in using the solver '{solver}'. "
+            "The results may differ from those when using a Numpy array, "
+            f"because in that case the preferred solver would be {auto_solver_np}. "
+            f"Set `solver='{solver}'` to suppress this warning."
+        )
+
+    return solver
+
+
+def resolve_solver_for_numpy(positive, return_intercept, is_sparse):
+    if positive:
+        return "lbfgs"
+
+    if return_intercept:
+        # sag supports fitting intercept directly
+        return "sag"
+
+    if not is_sparse:
+        return "cholesky"
+
+    return "sparse_cg"
 
 
 class _BaseRidge(LinearModel, metaclass=ABCMeta):
@@ -852,6 +909,8 @@ def __init__(
         self.random_state = random_state
 
     def fit(self, X, y, sample_weight=None):
+        xp, is_array_api_compliant = get_namespace(X, y, sample_weight)
+
         if self.solver == "lbfgs" and not self.positive:
             raise ValueError(
                 "'lbfgs' solver can be used only when positive=True. "
@@ -903,7 +962,7 @@ def fit(self, X, y, sample_weight=None):
         )
 
         if solver == "sag" and sparse.issparse(X) and self.fit_intercept:
-            self.coef_, self.n_iter_, self.intercept_ = _ridge_regression(
+            self.coef_, self.n_iter_, self.intercept_, self.solver_ = _ridge_regression(
                 X,
                 y,
                 alpha=self.alpha,
@@ -915,6 +974,7 @@ def fit(self, X, y, sample_weight=None):
                 random_state=self.random_state,
                 return_n_iter=True,
                 return_intercept=True,
+                return_solver=True,
                 check_input=False,
             )
             # add the offset which was subtracted by _preprocess_data
@@ -928,7 +988,7 @@ def fit(self, X, y, sample_weight=None):
                 # for dense matrices or when intercept is set to 0
                 params = {}
 
-            self.coef_, self.n_iter_ = _ridge_regression(
+            self.coef_, self.n_iter_, self.solver_ = _ridge_regression(
                 X,
                 y,
                 alpha=self.alpha,
@@ -940,6 +1000,7 @@ def fit(self, X, y, sample_weight=None):
                 random_state=self.random_state,
                 return_n_iter=True,
                 return_intercept=False,
+                return_solver=True,
                 check_input=False,
                 fit_intercept=self.fit_intercept,
                 **params,
@@ -1095,6 +1156,12 @@ class Ridge(MultiOutputMixin, RegressorMixin, _BaseRidge):
 
         .. versionadded:: 1.0
 
+    solver_ : str
+        The solver that was used at fit time by the computational
+        routines.
+
+        .. versionadded:: 1.5
+
     See Also
     --------
     RidgeClassifier : Ridge classifier.
@@ -1168,16 +1235,21 @@ def fit(self, X, y, sample_weight=None):
             Fitted estimator.
         """
         _accept_sparse = _get_valid_accept_sparse(sparse.issparse(X), self.solver)
+        xp, _ = get_namespace(X, y, sample_weight)
         X, y = self._validate_data(
             X,
             y,
             accept_sparse=_accept_sparse,
-            dtype=[np.float64, np.float32],
+            dtype=[xp.float64, xp.float32],
+            force_writeable=True,
             multi_output=True,
             y_numeric=True,
         )
         return super().fit(X, y, sample_weight=sample_weight)
 
+    def _more_tags(self):
+        return {"array_api_support": True}
+
 
 class _RidgeClassifierMixin(LinearClassifierMixin):
     def _prepare_data(self, X, y, sample_weight, solver):
@@ -1219,6 +1291,7 @@ def _prepare_data(self, X, y, sample_weight, solver):
             accept_sparse=accept_sparse,
             multi_output=True,
             y_numeric=False,
+            force_writeable=True,
         )
 
         self._label_binarizer = LabelBinarizer(pos_label=1, neg_label=-1)
@@ -1403,6 +1476,12 @@ class RidgeClassifier(_RidgeClassifierMixin, _BaseRidge):
 
         .. versionadded:: 1.0
 
+    solver_ : str
+        The solver that was used at fit time by the computational
+        routines.
+
+        .. versionadded:: 1.5
+
     See Also
     --------
     Ridge : Ridge regression.
@@ -1652,7 +1731,7 @@ def __init__(
         scoring=None,
         copy_X=True,
         gcv_mode=None,
-        store_cv_values=False,
+        store_cv_results=False,
         is_clf=False,
         alpha_per_target=False,
     ):
@@ -1661,7 +1740,7 @@ def __init__(
         self.scoring = scoring
         self.copy_X = copy_X
         self.gcv_mode = gcv_mode
-        self.store_cv_values = store_cv_values
+        self.store_cv_results = store_cv_results
         self.is_clf = is_clf
         self.alpha_per_target = alpha_per_target
 
@@ -2056,8 +2135,8 @@ def fit(self, X, y, sample_weight=None, score_params=None):
         n_y = 1 if len(y.shape) == 1 else y.shape[1]
         n_alphas = 1 if np.ndim(self.alphas) == 0 else len(self.alphas)
 
-        if self.store_cv_values:
-            self.cv_values_ = np.empty((n_samples * n_y, n_alphas), dtype=X.dtype)
+        if self.store_cv_results:
+            self.cv_results_ = np.empty((n_samples * n_y, n_alphas), dtype=X.dtype)
 
         best_coef, best_score, best_alpha = None, None, None
 
@@ -2066,12 +2145,12 @@ def fit(self, X, y, sample_weight=None, score_params=None):
             if scorer is None:
                 squared_errors = (c / G_inverse_diag) ** 2
                 alpha_score = self._score_without_scorer(squared_errors=squared_errors)
-                if self.store_cv_values:
-                    self.cv_values_[:, i] = squared_errors.ravel()
+                if self.store_cv_results:
+                    self.cv_results_[:, i] = squared_errors.ravel()
             else:
                 predictions = y - (c / G_inverse_diag)
-                if self.store_cv_values:
-                    self.cv_values_[:, i] = predictions.ravel()
+                if self.store_cv_results:
+                    self.cv_results_[:, i] = predictions.ravel()
 
                 score_params = score_params or {}
                 alpha_score = self._score(
@@ -2114,12 +2193,12 @@ def fit(self, X, y, sample_weight=None, score_params=None):
             X_offset += X_mean * X_scale
         self._set_intercept(X_offset, y_offset, X_scale)
 
-        if self.store_cv_values:
+        if self.store_cv_results:
             if len(y.shape) == 1:
-                cv_values_shape = n_samples, n_alphas
+                cv_results_shape = n_samples, n_alphas
             else:
-                cv_values_shape = n_samples, n_y, n_alphas
-            self.cv_values_ = self.cv_values_.reshape(cv_values_shape)
+                cv_results_shape = n_samples, n_y, n_alphas
+            self.cv_results_ = self.cv_results_.reshape(cv_results_shape)
 
         return self
 
@@ -2179,8 +2258,9 @@ class _BaseRidgeCV(LinearModel):
         "scoring": [StrOptions(set(get_scorer_names())), callable, None],
         "cv": ["cv_object"],
         "gcv_mode": [StrOptions({"auto", "svd", "eigen"}), None],
-        "store_cv_values": ["boolean"],
+        "store_cv_results": ["boolean", Hidden(None)],
         "alpha_per_target": ["boolean"],
+        "store_cv_values": ["boolean", Hidden(StrOptions({"deprecated"}))],
     }
 
     def __init__(
@@ -2191,16 +2271,18 @@ def __init__(
         scoring=None,
         cv=None,
         gcv_mode=None,
-        store_cv_values=False,
+        store_cv_results=None,
         alpha_per_target=False,
+        store_cv_values="deprecated",
     ):
         self.alphas = alphas
         self.fit_intercept = fit_intercept
         self.scoring = scoring
         self.cv = cv
         self.gcv_mode = gcv_mode
-        self.store_cv_values = store_cv_values
+        self.store_cv_results = store_cv_results
         self.alpha_per_target = alpha_per_target
+        self.store_cv_values = store_cv_values
 
     def fit(self, X, y, sample_weight=None, **params):
         """Fit Ridge regression model with cv.
@@ -2244,6 +2326,28 @@ def fit(self, X, y, sample_weight=None, **params):
         _raise_for_params(params, self, "fit")
         cv = self.cv
 
+        # TODO(1.7): Remove in 1.7
+        # Also change `store_cv_results` default back to False
+        if self.store_cv_values != "deprecated":
+            if self.store_cv_results is not None:
+                raise ValueError(
+                    "Both 'store_cv_values' and 'store_cv_results' were set. "
+                    "'store_cv_values' is deprecated in version 1.5 and will be "
+                    "removed in 1.7. To avoid this error, only set 'store_cv_results'."
+                )
+            warnings.warn(
+                (
+                    "'store_cv_values' is deprecated in version 1.5 and will be "
+                    "removed in 1.7. Use 'store_cv_results' instead."
+                ),
+                FutureWarning,
+            )
+            self._store_cv_results = self.store_cv_values
+        elif self.store_cv_results is None:
+            self._store_cv_results = False
+        else:
+            self._store_cv_results = self.store_cv_results
+
         # `_RidgeGCV` does not work for alpha = 0
         if cv is None:
             check_scalar_alpha = partial(
@@ -2289,7 +2393,7 @@ def fit(self, X, y, sample_weight=None, **params):
                 fit_intercept=self.fit_intercept,
                 scoring=self.scoring,
                 gcv_mode=self.gcv_mode,
-                store_cv_values=self.store_cv_values,
+                store_cv_results=self._store_cv_results,
                 is_clf=is_classifier(self),
                 alpha_per_target=self.alpha_per_target,
             )
@@ -2301,11 +2405,11 @@ def fit(self, X, y, sample_weight=None, **params):
             )
             self.alpha_ = estimator.alpha_
             self.best_score_ = estimator.best_score_
-            if self.store_cv_values:
-                self.cv_values_ = estimator.cv_values_
+            if self._store_cv_results:
+                self.cv_results_ = estimator.cv_results_
         else:
-            if self.store_cv_values:
-                raise ValueError("cv!=None and store_cv_values=True are incompatible")
+            if self._store_cv_results:
+                raise ValueError("cv!=None and store_cv_results=True are incompatible")
             if self.alpha_per_target:
                 raise ValueError("cv!=None and alpha_per_target=True are incompatible")
 
@@ -2366,6 +2470,16 @@ def get_metadata_routing(self):
     def _get_scorer(self):
         return check_scoring(self, scoring=self.scoring, allow_none=True)
 
+    # TODO(1.7): Remove
+    # mypy error: Decorated property not supported
+    @deprecated(  # type: ignore
+        "Attribute `cv_values_` is deprecated in version 1.5 and will be removed "
+        "in 1.7. Use `cv_results_` instead."
+    )
+    @property
+    def cv_values_(self):
+        return self.cv_results_
+
 
 class RidgeCV(MultiOutputMixin, RegressorMixin, _BaseRidgeCV):
     """Ridge regression with built-in cross-validation.
@@ -2394,12 +2508,10 @@ class RidgeCV(MultiOutputMixin, RegressorMixin, _BaseRidgeCV):
         (i.e. data is expected to be centered).
 
     scoring : str, callable, default=None
-        A string (see model evaluation documentation) or
-        a scorer callable object / function with signature
-        ``scorer(estimator, X, y)``.
-        If None, the negative mean squared error if cv is 'auto' or None
-        (i.e. when using leave-one-out cross-validation), and r2 score
-        otherwise.
+        A string (see :ref:`scoring_parameter`) or a scorer callable object /
+        function with signature ``scorer(estimator, X, y)``. If None, the
+        negative mean squared error if cv is 'auto' or None (i.e. when using
+        leave-one-out cross-validation), and r2 score otherwise.
 
     cv : int, cross-validation generator or an iterable, default=None
         Determines the cross-validation splitting strategy.
@@ -2429,12 +2541,15 @@ class RidgeCV(MultiOutputMixin, RegressorMixin, _BaseRidgeCV):
         The 'auto' mode is the default and is intended to pick the cheaper
         option of the two depending on the shape of the training data.
 
-    store_cv_values : bool, default=False
+    store_cv_results : bool, default=False
         Flag indicating if the cross-validation values corresponding to
         each alpha should be stored in the ``cv_values_`` attribute (see
         below). This flag is only compatible with ``cv=None`` (i.e. using
         Leave-One-Out Cross-Validation).
 
+        .. versionchanged:: 1.5
+            Parameter name changed from `store_cv_values` to `store_cv_results`.
+
     alpha_per_target : bool, default=False
         Flag indicating whether to optimize the alpha value (picked from the
         `alphas` parameter list) for each target separately (for multi-output
@@ -2444,16 +2559,29 @@ class RidgeCV(MultiOutputMixin, RegressorMixin, _BaseRidgeCV):
 
         .. versionadded:: 0.24
 
+    store_cv_values : bool
+        Flag indicating if the cross-validation values corresponding to
+        each alpha should be stored in the ``cv_values_`` attribute (see
+        below). This flag is only compatible with ``cv=None`` (i.e. using
+        Leave-One-Out Cross-Validation).
+
+        .. deprecated:: 1.5
+            `store_cv_values` is deprecated in version 1.5 in favor of
+            `store_cv_results` and will be removed in version 1.7.
+
     Attributes
     ----------
-    cv_values_ : ndarray of shape (n_samples, n_alphas) or \
+    cv_results_ : ndarray of shape (n_samples, n_alphas) or \
             shape (n_samples, n_targets, n_alphas), optional
         Cross-validation values for each alpha (only available if
-        ``store_cv_values=True`` and ``cv=None``). After ``fit()`` has been
+        ``store_cv_results=True`` and ``cv=None``). After ``fit()`` has been
         called, this attribute will contain the mean squared errors if
         `scoring is None` otherwise it will contain standardized per point
         prediction values.
 
+        .. versionchanged:: 1.5
+            `cv_values_` changed to `cv_results_`.
+
     coef_ : ndarray of shape (n_features) or (n_targets, n_features)
         Weight vector(s).
 
@@ -2570,9 +2698,8 @@ class RidgeClassifierCV(_RidgeClassifierMixin, _BaseRidgeCV):
         (i.e. data is expected to be centered).
 
     scoring : str, callable, default=None
-        A string (see model evaluation documentation) or
-        a scorer callable object / function with signature
-        ``scorer(estimator, X, y)``.
+        A string (see :ref:`scoring_parameter`) or a scorer callable object /
+        function with signature ``scorer(estimator, X, y)``.
 
     cv : int, cross-validation generator or an iterable, default=None
         Determines the cross-validation splitting strategy.
@@ -2594,20 +2721,36 @@ class RidgeClassifierCV(_RidgeClassifierMixin, _BaseRidgeCV):
         weights inversely proportional to class frequencies in the input data
         as ``n_samples / (n_classes * np.bincount(y))``.
 
-    store_cv_values : bool, default=False
+    store_cv_results : bool, default=False
+        Flag indicating if the cross-validation results corresponding to
+        each alpha should be stored in the ``cv_results_`` attribute (see
+        below). This flag is only compatible with ``cv=None`` (i.e. using
+        Leave-One-Out Cross-Validation).
+
+        .. versionchanged:: 1.5
+            Parameter name changed from `store_cv_values` to `store_cv_results`.
+
+    store_cv_values : bool
         Flag indicating if the cross-validation values corresponding to
         each alpha should be stored in the ``cv_values_`` attribute (see
         below). This flag is only compatible with ``cv=None`` (i.e. using
         Leave-One-Out Cross-Validation).
 
+        .. deprecated:: 1.5
+            `store_cv_values` is deprecated in version 1.5 in favor of
+            `store_cv_results` and will be removed in version 1.7.
+
     Attributes
     ----------
-    cv_values_ : ndarray of shape (n_samples, n_targets, n_alphas), optional
-        Cross-validation values for each alpha (only if ``store_cv_values=True`` and
+    cv_results_ : ndarray of shape (n_samples, n_targets, n_alphas), optional
+        Cross-validation results for each alpha (only if ``store_cv_results=True`` and
         ``cv=None``). After ``fit()`` has been called, this attribute will
         contain the mean squared errors if `scoring is None` otherwise it
         will contain standardized per point prediction values.
 
+        .. versionchanged:: 1.5
+            `cv_values_` changed to `cv_results_`.
+
     coef_ : ndarray of shape (1, n_features) or (n_targets, n_features)
         Coefficient of the features in the decision function.
 
@@ -2676,13 +2819,15 @@ def __init__(
         scoring=None,
         cv=None,
         class_weight=None,
-        store_cv_values=False,
+        store_cv_results=None,
+        store_cv_values="deprecated",
     ):
         super().__init__(
             alphas=alphas,
             fit_intercept=fit_intercept,
             scoring=scoring,
             cv=cv,
+            store_cv_results=store_cv_results,
             store_cv_values=store_cv_values,
         )
         self.class_weight = class_weight
diff --git a/sklearn/linear_model/_sag.py b/sklearn/linear_model/_sag.py
index 2626955ec2a7f..ca0ab4731293d 100644
--- a/sklearn/linear_model/_sag.py
+++ b/sklearn/linear_model/_sag.py
@@ -1,8 +1,7 @@
 """Solvers for Ridge and LogisticRegression using SAG algorithm"""
 
-# Authors: Tom Dupre la Tour <tom.dupre-la-tour@m4x.org>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 
@@ -220,10 +219,9 @@ def sag_solver(
 
     >>> X = np.array([[-1, -1], [-2, -1], [1, 1], [2, 1]])
     >>> y = np.array([1, 1, 2, 2])
-    >>> clf = linear_model.LogisticRegression(
-    ...     solver='sag', multi_class='multinomial')
+    >>> clf = linear_model.LogisticRegression(solver='sag')
     >>> clf.fit(X, y)
-    LogisticRegression(multi_class='multinomial', solver='sag')
+    LogisticRegression(solver='sag')
 
     References
     ----------
diff --git a/sklearn/linear_model/_sag_fast.pyx.tp b/sklearn/linear_model/_sag_fast.pyx.tp
index 29d537a45b897..2365211ab14f0 100644
--- a/sklearn/linear_model/_sag_fast.pyx.tp
+++ b/sklearn/linear_model/_sag_fast.pyx.tp
@@ -8,7 +8,7 @@ Template file for easily generate fused types consistent code using Tempita
 Generated file: sag_fast.pyx
 
 Each class is duplicated for all dtypes (float and double). The keywords
-between double braces are substituted in setup.py.
+between double braces are substituted during the build.
 
 Authors: Danny Sullivan <dbsullivan23@gmail.com>
          Tom Dupre la Tour <tom.dupre-la-tour@m4x.org>
diff --git a/sklearn/linear_model/_sgd_fast.pxd b/sklearn/linear_model/_sgd_fast.pxd
index da7f155c6fa6e..c6991b8aa5bc2 100644
--- a/sklearn/linear_model/_sgd_fast.pxd
+++ b/sklearn/linear_model/_sgd_fast.pxd
@@ -1,4 +1,4 @@
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 """Helper to load LossFunction from sgd_fast.pyx to sag_fast.pyx"""
 
 cdef class LossFunction:
diff --git a/sklearn/linear_model/_sgd_fast.pyx.tp b/sklearn/linear_model/_sgd_fast.pyx.tp
index e3f95dca55558..5869b2d3e64db 100644
--- a/sklearn/linear_model/_sgd_fast.pyx.tp
+++ b/sklearn/linear_model/_sgd_fast.pyx.tp
@@ -7,7 +7,7 @@ Template file to easily generate fused types consistent code using Tempita
 Generated file: _sgd_fast.pyx
 
 Each relevant function is duplicated for the dtypes float and double.
-The keywords between double braces are substituted in setup.py.
+The keywords between double braces are substituted during the build.
 
 Authors: Peter Prettenhofer <peter.prettenhofer@gmail.com>
          Mathieu Blondel (partial_fit support)
diff --git a/sklearn/linear_model/_stochastic_gradient.py b/sklearn/linear_model/_stochastic_gradient.py
index e0fad5d8be8b8..8c7bf6179de5b 100644
--- a/sklearn/linear_model/_stochastic_gradient.py
+++ b/sklearn/linear_model/_stochastic_gradient.py
@@ -1,7 +1,5 @@
-# Authors: Peter Prettenhofer <peter.prettenhofer@gmail.com> (main author)
-#          Mathieu Blondel (partial_fit support)
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 """Classification, regression and One-Class SVM using Stochastic Gradient
 Descent (SGD).
 """
@@ -22,7 +20,7 @@
 )
 from ..exceptions import ConvergenceWarning
 from ..model_selection import ShuffleSplit, StratifiedShuffleSplit
-from ..utils import check_random_state, compute_class_weight, deprecated
+from ..utils import check_random_state, compute_class_weight
 from ..utils._param_validation import Hidden, Interval, StrOptions
 from ..utils.extmath import safe_sparse_dot
 from ..utils.metaestimators import available_if
@@ -323,23 +321,13 @@ def _make_validation_score_cb(
             classes=classes,
         )
 
-    # TODO(1.6): Remove
-    # mypy error: Decorated property not supported
-    @deprecated(  # type: ignore
-        "Attribute `loss_function_` was deprecated in version 1.4 and will be removed "
-        "in 1.6."
-    )
-    @property
-    def loss_function_(self):
-        return self._loss_function_
-
 
-def _prepare_fit_binary(est, y, i, input_dtye):
+def _prepare_fit_binary(est, y, i, input_dtype):
     """Initialization for fit_binary.
 
     Returns y, coef, intercept, average_coef, average_intercept.
     """
-    y_i = np.ones(y.shape, dtype=input_dtye, order="C")
+    y_i = np.ones(y.shape, dtype=input_dtype, order="C")
     y_i[y != est.classes_[i]] = -1.0
     average_intercept = 0
     average_coef = None
@@ -434,7 +422,7 @@ def fit_binary(
     # if average is not true, average_coef, and average_intercept will be
     # unused
     y_i, coef, intercept, average_coef, average_intercept = _prepare_fit_binary(
-        est, y, i, input_dtye=X.dtype
+        est, y, i, input_dtype=X.dtype
     )
     assert y_i.shape[0] == y.shape[0] == sample_weight.shape[0]
 
@@ -1161,12 +1149,6 @@ class SGDClassifier(BaseSGDClassifier):
         The actual number of iterations before reaching the stopping criterion.
         For multiclass fits, it is the maximum over every binary fit.
 
-    loss_function_ : concrete ``LossFunction``
-
-        .. deprecated:: 1.4
-            Attribute `loss_function_` was deprecated in version 1.4 and will be
-            removed in 1.6.
-
     classes_ : array of shape (n_classes,)
 
     t_ : int
@@ -2188,12 +2170,6 @@ class SGDOneClassSVM(BaseSGD, OutlierMixin):
         Number of weight updates performed during training.
         Same as ``(n_iter_ * n_samples + 1)``.
 
-    loss_function_ : concrete ``LossFunction``
-
-        .. deprecated:: 1.4
-            ``loss_function_`` was deprecated in version 1.4 and will be removed in
-            1.6.
-
     n_features_in_ : int
         Number of features seen during :term:`fit`.
 
diff --git a/sklearn/linear_model/_theil_sen.py b/sklearn/linear_model/_theil_sen.py
index cc774e8783762..61ae234d1d3fa 100644
--- a/sklearn/linear_model/_theil_sen.py
+++ b/sklearn/linear_model/_theil_sen.py
@@ -2,9 +2,8 @@
 A Theil-Sen Estimator for Multiple Linear Regression Model
 """
 
-# Author: Florian Wilhelm <florian.wilhelm@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 import warnings
@@ -20,7 +19,7 @@
 from ..base import RegressorMixin, _fit_context
 from ..exceptions import ConvergenceWarning
 from ..utils import check_random_state
-from ..utils._param_validation import Interval
+from ..utils._param_validation import Hidden, Interval, StrOptions
 from ..utils.parallel import Parallel, delayed
 from ._base import LinearModel
 
@@ -228,6 +227,10 @@ class TheilSenRegressor(RegressorMixin, LinearModel):
     copy_X : bool, default=True
         If True, X will be copied; else, it may be overwritten.
 
+        .. deprecated:: 1.6
+            `copy_X` was deprecated in 1.6 and will be removed in 1.8.
+            It has no effect as a copy is always made.
+
     max_subpopulation : int, default=1e4
         Instead of computing with a set of cardinality 'n choose k', where n is
         the number of samples and k is the number of subsamples (at least
@@ -324,7 +327,7 @@ class TheilSenRegressor(RegressorMixin, LinearModel):
 
     _parameter_constraints: dict = {
         "fit_intercept": ["boolean"],
-        "copy_X": ["boolean"],
+        "copy_X": ["boolean", Hidden(StrOptions({"deprecated"}))],
         # target_type should be Integral but can accept Real for backward compatibility
         "max_subpopulation": [Interval(Real, 1, None, closed="left")],
         "n_subsamples": [None, Integral],
@@ -339,7 +342,7 @@ def __init__(
         self,
         *,
         fit_intercept=True,
-        copy_X=True,
+        copy_X="deprecated",
         max_subpopulation=1e4,
         n_subsamples=None,
         max_iter=300,
@@ -411,6 +414,14 @@ def fit(self, X, y):
         self : returns an instance of self.
             Fitted `TheilSenRegressor` estimator.
         """
+        if self.copy_X != "deprecated":
+            warnings.warn(
+                "`copy_X` was deprecated in 1.6 and will be removed in 1.8 since it "
+                "has no effect internally. Simply leave this parameter to its default "
+                "value to avoid this warning.",
+                FutureWarning,
+            )
+
         random_state = check_random_state(self.random_state)
         X, y = self._validate_data(X, y, y_numeric=True)
         n_samples, n_features = X.shape
diff --git a/sklearn/linear_model/meson.build b/sklearn/linear_model/meson.build
index 773cdf55bea73..e58b88f46c8f8 100644
--- a/sklearn/linear_model/meson.build
+++ b/sklearn/linear_model/meson.build
@@ -6,7 +6,7 @@ linear_model_cython_tree = [
 
 py.extension_module(
   '_cd_fast',
-  '_cd_fast.pyx',
+  ['_cd_fast.pyx', utils_cython_tree],
   cython_args: cython_args,
   subdir: 'sklearn/linear_model',
   install: true
@@ -19,11 +19,15 @@ foreach name: name_list
     name + '_pyx',
     output: name + '.pyx',
     input: name + '.pyx.tp',
-    command: [py, tempita, '@INPUT@', '-o', '@OUTDIR@']
+    command: [py, tempita, '@INPUT@', '-o', '@OUTDIR@'],
+    # TODO in principle this should go in py.exension_module below. This is
+    # temporary work-around for dependency issue with .pyx.tp files. For more
+    # details, see https://github.com/mesonbuild/meson/issues/13212
+    depends: [linear_model_cython_tree, utils_cython_tree],
   )
   py.extension_module(
     name,
-    [pyx, linear_model_cython_tree],
+    pyx,
     cython_args: cython_args,
     subdir: 'sklearn/linear_model',
     install: true
diff --git a/sklearn/linear_model/tests/test_base.py b/sklearn/linear_model/tests/test_base.py
index 7c9f734dcf5b5..05b7712113228 100644
--- a/sklearn/linear_model/tests/test_base.py
+++ b/sklearn/linear_model/tests/test_base.py
@@ -1,8 +1,5 @@
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#         Fabian Pedregosa <fabian.pedregosa@inria.fr>
-#         Maria Telenczuk <https://github.com/maikia>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 
diff --git a/sklearn/linear_model/tests/test_bayes.py b/sklearn/linear_model/tests/test_bayes.py
index a700a98dbbc45..6fae1536582c8 100644
--- a/sklearn/linear_model/tests/test_bayes.py
+++ b/sklearn/linear_model/tests/test_bayes.py
@@ -1,7 +1,5 @@
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#         Fabian Pedregosa <fabian.pedregosa@inria.fr>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from math import log
 
@@ -297,33 +295,3 @@ def test_dtype_correctness(Estimator):
     coef_32 = model.fit(X.astype(np.float32), y).coef_
     coef_64 = model.fit(X.astype(np.float64), y).coef_
     np.testing.assert_allclose(coef_32, coef_64, rtol=1e-4)
-
-
-# TODO(1.5) remove
-@pytest.mark.parametrize("Estimator", [BayesianRidge, ARDRegression])
-def test_bayesian_ridge_ard_n_iter_deprecated(Estimator):
-    """Check the deprecation warning of `n_iter`."""
-    depr_msg = (
-        "'n_iter' was renamed to 'max_iter' in version 1.3 and will be removed in 1.5"
-    )
-    X, y = diabetes.data, diabetes.target
-    model = Estimator(n_iter=5)
-
-    with pytest.warns(FutureWarning, match=depr_msg):
-        model.fit(X, y)
-
-
-# TODO(1.5) remove
-@pytest.mark.parametrize("Estimator", [BayesianRidge, ARDRegression])
-def test_bayesian_ridge_ard_max_iter_and_n_iter_both_set(Estimator):
-    """Check that a ValueError is raised when both `max_iter` and `n_iter` are set."""
-    err_msg = (
-        "Both `n_iter` and `max_iter` attributes were set. Attribute"
-        " `n_iter` was deprecated in version 1.3 and will be removed in"
-        " 1.5. To avoid this error, only set the `max_iter` attribute."
-    )
-    X, y = diabetes.data, diabetes.target
-    model = Estimator(n_iter=5, max_iter=5)
-
-    with pytest.raises(ValueError, match=err_msg):
-        model.fit(X, y)
diff --git a/sklearn/linear_model/tests/test_common.py b/sklearn/linear_model/tests/test_common.py
index ff9d7aad146f3..6aa7c737983ac 100644
--- a/sklearn/linear_model/tests/test_common.py
+++ b/sklearn/linear_model/tests/test_common.py
@@ -1,4 +1,4 @@
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import inspect
 
diff --git a/sklearn/linear_model/tests/test_coordinate_descent.py b/sklearn/linear_model/tests/test_coordinate_descent.py
index 7237c97020a7e..6e2b35a5590cb 100644
--- a/sklearn/linear_model/tests/test_coordinate_descent.py
+++ b/sklearn/linear_model/tests/test_coordinate_descent.py
@@ -1,6 +1,5 @@
-# Authors: Olivier Grisel <olivier.grisel@ensta.org>
-#          Alexandre Gramfort <alexandre.gramfort@inria.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from copy import deepcopy
@@ -94,13 +93,17 @@ def test_lasso_zero():
     # Check that the lasso can handle zero data without crashing
     X = [[0], [0], [0]]
     y = [0, 0, 0]
-    clf = Lasso(alpha=0.1).fit(X, y)
+    # _cd_fast.pyx tests for gap < tol, but here we get 0.0 < 0.0
+    # should probably be changed to gap <= tol ?
+    with ignore_warnings(category=ConvergenceWarning):
+        clf = Lasso(alpha=0.1).fit(X, y)
     pred = clf.predict([[1], [2], [3]])
     assert_array_almost_equal(clf.coef_, [0])
     assert_array_almost_equal(pred, [0, 0, 0])
     assert_almost_equal(clf.dual_gap_, 0)
 
 
+@pytest.mark.filterwarnings("ignore::sklearn.exceptions.ConvergenceWarning")
 def test_enet_nonfinite_params():
     # Check ElasticNet throws ValueError when dealing with non-finite parameter
     # values
@@ -358,6 +361,7 @@ def _scale_alpha_inplace(estimator, n_samples):
     estimator.set_params(alpha=alpha)
 
 
+@pytest.mark.filterwarnings("ignore::sklearn.exceptions.ConvergenceWarning")
 @pytest.mark.parametrize(
     "LinearModel, params",
     [
@@ -593,14 +597,16 @@ def test_uniform_targets():
     for model in models_single_task:
         for y_values in (0, 5):
             y1.fill(y_values)
-            assert_array_equal(model.fit(X_train, y1).predict(X_test), y1)
+            with ignore_warnings(category=ConvergenceWarning):
+                assert_array_equal(model.fit(X_train, y1).predict(X_test), y1)
             assert_array_equal(model.alphas_, [np.finfo(float).resolution] * 3)
 
     for model in models_multi_task:
         for y_values in (0, 5):
             y2[:, 0].fill(y_values)
             y2[:, 1].fill(2 * y_values)
-            assert_array_equal(model.fit(X_train, y2).predict(X_test), y2)
+            with ignore_warnings(category=ConvergenceWarning):
+                assert_array_equal(model.fit(X_train, y2).predict(X_test), y2)
             assert_array_equal(model.alphas_, [np.finfo(float).resolution] * 3)
 
 
@@ -686,7 +692,7 @@ def test_multitask_enet_and_lasso_cv():
 
     X, y, _, _ = build_dataset(n_targets=3)
     clf = MultiTaskElasticNetCV(
-        n_alphas=10, eps=1e-3, max_iter=100, l1_ratio=[0.3, 0.5], tol=1e-3, cv=3
+        n_alphas=10, eps=1e-3, max_iter=200, l1_ratio=[0.3, 0.5], tol=1e-3, cv=3
     )
     clf.fit(X, y)
     assert 0.5 == clf.l1_ratio_
@@ -696,7 +702,7 @@ def test_multitask_enet_and_lasso_cv():
     assert (2, 10) == clf.alphas_.shape
 
     X, y, _, _ = build_dataset(n_targets=3)
-    clf = MultiTaskLassoCV(n_alphas=10, eps=1e-3, max_iter=100, tol=1e-3, cv=3)
+    clf = MultiTaskLassoCV(n_alphas=10, eps=1e-3, max_iter=500, tol=1e-3, cv=3)
     clf.fit(X, y)
     assert (3, X.shape[1]) == clf.coef_.shape
     assert (3,) == clf.intercept_.shape
@@ -945,7 +951,8 @@ def test_check_input_false():
     # dtype is still cast in _preprocess_data to X's dtype. So the test should
     # pass anyway
     X = check_array(X, order="F", dtype="float32")
-    clf.fit(X, y, check_input=False)
+    with ignore_warnings(category=ConvergenceWarning):
+        clf.fit(X, y, check_input=False)
     # With no input checking, providing X in C order should result in false
     # computation
     X = check_array(X, order="C", dtype="float64")
@@ -1061,6 +1068,7 @@ def test_enet_float_precision():
             )
 
 
+@pytest.mark.filterwarnings("ignore::sklearn.exceptions.ConvergenceWarning")
 def test_enet_l1_ratio():
     # Test that an error message is raised if an estimator that
     # uses _alpha_grid is called with l1_ratio=0
@@ -1129,8 +1137,6 @@ def test_warm_start_multitask_lasso():
     [
         (Lasso, 1, dict(precompute=True)),
         (Lasso, 1, dict(precompute=False)),
-        (MultiTaskLasso, 2, dict()),
-        (MultiTaskLasso, 2, dict()),
     ],
 )
 def test_enet_coordinate_descent(klass, n_classes, kwargs):
@@ -1474,6 +1480,7 @@ def test_enet_sample_weight_does_not_overwrite_sample_weight(check_input):
     assert_array_equal(sample_weight, sample_weight_1_25)
 
 
+@pytest.mark.filterwarnings("ignore::sklearn.exceptions.ConvergenceWarning")
 @pytest.mark.parametrize("ridge_alpha", [1e-1, 1.0, 1e6])
 def test_enet_ridge_consistency(ridge_alpha):
     # Check that ElasticNet(l1_ratio=0) converges to the same solution as Ridge
diff --git a/sklearn/linear_model/tests/test_huber.py b/sklearn/linear_model/tests/test_huber.py
index 3856d74464f0b..9c0c7d213ee27 100644
--- a/sklearn/linear_model/tests/test_huber.py
+++ b/sklearn/linear_model/tests/test_huber.py
@@ -1,5 +1,5 @@
-# Authors: Manoj Kumar mks542@nyu.edu
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 import pytest
diff --git a/sklearn/linear_model/tests/test_logistic.py b/sklearn/linear_model/tests/test_logistic.py
index 30625ea9f2bef..f47b06a0cc4b1 100644
--- a/sklearn/linear_model/tests/test_logistic.py
+++ b/sklearn/linear_model/tests/test_logistic.py
@@ -35,6 +35,7 @@
     cross_val_score,
     train_test_split,
 )
+from sklearn.multiclass import OneVsRestClassifier
 from sklearn.preprocessing import LabelEncoder, StandardScaler, scale
 from sklearn.svm import l1_min_c
 from sklearn.utils import compute_class_weight, shuffle
@@ -144,14 +145,14 @@ def test_predict_3_classes(csr_container):
     check_predictions(LogisticRegression(C=10), csr_container(X), Y2)
 
 
+# TODO(1.7): remove filterwarnings after the deprecation of multi_class
+@pytest.mark.filterwarnings("ignore:.*'multi_class' was deprecated.*:FutureWarning")
 @pytest.mark.parametrize(
     "clf",
     [
         LogisticRegression(C=len(iris.data), solver="liblinear", multi_class="ovr"),
-        LogisticRegression(C=len(iris.data), solver="lbfgs", multi_class="multinomial"),
-        LogisticRegression(
-            C=len(iris.data), solver="newton-cg", multi_class="multinomial"
-        ),
+        LogisticRegression(C=len(iris.data), solver="lbfgs"),
+        LogisticRegression(C=len(iris.data), solver="newton-cg"),
         LogisticRegression(
             C=len(iris.data), solver="sag", tol=1e-2, multi_class="ovr", random_state=42
         ),
@@ -195,6 +196,8 @@ def test_predict_iris(clf):
     assert np.mean(pred == target) > 0.95
 
 
+# TODO(1.7): remove filterwarnings after the deprecation of multi_class
+@pytest.mark.filterwarnings("ignore:.*'multi_class' was deprecated.*:FutureWarning")
 @pytest.mark.parametrize("LR", [LogisticRegression, LogisticRegressionCV])
 def test_check_solver_option(LR):
     X, y = iris.data, iris.target
@@ -245,6 +248,8 @@ def test_elasticnet_l1_ratio_err_helpful(LR):
         model.fit(np.array([[1, 2], [3, 4]]), np.array([0, 1]))
 
 
+# TODO(1.7): remove whole test with deprecation of multi_class
+@pytest.mark.filterwarnings("ignore:.*'multi_class' was deprecated.*:FutureWarning")
 @pytest.mark.parametrize("solver", ["lbfgs", "newton-cg", "sag", "saga"])
 def test_multinomial_binary(solver):
     # Test multinomial LR on a binary problem.
@@ -268,6 +273,10 @@ def test_multinomial_binary(solver):
     assert np.mean(pred == target) > 0.9
 
 
+# TODO(1.7): remove filterwarnings after the deprecation of multi_class
+# Maybe even remove this whole test as correctness of multinomial loss is tested
+# elsewhere.
+@pytest.mark.filterwarnings("ignore:.*'multi_class' was deprecated.*:FutureWarning")
 def test_multinomial_binary_probabilities(global_random_seed):
     # Test multinomial LR gives expected probabilities based on the
     # decision function, for a binary problem.
@@ -373,7 +382,6 @@ def test_consistency_path():
             tol=1e-5,
             solver=solver,
             max_iter=1000,
-            multi_class="ovr",
             random_state=0,
         )
         for i, C in enumerate(Cs):
@@ -382,7 +390,6 @@ def test_consistency_path():
                 fit_intercept=False,
                 tol=1e-5,
                 solver=solver,
-                multi_class="ovr",
                 random_state=0,
                 max_iter=1000,
             )
@@ -403,14 +410,12 @@ def test_consistency_path():
             solver=solver,
             intercept_scaling=10000.0,
             random_state=0,
-            multi_class="ovr",
         )
         lr = LogisticRegression(
             C=Cs[0],
             tol=1e-6,
             intercept_scaling=10000.0,
             random_state=0,
-            multi_class="ovr",
             solver=solver,
         )
         lr.fit(X, y)
@@ -450,7 +455,6 @@ def test_liblinear_dual_random_state():
         dual=True,
         tol=1e-3,
         solver="liblinear",
-        multi_class="ovr",
     )
     lr1.fit(X, y)
     lr2 = LogisticRegression(
@@ -458,7 +462,6 @@ def test_liblinear_dual_random_state():
         dual=True,
         tol=1e-3,
         solver="liblinear",
-        multi_class="ovr",
     )
     lr2.fit(X, y)
     lr3 = LogisticRegression(
@@ -466,7 +469,6 @@ def test_liblinear_dual_random_state():
         dual=True,
         tol=1e-3,
         solver="liblinear",
-        multi_class="ovr",
     )
     lr3.fit(X, y)
 
@@ -487,12 +489,10 @@ def test_logistic_cv():
     X_ref -= X_ref.mean()
     X_ref /= X_ref.std()
     lr_cv = LogisticRegressionCV(
-        Cs=[1.0], fit_intercept=False, solver="liblinear", multi_class="ovr", cv=3
+        Cs=[1.0], fit_intercept=False, solver="liblinear", cv=3
     )
     lr_cv.fit(X_ref, y)
-    lr = LogisticRegression(
-        C=1.0, fit_intercept=False, solver="liblinear", multi_class="ovr"
-    )
+    lr = LogisticRegression(C=1.0, fit_intercept=False, solver="liblinear")
     lr.fit(X_ref, y)
     assert_array_almost_equal(lr.coef_, lr_cv.coef_)
 
@@ -530,7 +530,7 @@ def test_logistic_cv_multinomial_score(scoring, multiclass_agg_list):
         n_samples=100, random_state=0, n_classes=3, n_informative=6
     )
     train, test = np.arange(80), np.arange(80, 100)
-    lr = LogisticRegression(C=1.0, multi_class="multinomial")
+    lr = LogisticRegression(C=1.0)
     # we use lbfgs to support multinomial
     params = lr.get_params()
     # we store the params to set them further in _log_reg_scoring_path
@@ -551,7 +551,7 @@ def test_logistic_cv_multinomial_score(scoring, multiclass_agg_list):
                 max_squared_sum=None,
                 sample_weight=None,
                 score_params=None,
-                **params,
+                **(params | {"multi_class": "multinomial"}),
             )[2][0],
             scorer(lr, X[test], y[test]),
         )
@@ -571,10 +571,10 @@ def test_multinomial_logistic_regression_string_inputs():
     # For numerical labels, let y values be taken from set (-1, 0, 1)
     y = np.array(y) - 1
     # Test for string labels
-    lr = LogisticRegression(multi_class="multinomial")
-    lr_cv = LogisticRegressionCV(multi_class="multinomial", Cs=3)
-    lr_str = LogisticRegression(multi_class="multinomial")
-    lr_cv_str = LogisticRegressionCV(multi_class="multinomial", Cs=3)
+    lr = LogisticRegression()
+    lr_cv = LogisticRegressionCV(Cs=3)
+    lr_str = LogisticRegression()
+    lr_cv_str = LogisticRegressionCV(Cs=3)
 
     lr.fit(X_ref, y)
     lr_cv.fit(X_ref, y)
@@ -592,9 +592,9 @@ def test_multinomial_logistic_regression_string_inputs():
     assert sorted(np.unique(lr_cv_str.predict(X_ref))) == ["bar", "baz", "foo"]
 
     # Make sure class weights can be given with string labels
-    lr_cv_str = LogisticRegression(
-        class_weight={"bar": 1, "baz": 2, "foo": 0}, multi_class="multinomial"
-    ).fit(X_ref, y_str)
+    lr_cv_str = LogisticRegression(class_weight={"bar": 1, "baz": 2, "foo": 0}).fit(
+        X_ref, y_str
+    )
     assert sorted(np.unique(lr_cv_str.predict(X_ref))) == ["bar", "baz"]
 
 
@@ -613,6 +613,9 @@ def test_logistic_cv_sparse(csr_container):
     assert clfs.C_ == clf.C_
 
 
+# TODO(1.7): remove filterwarnings after the deprecation of multi_class
+# Best remove this whole test.
+@pytest.mark.filterwarnings("ignore:.*'multi_class' was deprecated.*:FutureWarning")
 def test_ovr_multinomial_iris():
     # Test that OvR and multinomial are correct using the iris dataset.
     train, target = iris.data, iris.target
@@ -655,7 +658,6 @@ def test_ovr_multinomial_iris():
         max_iter = 500 if solver in ["sag", "saga"] else 30
         clf_multi = LogisticRegressionCV(
             solver=solver,
-            multi_class="multinomial",
             max_iter=max_iter,
             random_state=42,
             tol=1e-3 if solver in ["sag", "saga"] else 1e-2,
@@ -684,7 +686,7 @@ def test_logistic_regression_solvers():
     """Test solvers converge to the same result."""
     X, y = make_classification(n_features=10, n_informative=5, random_state=0)
 
-    params = dict(fit_intercept=False, random_state=42, multi_class="ovr")
+    params = dict(fit_intercept=False, random_state=42)
 
     regressors = {
         solver: LogisticRegression(solver=solver, **params).fit(X, y)
@@ -702,18 +704,18 @@ def test_logistic_regression_solvers_multiclass():
     X, y = make_classification(
         n_samples=20, n_features=20, n_informative=10, n_classes=3, random_state=0
     )
-    tol = 1e-7
-    params = dict(fit_intercept=False, tol=tol, random_state=42, multi_class="ovr")
+    tol = 1e-8
+    params = dict(fit_intercept=False, tol=tol, random_state=42)
 
     # Override max iteration count for specific solvers to allow for
     # proper convergence.
-    solver_max_iter = {"sag": 1000, "saga": 10000}
+    solver_max_iter = {"sag": 10_000, "saga": 10_000}
 
     regressors = {
         solver: LogisticRegression(
             solver=solver, max_iter=solver_max_iter.get(solver, 100), **params
         ).fit(X, y)
-        for solver in SOLVERS
+        for solver in set(SOLVERS) - set(["liblinear", "newton-cholesky"])
     }
 
     for solver_1, solver_2 in itertools.combinations(regressors, r=2):
@@ -745,7 +747,6 @@ def test_logistic_regressioncv_class_weights(weight, class_weight, global_random
     params = dict(
         Cs=1,
         fit_intercept=False,
-        multi_class="ovr",
         class_weight=class_weight,
         tol=1e-8,
     )
@@ -761,7 +762,7 @@ def test_logistic_regressioncv_class_weights(weight, class_weight, global_random
     with ignore_warnings(category=ConvergenceWarning):
         clf_lbfgs.fit(X, y)
 
-    for solver in set(SOLVERS) - set(["lbfgs"]):
+    for solver in set(SOLVERS) - set(["lbfgs", "liblinear", "newton-cholesky"]):
         clf = LogisticRegressionCV(solver=solver, **params)
         if solver in ("sag", "saga"):
             clf.set_params(
@@ -781,7 +782,7 @@ def test_logistic_regression_sample_weights():
     sample_weight = y + 1
 
     for LR in [LogisticRegression, LogisticRegressionCV]:
-        kw = {"random_state": 42, "fit_intercept": False, "multi_class": "ovr"}
+        kw = {"random_state": 42, "fit_intercept": False}
         if LR is LogisticRegressionCV:
             kw.update({"Cs": 3, "cv": 3})
 
@@ -798,7 +799,7 @@ def test_logistic_regression_sample_weights():
         # newton-cg, newton-cholesky and 'sag' solvers
         clf_sw_lbfgs = LR(**kw, tol=1e-5)
         clf_sw_lbfgs.fit(X, y, sample_weight=sample_weight)
-        for solver in set(SOLVERS) - set(("lbfgs", "saga")):
+        for solver in set(SOLVERS) - set(["lbfgs"]):
             clf_sw = LR(solver=solver, tol=1e-10 if solver == "sag" else 1e-5, **kw)
             # ignore convergence warning due to small dataset with sag
             with ignore_warnings():
@@ -824,7 +825,6 @@ def test_logistic_regression_sample_weights():
         penalty="l1",
         tol=1e-5,
         random_state=42,
-        multi_class="ovr",
     )
     clf_cw.fit(X, y)
     clf_sw = LogisticRegression(
@@ -833,7 +833,6 @@ def test_logistic_regression_sample_weights():
         penalty="l1",
         tol=1e-5,
         random_state=42,
-        multi_class="ovr",
     )
     clf_sw.fit(X, y, sample_weight)
     assert_array_almost_equal(clf_cw.coef_, clf_sw.coef_, decimal=4)
@@ -845,7 +844,6 @@ def test_logistic_regression_sample_weights():
         penalty="l2",
         dual=True,
         random_state=42,
-        multi_class="ovr",
     )
     clf_cw.fit(X, y)
     clf_sw = LogisticRegression(
@@ -854,7 +852,6 @@ def test_logistic_regression_sample_weights():
         penalty="l2",
         dual=True,
         random_state=42,
-        multi_class="ovr",
     )
     clf_sw.fit(X, y, sample_weight)
     assert_array_almost_equal(clf_cw.coef_, clf_sw.coef_, decimal=4)
@@ -868,38 +865,40 @@ def _compute_class_weight_dictionary(y):
     return class_weight_dict
 
 
-def test_logistic_regression_class_weights():
+@pytest.mark.parametrize("csr_container", [lambda x: x] + CSR_CONTAINERS)
+def test_logistic_regression_class_weights(csr_container):
     # Scale data to avoid convergence warnings with the lbfgs solver
     X_iris = scale(iris.data)
     # Multinomial case: remove 90% of class 0
     X = X_iris[45:, :]
+    X = csr_container(X)
     y = iris.target[45:]
-    solvers = ("lbfgs", "newton-cg")
     class_weight_dict = _compute_class_weight_dictionary(y)
 
-    for solver in solvers:
-        clf1 = LogisticRegression(
-            solver=solver, multi_class="multinomial", class_weight="balanced"
-        )
-        clf2 = LogisticRegression(
-            solver=solver, multi_class="multinomial", class_weight=class_weight_dict
-        )
+    for solver in set(SOLVERS) - set(["liblinear", "newton-cholesky"]):
+        params = dict(solver=solver, max_iter=1000)
+        clf1 = LogisticRegression(class_weight="balanced", **params)
+        clf2 = LogisticRegression(class_weight=class_weight_dict, **params)
         clf1.fit(X, y)
         clf2.fit(X, y)
-        assert_array_almost_equal(clf1.coef_, clf2.coef_, decimal=4)
+        assert len(clf1.classes_) == 3
+        assert_allclose(clf1.coef_, clf2.coef_, rtol=1e-4)
+        # Same as appropriate sample_weight.
+        sw = np.ones(X.shape[0])
+        for c in clf1.classes_:
+            sw[y == c] *= class_weight_dict[c]
+        clf3 = LogisticRegression(**params).fit(X, y, sample_weight=sw)
+        assert_allclose(clf3.coef_, clf2.coef_, rtol=1e-4)
 
     # Binary case: remove 90% of class 0 and 100% of class 2
     X = X_iris[45:100, :]
     y = iris.target[45:100]
     class_weight_dict = _compute_class_weight_dictionary(y)
 
-    for solver in set(SOLVERS) - set(("sag", "saga")):
-        clf1 = LogisticRegression(
-            solver=solver, multi_class="ovr", class_weight="balanced"
-        )
-        clf2 = LogisticRegression(
-            solver=solver, multi_class="ovr", class_weight=class_weight_dict
-        )
+    for solver in SOLVERS:
+        params = dict(solver=solver, max_iter=1000)
+        clf1 = LogisticRegression(class_weight="balanced", **params)
+        clf2 = LogisticRegression(class_weight=class_weight_dict, **params)
         clf1.fit(X, y)
         clf2.fit(X, y)
         assert_array_almost_equal(clf1.coef_, clf2.coef_, decimal=6)
@@ -922,10 +921,8 @@ def test_logistic_regression_multinomial():
 
     # 'lbfgs' is used as a referenced
     solver = "lbfgs"
-    ref_i = LogisticRegression(solver=solver, multi_class="multinomial", tol=1e-6)
-    ref_w = LogisticRegression(
-        solver=solver, multi_class="multinomial", fit_intercept=False, tol=1e-6
-    )
+    ref_i = LogisticRegression(solver=solver, tol=1e-6)
+    ref_w = LogisticRegression(solver=solver, fit_intercept=False, tol=1e-6)
     ref_i.fit(X, y)
     ref_w.fit(X, y)
     assert ref_i.coef_.shape == (n_classes, n_features)
@@ -933,14 +930,12 @@ def test_logistic_regression_multinomial():
     for solver in ["sag", "saga", "newton-cg"]:
         clf_i = LogisticRegression(
             solver=solver,
-            multi_class="multinomial",
             random_state=42,
             max_iter=2000,
             tol=1e-7,
         )
         clf_w = LogisticRegression(
             solver=solver,
-            multi_class="multinomial",
             random_state=42,
             max_iter=2000,
             tol=1e-7,
@@ -961,7 +956,7 @@ def test_logistic_regression_multinomial():
     # folds, it need not be exactly the same.
     for solver in ["lbfgs", "newton-cg", "sag", "saga"]:
         clf_path = LogisticRegressionCV(
-            solver=solver, max_iter=2000, tol=1e-6, multi_class="multinomial", Cs=[1.0]
+            solver=solver, max_iter=2000, tol=1e-6, Cs=[1.0]
         )
         clf_path.fit(X, y)
         assert_allclose(clf_path.coef_, ref_i.coef_, rtol=1e-2)
@@ -975,7 +970,7 @@ def test_liblinear_decision_function_zero():
     # See Issue: https://github.com/scikit-learn/scikit-learn/issues/3600
     # and the PR https://github.com/scikit-learn/scikit-learn/pull/3623
     X, y = make_classification(n_samples=5, n_features=5, random_state=0)
-    clf = LogisticRegression(fit_intercept=False, solver="liblinear", multi_class="ovr")
+    clf = LogisticRegression(fit_intercept=False, solver="liblinear")
     clf.fit(X, y)
 
     # Dummy data such that the decision function becomes zero.
@@ -988,7 +983,7 @@ def test_liblinear_logregcv_sparse(csr_container):
     # Test LogRegCV with solver='liblinear' works for sparse matrices
 
     X, y = make_classification(n_samples=10, n_features=5, random_state=0)
-    clf = LogisticRegressionCV(solver="liblinear", multi_class="ovr")
+    clf = LogisticRegressionCV(solver="liblinear")
     clf.fit(csr_container(X), y)
 
 
@@ -1024,7 +1019,6 @@ def test_logreg_l1():
         C=1.0,
         solver="liblinear",
         fit_intercept=False,
-        multi_class="ovr",
         tol=1e-10,
     )
     lr_liblinear.fit(X, y)
@@ -1034,7 +1028,6 @@ def test_logreg_l1():
         C=1.0,
         solver="saga",
         fit_intercept=False,
-        multi_class="ovr",
         max_iter=1000,
         tol=1e-10,
     )
@@ -1066,7 +1059,6 @@ def test_logreg_l1_sparse_data(csr_container):
         C=1.0,
         solver="liblinear",
         fit_intercept=False,
-        multi_class="ovr",
         tol=1e-10,
     )
     lr_liblinear.fit(X, y)
@@ -1076,7 +1068,6 @@ def test_logreg_l1_sparse_data(csr_container):
         C=1.0,
         solver="saga",
         fit_intercept=False,
-        multi_class="ovr",
         max_iter=1000,
         tol=1e-10,
     )
@@ -1093,7 +1084,6 @@ def test_logreg_l1_sparse_data(csr_container):
         C=1.0,
         solver="saga",
         fit_intercept=False,
-        multi_class="ovr",
         max_iter=1000,
         tol=1e-10,
     )
@@ -1134,10 +1124,10 @@ def test_logreg_predict_proba_multinomial():
 
     # Predicted probabilities using the true-entropy loss should give a
     # smaller loss than those using the ovr method.
-    clf_multi = LogisticRegression(multi_class="multinomial", solver="lbfgs")
+    clf_multi = LogisticRegression(solver="lbfgs")
     clf_multi.fit(X, y)
     clf_multi_loss = log_loss(y, clf_multi.predict_proba(X))
-    clf_ovr = LogisticRegression(multi_class="ovr", solver="lbfgs")
+    clf_ovr = OneVsRestClassifier(LogisticRegression(solver="lbfgs"))
     clf_ovr.fit(X, y)
     clf_ovr_loss = log_loss(y, clf_ovr.predict_proba(X))
     assert clf_ovr_loss > clf_multi_loss
@@ -1149,6 +1139,8 @@ def test_logreg_predict_proba_multinomial():
     assert clf_wrong_loss > clf_multi_loss
 
 
+# TODO(1.7): remove filterwarnings after the deprecation of multi_class
+@pytest.mark.filterwarnings("ignore:.*'multi_class' was deprecated.*:FutureWarning")
 @pytest.mark.parametrize("max_iter", np.arange(1, 5))
 @pytest.mark.parametrize("multi_class", ["ovr", "multinomial"])
 @pytest.mark.parametrize(
@@ -1156,7 +1148,7 @@ def test_logreg_predict_proba_multinomial():
     [
         (
             "newton-cg",
-            "newton-cg failed to converge. Increase the number of iterations.",
+            "newton-cg failed to converge.* Increase the number of iterations.",
         ),
         (
             "liblinear",
@@ -1191,6 +1183,8 @@ def test_max_iter(max_iter, multi_class, solver, message):
     assert lr.n_iter_[0] == max_iter
 
 
+# TODO(1.7): remove filterwarnings after the deprecation of multi_class
+@pytest.mark.filterwarnings("ignore:.*'multi_class' was deprecated.*:FutureWarning")
 @pytest.mark.parametrize("solver", SOLVERS)
 def test_n_iter(solver):
     # Test that self.n_iter_ has the correct format.
@@ -1241,23 +1235,19 @@ def test_n_iter(solver):
     assert clf_cv.n_iter_.shape == (1, n_cv_fold, n_Cs)
 
 
-@pytest.mark.parametrize("solver", sorted(set(SOLVERS) - set(["liblinear"])))
+@pytest.mark.parametrize(
+    "solver", sorted(set(SOLVERS) - set(["liblinear", "newton-cholesky"]))
+)
 @pytest.mark.parametrize("warm_start", (True, False))
 @pytest.mark.parametrize("fit_intercept", (True, False))
-@pytest.mark.parametrize("multi_class", ["ovr", "multinomial"])
-def test_warm_start(solver, warm_start, fit_intercept, multi_class):
+def test_warm_start(solver, warm_start, fit_intercept):
     # A 1-iteration second fit on same data should give almost same result
     # with warm starting, and quite different result without warm starting.
     # Warm starting does not work with liblinear solver.
     X, y = iris.data, iris.target
 
-    if solver == "newton-cholesky" and multi_class == "multinomial":
-        # solver does only support OvR
-        return
-
     clf = LogisticRegression(
         tol=1e-4,
-        multi_class=multi_class,
         warm_start=warm_start,
         solver=solver,
         random_state=42,
@@ -1271,9 +1261,8 @@ def test_warm_start(solver, warm_start, fit_intercept, multi_class):
         clf.fit(X, y)
     cum_diff = np.sum(np.abs(coef_1 - clf.coef_))
     msg = (
-        "Warm starting issue with %s solver in %s mode "
-        "with fit_intercept=%s and warm_start=%s"
-        % (solver, multi_class, str(fit_intercept), str(warm_start))
+        f"Warm starting issue with solver {solver}"
+        f"with {fit_intercept=} and {warm_start=}"
     )
     if warm_start:
         assert 2.0 > cum_diff, msg
@@ -1304,7 +1293,6 @@ def test_saga_vs_liblinear(csr_container):
                 saga = LogisticRegression(
                     C=1.0 / (n_samples * alpha),
                     solver="saga",
-                    multi_class="ovr",
                     max_iter=200,
                     fit_intercept=False,
                     penalty=penalty,
@@ -1315,7 +1303,6 @@ def test_saga_vs_liblinear(csr_container):
                 liblinear = LogisticRegression(
                     C=1.0 / (n_samples * alpha),
                     solver="liblinear",
-                    multi_class="ovr",
                     max_iter=200,
                     fit_intercept=False,
                     penalty=penalty,
@@ -1329,6 +1316,8 @@ def test_saga_vs_liblinear(csr_container):
                 assert_array_almost_equal(saga.coef_, liblinear.coef_, 3)
 
 
+# TODO(1.7): remove filterwarnings after the deprecation of multi_class
+@pytest.mark.filterwarnings("ignore:.*'multi_class' was deprecated.*:FutureWarning")
 @pytest.mark.parametrize("multi_class", ["ovr", "multinomial"])
 @pytest.mark.parametrize(
     "solver", ["liblinear", "newton-cg", "newton-cholesky", "saga"]
@@ -1414,12 +1403,8 @@ def test_warm_start_converge_LR():
     rng = np.random.RandomState(0)
     X = np.concatenate((rng.randn(100, 2) + [1, 1], rng.randn(100, 2)))
     y = np.array([1] * 100 + [-1] * 100)
-    lr_no_ws = LogisticRegression(
-        multi_class="multinomial", solver="sag", warm_start=False, random_state=0
-    )
-    lr_ws = LogisticRegression(
-        multi_class="multinomial", solver="sag", warm_start=True, random_state=0
-    )
+    lr_no_ws = LogisticRegression(solver="sag", warm_start=False, random_state=0)
+    lr_ws = LogisticRegression(solver="sag", warm_start=True, random_state=0)
 
     lr_no_ws_loss = log_loss(y, lr_no_ws.fit(X, y).predict_proba(X))
     for i in range(5):
@@ -1552,19 +1537,14 @@ def enet_objective(lr):
     assert enet_objective(lr_enet) < enet_objective(lr_l2)
 
 
-@pytest.mark.parametrize("multi_class", ("ovr", "multinomial"))
-def test_LogisticRegressionCV_GridSearchCV_elastic_net(multi_class):
+@pytest.mark.parametrize("n_classes", (2, 3))
+def test_LogisticRegressionCV_GridSearchCV_elastic_net(n_classes):
     # make sure LogisticRegressionCV gives same best params (l1 and C) as
     # GridSearchCV when penalty is elasticnet
 
-    if multi_class == "ovr":
-        # This is actually binary classification, ovr multiclass is treated in
-        # test_LogisticRegressionCV_GridSearchCV_elastic_net_ovr
-        X, y = make_classification(random_state=0)
-    else:
-        X, y = make_classification(
-            n_samples=100, n_classes=3, n_informative=3, random_state=0
-        )
+    X, y = make_classification(
+        n_samples=100, n_classes=n_classes, n_informative=3, random_state=0
+    )
 
     cv = StratifiedKFold(5)
 
@@ -1578,7 +1558,6 @@ def test_LogisticRegressionCV_GridSearchCV_elastic_net(multi_class):
         cv=cv,
         l1_ratios=l1_ratios,
         random_state=0,
-        multi_class=multi_class,
         tol=1e-2,
     )
     lrcv.fit(X, y)
@@ -1588,7 +1567,6 @@ def test_LogisticRegressionCV_GridSearchCV_elastic_net(multi_class):
         penalty="elasticnet",
         solver="saga",
         random_state=0,
-        multi_class=multi_class,
         tol=1e-2,
     )
     gs = GridSearchCV(lr, param_grid, cv=cv)
@@ -1598,6 +1576,9 @@ def test_LogisticRegressionCV_GridSearchCV_elastic_net(multi_class):
     assert gs.best_params_["C"] == lrcv.C_[0]
 
 
+# TODO(1.7): remove filterwarnings after the deprecation of multi_class
+# Maybe remove whole test after removal of the deprecated multi_class.
+@pytest.mark.filterwarnings("ignore:.*'multi_class' was deprecated.*:FutureWarning")
 def test_LogisticRegressionCV_GridSearchCV_elastic_net_ovr():
     # make sure LogisticRegressionCV gives same best params (l1 and C) as
     # GridSearchCV when penalty is elasticnet and multiclass is ovr. We can't
@@ -1643,6 +1624,8 @@ def test_LogisticRegressionCV_GridSearchCV_elastic_net_ovr():
     assert (lrcv.predict(X_test) == gs.predict(X_test)).mean() >= 0.8
 
 
+# TODO(1.7): remove filterwarnings after the deprecation of multi_class
+@pytest.mark.filterwarnings("ignore:.*'multi_class' was deprecated.*:FutureWarning")
 @pytest.mark.parametrize("penalty", ("l2", "elasticnet"))
 @pytest.mark.parametrize("multi_class", ("ovr", "multinomial", "auto"))
 def test_LogisticRegressionCV_no_refit(penalty, multi_class):
@@ -1680,6 +1663,10 @@ def test_LogisticRegressionCV_no_refit(penalty, multi_class):
     assert lrcv.coef_.shape == (n_classes, n_features)
 
 
+# TODO(1.7): remove filterwarnings after the deprecation of multi_class
+# Remove multi_class an change first element of the expected n_iter_.shape from
+# n_classes to 1 (according to the docstring).
+@pytest.mark.filterwarnings("ignore:.*'multi_class' was deprecated.*:FutureWarning")
 def test_LogisticRegressionCV_elasticnet_attribute_shapes():
     # Make sure the shapes of scores_ and coefs_paths_ attributes are correct
     # when using elasticnet (added one dimension for l1_ratios)
@@ -1806,6 +1793,8 @@ def test_logistic_regression_path_coefs_multinomial():
         assert_array_almost_equal(coefs[1], coefs[2], decimal=1)
 
 
+# TODO(1.7): remove filterwarnings after the deprecation of multi_class
+@pytest.mark.filterwarnings("ignore:.*'multi_class' was deprecated.*:FutureWarning")
 @pytest.mark.parametrize(
     "est",
     [
@@ -2005,7 +1994,6 @@ def test_multinomial_identifiability_on_iris(fit_intercept):
     clf = LogisticRegression(
         C=len(iris.data),
         solver="lbfgs",
-        multi_class="multinomial",
         fit_intercept=fit_intercept,
     )
     # Scaling X to ease convergence.
@@ -2018,6 +2006,8 @@ def test_multinomial_identifiability_on_iris(fit_intercept):
         clf.intercept_.sum(axis=0) == pytest.approx(0, abs=1e-15)
 
 
+# TODO(1.7): remove filterwarnings after the deprecation of multi_class
+@pytest.mark.filterwarnings("ignore:.*'multi_class' was deprecated.*:FutureWarning")
 @pytest.mark.parametrize("multi_class", ["ovr", "multinomial", "auto"])
 @pytest.mark.parametrize("class_weight", [{0: 1.0, 1: 10.0, 2: 1.0}, "balanced"])
 def test_sample_weight_not_modified(multi_class, class_weight):
@@ -2192,3 +2182,28 @@ def test_passing_params_without_enabling_metadata_routing():
 
         with pytest.raises(ValueError, match=msg):
             lr_cv.score(X, y, **params)
+
+
+# TODO(1.7): remove
+def test_multi_class_deprecated():
+    """Check `multi_class` parameter deprecated."""
+    X, y = make_classification(n_classes=3, n_samples=50, n_informative=6)
+    lr = LogisticRegression(multi_class="ovr")
+    msg = "'multi_class' was deprecated"
+    with pytest.warns(FutureWarning, match=msg):
+        lr.fit(X, y)
+
+    lrCV = LogisticRegressionCV(multi_class="ovr")
+    with pytest.warns(FutureWarning, match=msg):
+        lrCV.fit(X, y)
+
+    # Special warning for "binary multinomial"
+    X, y = make_classification(n_classes=2, n_samples=50, n_informative=6)
+    lr = LogisticRegression(multi_class="multinomial")
+    msg = "'multi_class' was deprecated.*binary problems"
+    with pytest.warns(FutureWarning, match=msg):
+        lr.fit(X, y)
+
+    lrCV = LogisticRegressionCV(multi_class="multinomial")
+    with pytest.warns(FutureWarning, match=msg):
+        lrCV.fit(X, y)
diff --git a/sklearn/linear_model/tests/test_omp.py b/sklearn/linear_model/tests/test_omp.py
index 53b806a552a63..cfdffe581e034 100644
--- a/sklearn/linear_model/tests/test_omp.py
+++ b/sklearn/linear_model/tests/test_omp.py
@@ -1,5 +1,5 @@
-# Author: Vlad Niculae
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 import numpy as np
diff --git a/sklearn/linear_model/tests/test_quantile.py b/sklearn/linear_model/tests/test_quantile.py
index 53c1e1f071dcb..da96593de00f2 100644
--- a/sklearn/linear_model/tests/test_quantile.py
+++ b/sklearn/linear_model/tests/test_quantile.py
@@ -1,6 +1,5 @@
-# Authors: David Dale <dale.david@mail.ru>
-#          Christian Lorentzen <lorentzen.ch@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 import pytest
@@ -27,11 +26,6 @@ def X_y_data():
     return X, y
 
 
-@pytest.fixture
-def default_solver():
-    return "highs" if sp_version >= parse_version("1.6.0") else "interior-point"
-
-
 @pytest.mark.skipif(
     parse_version(sp_version.base_version) >= parse_version("1.11"),
     reason="interior-point solver is not available in SciPy 1.11",
@@ -48,18 +42,6 @@ def test_incompatible_solver_for_sparse_input(X_y_data, solver, csc_container):
         QuantileRegressor(solver=solver).fit(X_sparse, y)
 
 
-@pytest.mark.parametrize("solver", ("highs-ds", "highs-ipm", "highs"))
-@pytest.mark.skipif(
-    sp_version >= parse_version("1.6.0"),
-    reason="Solvers are available as of scipy 1.6.0",
-)
-def test_too_new_solver_methods_raise_error(X_y_data, solver):
-    """Test that highs solver raises for scipy<1.6.0."""
-    X, y = X_y_data
-    with pytest.raises(ValueError, match="scipy>=1.6.0"):
-        QuantileRegressor(solver=solver).fit(X, y)
-
-
 @pytest.mark.parametrize(
     "quantile, alpha, intercept, coef",
     [
@@ -75,13 +57,11 @@ def test_too_new_solver_methods_raise_error(X_y_data, solver):
         [0.5, 100, 2, 0],
     ],
 )
-def test_quantile_toy_example(quantile, alpha, intercept, coef, default_solver):
+def test_quantile_toy_example(quantile, alpha, intercept, coef):
     # test how different parameters affect a small intuitive example
     X = [[0], [1], [1]]
     y = [1, 2, 11]
-    model = QuantileRegressor(
-        quantile=quantile, alpha=alpha, solver=default_solver
-    ).fit(X, y)
+    model = QuantileRegressor(quantile=quantile, alpha=alpha).fit(X, y)
     assert_allclose(model.intercept_, intercept, atol=1e-2)
     if coef is not None:
         assert_allclose(model.coef_[0], coef, atol=1e-2)
@@ -91,15 +71,13 @@ def test_quantile_toy_example(quantile, alpha, intercept, coef, default_solver):
 
 
 @pytest.mark.parametrize("fit_intercept", [True, False])
-def test_quantile_equals_huber_for_low_epsilon(fit_intercept, default_solver):
+def test_quantile_equals_huber_for_low_epsilon(fit_intercept):
     X, y = make_regression(n_samples=100, n_features=20, random_state=0, noise=1.0)
     alpha = 1e-4
     huber = HuberRegressor(
         epsilon=1 + 1e-4, alpha=alpha, fit_intercept=fit_intercept
     ).fit(X, y)
-    quant = QuantileRegressor(
-        alpha=alpha, fit_intercept=fit_intercept, solver=default_solver
-    ).fit(X, y)
+    quant = QuantileRegressor(alpha=alpha, fit_intercept=fit_intercept).fit(X, y)
     assert_allclose(huber.coef_, quant.coef_, atol=1e-1)
     if fit_intercept:
         assert huber.intercept_ == approx(quant.intercept_, abs=1e-1)
@@ -108,18 +86,14 @@ def test_quantile_equals_huber_for_low_epsilon(fit_intercept, default_solver):
 
 
 @pytest.mark.parametrize("q", [0.5, 0.9, 0.05])
-def test_quantile_estimates_calibration(q, default_solver):
+def test_quantile_estimates_calibration(q):
     # Test that model estimates percentage of points below the prediction
     X, y = make_regression(n_samples=1000, n_features=20, random_state=0, noise=1.0)
-    quant = QuantileRegressor(
-        quantile=q,
-        alpha=0,
-        solver=default_solver,
-    ).fit(X, y)
+    quant = QuantileRegressor(quantile=q, alpha=0).fit(X, y)
     assert np.mean(y < quant.predict(X)) == approx(q, abs=1e-2)
 
 
-def test_quantile_sample_weight(default_solver):
+def test_quantile_sample_weight():
     # test that with unequal sample weights we still estimate weighted fraction
     n = 1000
     X, y = make_regression(n_samples=n, n_features=5, random_state=0, noise=10.0)
@@ -127,7 +101,7 @@ def test_quantile_sample_weight(default_solver):
     # when we increase weight of upper observations,
     # estimate of quantile should go up
     weight[y > y.mean()] = 100
-    quant = QuantileRegressor(quantile=0.5, alpha=1e-8, solver=default_solver)
+    quant = QuantileRegressor(quantile=0.5, alpha=1e-8)
     quant.fit(X, y, sample_weight=weight)
     fraction_below = np.mean(y < quant.predict(X))
     assert fraction_below > 0.5
@@ -135,12 +109,8 @@ def test_quantile_sample_weight(default_solver):
     assert weighted_fraction_below == approx(0.5, abs=3e-2)
 
 
-@pytest.mark.skipif(
-    sp_version < parse_version("1.6.0"),
-    reason="The `highs` solver is available from the 1.6.0 scipy version",
-)
 @pytest.mark.parametrize("quantile", [0.2, 0.5, 0.8])
-def test_asymmetric_error(quantile, default_solver):
+def test_asymmetric_error(quantile):
     """Test quantile regression for asymmetric distributed targets."""
     n_samples = 1000
     rng = np.random.RandomState(42)
@@ -165,7 +135,6 @@ def test_asymmetric_error(quantile, default_solver):
     model = QuantileRegressor(
         quantile=quantile,
         alpha=0,
-        solver=default_solver,
     ).fit(X, y)
     # This test can be made to pass with any solver but in the interest
     # of sparing continuous integration resources, the test is performed
@@ -200,7 +169,7 @@ def func(coef):
 
 
 @pytest.mark.parametrize("quantile", [0.2, 0.5, 0.8])
-def test_equivariance(quantile, default_solver):
+def test_equivariance(quantile):
     """Test equivariace of quantile regression.
 
     See Koenker (2005) Quantile Regression, Chapter 2.2.3.
@@ -217,7 +186,7 @@ def test_equivariance(quantile, default_solver):
     )
     # make y asymmetric
     y += rng.exponential(scale=100, size=y.shape)
-    params = dict(alpha=0, solver=default_solver)
+    params = dict(alpha=0)
     model1 = QuantileRegressor(quantile=quantile, **params).fit(X, y)
 
     # coef(q; a*y, X) = a * coef(q; y, X)
@@ -265,23 +234,17 @@ def test_linprog_failure():
 
 
 @skip_if_32bit
-@pytest.mark.skipif(
-    sp_version <= parse_version("1.6.0"),
-    reason="Solvers are available as of scipy 1.6.0",
-)
 @pytest.mark.parametrize(
     "sparse_container", CSC_CONTAINERS + CSR_CONTAINERS + COO_CONTAINERS
 )
 @pytest.mark.parametrize("solver", ["highs", "highs-ds", "highs-ipm"])
 @pytest.mark.parametrize("fit_intercept", [True, False])
-def test_sparse_input(sparse_container, solver, fit_intercept, default_solver):
+def test_sparse_input(sparse_container, solver, fit_intercept):
     """Test that sparse and dense X give same results."""
     X, y = make_regression(n_samples=100, n_features=20, random_state=1, noise=1.0)
     X_sparse = sparse_container(X)
     alpha = 1e-4
-    quant_dense = QuantileRegressor(
-        alpha=alpha, fit_intercept=fit_intercept, solver=default_solver
-    ).fit(X, y)
+    quant_dense = QuantileRegressor(alpha=alpha, fit_intercept=fit_intercept).fit(X, y)
     quant_sparse = QuantileRegressor(
         alpha=alpha, fit_intercept=fit_intercept, solver=solver
     ).fit(X_sparse, y)
diff --git a/sklearn/linear_model/tests/test_ridge.py b/sklearn/linear_model/tests/test_ridge.py
index 3a015defd59b1..167ce0bac4cba 100644
--- a/sklearn/linear_model/tests/test_ridge.py
+++ b/sklearn/linear_model/tests/test_ridge.py
@@ -5,7 +5,8 @@
 import pytest
 from scipy import linalg
 
-from sklearn import datasets
+from sklearn import config_context, datasets
+from sklearn.base import clone
 from sklearn.datasets import (
     make_classification,
     make_low_rank_matrix,
@@ -40,6 +41,13 @@
 )
 from sklearn.preprocessing import minmax_scale
 from sklearn.utils import check_random_state
+from sklearn.utils._array_api import (
+    _NUMPY_NAMESPACE_NAMES,
+    _atol_for_type,
+    _convert_to_numpy,
+    yield_namespace_device_dtype_combinations,
+    yield_namespaces,
+)
 from sklearn.utils._testing import (
     assert_allclose,
     assert_almost_equal,
@@ -47,6 +55,11 @@
     assert_array_equal,
     ignore_warnings,
 )
+from sklearn.utils.estimator_checks import (
+    _array_api_for_tests,
+    _get_check_estimator_ids,
+    check_array_api_input_and_values,
+)
 from sklearn.utils.fixes import (
     _IS_32BIT,
     COO_CONTAINERS,
@@ -194,6 +207,8 @@ def test_ridge_regression(solver, fit_intercept, ols_ridge_dataset, global_rando
     assert_allclose(model.coef_, coef)
     assert model.score(X, y) == pytest.approx(R2_Ridge)
 
+    assert model.solver_ == solver
+
 
 @pytest.mark.parametrize("solver", SOLVERS)
 @pytest.mark.parametrize("fit_intercept", [True, False])
@@ -905,15 +920,15 @@ def test_ridge_gcv_sample_weights(
     X_gcv = X_container(X)
     gcv_ridge = RidgeCV(
         alphas=alphas,
-        store_cv_values=True,
+        store_cv_results=True,
         gcv_mode=gcv_mode,
         fit_intercept=fit_intercept,
     )
     gcv_ridge.fit(X_gcv, y, sample_weight=sample_weight)
     if len(y_shape) == 2:
-        gcv_errors = gcv_ridge.cv_values_[:, :, alphas.index(kfold.alpha_)]
+        gcv_errors = gcv_ridge.cv_results_[:, :, alphas.index(kfold.alpha_)]
     else:
-        gcv_errors = gcv_ridge.cv_values_[:, alphas.index(kfold.alpha_)]
+        gcv_errors = gcv_ridge.cv_results_[:, alphas.index(kfold.alpha_)]
 
     assert kfold.alpha_ == pytest.approx(gcv_ridge.alpha_)
     assert_allclose(gcv_errors, kfold_errors, rtol=1e-3)
@@ -1019,15 +1034,15 @@ def _test_ridge_cv(sparse_container):
 @pytest.mark.parametrize(
     "ridge, make_dataset",
     [
-        (RidgeCV(store_cv_values=False), make_regression),
-        (RidgeClassifierCV(store_cv_values=False), make_classification),
+        (RidgeCV(store_cv_results=False), make_regression),
+        (RidgeClassifierCV(store_cv_results=False), make_classification),
     ],
 )
-def test_ridge_gcv_cv_values_not_stored(ridge, make_dataset):
-    # Check that `cv_values_` is not stored when store_cv_values is False
+def test_ridge_gcv_cv_results_not_stored(ridge, make_dataset):
+    # Check that `cv_results_` is not stored when store_cv_results is False
     X, y = make_dataset(n_samples=6, random_state=42)
     ridge.fit(X, y)
-    assert not hasattr(ridge, "cv_values_")
+    assert not hasattr(ridge, "cv_results_")
 
 
 @pytest.mark.parametrize(
@@ -1038,7 +1053,7 @@ def test_ridge_gcv_cv_values_not_stored(ridge, make_dataset):
 def test_ridge_best_score(ridge, make_dataset, cv):
     # check that the best_score_ is store
     X, y = make_dataset(n_samples=6, random_state=42)
-    ridge.set_params(store_cv_values=False, cv=cv)
+    ridge.set_params(store_cv_results=False, cv=cv)
     ridge.fit(X, y)
     assert hasattr(ridge, "best_score_")
     assert isinstance(ridge.best_score_, float)
@@ -1075,27 +1090,27 @@ def test_ridge_cv_individual_penalties():
         Ridge(alpha=ridge_cv.alpha_).fit(X, y).coef_, ridge_cv.coef_
     )
 
-    # Test shape of alpha_ and cv_values_
-    ridge_cv = RidgeCV(alphas=alphas, alpha_per_target=True, store_cv_values=True).fit(
+    # Test shape of alpha_ and cv_results_
+    ridge_cv = RidgeCV(alphas=alphas, alpha_per_target=True, store_cv_results=True).fit(
         X, y
     )
     assert ridge_cv.alpha_.shape == (n_targets,)
     assert ridge_cv.best_score_.shape == (n_targets,)
-    assert ridge_cv.cv_values_.shape == (n_samples, len(alphas), n_targets)
+    assert ridge_cv.cv_results_.shape == (n_samples, len(alphas), n_targets)
 
     # Test edge case of there being only one alpha value
-    ridge_cv = RidgeCV(alphas=1, alpha_per_target=True, store_cv_values=True).fit(X, y)
+    ridge_cv = RidgeCV(alphas=1, alpha_per_target=True, store_cv_results=True).fit(X, y)
     assert ridge_cv.alpha_.shape == (n_targets,)
     assert ridge_cv.best_score_.shape == (n_targets,)
-    assert ridge_cv.cv_values_.shape == (n_samples, n_targets, 1)
+    assert ridge_cv.cv_results_.shape == (n_samples, n_targets, 1)
 
     # Test edge case of there being only one target
-    ridge_cv = RidgeCV(alphas=alphas, alpha_per_target=True, store_cv_values=True).fit(
+    ridge_cv = RidgeCV(alphas=alphas, alpha_per_target=True, store_cv_results=True).fit(
         X, y[:, 0]
     )
     assert np.isscalar(ridge_cv.alpha_)
     assert np.isscalar(ridge_cv.best_score_)
-    assert ridge_cv.cv_values_.shape == (n_samples, len(alphas))
+    assert ridge_cv.cv_results_.shape == (n_samples, len(alphas))
 
     # Try with a custom scoring function
     ridge_cv = RidgeCV(alphas=alphas, alpha_per_target=True, scoring="r2").fit(X, y)
@@ -1201,6 +1216,130 @@ def _test_tolerance(sparse_container):
     assert score >= score2
 
 
+def check_array_api_attributes(name, estimator, array_namespace, device, dtype_name):
+    xp = _array_api_for_tests(array_namespace, device)
+
+    X_iris_np = X_iris.astype(dtype_name)
+    y_iris_np = y_iris.astype(dtype_name)
+
+    X_iris_xp = xp.asarray(X_iris_np, device=device)
+    y_iris_xp = xp.asarray(y_iris_np, device=device)
+
+    estimator.fit(X_iris_np, y_iris_np)
+    coef_np = estimator.coef_
+    intercept_np = estimator.intercept_
+
+    with config_context(array_api_dispatch=True):
+        estimator_xp = clone(estimator).fit(X_iris_xp, y_iris_xp)
+        coef_xp = estimator_xp.coef_
+        assert coef_xp.shape == (4,)
+        assert coef_xp.dtype == X_iris_xp.dtype
+
+        assert_allclose(
+            _convert_to_numpy(coef_xp, xp=xp),
+            coef_np,
+            atol=_atol_for_type(dtype_name),
+        )
+        intercept_xp = estimator_xp.intercept_
+        assert intercept_xp.shape == ()
+        assert intercept_xp.dtype == X_iris_xp.dtype
+
+        assert_allclose(
+            _convert_to_numpy(intercept_xp, xp=xp),
+            intercept_np,
+            atol=_atol_for_type(dtype_name),
+        )
+
+
+@pytest.mark.parametrize(
+    "array_namespace, device, dtype_name", yield_namespace_device_dtype_combinations()
+)
+@pytest.mark.parametrize(
+    "check",
+    [check_array_api_input_and_values, check_array_api_attributes],
+    ids=_get_check_estimator_ids,
+)
+@pytest.mark.parametrize(
+    "estimator",
+    [Ridge(solver="svd")],
+    ids=_get_check_estimator_ids,
+)
+def test_ridge_array_api_compliance(
+    estimator, check, array_namespace, device, dtype_name
+):
+    name = estimator.__class__.__name__
+    check(name, estimator, array_namespace, device=device, dtype_name=dtype_name)
+
+
+@pytest.mark.parametrize(
+    "array_namespace", yield_namespaces(include_numpy_namespaces=False)
+)
+def test_array_api_error_and_warnings_for_solver_parameter(array_namespace):
+    xp = _array_api_for_tests(array_namespace, device=None)
+
+    X_iris_xp = xp.asarray(X_iris[:5])
+    y_iris_xp = xp.asarray(y_iris[:5])
+
+    available_solvers = Ridge._parameter_constraints["solver"][0].options
+    for solver in available_solvers - {"auto", "svd"}:
+        ridge = Ridge(solver=solver, positive=solver == "lbfgs")
+        expected_msg = (
+            f"Array API dispatch to namespace {xp.__name__} only supports "
+            f"solver 'svd'. Got '{solver}'."
+        )
+
+        with pytest.raises(ValueError, match=expected_msg):
+            with config_context(array_api_dispatch=True):
+                ridge.fit(X_iris_xp, y_iris_xp)
+
+    ridge = Ridge(solver="auto", positive=True)
+    expected_msg = (
+        "The solvers that support positive fitting do not support "
+        f"Array API dispatch to namespace {xp.__name__}. Please "
+        "either disable Array API dispatch, or use a numpy-like "
+        "namespace, or set `positive=False`."
+    )
+
+    with pytest.raises(ValueError, match=expected_msg):
+        with config_context(array_api_dispatch=True):
+            ridge.fit(X_iris_xp, y_iris_xp)
+
+    ridge = Ridge()
+    expected_msg = (
+        f"Using Array API dispatch to namespace {xp.__name__} with `solver='auto'` "
+        "will result in using the solver 'svd'. The results may differ from those "
+        "when using a Numpy array, because in that case the preferred solver would "
+        "be cholesky. Set `solver='svd'` to suppress this warning."
+    )
+    with pytest.warns(UserWarning, match=expected_msg):
+        with config_context(array_api_dispatch=True):
+            ridge.fit(X_iris_xp, y_iris_xp)
+
+
+@pytest.mark.parametrize("array_namespace", sorted(_NUMPY_NAMESPACE_NAMES))
+def test_array_api_numpy_namespace_no_warning(array_namespace):
+    xp = _array_api_for_tests(array_namespace, device=None)
+
+    X_iris_xp = xp.asarray(X_iris[:5])
+    y_iris_xp = xp.asarray(y_iris[:5])
+
+    ridge = Ridge()
+    expected_msg = (
+        "Results might be different than when Array API dispatch is "
+        "disabled, or when a numpy-like namespace is used"
+    )
+
+    with warnings.catch_warnings():
+        warnings.filterwarnings("error", message=expected_msg, category=UserWarning)
+        with config_context(array_api_dispatch=True):
+            ridge.fit(X_iris_xp, y_iris_xp)
+
+    # All numpy namespaces are compatible with all solver, in particular
+    # solvers that support `positive=True` (like 'lbfgs') should work.
+    with config_context(array_api_dispatch=True):
+        Ridge(solver="auto", positive=True).fit(X_iris_xp, y_iris_xp)
+
+
 @pytest.mark.parametrize(
     "test_func",
     (
@@ -1305,7 +1444,7 @@ def test_class_weights_cv():
 @pytest.mark.parametrize(
     "scoring", [None, "neg_mean_squared_error", _mean_squared_error_callable]
 )
-def test_ridgecv_store_cv_values(scoring):
+def test_ridgecv_store_cv_results(scoring):
     rng = np.random.RandomState(42)
 
     n_samples = 8
@@ -1316,26 +1455,26 @@ def test_ridgecv_store_cv_values(scoring):
 
     scoring_ = make_scorer(scoring) if callable(scoring) else scoring
 
-    r = RidgeCV(alphas=alphas, cv=None, store_cv_values=True, scoring=scoring_)
+    r = RidgeCV(alphas=alphas, cv=None, store_cv_results=True, scoring=scoring_)
 
     # with len(y.shape) == 1
     y = rng.randn(n_samples)
     r.fit(x, y)
-    assert r.cv_values_.shape == (n_samples, n_alphas)
+    assert r.cv_results_.shape == (n_samples, n_alphas)
 
     # with len(y.shape) == 2
     n_targets = 3
     y = rng.randn(n_samples, n_targets)
     r.fit(x, y)
-    assert r.cv_values_.shape == (n_samples, n_targets, n_alphas)
+    assert r.cv_results_.shape == (n_samples, n_targets, n_alphas)
 
-    r = RidgeCV(cv=3, store_cv_values=True, scoring=scoring)
-    with pytest.raises(ValueError, match="cv!=None and store_cv_values"):
+    r = RidgeCV(cv=3, store_cv_results=True, scoring=scoring)
+    with pytest.raises(ValueError, match="cv!=None and store_cv_results"):
         r.fit(x, y)
 
 
 @pytest.mark.parametrize("scoring", [None, "accuracy", _accuracy_callable])
-def test_ridge_classifier_cv_store_cv_values(scoring):
+def test_ridge_classifier_cv_store_cv_results(scoring):
     x = np.array([[-1.0, -1.0], [-1.0, 0], [-0.8, -1.0], [1.0, 1.0], [1.0, 0.0]])
     y = np.array([1, 1, 1, -1, -1])
 
@@ -1346,13 +1485,13 @@ def test_ridge_classifier_cv_store_cv_values(scoring):
     scoring_ = make_scorer(scoring) if callable(scoring) else scoring
 
     r = RidgeClassifierCV(
-        alphas=alphas, cv=None, store_cv_values=True, scoring=scoring_
+        alphas=alphas, cv=None, store_cv_results=True, scoring=scoring_
     )
 
     # with len(y.shape) == 1
     n_targets = 1
     r.fit(x, y)
-    assert r.cv_values_.shape == (n_samples, n_targets, n_alphas)
+    assert r.cv_results_.shape == (n_samples, n_targets, n_alphas)
 
     # with len(y.shape) == 2
     y = np.array(
@@ -1360,7 +1499,7 @@ def test_ridge_classifier_cv_store_cv_values(scoring):
     ).transpose()
     n_targets = y.shape[1]
     r.fit(x, y)
-    assert r.cv_values_.shape == (n_samples, n_targets, n_alphas)
+    assert r.cv_results_.shape == (n_samples, n_targets, n_alphas)
 
 
 @pytest.mark.parametrize("Estimator", [RidgeCV, RidgeClassifierCV])
@@ -2085,3 +2224,46 @@ def test_ridge_sample_weight_consistency(
     assert_allclose(reg1.coef_, reg2.coef_)
     if fit_intercept:
         assert_allclose(reg1.intercept_, reg2.intercept_)
+
+
+# TODO(1.7): Remove
+def test_ridge_store_cv_values_deprecated():
+    """Check `store_cv_values` parameter deprecated."""
+    X, y = make_regression(n_samples=6, random_state=42)
+    ridge = RidgeCV(store_cv_values=True)
+    msg = "'store_cv_values' is deprecated"
+    with pytest.warns(FutureWarning, match=msg):
+        ridge.fit(X, y)
+
+    # Error when both set
+    ridge = RidgeCV(store_cv_results=True, store_cv_values=True)
+    msg = "Both 'store_cv_values' and 'store_cv_results' were"
+    with pytest.raises(ValueError, match=msg):
+        ridge.fit(X, y)
+
+
+def test_ridge_cv_values_deprecated():
+    """Check `cv_values_` deprecated."""
+    X, y = make_regression(n_samples=6, random_state=42)
+    ridge = RidgeCV(store_cv_results=True)
+    msg = "Attribute `cv_values_` is deprecated"
+    with pytest.warns(FutureWarning, match=msg):
+        ridge.fit(X, y)
+        ridge.cv_values_
+
+
+# Metadata Routing Tests
+# ======================
+
+
+@pytest.mark.usefixtures("enable_slep006")
+@pytest.mark.parametrize("metaestimator", [RidgeCV, RidgeClassifierCV])
+def test_metadata_routing_with_default_scoring(metaestimator):
+    """Test that `RidgeCV` or `RidgeClassifierCV` with default `scoring`
+    argument (`None`), don't enter into `RecursionError` when metadata is routed.
+    """
+    metaestimator().get_metadata_routing()
+
+
+# End of Metadata Routing Tests
+# =============================
diff --git a/sklearn/linear_model/tests/test_sag.py b/sklearn/linear_model/tests/test_sag.py
index 96f8a79726833..1690dbce78104 100644
--- a/sklearn/linear_model/tests/test_sag.py
+++ b/sklearn/linear_model/tests/test_sag.py
@@ -1,7 +1,5 @@
-# Authors: Danny Sullivan <dbsullivan23@gmail.com>
-#          Tom Dupre la Tour <tom.dupre-la-tour@m4x.org>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import math
 import re
@@ -18,6 +16,7 @@
 from sklearn.linear_model._linear_loss import LinearModelLoss
 from sklearn.linear_model._sag import get_auto_step_size
 from sklearn.linear_model._sag_fast import _multinomial_grad_loss_all_samples
+from sklearn.multiclass import OneVsRestClassifier
 from sklearn.preprocessing import LabelBinarizer, LabelEncoder
 from sklearn.utils import check_random_state, compute_class_weight
 from sklearn.utils._testing import (
@@ -272,7 +271,6 @@ def test_classifier_matching():
             C=1.0 / alpha / n_samples,
             max_iter=n_iter,
             random_state=10,
-            multi_class="ovr",
         )
         clf.fit(X, y)
 
@@ -371,7 +369,6 @@ def test_sag_pobj_matches_logistic_regression(csr_container):
         C=1.0 / alpha / n_samples,
         max_iter=max_iter,
         random_state=10,
-        multi_class="ovr",
     )
     clf2 = clone(clf1)
     clf3 = LogisticRegression(
@@ -380,7 +377,6 @@ def test_sag_pobj_matches_logistic_regression(csr_container):
         C=1.0 / alpha / n_samples,
         max_iter=max_iter,
         random_state=10,
-        multi_class="ovr",
     )
 
     clf1.fit(X, y)
@@ -619,7 +615,6 @@ def test_sag_classifier_computed_correctly(csr_container):
         tol=tol,
         random_state=77,
         fit_intercept=fit_intercept,
-        multi_class="ovr",
     )
     clf2 = clone(clf1)
 
@@ -659,21 +654,22 @@ def test_sag_multiclass_computed_correctly(csr_container):
     """tests if the multiclass classifier is computed correctly"""
     alpha = 0.1
     n_samples = 20
-    tol = 0.00001
-    max_iter = 40
+    tol = 1e-5
+    max_iter = 70
     fit_intercept = True
     X, y = make_blobs(n_samples=n_samples, centers=3, random_state=0, cluster_std=0.1)
     step_size = get_step_size(X, alpha, fit_intercept, classification=True)
     classes = np.unique(y)
 
-    clf1 = LogisticRegression(
-        solver="sag",
-        C=1.0 / alpha / n_samples,
-        max_iter=max_iter,
-        tol=tol,
-        random_state=77,
-        fit_intercept=fit_intercept,
-        multi_class="ovr",
+    clf1 = OneVsRestClassifier(
+        LogisticRegression(
+            solver="sag",
+            C=1.0 / alpha / n_samples,
+            max_iter=max_iter,
+            tol=tol,
+            random_state=77,
+            fit_intercept=fit_intercept,
+        )
     )
     clf2 = clone(clf1)
 
@@ -719,11 +715,12 @@ def test_sag_multiclass_computed_correctly(csr_container):
     intercept2 = np.array(intercept2)
 
     for i, cl in enumerate(classes):
-        assert_array_almost_equal(clf1.coef_[i].ravel(), coef1[i].ravel(), decimal=2)
-        assert_almost_equal(clf1.intercept_[i], intercept1[i], decimal=1)
+        assert_allclose(clf1.estimators_[i].coef_.ravel(), coef1[i], rtol=1e-2)
+        assert_allclose(clf1.estimators_[i].intercept_, intercept1[i], rtol=1e-1)
 
-        assert_array_almost_equal(clf2.coef_[i].ravel(), coef2[i].ravel(), decimal=2)
-        assert_almost_equal(clf2.intercept_[i], intercept2[i], decimal=1)
+        assert_allclose(clf2.estimators_[i].coef_.ravel(), coef2[i], rtol=1e-2)
+        # Note the very crude accuracy, i.e. high rtol.
+        assert_allclose(clf2.estimators_[i].intercept_, intercept2[i], rtol=5e-1)
 
 
 @pytest.mark.parametrize("csr_container", CSR_CONTAINERS)
@@ -780,7 +777,6 @@ def test_binary_classifier_class_weight(csr_container):
         tol=tol,
         random_state=77,
         fit_intercept=fit_intercept,
-        multi_class="ovr",
         class_weight=class_weight,
     )
     clf2 = clone(clf1)
@@ -820,83 +816,6 @@ def test_binary_classifier_class_weight(csr_container):
     assert_almost_equal(clf2.intercept_, spintercept2, decimal=1)
 
 
-@pytest.mark.filterwarnings("ignore:The max_iter was reached")
-@pytest.mark.parametrize("csr_container", CSR_CONTAINERS)
-def test_multiclass_classifier_class_weight(csr_container):
-    """tests multiclass with classweights for each class"""
-    alpha = 0.1
-    n_samples = 20
-    tol = 0.00001
-    max_iter = 50
-    class_weight = {0: 0.45, 1: 0.55, 2: 0.75}
-    fit_intercept = True
-    X, y = make_blobs(n_samples=n_samples, centers=3, random_state=0, cluster_std=0.1)
-    step_size = get_step_size(X, alpha, fit_intercept, classification=True)
-    classes = np.unique(y)
-
-    clf1 = LogisticRegression(
-        solver="sag",
-        C=1.0 / alpha / n_samples,
-        max_iter=max_iter,
-        tol=tol,
-        random_state=77,
-        fit_intercept=fit_intercept,
-        multi_class="ovr",
-        class_weight=class_weight,
-    )
-    clf2 = clone(clf1)
-    clf1.fit(X, y)
-    clf2.fit(csr_container(X), y)
-
-    le = LabelEncoder()
-    class_weight_ = compute_class_weight(class_weight, classes=np.unique(y), y=y)
-    sample_weight = class_weight_[le.fit_transform(y)]
-
-    coef1 = []
-    intercept1 = []
-    coef2 = []
-    intercept2 = []
-    for cl in classes:
-        y_encoded = np.ones(n_samples)
-        y_encoded[y != cl] = -1
-
-        spweights1, spintercept1 = sag_sparse(
-            X,
-            y_encoded,
-            step_size,
-            alpha,
-            n_iter=max_iter,
-            dloss=log_dloss,
-            sample_weight=sample_weight,
-        )
-        spweights2, spintercept2 = sag_sparse(
-            X,
-            y_encoded,
-            step_size,
-            alpha,
-            n_iter=max_iter,
-            dloss=log_dloss,
-            sample_weight=sample_weight,
-            sparse=True,
-        )
-        coef1.append(spweights1)
-        intercept1.append(spintercept1)
-        coef2.append(spweights2)
-        intercept2.append(spintercept2)
-
-    coef1 = np.vstack(coef1)
-    intercept1 = np.array(intercept1)
-    coef2 = np.vstack(coef2)
-    intercept2 = np.array(intercept2)
-
-    for i, cl in enumerate(classes):
-        assert_array_almost_equal(clf1.coef_[i].ravel(), coef1[i].ravel(), decimal=2)
-        assert_almost_equal(clf1.intercept_[i], intercept1[i], decimal=1)
-
-        assert_array_almost_equal(clf2.coef_[i].ravel(), coef2[i].ravel(), decimal=2)
-        assert_almost_equal(clf2.intercept_[i], intercept2[i], decimal=1)
-
-
 def test_classifier_single_class():
     """tests if ValueError is thrown with only one class"""
     X = [[1, 2], [3, 4]]
diff --git a/sklearn/linear_model/tests/test_sgd.py b/sklearn/linear_model/tests/test_sgd.py
index 46e153c5cf1ec..795a0e62f37f8 100644
--- a/sklearn/linear_model/tests/test_sgd.py
+++ b/sklearn/linear_model/tests/test_sgd.py
@@ -2216,19 +2216,6 @@ def test_sgd_numerical_consistency(SGDEstimator):
     assert_allclose(sgd_64.coef_, sgd_32.coef_)
 
 
-# TODO(1.6): remove
-@pytest.mark.parametrize("Estimator", [SGDClassifier, SGDOneClassSVM])
-def test_loss_attribute_deprecation(Estimator):
-    # Check that we raise the proper deprecation warning if accessing
-    # `loss_function_`.
-    X = np.array([[1, 2], [3, 4]])
-    y = np.array([1, 0])
-    est = Estimator().fit(X, y)
-
-    with pytest.warns(FutureWarning, match="`loss_function_` was deprecated"):
-        est.loss_function_
-
-
 # TODO(1.7): remove
 @pytest.mark.parametrize("Estimator", [SGDClassifier, SGDRegressor, SGDOneClassSVM])
 def test_passive_aggressive_deprecated_average(Estimator):
diff --git a/sklearn/linear_model/tests/test_theil_sen.py b/sklearn/linear_model/tests/test_theil_sen.py
index c8415d02be80a..b59ad639f1dcc 100644
--- a/sklearn/linear_model/tests/test_theil_sen.py
+++ b/sklearn/linear_model/tests/test_theil_sen.py
@@ -2,8 +2,8 @@
 Testing for Theil-Sen module (sklearn.linear_model.theil_sen)
 """
 
-# Author: Florian Wilhelm <florian.wilhelm@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import os
 import re
 import sys
@@ -292,3 +292,11 @@ def test_less_samples_than_features():
     theil_sen = TheilSenRegressor(fit_intercept=True, random_state=0).fit(X, y)
     y_pred = theil_sen.predict(X)
     assert_array_almost_equal(y_pred, y, 12)
+
+
+# TODO(1.8): Remove
+def test_copy_X_deprecated():
+    X, y, _, _ = gen_toy_problem_1d()
+    theil_sen = TheilSenRegressor(copy_X=True, random_state=0)
+    with pytest.warns(FutureWarning, match="`copy_X` was deprecated"):
+        theil_sen.fit(X, y)
diff --git a/sklearn/manifold/__init__.py b/sklearn/manifold/__init__.py
index 1e8d96c7cf94b..b3f53e84b04fb 100644
--- a/sklearn/manifold/__init__.py
+++ b/sklearn/manifold/__init__.py
@@ -1,6 +1,4 @@
-"""
-The :mod:`sklearn.manifold` module implements data embedding techniques.
-"""
+"""Data embedding techniques."""
 
 from ._isomap import Isomap
 from ._locally_linear import LocallyLinearEmbedding, locally_linear_embedding
diff --git a/sklearn/manifold/_barnes_hut_tsne.pyx b/sklearn/manifold/_barnes_hut_tsne.pyx
index 485a14edce6c5..f0906fbf2bec8 100644
--- a/sklearn/manifold/_barnes_hut_tsne.pyx
+++ b/sklearn/manifold/_barnes_hut_tsne.pyx
@@ -10,6 +10,7 @@ cimport numpy as cnp
 from libc.stdio cimport printf
 from libc.math cimport log
 from libc.stdlib cimport malloc, free
+from libc.time cimport clock, clock_t
 from cython.parallel cimport prange, parallel
 
 from ..neighbors._quad_tree cimport _QuadTree
@@ -19,9 +20,6 @@ cnp.import_array()
 
 cdef char* EMPTY_STRING = ""
 
-cdef extern from "math.h":
-    float fabsf(float x) nogil
-
 # Smallest strictly positive value that can be represented by floating
 # point numbers for different precision levels. This is useful to avoid
 # taking the log of zero when computing the KL divergence.
@@ -36,13 +34,6 @@ cdef float FLOAT64_EPS = np.finfo(np.float64).eps
 cdef enum:
     DEBUGFLAG = 0
 
-cdef extern from "time.h":
-    # Declare only what is necessary from `tm` structure.
-    ctypedef long clock_t
-    clock_t clock() nogil
-    double CLOCKS_PER_SEC
-
-
 cdef float compute_gradient(float[:] val_P,
                             float[:, :] pos_reference,
                             cnp.int64_t[:] neighbors,
diff --git a/sklearn/manifold/_isomap.py b/sklearn/manifold/_isomap.py
index c6e8bfdc42685..dee67461d7fcb 100644
--- a/sklearn/manifold/_isomap.py
+++ b/sklearn/manifold/_isomap.py
@@ -1,7 +1,7 @@
 """Isomap for manifold learning"""
 
-# Author: Jake Vanderplas  -- <vanderplas@astro.washington.edu>
-# License: BSD 3 clause (C) 2011
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import warnings
 from numbers import Integral, Real
 
diff --git a/sklearn/manifold/_locally_linear.py b/sklearn/manifold/_locally_linear.py
index 18f7f504a1e31..803d5b657547a 100644
--- a/sklearn/manifold/_locally_linear.py
+++ b/sklearn/manifold/_locally_linear.py
@@ -1,14 +1,13 @@
 """Locally Linear Embedding"""
 
-# Author: Fabian Pedregosa -- <fabian.pedregosa@inria.fr>
-#         Jake Vanderplas  -- <vanderplas@astro.washington.edu>
-# License: BSD 3 clause (C) INRIA 2011
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from numbers import Integral, Real
 
 import numpy as np
 from scipy.linalg import eigh, qr, solve, svd
-from scipy.sparse import csr_matrix, eye
+from scipy.sparse import csr_matrix, eye, lil_matrix
 from scipy.sparse.linalg import eigsh
 
 from ..base import (
@@ -230,6 +229,7 @@ def _locally_linear_embedding(
         )
 
     M_sparse = eigen_solver != "dense"
+    M_container_constructor = lil_matrix if M_sparse else np.zeros
 
     if method == "standard":
         W = barycenter_kneighbors_graph(
@@ -240,7 +240,7 @@ def _locally_linear_embedding(
         # depending on the solver, we'll do this differently
         if M_sparse:
             M = eye(*W.shape, format=W.format) - W
-            M = (M.T * M).tocsr()
+            M = M.T * M
         else:
             M = (W.T * W - W.T - W).toarray()
             M.flat[:: M.shape[0] + 1] += 1  # W = W - I = W - I
@@ -263,7 +263,7 @@ def _locally_linear_embedding(
         Yi = np.empty((n_neighbors, 1 + n_components + dp), dtype=np.float64)
         Yi[:, 0] = 1
 
-        M = np.zeros((N, N), dtype=np.float64)
+        M = M_container_constructor((N, N), dtype=np.float64)
 
         use_svd = n_neighbors > d_in
 
@@ -296,9 +296,6 @@ def _locally_linear_embedding(
             nbrs_x, nbrs_y = np.meshgrid(neighbors[i], neighbors[i])
             M[nbrs_x, nbrs_y] += np.dot(w, w.T)
 
-        if M_sparse:
-            M = csr_matrix(M)
-
     elif method == "modified":
         if n_neighbors < n_components:
             raise ValueError("modified LLE requires n_neighbors >= n_components")
@@ -362,7 +359,8 @@ def _locally_linear_embedding(
 
         # Now calculate M.
         # This is the [N x N] matrix whose null space is the desired embedding
-        M = np.zeros((N, N), dtype=np.float64)
+        M = M_container_constructor((N, N), dtype=np.float64)
+
         for i in range(N):
             s_i = s_range[i]
 
@@ -398,19 +396,16 @@ def _locally_linear_embedding(
             M[nbrs_x, nbrs_y] += np.dot(Wi, Wi.T)
             Wi_sum1 = Wi.sum(1)
             M[i, neighbors[i]] -= Wi_sum1
-            M[neighbors[i], i] -= Wi_sum1
+            M[neighbors[i], [i]] -= Wi_sum1
             M[i, i] += s_i
 
-        if M_sparse:
-            M = csr_matrix(M)
-
     elif method == "ltsa":
         neighbors = nbrs.kneighbors(
             X, n_neighbors=n_neighbors + 1, return_distance=False
         )
         neighbors = neighbors[:, 1:]
 
-        M = np.zeros((N, N))
+        M = M_container_constructor((N, N), dtype=np.float64)
 
         use_svd = n_neighbors > d_in
 
@@ -433,7 +428,11 @@ def _locally_linear_embedding(
 
             nbrs_x, nbrs_y = np.meshgrid(neighbors[i], neighbors[i])
             M[nbrs_x, nbrs_y] -= GiGiT
-            M[neighbors[i], neighbors[i]] += 1
+
+            M[neighbors[i], neighbors[i]] += np.ones(shape=n_neighbors)
+
+    if M_sparse:
+        M = M.tocsr()
 
     return null_space(
         M,
diff --git a/sklearn/manifold/_mds.py b/sklearn/manifold/_mds.py
index 760336da52e9f..f57ce6c4c8d2c 100644
--- a/sklearn/manifold/_mds.py
+++ b/sklearn/manifold/_mds.py
@@ -3,7 +3,7 @@
 """
 
 # author: Nelle Varoquaux <nelle.varoquaux@gmail.com>
-# License: BSD
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from numbers import Integral, Real
diff --git a/sklearn/manifold/_spectral_embedding.py b/sklearn/manifold/_spectral_embedding.py
index 2e2e262183a17..f1e443e670118 100644
--- a/sklearn/manifold/_spectral_embedding.py
+++ b/sklearn/manifold/_spectral_embedding.py
@@ -1,8 +1,7 @@
 """Spectral Embedding."""
 
-# Author: Gael Varoquaux <gael.varoquaux@normalesup.org>
-#         Wei LI <kuantkid@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 import warnings
diff --git a/sklearn/manifold/_t_sne.py b/sklearn/manifold/_t_sne.py
index e3e804fb0257d..7e728a84441c3 100644
--- a/sklearn/manifold/_t_sne.py
+++ b/sklearn/manifold/_t_sne.py
@@ -1,7 +1,5 @@
-# Author: Alexander Fabisch  -- <afabisch@informatik.uni-bremen.de>
-# Author: Christopher Moody <chrisemoody@gmail.com>
-# Author: Nick Travers <nickt@squareup.com>
-# License: BSD 3 clause (C) 2014
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # This is the exact and Barnes-Hut t-SNE implementation. There are other
 # modifications of the algorithm:
diff --git a/sklearn/manifold/meson.build b/sklearn/manifold/meson.build
index 72ec51d62b164..b112f63dd4f2d 100644
--- a/sklearn/manifold/meson.build
+++ b/sklearn/manifold/meson.build
@@ -1,6 +1,6 @@
 py.extension_module(
   '_utils',
-  '_utils.pyx',
+  ['_utils.pyx', utils_cython_tree],
   cython_args: cython_args,
   subdir: 'sklearn/manifold',
   install: true
diff --git a/sklearn/meson.build b/sklearn/meson.build
index bd71447597d42..4552082801337 100644
--- a/sklearn/meson.build
+++ b/sklearn/meson.build
@@ -55,11 +55,36 @@ print(incdir)
 endif
 
 inc_np = include_directories(incdir_numpy)
-np_dep = declare_dependency(include_directories: inc_np)
+# Don't use the deprecated NumPy C API. Define this to a fixed version instead of
+# NPY_API_VERSION in order not to break compilation for released SciPy versions
+# when NumPy introduces a new deprecation.
+numpy_no_deprecated_api = ['-DNPY_NO_DEPRECATED_API=NPY_1_9_API_VERSION']
+np_dep = declare_dependency(include_directories: inc_np, compile_args: numpy_no_deprecated_api)
 
 openmp_dep = dependency('OpenMP', language: 'c', required: false)
 
 if not openmp_dep.found()
+  warn_about_missing_openmp = true
+  # On Apple Clang avoid a misleading warning if compiler variables are set.
+  # See https://github.com/scikit-learn/scikit-learn/issues/28710 for more
+  # details. This may be removed if the OpenMP detection on Apple Clang improves,
+  # see https://github.com/mesonbuild/meson/issues/7435#issuecomment-2047585466.
+  if host_machine.system() == 'darwin' and cc.get_id() == 'clang'
+    compiler_env_vars_with_openmp = run_command(py,
+      [
+        '-c',
+        '''
+import os
+
+compiler_env_vars_to_check = ["CPPFLAGS", "CFLAGS", "CXXFLAGS"]
+
+compiler_env_vars_with_openmp = [
+    var for var in compiler_env_vars_to_check if "-fopenmp" in os.getenv(var, "")]
+print(compiler_env_vars_with_openmp)
+'''], check: true).stdout().strip()
+      warn_about_missing_openmp = compiler_env_vars_with_openmp == '[]'
+  endif
+  if warn_about_missing_openmp
     warning(
 '''
                 ***********
@@ -84,6 +109,13 @@ It seems that scikit-learn cannot be built with OpenMP.
 
                     ***
 ''')
+  else
+    warning(
+'''It looks like compiler environment variables were set to enable OpenMP support.
+Check the output of "import sklearn; sklearn.show_versions()" after the build
+to make sure that scikit-learn was actually built with OpenMP support.
+''')
+  endif
 endif
 
 # For now, we keep supporting SKLEARN_ENABLE_DEBUG_CYTHON_DIRECTIVES variable
@@ -127,7 +159,6 @@ custom_target('write_built_with_meson_file',
     install: true,
     install_dir: py.get_install_dir() / 'sklearn'
 )
-# endif
 
 extensions = ['_isotonic']
 
@@ -141,7 +172,9 @@ py.extension_module(
 
 # Need for Cython cimports across subpackages to work, i.e. avoid errors like
 # relative cimport from non-package directory is not allowed
-fs.copyfile('__init__.py')
+sklearn_root_cython_tree = [
+  fs.copyfile('__init__.py')
+]
 
 sklearn_dir = py.get_install_dir() / 'sklearn'
 
diff --git a/sklearn/metrics/__init__.py b/sklearn/metrics/__init__.py
index 8a818c885043c..81a67d9793bb0 100644
--- a/sklearn/metrics/__init__.py
+++ b/sklearn/metrics/__init__.py
@@ -1,7 +1,4 @@
-"""
-The :mod:`sklearn.metrics` module includes score functions, performance metrics
-and pairwise metrics and distance computations.
-"""
+"""Score functions, performance metrics, pairwise metrics and distance computations."""
 
 from . import cluster
 from ._classification import (
@@ -12,6 +9,7 @@
     classification_report,
     cohen_kappa_score,
     confusion_matrix,
+    d2_log_loss_score,
     f1_score,
     fbeta_score,
     hamming_loss,
@@ -113,6 +111,7 @@
     "coverage_error",
     "d2_tweedie_score",
     "d2_absolute_error_score",
+    "d2_log_loss_score",
     "d2_pinball_score",
     "dcg_score",
     "davies_bouldin_score",
diff --git a/sklearn/metrics/_base.py b/sklearn/metrics/_base.py
index c344008755004..ee797e1bc4030 100644
--- a/sklearn/metrics/_base.py
+++ b/sklearn/metrics/_base.py
@@ -3,15 +3,8 @@
 
 """
 
-# Authors: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#          Mathieu Blondel <mathieu@mblondel.org>
-#          Olivier Grisel <olivier.grisel@ensta.org>
-#          Arnaud Joly <a.joly@ulg.ac.be>
-#          Jochen Wersdorfer <jochen@wersdoerfer.de>
-#          Lars Buitinck
-#          Joel Nothman <joel.nothman@gmail.com>
-#          Noel Dawe <noel@dawe.me>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from itertools import combinations
 
diff --git a/sklearn/metrics/_classification.py b/sklearn/metrics/_classification.py
index c5290fd39eb7e..694cbfe63a018 100644
--- a/sklearn/metrics/_classification.py
+++ b/sklearn/metrics/_classification.py
@@ -7,20 +7,8 @@
 the lower the better.
 """
 
-# Authors: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#          Mathieu Blondel <mathieu@mblondel.org>
-#          Olivier Grisel <olivier.grisel@ensta.org>
-#          Arnaud Joly <a.joly@ulg.ac.be>
-#          Jochen Wersdorfer <jochen@wersdoerfer.de>
-#          Lars Buitinck
-#          Joel Nothman <joel.nothman@gmail.com>
-#          Noel Dawe <noel@dawe.me>
-#          Jatin Shah <jatindshah@gmail.com>
-#          Saurabh Jha <saurabh.jhaa@gmail.com>
-#          Bernardo Stein <bernardovstein@gmail.com>
-#          Shangwu Yao <shangwuyao@gmail.com>
-#          Michal Karbownik <michakarbownik@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 import warnings
@@ -40,8 +28,11 @@
 )
 from ..utils._array_api import (
     _average,
+    _count_nonzero,
+    _is_numpy_namespace,
     _union1d,
     get_namespace,
+    get_namespace_and_device,
 )
 from ..utils._param_validation import (
     Hidden,
@@ -53,7 +44,11 @@
 from ..utils.extmath import _nanaverage
 from ..utils.multiclass import type_of_target, unique_labels
 from ..utils.sparsefuncs import count_nonzero
-from ..utils.validation import _check_pos_label_consistency, _num_samples
+from ..utils.validation import (
+    _check_pos_label_consistency,
+    _check_sample_weight,
+    _num_samples,
+)
 
 
 def _check_zero_division(zero_division):
@@ -92,6 +87,7 @@ def _check_targets(y_true, y_pred):
 
     y_pred : array or indicator matrix
     """
+    xp, _ = get_namespace(y_true, y_pred)
     check_consistent_length(y_true, y_pred)
     type_true = type_of_target(y_true, input_name="y_true")
     type_pred = type_of_target(y_pred, input_name="y_pred")
@@ -137,8 +133,13 @@ def _check_targets(y_true, y_pred):
                 y_type = "multiclass"
 
     if y_type.startswith("multilabel"):
-        y_true = csr_matrix(y_true)
-        y_pred = csr_matrix(y_pred)
+        if _is_numpy_namespace(xp):
+            # XXX: do we really want to sparse-encode multilabel indicators when
+            # they are passed as a dense arrays? This is not possible for array
+            # API inputs in general hence we only do it for NumPy inputs. But even
+            # for NumPy the usefulness is questionable.
+            y_true = csr_matrix(y_true)
+            y_pred = csr_matrix(y_pred)
         y_type = "multilabel-indicator"
 
     return y_type, y_true, y_pred
@@ -213,13 +214,18 @@ def accuracy_score(y_true, y_pred, *, normalize=True, sample_weight=None):
     >>> accuracy_score(np.array([[0, 1], [1, 1]]), np.ones((2, 2)))
     0.5
     """
-
+    xp, _, device = get_namespace_and_device(y_true, y_pred, sample_weight)
     # Compute accuracy for each possible representation
     y_type, y_true, y_pred = _check_targets(y_true, y_pred)
     check_consistent_length(y_true, y_pred, sample_weight)
     if y_type.startswith("multilabel"):
-        differing_labels = count_nonzero(y_true - y_pred, axis=1)
-        score = differing_labels == 0
+        if _is_numpy_namespace(xp):
+            differing_labels = count_nonzero(y_true - y_pred, axis=1)
+        else:
+            differing_labels = _count_nonzero(
+                y_true - y_pred, xp=xp, device=device, axis=1
+            )
+        score = xp.asarray(differing_labels == 0, device=device)
     else:
         score = y_true == y_pred
 
@@ -618,6 +624,37 @@ def multilabel_confusion_matrix(
     return np.array([tn, fp, fn, tp]).T.reshape(-1, 2, 2)
 
 
+def _metric_handle_division(*, numerator, denominator, metric, zero_division):
+    """Helper to handle zero-division.
+
+    Parameters
+    ----------
+    numerator : numbers.Real
+        The numerator of the division.
+    denominator : numbers.Real
+        The denominator of the division.
+    metric : str
+        Name of the caller metric function.
+    zero_division : {0.0, 1.0, "warn"}
+        The strategy to use when encountering 0-denominator.
+
+    Returns
+    -------
+    result : numbers.Real
+        The resulting of the division
+    is_zero_division : bool
+        Whether or not we encountered a zero division. This value could be
+        required to early return `result` in the "caller" function.
+    """
+    if np.isclose(denominator, 0):
+        if zero_division == "warn":
+            msg = f"{metric} is ill-defined and set to 0.0. Use the `zero_division` "
+            "param to control this behavior."
+            warnings.warn(msg, UndefinedMetricWarning, stacklevel=2)
+        return _check_zero_division(zero_division), True
+    return numerator / denominator, False
+
+
 @validate_params(
     {
         "y1": ["array-like"],
@@ -625,10 +662,16 @@ def multilabel_confusion_matrix(
         "labels": ["array-like", None],
         "weights": [StrOptions({"linear", "quadratic"}), None],
         "sample_weight": ["array-like", None],
+        "zero_division": [
+            StrOptions({"warn"}),
+            Options(Real, {0.0, 1.0, np.nan}),
+        ],
     },
     prefer_skip_nested_validation=True,
 )
-def cohen_kappa_score(y1, y2, *, labels=None, weights=None, sample_weight=None):
+def cohen_kappa_score(
+    y1, y2, *, labels=None, weights=None, sample_weight=None, zero_division="warn"
+):
     r"""Compute Cohen's kappa: a statistic that measures inter-annotator agreement.
 
     This function computes Cohen's kappa [1]_, a score that expresses the level
@@ -661,12 +704,20 @@ class labels [2]_.
         ``y1`` or ``y2`` are used.
 
     weights : {'linear', 'quadratic'}, default=None
-        Weighting type to calculate the score. `None` means no weighted;
-        "linear" means linear weighted; "quadratic" means quadratic weighted.
+        Weighting type to calculate the score. `None` means not weighted;
+        "linear" means linear weighting; "quadratic" means quadratic weighting.
 
     sample_weight : array-like of shape (n_samples,), default=None
         Sample weights.
 
+    zero_division : {"warn", 0.0, 1.0, np.nan}, default="warn"
+        Sets the return value when there is a zero division. This is the case when both
+        labelings `y1` and `y2` both exclusively contain the 0 class (e. g.
+        `[0, 0, 0, 0]`) (or if both are empty). If set to "warn", returns `0.0`, but a
+        warning is also raised.
+
+        .. versionadded:: 1.6
+
     Returns
     -------
     kappa : float
@@ -696,7 +747,18 @@ class labels [2]_.
     n_classes = confusion.shape[0]
     sum0 = np.sum(confusion, axis=0)
     sum1 = np.sum(confusion, axis=1)
-    expected = np.outer(sum0, sum1) / np.sum(sum0)
+
+    numerator = np.outer(sum0, sum1)
+    denominator = np.sum(sum0)
+    expected, is_zero_division = _metric_handle_division(
+        numerator=numerator,
+        denominator=denominator,
+        metric="cohen_kappa_score()",
+        zero_division=zero_division,
+    )
+
+    if is_zero_division:
+        return expected
 
     if weights is None:
         w_mat = np.ones([n_classes, n_classes], dtype=int)
@@ -709,8 +771,18 @@ class labels [2]_.
         else:
             w_mat = (w_mat - w_mat.T) ** 2
 
-    k = np.sum(w_mat * confusion) / np.sum(w_mat * expected)
-    return 1 - k
+    numerator = np.sum(w_mat * confusion)
+    denominator = np.sum(w_mat * expected)
+    score, is_zero_division = _metric_handle_division(
+        numerator=numerator,
+        denominator=denominator,
+        metric="cohen_kappa_score()",
+        zero_division=zero_division,
+    )
+
+    if is_zero_division:
+        return score
+    return 1 - score
 
 
 @validate_params(
@@ -963,8 +1035,8 @@ def matthews_corrcoef(y_true, y_pred, *, sample_weight=None):
        accuracy of prediction algorithms for classification: an overview.
        <10.1093/bioinformatics/16.5.412>`
 
-    .. [2] `Wikipedia entry for the Matthews Correlation Coefficient
-       <https://en.wikipedia.org/wiki/Matthews_correlation_coefficient>`_.
+    .. [2] `Wikipedia entry for the Matthews Correlation Coefficient (phi coefficient)
+       <https://en.wikipedia.org/wiki/Phi_coefficient>`_.
 
     .. [3] `Gorodkin, (2004). Comparing two K-category assignments by a
         K-category correlation coefficient
@@ -2816,16 +2888,13 @@ def hamming_loss(y_true, y_pred, *, sample_weight=None):
     {
         "y_true": ["array-like"],
         "y_pred": ["array-like"],
-        "eps": [StrOptions({"auto"}), Interval(Real, 0, 1, closed="both")],
         "normalize": ["boolean"],
         "sample_weight": ["array-like", None],
         "labels": ["array-like", None],
     },
     prefer_skip_nested_validation=True,
 )
-def log_loss(
-    y_true, y_pred, *, eps="auto", normalize=True, sample_weight=None, labels=None
-):
+def log_loss(y_true, y_pred, *, normalize=True, sample_weight=None, labels=None):
     r"""Log loss, aka logistic loss or cross-entropy loss.
 
     This is the loss function used in (multinomial) logistic regression
@@ -2855,19 +2924,8 @@ def log_loss(
         ordered alphabetically, as done by
         :class:`~sklearn.preprocessing.LabelBinarizer`.
 
-    eps : float or "auto", default="auto"
-        Log loss is undefined for p=0 or p=1, so probabilities are
-        clipped to `max(eps, min(1 - eps, p))`. The default will depend on the
-        data type of `y_pred` and is set to `np.finfo(y_pred.dtype).eps`.
-
-        .. versionadded:: 1.2
-
-        .. versionchanged:: 1.2
-           The default value changed from `1e-15` to `"auto"` that is
-           equivalent to `np.finfo(y_pred.dtype).eps`.
-
-        .. deprecated:: 1.3
-           `eps` is deprecated in 1.3 and will be removed in 1.5.
+        `y_pred` values are clipped to `[eps, 1-eps]` where `eps` is the machine
+        precision for `y_pred`'s dtype.
 
     normalize : bool, default=True
         If true, return the mean loss per sample.
@@ -2907,18 +2965,6 @@ def log_loss(
     y_pred = check_array(
         y_pred, ensure_2d=False, dtype=[np.float64, np.float32, np.float16]
     )
-    if eps == "auto":
-        eps = np.finfo(y_pred.dtype).eps
-    else:
-        # TODO: Remove user defined eps in 1.5
-        warnings.warn(
-            (
-                "Setting the eps parameter is deprecated and will "
-                "be removed in 1.5. Instead eps will always have"
-                "a default value of `np.finfo(y_pred.dtype).eps`."
-            ),
-            FutureWarning,
-        )
 
     check_consistent_length(y_pred, y_true, sample_weight)
     lb = LabelBinarizer()
@@ -2949,9 +2995,6 @@ def log_loss(
             1 - transformed_labels, transformed_labels, axis=1
         )
 
-    # Clipping
-    y_pred = np.clip(y_pred, eps, 1 - eps)
-
     # If y_pred is of single dimension, assume y_true to be binary
     # and then check.
     if y_pred.ndim == 1:
@@ -2959,6 +3002,19 @@ def log_loss(
     if y_pred.shape[1] == 1:
         y_pred = np.append(1 - y_pred, y_pred, axis=1)
 
+    eps = np.finfo(y_pred.dtype).eps
+
+    # Make sure y_pred is normalized
+    y_pred_sum = y_pred.sum(axis=1)
+    if not np.allclose(y_pred_sum, 1, rtol=np.sqrt(eps)):
+        warnings.warn(
+            "The y_pred values do not sum to one. Make sure to pass probabilities.",
+            UserWarning,
+        )
+
+    # Clipping
+    y_pred = np.clip(y_pred, eps, 1 - eps)
+
     # Check if dimensions are consistent.
     transformed_labels = check_array(transformed_labels)
     if len(lb.classes_) != y_pred.shape[1]:
@@ -2979,17 +3035,6 @@ def log_loss(
                 "labels: {0}".format(lb.classes_)
             )
 
-    # Renormalize
-    y_pred_sum = y_pred.sum(axis=1)
-    if not np.isclose(y_pred_sum, 1, rtol=1e-15, atol=5 * eps).all():
-        warnings.warn(
-            (
-                "The y_pred values do not sum to one. Starting from 1.5 this"
-                "will result in an error."
-            ),
-            UserWarning,
-        )
-    y_pred = y_pred / y_pred_sum[:, np.newaxis]
     loss = -xlogy(transformed_labels, y_pred).sum(axis=1)
 
     return float(_average(loss, weights=sample_weight, normalize=normalize))
@@ -3061,9 +3106,9 @@ def hinge_loss(y_true, pred_decision, *, labels=None, sample_weight=None):
     >>> from sklearn.metrics import hinge_loss
     >>> X = [[0], [1]]
     >>> y = [-1, 1]
-    >>> est = svm.LinearSVC(dual="auto", random_state=0)
+    >>> est = svm.LinearSVC(random_state=0)
     >>> est.fit(X, y)
-    LinearSVC(dual='auto', random_state=0)
+    LinearSVC(random_state=0)
     >>> pred_decision = est.decision_function([[-2], [3], [0.5]])
     >>> pred_decision
     array([-2.18...,  2.36...,  0.09...])
@@ -3076,9 +3121,9 @@ def hinge_loss(y_true, pred_decision, *, labels=None, sample_weight=None):
     >>> X = np.array([[0], [1], [2], [3]])
     >>> Y = np.array([0, 1, 2, 3])
     >>> labels = np.array([0, 1, 2, 3])
-    >>> est = svm.LinearSVC(dual="auto")
+    >>> est = svm.LinearSVC()
     >>> est.fit(X, Y)
-    LinearSVC(dual='auto')
+    LinearSVC()
     >>> pred_decision = est.decision_function([[-1], [2], [3]])
     >>> y_true = [0, 2, 3]
     >>> hinge_loss(y_true, pred_decision, labels=labels)
@@ -3284,3 +3329,96 @@ def brier_score_loss(
             raise
     y_true = np.array(y_true == pos_label, int)
     return np.average((y_true - y_proba) ** 2, weights=sample_weight)
+
+
+@validate_params(
+    {
+        "y_true": ["array-like"],
+        "y_pred": ["array-like"],
+        "sample_weight": ["array-like", None],
+        "labels": ["array-like", None],
+    },
+    prefer_skip_nested_validation=True,
+)
+def d2_log_loss_score(y_true, y_pred, *, sample_weight=None, labels=None):
+    """
+    :math:`D^2` score function, fraction of log loss explained.
+
+    Best possible score is 1.0 and it can be negative (because the model can be
+    arbitrarily worse). A model that always predicts the per-class proportions
+    of `y_true`, disregarding the input features, gets a D^2 score of 0.0.
+
+    Read more in the :ref:`User Guide <d2_score_classification>`.
+
+    .. versionadded:: 1.5
+
+    Parameters
+    ----------
+    y_true : array-like or label indicator matrix
+        The actuals labels for the n_samples samples.
+
+    y_pred : array-like of shape (n_samples, n_classes) or (n_samples,)
+        Predicted probabilities, as returned by a classifier's
+        predict_proba method. If ``y_pred.shape = (n_samples,)``
+        the probabilities provided are assumed to be that of the
+        positive class. The labels in ``y_pred`` are assumed to be
+        ordered alphabetically, as done by
+        :class:`~sklearn.preprocessing.LabelBinarizer`.
+
+    sample_weight : array-like of shape (n_samples,), default=None
+        Sample weights.
+
+    labels : array-like, default=None
+        If not provided, labels will be inferred from y_true. If ``labels``
+        is ``None`` and ``y_pred`` has shape (n_samples,) the labels are
+        assumed to be binary and are inferred from ``y_true``.
+
+    Returns
+    -------
+    d2 : float or ndarray of floats
+        The D^2 score.
+
+    Notes
+    -----
+    This is not a symmetric function.
+
+    Like R^2, D^2 score may be negative (it need not actually be the square of
+    a quantity D).
+
+    This metric is not well-defined for a single sample and will return a NaN
+    value if n_samples is less than two.
+    """
+    y_pred = check_array(y_pred, ensure_2d=False, dtype="numeric")
+    check_consistent_length(y_pred, y_true, sample_weight)
+    if _num_samples(y_pred) < 2:
+        msg = "D^2 score is not well-defined with less than two samples."
+        warnings.warn(msg, UndefinedMetricWarning)
+        return float("nan")
+
+    # log loss of the fitted model
+    numerator = log_loss(
+        y_true=y_true,
+        y_pred=y_pred,
+        normalize=False,
+        sample_weight=sample_weight,
+        labels=labels,
+    )
+
+    # Proportion of labels in the dataset
+    weights = _check_sample_weight(sample_weight, y_true)
+
+    _, y_value_indices = np.unique(y_true, return_inverse=True)
+    counts = np.bincount(y_value_indices, weights=weights)
+    y_prob = counts / weights.sum()
+    y_pred_null = np.tile(y_prob, (len(y_true), 1))
+
+    # log loss of the null model
+    denominator = log_loss(
+        y_true=y_true,
+        y_pred=y_pred_null,
+        normalize=False,
+        sample_weight=sample_weight,
+        labels=labels,
+    )
+
+    return 1 - (numerator / denominator)
diff --git a/sklearn/metrics/_dist_metrics.pyx.tp b/sklearn/metrics/_dist_metrics.pyx.tp
index 6b5ea300f038b..a9844795cf592 100644
--- a/sklearn/metrics/_dist_metrics.pyx.tp
+++ b/sklearn/metrics/_dist_metrics.pyx.tp
@@ -11,7 +11,7 @@ implementation_specific_values = [
 }}
 # By Jake Vanderplas (2013) <jakevdp@cs.washington.edu>
 # written for the scikit-learn project
-# License: BSD
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 cimport numpy as cnp
diff --git a/sklearn/metrics/_pairwise_distances_reduction/_argkmin.pyx.tp b/sklearn/metrics/_pairwise_distances_reduction/_argkmin.pyx.tp
index a686153c3ac9c..c21717554e94b 100644
--- a/sklearn/metrics/_pairwise_distances_reduction/_argkmin.pyx.tp
+++ b/sklearn/metrics/_pairwise_distances_reduction/_argkmin.pyx.tp
@@ -14,7 +14,7 @@ from numbers import Integral
 from scipy.sparse import issparse
 from ...utils import check_array, check_scalar
 from ...utils.fixes import _in_unstable_openblas_configuration
-from ...utils.fixes import threadpool_limits
+from ...utils.parallel import _get_threadpool_controller
 
 {{for name_suffix in ['64', '32']}}
 
@@ -58,7 +58,7 @@ cdef class ArgKmin{{name_suffix}}(BaseDistancesReduction{{name_suffix}}):
         """
         # Limit the number of threads in second level of nested parallelism for BLAS
         # to avoid threads over-subscription (in DOT or GEMM for instance).
-        with threadpool_limits(limits=1, user_api='blas'):
+        with _get_threadpool_controller().limit(limits=1, user_api='blas'):
           if metric in ("euclidean", "sqeuclidean"):
               # Specialized implementation of ArgKmin for the Euclidean distance
               # for the dense-dense and sparse-sparse cases.
diff --git a/sklearn/metrics/_pairwise_distances_reduction/_argkmin_classmode.pyx.tp b/sklearn/metrics/_pairwise_distances_reduction/_argkmin_classmode.pyx.tp
index f9719f6959dfc..51fb745dca784 100644
--- a/sklearn/metrics/_pairwise_distances_reduction/_argkmin_classmode.pyx.tp
+++ b/sklearn/metrics/_pairwise_distances_reduction/_argkmin_classmode.pyx.tp
@@ -4,10 +4,10 @@ from libcpp.map cimport map as cpp_map, pair as cpp_pair
 from libc.stdlib cimport free
 
 from ...utils._typedefs cimport intp_t, float64_t
+from ...utils.parallel import _get_threadpool_controller
 
 import numpy as np
 from scipy.sparse import issparse
-from sklearn.utils.fixes import threadpool_limits
 from ._classmode cimport WeightingStrategy
 
 {{for name_suffix in ["32", "64"]}}
@@ -66,7 +66,7 @@ cdef class ArgKminClassMode{{name_suffix}}(ArgKmin{{name_suffix}}):
 
         # Limit the number of threads in second level of nested parallelism for BLAS
         # to avoid threads over-subscription (in GEMM for instance).
-        with threadpool_limits(limits=1, user_api="blas"):
+        with _get_threadpool_controller().limit(limits=1, user_api="blas"):
             if pda.execute_in_parallel_on_Y:
                 pda._parallel_on_Y()
             else:
diff --git a/sklearn/metrics/_pairwise_distances_reduction/_radius_neighbors.pyx.tp b/sklearn/metrics/_pairwise_distances_reduction/_radius_neighbors.pyx.tp
index dcc97b4d32fd4..d0567f2ead804 100644
--- a/sklearn/metrics/_pairwise_distances_reduction/_radius_neighbors.pyx.tp
+++ b/sklearn/metrics/_pairwise_distances_reduction/_radius_neighbors.pyx.tp
@@ -17,7 +17,7 @@ from numbers import Real
 from scipy.sparse import issparse
 from ...utils import check_array, check_scalar
 from ...utils.fixes import _in_unstable_openblas_configuration
-from ...utils.fixes import threadpool_limits
+from ...utils.parallel import _get_threadpool_controller
 
 cnp.import_array()
 
@@ -110,7 +110,7 @@ cdef class RadiusNeighbors{{name_suffix}}(BaseDistancesReduction{{name_suffix}})
 
         # Limit the number of threads in second level of nested parallelism for BLAS
         # to avoid threads over-subscription (in GEMM for instance).
-        with threadpool_limits(limits=1, user_api="blas"):
+        with _get_threadpool_controller().limit(limits=1, user_api="blas"):
             if pda.execute_in_parallel_on_Y:
                 pda._parallel_on_Y()
             else:
diff --git a/sklearn/metrics/_pairwise_distances_reduction/_radius_neighbors_classmode.pyx.tp b/sklearn/metrics/_pairwise_distances_reduction/_radius_neighbors_classmode.pyx.tp
index 25067b43cd20c..b63ef5cd92f1c 100644
--- a/sklearn/metrics/_pairwise_distances_reduction/_radius_neighbors_classmode.pyx.tp
+++ b/sklearn/metrics/_pairwise_distances_reduction/_radius_neighbors_classmode.pyx.tp
@@ -8,7 +8,7 @@ from ...utils._typedefs cimport intp_t, float64_t
 
 import numpy as np
 from scipy.sparse import issparse
-from ...utils.fixes import threadpool_limits
+from ...utils.parallel import _get_threadpool_controller
 
 
 {{for name_suffix in ["32", "64"]}}
@@ -60,7 +60,7 @@ cdef class RadiusNeighborsClassMode{{name_suffix}}(RadiusNeighbors{{name_suffix}
 
         # Limit the number of threads in second level of nested parallelism for BLAS
         # to avoid threads over-subscription (in GEMM for instance).
-        with threadpool_limits(limits=1, user_api="blas"):
+        with _get_threadpool_controller().limit(limits=1, user_api="blas"):
             if pda.execute_in_parallel_on_Y:
                 pda._parallel_on_Y()
             else:
diff --git a/sklearn/metrics/_pairwise_distances_reduction/meson.build b/sklearn/metrics/_pairwise_distances_reduction/meson.build
index e22cf70164f7f..52ea6062da26b 100644
--- a/sklearn/metrics/_pairwise_distances_reduction/meson.build
+++ b/sklearn/metrics/_pairwise_distances_reduction/meson.build
@@ -11,6 +11,11 @@
 # needed for the cimport to work
 _pairwise_distances_reduction_cython_tree = [
   fs.copyfile('__init__.py'),
+  # We are in a sub-module of metrics, so we always need to have
+  # sklearn/metrics/__init__.py copied to the build directory to avoid the
+  # error:
+  # relative cimport beyond main package is not allowed
+  metrics_cython_tree
 ]
 
 _classmode_pxd = fs.copyfile('_classmode.pxd')
@@ -26,11 +31,14 @@ _datasets_pair_pyx = custom_target(
   output: '_datasets_pair.pyx',
   input: '_datasets_pair.pyx.tp',
   command: [py, tempita, '@INPUT@', '-o', '@OUTDIR@'],
+  # TODO in principle this should go in py.exension_module below. This is
+  # temporary work-around for dependency issue with .pyx.tp files. For more
+  # details, see https://github.com/mesonbuild/meson/issues/13212
+  depends: [_datasets_pair_pxd, _pairwise_distances_reduction_cython_tree, utils_cython_tree],
 )
 _datasets_pair = py.extension_module(
   '_datasets_pair',
-  [_datasets_pair_pxd, _datasets_pair_pyx,
-    _pairwise_distances_reduction_cython_tree, utils_cython_tree],
+  _datasets_pair_pyx,
   dependencies: [np_dep, openmp_dep],
   override_options: ['cython_language=cpp'],
   cython_args: cython_args,
@@ -49,12 +57,15 @@ _base_pyx = custom_target(
   output: '_base.pyx',
   input: '_base.pyx.tp',
   command: [py, tempita, '@INPUT@', '-o', '@OUTDIR@'],
+  # TODO in principle this should go in py.exension_module below. This is
+  # temporary work-around for dependency issue with .pyx.tp files. For more
+  # details, see https://github.com/mesonbuild/meson/issues/13212
+  depends: [_base_pxd, _pairwise_distances_reduction_cython_tree,
+            _datasets_pair_pxd, utils_cython_tree],
 )
 _base = py.extension_module(
   '_base',
-  [_base_pxd, _base_pyx,
-   _pairwise_distances_reduction_cython_tree,
-   _datasets_pair_pxd, utils_cython_tree],
+  _base_pyx,
   dependencies: [np_dep, openmp_dep],
   override_options: ['cython_language=cpp'],
   cython_args: cython_args,
@@ -73,11 +84,16 @@ _middle_term_computer_pyx = custom_target(
   output: '_middle_term_computer.pyx',
   input: '_middle_term_computer.pyx.tp',
   command: [py, tempita, '@INPUT@', '-o', '@OUTDIR@'],
+  # TODO in principle this should go in py.exension_module below. This is
+  # temporary work-around for dependency issue with .pyx.tp files. For more
+  # details, see https://github.com/mesonbuild/meson/issues/13212
+  depends: [_middle_term_computer_pxd,
+            _pairwise_distances_reduction_cython_tree,
+            utils_cython_tree],
 )
 _middle_term_computer = py.extension_module(
   '_middle_term_computer',
-  [_middle_term_computer_pxd, _middle_term_computer_pyx,
-   _pairwise_distances_reduction_cython_tree, utils_cython_tree],
+  _middle_term_computer_pyx,
   dependencies: [np_dep, openmp_dep],
   override_options: ['cython_language=cpp'],
   cython_args: cython_args,
@@ -96,13 +112,16 @@ _argkmin_pyx = custom_target(
     output: '_argkmin.pyx',
     input: '_argkmin.pyx.tp',
     command: [py, tempita, '@INPUT@', '-o', '@OUTDIR@'],
-  )
+    # TODO in principle this should go in py.exension_module below. This is
+    # temporary work-around for dependency issue with .pyx.tp files. For more
+    # details, see https://github.com/mesonbuild/meson/issues/13212
+    depends: [_argkmin_pxd,
+              _pairwise_distances_reduction_cython_tree,
+              _datasets_pair_pxd, _base_pxd, _middle_term_computer_pxd],
+      )
 _argkmin = py.extension_module(
     '_argkmin',
-    [_argkmin_pxd, _argkmin_pyx,
-     _pairwise_distances_reduction_cython_tree,
-     _datasets_pair_pxd, _base_pxd, _middle_term_computer_pxd,
-     utils_cython_tree],
+    _argkmin_pyx,
     dependencies: [np_dep, openmp_dep],
     override_options: ['cython_language=cpp'],
     cython_args: cython_args,
@@ -121,12 +140,16 @@ _radius_neighbors_pyx = custom_target(
     output: '_radius_neighbors.pyx',
     input: '_radius_neighbors.pyx.tp',
     command: [py, tempita, '@INPUT@', '-o', '@OUTDIR@'],
-  )
+    # TODO in principle this should go in py.exension_module below. This is
+    # temporary work-around for dependency issue with .pyx.tp files. For more
+    # details, see https://github.com/mesonbuild/meson/issues/13212
+    depends: [_radius_neighbors_pxd,
+              _datasets_pair_pxd, _base_pxd, _middle_term_computer_pxd,
+              _pairwise_distances_reduction_cython_tree, utils_cython_tree],
+)
 _radius_neighbors = py.extension_module(
     '_radius_neighbors',
-    [_radius_neighbors_pxd, _radius_neighbors_pyx,
-     _datasets_pair_pxd, _base_pxd, _middle_term_computer_pxd,
-     _pairwise_distances_reduction_cython_tree, utils_cython_tree],
+    _radius_neighbors_pyx,
     dependencies: [np_dep, openmp_dep],
     override_options: ['cython_language=cpp'],
     cython_args: cython_args,
@@ -139,12 +162,16 @@ _argkmin_classmode_pyx = custom_target(
   output: '_argkmin_classmode.pyx',
   input: '_argkmin_classmode.pyx.tp',
   command: [py, tempita, '@INPUT@', '-o', '@OUTDIR@'],
+  # TODO in principle this should go in py.exension_module below. This is
+  # temporary work-around for dependency issue with .pyx.tp files. For more
+  # details, see https://github.com/mesonbuild/meson/issues/13212
+  depends: [_classmode_pxd,
+            _argkmin_pxd, _pairwise_distances_reduction_cython_tree,
+            _datasets_pair_pxd, _base_pxd, _middle_term_computer_pxd, utils_cython_tree],
 )
 _argkmin_classmode = py.extension_module(
   '_argkmin_classmode',
-  [_argkmin_classmode_pyx, _classmode_pxd,
-   _argkmin_pxd, _pairwise_distances_reduction_cython_tree,
-   _datasets_pair_pxd, _base_pxd, _middle_term_computer_pxd, utils_cython_tree],
+  _argkmin_classmode_pyx,
   dependencies: [np_dep],
   override_options: ['cython_language=cpp'],
   cython_args: cython_args,
@@ -161,13 +188,17 @@ _radius_neighbors_classmode_pyx = custom_target(
   output: '_radius_neighbors_classmode.pyx',
   input: '_radius_neighbors_classmode.pyx.tp',
   command: [py, tempita, '@INPUT@', '-o', '@OUTDIR@'],
+  # TODO in principle this should go in py.exension_module below. This is
+  # temporary work-around for dependency issue with .pyx.tp files. For more
+  # details, see https://github.com/mesonbuild/meson/issues/13212
+  depends: [_classmode_pxd,
+            _middle_term_computer_pxd, _radius_neighbors_pxd,
+            _pairwise_distances_reduction_cython_tree,
+            _datasets_pair_pxd, _base_pxd, utils_cython_tree],
 )
 _radius_neighbors_classmode = py.extension_module(
   '_radius_neighbors_classmode',
-  [_radius_neighbors_classmode_pyx, _classmode_pxd,
-  _middle_term_computer_pxd, _radius_neighbors_pxd,
-  _pairwise_distances_reduction_cython_tree,
-  _datasets_pair_pxd, _base_pxd, utils_cython_tree],
+  _radius_neighbors_classmode_pyx,
   dependencies: [np_dep],
   override_options: ['cython_language=cpp'],
   cython_args: cython_args,
diff --git a/sklearn/metrics/_pairwise_fast.pyx b/sklearn/metrics/_pairwise_fast.pyx
index fd05a56a46ef5..bf4ded09b2610 100644
--- a/sklearn/metrics/_pairwise_fast.pyx
+++ b/sklearn/metrics/_pairwise_fast.pyx
@@ -1,8 +1,5 @@
-# Author: Andreas Mueller <amueller@ais.uni-bonn.de>
-#         Lars Buitinck
-#         Paolo Toccaceli
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from cython cimport floating
 from cython.parallel cimport prange
diff --git a/sklearn/metrics/_plot/tests/test_precision_recall_display.py b/sklearn/metrics/_plot/tests/test_precision_recall_display.py
index 0173e5338d722..1a5a3f70545a3 100644
--- a/sklearn/metrics/_plot/tests/test_precision_recall_display.py
+++ b/sklearn/metrics/_plot/tests/test_precision_recall_display.py
@@ -2,6 +2,7 @@
 
 import numpy as np
 import pytest
+from scipy.integrate import trapezoid
 
 from sklearn.compose import make_column_transformer
 from sklearn.datasets import load_breast_cancer, make_classification
@@ -16,7 +17,6 @@
 from sklearn.pipeline import make_pipeline
 from sklearn.preprocessing import StandardScaler
 from sklearn.utils import shuffle
-from sklearn.utils.fixes import trapezoid
 
 # TODO: Remove when https://github.com/numpy/numpy/issues/14397 is resolved
 pytestmark = pytest.mark.filterwarnings(
diff --git a/sklearn/metrics/_plot/tests/test_roc_curve_display.py b/sklearn/metrics/_plot/tests/test_roc_curve_display.py
index 8fd9f96576518..a4f4d81fb9ded 100644
--- a/sklearn/metrics/_plot/tests/test_roc_curve_display.py
+++ b/sklearn/metrics/_plot/tests/test_roc_curve_display.py
@@ -1,6 +1,7 @@
 import numpy as np
 import pytest
 from numpy.testing import assert_allclose
+from scipy.integrate import trapezoid
 
 from sklearn.compose import make_column_transformer
 from sklearn.datasets import load_breast_cancer, load_iris
@@ -11,7 +12,6 @@
 from sklearn.pipeline import make_pipeline
 from sklearn.preprocessing import StandardScaler
 from sklearn.utils import shuffle
-from sklearn.utils.fixes import trapezoid
 
 
 @pytest.fixture(scope="module")
diff --git a/sklearn/metrics/_ranking.py b/sklearn/metrics/_ranking.py
index e31b06a926dd1..4bc18ed72e3b3 100644
--- a/sklearn/metrics/_ranking.py
+++ b/sklearn/metrics/_ranking.py
@@ -7,16 +7,8 @@
 the lower the better.
 """
 
-# Authors: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#          Mathieu Blondel <mathieu@mblondel.org>
-#          Olivier Grisel <olivier.grisel@ensta.org>
-#          Arnaud Joly <a.joly@ulg.ac.be>
-#          Jochen Wersdorfer <jochen@wersdoerfer.de>
-#          Lars Buitinck
-#          Joel Nothman <joel.nothman@gmail.com>
-#          Noel Dawe <noel@dawe.me>
-#          Michal Karbownik <michakarbownik@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 import warnings
@@ -24,6 +16,7 @@
 from numbers import Integral, Real
 
 import numpy as np
+from scipy.integrate import trapezoid
 from scipy.sparse import csr_matrix, issparse
 from scipy.stats import rankdata
 
@@ -38,7 +31,6 @@
 from ..utils._encode import _encode, _unique
 from ..utils._param_validation import Hidden, Interval, StrOptions, validate_params
 from ..utils.extmath import stable_cumsum
-from ..utils.fixes import trapezoid
 from ..utils.multiclass import type_of_target
 from ..utils.sparsefuncs import count_nonzero
 from ..utils.validation import _check_pos_label_consistency, _check_sample_weight
@@ -1672,7 +1664,7 @@ def dcg_score(
     --------
     >>> import numpy as np
     >>> from sklearn.metrics import dcg_score
-    >>> # we have groud-truth relevance of some answers to a query:
+    >>> # we have ground-truth relevance of some answers to a query:
     >>> true_relevance = np.asarray([[10, 0, 0, 1, 5]])
     >>> # we predict scores for the answers
     >>> scores = np.asarray([[.1, .2, .3, 4, 70]])
@@ -1832,7 +1824,7 @@ def ndcg_score(y_true, y_score, *, k=None, sample_weight=None, ignore_ties=False
     --------
     >>> import numpy as np
     >>> from sklearn.metrics import ndcg_score
-    >>> # we have groud-truth relevance of some answers to a query:
+    >>> # we have ground-truth relevance of some answers to a query:
     >>> true_relevance = np.asarray([[10, 0, 0, 1, 5]])
     >>> # we predict some scores (relevance) for the answers
     >>> scores = np.asarray([[.1, .2, .3, 4, 70]])
diff --git a/sklearn/metrics/_regression.py b/sklearn/metrics/_regression.py
index ad5c76810f36a..482d5dc260b31 100644
--- a/sklearn/metrics/_regression.py
+++ b/sklearn/metrics/_regression.py
@@ -7,25 +7,8 @@
 the lower the better.
 """
 
-# Authors: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#          Mathieu Blondel <mathieu@mblondel.org>
-#          Olivier Grisel <olivier.grisel@ensta.org>
-#          Arnaud Joly <a.joly@ulg.ac.be>
-#          Jochen Wersdorfer <jochen@wersdoerfer.de>
-#          Lars Buitinck
-#          Joel Nothman <joel.nothman@gmail.com>
-#          Karan Desai <karandesai281196@gmail.com>
-#          Noel Dawe <noel@dawe.me>
-#          Manoj Kumar <manojkumarsivaraj334@gmail.com>
-#          Michael Eickenberg <michael.eickenberg@gmail.com>
-#          Konstantin Shmelkov <konstantin.shmelkov@polytechnique.edu>
-#          Christian Lorentzen <lorentzen.ch@gmail.com>
-#          Ashutosh Hathidara <ashutoshhathidara98@gmail.com>
-#          Uttam kumar <bajiraouttamsinha@gmail.com>
-#          Sylvain Marie <sylvain.marie@se.com>
-#          Ohad Michel <ohadmich@gmail.com>
-#          Alejandro Martin Gil <almagil98@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from numbers import Real
@@ -37,8 +20,9 @@
 from ..utils._array_api import (
     _average,
     _find_matching_floating_dtype,
-    device,
     get_namespace,
+    get_namespace_and_device,
+    size,
 )
 from ..utils._param_validation import Hidden, Interval, StrOptions, validate_params
 from ..utils.stats import _weighted_percentile
@@ -138,10 +122,10 @@ def _check_reg_targets(y_true, y_pred, multioutput, dtype="numeric", xp=None):
         multioutput = check_array(multioutput, ensure_2d=False)
         if n_outputs == 1:
             raise ValueError("Custom weights are useful only in multi-output cases.")
-        elif n_outputs != len(multioutput):
+        elif n_outputs != multioutput.shape[0]:
             raise ValueError(
-                "There must be equally many custom weights (%d) as outputs (%d)."
-                % (len(multioutput), n_outputs)
+                "There must be equally many custom weights "
+                f"({multioutput.shape[0]}) as outputs ({n_outputs})."
             )
     y_type = "continuous" if n_outputs == 1 else "continuous-multioutput"
 
@@ -188,7 +172,7 @@ def mean_absolute_error(
 
     Returns
     -------
-    loss : float or ndarray of floats
+    loss : float or array of floats
         If multioutput is 'raw_values', then mean absolute error is returned
         for each output separately.
         If multioutput is 'uniform_average' or an ndarray of weights, then the
@@ -212,11 +196,19 @@ def mean_absolute_error(
     >>> mean_absolute_error(y_true, y_pred, multioutput=[0.3, 0.7])
     0.85...
     """
-    y_type, y_true, y_pred, multioutput = _check_reg_targets(
-        y_true, y_pred, multioutput
+    input_arrays = [y_true, y_pred, sample_weight, multioutput]
+    xp, _ = get_namespace(*input_arrays)
+
+    dtype = _find_matching_floating_dtype(y_true, y_pred, sample_weight, xp=xp)
+
+    _, y_true, y_pred, multioutput = _check_reg_targets(
+        y_true, y_pred, multioutput, dtype=dtype, xp=xp
     )
     check_consistent_length(y_true, y_pred, sample_weight)
-    output_errors = np.average(np.abs(y_pred - y_true), weights=sample_weight, axis=0)
+
+    output_errors = _average(
+        xp.abs(y_pred - y_true), weights=sample_weight, axis=0, xp=xp
+    )
     if isinstance(multioutput, str):
         if multioutput == "raw_values":
             return output_errors
@@ -224,7 +216,15 @@ def mean_absolute_error(
             # pass None as weights to np.average: uniform mean
             multioutput = None
 
-    return np.average(output_errors, weights=multioutput)
+    # Average across the outputs (if needed).
+    mean_absolute_error = _average(output_errors, weights=multioutput)
+
+    # Since `y_pred.ndim <= 2` and `y_true.ndim <= 2`, the second call to _average
+    # should always return a scalar array that we convert to a Python float to
+    # consistently return the same eager evaluated value, irrespective of the
+    # Array API implementation.
+    assert mean_absolute_error.shape == ()
+    return float(mean_absolute_error)
 
 
 @validate_params(
@@ -395,21 +395,30 @@ def mean_absolute_percentage_error(
     >>> mean_absolute_percentage_error(y_true, y_pred)
     112589990684262.48
     """
+    input_arrays = [y_true, y_pred, sample_weight, multioutput]
+    xp, _ = get_namespace(*input_arrays)
+    dtype = _find_matching_floating_dtype(y_true, y_pred, sample_weight, xp=xp)
+
     y_type, y_true, y_pred, multioutput = _check_reg_targets(
         y_true, y_pred, multioutput
     )
     check_consistent_length(y_true, y_pred, sample_weight)
-    epsilon = np.finfo(np.float64).eps
-    mape = np.abs(y_pred - y_true) / np.maximum(np.abs(y_true), epsilon)
-    output_errors = np.average(mape, weights=sample_weight, axis=0)
+    epsilon = xp.asarray(xp.finfo(xp.float64).eps, dtype=dtype)
+    y_true_abs = xp.asarray(xp.abs(y_true), dtype=dtype)
+    mape = xp.asarray(xp.abs(y_pred - y_true), dtype=dtype) / xp.maximum(
+        y_true_abs, epsilon
+    )
+    output_errors = _average(mape, weights=sample_weight, axis=0)
     if isinstance(multioutput, str):
         if multioutput == "raw_values":
             return output_errors
         elif multioutput == "uniform_average":
-            # pass None as weights to np.average: uniform mean
+            # pass None as weights to _average: uniform mean
             multioutput = None
 
-    return np.average(output_errors, weights=multioutput)
+    mean_absolute_percentage_error = _average(output_errors, weights=multioutput)
+    assert mean_absolute_percentage_error.shape == ()
+    return float(mean_absolute_percentage_error)
 
 
 @validate_params(
@@ -466,7 +475,7 @@ def mean_squared_error(
 
     Returns
     -------
-    loss : float or ndarray of floats
+    loss : float or array of floats
         A non-negative floating point value (the best value is 0.0), or an
         array of floating point values, one for each individual target.
 
@@ -502,11 +511,14 @@ def mean_squared_error(
                 y_true, y_pred, sample_weight=sample_weight, multioutput=multioutput
             )
 
+    xp, _ = get_namespace(y_true, y_pred, sample_weight, multioutput)
+    dtype = _find_matching_floating_dtype(y_true, y_pred, xp=xp)
+
     y_type, y_true, y_pred, multioutput = _check_reg_targets(
-        y_true, y_pred, multioutput
+        y_true, y_pred, multioutput, dtype=dtype, xp=xp
     )
     check_consistent_length(y_true, y_pred, sample_weight)
-    output_errors = np.average((y_true - y_pred) ** 2, axis=0, weights=sample_weight)
+    output_errors = _average((y_true - y_pred) ** 2, axis=0, weights=sample_weight)
 
     if isinstance(multioutput, str):
         if multioutput == "raw_values":
@@ -515,7 +527,10 @@ def mean_squared_error(
             # pass None as weights to np.average: uniform mean
             multioutput = None
 
-    return np.average(output_errors, weights=multioutput)
+    # See comment in mean_absolute_error
+    mean_squared_error = _average(output_errors, weights=multioutput)
+    assert mean_squared_error.shape == ()
+    return float(mean_squared_error)
 
 
 @validate_params(
@@ -907,7 +922,7 @@ def _assemble_r2_explained_variance(
         avg_weights = multioutput
 
     result = _average(output_scores, weights=avg_weights)
-    if result.size == 1:
+    if size(result) == 1:
         return float(result)
     return result
 
@@ -1194,9 +1209,9 @@ def r2_score(
     >>> r2_score(y_true, y_pred, force_finite=False)
     -inf
     """
-    input_arrays = [y_true, y_pred, sample_weight, multioutput]
-    xp, _ = get_namespace(*input_arrays)
-    device_ = device(*input_arrays)
+    xp, _, device_ = get_namespace_and_device(
+        y_true, y_pred, sample_weight, multioutput
+    )
 
     dtype = _find_matching_floating_dtype(y_true, y_pred, sample_weight, xp=xp)
 
@@ -1267,21 +1282,25 @@ def max_error(y_true, y_pred):
     >>> max_error(y_true, y_pred)
     1
     """
+    xp, _ = get_namespace(y_true, y_pred)
     y_type, y_true, y_pred, _ = _check_reg_targets(y_true, y_pred, None)
     if y_type == "continuous-multioutput":
         raise ValueError("Multioutput not supported in max_error")
-    return np.max(np.abs(y_true - y_pred))
+    return xp.max(xp.abs(y_true - y_pred))
 
 
 def _mean_tweedie_deviance(y_true, y_pred, sample_weight, power):
     """Mean Tweedie deviance regression loss."""
+    xp, _ = get_namespace(y_true, y_pred)
     p = power
+    zero = xp.asarray(0, dtype=y_true.dtype)
     if p < 0:
         # 'Extreme stable', y any real number, y_pred > 0
         dev = 2 * (
-            np.power(np.maximum(y_true, 0), 2 - p) / ((1 - p) * (2 - p))
-            - y_true * np.power(y_pred, 1 - p) / (1 - p)
-            + np.power(y_pred, 2 - p) / (2 - p)
+            xp.pow(xp.where(y_true > 0, y_true, zero), xp.asarray(2 - p))
+            / ((1 - p) * (2 - p))
+            - y_true * xp.pow(y_pred, xp.asarray(1 - p)) / (1 - p)
+            + xp.pow(y_pred, xp.asarray(2 - p)) / (2 - p)
         )
     elif p == 0:
         # Normal distribution, y and y_pred any real number
@@ -1291,15 +1310,14 @@ def _mean_tweedie_deviance(y_true, y_pred, sample_weight, power):
         dev = 2 * (xlogy(y_true, y_true / y_pred) - y_true + y_pred)
     elif p == 2:
         # Gamma distribution
-        dev = 2 * (np.log(y_pred / y_true) + y_true / y_pred - 1)
+        dev = 2 * (xp.log(y_pred / y_true) + y_true / y_pred - 1)
     else:
         dev = 2 * (
-            np.power(y_true, 2 - p) / ((1 - p) * (2 - p))
-            - y_true * np.power(y_pred, 1 - p) / (1 - p)
-            + np.power(y_pred, 2 - p) / (2 - p)
+            xp.pow(y_true, xp.asarray(2 - p)) / ((1 - p) * (2 - p))
+            - y_true * xp.pow(y_pred, xp.asarray(1 - p)) / (1 - p)
+            + xp.pow(y_pred, xp.asarray(2 - p)) / (2 - p)
         )
-
-    return np.average(dev, weights=sample_weight)
+    return float(_average(dev, weights=sample_weight))
 
 
 @validate_params(
@@ -1362,8 +1380,9 @@ def mean_tweedie_deviance(y_true, y_pred, *, sample_weight=None, power=0):
     >>> mean_tweedie_deviance(y_true, y_pred, power=1)
     1.4260...
     """
+    xp, _ = get_namespace(y_true, y_pred)
     y_type, y_true, y_pred, _ = _check_reg_targets(
-        y_true, y_pred, None, dtype=[np.float64, np.float32]
+        y_true, y_pred, None, dtype=[xp.float64, xp.float32]
     )
     if y_type == "continuous-multioutput":
         raise ValueError("Multioutput not supported in mean_tweedie_deviance")
@@ -1376,18 +1395,18 @@ def mean_tweedie_deviance(y_true, y_pred, *, sample_weight=None, power=0):
     message = f"Mean Tweedie deviance error with power={power} can only be used on "
     if power < 0:
         # 'Extreme stable', y any real number, y_pred > 0
-        if (y_pred <= 0).any():
+        if xp.any(y_pred <= 0):
             raise ValueError(message + "strictly positive y_pred.")
     elif power == 0:
         # Normal, y and y_pred can be any real number
         pass
     elif 1 <= power < 2:
         # Poisson and compound Poisson distribution, y >= 0, y_pred > 0
-        if (y_true < 0).any() or (y_pred <= 0).any():
+        if xp.any(y_true < 0) or xp.any(y_pred <= 0):
             raise ValueError(message + "non-negative y and strictly positive y_pred.")
     elif power >= 2:
         # Gamma and Extreme stable distribution, y and y_pred > 0
-        if (y_true <= 0).any() or (y_pred <= 0).any():
+        if xp.any(y_true <= 0) or xp.any(y_pred <= 0):
             raise ValueError(message + "strictly positive y and y_pred.")
     else:  # pragma: nocover
         # Unreachable statement
@@ -1574,8 +1593,10 @@ def d2_tweedie_score(y_true, y_pred, *, sample_weight=None, power=0):
     >>> d2_tweedie_score(y_true, y_true, power=2)
     1.0
     """
+    xp, _ = get_namespace(y_true, y_pred)
+
     y_type, y_true, y_pred, _ = _check_reg_targets(
-        y_true, y_pred, None, dtype=[np.float64, np.float32]
+        y_true, y_pred, None, dtype=[xp.float64, xp.float32], xp=xp
     )
     if y_type == "continuous-multioutput":
         raise ValueError("Multioutput not supported in d2_tweedie_score")
@@ -1585,12 +1606,12 @@ def d2_tweedie_score(y_true, y_pred, *, sample_weight=None, power=0):
         warnings.warn(msg, UndefinedMetricWarning)
         return float("nan")
 
-    y_true, y_pred = np.squeeze(y_true), np.squeeze(y_pred)
+    y_true, y_pred = xp.squeeze(y_true, axis=1), xp.squeeze(y_pred, axis=1)
     numerator = mean_tweedie_deviance(
         y_true, y_pred, sample_weight=sample_weight, power=power
     )
 
-    y_avg = np.average(y_true, weights=sample_weight)
+    y_avg = _average(y_true, weights=sample_weight, xp=xp)
     denominator = _mean_tweedie_deviance(
         y_true, y_avg, sample_weight=sample_weight, power=power
     )
diff --git a/sklearn/metrics/_scorer.py b/sklearn/metrics/_scorer.py
index 7c5321b04730f..c1a916aa0b5f3 100644
--- a/sklearn/metrics/_scorer.py
+++ b/sklearn/metrics/_scorer.py
@@ -32,6 +32,7 @@
 from ..utils.metadata_routing import (
     MetadataRequest,
     MetadataRouter,
+    MethodMapping,
     _MetadataRequester,
     _raise_for_params,
     _routing_enabled,
@@ -45,6 +46,7 @@
     balanced_accuracy_score,
     brier_score_loss,
     class_likelihood_ratios,
+    d2_absolute_error_score,
     explained_variance_score,
     f1_score,
     jaccard_score,
@@ -187,11 +189,31 @@ def get_metadata_routing(self):
             routing information.
         """
         return MetadataRouter(owner=self.__class__.__name__).add(
-            **self._scorers, method_mapping="score"
+            **self._scorers,
+            method_mapping=MethodMapping().add(caller="score", callee="score"),
         )
 
 
 class _BaseScorer(_MetadataRequester):
+    """Base scorer that is used as `scorer(estimator, X, y_true)`.
+
+    Parameters
+    ----------
+    score_func : callable
+        The score function to use. It will be called as
+        `score_func(y_true, y_pred, **kwargs)`.
+
+    sign : int
+        Either 1 or -1 to returns the score with `sign * score_func(estimator, X, y)`.
+        Thus, `sign` defined if higher scores are better or worse.
+
+    kwargs : dict
+        Additional parameters to pass to the score function.
+
+    response_method : str
+        The method to call on the estimator to get the response values.
+    """
+
     def __init__(self, score_func, sign, kwargs, response_method="predict"):
         self._score_func = score_func
         self._sign = sign
@@ -410,14 +432,31 @@ def get_scorer(scoring):
     return scorer
 
 
-class _PassthroughScorer:
+class _PassthroughScorer(_MetadataRequester):
+    # Passes scoring of estimator's `score` method back to estimator if scoring
+    # is `None`.
+
     def __init__(self, estimator):
         self._estimator = estimator
 
+        requests = MetadataRequest(owner=self.__class__.__name__)
+        try:
+            requests.score = copy.deepcopy(estimator._metadata_request.score)
+        except AttributeError:
+            try:
+                requests.score = copy.deepcopy(estimator._get_default_requests().score)
+            except AttributeError:
+                pass
+
+        self._metadata_request = requests
+
     def __call__(self, estimator, *args, **kwargs):
         """Method that wraps estimator.score"""
         return estimator.score(*args, **kwargs)
 
+    def __repr__(self):
+        return f"{self._estimator.__class__}.score"
+
     def get_metadata_routing(self):
         """Get requested data properties.
 
@@ -432,13 +471,32 @@ def get_metadata_routing(self):
             A :class:`~utils.metadata_routing.MetadataRouter` encapsulating
             routing information.
         """
-        # This scorer doesn't do any validation or routing, it only exposes the
-        # requests of the given estimator. This object behaves as a consumer
-        # rather than a router. Ideally it only exposes the score requests to
-        # the parent object; however, that requires computing the routing for
-        # meta-estimators, which would be more time consuming than simply
-        # returning the child object's requests.
-        return get_routing_for_object(self._estimator)
+        return get_routing_for_object(self._metadata_request)
+
+    def set_score_request(self, **kwargs):
+        """Set requested parameters by the scorer.
+
+        Please see :ref:`User Guide <metadata_routing>` on how the routing
+        mechanism works.
+
+        .. versionadded:: 1.5
+
+        Parameters
+        ----------
+        kwargs : dict
+            Arguments should be of the form ``param_name=alias``, and `alias`
+            can be one of ``{True, False, None, str}``.
+        """
+        if not _routing_enabled():
+            raise RuntimeError(
+                "This method is only available when metadata routing is enabled."
+                " You can enable it using"
+                " sklearn.set_config(enable_metadata_routing=True)."
+            )
+
+        for param, alias in kwargs.items():
+            self._metadata_request.score.add_request(param=param, alias=alias)
+        return self
 
 
 def _check_multimetric_scoring(estimator, scoring):
@@ -727,6 +785,7 @@ def make_scorer(
 neg_mean_gamma_deviance_scorer = make_scorer(
     mean_gamma_deviance, greater_is_better=False
 )
+d2_absolute_error_scorer = make_scorer(d2_absolute_error_score)
 
 # Standard Classification Scores
 accuracy_scorer = make_scorer(accuracy_score)
@@ -819,6 +878,7 @@ def negative_likelihood_ratio(y_true, y_pred):
     neg_root_mean_squared_log_error=neg_root_mean_squared_log_error_scorer,
     neg_mean_poisson_deviance=neg_mean_poisson_deviance_scorer,
     neg_mean_gamma_deviance=neg_mean_gamma_deviance_scorer,
+    d2_absolute_error_score=d2_absolute_error_scorer,
     accuracy=accuracy_scorer,
     top_k_accuracy=top_k_accuracy_scorer,
     roc_auc=roc_auc_scorer,
@@ -895,10 +955,11 @@ def get_scorer_names():
             None,
         ],
         "allow_none": ["boolean"],
+        "raise_exc": ["boolean"],
     },
     prefer_skip_nested_validation=True,
 )
-def check_scoring(estimator=None, scoring=None, *, allow_none=False):
+def check_scoring(estimator=None, scoring=None, *, allow_none=False, raise_exc=True):
     """Determine scorer from user options.
 
     A TypeError will be thrown if the estimator cannot be scored.
@@ -909,7 +970,7 @@ def check_scoring(estimator=None, scoring=None, *, allow_none=False):
         The object to use to fit the data. If `None`, then this function may error
         depending on `allow_none`.
 
-    scoring : str, callable, list, tuple, or dict, default=None
+    scoring : str, callable, list, tuple, set, or dict, default=None
         Scorer to use. If `scoring` represents a single score, one can use:
 
         - a single string (see :ref:`scoring_parameter`);
@@ -917,22 +978,35 @@ def check_scoring(estimator=None, scoring=None, *, allow_none=False):
 
         If `scoring` represents multiple scores, one can use:
 
-        - a list or tuple of unique strings;
-        - a callable returning a dictionary where the keys are the metric
-          names and the values are the metric scorers;
-        - a dictionary with metric names as keys and callables a values.
+        - a list, tuple or set of unique strings;
+        - a callable returning a dictionary where the keys are the metric names and the
+          values are the metric scorers;
+        - a dictionary with metric names as keys and callables a values. The callables
+          need to have the signature `callable(estimator, X, y)`.
 
         If None, the provided estimator object's `score` method is used.
 
     allow_none : bool, default=False
-        If no scoring is specified and the estimator has no score function, we
-        can either return None or raise an exception.
+        Whether to return None or raise an error if no `scoring` is specified and the
+        estimator has no `score` method.
+
+    raise_exc : bool, default=True
+        Whether to raise an exception (if a subset of the scorers in multimetric scoring
+        fails) or to return an error code.
+
+        - If set to `True`, raises the failing scorer's exception.
+        - If set to `False`, a formatted string of the exception details is passed as
+          result of the failing scorer(s).
+
+        This applies if `scoring` is list, tuple, set, or dict. Ignored if `scoring` is
+        a str or a callable.
+
+        .. versionadded:: 1.6
 
     Returns
     -------
     scoring : callable
-        A scorer callable object / function with signature
-        ``scorer(estimator, X, y)``.
+        A scorer callable object / function with signature ``scorer(estimator, X, y)``.
 
     Examples
     --------
@@ -944,6 +1018,19 @@ def check_scoring(estimator=None, scoring=None, *, allow_none=False):
     >>> scorer = check_scoring(classifier, scoring='accuracy')
     >>> scorer(classifier, X, y)
     0.96...
+
+    >>> from sklearn.metrics import make_scorer, accuracy_score, mean_squared_log_error
+    >>> X, y = load_iris(return_X_y=True)
+    >>> y *= -1
+    >>> clf = DecisionTreeClassifier().fit(X, y)
+    >>> scoring = {
+    ...     "accuracy": make_scorer(accuracy_score),
+    ...     "mean_squared_log_error": make_scorer(mean_squared_log_error),
+    ... }
+    >>> scoring_call = check_scoring(estimator=clf, scoring=scoring, raise_exc=False)
+    >>> scores = scoring_call(clf, X, y)
+    >>> scores
+    {'accuracy': 1.0, 'mean_squared_log_error': 'Traceback ...'}
     """
     if isinstance(scoring, str):
         return get_scorer(scoring)
@@ -966,7 +1053,7 @@ def check_scoring(estimator=None, scoring=None, *, allow_none=False):
         return get_scorer(scoring)
     if isinstance(scoring, (list, tuple, set, dict)):
         scorers = _check_multimetric_scoring(estimator, scoring=scoring)
-        return _MultimetricScorer(scorers=scorers)
+        return _MultimetricScorer(scorers=scorers, raise_exc=raise_exc)
     if scoring is None:
         if hasattr(estimator, "score"):
             return _PassthroughScorer(estimator)
diff --git a/sklearn/metrics/cluster/__init__.py b/sklearn/metrics/cluster/__init__.py
index 44da911061bc8..776b2f2dbd063 100644
--- a/sklearn/metrics/cluster/__init__.py
+++ b/sklearn/metrics/cluster/__init__.py
@@ -1,9 +1,8 @@
-"""
-The :mod:`sklearn.metrics.cluster` submodule contains evaluation metrics for
-cluster analysis results. There are two forms of evaluation:
+"""Evaluation metrics for cluster analysis results.
 
-- supervised, which uses a ground truth class values for each sample.
-- unsupervised, which does not and measures the 'quality' of the model itself.
+- Supervised evaluation uses a ground truth class values for each sample.
+- Unsupervised evaluation does use ground truths and measures the "quality" of the
+  model itself.
 """
 
 from ._bicluster import consensus_score
diff --git a/sklearn/metrics/cluster/_bicluster.py b/sklearn/metrics/cluster/_bicluster.py
index 713d0bee8fa2e..ad2153878b37e 100644
--- a/sklearn/metrics/cluster/_bicluster.py
+++ b/sklearn/metrics/cluster/_bicluster.py
@@ -57,8 +57,9 @@ def _pairwise_similarity(a, b, similarity):
 def consensus_score(a, b, *, similarity="jaccard"):
     """The similarity of two sets of biclusters.
 
-    Similarity between individual biclusters is computed. Then the
-    best matching between sets is found using the Hungarian algorithm.
+    Similarity between individual biclusters is computed. Then the best
+    matching between sets is found by solving a linear sum assignment problem,
+    using a modified Jonker-Volgenant algorithm.
     The final score is the sum of similarities divided by the size of
     the larger set.
 
@@ -83,9 +84,12 @@ def consensus_score(a, b, *, similarity="jaccard"):
        Consensus score, a non-negative value, sum of similarities
        divided by size of larger set.
 
+    See Also
+    --------
+    scipy.optimize.linear_sum_assignment : Solve the linear sum assignment problem.
+
     References
     ----------
-
     * Hochreiter, Bodenhofer, et. al., 2010. `FABIA: factor analysis
       for bicluster acquisition
       <https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2881408/>`__.
diff --git a/sklearn/metrics/cluster/_expected_mutual_info_fast.pyx b/sklearn/metrics/cluster/_expected_mutual_info_fast.pyx
index 93316a3ebceb2..3d51def36c255 100644
--- a/sklearn/metrics/cluster/_expected_mutual_info_fast.pyx
+++ b/sklearn/metrics/cluster/_expected_mutual_info_fast.pyx
@@ -1,6 +1,5 @@
-# Authors: Robert Layton <robertlayton@gmail.com>
-#           Corey Lynch <coreylynch9@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from libc.math cimport exp, lgamma
 
diff --git a/sklearn/metrics/cluster/_supervised.py b/sklearn/metrics/cluster/_supervised.py
index 992b460329302..295a176cfcf26 100644
--- a/sklearn/metrics/cluster/_supervised.py
+++ b/sklearn/metrics/cluster/_supervised.py
@@ -4,16 +4,8 @@
 better.
 """
 
-# Authors: Olivier Grisel <olivier.grisel@ensta.org>
-#          Wei LI <kuantkid@gmail.com>
-#          Diego Molla <dmolla-aliod@gmail.com>
-#          Arnaud Fouchet <foucheta@gmail.com>
-#          Thierry Guillemot <thierry.guillemot.work@gmail.com>
-#          Gregory Stupp <stuppie@gmail.com>
-#          Joel Nothman <joel.nothman@gmail.com>
-#          Arya McCarthy <arya@jhu.edu>
-#          Uwe F Mayer <uwe_f_mayer@yahoo.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 import warnings
@@ -23,6 +15,7 @@
 import numpy as np
 from scipy import sparse as sp
 
+from ...utils._array_api import _max_precision_float_dtype, get_namespace_and_device
 from ...utils._param_validation import Interval, StrOptions, validate_params
 from ...utils.multiclass import type_of_target
 from ...utils.validation import check_array, check_consistent_length
@@ -188,12 +181,12 @@ def contingency_matrix(
     prefer_skip_nested_validation=True,
 )
 def pair_confusion_matrix(labels_true, labels_pred):
-    """Pair confusion matrix arising from two clusterings [1]_.
+    """Pair confusion matrix arising from two clusterings.
 
     The pair confusion matrix :math:`C` computes a 2 by 2 similarity matrix
     between two clusterings by considering all pairs of samples and counting
     pairs that are assigned into the same or into different clusters under
-    the true and predicted clusterings.
+    the true and predicted clusterings [1]_.
 
     Considering a pair of samples that is clustered together a positive pair,
     then as in binary classification the count of true negatives is
@@ -1282,17 +1275,20 @@ def entropy(labels):
     -----
     The logarithm used is the natural logarithm (base-e).
     """
-    if len(labels) == 0:
+    xp, is_array_api_compliant, device_ = get_namespace_and_device(labels)
+    labels_len = labels.shape[0] if is_array_api_compliant else len(labels)
+    if labels_len == 0:
         return 1.0
-    label_idx = np.unique(labels, return_inverse=True)[1]
-    pi = np.bincount(label_idx).astype(np.float64)
-    pi = pi[pi > 0]
+
+    pi = xp.astype(xp.unique_counts(labels)[1], _max_precision_float_dtype(xp, device_))
 
     # single cluster => zero entropy
     if pi.size == 1:
         return 0.0
 
-    pi_sum = np.sum(pi)
+    pi_sum = xp.sum(pi)
     # log(a / b) should be calculated as log(a) - log(b) for
     # possible loss of precision
-    return -np.sum((pi / pi_sum) * (np.log(pi) - log(pi_sum)))
+    # Always convert the result as a Python scalar (on CPU) instead of a device
+    # specific scalar array.
+    return float(-xp.sum((pi / pi_sum) * (xp.log(pi) - log(pi_sum))))
diff --git a/sklearn/metrics/cluster/_unsupervised.py b/sklearn/metrics/cluster/_unsupervised.py
index 8e032b971d54e..9f48fed054a5d 100644
--- a/sklearn/metrics/cluster/_unsupervised.py
+++ b/sklearn/metrics/cluster/_unsupervised.py
@@ -1,9 +1,7 @@
 """Unsupervised evaluation metrics."""
 
-# Authors: Robert Layton <robertlayton@gmail.com>
-#          Arnaud Fouchet <foucheta@gmail.com>
-#          Thierry Guillemot <thierry.guillemot.work@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 import functools
diff --git a/sklearn/metrics/cluster/tests/test_supervised.py b/sklearn/metrics/cluster/tests/test_supervised.py
index dfaa58ff62c01..077dca0854a01 100644
--- a/sklearn/metrics/cluster/tests/test_supervised.py
+++ b/sklearn/metrics/cluster/tests/test_supervised.py
@@ -4,6 +4,7 @@
 import pytest
 from numpy.testing import assert_allclose, assert_array_almost_equal, assert_array_equal
 
+from sklearn.base import config_context
 from sklearn.metrics.cluster import (
     adjusted_mutual_info_score,
     adjusted_rand_score,
@@ -22,7 +23,8 @@
 )
 from sklearn.metrics.cluster._supervised import _generalized_average, check_clusterings
 from sklearn.utils import assert_all_finite
-from sklearn.utils._testing import assert_almost_equal
+from sklearn.utils._array_api import yield_namespace_device_dtype_combinations
+from sklearn.utils._testing import _array_api_for_tests, assert_almost_equal
 
 score_funcs = [
     adjusted_rand_score,
@@ -254,12 +256,25 @@ def test_int_overflow_mutual_info_fowlkes_mallows_score():
 
 
 def test_entropy():
-    ent = entropy([0, 0, 42.0])
-    assert_almost_equal(ent, 0.6365141, 5)
+    assert_almost_equal(entropy([0, 0, 42.0]), 0.6365141, 5)
     assert_almost_equal(entropy([]), 1)
     assert entropy([1, 1, 1, 1]) == 0
 
 
+@pytest.mark.parametrize(
+    "array_namespace, device, dtype_name", yield_namespace_device_dtype_combinations()
+)
+def test_entropy_array_api(array_namespace, device, dtype_name):
+    xp = _array_api_for_tests(array_namespace, device)
+    float_labels = xp.asarray(np.asarray([0, 0, 42.0], dtype=dtype_name), device=device)
+    empty_int32_labels = xp.asarray([], dtype=xp.int32, device=device)
+    int_labels = xp.asarray([1, 1, 1, 1], device=device)
+    with config_context(array_api_dispatch=True):
+        assert entropy(float_labels) == pytest.approx(0.6365141, abs=1e-5)
+        assert entropy(empty_int32_labels) == 1
+        assert entropy(int_labels) == 0
+
+
 def test_contingency_matrix():
     labels_a = np.array([1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3])
     labels_b = np.array([1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 3, 1, 3, 3, 3, 2, 2])
diff --git a/sklearn/metrics/meson.build b/sklearn/metrics/meson.build
index 8ad49f5787539..ef7b202c6f89c 100644
--- a/sklearn/metrics/meson.build
+++ b/sklearn/metrics/meson.build
@@ -3,6 +3,8 @@
 metrics_cython_tree = [
   fs.copyfile('__init__.py')
 ]
+# Some metrics code cimports code from utils, we may as well copy all the necessary files
+metrics_cython_tree += utils_cython_tree
 
 _dist_metrics_pxd = custom_target(
   '_dist_metrics_pxd',
@@ -20,12 +22,16 @@ _dist_metrics_pyx = custom_target(
   '_dist_metrics_pyx',
   output: '_dist_metrics.pyx',
   input: '_dist_metrics.pyx.tp',
-  command: [py, tempita, '@INPUT@', '-o', '@OUTDIR@']
+  command: [py, tempita, '@INPUT@', '-o', '@OUTDIR@'],
+  # TODO in principle this should go in py.exension_module below. This is
+  # temporary work-around for dependency issue with .pyx.tp files. For more
+  # details, see https://github.com/mesonbuild/meson/issues/13212
+  depends: metrics_cython_tree,
 )
 
 _dist_metrics = py.extension_module(
   '_dist_metrics',
-  [_dist_metrics_pyx, utils_cython_tree, metrics_cython_tree],
+  _dist_metrics_pyx,
   dependencies: [np_dep],
   cython_args: cython_args,
   subdir: 'sklearn/metrics',
@@ -34,7 +40,7 @@ _dist_metrics = py.extension_module(
 
 py.extension_module(
   '_pairwise_fast',
-  ['_pairwise_fast.pyx', utils_cython_tree, metrics_cython_tree],
+  ['_pairwise_fast.pyx', metrics_cython_tree],
   cython_args: cython_args,
   subdir: 'sklearn/metrics',
   install: true
diff --git a/sklearn/metrics/pairwise.py b/sklearn/metrics/pairwise.py
index 6b2ea04002682..f8b163813d6d6 100644
--- a/sklearn/metrics/pairwise.py
+++ b/sklearn/metrics/pairwise.py
@@ -1,11 +1,7 @@
-# Authors: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#          Mathieu Blondel <mathieu@mblondel.org>
-#          Robert Layton <robertlayton@gmail.com>
-#          Andreas Mueller <amueller@ais.uni-bonn.de>
-#          Philippe Gervais <philippe.gervais@inria.fr>
-#          Lars Buitinck
-#          Joel Nothman <joel.nothman@gmail.com>
-# License: BSD 3 clause
+"""Metrics for pairwise distances and affinity of sets of samples."""
+
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import itertools
 import warnings
@@ -25,6 +21,16 @@
     gen_batches,
     gen_even_slices,
 )
+from ..utils._array_api import (
+    _clip,
+    _fill_or_add_to_diagonal,
+    _find_matching_floating_dtype,
+    _is_numpy_namespace,
+    _max_precision_float_dtype,
+    _modify_in_place_if_numpy,
+    get_namespace,
+    get_namespace_and_device,
+)
 from ..utils._chunking import get_chunk_n_rows
 from ..utils._mask import _get_mask
 from ..utils._missing import is_scalar_nan
@@ -154,7 +160,11 @@ def check_pairwise_arrays(
         An array equal to Y if Y was not None, guaranteed to be a numpy array.
         If Y was None, safe_Y will be a pointer to X.
     """
-    X, Y, dtype_float = _return_float_dtype(X, Y)
+    xp, _ = get_namespace(X, Y)
+    if any([issparse(X), issparse(Y)]) or _is_numpy_namespace(xp):
+        X, Y, dtype_float = _return_float_dtype(X, Y)
+    else:
+        dtype_float = _find_matching_floating_dtype(X, Y, xp=xp)
 
     estimator = "check_pairwise_arrays"
     if dtype == "infer_float":
@@ -330,13 +340,14 @@ def euclidean_distances(
     array([[1.        ],
            [1.41421356]])
     """
+    xp, _ = get_namespace(X, Y)
     X, Y = check_pairwise_arrays(X, Y)
 
     if X_norm_squared is not None:
         X_norm_squared = check_array(X_norm_squared, ensure_2d=False)
         original_shape = X_norm_squared.shape
         if X_norm_squared.shape == (X.shape[0],):
-            X_norm_squared = X_norm_squared.reshape(-1, 1)
+            X_norm_squared = xp.reshape(X_norm_squared, (-1, 1))
         if X_norm_squared.shape == (1, X.shape[0]):
             X_norm_squared = X_norm_squared.T
         if X_norm_squared.shape != (X.shape[0], 1):
@@ -349,7 +360,7 @@ def euclidean_distances(
         Y_norm_squared = check_array(Y_norm_squared, ensure_2d=False)
         original_shape = Y_norm_squared.shape
         if Y_norm_squared.shape == (Y.shape[0],):
-            Y_norm_squared = Y_norm_squared.reshape(1, -1)
+            Y_norm_squared = xp.reshape(Y_norm_squared, (1, -1))
         if Y_norm_squared.shape == (Y.shape[0], 1):
             Y_norm_squared = Y_norm_squared.T
         if Y_norm_squared.shape != (1, Y.shape[0]):
@@ -370,24 +381,25 @@ def _euclidean_distances(X, Y, X_norm_squared=None, Y_norm_squared=None, squared
     float32, norms needs to be recomputed on upcast chunks.
     TODO: use a float64 accumulator in row_norms to avoid the latter.
     """
-    if X_norm_squared is not None and X_norm_squared.dtype != np.float32:
-        XX = X_norm_squared.reshape(-1, 1)
-    elif X.dtype != np.float32:
-        XX = row_norms(X, squared=True)[:, np.newaxis]
+    xp, _, device_ = get_namespace_and_device(X, Y)
+    if X_norm_squared is not None and X_norm_squared.dtype != xp.float32:
+        XX = xp.reshape(X_norm_squared, (-1, 1))
+    elif X.dtype != xp.float32:
+        XX = row_norms(X, squared=True)[:, None]
     else:
         XX = None
 
     if Y is X:
         YY = None if XX is None else XX.T
     else:
-        if Y_norm_squared is not None and Y_norm_squared.dtype != np.float32:
-            YY = Y_norm_squared.reshape(1, -1)
-        elif Y.dtype != np.float32:
-            YY = row_norms(Y, squared=True)[np.newaxis, :]
+        if Y_norm_squared is not None and Y_norm_squared.dtype != xp.float32:
+            YY = xp.reshape(Y_norm_squared, (1, -1))
+        elif Y.dtype != xp.float32:
+            YY = row_norms(Y, squared=True)[None, :]
         else:
             YY = None
 
-    if X.dtype == np.float32 or Y.dtype == np.float32:
+    if X.dtype == xp.float32 or Y.dtype == xp.float32:
         # To minimize precision issues with float32, we compute the distance
         # matrix on chunks of X and Y upcast to float64
         distances = _euclidean_distances_upcast(X, XX, Y, YY)
@@ -396,14 +408,22 @@ def _euclidean_distances(X, Y, X_norm_squared=None, Y_norm_squared=None, squared
         distances = -2 * safe_sparse_dot(X, Y.T, dense_output=True)
         distances += XX
         distances += YY
-    np.maximum(distances, 0, out=distances)
+
+    xp_zero = xp.asarray(0, device=device_, dtype=distances.dtype)
+    distances = _modify_in_place_if_numpy(
+        xp, xp.maximum, distances, xp_zero, out=distances
+    )
 
     # Ensure that distances between vectors and themselves are set to 0.0.
     # This may not be the case due to floating point rounding errors.
     if X is Y:
-        np.fill_diagonal(distances, 0)
+        _fill_or_add_to_diagonal(distances, 0, xp=xp, add_value=False)
+
+    if squared:
+        return distances
 
-    return distances if squared else np.sqrt(distances, out=distances)
+    distances = _modify_in_place_if_numpy(xp, xp.sqrt, distances, out=distances)
+    return distances
 
 
 @validate_params(
@@ -547,15 +567,20 @@ def _euclidean_distances_upcast(X, XX=None, Y=None, YY=None, batch_size=None):
     X and Y are upcast to float64 by chunks, which size is chosen to limit
     memory increase by approximately 10% (at least 10MiB).
     """
+    xp, _, device_ = get_namespace_and_device(X, Y)
     n_samples_X = X.shape[0]
     n_samples_Y = Y.shape[0]
     n_features = X.shape[1]
 
-    distances = np.empty((n_samples_X, n_samples_Y), dtype=np.float32)
+    distances = xp.empty((n_samples_X, n_samples_Y), dtype=xp.float32, device=device_)
 
     if batch_size is None:
-        x_density = X.nnz / np.prod(X.shape) if issparse(X) else 1
-        y_density = Y.nnz / np.prod(Y.shape) if issparse(Y) else 1
+        x_density = (
+            X.nnz / xp.prod(X.shape) if issparse(X) else xp.asarray(1, device=device_)
+        )
+        y_density = (
+            Y.nnz / xp.prod(Y.shape) if issparse(Y) else xp.asarray(1, device=device_)
+        )
 
         # Allow 10% more memory than X, Y and the distance matrix take (at
         # least 10MiB)
@@ -575,15 +600,15 @@ def _euclidean_distances_upcast(X, XX=None, Y=None, YY=None, batch_size=None):
         # Hence x² + (xd+yd)kx = M, where x=batch_size, k=n_features, M=maxmem
         #                                 xd=x_density and yd=y_density
         tmp = (x_density + y_density) * n_features
-        batch_size = (-tmp + np.sqrt(tmp**2 + 4 * maxmem)) / 2
+        batch_size = (-tmp + xp.sqrt(tmp**2 + 4 * maxmem)) / 2
         batch_size = max(int(batch_size), 1)
 
     x_batches = gen_batches(n_samples_X, batch_size)
-
+    xp_max_float = _max_precision_float_dtype(xp=xp, device=device_)
     for i, x_slice in enumerate(x_batches):
-        X_chunk = X[x_slice].astype(np.float64)
+        X_chunk = xp.astype(X[x_slice], xp_max_float)
         if XX is None:
-            XX_chunk = row_norms(X_chunk, squared=True)[:, np.newaxis]
+            XX_chunk = row_norms(X_chunk, squared=True)[:, None]
         else:
             XX_chunk = XX[x_slice]
 
@@ -596,9 +621,9 @@ def _euclidean_distances_upcast(X, XX=None, Y=None, YY=None, batch_size=None):
                 d = distances[y_slice, x_slice].T
 
             else:
-                Y_chunk = Y[y_slice].astype(np.float64)
+                Y_chunk = xp.astype(Y[y_slice], xp_max_float)
                 if YY is None:
-                    YY_chunk = row_norms(Y_chunk, squared=True)[np.newaxis, :]
+                    YY_chunk = row_norms(Y_chunk, squared=True)[None, :]
                 else:
                     YY_chunk = YY[:, y_slice]
 
@@ -606,7 +631,7 @@ def _euclidean_distances_upcast(X, XX=None, Y=None, YY=None, batch_size=None):
                 d += XX_chunk
                 d += YY_chunk
 
-            distances[x_slice, y_slice] = d.astype(np.float32, copy=False)
+            distances[x_slice, y_slice] = xp.astype(d, xp.float32, copy=False)
 
     return distances
 
@@ -1115,15 +1140,17 @@ def cosine_distances(X, Y=None):
     array([[1.     , 1.     ],
            [0.42..., 0.18...]])
     """
+    xp, _ = get_namespace(X, Y)
+
     # 1.0 - cosine_similarity(X, Y) without copy
     S = cosine_similarity(X, Y)
     S *= -1
     S += 1
-    np.clip(S, 0, 2, out=S)
+    S = _clip(S, 0, 2, xp)
     if X is Y or Y is None:
         # Ensure that distances between vectors and themselves are set to 0.0.
         # This may not be the case due to floating point rounding errors.
-        np.fill_diagonal(S, 0.0)
+        _fill_or_add_to_diagonal(S, 0.0, xp, add_value=False)
     return S
 
 
@@ -1544,13 +1571,15 @@ def rbf_kernel(X, Y=None, gamma=None):
     array([[0.71..., 0.51...],
            [0.51..., 0.71...]])
     """
+    xp, _ = get_namespace(X, Y)
     X, Y = check_pairwise_arrays(X, Y)
     if gamma is None:
         gamma = 1.0 / X.shape[1]
 
     K = euclidean_distances(X, Y, squared=True)
     K *= -gamma
-    np.exp(K, K)  # exponentiate K in-place
+    # exponentiate K in-place when using numpy
+    K = _modify_in_place_if_numpy(xp, xp.exp, K, out=K)
     return K
 
 
@@ -1651,7 +1680,7 @@ def cosine_similarity(X, Y=None, dense_output=True):
 
     Returns
     -------
-    similarities : ndarray of shape (n_samples_X, n_samples_Y)
+    similarities : ndarray or sparse matrix of shape (n_samples_X, n_samples_Y)
         Returns the cosine similarity between samples in X and Y.
 
     Examples
@@ -1707,7 +1736,7 @@ def additive_chi2_kernel(X, Y=None):
 
     Returns
     -------
-    kernel : ndarray of shape (n_samples_X, n_samples_Y)
+    kernel : array-like of shape (n_samples_X, n_samples_Y)
         The kernel matrix.
 
     See Also
@@ -1739,15 +1768,26 @@ def additive_chi2_kernel(X, Y=None):
     array([[-1., -2.],
            [-2., -1.]])
     """
+    xp, _ = get_namespace(X, Y)
     X, Y = check_pairwise_arrays(X, Y, accept_sparse=False)
-    if (X < 0).any():
+    if xp.any(X < 0):
         raise ValueError("X contains negative values.")
-    if Y is not X and (Y < 0).any():
+    if Y is not X and xp.any(Y < 0):
         raise ValueError("Y contains negative values.")
 
-    result = np.zeros((X.shape[0], Y.shape[0]), dtype=X.dtype)
-    _chi2_kernel_fast(X, Y, result)
-    return result
+    if _is_numpy_namespace(xp):
+        result = np.zeros((X.shape[0], Y.shape[0]), dtype=X.dtype)
+        _chi2_kernel_fast(X, Y, result)
+        return result
+    else:
+        dtype = _find_matching_floating_dtype(X, Y, xp=xp)
+        xb = X[:, None, :]
+        yb = Y[None, :, :]
+        nom = -((xb - yb) ** 2)
+        denom = xb + yb
+        nom = xp.where(denom == 0, xp.asarray(0, dtype=dtype), nom)
+        denom = xp.where(denom == 0, xp.asarray(1, dtype=dtype), denom)
+        return xp.sum(nom / denom, axis=2)
 
 
 @validate_params(
@@ -1812,9 +1852,12 @@ def chi2_kernel(X, Y=None, gamma=1.0):
     array([[0.36..., 0.13...],
            [0.13..., 0.36...]])
     """
+    xp, _ = get_namespace(X, Y)
     K = additive_chi2_kernel(X, Y)
     K *= gamma
-    return np.exp(K, K)
+    if _is_numpy_namespace(xp):
+        return np.exp(K, out=K)
+    return xp.exp(K)
 
 
 # Helper functions - distance
diff --git a/sklearn/metrics/tests/test_classification.py b/sklearn/metrics/tests/test_classification.py
index bbebe2cba2197..aa612f73ef5c7 100644
--- a/sklearn/metrics/tests/test_classification.py
+++ b/sklearn/metrics/tests/test_classification.py
@@ -35,7 +35,7 @@
     recall_score,
     zero_one_loss,
 )
-from sklearn.metrics._classification import _check_targets
+from sklearn.metrics._classification import _check_targets, d2_log_loss_score
 from sklearn.model_selection import cross_val_score
 from sklearn.preprocessing import LabelBinarizer, label_binarize
 from sklearn.tree import DecisionTreeClassifier
@@ -810,6 +810,7 @@ def test_matthews_corrcoef_nan():
         partial(fbeta_score, beta=1),
         precision_score,
         recall_score,
+        partial(cohen_kappa_score, labels=[0, 1]),
     ],
 )
 def test_zero_division_nan_no_warning(metric, y_true, y_pred, zero_division):
@@ -834,6 +835,7 @@ def test_zero_division_nan_no_warning(metric, y_true, y_pred, zero_division):
         partial(fbeta_score, beta=1),
         precision_score,
         recall_score,
+        cohen_kappa_score,
     ],
 )
 def test_zero_division_nan_warning(metric, y_true, y_pred):
@@ -2624,62 +2626,37 @@ def test_log_loss():
     )
     loss = log_loss(y_true, y_pred)
     loss_true = -np.mean(bernoulli.logpmf(np.array(y_true) == "yes", y_pred[:, 1]))
-    assert_almost_equal(loss, loss_true)
+    assert_allclose(loss, loss_true)
 
     # multiclass case; adapted from http://bit.ly/RJJHWA
     y_true = [1, 0, 2]
     y_pred = [[0.2, 0.7, 0.1], [0.6, 0.2, 0.2], [0.6, 0.1, 0.3]]
     loss = log_loss(y_true, y_pred, normalize=True)
-    assert_almost_equal(loss, 0.6904911)
+    assert_allclose(loss, 0.6904911)
 
     # check that we got all the shapes and axes right
     # by doubling the length of y_true and y_pred
     y_true *= 2
     y_pred *= 2
     loss = log_loss(y_true, y_pred, normalize=False)
-    assert_almost_equal(loss, 0.6904911 * 6, decimal=6)
-
-    user_warning_msg = "y_pred values do not sum to one"
-    # check eps and handling of absolute zero and one probabilities
-    y_pred = np.asarray(y_pred) > 0.5
-    with pytest.warns(FutureWarning):
-        loss = log_loss(y_true, y_pred, normalize=True, eps=0.1)
-    with pytest.warns(UserWarning, match=user_warning_msg):
-        assert_almost_equal(loss, log_loss(y_true, np.clip(y_pred, 0.1, 0.9)))
-
-    # binary case: check correct boundary values for eps = 0
-    with pytest.warns(FutureWarning):
-        assert log_loss([0, 1], [0, 1], eps=0) == 0
-    with pytest.warns(FutureWarning):
-        assert log_loss([0, 1], [0, 0], eps=0) == np.inf
-    with pytest.warns(FutureWarning):
-        assert log_loss([0, 1], [1, 1], eps=0) == np.inf
-
-    # multiclass case: check correct boundary values for eps = 0
-    with pytest.warns(FutureWarning):
-        assert log_loss([0, 1, 2], [[1, 0, 0], [0, 1, 0], [0, 0, 1]], eps=0) == 0
-    with pytest.warns(FutureWarning):
-        assert (
-            log_loss([0, 1, 2], [[0, 0.5, 0.5], [0, 1, 0], [0, 0, 1]], eps=0) == np.inf
-        )
+    assert_allclose(loss, 0.6904911 * 6)
 
     # raise error if number of classes are not equal.
     y_true = [1, 0, 2]
-    y_pred = [[0.2, 0.7], [0.6, 0.5], [0.4, 0.1]]
+    y_pred = [[0.3, 0.7], [0.6, 0.4], [0.4, 0.6]]
     with pytest.raises(ValueError):
         log_loss(y_true, y_pred)
 
     # case when y_true is a string array object
     y_true = ["ham", "spam", "spam", "ham"]
-    y_pred = [[0.2, 0.7], [0.6, 0.5], [0.4, 0.1], [0.7, 0.2]]
-    with pytest.warns(UserWarning, match=user_warning_msg):
-        loss = log_loss(y_true, y_pred)
-    assert_almost_equal(loss, 1.0383217, decimal=6)
+    y_pred = [[0.3, 0.7], [0.6, 0.4], [0.4, 0.6], [0.7, 0.3]]
+    loss = log_loss(y_true, y_pred)
+    assert_allclose(loss, 0.7469410)
 
     # test labels option
 
     y_true = [2, 2]
-    y_pred = [[0.2, 0.7], [0.6, 0.5]]
+    y_pred = [[0.2, 0.8], [0.6, 0.4]]
     y_score = np.array([[0.1, 0.9], [0.1, 0.9]])
     error_str = (
         r"y_true contains only one label \(2\). Please provide "
@@ -2688,50 +2665,66 @@ def test_log_loss():
     with pytest.raises(ValueError, match=error_str):
         log_loss(y_true, y_pred)
 
-    y_pred = [[0.2, 0.7], [0.6, 0.5], [0.2, 0.3]]
-    error_str = "Found input variables with inconsistent numbers of samples: [3, 2]"
-    (ValueError, error_str, log_loss, y_true, y_pred)
+    y_pred = [[0.2, 0.8], [0.6, 0.4], [0.7, 0.3]]
+    error_str = r"Found input variables with inconsistent numbers of samples: \[3, 2\]"
+    with pytest.raises(ValueError, match=error_str):
+        log_loss(y_true, y_pred)
 
     # works when the labels argument is used
 
     true_log_loss = -np.mean(np.log(y_score[:, 1]))
     calculated_log_loss = log_loss(y_true, y_score, labels=[1, 2])
-    assert_almost_equal(calculated_log_loss, true_log_loss)
+    assert_allclose(calculated_log_loss, true_log_loss)
 
     # ensure labels work when len(np.unique(y_true)) != y_pred.shape[1]
     y_true = [1, 2, 2]
-    y_score2 = [[0.2, 0.7, 0.3], [0.6, 0.5, 0.3], [0.3, 0.9, 0.1]]
-    with pytest.warns(UserWarning, match=user_warning_msg):
-        loss = log_loss(y_true, y_score2, labels=[1, 2, 3])
-    assert_almost_equal(loss, 1.0630345, decimal=6)
+    y_score2 = [[0.7, 0.1, 0.2], [0.2, 0.7, 0.1], [0.1, 0.7, 0.2]]
+    loss = log_loss(y_true, y_score2, labels=[1, 2, 3])
+    assert_allclose(loss, -np.log(0.7))
 
 
-def test_log_loss_eps_auto(global_dtype):
-    """Check the behaviour of `eps="auto"` that changes depending on the input
-    array dtype.
+@pytest.mark.parametrize("dtype", [np.float64, np.float32, np.float16])
+def test_log_loss_eps(dtype):
+    """Check the behaviour internal eps that changes depending on the input dtype.
+
     Non-regression test for:
     https://github.com/scikit-learn/scikit-learn/issues/24315
     """
-    y_true = np.array([0, 1], dtype=global_dtype)
-    y_pred = y_true.copy()
+    y_true = np.array([0, 1], dtype=dtype)
+    y_pred = np.array([1, 0], dtype=dtype)
 
-    loss = log_loss(y_true, y_pred, eps="auto")
+    loss = log_loss(y_true, y_pred)
     assert np.isfinite(loss)
 
 
-def test_log_loss_eps_auto_float16():
-    """Check the behaviour of `eps="auto"` for np.float16"""
-    y_true = np.array([0, 1], dtype=np.float16)
-    y_pred = y_true.copy()
+@pytest.mark.parametrize("dtype", [np.float64, np.float32, np.float16])
+def test_log_loss_not_probabilities_warning(dtype):
+    """Check that log_loss raises a warning when y_pred values don't sum to 1."""
+    y_true = np.array([0, 1, 1, 0])
+    y_pred = np.array([[0.2, 0.7], [0.6, 0.3], [0.4, 0.7], [0.8, 0.3]], dtype=dtype)
 
-    loss = log_loss(y_true, y_pred, eps="auto")
-    assert np.isfinite(loss)
+    with pytest.warns(UserWarning, match="The y_pred values do not sum to one."):
+        log_loss(y_true, y_pred)
+
+
+@pytest.mark.parametrize(
+    "y_true, y_pred",
+    [
+        ([0, 1, 0], [0, 1, 0]),
+        ([0, 1, 0], [[1, 0], [0, 1], [1, 0]]),
+        ([0, 1, 2], [[1, 0, 0], [0, 1, 0], [0, 0, 1]]),
+    ],
+)
+def test_log_loss_perfect_predictions(y_true, y_pred):
+    """Check that log_loss returns 0 for perfect predictions."""
+    # Because of the clipping, the result is not exactly 0
+    assert log_loss(y_true, y_pred) == pytest.approx(0)
 
 
 def test_log_loss_pandas_input():
     # case when input is a pandas series and dataframe gh-5715
     y_tr = np.array(["ham", "spam", "spam", "ham"])
-    y_pr = np.array([[0.2, 0.7], [0.6, 0.5], [0.4, 0.1], [0.7, 0.2]])
+    y_pr = np.array([[0.3, 0.7], [0.6, 0.4], [0.4, 0.6], [0.7, 0.3]])
     types = [(MockDataFrame, MockDataFrame)]
     try:
         from pandas import DataFrame, Series
@@ -2742,9 +2735,8 @@ def test_log_loss_pandas_input():
     for TrueInputType, PredInputType in types:
         # y_pred dataframe, y_true series
         y_true, y_pred = TrueInputType(y_tr), PredInputType(y_pr)
-        with pytest.warns(UserWarning, match="y_pred values do not sum to one"):
-            loss = log_loss(y_true, y_pred)
-        assert_almost_equal(loss, 1.0383217, decimal=6)
+        loss = log_loss(y_true, y_pred)
+        assert_allclose(loss, 0.7469410)
 
 
 def test_brier_score_loss():
@@ -2905,3 +2897,202 @@ def test_brier_score_loss_deprecation_warning():
             y_prob=y_pred,
             y_proba=y_pred,
         )
+
+
+def test_d2_log_loss_score():
+    y_true = [0, 0, 0, 1, 1, 1]
+    y_true_string = ["no", "no", "no", "yes", "yes", "yes"]
+    y_pred = np.array(
+        [
+            [0.5, 0.5],
+            [0.9, 0.1],
+            [0.4, 0.6],
+            [0.6, 0.4],
+            [0.35, 0.65],
+            [0.01, 0.99],
+        ]
+    )
+    y_pred_null = np.array(
+        [
+            [0.5, 0.5],
+            [0.5, 0.5],
+            [0.5, 0.5],
+            [0.5, 0.5],
+            [0.5, 0.5],
+            [0.5, 0.5],
+        ]
+    )
+    d2_score = d2_log_loss_score(y_true=y_true, y_pred=y_pred)
+    log_likelihood = log_loss(y_true=y_true, y_pred=y_pred, normalize=False)
+    log_likelihood_null = log_loss(y_true=y_true, y_pred=y_pred_null, normalize=False)
+    d2_score_true = 1 - log_likelihood / log_likelihood_null
+    assert d2_score == pytest.approx(d2_score_true)
+
+    # check that using sample weight also gives the correct d2 score
+    sample_weight = np.array([2, 1, 3, 4, 3, 1])
+    y_pred_null[:, 0] = sample_weight[:3].sum() / sample_weight.sum()
+    y_pred_null[:, 1] = sample_weight[3:].sum() / sample_weight.sum()
+    d2_score = d2_log_loss_score(
+        y_true=y_true, y_pred=y_pred, sample_weight=sample_weight
+    )
+    log_likelihood = log_loss(
+        y_true=y_true,
+        y_pred=y_pred,
+        sample_weight=sample_weight,
+        normalize=False,
+    )
+    log_likelihood_null = log_loss(
+        y_true=y_true,
+        y_pred=y_pred_null,
+        sample_weight=sample_weight,
+        normalize=False,
+    )
+    d2_score_true = 1 - log_likelihood / log_likelihood_null
+    assert d2_score == pytest.approx(d2_score_true)
+
+    # check if good predictions give a relatively higher value for the d2 score
+    y_pred = np.array(
+        [
+            [0.9, 0.1],
+            [0.8, 0.2],
+            [0.9, 0.1],
+            [0.1, 0.9],
+            [0.2, 0.8],
+            [0.1, 0.9],
+        ]
+    )
+    d2_score = d2_log_loss_score(y_true, y_pred)
+    assert 0.5 < d2_score < 1.0
+    # check that a similar value is obtained for string labels
+    d2_score_string = d2_log_loss_score(y_true_string, y_pred)
+    assert d2_score_string == pytest.approx(d2_score)
+
+    # check if poor predictions gives a relatively low value for the d2 score
+    y_pred = np.array(
+        [
+            [0.5, 0.5],
+            [0.1, 0.9],
+            [0.1, 0.9],
+            [0.9, 0.1],
+            [0.75, 0.25],
+            [0.1, 0.9],
+        ]
+    )
+    d2_score = d2_log_loss_score(y_true, y_pred)
+    assert d2_score < 0
+    # check that a similar value is obtained for string labels
+    d2_score_string = d2_log_loss_score(y_true_string, y_pred)
+    assert d2_score_string == pytest.approx(d2_score)
+
+    # check if simply using the average of the classes as the predictions
+    # gives a d2 score of 0
+    y_true = [0, 0, 0, 1, 1, 1]
+    y_pred = np.array(
+        [
+            [0.5, 0.5],
+            [0.5, 0.5],
+            [0.5, 0.5],
+            [0.5, 0.5],
+            [0.5, 0.5],
+            [0.5, 0.5],
+        ]
+    )
+    d2_score = d2_log_loss_score(y_true, y_pred)
+    assert d2_score == 0
+    d2_score_string = d2_log_loss_score(y_true_string, y_pred)
+    assert d2_score_string == 0
+
+    # check if simply using the average of the classes as the predictions
+    # gives a d2 score of 0 when the positive class has a higher proportion
+    y_true = [0, 1, 1, 1]
+    y_true_string = ["no", "yes", "yes", "yes"]
+    y_pred = np.array([[0.25, 0.75], [0.25, 0.75], [0.25, 0.75], [0.25, 0.75]])
+    d2_score = d2_log_loss_score(y_true, y_pred)
+    assert d2_score == 0
+    d2_score_string = d2_log_loss_score(y_true_string, y_pred)
+    assert d2_score_string == 0
+    sample_weight = [2, 2, 2, 2]
+    d2_score_with_sample_weight = d2_log_loss_score(
+        y_true, y_pred, sample_weight=sample_weight
+    )
+    assert d2_score_with_sample_weight == 0
+
+    # check that the d2 scores seem correct when more than 2
+    # labels are specified
+    y_true = ["high", "high", "low", "neutral"]
+    sample_weight = [1.4, 0.6, 0.8, 0.2]
+
+    y_pred = np.array(
+        [
+            [0.8, 0.1, 0.1],
+            [0.8, 0.1, 0.1],
+            [0.1, 0.8, 0.1],
+            [0.1, 0.1, 0.8],
+        ]
+    )
+    d2_score = d2_log_loss_score(y_true, y_pred)
+    assert 0.5 < d2_score < 1.0
+    d2_score = d2_log_loss_score(y_true, y_pred, sample_weight=sample_weight)
+    assert 0.5 < d2_score < 1.0
+
+    y_pred = np.array(
+        [
+            [0.2, 0.5, 0.3],
+            [0.1, 0.7, 0.2],
+            [0.1, 0.1, 0.8],
+            [0.2, 0.7, 0.1],
+        ]
+    )
+    d2_score = d2_log_loss_score(y_true, y_pred)
+    assert d2_score < 0
+    d2_score = d2_log_loss_score(y_true, y_pred, sample_weight=sample_weight)
+    assert d2_score < 0
+
+
+def test_d2_log_loss_score_raises():
+    """Test that d2_log_loss_score raises the appropriate errors on
+    invalid inputs."""
+    y_true = [0, 1, 2]
+    y_pred = [[0.2, 0.8], [0.5, 0.5], [0.4, 0.6]]
+    err = "contain different number of classes"
+    with pytest.raises(ValueError, match=err):
+        d2_log_loss_score(y_true, y_pred)
+
+    # check error if the number of classes in labels do not match the number
+    # of classes in y_pred.
+    y_true = ["a", "b", "c"]
+    y_pred = [[0.5, 0.5], [0.5, 0.5], [0.5, 0.5]]
+    labels = [0, 1, 2]
+    err = "number of classes in labels is different"
+    with pytest.raises(ValueError, match=err):
+        d2_log_loss_score(y_true, y_pred, labels=labels)
+
+    # check error if y_true and y_pred do not have equal lengths
+    y_true = [0, 1, 2]
+    y_pred = [[0.5, 0.5, 0.5], [0.6, 0.3, 0.1]]
+    err = "inconsistent numbers of samples"
+    with pytest.raises(ValueError, match=err):
+        d2_log_loss_score(y_true, y_pred)
+
+    # check warning for samples < 2
+    y_true = [1]
+    y_pred = [[0.5, 0.5]]
+    err = "score is not well-defined"
+    with pytest.warns(UndefinedMetricWarning, match=err):
+        d2_log_loss_score(y_true, y_pred)
+
+    # check error when y_true only has 1 label
+    y_true = [1, 1, 1]
+    y_pred = [[0.5, 0.5], [0.5, 0.5], [0.5, 5]]
+    err = "y_true contains only one label"
+    with pytest.raises(ValueError, match=err):
+        d2_log_loss_score(y_true, y_pred)
+
+    # check error when y_true only has 1 label and labels also has
+    # only 1 label
+    y_true = [1, 1, 1]
+    labels = [1]
+    y_pred = [[0.5, 0.5], [0.5, 0.5], [0.5, 5]]
+    err = "The labels array needs to contain at least two"
+    with pytest.raises(ValueError, match=err):
+        d2_log_loss_score(y_true, y_pred, labels=labels)
diff --git a/sklearn/metrics/tests/test_common.py b/sklearn/metrics/tests/test_common.py
index e84ef1e358473..b7fa3319b118c 100644
--- a/sklearn/metrics/tests/test_common.py
+++ b/sklearn/metrics/tests/test_common.py
@@ -51,6 +51,15 @@
     zero_one_loss,
 )
 from sklearn.metrics._base import _average_binary_score
+from sklearn.metrics.pairwise import (
+    additive_chi2_kernel,
+    chi2_kernel,
+    cosine_distances,
+    cosine_similarity,
+    euclidean_distances,
+    paired_cosine_distances,
+    rbf_kernel,
+)
 from sklearn.preprocessing import LabelBinarizer
 from sklearn.utils import shuffle
 from sklearn.utils._array_api import (
@@ -637,7 +646,10 @@ def test_sample_order_invariance_multilabel_and_multioutput():
     # Generate some data
     y_true = random_state.randint(0, 2, size=(20, 25))
     y_pred = random_state.randint(0, 2, size=(20, 25))
-    y_score = random_state.normal(size=y_true.shape)
+    y_score = random_state.uniform(size=y_true.shape)
+
+    # Some metrics (e.g. log_loss) require y_score to be probabilities (sum to 1)
+    y_score /= y_score.sum(axis=1, keepdims=True)
 
     y_true_shuffle, y_pred_shuffle, y_score_shuffle = shuffle(
         y_true, y_pred, y_score, random_state=0
@@ -1566,7 +1578,10 @@ def test_multilabel_sample_weight_invariance(name):
     )
     y_true = np.vstack([ya, yb])
     y_pred = np.vstack([ya, ya])
-    y_score = random_state.randint(1, 4, size=y_true.shape)
+    y_score = random_state.uniform(size=y_true.shape)
+
+    # Some metrics (e.g. log_loss) require y_score to be probabilities (sum to 1)
+    y_score /= y_score.sum(axis=1, keepdims=True)
 
     metric = ALL_METRICS[name]
     if name in THRESHOLDED_METRICS:
@@ -1629,7 +1644,10 @@ def test_thresholded_multilabel_multioutput_permutations_invariance(name):
     random_state = check_random_state(0)
     n_samples, n_classes = 20, 4
     y_true = random_state.randint(0, 2, size=(n_samples, n_classes))
-    y_score = random_state.normal(size=y_true.shape)
+    y_score = random_state.uniform(size=y_true.shape)
+
+    # Some metrics (e.g. log_loss) require y_score to be probabilities (sum to 1)
+    y_score /= y_score.sum(axis=1, keepdims=True)
 
     # Makes sure all samples have at least one label. This works around errors
     # when running metrics where average="sample"
@@ -1734,20 +1752,26 @@ def test_metrics_pos_label_error_str(metric, y_pred_threshold, dtype_y_str):
 
 
 def check_array_api_metric(
-    metric, array_namespace, device, dtype_name, y_true_np, y_pred_np, sample_weight
+    metric, array_namespace, device, dtype_name, a_np, b_np, **metric_kwargs
 ):
     xp = _array_api_for_tests(array_namespace, device)
 
-    y_true_xp = xp.asarray(y_true_np, device=device)
-    y_pred_xp = xp.asarray(y_pred_np, device=device)
+    a_xp = xp.asarray(a_np, device=device)
+    b_xp = xp.asarray(b_np, device=device)
+
+    metric_np = metric(a_np, b_np, **metric_kwargs)
 
-    metric_np = metric(y_true_np, y_pred_np, sample_weight=sample_weight)
+    if metric_kwargs.get("sample_weight") is not None:
+        metric_kwargs["sample_weight"] = xp.asarray(
+            metric_kwargs["sample_weight"], device=device
+        )
 
-    if sample_weight is not None:
-        sample_weight = xp.asarray(sample_weight, device=device)
+    multioutput = metric_kwargs.get("multioutput")
+    if isinstance(multioutput, np.ndarray):
+        metric_kwargs["multioutput"] = xp.asarray(multioutput, device=device)
 
     with config_context(array_api_dispatch=True):
-        metric_xp = metric(y_true_xp, y_pred_xp, sample_weight=sample_weight)
+        metric_xp = metric(a_xp, b_xp, **metric_kwargs)
 
         assert_allclose(
             _convert_to_numpy(xp.asarray(metric_xp), xp),
@@ -1767,8 +1791,8 @@ def check_array_api_binary_classification_metric(
         array_namespace,
         device,
         dtype_name,
-        y_true_np=y_true_np,
-        y_pred_np=y_pred_np,
+        a_np=y_true_np,
+        b_np=y_pred_np,
         sample_weight=None,
     )
 
@@ -1779,8 +1803,8 @@ def check_array_api_binary_classification_metric(
         array_namespace,
         device,
         dtype_name,
-        y_true_np=y_true_np,
-        y_pred_np=y_pred_np,
+        a_np=y_true_np,
+        b_np=y_pred_np,
         sample_weight=sample_weight,
     )
 
@@ -1796,8 +1820,8 @@ def check_array_api_multiclass_classification_metric(
         array_namespace,
         device,
         dtype_name,
-        y_true_np=y_true_np,
-        y_pred_np=y_pred_np,
+        a_np=y_true_np,
+        b_np=y_pred_np,
         sample_weight=None,
     )
 
@@ -1808,23 +1832,90 @@ def check_array_api_multiclass_classification_metric(
         array_namespace,
         device,
         dtype_name,
-        y_true_np=y_true_np,
-        y_pred_np=y_pred_np,
+        a_np=y_true_np,
+        b_np=y_pred_np,
+        sample_weight=sample_weight,
+    )
+
+
+def check_array_api_multilabel_classification_metric(
+    metric, array_namespace, device, dtype_name
+):
+    y_true_np = np.array([[1, 1], [0, 1], [0, 0]], dtype=dtype_name)
+    y_pred_np = np.array([[1, 1], [1, 1], [1, 1]], dtype=dtype_name)
+
+    check_array_api_metric(
+        metric,
+        array_namespace,
+        device,
+        dtype_name,
+        a_np=y_true_np,
+        b_np=y_pred_np,
+        sample_weight=None,
+    )
+
+    sample_weight = np.array([0.0, 0.1, 2.0], dtype=dtype_name)
+
+    check_array_api_metric(
+        metric,
+        array_namespace,
+        device,
+        dtype_name,
+        a_np=y_true_np,
+        b_np=y_pred_np,
         sample_weight=sample_weight,
     )
 
 
 def check_array_api_regression_metric(metric, array_namespace, device, dtype_name):
-    y_true_np = np.array([[1, 3], [1, 2]], dtype=dtype_name)
-    y_pred_np = np.array([[1, 4], [1, 1]], dtype=dtype_name)
+    y_true_np = np.array([2.0, 0.1, 1.0, 4.0], dtype=dtype_name)
+    y_pred_np = np.array([0.5, 0.5, 2, 2], dtype=dtype_name)
+
+    metric_kwargs = {}
+    metric_params = signature(metric).parameters
+
+    if "sample_weight" in metric_params:
+        metric_kwargs["sample_weight"] = None
+
+    check_array_api_metric(
+        metric,
+        array_namespace,
+        device,
+        dtype_name,
+        a_np=y_true_np,
+        b_np=y_pred_np,
+        **metric_kwargs,
+    )
+
+    if "sample_weight" in metric_params:
+        metric_kwargs["sample_weight"] = np.array(
+            [0.1, 2.0, 1.5, 0.5], dtype=dtype_name
+        )
+
+        check_array_api_metric(
+            metric,
+            array_namespace,
+            device,
+            dtype_name,
+            a_np=y_true_np,
+            b_np=y_pred_np,
+            **metric_kwargs,
+        )
+
+
+def check_array_api_regression_metric_multioutput(
+    metric, array_namespace, device, dtype_name
+):
+    y_true_np = np.array([[1, 3, 2], [1, 2, 2]], dtype=dtype_name)
+    y_pred_np = np.array([[1, 4, 4], [1, 1, 1]], dtype=dtype_name)
 
     check_array_api_metric(
         metric,
         array_namespace,
         device,
         dtype_name,
-        y_true_np=y_true_np,
-        y_pred_np=y_pred_np,
+        a_np=y_true_np,
+        b_np=y_pred_np,
         sample_weight=None,
     )
 
@@ -1835,22 +1926,104 @@ def check_array_api_regression_metric(metric, array_namespace, device, dtype_nam
         array_namespace,
         device,
         dtype_name,
-        y_true_np=y_true_np,
-        y_pred_np=y_pred_np,
+        a_np=y_true_np,
+        b_np=y_pred_np,
         sample_weight=sample_weight,
     )
 
+    check_array_api_metric(
+        metric,
+        array_namespace,
+        device,
+        dtype_name,
+        a_np=y_true_np,
+        b_np=y_pred_np,
+        multioutput=np.array([0.1, 0.3, 0.7], dtype=dtype_name),
+    )
+
+    check_array_api_metric(
+        metric,
+        array_namespace,
+        device,
+        dtype_name,
+        a_np=y_true_np,
+        b_np=y_pred_np,
+        multioutput="raw_values",
+    )
+
+
+def check_array_api_metric_pairwise(metric, array_namespace, device, dtype_name):
+
+    X_np = np.array([[0.1, 0.2, 0.3], [0.4, 0.5, 0.6]], dtype=dtype_name)
+    Y_np = np.array([[0.2, 0.3, 0.4], [0.5, 0.6, 0.7]], dtype=dtype_name)
+
+    metric_kwargs = {}
+    if "dense_output" in signature(metric).parameters:
+        metric_kwargs["dense_output"] = False
+        check_array_api_metric(
+            metric,
+            array_namespace,
+            device,
+            dtype_name,
+            a_np=X_np,
+            b_np=Y_np,
+            **metric_kwargs,
+        )
+        metric_kwargs["dense_output"] = True
+
+    check_array_api_metric(
+        metric,
+        array_namespace,
+        device,
+        dtype_name,
+        a_np=X_np,
+        b_np=Y_np,
+        **metric_kwargs,
+    )
+
 
 array_api_metric_checkers = {
     accuracy_score: [
         check_array_api_binary_classification_metric,
         check_array_api_multiclass_classification_metric,
+        check_array_api_multilabel_classification_metric,
     ],
     zero_one_loss: [
         check_array_api_binary_classification_metric,
         check_array_api_multiclass_classification_metric,
+        check_array_api_multilabel_classification_metric,
+    ],
+    mean_tweedie_deviance: [check_array_api_regression_metric],
+    partial(mean_tweedie_deviance, power=-0.5): [check_array_api_regression_metric],
+    partial(mean_tweedie_deviance, power=1.5): [check_array_api_regression_metric],
+    r2_score: [
+        check_array_api_regression_metric,
+        check_array_api_regression_metric_multioutput,
+    ],
+    cosine_similarity: [check_array_api_metric_pairwise],
+    mean_absolute_error: [
+        check_array_api_regression_metric,
+        check_array_api_regression_metric_multioutput,
+    ],
+    mean_squared_error: [
+        check_array_api_regression_metric,
+        check_array_api_regression_metric_multioutput,
+    ],
+    d2_tweedie_score: [
+        check_array_api_regression_metric,
+    ],
+    paired_cosine_distances: [check_array_api_metric_pairwise],
+    additive_chi2_kernel: [check_array_api_metric_pairwise],
+    mean_gamma_deviance: [check_array_api_regression_metric],
+    max_error: [check_array_api_regression_metric],
+    mean_absolute_percentage_error: [
+        check_array_api_regression_metric,
+        check_array_api_regression_metric_multioutput,
     ],
-    r2_score: [check_array_api_regression_metric],
+    chi2_kernel: [check_array_api_metric_pairwise],
+    cosine_distances: [check_array_api_metric_pairwise],
+    euclidean_distances: [check_array_api_metric_pairwise],
+    rbf_kernel: [check_array_api_metric_pairwise],
 }
 
 
diff --git a/sklearn/metrics/tests/test_pairwise.py b/sklearn/metrics/tests/test_pairwise.py
index 03d22e0f6d344..6408dc6ba82ea 100644
--- a/sklearn/metrics/tests/test_pairwise.py
+++ b/sklearn/metrics/tests/test_pairwise.py
@@ -2,6 +2,7 @@
 from types import GeneratorType
 
 import numpy as np
+import pytest
 from numpy import linalg
 from scipy.sparse import issparse
 from scipy.spatial.distance import (
@@ -13,15 +14,6 @@
     squareform,
 )
 
-try:
-    from scipy.spatial.distance import wminkowski
-except ImportError:
-    # In scipy 1.6.0, wminkowski is deprecated and minkowski
-    # should be used instead.
-    from scipy.spatial.distance import minkowski as wminkowski
-
-import pytest
-
 from sklearn import config_context
 from sklearn.exceptions import DataConversionWarning
 from sklearn.metrics.pairwise import (
@@ -68,8 +60,6 @@
     CSC_CONTAINERS,
     CSR_CONTAINERS,
     DOK_CONTAINERS,
-    parse_version,
-    sp_version,
 )
 from sklearn.utils.parallel import Parallel, delayed
 
@@ -299,7 +289,6 @@ def test_pairwise_precomputed_non_negative():
 
 
 _minkowski_kwds = {"w": np.arange(1, 5).astype("double", copy=False), "p": 1}
-_wminkowski_kwds = {"w": np.arange(1, 5).astype("double", copy=False), "p": 1}
 
 
 def callable_rbf_kernel(x, y, **kwds):
@@ -313,34 +302,16 @@ def callable_rbf_kernel(x, y, **kwds):
     "func, metric, kwds",
     [
         (pairwise_distances, "euclidean", {}),
-        pytest.param(
+        (
             pairwise_distances,
             minkowski,
             _minkowski_kwds,
         ),
-        pytest.param(
+        (
             pairwise_distances,
             "minkowski",
             _minkowski_kwds,
         ),
-        pytest.param(
-            pairwise_distances,
-            wminkowski,
-            _wminkowski_kwds,
-            marks=pytest.mark.skipif(
-                sp_version >= parse_version("1.6.0"),
-                reason="wminkowski is now minkowski and it has been already tested.",
-            ),
-        ),
-        pytest.param(
-            pairwise_distances,
-            "wminkowski",
-            _wminkowski_kwds,
-            marks=pytest.mark.skipif(
-                sp_version >= parse_version("1.6.0"),
-                reason="wminkowski is now minkowski and it has been already tested.",
-            ),
-        ),
         (pairwise_kernels, "polynomial", {"degree": 1}),
         (pairwise_kernels, callable_rbf_kernel, {"gamma": 0.1}),
     ],
diff --git a/sklearn/metrics/tests/test_pairwise_distances_reduction.py b/sklearn/metrics/tests/test_pairwise_distances_reduction.py
index e5983f9273d94..af055a2091790 100644
--- a/sklearn/metrics/tests/test_pairwise_distances_reduction.py
+++ b/sklearn/metrics/tests/test_pairwise_distances_reduction.py
@@ -5,7 +5,6 @@
 
 import numpy as np
 import pytest
-import threadpoolctl
 from scipy.spatial.distance import cdist
 
 from sklearn.metrics import euclidean_distances, pairwise_distances
@@ -23,6 +22,7 @@
     create_memmap_backed_data,
 )
 from sklearn.utils.fixes import CSR_CONTAINERS
+from sklearn.utils.parallel import _get_threadpool_controller
 
 # Common supported metric between scipy.spatial.distance.cdist
 # and BaseDistanceReductionDispatcher.
@@ -1200,7 +1200,7 @@ def test_n_threads_agnosticism(
         **compute_parameters,
     )
 
-    with threadpoolctl.threadpool_limits(limits=1, user_api="openmp"):
+    with _get_threadpool_controller().limit(limits=1, user_api="openmp"):
         dist, indices = Dispatcher.compute(
             X,
             Y,
diff --git a/sklearn/metrics/tests/test_ranking.py b/sklearn/metrics/tests/test_ranking.py
index 7b3a71978907a..ac3c3855a327e 100644
--- a/sklearn/metrics/tests/test_ranking.py
+++ b/sklearn/metrics/tests/test_ranking.py
@@ -29,10 +29,12 @@
 from sklearn.preprocessing import label_binarize
 from sklearn.random_projection import _sparse_random_matrix
 from sklearn.utils._testing import (
+    _convert_container,
     assert_allclose,
     assert_almost_equal,
     assert_array_almost_equal,
     assert_array_equal,
+    ignore_warnings,
 )
 from sklearn.utils.extmath import softmax
 from sklearn.utils.fixes import CSR_CONTAINERS
@@ -864,17 +866,6 @@ def test_binary_clf_curve_implicit_pos_label(curve_func):
     with pytest.raises(ValueError, match=msg):
         curve_func(np.array(["a", "b"], dtype=object), [0.0, 1.0])
 
-    # The error message is slightly different for bytes-encoded
-    # class labels, but otherwise the behavior is the same:
-    msg = (
-        "y_true takes value in {b'a', b'b'} and pos_label is "
-        "not specified: either make y_true take "
-        "value in {0, 1} or {-1, 1} or pass pos_label "
-        "explicitly."
-    )
-    with pytest.raises(ValueError, match=msg):
-        curve_func(np.array([b"a", b"b"], dtype="<S1"), [0.0, 1.0])
-
     # Check that it is possible to use floating point class labels
     # that are interpreted similarly to integer class labels:
     y_pred = [0.0, 1.0, 0.2, 0.42]
@@ -884,6 +875,23 @@ def test_binary_clf_curve_implicit_pos_label(curve_func):
         np.testing.assert_allclose(int_curve_part, float_curve_part)
 
 
+# TODO(1.7): Update test to check for error when bytes support is removed.
+@ignore_warnings(category=FutureWarning)
+@pytest.mark.parametrize("curve_func", [precision_recall_curve, roc_curve])
+@pytest.mark.parametrize("labels_type", ["list", "array"])
+def test_binary_clf_curve_implicit_bytes_pos_label(curve_func, labels_type):
+    # Check that using bytes class labels raises an informative
+    # error for any supported string dtype:
+    labels = _convert_container([b"a", b"b"], labels_type)
+    msg = (
+        "y_true takes value in {b'a', b'b'} and pos_label is not "
+        "specified: either make y_true take value in {0, 1} or "
+        "{-1, 1} or pass pos_label explicitly."
+    )
+    with pytest.raises(ValueError, match=msg):
+        curve_func(labels, [0.0, 1.0])
+
+
 @pytest.mark.parametrize("curve_func", CURVE_FUNCS)
 def test_binary_clf_curve_zero_sample_weight(curve_func):
     y_true = [0, 0, 1, 1, 1]
diff --git a/sklearn/metrics/tests/test_score_objects.py b/sklearn/metrics/tests/test_score_objects.py
index c721922f1b2d5..bfe8f57f92265 100644
--- a/sklearn/metrics/tests/test_score_objects.py
+++ b/sklearn/metrics/tests/test_score_objects.py
@@ -53,7 +53,6 @@
 from sklearn.pipeline import make_pipeline
 from sklearn.svm import LinearSVC
 from sklearn.tests.metadata_routing_common import (
-    assert_request_equal,
     assert_request_is_empty,
 )
 from sklearn.tree import DecisionTreeClassifier, DecisionTreeRegressor
@@ -62,9 +61,10 @@
     assert_array_equal,
     ignore_warnings,
 )
-from sklearn.utils.metadata_routing import MetadataRouter
+from sklearn.utils.metadata_routing import MetadataRouter, MethodMapping
 
 REGRESSION_SCORERS = [
+    "d2_absolute_error_score",
     "explained_variance",
     "r2",
     "neg_mean_absolute_error",
@@ -276,7 +276,7 @@ def test_check_scoring_and_check_multimetric_scoring(scoring):
     # To make sure the check_scoring is correctly applied to the constituent
     # scorers
 
-    estimator = LinearSVC(dual="auto", random_state=0)
+    estimator = LinearSVC(random_state=0)
     estimator.fit([[1], [2], [3]], [1, 1, 0])
 
     scorers = _check_multimetric_scoring(estimator, scoring)
@@ -337,12 +337,12 @@ def test_check_scoring_gridsearchcv():
     # test that check_scoring works on GridSearchCV and pipeline.
     # slightly redundant non-regression test.
 
-    grid = GridSearchCV(LinearSVC(dual="auto"), param_grid={"C": [0.1, 1]}, cv=3)
+    grid = GridSearchCV(LinearSVC(), param_grid={"C": [0.1, 1]}, cv=3)
     scorer = check_scoring(grid, scoring="f1")
     assert isinstance(scorer, _Scorer)
     assert scorer._response_method == "predict"
 
-    pipe = make_pipeline(LinearSVC(dual="auto"))
+    pipe = make_pipeline(LinearSVC())
     scorer = check_scoring(pipe, scoring="f1")
     assert isinstance(scorer, _Scorer)
     assert scorer._response_method == "predict"
@@ -384,7 +384,7 @@ def test_classification_binary_scores(scorer_name, metric):
     # binary classification.
     X, y = make_blobs(random_state=0, centers=2)
     X_train, X_test, y_train, y_test = train_test_split(X, y, random_state=0)
-    clf = LinearSVC(dual="auto", random_state=0)
+    clf = LinearSVC(random_state=0)
     clf.fit(X_train, y_train)
 
     score = get_scorer(scorer_name)(clf, X_test, y_test)
@@ -434,7 +434,7 @@ def test_custom_scorer_pickling():
     # test that custom scorer can be pickled
     X, y = make_blobs(random_state=0, centers=2)
     X_train, X_test, y_train, y_test = train_test_split(X, y, random_state=0)
-    clf = LinearSVC(dual="auto", random_state=0)
+    clf = LinearSVC(random_state=0)
     clf.fit(X_train, y_train)
 
     scorer = make_scorer(fbeta_score, beta=2)
@@ -532,7 +532,7 @@ def test_thresholded_scorers_multilabel_indicator_data():
     assert_almost_equal(score1, score2)
 
     # Multilabel decision function
-    clf = OneVsRestClassifier(LinearSVC(dual="auto", random_state=0))
+    clf = OneVsRestClassifier(LinearSVC(random_state=0))
     clf.fit(X_train, y_train)
     score1 = get_scorer("roc_auc")(clf, X_test, y_test)
     score2 = roc_auc_score(y_test, clf.decision_function(X_test))
@@ -926,7 +926,7 @@ def test_multiclass_roc_proba_scorer(scorer_name, metric):
     X, y = make_classification(
         n_classes=3, n_informative=3, n_samples=20, random_state=0
     )
-    lr = LogisticRegression(multi_class="multinomial").fit(X, y)
+    lr = LogisticRegression().fit(X, y)
     y_proba = lr.predict_proba(X)
     expected_score = metric(y, y_proba)
 
@@ -943,7 +943,7 @@ def test_multiclass_roc_proba_scorer_label():
     X, y = make_classification(
         n_classes=3, n_informative=3, n_samples=20, random_state=0
     )
-    lr = LogisticRegression(multi_class="multinomial").fit(X, y)
+    lr = LogisticRegression().fit(X, y)
     y_proba = lr.predict_proba(X)
 
     y_binary = y == 0
@@ -1233,7 +1233,8 @@ def test_scorer_metadata_request(name):
     # make sure putting the scorer in a router doesn't request anything by
     # default
     router = MetadataRouter(owner="test").add(
-        method_mapping="score", scorer=get_scorer(name)
+        scorer=get_scorer(name),
+        method_mapping=MethodMapping().add(caller="score", callee="score"),
     )
     # make sure `sample_weight` is refused if passed.
     with pytest.raises(TypeError, match="got unexpected argument"):
@@ -1244,7 +1245,8 @@ def test_scorer_metadata_request(name):
 
     # make sure putting weighted_scorer in a router requests sample_weight
     router = MetadataRouter(owner="test").add(
-        scorer=weighted_scorer, method_mapping="score"
+        scorer=weighted_scorer,
+        method_mapping=MethodMapping().add(caller="score", callee="score"),
     )
     router.validate_metadata(params={"sample_weight": 1}, method="score")
     routed_params = router.route_params(params={"sample_weight": 1}, caller="score")
@@ -1275,24 +1277,40 @@ def test_metadata_kwarg_conflict():
 
 
 @pytest.mark.usefixtures("enable_slep006")
-def test_PassthroughScorer_metadata_request():
-    """Test that _PassthroughScorer properly routes metadata.
+def test_PassthroughScorer_set_score_request():
+    """Test that _PassthroughScorer.set_score_request adds the correct metadata request
+    on itself and doesn't change its estimator's routing."""
+    est = LogisticRegression().set_score_request(sample_weight="estimator_weights")
+    # make a `_PassthroughScorer` with `check_scoring`:
+    scorer = check_scoring(est, None)
+    assert (
+        scorer.get_metadata_routing().score.requests["sample_weight"]
+        == "estimator_weights"
+    )
 
-    _PassthroughScorer should behave like a consumer, mirroring whatever is the
-    underlying score method.
-    """
-    scorer = _PassthroughScorer(
-        estimator=LinearSVC()
-        .set_score_request(sample_weight="alias")
-        .set_fit_request(sample_weight=True)
+    scorer.set_score_request(sample_weight="scorer_weights")
+    assert (
+        scorer.get_metadata_routing().score.requests["sample_weight"]
+        == "scorer_weights"
     )
-    # Test that _PassthroughScorer doesn't change estimator's routing.
-    assert_request_equal(
-        scorer.get_metadata_routing(),
-        {"fit": {"sample_weight": True}, "score": {"sample_weight": "alias"}},
+
+    # making sure changing the passthrough object doesn't affect the estimator.
+    assert (
+        est.get_metadata_routing().score.requests["sample_weight"]
+        == "estimator_weights"
     )
 
 
+def test_PassthroughScorer_set_score_request_raises_without_routing_enabled():
+    """Test that _PassthroughScorer.set_score_request raises if metadata routing is
+    disabled."""
+    scorer = check_scoring(LogisticRegression(), None)
+    msg = "This method is only available when metadata routing is enabled."
+
+    with pytest.raises(RuntimeError, match=msg):
+        scorer.set_score_request(sample_weight="my_weights")
+
+
 @pytest.mark.usefixtures("enable_slep006")
 def test_multimetric_scoring_metadata_routing():
     # Test that _MultimetricScorer properly routes metadata.
@@ -1539,6 +1557,34 @@ def test_multimetric_scorer_repr():
     assert str(multi_metric_scorer) == 'MultiMetricScorer("accuracy", "r2")'
 
 
+def test_check_scoring_multimetric_raise_exc():
+    """Test that check_scoring returns error code for a subset of scorers in
+    multimetric scoring if raise_exc=False and raises otherwise."""
+
+    def raising_scorer(estimator, X, y):
+        raise ValueError("That doesn't work.")
+
+    X, y = make_classification(n_samples=150, n_features=10, random_state=0)
+    X_train, X_test, y_train, y_test = train_test_split(X, y, random_state=0)
+    clf = LogisticRegression().fit(X_train, y_train)
+
+    # "raising_scorer" is raising ValueError and should return an string representation
+    # of the error of the last scorer:
+    scoring = {
+        "accuracy": make_scorer(accuracy_score),
+        "raising_scorer": raising_scorer,
+    }
+    scoring_call = check_scoring(estimator=clf, scoring=scoring, raise_exc=False)
+    scores = scoring_call(clf, X_test, y_test)
+    assert "That doesn't work." in scores["raising_scorer"]
+
+    # should raise an error
+    scoring_call = check_scoring(estimator=clf, scoring=scoring, raise_exc=True)
+    err_msg = "That doesn't work."
+    with pytest.raises(ValueError, match=err_msg):
+        scores = scoring_call(clf, X_test, y_test)
+
+
 @pytest.mark.parametrize("enable_metadata_routing", [True, False])
 def test_metadata_routing_multimetric_metadata_routing(enable_metadata_routing):
     """Test multimetric scorer works with and without metadata routing enabled when
diff --git a/sklearn/mixture/__init__.py b/sklearn/mixture/__init__.py
index f0018196ffc98..219099ea422d1 100644
--- a/sklearn/mixture/__init__.py
+++ b/sklearn/mixture/__init__.py
@@ -1,8 +1,7 @@
-"""
-The :mod:`sklearn.mixture` module implements mixture modeling algorithms.
-"""
+"""Mixture modeling algorithms."""
 
 from ._bayesian_mixture import BayesianGaussianMixture
 from ._gaussian_mixture import GaussianMixture
+from ._gaussian_mixture_ic import GaussianMixtureIC
 
-__all__ = ["GaussianMixture", "BayesianGaussianMixture"]
+__all__ = ["GaussianMixture", "BayesianGaussianMixture", "GaussianMixtureIC"]
diff --git a/sklearn/mixture/_base.py b/sklearn/mixture/_base.py
index 8aa1531832279..6fc3022fe5a8f 100644
--- a/sklearn/mixture/_base.py
+++ b/sklearn/mixture/_base.py
@@ -1,8 +1,7 @@
 """Base class for mixture models."""
 
-# Author: Wei Xue <xuewei4d@gmail.com>
-# Modified by Thierry Guillemot <thierry.guillemot.work@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from abc import ABCMeta, abstractmethod
diff --git a/sklearn/mixture/_bayesian_mixture.py b/sklearn/mixture/_bayesian_mixture.py
index fda1a83702bbf..5808d73e567fe 100644
--- a/sklearn/mixture/_bayesian_mixture.py
+++ b/sklearn/mixture/_bayesian_mixture.py
@@ -1,8 +1,7 @@
 """Bayesian Gaussian Mixture Model."""
 
-# Author: Wei Xue <xuewei4d@gmail.com>
-#         Thierry Guillemot <thierry.guillemot.work@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import math
 from numbers import Real
diff --git a/sklearn/mixture/_gaussian_mixture.py b/sklearn/mixture/_gaussian_mixture.py
index 443589b177319..98ade2089e273 100644
--- a/sklearn/mixture/_gaussian_mixture.py
+++ b/sklearn/mixture/_gaussian_mixture.py
@@ -1,8 +1,7 @@
 """Gaussian Mixture Model."""
 
-# Author: Wei Xue <xuewei4d@gmail.com>
-# Modified by Thierry Guillemot <thierry.guillemot.work@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 from scipy import linalg
diff --git a/sklearn/mixture/_gaussian_mixture_ic.py b/sklearn/mixture/_gaussian_mixture_ic.py
new file mode 100644
index 0000000000000..8cf1d2e69df16
--- /dev/null
+++ b/sklearn/mixture/_gaussian_mixture_ic.py
@@ -0,0 +1,450 @@
+"""GaussianMixtureIC"""
+
+# Authors: Tingshan Liu <tliu68@jhmi.edu>
+#          Thomas Athey <tathey1@jhmi.edu>
+#          Benjamin Pedigo <bpedigo@jhu.edu>
+
+
+import numpy as np
+
+from ..base import BaseEstimator, ClusterMixin
+from ..model_selection import GridSearchCV
+from ..utils._param_validation import (
+    Integral,
+    Interval,
+    InvalidParameterError,
+    StrOptions,
+)
+from ..utils.validation import check_is_fitted
+from . import GaussianMixture
+
+
+def _check_multi_comp_inputs(input, name, default):
+    if isinstance(input, (np.ndarray, list)):
+        input = list(np.unique(input))
+    elif isinstance(input, str):
+        if input not in default:
+            raise InvalidParameterError(
+                f"The '{name}' parameter of GaussianMixtureIC must be one of {default}."
+                f" Got {input} instead."
+            )
+        if input != "all":
+            input = [input]
+        else:
+            input = default.copy()
+            input.remove("all")
+    else:
+        raise InvalidParameterError(
+            f"The '{name}' parameter of GaussianMixtureIC must be one of {default}. "
+            f"Got {input} instead."
+        )
+    return input
+
+
+class GaussianMixtureIC(ClusterMixin, BaseEstimator):
+    """Gaussian mixture with BIC/AIC.
+
+    Automatic Gaussian Mixture Model (GMM) selection via the
+    Bayesian Information Criterion (BIC)
+    or the Akaike Information Criterion (AIC).
+
+    Such criteria are useful to select the value
+    of the gaussian mixture parameters by making a trade-off
+    between the goodness of fit and the complexity of the model.
+
+    Parameters
+    ----------
+    min_components : int, default=2
+        The minimum number of mixture components to consider.
+        If ``max_components`` is not None, ``min_components`` must be
+        less than or equal to ``max_components``.
+
+    max_components : int or None, default=10
+        The maximum number of mixture components to consider.
+        Must be greater than or equal to ``min_components``.
+
+    covariance_type : {'full' (default), 'tied', 'diag', 'spherical', 'all'},
+            optional
+        String or list/array describing the type of covariance parameters
+        to use.
+        If a string, it must be one of:
+
+        - 'full'
+            each component has its own general covariance matrix
+        - 'tied'
+            all components share the same general covariance matrix
+        - 'diag'
+            each component has its own diagonal covariance matrix
+        - 'spherical'
+            each component has its own single variance
+        - 'all'
+            considers all covariance structures in
+            ['spherical', 'diag', 'tied', 'full']
+
+        If a list/array, it must be a list/array of strings containing only
+        'spherical', 'tied', 'diag', and/or 'spherical'.
+
+    n_init : int, optional (default = 1)
+        The number of initializations to perform.
+
+    init_params : {'kmeans' (default), 'k-means++', 'random', 'random_from_data'}
+        The method used to initialize the weights, the means and the precisions
+        for Gaussian mixture modeling.
+
+    criterion : str {"bic" or "aic"}, optional, (default = "bic")
+        Select the best model based on Bayesian Information Criterion (bic) or
+        Aikake Information Criterion (aic).
+
+    n_jobs : int
+        The number of jobs to use for the computation
+        This works by computing each of the n_init runs in parallel.
+
+    tol : float, default=1e-3
+        The convergence threshold. EM iterations will stop when the
+        lower bound average gain is below this threshold.
+
+    reg_covar : float, default=1e-6
+        Non-negative regularization added to the diagonal of covariance.
+        Allows to assure that the covariance matrices are all positive.
+
+    weights_init : array-like of shape (n_components, ), default=None
+        The user-provided initial weights.
+        If it is None, weights are initialized using the `init_params` method.
+
+    means_init : array-like of shape (n_components, n_features), default=None
+        The user-provided initial means,
+        If it is None, means are initialized using the `init_params` method.
+
+    precisions_init : array-like, default=None
+        The user-provided initial precisions (inverse of the covariance
+        matrices).
+        If it is None, precisions are initialized using the 'init_params'
+        method.
+        The shape depends on 'covariance_type'::
+
+            (n_components,)                        if 'spherical',
+            (n_features, n_features)               if 'tied',
+            (n_components, n_features)             if 'diag',
+            (n_components, n_features, n_features) if 'full'
+
+    random_state : int, RandomState instance or None, default=None
+        Controls the random seed given to the method chosen to initialize the
+        parameters (see `init_params`).
+        In addition, it controls the generation of random samples from the
+        fitted distribution (see the method `sample`).
+        Pass an int for reproducible output across multiple function calls.
+        See :term:`Glossary <random_state>`.
+
+    warm_start : bool, default=False
+        If 'warm_start' is True, the solution of the last fitting is used as
+        initialization for the next call of fit(). This can speed up
+        convergence when fit is called several times on similar problems.
+        In that case, 'n_init' is ignored and only a single initialization
+        occurs upon the first call.
+        See :term:`the Glossary <warm_start>`.
+
+    max_iter : int, optional (default = 100)
+        The maximum number of EM iterations to perform.
+
+    verbose : int, default=0
+        Enable verbose output. If 1 then it prints the current
+        initialization and each iteration step. If greater than 1 then
+        it prints also the log probability and the time needed
+        for each step.
+
+    verbose_interval : int, default=10
+        Number of iteration done before the next print.
+
+    Attributes
+    ----------
+    criterion_ : array-like
+        The value of the information criteria ('aic', 'bic') across all
+        numbers of components. The number of component which has the smallest
+        information criterion is chosen.
+
+    n_components_ : int
+        Number of clusters for the model with the best bic/aic.
+
+    covariance_type_ : str
+        Covariance type for the model with the best bic/aic.
+
+    best_estimator_ : :class:`sklearn.mixture.GaussianMixture`
+        Object with the best bic/aic.
+
+    weights_ : array-like of shape (n_components,)
+        The weights of each mixture components for the model with the best bic/aic.
+
+    means_ : array-like of shape (n_components, n_features)
+        The mean of each mixture component for the model with the best bic/aic.
+
+    covariances_ : array-like
+        The covariance of each mixture component for the model with the best bic/aic.
+        The shape depends on `covariance_type_`. See
+        :class:`~sklearn.mixture.GaussianMixture` for details.
+
+    precisions_ : array-like
+        The precision matrices for each component in the mixture for the model with
+        the best bic/aic. See :class:`~sklearn.mixture.GaussianMixture` for details.
+
+    precisions_cholesky_ : array-like
+        The cholesky decomposition of the precision matrices of each mixture component
+        for the model with the best bic/aic.
+        See :class:`~sklearn.mixture.GaussianMixture` for details.
+
+    converged_ : bool
+        True only when convergence was reached in :term:`fit` for the model
+        with the best bic/aic, False otherwise.
+
+    n_iter_ : int
+        Number of step used by the best fit of EM for the best model
+        to reach the convergence.
+
+    lower_bound_ : float
+        Lower bound value on the log-likelihood (of the training data with
+        respect to the model) of the best fit of EM.
+
+    n_features_in_ : int
+        Number of features seen during :term:`fit`.
+
+    feature_names_in_ : ndarray of shape (`n_features_in_`,)
+        Names of features seen during :term:`fit`. Defined only when `X`
+        has feature names that are all strings.
+
+    labels_ : ndarray of shape (n_samples,)
+        Labels of each point.
+
+    See Also
+    --------
+    GaussianMixture : Fit Gaussian mixture model.
+    BayesianGaussianMixture : Gaussian mixture model fit with a variational
+        inference.
+
+    Notes
+    -----
+    This algorithm was strongly inspired by mclust [3]_,
+    a clustering package for R.
+
+    References
+    ----------
+    .. [1] `Fraley, C., & Raftery, A. E. (2002). Model-based clustering,
+        discriminant analysis, and density estimation.
+        Journal of the American statistical Association, 97(458), 611-631.
+        <https://doi.org/10.1198/016214502760047131>_`
+
+    .. [2] `Athey, T. L., Pedigo, B. D., Liu, T., & Vogelstein, J. T. (2019).
+        AutoGMM: Automatic and Hierarchical Gaussian Mixture Modeling
+        in Python. arXiv preprint arXiv:1909.02688.
+        <https://arxiv.org/abs/1909.02688>_`
+
+    .. [3] `Scrucca, L., Fop, M., Murphy, T. B., & Raftery, A. E. (2016).
+        mclust 5: Clustering, Classification and Density Estimation Using
+        Gaussian Finite Mixture Models. The R journal, 8(1), 289-317.
+        <https://doi.org/10.32614/RJ-2016-021>_`
+
+    Examples
+    --------
+    >>> import numpy as np
+    >>> from sklearn.mixture import GaussianMixtureIC
+    >>> X = np.array([[1, 2], [1, 4], [1, 0], [10, 2], [10, 4], [10, 0]])
+    >>> gmIC = GaussianMixtureIC(max_components=4)
+    >>> print(np.sort(gmIC.fit_predict(X)))
+    [0 0 0 1 1 1]
+    >>> print(gmIC.n_components_)
+    2
+    """
+
+    _parameter_constraints: dict = {
+        **GaussianMixture._parameter_constraints,
+        "criterion": [StrOptions({"aic", "bic"})],
+        "min_components": [Interval(Integral, 1, None, closed="left")],
+        "max_components": [Interval(Integral, 1, None, closed="left")],
+        "n_jobs": [Integral, None],
+        "covariance_type": [
+            StrOptions({"spherical", "diag", "tied", "full", "all"}),
+            list,
+            np.ndarray,
+        ],
+    }
+    _parameter_constraints.pop("n_components")
+
+    def __init__(
+        self,
+        *,
+        min_components=2,
+        max_components=10,
+        covariance_type="full",
+        n_init=1,
+        init_params="kmeans",
+        criterion="bic",
+        n_jobs=None,
+        tol=1e-3,
+        reg_covar=1e-6,
+        weights_init=None,
+        means_init=None,
+        precisions_init=None,
+        random_state=None,
+        warm_start=False,
+        max_iter=100,
+        verbose=0,
+        verbose_interval=10,
+    ):
+        super().__init__()
+        self.covariance_type = covariance_type
+        self.min_components = min_components
+        self.max_components = max_components
+        self.criterion = criterion
+        self.n_jobs = n_jobs
+        self.n_init = n_init
+        self.init_params = init_params
+        self.tol = tol
+        self.reg_covar = reg_covar
+        self.weights_init = weights_init
+        self.means_init = means_init
+        self.precisions_init = precisions_init
+        self.random_state = random_state
+        self.warm_start = warm_start
+        self.max_iter = max_iter
+        self.verbose = verbose
+        self.verbose_interval = verbose_interval
+
+    def _check_parameters(self):
+        covariance_type = _check_multi_comp_inputs(
+            self.covariance_type,
+            "covariance_type",
+            ["spherical", "diag", "tied", "full", "all"],
+        )
+
+        return covariance_type
+
+    def criterion_score(self, estimator, X):
+        """Callable to pass to GridSearchCV that will use the BIC score.
+
+        Parameters
+        ----------
+        estimator : estimator object
+            A score function to calculate either BIC or AIC.
+
+        X : array-like, shape (n_samples, n_features)
+            List of n_features-dimensional data points. Each row
+            corresponds to a single data point.
+
+        Returns
+        -------
+        score : float
+            The BIC or AIC score.
+        """
+        if self.criterion == "bic":
+            return -estimator.bic(X)
+        else:
+            return -estimator.aic(X)
+
+    def fit(self, X, y=None):
+        """Fit several Gaussian mixture models to the data.
+
+        Initialize with agglomerative clustering then
+        estimate model parameters with EM algorithm.
+        Select the best model according to the chosen
+        information criterion.
+
+        Parameters
+        ----------
+        X : array-like, shape (n_samples, n_features)
+            List of n_features-dimensional data points. Each row
+            corresponds to a single data point.
+
+        y : Ignored
+            Not used, present for API consistency by convention.
+
+        Returns
+        -------
+        self : object
+            Returns an instance of self.
+        """
+        self._validate_params()
+        covariance_type = self._check_parameters()
+        X = self._validate_data(X, dtype=[np.float64, np.float32], ensure_min_samples=1)
+
+        # check n_components against sample size
+        if self.max_components > X.shape[0]:
+            msg = "max_components must be <= n_samples, but max_components"
+            msg += "= {}, n_samples = {}".format(self.max_components, X.shape[0])
+            raise ValueError(msg)
+
+        # Ensure reproducibility
+        if self.random_state is not None:
+            np.random.seed(self.random_state)
+
+        param_grid = {
+            "covariance_type": covariance_type,
+            "n_components": range(self.min_components, self.max_components + 1),
+        }
+
+        grid_search = GridSearchCV(
+            GaussianMixture(
+                init_params=self.init_params, max_iter=self.max_iter, n_init=self.n_init
+            ),
+            param_grid=param_grid,
+            scoring=self.criterion_score,
+        )
+        grid_search.fit(X)
+
+        self.criterion_ = -grid_search.cv_results_["mean_test_score"]
+        self.n_components_ = grid_search.best_params_["n_components"]
+        self.covariance_type_ = grid_search.best_params_["covariance_type"]
+
+        best_estimator = grid_search.best_estimator_
+        self.best_estimator_ = best_estimator
+        self.weights_ = best_estimator.weights_
+        self.means_ = best_estimator.means_
+        self.covariances_ = best_estimator.covariances_
+        self.precisions_ = best_estimator.precisions_
+        self.precisions_cholesky_ = best_estimator.precisions_cholesky_
+        self.converged_ = best_estimator.converged_
+        self.n_iter_ = best_estimator.n_iter_
+        self.lower_bound_ = best_estimator.lower_bound_
+        self.n_features_in_ = X.shape[1]
+        self.labels_ = best_estimator.predict(X)
+
+        return self
+
+    def predict(self, X):
+        """Predict clusters based on the best Gaussian mixture model.
+
+        Parameters
+        ----------
+        X : array-like, shape (n_samples, n_features)
+            List of n_features-dimensional data points. Each row
+            corresponds to a single data point.
+
+        Returns
+        -------
+        labels : array, shape (n_samples,)
+            Component labels.
+        """
+        check_is_fitted(self, ["best_estimator_"], all_or_any=all)
+        X = self._validate_data(X, reset=False)
+        labels = self.best_estimator_.predict(X)
+
+        return labels
+
+    def fit_predict(self, X, y=None):
+        """Fit the models and predict clusters based on the best model.
+
+        Parameters
+        ----------
+        X : array-like, shape (n_samples, n_features)
+            List of n_features-dimensional data points. Each row
+            corresponds to a single data point.
+
+        y : Ignored
+            Not used, present for API consistency by convention.
+
+        Returns
+        -------
+        labels : array, shape (n_samples,)
+            Component labels.
+        """
+        self.fit(X, y)
+
+        labels = self.predict(X)
+        return labels
diff --git a/sklearn/mixture/tests/test_bayesian_mixture.py b/sklearn/mixture/tests/test_bayesian_mixture.py
index 9c6eb4a86ea0d..925cd2fdb615b 100644
--- a/sklearn/mixture/tests/test_bayesian_mixture.py
+++ b/sklearn/mixture/tests/test_bayesian_mixture.py
@@ -1,6 +1,5 @@
-# Author: Wei Xue <xuewei4d@gmail.com>
-#         Thierry Guillemot <thierry.guillemot.work@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import copy
 
 import numpy as np
diff --git a/sklearn/mixture/tests/test_gaussian_mixture.py b/sklearn/mixture/tests/test_gaussian_mixture.py
index 19931634df329..5caead98cfa24 100644
--- a/sklearn/mixture/tests/test_gaussian_mixture.py
+++ b/sklearn/mixture/tests/test_gaussian_mixture.py
@@ -1,6 +1,5 @@
-# Author: Wei Xue <xuewei4d@gmail.com>
-#         Thierry Guillemot <thierry.guillemot.work@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import copy
 import itertools
diff --git a/sklearn/mixture/tests/test_gaussian_mixture_ic.py b/sklearn/mixture/tests/test_gaussian_mixture_ic.py
new file mode 100644
index 0000000000000..48de0f0820a51
--- /dev/null
+++ b/sklearn/mixture/tests/test_gaussian_mixture_ic.py
@@ -0,0 +1,141 @@
+"""Testing for GaussianMixtureIC"""
+
+import numpy as np
+import pytest
+from numpy.testing import assert_allclose, assert_equal
+
+from sklearn.exceptions import NotFittedError
+from sklearn.metrics import adjusted_rand_score
+from sklearn.mixture import GaussianMixtureIC
+from sklearn.utils._param_validation import InvalidParameterError
+
+
+def _test_wrong_inputs(X, error_type, **kws):
+    with pytest.raises(error_type):
+        gmIC = GaussianMixtureIC(**kws)
+        gmIC.fit(X)
+
+
+def _test_right_inputs(X, **kws):
+    gmIC = GaussianMixtureIC(**kws)
+    gmIC.fit(X)
+
+
+def test_n_components():
+    X = np.random.normal(0, 1, size=(100, 3))
+
+    # min_components must be less than 1
+    _test_wrong_inputs(X, ValueError, min_components=0)
+
+    # min_components must be an integer
+    _test_wrong_inputs(X, TypeError, min_components="1")
+
+    # max_components must be at least min_components
+    _test_wrong_inputs(X, ValueError, max_components=0)
+
+    # max_components must be an integer
+    _test_wrong_inputs(X, TypeError, max_components="1")
+
+    # max_components must be at most n_samples
+    _test_wrong_inputs(X, ValueError, max_components=101)
+
+    # min_components must be at most n_samples
+    _test_wrong_inputs(X, ValueError, **{"min_components": 101, "max_components": 102})
+
+
+def test_input_param():
+    X = np.random.normal(0, 1, size=(100, 3))
+
+    # covariance type is not an array, string or list
+    _test_wrong_inputs(X, InvalidParameterError, covariance_type=1)
+
+    # covariance type is not in ['spherical', 'diag', 'tied', 'full', 'all']
+    _test_wrong_inputs(X, InvalidParameterError, covariance_type="1")
+
+    # several but not all covariance types in ['spherical', 'diag', 'tied', 'full']
+    _test_right_inputs(X, covariance_type=["spherical", "diag"])
+
+    # covariance type is 'all'
+    _test_right_inputs(X, covariance_type="all")
+
+    # criterion is not "aic" or "bic"
+    _test_wrong_inputs(X, ValueError, criterion="cic")
+
+    # n_init is not an integer
+    _test_wrong_inputs(X, TypeError, n_init="1")
+
+    # n_init must be at least 1
+    _test_wrong_inputs(X, ValueError, n_init=0)
+
+
+def test_predict_without_fit():
+    X = np.random.normal(0, 1, size=(100, 3))
+
+    with pytest.raises(NotFittedError):
+        gmIC = GaussianMixtureIC(min_components=2)
+        gmIC.predict(X)
+
+
+def _test_two_class(**kws):
+    """
+    Easily separable two gaussian problem.
+    """
+    np.random.seed(1)
+
+    n = 100
+    d = 3
+
+    X1 = np.random.normal(2, 0.5, size=(n, d))
+    X2 = np.random.normal(-2, 0.5, size=(n, d))
+    X = np.vstack((X1, X2))
+    y = np.repeat([0, 1], n)
+
+    # test BIC
+    gmIC = GaussianMixtureIC(max_components=5, criterion="bic", **kws)
+    gmIC.fit(X, y)
+    n_components = gmIC.n_components_
+
+    # Assert that the two cluster model is the best
+    assert_equal(n_components, 2)
+
+    # Assert that we get perfect clustering
+    ari = adjusted_rand_score(y, gmIC.fit_predict(X))
+    assert_allclose(ari, 1)
+
+    # test AIC
+    gmIC = GaussianMixtureIC(max_components=5, criterion="aic", **kws)
+    gmIC.fit(X, y)
+    n_components = gmIC.n_components_
+
+    # AIC gets the number of components wrong
+    assert_equal(n_components >= 1, True)
+    assert_equal(n_components <= 5, True)
+
+
+def test_two_class():
+    _test_two_class()
+
+
+def test_two_class_sequential_v_parallel():
+    """
+    Testing independence of results from the execution mode
+    (sequential vs. parallel using ``joblib.Parallel``).
+    """
+    np.random.seed(1)
+
+    n = 100
+    d = 3
+
+    X1 = np.random.normal(2, 0.75, size=(n, d))
+    X2 = np.random.normal(-2, 0.5, size=(n, d))
+    X = np.vstack((X1, X2))
+
+    gmIC_parallel = GaussianMixtureIC(max_components=5, criterion="bic", n_jobs=-1)
+    preds_parallel = gmIC_parallel.fit_predict(X)
+
+    gmIC_sequential = GaussianMixtureIC(max_components=5, criterion="bic", n_jobs=1)
+    preds_sequential = gmIC_sequential.fit_predict(X)
+
+    # Results obtained with sequential and parallel executions
+    # must be identical
+    assert_equal(preds_parallel, preds_sequential)
diff --git a/sklearn/mixture/tests/test_mixture.py b/sklearn/mixture/tests/test_mixture.py
index f0ea3494f0e7d..9c98d150f06a8 100644
--- a/sklearn/mixture/tests/test_mixture.py
+++ b/sklearn/mixture/tests/test_mixture.py
@@ -1,5 +1,5 @@
-# Author: Guillaume Lemaitre <g.lemaitre58@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 import pytest
diff --git a/sklearn/model_selection/__init__.py b/sklearn/model_selection/__init__.py
index d7d316d95ada4..8a50d032dc164 100644
--- a/sklearn/model_selection/__init__.py
+++ b/sklearn/model_selection/__init__.py
@@ -1,5 +1,11 @@
+"""Tools for model selection, such as cross validation and hyper-parameter tuning."""
+
 import typing
 
+from ._classification_threshold import (
+    FixedThresholdClassifier,
+    TunedThresholdClassifierCV,
+)
 from ._plot import LearningCurveDisplay, ValidationCurveDisplay
 from ._search import GridSearchCV, ParameterGrid, ParameterSampler, RandomizedSearchCV
 from ._split import (
@@ -63,6 +69,8 @@
     "StratifiedKFold",
     "StratifiedGroupKFold",
     "StratifiedShuffleSplit",
+    "FixedThresholdClassifier",
+    "TunedThresholdClassifierCV",
     "check_cv",
     "cross_val_predict",
     "cross_val_score",
diff --git a/sklearn/model_selection/_classification_threshold.py b/sklearn/model_selection/_classification_threshold.py
new file mode 100644
index 0000000000000..1d221d3388434
--- /dev/null
+++ b/sklearn/model_selection/_classification_threshold.py
@@ -0,0 +1,1019 @@
+from collections.abc import MutableMapping
+from numbers import Integral, Real
+
+import numpy as np
+
+from ..base import (
+    BaseEstimator,
+    ClassifierMixin,
+    MetaEstimatorMixin,
+    _fit_context,
+    clone,
+)
+from ..exceptions import NotFittedError
+from ..metrics import (
+    check_scoring,
+    get_scorer_names,
+)
+from ..metrics._scorer import _BaseScorer
+from ..utils import _safe_indexing
+from ..utils._param_validation import HasMethods, Interval, RealNotInt, StrOptions
+from ..utils._response import _get_response_values_binary
+from ..utils.metadata_routing import (
+    MetadataRouter,
+    MethodMapping,
+    _raise_for_params,
+    process_routing,
+)
+from ..utils.metaestimators import available_if
+from ..utils.multiclass import type_of_target
+from ..utils.parallel import Parallel, delayed
+from ..utils.validation import (
+    _check_method_params,
+    _num_samples,
+    check_is_fitted,
+    indexable,
+)
+from ._split import StratifiedShuffleSplit, check_cv
+
+
+def _estimator_has(attr):
+    """Check if we can delegate a method to the underlying estimator.
+
+    First, we check the fitted estimator if available, otherwise we
+    check the unfitted estimator.
+    """
+
+    def check(self):
+        if hasattr(self, "estimator_"):
+            getattr(self.estimator_, attr)
+        else:
+            getattr(self.estimator, attr)
+        return True
+
+    return check
+
+
+def _threshold_scores_to_class_labels(y_score, threshold, classes, pos_label):
+    """Threshold `y_score` and return the associated class labels."""
+    if pos_label is None:
+        map_thresholded_score_to_label = np.array([0, 1])
+    else:
+        pos_label_idx = np.flatnonzero(classes == pos_label)[0]
+        neg_label_idx = np.flatnonzero(classes != pos_label)[0]
+        map_thresholded_score_to_label = np.array([neg_label_idx, pos_label_idx])
+
+    return classes[map_thresholded_score_to_label[(y_score >= threshold).astype(int)]]
+
+
+class BaseThresholdClassifier(ClassifierMixin, MetaEstimatorMixin, BaseEstimator):
+    """Base class for binary classifiers that set a non-default decision threshold.
+
+    In this base class, we define the following interface:
+
+    - the validation of common parameters in `fit`;
+    - the different prediction methods that can be used with the classifier.
+
+    .. versionadded:: 1.5
+
+    Parameters
+    ----------
+    estimator : estimator instance
+        The binary classifier, fitted or not, for which we want to optimize
+        the decision threshold used during `predict`.
+
+    response_method : {"auto", "decision_function", "predict_proba"}, default="auto"
+        Methods by the classifier `estimator` corresponding to the
+        decision function for which we want to find a threshold. It can be:
+
+        * if `"auto"`, it will try to invoke, for each classifier,
+          `"predict_proba"` or `"decision_function"` in that order.
+        * otherwise, one of `"predict_proba"` or `"decision_function"`.
+          If the method is not implemented by the classifier, it will raise an
+          error.
+    """
+
+    _required_parameters = ["estimator"]
+    _parameter_constraints: dict = {
+        "estimator": [
+            HasMethods(["fit", "predict_proba"]),
+            HasMethods(["fit", "decision_function"]),
+        ],
+        "response_method": [StrOptions({"auto", "predict_proba", "decision_function"})],
+    }
+
+    def __init__(self, estimator, *, response_method="auto"):
+        self.estimator = estimator
+        self.response_method = response_method
+
+    def _get_response_method(self):
+        """Define the response method."""
+        if self.response_method == "auto":
+            response_method = ["predict_proba", "decision_function"]
+        else:
+            response_method = self.response_method
+        return response_method
+
+    @_fit_context(
+        # *ThresholdClassifier*.estimator is not validated yet
+        prefer_skip_nested_validation=False
+    )
+    def fit(self, X, y, **params):
+        """Fit the classifier.
+
+        Parameters
+        ----------
+        X : {array-like, sparse matrix} of shape (n_samples, n_features)
+            Training data.
+
+        y : array-like of shape (n_samples,)
+            Target values.
+
+        **params : dict
+            Parameters to pass to the `fit` method of the underlying
+            classifier.
+
+        Returns
+        -------
+        self : object
+            Returns an instance of self.
+        """
+        _raise_for_params(params, self, None)
+
+        X, y = indexable(X, y)
+
+        y_type = type_of_target(y, input_name="y")
+        if y_type != "binary":
+            raise ValueError(
+                f"Only binary classification is supported. Unknown label type: {y_type}"
+            )
+
+        self._fit(X, y, **params)
+
+        if hasattr(self.estimator_, "n_features_in_"):
+            self.n_features_in_ = self.estimator_.n_features_in_
+        if hasattr(self.estimator_, "feature_names_in_"):
+            self.feature_names_in_ = self.estimator_.feature_names_in_
+
+        return self
+
+    @property
+    def classes_(self):
+        """Classes labels."""
+        return self.estimator_.classes_
+
+    @available_if(_estimator_has("predict_proba"))
+    def predict_proba(self, X):
+        """Predict class probabilities for `X` using the fitted estimator.
+
+        Parameters
+        ----------
+        X : {array-like, sparse matrix} of shape (n_samples, n_features)
+            Training vectors, where `n_samples` is the number of samples and
+            `n_features` is the number of features.
+
+        Returns
+        -------
+        probabilities : ndarray of shape (n_samples, n_classes)
+            The class probabilities of the input samples.
+        """
+        check_is_fitted(self, "estimator_")
+        return self.estimator_.predict_proba(X)
+
+    @available_if(_estimator_has("predict_log_proba"))
+    def predict_log_proba(self, X):
+        """Predict logarithm class probabilities for `X` using the fitted estimator.
+
+        Parameters
+        ----------
+        X : {array-like, sparse matrix} of shape (n_samples, n_features)
+            Training vectors, where `n_samples` is the number of samples and
+            `n_features` is the number of features.
+
+        Returns
+        -------
+        log_probabilities : ndarray of shape (n_samples, n_classes)
+            The logarithm class probabilities of the input samples.
+        """
+        check_is_fitted(self, "estimator_")
+        return self.estimator_.predict_log_proba(X)
+
+    @available_if(_estimator_has("decision_function"))
+    def decision_function(self, X):
+        """Decision function for samples in `X` using the fitted estimator.
+
+        Parameters
+        ----------
+        X : {array-like, sparse matrix} of shape (n_samples, n_features)
+            Training vectors, where `n_samples` is the number of samples and
+            `n_features` is the number of features.
+
+        Returns
+        -------
+        decisions : ndarray of shape (n_samples,)
+            The decision function computed the fitted estimator.
+        """
+        check_is_fitted(self, "estimator_")
+        return self.estimator_.decision_function(X)
+
+    def _more_tags(self):
+        return {
+            "binary_only": True,
+            "_xfail_checks": {
+                "check_classifiers_train": "Threshold at probability 0.5 does not hold",
+                "check_sample_weights_invariance": (
+                    "Due to the cross-validation and sample ordering, removing a sample"
+                    " is not strictly equal to putting is weight to zero. Specific unit"
+                    " tests are added for TunedThresholdClassifierCV specifically."
+                ),
+            },
+        }
+
+
+class FixedThresholdClassifier(BaseThresholdClassifier):
+    """Binary classifier that manually sets the decision threshold.
+
+    This classifier allows to change the default decision threshold used for
+    converting posterior probability estimates (i.e. output of `predict_proba`) or
+    decision scores (i.e. output of `decision_function`) into a class label.
+
+    Here, the threshold is not optimized and is set to a constant value.
+
+    Read more in the :ref:`User Guide <FixedThresholdClassifier>`.
+
+    .. versionadded:: 1.5
+
+    Parameters
+    ----------
+    estimator : estimator instance
+        The binary classifier, fitted or not, for which we want to optimize
+        the decision threshold used during `predict`.
+
+    threshold : {"auto"} or float, default="auto"
+        The decision threshold to use when converting posterior probability estimates
+        (i.e. output of `predict_proba`) or decision scores (i.e. output of
+        `decision_function`) into a class label. When `"auto"`, the threshold is set
+        to 0.5 if `predict_proba` is used as `response_method`, otherwise it is set to
+        0 (i.e. the default threshold for `decision_function`).
+
+    pos_label : int, float, bool or str, default=None
+        The label of the positive class. Used to process the output of the
+        `response_method` method. When `pos_label=None`, if `y_true` is in `{-1, 1}` or
+        `{0, 1}`, `pos_label` is set to 1, otherwise an error will be raised.
+
+    response_method : {"auto", "decision_function", "predict_proba"}, default="auto"
+        Methods by the classifier `estimator` corresponding to the
+        decision function for which we want to find a threshold. It can be:
+
+        * if `"auto"`, it will try to invoke `"predict_proba"` or `"decision_function"`
+          in that order.
+        * otherwise, one of `"predict_proba"` or `"decision_function"`.
+          If the method is not implemented by the classifier, it will raise an
+          error.
+
+    prefit : bool, default=False
+        Whether a pre-fitted model is expected to be passed into the constructor
+        directly or not. If `True`, `estimator` must be a fitted estimator. If `False`,
+        `estimator` is fitted and updated by calling `fit`.
+
+        .. versionadded:: 1.6
+
+    Attributes
+    ----------
+    estimator_ : estimator instance
+        The fitted classifier used when predicting.
+
+    classes_ : ndarray of shape (n_classes,)
+        The class labels.
+
+    n_features_in_ : int
+        Number of features seen during :term:`fit`. Only defined if the
+        underlying estimator exposes such an attribute when fit.
+
+    feature_names_in_ : ndarray of shape (`n_features_in_`,)
+        Names of features seen during :term:`fit`. Only defined if the
+        underlying estimator exposes such an attribute when fit.
+
+    See Also
+    --------
+    sklearn.model_selection.TunedThresholdClassifierCV : Classifier that post-tunes
+        the decision threshold based on some metrics and using cross-validation.
+    sklearn.calibration.CalibratedClassifierCV : Estimator that calibrates
+        probabilities.
+
+    Examples
+    --------
+    >>> from sklearn.datasets import make_classification
+    >>> from sklearn.linear_model import LogisticRegression
+    >>> from sklearn.metrics import confusion_matrix
+    >>> from sklearn.model_selection import FixedThresholdClassifier, train_test_split
+    >>> X, y = make_classification(
+    ...     n_samples=1_000, weights=[0.9, 0.1], class_sep=0.8, random_state=42
+    ... )
+    >>> X_train, X_test, y_train, y_test = train_test_split(
+    ...     X, y, stratify=y, random_state=42
+    ... )
+    >>> classifier = LogisticRegression(random_state=0).fit(X_train, y_train)
+    >>> print(confusion_matrix(y_test, classifier.predict(X_test)))
+    [[217   7]
+     [ 19   7]]
+    >>> classifier_other_threshold = FixedThresholdClassifier(
+    ...     classifier, threshold=0.1, response_method="predict_proba"
+    ... ).fit(X_train, y_train)
+    >>> print(confusion_matrix(y_test, classifier_other_threshold.predict(X_test)))
+    [[184  40]
+     [  6  20]]
+    """
+
+    _parameter_constraints: dict = {
+        **BaseThresholdClassifier._parameter_constraints,
+        "threshold": [StrOptions({"auto"}), Real],
+        "pos_label": [Real, str, "boolean", None],
+        "prefit": ["boolean"],
+    }
+
+    def __init__(
+        self,
+        estimator,
+        *,
+        threshold="auto",
+        pos_label=None,
+        response_method="auto",
+        prefit=False,
+    ):
+        super().__init__(estimator=estimator, response_method=response_method)
+        self.pos_label = pos_label
+        self.threshold = threshold
+        self.prefit = prefit
+
+    def _fit(self, X, y, **params):
+        """Fit the classifier.
+
+        Parameters
+        ----------
+        X : {array-like, sparse matrix} of shape (n_samples, n_features)
+            Training data.
+
+        y : array-like of shape (n_samples,)
+            Target values.
+
+        **params : dict
+            Parameters to pass to the `fit` method of the underlying
+            classifier.
+
+        Returns
+        -------
+        self : object
+            Returns an instance of self.
+        """
+        routed_params = process_routing(self, "fit", **params)
+        if self.prefit:
+            check_is_fitted(self.estimator)
+            self.estimator_ = self.estimator
+        else:
+            self.estimator_ = clone(self.estimator).fit(
+                X, y, **routed_params.estimator.fit
+            )
+        return self
+
+    def predict(self, X):
+        """Predict the target of new samples.
+
+        Parameters
+        ----------
+        X : {array-like, sparse matrix} of shape (n_samples, n_features)
+            The samples, as accepted by `estimator.predict`.
+
+        Returns
+        -------
+        class_labels : ndarray of shape (n_samples,)
+            The predicted class.
+        """
+        check_is_fitted(self, "estimator_")
+        y_score, _, response_method_used = _get_response_values_binary(
+            self.estimator_,
+            X,
+            self._get_response_method(),
+            pos_label=self.pos_label,
+            return_response_method_used=True,
+        )
+
+        if self.threshold == "auto":
+            decision_threshold = 0.5 if response_method_used == "predict_proba" else 0.0
+        else:
+            decision_threshold = self.threshold
+
+        return _threshold_scores_to_class_labels(
+            y_score, decision_threshold, self.classes_, self.pos_label
+        )
+
+    def get_metadata_routing(self):
+        """Get metadata routing of this object.
+
+        Please check :ref:`User Guide <metadata_routing>` on how the routing
+        mechanism works.
+
+        Returns
+        -------
+        routing : MetadataRouter
+            A :class:`~sklearn.utils.metadata_routing.MetadataRouter` encapsulating
+            routing information.
+        """
+        router = MetadataRouter(owner=self.__class__.__name__).add(
+            estimator=self.estimator,
+            method_mapping=MethodMapping().add(callee="fit", caller="fit"),
+        )
+        return router
+
+
+class _CurveScorer(_BaseScorer):
+    """Scorer taking a continuous response and output a score for each threshold.
+
+    Parameters
+    ----------
+    score_func : callable
+        The score function to use. It will be called as
+        `score_func(y_true, y_pred, **kwargs)`.
+
+    sign : int
+        Either 1 or -1 to returns the score with `sign * score_func(estimator, X, y)`.
+        Thus, `sign` defined if higher scores are better or worse.
+
+    kwargs : dict
+        Additional parameters to pass to the score function.
+
+    thresholds : int or array-like
+        Related to the number of decision thresholds for which we want to compute the
+        score. If an integer, it will be used to generate `thresholds` thresholds
+        uniformly distributed between the minimum and maximum predicted scores. If an
+        array-like, it will be used as the thresholds.
+
+    response_method : str
+        The method to call on the estimator to get the response values.
+    """
+
+    def __init__(self, score_func, sign, kwargs, thresholds, response_method):
+        super().__init__(
+            score_func=score_func,
+            sign=sign,
+            kwargs=kwargs,
+            response_method=response_method,
+        )
+        self._thresholds = thresholds
+
+    @classmethod
+    def from_scorer(cls, scorer, response_method, thresholds):
+        """Create a continuous scorer from a normal scorer."""
+        instance = cls(
+            score_func=scorer._score_func,
+            sign=scorer._sign,
+            response_method=response_method,
+            thresholds=thresholds,
+            kwargs=scorer._kwargs,
+        )
+        # transfer the metadata request
+        instance._metadata_request = scorer._get_metadata_request()
+        return instance
+
+    def _score(self, method_caller, estimator, X, y_true, **kwargs):
+        """Evaluate predicted target values for X relative to y_true.
+
+        Parameters
+        ----------
+        method_caller : callable
+            Returns predictions given an estimator, method name, and other
+            arguments, potentially caching results.
+
+        estimator : object
+            Trained estimator to use for scoring.
+
+        X : {array-like, sparse matrix} of shape (n_samples, n_features)
+            Test data that will be fed to estimator.predict.
+
+        y_true : array-like of shape (n_samples,)
+            Gold standard target values for X.
+
+        **kwargs : dict
+            Other parameters passed to the scorer. Refer to
+            :func:`set_score_request` for more details.
+
+        Returns
+        -------
+        scores : ndarray of shape (thresholds,)
+            The scores associated to each threshold.
+
+        potential_thresholds : ndarray of shape (thresholds,)
+            The potential thresholds used to compute the scores.
+        """
+        pos_label = self._get_pos_label()
+        y_score = method_caller(
+            estimator, self._response_method, X, pos_label=pos_label
+        )
+
+        scoring_kwargs = {**self._kwargs, **kwargs}
+        if isinstance(self._thresholds, Integral):
+            potential_thresholds = np.linspace(
+                np.min(y_score), np.max(y_score), self._thresholds
+            )
+        else:
+            potential_thresholds = np.asarray(self._thresholds)
+        score_thresholds = [
+            self._sign
+            * self._score_func(
+                y_true,
+                _threshold_scores_to_class_labels(
+                    y_score, th, estimator.classes_, pos_label
+                ),
+                **scoring_kwargs,
+            )
+            for th in potential_thresholds
+        ]
+        return np.array(score_thresholds), potential_thresholds
+
+
+def _fit_and_score_over_thresholds(
+    classifier,
+    X,
+    y,
+    *,
+    fit_params,
+    train_idx,
+    val_idx,
+    curve_scorer,
+    score_params,
+):
+    """Fit a classifier and compute the scores for different decision thresholds.
+
+    Parameters
+    ----------
+    classifier : estimator instance
+        The classifier to fit and use for scoring. If `classifier` is already fitted,
+        it will be used as is.
+
+    X : {array-like, sparse matrix} of shape (n_samples, n_features)
+        The entire dataset.
+
+    y : array-like of shape (n_samples,)
+        The entire target vector.
+
+    fit_params : dict
+        Parameters to pass to the `fit` method of the underlying classifier.
+
+    train_idx : ndarray of shape (n_train_samples,) or None
+        The indices of the training set. If `None`, `classifier` is expected to be
+        already fitted.
+
+    val_idx : ndarray of shape (n_val_samples,)
+        The indices of the validation set used to score `classifier`. If `train_idx`,
+        the entire set will be used.
+
+    curve_scorer : scorer instance
+        The scorer taking `classifier` and the validation set as input and outputting
+        decision thresholds and scores as a curve. Note that this is different from
+        the usual scorer that output a single score value:
+
+        * when `score_method` is one of the four constraint metrics, the curve scorer
+          will output a curve of two scores parametrized by the decision threshold, e.g.
+          TPR/TNR or precision/recall curves for each threshold;
+        * otherwise, the curve scorer will output a single score value for each
+          threshold.
+
+    score_params : dict
+        Parameters to pass to the `score` method of the underlying scorer.
+
+    Returns
+    -------
+    scores : ndarray of shape (thresholds,) or tuple of such arrays
+        The scores computed for each decision threshold. When TPR/TNR or precision/
+        recall are computed, `scores` is a tuple of two arrays.
+
+    potential_thresholds : ndarray of shape (thresholds,)
+        The decision thresholds used to compute the scores. They are returned in
+        ascending order.
+    """
+
+    if train_idx is not None:
+        X_train, X_val = _safe_indexing(X, train_idx), _safe_indexing(X, val_idx)
+        y_train, y_val = _safe_indexing(y, train_idx), _safe_indexing(y, val_idx)
+        fit_params_train = _check_method_params(X, fit_params, indices=train_idx)
+        score_params_val = _check_method_params(X, score_params, indices=val_idx)
+        classifier.fit(X_train, y_train, **fit_params_train)
+    else:  # prefit estimator, only a validation set is provided
+        X_val, y_val, score_params_val = X, y, score_params
+
+    return curve_scorer(classifier, X_val, y_val, **score_params_val)
+
+
+def _mean_interpolated_score(target_thresholds, cv_thresholds, cv_scores):
+    """Compute the mean interpolated score across folds by defining common thresholds.
+
+    Parameters
+    ----------
+    target_thresholds : ndarray of shape (thresholds,)
+        The thresholds to use to compute the mean score.
+
+    cv_thresholds : ndarray of shape (n_folds, thresholds_fold)
+        The thresholds used to compute the scores for each fold.
+
+    cv_scores : ndarray of shape (n_folds, thresholds_fold)
+        The scores computed for each threshold for each fold.
+
+    Returns
+    -------
+    mean_score : ndarray of shape (thresholds,)
+        The mean score across all folds for each target threshold.
+    """
+    return np.mean(
+        [
+            np.interp(target_thresholds, split_thresholds, split_score)
+            for split_thresholds, split_score in zip(cv_thresholds, cv_scores)
+        ],
+        axis=0,
+    )
+
+
+class TunedThresholdClassifierCV(BaseThresholdClassifier):
+    """Classifier that post-tunes the decision threshold using cross-validation.
+
+    This estimator post-tunes the decision threshold (cut-off point) that is
+    used for converting posterior probability estimates (i.e. output of
+    `predict_proba`) or decision scores (i.e. output of `decision_function`)
+    into a class label. The tuning is done by optimizing a binary metric,
+    potentially constrained by a another metric.
+
+    Read more in the :ref:`User Guide <TunedThresholdClassifierCV>`.
+
+    .. versionadded:: 1.5
+
+    Parameters
+    ----------
+    estimator : estimator instance
+        The classifier, fitted or not, for which we want to optimize
+        the decision threshold used during `predict`.
+
+    scoring : str or callable, default="balanced_accuracy"
+        The objective metric to be optimized. Can be one of:
+
+        * a string associated to a scoring function for binary classification
+          (see :ref:`scoring_parameter`);
+        * a scorer callable object created with :func:`~sklearn.metrics.make_scorer`;
+
+    response_method : {"auto", "decision_function", "predict_proba"}, default="auto"
+        Methods by the classifier `estimator` corresponding to the
+        decision function for which we want to find a threshold. It can be:
+
+        * if `"auto"`, it will try to invoke, for each classifier,
+          `"predict_proba"` or `"decision_function"` in that order.
+        * otherwise, one of `"predict_proba"` or `"decision_function"`.
+          If the method is not implemented by the classifier, it will raise an
+          error.
+
+    thresholds : int or array-like, default=100
+        The number of decision threshold to use when discretizing the output of the
+        classifier `method`. Pass an array-like to manually specify the thresholds
+        to use.
+
+    cv : int, float, cross-validation generator, iterable or "prefit", default=None
+        Determines the cross-validation splitting strategy to train classifier.
+        Possible inputs for cv are:
+
+        * `None`, to use the default 5-fold stratified K-fold cross validation;
+        * An integer number, to specify the number of folds in a stratified k-fold;
+        * A float number, to specify a single shuffle split. The floating number should
+          be in (0, 1) and represent the size of the validation set;
+        * An object to be used as a cross-validation generator;
+        * An iterable yielding train, test splits;
+        * `"prefit"`, to bypass the cross-validation.
+
+        Refer :ref:`User Guide <cross_validation>` for the various
+        cross-validation strategies that can be used here.
+
+        .. warning::
+            Using `cv="prefit"` and passing the same dataset for fitting `estimator`
+            and tuning the cut-off point is subject to undesired overfitting. You can
+            refer to :ref:`TunedThresholdClassifierCV_no_cv` for an example.
+
+            This option should only be used when the set used to fit `estimator` is
+            different from the one used to tune the cut-off point (by calling
+            :meth:`TunedThresholdClassifierCV.fit`).
+
+    refit : bool, default=True
+        Whether or not to refit the classifier on the entire training set once
+        the decision threshold has been found.
+        Note that forcing `refit=False` on cross-validation having more
+        than a single split will raise an error. Similarly, `refit=True` in
+        conjunction with `cv="prefit"` will raise an error.
+
+    n_jobs : int, default=None
+        The number of jobs to run in parallel. When `cv` represents a
+        cross-validation strategy, the fitting and scoring on each data split
+        is done in parallel. ``None`` means 1 unless in a
+        :obj:`joblib.parallel_backend` context. ``-1`` means using all
+        processors. See :term:`Glossary <n_jobs>` for more details.
+
+    random_state : int, RandomState instance or None, default=None
+        Controls the randomness of cross-validation when `cv` is a float.
+        See :term:`Glossary <random_state>`.
+
+    store_cv_results : bool, default=False
+        Whether to store all scores and thresholds computed during the cross-validation
+        process.
+
+    Attributes
+    ----------
+    estimator_ : estimator instance
+        The fitted classifier used when predicting.
+
+    best_threshold_ : float
+        The new decision threshold.
+
+    best_score_ : float or None
+        The optimal score of the objective metric, evaluated at `best_threshold_`.
+
+    cv_results_ : dict or None
+        A dictionary containing the scores and thresholds computed during the
+        cross-validation process. Only exist if `store_cv_results=True`. The
+        keys are `"thresholds"` and `"scores"`.
+
+    classes_ : ndarray of shape (n_classes,)
+        The class labels.
+
+    n_features_in_ : int
+        Number of features seen during :term:`fit`. Only defined if the
+        underlying estimator exposes such an attribute when fit.
+
+    feature_names_in_ : ndarray of shape (`n_features_in_`,)
+        Names of features seen during :term:`fit`. Only defined if the
+        underlying estimator exposes such an attribute when fit.
+
+    See Also
+    --------
+    sklearn.model_selection.FixedThresholdClassifier : Classifier that uses a
+        constant threshold.
+    sklearn.calibration.CalibratedClassifierCV : Estimator that calibrates
+        probabilities.
+
+    Examples
+    --------
+    >>> from sklearn.datasets import make_classification
+    >>> from sklearn.ensemble import RandomForestClassifier
+    >>> from sklearn.metrics import classification_report
+    >>> from sklearn.model_selection import TunedThresholdClassifierCV, train_test_split
+    >>> X, y = make_classification(
+    ...     n_samples=1_000, weights=[0.9, 0.1], class_sep=0.8, random_state=42
+    ... )
+    >>> X_train, X_test, y_train, y_test = train_test_split(
+    ...     X, y, stratify=y, random_state=42
+    ... )
+    >>> classifier = RandomForestClassifier(random_state=0).fit(X_train, y_train)
+    >>> print(classification_report(y_test, classifier.predict(X_test)))
+                  precision    recall  f1-score   support
+    <BLANKLINE>
+               0       0.94      0.99      0.96       224
+               1       0.80      0.46      0.59        26
+    <BLANKLINE>
+        accuracy                           0.93       250
+       macro avg       0.87      0.72      0.77       250
+    weighted avg       0.93      0.93      0.92       250
+    <BLANKLINE>
+    >>> classifier_tuned = TunedThresholdClassifierCV(
+    ...     classifier, scoring="balanced_accuracy"
+    ... ).fit(X_train, y_train)
+    >>> print(
+    ...     f"Cut-off point found at {classifier_tuned.best_threshold_:.3f}"
+    ... )
+    Cut-off point found at 0.342
+    >>> print(classification_report(y_test, classifier_tuned.predict(X_test)))
+                  precision    recall  f1-score   support
+    <BLANKLINE>
+               0       0.96      0.95      0.96       224
+               1       0.61      0.65      0.63        26
+    <BLANKLINE>
+        accuracy                           0.92       250
+       macro avg       0.78      0.80      0.79       250
+    weighted avg       0.92      0.92      0.92       250
+    <BLANKLINE>
+    """
+
+    _parameter_constraints: dict = {
+        **BaseThresholdClassifier._parameter_constraints,
+        "scoring": [
+            StrOptions(set(get_scorer_names())),
+            callable,
+            MutableMapping,
+        ],
+        "thresholds": [Interval(Integral, 1, None, closed="left"), "array-like"],
+        "cv": [
+            "cv_object",
+            StrOptions({"prefit"}),
+            Interval(RealNotInt, 0.0, 1.0, closed="neither"),
+        ],
+        "refit": ["boolean"],
+        "n_jobs": [Integral, None],
+        "random_state": ["random_state"],
+        "store_cv_results": ["boolean"],
+    }
+
+    def __init__(
+        self,
+        estimator,
+        *,
+        scoring="balanced_accuracy",
+        response_method="auto",
+        thresholds=100,
+        cv=None,
+        refit=True,
+        n_jobs=None,
+        random_state=None,
+        store_cv_results=False,
+    ):
+        super().__init__(estimator=estimator, response_method=response_method)
+        self.scoring = scoring
+        self.thresholds = thresholds
+        self.cv = cv
+        self.refit = refit
+        self.n_jobs = n_jobs
+        self.random_state = random_state
+        self.store_cv_results = store_cv_results
+
+    def _fit(self, X, y, **params):
+        """Fit the classifier and post-tune the decision threshold.
+
+        Parameters
+        ----------
+        X : {array-like, sparse matrix} of shape (n_samples, n_features)
+            Training data.
+
+        y : array-like of shape (n_samples,)
+            Target values.
+
+        **params : dict
+            Parameters to pass to the `fit` method of the underlying
+            classifier and to the `scoring` scorer.
+
+        Returns
+        -------
+        self : object
+            Returns an instance of self.
+        """
+        if isinstance(self.cv, Real) and 0 < self.cv < 1:
+            cv = StratifiedShuffleSplit(
+                n_splits=1, test_size=self.cv, random_state=self.random_state
+            )
+        elif self.cv == "prefit":
+            if self.refit is True:
+                raise ValueError("When cv='prefit', refit cannot be True.")
+            try:
+                check_is_fitted(self.estimator, "classes_")
+            except NotFittedError as exc:
+                raise NotFittedError(
+                    """When cv='prefit', `estimator` must be fitted."""
+                ) from exc
+            cv = self.cv
+        else:
+            cv = check_cv(self.cv, y=y, classifier=True)
+            if self.refit is False and cv.get_n_splits() > 1:
+                raise ValueError("When cv has several folds, refit cannot be False.")
+
+        routed_params = process_routing(self, "fit", **params)
+        self._curve_scorer = self._get_curve_scorer()
+
+        # in the following block, we:
+        # - define the final classifier `self.estimator_` and train it if necessary
+        # - define `classifier` to be used to post-tune the decision threshold
+        # - define `split` to be used to fit/score `classifier`
+        if cv == "prefit":
+            self.estimator_ = self.estimator
+            classifier = self.estimator_
+            splits = [(None, range(_num_samples(X)))]
+        else:
+            self.estimator_ = clone(self.estimator)
+            classifier = clone(self.estimator)
+            splits = cv.split(X, y, **routed_params.splitter.split)
+
+            if self.refit:
+                # train on the whole dataset
+                X_train, y_train, fit_params_train = X, y, routed_params.estimator.fit
+            else:
+                # single split cross-validation
+                train_idx, _ = next(cv.split(X, y, **routed_params.splitter.split))
+                X_train = _safe_indexing(X, train_idx)
+                y_train = _safe_indexing(y, train_idx)
+                fit_params_train = _check_method_params(
+                    X, routed_params.estimator.fit, indices=train_idx
+                )
+
+            self.estimator_.fit(X_train, y_train, **fit_params_train)
+
+        cv_scores, cv_thresholds = zip(
+            *Parallel(n_jobs=self.n_jobs)(
+                delayed(_fit_and_score_over_thresholds)(
+                    clone(classifier) if cv != "prefit" else classifier,
+                    X,
+                    y,
+                    fit_params=routed_params.estimator.fit,
+                    train_idx=train_idx,
+                    val_idx=val_idx,
+                    curve_scorer=self._curve_scorer,
+                    score_params=routed_params.scorer.score,
+                )
+                for train_idx, val_idx in splits
+            )
+        )
+
+        if any(np.isclose(th[0], th[-1]) for th in cv_thresholds):
+            raise ValueError(
+                "The provided estimator makes constant predictions. Therefore, it is "
+                "impossible to optimize the decision threshold."
+            )
+
+        # find the global min and max thresholds across all folds
+        min_threshold = min(
+            split_thresholds.min() for split_thresholds in cv_thresholds
+        )
+        max_threshold = max(
+            split_thresholds.max() for split_thresholds in cv_thresholds
+        )
+        if isinstance(self.thresholds, Integral):
+            decision_thresholds = np.linspace(
+                min_threshold, max_threshold, num=self.thresholds
+            )
+        else:
+            decision_thresholds = np.asarray(self.thresholds)
+
+        objective_scores = _mean_interpolated_score(
+            decision_thresholds, cv_thresholds, cv_scores
+        )
+        best_idx = objective_scores.argmax()
+        self.best_score_ = objective_scores[best_idx]
+        self.best_threshold_ = decision_thresholds[best_idx]
+        if self.store_cv_results:
+            self.cv_results_ = {
+                "thresholds": decision_thresholds,
+                "scores": objective_scores,
+            }
+
+        return self
+
+    def predict(self, X):
+        """Predict the target of new samples.
+
+        Parameters
+        ----------
+        X : {array-like, sparse matrix} of shape (n_samples, n_features)
+            The samples, as accepted by `estimator.predict`.
+
+        Returns
+        -------
+        class_labels : ndarray of shape (n_samples,)
+            The predicted class.
+        """
+        check_is_fitted(self, "estimator_")
+        pos_label = self._curve_scorer._get_pos_label()
+        y_score, _ = _get_response_values_binary(
+            self.estimator_,
+            X,
+            self._get_response_method(),
+            pos_label=pos_label,
+        )
+
+        return _threshold_scores_to_class_labels(
+            y_score, self.best_threshold_, self.classes_, pos_label
+        )
+
+    def get_metadata_routing(self):
+        """Get metadata routing of this object.
+
+        Please check :ref:`User Guide <metadata_routing>` on how the routing
+        mechanism works.
+
+        Returns
+        -------
+        routing : MetadataRouter
+            A :class:`~sklearn.utils.metadata_routing.MetadataRouter` encapsulating
+            routing information.
+        """
+        router = (
+            MetadataRouter(owner=self.__class__.__name__)
+            .add(
+                estimator=self.estimator,
+                method_mapping=MethodMapping().add(callee="fit", caller="fit"),
+            )
+            .add(
+                splitter=self.cv,
+                method_mapping=MethodMapping().add(callee="split", caller="fit"),
+            )
+            .add(
+                scorer=self._get_curve_scorer(),
+                method_mapping=MethodMapping().add(callee="score", caller="fit"),
+            )
+        )
+        return router
+
+    def _get_curve_scorer(self):
+        """Get the curve scorer based on the objective metric used."""
+        scoring = check_scoring(self.estimator, scoring=self.scoring)
+        curve_scorer = _CurveScorer.from_scorer(
+            scoring, self._get_response_method(), self.thresholds
+        )
+        return curve_scorer
diff --git a/sklearn/model_selection/_plot.py b/sklearn/model_selection/_plot.py
index b07a41289f748..08518cf2482d4 100644
--- a/sklearn/model_selection/_plot.py
+++ b/sklearn/model_selection/_plot.py
@@ -1,5 +1,3 @@
-import warnings
-
 import numpy as np
 
 from ..utils._optional_dependencies import check_matplotlib_support
@@ -16,7 +14,6 @@ def _plot_curve(
         negate_score=False,
         score_name=None,
         score_type="test",
-        log_scale="deprecated",
         std_display_style="fill_between",
         line_kw=None,
         fill_between_kw=None,
@@ -108,25 +105,14 @@ def _plot_curve(
 
         ax.legend()
 
-        # TODO(1.5): to be removed
-        if log_scale != "deprecated":
-            warnings.warn(
-                (
-                    "The `log_scale` parameter is deprecated as of version 1.3 "
-                    "and will be removed in 1.5. You can use display.ax_.set_xscale "
-                    "and display.ax_.set_yscale instead."
-                ),
-                FutureWarning,
-            )
-            xscale = "log" if log_scale else "linear"
+        # We found that a ratio, smaller or bigger than 5, between the largest and
+        # smallest gap of the x values is a good indicator to choose between linear
+        # and log scale.
+        if _interval_max_min_ratio(x_data) > 5:
+            xscale = "symlog" if x_data.min() <= 0 else "log"
         else:
-            # We found that a ratio, smaller or bigger than 5, between the largest and
-            # smallest gap of the x values is a good indicator to choose between linear
-            # and log scale.
-            if _interval_max_min_ratio(x_data) > 5:
-                xscale = "symlog" if x_data.min() <= 0 else "log"
-            else:
-                xscale = "linear"
+            xscale = "linear"
+
         ax.set_xscale(xscale)
         ax.set_ylabel(f"{score_name}")
 
@@ -226,7 +212,6 @@ def plot(
         negate_score=False,
         score_name=None,
         score_type="both",
-        log_scale="deprecated",
         std_display_style="fill_between",
         line_kw=None,
         fill_between_kw=None,
@@ -259,13 +244,6 @@ def plot(
             The type of score to plot. Can be one of `"test"`, `"train"`, or
             `"both"`.
 
-        log_scale : bool, default="deprecated"
-            Whether or not to use a logarithmic scale for the x-axis.
-
-            .. deprecated:: 1.3
-               `log_scale` is deprecated in 1.3 and will be removed in 1.5.
-               Use `display.ax_.set_xscale` and `display.ax_.set_yscale` instead.
-
         std_display_style : {"errorbar", "fill_between"} or None, default="fill_between"
             The style used to display the score standard deviation around the
             mean score. If None, no standard deviation representation is
@@ -294,7 +272,6 @@ def plot(
             negate_score=negate_score,
             score_name=score_name,
             score_type=score_type,
-            log_scale=log_scale,
             std_display_style=std_display_style,
             line_kw=line_kw,
             fill_between_kw=fill_between_kw,
@@ -326,7 +303,6 @@ def from_estimator(
         negate_score=False,
         score_name=None,
         score_type="both",
-        log_scale="deprecated",
         std_display_style="fill_between",
         line_kw=None,
         fill_between_kw=None,
@@ -451,13 +427,6 @@ def from_estimator(
             The type of score to plot. Can be one of `"test"`, `"train"`, or
             `"both"`.
 
-        log_scale : bool, default="deprecated"
-            Whether or not to use a logarithmic scale for the x-axis.
-
-            .. deprecated:: 1.3
-               `log_scale` is deprecated in 1.3 and will be removed in 1.5.
-               Use `display.ax_.xscale` and `display.ax_.yscale` instead.
-
         std_display_style : {"errorbar", "fill_between"} or None, default="fill_between"
             The style used to display the score standard deviation around the
             mean score. If `None`, no representation of the standard deviation
@@ -525,7 +494,6 @@ def from_estimator(
             ax=ax,
             negate_score=negate_score,
             score_type=score_type,
-            log_scale=log_scale,
             std_display_style=std_display_style,
             line_kw=line_kw,
             fill_between_kw=fill_between_kw,
@@ -694,7 +662,6 @@ def plot(
             negate_score=negate_score,
             score_name=score_name,
             score_type=score_type,
-            log_scale="deprecated",
             std_display_style=std_display_style,
             line_kw=line_kw,
             fill_between_kw=fill_between_kw,
diff --git a/sklearn/model_selection/_search.py b/sklearn/model_selection/_search.py
index 9b9072f1491a2..1fa85808b91d1 100644
--- a/sklearn/model_selection/_search.py
+++ b/sklearn/model_selection/_search.py
@@ -3,12 +3,8 @@
 parameters of an estimator.
 """
 
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>,
-#         Gael Varoquaux <gael.varoquaux@normalesup.org>
-#         Andreas Mueller <amueller@ais.uni-bonn.de>
-#         Olivier Grisel <olivier.grisel@ensta.org>
-#         Raghav RV <rvraghav93@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numbers
 import operator
@@ -33,8 +29,10 @@
     get_scorer_names,
 )
 from ..utils import Bunch, check_random_state
+from ..utils._estimator_html_repr import _VisualBlock
 from ..utils._param_validation import HasMethods, Interval, StrOptions
 from ..utils._tags import _safe_tags
+from ..utils.deprecation import _deprecate_Xt_in_inverse_transform
 from ..utils.metadata_routing import (
     MetadataRouter,
     MethodMapping,
@@ -381,6 +379,56 @@ def check(self):
     return check
 
 
+def _yield_masked_array_for_each_param(candidate_params):
+    """
+    Yield a masked array for each candidate param.
+
+    `candidate_params` is a sequence of params which were used in
+    a `GridSearchCV`. We use masked arrays for the results, as not
+    all params are necessarily present in each element of
+    `candidate_params`. For example, if using `GridSearchCV` with
+    a `SVC` model, then one might search over params like:
+
+        - kernel=["rbf"], gamma=[0.1, 1]
+        - kernel=["poly"], degree=[1, 2]
+
+    and then param `'gamma'` would not be present in entries of
+    `candidate_params` corresponding to `kernel='poly'`.
+    """
+    n_candidates = len(candidate_params)
+    param_results = defaultdict(dict)
+
+    for cand_idx, params in enumerate(candidate_params):
+        for name, value in params.items():
+            param_results["param_%s" % name][cand_idx] = value
+
+    for key, param_result in param_results.items():
+        param_list = list(param_result.values())
+        try:
+            arr = np.array(param_list)
+        except ValueError:
+            # This can happen when param_list contains lists of different
+            # lengths, for example:
+            # param_list=[[1], [2, 3]]
+            arr_dtype = np.dtype(object)
+        else:
+            # There are two cases when we don't use the automatically inferred
+            # dtype when creating the array and we use object instead:
+            # - string dtype
+            # - when array.ndim > 1, that means that param_list was something
+            #   like a list of same-size sequences, which gets turned into a
+            #   multi-dimensional array but we want a 1d array
+            arr_dtype = arr.dtype if arr.dtype.kind != "U" and arr.ndim == 1 else object
+
+        # Use one MaskedArray and mask all the places where the param is not
+        # applicable for that candidate (which may not contain all the params).
+        ma = MaskedArray(np.empty(n_candidates), mask=True, dtype=arr_dtype)
+        for index, value in param_result.items():
+            # Setting the value at an index unmasks that index
+            ma[index] = value
+        yield (key, ma)
+
+
 class BaseSearchCV(MetaEstimatorMixin, BaseEstimator, metaclass=ABCMeta):
     """Abstract base class for hyper parameter search with cross-validation."""
 
@@ -438,6 +486,7 @@ def _more_tags(self):
             "_xfail_checks": {
                 "check_supervised_y_2d": "DataConversionWarning not caught"
             },
+            "array_api_support": _safe_tags(self.estimator, "array_api_support"),
         }
 
     def score(self, X, y=None, **params):
@@ -636,7 +685,7 @@ def transform(self, X):
         return self.best_estimator_.transform(X)
 
     @available_if(_estimator_has("inverse_transform"))
-    def inverse_transform(self, Xt):
+    def inverse_transform(self, X=None, Xt=None):
         """Call inverse_transform on the estimator with the best found params.
 
         Only available if the underlying estimator implements
@@ -644,18 +693,26 @@ def inverse_transform(self, Xt):
 
         Parameters
         ----------
+        X : indexable, length n_samples
+            Must fulfill the input assumptions of the
+            underlying estimator.
+
         Xt : indexable, length n_samples
             Must fulfill the input assumptions of the
             underlying estimator.
 
+            .. deprecated:: 1.5
+                `Xt` was deprecated in 1.5 and will be removed in 1.7. Use `X` instead.
+
         Returns
         -------
         X : {ndarray, sparse matrix} of shape (n_samples, n_features)
             Result of the `inverse_transform` function for `Xt` based on the
             estimator with the best found parameters.
         """
+        X = _deprecate_Xt_in_inverse_transform(X, Xt)
         check_is_fitted(self)
-        return self.best_estimator_.inverse_transform(Xt)
+        return self.best_estimator_.inverse_transform(X)
 
     @property
     def n_features_in_(self):
@@ -962,7 +1019,7 @@ def evaluate_candidates(candidate_params, cv=None, more_results=None):
             first_test_score = all_out[0]["test_scores"]
             self.multimetric_ = isinstance(first_test_score, dict)
 
-            # check refit_metric now for a callabe scorer that is multimetric
+            # check refit_metric now for a callable scorer that is multimetric
             if callable(self.scoring) and self.multimetric_:
                 self._check_refit_for_multimetric(first_test_score)
                 refit_metric = self.refit
@@ -1072,30 +1129,9 @@ def _store(key_name, array, weights=None, splits=False, rank=False):
 
         _store("fit_time", out["fit_time"])
         _store("score_time", out["score_time"])
-        param_results = defaultdict(dict)
-        for cand_idx, params in enumerate(candidate_params):
-            for name, value in params.items():
-                param_results["param_%s" % name][cand_idx] = value
-        for key, param_result in param_results.items():
-            param_list = list(param_result.values())
-            try:
-                arr_dtype = np.result_type(*param_list)
-            except TypeError:
-                arr_dtype = object
-            if len(param_list) == n_candidates and arr_dtype != object:
-                # Exclude `object` else the numpy constructor might infer a list of
-                # tuples to be a 2d array.
-                results[key] = MaskedArray(param_list, mask=False, dtype=arr_dtype)
-            else:
-                # Use one MaskedArray and mask all the places where the param is not
-                # applicable for that candidate (which may not contain all the params).
-                ma = MaskedArray(np.empty(n_candidates), mask=True, dtype=arr_dtype)
-                for index, value in param_result.items():
-                    # Setting the value at an index unmasks that index
-                    ma[index] = value
-                results[key] = ma
-
         # Store a list of param dicts at the key 'params'
+        for param, ma in _yield_masked_array_for_each_param(candidate_params):
+            results[param] = ma
         results["params"] = candidate_params
 
         test_scores_dict = _normalize_score_results(out["test_scores"])
@@ -1153,6 +1189,19 @@ def get_metadata_routing(self):
         )
         return router
 
+    def _sk_visual_block_(self):
+        if hasattr(self, "best_estimator_"):
+            key, estimator = "best_estimator_", self.best_estimator_
+        else:
+            key, estimator = "estimator", self.estimator
+
+        return _VisualBlock(
+            "parallel",
+            [estimator],
+            names=[f"{key}: {estimator.__class__.__name__}"],
+            name_details=[str(estimator)],
+        )
+
 
 class GridSearchCV(BaseSearchCV):
     """Exhaustive search over specified parameter values for an estimator.
diff --git a/sklearn/model_selection/_split.py b/sklearn/model_selection/_split.py
index 53c11a665ccf4..bfd741eee5811 100644
--- a/sklearn/model_selection/_split.py
+++ b/sklearn/model_selection/_split.py
@@ -3,13 +3,8 @@
 functions to split the data based on a preset strategy.
 """
 
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#         Gael Varoquaux <gael.varoquaux@normalesup.org>
-#         Olivier Grisel <olivier.grisel@ensta.org>
-#         Raghav RV <rvraghav93@gmail.com>
-#         Leandro Hermida <hermidal@cs.umd.edu>
-#         Rodion Martynov <marrodion@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numbers
 import warnings
@@ -745,7 +740,15 @@ def __init__(self, n_splits=5, *, shuffle=False, random_state=None):
 
     def _make_test_folds(self, X, y=None):
         rng = check_random_state(self.random_state)
-        y = np.asarray(y)
+        # XXX: as of now, cross-validation splitters only operate in NumPy-land
+        # without attempting to leverage array API namespace features. However
+        # they might be fed by array API inputs, e.g. in CV-enabled estimators so
+        # we need the following explicit conversion:
+        xp, is_array_api = get_namespace(y)
+        if is_array_api:
+            y = _convert_to_numpy(y, xp)
+        else:
+            y = np.asarray(y)
         type_of_target_y = type_of_target(y)
         allowed_target_types = ("binary", "multiclass")
         if type_of_target_y not in allowed_target_types:
@@ -863,15 +866,15 @@ class StratifiedGroupKFold(GroupsConsumerMixin, _BaseKFold):
     Each group will appear exactly once in the test set across all folds (the
     number of distinct groups has to be at least equal to the number of folds).
 
-    The difference between :class:`~sklearn.model_selection.GroupKFold`
-    and :class:`~sklearn.model_selection.StratifiedGroupKFold` is that
+    The difference between :class:`GroupKFold`
+    and `StratifiedGroupKFold` is that
     the former attempts to create balanced folds such that the number of
     distinct groups is approximately the same in each fold, whereas
-    StratifiedGroupKFold attempts to create folds which preserve the
+    `StratifiedGroupKFold` attempts to create folds which preserve the
     percentage of samples for each class as much as possible given the
     constraint of non-overlapping groups between splits.
 
-    Read more in the :ref:`User Guide <cross_validation>`.
+    Read more in the :ref:`User Guide <stratified_group_k_fold>`.
 
     For visualisation of cross-validation behaviour and
     comparison between common scikit-learn split methods
@@ -1175,7 +1178,9 @@ class TimeSeriesSplit(_BaseKFold):
     The training set has size ``i * n_samples // (n_splits + 1)
     + n_samples % (n_splits + 1)`` in the ``i`` th split,
     with a test set of size ``n_samples//(n_splits + 1)`` by default,
-    where ``n_samples`` is the number of samples.
+    where ``n_samples`` is the number of samples. Note that this
+    formula is only valid when ``test_size`` and ``max_train_size`` are
+    left to their default values.
     """
 
     def __init__(self, n_splits=5, *, max_train_size=None, test_size=None, gap=0):
@@ -1764,6 +1769,43 @@ def __init__(self, *, n_splits=5, n_repeats=10, random_state=None):
             n_splits=n_splits,
         )
 
+    def split(self, X, y, groups=None):
+        """Generate indices to split data into training and test set.
+
+        Parameters
+        ----------
+        X : array-like of shape (n_samples, n_features)
+            Training data, where `n_samples` is the number of samples
+            and `n_features` is the number of features.
+
+            Note that providing ``y`` is sufficient to generate the splits and
+            hence ``np.zeros(n_samples)`` may be used as a placeholder for
+            ``X`` instead of actual training data.
+
+        y : array-like of shape (n_samples,)
+            The target variable for supervised learning problems.
+            Stratification is done based on the y labels.
+
+        groups : object
+            Always ignored, exists for compatibility.
+
+        Yields
+        ------
+        train : ndarray
+            The training set indices for that split.
+
+        test : ndarray
+            The testing set indices for that split.
+
+        Notes
+        -----
+        Randomized CV splitters may return different results for each call of
+        split. You can make the results identical by setting `random_state`
+        to an integer.
+        """
+        y = check_array(y, input_name="y", ensure_2d=False, dtype=None)
+        return super().split(X, y, groups=groups)
+
 
 class BaseShuffleSplit(_MetadataRequester, metaclass=ABCMeta):
     """Base class for *ShuffleSplit.
@@ -2596,7 +2638,7 @@ def check_cv(cv=5, y=None, *, classifier=False):
 
     Parameters
     ----------
-    cv : int, cross-validation generator or an iterable, default=None
+    cv : int, cross-validation generator, iterable or None, default=5
         Determines the cross-validation splitting strategy.
         Possible inputs for cv are:
         - None, to use the default 5-fold cross validation,
diff --git a/sklearn/model_selection/_validation.py b/sklearn/model_selection/_validation.py
index 176627ace91d4..ddc9b542b0a5e 100644
--- a/sklearn/model_selection/_validation.py
+++ b/sklearn/model_selection/_validation.py
@@ -3,12 +3,8 @@
 functions to validate the model.
 """
 
-# Author: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#         Gael Varoquaux <gael.varoquaux@normalesup.org>
-#         Olivier Grisel <olivier.grisel@ensta.org>
-#         Raghav RV <rvraghav93@gmail.com>
-#         Michal Karbownik <michakarbownik@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 import numbers
@@ -27,9 +23,10 @@
 from ..base import clone, is_classifier
 from ..exceptions import FitFailedWarning, UnsetMetadataPassedError
 from ..metrics import check_scoring, get_scorer_names
-from ..metrics._scorer import _check_multimetric_scoring, _MultimetricScorer
+from ..metrics._scorer import _MultimetricScorer
 from ..preprocessing import LabelEncoder
 from ..utils import Bunch, _safe_indexing, check_random_state, indexable
+from ..utils._array_api import device, get_namespace
 from ..utils._param_validation import (
     HasMethods,
     Integral,
@@ -58,21 +55,22 @@
 ]
 
 
-def _check_params_groups_deprecation(fit_params, params, groups):
+def _check_params_groups_deprecation(fit_params, params, groups, version):
     """A helper function to check deprecations on `groups` and `fit_params`.
 
-    To be removed when set_config(enable_metadata_routing=False) is not possible.
+    # TODO(SLEP6): To be removed when set_config(enable_metadata_routing=False) is not
+    # possible.
     """
     if params is not None and fit_params is not None:
         raise ValueError(
             "`params` and `fit_params` cannot both be provided. Pass parameters "
             "via `params`. `fit_params` is deprecated and will be removed in "
-            "version 1.6."
+            f"version {version}."
         )
     elif fit_params is not None:
         warnings.warn(
             (
-                "`fit_params` is deprecated and will be removed in version 1.6. "
+                "`fit_params` is deprecated and will be removed in version {version}. "
                 "Pass parameters via `params` instead."
             ),
             FutureWarning,
@@ -346,21 +344,15 @@ def cross_validate(
     >>> print(scores['train_r2'])
     [0.28009951 0.3908844  0.22784907]
     """
-    params = _check_params_groups_deprecation(fit_params, params, groups)
+    params = _check_params_groups_deprecation(fit_params, params, groups, "1.6")
 
     X, y = indexable(X, y)
 
     cv = check_cv(cv, y, classifier=is_classifier(estimator))
 
-    if callable(scoring):
-        scorers = scoring
-    elif scoring is None or isinstance(scoring, str):
-        scorers = check_scoring(estimator, scoring)
-    else:
-        scorers = _check_multimetric_scoring(estimator, scoring)
-        scorers = _MultimetricScorer(
-            scorers=scorers, raise_exc=(error_score == "raise")
-        )
+    scorers = check_scoring(
+        estimator, scoring=scoring, raise_exc=(error_score == "raise")
+    )
 
     if _routing_enabled():
         # For estimators, a MetadataRouter is created in get_metadata_routing
@@ -602,10 +594,8 @@ def cross_val_score(
             ``cross_val_score(..., params={'groups': groups})``.
 
     scoring : str or callable, default=None
-        A str (see model evaluation documentation) or
-        a scorer callable object / function with signature
-        ``scorer(estimator, X, y)`` which should return only
-        a single value.
+        A str (see :ref:`scoring_parameter`) or a scorer callable object / function with
+        signature ``scorer(estimator, X, y)`` which should return only a single value.
 
         Similar to :func:`cross_validate`
         but only a single metric is permitted.
@@ -837,6 +827,13 @@ def _fit_and_score(
         fit_error : str or None
             Traceback str if the fit failed, None if the fit succeeded.
     """
+    xp, _ = get_namespace(X)
+    X_device = device(X)
+
+    # Make sure that we can fancy index X even if train and test are provided
+    # as NumPy arrays by NumPy only cross-validation splitters.
+    train, test = xp.asarray(train, device=X_device), xp.asarray(test, device=X_device)
+
     if not isinstance(error_score, numbers.Number) and error_score != "raise":
         raise ValueError(
             "error_score must be the string 'raise' or a numeric value. "
@@ -1206,7 +1203,7 @@ def cross_val_predict(
     >>> lasso = linear_model.Lasso()
     >>> y_pred = cross_val_predict(lasso, X, y, cv=3)
     """
-    params = _check_params_groups_deprecation(fit_params, params, groups)
+    params = _check_params_groups_deprecation(fit_params, params, groups, "1.6")
     X, y = indexable(X, y)
 
     if _routing_enabled():
@@ -1496,6 +1493,7 @@ def _check_is_permutation(indices, n_samples):
         "verbose": ["verbose"],
         "scoring": [StrOptions(set(get_scorer_names())), callable, None],
         "fit_params": [dict, None],
+        "params": [dict, None],
     },
     prefer_skip_nested_validation=False,  # estimator is not validated yet
 )
@@ -1512,6 +1510,7 @@ def permutation_test_score(
     verbose=0,
     scoring=None,
     fit_params=None,
+    params=None,
 ):
     """Evaluate the significance of a cross-validated score with permutations.
 
@@ -1551,6 +1550,13 @@ def permutation_test_score(
         cross-validator uses them for grouping the samples  while splitting
         the dataset into train/test set.
 
+        .. versionchanged:: 1.6
+            ``groups`` can only be passed if metadata routing is not enabled
+            via ``sklearn.set_config(enable_metadata_routing=True)``. When routing
+            is enabled, pass ``groups`` alongside other metadata via the ``params``
+            argument instead. E.g.:
+            ``permutation_test_score(..., params={'groups': groups})``.
+
     cv : int, cross-validation generator or an iterable, default=None
         Determines the cross-validation splitting strategy.
         Possible inputs for cv are:
@@ -1597,7 +1603,24 @@ def permutation_test_score(
     fit_params : dict, default=None
         Parameters to pass to the fit method of the estimator.
 
-        .. versionadded:: 0.24
+        .. deprecated:: 1.6
+            This parameter is deprecated and will be removed in version 1.6. Use
+            ``params`` instead.
+
+    params : dict, default=None
+        Parameters to pass to the `fit` method of the estimator, the scorer
+        and the cv splitter.
+
+            - If `enable_metadata_routing=False` (default):
+              Parameters directly passed to the `fit` method of the estimator.
+
+            - If `enable_metadata_routing=True`:
+              Parameters safely routed to the `fit` method of the estimator,
+              `cv` object and `scorer`.
+              See :ref:`Metadata Routing User Guide <metadata_routing>` for more
+              details.
+
+            .. versionadded:: 1.6
 
     Returns
     -------
@@ -1646,26 +1669,86 @@ def permutation_test_score(
     >>> print(f"P-value: {pvalue:.3f}")
     P-value: 0.010
     """
+    params = _check_params_groups_deprecation(fit_params, params, groups, "1.8")
+
     X, y, groups = indexable(X, y, groups)
 
     cv = check_cv(cv, y, classifier=is_classifier(estimator))
     scorer = check_scoring(estimator, scoring=scoring)
     random_state = check_random_state(random_state)
 
+    if _routing_enabled():
+        router = (
+            MetadataRouter(owner="permutation_test_score")
+            .add(
+                estimator=estimator,
+                # TODO(SLEP6): also pass metadata to the predict method for
+                # scoring?
+                method_mapping=MethodMapping().add(caller="fit", callee="fit"),
+            )
+            .add(
+                splitter=cv,
+                method_mapping=MethodMapping().add(caller="fit", callee="split"),
+            )
+            .add(
+                scorer=scorer,
+                method_mapping=MethodMapping().add(caller="fit", callee="score"),
+            )
+        )
+
+        try:
+            routed_params = process_routing(router, "fit", **params)
+        except UnsetMetadataPassedError as e:
+            # The default exception would mention `fit` since in the above
+            # `process_routing` code, we pass `fit` as the caller. However,
+            # the user is not calling `fit` directly, so we change the message
+            # to make it more suitable for this case.
+            unrequested_params = sorted(e.unrequested_params)
+            raise UnsetMetadataPassedError(
+                message=(
+                    f"{unrequested_params} are passed to `permutation_test_score`"
+                    " but are not explicitly set as requested or not requested"
+                    " for permutation_test_score's"
+                    f" estimator: {estimator.__class__.__name__}. Call"
+                    " `.set_fit_request({{metadata}}=True)` on the estimator for"
+                    f" each metadata in {unrequested_params} that you"
+                    " want to use and `metadata=False` for not using it. See the"
+                    " Metadata Routing User guide"
+                    " <https://scikit-learn.org/stable/metadata_routing.html> for more"
+                    " information."
+                ),
+                unrequested_params=e.unrequested_params,
+                routed_params=e.routed_params,
+            )
+
+    else:
+        routed_params = Bunch()
+        routed_params.estimator = Bunch(fit=params)
+        routed_params.splitter = Bunch(split={"groups": groups})
+        routed_params.scorer = Bunch(score={})
+
     # We clone the estimator to make sure that all the folds are
     # independent, and that it is pickle-able.
     score = _permutation_test_score(
-        clone(estimator), X, y, groups, cv, scorer, fit_params=fit_params
+        clone(estimator),
+        X,
+        y,
+        cv,
+        scorer,
+        split_params=routed_params.splitter.split,
+        fit_params=routed_params.estimator.fit,
+        score_params=routed_params.scorer.score,
     )
     permutation_scores = Parallel(n_jobs=n_jobs, verbose=verbose)(
         delayed(_permutation_test_score)(
             clone(estimator),
             X,
             _shuffle(y, groups, random_state),
-            groups,
             cv,
             scorer,
-            fit_params=fit_params,
+            split_params=routed_params.splitter.split,
+            fit_params=routed_params.estimator.fit,
+            score_params=routed_params.scorer.score,
         )
         for _ in range(n_permutations)
     )
@@ -1674,17 +1757,22 @@ def permutation_test_score(
     return score, permutation_scores, pvalue
 
 
-def _permutation_test_score(estimator, X, y, groups, cv, scorer, fit_params):
+def _permutation_test_score(
+    estimator, X, y, cv, scorer, split_params, fit_params, score_params
+):
     """Auxiliary function for permutation_test_score"""
     # Adjust length of sample weights
     fit_params = fit_params if fit_params is not None else {}
+    score_params = score_params if score_params is not None else {}
+
     avg_score = []
-    for train, test in cv.split(X, y, groups):
+    for train, test in cv.split(X, y, **split_params):
         X_train, y_train = _safe_split(estimator, X, y, train)
         X_test, y_test = _safe_split(estimator, X, y, test, train)
-        fit_params = _check_method_params(X, params=fit_params, indices=train)
-        estimator.fit(X_train, y_train, **fit_params)
-        avg_score.append(scorer(estimator, X_test, y_test))
+        fit_params_train = _check_method_params(X, params=fit_params, indices=train)
+        score_params_test = _check_method_params(X, params=score_params, indices=test)
+        estimator.fit(X_train, y_train, **fit_params_train)
+        avg_score.append(scorer(estimator, X_test, y_test, **score_params_test))
     return np.mean(avg_score)
 
 
@@ -1718,6 +1806,7 @@ def _shuffle(y, groups, random_state):
         "error_score": [StrOptions({"raise"}), Real],
         "return_times": ["boolean"],
         "fit_params": [dict, None],
+        "params": [dict, None],
     },
     prefer_skip_nested_validation=False,  # estimator is not validated yet
 )
@@ -1739,6 +1828,7 @@ def learning_curve(
     error_score=np.nan,
     return_times=False,
     fit_params=None,
+    params=None,
 ):
     """Learning curve.
 
@@ -1773,6 +1863,13 @@ def learning_curve(
         train/test set. Only used in conjunction with a "Group" :term:`cv`
         instance (e.g., :class:`GroupKFold`).
 
+        .. versionchanged:: 1.6
+            ``groups`` can only be passed if metadata routing is not enabled
+            via ``sklearn.set_config(enable_metadata_routing=True)``. When routing
+            is enabled, pass ``groups`` alongside other metadata via the ``params``
+            argument instead. E.g.:
+            ``learning_curve(..., params={'groups': groups})``.
+
     train_sizes : array-like of shape (n_ticks,), \
             default=np.linspace(0.1, 1.0, 5)
         Relative or absolute numbers of training examples that will be used to
@@ -1780,7 +1877,7 @@ def learning_curve(
         fraction of the maximum size of the training set (that is determined
         by the selected validation method), i.e. it has to be within (0, 1].
         Otherwise it is interpreted as absolute sizes of the training sets.
-        Note that for classification the number of samples usually have to
+        Note that for classification the number of samples usually has to
         be big enough to contain at least one sample from each class.
 
     cv : int, cross-validation generator or an iterable, default=None
@@ -1804,9 +1901,8 @@ def learning_curve(
             ``cv`` default value if None changed from 3-fold to 5-fold.
 
     scoring : str or callable, default=None
-        A str (see model evaluation documentation) or
-        a scorer callable object / function with signature
-        ``scorer(estimator, X, y)``.
+        A str (see :ref:`scoring_parameter`) or a scorer callable object / function with
+        signature ``scorer(estimator, X, y)``.
 
     exploit_incremental_learning : bool, default=False
         If the estimator supports incremental learning, this will be
@@ -1849,7 +1945,22 @@ def learning_curve(
     fit_params : dict, default=None
         Parameters to pass to the fit method of the estimator.
 
-        .. versionadded:: 0.24
+        .. deprecated:: 1.6
+            This parameter is deprecated and will be removed in version 1.8. Use
+            ``params`` instead.
+
+    params : dict, default=None
+        Parameters to pass to the `fit` method of the estimator and to the scorer.
+
+            - If `enable_metadata_routing=False` (default):
+              Parameters directly passed to the `fit` method of the estimator.
+
+            - If `enable_metadata_routing=True`:
+              Parameters safely routed to the `fit` method of the estimator.
+              See :ref:`Metadata Routing User Guide <metadata_routing>` for more
+              details.
+
+            .. versionadded:: 1.6
 
     Returns
     -------
@@ -1903,14 +2014,69 @@ def learning_curve(
             "An estimator must support the partial_fit interface "
             "to exploit incremental learning"
         )
+
+    params = _check_params_groups_deprecation(fit_params, params, groups, "1.8")
+
     X, y, groups = indexable(X, y, groups)
 
     cv = check_cv(cv, y, classifier=is_classifier(estimator))
-    # Store it as list as we will be iterating over the list multiple times
-    cv_iter = list(cv.split(X, y, groups))
 
     scorer = check_scoring(estimator, scoring=scoring)
 
+    if _routing_enabled():
+        router = (
+            MetadataRouter(owner="learning_curve")
+            .add(
+                estimator=estimator,
+                # TODO(SLEP6): also pass metadata to the predict method for
+                # scoring?
+                method_mapping=MethodMapping()
+                .add(caller="fit", callee="fit")
+                .add(caller="fit", callee="partial_fit"),
+            )
+            .add(
+                splitter=cv,
+                method_mapping=MethodMapping().add(caller="fit", callee="split"),
+            )
+            .add(
+                scorer=scorer,
+                method_mapping=MethodMapping().add(caller="fit", callee="score"),
+            )
+        )
+
+        try:
+            routed_params = process_routing(router, "fit", **params)
+        except UnsetMetadataPassedError as e:
+            # The default exception would mention `fit` since in the above
+            # `process_routing` code, we pass `fit` as the caller. However,
+            # the user is not calling `fit` directly, so we change the message
+            # to make it more suitable for this case.
+            unrequested_params = sorted(e.unrequested_params)
+            raise UnsetMetadataPassedError(
+                message=(
+                    f"{unrequested_params} are passed to `learning_curve` but are not"
+                    " explicitly set as requested or not requested for learning_curve's"
+                    f" estimator: {estimator.__class__.__name__}. Call"
+                    " `.set_fit_request({{metadata}}=True)` on the estimator for"
+                    f" each metadata in {unrequested_params} that you"
+                    " want to use and `metadata=False` for not using it. See the"
+                    " Metadata Routing User guide"
+                    " <https://scikit-learn.org/stable/metadata_routing.html> for more"
+                    " information."
+                ),
+                unrequested_params=e.unrequested_params,
+                routed_params=e.routed_params,
+            )
+
+    else:
+        routed_params = Bunch()
+        routed_params.estimator = Bunch(fit=params, partial_fit=params)
+        routed_params.splitter = Bunch(split={"groups": groups})
+        routed_params.scorer = Bunch(score={})
+
+    # Store cv as list as we will be iterating over the list multiple times
+    cv_iter = list(cv.split(X, y, **routed_params.splitter.split))
+
     n_max_training_samples = len(cv_iter[0][0])
     # Because the lengths of folds can be significantly different, it is
     # not guaranteed that we use all of the available training data when we
@@ -1940,7 +2106,8 @@ def learning_curve(
                 scorer,
                 return_times,
                 error_score=error_score,
-                fit_params=fit_params,
+                fit_params=routed_params.estimator.partial_fit,
+                score_params=routed_params.scorer.score,
             )
             for train, test in cv_iter
         )
@@ -1961,9 +2128,8 @@ def learning_curve(
                 test=test,
                 verbose=verbose,
                 parameters=None,
-                fit_params=fit_params,
-                # TODO(SLEP6): support score params here
-                score_params=None,
+                fit_params=routed_params.estimator.fit,
+                score_params=routed_params.scorer.score,
                 return_train_score=True,
                 error_score=error_score,
                 return_times=return_times,
@@ -2069,6 +2235,7 @@ def _incremental_fit_estimator(
     return_times,
     error_score,
     fit_params,
+    score_params,
 ):
     """Train estimator on training subsets incrementally and compute scores."""
     train_scores, test_scores, fit_times, score_times = [], [], [], []
@@ -2079,6 +2246,9 @@ def _incremental_fit_estimator(
         partial_fit_func = partial(estimator.partial_fit, **fit_params)
     else:
         partial_fit_func = partial(estimator.partial_fit, classes=classes, **fit_params)
+    score_params = score_params if score_params is not None else {}
+    score_params_train = _check_method_params(X, params=score_params, indices=train)
+    score_params_test = _check_method_params(X, params=score_params, indices=test)
 
     for n_train_samples, partial_train in partitions:
         train_subset = train[:n_train_samples]
@@ -2095,14 +2265,13 @@ def _incremental_fit_estimator(
 
         start_score = time.time()
 
-        # TODO(SLEP6): support score params in the following two calls
         test_scores.append(
             _score(
                 estimator,
                 X_test,
                 y_test,
                 scorer,
-                score_params=None,
+                score_params=score_params_test,
                 error_score=error_score,
             )
         )
@@ -2112,7 +2281,7 @@ def _incremental_fit_estimator(
                 X_train,
                 y_train,
                 scorer,
-                score_params=None,
+                score_params=score_params_train,
                 error_score=error_score,
             )
         )
@@ -2143,6 +2312,7 @@ def _incremental_fit_estimator(
         "verbose": ["verbose"],
         "error_score": [StrOptions({"raise"}), Real],
         "fit_params": [dict, None],
+        "params": [dict, None],
     },
     prefer_skip_nested_validation=False,  # estimator is not validated yet
 )
@@ -2161,6 +2331,7 @@ def validation_curve(
     verbose=0,
     error_score=np.nan,
     fit_params=None,
+    params=None,
 ):
     """Validation curve.
 
@@ -2199,6 +2370,13 @@ def validation_curve(
         train/test set. Only used in conjunction with a "Group" :term:`cv`
         instance (e.g., :class:`GroupKFold`).
 
+        .. versionchanged:: 1.6
+            ``groups`` can only be passed if metadata routing is not enabled
+            via ``sklearn.set_config(enable_metadata_routing=True)``. When routing
+            is enabled, pass ``groups`` alongside other metadata via the ``params``
+            argument instead. E.g.:
+            ``validation_curve(..., params={'groups': groups})``.
+
     cv : int, cross-validation generator or an iterable, default=None
         Determines the cross-validation splitting strategy.
         Possible inputs for cv are:
@@ -2220,9 +2398,8 @@ def validation_curve(
             ``cv`` default value if None changed from 3-fold to 5-fold.
 
     scoring : str or callable, default=None
-        A str (see model evaluation documentation) or
-        a scorer callable object / function with signature
-        ``scorer(estimator, X, y)``.
+        A str (see :ref:`scoring_parameter`) or a scorer callable object / function with
+        signature ``scorer(estimator, X, y)``.
 
     n_jobs : int, default=None
         Number of jobs to run in parallel. Training the estimator and computing
@@ -2250,7 +2427,22 @@ def validation_curve(
     fit_params : dict, default=None
         Parameters to pass to the fit method of the estimator.
 
-        .. versionadded:: 0.24
+        .. deprecated:: 1.6
+            This parameter is deprecated and will be removed in version 1.8. Use
+            ``params`` instead.
+
+    params : dict, default=None
+        Parameters to pass to the estimator, scorer and cross-validation object.
+
+            - If `enable_metadata_routing=False` (default):
+              Parameters directly passed to the `fit` method of the estimator.
+
+            - If `enable_metadata_routing=True`:
+              Parameters safely routed to the `fit` method of the estimator, to the
+              scorer and to the cross-validation object. See :ref:`Metadata Routing User
+              Guide <metadata_routing>` for more details.
+
+            .. versionadded:: 1.6
 
     Returns
     -------
@@ -2281,11 +2473,59 @@ def validation_curve(
     >>> print(f"The average test accuracy is {test_scores.mean():.2f}")
     The average test accuracy is 0.81
     """
+    params = _check_params_groups_deprecation(fit_params, params, groups, "1.8")
     X, y, groups = indexable(X, y, groups)
 
     cv = check_cv(cv, y, classifier=is_classifier(estimator))
     scorer = check_scoring(estimator, scoring=scoring)
 
+    if _routing_enabled():
+        router = (
+            MetadataRouter(owner="validation_curve")
+            .add(
+                estimator=estimator,
+                method_mapping=MethodMapping().add(caller="fit", callee="fit"),
+            )
+            .add(
+                splitter=cv,
+                method_mapping=MethodMapping().add(caller="fit", callee="split"),
+            )
+            .add(
+                scorer=scorer,
+                method_mapping=MethodMapping().add(caller="fit", callee="score"),
+            )
+        )
+
+        try:
+            routed_params = process_routing(router, "fit", **params)
+        except UnsetMetadataPassedError as e:
+            # The default exception would mention `fit` since in the above
+            # `process_routing` code, we pass `fit` as the caller. However,
+            # the user is not calling `fit` directly, so we change the message
+            # to make it more suitable for this case.
+            unrequested_params = sorted(e.unrequested_params)
+            raise UnsetMetadataPassedError(
+                message=(
+                    f"{unrequested_params} are passed to `validation_curve` but are not"
+                    " explicitly set as requested or not requested for"
+                    f" validation_curve's estimator: {estimator.__class__.__name__}."
+                    " Call `.set_fit_request({{metadata}}=True)` on the estimator for"
+                    f" each metadata in {unrequested_params} that you"
+                    " want to use and `metadata=False` for not using it. See the"
+                    " Metadata Routing User guide"
+                    " <https://scikit-learn.org/stable/metadata_routing.html> for more"
+                    " information."
+                ),
+                unrequested_params=e.unrequested_params,
+                routed_params=e.routed_params,
+            )
+
+    else:
+        routed_params = Bunch()
+        routed_params.estimator = Bunch(fit=params)
+        routed_params.splitter = Bunch(split={"groups": groups})
+        routed_params.scorer = Bunch(score={})
+
     parallel = Parallel(n_jobs=n_jobs, pre_dispatch=pre_dispatch, verbose=verbose)
     results = parallel(
         delayed(_fit_and_score)(
@@ -2297,14 +2537,13 @@ def validation_curve(
             test=test,
             verbose=verbose,
             parameters={param_name: v},
-            fit_params=fit_params,
-            # TODO(SLEP6): support score params here
-            score_params=None,
+            fit_params=routed_params.estimator.fit,
+            score_params=routed_params.scorer.score,
             return_train_score=True,
             error_score=error_score,
         )
         # NOTE do not change order of iteration to allow one time cv splitters
-        for train, test in cv.split(X, y, groups)
+        for train, test in cv.split(X, y, **routed_params.splitter.split)
         for v in param_range
     )
     n_params = len(param_range)
diff --git a/sklearn/model_selection/tests/test_classification_threshold.py b/sklearn/model_selection/tests/test_classification_threshold.py
new file mode 100644
index 0000000000000..77c4c20e99ef2
--- /dev/null
+++ b/sklearn/model_selection/tests/test_classification_threshold.py
@@ -0,0 +1,724 @@
+import numpy as np
+import pytest
+
+from sklearn.base import BaseEstimator, ClassifierMixin, clone
+from sklearn.datasets import (
+    load_breast_cancer,
+    load_iris,
+    make_classification,
+    make_multilabel_classification,
+)
+from sklearn.dummy import DummyClassifier
+from sklearn.ensemble import GradientBoostingClassifier
+from sklearn.exceptions import NotFittedError
+from sklearn.linear_model import LogisticRegression
+from sklearn.metrics import (
+    balanced_accuracy_score,
+    f1_score,
+    fbeta_score,
+    make_scorer,
+    recall_score,
+)
+from sklearn.model_selection import (
+    FixedThresholdClassifier,
+    StratifiedShuffleSplit,
+    TunedThresholdClassifierCV,
+)
+from sklearn.model_selection._classification_threshold import (
+    _CurveScorer,
+    _fit_and_score_over_thresholds,
+)
+from sklearn.pipeline import make_pipeline
+from sklearn.preprocessing import StandardScaler
+from sklearn.svm import SVC
+from sklearn.tree import DecisionTreeClassifier
+from sklearn.utils._mocking import CheckingClassifier
+from sklearn.utils._testing import (
+    _convert_container,
+    assert_allclose,
+    assert_array_equal,
+)
+
+
+def test_curve_scorer():
+    """Check the behaviour of the `_CurveScorer` class."""
+    X, y = make_classification(random_state=0)
+    estimator = LogisticRegression().fit(X, y)
+    curve_scorer = _CurveScorer(
+        balanced_accuracy_score,
+        sign=1,
+        response_method="predict_proba",
+        thresholds=10,
+        kwargs={},
+    )
+    scores, thresholds = curve_scorer(estimator, X, y)
+
+    assert thresholds.shape == scores.shape
+    # check that the thresholds are probabilities with extreme values close to 0 and 1.
+    # they are not exactly 0 and 1 because they are the extremum of the
+    # `estimator.predict_proba(X)` values.
+    assert 0 <= thresholds.min() <= 0.01
+    assert 0.99 <= thresholds.max() <= 1
+    # balanced accuracy should be between 0.5 and 1 when it is not adjusted
+    assert 0.5 <= scores.min() <= 1
+
+    # check that passing kwargs to the scorer works
+    curve_scorer = _CurveScorer(
+        balanced_accuracy_score,
+        sign=1,
+        response_method="predict_proba",
+        thresholds=10,
+        kwargs={"adjusted": True},
+    )
+    scores, thresholds = curve_scorer(estimator, X, y)
+
+    # balanced accuracy should be between 0.5 and 1 when it is not adjusted
+    assert 0 <= scores.min() <= 0.5
+
+    # check that we can inverse the sign of the score when dealing with `neg_*` scorer
+    curve_scorer = _CurveScorer(
+        balanced_accuracy_score,
+        sign=-1,
+        response_method="predict_proba",
+        thresholds=10,
+        kwargs={"adjusted": True},
+    )
+    scores, thresholds = curve_scorer(estimator, X, y)
+
+    assert all(scores <= 0)
+
+
+def test_curve_scorer_pos_label(global_random_seed):
+    """Check that we propagate properly the `pos_label` parameter to the scorer."""
+    n_samples = 30
+    X, y = make_classification(
+        n_samples=n_samples, weights=[0.9, 0.1], random_state=global_random_seed
+    )
+    estimator = LogisticRegression().fit(X, y)
+
+    curve_scorer = _CurveScorer(
+        recall_score,
+        sign=1,
+        response_method="predict_proba",
+        thresholds=10,
+        kwargs={"pos_label": 1},
+    )
+    scores_pos_label_1, thresholds_pos_label_1 = curve_scorer(estimator, X, y)
+
+    curve_scorer = _CurveScorer(
+        recall_score,
+        sign=1,
+        response_method="predict_proba",
+        thresholds=10,
+        kwargs={"pos_label": 0},
+    )
+    scores_pos_label_0, thresholds_pos_label_0 = curve_scorer(estimator, X, y)
+
+    # Since `pos_label` is forwarded to the curve_scorer, the thresholds are not equal.
+    assert not (thresholds_pos_label_1 == thresholds_pos_label_0).all()
+    # The min-max range for the thresholds is defined by the probabilities of the
+    # `pos_label` class (the column of `predict_proba`).
+    y_pred = estimator.predict_proba(X)
+    assert thresholds_pos_label_0.min() == pytest.approx(y_pred.min(axis=0)[0])
+    assert thresholds_pos_label_0.max() == pytest.approx(y_pred.max(axis=0)[0])
+    assert thresholds_pos_label_1.min() == pytest.approx(y_pred.min(axis=0)[1])
+    assert thresholds_pos_label_1.max() == pytest.approx(y_pred.max(axis=0)[1])
+
+    # The recall cannot be negative and `pos_label=1` should have a higher recall
+    # since there is less samples to be considered.
+    assert 0.0 < scores_pos_label_0.min() < scores_pos_label_1.min()
+    assert scores_pos_label_0.max() == pytest.approx(1.0)
+    assert scores_pos_label_1.max() == pytest.approx(1.0)
+
+
+def test_fit_and_score_over_thresholds_curve_scorers():
+    """Check that `_fit_and_score_over_thresholds` returns thresholds in ascending order
+    for the different accepted curve scorers."""
+    X, y = make_classification(n_samples=100, random_state=0)
+    train_idx, val_idx = np.arange(50), np.arange(50, 100)
+    classifier = LogisticRegression()
+
+    curve_scorer = _CurveScorer(
+        score_func=balanced_accuracy_score,
+        sign=1,
+        response_method="predict_proba",
+        thresholds=10,
+        kwargs={},
+    )
+    scores, thresholds = _fit_and_score_over_thresholds(
+        classifier,
+        X,
+        y,
+        fit_params={},
+        train_idx=train_idx,
+        val_idx=val_idx,
+        curve_scorer=curve_scorer,
+        score_params={},
+    )
+
+    assert np.all(thresholds[:-1] <= thresholds[1:])
+    assert isinstance(scores, np.ndarray)
+    assert np.logical_and(scores >= 0, scores <= 1).all()
+
+
+def test_fit_and_score_over_thresholds_prefit():
+    """Check the behaviour with a prefit classifier."""
+    X, y = make_classification(n_samples=100, random_state=0)
+
+    # `train_idx is None` to indicate that the classifier is prefit
+    train_idx, val_idx = None, np.arange(50, 100)
+    classifier = DecisionTreeClassifier(random_state=0).fit(X, y)
+    # make sure that the classifier memorized the full dataset such that
+    # we get perfect predictions and thus match the expected score
+    assert classifier.score(X[val_idx], y[val_idx]) == pytest.approx(1.0)
+
+    curve_scorer = _CurveScorer(
+        score_func=balanced_accuracy_score,
+        sign=1,
+        response_method="predict_proba",
+        thresholds=2,
+        kwargs={},
+    )
+    scores, thresholds = _fit_and_score_over_thresholds(
+        classifier,
+        X,
+        y,
+        fit_params={},
+        train_idx=train_idx,
+        val_idx=val_idx,
+        curve_scorer=curve_scorer,
+        score_params={},
+    )
+    assert np.all(thresholds[:-1] <= thresholds[1:])
+    assert_allclose(scores, [0.5, 1.0])
+
+
+@pytest.mark.usefixtures("enable_slep006")
+def test_fit_and_score_over_thresholds_sample_weight():
+    """Check that we dispatch the sample-weight to fit and score the classifier."""
+    X, y = load_iris(return_X_y=True)
+    X, y = X[:100], y[:100]  # only 2 classes
+
+    # create a dataset and repeat twice the sample of class #0
+    X_repeated, y_repeated = np.vstack([X, X[y == 0]]), np.hstack([y, y[y == 0]])
+    # create a sample weight vector that is equivalent to the repeated dataset
+    sample_weight = np.ones_like(y)
+    sample_weight[:50] *= 2
+
+    classifier = LogisticRegression()
+    train_repeated_idx = np.arange(X_repeated.shape[0])
+    val_repeated_idx = np.arange(X_repeated.shape[0])
+    curve_scorer = _CurveScorer(
+        score_func=balanced_accuracy_score,
+        sign=1,
+        response_method="predict_proba",
+        thresholds=10,
+        kwargs={},
+    )
+    scores_repeated, thresholds_repeated = _fit_and_score_over_thresholds(
+        classifier,
+        X_repeated,
+        y_repeated,
+        fit_params={},
+        train_idx=train_repeated_idx,
+        val_idx=val_repeated_idx,
+        curve_scorer=curve_scorer,
+        score_params={},
+    )
+
+    train_idx, val_idx = np.arange(X.shape[0]), np.arange(X.shape[0])
+    scores, thresholds = _fit_and_score_over_thresholds(
+        classifier.set_fit_request(sample_weight=True),
+        X,
+        y,
+        fit_params={"sample_weight": sample_weight},
+        train_idx=train_idx,
+        val_idx=val_idx,
+        curve_scorer=curve_scorer.set_score_request(sample_weight=True),
+        score_params={"sample_weight": sample_weight},
+    )
+
+    assert_allclose(thresholds_repeated, thresholds)
+    assert_allclose(scores_repeated, scores)
+
+
+@pytest.mark.usefixtures("enable_slep006")
+@pytest.mark.parametrize("fit_params_type", ["list", "array"])
+def test_fit_and_score_over_thresholds_fit_params(fit_params_type):
+    """Check that we pass `fit_params` to the classifier when calling `fit`."""
+    X, y = make_classification(n_samples=100, random_state=0)
+    fit_params = {
+        "a": _convert_container(y, fit_params_type),
+        "b": _convert_container(y, fit_params_type),
+    }
+
+    classifier = CheckingClassifier(expected_fit_params=["a", "b"], random_state=0)
+    classifier.set_fit_request(a=True, b=True)
+    train_idx, val_idx = np.arange(50), np.arange(50, 100)
+
+    curve_scorer = _CurveScorer(
+        score_func=balanced_accuracy_score,
+        sign=1,
+        response_method="predict_proba",
+        thresholds=10,
+        kwargs={},
+    )
+    _fit_and_score_over_thresholds(
+        classifier,
+        X,
+        y,
+        fit_params=fit_params,
+        train_idx=train_idx,
+        val_idx=val_idx,
+        curve_scorer=curve_scorer,
+        score_params={},
+    )
+
+
+@pytest.mark.parametrize(
+    "data",
+    [
+        make_classification(n_classes=3, n_clusters_per_class=1, random_state=0),
+        make_multilabel_classification(random_state=0),
+    ],
+)
+def test_tuned_threshold_classifier_no_binary(data):
+    """Check that we raise an informative error message for non-binary problem."""
+    err_msg = "Only binary classification is supported."
+    with pytest.raises(ValueError, match=err_msg):
+        TunedThresholdClassifierCV(LogisticRegression()).fit(*data)
+
+
+@pytest.mark.parametrize(
+    "params, err_type, err_msg",
+    [
+        (
+            {"cv": "prefit", "refit": True},
+            ValueError,
+            "When cv='prefit', refit cannot be True.",
+        ),
+        (
+            {"cv": 10, "refit": False},
+            ValueError,
+            "When cv has several folds, refit cannot be False.",
+        ),
+        (
+            {"cv": "prefit", "refit": False},
+            NotFittedError,
+            "`estimator` must be fitted.",
+        ),
+    ],
+)
+def test_tuned_threshold_classifier_conflict_cv_refit(params, err_type, err_msg):
+    """Check that we raise an informative error message when `cv` and `refit`
+    cannot be used together.
+    """
+    X, y = make_classification(n_samples=100, random_state=0)
+    with pytest.raises(err_type, match=err_msg):
+        TunedThresholdClassifierCV(LogisticRegression(), **params).fit(X, y)
+
+
+@pytest.mark.parametrize(
+    "estimator",
+    [LogisticRegression(), SVC(), GradientBoostingClassifier(n_estimators=4)],
+)
+@pytest.mark.parametrize(
+    "response_method", ["predict_proba", "predict_log_proba", "decision_function"]
+)
+@pytest.mark.parametrize(
+    "ThresholdClassifier", [FixedThresholdClassifier, TunedThresholdClassifierCV]
+)
+def test_threshold_classifier_estimator_response_methods(
+    ThresholdClassifier, estimator, response_method
+):
+    """Check that `TunedThresholdClassifierCV` exposes the same response methods as the
+    underlying estimator.
+    """
+    X, y = make_classification(n_samples=100, random_state=0)
+
+    model = ThresholdClassifier(estimator=estimator)
+    assert hasattr(model, response_method) == hasattr(estimator, response_method)
+
+    model.fit(X, y)
+    assert hasattr(model, response_method) == hasattr(estimator, response_method)
+
+    if hasattr(model, response_method):
+        y_pred_cutoff = getattr(model, response_method)(X)
+        y_pred_underlying_estimator = getattr(model.estimator_, response_method)(X)
+
+        assert_allclose(y_pred_cutoff, y_pred_underlying_estimator)
+
+
+@pytest.mark.parametrize(
+    "response_method", ["auto", "decision_function", "predict_proba"]
+)
+def test_tuned_threshold_classifier_without_constraint_value(response_method):
+    """Check that `TunedThresholdClassifierCV` is optimizing a given objective
+    metric."""
+    X, y = load_breast_cancer(return_X_y=True)
+    # remove feature to degrade performances
+    X = X[:, :5]
+
+    # make the problem completely imbalanced such that the balanced accuracy is low
+    indices_pos = np.flatnonzero(y == 1)
+    indices_pos = indices_pos[: indices_pos.size // 50]
+    indices_neg = np.flatnonzero(y == 0)
+
+    X = np.vstack([X[indices_neg], X[indices_pos]])
+    y = np.hstack([y[indices_neg], y[indices_pos]])
+
+    lr = make_pipeline(StandardScaler(), LogisticRegression()).fit(X, y)
+    thresholds = 100
+    model = TunedThresholdClassifierCV(
+        estimator=lr,
+        scoring="balanced_accuracy",
+        response_method=response_method,
+        thresholds=thresholds,
+        store_cv_results=True,
+    )
+    score_optimized = balanced_accuracy_score(y, model.fit(X, y).predict(X))
+    score_baseline = balanced_accuracy_score(y, lr.predict(X))
+    assert score_optimized > score_baseline
+    assert model.cv_results_["thresholds"].shape == (thresholds,)
+    assert model.cv_results_["scores"].shape == (thresholds,)
+
+
+def test_tuned_threshold_classifier_metric_with_parameter():
+    """Check that we can pass a metric with a parameter in addition check that
+    `f_beta` with `beta=1` is equivalent to `f1` and different from `f_beta` with
+    `beta=2`.
+    """
+    X, y = load_breast_cancer(return_X_y=True)
+    lr = make_pipeline(StandardScaler(), LogisticRegression()).fit(X, y)
+    model_fbeta_1 = TunedThresholdClassifierCV(
+        estimator=lr, scoring=make_scorer(fbeta_score, beta=1)
+    ).fit(X, y)
+    model_fbeta_2 = TunedThresholdClassifierCV(
+        estimator=lr, scoring=make_scorer(fbeta_score, beta=2)
+    ).fit(X, y)
+    model_f1 = TunedThresholdClassifierCV(
+        estimator=lr, scoring=make_scorer(f1_score)
+    ).fit(X, y)
+
+    assert model_fbeta_1.best_threshold_ == pytest.approx(model_f1.best_threshold_)
+    assert model_fbeta_1.best_threshold_ != pytest.approx(model_fbeta_2.best_threshold_)
+
+
+@pytest.mark.parametrize(
+    "response_method", ["auto", "decision_function", "predict_proba"]
+)
+@pytest.mark.parametrize(
+    "metric",
+    [
+        make_scorer(balanced_accuracy_score),
+        make_scorer(f1_score, pos_label="cancer"),
+    ],
+)
+def test_tuned_threshold_classifier_with_string_targets(response_method, metric):
+    """Check that targets represented by str are properly managed.
+    Also, check with several metrics to be sure that `pos_label` is properly
+    dispatched.
+    """
+    X, y = load_breast_cancer(return_X_y=True)
+    # Encode numeric targets by meaningful strings. We purposely designed the class
+    # names such that the `pos_label` is the first alphabetically sorted class and thus
+    # encoded as 0.
+    classes = np.array(["cancer", "healthy"], dtype=object)
+    y = classes[y]
+    model = TunedThresholdClassifierCV(
+        estimator=make_pipeline(StandardScaler(), LogisticRegression()),
+        scoring=metric,
+        response_method=response_method,
+        thresholds=100,
+    ).fit(X, y)
+    assert_array_equal(model.classes_, np.sort(classes))
+    y_pred = model.predict(X)
+    assert_array_equal(np.unique(y_pred), np.sort(classes))
+
+
+@pytest.mark.usefixtures("enable_slep006")
+@pytest.mark.parametrize("with_sample_weight", [True, False])
+def test_tuned_threshold_classifier_refit(with_sample_weight, global_random_seed):
+    """Check the behaviour of the `refit` parameter."""
+    rng = np.random.RandomState(global_random_seed)
+    X, y = make_classification(n_samples=100, random_state=0)
+    if with_sample_weight:
+        sample_weight = rng.randn(X.shape[0])
+        sample_weight = np.abs(sample_weight, out=sample_weight)
+    else:
+        sample_weight = None
+
+    # check that `estimator_` if fitted on the full dataset when `refit=True`
+    estimator = LogisticRegression().set_fit_request(sample_weight=True)
+    model = TunedThresholdClassifierCV(estimator, refit=True).fit(
+        X, y, sample_weight=sample_weight
+    )
+
+    assert model.estimator_ is not estimator
+    estimator.fit(X, y, sample_weight=sample_weight)
+    assert_allclose(model.estimator_.coef_, estimator.coef_)
+    assert_allclose(model.estimator_.intercept_, estimator.intercept_)
+
+    # check that `estimator_` was not altered when `refit=False` and `cv="prefit"`
+    estimator = LogisticRegression().set_fit_request(sample_weight=True)
+    estimator.fit(X, y, sample_weight=sample_weight)
+    coef = estimator.coef_.copy()
+    model = TunedThresholdClassifierCV(estimator, cv="prefit", refit=False).fit(
+        X, y, sample_weight=sample_weight
+    )
+
+    assert model.estimator_ is estimator
+    assert_allclose(model.estimator_.coef_, coef)
+
+    # check that we train `estimator_` on the training split of a given cross-validation
+    estimator = LogisticRegression().set_fit_request(sample_weight=True)
+    cv = [
+        (np.arange(50), np.arange(50, 100)),
+    ]  # single split
+    model = TunedThresholdClassifierCV(estimator, cv=cv, refit=False).fit(
+        X, y, sample_weight=sample_weight
+    )
+
+    assert model.estimator_ is not estimator
+    if with_sample_weight:
+        sw_train = sample_weight[cv[0][0]]
+    else:
+        sw_train = None
+    estimator.fit(X[cv[0][0]], y[cv[0][0]], sample_weight=sw_train)
+    assert_allclose(model.estimator_.coef_, estimator.coef_)
+
+
+@pytest.mark.usefixtures("enable_slep006")
+@pytest.mark.parametrize("fit_params_type", ["list", "array"])
+def test_tuned_threshold_classifier_fit_params(fit_params_type):
+    """Check that we pass `fit_params` to the classifier when calling `fit`."""
+    X, y = make_classification(n_samples=100, random_state=0)
+    fit_params = {
+        "a": _convert_container(y, fit_params_type),
+        "b": _convert_container(y, fit_params_type),
+    }
+
+    classifier = CheckingClassifier(expected_fit_params=["a", "b"], random_state=0)
+    classifier.set_fit_request(a=True, b=True)
+    model = TunedThresholdClassifierCV(classifier)
+    model.fit(X, y, **fit_params)
+
+
+@pytest.mark.usefixtures("enable_slep006")
+def test_tuned_threshold_classifier_cv_zeros_sample_weights_equivalence():
+    """Check that passing removing some sample from the dataset `X` is
+    equivalent to passing a `sample_weight` with a factor 0."""
+    X, y = load_iris(return_X_y=True)
+    # Scale the data to avoid any convergence issue
+    X = StandardScaler().fit_transform(X)
+    # Only use 2 classes and select samples such that 2-fold cross-validation
+    # split will lead to an equivalence with a `sample_weight` of 0
+    X = np.vstack((X[:40], X[50:90]))
+    y = np.hstack((y[:40], y[50:90]))
+    sample_weight = np.zeros_like(y)
+    sample_weight[::2] = 1
+
+    estimator = LogisticRegression().set_fit_request(sample_weight=True)
+    model_without_weights = TunedThresholdClassifierCV(estimator, cv=2)
+    model_with_weights = clone(model_without_weights)
+
+    model_with_weights.fit(X, y, sample_weight=sample_weight)
+    model_without_weights.fit(X[::2], y[::2])
+
+    assert_allclose(
+        model_with_weights.estimator_.coef_, model_without_weights.estimator_.coef_
+    )
+
+    y_pred_with_weights = model_with_weights.predict_proba(X)
+    y_pred_without_weights = model_without_weights.predict_proba(X)
+    assert_allclose(y_pred_with_weights, y_pred_without_weights)
+
+
+def test_tuned_threshold_classifier_thresholds_array():
+    """Check that we can pass an array to `thresholds` and it is used as candidate
+    threshold internally."""
+    X, y = make_classification(random_state=0)
+    estimator = LogisticRegression()
+    thresholds = np.linspace(0, 1, 11)
+    tuned_model = TunedThresholdClassifierCV(
+        estimator,
+        thresholds=thresholds,
+        response_method="predict_proba",
+        store_cv_results=True,
+    ).fit(X, y)
+    assert_allclose(tuned_model.cv_results_["thresholds"], thresholds)
+
+
+@pytest.mark.parametrize("store_cv_results", [True, False])
+def test_tuned_threshold_classifier_store_cv_results(store_cv_results):
+    """Check that if `cv_results_` exists depending on `store_cv_results`."""
+    X, y = make_classification(random_state=0)
+    estimator = LogisticRegression()
+    tuned_model = TunedThresholdClassifierCV(
+        estimator, store_cv_results=store_cv_results
+    ).fit(X, y)
+    if store_cv_results:
+        assert hasattr(tuned_model, "cv_results_")
+    else:
+        assert not hasattr(tuned_model, "cv_results_")
+
+
+def test_tuned_threshold_classifier_cv_float():
+    """Check the behaviour when `cv` is set to a float."""
+    X, y = make_classification(random_state=0)
+
+    # case where `refit=False` and cv is a float: the underlying estimator will be fit
+    # on the training set given by a ShuffleSplit. We check that we get the same model
+    # coefficients.
+    test_size = 0.3
+    estimator = LogisticRegression()
+    tuned_model = TunedThresholdClassifierCV(
+        estimator, cv=test_size, refit=False, random_state=0
+    ).fit(X, y)
+    tuned_model.fit(X, y)
+
+    cv = StratifiedShuffleSplit(n_splits=1, test_size=test_size, random_state=0)
+    train_idx, val_idx = next(cv.split(X, y))
+    cloned_estimator = clone(estimator).fit(X[train_idx], y[train_idx])
+
+    assert_allclose(tuned_model.estimator_.coef_, cloned_estimator.coef_)
+
+    # case where `refit=True`, then the underlying estimator is fitted on the full
+    # dataset.
+    tuned_model.set_params(refit=True).fit(X, y)
+    cloned_estimator = clone(estimator).fit(X, y)
+
+    assert_allclose(tuned_model.estimator_.coef_, cloned_estimator.coef_)
+
+
+def test_tuned_threshold_classifier_error_constant_predictor():
+    """Check that we raise a ValueError if the underlying classifier returns constant
+    probabilities such that we cannot find any threshold.
+    """
+    X, y = make_classification(random_state=0)
+    estimator = DummyClassifier(strategy="constant", constant=1)
+    tuned_model = TunedThresholdClassifierCV(estimator, response_method="predict_proba")
+    err_msg = "The provided estimator makes constant predictions"
+    with pytest.raises(ValueError, match=err_msg):
+        tuned_model.fit(X, y)
+
+
+@pytest.mark.parametrize(
+    "response_method", ["auto", "predict_proba", "decision_function"]
+)
+def test_fixed_threshold_classifier_equivalence_default(response_method):
+    """Check that `FixedThresholdClassifier` has the same behaviour as the vanilla
+    classifier.
+    """
+    X, y = make_classification(random_state=0)
+    classifier = LogisticRegression().fit(X, y)
+    classifier_default_threshold = FixedThresholdClassifier(
+        estimator=clone(classifier), response_method=response_method
+    )
+    classifier_default_threshold.fit(X, y)
+
+    # emulate the response method that should take into account the `pos_label`
+    if response_method in ("auto", "predict_proba"):
+        y_score = classifier_default_threshold.predict_proba(X)[:, 1]
+        threshold = 0.5
+    else:  # response_method == "decision_function"
+        y_score = classifier_default_threshold.decision_function(X)
+        threshold = 0.0
+
+    y_pred_lr = (y_score >= threshold).astype(int)
+    assert_allclose(classifier_default_threshold.predict(X), y_pred_lr)
+
+
+@pytest.mark.parametrize(
+    "response_method, threshold", [("predict_proba", 0.7), ("decision_function", 2.0)]
+)
+@pytest.mark.parametrize("pos_label", [0, 1])
+def test_fixed_threshold_classifier(response_method, threshold, pos_label):
+    """Check that applying `predict` lead to the same prediction as applying the
+    threshold to the output of the response method.
+    """
+    X, y = make_classification(n_samples=50, random_state=0)
+    logistic_regression = LogisticRegression().fit(X, y)
+    model = FixedThresholdClassifier(
+        estimator=clone(logistic_regression),
+        threshold=threshold,
+        response_method=response_method,
+        pos_label=pos_label,
+    ).fit(X, y)
+
+    # check that the underlying estimator is the same
+    assert_allclose(model.estimator_.coef_, logistic_regression.coef_)
+
+    # emulate the response method that should take into account the `pos_label`
+    if response_method == "predict_proba":
+        y_score = model.predict_proba(X)[:, pos_label]
+    else:  # response_method == "decision_function"
+        y_score = model.decision_function(X)
+        y_score = y_score if pos_label == 1 else -y_score
+
+    # create a mapping from boolean values to class labels
+    map_to_label = np.array([0, 1]) if pos_label == 1 else np.array([1, 0])
+    y_pred_lr = map_to_label[(y_score >= threshold).astype(int)]
+    assert_allclose(model.predict(X), y_pred_lr)
+
+    for method in ("predict_proba", "predict_log_proba", "decision_function"):
+        assert_allclose(
+            getattr(model, method)(X), getattr(logistic_regression, method)(X)
+        )
+        assert_allclose(
+            getattr(model.estimator_, method)(X),
+            getattr(logistic_regression, method)(X),
+        )
+
+
+@pytest.mark.usefixtures("enable_slep006")
+def test_fixed_threshold_classifier_metadata_routing():
+    """Check that everything works with metadata routing."""
+    X, y = make_classification(random_state=0)
+    sample_weight = np.ones_like(y)
+    sample_weight[::2] = 2
+    classifier = LogisticRegression().set_fit_request(sample_weight=True)
+    classifier.fit(X, y, sample_weight=sample_weight)
+    classifier_default_threshold = FixedThresholdClassifier(estimator=clone(classifier))
+    classifier_default_threshold.fit(X, y, sample_weight=sample_weight)
+    assert_allclose(classifier_default_threshold.estimator_.coef_, classifier.coef_)
+
+
+class ClassifierLoggingFit(ClassifierMixin, BaseEstimator):
+    """Classifier that logs the number of `fit` calls."""
+
+    def __init__(self, fit_calls=0):
+        self.fit_calls = fit_calls
+
+    def fit(self, X, y, **fit_params):
+        self.fit_calls += 1
+        self.is_fitted_ = True
+        return self
+
+    def predict_proba(self, X):
+        return np.ones((X.shape[0], 2), np.float64)  # pragma: nocover
+
+
+def test_fixed_threshold_classifier_prefit():
+    """Check the behaviour of the `FixedThresholdClassifier` with the `prefit`
+    parameter."""
+    X, y = make_classification(random_state=0)
+
+    estimator = ClassifierLoggingFit()
+    model = FixedThresholdClassifier(estimator=estimator, prefit=True)
+    with pytest.raises(NotFittedError):
+        model.fit(X, y)
+
+    # check that we don't clone the classifier when `prefit=True`.
+    estimator.fit(X, y)
+    model.fit(X, y)
+    assert estimator.fit_calls == 1
+    assert model.estimator_ is estimator
+
+    # check that we clone the classifier when `prefit=False`.
+    estimator = ClassifierLoggingFit()
+    model = FixedThresholdClassifier(estimator=estimator, prefit=False)
+    model.fit(X, y)
+    assert estimator.fit_calls == 0
+    assert model.estimator_.fit_calls == 1
+    assert model.estimator_ is not estimator
diff --git a/sklearn/model_selection/tests/test_plot.py b/sklearn/model_selection/tests/test_plot.py
index 1a7268150fd90..4e88475517454 100644
--- a/sklearn/model_selection/tests/test_plot.py
+++ b/sklearn/model_selection/tests/test_plot.py
@@ -526,29 +526,6 @@ def test_curve_display_plot_kwargs(pyplot, data, CurveDisplay, specific_params):
     assert display.errorbar_[0].lines[0].get_color() == "red"
 
 
-# TODO(1.5): to be removed
-def test_learning_curve_display_deprecate_log_scale(data, pyplot):
-    """Check that we warn for the deprecated parameter `log_scale`."""
-    X, y = data
-    estimator = DecisionTreeClassifier(random_state=0)
-
-    with pytest.warns(FutureWarning, match="`log_scale` parameter is deprecated"):
-        display = LearningCurveDisplay.from_estimator(
-            estimator, X, y, train_sizes=[0.3, 0.6, 0.9], log_scale=True
-        )
-
-    assert display.ax_.get_xscale() == "log"
-    assert display.ax_.get_yscale() == "linear"
-
-    with pytest.warns(FutureWarning, match="`log_scale` parameter is deprecated"):
-        display = LearningCurveDisplay.from_estimator(
-            estimator, X, y, train_sizes=[0.3, 0.6, 0.9], log_scale=False
-        )
-
-    assert display.ax_.get_xscale() == "linear"
-    assert display.ax_.get_yscale() == "linear"
-
-
 @pytest.mark.parametrize(
     "param_range, xscale",
     [([5, 10, 15], "linear"), ([-50, 5, 50, 500], "symlog"), ([5, 50, 500], "log")],
diff --git a/sklearn/model_selection/tests/test_search.py b/sklearn/model_selection/tests/test_search.py
index 1ff4520034ff0..77b99747dd4be 100644
--- a/sklearn/model_selection/tests/test_search.py
+++ b/sklearn/model_selection/tests/test_search.py
@@ -3,6 +3,7 @@
 import pickle
 import re
 import sys
+import warnings
 from collections.abc import Iterable, Sized
 from functools import partial
 from io import StringIO
@@ -13,13 +14,17 @@
 import pytest
 from scipy.stats import bernoulli, expon, uniform
 
+from sklearn import config_context
 from sklearn.base import BaseEstimator, ClassifierMixin, is_classifier
 from sklearn.cluster import KMeans
+from sklearn.compose import ColumnTransformer
 from sklearn.datasets import (
     make_blobs,
     make_classification,
     make_multilabel_classification,
 )
+from sklearn.discriminant_analysis import LinearDiscriminantAnalysis
+from sklearn.dummy import DummyClassifier
 from sklearn.ensemble import HistGradientBoostingClassifier
 from sklearn.exceptions import FitFailedWarning
 from sklearn.experimental import enable_halving_search_cv  # noqa
@@ -27,6 +32,7 @@
 from sklearn.impute import SimpleImputer
 from sklearn.linear_model import (
     LinearRegression,
+    LogisticRegression,
     Ridge,
     SGDClassifier,
 )
@@ -55,11 +61,20 @@
     StratifiedShuffleSplit,
     train_test_split,
 )
-from sklearn.model_selection._search import BaseSearchCV
+from sklearn.model_selection._search import (
+    BaseSearchCV,
+    _yield_masked_array_for_each_param,
+)
 from sklearn.model_selection.tests.common import OneTimeSplitter
 from sklearn.naive_bayes import ComplementNB
 from sklearn.neighbors import KernelDensity, KNeighborsClassifier, LocalOutlierFactor
-from sklearn.pipeline import Pipeline
+from sklearn.pipeline import Pipeline, make_pipeline
+from sklearn.preprocessing import (
+    OneHotEncoder,
+    OrdinalEncoder,
+    SplineTransformer,
+    StandardScaler,
+)
 from sklearn.svm import SVC, LinearSVC
 from sklearn.tests.metadata_routing_common import (
     ConsumingScorer,
@@ -67,11 +82,13 @@
     check_recorded_metadata,
 )
 from sklearn.tree import DecisionTreeClassifier, DecisionTreeRegressor
+from sklearn.utils._array_api import yield_namespace_device_dtype_combinations
 from sklearn.utils._mocking import CheckingClassifier, MockDataFrame
 from sklearn.utils._testing import (
     MinimalClassifier,
     MinimalRegressor,
     MinimalTransformer,
+    _array_api_for_tests,
     assert_allclose,
     assert_almost_equal,
     assert_array_almost_equal,
@@ -259,10 +276,10 @@ def test_SearchCV_with_fit_params(SearchCV):
 @ignore_warnings
 def test_grid_search_no_score():
     # Test grid-search on classifier that has no score function.
-    clf = LinearSVC(dual="auto", random_state=0)
+    clf = LinearSVC(random_state=0)
     X, y = make_blobs(random_state=0, centers=2)
     Cs = [0.1, 1, 10]
-    clf_no_score = LinearSVCNoScore(dual="auto", random_state=0)
+    clf_no_score = LinearSVCNoScore(random_state=0)
     grid_search = GridSearchCV(clf, {"C": Cs}, scoring="accuracy")
     grid_search.fit(X, y)
 
@@ -283,13 +300,13 @@ def test_grid_search_no_score():
 
 def test_grid_search_score_method():
     X, y = make_classification(n_samples=100, n_classes=2, flip_y=0.2, random_state=0)
-    clf = LinearSVC(dual="auto", random_state=0)
+    clf = LinearSVC(random_state=0)
     grid = {"C": [0.1]}
 
     search_no_scoring = GridSearchCV(clf, grid, scoring=None).fit(X, y)
     search_accuracy = GridSearchCV(clf, grid, scoring="accuracy").fit(X, y)
     search_no_score_method_auc = GridSearchCV(
-        LinearSVCNoScore(dual="auto"), grid, scoring="roc_auc"
+        LinearSVCNoScore(), grid, scoring="roc_auc"
     ).fit(X, y)
     search_auc = GridSearchCV(clf, grid, scoring="roc_auc").fit(X, y)
 
@@ -317,7 +334,7 @@ def test_grid_search_groups():
     X, y = make_classification(n_samples=15, n_classes=2, random_state=0)
     groups = rng.randint(0, 3, 15)
 
-    clf = LinearSVC(dual="auto", random_state=0)
+    clf = LinearSVC(random_state=0)
     grid = {"C": [1]}
 
     group_cvs = [
@@ -346,7 +363,7 @@ def test_classes__property():
     y = np.array([0] * 5 + [1] * 5)
     Cs = [0.1, 1, 10]
 
-    grid_search = GridSearchCV(LinearSVC(dual="auto", random_state=0), {"C": Cs})
+    grid_search = GridSearchCV(LinearSVC(random_state=0), {"C": Cs})
     grid_search.fit(X, y)
     assert_array_equal(grid_search.best_estimator_.classes_, grid_search.classes_)
 
@@ -356,13 +373,11 @@ def test_classes__property():
     assert not hasattr(grid_search, "classes_")
 
     # Test that the grid searcher has no classes_ attribute before it's fit
-    grid_search = GridSearchCV(LinearSVC(dual="auto", random_state=0), {"C": Cs})
+    grid_search = GridSearchCV(LinearSVC(random_state=0), {"C": Cs})
     assert not hasattr(grid_search, "classes_")
 
     # Test that the grid searcher has no classes_ attribute without a refit
-    grid_search = GridSearchCV(
-        LinearSVC(dual="auto", random_state=0), {"C": Cs}, refit=False
-    )
+    grid_search = GridSearchCV(LinearSVC(random_state=0), {"C": Cs}, refit=False)
     grid_search.fit(X, y)
     assert not hasattr(grid_search, "classes_")
 
@@ -426,7 +441,7 @@ def test_grid_search_error():
     # Test that grid search will capture errors on data with different length
     X_, y_ = make_classification(n_samples=200, n_features=100, random_state=0)
 
-    clf = LinearSVC(dual="auto")
+    clf = LinearSVC()
     cv = GridSearchCV(clf, {"C": [0.1, 1.0]})
     with pytest.raises(ValueError):
         cv.fit(X_[:180], y_)
@@ -500,14 +515,14 @@ def test_grid_search_sparse(csr_container):
     # Test that grid search works with both dense and sparse matrices
     X_, y_ = make_classification(n_samples=200, n_features=100, random_state=0)
 
-    clf = LinearSVC(dual="auto")
+    clf = LinearSVC()
     cv = GridSearchCV(clf, {"C": [0.1, 1.0]})
     cv.fit(X_[:180], y_[:180])
     y_pred = cv.predict(X_[180:])
     C = cv.best_estimator_.C
 
     X_ = csr_container(X_)
-    clf = LinearSVC(dual="auto")
+    clf = LinearSVC()
     cv = GridSearchCV(clf, {"C": [0.1, 1.0]})
     cv.fit(X_[:180].tocoo(), y_[:180])
     y_pred2 = cv.predict(X_[180:])
@@ -521,14 +536,14 @@ def test_grid_search_sparse(csr_container):
 def test_grid_search_sparse_scoring(csr_container):
     X_, y_ = make_classification(n_samples=200, n_features=100, random_state=0)
 
-    clf = LinearSVC(dual="auto")
+    clf = LinearSVC()
     cv = GridSearchCV(clf, {"C": [0.1, 1.0]}, scoring="f1")
     cv.fit(X_[:180], y_[:180])
     y_pred = cv.predict(X_[180:])
     C = cv.best_estimator_.C
 
     X_ = csr_container(X_)
-    clf = LinearSVC(dual="auto")
+    clf = LinearSVC()
     cv = GridSearchCV(clf, {"C": [0.1, 1.0]}, scoring="f1")
     cv.fit(X_[:180], y_[:180])
     y_pred2 = cv.predict(X_[180:])
@@ -638,7 +653,7 @@ def refit_callable(cv_results):
         # clf.cv_results_.
         X, y = make_classification(n_samples=100, n_features=4, random_state=42)
         clf = GridSearchCV(
-            LinearSVC(dual="auto", random_state=42),
+            LinearSVC(random_state=42),
             {"C": [0.01, 0.1, 1]},
             scoring="precision",
             refit=True,
@@ -655,7 +670,7 @@ def refit_callable(cv_results):
 
     X, y = make_classification(n_samples=100, n_features=4, random_state=42)
     clf = GridSearchCV(
-        LinearSVC(dual="auto", random_state=42),
+        LinearSVC(random_state=42),
         {"C": [0.01, 0.1, 1]},
         scoring="precision",
         refit=refit_callable,
@@ -682,7 +697,7 @@ def refit_callable_invalid_type(cv_results):
     X, y = make_classification(n_samples=100, n_features=4, random_state=42)
 
     clf = GridSearchCV(
-        LinearSVC(dual="auto", random_state=42),
+        LinearSVC(random_state=42),
         {"C": [0.1, 1]},
         scoring="precision",
         refit=refit_callable_invalid_type,
@@ -708,7 +723,7 @@ def refit_callable_out_bound(cv_results):
     X, y = make_classification(n_samples=100, n_features=4, random_state=42)
 
     clf = search_cv(
-        LinearSVC(dual="auto", random_state=42),
+        LinearSVC(random_state=42),
         {"C": [0.1, 1]},
         scoring="precision",
         refit=refit_callable_out_bound,
@@ -734,7 +749,7 @@ def refit_callable(cv_results):
     X, y = make_classification(n_samples=100, n_features=4, random_state=42)
     scoring = {"Accuracy": make_scorer(accuracy_score), "prec": "precision"}
     clf = GridSearchCV(
-        LinearSVC(dual="auto", random_state=42),
+        LinearSVC(random_state=42),
         {"C": [0.01, 0.1, 1]},
         scoring=scoring,
         refit=refit_callable,
@@ -1400,14 +1415,12 @@ def test_search_cv_results_none_param():
             est_parameters,
             cv=cv,
         ).fit(X, y)
-        assert_array_equal(
-            grid_search.cv_results_["param_random_state"], [0, float("nan")]
-        )
+        assert_array_equal(grid_search.cv_results_["param_random_state"], [0, None])
 
 
 @ignore_warnings()
 def test_search_cv_timing():
-    svc = LinearSVC(dual="auto", random_state=0)
+    svc = LinearSVC(random_state=0)
 
     X = [
         [
@@ -1449,7 +1462,7 @@ def test_search_cv_timing():
 def test_grid_search_correct_score_results():
     # test that correct scores are used
     n_splits = 3
-    clf = LinearSVC(dual="auto", random_state=0)
+    clf = LinearSVC(random_state=0)
     X, y = make_blobs(random_state=0, centers=2)
     Cs = [0.1, 1, 10]
     for score in ["f1", "roc_auc"]:
@@ -1788,7 +1801,7 @@ def test_stochastic_gradient_loss_param():
 def test_search_train_scores_set_to_false():
     X = np.arange(6).reshape(6, -1)
     y = [0, 0, 0, 1, 1, 1]
-    clf = LinearSVC(dual="auto", random_state=0)
+    clf = LinearSVC(random_state=0)
 
     gs = GridSearchCV(clf, param_grid={"C": [0.1, 0.2]}, cv=3)
     gs.fit(X, y)
@@ -1801,7 +1814,7 @@ def test_grid_search_cv_splits_consistency():
     X, y = make_classification(n_samples=n_samples, random_state=0)
 
     gs = GridSearchCV(
-        LinearSVC(dual="auto", random_state=0),
+        LinearSVC(random_state=0),
         param_grid={"C": [0.1, 0.2, 0.3]},
         cv=OneTimeSplitter(n_splits=n_splits, n_samples=n_samples),
         return_train_score=True,
@@ -1809,7 +1822,7 @@ def test_grid_search_cv_splits_consistency():
     gs.fit(X, y)
 
     gs2 = GridSearchCV(
-        LinearSVC(dual="auto", random_state=0),
+        LinearSVC(random_state=0),
         param_grid={"C": [0.1, 0.2, 0.3]},
         cv=KFold(n_splits=n_splits),
         return_train_score=True,
@@ -1822,7 +1835,7 @@ def test_grid_search_cv_splits_consistency():
         GeneratorType,
     )
     gs3 = GridSearchCV(
-        LinearSVC(dual="auto", random_state=0),
+        LinearSVC(random_state=0),
         param_grid={"C": [0.1, 0.2, 0.3]},
         cv=KFold(n_splits=n_splits, shuffle=True, random_state=0).split(X, y),
         return_train_score=True,
@@ -1830,7 +1843,7 @@ def test_grid_search_cv_splits_consistency():
     gs3.fit(X, y)
 
     gs4 = GridSearchCV(
-        LinearSVC(dual="auto", random_state=0),
+        LinearSVC(random_state=0),
         param_grid={"C": [0.1, 0.2, 0.3]},
         cv=KFold(n_splits=n_splits, shuffle=True, random_state=0),
         return_train_score=True,
@@ -1866,7 +1879,7 @@ def _pop_time_keys(cv_results):
 
     # Check consistency of folds across the parameters
     gs = GridSearchCV(
-        LinearSVC(dual="auto", random_state=0),
+        LinearSVC(random_state=0),
         param_grid={"C": [0.1, 0.1, 0.2, 0.2]},
         cv=KFold(n_splits=n_splits, shuffle=True),
         return_train_score=True,
@@ -2090,7 +2103,7 @@ def custom_scorer(clf, X, y):
         return {"tn": cm[0, 0], "fp": cm[0, 1], "fn": cm[1, 0], "tp": cm[1, 1]}
 
     X, y = make_classification(n_samples=40, n_features=4, random_state=42)
-    est = LinearSVC(dual="auto", random_state=42)
+    est = LinearSVC(random_state=42)
     search = GridSearchCV(est, {"C": [0.1, 1]}, scoring=custom_scorer, refit="fp")
 
     search.fit(X, y)
@@ -2114,7 +2127,7 @@ def custom_scorer(est, X, y):
         }
 
     X, y = make_classification(n_samples=40, n_features=4, random_state=42)
-    est = LinearSVC(dual="auto", random_state=42)
+    est = LinearSVC(random_state=42)
     search_callable = GridSearchCV(
         est, {"C": [0.1, 1]}, scoring=custom_scorer, refit="recall"
     )
@@ -2137,7 +2150,7 @@ def custom_scorer(est, X, y):
         return recall_score(y, y_pred)
 
     X, y = make_classification(n_samples=40, n_features=4, random_state=42)
-    est = LinearSVC(dual="auto", random_state=42)
+    est = LinearSVC(random_state=42)
     search_callable = GridSearchCV(
         est, {"C": [0.1, 1]}, scoring=custom_scorer, refit=True
     )
@@ -2165,7 +2178,7 @@ def bad_scorer(est, X, y):
 
     X, y = make_classification(n_samples=40, n_features=4, random_state=42)
     clf = GridSearchCV(
-        LinearSVC(dual="auto", random_state=42),
+        LinearSVC(random_state=42),
         {"C": [0.1, 1]},
         scoring=bad_scorer,
         refit="good_name",
@@ -2447,7 +2460,7 @@ def test_search_cv_verbose_3(capsys, return_train_score):
     """Check that search cv with verbose>2 shows the score for single
     metrics. non-regression test for #19658."""
     X, y = make_classification(n_samples=100, n_classes=2, flip_y=0.2, random_state=0)
-    clf = LinearSVC(dual="auto", random_state=0)
+    clf = LinearSVC(random_state=0)
     grid = {"C": [0.1]}
 
     GridSearchCV(
@@ -2478,7 +2491,7 @@ def test_search_estimator_param(SearchCV, param_search):
     # test that SearchCV object doesn't change the object given in the parameter grid
     X, y = make_classification(random_state=42)
 
-    params = {"clf": [LinearSVC(dual="auto")], "clf__C": [0.01]}
+    params = {"clf": [LinearSVC()], "clf__C": [0.01]}
     orig_C = params["clf"][0].C
 
     pipe = Pipeline([("trs", MinimalTransformer()), ("clf", None)])
@@ -2523,6 +2536,56 @@ def test_search_with_2d_array():
     np.testing.assert_array_equal(result.data, expected_data)
 
 
+def test_search_html_repr():
+    """Test different HTML representations for GridSearchCV."""
+    X, y = make_classification(random_state=42)
+
+    pipeline = Pipeline([("scale", StandardScaler()), ("clf", DummyClassifier())])
+    param_grid = {"clf": [DummyClassifier(), LogisticRegression()]}
+
+    # Unfitted shows the original pipeline
+    search_cv = GridSearchCV(pipeline, param_grid=param_grid, refit=False)
+    with config_context(display="diagram"):
+        repr_html = search_cv._repr_html_()
+        assert "<pre>DummyClassifier()</pre>" in repr_html
+
+    # Fitted with `refit=False` shows the original pipeline
+    search_cv.fit(X, y)
+    with config_context(display="diagram"):
+        repr_html = search_cv._repr_html_()
+        assert "<pre>DummyClassifier()</pre>" in repr_html
+
+    # Fitted with `refit=True` shows the best estimator
+    search_cv = GridSearchCV(pipeline, param_grid=param_grid, refit=True)
+    search_cv.fit(X, y)
+    with config_context(display="diagram"):
+        repr_html = search_cv._repr_html_()
+        assert "<pre>DummyClassifier()</pre>" not in repr_html
+        assert "<pre>LogisticRegression()</pre>" in repr_html
+
+
+# TODO(1.7): remove this test
+@pytest.mark.parametrize("SearchCV", [GridSearchCV, RandomizedSearchCV])
+def test_inverse_transform_Xt_deprecation(SearchCV):
+    clf = MockClassifier()
+    search = SearchCV(clf, {"foo_param": [1, 2, 3]}, cv=3, verbose=3)
+
+    X2 = search.fit(X, y).transform(X)
+
+    with pytest.raises(TypeError, match="Missing required positional argument"):
+        search.inverse_transform()
+
+    with pytest.raises(TypeError, match="Cannot use both X and Xt. Use X only"):
+        search.inverse_transform(X=X2, Xt=X2)
+
+    with warnings.catch_warnings(record=True):
+        warnings.simplefilter("error")
+        search.inverse_transform(X2)
+
+    with pytest.warns(FutureWarning, match="Xt was renamed X in version 1.5"):
+        search.inverse_transform(Xt=X2)
+
+
 # Metadata Routing Tests
 # ======================
 
@@ -2543,7 +2606,7 @@ def test_multi_metric_search_forwards_metadata(SearchCV, param_search):
     score_weights = rng.rand(n_samples)
     score_metadata = rng.rand(n_samples)
 
-    est = LinearSVC(dual="auto")
+    est = LinearSVC()
     param_grid_search = {param_search: {"C": [1]}}
 
     scorer_registry = _Registry()
@@ -2559,6 +2622,7 @@ def test_multi_metric_search_forwards_metadata(SearchCV, param_search):
         check_recorded_metadata(
             obj=_scorer,
             method="score",
+            parent="_score",
             split_params=("sample_weight", "metadata"),
             sample_weight=score_weights,
             metadata=score_metadata,
@@ -2577,7 +2641,7 @@ def test_score_rejects_params_with_no_routing_enabled(SearchCV, param_search):
     """*SearchCV should reject **params when metadata routing is not enabled
     since this is added only when routing is enabled."""
     X, y = make_classification(random_state=42)
-    est = LinearSVC(dual="auto")
+    est = LinearSVC()
     param_grid_search = {param_search: {"C": [1]}}
 
     gs = SearchCV(est, cv=2, **param_grid_search).fit(X, y)
@@ -2588,3 +2652,211 @@ def test_score_rejects_params_with_no_routing_enabled(SearchCV, param_search):
 
 # End of Metadata Routing Tests
 # =============================
+
+
+def test_cv_results_dtype_issue_29074():
+    """Non-regression test for https://github.com/scikit-learn/scikit-learn/issues/29074"""
+
+    class MetaEstimator(BaseEstimator, ClassifierMixin):
+        def __init__(
+            self,
+            base_clf,
+            parameter1=None,
+            parameter2=None,
+            parameter3=None,
+            parameter4=None,
+        ):
+            self.base_clf = base_clf
+            self.parameter1 = parameter1
+            self.parameter2 = parameter2
+            self.parameter3 = parameter3
+            self.parameter4 = parameter4
+
+        def fit(self, X, y=None):
+            self.base_clf.fit(X, y)
+            return self
+
+        def score(self, X, y):
+            return self.base_clf.score(X, y)
+
+    # Values of param_grid are such that np.result_type gives slightly
+    # different errors, in particular ValueError and TypeError
+    param_grid = {
+        "parameter1": [None, {"option": "A"}, {"option": "B"}],
+        "parameter2": [None, [1, 2]],
+        "parameter3": [{"a": 1}],
+        "parameter4": ["str1", "str2"],
+    }
+    grid_search = GridSearchCV(
+        estimator=MetaEstimator(LogisticRegression()),
+        param_grid=param_grid,
+        cv=3,
+    )
+
+    X, y = make_blobs(random_state=0)
+    grid_search.fit(X, y)
+    for param in param_grid:
+        assert grid_search.cv_results_[f"param_{param}"].dtype == object
+
+
+def test_search_with_estimators_issue_29157():
+    """Check cv_results_ for estimators with a `dtype` parameter, e.g. OneHotEncoder."""
+    pd = pytest.importorskip("pandas")
+    df = pd.DataFrame(
+        {
+            "numeric_1": [1, 2, 3, 4, 5],
+            "object_1": ["a", "a", "a", "a", "a"],
+            "target": [1.0, 4.1, 2.0, 3.0, 1.0],
+        }
+    )
+    X = df.drop("target", axis=1)
+    y = df["target"]
+    enc = ColumnTransformer(
+        [("enc", OneHotEncoder(sparse_output=False), ["object_1"])],
+        remainder="passthrough",
+    )
+    pipe = Pipeline(
+        [
+            ("enc", enc),
+            ("regressor", LinearRegression()),
+        ]
+    )
+    grid_params = {
+        "enc__enc": [
+            OneHotEncoder(sparse_output=False),
+            OrdinalEncoder(),
+        ]
+    }
+    grid_search = GridSearchCV(pipe, grid_params, cv=2)
+    grid_search.fit(X, y)
+    assert grid_search.cv_results_["param_enc__enc"].dtype == object
+
+
+def test_cv_results_multi_size_array():
+    """Check that GridSearchCV works with params that are arrays of different sizes.
+
+    Non-regression test for #29277.
+    """
+    n_features = 10
+    X, y = make_classification(n_features=10)
+
+    spline_reg_pipe = make_pipeline(
+        SplineTransformer(extrapolation="periodic"),
+        LogisticRegression(),
+    )
+
+    n_knots_list = [n_features * i for i in [10, 11, 12]]
+    knots_list = [
+        np.linspace(0, np.pi * 2, n_knots).reshape((-1, n_features))
+        for n_knots in n_knots_list
+    ]
+    spline_reg_pipe_cv = GridSearchCV(
+        estimator=spline_reg_pipe,
+        param_grid={
+            "splinetransformer__knots": knots_list,
+        },
+    )
+
+    spline_reg_pipe_cv.fit(X, y)
+    assert (
+        spline_reg_pipe_cv.cv_results_["param_splinetransformer__knots"].dtype == object
+    )
+
+
+@pytest.mark.parametrize(
+    "array_namespace, device, dtype", yield_namespace_device_dtype_combinations()
+)
+@pytest.mark.parametrize("SearchCV", [GridSearchCV, RandomizedSearchCV])
+def test_array_api_search_cv_classifier(SearchCV, array_namespace, device, dtype):
+    xp = _array_api_for_tests(array_namespace, device)
+
+    X = np.arange(100).reshape((10, 10))
+    X_np = X.astype(dtype)
+    X_xp = xp.asarray(X_np, device=device)
+
+    # y should always be an integer, no matter what `dtype` is
+    y_np = np.array([0] * 5 + [1] * 5)
+    y_xp = xp.asarray(y_np, device=device)
+
+    with config_context(array_api_dispatch=True):
+        searcher = SearchCV(
+            LinearDiscriminantAnalysis(),
+            {"tol": [1e-2, 1e-3, 1e-4, 1e-5, 1e-6, 1e-7]},
+            cv=2,
+        )
+        searcher.fit(X_xp, y_xp)
+        searcher.score(X_xp, y_xp)
+
+
+# Construct these outside the tests so that the same object is used
+# for both input and `expected`
+one_hot_encoder = OneHotEncoder()
+ordinal_encoder = OrdinalEncoder()
+
+# If we construct this directly via `MaskedArray`, the list of tuples
+# gets auto-converted to a 2D array.
+ma_with_tuples = np.ma.MaskedArray(np.empty(2), mask=True, dtype=object)
+ma_with_tuples[0] = (1, 2)
+ma_with_tuples[1] = (3, 4)
+
+
+@pytest.mark.parametrize(
+    ("candidate_params", "expected"),
+    [
+        pytest.param(
+            [{"foo": 1}, {"foo": 2}],
+            [
+                ("param_foo", np.ma.MaskedArray(np.array([1, 2]))),
+            ],
+            id="simple numeric, single param",
+        ),
+        pytest.param(
+            [{"foo": 1, "bar": 3}, {"foo": 2, "bar": 4}, {"foo": 3}],
+            [
+                ("param_foo", np.ma.MaskedArray(np.array([1, 2, 3]))),
+                (
+                    "param_bar",
+                    np.ma.MaskedArray(np.array([3, 4, 0]), mask=[False, False, True]),
+                ),
+            ],
+            id="simple numeric, one param is missing in one round",
+        ),
+        pytest.param(
+            [{"foo": [[1], [2], [3]]}, {"foo": [[1], [2]]}],
+            [
+                (
+                    "param_foo",
+                    np.ma.MaskedArray([[[1], [2], [3]], [[1], [2]]], dtype=object),
+                ),
+            ],
+            id="lists of different lengths",
+        ),
+        pytest.param(
+            [{"foo": (1, 2)}, {"foo": (3, 4)}],
+            [
+                (
+                    "param_foo",
+                    ma_with_tuples,
+                ),
+            ],
+            id="lists tuples",
+        ),
+        pytest.param(
+            [{"foo": ordinal_encoder}, {"foo": one_hot_encoder}],
+            [
+                (
+                    "param_foo",
+                    np.ma.MaskedArray([ordinal_encoder, one_hot_encoder], dtype=object),
+                ),
+            ],
+            id="estimators",
+        ),
+    ],
+)
+def test_yield_masked_array_for_each_param(candidate_params, expected):
+    result = list(_yield_masked_array_for_each_param(candidate_params))
+    for (key, value), (expected_key, expected_value) in zip(result, expected):
+        assert key == expected_key
+        assert value.dtype == expected_value.dtype
+        np.testing.assert_array_equal(value, expected_value)
+        np.testing.assert_array_equal(value.mask, expected_value.mask)
diff --git a/sklearn/model_selection/tests/test_split.py b/sklearn/model_selection/tests/test_split.py
index fa425a5e6a18b..4e594499ae59a 100644
--- a/sklearn/model_selection/tests/test_split.py
+++ b/sklearn/model_selection/tests/test_split.py
@@ -86,6 +86,12 @@
 
 ALL_SPLITTERS = NO_GROUP_SPLITTERS + GROUP_SPLITTERS  # type: ignore
 
+SPLITTERS_REQUIRING_TARGET = [
+    StratifiedKFold(),
+    StratifiedShuffleSplit(),
+    RepeatedStratifiedKFold(),
+]
+
 X = np.ones(10)
 y = np.arange(10) // 2
 test_groups = (
@@ -2054,3 +2060,12 @@ def test_no_group_splitters_warns_with_groups(cv):
 
     with pytest.warns(UserWarning, match=msg):
         cv.split(X, y, groups=groups)
+
+
+@pytest.mark.parametrize(
+    "cv", SPLITTERS_REQUIRING_TARGET, ids=[str(cv) for cv in SPLITTERS_REQUIRING_TARGET]
+)
+def test_stratified_splitter_without_y(cv):
+    msg = "missing 1 required positional argument: 'y'"
+    with pytest.raises(TypeError, match=msg):
+        cv.split(X)
diff --git a/sklearn/model_selection/tests/test_successive_halving.py b/sklearn/model_selection/tests/test_successive_halving.py
index b7047c7537871..a792f18e0b42f 100644
--- a/sklearn/model_selection/tests/test_successive_halving.py
+++ b/sklearn/model_selection/tests/test_successive_halving.py
@@ -732,7 +732,7 @@ def test_groups_support(Est):
     X, y = make_classification(n_samples=50, n_classes=2, random_state=0)
     groups = rng.randint(0, 3, 50)
 
-    clf = LinearSVC(dual="auto", random_state=0)
+    clf = LinearSVC(random_state=0)
     grid = {"C": [1]}
 
     group_cvs = [
diff --git a/sklearn/model_selection/tests/test_validation.py b/sklearn/model_selection/tests/test_validation.py
index 43916d8cecb2e..33d4d366bf17a 100644
--- a/sklearn/model_selection/tests/test_validation.py
+++ b/sklearn/model_selection/tests/test_validation.py
@@ -862,7 +862,7 @@ def test_permutation_test_score_allow_nans():
     permutation_test_score(p, X, y)
 
 
-def test_permutation_test_score_fit_params():
+def test_permutation_test_score_params():
     X = np.arange(100).reshape(10, 10)
     y = np.array([0] * 5 + [1] * 5)
     clf = CheckingClassifier(expected_sample_weight=True)
@@ -873,8 +873,8 @@ def test_permutation_test_score_fit_params():
 
     err_msg = r"sample_weight.shape == \(1,\), expected \(8,\)!"
     with pytest.raises(ValueError, match=err_msg):
-        permutation_test_score(clf, X, y, fit_params={"sample_weight": np.ones(1)})
-    permutation_test_score(clf, X, y, fit_params={"sample_weight": np.ones(10)})
+        permutation_test_score(clf, X, y, params={"sample_weight": np.ones(1)})
+    permutation_test_score(clf, X, y, params={"sample_weight": np.ones(10)})
 
 
 def test_cross_val_score_allow_nans():
@@ -1535,7 +1535,7 @@ def test_learning_curve_with_shuffle():
     )
 
 
-def test_learning_curve_fit_params():
+def test_learning_curve_params():
     X = np.arange(100).reshape(10, 10)
     y = np.array([0] * 5 + [1] * 5)
     clf = CheckingClassifier(expected_sample_weight=True)
@@ -1547,14 +1547,14 @@ def test_learning_curve_fit_params():
     err_msg = r"sample_weight.shape == \(1,\), expected \(2,\)!"
     with pytest.raises(ValueError, match=err_msg):
         learning_curve(
-            clf, X, y, error_score="raise", fit_params={"sample_weight": np.ones(1)}
+            clf, X, y, error_score="raise", params={"sample_weight": np.ones(1)}
         )
     learning_curve(
-        clf, X, y, error_score="raise", fit_params={"sample_weight": np.ones(10)}
+        clf, X, y, error_score="raise", params={"sample_weight": np.ones(10)}
     )
 
 
-def test_learning_curve_incremental_learning_fit_params():
+def test_learning_curve_incremental_learning_params():
     X, y = make_classification(
         n_samples=30,
         n_features=1,
@@ -1587,7 +1587,7 @@ def test_learning_curve_incremental_learning_fit_params():
             exploit_incremental_learning=True,
             train_sizes=np.linspace(0.1, 1.0, 10),
             error_score="raise",
-            fit_params={"sample_weight": np.ones(3)},
+            params={"sample_weight": np.ones(3)},
         )
 
     learning_curve(
@@ -1598,7 +1598,7 @@ def test_learning_curve_incremental_learning_fit_params():
         exploit_incremental_learning=True,
         train_sizes=np.linspace(0.1, 1.0, 10),
         error_score="raise",
-        fit_params={"sample_weight": np.ones(2)},
+        params={"sample_weight": np.ones(2)},
     )
 
 
@@ -1697,7 +1697,7 @@ def test_validation_curve_cv_splits_consistency():
     assert_array_almost_equal(np.array(scores3), np.array(scores1))
 
 
-def test_validation_curve_fit_params():
+def test_validation_curve_params():
     X = np.arange(100).reshape(10, 10)
     y = np.array([0] * 5 + [1] * 5)
     clf = CheckingClassifier(expected_sample_weight=True)
@@ -1722,7 +1722,7 @@ def test_validation_curve_fit_params():
             param_name="foo_param",
             param_range=[1, 2, 3],
             error_score="raise",
-            fit_params={"sample_weight": np.ones(1)},
+            params={"sample_weight": np.ones(1)},
         )
     validation_curve(
         clf,
@@ -1731,7 +1731,7 @@ def test_validation_curve_fit_params():
         param_name="foo_param",
         param_range=[1, 2, 3],
         error_score="raise",
-        fit_params={"sample_weight": np.ones(10)},
+        params={"sample_weight": np.ones(10)},
     )
 
 
@@ -2100,13 +2100,14 @@ def test_fit_and_score_failing():
     failing_clf = FailingClassifier(FailingClassifier.FAILING_PARAMETER)
     # dummy X data
     X = np.arange(1, 10)
+    train, test = np.arange(0, 5), np.arange(5, 9)
     fit_and_score_args = dict(
         estimator=failing_clf,
         X=X,
         y=None,
         scorer=dict(),
-        train=None,
-        test=None,
+        train=train,
+        test=test,
         verbose=0,
         parameters=None,
         fit_params=None,
@@ -2403,7 +2404,7 @@ def custom_scorer(clf, X, y):
         return {"tn": cm[0, 0], "fp": cm[0, 1], "fn": cm[1, 0], "tp": cm[1, 1]}
 
     X, y = make_classification(n_samples=40, n_features=4, random_state=42)
-    est = LinearSVC(dual="auto", random_state=42)
+    est = LinearSVC(random_state=42)
     est.fit(X, y)
     cv_results = cross_validate(est, X, y, cv=5, scoring=custom_scorer)
 
@@ -2481,63 +2482,108 @@ def test_cross_validate_return_indices(global_random_seed):
         assert_array_equal(test_indices[split_idx], expected_test_idx)
 
 
-# Tests for metadata routing in cross_val*
-# ========================================
+# Tests for metadata routing in cross_val* and in *curve
+# ======================================================
 
 
-# TODO(1.6): remove this test in 1.6
-def test_cross_validate_fit_param_deprecation():
+# TODO(1.6): remove `cross_validate` and `cross_val_predict` from this test in 1.6 and
+# `learning_curve` and `validation_curve` in 1.8
+@pytest.mark.parametrize(
+    "func, extra_args",
+    [
+        (cross_validate, {}),
+        (cross_val_score, {}),
+        (cross_val_predict, {}),
+        (learning_curve, {}),
+        (permutation_test_score, {}),
+        (validation_curve, {"param_name": "alpha", "param_range": np.array([1])}),
+    ],
+)
+def test_fit_param_deprecation(func, extra_args):
     """Check that we warn about deprecating `fit_params`."""
     with pytest.warns(FutureWarning, match="`fit_params` is deprecated"):
-        cross_validate(estimator=ConsumingClassifier(), X=X, y=y, cv=2, fit_params={})
+        func(
+            estimator=ConsumingClassifier(), X=X, y=y, cv=2, fit_params={}, **extra_args
+        )
 
     with pytest.raises(
         ValueError, match="`params` and `fit_params` cannot both be provided"
     ):
-        cross_validate(
-            estimator=ConsumingClassifier(), X=X, y=y, fit_params={}, params={}
+        func(
+            estimator=ConsumingClassifier(),
+            X=X,
+            y=y,
+            fit_params={},
+            params={},
+            **extra_args,
         )
 
 
 @pytest.mark.usefixtures("enable_slep006")
 @pytest.mark.parametrize(
-    "cv_method", [cross_validate, cross_val_score, cross_val_predict]
+    "func, extra_args",
+    [
+        (cross_validate, {}),
+        (cross_val_score, {}),
+        (cross_val_predict, {}),
+        (learning_curve, {}),
+        (permutation_test_score, {}),
+        (validation_curve, {"param_name": "alpha", "param_range": np.array([1])}),
+    ],
 )
-def test_groups_with_routing_validation(cv_method):
+def test_groups_with_routing_validation(func, extra_args):
     """Check that we raise an error if `groups` are passed to the cv method instead
     of `params` when metadata routing is enabled.
     """
     with pytest.raises(ValueError, match="`groups` can only be passed if"):
-        cv_method(
+        func(
             estimator=ConsumingClassifier(),
             X=X,
             y=y,
             groups=[],
+            **extra_args,
         )
 
 
 @pytest.mark.usefixtures("enable_slep006")
 @pytest.mark.parametrize(
-    "cv_method", [cross_validate, cross_val_score, cross_val_predict]
+    "func, extra_args",
+    [
+        (cross_validate, {}),
+        (cross_val_score, {}),
+        (cross_val_predict, {}),
+        (learning_curve, {}),
+        (permutation_test_score, {}),
+        (validation_curve, {"param_name": "alpha", "param_range": np.array([1])}),
+    ],
 )
-def test_passed_unrequested_metadata(cv_method):
+def test_passed_unrequested_metadata(func, extra_args):
     """Check that we raise an error when passing metadata that is not
     requested."""
     err_msg = re.escape("but are not explicitly set as requested or not requested")
     with pytest.raises(ValueError, match=err_msg):
-        cv_method(
+        func(
             estimator=ConsumingClassifier(),
             X=X,
             y=y,
             params=dict(metadata=[]),
+            **extra_args,
         )
 
 
 @pytest.mark.usefixtures("enable_slep006")
 @pytest.mark.parametrize(
-    "cv_method", [cross_validate, cross_val_score, cross_val_predict]
+    "func, extra_args",
+    [
+        (cross_validate, {}),
+        (cross_val_score, {}),
+        (cross_val_predict, {}),
+        (learning_curve, {}),
+        (permutation_test_score, {}),
+        (validation_curve, {"param_name": "alpha", "param_range": np.array([1])}),
+    ],
 )
-def test_cross_validate_routing(cv_method):
+def test_validation_functions_routing(func, extra_args):
     """Check that the respective cv method is properly dispatching the metadata
     to the consumer."""
     scorer_registry = _Registry()
@@ -2552,6 +2598,7 @@ def test_cross_validate_routing(cv_method):
     estimator = ConsumingClassifier(registry=estimator_registry).set_fit_request(
         sample_weight="fit_sample_weight", metadata="fit_metadata"
     )
+
     n_samples = _num_samples(X)
     rng = np.random.RandomState(0)
     score_weights = rng.rand(n_samples)
@@ -2561,11 +2608,12 @@ def test_cross_validate_routing(cv_method):
     fit_sample_weight = rng.rand(n_samples)
     fit_metadata = rng.rand(n_samples)
 
-    extra_params = {
+    scoring_args = {
         cross_validate: dict(scoring=dict(my_scorer=scorer, accuracy="accuracy")),
-        # cross_val_score doesn't support multiple scorers
         cross_val_score: dict(scoring=scorer),
-        # cross_val_predict doesn't need a scorer
+        learning_curve: dict(scoring=scorer),
+        validation_curve: dict(scoring=scorer),
+        permutation_test_score: dict(scoring=scorer),
         cross_val_predict: dict(),
     }
 
@@ -2576,28 +2624,30 @@ def test_cross_validate_routing(cv_method):
         fit_metadata=fit_metadata,
     )
 
-    if cv_method is not cross_val_predict:
+    if func is not cross_val_predict:
         params.update(
             score_weights=score_weights,
             score_metadata=score_metadata,
         )
 
-    cv_method(
+    func(
         estimator,
         X=X,
         y=y,
         cv=splitter,
-        **extra_params[cv_method],
+        **scoring_args[func],
+        **extra_args,
         params=params,
     )
 
-    if cv_method is not cross_val_predict:
+    if func is not cross_val_predict:
         # cross_val_predict doesn't need a scorer
         assert len(scorer_registry)
     for _scorer in scorer_registry:
         check_recorded_metadata(
             obj=_scorer,
             method="score",
+            parent=func.__name__,
             split_params=("sample_weight", "metadata"),
             sample_weight=score_weights,
             metadata=score_metadata,
@@ -2608,6 +2658,7 @@ def test_cross_validate_routing(cv_method):
         check_recorded_metadata(
             obj=_splitter,
             method="split",
+            parent=func.__name__,
             groups=split_groups,
             metadata=split_metadata,
         )
@@ -2617,6 +2668,45 @@ def test_cross_validate_routing(cv_method):
         check_recorded_metadata(
             obj=_estimator,
             method="fit",
+            parent=func.__name__,
+            split_params=("sample_weight", "metadata"),
+            sample_weight=fit_sample_weight,
+            metadata=fit_metadata,
+        )
+
+
+@pytest.mark.usefixtures("enable_slep006")
+def test_learning_curve_exploit_incremental_learning_routing():
+    """Test that learning_curve routes metadata to the estimator correctly while
+    partial_fitting it with `exploit_incremental_learning=True`."""
+
+    n_samples = _num_samples(X)
+    rng = np.random.RandomState(0)
+    fit_sample_weight = rng.rand(n_samples)
+    fit_metadata = rng.rand(n_samples)
+
+    estimator_registry = _Registry()
+    estimator = ConsumingClassifier(
+        registry=estimator_registry
+    ).set_partial_fit_request(
+        sample_weight="fit_sample_weight", metadata="fit_metadata"
+    )
+
+    learning_curve(
+        estimator,
+        X=X,
+        y=y,
+        cv=ConsumingSplitter(),
+        exploit_incremental_learning=True,
+        params=dict(fit_sample_weight=fit_sample_weight, fit_metadata=fit_metadata),
+    )
+
+    assert len(estimator_registry)
+    for _estimator in estimator_registry:
+        check_recorded_metadata(
+            obj=_estimator,
+            method="partial_fit",
+            parent="learning_curve",
             split_params=("sample_weight", "metadata"),
             sample_weight=fit_sample_weight,
             metadata=fit_metadata,
diff --git a/sklearn/multiclass.py b/sklearn/multiclass.py
index 914aac99d82b5..0c6252975a7f8 100644
--- a/sklearn/multiclass.py
+++ b/sklearn/multiclass.py
@@ -1,11 +1,8 @@
-"""
-Multiclass classification strategies
-====================================
+"""Multiclass learning algorithms.
 
-This module implements multiclass learning algorithms:
-    - one-vs-the-rest / one-vs-all
-    - one-vs-one
-    - error correcting output codes
+- one-vs-the-rest / one-vs-all
+- one-vs-one
+- error correcting output codes
 
 The estimators provided in this module are meta-estimators: they require a base
 estimator to be provided in their constructor. For example, it is possible to
@@ -28,10 +25,8 @@
 case.
 """
 
-# Author: Mathieu Blondel <mathieu@mblondel.org>
-# Author: Hamzeh Alsalhi <93hamsal@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import array
 import itertools
@@ -619,8 +614,8 @@ def get_metadata_routing(self):
             .add(
                 estimator=self.estimator,
                 method_mapping=MethodMapping()
-                .add(callee="fit", caller="fit")
-                .add(callee="partial_fit", caller="partial_fit"),
+                .add(caller="fit", callee="fit")
+                .add(caller="partial_fit", callee="partial_fit"),
             )
         )
         return router
@@ -738,7 +733,7 @@ class OneVsOneClassifier(MetaEstimatorMixin, ClassifierMixin, BaseEstimator):
     >>> X_train, X_test, y_train, y_test = train_test_split(
     ...     X, y, test_size=0.33, shuffle=True, random_state=0)
     >>> clf = OneVsOneClassifier(
-    ...     LinearSVC(dual="auto", random_state=0)).fit(X_train, y_train)
+    ...     LinearSVC(random_state=0)).fit(X_train, y_train)
     >>> clf.predict(X_test[:10])
     array([2, 1, 0, 2, 0, 2, 0, 1, 1, 1])
     """
@@ -1018,8 +1013,8 @@ def get_metadata_routing(self):
             .add(
                 estimator=self.estimator,
                 method_mapping=MethodMapping()
-                .add(callee="fit", caller="fit")
-                .add(callee="partial_fit", caller="partial_fit"),
+                .add(caller="fit", callee="fit")
+                .add(caller="partial_fit", callee="partial_fit"),
             )
         )
         return router
@@ -1264,6 +1259,6 @@ def get_metadata_routing(self):
 
         router = MetadataRouter(owner=self.__class__.__name__).add(
             estimator=self.estimator,
-            method_mapping=MethodMapping().add(callee="fit", caller="fit"),
+            method_mapping=MethodMapping().add(caller="fit", callee="fit"),
         )
         return router
diff --git a/sklearn/multioutput.py b/sklearn/multioutput.py
index e0da38357e792..61ef6c11e0739 100644
--- a/sklearn/multioutput.py
+++ b/sklearn/multioutput.py
@@ -1,18 +1,12 @@
-"""
-This module implements multioutput regression and classification.
+"""Multioutput regression and classification.
 
 The estimators provided in this module are meta-estimators: they require
 a base estimator to be provided in their constructor. The meta-estimator
 extends single output estimators to multioutput estimators.
 """
 
-# Author: Tim Head <betatim@gmail.com>
-# Author: Hugo Bowne-Anderson <hugobowne@gmail.com>
-# Author: Chris Rivera <chris.richard.rivera@gmail.com>
-# Author: Michael Williamson
-# Author: James Ashton Nichols <james.ashton.nichols@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 from abc import ABCMeta, abstractmethod
@@ -334,8 +328,8 @@ def get_metadata_routing(self):
         router = MetadataRouter(owner=self.__class__.__name__).add(
             estimator=self.estimator,
             method_mapping=MethodMapping()
-            .add(callee="partial_fit", caller="partial_fit")
-            .add(callee="fit", caller="fit"),
+            .add(caller="partial_fit", callee="partial_fit")
+            .add(caller="fit", callee="fit"),
         )
         return router
 
@@ -1096,7 +1090,7 @@ def get_metadata_routing(self):
         """
         router = MetadataRouter(owner=self.__class__.__name__).add(
             estimator=self.base_estimator,
-            method_mapping=MethodMapping().add(callee="fit", caller="fit"),
+            method_mapping=MethodMapping().add(caller="fit", callee="fit"),
         )
         return router
 
@@ -1191,7 +1185,7 @@ class RegressorChain(MetaEstimatorMixin, RegressorMixin, _BaseChain):
     --------
     >>> from sklearn.multioutput import RegressorChain
     >>> from sklearn.linear_model import LogisticRegression
-    >>> logreg = LogisticRegression(solver='lbfgs',multi_class='multinomial')
+    >>> logreg = LogisticRegression(solver='lbfgs')
     >>> X, Y = [[1, 0], [0, 1], [1, 1]], [[0, 2], [1, 1], [2, 0]]
     >>> chain = RegressorChain(base_estimator=logreg, order=[0, 1]).fit(X, Y)
     >>> chain.predict(X)
@@ -1245,7 +1239,7 @@ def get_metadata_routing(self):
         """
         router = MetadataRouter(owner=self.__class__.__name__).add(
             estimator=self.base_estimator,
-            method_mapping=MethodMapping().add(callee="fit", caller="fit"),
+            method_mapping=MethodMapping().add(caller="fit", callee="fit"),
         )
         return router
 
diff --git a/sklearn/naive_bayes.py b/sklearn/naive_bayes.py
index c5a129779dd89..7992a911c1be1 100644
--- a/sklearn/naive_bayes.py
+++ b/sklearn/naive_bayes.py
@@ -1,18 +1,11 @@
-"""
-The :mod:`sklearn.naive_bayes` module implements Naive Bayes algorithms. These
-are supervised learning methods based on applying Bayes' theorem with strong
+"""Naive Bayes algorithms.
+
+These are supervised learning methods based on applying Bayes' theorem with strong
 (naive) feature independence assumptions.
 """
 
-# Author: Vincent Michel <vincent.michel@inria.fr>
-#         Minor fixes by Fabian Pedregosa
-#         Amit Aides <amitibo@tx.technion.ac.il>
-#         Yehuda Finkelstein <yehudaf@tx.technion.ac.il>
-#         Lars Buitinck
-#         Jan Hendrik Metzen <jhm@informatik.uni-bremen.de>
-#         (parts based on earlier work by Mathieu Blondel)
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import warnings
 from abc import ABCMeta, abstractmethod
 from numbers import Integral, Real
diff --git a/sklearn/neighbors/__init__.py b/sklearn/neighbors/__init__.py
index ce697656b4c2e..e2c1a50632564 100644
--- a/sklearn/neighbors/__init__.py
+++ b/sklearn/neighbors/__init__.py
@@ -1,7 +1,4 @@
-"""
-The :mod:`sklearn.neighbors` module implements the k-nearest neighbors
-algorithm.
-"""
+"""The k-nearest neighbors algorithms."""
 
 from ._ball_tree import BallTree
 from ._base import VALID_METRICS, VALID_METRICS_SPARSE, sort_graph_by_row_values
diff --git a/sklearn/neighbors/_ball_tree.pyx.tp b/sklearn/neighbors/_ball_tree.pyx.tp
index f0d433fdec01c..44d876187c54f 100644
--- a/sklearn/neighbors/_ball_tree.pyx.tp
+++ b/sklearn/neighbors/_ball_tree.pyx.tp
@@ -11,8 +11,8 @@ implementation_specific_values = [
     ('32', 'float32_t', 'np.float32')
 ]
 
-# Author: Jake Vanderplas <vanderplas@astro.washington.edu>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 }}
 
diff --git a/sklearn/neighbors/_base.py b/sklearn/neighbors/_base.py
index 776d462928fbb..750dd485ed586 100644
--- a/sklearn/neighbors/_base.py
+++ b/sklearn/neighbors/_base.py
@@ -1,12 +1,7 @@
 """Base and mixin classes for nearest neighbors."""
 
-# Authors: Jake Vanderplas <vanderplas@astro.washington.edu>
-#          Fabian Pedregosa <fabian.pedregosa@inria.fr>
-#          Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#          Sparseness support by Lars Buitinck
-#          Multi-output support by Arnaud Joly <a.joly@ulg.ac.be>
-#
-# License: BSD 3 clause (C) INRIA, University of Amsterdam
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import itertools
 import numbers
 import warnings
@@ -695,15 +690,6 @@ def _more_tags(self):
         return {"pairwise": self.metric == "precomputed"}
 
 
-def _tree_query_parallel_helper(tree, *args, **kwargs):
-    """Helper for the Parallel calls in KNeighborsMixin.kneighbors.
-
-    The Cython method tree.query is not directly picklable by cloudpickle
-    under PyPy.
-    """
-    return tree.query(*args, **kwargs)
-
-
 class KNeighborsMixin:
     """Mixin for k-neighbors searches."""
 
@@ -901,9 +887,7 @@ class from an array representing our data set and ask who's
                     "or set algorithm='brute'" % self._fit_method
                 )
             chunked_results = Parallel(n_jobs, prefer="threads")(
-                delayed(_tree_query_parallel_helper)(
-                    self._tree, X[s], n_neighbors, return_distance
-                )
+                delayed(self._tree.query)(X[s], n_neighbors, return_distance)
                 for s in gen_even_slices(X.shape[0], n_jobs)
             )
         else:
@@ -1030,15 +1014,6 @@ def kneighbors_graph(self, X=None, n_neighbors=None, mode="connectivity"):
         return kneighbors_graph
 
 
-def _tree_query_radius_parallel_helper(tree, *args, **kwargs):
-    """Helper for the Parallel calls in RadiusNeighborsMixin.radius_neighbors.
-
-    The Cython method tree.query_radius is not directly picklable by
-    cloudpickle under PyPy.
-    """
-    return tree.query_radius(*args, **kwargs)
-
-
 class RadiusNeighborsMixin:
     """Mixin for radius-based neighbors searches."""
 
@@ -1256,11 +1231,9 @@ class from an array representing our data set and ask who's
                 )
 
             n_jobs = effective_n_jobs(self.n_jobs)
-            delayed_query = delayed(_tree_query_radius_parallel_helper)
+            delayed_query = delayed(self._tree.query_radius)
             chunked_results = Parallel(n_jobs, prefer="threads")(
-                delayed_query(
-                    self._tree, X[s], radius, return_distance, sort_results=sort_results
-                )
+                delayed_query(X[s], radius, return_distance, sort_results=sort_results)
                 for s in gen_even_slices(X.shape[0], n_jobs)
             )
             if return_distance:
diff --git a/sklearn/neighbors/_binary_tree.pxi.tp b/sklearn/neighbors/_binary_tree.pxi.tp
index 5cf7b0ad99990..c25740c0d6f6c 100644
--- a/sklearn/neighbors/_binary_tree.pxi.tp
+++ b/sklearn/neighbors/_binary_tree.pxi.tp
@@ -230,10 +230,7 @@ NodeData = np.asarray(<NodeData_t[:1]>(&nd_tmp)).dtype
 ######################################################################
 # Define doc strings, substituting the appropriate class name using
 # the DOC_DICT variable defined in the pyx files.
-CLASS_DOC = """
-{BinaryTree}(X, leaf_size=40, metric='minkowski', **kwargs)
-
-{BinaryTree} for fast generalized N-point problems
+CLASS_DOC = """{BinaryTree} for fast generalized N-point problems
 
 Read more in the :ref:`User Guide <unsupervised_neighbors>`.
 
diff --git a/sklearn/neighbors/_classification.py b/sklearn/neighbors/_classification.py
index 26ffa273d0a60..c45be05b5fe04 100644
--- a/sklearn/neighbors/_classification.py
+++ b/sklearn/neighbors/_classification.py
@@ -1,12 +1,7 @@
 """Nearest Neighbor Classification"""
 
-# Authors: Jake Vanderplas <vanderplas@astro.washington.edu>
-#          Fabian Pedregosa <fabian.pedregosa@inria.fr>
-#          Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#          Sparseness support by Lars Buitinck
-#          Multi-output support by Arnaud Joly <a.joly@ulg.ac.be>
-#
-# License: BSD 3 clause (C) INRIA, University of Amsterdam
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import warnings
 from numbers import Integral
 
diff --git a/sklearn/neighbors/_graph.py b/sklearn/neighbors/_graph.py
index d0456fc59e542..d22b25f785e38 100644
--- a/sklearn/neighbors/_graph.py
+++ b/sklearn/neighbors/_graph.py
@@ -1,9 +1,7 @@
 """Nearest Neighbors graph functions"""
 
-# Author: Jake Vanderplas <vanderplas@astro.washington.edu>
-#         Tom Dupre la Tour
-#
-# License: BSD 3 clause (C) INRIA, University of Amsterdam
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import itertools
 
 from ..base import ClassNamePrefixFeaturesOutMixin, TransformerMixin, _fit_context
diff --git a/sklearn/neighbors/_kd_tree.pyx.tp b/sklearn/neighbors/_kd_tree.pyx.tp
index c8d5779c00d36..d21af05270b9a 100644
--- a/sklearn/neighbors/_kd_tree.pyx.tp
+++ b/sklearn/neighbors/_kd_tree.pyx.tp
@@ -13,7 +13,7 @@ implementation_specific_values = [
 
 # By Jake Vanderplas (2013) <jakevdp@cs.washington.edu>
 # written for the scikit-learn project
-# License: BSD
+# SPDX-License-Identifier: BSD-3-Clause
 
 }}
 
diff --git a/sklearn/neighbors/_lof.py b/sklearn/neighbors/_lof.py
index fcf1c1ce990bd..81ef02704d667 100644
--- a/sklearn/neighbors/_lof.py
+++ b/sklearn/neighbors/_lof.py
@@ -1,6 +1,5 @@
-# Authors: Nicolas Goix <nicolas.goix@telecom-paristech.fr>
-#          Alexandre Gramfort <alexandre.gramfort@telecom-paristech.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from numbers import Real
@@ -317,6 +316,14 @@ def fit(self, X, y=None):
                 self.negative_outlier_factor_, 100.0 * self.contamination
             )
 
+        # Verify if negative_outlier_factor_ values are within acceptable range.
+        # Novelty must also be false to detect outliers
+        if np.min(self.negative_outlier_factor_) < -1e7 and not self.novelty:
+            warnings.warn(
+                "Duplicate values are leading to incorrect results. "
+                "Increase the number of neighbors for more accurate results."
+            )
+
         return self
 
     def _check_novelty_predict(self):
diff --git a/sklearn/neighbors/_nca.py b/sklearn/neighbors/_nca.py
index b304c3fb9792f..8e2bf87f7182c 100644
--- a/sklearn/neighbors/_nca.py
+++ b/sklearn/neighbors/_nca.py
@@ -2,9 +2,8 @@
 Neighborhood Component Analysis
 """
 
-# Authors: William de Vazelhes <wdevazelhes@gmail.com>
-#          John Chiotellis <ioannis.chiotellis@in.tum.de>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import sys
 import time
diff --git a/sklearn/neighbors/_nearest_centroid.py b/sklearn/neighbors/_nearest_centroid.py
index 75086ee25448e..3e16ba6e8273b 100644
--- a/sklearn/neighbors/_nearest_centroid.py
+++ b/sklearn/neighbors/_nearest_centroid.py
@@ -2,19 +2,14 @@
 Nearest Centroid Classification
 """
 
-# Author: Robert Layton <robertlayton@gmail.com>
-#         Olivier Grisel <olivier.grisel@ensta.org>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
-import warnings
 from numbers import Real
 
 import numpy as np
 from scipy import sparse as sp
 
-from sklearn.metrics.pairwise import _VALID_METRICS
-
 from ..base import BaseEstimator, ClassifierMixin, _fit_context
 from ..metrics.pairwise import pairwise_distances_argmin
 from ..preprocessing import LabelEncoder
@@ -34,25 +29,17 @@ class NearestCentroid(ClassifierMixin, BaseEstimator):
 
     Parameters
     ----------
-    metric : str or callable, default="euclidean"
-        Metric to use for distance computation. See the documentation of
-        `scipy.spatial.distance
-        <https://docs.scipy.org/doc/scipy/reference/spatial.distance.html>`_ and
-        the metrics listed in
-        :class:`~sklearn.metrics.pairwise.distance_metrics` for valid metric
-        values. Note that "wminkowski", "seuclidean" and "mahalanobis" are not
-        supported.
-
-        The centroids for the samples corresponding to each class is
-        the point from which the sum of the distances (according to the metric)
-        of all samples that belong to that particular class are minimized.
-        If the `"manhattan"` metric is provided, this centroid is the median
-        and for all other metrics, the centroid is now set to be the mean.
-
-        .. deprecated:: 1.3
-            Support for metrics other than `euclidean` and `manhattan` and for
-            callables was deprecated in version 1.3 and will be removed in
-            version 1.5.
+    metric : {"euclidean", "manhattan"}, default="euclidean"
+        Metric to use for distance computation.
+
+        If `metric="euclidean"`, the centroid for the samples corresponding to each
+        class is the arithmetic mean, which minimizes the sum of squared L1 distances.
+        If `metric="manhattan"`, the centroid is the feature-wise median, which
+        minimizes the sum of L1 distances.
+
+        .. versionchanged:: 1.5
+            All metrics but `"euclidean"` and `"manhattan"` were deprecated and
+            now raise an error.
 
         .. versionchanged:: 0.19
             `metric='precomputed'` was deprecated and now raises an error
@@ -106,17 +93,13 @@ class NearestCentroid(ClassifierMixin, BaseEstimator):
     NearestCentroid()
     >>> print(clf.predict([[-0.8, -1]]))
     [1]
-    """
 
-    _valid_metrics = set(_VALID_METRICS) - {"mahalanobis", "seuclidean", "wminkowski"}
+    For a more detailed example see:
+    :ref:`sphx_glr_auto_examples_neighbors_plot_nearest_centroid.py`
+    """
 
     _parameter_constraints: dict = {
-        "metric": [
-            StrOptions(
-                _valid_metrics, deprecated=_valid_metrics - {"manhattan", "euclidean"}
-            ),
-            callable,
-        ],
+        "metric": [StrOptions({"manhattan", "euclidean"})],
         "shrink_threshold": [Interval(Real, 0, None, closed="neither"), None],
     }
 
@@ -143,19 +126,6 @@ def fit(self, X, y):
         self : object
             Fitted estimator.
         """
-        if isinstance(self.metric, str) and self.metric not in (
-            "manhattan",
-            "euclidean",
-        ):
-            warnings.warn(
-                (
-                    "Support for distance metrics other than euclidean and "
-                    "manhattan and for callables was deprecated in version "
-                    "1.3 and will be removed in version 1.5."
-                ),
-                FutureWarning,
-            )
-
         # If X is sparse and the metric is "manhattan", store it in a csc
         # format is easier to calculate the median.
         if self.metric == "manhattan":
@@ -195,14 +165,7 @@ def fit(self, X, y):
                     self.centroids_[cur_class] = np.median(X[center_mask], axis=0)
                 else:
                     self.centroids_[cur_class] = csc_median_axis_0(X[center_mask])
-            else:
-                # TODO(1.5) remove warning when metric is only manhattan or euclidean
-                if self.metric != "euclidean":
-                    warnings.warn(
-                        "Averaging for metrics other than "
-                        "euclidean and manhattan not supported. "
-                        "The average is set to be the mean."
-                    )
+            else:  # metric == "euclidean"
                 self.centroids_[cur_class] = X[center_mask].mean(axis=0)
 
         if self.shrink_threshold:
@@ -231,7 +194,6 @@ def fit(self, X, y):
             self.centroids_ = dataset_centroid_[np.newaxis, :] + msd
         return self
 
-    # TODO(1.5) remove note about precomputed metric
     def predict(self, X):
         """Perform classification on an array of test vectors `X`.
 
@@ -246,12 +208,6 @@ def predict(self, X):
         -------
         C : ndarray of shape (n_samples,)
             The predicted classes.
-
-        Notes
-        -----
-        If the metric constructor parameter is `"precomputed"`, `X` is assumed
-        to be the distance matrix between the data to be predicted and
-        `self.centroids_`.
         """
         check_is_fitted(self)
 
diff --git a/sklearn/neighbors/_quad_tree.pyx b/sklearn/neighbors/_quad_tree.pyx
index e481e41ca65e4..f1ef4e64f30fe 100644
--- a/sklearn/neighbors/_quad_tree.pyx
+++ b/sklearn/neighbors/_quad_tree.pyx
@@ -4,6 +4,7 @@
 
 from cpython cimport Py_INCREF, PyObject, PyTypeObject
 
+from libc.math cimport fabsf
 from libc.stdlib cimport free
 from libc.string cimport memcpy
 from libc.stdio cimport printf
@@ -15,9 +16,6 @@ import numpy as np
 cimport numpy as cnp
 cnp.import_array()
 
-cdef extern from "math.h":
-    float fabsf(float x) nogil
-
 cdef extern from "numpy/arrayobject.h":
     object PyArray_NewFromDescr(PyTypeObject* subtype, cnp.dtype descr,
                                 int nd, cnp.npy_intp* dims,
diff --git a/sklearn/neighbors/_regression.py b/sklearn/neighbors/_regression.py
index 2897c1ce409e8..98a5734c5140b 100644
--- a/sklearn/neighbors/_regression.py
+++ b/sklearn/neighbors/_regression.py
@@ -1,13 +1,7 @@
 """Nearest Neighbor Regression."""
 
-# Authors: Jake Vanderplas <vanderplas@astro.washington.edu>
-#          Fabian Pedregosa <fabian.pedregosa@inria.fr>
-#          Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#          Sparseness support by Lars Buitinck
-#          Multi-output support by Arnaud Joly <a.joly@ulg.ac.be>
-#          Empty radius support by Andreas Bjerre-Nielsen
-#
-# License: BSD 3 clause (C) INRIA, University of Amsterdam,
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 #                           University of Copenhagen
 
 import warnings
@@ -49,6 +43,10 @@ class KNeighborsRegressor(KNeighborsMixin, RegressorMixin, NeighborsBase):
 
         Uniform weights are used by default.
 
+        See the following example for a demonstration of the impact of
+        different weighting schemes on predictions:
+        :ref:`sphx_glr_auto_examples_neighbors_plot_regression.py`.
+
     algorithm : {'auto', 'ball_tree', 'kd_tree', 'brute'}, default='auto'
         Algorithm used to compute the nearest neighbors:
 
diff --git a/sklearn/neighbors/meson.build b/sklearn/neighbors/meson.build
index 55b1754c47e8f..22f81d597948b 100644
--- a/sklearn/neighbors/meson.build
+++ b/sklearn/neighbors/meson.build
@@ -20,11 +20,15 @@ foreach name: name_list
     name + '_pyx',
     output: name + '.pyx',
     input: name + '.pyx.tp',
-    command: [py, tempita, '@INPUT@', '-o', '@OUTDIR@']
+    command: [py, tempita, '@INPUT@', '-o', '@OUTDIR@'],
+    # TODO in principle this should go in py.exension_module below. This is
+    # temporary work-around for dependency issue with .pyx.tp files. For more
+    # details, see https://github.com/mesonbuild/meson/issues/13212
+    depends: [neighbors_cython_tree, utils_cython_tree, metrics_cython_tree],
   )
   py.extension_module(
     name,
-    [pyx, neighbors_cython_tree],
+    pyx,
     dependencies: [np_dep],
     cython_args: cython_args,
     subdir: 'sklearn/neighbors',
@@ -42,7 +46,7 @@ neighbors_extension_metadata = {
 foreach ext_name, ext_dict : neighbors_extension_metadata
   py.extension_module(
     ext_name,
-    ext_dict.get('sources'),
+    [ext_dict.get('sources'), utils_cython_tree],
     dependencies: ext_dict.get('dependencies'),
     override_options : ext_dict.get('override_options', []),
     cython_args: cython_args,
diff --git a/sklearn/neighbors/tests/test_lof.py b/sklearn/neighbors/tests/test_lof.py
index 3f5c1e161b7e8..140d0d9ba6dff 100644
--- a/sklearn/neighbors/tests/test_lof.py
+++ b/sklearn/neighbors/tests/test_lof.py
@@ -1,6 +1,5 @@
-# Authors: Nicolas Goix <nicolas.goix@telecom-paristech.fr>
-#          Alexandre Gramfort <alexandre.gramfort@telecom-paristech.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import re
 from math import sqrt
@@ -359,3 +358,37 @@ def test_lof_dtype_equivalence(algorithm, novelty, contamination):
             y_pred_32 = getattr(lof_32, method)(X_32)
             y_pred_64 = getattr(lof_64, method)(X_64)
             assert_allclose(y_pred_32, y_pred_64, atol=0.0002)
+
+
+def test_lof_duplicate_samples():
+    """
+    Check that LocalOutlierFactor raises a warning when duplicate values
+    in the training data cause inaccurate results.
+
+    Non-regression test for:
+    https://github.com/scikit-learn/scikit-learn/issues/27839
+    """
+
+    rng = np.random.default_rng(0)
+
+    x = rng.permutation(
+        np.hstack(
+            [
+                [0.1] * 1000,  # constant values
+                np.linspace(0.1, 0.3, num=3000),
+                rng.random(500) * 100,  # the clear outliers
+            ]
+        )
+    )
+    X = x.reshape(-1, 1)
+
+    error_msg = (
+        "Duplicate values are leading to incorrect results. "
+        "Increase the number of neighbors for more accurate results."
+    )
+
+    lof = neighbors.LocalOutlierFactor(n_neighbors=5, contamination=0.1)
+
+    # Catch the warning
+    with pytest.warns(UserWarning, match=re.escape(error_msg)):
+        lof.fit_predict(X)
diff --git a/sklearn/neighbors/tests/test_nca.py b/sklearn/neighbors/tests/test_nca.py
index a3eb5a8c6de17..ebab78a3a39b0 100644
--- a/sklearn/neighbors/tests/test_nca.py
+++ b/sklearn/neighbors/tests/test_nca.py
@@ -2,9 +2,8 @@
 Testing for Neighborhood Component Analysis module (sklearn.neighbors.nca)
 """
 
-# Authors: William de Vazelhes <wdevazelhes@gmail.com>
-#          John Chiotellis <ioannis.chiotellis@in.tum.de>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import re
 
diff --git a/sklearn/neighbors/tests/test_nearest_centroid.py b/sklearn/neighbors/tests/test_nearest_centroid.py
index 09c2501818fd3..5ce792ac29d56 100644
--- a/sklearn/neighbors/tests/test_nearest_centroid.py
+++ b/sklearn/neighbors/tests/test_nearest_centroid.py
@@ -56,21 +56,17 @@ def test_classification_toy(csr_container):
     assert_array_equal(clf.predict(T_csr.tolil()), true_result)
 
 
-# TODO(1.5): Remove filterwarnings when support for some metrics is removed
-@pytest.mark.filterwarnings("ignore:Support for distance metrics:FutureWarning:sklearn")
 def test_iris():
     # Check consistency on dataset iris.
-    for metric in ("euclidean", "cosine"):
+    for metric in ("euclidean", "manhattan"):
         clf = NearestCentroid(metric=metric).fit(iris.data, iris.target)
         score = np.mean(clf.predict(iris.data) == iris.target)
         assert score > 0.9, "Failed with score = " + str(score)
 
 
-# TODO(1.5): Remove filterwarnings when support for some metrics is removed
-@pytest.mark.filterwarnings("ignore:Support for distance metrics:FutureWarning:sklearn")
 def test_iris_shrinkage():
     # Check consistency on dataset iris, when using shrinkage.
-    for metric in ("euclidean", "cosine"):
+    for metric in ("euclidean", "manhattan"):
         for shrink_threshold in [None, 0.1, 0.5]:
             clf = NearestCentroid(metric=metric, shrink_threshold=shrink_threshold)
             clf = clf.fit(iris.data, iris.target)
@@ -151,20 +147,6 @@ def test_manhattan_metric(csr_container):
     assert_array_equal(dense_centroid, [[-1, -1], [1, 1]])
 
 
-# TODO(1.5): remove this test
-@pytest.mark.parametrize(
-    "metric", sorted(list(NearestCentroid._valid_metrics - {"manhattan", "euclidean"}))
-)
-def test_deprecated_distance_metric_supports(metric):
-    # Check that a warning is raised for all deprecated distance metric supports
-    clf = NearestCentroid(metric=metric)
-    with pytest.warns(
-        FutureWarning,
-        match="Support for distance metrics other than euclidean and manhattan",
-    ):
-        clf.fit(X, y)
-
-
 def test_features_zero_var():
     # Test that features with 0 variance throw error
 
diff --git a/sklearn/neighbors/tests/test_neighbors.py b/sklearn/neighbors/tests/test_neighbors.py
index d3fc71478e6f5..3aac121f6b06b 100644
--- a/sklearn/neighbors/tests/test_neighbors.py
+++ b/sklearn/neighbors/tests/test_neighbors.py
@@ -1644,8 +1644,16 @@ def test_nearest_neighbors_validate_params():
     + DISTANCE_METRIC_OBJS,
 )
 def test_neighbors_metrics(
-    global_dtype, metric, n_samples=20, n_features=3, n_query_pts=2, n_neighbors=5
+    global_dtype,
+    global_random_seed,
+    metric,
+    n_samples=20,
+    n_features=3,
+    n_query_pts=2,
+    n_neighbors=5,
 ):
+    rng = np.random.RandomState(global_random_seed)
+
     metric = _parse_metric(metric, global_dtype)
 
     # Test computing the neighbors for various metrics
@@ -1697,15 +1705,19 @@ def test_neighbors_metrics(
         brute_dst, brute_idx = results["brute"]
         ball_tree_dst, ball_tree_idx = results["ball_tree"]
 
-        assert_allclose(brute_dst, ball_tree_dst)
+        # The returned distances are always in float64 regardless of the input dtype
+        # We need to adjust the tolerance w.r.t the input dtype
+        rtol = 1e-7 if global_dtype == np.float64 else 1e-4
+
+        assert_allclose(brute_dst, ball_tree_dst, rtol=rtol)
         assert_array_equal(brute_idx, ball_tree_idx)
 
         if not exclude_kd_tree:
             kd_tree_dst, kd_tree_idx = results["kd_tree"]
-            assert_allclose(brute_dst, kd_tree_dst)
+            assert_allclose(brute_dst, kd_tree_dst, rtol=rtol)
             assert_array_equal(brute_idx, kd_tree_idx)
 
-            assert_allclose(ball_tree_dst, kd_tree_dst)
+            assert_allclose(ball_tree_dst, kd_tree_dst, rtol=rtol)
             assert_array_equal(ball_tree_idx, kd_tree_idx)
 
 
diff --git a/sklearn/neighbors/tests/test_neighbors_tree.py b/sklearn/neighbors/tests/test_neighbors_tree.py
index 4d8bac12f7423..de19152e8b7f2 100644
--- a/sklearn/neighbors/tests/test_neighbors_tree.py
+++ b/sklearn/neighbors/tests/test_neighbors_tree.py
@@ -1,4 +1,4 @@
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import itertools
 import pickle
diff --git a/sklearn/neural_network/__init__.py b/sklearn/neural_network/__init__.py
index 0b321b605de0b..7bf5f1241de69 100644
--- a/sklearn/neural_network/__init__.py
+++ b/sklearn/neural_network/__init__.py
@@ -1,9 +1,6 @@
-"""
-The :mod:`sklearn.neural_network` module includes models based on neural
-networks.
-"""
+"""Models based on neural networks."""
 
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 from ._multilayer_perceptron import MLPClassifier, MLPRegressor
 from ._rbm import BernoulliRBM
diff --git a/sklearn/neural_network/_base.py b/sklearn/neural_network/_base.py
index 60ef660ef917d..505b62f0154e9 100644
--- a/sklearn/neural_network/_base.py
+++ b/sklearn/neural_network/_base.py
@@ -1,7 +1,7 @@
 """Utilities for the neural network modules"""
 
-# Author: Issam H. Laradji <issam.laradji@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 from scipy.special import expit as logistic_sigmoid
diff --git a/sklearn/neural_network/_multilayer_perceptron.py b/sklearn/neural_network/_multilayer_perceptron.py
index f56f68ac852c2..c91cd8c52d8d0 100644
--- a/sklearn/neural_network/_multilayer_perceptron.py
+++ b/sklearn/neural_network/_multilayer_perceptron.py
@@ -1,9 +1,7 @@
 """Multi-layer Perceptron"""
 
-# Authors: Issam H. Laradji <issam.laradji@gmail.com>
-#          Andreas Mueller
-#          Jiyuan Qian
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from abc import ABCMeta, abstractmethod
diff --git a/sklearn/neural_network/_rbm.py b/sklearn/neural_network/_rbm.py
index 4b7f0f9422625..157cf64a66904 100644
--- a/sklearn/neural_network/_rbm.py
+++ b/sklearn/neural_network/_rbm.py
@@ -1,10 +1,7 @@
 """Restricted Boltzmann Machine"""
 
-# Authors: Yann N. Dauphin <dauphiya@iro.umontreal.ca>
-#          Vlad Niculae
-#          Gabriel Synnaeve
-#          Lars Buitinck
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import time
 from numbers import Integral, Real
diff --git a/sklearn/neural_network/_stochastic_optimizers.py b/sklearn/neural_network/_stochastic_optimizers.py
index ab87300aff110..52641a91ce4d3 100644
--- a/sklearn/neural_network/_stochastic_optimizers.py
+++ b/sklearn/neural_network/_stochastic_optimizers.py
@@ -1,7 +1,7 @@
 """Stochastic optimization methods for MLP"""
 
-# Authors: Jiyuan Qian <jq401@nyu.edu>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 
diff --git a/sklearn/neural_network/tests/test_mlp.py b/sklearn/neural_network/tests/test_mlp.py
index 64ad4c5edc019..2e2fddc664163 100644
--- a/sklearn/neural_network/tests/test_mlp.py
+++ b/sklearn/neural_network/tests/test_mlp.py
@@ -2,8 +2,8 @@
 Testing for Multi-layer Perceptron module (sklearn.neural_network)
 """
 
-# Author: Issam H. Laradji
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import re
 import sys
diff --git a/sklearn/pipeline.py b/sklearn/pipeline.py
index b26b83e66510f..47faefcfd56ff 100644
--- a/sklearn/pipeline.py
+++ b/sklearn/pipeline.py
@@ -1,14 +1,7 @@
-"""
-The :mod:`sklearn.pipeline` module implements utilities to build a composite
-estimator, as a chain of transforms and estimators.
-"""
-
-# Author: Edouard Duchesnay
-#         Gael Varoquaux
-#         Virgile Fritsch
-#         Alexandre Gramfort
-#         Lars Buitinck
-# License: BSD
+"""Utilities to build a composite estimator as a chain of transforms and estimators."""
+
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from collections import Counter, defaultdict
 from itertools import chain, islice
@@ -29,6 +22,7 @@
 )
 from .utils._tags import _safe_tags
 from .utils._user_interface import _print_elapsed_time
+from .utils.deprecation import _deprecate_Xt_in_inverse_transform
 from .utils.metadata_routing import (
     MetadataRouter,
     MethodMapping,
@@ -178,7 +172,7 @@ def set_output(self, *, transform=None):
 
         Parameters
         ----------
-        transform : {"default", "pandas"}, default=None
+        transform : {"default", "pandas", "polars"}, default=None
             Configure output of `transform` and `fit_transform`.
 
             - `"default"`: Default output format of a transformer
@@ -909,19 +903,28 @@ def _can_inverse_transform(self):
         return all(hasattr(t, "inverse_transform") for _, _, t in self._iter())
 
     @available_if(_can_inverse_transform)
-    def inverse_transform(self, Xt, **params):
+    def inverse_transform(self, X=None, *, Xt=None, **params):
         """Apply `inverse_transform` for each step in a reverse order.
 
         All estimators in the pipeline must support `inverse_transform`.
 
         Parameters
         ----------
+        X : array-like of shape (n_samples, n_transformed_features)
+            Data samples, where ``n_samples`` is the number of samples and
+            ``n_features`` is the number of features. Must fulfill
+            input requirements of last step of pipeline's
+            ``inverse_transform`` method.
+
         Xt : array-like of shape (n_samples, n_transformed_features)
             Data samples, where ``n_samples`` is the number of samples and
             ``n_features`` is the number of features. Must fulfill
             input requirements of last step of pipeline's
             ``inverse_transform`` method.
 
+            .. deprecated:: 1.5
+                `Xt` was deprecated in 1.5 and will be removed in 1.7. Use `X` instead.
+
         **params : dict of str -> object
             Parameters requested and accepted by steps. Each step must have
             requested certain metadata for these parameters to be forwarded to
@@ -940,15 +943,15 @@ def inverse_transform(self, Xt, **params):
         """
         _raise_for_params(params, self, "inverse_transform")
 
+        X = _deprecate_Xt_in_inverse_transform(X, Xt)
+
         # we don't have to branch here, since params is only non-empty if
         # enable_metadata_routing=True.
         routed_params = process_routing(self, "inverse_transform", **params)
         reverse_iter = reversed(list(self._iter()))
         for _, name, transform in reverse_iter:
-            Xt = transform.inverse_transform(
-                Xt, **routed_params[name].inverse_transform
-            )
-        return Xt
+            X = transform.inverse_transform(X, **routed_params[name].inverse_transform)
+        return X
 
     @available_if(_final_estimator_has("score"))
     def score(self, X, y=None, sample_weight=None, **params):
@@ -1258,7 +1261,7 @@ def make_pipeline(*steps, memory=None, verbose=False):
     return Pipeline(_name_estimators(steps), memory=memory, verbose=verbose)
 
 
-def _transform_one(transformer, X, y, weight, params):
+def _transform_one(transformer, X, y, weight, params=None):
     """Call transform and apply weight to output.
 
     Parameters
@@ -1412,12 +1415,12 @@ class FeatureUnion(TransformerMixin, _BaseComposition):
     ...                       ("svd", TruncatedSVD(n_components=2))])
     >>> X = [[0., 1., 3], [2., 2., 5]]
     >>> union.fit_transform(X)
-    array([[ 1.5       ,  3.0...,  0.8...],
-           [-1.5       ,  5.7..., -0.4...]])
+    array([[-1.5       ,  3.0..., -0.8...],
+           [ 1.5       ,  5.7...,  0.4...]])
     >>> # An estimator's parameter can be set using '__' syntax
     >>> union.set_params(svd__n_components=1).fit_transform(X)
-    array([[ 1.5       ,  3.0...],
-           [-1.5       ,  5.7...]])
+    array([[-1.5       ,  3.0...],
+           [ 1.5       ,  5.7...]])
 
     For a more detailed example of usage, see
     :ref:`sphx_glr_auto_examples_compose_plot_feature_union.py`.
@@ -1447,11 +1450,12 @@ def set_output(self, *, transform=None):
 
         Parameters
         ----------
-        transform : {"default", "pandas"}, default=None
+        transform : {"default", "pandas", "polars"}, default=None
             Configure output of `transform` and `fit_transform`.
 
             - `"default"`: Default output format of a transformer
             - `"pandas"`: DataFrame output
+            - `"polars"`: Polars output
             - `None`: Transform configuration is unchanged
 
         Returns
@@ -1792,7 +1796,7 @@ def transform(self, X, **params):
                 routed_params[name] = Bunch(transform={})
 
         Xs = Parallel(n_jobs=self.n_jobs)(
-            delayed(_transform_one)(trans, X, None, weight, routed_params[name])
+            delayed(_transform_one)(trans, X, None, weight, params=routed_params[name])
             for name, trans, weight in self._iter()
         )
         if not Xs:
diff --git a/sklearn/preprocessing/__init__.py b/sklearn/preprocessing/__init__.py
index c730a71260808..9e49379c9122a 100644
--- a/sklearn/preprocessing/__init__.py
+++ b/sklearn/preprocessing/__init__.py
@@ -1,7 +1,4 @@
-"""
-The :mod:`sklearn.preprocessing` module includes scaling, centering,
-normalization, binarization methods.
-"""
+"""Methods for scaling, centering, normalization, binarization, and more."""
 
 from ._data import (
     Binarizer,
diff --git a/sklearn/preprocessing/_data.py b/sklearn/preprocessing/_data.py
index 6dad8dc1c8c21..68a887f7e2042 100644
--- a/sklearn/preprocessing/_data.py
+++ b/sklearn/preprocessing/_data.py
@@ -1,11 +1,5 @@
-# Authors: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#          Mathieu Blondel <mathieu@mblondel.org>
-#          Olivier Grisel <olivier.grisel@ensta.org>
-#          Andreas Mueller <amueller@ais.uni-bonn.de>
-#          Eric Martin <eric@ericmart.in>
-#          Giorgio Patrini <giorgio.patrini@anu.edu.au>
-#          Eric Chang <ericchang2017@u.northwestern.edu>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 import warnings
@@ -535,6 +529,7 @@ def transform(self, X):
             X,
             copy=self.copy,
             dtype=_array_api.supported_float_dtypes(xp),
+            force_writeable=True,
             force_all_finite="allow-nan",
             reset=False,
         )
@@ -566,6 +561,7 @@ def inverse_transform(self, X):
             X,
             copy=self.copy,
             dtype=_array_api.supported_float_dtypes(xp),
+            force_writeable=True,
             force_all_finite="allow-nan",
         )
 
@@ -1046,6 +1042,7 @@ def transform(self, X, copy=None):
             accept_sparse="csr",
             copy=copy,
             dtype=FLOAT_DTYPES,
+            force_writeable=True,
             force_all_finite="allow-nan",
         )
 
@@ -1087,6 +1084,7 @@ def inverse_transform(self, X, copy=None):
             accept_sparse="csr",
             copy=copy,
             dtype=FLOAT_DTYPES,
+            force_writeable=True,
             force_all_finite="allow-nan",
         )
 
@@ -1291,6 +1289,7 @@ def transform(self, X):
             copy=self.copy,
             reset=False,
             dtype=_array_api.supported_float_dtypes(xp),
+            force_writeable=True,
             force_all_finite="allow-nan",
         )
 
@@ -1322,6 +1321,7 @@ def inverse_transform(self, X):
             accept_sparse=("csr", "csc"),
             copy=self.copy,
             dtype=_array_api.supported_float_dtypes(xp),
+            force_writeable=True,
             force_all_finite="allow-nan",
         )
 
@@ -1654,6 +1654,7 @@ def transform(self, X):
             accept_sparse=("csr", "csc"),
             copy=self.copy,
             dtype=FLOAT_DTYPES,
+            force_writeable=True,
             reset=False,
             force_all_finite="allow-nan",
         )
@@ -1687,6 +1688,7 @@ def inverse_transform(self, X):
             accept_sparse=("csr", "csc"),
             copy=self.copy,
             dtype=FLOAT_DTYPES,
+            force_writeable=True,
             force_all_finite="allow-nan",
         )
 
@@ -1928,6 +1930,7 @@ def normalize(X, norm="l2", *, axis=1, copy=True, return_norm=False):
         copy=copy,
         estimator="the normalize function",
         dtype=_array_api.supported_float_dtypes(xp),
+        force_writeable=True,
     )
     if axis == 0:
         X = X.T
@@ -2091,8 +2094,10 @@ def transform(self, X, copy=None):
             Transformed array.
         """
         copy = copy if copy is not None else self.copy
-        X = self._validate_data(X, accept_sparse="csr", reset=False)
-        return normalize(X, norm=self.norm, axis=1, copy=copy)
+        X = self._validate_data(
+            X, accept_sparse="csr", force_writeable=True, copy=copy, reset=False
+        )
+        return normalize(X, norm=self.norm, axis=1, copy=False)
 
     def _more_tags(self):
         return {"stateless": True, "array_api_support": True}
@@ -2146,7 +2151,7 @@ def binarize(X, *, threshold=0.0, copy=True):
     array([[0., 1., 0.],
            [1., 0., 0.]])
     """
-    X = check_array(X, accept_sparse=["csr", "csc"], copy=copy)
+    X = check_array(X, accept_sparse=["csr", "csc"], force_writeable=True, copy=copy)
     if sparse.issparse(X):
         if threshold < 0:
             raise ValueError("Cannot binarize a sparse matrix with threshold < 0")
@@ -2287,7 +2292,13 @@ def transform(self, X, copy=None):
         copy = copy if copy is not None else self.copy
         # TODO: This should be refactored because binarize also calls
         # check_array
-        X = self._validate_data(X, accept_sparse=["csr", "csc"], copy=copy, reset=False)
+        X = self._validate_data(
+            X,
+            accept_sparse=["csr", "csc"],
+            force_writeable=True,
+            copy=copy,
+            reset=False,
+        )
         return binarize(X, threshold=self.threshold, copy=False)
 
     def _more_tags(self):
@@ -2372,10 +2383,6 @@ class KernelCenterer(ClassNamePrefixFeaturesOutMixin, TransformerMixin, BaseEsti
            [ -5., -14.,  19.]])
     """
 
-    def __init__(self):
-        # Needed for backported inspect.signature compatibility with PyPy
-        pass
-
     def fit(self, K, y=None):
         """Fit KernelCenterer.
 
@@ -2428,7 +2435,11 @@ def transform(self, K, copy=True):
         xp, _ = get_namespace(K)
 
         K = self._validate_data(
-            K, copy=copy, dtype=_array_api.supported_float_dtypes(xp), reset=False
+            K,
+            copy=copy,
+            force_writeable=True,
+            dtype=_array_api.supported_float_dtypes(xp),
+            reset=False,
         )
 
         K_pred_cols = (xp.sum(K, axis=1) / self.K_fit_rows_.shape[0])[:, None]
@@ -2852,6 +2863,9 @@ def _check_inputs(self, X, in_fit, accept_sparse_negative=False, copy=False):
             accept_sparse="csc",
             copy=copy,
             dtype=FLOAT_DTYPES,
+            # only set force_writeable for the validation at transform time because
+            # it's the only place where QuantileTransformer performs inplace operations.
+            force_writeable=True if not in_fit else None,
             force_all_finite="allow-nan",
         )
         # we only accept positive sparse matrix when ignore_implicit_zeros is
@@ -3490,6 +3504,7 @@ def _check_input(self, X, in_fit, check_positive=False, check_shape=False):
             X,
             ensure_2d=True,
             dtype=FLOAT_DTYPES,
+            force_writeable=True,
             copy=self.copy,
             force_all_finite="allow-nan",
             reset=in_fit,
diff --git a/sklearn/preprocessing/_discretization.py b/sklearn/preprocessing/_discretization.py
index 5854bdc6425e7..8c260c01cc0c6 100644
--- a/sklearn/preprocessing/_discretization.py
+++ b/sklearn/preprocessing/_discretization.py
@@ -1,7 +1,5 @@
-# Author: Henry Lin <hlin117@gmail.com>
-#         Tom Dupré la Tour
-
-# License: BSD
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 import warnings
@@ -11,7 +9,8 @@
 
 from ..base import BaseEstimator, TransformerMixin, _fit_context
 from ..utils import resample
-from ..utils._param_validation import Hidden, Interval, Options, StrOptions
+from ..utils._param_validation import Interval, Options, StrOptions
+from ..utils.deprecation import _deprecate_Xt_in_inverse_transform
 from ..utils.stats import _weighted_percentile
 from ..utils.validation import (
     _check_feature_names_in,
@@ -64,10 +63,9 @@ class KBinsDiscretizer(TransformerMixin, BaseEstimator):
 
         .. versionadded:: 0.24
 
-    subsample : int or None, default='warn'
+    subsample : int or None, default=200_000
         Maximum number of samples, used to fit the model, for computational
-        efficiency. Defaults to 200_000 when `strategy='quantile'` and to `None`
-        when `strategy='uniform'` or `strategy='kmeans'`.
+        efficiency.
         `subsample=None` means that all the training samples are used when
         computing the quantiles that determine the binning thresholds.
         Since quantile computation relies on sorting each column of `X` and
@@ -147,7 +145,7 @@ class KBinsDiscretizer(TransformerMixin, BaseEstimator):
     ...      [ 0, 3, -2,  0.5],
     ...      [ 1, 4, -1,    2]]
     >>> est = KBinsDiscretizer(
-    ...     n_bins=3, encode='ordinal', strategy='uniform', subsample=None
+    ...     n_bins=3, encode='ordinal', strategy='uniform'
     ... )
     >>> est.fit(X)
     KBinsDiscretizer(...)
@@ -177,11 +175,7 @@ class KBinsDiscretizer(TransformerMixin, BaseEstimator):
         "encode": [StrOptions({"onehot", "onehot-dense", "ordinal"})],
         "strategy": [StrOptions({"uniform", "quantile", "kmeans"})],
         "dtype": [Options(type, {np.float64, np.float32}), None],
-        "subsample": [
-            Interval(Integral, 1, None, closed="left"),
-            None,
-            Hidden(StrOptions({"warn"})),
-        ],
+        "subsample": [Interval(Integral, 1, None, closed="left"), None],
         "random_state": ["random_state"],
     }
 
@@ -192,7 +186,7 @@ def __init__(
         encode="onehot",
         strategy="quantile",
         dtype=None,
-        subsample="warn",
+        subsample=200_000,
         random_state=None,
     ):
         self.n_bins = n_bins
@@ -218,7 +212,7 @@ def fit(self, X, y=None, sample_weight=None):
 
         sample_weight : ndarray of shape (n_samples,)
             Contains weight values to be associated with each sample.
-            Only possible when `strategy` is set to `"quantile"`.
+            Cannot be used when `strategy` is set to `"uniform"`.
 
             .. versionadded:: 1.3
 
@@ -243,24 +237,13 @@ def fit(self, X, y=None, sample_weight=None):
                 f"{self.strategy!r} instead."
             )
 
-        if self.strategy in ("uniform", "kmeans") and self.subsample == "warn":
-            warnings.warn(
-                (
-                    "In version 1.5 onwards, subsample=200_000 "
-                    "will be used by default. Set subsample explicitly to "
-                    "silence this warning in the mean time. Set "
-                    "subsample=None to disable subsampling explicitly."
-                ),
-                FutureWarning,
-            )
-
-        subsample = self.subsample
-        if subsample == "warn":
-            subsample = 200000 if self.strategy == "quantile" else None
-        if subsample is not None and n_samples > subsample:
+        if self.subsample is not None and n_samples > self.subsample:
             # Take a subsample of `X`
             X = resample(
-                X, replace=False, n_samples=subsample, random_state=self.random_state
+                X,
+                replace=False,
+                n_samples=self.subsample,
+                random_state=self.random_state,
             )
 
         n_features = X.shape[1]
@@ -405,7 +388,7 @@ def transform(self, X):
             self._encoder.dtype = dtype_init
         return Xt_enc
 
-    def inverse_transform(self, Xt):
+    def inverse_transform(self, X=None, *, Xt=None):
         """
         Transform discretized data back to original feature space.
 
@@ -414,20 +397,28 @@ def inverse_transform(self, Xt):
 
         Parameters
         ----------
+        X : array-like of shape (n_samples, n_features)
+            Transformed data in the binned space.
+
         Xt : array-like of shape (n_samples, n_features)
             Transformed data in the binned space.
 
+            .. deprecated:: 1.5
+                `Xt` was deprecated in 1.5 and will be removed in 1.7. Use `X` instead.
+
         Returns
         -------
         Xinv : ndarray, dtype={np.float32, np.float64}
             Data in the original feature space.
         """
+        X = _deprecate_Xt_in_inverse_transform(X, Xt)
+
         check_is_fitted(self)
 
         if "onehot" in self.encode:
-            Xt = self._encoder.inverse_transform(Xt)
+            X = self._encoder.inverse_transform(X)
 
-        Xinv = check_array(Xt, copy=True, dtype=(np.float64, np.float32))
+        Xinv = check_array(X, copy=True, dtype=(np.float64, np.float32))
         n_features = self.n_bins_.shape[0]
         if Xinv.shape[1] != n_features:
             raise ValueError(
diff --git a/sklearn/preprocessing/_encoders.py b/sklearn/preprocessing/_encoders.py
index d8796f7fa42c3..e3924c11fb635 100644
--- a/sklearn/preprocessing/_encoders.py
+++ b/sklearn/preprocessing/_encoders.py
@@ -1,6 +1,5 @@
-# Authors: Andreas Mueller <amueller@ais.uni-bonn.de>
-#          Joris Van den Bossche <jorisvandenbossche@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numbers
 import warnings
diff --git a/sklearn/preprocessing/_function_transformer.py b/sklearn/preprocessing/_function_transformer.py
index 0442e75346fed..c49684d0ebfbc 100644
--- a/sklearn/preprocessing/_function_transformer.py
+++ b/sklearn/preprocessing/_function_transformer.py
@@ -393,7 +393,7 @@ def set_output(self, *, transform=None):
 
         Parameters
         ----------
-        transform : {"default", "pandas"}, default=None
+        transform : {"default", "pandas", "polars"}, default=None
             Configure output of `transform` and `fit_transform`.
 
             - `"default"`: Default output format of a transformer
diff --git a/sklearn/preprocessing/_label.py b/sklearn/preprocessing/_label.py
index 301dc19bb1985..1808eed25df7f 100644
--- a/sklearn/preprocessing/_label.py
+++ b/sklearn/preprocessing/_label.py
@@ -1,10 +1,5 @@
-# Authors: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#          Mathieu Blondel <mathieu@mblondel.org>
-#          Olivier Grisel <olivier.grisel@ensta.org>
-#          Andreas Mueller <amueller@ais.uni-bonn.de>
-#          Joel Nothman <joel.nothman@gmail.com>
-#          Hamzeh Alsalhi <ha258@cornell.edu>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import array
 import itertools
@@ -17,6 +12,7 @@
 
 from ..base import BaseEstimator, TransformerMixin, _fit_context
 from ..utils import column_or_1d
+from ..utils._array_api import _setdiff1d, device, get_namespace
 from ..utils._encode import _encode, _unique
 from ..utils._param_validation import Interval, validate_params
 from ..utils.multiclass import type_of_target, unique_labels
@@ -129,10 +125,11 @@ def transform(self, y):
             Labels as normalized encodings.
         """
         check_is_fitted(self)
+        xp, _ = get_namespace(y)
         y = column_or_1d(y, dtype=self.classes_.dtype, warn=True)
         # transform of empty array is empty array
         if _num_samples(y) == 0:
-            return np.array([])
+            return xp.asarray([])
 
         return _encode(y, uniques=self.classes_)
 
@@ -141,7 +138,7 @@ def inverse_transform(self, y):
 
         Parameters
         ----------
-        y : ndarray of shape (n_samples,)
+        y : array-like of shape (n_samples,)
             Target values.
 
         Returns
@@ -150,19 +147,24 @@ def inverse_transform(self, y):
             Original encoding.
         """
         check_is_fitted(self)
+        xp, _ = get_namespace(y)
         y = column_or_1d(y, warn=True)
         # inverse transform of empty array is empty array
         if _num_samples(y) == 0:
-            return np.array([])
+            return xp.asarray([])
 
-        diff = np.setdiff1d(y, np.arange(len(self.classes_)))
-        if len(diff):
+        diff = _setdiff1d(
+            ar1=y,
+            ar2=xp.arange(self.classes_.shape[0], device=device(y)),
+            xp=xp,
+        )
+        if diff.shape[0]:
             raise ValueError("y contains previously unseen labels: %s" % str(diff))
-        y = np.asarray(y)
-        return self.classes_[y]
+        y = xp.asarray(y)
+        return xp.take(self.classes_, y, axis=0)
 
     def _more_tags(self):
-        return {"X_types": ["1dlabels"]}
+        return {"X_types": ["1dlabels"], "array_api_support": True}
 
 
 class LabelBinarizer(TransformerMixin, BaseEstimator, auto_wrap_output_keys=None):
diff --git a/sklearn/preprocessing/meson.build b/sklearn/preprocessing/meson.build
index 2d280cf5fba39..a8f741ee352b1 100644
--- a/sklearn/preprocessing/meson.build
+++ b/sklearn/preprocessing/meson.build
@@ -1,6 +1,6 @@
 py.extension_module(
   '_csr_polynomial_expansion',
-  '_csr_polynomial_expansion.pyx',
+  ['_csr_polynomial_expansion.pyx', utils_cython_tree],
   cython_args: cython_args,
   subdir: 'sklearn/preprocessing',
   install: true
@@ -8,7 +8,7 @@ py.extension_module(
 
 py.extension_module(
   '_target_encoder_fast',
-  '_target_encoder_fast.pyx',
+  ['_target_encoder_fast.pyx', utils_cython_tree],
   override_options: ['cython_language=cpp'],
   cython_args: cython_args,
   subdir: 'sklearn/preprocessing',
diff --git a/sklearn/preprocessing/tests/test_data.py b/sklearn/preprocessing/tests/test_data.py
index b7e8e4e40686e..5d254e491b400 100644
--- a/sklearn/preprocessing/tests/test_data.py
+++ b/sklearn/preprocessing/tests/test_data.py
@@ -1,8 +1,5 @@
-# Authors:
-#
-#          Giorgio Patrini
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import re
 import warnings
@@ -595,6 +592,10 @@ def test_standard_scaler_partial_fit_numerical_stability(sparse_container):
     scaler_incr = StandardScaler(with_mean=False)
 
     for chunk in X:
+        if chunk.ndim == 1:
+            # Sparse arrays can be 1D (in scipy 1.14 and later) while old
+            # sparse matrix instances are always 2D.
+            chunk = chunk.reshape(1, -1)
         scaler_incr = scaler_incr.partial_fit(chunk)
 
     # Regardless of magnitude, they must not differ more than of 6 digits
diff --git a/sklearn/preprocessing/tests/test_discretization.py b/sklearn/preprocessing/tests/test_discretization.py
index 46ec86f7a75d4..fd16a3db3efac 100644
--- a/sklearn/preprocessing/tests/test_discretization.py
+++ b/sklearn/preprocessing/tests/test_discretization.py
@@ -49,8 +49,6 @@
         ),
     ],
 )
-# TODO(1.5) remove warning filter when kbd's subsample default is changed
-@pytest.mark.filterwarnings("ignore:In version 1.5 onwards, subsample=200_000")
 def test_fit_transform(strategy, expected, sample_weight):
     est = KBinsDiscretizer(n_bins=3, encode="ordinal", strategy=strategy)
     est.fit(X, sample_weight=sample_weight)
@@ -149,8 +147,6 @@ def test_invalid_n_bins_array():
         ),
     ],
 )
-# TODO(1.5) remove warning filter when kbd's subsample default is changed
-@pytest.mark.filterwarnings("ignore:In version 1.5 onwards, subsample=200_000")
 def test_fit_transform_n_bins_array(strategy, expected, sample_weight):
     est = KBinsDiscretizer(
         n_bins=[2, 3, 3, 3], encode="ordinal", strategy=strategy
@@ -176,8 +172,6 @@ def test_kbinsdiscretizer_effect_sample_weight():
     assert_allclose(est.transform(X), [[0.0], [1.0], [2.0], [2.0], [2.0], [2.0]])
 
 
-# TODO(1.5) remove warning filter when kbd's subsample default is changed
-@pytest.mark.filterwarnings("ignore:In version 1.5 onwards, subsample=200_000")
 @pytest.mark.parametrize("strategy", ["kmeans", "quantile"])
 def test_kbinsdiscretizer_no_mutating_sample_weight(strategy):
     """Make sure that `sample_weight` is not changed in place."""
@@ -258,8 +252,6 @@ def test_encode_options():
         ("quantile", [0, 0, 0, 1, 1, 1], [0, 0, 1, 1, 2, 2], [0, 1, 2, 3, 4, 4]),
     ],
 )
-# TODO(1.5) remove warning filter when kbd's subsample default is changed
-@pytest.mark.filterwarnings("ignore:In version 1.5 onwards, subsample=200_000")
 def test_nonuniform_strategies(
     strategy, expected_2bins, expected_3bins, expected_5bins
 ):
@@ -313,8 +305,6 @@ def test_nonuniform_strategies(
         ),
     ],
 )
-# TODO(1.5) remove warning filter when kbd's subsample default is changed
-@pytest.mark.filterwarnings("ignore:In version 1.5 onwards, subsample=200_000")
 @pytest.mark.parametrize("encode", ["ordinal", "onehot", "onehot-dense"])
 def test_inverse_transform(strategy, encode, expected_inv):
     kbd = KBinsDiscretizer(n_bins=3, strategy=strategy, encode=encode)
@@ -323,8 +313,6 @@ def test_inverse_transform(strategy, encode, expected_inv):
     assert_array_almost_equal(expected_inv, Xinv)
 
 
-# TODO(1.5) remove warning filter when kbd's subsample default is changed
-@pytest.mark.filterwarnings("ignore:In version 1.5 onwards, subsample=200_000")
 @pytest.mark.parametrize("strategy", ["uniform", "kmeans", "quantile"])
 def test_transform_outside_fit_range(strategy):
     X = np.array([0, 1, 2, 3])[:, None]
@@ -492,12 +480,21 @@ def test_kbinsdiscretizer_subsample(strategy, global_random_seed):
     )
 
 
-# TODO(1.5) remove this test
-@pytest.mark.parametrize("strategy", ["uniform", "kmeans"])
-def test_kbd_subsample_warning(strategy):
-    # Check the future warning for the change of default of subsample
-    X = np.random.RandomState(0).random_sample((100, 1))
+# TODO(1.7): remove this test
+def test_KBD_inverse_transform_Xt_deprecation():
+    X = np.arange(10)[:, None]
+    kbd = KBinsDiscretizer()
+    X = kbd.fit_transform(X)
 
-    kbd = KBinsDiscretizer(strategy=strategy, random_state=0)
-    with pytest.warns(FutureWarning, match="subsample=200_000 will be used by default"):
-        kbd.fit(X)
+    with pytest.raises(TypeError, match="Missing required positional argument"):
+        kbd.inverse_transform()
+
+    with pytest.raises(TypeError, match="Cannot use both X and Xt. Use X only"):
+        kbd.inverse_transform(X=X, Xt=X)
+
+    with warnings.catch_warnings(record=True):
+        warnings.simplefilter("error")
+        kbd.inverse_transform(X)
+
+    with pytest.warns(FutureWarning, match="Xt was renamed X in version 1.5"):
+        kbd.inverse_transform(Xt=X)
diff --git a/sklearn/preprocessing/tests/test_label.py b/sklearn/preprocessing/tests/test_label.py
index e438805df1254..90e3aa210eebb 100644
--- a/sklearn/preprocessing/tests/test_label.py
+++ b/sklearn/preprocessing/tests/test_label.py
@@ -2,7 +2,7 @@
 import pytest
 from scipy.sparse import issparse
 
-from sklearn import datasets
+from sklearn import config_context, datasets
 from sklearn.preprocessing._label import (
     LabelBinarizer,
     LabelEncoder,
@@ -11,7 +11,16 @@
     _inverse_binarize_thresholding,
     label_binarize,
 )
-from sklearn.utils._testing import assert_array_equal, ignore_warnings
+from sklearn.utils._array_api import (
+    _convert_to_numpy,
+    get_namespace,
+    yield_namespace_device_dtype_combinations,
+)
+from sklearn.utils._testing import (
+    _array_api_for_tests,
+    assert_array_equal,
+    ignore_warnings,
+)
 from sklearn.utils.fixes import (
     COO_CONTAINERS,
     CSC_CONTAINERS,
@@ -697,3 +706,42 @@ def test_label_encoders_do_not_have_set_output(encoder):
     y_encoded_with_kwarg = encoder.fit_transform(y=["a", "b", "c"])
     y_encoded_positional = encoder.fit_transform(["a", "b", "c"])
     assert_array_equal(y_encoded_with_kwarg, y_encoded_positional)
+
+
+@pytest.mark.parametrize(
+    "array_namespace, device, dtype", yield_namespace_device_dtype_combinations()
+)
+@pytest.mark.parametrize(
+    "y",
+    [
+        np.array([2, 1, 3, 1, 3]),
+        np.array([1, 1, 4, 5, -1, 0]),
+        np.array([3, 5, 9, 5, 9, 3]),
+    ],
+)
+def test_label_encoder_array_api_compliance(y, array_namespace, device, dtype):
+    xp = _array_api_for_tests(array_namespace, device)
+    xp_y = xp.asarray(y, device=device)
+    with config_context(array_api_dispatch=True):
+        xp_label = LabelEncoder()
+        np_label = LabelEncoder()
+        xp_label = xp_label.fit(xp_y)
+        xp_transformed = xp_label.transform(xp_y)
+        xp_inv_transformed = xp_label.inverse_transform(xp_transformed)
+        np_label = np_label.fit(y)
+        np_transformed = np_label.transform(y)
+        assert get_namespace(xp_transformed)[0].__name__ == xp.__name__
+        assert get_namespace(xp_inv_transformed)[0].__name__ == xp.__name__
+        assert get_namespace(xp_label.classes_)[0].__name__ == xp.__name__
+        assert_array_equal(_convert_to_numpy(xp_transformed, xp), np_transformed)
+        assert_array_equal(_convert_to_numpy(xp_inv_transformed, xp), y)
+        assert_array_equal(_convert_to_numpy(xp_label.classes_, xp), np_label.classes_)
+
+        xp_label = LabelEncoder()
+        np_label = LabelEncoder()
+        xp_transformed = xp_label.fit_transform(xp_y)
+        np_transformed = np_label.fit_transform(y)
+        assert get_namespace(xp_transformed)[0].__name__ == xp.__name__
+        assert get_namespace(xp_label.classes_)[0].__name__ == xp.__name__
+        assert_array_equal(_convert_to_numpy(xp_transformed, xp), np_transformed)
+        assert_array_equal(_convert_to_numpy(xp_label.classes_, xp), np_label.classes_)
diff --git a/sklearn/preprocessing/tests/test_target_encoder.py b/sklearn/preprocessing/tests/test_target_encoder.py
index 81b0f32d04d68..c1e707b9bff98 100644
--- a/sklearn/preprocessing/tests/test_target_encoder.py
+++ b/sklearn/preprocessing/tests/test_target_encoder.py
@@ -586,8 +586,6 @@ def test_invariance_of_encoding_under_label_permutation(smooth, global_random_se
     assert_allclose(X_test_encoded, X_test_permuted_encoded)
 
 
-# TODO(1.5) remove warning filter when kbd's subsample default is changed
-@pytest.mark.filterwarnings("ignore:In version 1.5 onwards, subsample=200_000")
 @pytest.mark.parametrize("smooth", [0.0, "auto"])
 def test_target_encoding_for_linear_regression(smooth, global_random_seed):
     # Check some expected statistical properties when fitting a linear
diff --git a/sklearn/random_projection.py b/sklearn/random_projection.py
index 886a805960d52..cc275649b8b79 100644
--- a/sklearn/random_projection.py
+++ b/sklearn/random_projection.py
@@ -1,11 +1,11 @@
-"""Random Projection transformers.
+"""Random projection transformers.
 
-Random Projections are a simple and computationally efficient way to
+Random projections are a simple and computationally efficient way to
 reduce the dimensionality of the data by trading a controlled amount
 of accuracy (as additional variance) for faster processing times and
 smaller model sizes.
 
-The dimensions and distribution of Random Projections matrices are
+The dimensions and distribution of random projections matrices are
 controlled so as to preserve the pairwise distances between any two
 samples of the dataset.
 
@@ -20,12 +20,10 @@
   much lower dimension in such a way that distances between the points are
   nearly preserved. The map used for the embedding is at least Lipschitz,
   and can even be taken to be an orthogonal projection.
-
 """
 
-# Authors: Olivier Grisel <olivier.grisel@ensta.org>,
-#          Arnaud Joly <a.joly@ulg.ac.be>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from abc import ABCMeta, abstractmethod
diff --git a/sklearn/semi_supervised/__init__.py b/sklearn/semi_supervised/__init__.py
index 126906cdde1d7..055c3f431b2c1 100644
--- a/sklearn/semi_supervised/__init__.py
+++ b/sklearn/semi_supervised/__init__.py
@@ -1,8 +1,7 @@
-"""
-The :mod:`sklearn.semi_supervised` module implements semi-supervised learning
-algorithms. These algorithms utilize small amounts of labeled data and large
-amounts of unlabeled data for classification tasks. This module includes Label
-Propagation.
+"""Semi-supervised learning algorithms.
+
+These algorithms utilize small amounts of labeled data and large amounts of unlabeled
+data for classification tasks.
 """
 
 from ._label_propagation import LabelPropagation, LabelSpreading
diff --git a/sklearn/semi_supervised/_label_propagation.py b/sklearn/semi_supervised/_label_propagation.py
index 1ae37d06a46f3..9b8f4b8da7b37 100644
--- a/sklearn/semi_supervised/_label_propagation.py
+++ b/sklearn/semi_supervised/_label_propagation.py
@@ -52,9 +52,8 @@
 Non-Parametric Function Induction in Semi-Supervised Learning. AISTAT 2005
 """
 
-# Authors: Clay Woolam <clay@woolam.org>
-#          Utkarsh Upadhyay <mail@musicallyut.in>
-# License: BSD
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import warnings
 from abc import ABCMeta, abstractmethod
 from numbers import Integral, Real
diff --git a/sklearn/semi_supervised/_self_training.py b/sklearn/semi_supervised/_self_training.py
index 810447c1e6f46..b1ebea1061e4c 100644
--- a/sklearn/semi_supervised/_self_training.py
+++ b/sklearn/semi_supervised/_self_training.py
@@ -1,44 +1,48 @@
 import warnings
 from numbers import Integral, Real
+from warnings import warn
 
 import numpy as np
 
 from ..base import BaseEstimator, MetaEstimatorMixin, _fit_context, clone
-from ..utils import safe_mask
-from ..utils._param_validation import HasMethods, Interval, StrOptions
-from ..utils.metadata_routing import _RoutingNotSupportedMixin
+from ..utils import Bunch, safe_mask
+from ..utils._param_validation import HasMethods, Hidden, Interval, StrOptions
+from ..utils.metadata_routing import (
+    MetadataRouter,
+    MethodMapping,
+    _raise_for_params,
+    _routing_enabled,
+    process_routing,
+)
 from ..utils.metaestimators import available_if
 from ..utils.validation import check_is_fitted
 
 __all__ = ["SelfTrainingClassifier"]
 
-# Authors: Oliver Rausch   <rauscho@ethz.ch>
-#          Patrice Becker  <beckerp@ethz.ch>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 def _estimator_has(attr):
     """Check if we can delegate a method to the underlying estimator.
 
-    First, we check the fitted `base_estimator_` if available, otherwise we check
-    the unfitted `base_estimator`. We raise the original `AttributeError` if
+    First, we check the fitted `estimator_` if available, otherwise we check
+    the unfitted `estimator`. We raise the original `AttributeError` if
     `attr` does not exist. This function is used together with `available_if`.
     """
 
     def check(self):
-        if hasattr(self, "base_estimator_"):
-            getattr(self.base_estimator_, attr)
+        if hasattr(self, "estimator_"):
+            getattr(self.estimator_, attr)
         else:
-            getattr(self.base_estimator, attr)
+            getattr(self.estimator, attr)
 
         return True
 
     return check
 
 
-class SelfTrainingClassifier(
-    _RoutingNotSupportedMixin, MetaEstimatorMixin, BaseEstimator
-):
+class SelfTrainingClassifier(MetaEstimatorMixin, BaseEstimator):
     """Self-training classifier.
 
     This :term:`metaestimator` allows a given supervised classifier to function as a
@@ -53,10 +57,22 @@ class SelfTrainingClassifier(
 
     Parameters
     ----------
+    estimator : estimator object
+        An estimator object implementing `fit` and `predict_proba`.
+        Invoking the `fit` method will fit a clone of the passed estimator,
+        which will be stored in the `estimator_` attribute.
+
+        .. versionadded:: 1.6
+            `estimator` was added to replace `base_estimator`.
+
     base_estimator : estimator object
         An estimator object implementing `fit` and `predict_proba`.
         Invoking the `fit` method will fit a clone of the passed estimator,
-        which will be stored in the `base_estimator_` attribute.
+        which will be stored in the `estimator_` attribute.
+
+        .. deprecated:: 1.6
+            `base_estimator` was deprecated in 1.6 and will be removed in 1.8.
+            Use `estimator` instead.
 
     threshold : float, default=0.75
         The decision threshold for use with `criterion='threshold'`.
@@ -86,12 +102,12 @@ class SelfTrainingClassifier(
 
     Attributes
     ----------
-    base_estimator_ : estimator object
+    estimator_ : estimator object
         The fitted estimator.
 
     classes_ : ndarray or list of ndarray of shape (n_classes,)
         Class labels for each output. (Taken from the trained
-        `base_estimator_`).
+        `estimator_`).
 
     transduction_ : ndarray of shape (n_samples,)
         The labels used for the final fit of the classifier, including
@@ -160,7 +176,13 @@ class SelfTrainingClassifier(
     _parameter_constraints: dict = {
         # We don't require `predic_proba` here to allow passing a meta-estimator
         # that only exposes `predict_proba` after fitting.
-        "base_estimator": [HasMethods(["fit"])],
+        # TODO(1.8) remove None option
+        "estimator": [None, HasMethods(["fit"])],
+        # TODO(1.8) remove
+        "base_estimator": [
+            HasMethods(["fit"]),
+            Hidden(StrOptions({"deprecated"})),
+        ],
         "threshold": [Interval(Real, 0.0, 1.0, closed="left")],
         "criterion": [StrOptions({"threshold", "k_best"})],
         "k_best": [Interval(Integral, 1, None, closed="left")],
@@ -170,25 +192,63 @@ class SelfTrainingClassifier(
 
     def __init__(
         self,
-        base_estimator,
+        estimator=None,
+        base_estimator="deprecated",
         threshold=0.75,
         criterion="threshold",
         k_best=10,
         max_iter=10,
         verbose=False,
     ):
-        self.base_estimator = base_estimator
+        self.estimator = estimator
         self.threshold = threshold
         self.criterion = criterion
         self.k_best = k_best
         self.max_iter = max_iter
         self.verbose = verbose
 
+        # TODO(1.8) remove
+        self.base_estimator = base_estimator
+
+    def _get_estimator(self):
+        """Get the estimator.
+
+        Returns
+        -------
+        estimator_ : estimator object
+            The cloned estimator object.
+        """
+        # TODO(1.8): remove and only keep clone(self.estimator)
+        if self.estimator is None and self.base_estimator != "deprecated":
+            estimator_ = clone(self.base_estimator)
+
+            warn(
+                (
+                    "`base_estimator` has been deprecated in 1.6 and will be removed"
+                    " in 1.8. Please use `estimator` instead."
+                ),
+                FutureWarning,
+            )
+        # TODO(1.8) remove
+        elif self.estimator is None and self.base_estimator == "deprecated":
+            raise ValueError(
+                "You must pass an estimator to SelfTrainingClassifier."
+                " Use `estimator`."
+            )
+        elif self.estimator is not None and self.base_estimator != "deprecated":
+            raise ValueError(
+                "You must pass only one estimator to SelfTrainingClassifier."
+                " Use `estimator`."
+            )
+        else:
+            estimator_ = clone(self.estimator)
+        return estimator_
+
     @_fit_context(
-        # SelfTrainingClassifier.base_estimator is not validated yet
+        # SelfTrainingClassifier.estimator is not validated yet
         prefer_skip_nested_validation=False
     )
-    def fit(self, X, y):
+    def fit(self, X, y, **params):
         """
         Fit self-training classifier using `X`, `y` as training data.
 
@@ -201,19 +261,31 @@ def fit(self, X, y):
             Array representing the labels. Unlabeled samples should have the
             label -1.
 
+        **params : dict
+            Parameters to pass to the underlying estimators.
+
+            .. versionadded:: 1.6
+                Only available if `enable_metadata_routing=True`,
+                which can be set by using
+                ``sklearn.set_config(enable_metadata_routing=True)``.
+                See :ref:`Metadata Routing User Guide <metadata_routing>` for
+                more details.
+
         Returns
         -------
         self : object
             Fitted estimator.
         """
+        _raise_for_params(params, self, "fit")
+
+        self.estimator_ = self._get_estimator()
+
         # we need row slicing support for sparse matrices, but costly finiteness check
         # can be delegated to the base estimator.
         X, y = self._validate_data(
             X, y, accept_sparse=["csr", "csc", "lil", "dok"], force_all_finite=False
         )
 
-        self.base_estimator_ = clone(self.base_estimator)
-
         if y.dtype.kind in ["U", "S"]:
             raise ValueError(
                 "y has dtype string. If you wish to predict on "
@@ -238,6 +310,11 @@ def fit(self, X, y):
                 UserWarning,
             )
 
+        if _routing_enabled():
+            routed_params = process_routing(self, "fit", **params)
+        else:
+            routed_params = Bunch(estimator=Bunch(fit={}))
+
         self.transduction_ = np.copy(y)
         self.labeled_iter_ = np.full_like(y, -1)
         self.labeled_iter_[has_label] = 0
@@ -248,13 +325,15 @@ def fit(self, X, y):
             self.max_iter is None or self.n_iter_ < self.max_iter
         ):
             self.n_iter_ += 1
-            self.base_estimator_.fit(
-                X[safe_mask(X, has_label)], self.transduction_[has_label]
+            self.estimator_.fit(
+                X[safe_mask(X, has_label)],
+                self.transduction_[has_label],
+                **routed_params.estimator.fit,
             )
 
             # Predict on the unlabeled samples
-            prob = self.base_estimator_.predict_proba(X[safe_mask(X, ~has_label)])
-            pred = self.base_estimator_.classes_[np.argmax(prob, axis=1)]
+            prob = self.estimator_.predict_proba(X[safe_mask(X, ~has_label)])
+            pred = self.estimator_.classes_[np.argmax(prob, axis=1)]
             max_proba = np.max(prob, axis=1)
 
             # Select new labeled samples
@@ -292,14 +371,16 @@ def fit(self, X, y):
         if np.all(has_label):
             self.termination_condition_ = "all_labeled"
 
-        self.base_estimator_.fit(
-            X[safe_mask(X, has_label)], self.transduction_[has_label]
+        self.estimator_.fit(
+            X[safe_mask(X, has_label)],
+            self.transduction_[has_label],
+            **routed_params.estimator.fit,
         )
-        self.classes_ = self.base_estimator_.classes_
+        self.classes_ = self.estimator_.classes_
         return self
 
     @available_if(_estimator_has("predict"))
-    def predict(self, X):
+    def predict(self, X, **params):
         """Predict the classes of `X`.
 
         Parameters
@@ -307,22 +388,40 @@ def predict(self, X):
         X : {array-like, sparse matrix} of shape (n_samples, n_features)
             Array representing the data.
 
+        **params : dict of str -> object
+            Parameters to pass to the underlying estimator's ``predict`` method.
+
+            .. versionadded:: 1.6
+                Only available if `enable_metadata_routing=True`,
+                which can be set by using
+                ``sklearn.set_config(enable_metadata_routing=True)``.
+                See :ref:`Metadata Routing User Guide <metadata_routing>` for
+                more details.
+
         Returns
         -------
         y : ndarray of shape (n_samples,)
             Array with predicted labels.
         """
         check_is_fitted(self)
+        _raise_for_params(params, self, "predict")
+
+        if _routing_enabled():
+            # metadata routing is enabled.
+            routed_params = process_routing(self, "predict", **params)
+        else:
+            routed_params = Bunch(estimator=Bunch(predict={}))
+
         X = self._validate_data(
             X,
             accept_sparse=True,
             force_all_finite=False,
             reset=False,
         )
-        return self.base_estimator_.predict(X)
+        return self.estimator_.predict(X, **routed_params.estimator.predict)
 
     @available_if(_estimator_has("predict_proba"))
-    def predict_proba(self, X):
+    def predict_proba(self, X, **params):
         """Predict probability for each possible outcome.
 
         Parameters
@@ -330,45 +429,85 @@ def predict_proba(self, X):
         X : {array-like, sparse matrix} of shape (n_samples, n_features)
             Array representing the data.
 
+        **params : dict of str -> object
+            Parameters to pass to the underlying estimator's
+            ``predict_proba`` method.
+
+            .. versionadded:: 1.6
+                Only available if `enable_metadata_routing=True`,
+                which can be set by using
+                ``sklearn.set_config(enable_metadata_routing=True)``.
+                See :ref:`Metadata Routing User Guide <metadata_routing>` for
+                more details.
+
         Returns
         -------
         y : ndarray of shape (n_samples, n_features)
             Array with prediction probabilities.
         """
         check_is_fitted(self)
+        _raise_for_params(params, self, "predict_proba")
+
+        if _routing_enabled():
+            # metadata routing is enabled.
+            routed_params = process_routing(self, "predict_proba", **params)
+        else:
+            routed_params = Bunch(estimator=Bunch(predict_proba={}))
+
         X = self._validate_data(
             X,
             accept_sparse=True,
             force_all_finite=False,
             reset=False,
         )
-        return self.base_estimator_.predict_proba(X)
+        return self.estimator_.predict_proba(X, **routed_params.estimator.predict_proba)
 
     @available_if(_estimator_has("decision_function"))
-    def decision_function(self, X):
-        """Call decision function of the `base_estimator`.
+    def decision_function(self, X, **params):
+        """Call decision function of the `estimator`.
 
         Parameters
         ----------
         X : {array-like, sparse matrix} of shape (n_samples, n_features)
             Array representing the data.
 
+        **params : dict of str -> object
+            Parameters to pass to the underlying estimator's
+            ``decision_function`` method.
+
+            .. versionadded:: 1.6
+                Only available if `enable_metadata_routing=True`,
+                which can be set by using
+                ``sklearn.set_config(enable_metadata_routing=True)``.
+                See :ref:`Metadata Routing User Guide <metadata_routing>` for
+                more details.
+
         Returns
         -------
         y : ndarray of shape (n_samples, n_features)
-            Result of the decision function of the `base_estimator`.
+            Result of the decision function of the `estimator`.
         """
         check_is_fitted(self)
+        _raise_for_params(params, self, "decision_function")
+
+        if _routing_enabled():
+            # metadata routing is enabled.
+            routed_params = process_routing(self, "decision_function", **params)
+        else:
+            routed_params = Bunch(estimator=Bunch(decision_function={}))
+
         X = self._validate_data(
             X,
             accept_sparse=True,
             force_all_finite=False,
             reset=False,
         )
-        return self.base_estimator_.decision_function(X)
+        return self.estimator_.decision_function(
+            X, **routed_params.estimator.decision_function
+        )
 
     @available_if(_estimator_has("predict_log_proba"))
-    def predict_log_proba(self, X):
+    def predict_log_proba(self, X, **params):
         """Predict log probability for each possible outcome.
 
         Parameters
@@ -376,23 +515,44 @@ def predict_log_proba(self, X):
         X : {array-like, sparse matrix} of shape (n_samples, n_features)
             Array representing the data.
 
+        **params : dict of str -> object
+            Parameters to pass to the underlying estimator's
+            ``predict_log_proba`` method.
+
+            .. versionadded:: 1.6
+                Only available if `enable_metadata_routing=True`,
+                which can be set by using
+                ``sklearn.set_config(enable_metadata_routing=True)``.
+                See :ref:`Metadata Routing User Guide <metadata_routing>` for
+                more details.
+
         Returns
         -------
         y : ndarray of shape (n_samples, n_features)
             Array with log prediction probabilities.
         """
         check_is_fitted(self)
+        _raise_for_params(params, self, "predict_log_proba")
+
+        if _routing_enabled():
+            # metadata routing is enabled.
+            routed_params = process_routing(self, "predict_log_proba", **params)
+        else:
+            routed_params = Bunch(estimator=Bunch(predict_log_proba={}))
+
         X = self._validate_data(
             X,
             accept_sparse=True,
             force_all_finite=False,
             reset=False,
         )
-        return self.base_estimator_.predict_log_proba(X)
+        return self.estimator_.predict_log_proba(
+            X, **routed_params.estimator.predict_log_proba
+        )
 
     @available_if(_estimator_has("score"))
-    def score(self, X, y):
-        """Call score on the `base_estimator`.
+    def score(self, X, y, **params):
+        """Call score on the `estimator`.
 
         Parameters
         ----------
@@ -402,16 +562,64 @@ def score(self, X, y):
         y : array-like of shape (n_samples,)
             Array representing the labels.
 
+        **params : dict of str -> object
+            Parameters to pass to the underlying estimator's ``score`` method.
+
+            .. versionadded:: 1.6
+                Only available if `enable_metadata_routing=True`,
+                which can be set by using
+                ``sklearn.set_config(enable_metadata_routing=True)``.
+                See :ref:`Metadata Routing User Guide <metadata_routing>` for
+                more details.
+
         Returns
         -------
         score : float
-            Result of calling score on the `base_estimator`.
+            Result of calling score on the `estimator`.
         """
         check_is_fitted(self)
+        _raise_for_params(params, self, "score")
+
+        if _routing_enabled():
+            # metadata routing is enabled.
+            routed_params = process_routing(self, "score", **params)
+        else:
+            routed_params = Bunch(estimator=Bunch(score={}))
+
         X = self._validate_data(
             X,
             accept_sparse=True,
             force_all_finite=False,
             reset=False,
         )
-        return self.base_estimator_.score(X, y)
+        return self.estimator_.score(X, y, **routed_params.estimator.score)
+
+    def get_metadata_routing(self):
+        """Get metadata routing of this object.
+
+        Please check :ref:`User Guide <metadata_routing>` on how the routing
+        mechanism works.
+
+        .. versionadded:: 1.6
+
+        Returns
+        -------
+        routing : MetadataRouter
+            A :class:`~sklearn.utils.metadata_routing.MetadataRouter` encapsulating
+            routing information.
+        """
+        router = MetadataRouter(owner=self.__class__.__name__)
+        router.add(
+            estimator=self.estimator,
+            method_mapping=(
+                MethodMapping()
+                .add(callee="fit", caller="fit")
+                .add(callee="score", caller="fit")
+                .add(callee="predict", caller="predict")
+                .add(callee="predict_proba", caller="predict_proba")
+                .add(callee="decision_function", caller="decision_function")
+                .add(callee="predict_log_proba", caller="predict_log_proba")
+                .add(callee="score", caller="score")
+            ),
+        )
+        return router
diff --git a/sklearn/semi_supervised/tests/test_self_training.py b/sklearn/semi_supervised/tests/test_self_training.py
index 2efeb32446f89..02244063994d5 100644
--- a/sklearn/semi_supervised/tests/test_self_training.py
+++ b/sklearn/semi_supervised/tests/test_self_training.py
@@ -12,10 +12,11 @@
 from sklearn.neighbors import KNeighborsClassifier
 from sklearn.semi_supervised import SelfTrainingClassifier
 from sklearn.svm import SVC
+from sklearn.tests.test_pipeline import SimpleEstimator
 from sklearn.tree import DecisionTreeClassifier
 
-# Author: Oliver Rausch <rauscho@ethz.ch>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # load the iris dataset and randomly permute it
 iris = load_iris()
@@ -43,25 +44,25 @@ def test_warns_k_best():
 
 
 @pytest.mark.parametrize(
-    "base_estimator",
+    "estimator",
     [KNeighborsClassifier(), SVC(gamma="scale", probability=True, random_state=0)],
 )
 @pytest.mark.parametrize("selection_crit", ["threshold", "k_best"])
-def test_classification(base_estimator, selection_crit):
+def test_classification(estimator, selection_crit):
     # Check classification for various parameter settings.
     # Also assert that predictions for strings and numerical labels are equal.
     # Also test for multioutput classification
     threshold = 0.75
     max_iter = 10
     st = SelfTrainingClassifier(
-        base_estimator, max_iter=max_iter, threshold=threshold, criterion=selection_crit
+        estimator, max_iter=max_iter, threshold=threshold, criterion=selection_crit
     )
     st.fit(X_train, y_train_missing_labels)
     pred = st.predict(X_test)
     proba = st.predict_proba(X_test)
 
     st_string = SelfTrainingClassifier(
-        base_estimator, max_iter=max_iter, criterion=selection_crit, threshold=threshold
+        estimator, max_iter=max_iter, criterion=selection_crit, threshold=threshold
     )
     st_string.fit(X_train, y_train_missing_strings)
     pred_string = st_string.predict(X_test)
@@ -112,15 +113,15 @@ def test_k_best():
 
 
 def test_sanity_classification():
-    base_estimator = SVC(gamma="scale", probability=True)
-    base_estimator.fit(X_train[n_labeled_samples:], y_train[n_labeled_samples:])
+    estimator = SVC(gamma="scale", probability=True)
+    estimator.fit(X_train[n_labeled_samples:], y_train[n_labeled_samples:])
 
-    st = SelfTrainingClassifier(base_estimator)
+    st = SelfTrainingClassifier(estimator)
     st.fit(X_train, y_train_missing_labels)
 
-    pred1, pred2 = base_estimator.predict(X_test), st.predict(X_test)
+    pred1, pred2 = estimator.predict(X_test), st.predict(X_test)
     assert not np.array_equal(pred1, pred2)
-    score_supervised = accuracy_score(base_estimator.predict(X_test), y_test)
+    score_supervised = accuracy_score(estimator.predict(X_test), y_test)
     score_self_training = accuracy_score(st.predict(X_test), y_test)
 
     assert score_self_training > score_supervised
@@ -137,21 +138,21 @@ def test_none_iter():
 
 
 @pytest.mark.parametrize(
-    "base_estimator",
+    "estimator",
     [KNeighborsClassifier(), SVC(gamma="scale", probability=True, random_state=0)],
 )
 @pytest.mark.parametrize("y", [y_train_missing_labels, y_train_missing_strings])
-def test_zero_iterations(base_estimator, y):
+def test_zero_iterations(estimator, y):
     # Check classification for zero iterations.
     # Fitting a SelfTrainingClassifier with zero iterations should give the
     # same results as fitting a supervised classifier.
     # This also asserts that string arrays work as expected.
 
-    clf1 = SelfTrainingClassifier(base_estimator, max_iter=0)
+    clf1 = SelfTrainingClassifier(estimator, max_iter=0)
 
     clf1.fit(X_train, y)
 
-    clf2 = base_estimator.fit(X_train[:n_labeled_samples], y[:n_labeled_samples])
+    clf2 = estimator.fit(X_train[:n_labeled_samples], y[:n_labeled_samples])
 
     assert_array_equal(clf1.predict(X_test), clf2.predict(X_test))
     assert clf1.termination_condition_ == "max_iter"
@@ -280,14 +281,14 @@ def test_k_best_selects_best():
         assert row in added_by_st
 
 
-def test_base_estimator_meta_estimator():
+def test_estimator_meta_estimator():
     # Check that a meta-estimator relying on an estimator implementing
     # `predict_proba` will work even if it does not expose this method before being
     # fitted.
     # Non-regression test for:
     # https://github.com/scikit-learn/scikit-learn/issues/19119
 
-    base_estimator = StackingClassifier(
+    estimator = StackingClassifier(
         estimators=[
             ("svc_1", SVC(probability=True)),
             ("svc_2", SVC(probability=True)),
@@ -296,12 +297,12 @@ def test_base_estimator_meta_estimator():
         cv=2,
     )
 
-    assert hasattr(base_estimator, "predict_proba")
-    clf = SelfTrainingClassifier(base_estimator=base_estimator)
+    assert hasattr(estimator, "predict_proba")
+    clf = SelfTrainingClassifier(estimator=estimator)
     clf.fit(X_train, y_train_missing_labels)
     clf.predict_proba(X_test)
 
-    base_estimator = StackingClassifier(
+    estimator = StackingClassifier(
         estimators=[
             ("svc_1", SVC(probability=False)),
             ("svc_2", SVC(probability=False)),
@@ -310,14 +311,14 @@ def test_base_estimator_meta_estimator():
         cv=2,
     )
 
-    assert not hasattr(base_estimator, "predict_proba")
-    clf = SelfTrainingClassifier(base_estimator=base_estimator)
+    assert not hasattr(estimator, "predict_proba")
+    clf = SelfTrainingClassifier(estimator=estimator)
     with pytest.raises(AttributeError):
         clf.fit(X_train, y_train_missing_labels)
 
 
 def test_self_training_estimator_attribute_error():
-    """Check that we raise the proper AttributeErrors when the `base_estimator`
+    """Check that we raise the proper AttributeErrors when the `estimator`
     does not implement the `predict_proba` method, which is called from within
     `fit`, or `decision_function`, which is decorated with `available_if`.
 
@@ -327,15 +328,15 @@ def test_self_training_estimator_attribute_error():
     # `SVC` with `probability=False` does not implement 'predict_proba' that
     # is required internally in `fit` of `SelfTrainingClassifier`. We expect
     # an AttributeError to be raised.
-    base_estimator = SVC(probability=False, gamma="scale")
-    self_training = SelfTrainingClassifier(base_estimator)
+    estimator = SVC(probability=False, gamma="scale")
+    self_training = SelfTrainingClassifier(estimator)
 
     with pytest.raises(AttributeError, match="has no attribute 'predict_proba'"):
         self_training.fit(X_train, y_train_missing_labels)
 
     # `DecisionTreeClassifier` does not implement 'decision_function' and
     # should raise an AttributeError
-    self_training = SelfTrainingClassifier(base_estimator=DecisionTreeClassifier())
+    self_training = SelfTrainingClassifier(estimator=DecisionTreeClassifier())
 
     outer_msg = "This 'SelfTrainingClassifier' has no attribute 'decision_function'"
     inner_msg = "'DecisionTreeClassifier' object has no attribute 'decision_function'"
@@ -343,3 +344,52 @@ def test_self_training_estimator_attribute_error():
         self_training.fit(X_train, y_train_missing_labels).decision_function(X_train)
     assert isinstance(exec_info.value.__cause__, AttributeError)
     assert inner_msg in str(exec_info.value.__cause__)
+
+
+# TODO(1.8): remove in 1.8
+def test_deprecation_warning_base_estimator():
+    warn_msg = "`base_estimator` has been deprecated in 1.6 and will be removed"
+    with pytest.warns(FutureWarning, match=warn_msg):
+        SelfTrainingClassifier(base_estimator=DecisionTreeClassifier()).fit(
+            X_train, y_train_missing_labels
+        )
+
+    error_msg = "You must pass an estimator to SelfTrainingClassifier"
+    with pytest.raises(ValueError, match=error_msg):
+        SelfTrainingClassifier().fit(X_train, y_train_missing_labels)
+
+    error_msg = "You must pass only one estimator to SelfTrainingClassifier."
+    with pytest.raises(ValueError, match=error_msg):
+        SelfTrainingClassifier(
+            base_estimator=DecisionTreeClassifier(), estimator=DecisionTreeClassifier()
+        ).fit(X_train, y_train_missing_labels)
+
+
+# Metadata routing tests
+# =================================================================
+
+
+@pytest.mark.filterwarnings("ignore:y contains no unlabeled samples:UserWarning")
+@pytest.mark.parametrize(
+    "method", ["decision_function", "predict_log_proba", "predict_proba", "predict"]
+)
+def test_routing_passed_metadata_not_supported(method):
+    """Test that the right error message is raised when metadata is passed while
+    not supported when `enable_metadata_routing=False`."""
+    est = SelfTrainingClassifier(estimator=SimpleEstimator())
+    with pytest.raises(
+        ValueError, match="is only supported if enable_metadata_routing=True"
+    ):
+        est.fit([[1], [1]], [1, 1], sample_weight=[1], prop="a")
+
+    est = SelfTrainingClassifier(estimator=SimpleEstimator())
+    with pytest.raises(
+        ValueError, match="is only supported if enable_metadata_routing=True"
+    ):
+        # make sure that the estimator thinks it is already fitted
+        est.fitted_params_ = True
+        getattr(est, method)([[1]], sample_weight=[1], prop="a")
+
+
+# End of routing tests
+# ====================
diff --git a/sklearn/svm/__init__.py b/sklearn/svm/__init__.py
index 0d64ce24cdd63..d9d2d33897863 100644
--- a/sklearn/svm/__init__.py
+++ b/sklearn/svm/__init__.py
@@ -1,14 +1,10 @@
-"""
-The :mod:`sklearn.svm` module includes Support Vector Machine algorithms.
-"""
+"""Support vector machine algorithms."""
 
 # See http://scikit-learn.sourceforge.net/modules/svm.html for complete
 # documentation.
 
-# Author: Fabian Pedregosa <fabian.pedregosa@inria.fr> with help from
-#         the scikit-learn community. LibSVM and LibLinear are copyright
-#         of their respective owners.
-# License: BSD 3 clause (C) INRIA 2010
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from ._bounds import l1_min_c
 from ._classes import SVC, SVR, LinearSVC, LinearSVR, NuSVC, NuSVR, OneClassSVM
diff --git a/sklearn/svm/_bounds.py b/sklearn/svm/_bounds.py
index b02720637c03b..c8dc91ad772d7 100644
--- a/sklearn/svm/_bounds.py
+++ b/sklearn/svm/_bounds.py
@@ -1,7 +1,7 @@
 """Determination of parameter bounds"""
 
-# Author: Paolo Losi
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from numbers import Real
 
diff --git a/sklearn/svm/_classes.py b/sklearn/svm/_classes.py
index 00854f47d9a84..5b547fcb98cd6 100644
--- a/sklearn/svm/_classes.py
+++ b/sklearn/svm/_classes.py
@@ -1,11 +1,10 @@
-import warnings
 from numbers import Integral, Real
 
 import numpy as np
 
 from ..base import BaseEstimator, OutlierMixin, RegressorMixin, _fit_context
 from ..linear_model._base import LinearClassifierMixin, LinearModel, SparseCoefMixin
-from ..utils._param_validation import Hidden, Interval, StrOptions
+from ..utils._param_validation import Interval, StrOptions
 from ..utils.multiclass import check_classification_targets
 from ..utils.validation import _num_samples
 from ._base import BaseLibSVM, BaseSVC, _fit_liblinear, _get_liblinear_solver_type
@@ -26,16 +25,6 @@ def _validate_dual_parameter(dual, loss, penalty, multi_class, X):
                 return False
             except ValueError:  # primal not supported by the combination
                 return True
-    # TODO 1.5
-    elif dual == "warn":
-        warnings.warn(
-            (
-                "The default value of `dual` will change from `True` to `'auto'` in"
-                " 1.5. Set the value of `dual` explicitly to suppress the warning."
-            ),
-            FutureWarning,
-        )
-        return True
     else:
         return dual
 
@@ -70,7 +59,7 @@ class LinearSVC(LinearClassifierMixin, SparseCoefMixin, BaseEstimator):
         square of the hinge loss. The combination of ``penalty='l1'``
         and ``loss='hinge'`` is not supported.
 
-    dual : "auto" or bool, default=True
+    dual : "auto" or bool, default="auto"
         Select the algorithm to either solve the dual or primal
         optimization problem. Prefer dual=False when n_samples > n_features.
         `dual="auto"` will choose the value of the parameter automatically,
@@ -89,6 +78,9 @@ class LinearSVC(LinearClassifierMixin, SparseCoefMixin, BaseEstimator):
     C : float, default=1.0
         Regularization parameter. The strength of the regularization is
         inversely proportional to C. Must be strictly positive.
+        For an intuitive visualization of the effects of scaling
+        the regularization parameter C, see
+        :ref:`sphx_glr_auto_examples_svm_plot_svm_scale_c.py`.
 
     multi_class : {'ovr', 'crammer_singer'}, default='ovr'
         Determines the multi-class strategy if `y` contains more than
@@ -224,10 +216,10 @@ class LinearSVC(LinearClassifierMixin, SparseCoefMixin, BaseEstimator):
     >>> from sklearn.datasets import make_classification
     >>> X, y = make_classification(n_features=4, random_state=0)
     >>> clf = make_pipeline(StandardScaler(),
-    ...                     LinearSVC(dual="auto", random_state=0, tol=1e-5))
+    ...                     LinearSVC(random_state=0, tol=1e-5))
     >>> clf.fit(X, y)
     Pipeline(steps=[('standardscaler', StandardScaler()),
-                    ('linearsvc', LinearSVC(dual='auto', random_state=0, tol=1e-05))])
+                    ('linearsvc', LinearSVC(random_state=0, tol=1e-05))])
 
     >>> print(clf.named_steps['linearsvc'].coef_)
     [[0.141...   0.526... 0.679... 0.493...]]
@@ -241,7 +233,7 @@ class LinearSVC(LinearClassifierMixin, SparseCoefMixin, BaseEstimator):
     _parameter_constraints: dict = {
         "penalty": [StrOptions({"l1", "l2"})],
         "loss": [StrOptions({"hinge", "squared_hinge"})],
-        "dual": ["boolean", StrOptions({"auto"}), Hidden(StrOptions({"warn"}))],
+        "dual": ["boolean", StrOptions({"auto"})],
         "tol": [Interval(Real, 0.0, None, closed="neither")],
         "C": [Interval(Real, 0.0, None, closed="neither")],
         "multi_class": [StrOptions({"ovr", "crammer_singer"})],
@@ -258,7 +250,7 @@ def __init__(
         penalty="l2",
         loss="squared_hinge",
         *,
-        dual="warn",
+        dual="auto",
         tol=1e-4,
         C=1.0,
         multi_class="ovr",
@@ -423,7 +415,7 @@ class LinearSVR(RegressorMixin, LinearModel):
         `intercept_scaling`. This scaling allows the intercept term to have a
         different regularization behavior compared to the other features.
 
-    dual : "auto" or bool, default=True
+    dual : "auto" or bool, default="auto"
         Select the algorithm to either solve the dual or primal
         optimization problem. Prefer dual=False when n_samples > n_features.
         `dual="auto"` will choose the value of the parameter automatically,
@@ -498,10 +490,10 @@ class LinearSVR(RegressorMixin, LinearModel):
     >>> from sklearn.datasets import make_regression
     >>> X, y = make_regression(n_features=4, random_state=0)
     >>> regr = make_pipeline(StandardScaler(),
-    ...                      LinearSVR(dual="auto", random_state=0, tol=1e-5))
+    ...                      LinearSVR(random_state=0, tol=1e-5))
     >>> regr.fit(X, y)
     Pipeline(steps=[('standardscaler', StandardScaler()),
-                    ('linearsvr', LinearSVR(dual='auto', random_state=0, tol=1e-05))])
+                    ('linearsvr', LinearSVR(random_state=0, tol=1e-05))])
 
     >>> print(regr.named_steps['linearsvr'].coef_)
     [18.582... 27.023... 44.357... 64.522...]
@@ -518,7 +510,7 @@ class LinearSVR(RegressorMixin, LinearModel):
         "loss": [StrOptions({"epsilon_insensitive", "squared_epsilon_insensitive"})],
         "fit_intercept": ["boolean"],
         "intercept_scaling": [Interval(Real, 0, None, closed="neither")],
-        "dual": ["boolean", StrOptions({"auto"}), Hidden(StrOptions({"warn"}))],
+        "dual": ["boolean", StrOptions({"auto"})],
         "verbose": ["verbose"],
         "random_state": ["random_state"],
         "max_iter": [Interval(Integral, 0, None, closed="left")],
@@ -533,7 +525,7 @@ def __init__(
         loss="epsilon_insensitive",
         fit_intercept=True,
         intercept_scaling=1.0,
-        dual="warn",
+        dual="auto",
         verbose=0,
         random_state=None,
         max_iter=1000,
@@ -650,7 +642,9 @@ class SVC(BaseSVC):
     C : float, default=1.0
         Regularization parameter. The strength of the regularization is
         inversely proportional to C. Must be strictly positive. The penalty
-        is a squared l2 penalty.
+        is a squared l2 penalty. For an intuitive visualization of the effects
+        of scaling the regularization parameter C, see
+        :ref:`sphx_glr_auto_examples_svm_plot_svm_scale_c.py`.
 
     kernel : {'linear', 'poly', 'rbf', 'sigmoid', 'precomputed'} or callable,  \
         default='rbf'
@@ -1226,7 +1220,9 @@ class SVR(RegressorMixin, BaseLibSVM):
     C : float, default=1.0
         Regularization parameter. The strength of the regularization is
         inversely proportional to C. Must be strictly positive.
-        The penalty is a squared l2 penalty.
+        The penalty is a squared l2. For an intuitive visualization of the
+        effects of scaling the regularization parameter C, see
+        :ref:`sphx_glr_auto_examples_svm_plot_svm_scale_c.py`.
 
     epsilon : float, default=0.1
          Epsilon in the epsilon-SVR model. It specifies the epsilon-tube
@@ -1396,7 +1392,9 @@ class NuSVR(RegressorMixin, BaseLibSVM):
         default 0.5 will be taken.
 
     C : float, default=1.0
-        Penalty parameter C of the error term.
+        Penalty parameter C of the error term. For an intuitive visualization
+        of the effects of scaling the regularization parameter C, see
+        :ref:`sphx_glr_auto_examples_svm_plot_svm_scale_c.py`.
 
     kernel : {'linear', 'poly', 'rbf', 'sigmoid', 'precomputed'} or callable,  \
         default='rbf'
diff --git a/sklearn/svm/meson.build b/sklearn/svm/meson.build
index 55c51da12ae42..8372364c429cd 100644
--- a/sklearn/svm/meson.build
+++ b/sklearn/svm/meson.build
@@ -19,7 +19,7 @@ libsvm_skl = static_library(
 
 py.extension_module(
   '_libsvm',
-  ['_libsvm.pyx'],
+  ['_libsvm.pyx', utils_cython_tree],
   include_directories: [newrand_include, libsvm_include],
   link_with: libsvm_skl,
   cython_args: cython_args,
@@ -29,7 +29,7 @@ py.extension_module(
 
 py.extension_module(
   '_libsvm_sparse',
-  ['_libsvm_sparse.pyx'],
+  ['_libsvm_sparse.pyx', utils_cython_tree],
   include_directories: [newrand_include, libsvm_include],
   link_with: libsvm_skl,
   cython_args: cython_args,
@@ -44,7 +44,7 @@ liblinear_skl = static_library(
 
 py.extension_module(
   '_liblinear',
-  ['_liblinear.pyx'],
+  ['_liblinear.pyx', utils_cython_tree],
   include_directories: [newrand_include, liblinear_include],
   link_with: [liblinear_skl],
   cython_args: cython_args,
diff --git a/sklearn/svm/tests/test_sparse.py b/sklearn/svm/tests/test_sparse.py
index a7e517fdce893..59fede29f359c 100644
--- a/sklearn/svm/tests/test_sparse.py
+++ b/sklearn/svm/tests/test_sparse.py
@@ -242,8 +242,8 @@ def test_linearsvc(lil_container, dok_container):
     X_sp = lil_container(X)
     X2_sp = dok_container(X2)
 
-    clf = svm.LinearSVC(dual="auto", random_state=0).fit(X, Y)
-    sp_clf = svm.LinearSVC(dual="auto", random_state=0).fit(X_sp, Y)
+    clf = svm.LinearSVC(random_state=0).fit(X, Y)
+    sp_clf = svm.LinearSVC(random_state=0).fit(X_sp, Y)
 
     assert sp_clf.fit_intercept
 
@@ -264,8 +264,8 @@ def test_linearsvc_iris(csr_container):
     # Test the sparse LinearSVC with the iris dataset
     iris_data_sp = csr_container(iris.data)
 
-    sp_clf = svm.LinearSVC(dual="auto", random_state=0).fit(iris_data_sp, iris.target)
-    clf = svm.LinearSVC(dual="auto", random_state=0).fit(iris.data, iris.target)
+    sp_clf = svm.LinearSVC(random_state=0).fit(iris_data_sp, iris.target)
+    clf = svm.LinearSVC(random_state=0).fit(iris.data, iris.target)
 
     assert clf.fit_intercept == sp_clf.fit_intercept
 
@@ -295,7 +295,7 @@ def test_weight(csr_container):
     X_ = csr_container(X_)
     for clf in (
         linear_model.LogisticRegression(),
-        svm.LinearSVC(dual="auto", random_state=0),
+        svm.LinearSVC(random_state=0),
         svm.SVC(),
     ):
         clf.set_params(class_weight={0: 5})
diff --git a/sklearn/svm/tests/test_svm.py b/sklearn/svm/tests/test_svm.py
index f728136b0f98c..2735dc0651d89 100644
--- a/sklearn/svm/tests/test_svm.py
+++ b/sklearn/svm/tests/test_svm.py
@@ -4,8 +4,6 @@
 TODO: remove hard coded numerical results when possible
 """
 
-import re
-
 import numpy as np
 import pytest
 from numpy.testing import (
@@ -227,8 +225,8 @@ def test_svr():
         svm.NuSVR(kernel="linear", nu=0.4, C=1.0),
         svm.NuSVR(kernel="linear", nu=0.4, C=10.0),
         svm.SVR(kernel="linear", C=10.0),
-        svm.LinearSVR(dual="auto", C=10.0),
-        svm.LinearSVR(dual="auto", C=10.0),
+        svm.LinearSVR(C=10.0),
+        svm.LinearSVR(C=10.0),
     ):
         clf.fit(diabetes.data, diabetes.target)
         assert clf.score(diabetes.data, diabetes.target) > 0.02
@@ -236,14 +234,14 @@ def test_svr():
     # non-regression test; previously, BaseLibSVM would check that
     # len(np.unique(y)) < 2, which must only be done for SVC
     svm.SVR().fit(diabetes.data, np.ones(len(diabetes.data)))
-    svm.LinearSVR(dual="auto").fit(diabetes.data, np.ones(len(diabetes.data)))
+    svm.LinearSVR().fit(diabetes.data, np.ones(len(diabetes.data)))
 
 
 def test_linearsvr():
     # check that SVR(kernel='linear') and LinearSVC() give
     # comparable results
     diabetes = datasets.load_diabetes()
-    lsvr = svm.LinearSVR(C=1e3, dual="auto").fit(diabetes.data, diabetes.target)
+    lsvr = svm.LinearSVR(C=1e3).fit(diabetes.data, diabetes.target)
     score1 = lsvr.score(diabetes.data, diabetes.target)
 
     svr = svm.SVR(kernel="linear", C=1e3).fit(diabetes.data, diabetes.target)
@@ -260,12 +258,12 @@ def test_linearsvr_fit_sampleweight():
     diabetes = datasets.load_diabetes()
     n_samples = len(diabetes.target)
     unit_weight = np.ones(n_samples)
-    lsvr = svm.LinearSVR(dual="auto", C=1e3, tol=1e-12, max_iter=10000).fit(
+    lsvr = svm.LinearSVR(C=1e3, tol=1e-12, max_iter=10000).fit(
         diabetes.data, diabetes.target, sample_weight=unit_weight
     )
     score1 = lsvr.score(diabetes.data, diabetes.target)
 
-    lsvr_no_weight = svm.LinearSVR(dual="auto", C=1e3, tol=1e-12, max_iter=10000).fit(
+    lsvr_no_weight = svm.LinearSVR(C=1e3, tol=1e-12, max_iter=10000).fit(
         diabetes.data, diabetes.target
     )
     score2 = lsvr_no_weight.score(diabetes.data, diabetes.target)
@@ -279,7 +277,7 @@ def test_linearsvr_fit_sampleweight():
     # X = X1 repeated n1 times, X2 repeated n2 times and so forth
     random_state = check_random_state(0)
     random_weight = random_state.randint(0, 10, n_samples)
-    lsvr_unflat = svm.LinearSVR(dual="auto", C=1e3, tol=1e-12, max_iter=10000).fit(
+    lsvr_unflat = svm.LinearSVR(C=1e3, tol=1e-12, max_iter=10000).fit(
         diabetes.data, diabetes.target, sample_weight=random_weight
     )
     score3 = lsvr_unflat.score(
@@ -288,9 +286,7 @@ def test_linearsvr_fit_sampleweight():
 
     X_flat = np.repeat(diabetes.data, random_weight, axis=0)
     y_flat = np.repeat(diabetes.target, random_weight, axis=0)
-    lsvr_flat = svm.LinearSVR(dual="auto", C=1e3, tol=1e-12, max_iter=10000).fit(
-        X_flat, y_flat
-    )
+    lsvr_flat = svm.LinearSVR(C=1e3, tol=1e-12, max_iter=10000).fit(X_flat, y_flat)
     score4 = lsvr_flat.score(X_flat, y_flat)
 
     assert_almost_equal(score3, score4, 2)
@@ -490,7 +486,7 @@ def test_weight():
 
     for clf in (
         linear_model.LogisticRegression(),
-        svm.LinearSVC(dual="auto", random_state=0),
+        svm.LinearSVC(random_state=0),
         svm.SVC(),
     ):
         clf.set_params(class_weight={0: 0.1, 1: 10})
@@ -667,7 +663,7 @@ def test_auto_weight():
 
     for clf in (
         svm.SVC(kernel="linear"),
-        svm.LinearSVC(dual="auto", random_state=0),
+        svm.LinearSVC(random_state=0),
         LogisticRegression(),
     ):
         # check that score is better when class='balanced' is set.
@@ -690,7 +686,7 @@ def test_bad_input(lil_container):
         svm.SVC().fit(X, Y2)
 
     # Test with arrays that are non-contiguous.
-    for clf in (svm.SVC(), svm.LinearSVC(dual="auto", random_state=0)):
+    for clf in (svm.SVC(), svm.LinearSVC(random_state=0)):
         Xf = np.asfortranarray(X)
         assert not Xf.flags["C_CONTIGUOUS"]
         yf = np.ascontiguousarray(np.tile(Y, (2, 1)).T)
@@ -790,7 +786,7 @@ def test_linearsvc_parameters(loss, penalty, dual):
 
 def test_linearsvc():
     # Test basic routines using LinearSVC
-    clf = svm.LinearSVC(dual="auto", random_state=0).fit(X, Y)
+    clf = svm.LinearSVC(random_state=0).fit(X, Y)
 
     # by default should have intercept
     assert clf.fit_intercept
@@ -821,8 +817,8 @@ def test_linearsvc():
 
 def test_linearsvc_crammer_singer():
     # Test LinearSVC with crammer_singer multi-class svm
-    ovr_clf = svm.LinearSVC(dual="auto", random_state=0).fit(iris.data, iris.target)
-    cs_clf = svm.LinearSVC(dual="auto", multi_class="crammer_singer", random_state=0)
+    ovr_clf = svm.LinearSVC(random_state=0).fit(iris.data, iris.target)
+    cs_clf = svm.LinearSVC(multi_class="crammer_singer", random_state=0)
     cs_clf.fit(iris.data, iris.target)
 
     # similar prediction for ovr and crammer-singer:
@@ -844,10 +840,10 @@ def test_linearsvc_fit_sampleweight():
     # check correct result when sample_weight is 1
     n_samples = len(X)
     unit_weight = np.ones(n_samples)
-    clf = svm.LinearSVC(dual="auto", random_state=0).fit(X, Y)
-    clf_unitweight = svm.LinearSVC(
-        dual="auto", random_state=0, tol=1e-12, max_iter=1000
-    ).fit(X, Y, sample_weight=unit_weight)
+    clf = svm.LinearSVC(random_state=0).fit(X, Y)
+    clf_unitweight = svm.LinearSVC(random_state=0, tol=1e-12, max_iter=1000).fit(
+        X, Y, sample_weight=unit_weight
+    )
 
     # check if same as sample_weight=None
     assert_array_equal(clf_unitweight.predict(T), clf.predict(T))
@@ -858,17 +854,17 @@ def test_linearsvc_fit_sampleweight():
 
     random_state = check_random_state(0)
     random_weight = random_state.randint(0, 10, n_samples)
-    lsvc_unflat = svm.LinearSVC(
-        dual="auto", random_state=0, tol=1e-12, max_iter=1000
-    ).fit(X, Y, sample_weight=random_weight)
+    lsvc_unflat = svm.LinearSVC(random_state=0, tol=1e-12, max_iter=1000).fit(
+        X, Y, sample_weight=random_weight
+    )
 
     pred1 = lsvc_unflat.predict(T)
 
     X_flat = np.repeat(X, random_weight, axis=0)
     y_flat = np.repeat(Y, random_weight, axis=0)
-    lsvc_flat = svm.LinearSVC(
-        dual="auto", random_state=0, tol=1e-12, max_iter=1000
-    ).fit(X_flat, y_flat)
+    lsvc_flat = svm.LinearSVC(random_state=0, tol=1e-12, max_iter=1000).fit(
+        X_flat, y_flat
+    )
     pred2 = lsvc_flat.predict(T)
 
     assert_array_equal(pred1, pred2)
@@ -882,7 +878,6 @@ def test_crammer_singer_binary():
     for fit_intercept in (True, False):
         acc = (
             svm.LinearSVC(
-                dual="auto",
                 fit_intercept=fit_intercept,
                 multi_class="crammer_singer",
                 random_state=0,
@@ -897,7 +892,7 @@ def test_linearsvc_iris():
     # Test that LinearSVC gives plausible predictions on the iris dataset
     # Also, test symbolic class names (classes_).
     target = iris.target_names[iris.target]
-    clf = svm.LinearSVC(dual="auto", random_state=0).fit(iris.data, target)
+    clf = svm.LinearSVC(random_state=0).fit(iris.data, target)
     assert set(clf.classes_) == set(iris.target_names)
     assert np.mean(clf.predict(iris.data) == target) > 0.8
 
@@ -945,7 +940,7 @@ def test_dense_liblinear_intercept_handling(classifier=svm.LinearSVC):
 
 def test_liblinear_set_coef():
     # multi-class case
-    clf = svm.LinearSVC(dual="auto").fit(iris.data, iris.target)
+    clf = svm.LinearSVC().fit(iris.data, iris.target)
     values = clf.decision_function(iris.data)
     clf.coef_ = clf.coef_.copy()
     clf.intercept_ = clf.intercept_.copy()
@@ -956,7 +951,7 @@ def test_liblinear_set_coef():
     X = [[2, 1], [3, 1], [1, 3], [2, 3]]
     y = [0, 0, 1, 1]
 
-    clf = svm.LinearSVC(dual="auto").fit(X, y)
+    clf = svm.LinearSVC().fit(X, y)
     values = clf.decision_function(X)
     clf.coef_ = clf.coef_.copy()
     clf.intercept_ = clf.intercept_.copy()
@@ -988,7 +983,7 @@ def test_linearsvc_verbose():
     os.dup2(os.pipe()[1], 1)  # replace it
 
     # actual call
-    clf = svm.LinearSVC(dual="auto", verbose=1)
+    clf = svm.LinearSVC(verbose=1)
     clf.fit(X, Y)
 
     # stdout: restore
@@ -1072,7 +1067,7 @@ def test_consistent_proba():
 def test_linear_svm_convergence_warnings():
     # Test that warnings are raised if model does not converge
 
-    lsvc = svm.LinearSVC(dual="auto", random_state=0, max_iter=2)
+    lsvc = svm.LinearSVC(random_state=0, max_iter=2)
     warning_msg = "Liblinear failed to converge, increase the number of iterations."
     with pytest.warns(ConvergenceWarning, match=warning_msg):
         lsvc.fit(X, Y)
@@ -1081,7 +1076,7 @@ def test_linear_svm_convergence_warnings():
     assert isinstance(lsvc.n_iter_, int)
     assert lsvc.n_iter_ == 2
 
-    lsvr = svm.LinearSVR(dual="auto", random_state=0, max_iter=2)
+    lsvr = svm.LinearSVR(random_state=0, max_iter=2)
     with pytest.warns(ConvergenceWarning, match=warning_msg):
         lsvr.fit(iris.data, iris.target)
     assert isinstance(lsvr.n_iter_, int)
@@ -1097,7 +1092,7 @@ def test_svr_coef_sign():
     for svr in [
         svm.SVR(kernel="linear"),
         svm.NuSVR(kernel="linear"),
-        svm.LinearSVR(dual="auto"),
+        svm.LinearSVR(),
     ]:
         svr.fit(X, y)
         assert_array_almost_equal(
@@ -1108,7 +1103,7 @@ def test_svr_coef_sign():
 def test_lsvc_intercept_scaling_zero():
     # Test that intercept_scaling is ignored when fit_intercept is False
 
-    lsvc = svm.LinearSVC(dual="auto", fit_intercept=False)
+    lsvc = svm.LinearSVC(fit_intercept=False)
     lsvc.fit(X, Y)
     assert lsvc.intercept_ == 0.0
 
@@ -1398,18 +1393,6 @@ def test_n_iter_libsvm(estimator, expected_n_iter_type, dataset):
         assert n_iter.shape == (n_classes * (n_classes - 1) // 2,)
 
 
-# TODO(1.5): Remove
-@pytest.mark.parametrize("Estimator", [LinearSVR, LinearSVC])
-def test_dual_auto_deprecation_warning(Estimator):
-    svm = Estimator()
-    msg = (
-        "The default value of `dual` will change from `True` to `'auto'` in"
-        " 1.5. Set the value of `dual` explicitly to suppress the warning."
-    )
-    with pytest.warns(FutureWarning, match=re.escape(msg)):
-        svm.fit(X, Y)
-
-
 @pytest.mark.parametrize("loss", ["squared_hinge", "squared_epsilon_insensitive"])
 def test_dual_auto(loss):
     # OvR, L2, N > M (6,2)
diff --git a/sklearn/tests/metadata_routing_common.py b/sklearn/tests/metadata_routing_common.py
index 3df47d3f8dd4e..5fffec8fccecf 100644
--- a/sklearn/tests/metadata_routing_common.py
+++ b/sklearn/tests/metadata_routing_common.py
@@ -1,3 +1,5 @@
+import inspect
+from collections import defaultdict
 from functools import partial
 
 import numpy as np
@@ -19,31 +21,35 @@
 )
 from sklearn.utils.metadata_routing import (
     MetadataRouter,
+    MethodMapping,
     process_routing,
 )
 from sklearn.utils.multiclass import _check_partial_fit_first_call
 
 
-def record_metadata(obj, method, record_default=True, **kwargs):
-    """Utility function to store passed metadata to a method.
+def record_metadata(obj, record_default=True, **kwargs):
+    """Utility function to store passed metadata to a method of obj.
 
     If record_default is False, kwargs whose values are "default" are skipped.
     This is so that checks on keyword arguments whose default was not changed
     are skipped.
 
     """
+    stack = inspect.stack()
+    callee = stack[1].function
+    caller = stack[2].function
     if not hasattr(obj, "_records"):
-        obj._records = {}
+        obj._records = defaultdict(lambda: defaultdict(list))
     if not record_default:
         kwargs = {
             key: val
             for key, val in kwargs.items()
             if not isinstance(val, str) or (val != "default")
         }
-    obj._records[method] = kwargs
+    obj._records[callee][caller].append(kwargs)
 
 
-def check_recorded_metadata(obj, method, split_params=tuple(), **kwargs):
+def check_recorded_metadata(obj, method, parent, split_params=tuple(), **kwargs):
     """Check whether the expected metadata is passed to the object's method.
 
     Parameters
@@ -51,28 +57,39 @@ def check_recorded_metadata(obj, method, split_params=tuple(), **kwargs):
     obj : estimator object
         sub-estimator to check routed params for
     method : str
-        sub-estimator's method where metadata is routed to
+        sub-estimator's method where metadata is routed to, or otherwise in
+        the context of metadata routing referred to as 'callee'
+    parent : str
+        the parent method which should have called `method`, or otherwise in
+        the context of metadata routing referred to as 'caller'
     split_params : tuple, default=empty
         specifies any parameters which are to be checked as being a subset
         of the original values
     **kwargs : dict
         passed metadata
     """
-    records = getattr(obj, "_records", dict()).get(method, dict())
-    assert set(kwargs.keys()) == set(
-        records.keys()
-    ), f"Expected {kwargs.keys()} vs {records.keys()}"
-    for key, value in kwargs.items():
-        recorded_value = records[key]
-        # The following condition is used to check for any specified parameters
-        # being a subset of the original values
-        if key in split_params and recorded_value is not None:
-            assert np.isin(recorded_value, value).all()
-        else:
-            if isinstance(recorded_value, np.ndarray):
-                assert_array_equal(recorded_value, value)
+    all_records = (
+        getattr(obj, "_records", dict()).get(method, dict()).get(parent, list())
+    )
+    for record in all_records:
+        # first check that the names of the metadata passed are the same as
+        # expected. The names are stored as keys in `record`.
+        assert set(kwargs.keys()) == set(
+            record.keys()
+        ), f"Expected {kwargs.keys()} vs {record.keys()}"
+        for key, value in kwargs.items():
+            recorded_value = record[key]
+            # The following condition is used to check for any specified parameters
+            # being a subset of the original values
+            if key in split_params and recorded_value is not None:
+                assert np.isin(recorded_value, value).all()
             else:
-                assert recorded_value is value, f"Expected {recorded_value} vs {value}"
+                if isinstance(recorded_value, np.ndarray):
+                    assert_array_equal(recorded_value, value)
+                else:
+                    assert (
+                        recorded_value is value
+                    ), f"Expected {recorded_value} vs {value}. Method: {method}"
 
 
 record_metadata_not_default = partial(record_metadata, record_default=False)
@@ -150,7 +167,7 @@ def partial_fit(self, X, y, sample_weight="default", metadata="default"):
             self.registry.append(self)
 
         record_metadata_not_default(
-            self, "partial_fit", sample_weight=sample_weight, metadata=metadata
+            self, sample_weight=sample_weight, metadata=metadata
         )
         return self
 
@@ -159,19 +176,19 @@ def fit(self, X, y, sample_weight="default", metadata="default"):
             self.registry.append(self)
 
         record_metadata_not_default(
-            self, "fit", sample_weight=sample_weight, metadata=metadata
+            self, sample_weight=sample_weight, metadata=metadata
         )
         return self
 
     def predict(self, X, y=None, sample_weight="default", metadata="default"):
         record_metadata_not_default(
-            self, "predict", sample_weight=sample_weight, metadata=metadata
+            self, sample_weight=sample_weight, metadata=metadata
         )
         return np.zeros(shape=(len(X),))
 
     def score(self, X, y, sample_weight="default", metadata="default"):
         record_metadata_not_default(
-            self, "score", sample_weight=sample_weight, metadata=metadata
+            self, sample_weight=sample_weight, metadata=metadata
         )
         return 1
 
@@ -193,7 +210,21 @@ def decision_function(self, X):
         return self.predict(X)
 
     def predict(self, X):
-        return np.ones(len(X))
+        y_pred = np.empty(shape=(len(X),))
+        y_pred[: len(X) // 2] = 0
+        y_pred[len(X) // 2 :] = 1
+        return y_pred
+
+    def predict_proba(self, X):
+        # dummy probabilities to support predict_proba
+        y_proba = np.empty(shape=(len(X), 2))
+        y_proba[: len(X) // 2, :] = np.asarray([1.0, 0.0])
+        y_proba[len(X) // 2 :, :] = np.asarray([0.0, 1.0])
+        return y_proba
+
+    def predict_log_proba(self, X):
+        # dummy probabilities to support predict_log_proba
+        return self.predict_proba(X)
 
 
 class NonConsumingRegressor(RegressorMixin, BaseEstimator):
@@ -236,7 +267,7 @@ def partial_fit(
             self.registry.append(self)
 
         record_metadata_not_default(
-            self, "partial_fit", sample_weight=sample_weight, metadata=metadata
+            self, sample_weight=sample_weight, metadata=metadata
         )
         _check_partial_fit_first_call(self, classes)
         return self
@@ -246,7 +277,7 @@ def fit(self, X, y, sample_weight="default", metadata="default"):
             self.registry.append(self)
 
         record_metadata_not_default(
-            self, "fit", sample_weight=sample_weight, metadata=metadata
+            self, sample_weight=sample_weight, metadata=metadata
         )
 
         self.classes_ = np.unique(y)
@@ -254,40 +285,42 @@ def fit(self, X, y, sample_weight="default", metadata="default"):
 
     def predict(self, X, sample_weight="default", metadata="default"):
         record_metadata_not_default(
-            self, "predict", sample_weight=sample_weight, metadata=metadata
+            self, sample_weight=sample_weight, metadata=metadata
         )
-        return np.zeros(shape=(len(X),))
+        y_score = np.empty(shape=(len(X),), dtype="int8")
+        y_score[len(X) // 2 :] = 0
+        y_score[: len(X) // 2] = 1
+        return y_score
 
     def predict_proba(self, X, sample_weight="default", metadata="default"):
-        pass  # pragma: no cover
-
-        # uncomment when needed
-        # record_metadata_not_default(
-        #     self, "predict_proba", sample_weight=sample_weight, metadata=metadata
-        # )
-        # return np.asarray([[0.0, 1.0]] * len(X))
+        record_metadata_not_default(
+            self, sample_weight=sample_weight, metadata=metadata
+        )
+        y_proba = np.empty(shape=(len(X), 2))
+        y_proba[: len(X) // 2, :] = np.asarray([1.0, 0.0])
+        y_proba[len(X) // 2 :, :] = np.asarray([0.0, 1.0])
+        return y_proba
 
     def predict_log_proba(self, X, sample_weight="default", metadata="default"):
-        pass  # pragma: no cover
-
-        # uncomment when needed
-        # record_metadata_not_default(
-        #     self, "predict_log_proba", sample_weight=sample_weight, metadata=metadata
-        # )
-        # return np.zeros(shape=(len(X), 2))
+        record_metadata_not_default(
+            self, sample_weight=sample_weight, metadata=metadata
+        )
+        return np.zeros(shape=(len(X), 2))
 
     def decision_function(self, X, sample_weight="default", metadata="default"):
         record_metadata_not_default(
-            self, "predict_proba", sample_weight=sample_weight, metadata=metadata
+            self, sample_weight=sample_weight, metadata=metadata
         )
-        return np.zeros(shape=(len(X),))
+        y_score = np.empty(shape=(len(X),))
+        y_score[len(X) // 2 :] = 0
+        y_score[: len(X) // 2] = 1
+        return y_score
 
-    # uncomment when needed
-    # def score(self, X, y, sample_weight="default", metadata="default"):
-    # record_metadata_not_default(
-    #    self, "score", sample_weight=sample_weight, metadata=metadata
-    # )
-    # return 1
+    def score(self, X, y, sample_weight="default", metadata="default"):
+        record_metadata_not_default(
+            self, sample_weight=sample_weight, metadata=metadata
+        )
+        return 1
 
 
 class ConsumingTransformer(TransformerMixin, BaseEstimator):
@@ -305,38 +338,38 @@ class ConsumingTransformer(TransformerMixin, BaseEstimator):
     def __init__(self, registry=None):
         self.registry = registry
 
-    def fit(self, X, y=None, sample_weight=None, metadata=None):
+    def fit(self, X, y=None, sample_weight="default", metadata="default"):
         if self.registry is not None:
             self.registry.append(self)
 
         record_metadata_not_default(
-            self, "fit", sample_weight=sample_weight, metadata=metadata
+            self, sample_weight=sample_weight, metadata=metadata
         )
         return self
 
-    def transform(self, X, sample_weight=None, metadata=None):
-        record_metadata(
-            self, "transform", sample_weight=sample_weight, metadata=metadata
+    def transform(self, X, sample_weight="default", metadata="default"):
+        record_metadata_not_default(
+            self, sample_weight=sample_weight, metadata=metadata
         )
-        return X
+        return X + 1
 
-    def fit_transform(self, X, y, sample_weight=None, metadata=None):
+    def fit_transform(self, X, y, sample_weight="default", metadata="default"):
         # implementing ``fit_transform`` is necessary since
         # ``TransformerMixin.fit_transform`` doesn't route any metadata to
         # ``transform``, while here we want ``transform`` to receive
         # ``sample_weight`` and ``metadata``.
-        record_metadata(
-            self, "fit_transform", sample_weight=sample_weight, metadata=metadata
+        record_metadata_not_default(
+            self, sample_weight=sample_weight, metadata=metadata
         )
         return self.fit(X, y, sample_weight=sample_weight, metadata=metadata).transform(
             X, sample_weight=sample_weight, metadata=metadata
         )
 
     def inverse_transform(self, X, sample_weight=None, metadata=None):
-        record_metadata(
-            self, "inverse_transform", sample_weight=sample_weight, metadata=metadata
+        record_metadata_not_default(
+            self, sample_weight=sample_weight, metadata=metadata
         )
-        return X
+        return X - 1
 
 
 class ConsumingNoFitTransformTransformer(BaseEstimator):
@@ -351,14 +384,12 @@ def fit(self, X, y=None, sample_weight=None, metadata=None):
         if self.registry is not None:
             self.registry.append(self)
 
-        record_metadata(self, "fit", sample_weight=sample_weight, metadata=metadata)
+        record_metadata(self, sample_weight=sample_weight, metadata=metadata)
 
         return self
 
     def transform(self, X, sample_weight=None, metadata=None):
-        record_metadata(
-            self, "transform", sample_weight=sample_weight, metadata=metadata
-        )
+        record_metadata(self, sample_weight=sample_weight, metadata=metadata)
         return X
 
 
@@ -373,7 +404,7 @@ def _score(self, method_caller, clf, X, y, **kwargs):
         if self.registry is not None:
             self.registry.append(self)
 
-        record_metadata_not_default(self, "score", **kwargs)
+        record_metadata_not_default(self, **kwargs)
 
         sample_weight = kwargs.get("sample_weight", None)
         return super()._score(method_caller, clf, X, y, sample_weight=sample_weight)
@@ -387,7 +418,7 @@ def split(self, X, y=None, groups="default", metadata="default"):
         if self.registry is not None:
             self.registry.append(self)
 
-        record_metadata_not_default(self, "split", groups=groups, metadata=metadata)
+        record_metadata_not_default(self, groups=groups, metadata=metadata)
 
         split_index = len(X) // 2
         train_indices = list(range(0, split_index))
@@ -418,7 +449,8 @@ def fit(self, X, y, **fit_params):
 
     def get_metadata_routing(self):
         router = MetadataRouter(owner=self.__class__.__name__).add(
-            estimator=self.estimator, method_mapping="one-to-one"
+            estimator=self.estimator,
+            method_mapping=MethodMapping().add(caller="fit", callee="fit"),
         )
         return router
 
@@ -434,7 +466,7 @@ def fit(self, X, y, sample_weight=None, **fit_params):
         if self.registry is not None:
             self.registry.append(self)
 
-        record_metadata(self, "fit", sample_weight=sample_weight)
+        record_metadata(self, sample_weight=sample_weight)
         params = process_routing(self, "fit", sample_weight=sample_weight, **fit_params)
         self.estimator_ = clone(self.estimator).fit(X, y, **params.estimator.fit)
         return self
@@ -447,7 +479,12 @@ def get_metadata_routing(self):
         router = (
             MetadataRouter(owner=self.__class__.__name__)
             .add_self_request(self)
-            .add(estimator=self.estimator, method_mapping="one-to-one")
+            .add(
+                estimator=self.estimator,
+                method_mapping=MethodMapping()
+                .add(caller="fit", callee="fit")
+                .add(caller="predict", callee="predict"),
+            )
         )
         return router
 
@@ -463,7 +500,7 @@ def fit(self, X, y, sample_weight=None, **kwargs):
         if self.registry is not None:
             self.registry.append(self)
 
-        record_metadata(self, "fit", sample_weight=sample_weight)
+        record_metadata(self, sample_weight=sample_weight)
         params = process_routing(self, "fit", sample_weight=sample_weight, **kwargs)
         self.estimator_ = clone(self.estimator).fit(X, y, **params.estimator.fit)
         return self
@@ -472,7 +509,10 @@ def get_metadata_routing(self):
         router = (
             MetadataRouter(owner=self.__class__.__name__)
             .add_self_request(self)
-            .add(estimator=self.estimator, method_mapping="fit")
+            .add(
+                estimator=self.estimator,
+                method_mapping=MethodMapping().add(caller="fit", callee="fit"),
+            )
         )
         return router
 
@@ -494,5 +534,8 @@ def transform(self, X, y=None, **transform_params):
 
     def get_metadata_routing(self):
         return MetadataRouter(owner=self.__class__.__name__).add(
-            transformer=self.transformer, method_mapping="one-to-one"
+            transformer=self.transformer,
+            method_mapping=MethodMapping()
+            .add(caller="fit", callee="fit")
+            .add(caller="transform", callee="transform"),
         )
diff --git a/sklearn/tests/random_seed.py b/sklearn/tests/random_seed.py
deleted file mode 100644
index ecda17e36d2bf..0000000000000
--- a/sklearn/tests/random_seed.py
+++ /dev/null
@@ -1,85 +0,0 @@
-"""global_random_seed fixture
-
-The goal of this fixture is to prevent tests that use it to be sensitive
-to a specific seed value while still being deterministic by default.
-
-See the documentation for the SKLEARN_TESTS_GLOBAL_RANDOM_SEED
-variable for insrtuctions on how to use this fixture.
-
-https://scikit-learn.org/dev/computing/parallelism.html#sklearn-tests-global-random-seed
-"""
-
-from os import environ
-from random import Random
-
-import pytest
-
-
-# Passes the main worker's random seeds to workers
-class XDistHooks:
-    def pytest_configure_node(self, node) -> None:
-        random_seeds = node.config.getoption("random_seeds")
-        node.workerinput["random_seeds"] = random_seeds
-
-
-def pytest_configure(config):
-    if config.pluginmanager.hasplugin("xdist"):
-        config.pluginmanager.register(XDistHooks())
-
-    RANDOM_SEED_RANGE = list(range(100))  # All seeds in [0, 99] should be valid.
-    random_seed_var = environ.get("SKLEARN_TESTS_GLOBAL_RANDOM_SEED")
-    if hasattr(config, "workerinput") and "random_seeds" in config.workerinput:
-        # Set worker random seed from seed generated from main process
-        random_seeds = config.workerinput["random_seeds"]
-    elif random_seed_var is None:
-        # This is the way.
-        random_seeds = [42]
-    elif random_seed_var == "any":
-        # Pick-up one seed at random in the range of admissible random seeds.
-        random_seeds = [Random().choice(RANDOM_SEED_RANGE)]
-    elif random_seed_var == "all":
-        random_seeds = RANDOM_SEED_RANGE
-    else:
-        if "-" in random_seed_var:
-            start, stop = random_seed_var.split("-")
-            random_seeds = list(range(int(start), int(stop) + 1))
-        else:
-            random_seeds = [int(random_seed_var)]
-
-        if min(random_seeds) < 0 or max(random_seeds) > 99:
-            raise ValueError(
-                "The value(s) of the environment variable "
-                "SKLEARN_TESTS_GLOBAL_RANDOM_SEED must be in the range [0, 99] "
-                f"(or 'any' or 'all'), got: {random_seed_var}"
-            )
-    config.option.random_seeds = random_seeds
-
-    class GlobalRandomSeedPlugin:
-        @pytest.fixture(params=random_seeds)
-        def global_random_seed(self, request):
-            """Fixture to ask for a random yet controllable random seed.
-
-            All tests that use this fixture accept the contract that they should
-            deterministically pass for any seed value from 0 to 99 included.
-
-            See the documentation for the SKLEARN_TESTS_GLOBAL_RANDOM_SEED
-            variable for insrtuctions on how to use this fixture.
-
-            https://scikit-learn.org/dev/computing/parallelism.html#sklearn-tests-global-random-seed
-            """
-            yield request.param
-
-    config.pluginmanager.register(GlobalRandomSeedPlugin())
-
-
-def pytest_report_header(config):
-    random_seed_var = environ.get("SKLEARN_TESTS_GLOBAL_RANDOM_SEED")
-    if random_seed_var == "any":
-        return [
-            "To reproduce this test run, set the following environment variable:",
-            f'    SKLEARN_TESTS_GLOBAL_RANDOM_SEED="{config.option.random_seeds[0]}"',
-            (
-                "See: https://scikit-learn.org/dev/computing/parallelism.html"
-                "#sklearn-tests-global-random-seed"
-            ),
-        ]
diff --git a/sklearn/tests/test_base.py b/sklearn/tests/test_base.py
index 3bbc236e703df..ab842e425456a 100644
--- a/sklearn/tests/test_base.py
+++ b/sklearn/tests/test_base.py
@@ -1,5 +1,5 @@
-# Author: Gael Varoquaux
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import pickle
 import re
@@ -18,13 +18,16 @@
     TransformerMixin,
     clone,
     is_classifier,
+    is_clusterer,
+    is_regressor,
 )
+from sklearn.cluster import KMeans
 from sklearn.decomposition import PCA
 from sklearn.exceptions import InconsistentVersionWarning
 from sklearn.model_selection import GridSearchCV
 from sklearn.pipeline import Pipeline
 from sklearn.preprocessing import StandardScaler
-from sklearn.svm import SVC
+from sklearn.svm import SVC, SVR
 from sklearn.tree import DecisionTreeClassifier, DecisionTreeRegressor
 from sklearn.utils._mocking import MockDataFrame
 from sklearn.utils._set_output import _get_output_config
@@ -259,12 +262,55 @@ def test_get_params():
         test.set_params(a__a=2)
 
 
-def test_is_classifier():
-    svc = SVC()
-    assert is_classifier(svc)
-    assert is_classifier(GridSearchCV(svc, {"C": [0.1, 1]}))
-    assert is_classifier(Pipeline([("svc", svc)]))
-    assert is_classifier(Pipeline([("svc_cv", GridSearchCV(svc, {"C": [0.1, 1]}))]))
+@pytest.mark.parametrize(
+    "estimator, expected_result",
+    [
+        (SVC(), True),
+        (GridSearchCV(SVC(), {"C": [0.1, 1]}), True),
+        (Pipeline([("svc", SVC())]), True),
+        (Pipeline([("svc_cv", GridSearchCV(SVC(), {"C": [0.1, 1]}))]), True),
+        (SVR(), False),
+        (GridSearchCV(SVR(), {"C": [0.1, 1]}), False),
+        (Pipeline([("svr", SVR())]), False),
+        (Pipeline([("svr_cv", GridSearchCV(SVR(), {"C": [0.1, 1]}))]), False),
+    ],
+)
+def test_is_classifier(estimator, expected_result):
+    assert is_classifier(estimator) == expected_result
+
+
+@pytest.mark.parametrize(
+    "estimator, expected_result",
+    [
+        (SVR(), True),
+        (GridSearchCV(SVR(), {"C": [0.1, 1]}), True),
+        (Pipeline([("svr", SVR())]), True),
+        (Pipeline([("svr_cv", GridSearchCV(SVR(), {"C": [0.1, 1]}))]), True),
+        (SVC(), False),
+        (GridSearchCV(SVC(), {"C": [0.1, 1]}), False),
+        (Pipeline([("svc", SVC())]), False),
+        (Pipeline([("svc_cv", GridSearchCV(SVC(), {"C": [0.1, 1]}))]), False),
+    ],
+)
+def test_is_regressor(estimator, expected_result):
+    assert is_regressor(estimator) == expected_result
+
+
+@pytest.mark.parametrize(
+    "estimator, expected_result",
+    [
+        (KMeans(), True),
+        (GridSearchCV(KMeans(), {"n_clusters": [3, 8]}), True),
+        (Pipeline([("km", KMeans())]), True),
+        (Pipeline([("km_cv", GridSearchCV(KMeans(), {"n_clusters": [3, 8]}))]), True),
+        (SVC(), False),
+        (GridSearchCV(SVC(), {"C": [0.1, 1]}), False),
+        (Pipeline([("svc", SVC())]), False),
+        (Pipeline([("svc_cv", GridSearchCV(SVC(), {"C": [0.1, 1]}))]), False),
+    ],
+)
+def test_is_clusterer(estimator, expected_result):
+    assert is_clusterer(estimator) == expected_result
 
 
 def test_set_params():
@@ -834,7 +880,7 @@ class Estimator(BaseEstimator, WithSlots):
     [
         ("dataframe", "1.5.0"),
         ("pyarrow", "12.0.0"),
-        ("polars", "0.19.12"),
+        ("polars", "0.20.23"),
     ],
 )
 def test_dataframe_protocol(constructor_name, minversion):
diff --git a/sklearn/tests/test_calibration.py b/sklearn/tests/test_calibration.py
index e74ff76b48355..c2cbad4060fde 100644
--- a/sklearn/tests/test_calibration.py
+++ b/sklearn/tests/test_calibration.py
@@ -1,5 +1,5 @@
-# Authors: Alexandre Gramfort <alexandre.gramfort@telecom-paristech.fr>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 import pytest
@@ -156,7 +156,7 @@ def test_sample_weight(data, method, ensemble):
     X_train, y_train, sw_train = X[:n_samples], y[:n_samples], sample_weight[:n_samples]
     X_test = X[n_samples:]
 
-    estimator = LinearSVC(dual="auto", random_state=42)
+    estimator = LinearSVC(random_state=42)
     calibrated_clf = CalibratedClassifierCV(estimator, method=method, ensemble=ensemble)
     calibrated_clf.fit(X_train, y_train, sample_weight=sw_train)
     probs_with_sw = calibrated_clf.predict_proba(X_test)
@@ -177,7 +177,7 @@ def test_parallel_execution(data, method, ensemble):
     X, y = data
     X_train, X_test, y_train, y_test = train_test_split(X, y, random_state=42)
 
-    estimator = make_pipeline(StandardScaler(), LinearSVC(dual="auto", random_state=42))
+    estimator = make_pipeline(StandardScaler(), LinearSVC(random_state=42))
 
     cal_clf_parallel = CalibratedClassifierCV(
         estimator, method=method, n_jobs=2, ensemble=ensemble
@@ -206,7 +206,7 @@ def multiclass_brier(y_true, proba_pred, n_classes):
 
     # Test calibration for multiclass with classifier that implements
     # only decision function.
-    clf = LinearSVC(dual="auto", random_state=7)
+    clf = LinearSVC(random_state=7)
     X, y = make_blobs(
         n_samples=500, n_features=100, random_state=seed, centers=10, cluster_std=15.0
     )
@@ -338,7 +338,7 @@ def test_calibration_ensemble_false(data, method):
     # Test that `ensemble=False` is the same as using predictions from
     # `cross_val_predict` to train calibrator.
     X, y = data
-    clf = LinearSVC(dual="auto", random_state=7)
+    clf = LinearSVC(random_state=7)
 
     cal_clf = CalibratedClassifierCV(clf, method=method, cv=3, ensemble=False)
     cal_clf.fit(X, y)
@@ -427,7 +427,7 @@ def test_calibration_prob_sum(ensemble):
     # issue #7796
     num_classes = 2
     X, y = make_classification(n_samples=10, n_features=5, n_classes=num_classes)
-    clf = LinearSVC(dual="auto", C=1.0, random_state=7)
+    clf = LinearSVC(C=1.0, random_state=7)
     clf_prob = CalibratedClassifierCV(
         clf, method="sigmoid", cv=LeaveOneOut(), ensemble=ensemble
     )
@@ -445,7 +445,7 @@ def test_calibration_less_classes(ensemble):
     # class label
     X = np.random.randn(10, 5)
     y = np.arange(10)
-    clf = LinearSVC(dual="auto", C=1.0, random_state=7)
+    clf = LinearSVC(C=1.0, random_state=7)
     cal_clf = CalibratedClassifierCV(
         clf, method="sigmoid", cv=LeaveOneOut(), ensemble=ensemble
     )
@@ -542,8 +542,8 @@ def test_calibration_dict_pipeline(dict_data, dict_data_pipeline):
 @pytest.mark.parametrize(
     "clf, cv",
     [
-        pytest.param(LinearSVC(dual="auto", C=1), 2),
-        pytest.param(LinearSVC(dual="auto", C=1), "prefit"),
+        pytest.param(LinearSVC(C=1), 2),
+        pytest.param(LinearSVC(C=1), "prefit"),
     ],
 )
 def test_calibration_attributes(clf, cv):
@@ -567,7 +567,7 @@ def test_calibration_inconsistent_prefit_n_features_in():
     # Check that `n_features_in_` from prefit base estimator
     # is consistent with training set
     X, y = make_classification(n_samples=10, n_features=5, n_classes=2, random_state=7)
-    clf = LinearSVC(dual="auto", C=1).fit(X, y)
+    clf = LinearSVC(C=1).fit(X, y)
     calib_clf = CalibratedClassifierCV(clf, cv="prefit")
 
     msg = "X has 3 features, but LinearSVC is expecting 5 features as input."
@@ -1088,3 +1088,14 @@ def predict_proba(self, X):
     calibrator = CalibratedClassifierCV(model)
     # Does not raise an error
     calibrator.fit(*data)
+
+
+def test_error_less_class_samples_than_folds():
+    """Check that CalibratedClassifierCV works with string targets.
+
+    non-regression test for issue #28841.
+    """
+    X = np.random.normal(size=(20, 3))
+    y = ["a"] * 10 + ["b"] * 10
+
+    CalibratedClassifierCV(cv=3).fit(X, y)
diff --git a/sklearn/tests/test_check_build.py b/sklearn/tests/test_check_build.py
index 3c8e64e1ba906..baf72093354e1 100644
--- a/sklearn/tests/test_check_build.py
+++ b/sklearn/tests/test_check_build.py
@@ -2,8 +2,8 @@
 Smoke Test the check_build module
 """
 
-# Author: G Varoquaux
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import pytest
 
diff --git a/sklearn/tests/test_common.py b/sklearn/tests/test_common.py
index 4564eddee410c..67ba6397655c8 100644
--- a/sklearn/tests/test_common.py
+++ b/sklearn/tests/test_common.py
@@ -2,24 +2,23 @@
 General tests for all estimators in sklearn.
 """
 
-# Authors: Andreas Mueller <amueller@ais.uni-bonn.de>
-#          Gael Varoquaux gael.varoquaux@normalesup.org
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import os
 import pkgutil
 import re
-import sys
 import warnings
 from functools import partial
 from inspect import isgenerator, signature
 from itertools import chain, product
-from pathlib import Path
 
 import numpy as np
 import pytest
+from scipy.linalg import LinAlgWarning
 
 import sklearn
+from sklearn.base import BaseEstimator
 from sklearn.cluster import (
     OPTICS,
     AffinityPropagation,
@@ -78,6 +77,7 @@
     check_get_feature_names_out_error,
     check_global_output_transform_pandas,
     check_global_set_output_transform_polars,
+    check_inplace_ensure_writeable,
     check_n_features_in_after_fitting,
     check_param_validation,
     check_set_output_transform,
@@ -87,7 +87,7 @@
     check_transformer_get_feature_names_out_pandas,
     parametrize_with_checks,
 )
-from sklearn.utils.fixes import _IS_PYPY, _IS_WASM
+from sklearn.utils.fixes import _IS_WASM
 
 
 def test_all_estimator_no_base_class():
@@ -103,6 +103,16 @@ def _sample_func(x, y=1):
     pass
 
 
+class CallableEstimator(BaseEstimator):
+    """Dummy development stub for an estimator.
+
+    This is to make sure a callable estimator passes common tests.
+    """
+
+    def __call__(self):
+        pass  # pragma: nocover
+
+
 @pytest.mark.parametrize(
     "val, expected",
     [
@@ -122,6 +132,7 @@ def _sample_func(x, y=1):
                 "solver='newton-cg',warm_start=True)"
             ),
         ),
+        (CallableEstimator(), "CallableEstimator()"),
     ],
 )
 def test_get_check_estimator_ids(val, expected):
@@ -151,7 +162,9 @@ def _generate_pipeline():
 @parametrize_with_checks(list(chain(_tested_estimators(), _generate_pipeline())))
 def test_estimators(estimator, check, request):
     # Common tests for estimator instances
-    with ignore_warnings(category=(FutureWarning, ConvergenceWarning, UserWarning)):
+    with ignore_warnings(
+        category=(FutureWarning, ConvergenceWarning, UserWarning, LinAlgWarning)
+    ):
         _set_checking_parameters(estimator)
         check(estimator)
 
@@ -161,30 +174,6 @@ def test_check_estimator_generate_only():
     assert isgenerator(all_instance_gen_checks)
 
 
-def test_setup_py_check():
-    # Smoke test `python setup.py check` command run at the root of the
-    # scikit-learn source tree.
-    cwd = os.getcwd()
-    setup_path = Path(sklearn.__file__).parent.parent
-    setup_filename = os.path.join(setup_path, "setup.py")
-    if not os.path.exists(setup_filename):
-        pytest.skip("setup.py not available")
-    try:
-        os.chdir(setup_path)
-        old_argv = sys.argv
-        sys.argv = ["setup.py", "check"]
-
-        with warnings.catch_warnings():
-            # The configuration spits out warnings when not finding
-            # Blas/Atlas development headers
-            warnings.simplefilter("ignore", UserWarning)
-            with open("setup.py") as f:
-                exec(f.read(), dict(__name__="__main__"))
-    finally:
-        sys.argv = old_argv
-        os.chdir(cwd)
-
-
 def _tested_linear_classifiers():
     classifiers = all_estimators(type_filter="classifier")
 
@@ -219,14 +208,9 @@ def test_import_all_consistency():
     for modname in submods + ["sklearn"]:
         if ".tests." in modname:
             continue
-        # Avoid test suite depending on setuptools
+        # Avoid test suite depending on build dependencies, for example Cython
         if "sklearn._build_utils" in modname:
             continue
-        if _IS_PYPY and (
-            "_svmlight_format_io" in modname
-            or "feature_extraction._hashing_fast" in modname
-        ):
-            continue
         package = __import__(modname, fromlist="dummy")
         for name in getattr(package, "__all__", ()):
             assert hasattr(package, name), "Module '{0}' has no attribute '{1}'".format(
@@ -236,7 +220,7 @@ def test_import_all_consistency():
 
 def test_root_import_all_completeness():
     sklearn_path = [os.path.dirname(sklearn.__file__)]
-    EXCEPTIONS = ("utils", "tests", "base", "setup", "conftest")
+    EXCEPTIONS = ("utils", "tests", "base", "conftest")
     for _, modname, _ in pkgutil.walk_packages(
         path=sklearn_path, onerror=lambda _: None
     ):
@@ -245,13 +229,6 @@ def test_root_import_all_completeness():
         assert modname in sklearn.__all__
 
 
-@pytest.mark.skipif(
-    sklearn._BUILT_WITH_MESON,
-    reason=(
-        "This test fails with Meson editable installs see"
-        " https://github.com/mesonbuild/meson-python/issues/557 for more details"
-    ),
-)
 def test_all_tests_are_importable():
     # Ensure that for each contentful subpackage, there is a test directory
     # within it that is also a subpackage (i.e. a directory with __init__.py)
@@ -284,9 +261,9 @@ def test_all_tests_are_importable():
     assert missing_tests == [], (
         "{0} do not have `tests` subpackages. "
         "Perhaps they require "
-        "__init__.py or an add_subpackage directive "
+        "__init__.py or a meson.build "
         "in the parent "
-        "setup.py".format(missing_tests)
+        "directory".format(missing_tests)
     )
 
 
@@ -327,7 +304,9 @@ def _generate_search_cv_instances():
         extra_params = (
             {"min_resources": "smallest"} if "min_resources" in init_params else {}
         )
-        search_cv = SearchCV(Estimator(), param_grid, cv=2, **extra_params)
+        search_cv = SearchCV(
+            Estimator(), param_grid, cv=2, error_score="raise", **extra_params
+        )
         set_random_state(search_cv)
         yield search_cv
 
@@ -612,3 +591,31 @@ def test_set_output_transform_configured(estimator, check_func):
     _set_checking_parameters(estimator)
     with ignore_warnings(category=(FutureWarning)):
         check_func(estimator.__class__.__name__, estimator)
+
+
+@pytest.mark.parametrize(
+    "estimator", _tested_estimators(), ids=_get_check_estimator_ids
+)
+def test_check_inplace_ensure_writeable(estimator):
+    name = estimator.__class__.__name__
+
+    if hasattr(estimator, "copy"):
+        estimator.set_params(copy=False)
+    elif hasattr(estimator, "copy_X"):
+        estimator.set_params(copy_X=False)
+    else:
+        raise SkipTest(f"{name} doesn't require writeable input.")
+
+    _set_checking_parameters(estimator)
+
+    # The following estimators can work inplace only with certain settings
+    if name == "HDBSCAN":
+        estimator.set_params(metric="precomputed", algorithm="brute")
+
+    if name == "PCA":
+        estimator.set_params(svd_solver="full")
+
+    if name == "KernelPCA":
+        estimator.set_params(kernel="precomputed")
+
+    check_inplace_ensure_writeable(name, estimator)
diff --git a/sklearn/tests/test_discriminant_analysis.py b/sklearn/tests/test_discriminant_analysis.py
index 42fd20cc0cc24..29ab2ed47b017 100644
--- a/sklearn/tests/test_discriminant_analysis.py
+++ b/sklearn/tests/test_discriminant_analysis.py
@@ -1,3 +1,5 @@
+import warnings
+
 import numpy as np
 import pytest
 from scipy import linalg
@@ -603,36 +605,34 @@ def test_qda_regularization():
     # The default is reg_param=0. and will cause issues when there is a
     # constant variable.
 
-    # Fitting on data with constant variable triggers an UserWarning.
-    collinear_msg = "Variables are collinear"
+    # Fitting on data with constant variable without regularization
+    # triggers a LinAlgError.
+    msg = r"The covariance matrix of class .+ is not full rank"
     clf = QuadraticDiscriminantAnalysis()
-    with pytest.warns(UserWarning, match=collinear_msg):
+    with pytest.warns(linalg.LinAlgWarning, match=msg):
         y_pred = clf.fit(X2, y6)
 
-    # XXX: RuntimeWarning is also raised at predict time because of divisions
-    # by zero when the model is fit with a constant feature and without
-    # regularization: should this be considered a bug? Either by the fit-time
-    # message more informative, raising and exception instead of a warning in
-    # this case or somehow changing predict to avoid division by zero.
-    with pytest.warns(RuntimeWarning, match="divide by zero"):
-        y_pred = clf.predict(X2)
+    y_pred = clf.predict(X2)
     assert np.any(y_pred != y6)
 
-    # Adding a little regularization fixes the division by zero at predict
-    # time. But UserWarning will persist at fit time.
+    # Adding a little regularization fixes the fit time error.
     clf = QuadraticDiscriminantAnalysis(reg_param=0.01)
-    with pytest.warns(UserWarning, match=collinear_msg):
-        clf.fit(X2, y6)
+    with warnings.catch_warnings():
+        warnings.simplefilter("error")
+    clf.fit(X2, y6)
     y_pred = clf.predict(X2)
     assert_array_equal(y_pred, y6)
 
-    # UserWarning should also be there for the n_samples_in_a_class <
+    # LinAlgWarning should also be there for the n_samples_in_a_class <
     # n_features case.
-    clf = QuadraticDiscriminantAnalysis(reg_param=0.1)
-    with pytest.warns(UserWarning, match=collinear_msg):
+    clf = QuadraticDiscriminantAnalysis()
+    with pytest.warns(linalg.LinAlgWarning, match=msg):
+        clf.fit(X5, y5)
+
+    # The error will persist even with regularization
+    clf = QuadraticDiscriminantAnalysis(reg_param=0.3)
+    with pytest.warns(linalg.LinAlgWarning, match=msg):
         clf.fit(X5, y5)
-    y_pred5 = clf.predict(X5)
-    assert_array_equal(y_pred5, y5)
 
 
 def test_covariance():
diff --git a/sklearn/tests/test_docstring_parameters.py b/sklearn/tests/test_docstring_parameters.py
index 3edaa05100520..0c3b0e367923a 100644
--- a/sklearn/tests/test_docstring_parameters.py
+++ b/sklearn/tests/test_docstring_parameters.py
@@ -1,6 +1,5 @@
-# Authors: Alexandre Gramfort <alexandre.gramfort@inria.fr>
-#          Raghav RV <rvraghav93@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import importlib
 import inspect
@@ -34,7 +33,6 @@
     _enforce_estimator_tags_X,
     _enforce_estimator_tags_y,
 )
-from sklearn.utils.fixes import _IS_PYPY, parse_version, sp_version
 
 # walk_packages() ignores DeprecationWarnings, now we need to ignore
 # FutureWarnings
@@ -51,6 +49,7 @@
     )
 
 # functions to ignore args / docstring of
+# TODO(1.7): remove "sklearn.utils._joblib"
 _DOCSTRING_IGNORES = [
     "sklearn.utils.deprecation.load_mlcomp",
     "sklearn.pipeline.make_pipeline",
@@ -75,7 +74,6 @@
 # Python 3.7
 @pytest.mark.filterwarnings("ignore::FutureWarning")
 @pytest.mark.filterwarnings("ignore::DeprecationWarning")
-@pytest.mark.skipif(_IS_PYPY, reason="test segfaults on PyPy")
 def test_docstring_parameters():
     # Test module docstring formatting
 
@@ -225,18 +223,10 @@ def test_fit_docstring_attributes(name, Estimator):
         # default raises an error, perplexity must be less than n_samples
         est.set_params(perplexity=2)
 
-    # TODO(1.5): TO BE REMOVED for 1.5 (avoid FutureWarning)
-    if Estimator.__name__ in ("LinearSVC", "LinearSVR"):
-        est.set_params(dual="auto")
-
     # TODO(1.6): remove (avoid FutureWarning)
     if Estimator.__name__ in ("NMF", "MiniBatchNMF"):
         est.set_params(n_components="auto")
 
-    if Estimator.__name__ == "QuantileRegressor":
-        solver = "highs" if sp_version >= parse_version("1.6.0") else "interior-point"
-        est.set_params(solver=solver)
-
     # Low max iter to speed up tests: we are only interested in checking the existence
     # of fitted attributes. This should be invariant to whether it has converged or not.
     if "max_iter" in est.get_params():
diff --git a/sklearn/tests/test_isotonic.py b/sklearn/tests/test_isotonic.py
index 93df0221236b8..90598b48f6434 100644
--- a/sklearn/tests/test_isotonic.py
+++ b/sklearn/tests/test_isotonic.py
@@ -227,7 +227,13 @@ def test_isotonic_regression_with_ties_in_differently_sized_groups():
 
 def test_isotonic_regression_reversed():
     y = np.array([10, 9, 10, 7, 6, 6.1, 5])
+    y_result = np.array([10, 9.5, 9.5, 7, 6.05, 6.05, 5])
+
+    y_iso = isotonic_regression(y, increasing=False)
+    assert_allclose(y_iso, y_result)
+
     y_ = IsotonicRegression(increasing=False).fit_transform(np.arange(len(y)), y)
+    assert_allclose(y_, y_result)
     assert_array_equal(np.ones(y_[:-1].shape), ((y_[:-1] - y_[1:]) >= 0))
 
 
@@ -502,25 +508,25 @@ def test_isotonic_copy_before_fit():
     copy.copy(ir)
 
 
-def test_isotonic_dtype():
+@pytest.mark.parametrize("dtype", [np.int32, np.int64, np.float32, np.float64])
+def test_isotonic_dtype(dtype):
     y = [2, 1, 4, 3, 5]
     weights = np.array([0.9, 0.9, 0.9, 0.9, 0.9], dtype=np.float64)
     reg = IsotonicRegression()
 
-    for dtype in (np.int32, np.int64, np.float32, np.float64):
-        for sample_weight in (None, weights.astype(np.float32), weights):
-            y_np = np.array(y, dtype=dtype)
-            expected_dtype = check_array(
-                y_np, dtype=[np.float64, np.float32], ensure_2d=False
-            ).dtype
+    for sample_weight in (None, weights.astype(np.float32), weights):
+        y_np = np.array(y, dtype=dtype)
+        expected_dtype = check_array(
+            y_np, dtype=[np.float64, np.float32], ensure_2d=False
+        ).dtype
 
-            res = isotonic_regression(y_np, sample_weight=sample_weight)
-            assert res.dtype == expected_dtype
+        res = isotonic_regression(y_np, sample_weight=sample_weight)
+        assert res.dtype == expected_dtype
 
-            X = np.arange(len(y)).astype(dtype)
-            reg.fit(X, y_np, sample_weight=sample_weight)
-            res = reg.predict(X)
-            assert res.dtype == expected_dtype
+        X = np.arange(len(y)).astype(dtype)
+        reg.fit(X, y_np, sample_weight=sample_weight)
+        res = reg.predict(X)
+        assert res.dtype == expected_dtype
 
 
 @pytest.mark.parametrize("y_dtype", [np.int32, np.int64, np.float32, np.float64])
diff --git a/sklearn/tests/test_kernel_approximation.py b/sklearn/tests/test_kernel_approximation.py
index 170113fd0d768..a25baa45823ae 100644
--- a/sklearn/tests/test_kernel_approximation.py
+++ b/sklearn/tests/test_kernel_approximation.py
@@ -144,19 +144,6 @@ def test_additive_chi2_sampler_sample_steps(method, sample_steps):
     assert transformer.sample_interval == sample_interval
 
 
-# TODO(1.5): remove
-def test_additive_chi2_sampler_future_warnings():
-    """Check that we raise a FutureWarning when accessing to `sample_interval_`."""
-    transformer = AdditiveChi2Sampler()
-    transformer.fit(X)
-    msg = re.escape(
-        "The ``sample_interval_`` attribute was deprecated in version 1.3 and "
-        "will be removed 1.5."
-    )
-    with pytest.warns(FutureWarning, match=msg):
-        assert transformer.sample_interval_ is not None
-
-
 @pytest.mark.parametrize("method", ["fit", "fit_transform", "transform"])
 def test_additive_chi2_sampler_wrong_sample_steps(method):
     """Check that we raise a ValueError on invalid sample_steps"""
diff --git a/sklearn/tests/test_metadata_routing.py b/sklearn/tests/test_metadata_routing.py
index 110452870d682..359432b35d5e0 100644
--- a/sklearn/tests/test_metadata_routing.py
+++ b/sklearn/tests/test_metadata_routing.py
@@ -2,8 +2,8 @@
 Metadata Routing Utility Tests
 """
 
-# Author: Adrin Jalali <adrin.jalali@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import re
 
@@ -114,11 +114,16 @@ def get_metadata_routing(self):
             router.add(
                 **{f"step_{i}": step},
                 method_mapping=MethodMapping()
-                .add(callee="fit", caller="fit")
-                .add(callee="transform", caller="fit")
-                .add(callee="transform", caller="predict"),
+                .add(caller="fit", callee="fit")
+                .add(caller="fit", callee="transform")
+                .add(caller="predict", callee="transform"),
             )
-        router.add(predictor=self.steps[-1], method_mapping="one-to-one")
+        router.add(
+            predictor=self.steps[-1],
+            method_mapping=MethodMapping()
+            .add(caller="fit", callee="fit")
+            .add(caller="predict", callee="predict"),
+        )
         return router
 
 
@@ -150,7 +155,10 @@ def test_assert_request_is_empty():
     assert_request_is_empty(
         MetadataRouter(owner="test")
         .add_self_request(WeightedMetaRegressor(estimator=None))
-        .add(method_mapping="fit", estimator=ConsumingRegressor())
+        .add(
+            estimator=ConsumingRegressor(),
+            method_mapping=MethodMapping().add(caller="fit", callee="fit"),
+        )
     )
 
 
@@ -319,14 +327,16 @@ def test_simple_metadata_routing():
     # and passing metadata to the consumer directly is fine regardless of its
     # metadata_request values.
     clf.fit(X, y, sample_weight=my_weights)
-    check_recorded_metadata(clf.estimator_, "fit")
+    check_recorded_metadata(clf.estimator_, method="fit", parent="fit")
 
     # Requesting a metadata will make the meta-estimator forward it correctly
     clf = WeightedMetaClassifier(
         estimator=ConsumingClassifier().set_fit_request(sample_weight=True)
     )
     clf.fit(X, y, sample_weight=my_weights)
-    check_recorded_metadata(clf.estimator_, "fit", sample_weight=my_weights)
+    check_recorded_metadata(
+        clf.estimator_, method="fit", parent="fit", sample_weight=my_weights
+    )
 
     # And requesting it with an alias
     clf = WeightedMetaClassifier(
@@ -335,7 +345,9 @@ def test_simple_metadata_routing():
         )
     )
     clf.fit(X, y, alternative_weight=my_weights)
-    check_recorded_metadata(clf.estimator_, "fit", sample_weight=my_weights)
+    check_recorded_metadata(
+        clf.estimator_, method="fit", parent="fit", sample_weight=my_weights
+    )
 
 
 def test_nested_routing():
@@ -359,17 +371,30 @@ def test_nested_routing():
         X, y, metadata=my_groups, sample_weight=w1, outer_weights=w2, inner_weights=w3
     )
     check_recorded_metadata(
-        pipeline.steps_[0].transformer_, "fit", metadata=my_groups, sample_weight=None
+        pipeline.steps_[0].transformer_,
+        method="fit",
+        parent="fit",
+        metadata=my_groups,
     )
     check_recorded_metadata(
-        pipeline.steps_[0].transformer_, "transform", sample_weight=w1, metadata=None
+        pipeline.steps_[0].transformer_,
+        method="transform",
+        parent="fit",
+        sample_weight=w1,
+    )
+    check_recorded_metadata(
+        pipeline.steps_[1], method="fit", parent="fit", sample_weight=w2
+    )
+    check_recorded_metadata(
+        pipeline.steps_[1].estimator_, method="fit", parent="fit", sample_weight=w3
     )
-    check_recorded_metadata(pipeline.steps_[1], "fit", sample_weight=w2)
-    check_recorded_metadata(pipeline.steps_[1].estimator_, "fit", sample_weight=w3)
 
     pipeline.predict(X, sample_weight=w3)
     check_recorded_metadata(
-        pipeline.steps_[0].transformer_, "transform", sample_weight=w3, metadata=None
+        pipeline.steps_[0].transformer_,
+        method="transform",
+        parent="fit",
+        sample_weight=w3,
     )
 
 
@@ -677,13 +702,13 @@ class ConsumingRegressorWarn(ConsumingRegressor):
             MetadataRequest(owner="test"),
             "{}",
         ),
-        (MethodMapping.from_str("score"), "[{'callee': 'score', 'caller': 'score'}]"),
         (
             MetadataRouter(owner="test").add(
-                method_mapping="predict", estimator=ConsumingRegressor()
+                estimator=ConsumingRegressor(),
+                method_mapping=MethodMapping().add(caller="predict", callee="predict"),
             ),
             (
-                "{'estimator': {'mapping': [{'callee': 'predict', 'caller':"
+                "{'estimator': {'mapping': [{'caller': 'predict', 'callee':"
                 " 'predict'}], 'router': {'fit': {'sample_weight': None, 'metadata':"
                 " None}, 'partial_fit': {'sample_weight': None, 'metadata': None},"
                 " 'predict': {'sample_weight': None, 'metadata': None}, 'score':"
@@ -702,24 +727,17 @@ def test_string_representations(obj, string):
         (
             MethodMapping(),
             "add",
-            {"callee": "invalid", "caller": "fit"},
+            {"caller": "fit", "callee": "invalid"},
             ValueError,
             "Given callee",
         ),
         (
             MethodMapping(),
             "add",
-            {"callee": "fit", "caller": "invalid"},
+            {"caller": "invalid", "callee": "fit"},
             ValueError,
             "Given caller",
         ),
-        (
-            MethodMapping,
-            "from_str",
-            {"route": "invalid"},
-            ValueError,
-            "route should be 'one-to-one' or a single method!",
-        ),
         (
             MetadataRouter(owner="test"),
             "add_self_request",
@@ -749,16 +767,17 @@ def test_methodmapping():
     )
 
     mm_list = list(mm)
-    assert mm_list[0] == ("transform", "fit")
+    assert mm_list[0] == ("fit", "transform")
     assert mm_list[1] == ("fit", "fit")
 
-    mm = MethodMapping.from_str("one-to-one")
+    mm = MethodMapping()
     for method in METHODS:
+        mm.add(caller=method, callee=method)
         assert MethodPair(method, method) in mm._routes
     assert len(mm._routes) == len(METHODS)
 
-    mm = MethodMapping.from_str("score")
-    assert repr(mm) == "[{'callee': 'score', 'caller': 'score'}]"
+    mm = MethodMapping().add(caller="score", callee="score")
+    assert repr(mm) == "[{'caller': 'score', 'callee': 'score'}]"
 
 
 def test_metadatarouter_add_self_request():
@@ -793,12 +812,12 @@ def test_metadatarouter_add_self_request():
 def test_metadata_routing_add():
     # adding one with a string `method_mapping`
     router = MetadataRouter(owner="test").add(
-        method_mapping="fit",
         est=ConsumingRegressor().set_fit_request(sample_weight="weights"),
+        method_mapping=MethodMapping().add(caller="fit", callee="fit"),
     )
     assert (
         str(router)
-        == "{'est': {'mapping': [{'callee': 'fit', 'caller': 'fit'}], 'router': {'fit':"
+        == "{'est': {'mapping': [{'caller': 'fit', 'callee': 'fit'}], 'router': {'fit':"
         " {'sample_weight': 'weights', 'metadata': None}, 'partial_fit':"
         " {'sample_weight': None, 'metadata': None}, 'predict': {'sample_weight':"
         " None, 'metadata': None}, 'score': {'sample_weight': None, 'metadata':"
@@ -807,12 +826,12 @@ def test_metadata_routing_add():
 
     # adding one with an instance of MethodMapping
     router = MetadataRouter(owner="test").add(
-        method_mapping=MethodMapping().add(callee="score", caller="fit"),
+        method_mapping=MethodMapping().add(caller="fit", callee="score"),
         est=ConsumingRegressor().set_score_request(sample_weight=True),
     )
     assert (
         str(router)
-        == "{'est': {'mapping': [{'callee': 'score', 'caller': 'fit'}], 'router':"
+        == "{'est': {'mapping': [{'caller': 'fit', 'callee': 'score'}], 'router':"
         " {'fit': {'sample_weight': None, 'metadata': None}, 'partial_fit':"
         " {'sample_weight': None, 'metadata': None}, 'predict': {'sample_weight':"
         " None, 'metadata': None}, 'score': {'sample_weight': True, 'metadata':"
@@ -829,17 +848,17 @@ def test_metadata_routing_get_param_names():
             )
         )
         .add(
-            method_mapping="fit",
             trs=ConsumingTransformer().set_fit_request(
                 sample_weight="transform_weights"
             ),
+            method_mapping=MethodMapping().add(caller="fit", callee="fit"),
         )
     )
 
     assert (
         str(router)
         == "{'$self_request': {'fit': {'sample_weight': 'self_weights'}, 'score':"
-        " {'sample_weight': None}}, 'trs': {'mapping': [{'callee': 'fit', 'caller':"
+        " {'sample_weight': None}}, 'trs': {'mapping': [{'caller': 'fit', 'callee':"
         " 'fit'}], 'router': {'fit': {'sample_weight': 'transform_weights',"
         " 'metadata': None}, 'transform': {'sample_weight': None, 'metadata': None},"
         " 'inverse_transform': {'sample_weight': None, 'metadata': None}}}}"
diff --git a/sklearn/tests/test_metaestimators_metadata_routing.py b/sklearn/tests/test_metaestimators_metadata_routing.py
index aa6af5bd09aac..9aca241521ca0 100644
--- a/sklearn/tests/test_metaestimators_metadata_routing.py
+++ b/sklearn/tests/test_metaestimators_metadata_routing.py
@@ -14,8 +14,6 @@
     AdaBoostRegressor,
     BaggingClassifier,
     BaggingRegressor,
-    StackingClassifier,
-    StackingRegressor,
 )
 from sklearn.exceptions import UnsetMetadataPassedError
 from sklearn.experimental import (
@@ -43,10 +41,12 @@
     RidgeCV,
 )
 from sklearn.model_selection import (
+    FixedThresholdClassifier,
     GridSearchCV,
     HalvingGridSearchCV,
     HalvingRandomSearchCV,
     RandomizedSearchCV,
+    TunedThresholdClassifierCV,
 )
 from sklearn.multiclass import (
     OneVsOneClassifier,
@@ -77,6 +77,7 @@
 N, M = 100, 4
 X = rng.rand(N, M)
 y = rng.randint(0, 3, size=N)
+y_binary = (y >= 1).astype(int)
 classes = np.unique(y)
 y_multi = rng.randint(0, 3, size=(N, 3))
 classes_multi = [np.unique(y_multi[:, i]) for i in range(y_multi.shape[1])]
@@ -200,6 +201,24 @@ def enable_slep006():
         "cv_name": "cv",
         "cv_routing_methods": ["fit"],
     },
+    {
+        "metaestimator": FixedThresholdClassifier,
+        "estimator_name": "estimator",
+        "estimator": "classifier",
+        "X": X,
+        "y": y_binary,
+        "estimator_routing_methods": ["fit"],
+        "preserves_metadata": "subset",
+    },
+    {
+        "metaestimator": TunedThresholdClassifierCV,
+        "estimator_name": "estimator",
+        "estimator": "classifier",
+        "X": X,
+        "y": y_binary,
+        "estimator_routing_methods": ["fit"],
+        "preserves_metadata": "subset",
+    },
     {
         "metaestimator": OneVsRestClassifier,
         "estimator_name": "estimator",
@@ -363,6 +382,31 @@ def enable_slep006():
         "cv_name": "cv",
         "cv_routing_methods": ["fit"],
     },
+    {
+        "metaestimator": TransformedTargetRegressor,
+        "estimator": "regressor",
+        "estimator_name": "regressor",
+        "X": X,
+        "y": y,
+        "estimator_routing_methods": ["fit", "predict"],
+    },
+    {
+        "metaestimator": SelfTrainingClassifier,
+        "estimator_name": "estimator",
+        "estimator": "classifier",
+        "X": X,
+        "y": y,
+        "preserves_metadata": True,
+        "estimator_routing_methods": [
+            "fit",
+            "predict",
+            "predict_proba",
+            "predict_log_proba",
+            "decision_function",
+            "score",
+        ],
+        "method_mapping": {"fit": ["fit", "score"]},
+    },
 ]
 """List containing all metaestimators to be tested and their settings
 
@@ -406,11 +450,7 @@ def enable_slep006():
     AdaBoostRegressor(),
     RFE(ConsumingClassifier()),
     RFECV(ConsumingClassifier()),
-    SelfTrainingClassifier(ConsumingClassifier()),
     SequentialFeatureSelector(ConsumingClassifier()),
-    StackingClassifier(ConsumingClassifier()),
-    StackingRegressor(ConsumingRegressor()),
-    TransformedTargetRegressor(),
 ]
 
 
@@ -616,7 +656,7 @@ def test_error_on_missing_requests_for_sub_estimator(metaestimator):
                     value=None,
                 )
                 try:
-                    # `fit` and `partial_fit` accept y, others don't.
+                    # `fit`, `partial_fit`, 'score' accept y, others don't.
                     method(X, y, **method_kwargs)
                 except TypeError:
                     method(X, **method_kwargs)
@@ -668,13 +708,7 @@ def test_setting_request_on_sub_estimator_removes_error(metaestimator):
             )
             if "fit" not in method_name:
                 # fit before calling method
-                set_requests(
-                    estimator,
-                    method_mapping=metaestimator.get("method_mapping", {}),
-                    methods=["fit"],
-                    metadata_name=key,
-                )
-                instance.fit(X, y, **method_kwargs, **extra_method_args)
+                instance.fit(X, y)
             try:
                 # `fit` and `partial_fit` accept y, others don't.
                 method(X, y, **method_kwargs, **extra_method_args)
@@ -684,17 +718,17 @@ def test_setting_request_on_sub_estimator_removes_error(metaestimator):
             # sanity check that registry is not empty, or else the test passes
             # trivially
             assert registry
-            if preserves_metadata is True:
-                for estimator in registry:
-                    check_recorded_metadata(estimator, method_name, **method_kwargs)
-            elif preserves_metadata == "subset":
-                for estimator in registry:
-                    check_recorded_metadata(
-                        estimator,
-                        method_name,
-                        split_params=method_kwargs.keys(),
-                        **method_kwargs,
-                    )
+            split_params = (
+                method_kwargs.keys() if preserves_metadata == "subset" else ()
+            )
+            for estimator in registry:
+                check_recorded_metadata(
+                    estimator,
+                    method=method_name,
+                    parent=method_name,
+                    split_params=split_params,
+                    **method_kwargs,
+                )
 
 
 @pytest.mark.parametrize("metaestimator", METAESTIMATORS, ids=METAESTIMATOR_IDS)
@@ -746,16 +780,22 @@ def test_metadata_is_routed_correctly_to_scorer(metaestimator):
 
     cls = metaestimator["metaestimator"]
     routing_methods = metaestimator["scorer_routing_methods"]
+    method_mapping = metaestimator.get("method_mapping", {})
 
     for method_name in routing_methods:
         kwargs, (estimator, _), (scorer, registry), (cv, _) = get_init_args(
             metaestimator, sub_estimator_consumes=True
         )
-        if estimator:
-            estimator.set_fit_request(sample_weight=True, metadata=True)
         scorer.set_score_request(sample_weight=True)
         if cv:
             cv.set_split_request(groups=True, metadata=True)
+        if estimator is not None:
+            set_requests(
+                estimator,
+                method_mapping=method_mapping,
+                methods=[method_name],
+                metadata_name="sample_weight",
+            )
         instance = cls(**kwargs)
         method = getattr(instance, method_name)
         method_kwargs = {"sample_weight": sample_weight}
@@ -768,6 +808,7 @@ def test_metadata_is_routed_correctly_to_scorer(metaestimator):
             check_recorded_metadata(
                 obj=_scorer,
                 method="score",
+                parent=method_name,
                 split_params=("sample_weight",),
                 **method_kwargs,
             )
@@ -802,4 +843,6 @@ def test_metadata_is_routed_correctly_to_splitter(metaestimator):
         method(X_, y_, **method_kwargs)
         assert registry
         for _splitter in registry:
-            check_recorded_metadata(obj=_splitter, method="split", **method_kwargs)
+            check_recorded_metadata(
+                obj=_splitter, method="split", parent=method_name, **method_kwargs
+            )
diff --git a/sklearn/tests/test_min_dependencies_readme.py b/sklearn/tests/test_min_dependencies_readme.py
index 78e9bbb9f7bff..31ccf0cfbca0a 100644
--- a/sklearn/tests/test_min_dependencies_readme.py
+++ b/sklearn/tests/test_min_dependencies_readme.py
@@ -1,7 +1,6 @@
 """Tests for the minimum dependencies in README.rst and pyproject.toml"""
 
 import os
-import platform
 import re
 from collections import defaultdict
 from pathlib import Path
@@ -32,9 +31,6 @@ def test_min_dependencies_readme():
     # consistent with the minimum dependencies defined at the file:
     # sklearn/_min_dependencies.py
 
-    if platform.python_implementation() == "PyPy":
-        pytest.skip("PyPy does not always share the same minimum deps")
-
     pattern = re.compile(
         r"(\.\. \|)"
         + r"(([A-Za-z]+\-?)+)"
diff --git a/sklearn/tests/test_multiclass.py b/sklearn/tests/test_multiclass.py
index b57d681d7ebfa..4bc96bf60b805 100644
--- a/sklearn/tests/test_multiclass.py
+++ b/sklearn/tests/test_multiclass.py
@@ -57,7 +57,7 @@
 
 
 def test_ovr_exceptions():
-    ovr = OneVsRestClassifier(LinearSVC(dual="auto", random_state=0))
+    ovr = OneVsRestClassifier(LinearSVC(random_state=0))
 
     # test predicting without fitting
     with pytest.raises(NotFittedError):
@@ -86,11 +86,11 @@ def test_check_classification_targets():
 
 def test_ovr_fit_predict():
     # A classifier which implements decision_function.
-    ovr = OneVsRestClassifier(LinearSVC(dual="auto", random_state=0))
+    ovr = OneVsRestClassifier(LinearSVC(random_state=0))
     pred = ovr.fit(iris.data, iris.target).predict(iris.data)
     assert len(ovr.estimators_) == n_classes
 
-    clf = LinearSVC(dual="auto", random_state=0)
+    clf = LinearSVC(random_state=0)
     pred2 = clf.fit(iris.data, iris.target).predict(iris.data)
     assert np.mean(iris.target == pred) == np.mean(iris.target == pred2)
 
@@ -258,7 +258,7 @@ def test_ovr_multiclass():
 
     for base_clf in (
         MultinomialNB(),
-        LinearSVC(dual="auto", random_state=0),
+        LinearSVC(random_state=0),
         LinearRegression(),
         Ridge(),
         ElasticNet(),
@@ -303,7 +303,7 @@ def conduct_test(base_clf, test_predict_proba=False):
         assert y_pred == 1
 
     for base_clf in (
-        LinearSVC(dual="auto", random_state=0),
+        LinearSVC(random_state=0),
         LinearRegression(),
         Ridge(),
         ElasticNet(),
@@ -321,7 +321,7 @@ def test_ovr_multilabel():
 
     for base_clf in (
         MultinomialNB(),
-        LinearSVC(dual="auto", random_state=0),
+        LinearSVC(random_state=0),
         LinearRegression(),
         Ridge(),
         ElasticNet(),
@@ -459,7 +459,7 @@ def test_ovr_single_label_decision_function():
 
 
 def test_ovr_gridsearch():
-    ovr = OneVsRestClassifier(LinearSVC(dual="auto", random_state=0))
+    ovr = OneVsRestClassifier(LinearSVC(random_state=0))
     Cs = [0.1, 0.5, 0.8]
     cv = GridSearchCV(ovr, {"estimator__C": Cs})
     cv.fit(iris.data, iris.target)
@@ -480,7 +480,7 @@ def test_ovr_pipeline():
 
 
 def test_ovo_exceptions():
-    ovo = OneVsOneClassifier(LinearSVC(dual="auto", random_state=0))
+    ovo = OneVsOneClassifier(LinearSVC(random_state=0))
     with pytest.raises(NotFittedError):
         ovo.predict([])
 
@@ -488,7 +488,7 @@ def test_ovo_exceptions():
 def test_ovo_fit_on_list():
     # Test that OneVsOne fitting works with a list of targets and yields the
     # same output as predict from an array
-    ovo = OneVsOneClassifier(LinearSVC(dual="auto", random_state=0))
+    ovo = OneVsOneClassifier(LinearSVC(random_state=0))
     prediction_from_array = ovo.fit(iris.data, iris.target).predict(iris.data)
     iris_data_list = [list(a) for a in iris.data]
     prediction_from_list = ovo.fit(iris_data_list, list(iris.target)).predict(
@@ -499,7 +499,7 @@ def test_ovo_fit_on_list():
 
 def test_ovo_fit_predict():
     # A classifier which implements decision_function.
-    ovo = OneVsOneClassifier(LinearSVC(dual="auto", random_state=0))
+    ovo = OneVsOneClassifier(LinearSVC(random_state=0))
     ovo.fit(iris.data, iris.target).predict(iris.data)
     assert len(ovo.estimators_) == n_classes * (n_classes - 1) / 2
 
@@ -565,7 +565,7 @@ def test_ovo_partial_fit_predict():
 def test_ovo_decision_function():
     n_samples = iris.data.shape[0]
 
-    ovo_clf = OneVsOneClassifier(LinearSVC(dual="auto", random_state=0))
+    ovo_clf = OneVsOneClassifier(LinearSVC(random_state=0))
     # first binary
     ovo_clf.fit(iris.data, iris.target == 0)
     decisions = ovo_clf.decision_function(iris.data)
@@ -610,7 +610,7 @@ def test_ovo_decision_function():
 
 
 def test_ovo_gridsearch():
-    ovo = OneVsOneClassifier(LinearSVC(dual="auto", random_state=0))
+    ovo = OneVsOneClassifier(LinearSVC(random_state=0))
     Cs = [0.1, 0.5, 0.8]
     cv = GridSearchCV(ovo, {"estimator__C": Cs})
     cv.fit(iris.data, iris.target)
@@ -660,7 +660,7 @@ def test_ovo_string_y():
     X = np.eye(4)
     y = np.array(["a", "b", "c", "d"])
 
-    ovo = OneVsOneClassifier(LinearSVC(dual="auto"))
+    ovo = OneVsOneClassifier(LinearSVC())
     ovo.fit(X, y)
     assert_array_equal(y, ovo.predict(X))
 
@@ -670,7 +670,7 @@ def test_ovo_one_class():
     X = np.eye(4)
     y = np.array(["a"] * 4)
 
-    ovo = OneVsOneClassifier(LinearSVC(dual="auto"))
+    ovo = OneVsOneClassifier(LinearSVC())
     msg = "when only one class"
     with pytest.raises(ValueError, match=msg):
         ovo.fit(X, y)
@@ -681,23 +681,21 @@ def test_ovo_float_y():
     X = iris.data
     y = iris.data[:, 0]
 
-    ovo = OneVsOneClassifier(LinearSVC(dual="auto"))
+    ovo = OneVsOneClassifier(LinearSVC())
     msg = "Unknown label type"
     with pytest.raises(ValueError, match=msg):
         ovo.fit(X, y)
 
 
 def test_ecoc_exceptions():
-    ecoc = OutputCodeClassifier(LinearSVC(dual="auto", random_state=0))
+    ecoc = OutputCodeClassifier(LinearSVC(random_state=0))
     with pytest.raises(NotFittedError):
         ecoc.predict([])
 
 
 def test_ecoc_fit_predict():
     # A classifier which implements decision_function.
-    ecoc = OutputCodeClassifier(
-        LinearSVC(dual="auto", random_state=0), code_size=2, random_state=0
-    )
+    ecoc = OutputCodeClassifier(LinearSVC(random_state=0), code_size=2, random_state=0)
     ecoc.fit(iris.data, iris.target).predict(iris.data)
     assert len(ecoc.estimators_) == n_classes * 2
 
@@ -708,7 +706,7 @@ def test_ecoc_fit_predict():
 
 
 def test_ecoc_gridsearch():
-    ecoc = OutputCodeClassifier(LinearSVC(dual="auto", random_state=0), random_state=0)
+    ecoc = OutputCodeClassifier(LinearSVC(random_state=0), random_state=0)
     Cs = [0.1, 0.5, 0.8]
     cv = GridSearchCV(ecoc, {"estimator__C": Cs})
     cv.fit(iris.data, iris.target)
@@ -721,7 +719,7 @@ def test_ecoc_float_y():
     X = iris.data
     y = iris.data[:, 0]
 
-    ovo = OutputCodeClassifier(LinearSVC(dual="auto"))
+    ovo = OutputCodeClassifier(LinearSVC())
     msg = "Unknown label type"
     with pytest.raises(ValueError, match=msg):
         ovo.fit(X, y)
@@ -749,7 +747,7 @@ def test_ecoc_delegate_sparse_base_estimator(csc_container):
         ecoc.predict(X_sp)
 
     # smoke test to check when sparse input should be supported
-    ecoc = OutputCodeClassifier(LinearSVC(dual="auto", random_state=0))
+    ecoc = OutputCodeClassifier(LinearSVC(random_state=0))
     ecoc.fit(X_sp, y).predict(X_sp)
     assert len(ecoc.estimators_) == 4
 
diff --git a/sklearn/tests/test_multioutput.py b/sklearn/tests/test_multioutput.py
index 35fe162c0fae7..7c32180c27682 100644
--- a/sklearn/tests/test_multioutput.py
+++ b/sklearn/tests/test_multioutput.py
@@ -337,7 +337,7 @@ def test_multi_output_classification():
 
 def test_multiclass_multioutput_estimator():
     # test to check meta of meta estimators
-    svc = LinearSVC(dual="auto", random_state=0)
+    svc = LinearSVC(random_state=0)
     multi_class_svc = OneVsRestClassifier(svc)
     multi_target_svc = MultiOutputClassifier(multi_class_svc)
 
@@ -442,7 +442,7 @@ def test_multi_output_classification_partial_fit_sample_weights():
 def test_multi_output_exceptions():
     # NotFittedError when fit is not done but score, predict and
     # and predict_proba are called
-    moc = MultiOutputClassifier(LinearSVC(dual="auto", random_state=0))
+    moc = MultiOutputClassifier(LinearSVC(random_state=0))
     with pytest.raises(NotFittedError):
         moc.score(X, y)
 
@@ -478,7 +478,7 @@ def test_multi_output_delegate_predict_proba():
     assert hasattr(moc, "predict_proba")
 
     # A base estimator without `predict_proba` should raise an AttributeError
-    moc = MultiOutputClassifier(LinearSVC(dual="auto"))
+    moc = MultiOutputClassifier(LinearSVC())
     assert not hasattr(moc, "predict_proba")
 
     outer_msg = "'MultiOutputClassifier' has no attribute 'predict_proba'"
@@ -513,7 +513,7 @@ def test_classifier_chain_fit_and_predict_with_linear_svc(chain_method):
     # Fit classifier chain and verify predict performance using LinearSVC
     X, Y = generate_multilabel_dataset_with_correlations()
     classifier_chain = ClassifierChain(
-        LinearSVC(dual="auto"),
+        LinearSVC(),
         chain_method=chain_method,
     ).fit(X, Y)
 
diff --git a/sklearn/tests/test_pipeline.py b/sklearn/tests/test_pipeline.py
index 1d4cfb3dd6e2b..b9fba86d01e9b 100644
--- a/sklearn/tests/test_pipeline.py
+++ b/sklearn/tests/test_pipeline.py
@@ -6,6 +6,7 @@
 import re
 import shutil
 import time
+import warnings
 from tempfile import mkdtemp
 
 import joblib
@@ -334,7 +335,8 @@ def test_pipeline_raise_set_params_error():
     # expected error message
     error_msg = re.escape(
         "Invalid parameter 'fake' for estimator Pipeline(steps=[('cls',"
-        " LinearRegression())]). Valid parameters are: ['memory', 'steps', 'verbose']."
+        " LinearRegression())]). Valid parameters are: ['memory', 'steps',"
+        " 'verbose']."
     )
     with pytest.raises(ValueError, match=error_msg):
         pipe.set_params(fake="nope")
@@ -1792,6 +1794,26 @@ def test_feature_union_feature_names_in_():
     assert not hasattr(union, "feature_names_in_")
 
 
+# TODO(1.7): remove this test
+def test_pipeline_inverse_transform_Xt_deprecation():
+    X = np.random.RandomState(0).normal(size=(10, 5))
+    pipe = Pipeline([("pca", PCA(n_components=2))])
+    X = pipe.fit_transform(X)
+
+    with pytest.raises(TypeError, match="Missing required positional argument"):
+        pipe.inverse_transform()
+
+    with pytest.raises(TypeError, match="Cannot use both X and Xt. Use X only"):
+        pipe.inverse_transform(X=X, Xt=X)
+
+    with warnings.catch_warnings(record=True):
+        warnings.simplefilter("error")
+        pipe.inverse_transform(X)
+
+    with pytest.warns(FutureWarning, match="Xt was renamed X in version 1.5"):
+        pipe.inverse_transform(Xt=X)
+
+
 # Test that metadata is routed correctly for pipelines and FeatureUnion
 # =====================================================================
 
@@ -1800,45 +1822,54 @@ class SimpleEstimator(BaseEstimator):
     # This class is used in this section for testing routing in the pipeline.
     # This class should have every set_{method}_request
     def fit(self, X, y, sample_weight=None, prop=None):
-        assert sample_weight is not None
-        assert prop is not None
+        assert sample_weight is not None, sample_weight
+        assert prop is not None, prop
         return self
 
     def fit_transform(self, X, y, sample_weight=None, prop=None):
         assert sample_weight is not None
         assert prop is not None
+        return X + 1
 
     def fit_predict(self, X, y, sample_weight=None, prop=None):
         assert sample_weight is not None
         assert prop is not None
+        return np.ones(len(X))
 
     def predict(self, X, sample_weight=None, prop=None):
         assert sample_weight is not None
         assert prop is not None
+        return np.ones(len(X))
 
     def predict_proba(self, X, sample_weight=None, prop=None):
         assert sample_weight is not None
         assert prop is not None
+        return np.ones(len(X))
 
     def predict_log_proba(self, X, sample_weight=None, prop=None):
         assert sample_weight is not None
         assert prop is not None
+        return np.zeros(len(X))
 
     def decision_function(self, X, sample_weight=None, prop=None):
         assert sample_weight is not None
         assert prop is not None
+        return np.ones(len(X))
 
     def score(self, X, y, sample_weight=None, prop=None):
         assert sample_weight is not None
         assert prop is not None
+        return 1
 
     def transform(self, X, sample_weight=None, prop=None):
         assert sample_weight is not None
         assert prop is not None
+        return X + 1
 
     def inverse_transform(self, X, sample_weight=None, prop=None):
         assert sample_weight is not None
         assert prop is not None
+        return X - 1
 
 
 @pytest.mark.usefixtures("enable_slep006")
@@ -1862,7 +1893,7 @@ def set_request(est, method, **kwarg):
             getattr(est, f"set_{method}_request")(**kwarg)
         return est
 
-    X, y = [[1]], [1]
+    X, y = np.array([[1]]), np.array([1])
     sample_weight, prop, metadata = [1], "a", "b"
 
     # test that metadata is routed correctly for pipelines when requested
@@ -1878,9 +1909,7 @@ def set_request(est, method, **kwarg):
     pipeline = Pipeline([("trs", trs), ("estimator", est)])
 
     if "fit" not in method:
-        pipeline = pipeline.fit(
-            [[1]], [1], sample_weight=sample_weight, prop=prop, metadata=metadata
-        )
+        pipeline = pipeline.fit(X, y, sample_weight=sample_weight, prop=prop)
 
     try:
         getattr(pipeline, method)(
@@ -1895,10 +1924,18 @@ def set_request(est, method, **kwarg):
     # Make sure the transformer has received the metadata
     # For the transformer, always only `fit` and `transform` are called.
     check_recorded_metadata(
-        obj=trs, method="fit", sample_weight=sample_weight, metadata=metadata
+        obj=trs,
+        method="fit",
+        parent="fit",
+        sample_weight=sample_weight,
+        metadata=metadata,
     )
     check_recorded_metadata(
-        obj=trs, method="transform", sample_weight=sample_weight, metadata=metadata
+        obj=trs,
+        method="transform",
+        parent="transform",
+        sample_weight=sample_weight,
+        metadata=metadata,
     )
 
 
@@ -2053,6 +2090,7 @@ def test_feature_union_metadata_routing(transformer):
             check_recorded_metadata(
                 obj=sub_trans,
                 method="fit",
+                parent="fit",
                 **kwargs,
             )
 
diff --git a/sklearn/tests/test_public_functions.py b/sklearn/tests/test_public_functions.py
index 41629aa189941..707aa37737c1b 100644
--- a/sklearn/tests/test_public_functions.py
+++ b/sklearn/tests/test_public_functions.py
@@ -234,6 +234,7 @@ def _check_function_param_validation(
     "sklearn.metrics.consensus_score",
     "sklearn.metrics.coverage_error",
     "sklearn.metrics.d2_absolute_error_score",
+    "sklearn.metrics.d2_log_loss_score",
     "sklearn.metrics.d2_pinball_score",
     "sklearn.metrics.d2_tweedie_score",
     "sklearn.metrics.davies_bouldin_score",
diff --git a/sklearn/tree/__init__.py b/sklearn/tree/__init__.py
index 8cfb42c73e118..23ab17aa0bbbe 100644
--- a/sklearn/tree/__init__.py
+++ b/sklearn/tree/__init__.py
@@ -1,7 +1,4 @@
-"""
-The :mod:`sklearn.tree` module includes decision tree-based models for
-classification and regression.
-"""
+"""Decision tree based models for classification and regression."""
 
 from ._classes import (
     BaseDecisionTree,
diff --git a/sklearn/tree/_classes.py b/sklearn/tree/_classes.py
index 9f99d831a0990..61c572554b3b6 100644
--- a/sklearn/tree/_classes.py
+++ b/sklearn/tree/_classes.py
@@ -3,16 +3,8 @@
 randomized trees. Single and multi-output problems are both handled.
 """
 
-# Authors: Gilles Louppe <g.louppe@gmail.com>
-#          Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#          Brian Holt <bdholt1@gmail.com>
-#          Noel Dawe <noel@dawe.me>
-#          Satrajit Gosh <satrajit.ghosh@gmail.com>
-#          Joly Arnaud <arnaud.v.joly@gmail.com>
-#          Fares Hedayati <fares.hedayati@gmail.com>
-#          Nelson Liu <nelson@nelsonliu.me>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import copy
 import numbers
@@ -1082,7 +1074,7 @@ def predict_log_proba(self, X):
     def _more_tags(self):
         # XXX: nan is only support for dense arrays, but we set this for common test to
         # pass, specifically: check_estimators_nan_inf
-        allow_nan = self.splitter == "best" and self.criterion in {
+        allow_nan = self.splitter in ("best", "random") and self.criterion in {
             "gini",
             "log_loss",
             "entropy",
@@ -1413,7 +1405,7 @@ def _compute_partial_dependence_recursion(self, grid, target_features):
     def _more_tags(self):
         # XXX: nan is only support for dense arrays, but we set this for common test to
         # pass, specifically: check_estimators_nan_inf
-        allow_nan = self.splitter == "best" and self.criterion in {
+        allow_nan = self.splitter in ("best", "random") and self.criterion in {
             "squared_error",
             "friedman_mse",
             "poisson",
@@ -1694,6 +1686,16 @@ def __init__(
             monotonic_cst=monotonic_cst,
         )
 
+    def _more_tags(self):
+        # XXX: nan is only supported for dense arrays, but we set this for the
+        # common test to pass, specifically: check_estimators_nan_inf
+        allow_nan = self.splitter == "random" and self.criterion in {
+            "gini",
+            "log_loss",
+            "entropy",
+        }
+        return {"multilabel": True, "allow_nan": allow_nan}
+
 
 class ExtraTreeRegressor(DecisionTreeRegressor):
     """An extremely randomized tree regressor.
@@ -1937,3 +1939,13 @@ def __init__(
             ccp_alpha=ccp_alpha,
             monotonic_cst=monotonic_cst,
         )
+
+    def _more_tags(self):
+        # XXX: nan is only supported for dense arrays, but we set this for the
+        # common test to pass, specifically: check_estimators_nan_inf
+        allow_nan = self.splitter == "random" and self.criterion in {
+            "squared_error",
+            "friedman_mse",
+            "poisson",
+        }
+        return {"allow_nan": allow_nan}
diff --git a/sklearn/tree/_criterion.pxd b/sklearn/tree/_criterion.pxd
index ccf7c3c26635c..84d2e800d6a87 100644
--- a/sklearn/tree/_criterion.pxd
+++ b/sklearn/tree/_criterion.pxd
@@ -1,11 +1,5 @@
-# Authors: Gilles Louppe <g.louppe@gmail.com>
-#          Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#          Brian Holt <bdholt1@gmail.com>
-#          Joel Nothman <joel.nothman@gmail.com>
-#          Arnaud Joly <arnaud.v.joly@gmail.com>
-#          Jacob Schreiber <jmschreiber91@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # See _criterion.pyx for implementation details.
 from ..utils._typedefs cimport float64_t, int8_t, intp_t
diff --git a/sklearn/tree/_criterion.pyx b/sklearn/tree/_criterion.pyx
index d694a8a00057c..9f3db83399569 100644
--- a/sklearn/tree/_criterion.pyx
+++ b/sklearn/tree/_criterion.pyx
@@ -1,16 +1,5 @@
-# Authors: Gilles Louppe <g.louppe@gmail.com>
-#          Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#          Brian Holt <bdholt1@gmail.com>
-#          Noel Dawe <noel@dawe.me>
-#          Satrajit Gosh <satrajit.ghosh@gmail.com>
-#          Lars Buitinck
-#          Arnaud Joly <arnaud.v.joly@gmail.com>
-#          Joel Nothman <joel.nothman@gmail.com>
-#          Fares Hedayati <fares.hedayati@gmail.com>
-#          Jacob Schreiber <jmschreiber91@gmail.com>
-#          Nelson Liu <nelson@nelsonliu.me>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from libc.string cimport memcpy
 from libc.string cimport memset
diff --git a/sklearn/tree/_export.py b/sklearn/tree/_export.py
index dd3c6551739fc..14b9be332f676 100644
--- a/sklearn/tree/_export.py
+++ b/sklearn/tree/_export.py
@@ -2,15 +2,8 @@
 This module defines export functions for decision trees.
 """
 
-# Authors: Gilles Louppe <g.louppe@gmail.com>
-#          Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#          Brian Holt <bdholt1@gmail.com>
-#          Noel Dawe <noel@dawe.me>
-#          Satrajit Gosh <satrajit.ghosh@gmail.com>
-#          Trevor Stephens <trev.stephens@gmail.com>
-#          Li Li <aiki.nogard@gmail.com>
-#          Giuseppe Vettigli <vettigli@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 from collections.abc import Iterable
 from io import StringIO
 from numbers import Integral
@@ -266,7 +259,12 @@ def get_fill_color(self, tree, node_id):
             self.colors["rgb"] = _color_brew(tree.n_classes[0])
             if tree.n_outputs != 1:
                 # Find max and min impurities for multi-output
-                self.colors["bounds"] = (np.min(-tree.impurity), np.max(-tree.impurity))
+                # The next line uses -max(impurity) instead of min(-impurity)
+                # and -min(impurity) instead of max(-impurity) on purpose, in
+                # order to avoid what looks like an issue with SIMD on non
+                # memory aligned arrays on 32bit OS. For more details see
+                # https://github.com/scikit-learn/scikit-learn/issues/27506.
+                self.colors["bounds"] = (-np.max(tree.impurity), -np.min(tree.impurity))
             elif tree.n_classes[0] == 1 and len(np.unique(tree.value)) != 1:
                 # Find max and min values in leaf nodes for regression
                 self.colors["bounds"] = (np.min(tree.value), np.max(tree.value))
diff --git a/sklearn/tree/_reingold_tilford.py b/sklearn/tree/_reingold_tilford.py
index 8f0b6af08bd51..9801158166e1e 100644
--- a/sklearn/tree/_reingold_tilford.py
+++ b/sklearn/tree/_reingold_tilford.py
@@ -1,5 +1,5 @@
-# Authors: William Mill (bill@billmill.org)
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 
diff --git a/sklearn/tree/_splitter.pxd b/sklearn/tree/_splitter.pxd
index b624f989cf79b..6b96878fb88ad 100644
--- a/sklearn/tree/_splitter.pxd
+++ b/sklearn/tree/_splitter.pxd
@@ -1,11 +1,5 @@
-# Authors: Gilles Louppe <g.louppe@gmail.com>
-#          Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#          Brian Holt <bdholt1@gmail.com>
-#          Joel Nothman <joel.nothman@gmail.com>
-#          Arnaud Joly <arnaud.v.joly@gmail.com>
-#          Jacob Schreiber <jmschreiber91@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # See _splitter.pyx for details.
 from ._criterion cimport Criterion
diff --git a/sklearn/tree/_splitter.pyx b/sklearn/tree/_splitter.pyx
index 5872683f416d5..7bd0dbe71d0f0 100644
--- a/sklearn/tree/_splitter.pyx
+++ b/sklearn/tree/_splitter.pyx
@@ -1,15 +1,5 @@
-# Authors: Gilles Louppe <g.louppe@gmail.com>
-#          Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#          Brian Holt <bdholt1@gmail.com>
-#          Noel Dawe <noel@dawe.me>
-#          Satrajit Gosh <satrajit.ghosh@gmail.com>
-#          Lars Buitinck
-#          Arnaud Joly <arnaud.v.joly@gmail.com>
-#          Joel Nothman <joel.nothman@gmail.com>
-#          Fares Hedayati <fares.hedayati@gmail.com>
-#          Jacob Schreiber <jmschreiber91@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from cython cimport final
 from libc.math cimport isnan
@@ -29,6 +19,9 @@ from scipy.sparse import issparse
 
 cdef float64_t INFINITY = np.inf
 
+# Allow for 32 bit float comparisons
+cdef float32_t INFINITY_32t = np.inf
+
 # Mitigate precision differences between 32 bit and 64 bit
 cdef float32_t FEATURE_THRESHOLD = 1e-7
 
@@ -296,14 +289,15 @@ cdef inline int node_split_best(
     Criterion criterion,
     SplitRecord* split,
     ParentInfo* parent_record,
-    bint with_monotonic_cst,
-    const int8_t[:] monotonic_cst,
 ) except -1 nogil:
     """Find the best split on node samples[start:end]
 
     Returns -1 in case of failure to allocate memory (and raise MemoryError)
     or 0 otherwise.
     """
+    cdef const int8_t[:] monotonic_cst = splitter.monotonic_cst
+    cdef bint with_monotonic_cst = splitter.with_monotonic_cst
+
     # Find the best split
     cdef intp_t start = splitter.start
     cdef intp_t end = splitter.end
@@ -488,6 +482,10 @@ cdef inline int node_split_best(
                         current_split.threshold = feature_values[p_prev]
 
                     current_split.n_missing = n_missing
+
+                    # if there are no missing values in the training data, during
+                    # test time, we send missing values to the branch that contains
+                    # the most samples during training time.
                     if n_missing == 0:
                         current_split.missing_go_to_left = n_left > n_right
                     else:
@@ -677,18 +675,25 @@ cdef inline int node_split_random(
     Criterion criterion,
     SplitRecord* split,
     ParentInfo* parent_record,
-    bint with_monotonic_cst,
-    const int8_t[:] monotonic_cst,
 ) except -1 nogil:
     """Find the best random split on node samples[start:end]
 
     Returns -1 in case of failure to allocate memory (and raise MemoryError)
     or 0 otherwise.
     """
+    cdef const int8_t[:] monotonic_cst = splitter.monotonic_cst
+    cdef bint with_monotonic_cst = splitter.with_monotonic_cst
+
     # Draw random splits and pick the best
     cdef intp_t start = splitter.start
     cdef intp_t end = splitter.end
+    cdef intp_t end_non_missing
+    cdef intp_t n_missing = 0
+    cdef bint has_missing = 0
+    cdef intp_t n_left, n_right
+    cdef bint missing_go_to_left
 
+    cdef intp_t[::1] samples = splitter.samples
     cdef intp_t[::1] features = splitter.features
     cdef intp_t[::1] constant_features = splitter.constant_features
     cdef intp_t n_features = splitter.n_features
@@ -766,12 +771,22 @@ cdef inline int node_split_random(
 
         current_split.feature = features[f_j]
 
-        # Find min, max
+        # Find min, max as we will randomly select a threshold between them
         partitioner.find_min_max(
             current_split.feature, &min_feature_value, &max_feature_value
         )
+        n_missing = partitioner.n_missing
+        end_non_missing = end - n_missing
 
-        if max_feature_value <= min_feature_value + FEATURE_THRESHOLD:
+        if (
+            # All values for this feature are missing, or
+            end_non_missing == start or
+            # This feature is considered constant (max - min <= FEATURE_THRESHOLD)
+            max_feature_value <= min_feature_value + FEATURE_THRESHOLD
+        ):
+            # We consider this feature constant in this case.
+            # Since finding a split with a constant feature is not valuable,
+            # we do not consider this feature for splitting.
             features[f_j], features[n_total_constants] = features[n_total_constants], current_split.feature
 
             n_found_constants += 1
@@ -780,6 +795,8 @@ cdef inline int node_split_random(
 
         f_i -= 1
         features[f_i], features[f_j] = features[f_j], features[f_i]
+        has_missing = n_missing != 0
+        criterion.init_missing(n_missing)
 
         # Draw a random threshold
         current_split.threshold = rand_uniform(
@@ -788,15 +805,38 @@ cdef inline int node_split_random(
             random_state,
         )
 
+        if has_missing:
+            # If there are missing values, then we randomly make all missing
+            # values go to the right or left.
+            #
+            # Note: compared to the BestSplitter, we do not evaluate the
+            # edge case where all the missing values go to the right node
+            # and the non-missing values go to the left node. This is because
+            # this would indicate a threshold outside of the observed range
+            # of the feature. However, it is not clear how much probability weight should
+            # be given to this edge case.
+            missing_go_to_left = rand_int(0, 2, random_state)
+        else:
+            missing_go_to_left = 0
+        criterion.missing_go_to_left = missing_go_to_left
+
         if current_split.threshold == max_feature_value:
             current_split.threshold = min_feature_value
 
         # Partition
-        current_split.pos = partitioner.partition_samples(current_split.threshold)
+        current_split.pos = partitioner.partition_samples(
+            current_split.threshold
+        )
+
+        if missing_go_to_left:
+            n_left = current_split.pos - start + n_missing
+            n_right = end_non_missing - current_split.pos
+        else:
+            n_left = current_split.pos - start
+            n_right = end_non_missing - current_split.pos + n_missing
 
         # Reject if min_samples_leaf is not guaranteed
-        if (((current_split.pos - start) < min_samples_leaf) or
-                ((end - current_split.pos) < min_samples_leaf)):
+        if n_left < min_samples_leaf or n_right < min_samples_leaf:
             continue
 
         # Evaluate split
@@ -825,16 +865,30 @@ cdef inline int node_split_random(
         current_proxy_improvement = criterion.proxy_impurity_improvement()
 
         if current_proxy_improvement > best_proxy_improvement:
+            current_split.n_missing = n_missing
+
+            # if there are no missing values in the training data, during
+            # test time, we send missing values to the branch that contains
+            # the most samples during training time.
+            if has_missing:
+                current_split.missing_go_to_left = missing_go_to_left
+            else:
+                current_split.missing_go_to_left = n_left > n_right
+
             best_proxy_improvement = current_proxy_improvement
             best_split = current_split  # copy
 
     # Reorganize into samples[start:best.pos] + samples[best.pos:end]
     if best_split.pos < end:
         if current_split.feature != best_split.feature:
-            # TODO: Pass in best.n_missing when random splitter supports missing values.
             partitioner.partition_samples_final(
-                best_split.pos, best_split.threshold, best_split.feature, 0
+                best_split.pos,
+                best_split.threshold,
+                best_split.feature,
+                best_split.n_missing
             )
+        criterion.init_missing(best_split.n_missing)
+        criterion.missing_go_to_left = best_split.missing_go_to_left
 
         criterion.reset()
         criterion.update(best_split.pos)
@@ -842,9 +896,13 @@ cdef inline int node_split_random(
             &best_split.impurity_left, &best_split.impurity_right
         )
         best_split.improvement = criterion.impurity_improvement(
-            impurity, best_split.impurity_left, best_split.impurity_right
+            impurity,
+            best_split.impurity_left,
+            best_split.impurity_right
         )
 
+        shift_missing_values_to_left_if_required(&best_split, samples, end)
+
     # Respect invariant for constant features: the original order of
     # element in features[:n_known_constants] must be preserved for sibling
     # and child nodes
@@ -949,29 +1007,68 @@ cdef class DensePartitioner:
         float32_t* min_feature_value_out,
         float32_t* max_feature_value_out,
     ) noexcept nogil:
-        """Find the minimum and maximum value for current_feature."""
+        """Find the minimum and maximum value for current_feature.
+
+        Missing values are stored at the end of feature_values.
+        The number of missing values observed in feature_values is stored
+        in self.n_missing.
+        """
         cdef:
-            intp_t p
+            intp_t p, current_end
             float32_t current_feature_value
             const float32_t[:, :] X = self.X
             intp_t[::1] samples = self.samples
-            float32_t min_feature_value = X[samples[self.start], current_feature]
-            float32_t max_feature_value = min_feature_value
+            float32_t min_feature_value = INFINITY_32t
+            float32_t max_feature_value = -INFINITY_32t
             float32_t[::1] feature_values = self.feature_values
+            intp_t n_missing = 0
+            const unsigned char[::1] missing_values_in_feature_mask = self.missing_values_in_feature_mask
+
+        # We are copying the values into an array and
+        # finding min/max of the array in a manner which utilizes the cache more
+        # effectively. We need to also count the number of missing-values there are
+        if missing_values_in_feature_mask is not None and missing_values_in_feature_mask[current_feature]:
+            p, current_end = self.start, self.end - 1
+            # Missing values are placed at the end and do not participate in the
+            # min/max calculation.
+            while p <= current_end:
+                # Finds the right-most value that is not missing so that
+                # it can be swapped with missing values towards its left.
+                if isnan(X[samples[current_end], current_feature]):
+                    n_missing += 1
+                    current_end -= 1
+                    continue
 
-        feature_values[self.start] = min_feature_value
+                # X[samples[current_end], current_feature] is a non-missing value
+                if isnan(X[samples[p], current_feature]):
+                    samples[p], samples[current_end] = samples[current_end], samples[p]
+                    n_missing += 1
+                    current_end -= 1
 
-        for p in range(self.start + 1, self.end):
-            current_feature_value = X[samples[p], current_feature]
-            feature_values[p] = current_feature_value
+                current_feature_value = X[samples[p], current_feature]
+                feature_values[p] = current_feature_value
+                if current_feature_value < min_feature_value:
+                    min_feature_value = current_feature_value
+                elif current_feature_value > max_feature_value:
+                    max_feature_value = current_feature_value
+                p += 1
+        else:
+            min_feature_value = X[samples[self.start], current_feature]
+            max_feature_value = min_feature_value
 
-            if current_feature_value < min_feature_value:
-                min_feature_value = current_feature_value
-            elif current_feature_value > max_feature_value:
-                max_feature_value = current_feature_value
+            feature_values[self.start] = min_feature_value
+            for p in range(self.start + 1, self.end):
+                current_feature_value = X[samples[p], current_feature]
+                feature_values[p] = current_feature_value
+
+                if current_feature_value < min_feature_value:
+                    min_feature_value = current_feature_value
+                elif current_feature_value > max_feature_value:
+                    max_feature_value = current_feature_value
 
         min_feature_value_out[0] = min_feature_value
         max_feature_value_out[0] = max_feature_value
+        self.n_missing = n_missing
 
     cdef inline void next_p(self, intp_t* p_prev, intp_t* p) noexcept nogil:
         """Compute the next p_prev and p for iteratiing over feature values.
@@ -994,7 +1091,10 @@ cdef class DensePartitioner:
         # (feature_values[p] >= end) or (feature_values[p] > feature_values[p - 1])
         p[0] += 1
 
-    cdef inline intp_t partition_samples(self, float64_t current_threshold) noexcept nogil:
+    cdef inline intp_t partition_samples(
+        self,
+        float64_t current_threshold
+    ) noexcept nogil:
         """Partition samples for feature_values at the current_threshold."""
         cdef:
             intp_t p = self.start
@@ -1241,7 +1341,10 @@ cdef class SparsePartitioner:
         p_prev[0] = p[0]
         p[0] = p_next
 
-    cdef inline intp_t partition_samples(self, float64_t current_threshold) noexcept nogil:
+    cdef inline intp_t partition_samples(
+        self,
+        float64_t current_threshold
+    ) noexcept nogil:
         """Partition samples for feature_values at the current_threshold."""
         return self._partition(current_threshold, self.start_positive)
 
@@ -1522,8 +1625,6 @@ cdef class BestSplitter(Splitter):
             self.criterion,
             split,
             parent_record,
-            self.with_monotonic_cst,
-            self.monotonic_cst,
         )
 
 cdef class BestSparseSplitter(Splitter):
@@ -1552,8 +1653,6 @@ cdef class BestSparseSplitter(Splitter):
             self.criterion,
             split,
             parent_record,
-            self.with_monotonic_cst,
-            self.monotonic_cst,
         )
 
 cdef class RandomSplitter(Splitter):
@@ -1582,8 +1681,6 @@ cdef class RandomSplitter(Splitter):
             self.criterion,
             split,
             parent_record,
-            self.with_monotonic_cst,
-            self.monotonic_cst,
         )
 
 cdef class RandomSparseSplitter(Splitter):
@@ -1611,6 +1708,4 @@ cdef class RandomSparseSplitter(Splitter):
             self.criterion,
             split,
             parent_record,
-            self.with_monotonic_cst,
-            self.monotonic_cst,
         )
diff --git a/sklearn/tree/_tree.pxd b/sklearn/tree/_tree.pxd
index 870f7fe875b0c..275b34f187e0f 100644
--- a/sklearn/tree/_tree.pxd
+++ b/sklearn/tree/_tree.pxd
@@ -1,12 +1,5 @@
-# Authors: Gilles Louppe <g.louppe@gmail.com>
-#          Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#          Brian Holt <bdholt1@gmail.com>
-#          Joel Nothman <joel.nothman@gmail.com>
-#          Arnaud Joly <arnaud.v.joly@gmail.com>
-#          Jacob Schreiber <jmschreiber91@gmail.com>
-#          Nelson Liu <nelson@nelsonliu.me>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # See _tree.pyx for details.
 
diff --git a/sklearn/tree/_tree.pyx b/sklearn/tree/_tree.pyx
index 712e352b000ab..1dfacbf068767 100644
--- a/sklearn/tree/_tree.pyx
+++ b/sklearn/tree/_tree.pyx
@@ -1,16 +1,5 @@
-# Authors: Gilles Louppe <g.louppe@gmail.com>
-#          Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#          Brian Holt <bdholt1@gmail.com>
-#          Noel Dawe <noel@dawe.me>
-#          Satrajit Gosh <satrajit.ghosh@gmail.com>
-#          Lars Buitinck
-#          Arnaud Joly <arnaud.v.joly@gmail.com>
-#          Joel Nothman <joel.nothman@gmail.com>
-#          Fares Hedayati <fares.hedayati@gmail.com>
-#          Jacob Schreiber <jmschreiber91@gmail.com>
-#          Nelson Liu <nelson@nelsonliu.me>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from cpython cimport Py_INCREF, PyObject, PyTypeObject
 
@@ -22,6 +11,7 @@ from libc.math cimport isnan
 from libcpp.vector cimport vector
 from libcpp.algorithm cimport pop_heap
 from libcpp.algorithm cimport push_heap
+from libcpp.stack cimport stack
 from libcpp cimport bool
 
 import struct
@@ -43,15 +33,6 @@ cdef extern from "numpy/arrayobject.h":
                                 void* data, int flags, object obj)
     int PyArray_SetBaseObject(cnp.ndarray arr, PyObject* obj)
 
-cdef extern from "<stack>" namespace "std" nogil:
-    cdef cppclass stack[T]:
-        ctypedef T value_type
-        stack() except +
-        bint empty()
-        void pop()
-        void push(T&) except +  # Raise c++ exception for bad_alloc -> MemoryError
-        T& top()
-
 # =============================================================================
 # Types and constants
 # =============================================================================
diff --git a/sklearn/tree/_utils.pxd b/sklearn/tree/_utils.pxd
index b59d18879ca94..014845e67a248 100644
--- a/sklearn/tree/_utils.pxd
+++ b/sklearn/tree/_utils.pxd
@@ -1,10 +1,5 @@
-# Authors: Gilles Louppe <g.louppe@gmail.com>
-#          Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#          Arnaud Joly <arnaud.v.joly@gmail.com>
-#          Jacob Schreiber <jmschreiber91@gmail.com>
-#          Nelson Liu <nelson@nelsonliu.me>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # See _utils.pyx for details.
 
diff --git a/sklearn/tree/_utils.pyx b/sklearn/tree/_utils.pyx
index 21b21df9c3007..a68c073ac2a89 100644
--- a/sklearn/tree/_utils.pyx
+++ b/sklearn/tree/_utils.pyx
@@ -1,11 +1,5 @@
-# Authors: Gilles Louppe <g.louppe@gmail.com>
-#          Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#          Arnaud Joly <arnaud.v.joly@gmail.com>
-#          Jacob Schreiber <jmschreiber91@gmail.com>
-#          Nelson Liu <nelson@nelsonliu.me>
-#
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from libc.stdlib cimport free
 from libc.stdlib cimport realloc
diff --git a/sklearn/tree/meson.build b/sklearn/tree/meson.build
index 12c1ddcedea98..4bc4e0cf9e464 100644
--- a/sklearn/tree/meson.build
+++ b/sklearn/tree/meson.build
@@ -16,7 +16,7 @@ tree_extension_metadata = {
 foreach ext_name, ext_dict : tree_extension_metadata
   py.extension_module(
     ext_name,
-    ext_dict.get('sources'),
+    [ext_dict.get('sources'), utils_cython_tree],
     dependencies: [np_dep],
     override_options : ext_dict.get('override_options', []),
     cython_args: cython_args,
diff --git a/sklearn/tree/tests/test_monotonic_tree.py b/sklearn/tree/tests/test_monotonic_tree.py
index 6478c2e2dfd85..6d89c4ae3f8bb 100644
--- a/sklearn/tree/tests/test_monotonic_tree.py
+++ b/sklearn/tree/tests/test_monotonic_tree.py
@@ -191,18 +191,22 @@ def test_multiple_output_raises(TreeClassifier):
 
 
 @pytest.mark.parametrize(
-    "DecisionTreeEstimator", [DecisionTreeClassifier, DecisionTreeRegressor]
+    "Tree",
+    [
+        DecisionTreeClassifier,
+        DecisionTreeRegressor,
+        ExtraTreeClassifier,
+        ExtraTreeRegressor,
+    ],
 )
-def test_missing_values_raises(DecisionTreeEstimator):
+def test_missing_values_raises(Tree):
     X, y = make_classification(
         n_samples=100, n_features=5, n_classes=2, n_informative=3, random_state=0
     )
     X[0, 0] = np.nan
     monotonic_cst = np.zeros(X.shape[1])
     monotonic_cst[0] = 1
-    est = DecisionTreeEstimator(
-        max_depth=None, monotonic_cst=monotonic_cst, random_state=0
-    )
+    est = Tree(max_depth=None, monotonic_cst=monotonic_cst, random_state=0)
 
     msg = "Input X contains NaN"
     with pytest.raises(ValueError, match=msg):
diff --git a/sklearn/tree/tests/test_tree.py b/sklearn/tree/tests/test_tree.py
index 6bf2d6f65b8ec..b59c857e3dccd 100644
--- a/sklearn/tree/tests/test_tree.py
+++ b/sklearn/tree/tests/test_tree.py
@@ -20,7 +20,7 @@
 from sklearn.exceptions import NotFittedError
 from sklearn.impute import SimpleImputer
 from sklearn.metrics import accuracy_score, mean_poisson_deviance, mean_squared_error
-from sklearn.model_selection import train_test_split
+from sklearn.model_selection import cross_val_score, train_test_split
 from sklearn.pipeline import make_pipeline
 from sklearn.random_projection import _sparse_random_matrix
 from sklearn.tree import (
@@ -2392,8 +2392,8 @@ def test_min_sample_split_1_error(Tree):
 
 
 @pytest.mark.parametrize("criterion", ["squared_error", "friedman_mse"])
-def test_missing_values_on_equal_nodes_no_missing(criterion):
-    """Check missing values goes to correct node during predictions"""
+def test_missing_values_best_splitter_on_equal_nodes_no_missing(criterion):
+    """Check missing values goes to correct node during predictions."""
     X = np.array([[0, 1, 2, 3, 8, 9, 11, 12, 15]]).T
     y = np.array([0.1, 0.2, 0.3, 0.2, 1.4, 1.4, 1.5, 1.6, 2.6])
 
@@ -2417,6 +2417,41 @@ def test_missing_values_on_equal_nodes_no_missing(criterion):
     assert_allclose(y_pred, [np.mean(y_equal[-4:])])
 
 
+@pytest.mark.parametrize("seed", range(3))
+@pytest.mark.parametrize("criterion", ["squared_error", "friedman_mse"])
+def test_missing_values_random_splitter_on_equal_nodes_no_missing(criterion, seed):
+    """Check missing values go to the correct node during predictions for ExtraTree.
+
+    Since ETC use random splits, we use different seeds to verify that the
+    left/right node is chosen correctly when the splits occur.
+    """
+    X = np.array([[0, 1, 2, 3, 8, 9, 11, 12, 15]]).T
+    y = np.array([0.1, 0.2, 0.3, 0.2, 1.4, 1.4, 1.5, 1.6, 2.6])
+
+    etr = ExtraTreeRegressor(random_state=seed, max_depth=1, criterion=criterion)
+    etr.fit(X, y)
+
+    # Get the left and right children of the root node
+    left_child = etr.tree_.children_left[0]
+    right_child = etr.tree_.children_right[0]
+
+    # Get the number of samples for the left and right children
+    left_samples = etr.tree_.weighted_n_node_samples[left_child]
+    right_samples = etr.tree_.weighted_n_node_samples[right_child]
+    went_left = left_samples > right_samples
+
+    # predictions
+    y_pred_left = etr.tree_.value[left_child][0]
+    y_pred_right = etr.tree_.value[right_child][0]
+
+    # Goes to node with the most data points
+    y_pred = etr.predict([[np.nan]])
+    if went_left:
+        assert_allclose(y_pred_left, y_pred)
+    else:
+        assert_allclose(y_pred_right, y_pred)
+
+
 @pytest.mark.parametrize("criterion", ["entropy", "gini"])
 def test_missing_values_best_splitter_three_classes(criterion):
     """Test when missing values are uniquely present in a class among 3 classes."""
@@ -2466,7 +2501,7 @@ def test_missing_values_best_splitter_to_right(criterion):
 
 
 @pytest.mark.parametrize("criterion", ["entropy", "gini"])
-def test_missing_values_missing_both_classes_has_nan(criterion):
+def test_missing_values_best_splitter_missing_both_classes_has_nan(criterion):
     """Check behavior of missing value when there is one missing value in each class."""
     X = np.array([[1, 2, 3, 5, np.nan, 10, 20, 30, 60, np.nan]]).T
     y = np.array([0] * 5 + [1] * 5)
@@ -2485,8 +2520,8 @@ def test_missing_values_missing_both_classes_has_nan(criterion):
 @pytest.mark.parametrize(
     "tree",
     [
-        DecisionTreeClassifier(splitter="random"),
         DecisionTreeRegressor(criterion="absolute_error"),
+        ExtraTreeRegressor(criterion="absolute_error"),
     ],
 )
 def test_missing_value_errors(sparse_container, tree):
@@ -2502,7 +2537,8 @@ def test_missing_value_errors(sparse_container, tree):
         tree.fit(X, y)
 
 
-def test_missing_values_poisson():
+@pytest.mark.parametrize("Tree", REG_TREES.values())
+def test_missing_values_poisson(Tree):
     """Smoke test for poisson regression and missing values."""
     X, y = diabetes.data.copy(), diabetes.target
 
@@ -2510,7 +2546,7 @@ def test_missing_values_poisson():
     X[::5, 0] = np.nan
     X[::6, -1] = np.nan
 
-    reg = DecisionTreeRegressor(criterion="poisson", random_state=42)
+    reg = Tree(criterion="poisson", random_state=42)
     reg.fit(X, y)
 
     y_pred = reg.predict(X)
@@ -2524,20 +2560,31 @@ def make_friedman1_classification(*args, **kwargs):
 
 
 @pytest.mark.parametrize(
-    "make_data,Tree",
+    "make_data, Tree, tolerance",
     [
-        (datasets.make_friedman1, DecisionTreeRegressor),
-        (make_friedman1_classification, DecisionTreeClassifier),
+        # Due to the sine link between X and y, we expect the native handling of
+        # missing values to always be better than the naive mean imputation in the
+        # regression case.
+        #
+        # Due to randomness in ExtraTree, we expect the native handling of missing
+        # values to be sometimes better than the naive mean imputation, but not always
+        (datasets.make_friedman1, DecisionTreeRegressor, 0),
+        (datasets.make_friedman1, ExtraTreeRegressor, 0.07),
+        (make_friedman1_classification, DecisionTreeClassifier, 0.03),
+        (make_friedman1_classification, ExtraTreeClassifier, 0.12),
     ],
 )
 @pytest.mark.parametrize("sample_weight_train", [None, "ones"])
 def test_missing_values_is_resilience(
-    make_data, Tree, sample_weight_train, global_random_seed
+    make_data, Tree, sample_weight_train, global_random_seed, tolerance
 ):
     """Check that trees can deal with missing values have decent performance."""
     n_samples, n_features = 5_000, 10
     X, y = make_data(
-        n_samples=n_samples, n_features=n_features, random_state=global_random_seed
+        n_samples=n_samples,
+        n_features=n_features,
+        noise=1.0,
+        random_state=global_random_seed,
     )
 
     X_missing = X.copy()
@@ -2551,28 +2598,37 @@ def test_missing_values_is_resilience(
     else:
         sample_weight = None
 
-    native_tree = Tree(max_depth=10, random_state=global_random_seed)
+    # max_depth is used to avoid overfitting and also improve the runtime
+    # of the test.
+    max_depth = 10
+    native_tree = Tree(max_depth=max_depth, random_state=global_random_seed)
     native_tree.fit(X_missing_train, y_train, sample_weight=sample_weight)
     score_native_tree = native_tree.score(X_missing_test, y_test)
 
     tree_with_imputer = make_pipeline(
-        SimpleImputer(), Tree(max_depth=10, random_state=global_random_seed)
+        SimpleImputer(), Tree(max_depth=max_depth, random_state=global_random_seed)
     )
     tree_with_imputer.fit(X_missing_train, y_train)
     score_tree_with_imputer = tree_with_imputer.score(X_missing_test, y_test)
 
-    assert (
-        score_native_tree > score_tree_with_imputer
-    ), f"{score_native_tree=} should be strictly greater than {score_tree_with_imputer}"
+    assert score_native_tree + tolerance > score_tree_with_imputer, (
+        f"{score_native_tree=} + {tolerance} should be strictly greater than"
+        f" {score_tree_with_imputer}"
+    )
 
 
-def test_missing_value_is_predictive():
+# A single ExtraTree will randomly send missing values down the left, or right child,
+# and therefore will not necessarily have the same performance as the greedy
+# handling of missing values.
+@pytest.mark.parametrize("Tree, expected_score", zip(CLF_TREES.values(), [0.85, 0.53]))
+def test_missing_value_is_predictive(Tree, expected_score, global_random_seed):
     """Check the tree learns when only the missing value is predictive."""
     rng = np.random.RandomState(0)
-    n_samples = 1000
+    n_samples = 500
 
-    X = rng.standard_normal(size=(n_samples, 10))
-    y = rng.randint(0, high=2, size=n_samples)
+    X = rng.standard_normal(size=(n_samples, 20))
+    y = np.concatenate([np.zeros(n_samples // 2), np.ones(n_samples // 2)])
+    # y = rng.randint(0, high=2, size=n_samples)
 
     # Create a predictive feature using `y` and with some noise
     X_random_mask = rng.choice([False, True], size=n_samples, p=[0.95, 0.05])
@@ -2584,11 +2640,14 @@ def test_missing_value_is_predictive():
 
     X[:, 5] = X_predictive
 
-    X_train, X_test, y_train, y_test = train_test_split(X, y, random_state=rng)
-    tree = DecisionTreeClassifier(random_state=rng).fit(X_train, y_train)
+    tree = Tree(random_state=global_random_seed)
 
-    assert tree.score(X_train, y_train) >= 0.85
-    assert tree.score(X_test, y_test) >= 0.85
+    # Check that the tree can learn the predictive feature
+    # over an average of cross-validation fits.
+    tree_cv_score = cross_val_score(tree, X, y, cv=5).mean()
+    assert (
+        tree_cv_score >= expected_score
+    ), f"Expected CV score: {expected_score} but got {tree_cv_score}"
 
 
 @pytest.mark.parametrize(
@@ -2633,6 +2692,7 @@ def test_deterministic_pickle():
     assert pickle1 == pickle2
 
 
+@pytest.mark.parametrize("Tree", [DecisionTreeRegressor, ExtraTreeRegressor])
 @pytest.mark.parametrize(
     "X",
     [
@@ -2645,7 +2705,7 @@ def test_deterministic_pickle():
     ],
 )
 @pytest.mark.parametrize("criterion", ["squared_error", "friedman_mse"])
-def test_regression_tree_missing_values_toy(X, criterion):
+def test_regression_tree_missing_values_toy(Tree, X, criterion):
     """Check that we properly handle missing values in regression trees using a toy
     dataset.
 
@@ -2662,11 +2722,15 @@ def test_regression_tree_missing_values_toy(X, criterion):
     X = X.reshape(-1, 1)
     y = np.arange(6)
 
-    tree = DecisionTreeRegressor(criterion=criterion, random_state=0).fit(X, y)
+    tree = Tree(criterion=criterion, random_state=0).fit(X, y)
     tree_ref = clone(tree).fit(y.reshape(-1, 1), y)
+
     assert all(tree.tree_.impurity >= 0)  # MSE should always be positive
-    # Check the impurity match after the first split
-    assert_allclose(tree.tree_.impurity[:2], tree_ref.tree_.impurity[:2])
+
+    # Note: the impurity matches after the first split only on greedy trees
+    if Tree is DecisionTreeRegressor:
+        # Check the impurity match after the first split
+        assert_allclose(tree.tree_.impurity[:2], tree_ref.tree_.impurity[:2])
 
     # Find the leaves with a single sample where the MSE should be 0
     leaves_idx = np.flatnonzero(
diff --git a/sklearn/utils/__init__.py b/sklearn/utils/__init__.py
index 860972d764482..011347cb2d443 100644
--- a/sklearn/utils/__init__.py
+++ b/sklearn/utils/__init__.py
@@ -1,7 +1,6 @@
-"""
-The :mod:`sklearn.utils` module includes various utilities.
-"""
+"""Various utilities to help with development."""
 
+import platform
 import warnings
 from collections.abc import Sequence
 
@@ -42,13 +41,16 @@
     indexable,
 )
 
-# Do not deprecate parallel_backend and register_parallel_backend as they are
-# needed to tune `scikit-learn` behavior and have different effect if called
-# from the vendored version or or the site-package version. The other are
-# utilities that are independent of scikit-learn so they are not part of
-# scikit-learn public API.
-parallel_backend = _joblib.parallel_backend
-register_parallel_backend = _joblib.register_parallel_backend
+# TODO(1.7): remove parallel_backend and register_parallel_backend
+msg = "deprecated in 1.5 to be removed in 1.7. Use joblib.{} instead."
+register_parallel_backend = deprecated(msg)(_joblib.register_parallel_backend)
+
+
+# if a class, deprecated will change the object in _joblib module so we need to subclass
+@deprecated(msg)
+class parallel_backend(_joblib.parallel_backend):
+    pass
+
 
 __all__ = [
     "murmurhash3_32",
@@ -88,9 +90,7 @@ def __getattr__(name):
             "IS_PYPY is deprecated and will be removed in 1.7.",
             FutureWarning,
         )
-        from .fixes import _IS_PYPY
-
-        return _IS_PYPY
+        return platform.python_implementation() == "PyPy"
     raise AttributeError(f"module {__name__} has no attribute {name}")
 
 
diff --git a/sklearn/utils/_array_api.py b/sklearn/utils/_array_api.py
index 70e210e7e913e..63c14386c04e9 100644
--- a/sklearn/utils/_array_api.py
+++ b/sklearn/utils/_array_api.py
@@ -13,10 +13,10 @@
 _NUMPY_NAMESPACE_NAMES = {"numpy", "array_api_compat.numpy"}
 
 
-def yield_namespace_device_dtype_combinations(include_numpy_namespaces=True):
-    """Yield supported namespace, device, dtype tuples for testing.
+def yield_namespaces(include_numpy_namespaces=True):
+    """Yield supported namespace.
 
-    Use this to test that an estimator works with all combinations.
+    This is meant to be used for testing purposes only.
 
     Parameters
     ----------
@@ -27,14 +27,6 @@ def yield_namespace_device_dtype_combinations(include_numpy_namespaces=True):
     -------
     array_namespace : str
         The name of the Array API namespace.
-
-    device : str
-        The name of the device on which to allocate the arrays. Can be None to
-        indicate that the default value should be used.
-
-    dtype_name : str
-        The name of the data type to use for arrays. Can be None to indicate
-        that the default value should be used.
     """
     for array_namespace in [
         # The following is used to test the array_api_compat wrapper when
@@ -50,6 +42,35 @@ def yield_namespace_device_dtype_combinations(include_numpy_namespaces=True):
     ]:
         if not include_numpy_namespaces and array_namespace in _NUMPY_NAMESPACE_NAMES:
             continue
+        yield array_namespace
+
+
+def yield_namespace_device_dtype_combinations(include_numpy_namespaces=True):
+    """Yield supported namespace, device, dtype tuples for testing.
+
+    Use this to test that an estimator works with all combinations.
+
+    Parameters
+    ----------
+    include_numpy_namespaces : bool, default=True
+        If True, also yield numpy namespaces.
+
+    Returns
+    -------
+    array_namespace : str
+        The name of the Array API namespace.
+
+    device : str
+        The name of the device on which to allocate the arrays. Can be None to
+        indicate that the default value should be used.
+
+    dtype_name : str
+        The name of the data type to use for arrays. Can be None to indicate
+        that the default value should be used.
+    """
+    for array_namespace in yield_namespaces(
+        include_numpy_namespaces=include_numpy_namespaces
+    ):
         if array_namespace == "torch":
             for device, dtype in itertools.product(
                 ("cpu", "cuda"), ("float64", "float32")
@@ -229,7 +250,7 @@ def supported_float_dtypes(xp):
 def ensure_common_namespace_device(reference, *arrays):
     """Ensure that all arrays use the same namespace and device as reference.
 
-    If neccessary the arrays are moved to the same namespace and device as
+    If necessary the arrays are moved to the same namespace and device as
     the reference array.
 
     Parameters
@@ -281,6 +302,15 @@ def __eq__(self, other):
     def isdtype(self, dtype, kind):
         return isdtype(dtype, kind, xp=self._namespace)
 
+    def maximum(self, x1, x2):
+        # TODO: Remove when `maximum` is made compatible in `array_api_compat`,
+        #  based on the `2023.12` specification.
+        #  https://github.com/data-apis/array-api-compat/issues/127
+        x1_np = _convert_to_numpy(x1, xp=self._namespace)
+        x2_np = _convert_to_numpy(x2, xp=self._namespace)
+        x_max = numpy.maximum(x1_np, x2_np)
+        return self._namespace.asarray(x_max, device=device(x1, x2))
+
 
 def _check_device_cpu(device):  # noqa
     if device not in {"cpu", None}:
@@ -385,6 +415,11 @@ def unique_counts(self, x):
     def unique_values(self, x):
         return numpy.unique(x)
 
+    def unique_all(self, x):
+        return numpy.unique(
+            x, return_index=True, return_inverse=True, return_counts=True
+        )
+
     def concat(self, arrays, *, axis=None):
         return numpy.concatenate(arrays, axis=axis)
 
@@ -406,6 +441,9 @@ def reshape(self, x, shape, *, copy=None):
     def isdtype(self, dtype, kind):
         return isdtype(dtype, kind, xp=self)
 
+    def pow(self, x1, x2):
+        return numpy.power(x1, x2)
+
 
 _NUMPY_API_WRAPPER_INSTANCE = _NumPyAPIWrapper()
 
@@ -528,9 +566,54 @@ def get_namespace(*arrays, remove_none=True, remove_types=(str,), xp=None):
     if namespace.__name__ in {"cupy.array_api"}:
         namespace = _ArrayAPIWrapper(namespace)
 
+    if namespace.__name__ == "array_api_strict" and hasattr(
+        namespace, "set_array_api_strict_flags"
+    ):
+        namespace.set_array_api_strict_flags(api_version="2023.12")
+
     return namespace, is_array_api_compliant
 
 
+def get_namespace_and_device(*array_list, remove_none=True, remove_types=(str,)):
+    """Combination into one single function of `get_namespace` and `device`.
+
+    Parameters
+    ----------
+    *array_list : array objects
+        Array objects.
+    remove_none : bool, default=True
+        Whether to ignore None objects passed in arrays.
+    remove_types : tuple or list, default=(str,)
+        Types to ignore in the arrays.
+
+    Returns
+    -------
+    namespace : module
+        Namespace shared by array objects. If any of the `arrays` are not arrays,
+        the namespace defaults to NumPy.
+    is_array_api_compliant : bool
+        True if the arrays are containers that implement the Array API spec.
+        Always False when array_api_dispatch=False.
+    device : device
+        `device` object (see the "Device Support" section of the array API spec).
+    """
+    array_list = _remove_non_arrays(
+        *array_list, remove_none=remove_none, remove_types=remove_types
+    )
+
+    skip_remove_kwargs = dict(remove_none=False, remove_types=[])
+
+    xp, is_array_api = get_namespace(*array_list, **skip_remove_kwargs)
+    if is_array_api:
+        return (
+            xp,
+            is_array_api,
+            device(*array_list, **skip_remove_kwargs),
+        )
+    else:
+        return xp, False, None
+
+
 def _expit(X, xp=None):
     xp, _ = get_namespace(X, xp=xp)
     if _is_numpy_namespace(xp):
@@ -539,21 +622,48 @@ def _expit(X, xp=None):
     return 1.0 / (1.0 + xp.exp(-X))
 
 
-def _add_to_diagonal(array, value, xp):
-    # Workaround for the lack of support for xp.reshape(a, shape, copy=False) in
-    # numpy.array_api: https://github.com/numpy/numpy/issues/23410
-    value = xp.asarray(value, dtype=array.dtype)
-    if _is_numpy_namespace(xp):
-        array_np = numpy.asarray(array)
-        array_np.flat[:: array.shape[0] + 1] += value
-        return xp.asarray(array_np)
-    elif value.ndim == 1:
-        for i in range(array.shape[0]):
-            array[i, i] += value[i]
+def _fill_or_add_to_diagonal(array, value, xp, add_value=True, wrap=False):
+    """Implementation to facilitate adding or assigning specified values to the
+    diagonal of a 2-d array.
+
+    If ``add_value`` is `True` then the values will be added to the diagonal
+    elements otherwise the values will be assigned to the diagonal elements.
+    By default, ``add_value`` is set to `True. This is currently only
+    supported for 2-d arrays.
+
+    The implementation is taken from the `numpy.fill_diagonal` function:
+    https://github.com/numpy/numpy/blob/v2.0.0/numpy/lib/_index_tricks_impl.py#L799-L929
+    """
+    if array.ndim != 2:
+        raise ValueError(
+            f"array should be 2-d. Got array with shape {tuple(array.shape)}"
+        )
+
+    value = xp.asarray(value, dtype=array.dtype, device=device(array))
+    end = None
+    # Explicit, fast formula for the common case.  For 2-d arrays, we
+    # accept rectangular ones.
+    step = array.shape[1] + 1
+    if not wrap:
+        end = array.shape[1] * array.shape[1]
+
+    array_flat = xp.reshape(array, (-1,))
+    if add_value:
+        array_flat[:end:step] += value
     else:
-        # scalar value
-        for i in range(array.shape[0]):
-            array[i, i] += value
+        array_flat[:end:step] = value
+
+
+def _max_precision_float_dtype(xp, device):
+    """Return the float dtype with the highest precision supported by the device."""
+    # TODO: Update to use `__array_namespace__info__()` from array-api v2023.12
+    # when/if that becomes more widespread.
+    xp_name = xp.__name__
+    if xp_name in {"array_api_compat.torch", "torch"} and (
+        str(device).startswith("mps")
+    ):  # pragma: no cover
+        return xp.float32
+    return xp.float64
 
 
 def _find_matching_floating_dtype(*arrays, xp):
@@ -588,10 +698,7 @@ def _average(a, axis=None, weights=None, normalize=True, xp=None):
     https://numpy.org/doc/stable/reference/generated/numpy.average.html but
     only for the common cases needed in scikit-learn.
     """
-    input_arrays = [a, weights]
-    xp, _ = get_namespace(*input_arrays, xp=xp)
-
-    device_ = device(*input_arrays)
+    xp, _, device_ = get_namespace_and_device(a, weights)
 
     if _is_numpy_namespace(xp):
         if normalize:
@@ -610,16 +717,10 @@ def _average(a, axis=None, weights=None, normalize=True, xp=None):
                 f"weights {tuple(weights.shape)} differ."
             )
 
-        if weights.ndim != 1:
-            raise TypeError(
-                f"1D weights expected when a.shape={tuple(a.shape)} and "
-                f"weights.shape={tuple(weights.shape)} differ."
-            )
-
-        if size(weights) != a.shape[axis]:
+        if tuple(weights.shape) != (a.shape[axis],):
             raise ValueError(
-                f"Length of weights {size(weights)} not compatible with "
-                f" a.shape={tuple(a.shape)} and {axis=}."
+                f"Shape of weights weights.shape={tuple(weights.shape)} must be "
+                f"consistent with a.shape={tuple(a.shape)} and {axis=}."
             )
 
         # If weights are 1D, add singleton dimensions for broadcasting
@@ -690,7 +791,22 @@ def _nanmax(X, axis=None, xp=None):
         return X
 
 
-def _asarray_with_order(array, dtype=None, order=None, copy=None, *, xp=None):
+def _clip(S, min_val, max_val, xp):
+    # TODO: remove this method and change all usage once we move to array api 2023.12
+    # https://data-apis.org/array-api/2023.12/API_specification/generated/array_api.clip.html#clip
+    if _is_numpy_namespace(xp):
+        return numpy.clip(S, min_val, max_val)
+    else:
+        min_arr = xp.asarray(min_val, dtype=S.dtype)
+        max_arr = xp.asarray(max_val, dtype=S.dtype)
+        S = xp.where(S < min_arr, min_arr, S)
+        S = xp.where(S > max_arr, max_arr, S)
+        return S
+
+
+def _asarray_with_order(
+    array, dtype=None, order=None, copy=None, *, xp=None, device=None
+):
     """Helper to support the order kwarg only for NumPy-backed arrays
 
     Memory layout parameter `order` is not exposed in the Array API standard,
@@ -715,7 +831,21 @@ def _asarray_with_order(array, dtype=None, order=None, copy=None, *, xp=None):
         # container that is consistent with the input's namespace.
         return xp.asarray(array)
     else:
-        return xp.asarray(array, dtype=dtype, copy=copy)
+        return xp.asarray(array, dtype=dtype, copy=copy, device=device)
+
+
+def _ravel(array, xp=None):
+    """Array API compliant version of np.ravel.
+
+    For non numpy namespaces, it just returns a flattened array, that might
+    be or not be a copy.
+    """
+    xp, _ = get_namespace(array, xp=xp)
+    if _is_numpy_namespace(xp):
+        array = numpy.asarray(array)
+        return xp.asarray(numpy.ravel(array, order="C"))
+
+    return xp.reshape(array, shape=(-1,))
 
 
 def _convert_to_numpy(array, xp):
@@ -761,9 +891,14 @@ def _estimator_with_converted_arrays(estimator, converter):
     return new_estimator
 
 
-def _atol_for_type(dtype):
+def _atol_for_type(dtype_or_dtype_name):
     """Return the absolute tolerance for a given numpy dtype."""
-    return numpy.finfo(dtype).eps * 100
+    if dtype_or_dtype_name is None:
+        # If no dtype is specified when running tests for a given namespace, we
+        # expect the same floating precision level as NumPy's default floating
+        # point dtype.
+        dtype_or_dtype_name = numpy.float64
+    return numpy.finfo(dtype_or_dtype_name).eps * 100
 
 
 def indexing_dtype(xp):
@@ -788,3 +923,146 @@ def indexing_dtype(xp):
     # TODO: once sufficiently adopted, we might want to instead rely on the
     # newer inspection API: https://github.com/data-apis/array-api/issues/640
     return xp.asarray(0).dtype
+
+
+def _searchsorted(xp, a, v, *, side="left", sorter=None):
+    # Temporary workaround needed as long as searchsorted is not widely
+    # adopted by implementers of the Array API spec. This is a quite
+    # recent addition to the spec:
+    # https://data-apis.org/array-api/latest/API_specification/generated/array_api.searchsorted.html # noqa
+    if hasattr(xp, "searchsorted"):
+        return xp.searchsorted(a, v, side=side, sorter=sorter)
+
+    a_np = _convert_to_numpy(a, xp=xp)
+    v_np = _convert_to_numpy(v, xp=xp)
+    indices = numpy.searchsorted(a_np, v_np, side=side, sorter=sorter)
+    return xp.asarray(indices, device=device(a))
+
+
+def _setdiff1d(ar1, ar2, xp, assume_unique=False):
+    """Find the set difference of two arrays.
+
+    Return the unique values in `ar1` that are not in `ar2`.
+    """
+    if _is_numpy_namespace(xp):
+        return xp.asarray(
+            numpy.setdiff1d(
+                ar1=ar1,
+                ar2=ar2,
+                assume_unique=assume_unique,
+            )
+        )
+
+    if assume_unique:
+        ar1 = xp.reshape(ar1, (-1,))
+    else:
+        ar1 = xp.unique_values(ar1)
+        ar2 = xp.unique_values(ar2)
+    return ar1[_in1d(ar1=ar1, ar2=ar2, xp=xp, assume_unique=True, invert=True)]
+
+
+def _isin(element, test_elements, xp, assume_unique=False, invert=False):
+    """Calculates ``element in test_elements``, broadcasting over `element`
+    only.
+
+    Returns a boolean array of the same shape as `element` that is True
+    where an element of `element` is in `test_elements` and False otherwise.
+    """
+    if _is_numpy_namespace(xp):
+        return xp.asarray(
+            numpy.isin(
+                element=element,
+                test_elements=test_elements,
+                assume_unique=assume_unique,
+                invert=invert,
+            )
+        )
+
+    original_element_shape = element.shape
+    element = xp.reshape(element, (-1,))
+    test_elements = xp.reshape(test_elements, (-1,))
+    return xp.reshape(
+        _in1d(
+            ar1=element,
+            ar2=test_elements,
+            xp=xp,
+            assume_unique=assume_unique,
+            invert=invert,
+        ),
+        original_element_shape,
+    )
+
+
+# Note: This is a helper for the functions `_isin` and
+# `_setdiff1d`. It is not meant to be called directly.
+def _in1d(ar1, ar2, xp, assume_unique=False, invert=False):
+    """Checks whether each element of an array is also present in a
+    second array.
+
+    Returns a boolean array the same length as `ar1` that is True
+    where an element of `ar1` is in `ar2` and False otherwise.
+
+    This function has been adapted using the original implementation
+    present in numpy:
+    https://github.com/numpy/numpy/blob/v1.26.0/numpy/lib/arraysetops.py#L524-L758
+    """
+    xp, _ = get_namespace(ar1, ar2, xp=xp)
+
+    # This code is run to make the code significantly faster
+    if ar2.shape[0] < 10 * ar1.shape[0] ** 0.145:
+        if invert:
+            mask = xp.ones(ar1.shape[0], dtype=xp.bool, device=device(ar1))
+            for a in ar2:
+                mask &= ar1 != a
+        else:
+            mask = xp.zeros(ar1.shape[0], dtype=xp.bool, device=device(ar1))
+            for a in ar2:
+                mask |= ar1 == a
+        return mask
+
+    if not assume_unique:
+        ar1, rev_idx = xp.unique_inverse(ar1)
+        ar2 = xp.unique_values(ar2)
+
+    ar = xp.concat((ar1, ar2))
+    device_ = device(ar)
+    # We need this to be a stable sort.
+    order = xp.argsort(ar, stable=True)
+    reverse_order = xp.argsort(order, stable=True)
+    sar = xp.take(ar, order, axis=0)
+    if invert:
+        bool_ar = sar[1:] != sar[:-1]
+    else:
+        bool_ar = sar[1:] == sar[:-1]
+    flag = xp.concat((bool_ar, xp.asarray([invert], device=device_)))
+    ret = xp.take(flag, reverse_order, axis=0)
+
+    if assume_unique:
+        return ret[: ar1.shape[0]]
+    else:
+        return xp.take(ret, rev_idx, axis=0)
+
+
+def _count_nonzero(X, xp, device, axis=None, sample_weight=None):
+    """A variant of `sklearn.utils.sparsefuncs.count_nonzero` for the Array API.
+
+    It only supports 2D arrays.
+    """
+    assert X.ndim == 2
+
+    weights = xp.ones_like(X, device=device)
+    if sample_weight is not None:
+        sample_weight = xp.asarray(sample_weight, device=device)
+        sample_weight = xp.reshape(sample_weight, (sample_weight.shape[0], 1))
+        weights = xp.astype(weights, sample_weight.dtype) * sample_weight
+
+    zero_scalar = xp.asarray(0, device=device, dtype=weights.dtype)
+    return xp.sum(xp.where(X != 0, weights, zero_scalar), axis=axis)
+
+
+def _modify_in_place_if_numpy(xp, func, *args, out=None, **kwargs):
+    if _is_numpy_namespace(xp):
+        func(*args, out=out, **kwargs)
+    else:
+        out = func(*args, **kwargs)
+    return out
diff --git a/sklearn/utils/_encode.py b/sklearn/utils/_encode.py
index a468af43f857d..3fd4d45f522e6 100644
--- a/sklearn/utils/_encode.py
+++ b/sklearn/utils/_encode.py
@@ -4,6 +4,13 @@
 
 import numpy as np
 
+from ._array_api import (
+    _isin,
+    _searchsorted,
+    _setdiff1d,
+    device,
+    get_namespace,
+)
 from ._missing import is_scalar_nan
 
 
@@ -51,31 +58,29 @@ def _unique(values, *, return_inverse=False, return_counts=False):
 def _unique_np(values, return_inverse=False, return_counts=False):
     """Helper function to find unique values for numpy arrays that correctly
     accounts for nans. See `_unique` documentation for details."""
-    uniques = np.unique(
-        values, return_inverse=return_inverse, return_counts=return_counts
-    )
+    xp, _ = get_namespace(values)
 
     inverse, counts = None, None
 
-    if return_counts:
-        *uniques, counts = uniques
-
-    if return_inverse:
-        *uniques, inverse = uniques
-
-    if return_counts or return_inverse:
-        uniques = uniques[0]
+    if return_inverse and return_counts:
+        uniques, _, inverse, counts = xp.unique_all(values)
+    elif return_inverse:
+        uniques, inverse = xp.unique_inverse(values)
+    elif return_counts:
+        uniques, counts = xp.unique_counts(values)
+    else:
+        uniques = xp.unique_values(values)
 
     # np.unique will have duplicate missing values at the end of `uniques`
     # here we clip the nans and remove it from uniques
     if uniques.size and is_scalar_nan(uniques[-1]):
-        nan_idx = np.searchsorted(uniques, np.nan)
+        nan_idx = _searchsorted(xp, uniques, xp.nan)
         uniques = uniques[: nan_idx + 1]
         if return_inverse:
             inverse[inverse > nan_idx] = nan_idx
 
         if return_counts:
-            counts[nan_idx] = np.sum(counts[nan_idx:])
+            counts[nan_idx] = xp.sum(counts[nan_idx:])
             counts = counts[: nan_idx + 1]
 
     ret = (uniques,)
@@ -161,8 +166,9 @@ def __missing__(self, key):
 
 def _map_to_integer(values, uniques):
     """Map values based on its position in uniques."""
+    xp, _ = get_namespace(values, uniques)
     table = _nandict({val: i for i, val in enumerate(uniques)})
-    return np.array([table[v] for v in values])
+    return xp.asarray([table[v] for v in values], device=device(values))
 
 
 def _unique_python(values, *, return_inverse, return_counts):
@@ -220,7 +226,8 @@ def _encode(values, *, uniques, check_unknown=True):
     encoded : ndarray
         Encoded values
     """
-    if values.dtype.kind in "OUS":
+    xp, _ = get_namespace(values, uniques)
+    if not xp.isdtype(values.dtype, "numeric"):
         try:
             return _map_to_integer(values, uniques)
         except KeyError as e:
@@ -230,7 +237,7 @@ def _encode(values, *, uniques, check_unknown=True):
             diff = _check_unknown(values, uniques)
             if diff:
                 raise ValueError(f"y contains previously unseen labels: {str(diff)}")
-        return np.searchsorted(uniques, values)
+        return _searchsorted(xp, uniques, values)
 
 
 def _check_unknown(values, known_values, return_mask=False):
@@ -258,9 +265,10 @@ def _check_unknown(values, known_values, return_mask=False):
         Additionally returned if ``return_mask=True``.
 
     """
+    xp, _ = get_namespace(values, known_values)
     valid_mask = None
 
-    if values.dtype.kind in "OUS":
+    if not xp.isdtype(values.dtype, "numeric"):
         values_set = set(values)
         values_set, missing_in_values = _extract_missing(values_set)
 
@@ -282,9 +290,9 @@ def is_valid(value):
 
         if return_mask:
             if diff or nan_in_diff or none_in_diff:
-                valid_mask = np.array([is_valid(value) for value in values])
+                valid_mask = xp.array([is_valid(value) for value in values])
             else:
-                valid_mask = np.ones(len(values), dtype=bool)
+                valid_mask = xp.ones(len(values), dtype=xp.bool)
 
         diff = list(diff)
         if none_in_diff:
@@ -292,21 +300,21 @@ def is_valid(value):
         if nan_in_diff:
             diff.append(np.nan)
     else:
-        unique_values = np.unique(values)
-        diff = np.setdiff1d(unique_values, known_values, assume_unique=True)
+        unique_values = xp.unique_values(values)
+        diff = _setdiff1d(unique_values, known_values, xp, assume_unique=True)
         if return_mask:
             if diff.size:
-                valid_mask = np.isin(values, known_values)
+                valid_mask = _isin(values, known_values, xp)
             else:
-                valid_mask = np.ones(len(values), dtype=bool)
+                valid_mask = xp.ones(len(values), dtype=xp.bool)
 
         # check for nans in the known_values
-        if np.isnan(known_values).any():
-            diff_is_nan = np.isnan(diff)
-            if diff_is_nan.any():
+        if xp.any(xp.isnan(known_values)):
+            diff_is_nan = xp.isnan(diff)
+            if xp.any(diff_is_nan):
                 # removes nan from valid_mask
                 if diff.size and return_mask:
-                    is_nan = np.isnan(values)
+                    is_nan = xp.isnan(values)
                     valid_mask[is_nan] = 1
 
                 # remove nan from diff
diff --git a/sklearn/utils/_fast_dict.pxd b/sklearn/utils/_fast_dict.pxd
index 4a9d6ef4eb7b7..f9f9bf31db1ee 100644
--- a/sklearn/utils/_fast_dict.pxd
+++ b/sklearn/utils/_fast_dict.pxd
@@ -1,5 +1,5 @@
-# Author: Gael Varoquaux
-# License: BSD
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 """
 Uses C++ map containers for fast dict-like behavior with keys being
 integers, and values float.
diff --git a/sklearn/utils/_fast_dict.pyx b/sklearn/utils/_fast_dict.pyx
index 0bf208fb5e146..cdf84d9b592e1 100644
--- a/sklearn/utils/_fast_dict.pyx
+++ b/sklearn/utils/_fast_dict.pyx
@@ -2,8 +2,8 @@
 Uses C++ map containers for fast dict-like behavior with keys being
 integers, and values float.
 """
-# Author: Gael Varoquaux
-# License: BSD
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 # C++
 from cython.operator cimport dereference as deref, preincrement as inc
diff --git a/sklearn/utils/_indexing.py b/sklearn/utils/_indexing.py
index 49e04a451dcb0..11ecdfe0ecbd9 100644
--- a/sklearn/utils/_indexing.py
+++ b/sklearn/utils/_indexing.py
@@ -1,6 +1,7 @@
 import numbers
 import sys
 import warnings
+from collections import UserList
 from itertools import compress, islice
 
 import numpy as np
@@ -142,7 +143,9 @@ def _determine_key_type(key, accept_slice=True):
         if key_start_type is not None:
             return key_start_type
         return key_stop_type
-    if isinstance(key, (list, tuple)):
+    # TODO(1.9) remove UserList when the force_int_remainder_cols param
+    # of ColumnTransformer is removed
+    if isinstance(key, (list, tuple, UserList)):
         unique_key = set(key)
         key_type = {_determine_key_type(elt) for elt in unique_key}
         if not key_type:
@@ -475,8 +478,8 @@ def resample(*arrays, replace=True, n_samples=None, random_state=None, stratify=
              [1., 0.]])
 
       >>> X_sparse
-      <3x2 sparse matrix of type '<... 'numpy.float64'>'
-          with 4 stored elements in Compressed Sparse Row format>
+      <Compressed Sparse Row sparse matrix of dtype 'float64'
+          with 4 stored elements and shape (3, 2)>
 
       >>> X_sparse.toarray()
       array([[1., 0.],
@@ -613,8 +616,8 @@ def shuffle(*arrays, random_state=None, n_samples=None):
              [1., 0.]])
 
       >>> X_sparse
-      <3x2 sparse matrix of type '<... 'numpy.float64'>'
-          with 3 stored elements in Compressed Sparse Row format>
+      <Compressed Sparse Row sparse matrix of dtype 'float64'
+          with 3 stored elements and shape (3, 2)>
 
       >>> X_sparse.toarray()
       array([[0., 0.],
diff --git a/sklearn/utils/_joblib.py b/sklearn/utils/_joblib.py
index 590fdc6170c64..7638a30e7b5fa 100644
--- a/sklearn/utils/_joblib.py
+++ b/sklearn/utils/_joblib.py
@@ -1,3 +1,5 @@
+# TODO(1.7): remove this file
+
 import warnings as _warnings
 
 with _warnings.catch_warnings():
diff --git a/sklearn/utils/_metadata_requests.py b/sklearn/utils/_metadata_requests.py
index 075fe196ae01f..a558ed8e0abfe 100644
--- a/sklearn/utils/_metadata_requests.py
+++ b/sklearn/utils/_metadata_requests.py
@@ -74,8 +74,8 @@
 need to override, but it works for simple consumers as is.
 """
 
-# Author: Adrin Jalali <adrin.jalali@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import inspect
 from collections import namedtuple
@@ -399,8 +399,10 @@ def _check_warnings(self, *, params):
             warn(
                 f"Support for {param} has recently been added to this class. "
                 "To maintain backward compatibility, it is ignored now. "
-                "You can set the request value to False to silence this "
-                "warning, or to True to consume and use the metadata."
+                f"Using `set_{self.method}_request({param}={{True, False}})` "
+                "on this method of the class, you can set the request value "
+                "to False to silence this warning, or to True to consume and "
+                "use the metadata."
             )
 
     def _route_params(self, params, parent, caller):
@@ -691,19 +693,18 @@ def __str__(self):
 
 # A namedtuple storing a single method route. A collection of these namedtuples
 # is stored in a MetadataRouter.
-MethodPair = namedtuple("MethodPair", ["callee", "caller"])
+MethodPair = namedtuple("MethodPair", ["caller", "callee"])
 
 
 class MethodMapping:
-    """Stores the mapping between callee and caller methods for a router.
+    """Stores the mapping between caller and callee methods for a router.
 
     This class is primarily used in a ``get_metadata_routing()`` of a router
     object when defining the mapping between a sub-object (a sub-estimator or a
-    scorer) to the router's methods. It stores a collection of ``Route``
-    namedtuples.
+    scorer) to the router's methods. It stores a collection of namedtuples.
 
     Iterating through an instance of this class will yield named
-    ``MethodPair(callee, caller)`` tuples.
+    ``MethodPair(caller, callee)`` tuples.
 
     .. versionadded:: 1.3
     """
@@ -714,33 +715,34 @@ def __init__(self):
     def __iter__(self):
         return iter(self._routes)
 
-    def add(self, *, callee, caller):
+    def add(self, *, caller, callee):
         """Add a method mapping.
 
         Parameters
         ----------
-        callee : str
-            Child object's method name. This method is called in ``caller``.
 
         caller : str
             Parent estimator's method name in which the ``callee`` is called.
 
+        callee : str
+            Child object's method name. This method is called in ``caller``.
+
         Returns
         -------
         self : MethodMapping
             Returns self.
         """
-        if callee not in METHODS:
+        if caller not in METHODS:
             raise ValueError(
-                f"Given callee:{callee} is not a valid method. Valid methods are:"
+                f"Given caller:{caller} is not a valid method. Valid methods are:"
                 f" {METHODS}"
             )
-        if caller not in METHODS:
+        if callee not in METHODS:
             raise ValueError(
-                f"Given caller:{caller} is not a valid method. Valid methods are:"
+                f"Given callee:{callee} is not a valid method. Valid methods are:"
                 f" {METHODS}"
             )
-        self._routes.append(MethodPair(callee=callee, caller=caller))
+        self._routes.append(MethodPair(caller=caller, callee=callee))
         return self
 
     def _serialize(self):
@@ -753,38 +755,9 @@ def _serialize(self):
         """
         result = list()
         for route in self._routes:
-            result.append({"callee": route.callee, "caller": route.caller})
+            result.append({"caller": route.caller, "callee": route.callee})
         return result
 
-    @classmethod
-    def from_str(cls, route):
-        """Construct an instance from a string.
-
-        Parameters
-        ----------
-        route : str
-            A string representing the mapping, it can be:
-
-              - `"one-to-one"`: a one to one mapping for all methods.
-              - `"method"`: the name of a single method, such as ``fit``,
-                ``transform``, ``score``, etc.
-
-        Returns
-        -------
-        obj : MethodMapping
-            A :class:`~sklearn.utils.metadata_routing.MethodMapping` instance
-            constructed from the given string.
-        """
-        routing = cls()
-        if route == "one-to-one":
-            for method in METHODS:
-                routing.add(callee=method, caller=method)
-        elif route in METHODS:
-            routing.add(callee=route, caller=route)
-        else:
-            raise ValueError("route should be 'one-to-one' or a single method!")
-        return routing
-
     def __repr__(self):
         return str(self._serialize())
 
@@ -866,10 +839,8 @@ def add(self, *, method_mapping, **objs):
 
         Parameters
         ----------
-        method_mapping : MethodMapping or str
-            The mapping between the child and the parent's methods. If str, the
-            output of :func:`~sklearn.utils.metadata_routing.MethodMapping.from_str`
-            is used.
+        method_mapping : MethodMapping
+            The mapping between the child and the parent's methods.
 
         **objs : dict
             A dictionary of objects from which metadata is extracted by calling
@@ -880,10 +851,7 @@ def add(self, *, method_mapping, **objs):
         self : MetadataRouter
             Returns `self`.
         """
-        if isinstance(method_mapping, str):
-            method_mapping = MethodMapping.from_str(method_mapping)
-        else:
-            method_mapping = deepcopy(method_mapping)
+        method_mapping = deepcopy(method_mapping)
 
         for name, obj in objs.items():
             self._route_mappings[name] = RouterMappingPair(
@@ -914,7 +882,7 @@ def consumes(self, method, params):
             res = res | self._self_request.consumes(method=method, params=params)
 
         for _, route_mapping in self._route_mappings.items():
-            for callee, caller in route_mapping.mapping:
+            for caller, callee in route_mapping.mapping:
                 if caller == method:
                     res = res | route_mapping.router.consumes(
                         method=callee, params=params
@@ -957,7 +925,7 @@ def _get_param_names(self, *, method, return_alias, ignore_self_request):
             )
 
         for name, route_mapping in self._route_mappings.items():
-            for callee, caller in route_mapping.mapping:
+            for caller, callee in route_mapping.mapping:
                 if caller == method:
                     res = res.union(
                         route_mapping.router._get_param_names(
@@ -1031,9 +999,9 @@ def _route_params(self, *, params, method, parent, caller):
     def route_params(self, *, caller, params):
         """Return the input parameters requested by child objects.
 
-        The output of this method is a bunch, which includes the inputs for all
-        methods of each child object that are used in the router's `caller`
-        method.
+        The output of this method is a :class:`~sklearn.utils.Bunch`, which includes the
+        metadata for all methods of each child object that is used in the router's
+        `caller` method.
 
         If the router is also a consumer, it also checks for warnings of
         `self`'s/consumer's requested metadata.
@@ -1052,7 +1020,7 @@ def route_params(self, *, caller, params):
         -------
         params : Bunch
             A :class:`~sklearn.utils.Bunch` of the form
-            ``{"object_name": {"method_name": {prop: value}}}`` which can be
+            ``{"object_name": {"method_name": {params: value}}}`` which can be
             used to pass the required metadata to corresponding methods or
             corresponding child objects.
         """
@@ -1064,7 +1032,7 @@ def route_params(self, *, caller, params):
             router, mapping = route_mapping.router, route_mapping.mapping
 
             res[name] = Bunch()
-            for _callee, _caller in mapping:
+            for _caller, _callee in mapping:
                 if _caller == caller:
                     res[name][_callee] = router._route_params(
                         params=params,
@@ -1126,12 +1094,11 @@ def _serialize(self):
 
     def __iter__(self):
         if self._self_request:
-            yield (
-                "$self_request",
-                RouterMappingPair(
-                    mapping=MethodMapping.from_str("one-to-one"),
-                    router=self._self_request,
-                ),
+            method_mapping = MethodMapping()
+            for method in METHODS:
+                method_mapping.add(caller=method, callee=method)
+            yield "$self_request", RouterMappingPair(
+                mapping=method_mapping, router=self._self_request
             )
         for name, route_mapping in self._route_mappings.items():
             yield (name, route_mapping)
@@ -1159,12 +1126,12 @@ def get_routing_for_object(obj=None):
     Parameters
     ----------
     obj : object
+        - If the object provides a `get_metadata_routing` method, return a copy
+            of the output of that method.
         - If the object is already a
             :class:`~sklearn.utils.metadata_routing.MetadataRequest` or a
             :class:`~sklearn.utils.metadata_routing.MetadataRouter`, return a copy
             of that.
-        - If the object provides a `get_metadata_routing` method, return a copy
-            of the output of that method.
         - Returns an empty :class:`~sklearn.utils.metadata_routing.MetadataRequest`
             otherwise.
 
@@ -1557,9 +1524,10 @@ def process_routing(_obj, _method, /, **kwargs):
     This function is used inside a router's method, e.g. :term:`fit`,
     to validate the metadata and handle the routing.
 
-    Assuming this signature: ``fit(self, X, y, sample_weight=None, **fit_params)``,
+    Assuming this signature of a router's fit method:
+    ``fit(self, X, y, sample_weight=None, **fit_params)``,
     a call to this function would be:
-    ``process_routing(self, sample_weight=sample_weight, **fit_params)``.
+    ``process_routing(self, "fit", sample_weight=sample_weight, **fit_params)``.
 
     Note that if routing is not enabled and ``kwargs`` is empty, then it
     returns an empty routing where ``process_routing(...).ANYTHING.ANY_METHOD``
@@ -1582,8 +1550,10 @@ def process_routing(_obj, _method, /, **kwargs):
     Returns
     -------
     routed_params : Bunch
+        A :class:`~utils.Bunch` of the form ``{"object_name": {"method_name":
+        {params: value}}}`` which can be used to pass the required metadata to
         A :class:`~sklearn.utils.Bunch` of the form ``{"object_name": {"method_name":
-        {prop: value}}}`` which can be used to pass the required metadata to
+        {params: value}}}`` which can be used to pass the required metadata to
         corresponding methods or corresponding child objects. The object names
         are those defined in `obj.get_metadata_routing()`.
     """
diff --git a/sklearn/utils/_mocking.py b/sklearn/utils/_mocking.py
index 16acabf03755b..0afed8c08cfaa 100644
--- a/sklearn/utils/_mocking.py
+++ b/sklearn/utils/_mocking.py
@@ -3,7 +3,13 @@
 from ..base import BaseEstimator, ClassifierMixin
 from ..utils._metadata_requests import RequestMethod
 from .metaestimators import available_if
-from .validation import _check_sample_weight, _num_samples, check_array, check_is_fitted
+from .validation import (
+    _check_sample_weight,
+    _num_samples,
+    check_array,
+    check_is_fitted,
+    check_random_state,
+)
 
 
 class ArraySlicingWrapper:
@@ -133,6 +139,7 @@ def __init__(
         foo_param=0,
         expected_sample_weight=None,
         expected_fit_params=None,
+        random_state=None,
     ):
         self.check_y = check_y
         self.check_y_params = check_y_params
@@ -142,6 +149,7 @@ def __init__(
         self.foo_param = foo_param
         self.expected_sample_weight = expected_sample_weight
         self.expected_fit_params = expected_fit_params
+        self.random_state = random_state
 
     def _check_X_y(self, X, y=None, should_be_fitted=True):
         """Validate X and y and make extra check.
@@ -243,7 +251,8 @@ def predict(self, X):
         """
         if self.methods_to_check == "all" or "predict" in self.methods_to_check:
             X, y = self._check_X_y(X)
-        return self.classes_[np.zeros(_num_samples(X), dtype=int)]
+        rng = check_random_state(self.random_state)
+        return rng.choice(self.classes_, size=_num_samples(X))
 
     def predict_proba(self, X):
         """Predict probabilities for each class.
@@ -263,8 +272,10 @@ def predict_proba(self, X):
         """
         if self.methods_to_check == "all" or "predict_proba" in self.methods_to_check:
             X, y = self._check_X_y(X)
-        proba = np.zeros((_num_samples(X), len(self.classes_)))
-        proba[:, 0] = 1
+        rng = check_random_state(self.random_state)
+        proba = rng.randn(_num_samples(X), len(self.classes_))
+        proba = np.abs(proba, out=proba)
+        proba /= np.sum(proba, axis=1)[:, np.newaxis]
         return proba
 
     def decision_function(self, X):
@@ -286,14 +297,13 @@ def decision_function(self, X):
             or "decision_function" in self.methods_to_check
         ):
             X, y = self._check_X_y(X)
+        rng = check_random_state(self.random_state)
         if len(self.classes_) == 2:
             # for binary classifier, the confidence score is related to
             # classes_[1] and therefore should be null.
-            return np.zeros(_num_samples(X))
+            return rng.randn(_num_samples(X))
         else:
-            decision = np.zeros((_num_samples(X), len(self.classes_)))
-            decision[:, 0] = 1
-            return decision
+            return rng.randn(_num_samples(X), len(self.classes_))
 
     def score(self, X=None, Y=None):
         """Fake score.
diff --git a/sklearn/utils/_pprint.py b/sklearn/utils/_pprint.py
index a0eb31685f37c..9b33cd617a5fc 100644
--- a/sklearn/utils/_pprint.py
+++ b/sklearn/utils/_pprint.py
@@ -65,7 +65,6 @@
 
 import inspect
 import pprint
-from collections import OrderedDict
 
 from .._config import get_config
 from ..base import BaseEstimator
@@ -200,10 +199,8 @@ def _pprint_estimator(self, object, stream, indent, allowance, context, level):
         else:
             params = object.get_params(deep=False)
 
-        params = OrderedDict((name, val) for (name, val) in sorted(params.items()))
-
         self._format_params(
-            params.items(), stream, indent, allowance + 1, context, level
+            sorted(params.items()), stream, indent, allowance + 1, context, level
         )
         stream.write(")")
 
diff --git a/sklearn/utils/_random.pxd b/sklearn/utils/_random.pxd
index 7c188179e964b..7ac4f9774cfa4 100644
--- a/sklearn/utils/_random.pxd
+++ b/sklearn/utils/_random.pxd
@@ -1,6 +1,5 @@
-# Authors: Arnaud Joly
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from ._typedefs cimport uint32_t
 
diff --git a/sklearn/utils/_random.pyx b/sklearn/utils/_random.pyx
index 3779fad597bb7..838db540a210d 100644
--- a/sklearn/utils/_random.pyx
+++ b/sklearn/utils/_random.pyx
@@ -1,6 +1,5 @@
-# Author: Arnaud Joly
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 """
 Random utility function
 =======================
diff --git a/sklearn/utils/_response.py b/sklearn/utils/_response.py
index 0207cc1205120..0381c872a94b0 100644
--- a/sklearn/utils/_response.py
+++ b/sklearn/utils/_response.py
@@ -243,7 +243,9 @@ def _get_response_values(
     return y_pred, pos_label
 
 
-def _get_response_values_binary(estimator, X, response_method, pos_label=None):
+def _get_response_values_binary(
+    estimator, X, response_method, pos_label=None, return_response_method_used=False
+):
     """Compute the response values of a binary classifier.
 
     Parameters
@@ -266,6 +268,12 @@ def _get_response_values_binary(estimator, X, response_method, pos_label=None):
         the metrics. By default, `estimators.classes_[1]` is
         considered as the positive class.
 
+    return_response_method_used : bool, default=False
+        Whether to return the response method used to compute the response
+        values.
+
+        .. versionadded:: 1.5
+
     Returns
     -------
     y_pred : ndarray of shape (n_samples,)
@@ -275,6 +283,12 @@ def _get_response_values_binary(estimator, X, response_method, pos_label=None):
     pos_label : int, float, bool or str
         The class considered as the positive class when computing
         the metrics.
+
+    response_method_used : str
+        The response method used to compute the response values. Only returned
+        if `return_response_method_used` is `True`.
+
+        .. versionadded:: 1.5
     """
     classification_error = "Expected 'estimator' to be a binary classifier."
 
@@ -296,4 +310,5 @@ def _get_response_values_binary(estimator, X, response_method, pos_label=None):
         X,
         response_method,
         pos_label=pos_label,
+        return_response_method_used=return_response_method_used,
     )
diff --git a/sklearn/utils/_seq_dataset.pxd.tp b/sklearn/utils/_seq_dataset.pxd.tp
index 74e3f2457b953..9a15673353d2d 100644
--- a/sklearn/utils/_seq_dataset.pxd.tp
+++ b/sklearn/utils/_seq_dataset.pxd.tp
@@ -9,7 +9,7 @@ Template file for easily generate fused types consistent code using Tempita
 Generated file: _seq_dataset.pxd
 
 Each class is duplicated for all dtypes (float and double). The keywords
-between double braces are substituted in setup.py.
+between double braces are substituted during the build.
 """
 
 # name_suffix, c_type
diff --git a/sklearn/utils/_seq_dataset.pyx.tp b/sklearn/utils/_seq_dataset.pyx.tp
index 78c97eeae5d20..ab7a49a80cb9c 100644
--- a/sklearn/utils/_seq_dataset.pyx.tp
+++ b/sklearn/utils/_seq_dataset.pyx.tp
@@ -8,7 +8,7 @@ Template file for easily generate fused types consistent code using Tempita
 Generated file: _seq_dataset.pyx
 
 Each class is duplicated for all dtypes (float and double). The keywords
-between double braces are substituted in setup.py.
+between double braces are substituted during the build.
 
 Author: Peter Prettenhofer <peter.prettenhofer@gmail.com>
         Arthur Imbert <arthurimbert05@gmail.com>
diff --git a/sklearn/utils/_set_output.py b/sklearn/utils/_set_output.py
index d5c23a4c7c6f9..42757dbb00fae 100644
--- a/sklearn/utils/_set_output.py
+++ b/sklearn/utils/_set_output.py
@@ -392,7 +392,7 @@ def set_output(self, *, transform=None):
 
         Parameters
         ----------
-        transform : {"default", "pandas"}, default=None
+        transform : {"default", "pandas", "polars"}, default=None
             Configure output of `transform` and `fit_transform`.
 
             - `"default"`: Default output format of a transformer
@@ -428,7 +428,7 @@ def _safe_set_output(estimator, *, transform=None):
     estimator : estimator instance
         Estimator instance.
 
-    transform : {"default", "pandas"}, default=None
+    transform : {"default", "pandas", "polars"}, default=None
         Configure output of the following estimator's methods:
 
         - `"transform"`
diff --git a/sklearn/utils/_show_versions.py b/sklearn/utils/_show_versions.py
index 1431108477263..a947e35838504 100644
--- a/sklearn/utils/_show_versions.py
+++ b/sklearn/utils/_show_versions.py
@@ -4,13 +4,14 @@
 adapted from :func:`pandas.show_versions`
 """
 
-# License: BSD 3 clause
+# SPDX-License-Identifier: BSD-3-Clause
 
 import platform
 import sys
 
+from threadpoolctl import threadpool_info
+
 from .. import __version__
-from ..utils.fixes import threadpool_info
 from ._openmp_helpers import _openmp_parallelism_enabled
 
 
diff --git a/sklearn/utils/_testing.py b/sklearn/utils/_testing.py
index 0165e526a0630..94289132b51d3 100644
--- a/sklearn/utils/_testing.py
+++ b/sklearn/utils/_testing.py
@@ -1,15 +1,7 @@
 """Testing utilities."""
 
-# Copyright (c) 2011, 2012
-# Authors: Pietro Berkes,
-#          Andreas Muller
-#          Mathieu Blondel
-#          Olivier Grisel
-#          Arnaud Joly
-#          Denis Engemann
-#          Giorgio Patrini
-#          Thierry Guillemot
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import atexit
 import contextlib
 import functools
@@ -47,7 +39,6 @@
 from sklearn.utils._array_api import _check_array_api_dispatch
 from sklearn.utils.fixes import (
     _IS_32BIT,
-    _IS_PYPY,
     VisibleDeprecationWarning,
     _in_unstable_openblas_configuration,
     parse_version,
@@ -370,7 +361,6 @@ def set_random_state(estimator, random_state=0):
     import pytest
 
     skip_if_32bit = pytest.mark.skipif(_IS_32BIT, reason="skipped on 32bit platforms")
-    fails_if_pypy = pytest.mark.xfail(_IS_PYPY, reason="not compatible with PyPy")
     fails_if_unstable_openblas = pytest.mark.xfail(
         _in_unstable_openblas_configuration(),
         reason="OpenBLAS is unstable for this configuration",
diff --git a/sklearn/utils/_weight_vector.pxd.tp b/sklearn/utils/_weight_vector.pxd.tp
index 075b0f5250d1b..bb1a4db486d2a 100644
--- a/sklearn/utils/_weight_vector.pxd.tp
+++ b/sklearn/utils/_weight_vector.pxd.tp
@@ -9,7 +9,7 @@ Template file for easily generate fused types consistent code using Tempita
 Generated file: weight_vector.pxd
 
 Each class is duplicated for all dtypes (float and double). The keywords
-between double braces are substituted in setup.py.
+between double braces are substituted during the build.
 """
 
 # name_suffix, c_type
diff --git a/sklearn/utils/_weight_vector.pyx.tp b/sklearn/utils/_weight_vector.pyx.tp
index bd2ac79a6764f..d831a6f81c1da 100644
--- a/sklearn/utils/_weight_vector.pyx.tp
+++ b/sklearn/utils/_weight_vector.pyx.tp
@@ -9,7 +9,7 @@ Template file for easily generate fused types consistent code using Tempita
 Generated file: weight_vector.pxd
 
 Each class is duplicated for all dtypes (float and double). The keywords
-between double braces are substituted in setup.py.
+between double braces are substituted during the build.
 """
 
 # name_suffix, c_type, reset_wscale_threshold
@@ -20,11 +20,8 @@ dtypes = [('64', 'double', 1e-9),
 
 # cython: binding=False
 #
-# Author: Peter Prettenhofer <peter.prettenhofer@gmail.com>
-#         Lars Buitinck
-#         Danny Sullivan <dsullivan7@hotmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 cimport cython
 from libc.limits cimport INT_MAX
diff --git a/sklearn/utils/arrayfuncs.pyx b/sklearn/utils/arrayfuncs.pyx
index 346531d325ca5..2cf98e0f5cc3e 100644
--- a/sklearn/utils/arrayfuncs.pyx
+++ b/sklearn/utils/arrayfuncs.pyx
@@ -1,7 +1,4 @@
-"""
-The :mod:`sklearn.utils.arrayfuncs` module includes a small collection of auxiliary
-functions that operate on arrays.
-"""
+"""A small collection of auxiliary functions that operate on arrays."""
 
 from cython cimport floating
 from cython.parallel cimport prange
@@ -16,6 +13,7 @@ ctypedef fused real_numeric:
     short
     int
     long
+    long long
     float
     double
 
diff --git a/sklearn/utils/class_weight.py b/sklearn/utils/class_weight.py
index 55802f780ed41..899e0890e6da1 100644
--- a/sklearn/utils/class_weight.py
+++ b/sklearn/utils/class_weight.py
@@ -1,11 +1,7 @@
-"""
-The :mod:`sklearn.utils.class_weight` module includes utilities for handling
-weights based on class labels.
-"""
-
-# Authors: Andreas Mueller
-#          Manoj Kumar
-# License: BSD 3 clause
+"""Utilities for handling weights based on class labels."""
+
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 from scipy import sparse
diff --git a/sklearn/utils/deprecation.py b/sklearn/utils/deprecation.py
index c46149d943431..a3225597701c7 100644
--- a/sklearn/utils/deprecation.py
+++ b/sklearn/utils/deprecation.py
@@ -114,3 +114,22 @@ def _is_deprecated(func):
         [c.cell_contents for c in closures if isinstance(c.cell_contents, str)]
     )
     return is_deprecated
+
+
+# TODO: remove in 1.7
+def _deprecate_Xt_in_inverse_transform(X, Xt):
+    """Helper to deprecate the `Xt` argument in favor of `X` in inverse_transform."""
+    if X is not None and Xt is not None:
+        raise TypeError("Cannot use both X and Xt. Use X only.")
+
+    if X is None and Xt is None:
+        raise TypeError("Missing required positional argument: X.")
+
+    if Xt is not None:
+        warnings.warn(
+            "Xt was renamed X in version 1.5 and will be removed in 1.7.",
+            FutureWarning,
+        )
+        return Xt
+
+    return X
diff --git a/sklearn/utils/discovery.py b/sklearn/utils/discovery.py
index 1b31a843ffd8a..7a6c73997ef8c 100644
--- a/sklearn/utils/discovery.py
+++ b/sklearn/utils/discovery.py
@@ -1,7 +1,4 @@
-"""
-The :mod:`sklearn.utils.discovery` module includes utilities to discover
-objects (i.e. estimators, displays, functions) from the `sklearn` package.
-"""
+"""Utilities to discover scikit-learn objects."""
 
 import inspect
 import pkgutil
@@ -79,7 +76,6 @@ def all_estimators(type_filter=None):
         TransformerMixin,
     )
     from ._testing import ignore_warnings
-    from .fixes import _IS_PYPY
 
     def is_abstract(c):
         if not (hasattr(c, "__abstractmethods__")):
@@ -106,15 +102,6 @@ def is_abstract(c):
                 (name, est_cls) for name, est_cls in classes if not name.startswith("_")
             ]
 
-            # TODO: Remove when FeatureHasher is implemented in PYPY
-            # Skips FeatureHasher for PYPY
-            if _IS_PYPY and "feature_extraction" in module_name:
-                classes = [
-                    (name, est_cls)
-                    for name, est_cls in classes
-                    if name == "FeatureHasher"
-                ]
-
             all_classes.extend(classes)
 
     all_classes = set(all_classes)
diff --git a/sklearn/utils/estimator_checks.py b/sklearn/utils/estimator_checks.py
index fb60f206bea66..422a23bb5ef72 100644
--- a/sklearn/utils/estimator_checks.py
+++ b/sklearn/utils/estimator_checks.py
@@ -1,7 +1,4 @@
-"""
-The :mod:`sklearn.utils.estimator_checks` module includes various utilities to
-check the compatibility of estimators with the scikit-learn API.
-"""
+"""Various utilities to check the compatibility of estimators with scikit-learn API."""
 
 import pickle
 import re
@@ -9,7 +6,7 @@
 from contextlib import nullcontext
 from copy import deepcopy
 from functools import partial, wraps
-from inspect import signature
+from inspect import isfunction, signature
 from numbers import Integral, Real
 
 import joblib
@@ -84,7 +81,7 @@
     raises,
     set_random_state,
 )
-from .fixes import _IS_PYPY, SPARSE_ARRAY_PRESENT, parse_version, sp_version
+from .fixes import SPARSE_ARRAY_PRESENT
 from .validation import _num_samples, check_is_fitted, has_fit_parameter
 
 REGRESSION_DATASET = None
@@ -405,13 +402,11 @@ def _get_check_estimator_ids(obj):
     --------
     check_estimator
     """
-    if callable(obj):
-        if not isinstance(obj, partial):
-            return obj.__name__
-
+    if isfunction(obj):
+        return obj.__name__
+    if isinstance(obj, partial):
         if not obj.keywords:
             return obj.func.__name__
-
         kwstring = ",".join(["{}={}".format(k, v) for k, v in obj.keywords.items()])
         return "{}({})".format(obj.func.__name__, kwstring)
     if hasattr(obj, "get_params"):
@@ -781,11 +776,6 @@ def _set_checking_parameters(estimator):
     if name == "OneHotEncoder":
         estimator.set_params(handle_unknown="ignore")
 
-    if name == "QuantileRegressor":
-        # Avoid warning due to Scipy deprecating interior-point solver
-        solver = "highs" if sp_version >= parse_version("1.6.0") else "interior-point"
-        estimator.set_params(solver=solver)
-
     if name in CROSS_DECOMPOSITION:
         estimator.set_params(n_components=1)
 
@@ -810,7 +800,7 @@ class _NotAnArray:
     def __init__(self, data):
         self.data = np.asarray(data)
 
-    def __array__(self, dtype=None):
+    def __array__(self, dtype=None, copy=None):
         return self.data
 
     def __array_function__(self, func, types, args, kwargs):
@@ -1033,9 +1023,9 @@ def check_array_api_input_and_values(
 def _check_estimator_sparse_container(name, estimator_orig, sparse_type):
     rng = np.random.RandomState(0)
     X = rng.uniform(size=(40, 3))
-    X[X < 0.8] = 0
+    X[X < 0.6] = 0
     X = _enforce_estimator_tags_X(estimator_orig, X)
-    y = (4 * rng.uniform(size=40)).astype(int)
+    y = (4 * rng.uniform(size=X.shape[0])).astype(np.int32)
     # catch deprecation warnings
     with ignore_warnings(category=FutureWarning):
         estimator = clone(estimator_orig)
@@ -3292,11 +3282,6 @@ def check_no_attributes_set_in_init(name, estimator_orig):
         return
 
     init_params = _get_args(type(estimator).__init__)
-    if _IS_PYPY:
-        # __init__ signature has additional objects in PyPy
-        for key in ["obj"]:
-            if key in init_params:
-                init_params.remove(key)
     parents_init_params = [
         param
         for params_parent in (_get_args(parent) for parent in type(estimator).__mro__)
@@ -4732,3 +4717,49 @@ def check_set_output_transform_polars(name, transformer_orig):
 
 def check_global_set_output_transform_polars(name, transformer_orig):
     _check_set_output_transform_polars_context(name, transformer_orig, "global")
+
+
+@ignore_warnings(category=FutureWarning)
+def check_inplace_ensure_writeable(name, estimator_orig):
+    """Check that estimators able to do inplace operations can work on read-only
+    input data even if a copy is not explicitly requested by the user.
+
+    Make sure that a copy is made and consequently that the input array and its
+    writeability are not modified by the estimator.
+    """
+    rng = np.random.RandomState(0)
+
+    estimator = clone(estimator_orig)
+    set_random_state(estimator)
+
+    n_samples = 100
+
+    X, _ = make_blobs(n_samples=n_samples, n_features=3, random_state=rng)
+    X = _enforce_estimator_tags_X(estimator, X)
+
+    # These estimators can only work inplace with fortran ordered input
+    if name in ("Lasso", "ElasticNet", "MultiTaskElasticNet", "MultiTaskLasso"):
+        X = np.asfortranarray(X)
+
+    # Add a missing value for imputers so that transform has to do something
+    if hasattr(estimator, "missing_values"):
+        X[0, 0] = np.nan
+
+    if is_regressor(estimator):
+        y = rng.normal(size=n_samples)
+    else:
+        y = rng.randint(low=0, high=2, size=n_samples)
+    y = _enforce_estimator_tags_y(estimator, y)
+
+    X_copy = X.copy()
+
+    # Make X read-only
+    X.setflags(write=False)
+
+    estimator.fit(X, y)
+
+    if hasattr(estimator, "transform"):
+        estimator.transform(X)
+
+    assert not X.flags.writeable
+    assert_allclose(X, X_copy)
diff --git a/sklearn/utils/extmath.py b/sklearn/utils/extmath.py
index 2fe7dbc3cc179..7b5720473848a 100644
--- a/sklearn/utils/extmath.py
+++ b/sklearn/utils/extmath.py
@@ -1,17 +1,7 @@
-"""
-The :mod:`sklearn.utils.extmath` module includes utilities to perform
-optimal mathematical operations in scikit-learn that are not available in SciPy.
-"""
-
-# Authors: Gael Varoquaux
-#          Alexandre Gramfort
-#          Alexandre T. Passos
-#          Olivier Grisel
-#          Lars Buitinck
-#          Stefan van der Walt
-#          Kyle Kastner
-#          Giorgio Patrini
-# License: BSD 3 clause
+"""Utilities to perform optimal mathematical operations in scikit-learn."""
+
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 from functools import partial
@@ -188,6 +178,7 @@ def safe_sparse_dot(a, b, *, dense_output=False):
            [11, 25, 39],
            [17, 39, 61]])
     """
+    xp, _ = get_namespace(a, b)
     if a.ndim > 2 or b.ndim > 2:
         if sparse.issparse(a):
             # sparse is always 2D. Implies b is 3D+
@@ -203,7 +194,12 @@ def safe_sparse_dot(a, b, *, dense_output=False):
             ret = a_2d @ b
             ret = ret.reshape(*a.shape[:-1], b.shape[1])
         else:
-            ret = np.dot(a, b)
+            # Alternative for `np.dot` when dealing with a or b having
+            # more than 2 dimensions, that works with the array api.
+            # If b is 1-dim then the last axis for b is taken otherwise
+            # if b is >= 2-dim then the second to last axis is taken.
+            b_axis = -1 if b.ndim == 1 else -2
+            ret = xp.tensordot(a, b, axes=[-1, b_axis])
     else:
         ret = a @ b
 
@@ -864,12 +860,14 @@ def svd_flip(u, v, u_based_decision=True):
         Parameters u and v are the output of `linalg.svd` or
         :func:`~sklearn.utils.extmath.randomized_svd`, with matching inner
         dimensions so one can compute `np.dot(u * s, v)`.
+        u can be None if `u_based_decision` is False.
 
     v : ndarray
         Parameters u and v are the output of `linalg.svd` or
         :func:`~sklearn.utils.extmath.randomized_svd`, with matching inner
         dimensions so one can compute `np.dot(u * s, v)`. The input v should
         really be called vt to be consistent with scipy's output.
+        v can be None if `u_based_decision` is True.
 
     u_based_decision : bool, default=True
         If True, use the columns of u as the basis for sign flipping.
@@ -884,24 +882,25 @@ def svd_flip(u, v, u_based_decision=True):
     v_adjusted : ndarray
         Array v with adjusted rows and the same dimensions as v.
     """
-    xp, _ = get_namespace(u, v)
-    device = getattr(u, "device", None)
+    xp, _ = get_namespace(*[a for a in [u, v] if a is not None])
 
     if u_based_decision:
         # columns of u, rows of v, or equivalently rows of u.T and v
         max_abs_u_cols = xp.argmax(xp.abs(u.T), axis=1)
-        shift = xp.arange(u.T.shape[0], device=device)
+        shift = xp.arange(u.T.shape[0], device=device(u))
         indices = max_abs_u_cols + shift * u.T.shape[1]
         signs = xp.sign(xp.take(xp.reshape(u.T, (-1,)), indices, axis=0))
         u *= signs[np.newaxis, :]
-        v *= signs[:, np.newaxis]
+        if v is not None:
+            v *= signs[:, np.newaxis]
     else:
         # rows of v, columns of u
         max_abs_v_rows = xp.argmax(xp.abs(v), axis=1)
-        shift = xp.arange(v.shape[0], device=device)
+        shift = xp.arange(v.shape[0], device=device(v))
         indices = max_abs_v_rows + shift * v.shape[1]
-        signs = xp.sign(xp.take(xp.reshape(v, (-1,)), indices))
-        u *= signs[np.newaxis, :]
+        signs = xp.sign(xp.take(xp.reshape(v, (-1,)), indices, axis=0))
+        if u is not None:
+            u *= signs[np.newaxis, :]
         v *= signs[:, np.newaxis]
     return u, v
 
diff --git a/sklearn/utils/fixes.py b/sklearn/utils/fixes.py
index 1b34a3fe1ffbc..bbf0831329fa5 100644
--- a/sklearn/utils/fixes.py
+++ b/sklearn/utils/fixes.py
@@ -4,12 +4,8 @@
 at which the fix is no longer needed.
 """
 
-# Authors: Emmanuelle Gouillart <emmanuelle.gouillart@normalesup.org>
-#          Gael Varoquaux <gael.varoquaux@normalesup.org>
-#          Fabian Pedregosa <fpedregosa@acm.org>
-#          Lars Buitinck
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import platform
 import struct
@@ -18,14 +14,10 @@
 import scipy
 import scipy.sparse.linalg
 import scipy.stats
-import threadpoolctl
-
-import sklearn
 
 from ..externals._packaging.version import parse as parse_version
-from .deprecation import deprecated
+from .parallel import _get_threadpool_controller
 
-_IS_PYPY = platform.python_implementation() == "PyPy"
 _IS_32BIT = 8 * struct.calcsize("P") == 32
 _IS_WASM = platform.machine() in ["wasm32", "wasm64"]
 
@@ -98,52 +90,6 @@ def _percentile(a, q, *, method="linear", **kwargs):
     from numpy import percentile  # type: ignore  # noqa
 
 
-# compatibility fix for threadpoolctl >= 3.0.0
-# since version 3 it's possible to setup a global threadpool controller to avoid
-# looping through all loaded shared libraries each time.
-# the global controller is created during the first call to threadpoolctl.
-def _get_threadpool_controller():
-    if not hasattr(threadpoolctl, "ThreadpoolController"):
-        return None
-
-    if not hasattr(sklearn, "_sklearn_threadpool_controller"):
-        sklearn._sklearn_threadpool_controller = threadpoolctl.ThreadpoolController()
-
-    return sklearn._sklearn_threadpool_controller
-
-
-def threadpool_limits(limits=None, user_api=None):
-    controller = _get_threadpool_controller()
-    if controller is not None:
-        return controller.limit(limits=limits, user_api=user_api)
-    else:
-        return threadpoolctl.threadpool_limits(limits=limits, user_api=user_api)
-
-
-threadpool_limits.__doc__ = threadpoolctl.threadpool_limits.__doc__
-
-
-def threadpool_info():
-    controller = _get_threadpool_controller()
-    if controller is not None:
-        return controller.info()
-    else:
-        return threadpoolctl.threadpool_info()
-
-
-threadpool_info.__doc__ = threadpoolctl.threadpool_info.__doc__
-
-
-@deprecated(
-    "The function `delayed` has been moved from `sklearn.utils.fixes` to "
-    "`sklearn.utils.parallel`. This import path will be removed in 1.5."
-)
-def delayed(function):
-    from sklearn.utils.parallel import delayed
-
-    return delayed(function)
-
-
 # TODO: Remove when SciPy 1.11 is the minimum supported version
 def _mode(a, axis=0):
     if sp_version >= parse_version("1.9.0"):
@@ -275,13 +221,6 @@ def _sparse_nan_min_max(X, axis):
     from numpy import ComplexWarning, VisibleDeprecationWarning  # type: ignore  # noqa
 
 
-# TODO: Remove when Scipy 1.6 is the minimum supported version
-try:
-    from scipy.integrate import trapezoid  # type: ignore  # noqa
-except ImportError:
-    from scipy.integrate import trapz as trapezoid  # type: ignore  # noqa
-
-
 # TODO: Adapt when Pandas > 2.2 is the minimum supported version
 def pd_fillna(pd, frame):
     pd_version = parse_version(pd.__version__).base_version
@@ -439,7 +378,7 @@ def _in_unstable_openblas_configuration():
     import numpy  # noqa
     import scipy  # noqa
 
-    modules_info = threadpool_info()
+    modules_info = _get_threadpool_controller().info()
 
     open_blas_used = any(info["internal_api"] == "openblas" for info in modules_info)
     if not open_blas_used:
diff --git a/sklearn/utils/graph.py b/sklearn/utils/graph.py
index 06b2e152101a9..47026f0611dfa 100644
--- a/sklearn/utils/graph.py
+++ b/sklearn/utils/graph.py
@@ -1,11 +1,7 @@
-"""
-The :mod:`sklearn.utils.graph` module includes graph utilities and algorithms.
-"""
-
-# Authors: Aric Hagberg <hagberg@lanl.gov>
-#          Gael Varoquaux <gael.varoquaux@normalesup.org>
-#          Jake Vanderplas <vanderplas@astro.washington.edu>
-# License: BSD 3 clause
+"""Graph utilities and algorithms."""
+
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 from scipy import sparse
diff --git a/sklearn/utils/meson.build b/sklearn/utils/meson.build
index 1cd707beb835f..9bbfc01b7b6bf 100644
--- a/sklearn/utils/meson.build
+++ b/sklearn/utils/meson.build
@@ -1,6 +1,9 @@
 # utils is cimported from other subpackages so this is needed for the cimport
 # to work
 utils_cython_tree = [
+  # We add sklearn_root_cython_tree to make sure sklearn/__init__.py is copied
+  # early in the build
+  sklearn_root_cython_tree,
   fs.copyfile('__init__.py'),
   fs.copyfile('_cython_blas.pxd'),
   fs.copyfile('_heap.pxd'),
@@ -35,7 +38,7 @@ utils_extension_metadata = {
 foreach ext_name, ext_dict : utils_extension_metadata
   py.extension_module(
     ext_name,
-    ext_dict.get('sources') + utils_cython_tree,
+    [ext_dict.get('sources'), utils_cython_tree],
     dependencies: ext_dict.get('dependencies', []),
     override_options : ext_dict.get('override_options', []),
     cython_args: cython_args,
@@ -59,11 +62,15 @@ foreach name: util_extension_names
     name + '_pyx',
     output: name + '.pyx',
     input: name + '.pyx.tp',
-    command: [py, tempita, '@INPUT@', '-o', '@OUTDIR@']
+    command: [py, tempita, '@INPUT@', '-o', '@OUTDIR@'],
+    # TODO in principle this should go in py.exension_module below. This is
+    # temporary work-around for dependency issue with .pyx.tp files. For more
+    # details, see https://github.com/mesonbuild/meson/issues/13212
+    depends: [pxd, utils_cython_tree],
   )
   py.extension_module(
     name,
-    [pxd, pyx] + utils_cython_tree,
+    pyx,
     cython_args: cython_args,
     subdir: 'sklearn/utils',
     install: true
diff --git a/sklearn/utils/metadata_routing.py b/sklearn/utils/metadata_routing.py
index bb98d2f08b93e..e9f86311a4a21 100644
--- a/sklearn/utils/metadata_routing.py
+++ b/sklearn/utils/metadata_routing.py
@@ -1,13 +1,10 @@
-"""
-The :mod:`sklearn.utils.metadata_routing` module includes utilities to route
-metadata within scikit-learn estimators.
-"""
+"""Utilities to route metadata within scikit-learn estimators."""
 
 # This module is not a separate sub-folder since that would result in a circular
 # import issue.
 #
-# Author: Adrin Jalali <adrin.jalali@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from ._metadata_requests import WARN, UNUSED, UNCHANGED  # noqa
 from ._metadata_requests import get_routing_for_object  # noqa
diff --git a/sklearn/utils/metaestimators.py b/sklearn/utils/metaestimators.py
index 639e000dd77a7..000722e253d14 100644
--- a/sklearn/utils/metaestimators.py
+++ b/sklearn/utils/metaestimators.py
@@ -1,10 +1,7 @@
-"""
-The :mod:`sklearn.utils.metaestimators` module includes utilities for meta-estimators.
-"""
+"""Utilities for meta-estimators."""
 
-# Author: Joel Nothman
-#         Andreas Mueller
-# License: BSD
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 from abc import ABCMeta, abstractmethod
 from contextlib import suppress
 from typing import Any, List
diff --git a/sklearn/utils/multiclass.py b/sklearn/utils/multiclass.py
index a4b23427e5b70..ead7f416368e3 100644
--- a/sklearn/utils/multiclass.py
+++ b/sklearn/utils/multiclass.py
@@ -1,11 +1,8 @@
-"""
-The :mod:`sklearn.utils.multiclass` module includes utilities to handle
-multiclass/multioutput target in classifiers.
-"""
-
-# Author: Arnaud Joly, Joel Nothman, Hamzeh Alsalhi
-#
-# License: BSD 3 clause
+"""Utilities to handle multiclass/multioutput target in classifiers."""
+
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
+
 import warnings
 from collections.abc import Sequence
 from itertools import chain
@@ -342,13 +339,24 @@ def type_of_target(y, input_name=""):
                 # see NEP 34
                 y = check_array(y, dtype=object, **check_y_kwargs)
 
-    # The old sequence of sequences format
     try:
-        first_row = y[[0], :] if issparse(y) else y[0]
+        # TODO(1.7): Change to ValueError when byte labels is deprecated.
+        # labels in bytes format
+        first_row_or_val = y[[0], :] if issparse(y) else y[0]
+        if isinstance(first_row_or_val, bytes):
+            warnings.warn(
+                (
+                    "Support for labels represented as bytes is deprecated in v1.5 and"
+                    " will error in v1.7. Convert the labels to a string or integer"
+                    " format."
+                ),
+                FutureWarning,
+            )
+        # The old sequence of sequences format
         if (
-            not hasattr(first_row, "__array__")
-            and isinstance(first_row, Sequence)
-            and not isinstance(first_row, str)
+            not hasattr(first_row_or_val, "__array__")
+            and isinstance(first_row_or_val, Sequence)
+            and not isinstance(first_row_or_val, str)
         ):
             raise ValueError(
                 "You appear to be using a legacy multi-label data"
@@ -390,9 +398,9 @@ def type_of_target(y, input_name=""):
             return "continuous" + suffix
 
     # Check multiclass
-    if issparse(first_row):
-        first_row = first_row.data
-    if xp.unique_values(y).shape[0] > 2 or (y.ndim == 2 and len(first_row) > 1):
+    if issparse(first_row_or_val):
+        first_row_or_val = first_row_or_val.data
+    if xp.unique_values(y).shape[0] > 2 or (y.ndim == 2 and len(first_row_or_val) > 1):
         # [1, 2, 3] or [[1., 2., 3]] or [[1, 2]]
         return "multiclass" + suffix
     else:
diff --git a/sklearn/utils/murmurhash.pyx b/sklearn/utils/murmurhash.pyx
index b7dacfb48b4a2..fee239acd98fb 100644
--- a/sklearn/utils/murmurhash.pyx
+++ b/sklearn/utils/murmurhash.pyx
@@ -10,9 +10,8 @@ and can be found here:
   https://code.google.com/p/smhasher/
 
 """
-# Author: Olivier Grisel <olivier.grisel@ensta.org>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from ..utils._typedefs cimport int32_t, uint32_t
 
diff --git a/sklearn/utils/optimize.py b/sklearn/utils/optimize.py
index d79f514aae778..980271a572b9a 100644
--- a/sklearn/utils/optimize.py
+++ b/sklearn/utils/optimize.py
@@ -12,7 +12,7 @@
 # This is a modified file from scipy.optimize
 # Original authors: Travis Oliphant, Eric Jones
 # Modifications by Gael Varoquaux, Mathieu Blondel and Tom Dupre la Tour
-# License: BSD
+# SPDX-License-Identifier: BSD-3-Clause
 
 import warnings
 
@@ -27,7 +27,9 @@ class _LineSearchError(RuntimeError):
     pass
 
 
-def _line_search_wolfe12(f, fprime, xk, pk, gfk, old_fval, old_old_fval, **kwargs):
+def _line_search_wolfe12(
+    f, fprime, xk, pk, gfk, old_fval, old_old_fval, verbose=0, **kwargs
+):
     """
     Same as line_search_wolfe1, but fall back to line_search_wolfe2 if
     suitable step length is not found, and raise an exception if a
@@ -39,24 +41,44 @@ def _line_search_wolfe12(f, fprime, xk, pk, gfk, old_fval, old_old_fval, **kwarg
         If no suitable step size is found.
 
     """
+    is_verbose = verbose >= 2
+    eps = 16 * np.finfo(np.asarray(old_fval).dtype).eps
+    if is_verbose:
+        print("  Line Search")
+        print(f"    eps=16 * finfo.eps={eps}")
+        print("    try line search wolfe1")
+
     ret = line_search_wolfe1(f, fprime, xk, pk, gfk, old_fval, old_old_fval, **kwargs)
 
+    if is_verbose:
+        _not_ = "not " if ret[0] is None else ""
+        print("    wolfe1 line search was " + _not_ + "successful")
+
     if ret[0] is None:
         # Have a look at the line_search method of our NewtonSolver class. We borrow
         # the logic from there
         # Deal with relative loss differences around machine precision.
         args = kwargs.get("args", tuple())
         fval = f(xk + pk, *args)
-        eps = 16 * np.finfo(np.asarray(old_fval).dtype).eps
         tiny_loss = np.abs(old_fval * eps)
         loss_improvement = fval - old_fval
         check = np.abs(loss_improvement) <= tiny_loss
+        if is_verbose:
+            print(
+                "    check loss |improvement| <= eps * |loss_old|:"
+                f" {np.abs(loss_improvement)} <= {tiny_loss} {check}"
+            )
         if check:
             # 2.1 Check sum of absolute gradients as alternative condition.
             sum_abs_grad_old = scipy.linalg.norm(gfk, ord=1)
             grad = fprime(xk + pk, *args)
             sum_abs_grad = scipy.linalg.norm(grad, ord=1)
             check = sum_abs_grad < sum_abs_grad_old
+            if is_verbose:
+                print(
+                    "    check sum(|gradient|) < sum(|gradient_old|): "
+                    f"{sum_abs_grad} < {sum_abs_grad_old} {check}"
+                )
             if check:
                 ret = (
                     1.0,  # step size
@@ -72,9 +94,14 @@ def _line_search_wolfe12(f, fprime, xk, pk, gfk, old_fval, old_old_fval, **kwarg
         # TODO: It seems that the new check for the sum of absolute gradients above
         # catches all cases that, earlier, ended up here. In fact, our tests never
         # trigger this "if branch" here and we can consider to remove it.
+        if is_verbose:
+            print("    last resort: try line search wolfe2")
         ret = line_search_wolfe2(
             f, fprime, xk, pk, gfk, old_fval, old_old_fval, **kwargs
         )
+        if is_verbose:
+            _not_ = "not " if ret[0] is None else ""
+            print("    wolfe2 line search was " + _not_ + "successful")
 
     if ret[0] is None:
         raise _LineSearchError()
@@ -82,7 +109,7 @@ def _line_search_wolfe12(f, fprime, xk, pk, gfk, old_fval, old_old_fval, **kwarg
     return ret
 
 
-def _cg(fhess_p, fgrad, maxiter, tol):
+def _cg(fhess_p, fgrad, maxiter, tol, verbose=0):
     """
     Solve iteratively the linear system 'fhess_p . xsupi = fgrad'
     with a conjugate gradient descent.
@@ -107,30 +134,51 @@ def _cg(fhess_p, fgrad, maxiter, tol):
     xsupi : ndarray of shape (n_features,) or (n_features + 1,)
         Estimated solution.
     """
+    eps = 16 * np.finfo(np.float64).eps
     xsupi = np.zeros(len(fgrad), dtype=fgrad.dtype)
-    ri = np.copy(fgrad)
+    ri = np.copy(fgrad)  # residual = fgrad - fhess_p @ xsupi
     psupi = -ri
     i = 0
     dri0 = np.dot(ri, ri)
-    # We also track of |p_i|^2.
+    # We also keep track of |p_i|^2.
     psupi_norm2 = dri0
+    is_verbose = verbose >= 2
 
     while i <= maxiter:
         if np.sum(np.abs(ri)) <= tol:
+            if is_verbose:
+                print(
+                    f"  Inner CG solver iteration {i} stopped with\n"
+                    f"    sum(|residuals|) <= tol: {np.sum(np.abs(ri))} <= {tol}"
+                )
             break
 
         Ap = fhess_p(psupi)
         # check curvature
         curv = np.dot(psupi, Ap)
-        if 0 <= curv <= 16 * np.finfo(np.float64).eps * psupi_norm2:
+        if 0 <= curv <= eps * psupi_norm2:
             # See https://arxiv.org/abs/1803.02924, Algo 1 Capped Conjugate Gradient.
+            if is_verbose:
+                print(
+                    f"  Inner CG solver iteration {i} stopped with\n"
+                    f"    tiny_|p| = eps * ||p||^2, eps = {eps}, "
+                    f"squred L2 norm ||p||^2 = {psupi_norm2}\n"
+                    f"    curvature <= tiny_|p|: {curv} <= {eps * psupi_norm2}"
+                )
             break
         elif curv < 0:
             if i > 0:
+                if is_verbose:
+                    print(
+                        f"  Inner CG solver iteration {i} stopped with negative "
+                        f"curvature, curvature = {curv}"
+                    )
                 break
             else:
                 # fall back to steepest descent direction
                 xsupi += dri0 / curv * psupi
+                if is_verbose:
+                    print("  Inner CG solver iteration 0 fell back to steepest descent")
                 break
         alphai = dri0 / curv
         xsupi += alphai * psupi
@@ -142,7 +190,11 @@ def _cg(fhess_p, fgrad, maxiter, tol):
         psupi_norm2 = dri1 + betai**2 * psupi_norm2
         i = i + 1
         dri0 = dri1  # update np.dot(ri,ri) for next time.
-
+    if is_verbose and i > maxiter:
+        print(
+            f"  Inner CG solver stopped reaching maxiter={i - 1} with "
+            f"sum(|residuals|) = {np.sum(np.abs(ri))}"
+        )
     return xsupi
 
 
@@ -157,6 +209,7 @@ def _newton_cg(
     maxinner=200,
     line_search=True,
     warn=True,
+    verbose=0,
 ):
     """
     Minimization of scalar function of one or more variables using the
@@ -210,6 +263,10 @@ def _newton_cg(
     if line_search:
         old_fval = func(x0, *args)
         old_old_fval = None
+    else:
+        old_fval = 0
+
+    is_verbose = verbose > 0
 
     # Outer loop: our Newton iteration
     while k < maxiter:
@@ -218,7 +275,13 @@ def _newton_cg(
         fgrad, fhess_p = grad_hess(xk, *args)
 
         absgrad = np.abs(fgrad)
-        if np.max(absgrad) <= tol:
+        max_absgrad = np.max(absgrad)
+        check = max_absgrad <= tol
+        if is_verbose:
+            print(f"Newton-CG iter = {k}")
+            print("  Check Convergence")
+            print(f"    max |gradient| <= tol: {max_absgrad} <= {tol} {check}")
+        if check:
             break
 
         maggrad = np.sum(absgrad)
@@ -227,14 +290,22 @@ def _newton_cg(
 
         # Inner loop: solve the Newton update by conjugate gradient, to
         # avoid inverting the Hessian
-        xsupi = _cg(fhess_p, fgrad, maxiter=maxinner, tol=termcond)
+        xsupi = _cg(fhess_p, fgrad, maxiter=maxinner, tol=termcond, verbose=verbose)
 
         alphak = 1.0
 
         if line_search:
             try:
                 alphak, fc, gc, old_fval, old_old_fval, gfkp1 = _line_search_wolfe12(
-                    func, grad, xk, xsupi, fgrad, old_fval, old_old_fval, args=args
+                    func,
+                    grad,
+                    xk,
+                    xsupi,
+                    fgrad,
+                    old_fval,
+                    old_old_fval,
+                    verbose=verbose,
+                    args=args,
                 )
             except _LineSearchError:
                 warnings.warn("Line Search failed")
@@ -245,9 +316,14 @@ def _newton_cg(
 
     if warn and k >= maxiter:
         warnings.warn(
-            "newton-cg failed to converge. Increase the number of iterations.",
+            (
+                f"newton-cg failed to converge at loss = {old_fval}. Increase the"
+                " number of iterations."
+            ),
             ConvergenceWarning,
         )
+    elif is_verbose:
+        print(f"  Solver did converge at loss = {old_fval}.")
     return xk, k
 
 
@@ -276,11 +352,8 @@ def _check_optimize_result(solver, result, max_iter=None, extra_warning_msg=None
     # handle both scipy and scikit-learn solver names
     if solver == "lbfgs":
         if result.status != 0:
-            try:
-                # The message is already decoded in scipy>=1.6.0
-                result_message = result.message.decode("latin1")
-            except AttributeError:
-                result_message = result.message
+            result_message = result.message
+
             warning_msg = (
                 "{} failed to converge (status={}):\n{}.\n\n"
                 "Increase the number of iterations (max_iter) "
diff --git a/sklearn/utils/parallel.py b/sklearn/utils/parallel.py
index d0dc2ec2be030..7d7349ebe2816 100644
--- a/sklearn/utils/parallel.py
+++ b/sklearn/utils/parallel.py
@@ -1,5 +1,5 @@
-"""
-The :mod:`sklearn.utils.parallel` customizes `joblib` tools for scikit-learn usage.
+"""Customizations of :mod:`joblib` and :mod:`threadpoolctl` tools for scikit-learn
+usage.
 """
 
 import functools
@@ -7,9 +7,16 @@
 from functools import update_wrapper
 
 import joblib
+from threadpoolctl import ThreadpoolController
 
 from .._config import config_context, get_config
 
+# Global threadpool controller instance that can be used to locally limit the number of
+# threads without looping through all shared libraries every time.
+# It should not be accessed directly and _get_threadpool_controller should be used
+# instead.
+_threadpool_controller = None
+
 
 def _with_config(delayed_func, config):
     """Helper function that intends to attach a config to a delayed function."""
@@ -127,3 +134,33 @@ def __call__(self, *args, **kwargs):
             config = {}
         with config_context(**config):
             return self.function(*args, **kwargs)
+
+
+def _get_threadpool_controller():
+    """Return the global threadpool controller instance."""
+    global _threadpool_controller
+
+    if _threadpool_controller is None:
+        _threadpool_controller = ThreadpoolController()
+
+    return _threadpool_controller
+
+
+def _threadpool_controller_decorator(limits=1, user_api="blas"):
+    """Decorator to limit the number of threads used at the function level.
+
+    It should be prefered over `threadpoolctl.ThreadpoolController.wrap` because this
+    one only loads the shared libraries when the function is called while the latter
+    loads them at import time.
+    """
+
+    def decorator(func):
+        @functools.wraps(func)
+        def wrapper(*args, **kwargs):
+            controller = _get_threadpool_controller()
+            with controller.limit(limits=limits, user_api=user_api):
+                return func(*args, **kwargs)
+
+        return wrapper
+
+    return decorator
diff --git a/sklearn/utils/random.py b/sklearn/utils/random.py
index 1dfe8d83a94b3..e7408de304b89 100644
--- a/sklearn/utils/random.py
+++ b/sklearn/utils/random.py
@@ -1,10 +1,7 @@
-"""
-The mod:`sklearn.utils.random` module includes utilities for random sampling.
-"""
+"""Utilities for random sampling."""
 
-# Author: Hamzeh Alsalhi <ha258@cornell.edu>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import array
 
 import numpy as np
diff --git a/sklearn/utils/sparsefuncs.py b/sklearn/utils/sparsefuncs.py
index a46e9e4d9ed93..8e721c6b3852c 100644
--- a/sklearn/utils/sparsefuncs.py
+++ b/sklearn/utils/sparsefuncs.py
@@ -1,13 +1,7 @@
-"""
-The :mod:`sklearn.utils.sparsefuncs` module includes a collection of utilities to
-work with sparse matrices and arrays.
-"""
-
-# Authors: Manoj Kumar
-#          Thomas Unterthiner
-#          Giorgio Patrini
-#
-# License: BSD 3 clause
+"""A collection of utilities to work with sparse matrices and arrays."""
+
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import numpy as np
 import scipy.sparse as sp
 from scipy.sparse.linalg import LinearOperator
diff --git a/sklearn/utils/sparsefuncs_fast.pyx b/sklearn/utils/sparsefuncs_fast.pyx
index c3bd0370d8b96..dbba23c615d63 100644
--- a/sklearn/utils/sparsefuncs_fast.pyx
+++ b/sklearn/utils/sparsefuncs_fast.pyx
@@ -1,15 +1,7 @@
-"""
-The :mod:`sklearn.utils.sparsefuncs_fast` module includes a collection of utilities to
-work with sparse matrices and arrays written in Cython.
-"""
-
-# Authors: Mathieu Blondel
-#          Olivier Grisel
-#          Peter Prettenhofer
-#          Lars Buitinck
-#          Giorgio Patrini
-#
-# License: BSD 3 clause
+"""Utilities to work with sparse matrices and arrays written in Cython."""
+
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from libc.math cimport fabs, sqrt, isnan
 from libc.stdint cimport intptr_t
diff --git a/sklearn/utils/tests/test_array_api.py b/sklearn/utils/tests/test_array_api.py
index ec4a487f0b1df..707304edacd11 100644
--- a/sklearn/utils/tests/test_array_api.py
+++ b/sklearn/utils/tests/test_array_api.py
@@ -13,21 +13,29 @@
     _atol_for_type,
     _average,
     _convert_to_numpy,
+    _count_nonzero,
     _estimator_with_converted_arrays,
+    _fill_or_add_to_diagonal,
+    _is_numpy_namespace,
+    _isin,
+    _max_precision_float_dtype,
     _nanmax,
     _nanmin,
     _NumPyAPIWrapper,
+    _ravel,
     device,
     get_namespace,
+    get_namespace_and_device,
     indexing_dtype,
     supported_float_dtypes,
     yield_namespace_device_dtype_combinations,
 )
 from sklearn.utils._testing import (
     _array_api_for_tests,
+    assert_array_equal,
     skip_if_array_api_compat_not_configured,
 )
-from sklearn.utils.fixes import _IS_32BIT
+from sklearn.utils.fixes import _IS_32BIT, CSR_CONTAINERS, np_version, parse_version
 
 
 @pytest.mark.parametrize("X", [numpy.asarray([1, 2, 3]), [1, 2, 3]])
@@ -60,7 +68,12 @@ def test_get_namespace_ndarray_with_dispatch():
     with config_context(array_api_dispatch=True):
         xp_out, is_array_api_compliant = get_namespace(X_np)
         assert is_array_api_compliant
-        assert xp_out is array_api_compat.numpy
+        if np_version >= parse_version("2.0.0"):
+            # NumPy 2.0+ is an array API compliant library.
+            assert xp_out is numpy
+        else:
+            # Older NumPy versions require the compatibility layer.
+            assert xp_out is array_api_compat.numpy
 
 
 @skip_if_array_api_compat_not_configured
@@ -100,6 +113,26 @@ def test_array_api_wrapper_astype():
     assert X_converted.dtype == xp.float32
 
 
+def test_array_api_wrapper_maximum():
+    """Test _ArrayAPIWrapper `maximum` for ArrayAPIs other than NumPy.
+
+    This is mainly used to test for `cupy.array_api` but since that is
+    not available on our coverage-enabled PR CI, we resort to using
+    `array-api-strict`.
+    """
+    array_api_strict = pytest.importorskip("array_api_strict")
+    xp_ = _AdjustableNameAPITestWrapper(array_api_strict, "array_api_strict")
+    xp = _ArrayAPIWrapper(xp_)
+
+    x1 = xp.asarray(([[1, 2, 3], [3, 9, 5]]), dtype=xp.int64)
+    x2 = xp.asarray(([[0, 1, 6], [8, 4, 5]]), dtype=xp.int64)
+    result = xp.asarray([[1, 2, 6], [8, 9, 5]], dtype=xp.int64)
+
+    x_max = xp.maximum(x1, x2)
+    assert x_max.dtype == x1.dtype
+    assert xp.all(xp.equal(x_max, result))
+
+
 @pytest.mark.parametrize("array_api", ["numpy", "array_api_strict"])
 def test_asarray_with_order(array_api):
     """Test _asarray_with_order passes along order for NumPy arrays."""
@@ -128,7 +161,7 @@ def test_asarray_with_order_ignored():
 
 
 @pytest.mark.parametrize(
-    "array_namespace, device, dtype_name", yield_namespace_device_dtype_combinations()
+    "array_namespace, device_, dtype_name", yield_namespace_device_dtype_combinations()
 )
 @pytest.mark.parametrize(
     "weights, axis, normalize, expected",
@@ -160,19 +193,22 @@ def test_asarray_with_order_ignored():
     ],
 )
 def test_average(
-    array_namespace, device, dtype_name, weights, axis, normalize, expected
+    array_namespace, device_, dtype_name, weights, axis, normalize, expected
 ):
-    xp = _array_api_for_tests(array_namespace, device)
+    xp = _array_api_for_tests(array_namespace, device_)
     array_in = numpy.asarray([[1, 2, 3], [4, 5, 6]], dtype=dtype_name)
-    array_in = xp.asarray(array_in, device=device)
+    array_in = xp.asarray(array_in, device=device_)
     if weights is not None:
         weights = numpy.asarray(weights, dtype=dtype_name)
-        weights = xp.asarray(weights, device=device)
+        weights = xp.asarray(weights, device=device_)
 
     with config_context(array_api_dispatch=True):
         result = _average(array_in, axis=axis, weights=weights, normalize=normalize)
 
-    assert getattr(array_in, "device", None) == getattr(result, "device", None)
+    if np_version < parse_version("2.0.0") or np_version >= parse_version("2.1.0"):
+        # NumPy 2.0 has a problem with the device attribute of scalar arrays:
+        # https://github.com/numpy/numpy/issues/26850
+        assert device(array_in) == device(result)
 
     result = _convert_to_numpy(result, xp)
     assert_allclose(result, expected, atol=_atol_for_type(dtype_name))
@@ -219,14 +255,15 @@ def test_average_raises_with_wrong_dtype(array_namespace, device, dtype_name):
         (
             0,
             [[1, 2]],
-            TypeError,
-            "1D weights expected",
+            # NumPy 2 raises ValueError, NumPy 1 raises TypeError
+            (ValueError, TypeError),
+            "weights",  # the message is different for NumPy 1 and 2...
         ),
         (
             0,
             [1, 2, 3, 4],
             ValueError,
-            "Length of weights",
+            "weights",
         ),
         (0, [-1, 1], ZeroDivisionError, "Weights sum to zero, can't be normalized"),
     ),
@@ -348,6 +385,26 @@ def test_nan_reductions(library, X, reduction, expected):
     assert_allclose(result, expected)
 
 
+@pytest.mark.parametrize(
+    "namespace, _device, _dtype", yield_namespace_device_dtype_combinations()
+)
+def test_ravel(namespace, _device, _dtype):
+    xp = _array_api_for_tests(namespace, _device)
+
+    array = [[1, 2, 3], [4, 5, 6], [7, 8, 9], [10, 11, 12]]
+    array_xp = xp.asarray(array, device=_device)
+    with config_context(array_api_dispatch=True):
+        result = _ravel(array_xp)
+
+    result = _convert_to_numpy(result, xp)
+    expected = numpy.ravel(array, order="C")
+
+    assert_allclose(expected, result)
+
+    if _is_numpy_namespace(xp):
+        assert numpy.asarray(result).flags["C_CONTIGUOUS"]
+
+
 @skip_if_array_api_compat_not_configured
 @pytest.mark.parametrize("library", ["cupy", "torch", "cupy.array_api"])
 def test_convert_to_numpy_gpu(library):  # pragma: nocover
@@ -482,3 +539,122 @@ def test_indexing_dtype(namespace, _device, _dtype):
         assert indexing_dtype(xp) == xp.int32
     else:
         assert indexing_dtype(xp) == xp.int64
+
+
+@pytest.mark.parametrize(
+    "namespace, _device, _dtype", yield_namespace_device_dtype_combinations()
+)
+def test_max_precision_float_dtype(namespace, _device, _dtype):
+    xp = _array_api_for_tests(namespace, _device)
+    expected_dtype = xp.float32 if _device == "mps" else xp.float64
+    assert _max_precision_float_dtype(xp, _device) == expected_dtype
+
+
+@pytest.mark.parametrize(
+    "array_namespace, device, _", yield_namespace_device_dtype_combinations()
+)
+@pytest.mark.parametrize("invert", [True, False])
+@pytest.mark.parametrize("assume_unique", [True, False])
+@pytest.mark.parametrize("element_size", [6, 10, 14])
+@pytest.mark.parametrize("int_dtype", ["int16", "int32", "int64", "uint8"])
+def test_isin(
+    array_namespace, device, _, invert, assume_unique, element_size, int_dtype
+):
+    xp = _array_api_for_tests(array_namespace, device)
+    r = element_size // 2
+    element = 2 * numpy.arange(element_size).reshape((r, 2)).astype(int_dtype)
+    test_elements = numpy.array(numpy.arange(14), dtype=int_dtype)
+    element_xp = xp.asarray(element, device=device)
+    test_elements_xp = xp.asarray(test_elements, device=device)
+    expected = numpy.isin(
+        element=element,
+        test_elements=test_elements,
+        assume_unique=assume_unique,
+        invert=invert,
+    )
+    with config_context(array_api_dispatch=True):
+        result = _isin(
+            element=element_xp,
+            test_elements=test_elements_xp,
+            xp=xp,
+            assume_unique=assume_unique,
+            invert=invert,
+        )
+
+    assert_array_equal(_convert_to_numpy(result, xp=xp), expected)
+
+
+def test_get_namespace_and_device():
+    # Use torch as a library with custom Device objects:
+    torch = pytest.importorskip("torch")
+    xp_torch = pytest.importorskip("array_api_compat.torch")
+    some_torch_tensor = torch.arange(3, device="cpu")
+    some_numpy_array = numpy.arange(3)
+
+    # When dispatch is disabled, get_namespace_and_device should return the
+    # default NumPy wrapper namespace and no device. Our code will handle such
+    # inputs via the usual __array__ interface without attempting to dispatch
+    # via the array API.
+    namespace, is_array_api, device = get_namespace_and_device(some_torch_tensor)
+    assert namespace is get_namespace(some_numpy_array)[0]
+    assert not is_array_api
+    assert device is None
+
+    # Otherwise, expose the torch namespace and device via array API compat
+    # wrapper.
+    with config_context(array_api_dispatch=True):
+        namespace, is_array_api, device = get_namespace_and_device(some_torch_tensor)
+        assert namespace is xp_torch
+        assert is_array_api
+        assert device == some_torch_tensor.device
+
+
+@pytest.mark.parametrize(
+    "array_namespace, device_, dtype_name", yield_namespace_device_dtype_combinations()
+)
+@pytest.mark.parametrize("csr_container", CSR_CONTAINERS)
+@pytest.mark.parametrize("axis", [0, 1, None, -1, -2])
+@pytest.mark.parametrize("sample_weight_type", [None, "int", "float"])
+def test_count_nonzero(
+    array_namespace, device_, dtype_name, csr_container, axis, sample_weight_type
+):
+
+    from sklearn.utils.sparsefuncs import count_nonzero as sparse_count_nonzero
+
+    xp = _array_api_for_tests(array_namespace, device_)
+    array = numpy.array([[0, 3, 0], [2, -1, 0], [0, 0, 0], [9, 8, 7], [4, 0, 5]])
+    if sample_weight_type == "int":
+        sample_weight = numpy.asarray([1, 2, 2, 3, 1])
+    elif sample_weight_type == "float":
+        sample_weight = numpy.asarray([0.5, 1.5, 0.8, 3.2, 2.4], dtype=dtype_name)
+    else:
+        sample_weight = None
+    expected = sparse_count_nonzero(
+        csr_container(array), axis=axis, sample_weight=sample_weight
+    )
+    array_xp = xp.asarray(array, device=device_)
+
+    with config_context(array_api_dispatch=True):
+        result = _count_nonzero(
+            array_xp, xp=xp, device=device_, axis=axis, sample_weight=sample_weight
+        )
+
+    assert_allclose(_convert_to_numpy(result, xp=xp), expected)
+
+    if np_version < parse_version("2.0.0") or np_version >= parse_version("2.1.0"):
+        # NumPy 2.0 has a problem with the device attribute of scalar arrays:
+        # https://github.com/numpy/numpy/issues/26850
+        assert device(array_xp) == device(result)
+
+
+@pytest.mark.parametrize(
+    "array_namespace, device_, dtype_name", yield_namespace_device_dtype_combinations()
+)
+@pytest.mark.parametrize("wrap", [True, False])
+def test_fill_or_add_to_diagonal(array_namespace, device_, dtype_name, wrap):
+    xp = _array_api_for_tests(array_namespace, device_)
+    array_np = numpy.zeros((5, 4), dtype=numpy.int64)
+    array_xp = xp.asarray(array_np)
+    _fill_or_add_to_diagonal(array_xp, value=1, xp=xp, add_value=False, wrap=wrap)
+    numpy.fill_diagonal(array_np, val=1, wrap=wrap)
+    assert_array_equal(_convert_to_numpy(array_xp, xp=xp), array_np)
diff --git a/sklearn/utils/tests/test_arrayfuncs.py b/sklearn/utils/tests/test_arrayfuncs.py
index 4a80a4c1edefd..a5c99427cbd00 100644
--- a/sklearn/utils/tests/test_arrayfuncs.py
+++ b/sklearn/utils/tests/test_arrayfuncs.py
@@ -26,7 +26,9 @@ def test_min_pos_no_positive(dtype):
     assert min_pos(X) == np.finfo(dtype).max
 
 
-@pytest.mark.parametrize("dtype", [np.int16, np.int32, np.float32, np.float64])
+@pytest.mark.parametrize(
+    "dtype", [np.int16, np.int32, np.int64, np.float32, np.float64]
+)
 @pytest.mark.parametrize("value", [0, 1.5, -1])
 def test_all_with_any_reduction_axis_1(dtype, value):
     # Check that return value is False when there is no row equal to `value`
diff --git a/sklearn/utils/tests/test_deprecation.py b/sklearn/utils/tests/test_deprecation.py
index 4d04b48da2f0b..468be71ced157 100644
--- a/sklearn/utils/tests/test_deprecation.py
+++ b/sklearn/utils/tests/test_deprecation.py
@@ -1,5 +1,5 @@
-# Authors: Raghav RV <rvraghav93@gmail.com>
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 
 import pickle
diff --git a/sklearn/utils/tests/test_extmath.py b/sklearn/utils/tests/test_extmath.py
index 5ec962433d7c0..5b27a52d29ccf 100644
--- a/sklearn/utils/tests/test_extmath.py
+++ b/sklearn/utils/tests/test_extmath.py
@@ -1,8 +1,5 @@
-# Authors: Olivier Grisel <olivier.grisel@ensta.org>
-#          Mathieu Blondel <mathieu@mblondel.org>
-#          Denis Engemann <denis-alexander.engemann@inria.fr>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 import numpy as np
 import pytest
 from scipy import linalg, sparse
diff --git a/sklearn/utils/tests/test_fixes.py b/sklearn/utils/tests/test_fixes.py
index 60c57bbbaaa52..2aa370df705a3 100644
--- a/sklearn/utils/tests/test_fixes.py
+++ b/sklearn/utils/tests/test_fixes.py
@@ -1,17 +1,11 @@
-# Authors: Gael Varoquaux <gael.varoquaux@normalesup.org>
-#          Justin Vincent
-#          Lars Buitinck
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 import pytest
 
 from sklearn.utils._testing import assert_array_equal
-from sklearn.utils.fixes import (
-    _object_dtype_isnan,
-    _smallest_admissible_index_dtype,
-    delayed,
-)
+from sklearn.utils.fixes import _object_dtype_isnan, _smallest_admissible_index_dtype
 
 
 @pytest.mark.parametrize("dtype, val", ([object, 1], [object, "a"], [float, 1]))
@@ -25,17 +19,6 @@ def test_object_dtype_isnan(dtype, val):
     assert_array_equal(mask, expected_mask)
 
 
-def test_delayed_deprecation():
-    """Check that we issue the FutureWarning regarding the deprecation of delayed."""
-
-    def func(x):
-        return x
-
-    warn_msg = "The function `delayed` has been moved from `sklearn.utils.fixes`"
-    with pytest.warns(FutureWarning, match=warn_msg):
-        delayed(func)
-
-
 @pytest.mark.parametrize(
     "params, expected_dtype",
     [
diff --git a/sklearn/utils/tests/test_mask.py b/sklearn/utils/tests/test_mask.py
new file mode 100644
index 0000000000000..0eb88e71771f8
--- /dev/null
+++ b/sklearn/utils/tests/test_mask.py
@@ -0,0 +1,19 @@
+import pytest
+
+from sklearn.utils._mask import safe_mask
+from sklearn.utils.fixes import CSR_CONTAINERS
+from sklearn.utils.validation import check_random_state
+
+
+@pytest.mark.parametrize("csr_container", CSR_CONTAINERS)
+def test_safe_mask(csr_container):
+    random_state = check_random_state(0)
+    X = random_state.rand(5, 4)
+    X_csr = csr_container(X)
+    mask = [False, False, True, True, True]
+
+    mask = safe_mask(X, mask)
+    assert X[mask].shape[0] == 3
+
+    mask = safe_mask(X_csr, mask)
+    assert X_csr[mask].shape[0] == 3
diff --git a/sklearn/utils/tests/test_missing.py b/sklearn/utils/tests/test_missing.py
new file mode 100644
index 0000000000000..830e327f06a11
--- /dev/null
+++ b/sklearn/utils/tests/test_missing.py
@@ -0,0 +1,27 @@
+import numpy as np
+import pytest
+
+from sklearn.utils._missing import is_scalar_nan
+
+
+@pytest.mark.parametrize(
+    "value, result",
+    [
+        (float("nan"), True),
+        (np.nan, True),
+        (float(np.nan), True),
+        (np.float32(np.nan), True),
+        (np.float64(np.nan), True),
+        (0, False),
+        (0.0, False),
+        (None, False),
+        ("", False),
+        ("nan", False),
+        ([np.nan], False),
+        (9867966753463435747313673, False),  # Python int that overflows with C type
+    ],
+)
+def test_is_scalar_nan(value, result):
+    assert is_scalar_nan(value) is result
+    # make sure that we are returning a Python bool
+    assert isinstance(is_scalar_nan(value), bool)
diff --git a/sklearn/utils/tests/test_mocking.py b/sklearn/utils/tests/test_mocking.py
index 9c66d1345bb6d..bd143855e6dcd 100644
--- a/sklearn/utils/tests/test_mocking.py
+++ b/sklearn/utils/tests/test_mocking.py
@@ -1,6 +1,6 @@
 import numpy as np
 import pytest
-from numpy.testing import assert_allclose, assert_array_equal
+from numpy.testing import assert_array_equal
 from scipy import sparse
 
 from sklearn.datasets import load_iris
@@ -90,7 +90,7 @@ def test_checking_classifier(iris, input_type):
     assert clf.n_features_in_ == 4
 
     y_pred = clf.predict(X)
-    assert_array_equal(y_pred, np.zeros(y_pred.size, dtype=int))
+    assert all(pred in clf.classes_ for pred in y_pred)
 
     assert clf.score(X) == pytest.approx(0)
     clf.set_params(foo_param=10)
@@ -98,13 +98,10 @@ def test_checking_classifier(iris, input_type):
 
     y_proba = clf.predict_proba(X)
     assert y_proba.shape == (150, 3)
-    assert_allclose(y_proba[:, 0], 1)
-    assert_allclose(y_proba[:, 1:], 0)
+    assert np.logical_and(y_proba >= 0, y_proba <= 1).all()
 
     y_decision = clf.decision_function(X)
     assert y_decision.shape == (150, 3)
-    assert_allclose(y_decision[:, 0], 1)
-    assert_allclose(y_decision[:, 1:], 0)
 
     # check the shape in case of binary classification
     first_2_classes = np.logical_or(y == 0, y == 1)
@@ -114,12 +111,10 @@ def test_checking_classifier(iris, input_type):
 
     y_proba = clf.predict_proba(X)
     assert y_proba.shape == (100, 2)
-    assert_allclose(y_proba[:, 0], 1)
-    assert_allclose(y_proba[:, 1], 0)
+    assert np.logical_and(y_proba >= 0, y_proba <= 1).all()
 
     y_decision = clf.decision_function(X)
     assert y_decision.shape == (100,)
-    assert_allclose(y_decision, 0)
 
 
 @pytest.mark.parametrize("csr_container", CSR_CONTAINERS)
diff --git a/sklearn/utils/tests/test_multiclass.py b/sklearn/utils/tests/test_multiclass.py
index 6603aca206e66..95a1ea0bb0806 100644
--- a/sklearn/utils/tests/test_multiclass.py
+++ b/sklearn/utils/tests/test_multiclass.py
@@ -10,6 +10,7 @@
 from sklearn.utils._array_api import yield_namespace_device_dtype_combinations
 from sklearn.utils._testing import (
     _array_api_for_tests,
+    _convert_container,
     assert_allclose,
     assert_array_almost_equal,
     assert_array_equal,
@@ -595,3 +596,18 @@ def test_ovr_decision_function():
     ]
 
     assert_allclose(dec_values, dec_values_one, atol=1e-6)
+
+
+# TODO(1.7): Change to ValueError when byte labels is deprecated.
+@pytest.mark.parametrize("input_type", ["list", "array"])
+def test_labels_in_bytes_format(input_type):
+    # check that we raise an error with bytes encoded labels
+    # non-regression test for:
+    # https://github.com/scikit-learn/scikit-learn/issues/16980
+    target = _convert_container([b"a", b"b"], input_type)
+    err_msg = (
+        "Support for labels represented as bytes is deprecated in v1.5 and will"
+        " error in v1.7. Convert the labels to a string or integer format."
+    )
+    with pytest.warns(FutureWarning, match=err_msg):
+        type_of_target(target)
diff --git a/sklearn/utils/tests/test_murmurhash.py b/sklearn/utils/tests/test_murmurhash.py
index 18730302124f9..20721c6e98f52 100644
--- a/sklearn/utils/tests/test_murmurhash.py
+++ b/sklearn/utils/tests/test_murmurhash.py
@@ -1,6 +1,5 @@
-# Author: Olivier Grisel <olivier.grisel@ensta.org>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numpy as np
 from numpy.testing import assert_array_almost_equal, assert_array_equal
diff --git a/sklearn/utils/tests/test_optimize.py b/sklearn/utils/tests/test_optimize.py
index a8bcd1aebf793..5975fe4f9c191 100644
--- a/sklearn/utils/tests/test_optimize.py
+++ b/sklearn/utils/tests/test_optimize.py
@@ -1,6 +1,8 @@
 import numpy as np
+import pytest
 from scipy.optimize import fmin_ncg
 
+from sklearn.exceptions import ConvergenceWarning
 from sklearn.utils._testing import assert_array_almost_equal
 from sklearn.utils.optimize import _newton_cg
 
@@ -29,3 +31,128 @@ def grad_hess(x):
         _newton_cg(grad_hess, func, grad, x0, tol=1e-10)[0],
         fmin_ncg(f=func, x0=x0, fprime=grad, fhess_p=hess),
     )
+
+
+@pytest.mark.parametrize("verbose", [0, 1, 2])
+def test_newton_cg_verbosity(capsys, verbose):
+    """Test the std output of verbose newton_cg solver."""
+    A = np.eye(2)
+    b = np.array([1, 2], dtype=float)
+
+    _newton_cg(
+        grad_hess=lambda x: (A @ x - b, lambda z: A @ z),
+        func=lambda x: 0.5 * x @ A @ x - b @ x,
+        grad=lambda x: A @ x - b,
+        x0=np.zeros(A.shape[0]),
+        verbose=verbose,
+    )  # returns array([1., 2])
+    captured = capsys.readouterr()
+
+    if verbose == 0:
+        assert captured.out == ""
+    else:
+        msg = [
+            "Newton-CG iter = 1",
+            "Check Convergence",
+            "max |gradient|",
+            "Solver did converge at loss = ",
+        ]
+        for m in msg:
+            assert m in captured.out
+
+    if verbose >= 2:
+        msg = [
+            "Inner CG solver iteration 1 stopped with",
+            "sum(|residuals|) <= tol",
+            "Line Search",
+            "try line search wolfe1",
+            "wolfe1 line search was successful",
+        ]
+        for m in msg:
+            assert m in captured.out
+
+    if verbose >= 2:
+        # Set up a badly scaled singular Hessian with a completely wrong starting
+        # position. This should trigger 2nd line search check
+        A = np.array([[1.0, 2], [2, 4]]) * 1e30  # collinear columns
+        b = np.array([1.0, 2.0])
+        # Note that scipy.optimize._linesearch LineSearchWarning inherits from
+        # RuntimeWarning, but we do not want to import from non public APIs.
+        with pytest.warns(RuntimeWarning):
+            _newton_cg(
+                grad_hess=lambda x: (A @ x - b, lambda z: A @ z),
+                func=lambda x: 0.5 * x @ A @ x - b @ x,
+                grad=lambda x: A @ x - b,
+                x0=np.array([-2.0, 1]),  # null space of hessian
+                verbose=verbose,
+            )
+        captured = capsys.readouterr()
+        msg = [
+            "wolfe1 line search was not successful",
+            "check loss |improvement| <= eps * |loss_old|:",
+            "check sum(|gradient|) < sum(|gradient_old|):",
+            "last resort: try line search wolfe2",
+        ]
+        for m in msg:
+            assert m in captured.out
+
+        # Set up a badly conditioned Hessian that leads to tiny curvature.
+        # X.T @ X have singular values array([1.00000400e+01, 1.00008192e-11])
+        A = np.array([[1.0, 2], [1, 2 + 1e-15]])
+        b = np.array([-2.0, 1])
+        with pytest.warns(ConvergenceWarning):
+            _newton_cg(
+                grad_hess=lambda x: (A @ x - b, lambda z: A @ z),
+                func=lambda x: 0.5 * x @ A @ x - b @ x,
+                grad=lambda x: A @ x - b,
+                x0=b,
+                verbose=verbose,
+                maxiter=2,
+            )
+        captured = capsys.readouterr()
+        msg = [
+            "tiny_|p| = eps * ||p||^2",
+        ]
+        for m in msg:
+            assert m in captured.out
+
+        # Test for a case with negative Hessian.
+        # We do not trigger "Inner CG solver iteration {i} stopped with negative
+        # curvature", but that is very hard to trigger.
+        A = np.eye(2)
+        b = np.array([-2.0, 1])
+        with pytest.warns(RuntimeWarning):
+            _newton_cg(
+                # Note the wrong sign in the hessian product.
+                grad_hess=lambda x: (A @ x - b, lambda z: -A @ z),
+                func=lambda x: 0.5 * x @ A @ x - b @ x,
+                grad=lambda x: A @ x - b,
+                x0=np.array([1.0, 1.0]),
+                verbose=verbose,
+                maxiter=3,
+            )
+        captured = capsys.readouterr()
+        msg = [
+            "Inner CG solver iteration 0 fell back to steepest descent",
+        ]
+        for m in msg:
+            assert m in captured.out
+
+        A = np.diag([1e-3, 1, 1e3])
+        b = np.array([-2.0, 1, 2.0])
+        with pytest.warns(ConvergenceWarning):
+            _newton_cg(
+                grad_hess=lambda x: (A @ x - b, lambda z: A @ z),
+                func=lambda x: 0.5 * x @ A @ x - b @ x,
+                grad=lambda x: A @ x - b,
+                x0=np.ones_like(b),
+                verbose=verbose,
+                maxiter=2,
+                maxinner=1,
+            )
+        captured = capsys.readouterr()
+        msg = [
+            "Inner CG solver stopped reaching maxiter=1",
+        ]
+        for m in msg:
+            assert m in captured.out
diff --git a/sklearn/utils/tests/test_response.py b/sklearn/utils/tests/test_response.py
index c84bf6030336a..858c16cca4df1 100644
--- a/sklearn/utils/tests/test_response.py
+++ b/sklearn/utils/tests/test_response.py
@@ -240,36 +240,60 @@ def test_get_response_error(estimator, X, y, err_msg, params):
         _get_response_values_binary(estimator, X, **params)
 
 
-def test_get_response_predict_proba():
+@pytest.mark.parametrize("return_response_method_used", [True, False])
+def test_get_response_predict_proba(return_response_method_used):
     """Check the behaviour of `_get_response_values_binary` using `predict_proba`."""
     classifier = DecisionTreeClassifier().fit(X_binary, y_binary)
-    y_proba, pos_label = _get_response_values_binary(
-        classifier, X_binary, response_method="predict_proba"
+    results = _get_response_values_binary(
+        classifier,
+        X_binary,
+        response_method="predict_proba",
+        return_response_method_used=return_response_method_used,
     )
-    assert_allclose(y_proba, classifier.predict_proba(X_binary)[:, 1])
-    assert pos_label == 1
+    assert_allclose(results[0], classifier.predict_proba(X_binary)[:, 1])
+    assert results[1] == 1
+    if return_response_method_used:
+        assert results[2] == "predict_proba"
 
-    y_proba, pos_label = _get_response_values_binary(
-        classifier, X_binary, response_method="predict_proba", pos_label=0
+    results = _get_response_values_binary(
+        classifier,
+        X_binary,
+        response_method="predict_proba",
+        pos_label=0,
+        return_response_method_used=return_response_method_used,
     )
-    assert_allclose(y_proba, classifier.predict_proba(X_binary)[:, 0])
-    assert pos_label == 0
+    assert_allclose(results[0], classifier.predict_proba(X_binary)[:, 0])
+    assert results[1] == 0
+    if return_response_method_used:
+        assert results[2] == "predict_proba"
 
 
-def test_get_response_decision_function():
+@pytest.mark.parametrize("return_response_method_used", [True, False])
+def test_get_response_decision_function(return_response_method_used):
     """Check the behaviour of `_get_response_values_binary` using decision_function."""
     classifier = LogisticRegression().fit(X_binary, y_binary)
-    y_score, pos_label = _get_response_values_binary(
-        classifier, X_binary, response_method="decision_function"
+    results = _get_response_values_binary(
+        classifier,
+        X_binary,
+        response_method="decision_function",
+        return_response_method_used=return_response_method_used,
     )
-    assert_allclose(y_score, classifier.decision_function(X_binary))
-    assert pos_label == 1
+    assert_allclose(results[0], classifier.decision_function(X_binary))
+    assert results[1] == 1
+    if return_response_method_used:
+        assert results[2] == "decision_function"
 
-    y_score, pos_label = _get_response_values_binary(
-        classifier, X_binary, response_method="decision_function", pos_label=0
+    results = _get_response_values_binary(
+        classifier,
+        X_binary,
+        response_method="decision_function",
+        pos_label=0,
+        return_response_method_used=return_response_method_used,
     )
-    assert_allclose(y_score, classifier.decision_function(X_binary) * -1)
-    assert pos_label == 0
+    assert_allclose(results[0], classifier.decision_function(X_binary) * -1)
+    assert results[1] == 0
+    if return_response_method_used:
+        assert results[2] == "decision_function"
 
 
 @pytest.mark.parametrize(
diff --git a/sklearn/utils/tests/test_seq_dataset.py b/sklearn/utils/tests/test_seq_dataset.py
index 82864c6b97a08..0e6f182e7c71b 100644
--- a/sklearn/utils/tests/test_seq_dataset.py
+++ b/sklearn/utils/tests/test_seq_dataset.py
@@ -1,7 +1,5 @@
-# Author: Tom Dupre la Tour
-#         Joan Massich <mailsik@gmail.com>
-#
-# License: BSD 3 clause
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 from itertools import product
 
diff --git a/sklearn/utils/tests/test_show_versions.py b/sklearn/utils/tests/test_show_versions.py
index bd166dfd8e522..aade231e46f56 100644
--- a/sklearn/utils/tests/test_show_versions.py
+++ b/sklearn/utils/tests/test_show_versions.py
@@ -1,6 +1,7 @@
+from threadpoolctl import threadpool_info
+
 from sklearn.utils._show_versions import _get_deps_info, _get_sys_info, show_versions
 from sklearn.utils._testing import ignore_warnings
-from sklearn.utils.fixes import threadpool_info
 
 
 def test_get_sys_info():
diff --git a/sklearn/utils/tests/test_utils.py b/sklearn/utils/tests/test_utils.py
index d36bdbd99e5f8..4d71bf8860c81 100644
--- a/sklearn/utils/tests/test_utils.py
+++ b/sklearn/utils/tests/test_utils.py
@@ -1,163 +1,7 @@
-import warnings
-
-import numpy as np
+import joblib
 import pytest
 
-from sklearn.utils import (
-    check_random_state,
-    column_or_1d,
-    deprecated,
-    safe_mask,
-    tosequence,
-)
-from sklearn.utils._missing import is_scalar_nan
-from sklearn.utils._testing import assert_array_equal, assert_no_warnings
-from sklearn.utils.fixes import CSR_CONTAINERS
-from sklearn.utils.validation import _is_polars_df
-
-
-def test_make_rng():
-    # Check the check_random_state utility function behavior
-    assert check_random_state(None) is np.random.mtrand._rand
-    assert check_random_state(np.random) is np.random.mtrand._rand
-
-    rng_42 = np.random.RandomState(42)
-    assert check_random_state(42).randint(100) == rng_42.randint(100)
-
-    rng_42 = np.random.RandomState(42)
-    assert check_random_state(rng_42) is rng_42
-
-    rng_42 = np.random.RandomState(42)
-    assert check_random_state(43).randint(100) != rng_42.randint(100)
-
-    with pytest.raises(ValueError):
-        check_random_state("some invalid seed")
-
-
-def test_deprecated():
-    # Test whether the deprecated decorator issues appropriate warnings
-    # Copied almost verbatim from https://docs.python.org/library/warnings.html
-
-    # First a function...
-    with warnings.catch_warnings(record=True) as w:
-        warnings.simplefilter("always")
-
-        @deprecated()
-        def ham():
-            return "spam"
-
-        spam = ham()
-
-        assert spam == "spam"  # function must remain usable
-
-        assert len(w) == 1
-        assert issubclass(w[0].category, FutureWarning)
-        assert "deprecated" in str(w[0].message).lower()
-
-    # ... then a class.
-    with warnings.catch_warnings(record=True) as w:
-        warnings.simplefilter("always")
-
-        @deprecated("don't use this")
-        class Ham:
-            SPAM = 1
-
-        ham = Ham()
-
-        assert hasattr(ham, "SPAM")
-
-        assert len(w) == 1
-        assert issubclass(w[0].category, FutureWarning)
-        assert "deprecated" in str(w[0].message).lower()
-
-
-@pytest.mark.parametrize("csr_container", CSR_CONTAINERS)
-def test_safe_mask(csr_container):
-    random_state = check_random_state(0)
-    X = random_state.rand(5, 4)
-    X_csr = csr_container(X)
-    mask = [False, False, True, True, True]
-
-    mask = safe_mask(X, mask)
-    assert X[mask].shape[0] == 3
-
-    mask = safe_mask(X_csr, mask)
-    assert X_csr[mask].shape[0] == 3
-
-
-def test_column_or_1d():
-    EXAMPLES = [
-        ("binary", ["spam", "egg", "spam"]),
-        ("binary", [0, 1, 0, 1]),
-        ("continuous", np.arange(10) / 20.0),
-        ("multiclass", [1, 2, 3]),
-        ("multiclass", [0, 1, 2, 2, 0]),
-        ("multiclass", [[1], [2], [3]]),
-        ("multilabel-indicator", [[0, 1, 0], [0, 0, 1]]),
-        ("multiclass-multioutput", [[1, 2, 3]]),
-        ("multiclass-multioutput", [[1, 1], [2, 2], [3, 1]]),
-        ("multiclass-multioutput", [[5, 1], [4, 2], [3, 1]]),
-        ("multiclass-multioutput", [[1, 2, 3]]),
-        ("continuous-multioutput", np.arange(30).reshape((-1, 3))),
-    ]
-
-    for y_type, y in EXAMPLES:
-        if y_type in ["binary", "multiclass", "continuous"]:
-            assert_array_equal(column_or_1d(y), np.ravel(y))
-        else:
-            with pytest.raises(ValueError):
-                column_or_1d(y)
-
-
-@pytest.mark.parametrize(
-    "value, result",
-    [
-        (float("nan"), True),
-        (np.nan, True),
-        (float(np.nan), True),
-        (np.float32(np.nan), True),
-        (np.float64(np.nan), True),
-        (0, False),
-        (0.0, False),
-        (None, False),
-        ("", False),
-        ("nan", False),
-        ([np.nan], False),
-        (9867966753463435747313673, False),  # Python int that overflows with C type
-    ],
-)
-def test_is_scalar_nan(value, result):
-    assert is_scalar_nan(value) is result
-    # make sure that we are returning a Python bool
-    assert isinstance(is_scalar_nan(value), bool)
-
-
-def dummy_func():
-    pass
-
-
-def test_deprecation_joblib_api(tmpdir):
-    # Only parallel_backend and register_parallel_backend are not deprecated in
-    # sklearn.utils
-    from sklearn.utils import parallel_backend, register_parallel_backend
-
-    assert_no_warnings(parallel_backend, "loky", None)
-    assert_no_warnings(register_parallel_backend, "failing", None)
-
-    from sklearn.utils._joblib import joblib
-
-    del joblib.parallel.BACKENDS["failing"]
-
-
-def test__is_polars_df():
-    """Check that _is_polars_df return False for non-dataframe objects."""
-
-    class LooksLikePolars:
-        def __init__(self):
-            self.columns = ["a", "b"]
-            self.schema = ["a", "b"]
-
-    assert not _is_polars_df(LooksLikePolars())
+from sklearn.utils import parallel_backend, register_parallel_backend, tosequence
 
 
 # TODO(1.7): remove
@@ -170,3 +14,14 @@ def test_is_pypy_deprecated():
 def test_tosequence_deprecated():
     with pytest.warns(FutureWarning, match="tosequence was deprecated in 1.5"):
         tosequence([1, 2, 3])
+
+
+# TODO(1.7): remove
+def test_parallel_backend_deprecated():
+    with pytest.warns(FutureWarning, match="parallel_backend is deprecated"):
+        parallel_backend("loky", None)
+
+    with pytest.warns(FutureWarning, match="register_parallel_backend is deprecated"):
+        register_parallel_backend("a_backend", None)
+
+    del joblib.parallel.BACKENDS["a_backend"]
diff --git a/sklearn/utils/tests/test_validation.py b/sklearn/utils/tests/test_validation.py
index 5e54443a84165..5bde51ae514d9 100644
--- a/sklearn/utils/tests/test_validation.py
+++ b/sklearn/utils/tests/test_validation.py
@@ -46,6 +46,7 @@
     assert_allclose_dense_sparse,
     assert_array_equal,
     assert_no_warnings,
+    create_memmap_backed_data,
     ignore_warnings,
     skip_if_array_api_compat_not_configured,
 )
@@ -80,11 +81,31 @@
     check_is_fitted,
     check_memory,
     check_non_negative,
+    check_random_state,
     check_scalar,
+    column_or_1d,
     has_fit_parameter,
 )
 
 
+def test_make_rng():
+    # Check the check_random_state utility function behavior
+    assert check_random_state(None) is np.random.mtrand._rand
+    assert check_random_state(np.random) is np.random.mtrand._rand
+
+    rng_42 = np.random.RandomState(42)
+    assert check_random_state(42).randint(100) == rng_42.randint(100)
+
+    rng_42 = np.random.RandomState(42)
+    assert check_random_state(rng_42) is rng_42
+
+    rng_42 = np.random.RandomState(42)
+    assert check_random_state(43).randint(100) != rng_42.randint(100)
+
+    with pytest.raises(ValueError):
+        check_random_state("some invalid seed")
+
+
 def test_as_float_array():
     # Test function for as_float_array
     X = np.ones((3, 10), dtype=np.int32)
@@ -341,6 +362,14 @@ def test_check_array():
     with pytest.raises(ValueError, match="Expected 2D array, got scalar array instead"):
         check_array(10, ensure_2d=True)
 
+    # ensure_2d=True with 1d sparse array
+    if hasattr(sp, "csr_array"):
+        sparse_row = next(iter(sp.csr_array(X)))
+        if sparse_row.ndim == 1:
+            # In scipy 1.14 and later, sparse row is 1D while it was 2D before.
+            with pytest.raises(ValueError, match="Expected 2D input, got"):
+                check_array(sparse_row, accept_sparse=True, ensure_2d=True)
+
     # don't allow ndim > 3
     X_ndim = np.arange(8).reshape(2, 2, 2)
     with pytest.raises(ValueError):
@@ -2061,3 +2090,102 @@ def test_to_object_array(sequence):
     assert isinstance(out, np.ndarray)
     assert out.dtype.kind == "O"
     assert out.ndim == 1
+
+
+def test_column_or_1d():
+    EXAMPLES = [
+        ("binary", ["spam", "egg", "spam"]),
+        ("binary", [0, 1, 0, 1]),
+        ("continuous", np.arange(10) / 20.0),
+        ("multiclass", [1, 2, 3]),
+        ("multiclass", [0, 1, 2, 2, 0]),
+        ("multiclass", [[1], [2], [3]]),
+        ("multilabel-indicator", [[0, 1, 0], [0, 0, 1]]),
+        ("multiclass-multioutput", [[1, 2, 3]]),
+        ("multiclass-multioutput", [[1, 1], [2, 2], [3, 1]]),
+        ("multiclass-multioutput", [[5, 1], [4, 2], [3, 1]]),
+        ("multiclass-multioutput", [[1, 2, 3]]),
+        ("continuous-multioutput", np.arange(30).reshape((-1, 3))),
+    ]
+
+    for y_type, y in EXAMPLES:
+        if y_type in ["binary", "multiclass", "continuous"]:
+            assert_array_equal(column_or_1d(y), np.ravel(y))
+        else:
+            with pytest.raises(ValueError):
+                column_or_1d(y)
+
+
+def test__is_polars_df():
+    """Check that _is_polars_df return False for non-dataframe objects."""
+
+    class LooksLikePolars:
+        def __init__(self):
+            self.columns = ["a", "b"]
+            self.schema = ["a", "b"]
+
+    assert not _is_polars_df(LooksLikePolars())
+
+
+def test_check_array_writeable_np():
+    """Check the behavior of check_array when a writeable array is requested
+    without copy if possible, on numpy arrays.
+    """
+    X = np.random.uniform(size=(10, 10))
+
+    out = check_array(X, copy=False, force_writeable=True)
+    # X is already writeable, no copy is needed
+    assert np.may_share_memory(out, X)
+    assert out.flags.writeable
+
+    X.flags.writeable = False
+
+    out = check_array(X, copy=False, force_writeable=True)
+    # X is not writeable, a copy is made
+    assert not np.may_share_memory(out, X)
+    assert out.flags.writeable
+
+
+def test_check_array_writeable_mmap():
+    """Check the behavior of check_array when a writeable array is requested
+    without copy if possible, on a memory-map.
+
+    A common situation is when a meta-estimators run in parallel using multiprocessing
+    with joblib, which creates read-only memory-maps of large arrays.
+    """
+    X = np.random.uniform(size=(10, 10))
+
+    mmap = create_memmap_backed_data(X, mmap_mode="w+")
+    out = check_array(mmap, copy=False, force_writeable=True)
+    # mmap is already writeable, no copy is needed
+    assert np.may_share_memory(out, mmap)
+    assert out.flags.writeable
+
+    mmap = create_memmap_backed_data(X, mmap_mode="r")
+    out = check_array(mmap, copy=False, force_writeable=True)
+    # mmap is read-only, a copy is made
+    assert not np.may_share_memory(out, mmap)
+    assert out.flags.writeable
+
+
+def test_check_array_writeable_df():
+    """Check the behavior of check_array when a writeable array is requested
+    without copy if possible, on a dataframe.
+    """
+    pd = pytest.importorskip("pandas")
+
+    X = np.random.uniform(size=(10, 10))
+    df = pd.DataFrame(X, copy=False)
+
+    out = check_array(df, copy=False, force_writeable=True)
+    # df is backed by a writeable array, no copy is needed
+    assert np.may_share_memory(out, df)
+    assert out.flags.writeable
+
+    X.flags.writeable = False
+    df = pd.DataFrame(X, copy=False)
+
+    out = check_array(df, copy=False, force_writeable=True)
+    # df is backed by a read-only array, a copy is made
+    assert not np.may_share_memory(out, df)
+    assert out.flags.writeable
diff --git a/sklearn/utils/validation.py b/sklearn/utils/validation.py
index d0a2fb098931f..af9fdb4a79cba 100644
--- a/sklearn/utils/validation.py
+++ b/sklearn/utils/validation.py
@@ -1,16 +1,7 @@
-"""
-The :mod:`sklearn.utils.validation` module includes functions to validate
-input and parameters within scikit-learn estimators.
-"""
-
-# Authors: Olivier Grisel
-#          Gael Varoquaux
-#          Andreas Mueller
-#          Lars Buitinck
-#          Alexandre Gramfort
-#          Nicolas Tresegnie
-#          Sylvain Marie
-# License: BSD 3 clause
+"""Functions to validate input and parameters within scikit-learn estimators."""
+
+# Authors: The scikit-learn developers
+# SPDX-License-Identifier: BSD-3-Clause
 
 import numbers
 import operator
@@ -98,7 +89,7 @@ def _assert_all_finite(
 ):
     """Like assert_all_finite, but only for ndarray."""
 
-    xp, _ = get_namespace(X)
+    xp, is_array_api = get_namespace(X)
 
     if _get_config()["assume_finite"]:
         return
@@ -106,7 +97,7 @@ def _assert_all_finite(
     X = xp.asarray(X)
 
     # for object dtype data, we only check for NaNs (GH-13254)
-    if X.dtype == np.dtype("object") and not allow_nan:
+    if not is_array_api and X.dtype == np.dtype("object") and not allow_nan:
         if _object_dtype_isnan(X).any():
             raise ValueError("Input contains NaN")
 
@@ -488,7 +479,7 @@ def indexable(*iterables):
 
     Checks consistent length, passes through None, and ensures that everything
     can be indexed by converting sparse matrices to csr and converting
-    non-interable objects to arrays.
+    non-iterable objects to arrays.
 
     Parameters
     ----------
@@ -510,7 +501,7 @@ def indexable(*iterables):
     ...     [1, 2, 3], np.array([2, 3, 4]), None, csr_matrix([[5], [6], [7]])
     ... ]
     >>> indexable(*iterables)
-    [[1, 2, 3], array([2, 3, 4]), None, <3x1 sparse matrix ...>]
+    [[1, 2, 3], array([2, 3, 4]), None, <...Sparse...dtype 'int64'...shape (3, 1)>]
     """
 
     result = [_make_indexable(X) for X in iterables]
@@ -726,6 +717,7 @@ def check_array(
     dtype="numeric",
     order=None,
     copy=False,
+    force_writeable=False,
     force_all_finite=True,
     ensure_2d=True,
     allow_nd=False,
@@ -776,6 +768,13 @@ def check_array(
         Whether a forced copy will be triggered. If copy=False, a copy might
         be triggered by a conversion.
 
+    force_writeable : bool, default=False
+        Whether to force the output array to be writeable. If True, the returned array
+        is guaranteed to be writeable, which may require a copy. Otherwise the
+        writeability of the input array is preserved.
+
+        .. versionadded:: 1.6
+
     force_all_finite : bool or 'allow-nan', default=True
         Whether to raise an error on np.inf, np.nan, pd.NA in array. The
         possibilities are:
@@ -973,6 +972,13 @@ def is_sparse(dtype):
             estimator_name=estimator_name,
             input_name=input_name,
         )
+        if ensure_2d and array.ndim < 2:
+            raise ValueError(
+                f"Expected 2D input, got input with shape {array.shape}.\n"
+                "Reshape your data either using array.reshape(-1, 1) if "
+                "your data has a single feature or array.reshape(1, -1) "
+                "if it contains a single sample."
+            )
     else:
         # If np.array(..) gives ComplexWarning, then we convert the warning
         # to an error. This is needed because specifying a non complex
@@ -1087,17 +1093,32 @@ def is_sparse(dtype):
                 % (n_features, array.shape, ensure_min_features, context)
             )
 
-    # With an input pandas dataframe or series, we know we can always make the
-    # resulting array writeable:
-    # - if copy=True, we have already made a copy so it is fine to make the
-    #   array writeable
-    # - if copy=False, the caller is telling us explicitly that we can do
-    #   in-place modifications
-    # See https://pandas.pydata.org/docs/dev/user_guide/copy_on_write.html#read-only-numpy-arrays
-    # for more details about pandas copy-on-write mechanism, that is enabled by
-    # default in pandas 3.0.0.dev.
-    if _is_pandas_df_or_series(array_orig) and hasattr(array, "flags"):
-        array.flags.writeable = True
+    if force_writeable:
+        # By default, array.copy() creates a C-ordered copy. We set order=K to
+        # preserve the order of the array.
+        copy_params = {"order": "K"} if not sp.issparse(array) else {}
+
+        array_data = array.data if sp.issparse(array) else array
+        flags = getattr(array_data, "flags", None)
+        if not getattr(flags, "writeable", True):
+            # This situation can only happen when copy=False, the array is read-only and
+            # a writeable output is requested. This is an ambiguous setting so we chose
+            # to always (except for one specific setting, see below) make a copy to
+            # ensure that the output is writeable, even if avoidable, to not overwrite
+            # the user's data by surprise.
+
+            if _is_pandas_df_or_series(array_orig):
+                try:
+                    # In pandas >= 3, np.asarray(df), called earlier in check_array,
+                    # returns a read-only intermediate array. It can be made writeable
+                    # safely without copy because if the original DataFrame was backed
+                    # by a read-only array, trying to change the flag would raise an
+                    # error, in which case we make a copy.
+                    array_data.flags.writeable = True
+                except ValueError:
+                    array = array.copy(**copy_params)
+            else:
+                array = array.copy(**copy_params)
 
     return array
 
@@ -1133,6 +1154,7 @@ def check_X_y(
     dtype="numeric",
     order=None,
     copy=False,
+    force_writeable=False,
     force_all_finite=True,
     ensure_2d=True,
     allow_nd=False,
@@ -1187,6 +1209,13 @@ def check_X_y(
         Whether a forced copy will be triggered. If copy=False, a copy might
         be triggered by a conversion.
 
+    force_writeable : bool, default=False
+        Whether to force the output array to be writeable. If True, the returned array
+        is guaranteed to be writeable, which may require a copy. Otherwise the
+        writeability of the input array is preserved.
+
+        .. versionadded:: 1.6
+
     force_all_finite : bool or 'allow-nan', default=True
         Whether to raise an error on np.inf, np.nan, pd.NA in X. This parameter
         does not influence whether y can have np.inf, np.nan, pd.NA values.
@@ -1270,6 +1299,7 @@ def check_X_y(
         dtype=dtype,
         order=order,
         copy=copy,
+        force_writeable=force_writeable,
         force_all_finite=force_all_finite,
         ensure_2d=ensure_2d,
         allow_nd=allow_nd,
@@ -1303,7 +1333,7 @@ def _check_y(y, multi_output=False, y_numeric=False, estimator=None):
         y = column_or_1d(y, warn=True)
         _assert_all_finite(y, input_name="y", estimator_name=estimator_name)
         _ensure_no_complex_data(y)
-    if y_numeric and y.dtype.kind == "O":
+    if y_numeric and hasattr(y.dtype, "kind") and y.dtype.kind == "O":
         y = y.astype(np.float64)
 
     return y
@@ -1473,8 +1503,8 @@ def check_symmetric(array, *, tol=1e-10, raise_warning=True, raise_exception=Fal
     >>> from scipy.sparse import csr_matrix
     >>> sparse_symmetric_array = csr_matrix(symmetric_array)
     >>> check_symmetric(sparse_symmetric_array)
-    <3x3 sparse matrix of type '<class 'numpy.int64'>'
-        with 6 stored elements in Compressed Sparse Row format>
+    <Compressed Sparse Row sparse matrix of dtype 'int64'
+        with 6 stored elements and shape (3, 3)>
     """
     if (array.ndim != 2) or (array.shape[0] != array.shape[1]):
         raise ValueError(