MétaCan
Menu
Back to cohort
Record W4393905142 · doi:10.48550/arxiv.2404.01235

Anomaly Detection and Approximate Similarity Searches of Transients in Real-time Data Streams

2024· preprint· en· W4393905142 on OpenAlexfundno aff
P. Aleo

Bibliographic record

VenuearXiv (Cornell University) · 2024
Typepreprint
Languageen
FieldComputer Science
TopicNetwork Security and Intrusion Detection
Canadian institutionsnot available
FundersPlanetary Science DivisionDeutsches Elektronen-SynchrotronInstitut National de Physique Nucléaire et de Physique des ParticulesScience and Technology Facilities CouncilScience Mission DirectoratePacific Northwest National LaboratorySmithsonian Astrophysical ObservatoryUniversity of Illinois at Urbana-ChampaignMax-Planck-Institut für AstronomieEötvös Loránd TudományegyetemStockholms UniversitetNuclear Safety and Security CommissionQueen's UniversityGordon and Betty Moore FoundationQueen's University BelfastLos Alamos National LaboratoryUniversity of WashingtonBrinson FoundationAlfred P. Sloan FoundationJohns Hopkins UniversityWeizmann Institute of ScienceUniversity of WarwickNational Central UniversityVillum FondenDurham UniversityNorthwestern UniversitySpace Telescope Science InstituteNational Aeronautics and Space AdministrationBattelleTrinity College DublinU.S. Department of EnergySmithsonian InstitutionEuropean CommissionDirectorate for Computer and Information Science and EngineeringCalifornia Institute of TechnologyUniversity of California, Santa CruzHeising-Simons FoundationDavid and Lucile Packard FoundationNational Centre for Supercomputing ApplicationsLaboratory Directed Research and DevelopmentNational Science Foundation
KeywordsAnomaly detectionSTREAMSSimilarity (geometry)Anomaly (physics)Data miningComputer scienceData stream miningReal-time computingArtificial intelligencePhysicsImage (mathematics)Operating system

Abstract

fetched live from OpenAlex

This is the official Zenodo version of the code LAISS (Lightcurve Anomaly Identification and Similarity Search), associated with the paper, "Anomaly Detection and Approximate Similarity Searches of Transients in Real-time Data Streams" by Aleo et al (in review). This repository contains all datasets and code needed to run a local instance of LAISS, though slight modifications will be needed (e.g., renaming hard-coded file paths). See Aleo et al. for details on the LAISS pipeline, now on arXiv and currently submitted to The Astrophysical Journal. The live version of the code can be found on Github. Moreover, the results of all objects processed by LAISS via the ANTARES broker is available on the main page and selecting “LAISS_RFC_AD_filter” under ‘Tags’. Those we consider anomalies are objects that have a Locus Property feature “LAISS_RFC_anomaly_score” > 0.5. Note that the version on ANTARES has no similarity search functionality.A demo can be found on Google Colab, written by current code maintainer Alex Gagliano.Below we list the files with a brief description: "LAISS_ANNOY_pseudo_Filter.ipynb" -- The notebook version of LAISS. Preferred method because it doesn't need to reload the large .ann files for each instance. "LAISS.py" -- The .py version of LAISS. Same functionality but a little slower because of the many arguments and longer runtimes due to needing to reload the .ann files for each run. Can be run, e.g., withLAISS(l_or_ztfid_ref="ZTF18abydmfv", lc_and_host_features=lc_and_host_features, n=8, use_lc_for_ann_only_bool=True, use_ysepz_phot_snana_file=False, show_lightcurves_grid=False, show_hosts_grid=False, run_AD_model=False, savetables=False, savefigs=False) "*.ann" & "*.npy"-- The ANNOY index files, used for similarity search functionality."*.csv.gz" -- Datafiles with objects (rows) and light curve + host features (columns), used for anomaly detection and similarity search functionality. NOTE: With either choice of running LAISS, you'll need to add the following hardcoded directories (or manually change the filepaths). See Github for directory structure:tables/custom/timeseries/notebooks/ysepz_snana_phot_files/notebooks/LAISS_run/loci_dbs/alerce_cut/ps1_psc/ps1_cutouts/dataframes/RFC/SMOTE_train_test_70-30_min14_kneighbors8/cls=binary_n_estimators=100_max_depth=35_rs=11_max_feats=35_cw=balanced/figuresRFC/SMOTE_train_test_70-30_min14_kneighbors8/cls=binary_n_estimators=100_max_depth=35_rs=11_max_feats=35_cw=balanced/model

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.010
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.013
Threshold uncertainty score0.044

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.010
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0050.004
Science and technology studies0.0010.000
Scholarly communication0.0030.003
Open science0.0020.003
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0130.015

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.089
GPT teacher head0.211
Teacher spread0.122 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicNetwork Security and Intrusion DetectionFrench-language works237,207