{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/a-machine-learning-classifier-for","title":"A Machine Learning Classifier for Microlensing in Wide-Field Surveys","arxiv_id":"2004.14347","date":"2020-04-29","proceeding":null,"authors":["D. Godines","E. Bachelet","G. Narayan","R. A. Street"],"abstract":"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.","url_abs":"http://arxiv.org/abs/2004.14347v1","url_pdf":"http://arxiv.org/pdf/2004.14347v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"a-machine-learning-classifier-for","repo_url":"https://github.com/dgodinez77/LIA","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2004.14347","mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}