Demo Data from EDBT 2026 / reviewers in the wild / expert
Soroush Radpour
dblp:22/8362
· DBLP profile ↗
4ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2Software engineering, systems software and programming languages · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 2Applied, interdisciplinary, general and emerging computing · 1
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.
| Software engineering, system software, and programming languages
1 paper |
Program analysis · 77% Programming languages and type systems · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program analysis
static analysis |
0.1 | 1 | 2011 | Kind analysis for MATLAB · OOPSLA 2011 |
Programming languages and type systems
dynamic languages |
0.0 | 1 | 2011 | Kind analysis for MATLAB · OOPSLA 2011 |
Methods — techniques the papers use, named apart from their topics
abstract interpretation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Compact multi-class boosted treesabstractGradient boosted decision trees are a popular machine learning technique, in part because of their ability to give good accuracy with small models. We describe two extensions to the standard tree boosting algorithm designed to increase this advantage. The first improvement extends the boosting formalism from scalar-valued trees to vector-valued trees. This allows individual trees to be used as multiclass classifiers, rather than requiring one tree per class, and drastically reduces the model size required for multiclass problems. We also show that some other popular vector-valued gradient boosted trees modifications fit into this formulation and can be easily obtained in our implementation. The second extension, layer-by-layer boosting, takes smaller steps in function space, which is empirically shown to lead to a faster convergence and to a more compact ensemble. We have added both improvements to the open-source TensorFlow Boosted trees (TFBT) package, and we demonstrate their efficacy on a variety of multiclass datasets. We expect these extensions will be of particular interest to boosted tree applications that require small models, such as embedded devices, applications requiring fast inference, or applications desiring more interpretable models. Natalia Ponomareva 0001, Thomas Colthurst, Gilbert Hendry, Salem Haykal, Soroush Radpour |
IEEE BigData | 5 |
| 2017 | TF Boosted Trees: A Scalable TensorFlow Based Framework for Gradient Boosting
Natalia Ponomareva 0001, Soroush Radpour, Gilbert Hendry, Salem Haykal, Thomas Colthurst, Petr Mitrichev, Alexander Grushetsky |
ECML/PKDD (3) | 2 |
| 2013 | Refactoring MATLAB
Soroush Radpour, Laurie J. Hendren, Max Schäfer |
CC | 1 |
| 2011 | Kind analysis for MATLABabstractMATLAB is a popular dynamic programming language used for scientific and numerical programming. As a language, it has evolved from a small scripting language intended as an interactive interface to numerical libraries, to a very popular language supporting many language features and libraries. The overloaded syntax and dynamic nature of the language, plus the somewhat organic addition of language features over the years, makes static analysis of modern MATLAB quite challenging. A fundamental problem in MATLAB is determining the kind of an identifier. Does an identifier refer to a variable, a named function or a prefix? Although this is a trivial problem for most programming languages, it was not clear how to do this properly in MATLAB. Furthermore, there was no simple explanation of kind analysis suitable for MATLAB programmers, nor a publicly-available implementation suitable for compiler researchers. Jesse Doherty, Laurie J. Hendren, Soroush Radpour |
OOPSLA | 3 |