Dávid Pál

2.5k citations
18 papers · 790 · 1 hit paper · h-index 10

Impact in

Papers in

Dávid Pál

18 papers receiving 746 citations

Dávid Pál's Hit Papers

Improved Algorithms for Linear Stochastic Bandits 2011 · 314 citations
3140+5+10Years since publication100200300

Peers

Dávid Pál
Comparison fields: 5 of 60
  • Management Science and Operations Research 499
  • Artificial Intelligence 494
  • Computer Networks and Communications 173
  • Marketing 68
  • Computer Vision and Pattern Recognition 92
Replace Tor Lattimore with:
Tor Lattimore Canada
Denis Charles United States
Branislav Kveton United States
Parag Singla India
Eyal Even-Dar Israel
Saravanan Thirumuruganathan United States
Lan Nie United States
Debmalya Panigrahi United States
Mi-Yen Yeh Taiwan
Shayan Oveis Gharan United States
Dávid Pál relative to Tor Lattimore Canada Tor Lattimore's profile →
Citations per field
00.5×10×12.8×
Tor Lattimore · 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 21 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

18 of 18 papers shown
#Work
1
Improved Algorithms for Linear Stochastic Bandits
Hit paper breakdown →
2011314
2
Contextual Multi-Armed Bandits
201090
3
Impossibility Theorems for Domain Adaptation
201087
4 200958
5 201054
6
Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning.
200852
7
Agnostic Online Learning.
200936
8 201432
9
Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits
201226
10
Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments
201113
11 20128
12 20087
13 20075
14
Hardness of Online Sleeping Combinatorial Optimization Problems
20163
15 20202
16
Open Problem: Parameter-Free and Scale-Free Online Algorithms
20161
17 20181
18 20071

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 Electrical and Electronic Engineering, having authored 18 papers that have together received 790 indexed citations. Recurring topics across this work include Advanced Bandit Algorithms Research (9 papers), Optimization and Search Problems (7 papers), Machine Learning and Algorithms (6 papers), Data Stream Mining Techniques (2 papers), graph theory and CDMA systems (2 papers), Machine Learning and Data Classification (2 papers), Reinforcement Learning in Robotics (2 papers) and Advanced Graph Theory Research (2 papers). The work is most often cited by research in Management Science and Operations Research (499 citations), Artificial Intelligence (494 citations), Computer Networks and Communications (173 citations), Marketing (68 citations) and Computer Vision and Pattern Recognition (92 citations). Dávid Pál has collaborated with scholars based in Canada, United States and Slovakia. Frequent co-authors include Csaba Szepesvári, Yasin Abbasi-Yadkori, Tyler Lu, Shai Ben-David, Martin Pál, Barnabás Póczos, Gagan Aggarwal, S. Muthukrishnan, Gábor Bartók and Shai Shalev‐Shwartz. Their work appears in journals such as Theoretical Computer Science, Mathematics of Operations Research, Graphs and Combinatorics, Electronic Notes in Discrete Mathematics and Research Showcase @ Carnegie Mellon University (Carnegie Mellon University).

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