Astronomy
95 papers with code • 1 benchmarks • 2 datasets
Benchmarks
These leaderboards are used to track progress in Astronomy
| Trend | Dataset | Best Model | Paper | Code | Compare |
|---|---|---|---|---|---|
|
BIG-bench
RGZ EMU: Semantic Taxonomy
Most implemented papers
DeepWave: A Recurrent Neural-Network for Real-Time Acoustic Imaging
We propose a recurrent neural-network for real-time reconstruction of acoustic camera spherical maps.
Scaling Language Models: Methods, Analysis & Insights from Training Gopher
Language modelling provides a step towards intelligent communication systems by harnessing large repositories of written human knowledge to better predict and understand the world.
Rethinking data-driven point spread function modeling with a differentiable optical model
We change the data-driven modeling space from the pixels to the wavefront by adding a differentiable optical forward model into the modeling framework.
Prediction-Powered Inference
Prediction-powered inference is a framework for performing valid statistical inference when an experimental dataset is supplemented with predictions from a machine-learning system.
Light Curve Classification with DistClassiPy: a new distance-based classifier
We explore the use of different distance metrics to aid in the classification of objects.
Very Fast EM-based Mixture Model Clustering using Multiresolution kd-trees
Clustering is important in many fields including manufacturing, biology, finance, and astronomy.
Optical Interferometry in Astronomy
First, this review summarizes the basic principles behind stellar interferometry needed by the lay-physicist and general astronomer to understand the scientific potential as well as technical challenges of interferometry.
Photometric Redshift Error Estimators
Photometric redshift (photo-z) estimates are playing an increasingly important role in extragalactic astronomy and cosmology.
Removing systematic errors for exoplanet search via latent causes
We describe a method for removing the effect of confounders in order to reconstruct a latent quantity of interest.
Bigger Buffer k-d Trees on Multi-Many-Core Systems
A buffer k-d tree is a k-d tree variant for massively-parallel nearest neighbor search.
