Papers › A Machine Learning Classifier for Microlensing in Wide-Field Surveys
A Machine Learning Classifier for Microlensing in Wide-Field Surveys
D. Godines, E. Bachelet, G. Narayan, R. A. Street
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
While microlensing is very rare, occurring on average once per million stars observed, current and near-future surveys are coming online with the capability of providing photometry of almost the entire visible sky to depths up to R ~ 22 mag or fainter every few days, which will contribute to the detection of black holes and exoplanets through follow-up observations of microlensing events. Based on galactic models, we can expect microlensing events across a vastly wider region of the galaxy, although the cadence of these surveys (2-3 per day ) is lower than traditional microlensing surveys, making efficient detection a challenge. Rapid advances are being made in the utility of time-series data to detect and classify transient events in real-time using very high data-rate surveys, but limited work has been published regarding the detection of microlensing events, particularly for when the data streams are of relatively low-cadence. In this research, we explore the utility of a Random Forest algorithm for identifying microlensing signals using time-series data, with the goal of creating an efficient machine learning classifier that can be applied to search for microlensing in wide-field surveys even with low-cadence data. We have applied and optimized our classifier using the OGLE-II microlensing dataset, in addition to testing with PTF/iPTF survey data and the currently operating ZTF, which applies the same data handling infrastructure that is envisioned for the upcoming LSST.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections