Moran Feldman
18 papers · 2017–2024 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+9 more ↓ Show less ↑
🏃 Academic Marathon (7) 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🌍 Conference Polyglot (6) 🐝 Cross-Pollinator (13)
🌍
Conference Polyglot
(6)
🏃
Academic Marathon
(7)
🤝
Dynamic Duo
(14)
🔬
Deep Specialist
(12)
❓
The Questioner
(2)
📈
Trend Setter
💎
Century Club
(18)
🗃️
Keyword Collector
(60)
🔥
Unstoppable
(8)
Conferences
NIPS (8)
ICML (4)
AISTATS (3)
COLT (1)
IJCAI (1)
JMLR (1)
Top co-authors
Keywords
approximation algorithm
(10)
submodular maximization
(10)
combinatorial optimization
(6)
submodular function
(5)
submodular optimization
(4)
streaming algorithm
(4)
continuous optimization
(3)
greedy algorithm
(3)
cardinality constraint
(3)
machine learning application
(2)
movie recommendation
(2)
approximation guarantee
(2)
determinantal point process
(2)
data summarization
(2)
online algorithm
(2)
approximation ratio
(2)
query complexity
(1)
sequence optimization
(1)
constrained optimization
(1)
sequential decision
(1)
Papers
Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
NIPS 2024
Bridging the Gap between General and Down-Closed Convex Sets in Submodular Maximization
IJCAI 2024
Submodular Minimax Optimization: Finding Effective Sets
AISTATS 2024
How Do You Want Your Greedy: Simultaneous or Repeated?
JMLR 2023
Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets
AISTATS 2023
Using Partial Monotonicity in Submodular Maximization
NIPS 2022
Submodular Maximization in Clean Linear Time
NIPS 2022
Submodular + Concave
NIPS 2021
Regularized Submodular Maximization at Scale
ICML 2021
Streaming Submodular Maximization under a k-Set System Constraint
ICML 2020
Continuous Submodular Maximization: Beyond DR-Submodularity
NIPS 2020
Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications
ICML 2019
Adaptive Sequence Submodularity
NIPS 2019
Submodularity on Hypergraphs: From Sets to Sequences
AISTATS 2018
Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?
ICML 2018
Do Less, Get More: Streaming Submodular Maximization with Subsampling
NIPS 2018
Streaming Weak Submodularity: Interpreting Neural Networks on the Fly
NIPS 2017
Greed Is Good: Near-Optimal Submodular Maximization via Greedy Optimization
COLT 2017