A. Pavan
10 papers · 2023–2025 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+3 more ↓ Show less ↑
π Conference Polyglot (6) π Interdisciplinary Bridge π§ Keyword Pioneer πΊοΈ Taxonomy Completionist (13) π Cross-Pollinator (8)
π
Grand Slam
β‘
Prolific Year
(5)
π
Century Club
(10)
Conferences
ICLR (2)
IJCAI (2)
NIPS (2)
UAI (2)
AAAI (1)
ICML (1)
Top co-authors
Keywords
approximation algorithm
(3)
list complexity
(2)
replicable learning
(2)
sample complexity
(2)
computational complexity
(1)
statistical query
(1)
probability distribution
(1)
sensor placement
(1)
submodular maximization
(1)
influence maximization
(1)
greedy optimization
(1)
greedy algorithm
(1)
geometric partition
(1)
sperner lemma
(1)
evolutionary algorithm
(1)
approximation scheme
(1)
approximation guarantee
(1)
submodular function
(1)
total variation distance
(1)
propositional formula
(1)
Papers
Regret-Optimal List Replicable Bandit Learning: Matching Upper and Lower Bounds
ICLR 2025
Computational Explorations of Total Variation Distance
ICLR 2025
Total Variation Distance Meets Probabilistic Inference
ICML 2024
Replicability in Learning: Geometric Partitions and KKM-Sperner Lemma
NIPS 2024
Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints
IJCAI 2024
Maximizing submodular functions under submodular constraints
UAI 2023
Constraint Optimization over Semirings
AAAI 2023
On Approximating Total Variation Distance
IJCAI 2023
Size-constrained k-submodular maximization in near-linear time
UAI 2023
List and Certificate Complexities in Replicable Learning
NIPS 2023