Federico Fusco
18 papers · 2020–2025 · 7 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+9 more ↓ Show less ↑
π Academic Marathon (5) π Interdisciplinary Bridge π§ Keyword Pioneer π Conference Polyglot (7) π Cross-Pollinator (14)
π
Cross-Pollinator
(14)
πΊοΈ
Taxonomy Completionist
(22)
π
Keyword Champion
π
Grand Slam
π
Triple Crown
π
Century Club
(18)
ποΈ
Keyword Collector
(72)
β‘
Prolific Year
(6)
π₯
Unstoppable
(6)
Conferences
ICML (6)
NIPS (6)
JMLR (2)
AAAI (1)
COLT (1)
ICLR (1)
IJCAI (1)
Top co-authors
Keywords
online learning
(6)
approximation algorithm
(6)
submodular maximization
(5)
matroid constraint
(4)
mechanism design
(3)
bilateral trade
(3)
multi-armed bandit
(3)
regret bound
(3)
data summarization
(2)
regret analysis
(2)
smoothed adversary
(2)
feedback graph
(2)
online algorithm
(2)
bandit feedback
(2)
streaming algorithm
(2)
knapsack constraint
(2)
sequential decision
(1)
decision making
(1)
multi-class classification
(1)
regret minimization
(1)
Papers
Deletion Robust Non-Monotone Submodular Maximization over Matroids
JMLR 2025
Online Learning in the Random-Order Model
ICML 2025
Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints
NIPS 2024
Online Learning with Sublinear Best-Action Queries
NIPS 2024
Pandoraβs Problem with Deadlines
AAAI 2024
Consistent Submodular Maximization
ICML 2024
Regret Analysis of Bilateral Trade with a Smoothed Adversary
JMLR 2024
Bandits with Replenishable Knapsacks: the Best of both Worlds
ICLR 2024
Fully Dynamic Submodular Maximization over Matroids
ICML 2023
Fairness in Streaming Submodular Maximization over a Matroid Constraint
ICML 2023
Repeated Bilateral Trade Against a Smoothed Adversary
COLT 2023
An $\alpha$-regret analysis of Adversarial Bilateral Trade
NIPS 2022
Learning on the Edge: Online Learning with Stochastic Feedback Graphs
NIPS 2022
Deletion Robust Submodular Maximization over Matroids
ICML 2022
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
ICML 2021
Beyond Bandit Feedback in Online Multiclass Classification
NIPS 2021
Online Revenue Maximization for Server Pricing
IJCAI 2020
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
NIPS 2020