← Authors

Vahab Mirrokni

90 papers · 2013–2025 · 9 conferences · across top CS/AI conferences

Achievements

🧭 Keyword Pioneer 🐣 Hot Topic Early Bird 🌍 Conference Polyglot (9) πŸƒ Academic Marathon (12) 🌈 Renaissance Researcher (5) πŸŒ‰ Interdisciplinary Bridge πŸ—ΊοΈ Taxonomy Completionist (26) 🐝 Cross-Pollinator (11) 🏠 Conference Loyalist (31) 🀝 Dynamic Duo (17) πŸ‘‘ Triple Crown πŸ† Keyword Champion (3) πŸ† Grand Slam πŸ”¬ Deep Specialist (17) πŸ—ƒοΈ Keyword Collector (82) πŸš€ Conference Pioneer πŸ”₯ Unstoppable (10) πŸ’Ž Century Club (90) ⚑ Prolific Year (14)

Conferences

ICML (37) NIPS (31) ICLR (6) AAAI (5) AISTATS (3) COLT (3) IJCAI (3) ALT (1) JMLR (1)

Top co-authors

Hossein Esfandiari (17) Peilin Zhong (12) Yuan Deng (11) Mohammadhossein Bateni (9) Alessandro Epasto (9) Adel Javanmard (9) Haihao Lu (8) Song Zuo (8) Gang Fu (7) Amin Karbasi (7)

Research topics

Differential Privacy (7)

Keywords

regret bound (12) approximation algorithm (12) differential privacy (10) mechanism design (9) distributed algorithm (8) revenue optimization (7) k-means clustering (5) multi-armed bandit (5) auction theory (5) online learning (4) auction mechanism (4) budget constraint (4) graph clustering (4) convex optimization (3) incentive compatibility (3) contextual bandit (3) hierarchical clustering (3) greedy algorithm (3) k-median clustering (3) combinatorial optimization (3)

Papers

