Aleksandrs Slivkins
29 papers · 2009–2026 · 7 venues · across top CS/AI venues
This profile combines several different researchers. Authors are keyed by name, and this name's papers fall into 15 separate collaboration groups - the largest holds only 41% of them. Pick the group below that matches the researcher you mean. How a shared name is split.
Achievements are not shown for a combined profile - each one describes a single researcher's record, which this is not.
Which Aleksandrs Slivkins?
3 groups of papers that share co-authors internally but none with each other - each most likely a different researcher. Pick one to see its papers.
with Akshay Krishnamurthy, John Langford, Karthik Abinav Sankararaman
12 papers
· 2014–2026
· COLT, NeurIPS, JMLR
Hide ▲
Should You Use Your Large Language Model to Explore or Exploit?
UAI 2026
Can large language models explore in-context?
NeurIPS 2024
Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression
JMLR 2024
Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression
COLT 2023
Bandits with Knapsacks beyond the Worst Case
NeurIPS 2021
Contextual Bandits with Continuous Actions: Smoothing, Zooming, and Adapting
JMLR 2020
Efficient Contextual Bandits with Continuous Actions
NeurIPS 2020
Contextual bandits with continuous actions: Smoothing, zooming, and adapting
COLT 2019
Combinatorial Semi-Bandits with Knapsacks
AISTATS 2018
Contextual Dueling Bandits
COLT 2015
Resourceful Contextual Bandits
COLT 2014
Robust Multi-objective Learning with Mentor Feedback
COLT 2014
12 papers whose co-authors appear nowhere else under this name
Incentivizing Combinatorial Bandit Exploration
NeurIPS 2022
Constrained episodic reinforcement learning in concave-convex and knapsack settings
NeurIPS 2020
The Externalities of Exploration and How Data Diversity Helps Exploitation
COLT 2018
Contextual Bandits with Similarity Information
JMLR 2014
One Practical Algorithm for Both Stochastic and Adversarial Bandits
ICML 2014
Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem
COLT 2013
Ranked Bandits in Metric Spaces: Learning Diverse Rankings over Large Document Collections
JMLR 2013
The Best of Both Worlds: Stochastic and Adversarial Bandits
COLT 2012
Contextual Bandits with Similarity Information
COLT 2011
Monotone multi-armed bandit allocations
COLT 2011
Multi-armed bandits on implicit metric spaces
NeurIPS 2011
Adapting to the Shifting Intent of Search Queries
NeurIPS 2009