Pith. sign in

REVIEW

ICLR 2021 Challenge for Computational Geometry & Topology: Design and Results

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2108.09810 v2 pith:MGSV5W5I submitted 2021-08-22 cs.CG math.DGmath.GN

ICLR 2021 Challenge for Computational Geometry & Topology: Design and Results

Nina Miolane , Matteo Caorsi , Umberto Lupo , Marius Guerard , Nicolas Guigui , Johan Mathe , Yann Cabanes , Wojciech Reise
show 25 more authors
Thomas Davies Ant\'onio Leit\~ao Somesh Mohapatra Saiteja Utpala Shailja Shailja Gabriele Corso Guoxi Liu Federico Iuricich Andrei Manolache Mihaela Nistor Matei Bejan Armand Mihai Nicolicioiu Bogdan-Alexandru Luchian Mihai-Sorin Stupariu Florent Michel Khanh Dao Duc Bilal Abdulrahman Maxim Beketov Elodie Maignant Zhiyuan Liu Marek \v{C}ern\'y Martin Bauw Santiago Velasco-Forero Jesus Angulo Yanan Long
This is my paper
classification cs.CG math.DGmath.GN
keywords challengecomputationalgeometrytopologydesigniclraskedattracted
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper presents the computational challenge on differential geometry and topology that happened within the ICLR 2021 workshop "Geometric and Topological Representation Learning". The competition asked participants to provide creative contributions to the fields of computational geometry and topology through the open-source repositories Geomstats and Giotto-TDA. The challenge attracted 16 teams in its two month duration. This paper describes the design of the challenge and summarizes its main findings.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.