Euclid Quick Data Release (Q1). AgileLens: A scalable CNN-based pipeline for strong gravitational lens identification
Euclid Collaboration: X. Xu (1, 2), R. Chen (1), T. Li (1), A. R. Cooray (1), S. Schuldt (3, 4), J. A. Acevedo Barroso (5), D. Stern (5), D. Scott (6), M. Meneghetti (7, 8), G. Despali (9, 7, 8), J. Chopra (1), Y. Cao (1), M. Cheng (1), J. Buda (1), J. Zhang (1), J. Furumizo (1)

TL;DR
This paper introduces a scalable CNN pipeline for identifying strong galaxy lensing systems in Euclid data, achieving high recall and discovering new candidates through iterative training and human validation.
Contribution
It develops an end-to-end, iterative CNN-based method that improves lens candidate identification and scales efficiently to future Euclid data releases.
Findings
Identified 441 high-quality lens candidates, including 130 new ones.
Achieved 81.8% recovery rate of known lenses within top predictions.
Modified VGG16 CNN outperformed other models in classification accuracy.
Abstract
We present an end-to-end, iterative pipeline for efficient identification of strong galaxy--galaxy lensing systems, applied to the Euclid Q1 imaging data. Starting from VIS catalogues, we reject point sources, apply a magnitude cut (I 24) on deflectors, and run a pixel-level artefact/noise filter to build 96 96 pix cutouts; VIS+NISP colour composites are constructed with a VIS-anchored luminance scheme that preserves VIS morphology and NISP colour contrast. A VIS-only seed classifier supplies clear positives and typical impostors, from which we curate a morphology-balanced negative set and augment scarce positives. Among the six CNNs studied initially, a modified VGG16 (GlobalAveragePooling + 256/128 dense layers with the last nine layers trainable) performs best; the training set grows from 27 seed lenses (augmented to 1809) plus 2000 negatives to a colour dataset…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