Procurement Auctions via Approximately Optimal Submodular Optimization ICML 2025
Retraining with Predicted Hard Labels Provably Increases Model Accuracy ICML 2025
Best of Both Worlds: Advantages of Hybrid Graph Sequence Models ICML 2025
DiSK: Differentially Private Optimizer with Simplified Kalman Filter for Noise Reduction ICLR 2025
Mechanism Design for Large Language Models (Extended Abstract) IJCAI 2025
Synthetic Text Generation for Training Large Language Models via Gradient Matching ICML 2025
Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures ICML 2025
DeepCrossAttention: Supercharging Transformer Residual Connections ICML 2025
Improving the Variance of Differentially Private Randomized Experiments through Clustering ICML 2025
Addax: Utilizing Zeroth-Order Gradients to Improve Memory Efficiency and Performance of SGD for Fine-Tuning Language Models ICLR 2025
PolySketchFormer: Fast Transformers via Sketching Polynomial Kernels ICML 2024
PriorBoost: An Adaptive Algorithm for Learning from Aggregate Responses ICML 2024
High-Dimensional Geometric Streaming for Nearly Low Rank Data ICML 2024
Learning from Aggregate responses: Instance Level versus Bag Level Loss Functions ICLR 2024
Optimistic Rates for Learning from Label Proportions COLT 2024
Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond ICML 2024
SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization NIPS 2024
Understanding Transformer Reasoning Capabilities via Graph Algorithms NIPS 2024
MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encoding NIPS 2024
Autobidder's Dilemma: Why More Sophisticated Autobidders Lead to Worse Auction Efficiency NIPS 2024
Efficiency of the First-Price Auction in the Autobidding World NIPS 2024
Perturb-and-Project: Differentially Private Similarities and Marginals ICML 2024
A Field Guide for Pacing Budget and ROS Constraints ICML 2024
HyperAttention: Long-context Attention in Near-Linear Time ICLR 2024
Anonymous Learning via Look-Alike Clustering: A Precise Analysis of Model Generalization NIPS 2023
Learning Rate Schedules in the Presence of Distribution Shift ICML 2023
Multi-channel Autobidding with Budget and ROI Constraints ICML 2023
Robust and private stochastic linear bandits ICML 2023
Robust Budget Pacing with a Single Sample ICML 2023
Robust Load Balancing with Machine Learned Advice JMLR 2023
$k$-Means Clustering with Distance-Based Privacy NIPS 2023
Approximately Optimal Core Shapes for Tensor Decompositions ICML 2023
Replicable Clustering NIPS 2023
Differentially Private Hierarchical Clustering with Provable Approximation Guarantees ICML 2023
Pricing against a Budget and ROI Constrained Buyer AISTATS 2023
Replicable Bandits ICLR 2023
Sequential Attention for Feature Selection ICLR 2023
Label differential privacy via clustering AISTATS 2022
Near-Optimal Private and Scalable $k$-Clustering NIPS 2022
Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via Continuous-Time Systems ALT 2022
Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank NIPS 2022
Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds COLT 2022
Stars: Tera-Scale Graph Building for Clustering and Learning NIPS 2022
Massively Parallel $k$-Means Clustering for Perturbation Resilient Instances ICML 2022
Tight and Robust Private Mean Estimation with Few Users ICML 2022
Cluster Randomized Designs for One-Sided Bipartite Experiments NIPS 2022
Posted Pricing and Dynamic Prior-independent Mechanisms with Value Maximizers NIPS 2022
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth NIPS 2022
Anonymous Bandits for Multi-User Systems NIPS 2022
Regret Bounds for Batched Bandits AAAI 2021
Synthetic Design: An Optimization Approach to Experimental Design with Synthetic Controls NIPS 2021
Parallelizing Thompson Sampling NIPS 2021
Robust Auction Design in the Auto-bidding World NIPS 2021
Extreme k-Center Clustering AAAI 2021
Almost Linear Time Density Level Set Estimation via DBSCAN AAAI 2021
Adaptivity in Adaptive Submodularity COLT 2021
Regularized Online Allocation Problems: Fairness and Beyond ICML 2021
Revenue-Incentive Tradeoffs in Dynamic Reserve Pricing ICML 2021
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time ICML 2021
Smoothly Bounding User Contributions in Differential Privacy NIPS 2020
Accelerating Gradient Boosting Machines AISTATS 2020
Bandits with Adversarial Scaling ICML 2020
Robust Pricing in Dynamic Mechanism Design ICML 2020
Dual Mirror Descent for Online Allocation Problems ICML 2020
Contextual Reserve Price Optimization in Auctions via Mixed Integer Programming NIPS 2020
Optimal Approximation - Smoothness Tradeoffs for Soft-Max Functions NIPS 2020
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity ICML 2019
Preferred Deals in General Environments IJCAI 2019
Optimal Dynamic Auctions Are Virtual Welfare Maximizers AAAI 2019
Pareto Efficient Auctions with Interest Rates AAAI 2019
Variance Reduction in Bipartite Experiments through Correlation Clustering NIPS 2019
A Robust Non-Clairvoyant Dynamic Mechanism for Contextual Auctions NIPS 2019
Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions NIPS 2019
Contextual Bandits with Cross-Learning NIPS 2019
Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond NIPS 2019
Distributed Weighted Matching via Randomized Composable Coresets ICML 2019
Categorical Feature Compression via Submodular Optimization ICML 2019
Approximate Leave-One-Out for Fast Parameter Tuning in High Dimensions ICML 2018
Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy ICML 2018
Parallel and Streaming Algorithms for K-Core Decomposition ICML 2018
Accelerating Greedy Coordinate Descent Methods ICML 2018
Affinity Clustering: Hierarchical Clustering at Scale NIPS 2017
Tight Bounds for Approximate CarathΓ©odory and Beyond ICML 2017
Dynamic Revenue Sharing NIPS 2017
Dynamic Auctions with Bank Accounts IJCAI 2016
Bi-Objective Online Matching and Submodular Allocations NIPS 2016
Linear Relaxations for Finding Diverse Elements in Metric Spaces NIPS 2016
Greedy Column Subset Selection: New Bounds and Distributed Algorithms ICML 2016
Distributed Balanced Clustering via Mapping Coresets NIPS 2014
A Local Algorithm for Finding Well-Connected Clusters ICML 2013