Alan Kuhnle

10 papers · 2018–2025 · 4 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 ↓

+2 more ↓

🗺️ Taxonomy Completionist (10) 🌍 Conference Polyglot · Bronze 🏃 Academic Marathon · Sprint 🐣 Hot Topic Early Bird 🌉 Interdisciplinary Bridge · Bronze

🔬 Deep Specialist (10) 💎 Century Club · Bronze

Venues

ICML (3) NeurIPS (3) AAAI (2) AISTATS (2)

Top co-authors

Yixin Chen (4) Tonmoy Dey (2) Ankur Nath (2) My Thai (2) Victoria Crawford (2) Wenjing Chen (1) J. David Smith (1) Chunli Peng (1)

Research topics

Mathematics & Optimization (10) Optimization (10) Computer Science (4) Machine Learning (3) Foundations (3) Optimization & Theory (3) Systems (1)

Keywords

submodular maximization (7) cardinality constraint (5) approximation algorithm (4) query complexity (4) approximation ratio (4) greedy algorithm (3) combinatorial optimization (3) adaptive complexity (2) submodular optimization (2) distributed algorithm (1) pruning algorithm (1) parallelizable algorithm (1) matroid constraint (1) non-submodular function (1) integer lattice (1) linear time (1) deterministic algorithm (1) value oracle (1) ground set pruning (1) optimal value guarantee (1)

Papers

Breaking Barriers: Combinatorial Algorithms for Non-Monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation ICML 2025 Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization AISTATS 2025 Discretely beyond $1/e$: Guided Combinatorial Algortihms for Submodular Maximization NeurIPS 2024 DASH: A Distributed and Parallelizable Algorithm for Size-Constrained Submodular Maximization AAAI 2023 Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel NeurIPS 2021 Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization AAAI 2021 Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time AISTATS 2021 Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time NeurIPS 2019 Submodular Cost Submodular Cover with an Approximate Oracle ICML 2019 Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice ICML 2018