ML demo: a U-Net in SQL, for einfold to optimize convolutions against

Ouverte
  • Quelque chose ne va pas ?
#291 0 commentaires 0 réactions 0 personnes assignées Voir sur GitHub

Les mainteneurs répondent en général sous 3 jours

Personne n'a encore pris cette issue.

Évaluation

Difficulté
5/5
Temps estimé
Plus d'une semaine
Accessibilité débutants
38/100
Type d'issue
Fonctionnalité
Clarté
Plutôt claire
Activité
Active
Stack technique
python, sql
Domaine
data, machine-learning

Piste de recherche

Start with benchmarks/ml/CONTRIBUTING.md and compare the structure of 01_attention.py and 02_nanogpt.py. Build a readable U-Net demo with a JAX reference, timed SQL steps across hosts in _hosts.py, and checks for forward results and input and weight gradients; completion means those comparisons agree to about 1e-15. einfold's shifted-key optimizer work is tracked separately, and results belong on #285.

Rédigé par le modèle d'indexation à partir du texte de l'issue.

Description

enhancement ml

🪭 Claude (einfold)

A request for a new demo in benchmarks/ml, following its CONTRIBUTING.md, which already lists "a small convolutional network over a grid, where a convolution is a join on shifted coordinates" among the demos that would fit. The proposal: a U-Net (Ronneberger, Fischer and Brox, U-Net: Convolutional Networks for Biomedical Image Segmentation, 2015), the encoder–decoder CNN with skip connections that geoscience uses for downscaling, nowcasting and segmentation.

einfold, XQL Systems' query optimizer that rewrites SQL plans into array algorithms, would use it the way it uses 01_attention.py: as the workload it optimizes against.

Why this model

  • It is the convolution shape einfold doesn't detect yet. A convolution is a fold over a join whose keys are shifted, i.y = o.y + w.dy, not equal columns. einfold's next design step for it is shifted keys in its fold IR, so that the dense kernels take convolutions directly. Strides and dilations become a multiplier on the offset. Padding needs no special case: border pixels simply have fewer taps, which is SQL's own result when the shifted rows don't exist. A demo gives that work a correctness reference (JAX) and a benchmark, as attention did for einfold's fused pipelines.
  • It exercises more than convolutions.
    • Convolution, then bias, then ReLU, is a fold pipeline, which einfold's M2 fuses.
    • Downsampling (a strided convolution, or a max-pool, which is MAX over shifted keys) and upsampling (a transposed convolution) are the same join with o.y = 2·i.y + dy and its inverse.
    • Skip connections concatenate channels from two levels: a UNION ALL, or a join on the pixel.
  • It fits xarray-sql's audience. A U-Net on an ERA5 field, such as downscaling a coarse temperature grid or predicting a field one step ahead, is a model geoscientists train on gridded data. Its input is an xarray Dataset registered as a table of (time, y, x, channel).
  • ddx gets new gradients to check. The gradient of a convolution with respect to its input is a transposed convolution, and with respect to its weights is a correlation of the input with the output gradient: the same shifted-key shape again.

Suggested shape

The pieces, as 02_nanogpt.py builds its model from functions named after the reference's:

  • conv(x, w, stride, dilation): SUM(x.v * w.v) over x JOIN w ON x.c = w.ci AND x.y = o.y * stride + w.dy * dilation AND …, grouped by the output's (n, y, x, co). One way to write o is a join against a coordinate table, or x.y - w.dy grouped directly;
  • relu, bias: derived factors;
  • down(x): a stride-2 convolution, or a 2 × 2 max-pool;
  • up(x): a stride-2 transposed convolution, or nearest-neighbour JOIN ON o.y / 2 = i.y;
  • skip(a, b): channels of two levels, concatenated;
  • unet(depth, width): two or three levels, 8–32 channels, 3 × 3 kernels, on a grid of about 64 × 64 to 256 × 256.

Checked against the same network in JAX: jax.lax.conv_general_dilated, or Flax's nn.Conv, with 64-bit floats, so they agree to about 1e-15. Check the forward pass, and ddx's gradients with respect to the input and to every weight table.

The interesting knobs for einfold's measurements:

  • grid size;
  • channel widths, which make the convolutions dense or near-dense;
  • depth, which is the number of folds in a pipeline;
  • stride, against pooling.

As in the other demos: the same SQL on every host in _hosts.py, each step timed, with its error against JAX.

Not asked here

Speed. The demo should be written to be read, as the others are. einfold's side, detecting and running shifted-key folds, will be tracked in einfold. Results go on #285.

Langage dominant
Python
Étoiles
142
Forks
19
Merge moyen
3 j 47 min
PR mergées (30 j)
8

Préparer son environnement

Par où commencer

  1. Lisez l'issue en entier, puis le guide de contribution du projet.
  2. Signalez en commentaire que vous la prenez — cela évite que deux personnes fassent le même travail.
  3. Forkez le dépôt et travaillez sur une branche.
  4. Ouvrez une pull request qui référence le numéro de l'issue.

Autres issues de xqlsystems/xarray-sql

Toutes les issues de xqlsystems/xarray-sql

Issues similaires

Plus d'issues Python

Recevez les nouvelles issues par e-mail

Un résumé court des issues GitHub adaptées aux débutants.