A. Pavan
10 papers · 2023–2025 · 6 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 ↓+1 more ↓ Show less ↑
π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Bronze πΊοΈ Taxonomy Completionist (16) π Grand Slam π Century Club Β· Bronze
β‘
Prolific Year Β· Productive
Top co-authors
Research topics
Keywords
total variation distance
(3)
approximation algorithm
(3)
sample complexity
(2)
product distribution
(2)
list complexity
(2)
replicable learning
(2)
computational complexity
(1)
pac learning
(1)
probabilistic inference
(1)
sensor placement
(1)
treewidth
(1)
submodular maximization
(1)
influence maximization
(1)
greedy optimization
(1)
lower bound
(1)
probability distribution
(1)
greedy algorithm
(1)
statistical query
(1)
regret bound
(1)
multi-armed bandit
(1)
Papers
Computational Explorations of Total Variation Distance
ICLR 2025
Regret-Optimal List Replicable Bandit Learning: Matching Upper and Lower Bounds
ICLR 2025
Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints
IJCAI 2024
Replicability in Learning: Geometric Partitions and KKM-Sperner Lemma
NeurIPS 2024
Total Variation Distance Meets Probabilistic Inference
ICML 2024
Constraint Optimization over Semirings
AAAI 2023
List and Certificate Complexities in Replicable Learning
NeurIPS 2023
Maximizing submodular functions under submodular constraints
UAI 2023
On Approximating Total Variation Distance
IJCAI 2023
Size-constrained k-submodular maximization in near-linear time
UAI 2023