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.

Iosif Pinelis

dblp:92/685 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0003-4742-5789ORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 since 2021Security and privacy · 1 · 1 first-authorTheory of computation · 1 · 1 first-author

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.

Theoretical computer science
1 paper
Algorithms and data structures · 44% Mathematical optimization · 44% Information theory · 13%
Network and information security
1 paper
Privacy and data protection · 100%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection
differential privacy
0.612022
Differentially Private Fractional Frequency Moments Estimation with Polylogarithmic Space · ICLR 2022
Algorithms and data structures
classification
0.412019
Exact Upper and Lower Bounds on the Misclassification Probability · IEEE Trans. Inf. Theory 2019
Mathematical optimization › regularization
total variation
0.412019
Exact Upper and Lower Bounds on the Misclassification Probability · IEEE Trans. Inf. Theory 2019
Information theory › information measures › entropy › entropy inequalities
conditional entropy bounds
0.112019
Exact Upper and Lower Bounds on the Misclassification Probability · IEEE Trans. Inf. Theory 2019

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

frequency moment estimation · 0.6differential privacy · 0.6total variation norm · 0.4conditional entropy · 0.4
YearPublicationVenuePosition
2022 Differentially Private Fractional Frequency Moments Estimation with Polylogarithmic Space
Lun Wang 0001, Iosif Pinelis, Dawn Song
ICLR2
2019 Exact Upper and Lower Bounds on the Misclassification Probability
abstract
Exact upper and lower bounds on the best possible misclassification probability for a finite number of classes are obtained in terms of the total variation norms of the differences between the sub-distributions over the classes. These bounds are compared with the exact upper and lower bounds in terms of the conditional entropy obtained by Feder and Merhav.
Iosif Pinelis
IEEE Trans. Inf. Theory1
1996 On the Minimal Number of Even Submatrices of 0-1 Matrices
Iosif Pinelis
Des. Codes Cryptogr.1