Vahab Mirrokni

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