Christopher John Quinn
8 papers · 2022–2025 · 5 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓
π
Conference Polyglot Β· Silver
π
Interdisciplinary Bridge Β· Bronze
πΊοΈ
Taxonomy Completionist
(14)
π
Grand Slam
π
Triple Crown
Venues
Top co-authors
Research topics
Keywords
regret bound
(5)
submodular maximization
(3)
submodular optimization
(2)
stochastic optimization
(2)
online optimization
(2)
bandit feedback
(2)
multi-armed bandit
(2)
sublinear regret
(2)
constraint violation
(2)
combinatorial multi-armed bandit
(2)
stochastic greedy algorithm
(1)
sequential decision making
(1)
influence maximization
(1)
sparse gaussian processes
(1)
greedy optimization
(1)
offline algorithm adaptation
(1)
combinatorial optimization
(1)
approximation algorithm
(1)
causal logistic bandits
(1)
counterfactual fairness
(1)
Papers
Causal Logistic Bandits with Counterfactual Fairness Constraints
ICML 2025
Combinatorial Stochastic-Greedy Bandit
AAAI 2024
Conditionally-Conjugate Gaussian Process Factor Analysis for Spike Count Data via Data Augmentation
ICML 2024
Gradient Methods for Online DR-Submodular Maximization with Stochastic Long-Term Constraints
NeurIPS 2024
Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization
ICLR 2024
A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback
ICML 2023
Size-constrained k-submodular maximization in near-linear time
UAI 2023
An explore-then-commit algorithm for submodular maximization under full-bandit feedback
UAI 2022