EDBT 2026 Demo / reviewers in the wild / expert
Harsh H. Pareek
dblp:137/3260
· DBLP profile ↗
4ranked-venue papers
2as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 2 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
2 papers |
Algorithmic game theory and mechanism design · 69% Logic in computer science · 16% Combinatorics and discrete mathematics · 16% | |
| Artificial intelligence
1 paper |
Kernel, tree and ensemble methods · 50% Knowledge representation and reasoning · 50% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithmic game theory and mechanism design
social choice |
0.4 | 2 | 2015 | Distributional Rank Aggregation, and an Axiomatic Analysis · ICML 2015 A Representation Theory for Ranking Functions · NIPS 2014 |
Algorithmic game theory and mechanism design › social choice › computational social choice › voting rules
positional scoring rules |
0.2 | 1 | 2015 | Distributional Rank Aggregation, and an Axiomatic Analysis · ICML 2015 |
Algorithmic game theory and mechanism design › social choice
rank aggregation |
0.2 | 1 | 2015 | Distributional Rank Aggregation, and an Axiomatic Analysis · ICML 2015 |
Logic in computer science › program analysis
ranking functions |
0.2 | 1 | 2014 | A Representation Theory for Ranking Functions · NIPS 2014 |
Combinatorics and discrete mathematics
representation theory |
0.2 | 1 | 2014 | A Representation Theory for Ranking Functions · NIPS 2014 |
Machine learning › Kernel, tree and ensemble methods › ensemble learning
boosting |
0.2 | 1 | 2013 | Human Boosting · ICML (1) 2013 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
category learning |
0.2 | 1 | 2013 | Human Boosting · ICML (1) 2013 |
Information retrieval › ranking
rank aggregation |
0.1 | 1 | 2015 | Distributional Rank Aggregation, and an Axiomatic Analysis · ICML 2015 |
Methods — techniques the papers use, named apart from their topics
axiomatic analysis · 0.6crowdsourcing · 0.2boosting · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Distributional Rank Aggregation, and an Axiomatic AnalysisabstractThe rank aggregation problem has been studied with varying desiderata in varied communities such as Theoretical Computer Science, Statistics, Information Retrieval and Social Welfare Theory. We introduce a variant of this problem we call distributional rank aggregation, where the ranking data is only available via the induced distribution over the set of all permutations. We provide a novel translation of the usual social welfare theory axioms to this setting. As we show this allows for a more quantitative characterization of these axioms: which then are not only less prone to misinterpretation, but also allow simpler proofs for some key impossibility theorems. Most importantly, these quantitative characterizations lead to natural and novel relaxations of these axioms, which as we show, allow us to get around celebrated impossibility results in social choice theory. We are able to completely characterize the class of positional scoring rules with respect to our axioms and show that Borda Count is optimal in a certain sense. Adarsh Prasad, Harsh H. Pareek, Pradeep Ravikumar |
ICML | 2 |
| 2015 | Tracking with ranked signals
Harsh H. Pareek, Pradeep Ravikumar, Dhruv Balwada, Kevin Speer |
UAI | 2 |
| 2014 | A Representation Theory for Ranking Functions
Harsh H. Pareek, Pradeep Ravikumar |
NIPS | 1 |
| 2013 | Human BoostingabstractHumans may be exceptional learners but they have biological limitations and moreover, inductive biases similar to machine learning algorithms. This puts limits on human learning ability and on the kinds of learning tasks humans can easily handle. In this paper, we consider the problem of “boosting” human learners to extend the learning ability of human learners and achieve improved performance on tasks which individual humans find difficult. We consider classification (category learning) tasks, propose a boosting algorithm for human learners and give theoretical justifications. We conduct experiments using Amazon’s Mechanical Turk on two synthetic datasets – a crosshair task with a nonlinear decision boundary and a gabor patch task with a linear boundary but which is inaccessible to human learners – and one real world dataset – the Opinion Spam detection task introduced in (Ott et al). Our results show that boosting human learners produces gains in accuracy and can overcome some fundamental limitations of human learners. Harsh H. Pareek, Pradeep Ravikumar |
ICML (1) | 1 |