Dávid Pál

2.5k citations
24 papers · 1.1k · 1 hit paper · h-index 13

Impact in

Papers in

Dávid Pál

23 papers receiving 1.1k citations

Dávid Pál's Hit Papers

Improved Algorithms for Linear Stochastic Bandits 2011 · 342 citations
3420+5+10Years since publication100200300

Peers

Dávid Pál
Comparison fields: 5 of 84
  • Management Science and Operations Research 583
  • Artificial Intelligence 718
  • Computer Networks and Communications 209
  • Marketing 80
  • Computer Vision and Pattern Recognition 162
Replace C. Perkins with:
C. Perkins United States
Vivekanand Gopalkrishnan Singapore
Erik Vee United States
Aleksandrs Slivkins United States
Denis Charles United States
Parag Singla India
Shayan Oveis Gharan United States
Ashwinkumar Badanidiyuru United States
Josh Attenberg United States
Olivier Hudry France
Dávid Pál relative to C. Perkins United States C. Perkins's profile →
Citations per field
00.5×2.8×
C. Perkins · 1×
Citations per year

Countries citing papers authored by Dávid Pál

Since Specialization
Citations

This map shows the geographic impact of Dávid Pál's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Dávid Pál with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dávid Pál more than expected).

Fields of papers citing papers by Dávid Pál

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Dávid Pál. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Dávid Pál. The network helps show where Dávid Pál may publish in the future.

Co-authors

The 25 scholars most cited alongside Dávid Pál, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Dávid Pál Line = papers co-authored together Dávid Pál links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 24 papers — load more, or switch the sort, to bring in the rest.

#Work
1
Improved Algorithms for Linear Stochastic Bandits
Hit paper breakdown →
2011342
2 2006141
3
Impossibility Theorems for Domain Adaptation
201098
4
Contextual Multi-Armed Bandits
201095
5 200778
6 200973
7 201060
8
Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning.
200857
9 201445
10
Agnostic Online Learning.
200939
11
Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits
201228
12 201218
13
Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments
201117
14 20109
15 20087
16 20156
17 20075
18
Hardness of Online Sleeping Combinatorial Optimization Problems
20163
19 20202
20
Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case
20191

About Dávid Pál

Dávid Pál is a scholar working on Artificial Intelligence, Management Science and Operations Research, Computer Networks and Communications, Computational Theory and Mathematics and Signal Processing, having authored 24 papers that have together received 1.1k indexed citations. Recurring topics across this work include Advanced Bandit Algorithms Research (13 papers), Optimization and Search Problems (10 papers), Machine Learning and Algorithms (8 papers), Bayesian Methods and Mixture Models (4 papers), Advanced Clustering Algorithms Research (2 papers), Game Theory and Applications (2 papers), Advanced Graph Theory Research (2 papers) and Reinforcement Learning in Robotics (2 papers). The work is most often cited by research in Management Science and Operations Research (583 citations), Artificial Intelligence (718 citations), Computer Networks and Communications (209 citations), Marketing (80 citations) and Computer Vision and Pattern Recognition (162 citations). Dávid Pál has collaborated with scholars based in Canada, United States and United Kingdom. Frequent co-authors include Csaba Szepesvári, Shai Ben-David, Yasin Abbasi-Yadkori, Tyler Lu, Martin Pál, Ulrike von Luxburg, Hans Ulrich Simon, Gábor Bartók, Barnabás Póczos and Gagan Aggarwal. Their work appears in journals such as Theoretical Computer Science, Graphs and Combinatorics, Mathematics of Operations Research, Lecture notes in computer science and Electronic Notes in Discrete Mathematics.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact