Anupam Gupta

16 papers · 2007–2026 · 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 ↓

+7 more ↓

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

🌱 Topic Pioneer 🌟 Keyword Trendsetter Combo (6) 🏆 Keyword Champion 🧭 Keyword Pioneer 🗃️ Keyword Collector (76) 📈 Trend Setter 💎 Century Club · Bronze

Venues

NeurIPS (8) COLT (5) JMLR (2) ICML (1)

Top co-authors

Carlos Guestrin (2) Andreas Krause (2) Debmalya Panigrahi (2) C.J. Argue (2) Jian Li (2) Lijie Chen (2) Mingda Qiao (1) Matteo Russo (1) John Lafferty (1) Stefano Leonardi (1)

Research topics

Mathematics & Optimization (15) Machine Learning (14) Optimization (14) Optimization & Theory (9) Learning Types (5) Application Areas (3) Artificial Intelligence (2) Core AI (2) Computer Science (1) Bayesian & Probabilistic (1) Core Methods (1) Foundations (1) Mathematics (1)

Keywords

online algorithm (4) regret bound (3) combinatorial optimization (3) submodular optimization (3) multi-armed bandit (3) gaussian process regression (2) mechanism design (2) sample complexity (2) approximation algorithm (2) facility location (2) sensor placement (2) experimental design (2) active selection (2) gaussian process (1) adversarial optimization (1) robust optimization (1) robust statistics (1) variance reduction (1) density estimation (1) transformer architecture (1)

Papers

Online Convex Optimization with Sublinear Noisy Probes COLT 2026 Learning-Augmented Approximation Algorithms for Maximum Cut and Related Problems NeurIPS 2024 MAC Advice for facility location mechanism design NeurIPS 2024 Position Coupling: Improving Length Generalization of Arithmetic Transformers Using Task Structure NeurIPS 2024 Randomized Truthful Auctions with Learning Agents NeurIPS 2024 Augmenting Online Algorithms with ε-Accurate Predictions NeurIPS 2022 Learning from a Sample in Online Algorithms NeurIPS 2022 The Power of Adaptivity for Stochastic Submodular Cover ICML 2021 Dimension-Free Bounds for Chasing Convex Functions COLT 2020 Neutralizing Self-Selection Bias in Sampling for Sortition NeurIPS 2020 Better Algorithms for Stochastic Bandits with Adversarial Corruptions COLT 2019 Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration COLT 2017 Pure Exploration of Multi-armed Bandit Under Matroid Constraints COLT 2016 Forest Density Estimation JMLR 2011 Robust Submodular Observation Selection JMLR 2008 Selecting Observations against Adversarial Objectives NeurIPS 2007