Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gregory Kiar

dblp:210/2488 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
4since 2021 · last 2025
0000-0001-8915-496XORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 3 · 2 since 2021Systems, architecture and hardware · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Computational science and engineering · 85% Medical and health informatics · 15%
Software engineering, system software, and programming languages
1 paper
Program analysis · 77% Programming languages and type systems · 23%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program analysis
dynamic analysis
0.712023
PyTracer: Automatically Profiling Numerical Instabilities in Python · IEEE Trans. Computers 2023
Medical and health informatics
neuroimaging
0.312025
A Numerical Variability Approach to Results Stability Tests and Its Application to Neuroimaging · IEEE Trans. Computers 2025
Programming languages and type systems › dynamic languages
python
0.212023
PyTracer: Automatically Profiling Numerical Instabilities in Python · IEEE Trans. Computers 2023

Methods — techniques the papers use, named apart from their topics

structured noise · 1.3random rounding · 1.3random data perturbation · 1.3monte-carlo arithmetic · 1.3random rounding of floating-point calculations · 0.9
YearPublicationVenuePosition
2025 A Numerical Variability Approach to Results Stability Tests and Its Application to Neuroimaging
abstract
Ensuring the long-term reproducibility of data analyses requires results stability tests to verify that analysis results remain within acceptable variation bounds despite inevitable software updates and hardware evolutions. This paper introduces a numerical variability approach for results stability tests, which determines acceptable variation bounds using random rounding of floating-point calculations. By applying the resulting stability test tofMRIPrep, a widely-used neuroimaging tool, we show that the test is sensitive enough to detect subtle updates in image processing methods while remaining specific enough to accept numerical variations within a reference version of the application. This result contributes to enhancing the reliability and reproducibility of data analyses by providing a robust and flexible method for stability testing.
Yohan Chatelain, Loïc Tetrel, Christopher J. Markiewicz, Mathias Goncalves, Gregory Kiar, Oscar Esteban, Lune Bellec, Tristan Glatard
IEEE Trans. Computers5
2023 PyTracer: Automatically Profiling Numerical Instabilities in Python
abstract
Numerical stability is a crucial requirement of reliable scientific computing. However, despite the pervasiveness of Python in data science, analyzing large Python programs remains challenging due to the lack of scalable numerical analysis tools available for this language. To fill this gap, we developed PyTracer, a profiler to quantify numerical instability in Python applications. PyTracertransparently instruments Python code to produce numerical traces and visualize them interactively in a Plotly dashboard. We designed PyTracerto be agnostic to numerical noise model, allowing for numerical profiling through Monte-Carlo Arithmetic, random rounding, random data perturbation, or structured noise for a particular application. We illustrate PyTracer's capabilities by testing the numerical stability of key functions in both SciPy and Scikit-learn, two dominant Python libraries for mathematical modeling. Through these evaluations, we demonstrate PyTraceras a scalable, automated, and generic framework for numerical profiling in Python.
Yohan Chatelain, Nigel Yong Sao Young, Gregory Kiar, Tristan Glatard
IEEE Trans. Computers3
2021 Reducing numerical precision preserves classification accuracy in Mondrian Forests
abstract
Mondrian Forests are a powerful data stream classification method, but their large memory footprint makes them ill-suited for low-resource platforms such as connected objects. We explored using reduced-precision floating-point representations to lower memory consumption and evaluated its effect on classification performance. We applied the Mondrian Forest implementation provided by OrpailleCC, a C++ collection of data stream algorithms, to two canonical datasets in human activity recognition: Recofit and Banos et al. Results show that the precision of floating-point values used by tree nodes can be reduced from 64 bits to 8 bits with no significant difference in F1 score. In some cases, reduced precision was shown to improve classification performance, presumably due to its regularization effect. We conclude that numerical precision is a relevant hyperparameter in the Mondrian Forest, and that commonly-used double precision values may not be necessary for optimal performance. Future work will evaluate the generalizability of these findings to other data stream classifiers.
Marc Vicuna, Martin Khannouz, Gregory Kiar, Yohan Chatelain, Tristan Glatard
IEEE BigData3
2021 Eliminating accidental deviations to minimize generalization error and maximize replicability: Applications in connectomics and genomics
abstract
Replicability, the ability to replicate scientific findings, is a prerequisite for scientific discovery and clinical utility. Troublingly, we are in the midst of a replicability crisis. A key to replicability is that multiple measurements of the same item (e.g., experimental sample or clinical participant) under fixed experimental constraints are relatively similar to one another. Thus, statistics that quantify the relative contributions of accidental deviations-such as measurement error-as compared to systematic deviations-such as individual differences-are critical. We demonstrate that existing replicability statistics, such as intra-class correlation coefficient and fingerprinting, fail to adequately differentiate between accidental and systematic deviations in very simple settings. We therefore propose a novel statistic, discriminability, which quantifies the degree to which an individual's samples are relatively similar to one another, without restricting the data to be univariate, Gaussian, or even Euclidean. Using this statistic, we introduce the possibility of optimizing experimental design via increasing discriminability and prove that optimizing discriminability improves performance bounds in subsequent inference tasks. In extensive simulated and real datasets (focusing on brain imaging and demonstrating on genomics), only optimizing data discriminability improves performance on all subsequent inference tasks for each dataset. We therefore suggest that designing experiments and analyses to optimize discriminability may be a crucial step in solving the replicability crisis, and more generally, mitigating accidental measurement error.
Eric Bridgeford, Shangsi Wang, Zeyi Wang, Ting Xu 0001, R. Cameron Craddock, Jayanta Dey, Gregory Kiar, William R. Gray Roncal, Carlo Colantuoni, Christopher Douville, Stephanie Noble, Carey E. Priebe, Brian Caffo, Michael P. Milham, Xi-Nian Zuo, Joshua T. Vogelstein
PLoS Comput. Biol.7
2017 BIDS apps: Improving ease of use, accessibility, and reproducibility of neuroimaging data analysis methods
abstract
The rate of progress in human neurosciences is limited by the inability to easily apply a wide range of analysis methods to the plethora of different datasets acquired in labs around the world. In this work, we introduce a framework for creating, testing, versioning and archiving portable applications for analyzing neuroimaging data organized and described in compliance with the Brain Imaging Data Structure (BIDS). The portability of these applications (BIDS Apps) is achieved by using container technologies that encapsulate all binary and other dependencies in one convenient package. BIDS Apps run on all three major operating systems with no need for complex setup and configuration and thanks to the comprehensiveness of the BIDS standard they require little manual user input. Previous containerized data processing solutions were limited to single user environments and not compatible with most multi-tenant High Performance Computing systems. BIDS Apps overcome this limitation by taking advantage of the Singularity container technology. As a proof of concept, this work is accompanied by 22 ready to use BIDS Apps, packaging a diverse set of commonly used neuroimaging algorithms.
Krzysztof J. Gorgolewski, Fidel Alfaro-Almagro, Tibor Auer, Lune Bellec, Mihai Capota, M. Mallar Chakravarty, Nathan William Churchill, Alexander Li Cohen, R. Cameron Craddock, Gabriel A. Devenyi, Anders Eklund 0002, Oscar Esteban, Guillaume Flandin, Satrajit S. Ghosh, J. Swaroop Guntupalli, Mark Jenkinson, Anisha Keshavan, Gregory Kiar, Franziskus Liem, Pradeep Reddy Raamana, David Raffelt, Christopher John Steele, Pierre-Olivier Quirion, Robert E. Smith 0002, Stephen C. Strother, Gaël Varoquaux, Yida Wang 0003, Tal Yarkoni, Russell A. Poldrack
PLoS Comput. Biol.18